a34b05d2e6
This opens an OpenBSD-mirabile (aka MirBSD) repository. ### MirBSD is: # Copyright (c) 1982-2003 by Thorsten "mirabile" Glaser <x86@ePost.de> # Copyright © 1968-2003 The authors of And contributors to UNIX®, the # C Language, BSD/Berkeley Unix; 386BSD, NetBSD 1.1 and OpenBSD. # # Anyone who obtained a copy of this work is hereby permitted to freely use, # distribute, modify, merge, sublicence, give away or sell it as long as the # authors are given due credit and the following notice is retained: # # This work is provided "as is", with no explicit or implicit warranty what- # soever. Use it only at your own risk. In no event may an author or contri- # butor be held liable for any damage, directly or indirectly, that origina- # ted through or is caused by creation or modification of this work. MirBSD is my private tree. MirBSD does not differ very much from OpenBSD and intentionally tracks OpenBSD. That's why it _is_ OpenBSD, just not the official one. It's like with DarrenBSD. At time of this writing, no advertising for MirBSD must be done, because the advertising clause has not yet been sorted out. http://templeofhate.com/tglaser/MirBSD/index.php
108 lines
2.8 KiB
C
108 lines
2.8 KiB
C
/* $OpenBSD: expand.h,v 1.3 2001/03/26 16:19:45 todd Exp $ */
|
|
|
|
/*
|
|
* Expanding strings
|
|
*/
|
|
|
|
#define X_EXTRA 8 /* this many extra bytes in X string */
|
|
|
|
#if 0 /* Usage */
|
|
XString xs;
|
|
char *xp;
|
|
|
|
Xinit(xs, xp, 128, ATEMP); /* allocate initial string */
|
|
while ((c = generate()) {
|
|
Xcheck(xs, xp); /* expand string if necessary */
|
|
Xput(xs, xp, c); /* add character */
|
|
}
|
|
return Xclose(xs, xp); /* resize string */
|
|
/*
|
|
* NOTE:
|
|
* The Xcheck and Xinit macros have a magic + X_EXTRA in the lengths.
|
|
* This is so that you can put up to X_EXTRA characters in a XString
|
|
* before calling Xcheck. (See yylex in lex.c)
|
|
*/
|
|
#endif /* 0 */
|
|
|
|
typedef struct XString {
|
|
char *end, *beg; /* end, begin of string */
|
|
size_t len; /* length */
|
|
Area *areap; /* area to allocate/free from */
|
|
} XString;
|
|
|
|
typedef char * XStringP;
|
|
|
|
/* initialize expandable string */
|
|
#define Xinit(xs, xp, length, area) do { \
|
|
(xs).len = length; \
|
|
(xs).areap = (area); \
|
|
(xs).beg = alloc((xs).len + X_EXTRA, (xs).areap); \
|
|
(xs).end = (xs).beg + (xs).len; \
|
|
xp = (xs).beg; \
|
|
} while (0)
|
|
|
|
/* stuff char into string */
|
|
#define Xput(xs, xp, c) (*xp++ = (c))
|
|
|
|
/* check if there are at least n bytes left */
|
|
#define XcheckN(xs, xp, n) do { \
|
|
int more = ((xp) + (n)) - (xs).end; \
|
|
if (more > 0) \
|
|
xp = Xcheck_grow_(&xs, xp, more); \
|
|
} while (0)
|
|
|
|
/* check for overflow, expand string */
|
|
#define Xcheck(xs, xp) XcheckN(xs, xp, 1)
|
|
|
|
/* free string */
|
|
#define Xfree(xs, xp) afree((void*) (xs).beg, (xs).areap)
|
|
|
|
/* close, return string */
|
|
#define Xclose(xs, xp) (char*) aresize((void*)(xs).beg, \
|
|
(size_t)((xp) - (xs).beg), (xs).areap)
|
|
/* begin of string */
|
|
#define Xstring(xs, xp) ((xs).beg)
|
|
|
|
#define Xnleft(xs, xp) ((xs).end - (xp)) /* may be less than 0 */
|
|
#define Xlength(xs, xp) ((xp) - (xs).beg)
|
|
#define Xsize(xs, xp) ((xs).end - (xs).beg)
|
|
#define Xsavepos(xs, xp) ((xp) - (xs).beg)
|
|
#define Xrestpos(xs, xp, n) ((xs).beg + (n))
|
|
|
|
char * Xcheck_grow_ ARGS((XString *xsp, char *xp, int more));
|
|
|
|
/*
|
|
* expandable vector of generic pointers
|
|
*/
|
|
|
|
typedef struct XPtrV {
|
|
void **cur; /* next avail pointer */
|
|
void **beg, **end; /* begin, end of vector */
|
|
} XPtrV;
|
|
|
|
#define XPinit(x, n) do { \
|
|
register void **vp__; \
|
|
vp__ = (void**) alloc(sizeofN(void*, n), ATEMP); \
|
|
(x).cur = (x).beg = vp__; \
|
|
(x).end = vp__ + n; \
|
|
} while (0)
|
|
|
|
#define XPput(x, p) do { \
|
|
if ((x).cur >= (x).end) { \
|
|
int n = XPsize(x); \
|
|
(x).beg = (void**) aresize((void*) (x).beg, \
|
|
sizeofN(void*, n*2), ATEMP); \
|
|
(x).cur = (x).beg + n; \
|
|
(x).end = (x).cur + n; \
|
|
} \
|
|
*(x).cur++ = (p); \
|
|
} while (0)
|
|
|
|
#define XPptrv(x) ((x).beg)
|
|
#define XPsize(x) ((x).cur - (x).beg)
|
|
|
|
#define XPclose(x) (void**) aresize((void*)(x).beg, \
|
|
sizeofN(void*, XPsize(x)), ATEMP)
|
|
|
|
#define XPfree(x) afree((void*) (x).beg, ATEMP)
|