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 50471 1999-08-27 23:15:48Z peter $
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 __P((union node *));
61STATIC void sizenodelist __P((struct nodelist *));
62STATIC union node *copynode __P((union node *));
63STATIC struct nodelist *copynodelist __P((struct nodelist *));
64STATIC char *nodesavestr __P((char *));
65
66
67
68/*
69 * Make a copy of a parse tree.
70 */
71
72union node *
73copyfunc(n)
74 union node *n;
75{
76 if (n == NULL)
77 return NULL;
78 funcblocksize = 0;
79 funcstringsize = 0;
80 calcsize(n);
81 funcblock = ckmalloc(funcblocksize + funcstringsize);
82 funcstring = (char *)funcblock + funcblocksize;
83 return copynode(n);
84}
85
86
87
88STATIC void
89calcsize(n)
90 union node *n;
91{
92 %CALCSIZE
93}
94
95
96
97STATIC void
98sizenodelist(lp)
99 struct nodelist *lp;
100{
101 while (lp) {
102 funcblocksize += ALIGN(sizeof(struct nodelist));
103 calcsize(lp->n);
104 lp = lp->next;
105 }
106}
107
108
109
110STATIC union node *
111copynode(n)
112 union node *n;
113{
114 union node *new;
115
116 %COPY
117 return new;
118}
119
120
121STATIC struct nodelist *
122copynodelist(lp)
123 struct nodelist *lp;
124{
125 struct nodelist *start;
126 struct nodelist **lpp;
127
128 lpp = &start;
129 while (lp) {
130 *lpp = funcblock;
131 funcblock = (char *)funcblock + ALIGN(sizeof(struct nodelist));
132 (*lpp)->n = copynode(lp->n);
133 lp = lp->next;
134 lpp = &(*lpp)->next;
135 }
136 *lpp = NULL;
137 return start;
138}
139
140
141
142STATIC char *
143nodesavestr(s)
144 char *s;
145{
146 char *p = s;
147 char *q = funcstring;
148 char *rtn = funcstring;
149
150 while ((*q++ = *p++) != '\0')
151 continue;
152 funcstring = q;
153 return rtn;
154}
155
156
157
158/*
159 * Free a parse tree.
160 */
161
162void
163freefunc(n)
164 union node *n;
165{
166 if (n)
167 ckfree(n);
168}