| 1 | /* $NetBSD: memalloc.h,v 1.14 2003/08/07 09:05:34 agc Exp $ */
|
|---|
| 2 |
|
|---|
| 3 | /*-
|
|---|
| 4 | * Copyright (c) 1991, 1993
|
|---|
| 5 | * The Regents of the University of California. All rights reserved.
|
|---|
| 6 | *
|
|---|
| 7 | * This code is derived from software contributed to Berkeley by
|
|---|
| 8 | * Kenneth Almquist.
|
|---|
| 9 | *
|
|---|
| 10 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 11 | * modification, are permitted provided that the following conditions
|
|---|
| 12 | * are met:
|
|---|
| 13 | * 1. Redistributions of source code must retain the above copyright
|
|---|
| 14 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 15 | * 2. Redistributions in binary form must reproduce the above copyright
|
|---|
| 16 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 17 | * documentation and/or other materials provided with the distribution.
|
|---|
| 18 | * 3. Neither the name of the University nor the names of its contributors
|
|---|
| 19 | * may be used to endorse or promote products derived from this software
|
|---|
| 20 | * without specific prior written permission.
|
|---|
| 21 | *
|
|---|
| 22 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|---|
| 23 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|---|
| 24 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|---|
| 25 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|---|
| 26 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|---|
| 27 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|---|
| 28 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|---|
| 29 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 30 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|---|
| 31 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|---|
| 32 | * SUCH DAMAGE.
|
|---|
| 33 | *
|
|---|
| 34 | * @(#)memalloc.h 8.2 (Berkeley) 5/4/95
|
|---|
| 35 | */
|
|---|
| 36 |
|
|---|
| 37 | struct stackmark {
|
|---|
| 38 | struct stack_block *stackp;
|
|---|
| 39 | char *stacknxt;
|
|---|
| 40 | int stacknleft;
|
|---|
| 41 | #ifdef KASH_SEPARATE_PARSER_ALLOCATOR
|
|---|
| 42 | unsigned pstacksize;
|
|---|
| 43 | #endif
|
|---|
| 44 | struct stackmark *marknext;
|
|---|
| 45 | };
|
|---|
| 46 |
|
|---|
| 47 |
|
|---|
| 48 | /*extern char *stacknxt;
|
|---|
| 49 | extern int stacknleft;
|
|---|
| 50 | extern int sstrnleft;
|
|---|
| 51 | extern int herefd;*/
|
|---|
| 52 |
|
|---|
| 53 | pointer ckmalloc(struct shinstance *, size_t);
|
|---|
| 54 | pointer ckrealloc(struct shinstance *, pointer, size_t);
|
|---|
| 55 | char *savestr(struct shinstance *, const char *);
|
|---|
| 56 | #define ckfree(psh, p) sh_free(psh, (pointer)(p))
|
|---|
| 57 |
|
|---|
| 58 | #ifndef SH_MEMALLOC_NO_STACK
|
|---|
| 59 | pointer stalloc(struct shinstance *, size_t);
|
|---|
| 60 | char *stsavestr(struct shinstance *, const char *);
|
|---|
| 61 | void stunalloc(struct shinstance *, pointer);
|
|---|
| 62 | void setstackmark(struct shinstance *, struct stackmark *);
|
|---|
| 63 | void popstackmark(struct shinstance *, struct stackmark *);
|
|---|
| 64 | void growstackblock(struct shinstance *);
|
|---|
| 65 | void grabstackblock(struct shinstance *, int);
|
|---|
| 66 | char *growstackstr(struct shinstance *);
|
|---|
| 67 | char *makestrspace(struct shinstance *);
|
|---|
| 68 | char *grabstackstr(struct shinstance *, char *); /* was #define using stalloc */
|
|---|
| 69 | void ungrabstackstr(struct shinstance *, char *, char *);
|
|---|
| 70 |
|
|---|
| 71 | #define stackblock(psh) (psh)->stacknxt
|
|---|
| 72 | #define stackblocksize(psh) (psh)->stacknleft
|
|---|
| 73 | #define STARTSTACKSTR(psh, p) p = stackblock(psh), (psh)->sstrnleft = stackblocksize(psh)
|
|---|
| 74 | #define STPUTC(psh, c, p) (--(psh)->sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(psh), *p++ = (c)))
|
|---|
| 75 | #define CHECKSTRSPACE(psh, n, p) { if ((psh)->sstrnleft < n) p = makestrspace(psh); }
|
|---|
| 76 | #define USTPUTC(psh, c, p) do { kHlpAssert((psh)->sstrnleft > 0); \
|
|---|
| 77 | kHlpAssert(p - (char *)stackblock(psh) == stackblocksize(psh) - (psh)->sstrnleft); \
|
|---|
| 78 | --(psh)->sstrnleft; *p++ = (c); } while (0)
|
|---|
| 79 | #define STACKSTRNUL(psh, p) ((psh)->sstrnleft == 0? (p = growstackstr(psh), *p = '\0') : (*p = '\0'))
|
|---|
| 80 | #define STUNPUTC(psh, p) (++(psh)->sstrnleft, --p)
|
|---|
| 81 | #define STADJUST(psh, amount, p) (p += (amount), (psh)->sstrnleft -= (amount))
|
|---|
| 82 | #endif /* SH_MEMALLOC_NO_STACK */
|
|---|
| 83 |
|
|---|
| 84 | /** @name Stack allocator for parser.
|
|---|
| 85 | * This is a stripped down version of the general stack allocator interface for
|
|---|
| 86 | * the exclusive use of the parser, so that parsetrees can be shared with
|
|---|
| 87 | * subshells by simple reference counting.
|
|---|
| 88 | * @{ */
|
|---|
| 89 | #ifdef KASH_SEPARATE_PARSER_ALLOCATOR
|
|---|
| 90 | struct pstack_block;
|
|---|
| 91 | unsigned pstackretain(struct pstack_block *);
|
|---|
| 92 | void pstackpop(struct shinstance *, unsigned);
|
|---|
| 93 | unsigned pstackrelease(struct shinstance *, struct pstack_block *, const char *);
|
|---|
| 94 | unsigned pstackretainpush(struct shinstance *, struct pstack_block *);
|
|---|
| 95 | struct pstack_block *pstackallocpush(struct shinstance *);
|
|---|
| 96 | void pstackmarkdone(struct pstack_block *);
|
|---|
| 97 | #endif
|
|---|
| 98 | void *pstalloc(struct shinstance *, size_t);
|
|---|
| 99 | union node;
|
|---|
| 100 | union node *pstallocnode(struct shinstance *, size_t);
|
|---|
| 101 | struct nodelist;
|
|---|
| 102 | struct nodelist *pstalloclist(struct shinstance *);
|
|---|
| 103 | char *pstsavestr(struct shinstance *, const char *); /* was: stsavestr */
|
|---|
| 104 | char *pstmakestrspace(struct shinstance *, size_t, char *); /* was: makestrspace / growstackstr */
|
|---|
| 105 | char *pstputcgrow(struct shinstance *, char *, char);
|
|---|
| 106 | char *pstgrabstr(struct shinstance *, char *); /* was: grabstackstr / grabstackblock*/
|
|---|
| 107 | #ifdef KASH_SEPARATE_PARSER_ALLOCATOR
|
|---|
| 108 | # define PSTBLOCK(psh) ((psh)->curpstack->nextbyte)
|
|---|
| 109 | # define PSTARTSTACKSTR(psh, p) do { \
|
|---|
| 110 | pstack_block *pstmacro = (psh)->curpstack; \
|
|---|
| 111 | pstmacro->strleft = pstmacro->avail; \
|
|---|
| 112 | (p) = pstmacro->nextbyte; \
|
|---|
| 113 | } while (0)
|
|---|
| 114 | # define PSTCHECKSTRSPACE(psh, n, p) do { \
|
|---|
| 115 | if ((psh)->curpstack->strleft >= (n)) {/*likely*/} \
|
|---|
| 116 | else { (p) = pstmakestrspace(psh, (n), (p)); kHlpAssert((psh)->curpstack->strleft >= (n)); } \
|
|---|
| 117 | } while (0)
|
|---|
| 118 | # define PSTUPUTC(psh, c, p) do { \
|
|---|
| 119 | kHlpAssert((psh)->curpstack->strleft > 0); \
|
|---|
| 120 | (psh)->curpstack->strleft -= 1; \
|
|---|
| 121 | *(p)++ = (c); \
|
|---|
| 122 | } while (0)
|
|---|
| 123 | # define PSTPUTC(psh, c, p) do { \
|
|---|
| 124 | if ((ssize_t)--(psh)->curpstack->strleft >= 0) *(p)++ = (c); \
|
|---|
| 125 | else (p) = pstputcgrow(psh, (p), (c)); \
|
|---|
| 126 | } while (0)
|
|---|
| 127 | # define PSTPUTSTRN(psh, str, n, p) do { \
|
|---|
| 128 | pstack_block *pstmacro = (psh)->curpstack; \
|
|---|
| 129 | if (pstmacro->strleft >= (size_t)(n)) {/*likely?*/} \
|
|---|
| 130 | else (p) = pstmakestrspace(psh, (n), (p)); \
|
|---|
| 131 | pstmacro->strleft -= (n); \
|
|---|
| 132 | memcpy((p), (str), (n)); \
|
|---|
| 133 | (p) += (n); \
|
|---|
| 134 | } while (0)
|
|---|
| 135 | #else
|
|---|
| 136 | # define PSTBLOCK(psh) ((psh)->stacknxt)
|
|---|
| 137 | # define PSTARTSTACKSTR(psh, p) do { (p) = (psh)->stacknxt; (psh)->sstrnleft = (psh)->stacknleft; } while (0)
|
|---|
| 138 | # define PSTCHECKSTRSPACE(psh, n, p) do { if ((psh)->sstrnleft >= (n)) {/*likely*/} \
|
|---|
| 139 | else { (p) = pstmakestrspace(psh, (n), (p)); kHlpAssert((psh)->sstrnleft >= (n)); } } while (0)
|
|---|
| 140 | # define PSTUPUTC(psh, c, p) do { kHlpAssert((psh)->sstrnleft > 0); --(psh)->sstrnleft; *(p)++ = (c); } while (0)
|
|---|
| 141 | # define PSTPUTC(psh, c, p) do { if (--(psh)->sstrnleft >= 0) *(p)++ = (c); else (p) = pstputcgrow(psh, (p), (c)); } while (0)
|
|---|
| 142 | # define PSTPUTSTRN(psh, str, n, p) do { if ((psh)->sstrnleft >= (size_t)(n)) {/*likely?*/} else (p) = pstmakestrspace(psh, (n), (p)); \
|
|---|
| 143 | memcpy((p), (str), (n)); (psh)->sstrnleft -= (n); (p) += (n); } while (0)
|
|---|
| 144 | #endif
|
|---|
| 145 | /** @} */
|
|---|
| 146 |
|
|---|
| 147 |
|
|---|
