memalloc.c revision 45618
11556Srgrimes/*- 21556Srgrimes * Copyright (c) 1991, 1993 31556Srgrimes * The Regents of the University of California. All rights reserved. 41556Srgrimes * 51556Srgrimes * This code is derived from software contributed to Berkeley by 61556Srgrimes * Kenneth Almquist. 71556Srgrimes * 81556Srgrimes * Redistribution and use in source and binary forms, with or without 91556Srgrimes * modification, are permitted provided that the following conditions 101556Srgrimes * are met: 111556Srgrimes * 1. Redistributions of source code must retain the above copyright 121556Srgrimes * notice, this list of conditions and the following disclaimer. 131556Srgrimes * 2. Redistributions in binary form must reproduce the above copyright 141556Srgrimes * notice, this list of conditions and the following disclaimer in the 151556Srgrimes * documentation and/or other materials provided with the distribution. 161556Srgrimes * 3. All advertising materials mentioning features or use of this software 171556Srgrimes * must display the following acknowledgement: 181556Srgrimes * This product includes software developed by the University of 191556Srgrimes * California, Berkeley and its contributors. 201556Srgrimes * 4. Neither the name of the University nor the names of its contributors 211556Srgrimes * may be used to endorse or promote products derived from this software 221556Srgrimes * without specific prior written permission. 231556Srgrimes * 241556Srgrimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 251556Srgrimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 261556Srgrimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 271556Srgrimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 281556Srgrimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 291556Srgrimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 301556Srgrimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 311556Srgrimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 321556Srgrimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 331556Srgrimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 341556Srgrimes * SUCH DAMAGE. 351556Srgrimes */ 361556Srgrimes 371556Srgrimes#ifndef lint 3836150Scharnier#if 0 3936150Scharnierstatic char sccsid[] = "@(#)memalloc.c 8.3 (Berkeley) 5/4/95"; 4036150Scharnier#endif 4136150Scharnierstatic const char rcsid[] = 4245618Scracauer "$Id: memalloc.c,v 1.12 1998/09/13 19:24:57 tegge Exp $"; 431556Srgrimes#endif /* not lint */ 441556Srgrimes 451556Srgrimes#include "shell.h" 461556Srgrimes#include "output.h" 471556Srgrimes#include "memalloc.h" 481556Srgrimes#include "error.h" 491556Srgrimes#include "machdep.h" 501556Srgrimes#include "mystring.h" 5139049Scracauer#include "expand.h" 5217987Speter#include <stdlib.h> 5317987Speter#include <unistd.h> 541556Srgrimes 551556Srgrimes/* 561556Srgrimes * Like malloc, but returns an error when out of space. 571556Srgrimes */ 581556Srgrimes 591556Srgrimespointer 6020425Ssteveckmalloc(nbytes) 6117987Speter int nbytes; 6217987Speter{ 6325222Ssteve pointer p; 641556Srgrimes 651556Srgrimes if ((p = malloc(nbytes)) == NULL) 661556Srgrimes error("Out of space"); 671556Srgrimes return p; 681556Srgrimes} 691556Srgrimes 701556Srgrimes 711556Srgrimes/* 721556Srgrimes * Same for realloc. 731556Srgrimes */ 741556Srgrimes 751556Srgrimespointer 761556Srgrimesckrealloc(p, nbytes) 7725222Ssteve pointer p; 7817987Speter int nbytes; 7917987Speter{ 801556Srgrimes if ((p = realloc(p, nbytes)) == NULL) 811556Srgrimes error("Out of space"); 821556Srgrimes return p; 831556Srgrimes} 841556Srgrimes 851556Srgrimes 861556Srgrimes/* 871556Srgrimes * Make a copy of a string in safe storage. 881556Srgrimes */ 891556Srgrimes 901556Srgrimeschar * 911556Srgrimessavestr(s) 921556Srgrimes char *s; 9345618Scracauer{ 9425222Ssteve char *p; 951556Srgrimes 961556Srgrimes p = ckmalloc(strlen(s) + 1); 971556Srgrimes scopy(s, p); 981556Srgrimes return p; 991556Srgrimes} 1001556Srgrimes 1011556Srgrimes 1021556Srgrimes/* 1031556Srgrimes * Parse trees for commands are allocated in lifo order, so we use a stack 1041556Srgrimes * to make this more efficient, and also to avoid all sorts of exception 1051556Srgrimes * handling code to handle interrupts in the middle of a parse. 1061556Srgrimes * 1071556Srgrimes * The size 504 was chosen because the Ultrix malloc handles that size 1081556Srgrimes * well. 1091556Srgrimes */ 1101556Srgrimes 1111556Srgrimes#define MINSIZE 504 /* minimum size of a block */ 1121556Srgrimes 1131556Srgrimes 1141556Srgrimesstruct stack_block { 1151556Srgrimes struct stack_block *prev; 1161556Srgrimes char space[MINSIZE]; 1171556Srgrimes}; 1181556Srgrimes 1191556Srgrimesstruct stack_block stackbase; 1201556Srgrimesstruct stack_block *stackp = &stackbase; 1211556Srgrimeschar *stacknxt = stackbase.space; 1221556Srgrimesint stacknleft = MINSIZE; 1231556Srgrimesint sstrnleft; 1241556Srgrimesint herefd = -1; 1251556Srgrimes 1261556Srgrimes 1271556Srgrimes 1281556Srgrimespointer 12920425Sstevestalloc(nbytes) 13017987Speter int nbytes; 13117987Speter{ 13225222Ssteve char *p; 1331556Srgrimes 1341556Srgrimes nbytes = ALIGN(nbytes); 1351556Srgrimes if (nbytes > stacknleft) { 1361556Srgrimes int blocksize; 1371556Srgrimes struct stack_block *sp; 1381556Srgrimes 1391556Srgrimes blocksize = nbytes; 1401556Srgrimes if (blocksize < MINSIZE) 1411556Srgrimes blocksize = MINSIZE; 1421556Srgrimes INTOFF; 14345618Scracauer sp = ckmalloc(sizeof(struct stack_block) - MINSIZE + 14445618Scracauer blocksize); 1451556Srgrimes sp->prev = stackp; 1461556Srgrimes stacknxt = sp->space; 1471556Srgrimes stacknleft = blocksize; 1481556Srgrimes stackp = sp; 1491556Srgrimes INTON; 1501556Srgrimes } 1511556Srgrimes p = stacknxt; 1521556Srgrimes stacknxt += nbytes; 1531556Srgrimes stacknleft -= nbytes; 1541556Srgrimes return p; 1551556Srgrimes} 1561556Srgrimes 1571556Srgrimes 1581556Srgrimesvoid 1591556Srgrimesstunalloc(p) 1601556Srgrimes pointer p; 16145618Scracauer{ 1621556Srgrimes if (p == NULL) { /*DEBUG */ 1631556Srgrimes write(2, "stunalloc\n", 10); 1641556Srgrimes abort(); 1651556Srgrimes } 1661556Srgrimes stacknleft += stacknxt - (char *)p; 1671556Srgrimes stacknxt = p; 1681556Srgrimes} 1691556Srgrimes 1701556Srgrimes 1711556Srgrimes 1721556Srgrimesvoid 1731556Srgrimessetstackmark(mark) 1741556Srgrimes struct stackmark *mark; 17545618Scracauer{ 1761556Srgrimes mark->stackp = stackp; 1771556Srgrimes mark->stacknxt = stacknxt; 1781556Srgrimes mark->stacknleft = stacknleft; 1791556Srgrimes} 1801556Srgrimes 1811556Srgrimes 1821556Srgrimesvoid 1831556Srgrimespopstackmark(mark) 1841556Srgrimes struct stackmark *mark; 18545618Scracauer{ 1861556Srgrimes struct stack_block *sp; 1871556Srgrimes 1881556Srgrimes INTOFF; 1891556Srgrimes while (stackp != mark->stackp) { 19045618Scracauer if (stackp == NULL) { 19145618Scracauer write(2, "Oops, stackp deleted\n", 21); 19245618Scracauer abort(); 19345618Scracauer } 1941556Srgrimes sp = stackp; 1951556Srgrimes stackp = sp->prev; 1961556Srgrimes ckfree(sp); 1971556Srgrimes } 1981556Srgrimes stacknxt = mark->stacknxt; 1991556Srgrimes stacknleft = mark->stacknleft; 2001556Srgrimes INTON; 2011556Srgrimes} 2021556Srgrimes 2031556Srgrimes 2041556Srgrimes/* 2051556Srgrimes * When the parser reads in a string, it wants to stick the string on the 2061556Srgrimes * stack and only adjust the stack pointer when it knows how big the 2071556Srgrimes * string is. Stackblock (defined in stack.h) returns a pointer to a block 2081556Srgrimes * of space on top of the stack and stackblocklen returns the length of 2091556Srgrimes * this block. Growstackblock will grow this space by at least one byte, 2101556Srgrimes * possibly moving it (like realloc). Grabstackblock actually allocates the 2111556Srgrimes * part of the block that has been used. 2121556Srgrimes */ 2131556Srgrimes 2141556Srgrimesvoid 21545618Scracauergrowstackblock() 21645618Scracauer{ 2171556Srgrimes char *p; 21845618Scracauer int newlen; 21945618Scracauer char *oldspace; 22045618Scracauer int oldlen; 2211556Srgrimes struct stack_block *sp; 2221556Srgrimes 22345618Scracauer newlen = ALIGN(stacknleft * 2 + 100); 22445618Scracauer oldspace = stacknxt; 22545618Scracauer oldlen = stacknleft; 22645618Scracauer 2271556Srgrimes if (stacknxt == stackp->space && stackp != &stackbase) { 2281556Srgrimes INTOFF; 2291556Srgrimes sp = stackp; 2301556Srgrimes stackp = sp->prev; 23145618Scracauer sp = ckrealloc((pointer)sp, sizeof(struct stack_block) - 23245618Scracauer MINSIZE + newlen); 2331556Srgrimes sp->prev = stackp; 2341556Srgrimes stackp = sp; 2351556Srgrimes stacknxt = sp->space; 2361556Srgrimes stacknleft = newlen; 2371556Srgrimes INTON; 2381556Srgrimes } else { 2391556Srgrimes p = stalloc(newlen); 24017987Speter memcpy(p, oldspace, oldlen); 2411556Srgrimes stacknxt = p; /* free the space */ 24218018Speter stacknleft += newlen; /* we just allocated */ 2431556Srgrimes } 2441556Srgrimes} 2451556Srgrimes 2461556Srgrimes 2471556Srgrimes 2481556Srgrimesvoid 24920425Sstevegrabstackblock(len) 25017987Speter int len; 25117987Speter{ 2521556Srgrimes len = ALIGN(len); 2531556Srgrimes stacknxt += len; 2541556Srgrimes stacknleft -= len; 2551556Srgrimes} 2561556Srgrimes 2571556Srgrimes 2581556Srgrimes 2591556Srgrimes/* 2601556Srgrimes * The following routines are somewhat easier to use that the above. 2611556Srgrimes * The user declares a variable of type STACKSTR, which may be declared 2621556Srgrimes * to be a register. The macro STARTSTACKSTR initializes things. Then 2631556Srgrimes * the user uses the macro STPUTC to add characters to the string. In 2641556Srgrimes * effect, STPUTC(c, p) is the same as *p++ = c except that the stack is 2651556Srgrimes * grown as necessary. When the user is done, she can just leave the 2661556Srgrimes * string there and refer to it using stackblock(). Or she can allocate 2671556Srgrimes * the space for it using grabstackstr(). If it is necessary to allow 2681556Srgrimes * someone else to use the stack temporarily and then continue to grow 2691556Srgrimes * the string, the user should use grabstack to allocate the space, and 2701556Srgrimes * then call ungrabstr(p) to return to the previous mode of operation. 2711556Srgrimes * 2721556Srgrimes * USTPUTC is like STPUTC except that it doesn't check for overflow. 2731556Srgrimes * CHECKSTACKSPACE can be called before USTPUTC to ensure that there 2741556Srgrimes * is space for at least one character. 2751556Srgrimes */ 2761556Srgrimes 2771556Srgrimes 2781556Srgrimeschar * 27945618Scracauergrowstackstr() 28045618Scracauer{ 28145618Scracauer int len; 28245618Scracauer 28345618Scracauer len = stackblocksize(); 2841556Srgrimes if (herefd >= 0 && len >= 1024) { 28539137Stegge xwrite(herefd, stackblock(), len); 2861556Srgrimes sstrnleft = len - 1; 2871556Srgrimes return stackblock(); 2881556Srgrimes } 2891556Srgrimes growstackblock(); 2901556Srgrimes sstrnleft = stackblocksize() - len - 1; 2911556Srgrimes return stackblock() + len; 2921556Srgrimes} 2931556Srgrimes 2941556Srgrimes 2951556Srgrimes/* 2961556Srgrimes * Called from CHECKSTRSPACE. 2971556Srgrimes */ 2981556Srgrimes 2991556Srgrimeschar * 30045618Scracauermakestrspace() 30145618Scracauer{ 30245618Scracauer int len; 30345618Scracauer 30445618Scracauer len = stackblocksize() - sstrnleft; 3051556Srgrimes growstackblock(); 3061556Srgrimes sstrnleft = stackblocksize() - len; 3071556Srgrimes return stackblock() + len; 3081556Srgrimes} 3091556Srgrimes 3101556Srgrimes 3111556Srgrimes 3121556Srgrimesvoid 3131556Srgrimesungrabstackstr(s, p) 3141556Srgrimes char *s; 3151556Srgrimes char *p; 31645618Scracauer{ 3171556Srgrimes stacknleft += stacknxt - s; 3181556Srgrimes stacknxt = s; 3191556Srgrimes sstrnleft = stacknleft - (p - s); 3201556Srgrimes} 321