for.c revision 1.159 1 1.159 rillig /* $NetBSD: for.c,v 1.159 2022/01/08 17:25:19 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.149 rillig * body is scanned for variable 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.159 rillig MAKE_RCSID("$NetBSD: for.c,v 1.159 2022/01/08 17:25:19 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.137 rillig static ForLoop *
76 1.137 rillig ForLoop_New(void)
77 1.96 rillig {
78 1.137 rillig ForLoop *f = bmake_malloc(sizeof *f);
79 1.137 rillig
80 1.155 rillig Vector_Init(&f->vars, sizeof(char *));
81 1.148 rillig SubstringWords_Init(&f->items);
82 1.157 rillig Buf_Init(&f->body);
83 1.149 rillig f->nextItem = 0;
84 1.137 rillig
85 1.137 rillig return f;
86 1.96 rillig }
87 1.96 rillig
88 1.96 rillig static void
89 1.136 rillig ForLoop_Free(ForLoop *f)
90 1.96 rillig {
91 1.155 rillig while (f->vars.len > 0)
92 1.155 rillig free(*(char **)Vector_Pop(&f->vars));
93 1.118 rillig Vector_Done(&f->vars);
94 1.96 rillig
95 1.148 rillig SubstringWords_Free(f->items);
96 1.157 rillig Buf_Done(&f->body);
97 1.96 rillig
98 1.118 rillig free(f);
99 1.43 dsl }
100 1.43 dsl
101 1.142 rillig static bool
102 1.138 rillig ForLoop_ParseVarnames(ForLoop *f, const char **pp)
103 1.138 rillig {
104 1.138 rillig const char *p = *pp;
105 1.138 rillig
106 1.138 rillig for (;;) {
107 1.138 rillig size_t len;
108 1.138 rillig
109 1.138 rillig cpp_skip_whitespace(&p);
110 1.138 rillig if (*p == '\0') {
111 1.138 rillig Parse_Error(PARSE_FATAL, "missing `in' in for");
112 1.142 rillig return false;
113 1.138 rillig }
114 1.138 rillig
115 1.138 rillig /*
116 1.138 rillig * XXX: This allows arbitrary variable names;
117 1.138 rillig * see directive-for.mk.
118 1.138 rillig */
119 1.138 rillig for (len = 1; p[len] != '\0' && !ch_isspace(p[len]); len++)
120 1.138 rillig continue;
121 1.138 rillig
122 1.138 rillig if (len == 2 && p[0] == 'i' && p[1] == 'n') {
123 1.138 rillig p += 2;
124 1.138 rillig break;
125 1.138 rillig }
126 1.138 rillig
127 1.155 rillig *(char **)Vector_Push(&f->vars) = bmake_strldup(p, len);
128 1.138 rillig p += len;
129 1.138 rillig }
130 1.138 rillig
131 1.138 rillig if (f->vars.len == 0) {
132 1.138 rillig Parse_Error(PARSE_FATAL, "no iteration variables in for");
133 1.142 rillig return false;
134 1.138 rillig }
135 1.138 rillig
136 1.138 rillig *pp = p;
137 1.142 rillig return true;
138 1.138 rillig }
139 1.138 rillig
140 1.142 rillig static bool
141 1.138 rillig ForLoop_ParseItems(ForLoop *f, const char *p)
142 1.138 rillig {
143 1.138 rillig char *items;
144 1.138 rillig
145 1.138 rillig cpp_skip_whitespace(&p);
146 1.138 rillig
147 1.141 rillig if (Var_Subst(p, SCOPE_GLOBAL, VARE_WANTRES, &items) != VPR_OK) {
148 1.138 rillig Parse_Error(PARSE_FATAL, "Error in .for loop items");
149 1.142 rillig return false;
150 1.138 rillig }
151 1.138 rillig
152 1.148 rillig f->items = Substring_Words(items, false);
153 1.138 rillig free(items);
154 1.138 rillig
155 1.148 rillig if (f->items.len == 1 && Substring_IsEmpty(f->items.words[0]))
156 1.151 rillig f->items.len = 0; /* .for var in ${:U} */
157 1.138 rillig
158 1.157 rillig if (f->items.len % f->vars.len != 0) {
159 1.138 rillig Parse_Error(PARSE_FATAL,
160 1.138 rillig "Wrong number of words (%u) in .for "
161 1.138 rillig "substitution list with %u variables",
162 1.138 rillig (unsigned)f->items.len, (unsigned)f->vars.len);
163 1.142 rillig return false;
164 1.138 rillig }
165 1.138 rillig
166 1.142 rillig return true;
167 1.138 rillig }
168 1.138 rillig
169 1.142 rillig static bool
170 1.106 rillig IsFor(const char *p)
171 1.106 rillig {
172 1.118 rillig return p[0] == 'f' && p[1] == 'o' && p[2] == 'r' && ch_isspace(p[3]);
173 1.106 rillig }
174 1.106 rillig
175 1.142 rillig static bool
176 1.106 rillig IsEndfor(const char *p)
177 1.106 rillig {
178 1.118 rillig return p[0] == 'e' && strncmp(p, "endfor", 6) == 0 &&
179 1.118 rillig (p[6] == '\0' || ch_isspace(p[6]));
180 1.106 rillig }
181 1.106 rillig
182 1.122 rillig /*
183 1.122 rillig * Evaluate the for loop in the passed line. The line looks like this:
184 1.70 rillig * .for <varname...> in <value...>
185 1.1 cgd *
186 1.1 cgd * Results:
187 1.157 rillig * 0 not a .for directive
188 1.157 rillig * 1 found a .for directive
189 1.157 rillig * -1 erroneous .for directive
190 1.1 cgd */
191 1.1 cgd int
192 1.73 rillig For_Eval(const char *line)
193 1.1 cgd {
194 1.158 rillig const char *p;
195 1.136 rillig ForLoop *f;
196 1.33 dsl
197 1.118 rillig p = line + 1; /* skip the '.' */
198 1.118 rillig cpp_skip_whitespace(&p);
199 1.43 dsl
200 1.158 rillig if (IsFor(p)) {
201 1.158 rillig p += 3;
202 1.158 rillig
203 1.158 rillig f = ForLoop_New();
204 1.158 rillig if (!ForLoop_ParseVarnames(f, &p)) {
205 1.158 rillig ForLoop_Free(f);
206 1.118 rillig return -1;
207 1.118 rillig }
208 1.158 rillig if (!ForLoop_ParseItems(f, p))
209 1.158 rillig f->items.len = 0; /* don't iterate */
210 1.118 rillig
211 1.158 rillig accumFor = f;
212 1.158 rillig return 1;
213 1.158 rillig } else if (IsEndfor(p)) {
214 1.158 rillig Parse_Error(PARSE_FATAL, "for-less endfor");
215 1.118 rillig return -1;
216 1.158 rillig } else
217 1.158 rillig return 0;
218 1.32 dsl }
219 1.7 christos
220 1.35 dsl /*
221 1.136 rillig * Add another line to the .for loop that is being built up.
222 1.142 rillig * Returns false when the matching .endfor is reached.
223 1.35 dsl */
224 1.142 rillig bool
225 1.156 rillig For_Accum(const char *line, int *forLevel)
226 1.32 dsl {
227 1.140 rillig const char *p = line;
228 1.26 dsl
229 1.140 rillig if (*p == '.') {
230 1.140 rillig p++;
231 1.140 rillig cpp_skip_whitespace(&p);
232 1.118 rillig
233 1.140 rillig if (IsEndfor(p)) {
234 1.156 rillig DEBUG1(FOR, "For: end for %d\n", *forLevel);
235 1.157 rillig if (--*forLevel == 0)
236 1.142 rillig return false;
237 1.140 rillig } else if (IsFor(p)) {
238 1.156 rillig (*forLevel)++;
239 1.156 rillig DEBUG1(FOR, "For: new loop %d\n", *forLevel);
240 1.118 rillig }
241 1.118 rillig }
242 1.118 rillig
243 1.118 rillig Buf_AddStr(&accumFor->body, line);
244 1.118 rillig Buf_AddByte(&accumFor->body, '\n');
245 1.142 rillig return true;
246 1.1 cgd }
247 1.1 cgd
248 1.42 dsl
249 1.59 rillig static size_t
250 1.148 rillig ExprLen(const char *s, const char *e)
251 1.45 dsl {
252 1.148 rillig char expr_open, expr_close;
253 1.118 rillig int depth;
254 1.148 rillig const char *p;
255 1.45 dsl
256 1.148 rillig if (s == e)
257 1.148 rillig return 0; /* just escape the '$' */
258 1.118 rillig
259 1.148 rillig expr_open = s[0];
260 1.147 rillig if (expr_open == '(')
261 1.147 rillig expr_close = ')';
262 1.147 rillig else if (expr_open == '{')
263 1.147 rillig expr_close = '}';
264 1.118 rillig else
265 1.118 rillig return 1; /* Single char variable */
266 1.118 rillig
267 1.118 rillig depth = 1;
268 1.148 rillig for (p = s + 1; p != e; p++) {
269 1.148 rillig if (*p == expr_open)
270 1.118 rillig depth++;
271 1.148 rillig else if (*p == expr_close && --depth == 0)
272 1.148 rillig return (size_t)(p + 1 - s);
273 1.118 rillig }
274 1.45 dsl
275 1.147 rillig /* Expression end not found, escape the $ */
276 1.118 rillig return 0;
277 1.45 dsl }
278 1.45 dsl
279 1.122 rillig /*
280 1.122 rillig * The .for loop substitutes the items as ${:U<value>...}, which means
281 1.122 rillig * that characters that break this syntax must be backslash-escaped.
282 1.122 rillig */
283 1.142 rillig static bool
284 1.148 rillig NeedsEscapes(Substring value, char endc)
285 1.115 rillig {
286 1.118 rillig const char *p;
287 1.115 rillig
288 1.148 rillig for (p = value.start; p != value.end; p++) {
289 1.144 rillig if (*p == ':' || *p == '$' || *p == '\\' || *p == endc ||
290 1.144 rillig *p == '\n')
291 1.142 rillig return true;
292 1.118 rillig }
293 1.142 rillig return false;
294 1.115 rillig }
295 1.115 rillig
296 1.122 rillig /*
297 1.122 rillig * While expanding the body of a .for loop, write the item in the ${:U...}
298 1.115 rillig * expression, escaping characters as needed.
299 1.115 rillig *
300 1.122 rillig * The result is later unescaped by ApplyModifier_Defined.
301 1.122 rillig */
302 1.42 dsl static void
303 1.157 rillig AddEscaped(Buffer *cmds, Substring item, char endc)
304 1.42 dsl {
305 1.148 rillig const char *p;
306 1.118 rillig char ch;
307 1.118 rillig
308 1.127 rillig if (!NeedsEscapes(item, endc)) {
309 1.148 rillig Buf_AddBytesBetween(cmds, item.start, item.end);
310 1.118 rillig return;
311 1.118 rillig }
312 1.61 rillig
313 1.151 rillig /*
314 1.151 rillig * Escape ':', '$', '\\' and 'endc' - these will be removed later by
315 1.151 rillig * :U processing, see ApplyModifier_Defined.
316 1.151 rillig */
317 1.148 rillig for (p = item.start; p != item.end; p++) {
318 1.148 rillig ch = *p;
319 1.118 rillig if (ch == '$') {
320 1.148 rillig size_t len = ExprLen(p + 1, item.end);
321 1.118 rillig if (len != 0) {
322 1.147 rillig /*
323 1.147 rillig * XXX: Should a '\' be added here?
324 1.147 rillig * See directive-for-escape.mk, ExprLen.
325 1.147 rillig */
326 1.148 rillig Buf_AddBytes(cmds, p, 1 + len);
327 1.148 rillig p += len;
328 1.118 rillig continue;
329 1.118 rillig }
330 1.118 rillig Buf_AddByte(cmds, '\\');
331 1.127 rillig } else if (ch == ':' || ch == '\\' || ch == endc)
332 1.118 rillig Buf_AddByte(cmds, '\\');
333 1.144 rillig else if (ch == '\n') {
334 1.144 rillig Parse_Error(PARSE_FATAL, "newline in .for value");
335 1.144 rillig ch = ' '; /* prevent newline injection */
336 1.144 rillig }
337 1.118 rillig Buf_AddByte(cmds, ch);
338 1.118 rillig }
339 1.42 dsl }
340 1.42 dsl
341 1.122 rillig /*
342 1.146 rillig * When expanding the body of a .for loop, replace the variable name of an
343 1.123 rillig * expression like ${i} or ${i:...} or $(i) or $(i:...) with ":Uvalue".
344 1.122 rillig */
345 1.97 rillig static void
346 1.153 rillig ForLoop_SubstVarLong(ForLoop *f, Buffer *body, const char **pp,
347 1.153 rillig const char *end, char endc, const char **inout_mark)
348 1.97 rillig {
349 1.118 rillig size_t i;
350 1.155 rillig const char *start = *pp;
351 1.155 rillig const char **vars = Vector_Get(&f->vars, 0);
352 1.97 rillig
353 1.118 rillig for (i = 0; i < f->vars.len; i++) {
354 1.155 rillig const char *p = start;
355 1.155 rillig const char *varname = vars[i];
356 1.118 rillig
357 1.155 rillig while (p < end && *varname != '\0' && *p == *varname)
358 1.155 rillig p++, varname++;
359 1.155 rillig if (*varname != '\0')
360 1.118 rillig continue;
361 1.118 rillig /* XXX: why test for backslash here? */
362 1.155 rillig if (*p != ':' && *p != endc && *p != '\\')
363 1.118 rillig continue;
364 1.118 rillig
365 1.131 rillig /*
366 1.131 rillig * Found a variable match. Skip over the variable name and
367 1.131 rillig * instead add ':U<value>' to the current body.
368 1.131 rillig */
369 1.155 rillig Buf_AddBytesBetween(body, *inout_mark, start);
370 1.153 rillig Buf_AddStr(body, ":U");
371 1.157 rillig AddEscaped(body, f->items.words[f->nextItem + i], endc);
372 1.118 rillig
373 1.118 rillig *inout_mark = p;
374 1.131 rillig *pp = p;
375 1.131 rillig return;
376 1.118 rillig }
377 1.97 rillig }
378 1.97 rillig
379 1.122 rillig /*
380 1.146 rillig * When expanding the body of a .for loop, replace single-character
381 1.122 rillig * variable expressions like $i with their ${:U...} expansion.
382 1.122 rillig */
383 1.98 rillig static void
384 1.153 rillig ForLoop_SubstVarShort(ForLoop *f, Buffer *body,
385 1.153 rillig const char *p, const char **inout_mark)
386 1.98 rillig {
387 1.123 rillig const char ch = *p;
388 1.155 rillig const char **vars;
389 1.118 rillig size_t i;
390 1.118 rillig
391 1.130 rillig /* Skip $$ and stupid ones. */
392 1.146 rillig if (ch == '}' || ch == ')' || ch == ':' || ch == '$')
393 1.118 rillig return;
394 1.98 rillig
395 1.130 rillig vars = Vector_Get(&f->vars, 0);
396 1.118 rillig for (i = 0; i < f->vars.len; i++) {
397 1.155 rillig const char *varname = vars[i];
398 1.130 rillig if (varname[0] == ch && varname[1] == '\0')
399 1.130 rillig goto found;
400 1.130 rillig }
401 1.130 rillig return;
402 1.130 rillig
403 1.130 rillig found:
404 1.153 rillig Buf_AddBytesBetween(body, *inout_mark, p);
405 1.147 rillig *inout_mark = p + 1;
406 1.147 rillig
407 1.130 rillig /* Replace $<ch> with ${:U<value>} */
408 1.153 rillig Buf_AddStr(body, "{:U");
409 1.157 rillig AddEscaped(body, f->items.words[f->nextItem + i], '}');
410 1.153 rillig Buf_AddByte(body, '}');
411 1.98 rillig }
412 1.98 rillig
413 1.95 rillig /*
414 1.128 rillig * Compute the body for the current iteration by copying the unexpanded body,
415 1.128 rillig * replacing the expressions for the iteration variables on the way.
416 1.129 rillig *
417 1.129 rillig * Using variable expressions ensures that the .for loop can't generate
418 1.129 rillig * syntax, and that the later parsing will still see a variable.
419 1.129 rillig * This code assumes that the variable with the empty name will never be
420 1.129 rillig * defined, see unit-tests/varname-empty.mk for more details.
421 1.129 rillig *
422 1.140 rillig * The detection of substitutions of the loop control variables is naive.
423 1.147 rillig * Many of the modifiers use '\$' instead of '$$' to escape '$', so it is
424 1.147 rillig * possible to contrive a makefile where an unwanted substitution happens.
425 1.128 rillig */
426 1.128 rillig static void
427 1.153 rillig ForLoop_SubstBody(ForLoop *f, Buffer *body)
428 1.128 rillig {
429 1.153 rillig const char *p, *end;
430 1.146 rillig const char *mark; /* where the last substitution left off */
431 1.128 rillig
432 1.159 rillig Buf_Clear(body);
433 1.128 rillig
434 1.128 rillig mark = f->body.data;
435 1.153 rillig end = f->body.data + f->body.len;
436 1.128 rillig for (p = mark; (p = strchr(p, '$')) != NULL;) {
437 1.128 rillig if (p[1] == '{' || p[1] == '(') {
438 1.146 rillig char endc = p[1] == '{' ? '}' : ')';
439 1.128 rillig p += 2;
440 1.153 rillig ForLoop_SubstVarLong(f, body, &p, end, endc, &mark);
441 1.128 rillig } else if (p[1] != '\0') {
442 1.153 rillig ForLoop_SubstVarShort(f, body, p + 1, &mark);
443 1.130 rillig p += 2;
444 1.128 rillig } else
445 1.128 rillig break;
446 1.128 rillig }
447 1.128 rillig
448 1.153 rillig Buf_AddBytesBetween(body, mark, end);
449 1.128 rillig }
450 1.128 rillig
451 1.128 rillig /*
452 1.129 rillig * Compute the body for the current iteration by copying the unexpanded body,
453 1.129 rillig * replacing the expressions for the iteration variables on the way.
454 1.95 rillig */
455 1.154 rillig bool
456 1.154 rillig For_NextIteration(ForLoop *f, Buffer *body)
457 1.1 cgd {
458 1.149 rillig if (f->nextItem == f->items.len) {
459 1.118 rillig /* No more iterations */
460 1.136 rillig ForLoop_Free(f);
461 1.154 rillig return false;
462 1.118 rillig }
463 1.118 rillig
464 1.154 rillig ForLoop_SubstBody(f, body);
465 1.154 rillig DEBUG1(FOR, "For: loop body:\n%s", body->data);
466 1.149 rillig f->nextItem += (unsigned int)f->vars.len;
467 1.154 rillig return true;
468 1.43 dsl }
469 1.7 christos
470 1.120 rillig /* Run the .for loop, imitating the actions of an include file. */
471 1.43 dsl void
472 1.43 dsl For_Run(int lineno)
473 1.54 rillig {
474 1.154 rillig Buffer buf;
475 1.136 rillig ForLoop *f = accumFor;
476 1.118 rillig accumFor = NULL;
477 1.1 cgd
478 1.154 rillig if (f->items.len > 0) {
479 1.154 rillig Buf_Init(&buf);
480 1.154 rillig Parse_PushInput(NULL, lineno, buf, f);
481 1.154 rillig } else
482 1.136 rillig ForLoop_Free(f);
483 1.1 cgd }
484