1/* $NetBSD: nodes.c.pat,v 1.13 2012/03/20 18:42:29 matt 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 49int funcblocksize; /* size of structures in function */ 50int funcstringsize; /* size of strings in node */ 51pointer funcblock; /* block to allocate function from */ 52char *funcstring; /* block to allocate strings from */ 53 54%SIZES 55 56 57STATIC void calcsize(union node *); 58STATIC void sizenodelist(struct nodelist *); 59STATIC union node *copynode(union node *); 60STATIC struct nodelist *copynodelist(struct nodelist *); 61STATIC char *nodesavestr(char *); 62 63 64 65/* 66 * Make a copy of a parse tree. 67 */ 68 69union node * 70copyfunc(union node *n) 71{ 72 if (n == NULL) 73 return NULL; 74 funcblocksize = 0; 75 funcstringsize = 0; 76 calcsize(n); 77 funcblock = ckmalloc(funcblocksize + funcstringsize); 78 funcstring = (char *) funcblock + funcblocksize; 79 return copynode(n); 80} 81 82 83 84STATIC void 85calcsize(union node *n) 86{ 87 %CALCSIZE 88} 89 90 91 92STATIC void 93sizenodelist(struct nodelist *lp) 94{ 95 while (lp) { 96 funcblocksize += SHELL_ALIGN(sizeof(struct nodelist)); 97 calcsize(lp->n); 98 lp = lp->next; 99 } 100} 101 102 103 104STATIC union node * 105copynode(union node *n) 106{ 107 union node *new; 108 109 %COPY 110 return new; 111} 112 113 114STATIC struct nodelist * 115copynodelist(struct nodelist *lp) 116{ 117 struct nodelist *start; 118 struct nodelist **lpp; 119 120 lpp = &start; 121 while (lp) { 122 *lpp = funcblock; 123 funcblock = (char *) funcblock + 124 SHELL_ALIGN(sizeof(struct nodelist)); 125 (*lpp)->n = copynode(lp->n); 126 lp = lp->next; 127 lpp = &(*lpp)->next; 128 } 129 *lpp = NULL; 130 return start; 131} 132 133 134 135STATIC char * 136nodesavestr(char *s) 137{ 138 register char *p = s; 139 register char *q = funcstring; 140 char *rtn = funcstring; 141 142 while ((*q++ = *p++) != 0) 143 continue; 144 funcstring = q; 145 return rtn; 146} 147 148 149 150/* 151 * Free a parse tree. 152 */ 153 154void 155freefunc(union node *n) 156{ 157 if (n) 158 ckfree(n); 159} 160