for.c revision 1.181 1 1.181 rillig /* $NetBSD: for.c,v 1.181 2024/06/02 15:31:25 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.135 rillig /*
33 1.80 rillig * Handling of .for/.endfor loops in a makefile.
34 1.80 rillig *
35 1.123 rillig * For loops have the form:
36 1.80 rillig *
37 1.123 rillig * .for <varname...> in <value...>
38 1.123 rillig * # the body
39 1.123 rillig * .endfor
40 1.123 rillig *
41 1.123 rillig * When a .for line is parsed, the following lines are copied to the body of
42 1.123 rillig * the .for loop, until the corresponding .endfor line is reached. In this
43 1.123 rillig * phase, the body is not yet evaluated. This also applies to any nested
44 1.123 rillig * .for loops.
45 1.123 rillig *
46 1.123 rillig * After reaching the .endfor, the values from the .for line are grouped
47 1.123 rillig * according to the number of variables. For each such group, the unexpanded
48 1.177 rillig * body is scanned for expressions, and those that match the
49 1.149 rillig * variable names are replaced with expressions of the form ${:U...}. After
50 1.149 rillig * that, the body is treated like a file from an .include directive.
51 1.1 cgd *
52 1.1 cgd * Interface:
53 1.88 rillig * For_Eval Evaluate the loop in the passed line.
54 1.88 rillig *
55 1.1 cgd * For_Run Run accumulated loop
56 1.1 cgd */
57 1.1 cgd
58 1.112 rillig #include "make.h"
59 1.1 cgd
60 1.83 rillig /* "@(#)for.c 8.1 (Berkeley) 6/6/93" */
61 1.181 rillig MAKE_RCSID("$NetBSD: for.c,v 1.181 2024/06/02 15:31:25 rillig Exp $");
62 1.42 dsl
63 1.1 cgd
64 1.136 rillig typedef struct ForLoop {
65 1.155 rillig Vector /* of 'char *' */ vars; /* Iteration variables */
66 1.148 rillig SubstringWords items; /* Substitution items */
67 1.157 rillig Buffer body; /* Unexpanded body of the loop */
68 1.149 rillig unsigned int nextItem; /* Where to continue iterating */
69 1.136 rillig } ForLoop;
70 1.1 cgd
71 1.137 rillig
72 1.143 rillig static ForLoop *accumFor; /* Loop being accumulated */
73 1.1 cgd
74 1.137 rillig
75 1.172 rillig /* See LK_FOR_BODY. */
76 1.172 rillig static void
77 1.172 rillig skip_whitespace_or_line_continuation(const char **pp)
78 1.172 rillig {
79 1.172 rillig const char *p = *pp;
80 1.172 rillig for (;;) {
81 1.172 rillig if (ch_isspace(*p))
82 1.172 rillig p++;
83 1.172 rillig else if (p[0] == '\\' && p[1] == '\n')
84 1.172 rillig p += 2;
85 1.172 rillig else
86 1.172 rillig break;
87 1.172 rillig }
88 1.172 rillig *pp = p;
89 1.172 rillig }
90 1.172 rillig
91 1.137 rillig static ForLoop *
92 1.137 rillig ForLoop_New(void)
93 1.96 rillig {
94 1.137 rillig ForLoop *f = bmake_malloc(sizeof *f);
95 1.137 rillig
96 1.155 rillig Vector_Init(&f->vars, sizeof(char *));
97 1.148 rillig SubstringWords_Init(&f->items);
98 1.157 rillig Buf_Init(&f->body);
99 1.149 rillig f->nextItem = 0;
100 1.137 rillig
101 1.137 rillig return f;
102 1.96 rillig }
103 1.96 rillig
104 1.163 rillig void
105 1.136 rillig ForLoop_Free(ForLoop *f)
106 1.96 rillig {
107 1.155 rillig while (f->vars.len > 0)
108 1.155 rillig free(*(char **)Vector_Pop(&f->vars));
109 1.118 rillig Vector_Done(&f->vars);
110 1.96 rillig
111 1.148 rillig SubstringWords_Free(f->items);
112 1.157 rillig Buf_Done(&f->body);
113 1.96 rillig
114 1.118 rillig free(f);
115 1.43 dsl }
116 1.43 dsl
117 1.161 rillig char *
118 1.175 rillig ForLoop_Details(const ForLoop *f)
119 1.161 rillig {
120 1.163 rillig size_t i, n;
121 1.163 rillig const char **vars;
122 1.163 rillig const Substring *items;
123 1.161 rillig Buffer buf;
124 1.161 rillig
125 1.163 rillig n = f->vars.len;
126 1.163 rillig vars = f->vars.items;
127 1.163 rillig assert(f->nextItem >= n);
128 1.163 rillig items = f->items.words + f->nextItem - n;
129 1.163 rillig
130 1.161 rillig Buf_Init(&buf);
131 1.161 rillig for (i = 0; i < n; i++) {
132 1.161 rillig if (i > 0)
133 1.161 rillig Buf_AddStr(&buf, ", ");
134 1.161 rillig Buf_AddStr(&buf, vars[i]);
135 1.161 rillig Buf_AddStr(&buf, " = ");
136 1.175 rillig Buf_AddRange(&buf, items[i].start, items[i].end);
137 1.161 rillig }
138 1.161 rillig return Buf_DoneData(&buf);
139 1.161 rillig }
140 1.161 rillig
141 1.142 rillig static bool
142 1.173 rillig IsValidInVarname(char c)
143 1.173 rillig {
144 1.173 rillig return c != '$' && c != ':' && c != '\\' &&
145 1.173 rillig c != '(' && c != '{' && c != ')' && c != '}';
146 1.173 rillig }
147 1.173 rillig
148 1.174 rillig static void
149 1.138 rillig ForLoop_ParseVarnames(ForLoop *f, const char **pp)
150 1.138 rillig {
151 1.138 rillig const char *p = *pp;
152 1.138 rillig
153 1.138 rillig for (;;) {
154 1.138 rillig size_t len;
155 1.138 rillig
156 1.138 rillig cpp_skip_whitespace(&p);
157 1.138 rillig if (*p == '\0') {
158 1.138 rillig Parse_Error(PARSE_FATAL, "missing `in' in for");
159 1.180 rillig while (f->vars.len > 0)
160 1.180 rillig free(*(char **)Vector_Pop(&f->vars));
161 1.174 rillig return;
162 1.138 rillig }
163 1.138 rillig
164 1.173 rillig for (len = 0; p[len] != '\0' && !ch_isspace(p[len]); len++) {
165 1.173 rillig if (!IsValidInVarname(p[len])) {
166 1.173 rillig Parse_Error(PARSE_FATAL,
167 1.173 rillig "invalid character '%c' "
168 1.173 rillig "in .for loop variable name",
169 1.173 rillig p[len]);
170 1.180 rillig while (f->vars.len > 0)
171 1.180 rillig free(*(char **)Vector_Pop(&f->vars));
172 1.174 rillig return;
173 1.173 rillig }
174 1.173 rillig }
175 1.138 rillig
176 1.138 rillig if (len == 2 && p[0] == 'i' && p[1] == 'n') {
177 1.138 rillig p += 2;
178 1.138 rillig break;
179 1.138 rillig }
180 1.138 rillig
181 1.155 rillig *(char **)Vector_Push(&f->vars) = bmake_strldup(p, len);
182 1.138 rillig p += len;
183 1.138 rillig }
184 1.138 rillig
185 1.138 rillig if (f->vars.len == 0) {
186 1.138 rillig Parse_Error(PARSE_FATAL, "no iteration variables in for");
187 1.174 rillig return;
188 1.138 rillig }
189 1.138 rillig
190 1.138 rillig *pp = p;
191 1.138 rillig }
192 1.138 rillig
193 1.142 rillig static bool
194 1.138 rillig ForLoop_ParseItems(ForLoop *f, const char *p)
195 1.138 rillig {
196 1.138 rillig char *items;
197 1.138 rillig
198 1.138 rillig cpp_skip_whitespace(&p);
199 1.138 rillig
200 1.181 rillig items = Var_Subst(p, SCOPE_GLOBAL, VARE_EVAL);
201 1.179 rillig /* TODO: handle errors */
202 1.138 rillig
203 1.148 rillig f->items = Substring_Words(items, false);
204 1.138 rillig free(items);
205 1.138 rillig
206 1.148 rillig if (f->items.len == 1 && Substring_IsEmpty(f->items.words[0]))
207 1.151 rillig f->items.len = 0; /* .for var in ${:U} */
208 1.138 rillig
209 1.157 rillig if (f->items.len % f->vars.len != 0) {
210 1.138 rillig Parse_Error(PARSE_FATAL,
211 1.138 rillig "Wrong number of words (%u) in .for "
212 1.138 rillig "substitution list with %u variables",
213 1.138 rillig (unsigned)f->items.len, (unsigned)f->vars.len);
214 1.142 rillig return false;
215 1.138 rillig }
216 1.138 rillig
217 1.142 rillig return true;
218 1.138 rillig }
219 1.138 rillig
220 1.142 rillig static bool
221 1.106 rillig IsFor(const char *p)
222 1.106 rillig {
223 1.118 rillig return p[0] == 'f' && p[1] == 'o' && p[2] == 'r' && ch_isspace(p[3]);
224 1.106 rillig }
225 1.106 rillig
226 1.142 rillig static bool
227 1.106 rillig IsEndfor(const char *p)
228 1.106 rillig {
229 1.118 rillig return p[0] == 'e' && strncmp(p, "endfor", 6) == 0 &&
230 1.118 rillig (p[6] == '\0' || ch_isspace(p[6]));
231 1.106 rillig }
232 1.106 rillig
233 1.122 rillig /*
234 1.122 rillig * Evaluate the for loop in the passed line. The line looks like this:
235 1.70 rillig * .for <varname...> in <value...>
236 1.1 cgd *
237 1.1 cgd * Results:
238 1.157 rillig * 0 not a .for directive
239 1.157 rillig * 1 found a .for directive
240 1.157 rillig * -1 erroneous .for directive
241 1.1 cgd */
242 1.1 cgd int
243 1.73 rillig For_Eval(const char *line)
244 1.1 cgd {
245 1.158 rillig const char *p;
246 1.136 rillig ForLoop *f;
247 1.33 dsl
248 1.118 rillig p = line + 1; /* skip the '.' */
249 1.172 rillig skip_whitespace_or_line_continuation(&p);
250 1.43 dsl
251 1.158 rillig if (IsFor(p)) {
252 1.158 rillig p += 3;
253 1.158 rillig
254 1.158 rillig f = ForLoop_New();
255 1.174 rillig ForLoop_ParseVarnames(f, &p);
256 1.174 rillig if (f->vars.len > 0 && !ForLoop_ParseItems(f, p))
257 1.158 rillig f->items.len = 0; /* don't iterate */
258 1.118 rillig
259 1.158 rillig accumFor = f;
260 1.158 rillig return 1;
261 1.158 rillig } else if (IsEndfor(p)) {
262 1.158 rillig Parse_Error(PARSE_FATAL, "for-less endfor");
263 1.118 rillig return -1;
264 1.158 rillig } else
265 1.158 rillig return 0;
266 1.32 dsl }
267 1.7 christos
268 1.35 dsl /*
269 1.136 rillig * Add another line to the .for loop that is being built up.
270 1.142 rillig * Returns false when the matching .endfor is reached.
271 1.35 dsl */
272 1.142 rillig bool
273 1.156 rillig For_Accum(const char *line, int *forLevel)
274 1.32 dsl {
275 1.140 rillig const char *p = line;
276 1.26 dsl
277 1.140 rillig if (*p == '.') {
278 1.140 rillig p++;
279 1.172 rillig skip_whitespace_or_line_continuation(&p);
280 1.118 rillig
281 1.140 rillig if (IsEndfor(p)) {
282 1.156 rillig DEBUG1(FOR, "For: end for %d\n", *forLevel);
283 1.157 rillig if (--*forLevel == 0)
284 1.142 rillig return false;
285 1.140 rillig } else if (IsFor(p)) {
286 1.156 rillig (*forLevel)++;
287 1.156 rillig DEBUG1(FOR, "For: new loop %d\n", *forLevel);
288 1.118 rillig }
289 1.118 rillig }
290 1.118 rillig
291 1.118 rillig Buf_AddStr(&accumFor->body, line);
292 1.118 rillig Buf_AddByte(&accumFor->body, '\n');
293 1.142 rillig return true;
294 1.1 cgd }
295 1.1 cgd
296 1.168 rillig /*
297 1.168 rillig * When the body of a '.for i' loop is prepared for an iteration, each
298 1.168 rillig * occurrence of $i in the body is replaced with ${:U...}, inserting the
299 1.177 rillig * value of the item. If this item contains a '$', it may be the start of an
300 1.177 rillig * expression. This expression is copied verbatim, its length is
301 1.168 rillig * determined here, in a rather naive way, ignoring escape characters and
302 1.168 rillig * funny delimiters in modifiers like ':S}from}to}'.
303 1.168 rillig */
304 1.59 rillig static size_t
305 1.148 rillig ExprLen(const char *s, const char *e)
306 1.45 dsl {
307 1.148 rillig char expr_open, expr_close;
308 1.118 rillig int depth;
309 1.148 rillig const char *p;
310 1.45 dsl
311 1.148 rillig if (s == e)
312 1.148 rillig return 0; /* just escape the '$' */
313 1.118 rillig
314 1.148 rillig expr_open = s[0];
315 1.147 rillig if (expr_open == '(')
316 1.147 rillig expr_close = ')';
317 1.147 rillig else if (expr_open == '{')
318 1.147 rillig expr_close = '}';
319 1.118 rillig else
320 1.118 rillig return 1; /* Single char variable */
321 1.118 rillig
322 1.118 rillig depth = 1;
323 1.148 rillig for (p = s + 1; p != e; p++) {
324 1.148 rillig if (*p == expr_open)
325 1.118 rillig depth++;
326 1.148 rillig else if (*p == expr_close && --depth == 0)
327 1.148 rillig return (size_t)(p + 1 - s);
328 1.118 rillig }
329 1.45 dsl
330 1.147 rillig /* Expression end not found, escape the $ */
331 1.118 rillig return 0;
332 1.45 dsl }
333 1.45 dsl
334 1.122 rillig /*
335 1.122 rillig * The .for loop substitutes the items as ${:U<value>...}, which means
336 1.122 rillig * that characters that break this syntax must be backslash-escaped.
337 1.122 rillig */
338 1.142 rillig static bool
339 1.148 rillig NeedsEscapes(Substring value, char endc)
340 1.115 rillig {
341 1.118 rillig const char *p;
342 1.115 rillig
343 1.148 rillig for (p = value.start; p != value.end; p++) {
344 1.144 rillig if (*p == ':' || *p == '$' || *p == '\\' || *p == endc ||
345 1.144 rillig *p == '\n')
346 1.142 rillig return true;
347 1.118 rillig }
348 1.142 rillig return false;
349 1.115 rillig }
350 1.115 rillig
351 1.122 rillig /*
352 1.175 rillig * While expanding the body of a .for loop, write the item as a ${:U...}
353 1.166 rillig * expression, escaping characters as needed. The result is later unescaped
354 1.166 rillig * by ApplyModifier_Defined.
355 1.122 rillig */
356 1.42 dsl static void
357 1.157 rillig AddEscaped(Buffer *cmds, Substring item, char endc)
358 1.42 dsl {
359 1.148 rillig const char *p;
360 1.118 rillig char ch;
361 1.118 rillig
362 1.127 rillig if (!NeedsEscapes(item, endc)) {
363 1.175 rillig Buf_AddRange(cmds, item.start, item.end);
364 1.118 rillig return;
365 1.118 rillig }
366 1.61 rillig
367 1.166 rillig for (p = item.start; p != item.end;) {
368 1.148 rillig ch = *p;
369 1.118 rillig if (ch == '$') {
370 1.148 rillig size_t len = ExprLen(p + 1, item.end);
371 1.118 rillig if (len != 0) {
372 1.147 rillig /*
373 1.147 rillig * XXX: Should a '\' be added here?
374 1.147 rillig * See directive-for-escape.mk, ExprLen.
375 1.147 rillig */
376 1.148 rillig Buf_AddBytes(cmds, p, 1 + len);
377 1.166 rillig p += 1 + len;
378 1.118 rillig continue;
379 1.118 rillig }
380 1.118 rillig Buf_AddByte(cmds, '\\');
381 1.127 rillig } else if (ch == ':' || ch == '\\' || ch == endc)
382 1.118 rillig Buf_AddByte(cmds, '\\');
383 1.144 rillig else if (ch == '\n') {
384 1.144 rillig Parse_Error(PARSE_FATAL, "newline in .for value");
385 1.144 rillig ch = ' '; /* prevent newline injection */
386 1.144 rillig }
387 1.118 rillig Buf_AddByte(cmds, ch);
388 1.166 rillig p++;
389 1.118 rillig }
390 1.42 dsl }
391 1.42 dsl
392 1.122 rillig /*
393 1.175 rillig * While expanding the body of a .for loop, replace the variable name of an
394 1.123 rillig * expression like ${i} or ${i:...} or $(i) or $(i:...) with ":Uvalue".
395 1.122 rillig */
396 1.97 rillig static void
397 1.164 rillig ForLoop_SubstVarLong(ForLoop *f, unsigned int firstItem, Buffer *body,
398 1.164 rillig const char **pp, char endc, const char **inout_mark)
399 1.97 rillig {
400 1.118 rillig size_t i;
401 1.155 rillig const char *start = *pp;
402 1.175 rillig const char **varnames = Vector_Get(&f->vars, 0);
403 1.97 rillig
404 1.118 rillig for (i = 0; i < f->vars.len; i++) {
405 1.155 rillig const char *p = start;
406 1.118 rillig
407 1.175 rillig if (!cpp_skip_string(&p, varnames[i]))
408 1.118 rillig continue;
409 1.118 rillig /* XXX: why test for backslash here? */
410 1.155 rillig if (*p != ':' && *p != endc && *p != '\\')
411 1.118 rillig continue;
412 1.118 rillig
413 1.131 rillig /*
414 1.131 rillig * Found a variable match. Skip over the variable name and
415 1.131 rillig * instead add ':U<value>' to the current body.
416 1.131 rillig */
417 1.175 rillig Buf_AddRange(body, *inout_mark, start);
418 1.153 rillig Buf_AddStr(body, ":U");
419 1.164 rillig AddEscaped(body, f->items.words[firstItem + i], endc);
420 1.118 rillig
421 1.118 rillig *inout_mark = p;
422 1.131 rillig *pp = p;
423 1.131 rillig return;
424 1.118 rillig }
425 1.97 rillig }
426 1.97 rillig
427 1.122 rillig /*
428 1.175 rillig * While expanding the body of a .for loop, replace single-character
429 1.177 rillig * expressions like $i with their ${:U...} expansion.
430 1.122 rillig */
431 1.98 rillig static void
432 1.164 rillig ForLoop_SubstVarShort(ForLoop *f, unsigned int firstItem, Buffer *body,
433 1.153 rillig const char *p, const char **inout_mark)
434 1.98 rillig {
435 1.178 rillig char ch = *p;
436 1.155 rillig const char **vars;
437 1.118 rillig size_t i;
438 1.118 rillig
439 1.130 rillig /* Skip $$ and stupid ones. */
440 1.146 rillig if (ch == '}' || ch == ')' || ch == ':' || ch == '$')
441 1.118 rillig return;
442 1.98 rillig
443 1.130 rillig vars = Vector_Get(&f->vars, 0);
444 1.118 rillig for (i = 0; i < f->vars.len; i++) {
445 1.155 rillig const char *varname = vars[i];
446 1.130 rillig if (varname[0] == ch && varname[1] == '\0')
447 1.130 rillig goto found;
448 1.130 rillig }
449 1.130 rillig return;
450 1.130 rillig
451 1.130 rillig found:
452 1.175 rillig Buf_AddRange(body, *inout_mark, p);
453 1.147 rillig *inout_mark = p + 1;
454 1.147 rillig
455 1.130 rillig /* Replace $<ch> with ${:U<value>} */
456 1.153 rillig Buf_AddStr(body, "{:U");
457 1.164 rillig AddEscaped(body, f->items.words[firstItem + i], '}');
458 1.153 rillig Buf_AddByte(body, '}');
459 1.98 rillig }
460 1.98 rillig
461 1.95 rillig /*
462 1.128 rillig * Compute the body for the current iteration by copying the unexpanded body,
463 1.128 rillig * replacing the expressions for the iteration variables on the way.
464 1.129 rillig *
465 1.177 rillig * Using expressions ensures that the .for loop can't generate
466 1.175 rillig * syntax, and that the later parsing will still see an expression.
467 1.175 rillig * This code assumes that the variable with the empty name is never defined,
468 1.175 rillig * see unit-tests/varname-empty.mk.
469 1.129 rillig *
470 1.140 rillig * The detection of substitutions of the loop control variables is naive.
471 1.147 rillig * Many of the modifiers use '\$' instead of '$$' to escape '$', so it is
472 1.147 rillig * possible to contrive a makefile where an unwanted substitution happens.
473 1.175 rillig * See unit-tests/directive-for-escape.mk.
474 1.128 rillig */
475 1.128 rillig static void
476 1.164 rillig ForLoop_SubstBody(ForLoop *f, unsigned int firstItem, Buffer *body)
477 1.128 rillig {
478 1.153 rillig const char *p, *end;
479 1.146 rillig const char *mark; /* where the last substitution left off */
480 1.128 rillig
481 1.159 rillig Buf_Clear(body);
482 1.128 rillig
483 1.128 rillig mark = f->body.data;
484 1.153 rillig end = f->body.data + f->body.len;
485 1.128 rillig for (p = mark; (p = strchr(p, '$')) != NULL;) {
486 1.128 rillig if (p[1] == '{' || p[1] == '(') {
487 1.146 rillig char endc = p[1] == '{' ? '}' : ')';
488 1.128 rillig p += 2;
489 1.164 rillig ForLoop_SubstVarLong(f, firstItem, body,
490 1.164 rillig &p, endc, &mark);
491 1.179 rillig } else {
492 1.164 rillig ForLoop_SubstVarShort(f, firstItem, body,
493 1.164 rillig p + 1, &mark);
494 1.130 rillig p += 2;
495 1.179 rillig }
496 1.128 rillig }
497 1.128 rillig
498 1.175 rillig Buf_AddRange(body, mark, end);
499 1.128 rillig }
500 1.128 rillig
501 1.128 rillig /*
502 1.129 rillig * Compute the body for the current iteration by copying the unexpanded body,
503 1.129 rillig * replacing the expressions for the iteration variables on the way.
504 1.95 rillig */
505 1.154 rillig bool
506 1.154 rillig For_NextIteration(ForLoop *f, Buffer *body)
507 1.1 cgd {
508 1.163 rillig if (f->nextItem == f->items.len)
509 1.154 rillig return false;
510 1.118 rillig
511 1.164 rillig f->nextItem += (unsigned int)f->vars.len;
512 1.164 rillig ForLoop_SubstBody(f, f->nextItem - (unsigned int)f->vars.len, body);
513 1.176 rillig if (DEBUG(FOR)) {
514 1.176 rillig char *details = ForLoop_Details(f);
515 1.176 rillig debug_printf("For: loop body with %s:\n%s",
516 1.176 rillig details, body->data);
517 1.176 rillig free(details);
518 1.176 rillig }
519 1.154 rillig return true;
520 1.43 dsl }
521 1.7 christos
522 1.170 rillig /* Break out of the .for loop. */
523 1.170 rillig void
524 1.170 rillig For_Break(ForLoop *f)
525 1.170 rillig {
526 1.170 rillig f->nextItem = (unsigned int)f->items.len;
527 1.170 rillig }
528 1.170 rillig
529 1.120 rillig /* Run the .for loop, imitating the actions of an include file. */
530 1.43 dsl void
531 1.167 rillig For_Run(unsigned headLineno, unsigned bodyReadLines)
532 1.54 rillig {
533 1.154 rillig Buffer buf;
534 1.136 rillig ForLoop *f = accumFor;
535 1.118 rillig accumFor = NULL;
536 1.1 cgd
537 1.154 rillig if (f->items.len > 0) {
538 1.154 rillig Buf_Init(&buf);
539 1.160 rillig Parse_PushInput(NULL, headLineno, bodyReadLines, buf, f);
540 1.154 rillig } else
541 1.136 rillig ForLoop_Free(f);
542 1.1 cgd }
543