| memalloc.h (217209) | memalloc.h (248980) |
|---|---|
| 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 217209 2011-01-09 22:47:58Z jilles $ | 33 * $FreeBSD: head/bin/sh/memalloc.h 248980 2013-04-01 17:18:22Z jilles $ |
| 34 */ 35 36#include <string.h> 37 38struct stackmark { 39 struct stack_block *stackp; 40 char *stacknxt; 41 int stacknleft; --- 10 unchanged lines hidden (view full) --- 52void ckfree(pointer); 53char *savestr(const char *); 54pointer stalloc(int); 55void stunalloc(pointer); 56void setstackmark(struct stackmark *); 57void popstackmark(struct stackmark *); 58char *growstackstr(void); 59char *makestrspace(int, char *); | 34 */ 35 36#include <string.h> 37 38struct stackmark { 39 struct stack_block *stackp; 40 char *stacknxt; 41 int stacknleft; --- 10 unchanged lines hidden (view full) --- 52void ckfree(pointer); 53char *savestr(const char *); 54pointer stalloc(int); 55void stunalloc(pointer); 56void setstackmark(struct stackmark *); 57void popstackmark(struct stackmark *); 58char *growstackstr(void); 59char *makestrspace(int, char *); |
| 60char *stputbin(const char *data, int len, char *p); | 60char *stputbin(const char *data, size_t len, char *p); |
| 61char *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) | 61char *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 (sstrend - p < n) p = makestrspace(n, p); } | 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) | 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) |