memalloc.h revision 1557 
1/*-
2 * Copyright (c) 1991, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Kenneth Almquist.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
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.
23 *
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
34 * SUCH DAMAGE.
35 *
36 *	@(#)memalloc.h	8.1 (Berkeley) 5/31/93
37 */
38
39struct stackmark {
40	struct stack_block *stackp;
41	char *stacknxt;
42	int stacknleft;
43};
44
45
46extern char *stacknxt;
47extern int stacknleft;
48extern int sstrnleft;
49extern int herefd;
50
51#ifdef __STDC__
52pointer ckmalloc(int);
53pointer ckrealloc(pointer, int);
54void free(pointer);		/* defined in C library */
55char *savestr(char *);
56pointer stalloc(int);
57void stunalloc(pointer);
58void setstackmark(struct stackmark *);
59void popstackmark(struct stackmark *);
60void growstackblock(void);
61void grabstackblock(int);
62char *growstackstr(void);
63char *makestrspace(void);
64void ungrabstackstr(char *, char *);
65#else
66pointer ckmalloc();
67pointer ckrealloc();
68void free();		/* defined in C library */
69char *savestr();
70pointer stalloc();
71void stunalloc();
72void setstackmark();
73void popstackmark();
74void growstackblock();
75void grabstackblock();
76char *growstackstr();
77char *makestrspace();
78void ungrabstackstr();
79#endif
80
81
82
83#define stackblock() stacknxt
84#define stackblocksize() stacknleft
85#define STARTSTACKSTR(p)	p = stackblock(), sstrnleft = stackblocksize()
86#define STPUTC(c, p)	(--sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(), *p++ = (c)))
87#define CHECKSTRSPACE(n, p)	if (sstrnleft < n) p = makestrspace(); else
88#define USTPUTC(c, p)	(--sstrnleft, *p++ = (c))
89#define STACKSTRNUL(p)	(sstrnleft == 0? (p = growstackstr(), *p = '\0') : (*p = '\0'))
90#define STUNPUTC(p)	(++sstrnleft, --p)
91#define STTOPC(p)	p[-1]
92#define STADJUST(amount, p)	(p += (amount), sstrnleft -= (amount))
93#define grabstackstr(p)	stalloc(stackblocksize() - sstrnleft)
94
95#define ckfree(p)	free((pointer)(p))
96