nodes.c.pat revision 1.12.48.1 1 1.12.48.1 yamt /* $NetBSD: nodes.c.pat,v 1.12.48.1 2012/04/17 00:01:38 yamt 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.11 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd *
34 1.7 christos * @(#)nodes.c.pat 8.2 (Berkeley) 5/4/95
35 1.1 cgd */
36 1.1 cgd
37 1.7 christos #include <stdlib.h>
38 1.1 cgd /*
39 1.1 cgd * Routine for dealing with parsed shell commands.
40 1.1 cgd */
41 1.1 cgd
42 1.1 cgd #include "shell.h"
43 1.1 cgd #include "nodes.h"
44 1.1 cgd #include "memalloc.h"
45 1.1 cgd #include "machdep.h"
46 1.1 cgd #include "mystring.h"
47 1.1 cgd
48 1.1 cgd
49 1.7 christos int funcblocksize; /* size of structures in function */
50 1.7 christos int funcstringsize; /* size of strings in node */
51 1.1 cgd pointer funcblock; /* block to allocate function from */
52 1.7 christos char *funcstring; /* block to allocate strings from */
53 1.1 cgd
54 1.1 cgd %SIZES
55 1.1 cgd
56 1.1 cgd
57 1.10 christos STATIC void calcsize(union node *);
58 1.10 christos STATIC void sizenodelist(struct nodelist *);
59 1.10 christos STATIC union node *copynode(union node *);
60 1.10 christos STATIC struct nodelist *copynodelist(struct nodelist *);
61 1.10 christos STATIC char *nodesavestr(char *);
62 1.1 cgd
63 1.1 cgd
64 1.1 cgd
65 1.1 cgd /*
66 1.1 cgd * Make a copy of a parse tree.
67 1.1 cgd */
68 1.1 cgd
69 1.1 cgd union node *
70 1.12.48.1 yamt copyfunc(union node *n)
71 1.7 christos {
72 1.7 christos if (n == NULL)
73 1.7 christos return NULL;
74 1.7 christos funcblocksize = 0;
75 1.7 christos funcstringsize = 0;
76 1.7 christos calcsize(n);
77 1.7 christos funcblock = ckmalloc(funcblocksize + funcstringsize);
78 1.8 christos funcstring = (char *) funcblock + funcblocksize;
79 1.7 christos return copynode(n);
80 1.1 cgd }
81 1.1 cgd
82 1.1 cgd
83 1.1 cgd
84 1.1 cgd STATIC void
85 1.12.48.1 yamt calcsize(union node *n)
86 1.7 christos {
87 1.7 christos %CALCSIZE
88 1.1 cgd }
89 1.1 cgd
90 1.1 cgd
91 1.1 cgd
92 1.1 cgd STATIC void
93 1.12.48.1 yamt sizenodelist(struct nodelist *lp)
94 1.7 christos {
95 1.7 christos while (lp) {
96 1.9 christos funcblocksize += SHELL_ALIGN(sizeof(struct nodelist));
97 1.7 christos calcsize(lp->n);
98 1.7 christos lp = lp->next;
99 1.7 christos }
100 1.1 cgd }
101 1.1 cgd
102 1.1 cgd
103 1.1 cgd
104 1.1 cgd STATIC union node *
105 1.12.48.1 yamt copynode(union node *n)
106 1.7 christos {
107 1.7 christos union node *new;
108 1.1 cgd
109 1.7 christos %COPY
110 1.7 christos return new;
111 1.1 cgd }
112 1.1 cgd
113 1.1 cgd
114 1.1 cgd STATIC struct nodelist *
115 1.12.48.1 yamt copynodelist(struct nodelist *lp)
116 1.7 christos {
117 1.7 christos struct nodelist *start;
118 1.7 christos struct nodelist **lpp;
119 1.7 christos
120 1.7 christos lpp = &start;
121 1.7 christos while (lp) {
122 1.7 christos *lpp = funcblock;
123 1.9 christos funcblock = (char *) funcblock +
124 1.9 christos SHELL_ALIGN(sizeof(struct nodelist));
125 1.7 christos (*lpp)->n = copynode(lp->n);
126 1.7 christos lp = lp->next;
127 1.7 christos lpp = &(*lpp)->next;
128 1.7 christos }
129 1.7 christos *lpp = NULL;
130 1.7 christos return start;
131 1.1 cgd }
132 1.1 cgd
133 1.1 cgd
134 1.1 cgd
135 1.1 cgd STATIC char *
136 1.12.48.1 yamt nodesavestr(char *s)
137 1.7 christos {
138 1.7 christos register char *p = s;
139 1.7 christos register char *q = funcstring;
140 1.7 christos char *rtn = funcstring;
141 1.7 christos
142 1.12 dsl while ((*q++ = *p++) != 0)
143 1.7 christos continue;
144 1.7 christos funcstring = q;
145 1.7 christos return rtn;
146 1.1 cgd }
147 1.1 cgd
148 1.1 cgd
149 1.1 cgd
150 1.1 cgd /*
151 1.1 cgd * Free a parse tree.
152 1.1 cgd */
153 1.1 cgd
154 1.1 cgd void
155 1.12.48.1 yamt freefunc(union node *n)
156 1.7 christos {
157 1.7 christos if (n)
158 1.7 christos ckfree(n);
159 1.1 cgd }
160