2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)memalloc.h 8.2 (Berkeley) 5/4/95
37 * $FreeBSD: src/bin/sh/memalloc.h,v 1.18 2011/01/09 22:47:58 jilles Exp $
43 struct stack_block *stackp;
46 struct stackmark *marknext;
50 extern char *stacknxt;
51 extern int stacknleft;
54 pointer ckmalloc(size_t);
55 pointer ckrealloc(pointer, int);
57 char *savestr(const char *);
59 void stunalloc(pointer);
60 void setstackmark(struct stackmark *);
61 void popstackmark(struct stackmark *);
62 char *growstackstr(void);
63 char *makestrspace(int, char *);
64 char *stputbin(const char *data, int len, char *p);
65 char *stputs(const char *data, char *p);
69 #define stackblock() stacknxt
70 #define stackblocksize() stacknleft
71 #define grabstackblock(n) stalloc(n)
72 #define STARTSTACKSTR(p) p = stackblock()
73 #define STPUTC(c, p) do { if (p == sstrend) p = growstackstr(); *p++ = (c); } while(0)
74 #define CHECKSTRSPACE(n, p) { if (sstrend - p < n) p = makestrspace(n, p); }
75 #define USTPUTC(c, p) (*p++ = (c))
77 * STACKSTRNUL's use is where we want to be able to turn a stack
78 * (non-sentinel, character counting string) into a C string,
79 * and later pretend the NUL is not there.
80 * Note: Because of STACKSTRNUL's semantics, STACKSTRNUL cannot be used
81 * on a stack that will grabstackstr()ed.
83 #define STACKSTRNUL(p) (p == sstrend ? (p = growstackstr(), *p = '\0') : (*p = '\0'))
84 #define STUNPUTC(p) (--p)
85 #define STTOPC(p) p[-1]
86 #define STADJUST(amount, p) (p += (amount))
87 #define grabstackstr(p) stalloc((char *)p - stackblock())
88 #define ungrabstackstr(s, p) stunalloc((s))
89 #define STPUTBIN(s, len, p) p = stputbin((s), (len), p)
90 #define STPUTS(s, p) p = stputs((s), p)