| memalloc.h (200956) | memalloc.h (213814) |
|---|---|
| 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 --- 16 unchanged lines hidden (view full) --- 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 | 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 --- 16 unchanged lines hidden (view full) --- 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 200956 2009-12-24 18:41:14Z jilles $ | 33 * $FreeBSD: head/bin/sh/memalloc.h 213814 2010-10-13 23:29:09Z obrien $ |
| 34 */ 35 36#include <string.h> 37 38struct stackmark { 39 struct stack_block *stackp; 40 char *stacknxt; 41 int stacknleft; --- 20 unchanged lines hidden (view full) --- 62char *makestrspace(void); 63void ungrabstackstr(char *, char *); 64 65 66 67#define stackblock() stacknxt 68#define stackblocksize() stacknleft 69#define STARTSTACKSTR(p) p = stackblock(), sstrnleft = stackblocksize() | 34 */ 35 36#include <string.h> 37 38struct stackmark { 39 struct stack_block *stackp; 40 char *stacknxt; 41 int stacknleft; --- 20 unchanged lines hidden (view full) --- 62char *makestrspace(void); 63void ungrabstackstr(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))) | 70#define STPUTC(c, p) (--sstrnleft >= 0? (*p++ = (c)) : (p = growstackstr(), --sstrnleft, *p++ = (c))) |
| 71#define CHECKSTRSPACE(n, p) { if (sstrnleft < n) p = makestrspace(); } 72#define USTPUTC(c, p) (--sstrnleft, *p++ = (c)) | 71#define CHECKSTRSPACE(n, p) { if (sstrnleft < n) p = makestrspace(); } 72#define USTPUTC(c, p) (--sstrnleft, *p++ = (c)) |
| 73/* 74 * STACKSTRNUL's use is where we want to be able to turn a stack 75 * (non-sentinel, character counting string) into a C string, 76 * and later pretend the NUL is not there. 77 * Note: Because of STACKSTRNUL's semantics, STACKSTRNUL cannot be used 78 * on a stack that will grabstackstr()ed. 79 */ |
|
| 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) | 80#define STACKSTRNUL(p) (sstrnleft == 0? (p = growstackstr(), *p = '\0') : (*p = '\0')) 81#define STUNPUTC(p) (++sstrnleft, --p) 82#define STTOPC(p) p[-1] 83#define STADJUST(amount, p) (p += (amount), sstrnleft -= (amount)) 84#define grabstackstr(p) stalloc(stackblocksize() - sstrnleft) |