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