[go: up one dir, main page]

File: list.c

package info (click to toggle)
cook 2.19-2
  • links: PTS
  • area: main
  • in suites: woody
  • size: 7,316 kB
  • ctags: 3,969
  • sloc: ansic: 50,331; sh: 13,190; makefile: 4,542; yacc: 3,174; perl: 224; awk: 154
file content (301 lines) | stat: -rw-r--r-- 6,596 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
/*
 *	cook - file construction tool
 *	Copyright (C) 1997, 2001 Peter Miller;
 *	All rights reserved.
 *
 *	This program is free software; you can redistribute it and/or modify
 *	it under the terms of the GNU General Public License as published by
 *	the Free Software Foundation; either version 2 of the License, or
 *	(at your option) any later version.
 *
 *	This program is distributed in the hope that it will be useful,
 *	but WITHOUT ANY WARRANTY; without even the implied warranty of
 *	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *	GNU General Public License for more details.
 *
 *	You should have received a copy of the GNU General Public License
 *	along with this program; if not, write to the Free Software
 *	Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
 *
 * MANIFEST: functions to manipulate expression lists
 */

#include <expr.h>
#include <expr/list.h>
#include <match.h>
#include <mem.h>
#include <opcode/list.h>
#include <opcode/push.h>
#include <str_list.h>
#include <trace.h>


/*
 * NAME
 *	expr_list_destructor - free expression lists
 *
 * SYNOPSIS
 *	void expr_list_destructor(expr_list_ty *elp);
 *
 * DESCRIPTION
 *	The expr_list_destructor function is used to free expression lists,
 *	it calls expr_free for each expression in the list.
 *
 * CAVEAT
 *	It is assumed that the expressions are dynamically allocated,
 *	and that the expression list was grown using expr_list_append().
 *	The actual structure pointed to is NOT assumed to be in dynamic memory
 *	and should not be passed to free().
 */

void
expr_list_destructor(elp)
	expr_list_ty	*elp;
{
	size_t		j;

	trace(("expr_list_destructor(elp = %08X)\n{\n"/*}*/, elp));
	for (j = 0; j < elp->el_nexprs; j++)
		expr_delete(elp->el_expr[j]);
	if (elp->el_nexprs)
		mem_free(elp->el_expr);
	elp->el_nexprs = 0;
	elp->el_nexprs_max = 0;
	elp->el_expr = 0;
	trace((/*{*/"}\n"));
}


/*
 * NAME
 *	expr_list_delete
 *
 * SYNOPSIS
 *	void expr_list_delete(expr_list_ty *);
 *
 * DESCRIPTION
 *	The expr_list_delete function is used to release the resources
 *	held by an expression list.
 */

void
expr_list_delete(elp)
	expr_list_ty	*elp;
{
	expr_list_destructor(elp);
	mem_free(elp);
}


/*
 * NAME
 *	expr_list_copy_constructor - copy expression list
 *
 * SYNOPSIS
 *	void expr_list_copy_constructor(expr_list_ty *to, expr_list_ty *from);
 *
 * DESCRIPTION
 *	The expr_list_copy_constructor function is used to copy the list
 *	of expression trees pointed to by `from' into the expression
 *	list pointed to by `to'.
 *
 * RETURNS
 *	void
 *
 * CAVEAT
 *	The expr_list_destructor function must be used to dispose of
 *	the list when finished with.
 */

void
expr_list_copy_constructor(to, from)
	expr_list_ty	*to;
	const expr_list_ty *from;
{
	size_t		j;

	trace(("expr_list_copy_constructor(to = %08X, from = %08X)\n{\n"/*}*/,
		to, from));
	expr_list_constructor(to);
	for (j = 0; j < from->el_nexprs; j++)
		expr_list_append(to, from->el_expr[j]);
	trace((/*{*/"}\n"));
}


/*
 * NAME
 *	expr_list_append - append to an expression list
 *
 * SYNOPSIS
 *	void expr_list_append(expr_list_ty *el, expr *e);
 *
 * DESCRIPTION
 *	The expr_list_append function is used to append an expression
 *	to an expression list.
 *
 * RETURNS
 *	void
 *
 * CAVEAT
 *	The expression has not been copied, so do not hand it
 *	to expr_free after you append it.
 *
 *	It is assumed that the expr_list_ty has been previously initialised by a
 *	    expr_list_ty el;
 *	    expr_list_constructor(&el);
 *	statement (or similar) before this function is called.
 */

