3 Copyright (c) by Attractive Chaos <attractor@live.co.uk>
5 Permission is hereby granted, free of charge, to any person obtaining
6 a copy of this software and associated documentation files (the
7 "Software"), to deal in the Software without restriction, including
8 without limitation the rights to use, copy, modify, merge, publish,
9 distribute, sublicense, and/or sell copies of the Software, and to
10 permit persons to whom the Software is furnished to do so, subject to
11 the following conditions:
13 The above copyright notice and this permission notice shall be
14 included in all copies or substantial portions of the Software.
16 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
17 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
18 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
19 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
20 BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
21 ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
22 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
34 #define kroundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x))
38 #define KSTRING_T kstring_t
39 typedef struct __kstring_t {
48 const char *p; // end of the current token
55 int ksprintf(kstring_t *s, const char *fmt, ...);
56 int ksplit_core(char *s, int delimiter, int *_max, int **_offsets);
57 char *kstrstr(const char *str, const char *pat, int **_prep);
58 char *kstrnstr(const char *str, const char *pat, int n, int **_prep);
59 void *kmemmem(const void *_str, int n, const void *_pat, int m, int **_prep);
61 /* kstrtok() is similar to strtok_r() except that str is not
62 * modified and both str and sep can be NULL. For efficiency, it is
63 * actually recommended to set both to NULL in the subsequent calls
64 * if sep is not changed. */
65 char *kstrtok(const char *str, const char *sep, ks_tokaux_t *aux);
71 static inline void ks_resize(kstring_t *s, size_t size)
76 s->s = (char*)realloc(s->s, s->m);
80 static inline int kputsn(const char *p, int l, kstring_t *s)
82 if (s->l + l + 1 >= s->m) {
85 s->s = (char*)realloc(s->s, s->m);
87 memcpy(s->s + s->l, p, l);
93 static inline int kputs(const char *p, kstring_t *s)
95 return kputsn(p, strlen(p), s);
98 static inline int kputc(int c, kstring_t *s)
100 if (s->l + 1 >= s->m) {
103 s->s = (char*)realloc(s->s, s->m);
110 static inline int kputw(int c, kstring_t *s)
114 if (c == 0) return kputc('0', s);
115 if(c < 0) for (l = 0, x = c; x < 0; x /= 10) buf[l++] = '0' - (x%10);
116 else for (l = 0, x = c; x > 0; x /= 10) buf[l++] = x%10 + '0';
117 if (c < 0) buf[l++] = '-';
118 if (s->l + l + 1 >= s->m) {
121 s->s = (char*)realloc(s->s, s->m);
123 for (x = l - 1; x >= 0; --x) s->s[s->l++] = buf[x];
128 static inline int kputuw(unsigned c, kstring_t *s)
133 if (c == 0) return kputc('0', s);
134 for (l = 0, x = c; x > 0; x /= 10) buf[l++] = x%10 + '0';
135 if (s->l + l + 1 >= s->m) {
138 s->s = (char*)realloc(s->s, s->m);
140 for (i = l - 1; i >= 0; --i) s->s[s->l++] = buf[i];
145 static inline int *ksplit(kstring_t *s, int delimiter, int *n)
147 int max = 0, *offsets = 0;
148 *n = ksplit_core(s->s, delimiter, &max, &offsets);