| 1 | /* $NetBSD: memalloc.c,v 1.28 2003/08/07 09:05:34 agc Exp $ */
|
|---|
| 2 |
|
|---|
| 3 | /*-
|
|---|
| 4 | * Copyright (c) 1991, 1993
|
|---|
| 5 | * The Regents of the University of California. All rights reserved.
|
|---|
| 6 | *
|
|---|
| 7 | * This code is derived from software contributed to Berkeley by
|
|---|
| 8 | * Kenneth Almquist.
|
|---|
| 9 | *
|
|---|
| 10 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 11 | * modification, are permitted provided that the following conditions
|
|---|
| 12 | * are met:
|
|---|
| 13 | * 1. Redistributions of source code must retain the above copyright
|
|---|
| 14 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 15 | * 2. Redistributions in binary form must reproduce the above copyright
|
|---|
| 16 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 17 | * documentation and/or other materials provided with the distribution.
|
|---|
| 18 | * 3. Neither the name of the University nor the names of its contributors
|
|---|
| 19 | * may be used to endorse or promote products derived from this software
|
|---|
| 20 | * without specific prior written permission.
|
|---|
| 21 | *
|
|---|
| 22 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|---|
| 23 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|---|
| 24 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|---|
| 25 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|---|
| 26 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|---|
| 27 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|---|
| 28 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|---|
| 29 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 30 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|---|
| 31 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|---|
| 32 | * SUCH DAMAGE.
|
|---|
| 33 | */
|
|---|
| 34 |
|
|---|
| 35 | #include <sys/cdefs.h>
|
|---|
| 36 | #ifndef lint
|
|---|
| 37 | #if 0
|
|---|
| 38 | static char sccsid[] = "@(#)memalloc.c 8.3 (Berkeley) 5/4/95";
|
|---|
| 39 | #else
|
|---|
| 40 | __RCSID("$NetBSD: memalloc.c,v 1.28 2003/08/07 09:05:34 agc Exp $");
|
|---|
| 41 | #endif
|
|---|
| 42 | #endif /* not lint */
|
|---|
| 43 |
|
|---|
| 44 | #include <stdlib.h>
|
|---|
| 45 | #include <unistd.h>
|
|---|
| 46 |
|
|---|
| 47 | #include "shell.h"
|
|---|
| 48 | #include "output.h"
|
|---|
| 49 | #include "memalloc.h"
|
|---|
| 50 | #include "error.h"
|
|---|
| 51 | #include "machdep.h"
|
|---|
| 52 | #include "mystring.h"
|
|---|
| 53 |
|
|---|
| 54 | /*
|
|---|
| 55 | * Like malloc, but returns an error when out of space.
|
|---|
| 56 | */
|
|---|
| 57 |
|
|---|
| 58 | pointer
|
|---|
| 59 | ckmalloc(int nbytes)
|
|---|
| 60 | {
|
|---|
| 61 | pointer p;
|
|---|
| 62 |
|
|---|
| 63 | p = malloc(nbytes);
|
|---|
| 64 | if (p == NULL)
|
|---|
| 65 | error("Out of space");
|
|---|
| 66 | return p;
|
|---|
| 67 | }
|
|---|
| 68 |
|
|---|
| 69 |
|
|---|
| 70 | /*
|
|---|
| 71 | * Same for realloc.
|
|---|
| 72 | */
|
|---|
| 73 |
|
|---|
| 74 | pointer
|
|---|
| 75 | ckrealloc(pointer p, int nbytes)
|
|---|
| 76 | {
|
|---|
| 77 | p = realloc(p, nbytes);
|
|---|
| 78 | if (p == NULL)
|
|---|
| 79 | error("Out of space");
|
|---|
| 80 | return p;
|
|---|
| 81 | }
|
|---|
| 82 |
|
|---|
| 83 |
|
|---|
| 84 | /*
|
|---|
| 85 | * Make a copy of a string in safe storage.
|
|---|
| 86 | */
|
|---|
| 87 |
|
|---|
| 88 | char *
|
|---|
| 89 | savestr(const char *s)
|
|---|
| 90 | {
|
|---|
| 91 | char *p;
|
|---|
| 92 |
|
|---|
| 93 | p = ckmalloc(strlen(s) + 1);
|
|---|
| 94 | scopy(s, p);
|
|---|
| 95 | return p;
|
|---|
| 96 | }
|
|---|
| 97 |
|
|---|
| 98 |
|
|---|
| 99 | /*
|
|---|
| 100 | * Parse trees for commands are allocated in lifo order, so we use a stack
|
|---|
| 101 | * to make this more efficient, and also to avoid all sorts of exception
|
|---|
| 102 | * handling code to handle interrupts in the middle of a parse.
|
|---|
| 103 | *
|
|---|
| 104 | * The size 504 was chosen because the Ultrix malloc handles that size
|
|---|
| 105 | * well.
|
|---|
| 106 | */
|
|---|
| 107 |
|
|---|
| 108 | #define MINSIZE 504 /* minimum size of a block */
|
|---|
| 109 |
|
|---|
| 110 | struct stack_block {
|
|---|
| 111 | struct stack_block *prev;
|
|---|
| 112 | char space[MINSIZE];
|
|---|
| 113 | };
|
|---|
| 114 |
|
|---|
| 115 | struct stack_block stackbase;
|
|---|
| 116 | struct stack_block *stackp = &stackbase;
|
|---|
| 117 | struct stackmark *markp;
|
|---|
| 118 | char *stacknxt = stackbase.space;
|
|---|
| 119 | int stacknleft = MINSIZE;
|
|---|
| 120 | int sstrnleft;
|
|---|
| 121 | int herefd = -1;
|
|---|
| 122 |
|
|---|
| 123 | pointer
|
|---|
| 124 | stalloc(int nbytes)
|
|---|
| 125 | {
|
|---|
| 126 | char *p;
|
|---|
| 127 |
|
|---|
| 128 | nbytes = SHELL_ALIGN(nbytes);
|
|---|
| 129 | if (nbytes > stacknleft) {
|
|---|
| 130 | int blocksize;
|
|---|
| 131 | struct stack_block *sp;
|
|---|
| 132 |
|
|---|
| 133 | blocksize = nbytes;
|
|---|
| 134 | if (blocksize < MINSIZE)
|
|---|
| 135 | blocksize = MINSIZE;
|
|---|
| 136 | INTOFF;
|
|---|
| 137 | sp = ckmalloc(sizeof(struct stack_block) - MINSIZE + blocksize);
|
|---|
| 138 | sp->prev = stackp;
|
|---|
| 139 | stacknxt = sp->space;
|
|---|
| 140 | stacknleft = blocksize;
|
|---|
| 141 | stackp = sp;
|
|---|
| 142 | INTON;
|
|---|
| 143 | }
|
|---|
| 144 | p = stacknxt;
|
|---|
| 145 | stacknxt += nbytes;
|
|---|
| 146 | stacknleft -= nbytes;
|
|---|
|
|---|
