1 /*-
2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1997-2005
5 * Herbert Xu <herbert@gondor.apana.org.au>. 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 #include <stddef.h>
38 #include <stdlib.h>
39
40 struct stackmark {
41 struct stack_block *stackp;
42 char *stacknxt;
43 size_t stacknleft;
44 };
45
46
47 extern char *stacknxt;
48 extern size_t stacknleft;
49 extern char *sstrend;
50
51 pointer ckmalloc(size_t);
52 pointer ckrealloc(pointer, size_t);
53 char *savestr(const char *);
54 pointer stalloc(size_t);
55 void stunalloc(pointer);
56 void pushstackmark(struct stackmark *mark, size_t len);
57 void setstackmark(struct stackmark *);
58 void popstackmark(struct stackmark *);
59 void growstackblock(void);
60 void *growstackstr(void);
61 char *makestrspace(size_t, char *);
62 char *stnputs(const char *, size_t, char *);
63 char *stputs(const char *, char *);
64
65
grabstackblock(size_t len)66 static inline void grabstackblock(size_t len)
67 {
68 stalloc(len);
69 }
70
_STPUTC(int c,char * p)71 static inline char *_STPUTC(int c, char *p) {
72 if (p == sstrend)
73 p = growstackstr();
74 *p++ = c;
75 return p;
76 }
77
78 #define stackblock() ((void *)stacknxt)
79 #define stackblocksize() stacknleft
80 #define STARTSTACKSTR(p) ((p) = stackblock())
81 #define STPUTC(c, p) ((p) = _STPUTC((c), (p)))
82 #define CHECKSTRSPACE(n, p) \
83 ({ \
84 char *q = (p); \
85 size_t l = (n); \
86 size_t m = sstrend - q; \
87 if (l > m) \
88 (p) = makestrspace(l, q); \
89 0; \
90 })
91 #define USTPUTC(c, p) (*p++ = (c))
92 #define STACKSTRNUL(p) ((p) == sstrend? (p = growstackstr(), *p = '\0') : (*p = '\0'))
93 #define STUNPUTC(p) (--p)
94 #define STTOPC(p) p[-1]
95 #define STADJUST(amount, p) (p += (amount))
96
97 #define grabstackstr(p) stalloc((char *)(p) - (char *)stackblock())
98 #define ungrabstackstr(s, p) stunalloc((s))
99 #define stackstrend() ((void *)sstrend)
100
101 #define ckfree(p) free((pointer)(p))
102