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 --- 20 unchanged lines hidden (view full) --- 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 * 36 * @(#)nodes.c.pat 8.2 (Berkeley) 5/4/95 |
37 * $FreeBSD: head/bin/sh/nodes.c.pat 90111 2002-02-02 06:50:57Z imp $ |
38 */ 39 40#include <stdlib.h> 41/* 42 * Routine for dealing with parsed shell commands. 43 */ 44 45#include "shell.h" --- 6 unchanged lines hidden (view full) --- 52int funcblocksize; /* size of structures in function */ 53int funcstringsize; /* size of strings in node */ 54pointer funcblock; /* block to allocate function from */ 55char *funcstring; /* block to allocate strings from */ 56 57%SIZES 58 59 |
60STATIC void calcsize(union node *); 61STATIC void sizenodelist(struct nodelist *); 62STATIC union node *copynode(union node *); 63STATIC struct nodelist *copynodelist(struct nodelist *); 64STATIC char *nodesavestr(char *); |
65 66 67 68/* 69 * Make a copy of a parse tree. 70 */ 71 72union node * |
73copyfunc(union node *n) |
74{ 75 if (n == NULL) 76 return NULL; 77 funcblocksize = 0; 78 funcstringsize = 0; 79 calcsize(n); 80 funcblock = ckmalloc(funcblocksize + funcstringsize); 81 funcstring = (char *)funcblock + funcblocksize; 82 return copynode(n); 83} 84 85 86 87STATIC void |
88calcsize(union node *n) |
89{ 90 %CALCSIZE 91} 92 93 94 95STATIC void |
96sizenodelist(struct nodelist *lp) |
97{ 98 while (lp) { 99 funcblocksize += ALIGN(sizeof(struct nodelist)); 100 calcsize(lp->n); 101 lp = lp->next; 102 } 103} 104 105 106 107STATIC union node * |
108copynode(union node *n) |
109{ 110 union node *new; 111 112 %COPY 113 return new; 114} 115 116 117STATIC struct nodelist * |
118copynodelist(struct nodelist *lp) |
119{ 120 struct nodelist *start; 121 struct nodelist **lpp; 122 123 lpp = &start; 124 while (lp) { 125 *lpp = funcblock; 126 funcblock = (char *)funcblock + ALIGN(sizeof(struct nodelist)); 127 (*lpp)->n = copynode(lp->n); 128 lp = lp->next; 129 lpp = &(*lpp)->next; 130 } 131 *lpp = NULL; 132 return start; 133} 134 135 136 137STATIC char * |
138nodesavestr(char *s) |
139{ 140 char *p = s; 141 char *q = funcstring; 142 char *rtn = funcstring; 143 144 while ((*q++ = *p++) != '\0') 145 continue; 146 funcstring = q; 147 return rtn; 148} 149 150 151 152/* 153 * Free a parse tree. 154 */ 155 156void |
157freefunc(union node *n) |
158{ 159 if (n) 160 ckfree(n); 161} |