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