9 #define kroundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x))
13 #define KSTRING_T kstring_t
14 typedef struct __kstring_t {
20 int ksprintf(kstring_t *s, const char *fmt, ...);
21 int ksplit_core(char *s, int delimiter, int *_max, int **_offsets);
23 // calculate the auxiliary array, allocated by calloc()
24 int *ksBM_prep(const uint8_t *pat, int m);
26 /* Search pat in str and returned the list of matches. The size of the
27 * list is returned as n_matches. _prep is the array returned by
28 * ksBM_prep(). If it is a NULL pointer, ksBM_prep() will be called. */
29 int *ksBM_search(const uint8_t *str, int n, const uint8_t *pat, int m, int *_prep, int *n_matches);
31 static inline int kputsn(const char *p, int l, kstring_t *s)
33 if (s->l + l + 1 >= s->m) {
36 s->s = (char*)realloc(s->s, s->m);
38 strncpy(s->s + s->l, p, l);
44 static inline int kputs(const char *p, kstring_t *s)
46 return kputsn(p, strlen(p), s);
49 static inline int kputc(int c, kstring_t *s)
51 if (s->l + 1 >= s->m) {
54 s->s = (char*)realloc(s->s, s->m);
61 static inline int kputw(int c, kstring_t *s)
65 if (c == 0) return kputc('0', s);
66 for (l = 0, x = c < 0? -c : c; x > 0; x /= 10) buf[l++] = x%10 + '0';
67 if (c < 0) buf[l++] = '-';
68 if (s->l + l + 1 >= s->m) {
71 s->s = (char*)realloc(s->s, s->m);
73 for (x = l - 1; x >= 0; --x) s->s[s->l++] = buf[x];
78 static inline int kputuw(unsigned c, kstring_t *s)
83 if (c == 0) return kputc('0', s);
84 for (l = 0, x = c; x > 0; x /= 10) buf[l++] = x%10 + '0';
85 if (s->l + l + 1 >= s->m) {
88 s->s = (char*)realloc(s->s, s->m);
90 for (i = l - 1; i >= 0; --i) s->s[s->l++] = buf[i];
95 static inline int *ksplit(kstring_t *s, int delimiter, int *n)
97 int max = 0, *offsets = 0;
98 *n = ksplit_core(s->s, delimiter, &max, &offsets);