for.c revision 1.101 1 1.101 rillig /* $NetBSD: for.c,v 1.101 2020/10/25 15:15:45 rillig Exp $ */
2 1.3 christos
3 1.1 cgd /*
4 1.1 cgd * Copyright (c) 1992, The Regents of the University of California.
5 1.1 cgd * All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.15 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.1 cgd /*-
33 1.80 rillig * Handling of .for/.endfor loops in a makefile.
34 1.80 rillig *
35 1.80 rillig * For loops are of the form:
36 1.80 rillig *
37 1.80 rillig * .for <varname...> in <value...>
38 1.80 rillig * ...
39 1.80 rillig * .endfor
40 1.80 rillig *
41 1.80 rillig * When a .for line is parsed, all following lines are accumulated into a
42 1.80 rillig * buffer, up to but excluding the corresponding .endfor line. To find the
43 1.80 rillig * corresponding .endfor, the number of nested .for and .endfor directives
44 1.80 rillig * are counted.
45 1.80 rillig *
46 1.80 rillig * During parsing, any nested .for loops are just passed through; they get
47 1.80 rillig * handled recursively in For_Eval when the enclosing .for loop is evaluated
48 1.80 rillig * in For_Run.
49 1.80 rillig *
50 1.80 rillig * When the .for loop has been parsed completely, the variable expressions
51 1.80 rillig * for the iteration variables are replaced with expressions of the form
52 1.80 rillig * ${:Uvalue}, and then this modified body is "included" as a special file.
53 1.1 cgd *
54 1.1 cgd * Interface:
55 1.88 rillig * For_Eval Evaluate the loop in the passed line.
56 1.88 rillig *
57 1.1 cgd * For_Run Run accumulated loop
58 1.1 cgd */
59 1.1 cgd
60 1.1 cgd #include "make.h"
61 1.1 cgd
62 1.83 rillig /* "@(#)for.c 8.1 (Berkeley) 6/6/93" */
63 1.101 rillig MAKE_RCSID("$NetBSD: for.c,v 1.101 2020/10/25 15:15:45 rillig Exp $");
64 1.83 rillig
65 1.94 rillig typedef enum ForEscapes {
66 1.75 rillig FOR_SUB_ESCAPE_CHAR = 0x0001,
67 1.75 rillig FOR_SUB_ESCAPE_BRACE = 0x0002,
68 1.75 rillig FOR_SUB_ESCAPE_PAREN = 0x0004
69 1.75 rillig } ForEscapes;
70 1.42 dsl
71 1.63 rillig static int forLevel = 0; /* Nesting level */
72 1.1 cgd
73 1.96 rillig /* One of the variables to the left of the "in" in a .for loop. */
74 1.96 rillig typedef struct ForVar {
75 1.96 rillig char *name;
76 1.96 rillig size_t len;
77 1.96 rillig } ForVar;
78 1.96 rillig
79 1.1 cgd /*
80 1.1 cgd * State of a for loop.
81 1.1 cgd */
82 1.86 rillig typedef struct For {
83 1.63 rillig Buffer buf; /* Body of loop */
84 1.101 rillig Vector /* of ForVar */ vars; /* Iteration variables */
85 1.101 rillig Vector /* of char * */ items; /* Substitution items */
86 1.63 rillig char *parse_buf;
87 1.69 rillig /* Is any of the names 1 character long? If so, when the variable values
88 1.69 rillig * are substituted, the parser must handle $V expressions as well, not
89 1.69 rillig * only ${V} and $(V). */
90 1.69 rillig Boolean short_var;
91 1.93 rillig unsigned int sub_next;
92 1.2 jtc } For;
93 1.1 cgd
94 1.63 rillig static For *accumFor; /* Loop being accumulated */
95 1.1 cgd
96 1.96 rillig static void
97 1.96 rillig ForAddVar(For *f, const char *name, size_t len)
98 1.96 rillig {
99 1.96 rillig ForVar *var = Vector_Push(&f->vars);
100 1.96 rillig var->name = bmake_strldup(name, len);
101 1.96 rillig var->len = len;
102 1.96 rillig }
103 1.96 rillig
104 1.96 rillig static void
105 1.96 rillig ForVarDone(ForVar *var)
106 1.96 rillig {
107 1.96 rillig free(var->name);
108 1.96 rillig }
109 1.96 rillig
110 1.101 rillig static const char *
111 1.101 rillig ForItem(For *f, size_t i)
112 1.101 rillig {
113 1.101 rillig const char **item = Vector_Get(&f->items, i);
114 1.101 rillig return *item;
115 1.101 rillig }
116 1.101 rillig
117 1.96 rillig static void
118 1.100 rillig ForAddItem(For *f, const char *value)
119 1.96 rillig {
120 1.101 rillig char **item = Vector_Push(&f->items);
121 1.101 rillig *item = bmake_strdup(value);
122 1.96 rillig }
123 1.96 rillig
124 1.96 rillig static void
125 1.101 rillig ForItemDone(char **item)
126 1.96 rillig {
127 1.101 rillig free(*item);
128 1.96 rillig }
129 1.7 christos
130 1.43 dsl static void
131 1.43 dsl For_Free(For *arg)
132 1.43 dsl {
133 1.46 dsl Buf_Destroy(&arg->buf, TRUE);
134 1.96 rillig
135 1.96 rillig while (arg->vars.len > 0)
136 1.96 rillig ForVarDone(Vector_Pop(&arg->vars));
137 1.96 rillig Vector_Done(&arg->vars);
138 1.96 rillig
139 1.96 rillig while (arg->items.len > 0)
140 1.96 rillig ForItemDone(Vector_Pop(&arg->items));
141 1.96 rillig Vector_Done(&arg->items);
142 1.96 rillig
143 1.43 dsl free(arg->parse_buf);
144 1.43 dsl
145 1.43 dsl free(arg);
146 1.43 dsl }
147 1.43 dsl
148 1.99 rillig static ForEscapes
149 1.99 rillig GetEscapes(const char *word)
150 1.99 rillig {
151 1.99 rillig const char *p;
152 1.99 rillig ForEscapes escapes = 0;
153 1.99 rillig
154 1.99 rillig for (p = word; *p != '\0'; p++) {
155 1.99 rillig switch (*p) {
156 1.99 rillig case ':':
157 1.99 rillig case '$':
158 1.99 rillig case '\\':
159 1.99 rillig escapes |= FOR_SUB_ESCAPE_CHAR;
160 1.99 rillig break;
161 1.99 rillig case ')':
162 1.99 rillig escapes |= FOR_SUB_ESCAPE_PAREN;
163 1.99 rillig break;
164 1.99 rillig case '}':
165 1.99 rillig escapes |= FOR_SUB_ESCAPE_BRACE;
166 1.99 rillig break;
167 1.99 rillig }
168 1.99 rillig }
169 1.99 rillig return escapes;
170 1.99 rillig }
171 1.99 rillig
172 1.70 rillig /* Evaluate the for loop in the passed line. The line looks like this:
173 1.70 rillig * .for <varname...> in <value...>
174 1.1 cgd *
175 1.13 wiz * Input:
176 1.13 wiz * line Line to parse
177 1.13 wiz *
178 1.1 cgd * Results:
179 1.35 dsl * 0: Not a .for statement, parse the line
180 1.35 dsl * 1: We found a for loop
181 1.35 dsl * -1: A .for statement with a bad syntax error, discard.
182 1.1 cgd */
183 1.1 cgd int
184 1.73 rillig For_Eval(const char *line)
185 1.1 cgd {
186 1.43 dsl For *new_for;
187 1.72 rillig const char *ptr;
188 1.67 rillig Words words;
189 1.33 dsl
190 1.43 dsl /* Skip the '.' and any following whitespace */
191 1.92 rillig ptr = line + 1;
192 1.92 rillig cpp_skip_whitespace(&ptr);
193 1.43 dsl
194 1.32 dsl /*
195 1.32 dsl * If we are not in a for loop quickly determine if the statement is
196 1.32 dsl * a for.
197 1.32 dsl */
198 1.32 dsl if (ptr[0] != 'f' || ptr[1] != 'o' || ptr[2] != 'r' ||
199 1.79 rillig !ch_isspace(ptr[3])) {
200 1.63 rillig if (ptr[0] == 'e' && strncmp(ptr + 1, "ndfor", 5) == 0) {
201 1.32 dsl Parse_Error(PARSE_FATAL, "for-less endfor");
202 1.32 dsl return -1;
203 1.32 dsl }
204 1.32 dsl return 0;
205 1.32 dsl }
206 1.32 dsl ptr += 3;
207 1.1 cgd
208 1.32 dsl /*
209 1.32 dsl * we found a for loop, and now we are going to parse it.
210 1.32 dsl */
211 1.1 cgd
212 1.43 dsl new_for = bmake_malloc(sizeof *new_for);
213 1.71 rillig Buf_Init(&new_for->buf, 0);
214 1.96 rillig Vector_Init(&new_for->vars, sizeof(ForVar));
215 1.101 rillig Vector_Init(&new_for->items, sizeof(char *));
216 1.71 rillig new_for->parse_buf = NULL;
217 1.71 rillig new_for->short_var = FALSE;
218 1.71 rillig new_for->sub_next = 0;
219 1.43 dsl
220 1.33 dsl /* Grab the variables. Terminate on "in". */
221 1.93 rillig for (;;) {
222 1.72 rillig size_t len;
223 1.72 rillig
224 1.92 rillig cpp_skip_whitespace(&ptr);
225 1.33 dsl if (*ptr == '\0') {
226 1.33 dsl Parse_Error(PARSE_FATAL, "missing `in' in for");
227 1.43 dsl For_Free(new_for);
228 1.33 dsl return -1;
229 1.33 dsl }
230 1.72 rillig
231 1.79 rillig for (len = 1; ptr[len] && !ch_isspace(ptr[len]); len++)
232 1.33 dsl continue;
233 1.33 dsl if (len == 2 && ptr[0] == 'i' && ptr[1] == 'n') {
234 1.33 dsl ptr += 2;
235 1.33 dsl break;
236 1.33 dsl }
237 1.43 dsl if (len == 1)
238 1.69 rillig new_for->short_var = TRUE;
239 1.69 rillig
240 1.96 rillig ForAddVar(new_for, ptr, len);
241 1.72 rillig ptr += len;
242 1.32 dsl }
243 1.1 cgd
244 1.96 rillig if (new_for->vars.len == 0) {
245 1.32 dsl Parse_Error(PARSE_FATAL, "no iteration variables in for");
246 1.43 dsl For_Free(new_for);
247 1.32 dsl return -1;
248 1.32 dsl }
249 1.4 christos
250 1.92 rillig cpp_skip_whitespace(&ptr);
251 1.32 dsl
252 1.32 dsl /*
253 1.70 rillig * Make a list with the remaining words.
254 1.70 rillig * The values are later substituted as ${:U<value>...} so we must
255 1.70 rillig * backslash-escape characters that break that syntax.
256 1.44 dsl * Variables are fully expanded - so it is safe for escape $.
257 1.44 dsl * We can't do the escapes here - because we don't know whether
258 1.70 rillig * we will be substituting into ${...} or $(...).
259 1.32 dsl */
260 1.72 rillig {
261 1.85 rillig char *items;
262 1.85 rillig (void)Var_Subst(ptr, VAR_GLOBAL, VARE_WANTRES, &items);
263 1.85 rillig /* TODO: handle errors */
264 1.72 rillig words = Str_Words(items, FALSE);
265 1.72 rillig free(items);
266 1.72 rillig }
267 1.54 rillig
268 1.67 rillig {
269 1.99 rillig size_t i;
270 1.65 rillig
271 1.99 rillig for (i = 0; i < words.len; i++) {
272 1.99 rillig const char *word = words.words[i];
273 1.72 rillig
274 1.99 rillig if (word[0] == '\0')
275 1.99 rillig continue; /* .for var in ${:U} */
276 1.99 rillig
277 1.100 rillig ForAddItem(new_for, word);
278 1.39 dsl }
279 1.72 rillig }
280 1.72 rillig
281 1.72 rillig Words_Free(words);
282 1.1 cgd
283 1.72 rillig {
284 1.95 rillig size_t nitems, nvars;
285 1.7 christos
286 1.96 rillig if ((nitems = new_for->items.len) > 0 &&
287 1.96 rillig nitems % (nvars = new_for->vars.len)) {
288 1.49 sjg Parse_Error(PARSE_FATAL,
289 1.65 rillig "Wrong number of words (%zu) in .for substitution list"
290 1.95 rillig " with %zu vars", nitems, nvars);
291 1.49 sjg /*
292 1.49 sjg * Return 'success' so that the body of the .for loop is
293 1.49 sjg * accumulated.
294 1.49 sjg * Remove all items so that the loop doesn't iterate.
295 1.49 sjg */
296 1.96 rillig while (new_for->items.len > 0)
297 1.96 rillig ForItemDone(Vector_Pop(&new_for->items));
298 1.49 sjg }
299 1.32 dsl }
300 1.32 dsl
301 1.43 dsl accumFor = new_for;
302 1.32 dsl forLevel = 1;
303 1.32 dsl return 1;
304 1.32 dsl }
305 1.7 christos
306 1.35 dsl /*
307 1.35 dsl * Add another line to a .for loop.
308 1.81 rillig * Returns FALSE when the matching .endfor is reached.
309 1.35 dsl */
310 1.81 rillig Boolean
311 1.73 rillig For_Accum(const char *line)
312 1.32 dsl {
313 1.73 rillig const char *ptr = line;
314 1.26 dsl
315 1.26 dsl if (*ptr == '.') {
316 1.92 rillig ptr++;
317 1.92 rillig cpp_skip_whitespace(&ptr);
318 1.1 cgd
319 1.79 rillig if (strncmp(ptr, "endfor", 6) == 0 && (ch_isspace(ptr[6]) || !ptr[6])) {
320 1.89 rillig DEBUG1(FOR, "For: end for %d\n", forLevel);
321 1.32 dsl if (--forLevel <= 0)
322 1.81 rillig return FALSE;
323 1.79 rillig } else if (strncmp(ptr, "for", 3) == 0 && ch_isspace(ptr[3])) {
324 1.1 cgd forLevel++;
325 1.89 rillig DEBUG1(FOR, "For: new loop %d\n", forLevel);
326 1.1 cgd }
327 1.1 cgd }
328 1.1 cgd
329 1.59 rillig Buf_AddStr(&accumFor->buf, line);
330 1.46 dsl Buf_AddByte(&accumFor->buf, '\n');
331 1.81 rillig return TRUE;
332 1.1 cgd }
333 1.1 cgd
334 1.42 dsl
335 1.59 rillig static size_t
336 1.45 dsl for_var_len(const char *var)
337 1.45 dsl {
338 1.45 dsl char ch, var_start, var_end;
339 1.61 rillig int depth;
340 1.61 rillig size_t len;
341 1.45 dsl
342 1.45 dsl var_start = *var;
343 1.45 dsl if (var_start == 0)
344 1.45 dsl /* just escape the $ */
345 1.45 dsl return 0;
346 1.45 dsl
347 1.45 dsl if (var_start == '(')
348 1.45 dsl var_end = ')';
349 1.45 dsl else if (var_start == '{')
350 1.45 dsl var_end = '}';
351 1.45 dsl else
352 1.45 dsl /* Single char variable */
353 1.45 dsl return 1;
354 1.45 dsl
355 1.61 rillig depth = 1;
356 1.45 dsl for (len = 1; (ch = var[len++]) != 0;) {
357 1.45 dsl if (ch == var_start)
358 1.45 dsl depth++;
359 1.45 dsl else if (ch == var_end && --depth == 0)
360 1.45 dsl return len;
361 1.45 dsl }
362 1.45 dsl
363 1.45 dsl /* Variable end not found, escape the $ */
364 1.45 dsl return 0;
365 1.45 dsl }
366 1.45 dsl
367 1.42 dsl static void
368 1.101 rillig for_substitute(Buffer *cmds, const char *item, char ech)
369 1.42 dsl {
370 1.100 rillig ForEscapes escapes = GetEscapes(item);
371 1.61 rillig char ch;
372 1.61 rillig
373 1.42 dsl /* If there were no escapes, or the only escape is the other variable
374 1.42 dsl * terminator, then just substitute the full string */
375 1.93 rillig if (!(escapes & (ech == ')' ? ~(unsigned)FOR_SUB_ESCAPE_BRACE
376 1.93 rillig : ~(unsigned)FOR_SUB_ESCAPE_PAREN))) {
377 1.59 rillig Buf_AddStr(cmds, item);
378 1.42 dsl return;
379 1.42 dsl }
380 1.42 dsl
381 1.74 rillig /* Escape ':', '$', '\\' and 'ech' - these will be removed later by
382 1.74 rillig * :U processing, see ApplyModifier_Defined. */
383 1.95 rillig while ((ch = *item++) != '\0') {
384 1.45 dsl if (ch == '$') {
385 1.59 rillig size_t len = for_var_len(item);
386 1.45 dsl if (len != 0) {
387 1.62 rillig Buf_AddBytes(cmds, item - 1, len + 1);
388 1.45 dsl item += len;
389 1.45 dsl continue;
390 1.45 dsl }
391 1.45 dsl Buf_AddByte(cmds, '\\');
392 1.45 dsl } else if (ch == ':' || ch == '\\' || ch == ech)
393 1.42 dsl Buf_AddByte(cmds, '\\');
394 1.42 dsl Buf_AddByte(cmds, ch);
395 1.42 dsl }
396 1.42 dsl }
397 1.42 dsl
398 1.97 rillig static void
399 1.97 rillig SubstVarLong(For *arg, const char **inout_cp, const char **inout_cmd_cp,
400 1.97 rillig Buffer *cmds, char ech)
401 1.97 rillig {
402 1.97 rillig size_t i;
403 1.97 rillig const char *cp = *inout_cp;
404 1.97 rillig const char *cmd_cp = *inout_cmd_cp;
405 1.97 rillig
406 1.97 rillig for (i = 0; i < arg->vars.len; i++) {
407 1.97 rillig ForVar *forVar = Vector_Get(&arg->vars, i);
408 1.97 rillig char *var = forVar->name;
409 1.97 rillig size_t vlen = forVar->len;
410 1.97 rillig
411 1.97 rillig /* XXX: undefined behavior for cp if vlen is longer than cp? */
412 1.97 rillig if (memcmp(cp, var, vlen) != 0)
413 1.97 rillig continue;
414 1.97 rillig /* XXX: why test for backslash here? */
415 1.97 rillig if (cp[vlen] != ':' && cp[vlen] != ech && cp[vlen] != '\\')
416 1.97 rillig continue;
417 1.97 rillig
418 1.97 rillig /* Found a variable match. Replace with :U<value> */
419 1.97 rillig Buf_AddBytesBetween(cmds, cmd_cp, cp);
420 1.97 rillig Buf_AddStr(cmds, ":U");
421 1.97 rillig cp += vlen;
422 1.97 rillig cmd_cp = cp;
423 1.101 rillig for_substitute(cmds, ForItem(arg, arg->sub_next + i), ech);
424 1.97 rillig break;
425 1.97 rillig }
426 1.97 rillig
427 1.97 rillig *inout_cp = cp;
428 1.97 rillig *inout_cmd_cp = cmd_cp;
429 1.97 rillig }
430 1.97 rillig
431 1.98 rillig static void
432 1.98 rillig SubstVarShort(For *arg, char const ch,
433 1.98 rillig const char **inout_cp, const char **input_cmd_cp, Buffer *cmds)
434 1.98 rillig {
435 1.98 rillig const char *cp = *inout_cp;
436 1.98 rillig const char *cmd_cp = *input_cmd_cp;
437 1.98 rillig size_t i;
438 1.98 rillig
439 1.98 rillig /* Probably a single character name, ignore $$ and stupid ones. {*/
440 1.98 rillig if (!arg->short_var || strchr("}):$", ch) != NULL) {
441 1.98 rillig cp++;
442 1.98 rillig *inout_cp = cp;
443 1.98 rillig return;
444 1.98 rillig }
445 1.98 rillig
446 1.98 rillig for (i = 0; i < arg->vars.len; i++) {
447 1.98 rillig ForVar *forVar = Vector_Get(&arg->vars, i);
448 1.98 rillig char *var = forVar->name;
449 1.98 rillig if (var[0] != ch || var[1] != 0)
450 1.98 rillig continue;
451 1.98 rillig
452 1.98 rillig /* Found a variable match. Replace with ${:U<value>} */
453 1.98 rillig Buf_AddBytesBetween(cmds, cmd_cp, cp);
454 1.98 rillig Buf_AddStr(cmds, "{:U");
455 1.98 rillig cmd_cp = ++cp;
456 1.101 rillig for_substitute(cmds, ForItem(arg, arg->sub_next + i), '}');
457 1.98 rillig Buf_AddByte(cmds, '}');
458 1.98 rillig break;
459 1.98 rillig }
460 1.98 rillig
461 1.98 rillig *inout_cp = cp;
462 1.98 rillig *input_cmd_cp = cmd_cp;
463 1.98 rillig }
464 1.98 rillig
465 1.95 rillig /*
466 1.95 rillig * Scan the for loop body and replace references to the loop variables
467 1.95 rillig * with variable references that expand to the required text.
468 1.95 rillig *
469 1.95 rillig * Using variable expansions ensures that the .for loop can't generate
470 1.95 rillig * syntax, and that the later parsing will still see a variable.
471 1.95 rillig * We assume that the null variable will never be defined.
472 1.95 rillig *
473 1.95 rillig * The detection of substitutions of the loop control variable is naive.
474 1.95 rillig * Many of the modifiers use \ to escape $ (not $) so it is possible
475 1.95 rillig * to contrive a makefile where an unwanted substitution happens.
476 1.95 rillig */
477 1.43 dsl static char *
478 1.68 rillig ForIterate(void *v_arg, size_t *ret_len)
479 1.1 cgd {
480 1.43 dsl For *arg = v_arg;
481 1.77 rillig const char *cp;
482 1.77 rillig const char *cmd_cp;
483 1.77 rillig const char *body_end;
484 1.39 dsl Buffer cmds;
485 1.76 rillig char *cmds_str;
486 1.61 rillig size_t cmd_len;
487 1.7 christos
488 1.96 rillig if (arg->sub_next + arg->vars.len > arg->items.len) {
489 1.43 dsl /* No more iterations */
490 1.43 dsl For_Free(arg);
491 1.43 dsl return NULL;
492 1.43 dsl }
493 1.1 cgd
494 1.43 dsl free(arg->parse_buf);
495 1.43 dsl arg->parse_buf = NULL;
496 1.7 christos
497 1.62 rillig cmd_cp = Buf_GetAll(&arg->buf, &cmd_len);
498 1.59 rillig body_end = cmd_cp + cmd_len;
499 1.62 rillig Buf_Init(&cmds, cmd_len + 256);
500 1.43 dsl for (cp = cmd_cp; (cp = strchr(cp, '$')) != NULL;) {
501 1.95 rillig char ch, ech;
502 1.43 dsl ch = *++cp;
503 1.53 riastrad if ((ch == '(' && (ech = ')', 1)) || (ch == '{' && (ech = '}', 1))) {
504 1.43 dsl cp++;
505 1.43 dsl /* Check variable name against the .for loop variables */
506 1.97 rillig SubstVarLong(arg, &cp, &cmd_cp, &cmds, ech);
507 1.43 dsl continue;
508 1.43 dsl }
509 1.95 rillig if (ch == '\0')
510 1.43 dsl break;
511 1.97 rillig
512 1.98 rillig SubstVarShort(arg, ch, &cp, &cmd_cp, &cmds);
513 1.43 dsl }
514 1.59 rillig Buf_AddBytesBetween(&cmds, cmd_cp, body_end);
515 1.43 dsl
516 1.87 rillig *ret_len = Buf_Len(&cmds);
517 1.76 rillig cmds_str = Buf_Destroy(&cmds, FALSE);
518 1.89 rillig DEBUG1(FOR, "For: loop body:\n%s", cmds_str);
519 1.39 dsl
520 1.96 rillig arg->sub_next += arg->vars.len;
521 1.43 dsl
522 1.76 rillig arg->parse_buf = cmds_str;
523 1.76 rillig return cmds_str;
524 1.43 dsl }
525 1.7 christos
526 1.60 rillig /* Run the for loop, imitating the actions of an include file. */
527 1.43 dsl void
528 1.43 dsl For_Run(int lineno)
529 1.54 rillig {
530 1.43 dsl For *arg;
531 1.54 rillig
532 1.43 dsl arg = accumFor;
533 1.43 dsl accumFor = NULL;
534 1.1 cgd
535 1.96 rillig if (arg->items.len == 0) {
536 1.58 rillig /* Nothing to expand - possibly due to an earlier syntax error. */
537 1.58 rillig For_Free(arg);
538 1.58 rillig return;
539 1.43 dsl }
540 1.54 rillig
541 1.68 rillig Parse_SetInput(NULL, lineno, -1, ForIterate, arg);
542 1.1 cgd }
543