for.c revision 1.105 1 1.105 rillig /* $NetBSD: for.c,v 1.105 2020/10/25 15:58:04 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.105 rillig MAKE_RCSID("$NetBSD: for.c,v 1.105 2020/10/25 15:58:04 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.103 rillig Buffer body; /* Unexpanded body of the loop */
84 1.103 rillig Vector /* of ForVar */ vars; /* Iteration variables */
85 1.102 rillig Words items; /* Substitution items */
86 1.103 rillig Buffer curBody; /* Expanded body of the current iteration */
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.103 rillig unsigned int sub_next; /* Where to continue iterating */
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.43 dsl static void
111 1.43 dsl For_Free(For *arg)
112 1.43 dsl {
113 1.103 rillig Buf_Destroy(&arg->body, TRUE);
114 1.96 rillig
115 1.96 rillig while (arg->vars.len > 0)
116 1.96 rillig ForVarDone(Vector_Pop(&arg->vars));
117 1.96 rillig Vector_Done(&arg->vars);
118 1.96 rillig
119 1.102 rillig Words_Free(arg->items);
120 1.103 rillig Buf_Destroy(&arg->curBody, TRUE);
121 1.43 dsl
122 1.43 dsl free(arg);
123 1.43 dsl }
124 1.43 dsl
125 1.99 rillig static ForEscapes
126 1.99 rillig GetEscapes(const char *word)
127 1.99 rillig {
128 1.99 rillig const char *p;
129 1.99 rillig ForEscapes escapes = 0;
130 1.99 rillig
131 1.99 rillig for (p = word; *p != '\0'; p++) {
132 1.99 rillig switch (*p) {
133 1.99 rillig case ':':
134 1.99 rillig case '$':
135 1.99 rillig case '\\':
136 1.99 rillig escapes |= FOR_SUB_ESCAPE_CHAR;
137 1.99 rillig break;
138 1.99 rillig case ')':
139 1.99 rillig escapes |= FOR_SUB_ESCAPE_PAREN;
140 1.99 rillig break;
141 1.99 rillig case '}':
142 1.99 rillig escapes |= FOR_SUB_ESCAPE_BRACE;
143 1.99 rillig break;
144 1.99 rillig }
145 1.99 rillig }
146 1.99 rillig return escapes;
147 1.99 rillig }
148 1.99 rillig
149 1.70 rillig /* Evaluate the for loop in the passed line. The line looks like this:
150 1.70 rillig * .for <varname...> in <value...>
151 1.1 cgd *
152 1.13 wiz * Input:
153 1.13 wiz * line Line to parse
154 1.13 wiz *
155 1.1 cgd * Results:
156 1.35 dsl * 0: Not a .for statement, parse the line
157 1.35 dsl * 1: We found a for loop
158 1.35 dsl * -1: A .for statement with a bad syntax error, discard.
159 1.1 cgd */
160 1.1 cgd int
161 1.73 rillig For_Eval(const char *line)
162 1.1 cgd {
163 1.43 dsl For *new_for;
164 1.105 rillig const char *p;
165 1.33 dsl
166 1.43 dsl /* Skip the '.' and any following whitespace */
167 1.105 rillig p = line + 1;
168 1.105 rillig cpp_skip_whitespace(&p);
169 1.43 dsl
170 1.32 dsl /*
171 1.32 dsl * If we are not in a for loop quickly determine if the statement is
172 1.32 dsl * a for.
173 1.32 dsl */
174 1.105 rillig if (p[0] != 'f' || p[1] != 'o' || p[2] != 'r' || !ch_isspace(p[3])) {
175 1.105 rillig if (p[0] == 'e' && strncmp(p + 1, "ndfor", 5) == 0) {
176 1.32 dsl Parse_Error(PARSE_FATAL, "for-less endfor");
177 1.32 dsl return -1;
178 1.32 dsl }
179 1.32 dsl return 0;
180 1.32 dsl }
181 1.105 rillig p += 3;
182 1.1 cgd
183 1.32 dsl /*
184 1.32 dsl * we found a for loop, and now we are going to parse it.
185 1.32 dsl */
186 1.1 cgd
187 1.43 dsl new_for = bmake_malloc(sizeof *new_for);
188 1.103 rillig Buf_Init(&new_for->body, 0);
189 1.96 rillig Vector_Init(&new_for->vars, sizeof(ForVar));
190 1.102 rillig new_for->items.words = NULL;
191 1.102 rillig new_for->items.freeIt = NULL;
192 1.103 rillig Buf_Init(&new_for->curBody, 0);
193 1.71 rillig new_for->short_var = FALSE;
194 1.71 rillig new_for->sub_next = 0;
195 1.43 dsl
196 1.33 dsl /* Grab the variables. Terminate on "in". */
197 1.93 rillig for (;;) {
198 1.72 rillig size_t len;
199 1.72 rillig
200 1.105 rillig cpp_skip_whitespace(&p);
201 1.105 rillig if (*p == '\0') {
202 1.33 dsl Parse_Error(PARSE_FATAL, "missing `in' in for");
203 1.43 dsl For_Free(new_for);
204 1.33 dsl return -1;
205 1.33 dsl }
206 1.72 rillig
207 1.104 rillig /* XXX: This allows arbitrary variable names; see directive-for.mk. */
208 1.105 rillig for (len = 1; p[len] && !ch_isspace(p[len]); len++)
209 1.33 dsl continue;
210 1.104 rillig
211 1.105 rillig if (len == 2 && p[0] == 'i' && p[1] == 'n') {
212 1.105 rillig p += 2;
213 1.33 dsl break;
214 1.33 dsl }
215 1.43 dsl if (len == 1)
216 1.69 rillig new_for->short_var = TRUE;
217 1.69 rillig
218 1.105 rillig ForAddVar(new_for, p, len);
219 1.105 rillig p += len;
220 1.32 dsl }
221 1.1 cgd
222 1.96 rillig if (new_for->vars.len == 0) {
223 1.32 dsl Parse_Error(PARSE_FATAL, "no iteration variables in for");
224 1.43 dsl For_Free(new_for);
225 1.32 dsl return -1;
226 1.32 dsl }
227 1.4 christos
228 1.105 rillig cpp_skip_whitespace(&p);
229 1.32 dsl
230 1.32 dsl /*
231 1.70 rillig * Make a list with the remaining words.
232 1.70 rillig * The values are later substituted as ${:U<value>...} so we must
233 1.70 rillig * backslash-escape characters that break that syntax.
234 1.44 dsl * Variables are fully expanded - so it is safe for escape $.
235 1.44 dsl * We can't do the escapes here - because we don't know whether
236 1.70 rillig * we will be substituting into ${...} or $(...).
237 1.32 dsl */
238 1.72 rillig {
239 1.85 rillig char *items;
240 1.105 rillig (void)Var_Subst(p, VAR_GLOBAL, VARE_WANTRES, &items);
241 1.85 rillig /* TODO: handle errors */
242 1.102 rillig new_for->items = Str_Words(items, FALSE);
243 1.72 rillig free(items);
244 1.65 rillig
245 1.102 rillig if (new_for->items.len == 1 && new_for->items.words[0][0] == '\0')
246 1.102 rillig new_for->items.len = 0; /* .for var in ${:U} */
247 1.72 rillig }
248 1.72 rillig
249 1.72 rillig {
250 1.95 rillig size_t nitems, nvars;
251 1.7 christos
252 1.96 rillig if ((nitems = new_for->items.len) > 0 &&
253 1.96 rillig nitems % (nvars = new_for->vars.len)) {
254 1.49 sjg Parse_Error(PARSE_FATAL,
255 1.65 rillig "Wrong number of words (%zu) in .for substitution list"
256 1.95 rillig " with %zu vars", nitems, nvars);
257 1.49 sjg /*
258 1.49 sjg * Return 'success' so that the body of the .for loop is
259 1.49 sjg * accumulated.
260 1.49 sjg * Remove all items so that the loop doesn't iterate.
261 1.49 sjg */
262 1.102 rillig new_for->items.len = 0;
263 1.49 sjg }
264 1.32 dsl }
265 1.32 dsl
266 1.43 dsl accumFor = new_for;
267 1.32 dsl forLevel = 1;
268 1.32 dsl return 1;
269 1.32 dsl }
270 1.7 christos
271 1.35 dsl /*
272 1.35 dsl * Add another line to a .for loop.
273 1.81 rillig * Returns FALSE when the matching .endfor is reached.
274 1.35 dsl */
275 1.81 rillig Boolean
276 1.73 rillig For_Accum(const char *line)
277 1.32 dsl {
278 1.73 rillig const char *ptr = line;
279 1.26 dsl
280 1.26 dsl if (*ptr == '.') {
281 1.92 rillig ptr++;
282 1.92 rillig cpp_skip_whitespace(&ptr);
283 1.1 cgd
284 1.79 rillig if (strncmp(ptr, "endfor", 6) == 0 && (ch_isspace(ptr[6]) || !ptr[6])) {
285 1.89 rillig DEBUG1(FOR, "For: end for %d\n", forLevel);
286 1.32 dsl if (--forLevel <= 0)
287 1.81 rillig return FALSE;
288 1.79 rillig } else if (strncmp(ptr, "for", 3) == 0 && ch_isspace(ptr[3])) {
289 1.1 cgd forLevel++;
290 1.89 rillig DEBUG1(FOR, "For: new loop %d\n", forLevel);
291 1.1 cgd }
292 1.1 cgd }
293 1.1 cgd
294 1.103 rillig Buf_AddStr(&accumFor->body, line);
295 1.103 rillig Buf_AddByte(&accumFor->body, '\n');
296 1.81 rillig return TRUE;
297 1.1 cgd }
298 1.1 cgd
299 1.42 dsl
300 1.59 rillig static size_t
301 1.45 dsl for_var_len(const char *var)
302 1.45 dsl {
303 1.45 dsl char ch, var_start, var_end;
304 1.61 rillig int depth;
305 1.61 rillig size_t len;
306 1.45 dsl
307 1.45 dsl var_start = *var;
308 1.45 dsl if (var_start == 0)
309 1.45 dsl /* just escape the $ */
310 1.45 dsl return 0;
311 1.45 dsl
312 1.45 dsl if (var_start == '(')
313 1.45 dsl var_end = ')';
314 1.45 dsl else if (var_start == '{')
315 1.45 dsl var_end = '}';
316 1.45 dsl else
317 1.45 dsl /* Single char variable */
318 1.45 dsl return 1;
319 1.45 dsl
320 1.61 rillig depth = 1;
321 1.45 dsl for (len = 1; (ch = var[len++]) != 0;) {
322 1.45 dsl if (ch == var_start)
323 1.45 dsl depth++;
324 1.45 dsl else if (ch == var_end && --depth == 0)
325 1.45 dsl return len;
326 1.45 dsl }
327 1.45 dsl
328 1.45 dsl /* Variable end not found, escape the $ */
329 1.45 dsl return 0;
330 1.45 dsl }
331 1.45 dsl
332 1.42 dsl static void
333 1.101 rillig for_substitute(Buffer *cmds, const char *item, char ech)
334 1.42 dsl {
335 1.100 rillig ForEscapes escapes = GetEscapes(item);
336 1.61 rillig char ch;
337 1.61 rillig
338 1.42 dsl /* If there were no escapes, or the only escape is the other variable
339 1.42 dsl * terminator, then just substitute the full string */
340 1.93 rillig if (!(escapes & (ech == ')' ? ~(unsigned)FOR_SUB_ESCAPE_BRACE
341 1.93 rillig : ~(unsigned)FOR_SUB_ESCAPE_PAREN))) {
342 1.59 rillig Buf_AddStr(cmds, item);
343 1.42 dsl return;
344 1.42 dsl }
345 1.42 dsl
346 1.74 rillig /* Escape ':', '$', '\\' and 'ech' - these will be removed later by
347 1.74 rillig * :U processing, see ApplyModifier_Defined. */
348 1.95 rillig while ((ch = *item++) != '\0') {
349 1.45 dsl if (ch == '$') {
350 1.59 rillig size_t len = for_var_len(item);
351 1.45 dsl if (len != 0) {
352 1.62 rillig Buf_AddBytes(cmds, item - 1, len + 1);
353 1.45 dsl item += len;
354 1.45 dsl continue;
355 1.45 dsl }
356 1.45 dsl Buf_AddByte(cmds, '\\');
357 1.45 dsl } else if (ch == ':' || ch == '\\' || ch == ech)
358 1.42 dsl Buf_AddByte(cmds, '\\');
359 1.42 dsl Buf_AddByte(cmds, ch);
360 1.42 dsl }
361 1.42 dsl }
362 1.42 dsl
363 1.97 rillig static void
364 1.97 rillig SubstVarLong(For *arg, const char **inout_cp, const char **inout_cmd_cp,
365 1.103 rillig char ech)
366 1.97 rillig {
367 1.97 rillig size_t i;
368 1.97 rillig const char *cp = *inout_cp;
369 1.97 rillig const char *cmd_cp = *inout_cmd_cp;
370 1.97 rillig
371 1.97 rillig for (i = 0; i < arg->vars.len; i++) {
372 1.97 rillig ForVar *forVar = Vector_Get(&arg->vars, i);
373 1.97 rillig char *var = forVar->name;
374 1.97 rillig size_t vlen = forVar->len;
375 1.97 rillig
376 1.97 rillig /* XXX: undefined behavior for cp if vlen is longer than cp? */
377 1.97 rillig if (memcmp(cp, var, vlen) != 0)
378 1.97 rillig continue;
379 1.97 rillig /* XXX: why test for backslash here? */
380 1.97 rillig if (cp[vlen] != ':' && cp[vlen] != ech && cp[vlen] != '\\')
381 1.97 rillig continue;
382 1.97 rillig
383 1.97 rillig /* Found a variable match. Replace with :U<value> */
384 1.103 rillig Buf_AddBytesBetween(&arg->curBody, cmd_cp, cp);
385 1.103 rillig Buf_AddStr(&arg->curBody, ":U");
386 1.97 rillig cp += vlen;
387 1.97 rillig cmd_cp = cp;
388 1.103 rillig for_substitute(&arg->curBody, arg->items.words[arg->sub_next + i], ech);
389 1.97 rillig break;
390 1.97 rillig }
391 1.97 rillig
392 1.97 rillig *inout_cp = cp;
393 1.97 rillig *inout_cmd_cp = cmd_cp;
394 1.97 rillig }
395 1.97 rillig
396 1.98 rillig static void
397 1.98 rillig SubstVarShort(For *arg, char const ch,
398 1.103 rillig const char **inout_cp, const char **input_cmd_cp)
399 1.98 rillig {
400 1.98 rillig const char *cp = *inout_cp;
401 1.98 rillig const char *cmd_cp = *input_cmd_cp;
402 1.98 rillig size_t i;
403 1.98 rillig
404 1.98 rillig /* Probably a single character name, ignore $$ and stupid ones. {*/
405 1.98 rillig if (!arg->short_var || strchr("}):$", ch) != NULL) {
406 1.98 rillig cp++;
407 1.98 rillig *inout_cp = cp;
408 1.98 rillig return;
409 1.98 rillig }
410 1.98 rillig
411 1.98 rillig for (i = 0; i < arg->vars.len; i++) {
412 1.98 rillig ForVar *forVar = Vector_Get(&arg->vars, i);
413 1.98 rillig char *var = forVar->name;
414 1.98 rillig if (var[0] != ch || var[1] != 0)
415 1.98 rillig continue;
416 1.98 rillig
417 1.98 rillig /* Found a variable match. Replace with ${:U<value>} */
418 1.103 rillig Buf_AddBytesBetween(&arg->curBody, cmd_cp, cp);
419 1.103 rillig Buf_AddStr(&arg->curBody, "{:U");
420 1.98 rillig cmd_cp = ++cp;
421 1.103 rillig for_substitute(&arg->curBody, arg->items.words[arg->sub_next + i], '}');
422 1.103 rillig Buf_AddByte(&arg->curBody, '}');
423 1.98 rillig break;
424 1.98 rillig }
425 1.98 rillig
426 1.98 rillig *inout_cp = cp;
427 1.98 rillig *input_cmd_cp = cmd_cp;
428 1.98 rillig }
429 1.98 rillig
430 1.95 rillig /*
431 1.95 rillig * Scan the for loop body and replace references to the loop variables
432 1.95 rillig * with variable references that expand to the required text.
433 1.95 rillig *
434 1.95 rillig * Using variable expansions ensures that the .for loop can't generate
435 1.95 rillig * syntax, and that the later parsing will still see a variable.
436 1.95 rillig * We assume that the null variable will never be defined.
437 1.95 rillig *
438 1.95 rillig * The detection of substitutions of the loop control variable is naive.
439 1.95 rillig * Many of the modifiers use \ to escape $ (not $) so it is possible
440 1.95 rillig * to contrive a makefile where an unwanted substitution happens.
441 1.95 rillig */
442 1.43 dsl static char *
443 1.68 rillig ForIterate(void *v_arg, size_t *ret_len)
444 1.1 cgd {
445 1.43 dsl For *arg = v_arg;
446 1.77 rillig const char *cp;
447 1.77 rillig const char *cmd_cp;
448 1.77 rillig const char *body_end;
449 1.76 rillig char *cmds_str;
450 1.61 rillig size_t cmd_len;
451 1.7 christos
452 1.96 rillig if (arg->sub_next + arg->vars.len > arg->items.len) {
453 1.43 dsl /* No more iterations */
454 1.43 dsl For_Free(arg);
455 1.43 dsl return NULL;
456 1.43 dsl }
457 1.1 cgd
458 1.103 rillig Buf_Empty(&arg->curBody);
459 1.7 christos
460 1.103 rillig cmd_cp = Buf_GetAll(&arg->body, &cmd_len);
461 1.59 rillig body_end = cmd_cp + cmd_len;
462 1.43 dsl for (cp = cmd_cp; (cp = strchr(cp, '$')) != NULL;) {
463 1.95 rillig char ch, ech;
464 1.43 dsl ch = *++cp;
465 1.53 riastrad if ((ch == '(' && (ech = ')', 1)) || (ch == '{' && (ech = '}', 1))) {
466 1.43 dsl cp++;
467 1.43 dsl /* Check variable name against the .for loop variables */
468 1.103 rillig SubstVarLong(arg, &cp, &cmd_cp, ech);
469 1.43 dsl continue;
470 1.43 dsl }
471 1.95 rillig if (ch == '\0')
472 1.43 dsl break;
473 1.97 rillig
474 1.103 rillig SubstVarShort(arg, ch, &cp, &cmd_cp);
475 1.43 dsl }
476 1.103 rillig Buf_AddBytesBetween(&arg->curBody, cmd_cp, body_end);
477 1.43 dsl
478 1.103 rillig *ret_len = Buf_Len(&arg->curBody);
479 1.103 rillig cmds_str = Buf_GetAll(&arg->curBody, NULL);
480 1.89 rillig DEBUG1(FOR, "For: loop body:\n%s", cmds_str);
481 1.39 dsl
482 1.96 rillig arg->sub_next += arg->vars.len;
483 1.43 dsl
484 1.76 rillig return cmds_str;
485 1.43 dsl }
486 1.7 christos
487 1.60 rillig /* Run the for loop, imitating the actions of an include file. */
488 1.43 dsl void
489 1.43 dsl For_Run(int lineno)
490 1.54 rillig {
491 1.43 dsl For *arg;
492 1.54 rillig
493 1.43 dsl arg = accumFor;
494 1.43 dsl accumFor = NULL;
495 1.1 cgd
496 1.96 rillig if (arg->items.len == 0) {
497 1.58 rillig /* Nothing to expand - possibly due to an earlier syntax error. */
498 1.58 rillig For_Free(arg);
499 1.58 rillig return;
500 1.43 dsl }
501 1.54 rillig
502 1.68 rillig Parse_SetInput(NULL, lineno, -1, ForIterate, arg);
503 1.1 cgd }
504