memalloc.h revision 1.19 1 1.19 kre /* $NetBSD: memalloc.h,v 1.19 2021/10/26 00:05:38 kre Exp $ */
2 1.9 cgd
3 1.1 cgd /*-
4 1.5 jtc * Copyright (c) 1991, 1993
5 1.5 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Kenneth Almquist.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.14 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd *
34 1.10 christos * @(#)memalloc.h 8.2 (Berkeley) 5/4/95
35 1.1 cgd */
36 1.1 cgd
37 1.1 cgd struct stackmark {
38 1.1 cgd struct stack_block *stackp;
39 1.1 cgd char *stacknxt;
40 1.1 cgd int stacknleft;
41 1.17 kre int sstrnleft;
42 1.11 christos struct stackmark *marknext;
43 1.1 cgd };
44 1.1 cgd
45 1.1 cgd
46 1.1 cgd extern char *stacknxt;
47 1.1 cgd extern int stacknleft;
48 1.1 cgd extern int sstrnleft;
49 1.1 cgd extern int herefd;
50 1.1 cgd
51 1.15 matt pointer ckmalloc(size_t);
52 1.12 christos pointer ckrealloc(pointer, int);
53 1.13 dsl char *savestr(const char *);
54 1.12 christos pointer stalloc(int);
55 1.12 christos void stunalloc(pointer);
56 1.12 christos void setstackmark(struct stackmark *);
57 1.12 christos void popstackmark(struct stackmark *);
58 1.18 kre void rststackmark(struct stackmark *);
59 1.12 christos void growstackblock(void);
60 1.12 christos void grabstackblock(int);
61 1.12 christos char *growstackstr(void);
62 1.12 christos char *makestrspace(void);
63 1.12 christos void ungrabstackstr(char *, char *);
64 1.19 kre char *ststrcat(size_t *, ...);
65 1.1 cgd
66 1.1 cgd
67 1.1 cgd
68 1.1 cgd #define stackblock() stacknxt
69 1.1 cgd #define stackblocksize() stacknleft
70 1.1 cgd #define STARTSTACKSTR(p) p = stackblock(), sstrnleft = stackblocksize()
71 1.1 cgd #define STPUTC(c, p) (--sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(), *p++ = (c)))
72 1.10 christos #define CHECKSTRSPACE(n, p) { if (sstrnleft < n) p = makestrspace(); }
73 1.1 cgd #define USTPUTC(c, p) (--sstrnleft, *p++ = (c))
74 1.17 kre #define STACKSTRNUL(p) (sstrnleft == 0? (p = growstackstr(), sstrnleft++, *p = '\0') : (*p = '\0'))
75 1.1 cgd #define STUNPUTC(p) (++sstrnleft, --p)
76 1.1 cgd #define STTOPC(p) p[-1]
77 1.1 cgd #define STADJUST(amount, p) (p += (amount), sstrnleft -= (amount))
78 1.17 kre #define grabstackstr(p) stalloc((p) - stackblock())
79 1.1 cgd
80 1.1 cgd #define ckfree(p) free((pointer)(p))
81