blob: e7938802c0f523bdbfc45af6e2ba273318eb34f7 [file] [log] [blame]
The Android Open Source Projectdd7bc332009-03-03 19:32:55 -08001/* $NetBSD: memalloc.h,v 1.14 2003/08/07 09:05:34 agc Exp $ */
2
3/*-
4 * Copyright (c) 1991, 1993
5 * The Regents of the University of California. 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
37struct stackmark {
38 struct stack_block *stackp;
39 char *stacknxt;
40 int stacknleft;
41 struct stackmark *marknext;
42};
43
44
45extern char *stacknxt;
46extern int stacknleft;
47extern int sstrnleft;
48extern int herefd;
49
50pointer ckmalloc(int);
51pointer ckrealloc(pointer, int);
52char *savestr(const char *);
53pointer stalloc(int);
54void stunalloc(pointer);
55void setstackmark(struct stackmark *);
56void popstackmark(struct stackmark *);
57void growstackblock(void);
58void grabstackblock(int);
59char *growstackstr(void);
60char *makestrspace(void);
61void ungrabstackstr(char *, char *);
62
63
64
65#define stackblock() stacknxt
66#define stackblocksize() stacknleft
67#define STARTSTACKSTR(p) p = stackblock(), sstrnleft = stackblocksize()
68#define STPUTC(c, p) (--sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(), *p++ = (c)))
69#define CHECKSTRSPACE(n, p) { if (sstrnleft < n) p = makestrspace(); }
70#define USTPUTC(c, p) (--sstrnleft, *p++ = (c))
71#define STACKSTRNUL(p) (sstrnleft == 0? (p = growstackstr(), *p = '\0') : (*p = '\0'))
72#define STUNPUTC(p) (++sstrnleft, --p)
73#define STTOPC(p) p[-1]
74#define STADJUST(amount, p) (p += (amount), sstrnleft -= (amount))
75#define grabstackstr(p) stalloc(stackblocksize() - sstrnleft)
76
77#define ckfree(p) free((pointer)(p))