void
expr_list_append(el, e)
	expr_list_ty	*el;
	expr_ty		*e;
{
	size_t		nbytes;

	trace(("expr_list_append(el = %08X, e = %08X)\n{\n"/*}*/, el, e));
	assert(el);
	assert(e);
	assert(!el->el_nexprs_max || !!el->el_expr);
	if (el->el_nexprs >= el->el_nexprs_max)
	{
		el->el_nexprs_max = el->el_nexprs_max * 2 + 8;
		nbytes = el->el_nexprs_max * sizeof(expr_ty *);
		el->el_expr = mem_change_size(el->el_expr, nbytes);
	}
	el->el_expr[el->el_nexprs++] = expr_copy(e);
	trace((/*{*/"}\n"));
}


/*
 * NAME
 *      expr_list_evaluate - expression list to word list
 *
 * SYNOPSIS
 *      int expr_list_evaluate(string_list_ty *wl, expr_list_ty *el);
 *
 * DESCRIPTION
 *	The expr_list_evaluate function is used to turn an expression
 *	list into a word list.
 *
 * RETURNS
 *      string_list_ty *; or the NULL pointer on error
 *
 * CAVEAT
 *      Use string_list_delete when you are done with it.
 */

string_list_ty *
expr_list_evaluate(elp, mp)
        const expr_list_ty *elp;
        const match_ty	*mp;
{
        opcode_list_ty	*olp;
        string_list_ty	*result;

        trace(("expr_list_evaluate(elp = %08X)\n{\n"/*}*/, (long)elp));
        olp = opcode_list_new();
        opcode_list_append(olp, opcode_push_new());
        expr_list_code_generate(elp, olp);
        result = opcode_list_run(olp, mp);
        opcode_list_delete(olp);
        trace(("return %08lX;\n", result));
	trace((/*{*/"}\n"));
        return result;
}


/*
 * NAME
 *	expr_list_constructor
 *
 * SYNOPSIS
 *	void expr_list_constructor(expr_list_ty *);
 *
 * DESCRIPTION
 *	The expr_list_constructor function is used to initialize an
 *	expression list before use.
 */

void
expr_list_constructor(elp)
	expr_list_ty	*elp;
{
	elp->el_nexprs = 0;
	elp->el_nexprs_max = 0;
	elp->el_expr = 0;
}


/*
 * NAME
 *	expr_list_new
 *
 * SYNOPSIS
 *	opcode_list_ty *expr_list_new(void);
 *
 * DESCRIPTION
 *	The expr_list_new function is used to allocate and initialize an
 *	new expression list instance in dynamic memory.
 *
 * CAVEAT
 *	Use opcode_list_delete when you are done with it.
 */

expr_list_ty *
expr_list_new()
{
	expr_list_ty	*elp;

	elp = mem_alloc(sizeof(expr_list_ty));
	expr_list_constructor(elp);
	return elp;
}


/*
 * NAME
 *	expr_list_code_generate
 *
 * SYNOPSIS
 *	void expr_list_code_generate(expr_list_ty *, opcode_list_ty *);
 *
 * DESCRIPTION
 *	The expr_list_code_generate function is used to generate the
 *	code stream for a list of expressions.
 */

void
expr_list_code_generate(elp, olp)
	const expr_list_ty *elp;
	opcode_list_ty	*olp;
{
	size_t		j;

	for (j = 0; j < elp->el_nexprs; ++j)
		expr_code_generate(elp->el_expr[j], olp);
}


/*
 * NAME
 *	expr_list_position
 *
 * SYNOPSIS
 *	expr_position_ty *expr_list_position(expr_list_ty *);
 *
 * DESCRIPTION
 *	The expr_list_position function is used to find a position
 *	indicator for an expressin list.
 */

expr_position_ty *
expr_list_position(elp)
	const expr_list_ty *elp;
{
	if (elp->el_nexprs > 0)
		return &elp->el_expr[0]->e_position;
	return 0;
}