nodes.c.pat revision 1.7 1 1.6 cgd /* $NetBSD: nodes.c.pat,v 1.7 1995/05/11 21:29:43 christos Exp $ */
2 1.6 cgd
3 1.1 cgd /*-
4 1.4 jtc * Copyright (c) 1991, 1993
5 1.4 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Kenneth Almquist.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd *
38 1.7 christos * @(#)nodes.c.pat 8.2 (Berkeley) 5/4/95
39 1.1 cgd */
40 1.1 cgd
41 1.7 christos #include <stdlib.h>
42 1.1 cgd /*
43 1.1 cgd * Routine for dealing with parsed shell commands.
44 1.1 cgd */
45 1.1 cgd
46 1.1 cgd #include "shell.h"
47 1.1 cgd #include "nodes.h"
48 1.1 cgd #include "memalloc.h"
49 1.1 cgd #include "machdep.h"
50 1.1 cgd #include "mystring.h"
51 1.1 cgd
52 1.1 cgd
53 1.7 christos int funcblocksize; /* size of structures in function */
54 1.7 christos int funcstringsize; /* size of strings in node */
55 1.1 cgd pointer funcblock; /* block to allocate function from */
56 1.7 christos char *funcstring; /* block to allocate strings from */
57 1.1 cgd
58 1.1 cgd %SIZES
59 1.1 cgd
60 1.1 cgd
61 1.7 christos STATIC void calcsize __P((union node *));
62 1.7 christos STATIC void sizenodelist __P((struct nodelist *));
63 1.7 christos STATIC union node *copynode __P((union node *));
64 1.7 christos STATIC struct nodelist *copynodelist __P((struct nodelist *));
65 1.7 christos STATIC char *nodesavestr __P((char *));
66 1.1 cgd
67 1.1 cgd
68 1.1 cgd
69 1.1 cgd /*
70 1.1 cgd * Make a copy of a parse tree.
71 1.1 cgd */
72 1.1 cgd
73 1.1 cgd union node *
74 1.1 cgd copyfunc(n)
75 1.7 christos union node *n;
76 1.7 christos {
77 1.7 christos if (n == NULL)
78 1.7 christos return NULL;
79 1.7 christos funcblocksize = 0;
80 1.7 christos funcstringsize = 0;
81 1.7 christos calcsize(n);
82 1.7 christos funcblock = ckmalloc(funcblocksize + funcstringsize);
83 1.7 christos funcstring = funcblock + funcblocksize;
84 1.7 christos return copynode(n);
85 1.1 cgd }
86 1.1 cgd
87 1.1 cgd
88 1.1 cgd
89 1.1 cgd STATIC void
90 1.1 cgd calcsize(n)
91 1.7 christos union node *n;
92 1.7 christos {
93 1.7 christos %CALCSIZE
94 1.1 cgd }
95 1.1 cgd
96 1.1 cgd
97 1.1 cgd
98 1.1 cgd STATIC void
99 1.1 cgd sizenodelist(lp)
100 1.7 christos struct nodelist *lp;
101 1.7 christos {
102 1.7 christos while (lp) {
103 1.7 christos funcblocksize += ALIGN(sizeof(struct nodelist));
104 1.7 christos calcsize(lp->n);
105 1.7 christos lp = lp->next;
106 1.7 christos }
107 1.1 cgd }
108 1.1 cgd
109 1.1 cgd
110 1.1 cgd
111 1.1 cgd STATIC union node *
112 1.1 cgd copynode(n)
113 1.7 christos union node *n;
114 1.7 christos {
115 1.7 christos union node *new;
116 1.1 cgd
117 1.7 christos %COPY
118 1.7 christos return new;
119 1.1 cgd }
120 1.1 cgd
121 1.1 cgd
122 1.1 cgd STATIC struct nodelist *
123 1.1 cgd copynodelist(lp)
124 1.7 christos struct nodelist *lp;
125 1.7 christos {
126 1.7 christos struct nodelist *start;
127 1.7 christos struct nodelist **lpp;
128 1.7 christos
129 1.7 christos lpp = &start;
130 1.7 christos while (lp) {
131 1.7 christos *lpp = funcblock;
132 1.7 christos funcblock += ALIGN(sizeof(struct nodelist));
133 1.7 christos (*lpp)->n = copynode(lp->n);
134 1.7 christos lp = lp->next;
135 1.7 christos lpp = &(*lpp)->next;
136 1.7 christos }
137 1.7 christos *lpp = NULL;
138 1.7 christos return start;
139 1.1 cgd }
140 1.1 cgd
141 1.1 cgd
142 1.1 cgd
143 1.1 cgd STATIC char *
144 1.1 cgd nodesavestr(s)
145 1.7 christos char *s;
146 1.7 christos {
147 1.7 christos register char *p = s;
148 1.7 christos register char *q = funcstring;
149 1.7 christos char *rtn = funcstring;
150 1.7 christos
151 1.7 christos while ((*q++ = *p++) != '\0')
152 1.7 christos continue;
153 1.7 christos funcstring = q;
154 1.7 christos return rtn;
155 1.1 cgd }
156 1.1 cgd
157 1.1 cgd
158 1.1 cgd
159 1.1 cgd /*
160 1.1 cgd * Free a parse tree.
161 1.1 cgd */
162 1.1 cgd
163 1.1 cgd void
164 1.1 cgd freefunc(n)
165 1.7 christos union node *n;
166 1.7 christos {
167 1.7 christos if (n)
168 1.7 christos ckfree(n);
169 1.1 cgd }
170