xref: /netbsd-src/bin/sh/memalloc.h (revision 4a9058f97b91be4879e8d395582401f9c3529210)
1 /*	$NetBSD: memalloc.h,v 1.20 2021/10/26 10:07:20 kre 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 
37 struct stackmark {
38 	struct stack_block *stackp;
39 	char *stacknxt;
40 	int stacknleft;
41 	int sstrnleft;
42 	struct stackmark *marknext;
43 };
44 
45 
46 extern char *stacknxt;
47 extern int stacknleft;
48 extern int sstrnleft;
49 extern int herefd;
50 
51 pointer ckmalloc(size_t);
52 pointer ckrealloc(pointer, int);
53 char *savestr(const char *);
54 pointer stalloc(int);
55 void stunalloc(pointer);
56 void setstackmark(struct stackmark *);
57 void popstackmark(struct stackmark *);
58 void rststackmark(struct stackmark *);
59 void growstackblock(void);
60 void grabstackblock(int);
61 char *growstackstr(void);
62 char *makestrspace(void);
63 void ungrabstackstr(char *, char *);
64 
65 char *ststrcat(size_t *, ...);
66 #define STSTRC_END	((const char *)0)
67 
68 
69 
70 #define stackblock() stacknxt
71 #define stackblocksize() stacknleft
72 #define STARTSTACKSTR(p)	p = stackblock(), sstrnleft = stackblocksize()
73 #define STPUTC(c, p)	(--sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(), *p++ = (c)))
74 #define CHECKSTRSPACE(n, p)	{ if (sstrnleft < n) p = makestrspace(); }
75 #define USTPUTC(c, p)	(--sstrnleft, *p++ = (c))
76 #define STACKSTRNUL(p)	(sstrnleft == 0? (p = growstackstr(), sstrnleft++, *p = '\0') : (*p = '\0'))
77 #define STUNPUTC(p)	(++sstrnleft, --p)
78 #define STTOPC(p)	p[-1]
79 #define STADJUST(amount, p)	(p += (amount), sstrnleft -= (amount))
80 #define grabstackstr(p)	stalloc((p) - stackblock())
81 
82 #define ckfree(p)	free((pointer)(p))
83