1 /*- 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Kenneth Almquist. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. All advertising materials mentioning features or use of this software 17 * must display the following acknowledgement: 18 * This product includes software developed by the University of 19 * California, Berkeley and its contributors. 20 * 4. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)memalloc.h 8.2 (Berkeley) 5/4/95 37 * $FreeBSD: head/bin/sh/memalloc.h 250527 2013-05-11 20:51:00Z jilles $ 38 */ 39 40 #include <string.h> 41 42 struct stackmark { 43 struct stack_block *stackp; 44 char *stacknxt; 45 int stacknleft; 46 }; 47 48 49 extern char *stacknxt; 50 extern int stacknleft; 51 extern char *sstrend; 52 53 pointer ckmalloc(size_t); 54 pointer ckrealloc(pointer, int); 55 void ckfree(pointer); 56 char *savestr(const char *); 57 pointer stalloc(int); 58 void stunalloc(pointer); 59 void setstackmark(struct stackmark *); 60 void popstackmark(struct stackmark *); 61 char *growstackstr(void); 62 char *makestrspace(int, char *); 63 char *stputbin(const char *data, size_t len, char *p); 64 char *stputs(const char *data, char *p); 65 66 67 68 #define stackblock() stacknxt 69 #define stackblocksize() stacknleft 70 #define grabstackblock(n) stalloc(n) 71 #define STARTSTACKSTR(p) p = stackblock() 72 #define STPUTC(c, p) do { if (p == sstrend) p = growstackstr(); *p++ = (c); } while(0) 73 #define CHECKSTRSPACE(n, p) { if ((size_t)(sstrend - p) < n) p = makestrspace(n, p); } 74 #define USTPUTC(c, p) (*p++ = (c)) 75 /* 76 * STACKSTRNUL's use is where we want to be able to turn a stack 77 * (non-sentinel, character counting string) into a C string, 78 * and later pretend the NUL is not there. 79 * Note: Because of STACKSTRNUL's semantics, STACKSTRNUL cannot be used 80 * on a stack that will grabstackstr()ed. 81 */ 82 #define STACKSTRNUL(p) (p == sstrend ? (p = growstackstr(), *p = '\0') : (*p = '\0')) 83 #define STUNPUTC(p) (--p) 84 #define STTOPC(p) p[-1] 85 #define STADJUST(amount, p) (p += (amount)) 86 #define grabstackstr(p) stalloc((char *)p - stackblock()) 87 #define ungrabstackstr(s, p) stunalloc((s)) 88 #define STPUTBIN(s, len, p) p = stputbin((s), (len), p) 89 #define STPUTS(s, p) p = stputs((s), p) 90