1 /* $NetBSD: expand.h,v 1.7 2018/05/08 16:37:59 kamil Exp $ */ 2 3 /* 4 * Expanding strings 5 */ 6 /* $Id: expand.h,v 1.7 2018/05/08 16:37:59 kamil Exp $ */ 7 8 #define X_EXTRA 8 /* this many extra bytes in X string */ 9 10 typedef struct XString { 11 char *end, *beg; /* end, begin of string */ 12 size_t len; /* length */ 13 Area *areap; /* area to allocate/free from */ 14 } XString; 15 16 typedef char * XStringP; 17 18 /* initialize expandable string */ 19 #define Xinit(xs, xp, length, area) do { \ 20 (xs).len = length; \ 21 (xs).areap = (area); \ 22 (xs).beg = alloc((xs).len + X_EXTRA, (xs).areap); \ 23 (xs).end = (xs).beg + (xs).len; \ 24 xp = (xs).beg; \ 25 __USE(xp); \ 26 } while (0) 27 28 /* stuff char into string */ 29 #define Xput(xs, xp, c) (*xp++ = (c)) 30 31 /* check if there are at least n bytes left */ 32 #define XcheckN(xs, xp, n) do { \ 33 int more = ((xp) + (n)) - (xs).end; \ 34 if (more > 0) \ 35 xp = Xcheck_grow_(&xs, xp, more); \ 36 } while (0) 37 38 /* check for overflow, expand string */ 39 #define Xcheck(xs, xp) XcheckN(xs, xp, 1) 40 41 /* free string */ 42 #define Xfree(xs, xp) afree((void*) (xs).beg, (xs).areap) 43 44 /* close, return string */ 45 #define Xclose(xs, xp) (char*) aresize((void*)(xs).beg, \ 46 (size_t)((xp) - (xs).beg), (xs).areap) 47 /* begin of string */ 48 #define Xstring(xs, xp) ((xs).beg) 49 50 #define Xnleft(xs, xp) ((xs).end - (xp)) /* may be less than 0 */ 51 #define Xlength(xs, xp) ((xp) - (xs).beg) 52 #define Xsize(xs, xp) ((xs).end - (xs).beg) 53 #define Xsavepos(xs, xp) ((xp) - (xs).beg) 54 #define Xrestpos(xs, xp, n) ((xs).beg + (n)) 55 56 char * Xcheck_grow_ ARGS((XString *xsp, char *xp, int more)); 57 58 /* 59 * expandable vector of generic pointers 60 */ 61 62 typedef struct XPtrV { 63 void **cur; /* next avail pointer */ 64 void **beg, **end; /* begin, end of vector */ 65 } XPtrV; 66 67 #define XPinit(x, n) do { \ 68 void **vp__; \ 69 vp__ = (void**) alloc(sizeofN(void*, n), ATEMP); \ 70 (x).cur = (x).beg = vp__; \ 71 (x).end = vp__ + n; \ 72 } while (0) 73 74 #define XPput(x, p) do { \ 75 if ((x).cur >= (x).end) { \ 76 int n = XPsize(x); \ 77 (x).beg = (void**) aresize((void*) (x).beg, \ 78 sizeofN(void*, n*2), ATEMP); \ 79 (x).cur = (x).beg + n; \ 80 (x).end = (x).cur + n; \ 81 } \ 82 *(x).cur++ = (p); \ 83 } while (0) 84 85 #define XPptrv(x) ((x).beg) 86 #define XPsize(x) ((x).cur - (x).beg) 87 88 #define XPclose(x) (void**) aresize((void*)(x).beg, \ 89 sizeofN(void*, XPsize(x)), ATEMP) 90 91 #define XPfree(x) afree((void*) (x).beg, ATEMP) 92