bin/sh/memalloc.h

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