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
35#include "sh_cdefs.h"
36#include <stddef.h>
37#include <string.h>
38
39struct stackmark {
40 struct stack_block *stackp;
41 char *stacknxt;
42 int stacknleft;
43};
44
45extern char *stacknxt;
46extern int stacknleft;
47extern char *sstrend;
48
49pointer ckmalloc(size_t);
50pointer ckrealloc(pointer, int);
51void ckfree(pointer);
52char *savestr(const char *);
53pointer stalloc(int);
54void stunalloc(pointer);
55char *stsavestr(const char *);
56void setstackmark(struct stackmark *);
57void popstackmark(struct stackmark *);
58char *growstackstr(void);
59char *makestrspace(int, char *);
60char *stputbin(const char *data, size_t len, char *p);
61char *stputs(const char *data, char *p);
62
63#define stackblock() stacknxt
64#define stackblocksize() stacknleft
65#define grabstackblock(n) stalloc(n)
66#define STARTSTACKSTR(p) p = stackblock()
67#define STPUTC(c, p) \
68 do { \
69 if (p == sstrend) \
70 p = growstackstr(); \
71 *p++ = (c); \
72 } while (0)
73#define CHECKSTRSPACE(n, p) \
74 { \
75 if ((size_t)(sstrend - p) < n) \
76 p = makestrspace(n, p); \
77 }
78#define USTPUTC(c, p) (*p++ = (c))
79/*
80 * STACKSTRNUL's use is where we want to be able to turn a stack
81 * (non-sentinel, character counting string) into a C string,
82 * and later pretend the NUL is not there.
83 * Note: Because of STACKSTRNUL's semantics, STACKSTRNUL cannot be used
84 * on a stack that will grabstackstr()ed.
85 */
86#define STACKSTRNUL(p) (p == sstrend ? (p = growstackstr(), *p = '\0') : (*p = '\0'))
87#define STUNPUTC(p) (--p)
88#define STTOPC(p) p[-1]
89#define STADJUST(amount, p) (p += (amount))
90#define grabstackstr(p) stalloc((char *)p - stackblock())
91#define ungrabstackstr(s, p) stunalloc((s))
92#define STPUTBIN(s, len, p) p = stputbin((s), (len), p)
93#define STPUTS(s, p) p = stputs((s), p)
