memalloc.h revision 215783
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 * 4. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 * 32 * @(#)memalloc.h 8.2 (Berkeley) 5/4/95 33 * $FreeBSD: head/bin/sh/memalloc.h 215783 2010-11-23 22:17:39Z jilles $ 34 */ 35 36#include <string.h> 37 38struct stackmark { 39 struct stack_block *stackp; 40 char *stacknxt; 41 int stacknleft; 42 struct stackmark *marknext; 43}; 44 45 46extern char *stacknxt; 47extern int stacknleft; 48extern int sstrnleft; 49extern int herefd; 50 51pointer ckmalloc(size_t); 52pointer ckrealloc(pointer, int); 53void ckfree(pointer); 54char *savestr(const char *); 55pointer stalloc(int); 56void stunalloc(pointer); 57void setstackmark(struct stackmark *); 58void popstackmark(struct stackmark *); 59void growstackblock(void); 60void grabstackblock(int); 61char *growstackstr(void); 62char *makestrspace(void); 63void ungrabstackstr(char *, char *); 64char *stputbin(const char *data, int len, char *p); 65char *stputs(const char *data, char *p); 66 67 68 69#define stackblock() stacknxt 70#define stackblocksize() stacknleft 71#define STARTSTACKSTR(p) p = stackblock(), sstrnleft = stackblocksize() 72#define STPUTC(c, p) (--sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(), --sstrnleft, *p++ = (c))) 73#define CHECKSTRSPACE(n, p) { if (sstrnleft < n) p = makestrspace(); } 74#define USTPUTC(c, p) (--sstrnleft, *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) (sstrnleft == 0? (p = growstackstr(), *p = '\0') : (*p = '\0')) 83#define STUNPUTC(p) (++sstrnleft, --p) 84#define STTOPC(p) p[-1] 85#define STADJUST(amount, p) (p += (amount), sstrnleft -= (amount)) 86#define grabstackstr(p) stalloc(stackblocksize() - sstrnleft) 87#define STPUTBIN(s, len, p) p = stputbin((s), (len), p) 88#define STPUTS(s, p) p = stputs((s), p) 89