projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| 15637ed4 RG |
1 | /*- |
| 2 | * Copyright (c) 1991 The Regents of the University of California. | |
| 3 | * 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 | * | |
| 78ed81a3 | 36 | * from: @(#)memalloc.h 5.1 (Berkeley) 3/7/91 |
| 37 | * memalloc.h,v 1.4 1993/08/01 18:58:23 mycroft Exp | |
| 15637ed4 RG |
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 | #ifdef __STDC__ | |
| 53 | pointer ckmalloc(int); | |
| 54 | pointer ckrealloc(pointer, int); | |
| 55 | void free(pointer); /* defined in C library */ | |
| 56 | char *savestr(char *); | |
| 57 | pointer stalloc(int); | |
| 58 | void stunalloc(pointer); | |
| 59 | void setstackmark(struct stackmark *); | |
| 60 | void popstackmark(struct stackmark *); | |
| 61 | void growstackblock(void); | |
| 62 | void grabstackblock(int); | |
| 63 | char *growstackstr(void); | |
| 64 | char *makestrspace(void); | |
| 65 | void ungrabstackstr(char *, char *); | |
| 66 | #else | |
| 67 | pointer ckmalloc(); | |
| 68 | pointer ckrealloc(); | |
| 69 | void free(); /* defined in C library */ | |
| 70 | char *savestr(); | |
| 71 | pointer stalloc(); | |
| 72 | void stunalloc(); | |
| 73 | void setstackmark(); | |
| 74 | void popstackmark(); | |
| 75 | void growstackblock(); | |
| 76 | void grabstackblock(); | |
| 77 | char *growstackstr(); | |
| 78 | char *makestrspace(); | |
| 79 | void ungrabstackstr(); | |
| 80 | #endif | |
| 81 | ||
| 82 | ||
| 83 | ||
| 84 | #define stackblock() stacknxt | |
| 85 | #define stackblocksize() stacknleft | |
| 86 | #define STARTSTACKSTR(p) p = stackblock(), sstrnleft = stackblocksize() | |
| 87 | #define STPUTC(c, p) (--sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(), *p++ = (c))) | |
| 88 | #define CHECKSTRSPACE(n, p) if (sstrnleft < n) p = makestrspace(); else | |
| 89 | #define USTPUTC(c, p) (--sstrnleft, *p++ = (c)) | |
| 90 | #define STACKSTRNUL(p) (sstrnleft == 0? (p = growstackstr(), *p = '\0') : (*p = '\0')) | |
| 91 | #define STUNPUTC(p) (++sstrnleft, --p) | |
| 92 | #define STTOPC(p) p[-1] | |
| 93 | #define STADJUST(amount, p) (p += (amount), sstrnleft -= (amount)) | |
| 94 | #define grabstackstr(p) stalloc(stackblocksize() - sstrnleft) | |
| 95 | ||
| 96 | #define ckfree(p) free((pointer)(p)) |