1 #define VEC_STRUCT(typename, inttype) \
7 #define VEC_INIT(ctl) memset(&ctl, 0, sizeof(ctl))
9 #define VEC_ADD(ctl, val) { \
12 (ctl).buf = malloc(8 * sizeof(val)); \
13 } else if ((ctl).len >= (ctl).alen) { \
15 (ctl).buf = realloc((ctl).buf, (ctl).alen * sizeof(val)); \
17 (ctl).buf[(ctl).len++] = val; \
20 #define VEC_ADDN(ctl, valt, n) { \
23 (ctl).buf = malloc(8 * sizeof(valt)); \
25 size_t nlen = (ctl).alen; \
26 while ((ctl).len + n > nlen) \
28 if (nlen > (ctl).alen) { \
30 (ctl).buf = realloc((ctl).buf, nlen * sizeof(valt)); \
35 #define VEC_FREE(ctl) { free((ctl).buf); memset(&(ctl), 0, sizeof((ctl))); }
37 #define VEC_LENGTH(ctl) ((ctl).len)
38 #define VEC_BUF(ctl, num) ((ctl).buf[num])