VirtualBox

source: kBuild/trunk/src/kash/nodes.c.pat@ 2291

Last change on this file since 2291 was 2290, checked in by bird, 16 years ago

kash: malloc/free/friends gets a psh.

  • Property svn:eol-style set to LF
  • Property svn:keywords set to Id
File size: 3.7 KB
Line 
1/* $NetBSD: nodes.c.pat,v 1.12 2004/06/15 22:57:27 dsl 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#include "shinstance.h"
48
49
50int funcblocksize; /* size of structures in function */
51int funcstringsize; /* size of strings in node */
52pointer funcblock; /* block to allocate function from */
53char *funcstring; /* block to allocate strings from */
54
55%SIZES
56
57
58STATIC void calcsize(union node *);
59STATIC void sizenodelist(struct nodelist *);
60STATIC union node *copynode(union node *);
61STATIC struct nodelist *copynodelist(struct nodelist *);
62STATIC char *nodesavestr(char *);
63
64
65
66/*
67 * Make a copy of a parse tree.
68 */
69
70union node *
71copyfunc(psh, n)
72 struct shinstance *psh;
73 union node *n;
74{
75 if (n == NULL)
76 return NULL;
77 funcblocksize = 0;
78 funcstringsize = 0;
79 calcsize(n);
80 funcblock = ckmalloc(psh, funcblocksize + funcstringsize);
81 funcstring = (char *) funcblock + funcblocksize;
82 return copynode(n);
83}
84
85
86
87STATIC void
88calcsize(n)
89 union node *n;
90{
91 %CALCSIZE
92}
93
94
95
96STATIC void
97sizenodelist(lp)
98 struct nodelist *lp;
99{
100 while (lp) {
101 funcblocksize += SHELL_ALIGN(sizeof(struct nodelist));
102 calcsize(lp->n);
103 lp = lp->next;
104 }
105}
106
107
108
109STATIC union node *
110copynode(n)
111 union node *n;
112{
113 union node *new;
114
115 %COPY
116 return new;
117}
118
119
120STATIC struct nodelist *
121copynodelist(lp)
122 struct nodelist *lp;
123{
124 struct nodelist *start;
125 struct nodelist **lpp;
126
127 lpp = &start;
128 while (lp) {
129 *lpp = funcblock;
130 funcblock = (char *) funcblock +
131 SHELL_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(psh, n)
164 shinstance *psh;
165 union node *n;
166{
167 if (n)
168 ckfree(psh, n);
169}
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette