memalloc.h revision 216387 
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 * 4. Neither the name of the University nor the names of its contributors
17 *    may be used to endorse or promote products derived from this software
18 *    without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 *
32 *	@(#)memalloc.h	8.2 (Berkeley) 5/4/95
33 * $FreeBSD: head/bin/sh/memalloc.h 216387 2010-12-12 00:07:27Z jilles $
34 */
35
36#include <string.h>
37
38struct stackmark {
39	struct stack_block *stackp;
40	char *stacknxt;
41	int stacknleft;
42        struct stackmark *marknext;
43};
44
45
46extern char *stacknxt;
47extern int stacknleft;
48extern int sstrnleft;
49
50pointer ckmalloc(size_t);
51pointer ckrealloc(pointer, int);
52void ckfree(pointer);
53char *savestr(const char *);
54pointer stalloc(int);
55void stunalloc(pointer);
56void setstackmark(struct stackmark *);
57void popstackmark(struct stackmark *);
58void growstackblock(void);
59void grabstackblock(int);
60char *growstackstr(void);
61char *makestrspace(void);
62void ungrabstackstr(char *, char *);
63char *stputbin(const char *data, int len, char *p);
64char *stputs(const char *data, char *p);
65
66
67
68#define stackblock() stacknxt
69#define stackblocksize() stacknleft
70#define STARTSTACKSTR(p)	p = stackblock(), sstrnleft = stackblocksize()
71#define STPUTC(c, p)	(--sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(), --sstrnleft, *p++ = (c)))
72#define CHECKSTRSPACE(n, p)	{ if (sstrnleft < n) p = makestrspace(); }
73#define USTPUTC(c, p)	(--sstrnleft, *p++ = (c))
74/*
75 * STACKSTRNUL's use is where we want to be able to turn a stack
76 * (non-sentinel, character counting string) into a C string,
77 * and later pretend the NUL is not there.
78 * Note: Because of STACKSTRNUL's semantics, STACKSTRNUL cannot be used
79 * on a stack that will grabstackstr()ed.
80 */
81#define STACKSTRNUL(p)	(sstrnleft == 0? (p = growstackstr(), *p = '\0') : (*p = '\0'))
82#define STUNPUTC(p)	(++sstrnleft, --p)
83#define STTOPC(p)	p[-1]
84#define STADJUST(amount, p)	(p += (amount), sstrnleft -= (amount))
85#define grabstackstr(p)	stalloc(stackblocksize() - sstrnleft)
86#define STPUTBIN(s, len, p)	p = stputbin((s), (len), p)
87#define STPUTS(s, p)	p = stputs((s), p)
88