1/*-
2 * SPDX-License-Identifier: BSD-3-Clause
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 * $FreeBSD$
36 */
37
38#include <string.h>
39
40struct stackmark {
41	struct stack_block *stackp;
42	char *stacknxt;
43	int stacknleft;
44};
45
46
47extern char *stacknxt;
48extern int stacknleft;
49extern char *sstrend;
50
51pointer ckmalloc(size_t);
52pointer ckrealloc(pointer, int);
53void ckfree(pointer);
54char *savestr(const char *);
55pointer stalloc(int);
56void stunalloc(pointer);
57char *stsavestr(const char *);
58void setstackmark(struct stackmark *);
59void popstackmark(struct stackmark *);
60char *growstackstr(void);
61char *makestrspace(int, char *);
62char *stputbin(const char *data, size_t len, char *p);
63char *stputs(const char *data, char *p);
64
65
66
67#define stackblock() stacknxt
68#define stackblocksize() stacknleft
69#define grabstackblock(n) stalloc(n)
70#define STARTSTACKSTR(p)	p = stackblock()
71#define STPUTC(c, p)	do { if (p == sstrend) p = growstackstr(); *p++ = (c); } while(0)
72#define CHECKSTRSPACE(n, p)	{ if ((size_t)(sstrend - p) < n) p = makestrspace(n, p); }
73#define USTPUTC(c, p)	(*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)	(p == sstrend ? (p = growstackstr(), *p = '\0') : (*p = '\0'))
82#define STUNPUTC(p)	(--p)
83#define STTOPC(p)	p[-1]
84#define STADJUST(amount, p)	(p += (amount))
85#define grabstackstr(p)	stalloc((char *)p - stackblock())
86#define ungrabstackstr(s, p)	stunalloc((s))
87#define STPUTBIN(s, len, p)	p = stputbin((s), (len), p)
88#define STPUTS(s, p)	p = stputs((s), p)
89