11556Srgrimes/*-
21556Srgrimes * Copyright (c) 1991, 1993
31556Srgrimes *	The Regents of the University of California.  All rights reserved.
41556Srgrimes *
51556Srgrimes * This code is derived from software contributed to Berkeley by
61556Srgrimes * Kenneth Almquist.
71556Srgrimes *
81556Srgrimes * Redistribution and use in source and binary forms, with or without
91556Srgrimes * modification, are permitted provided that the following conditions
101556Srgrimes * are met:
111556Srgrimes * 1. Redistributions of source code must retain the above copyright
121556Srgrimes *    notice, this list of conditions and the following disclaimer.
131556Srgrimes * 2. Redistributions in binary form must reproduce the above copyright
141556Srgrimes *    notice, this list of conditions and the following disclaimer in the
151556Srgrimes *    documentation and/or other materials provided with the distribution.
161556Srgrimes * 4. Neither the name of the University nor the names of its contributors
171556Srgrimes *    may be used to endorse or promote products derived from this software
181556Srgrimes *    without specific prior written permission.
191556Srgrimes *
201556Srgrimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
211556Srgrimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
221556Srgrimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
231556Srgrimes * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
241556Srgrimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
251556Srgrimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
261556Srgrimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
271556Srgrimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
281556Srgrimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
291556Srgrimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
301556Srgrimes * SUCH DAMAGE.
311556Srgrimes *
3217987Speter *	@(#)memalloc.h	8.2 (Berkeley) 5/4/95
3350471Speter * $FreeBSD$
341556Srgrimes */
351556Srgrimes
36193221Srse#include <string.h>
37193221Srse
381556Srgrimesstruct stackmark {
391556Srgrimes	struct stack_block *stackp;
401556Srgrimes	char *stacknxt;
411556Srgrimes	int stacknleft;
4264702Scracauer        struct stackmark *marknext;
431556Srgrimes};
441556Srgrimes
451556Srgrimes
461556Srgrimesextern char *stacknxt;
471556Srgrimesextern int stacknleft;
48216743Sjillesextern char *sstrend;
491556Srgrimes
50193221Srsepointer ckmalloc(size_t);
5190111Simppointer ckrealloc(pointer, int);
52151795Sstefanfvoid ckfree(pointer);
53200956Sjilleschar *savestr(const char *);
5490111Simppointer stalloc(int);
5590111Simpvoid stunalloc(pointer);
5690111Simpvoid setstackmark(struct stackmark *);
5790111Simpvoid popstackmark(struct stackmark *);
5890111Simpchar *growstackstr(void);
59216743Sjilleschar *makestrspace(int, char *);
60215783Sjilleschar *stputbin(const char *data, int len, char *p);
61215783Sjilleschar *stputs(const char *data, char *p);
621556Srgrimes
631556Srgrimes
641556Srgrimes
651556Srgrimes#define stackblock() stacknxt
661556Srgrimes#define stackblocksize() stacknleft
67217209Sjilles#define grabstackblock(n) stalloc(n)
68216743Sjilles#define STARTSTACKSTR(p)	p = stackblock()
69216743Sjilles#define STPUTC(c, p)	do { if (p == sstrend) p = growstackstr(); *p++ = (c); } while(0)
70216743Sjilles#define CHECKSTRSPACE(n, p)	{ if (sstrend - p < n) p = makestrspace(n, p); }
71216743Sjilles#define USTPUTC(c, p)	(*p++ = (c))
72213814Sobrien/*
73213814Sobrien * STACKSTRNUL's use is where we want to be able to turn a stack
74213814Sobrien * (non-sentinel, character counting string) into a C string,
75213814Sobrien * and later pretend the NUL is not there.
76213814Sobrien * Note: Because of STACKSTRNUL's semantics, STACKSTRNUL cannot be used
77213814Sobrien * on a stack that will grabstackstr()ed.
78213814Sobrien */
79216743Sjilles#define STACKSTRNUL(p)	(p == sstrend ? (p = growstackstr(), *p = '\0') : (*p = '\0'))
80216743Sjilles#define STUNPUTC(p)	(--p)
811556Srgrimes#define STTOPC(p)	p[-1]
82216743Sjilles#define STADJUST(amount, p)	(p += (amount))
83216743Sjilles#define grabstackstr(p)	stalloc((char *)p - stackblock())
84216743Sjilles#define ungrabstackstr(s, p)	stunalloc((s))
85215783Sjilles#define STPUTBIN(s, len, p)	p = stputbin((s), (len), p)
86215783Sjilles#define STPUTS(s, p)	p = stputs((s), p)
87