nodes.c.pat revision 22988 
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
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 *    must display the following acknowledgement:
18 *	This product includes software developed by the University of
19 *	California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 *    may be used to endorse or promote products derived from this software
22 *    without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
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 *	$Id$
38 */
39
40#include <stdlib.h>
41/*
42 * Routine for dealing with parsed shell commands.
43 */
44
45#include "shell.h"
46#include "nodes.h"
47#include "memalloc.h"
48#include "machdep.h"
49#include "mystring.h"
50
51
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 = 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 += 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	register char *p = s;
147	register 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}
169