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$ 38 */ 39 40 struct stackmark { 41 struct stack_block *stackp; 42 char *stacknxt; 43 int stacknleft; 44 }; 45 46 47 extern char *stacknxt; 48 extern int stacknleft; 49 extern int sstrnleft; 50 extern int herefd; 51 52 pointer ckmalloc __P((int)); 53 pointer ckrealloc __P((pointer, int)); 54 char *savestr __P((char *)); 55 pointer stalloc __P((int)); 56 void stunalloc __P((pointer)); 57 void setstackmark __P((struct stackmark *)); 58 void popstackmark __P((struct stackmark *)); 59 void growstackblock __P((void)); 60 void grabstackblock __P((int)); 61 char *growstackstr __P((void)); 62 char *makestrspace __P((void)); 63 void ungrabstackstr __P((char *, char *)); 64 65 66 67 #define stackblock() stacknxt 68 #define stackblocksize() stacknleft 69 #define STARTSTACKSTR(p) p = stackblock(), sstrnleft = stackblocksize() 70 #define STPUTC(c, p) (--sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(), *p++ = (c))) 71 #define CHECKSTRSPACE(n, p) { if (sstrnleft < n) p = makestrspace(); } 72 #define USTPUTC(c, p) (--sstrnleft, *p++ = (c)) 73 #define STACKSTRNUL(p) (sstrnleft == 0? (p = growstackstr(), *p = '\0') : (*p = '\0')) 74 #define STUNPUTC(p) (++sstrnleft, --p) 75 #define STTOPC(p) p[-1] 76 #define STADJUST(amount, p) (p += (amount), sstrnleft -= (amount)) 77 #define grabstackstr(p) stalloc(stackblocksize() - sstrnleft) 78 79 #define ckfree(p) free((pointer)(p)) 80