for.c revision 1.116 1 1.116 rillig /* $NetBSD: for.c,v 1.116 2020/12/12 00:33: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.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.112 rillig #include "make.h"
61 1.1 cgd
62 1.83 rillig /* "@(#)for.c 8.1 (Berkeley) 6/6/93" */
63 1.116 rillig MAKE_RCSID("$NetBSD: for.c,v 1.116 2020/12/12 00:33:25 rillig Exp $");
64 1.42 dsl
65 1.63 rillig static int forLevel = 0; /* Nesting level */
66 1.1 cgd
67 1.96 rillig /* One of the variables to the left of the "in" in a .for loop. */
68 1.96 rillig typedef struct ForVar {
69 1.96 rillig char *name;
70 1.96 rillig size_t len;
71 1.96 rillig } ForVar;
72 1.96 rillig
73 1.1 cgd /*
74 1.1 cgd * State of a for loop.
75 1.1 cgd */
76 1.86 rillig typedef struct For {
77 1.103 rillig Buffer body; /* Unexpanded body of the loop */
78 1.103 rillig Vector /* of ForVar */ vars; /* Iteration variables */
79 1.102 rillig Words items; /* Substitution items */
80 1.103 rillig Buffer curBody; /* Expanded body of the current iteration */
81 1.69 rillig /* Is any of the names 1 character long? If so, when the variable values
82 1.69 rillig * are substituted, the parser must handle $V expressions as well, not
83 1.69 rillig * only ${V} and $(V). */
84 1.69 rillig Boolean short_var;
85 1.103 rillig unsigned int sub_next; /* Where to continue iterating */
86 1.2 jtc } For;
87 1.1 cgd
88 1.63 rillig static For *accumFor; /* Loop being accumulated */
89 1.1 cgd
90 1.96 rillig static void
91 1.96 rillig ForAddVar(For *f, const char *name, size_t len)
92 1.96 rillig {
93 1.96 rillig ForVar *var = Vector_Push(&f->vars);
94 1.96 rillig var->name = bmake_strldup(name, len);
95 1.96 rillig var->len = len;
96 1.96 rillig }
97 1.96 rillig
98 1.96 rillig static void
99 1.109 rillig For_Free(For *f)
100 1.96 rillig {
101 1.109 rillig Buf_Destroy(&f->body, TRUE);
102 1.96 rillig
103 1.109 rillig while (f->vars.len > 0) {
104 1.109 rillig ForVar *var = Vector_Pop(&f->vars);
105 1.109 rillig free(var->name);
106 1.109 rillig }
107 1.109 rillig Vector_Done(&f->vars);
108 1.96 rillig
109 1.109 rillig Words_Free(f->items);
110 1.109 rillig Buf_Destroy(&f->curBody, TRUE);
111 1.96 rillig
112 1.109 rillig free(f);
113 1.43 dsl }
114 1.43 dsl
115 1.106 rillig static Boolean
116 1.106 rillig IsFor(const char *p)
117 1.106 rillig {
118 1.106 rillig return p[0] == 'f' && p[1] == 'o' && p[2] == 'r' && ch_isspace(p[3]);
119 1.106 rillig }
120 1.106 rillig
121 1.106 rillig static Boolean
122 1.106 rillig IsEndfor(const char *p)
123 1.106 rillig {
124 1.106 rillig return p[0] == 'e' && strncmp(p, "endfor", 6) == 0 &&
125 1.106 rillig (p[6] == '\0' || ch_isspace(p[6]));
126 1.106 rillig }
127 1.106 rillig
128 1.70 rillig /* Evaluate the for loop in the passed line. The line looks like this:
129 1.70 rillig * .for <varname...> in <value...>
130 1.1 cgd *
131 1.13 wiz * Input:
132 1.13 wiz * line Line to parse
133 1.13 wiz *
134 1.1 cgd * Results:
135 1.35 dsl * 0: Not a .for statement, parse the line
136 1.35 dsl * 1: We found a for loop
137 1.35 dsl * -1: A .for statement with a bad syntax error, discard.
138 1.1 cgd */
139 1.1 cgd int
140 1.73 rillig For_Eval(const char *line)
141 1.1 cgd {
142 1.109 rillig For *f;
143 1.105 rillig const char *p;
144 1.33 dsl
145 1.108 rillig p = line + 1; /* skip the '.' */
146 1.105 rillig cpp_skip_whitespace(&p);
147 1.43 dsl
148 1.106 rillig if (!IsFor(p)) {
149 1.106 rillig if (IsEndfor(p)) {
150 1.32 dsl Parse_Error(PARSE_FATAL, "for-less endfor");
151 1.32 dsl return -1;
152 1.32 dsl }
153 1.32 dsl return 0;
154 1.32 dsl }
155 1.105 rillig p += 3;
156 1.1 cgd
157 1.32 dsl /*
158 1.32 dsl * we found a for loop, and now we are going to parse it.
159 1.32 dsl */
160 1.1 cgd
161 1.109 rillig f = bmake_malloc(sizeof *f);
162 1.114 rillig Buf_Init(&f->body);
163 1.109 rillig Vector_Init(&f->vars, sizeof(ForVar));
164 1.109 rillig f->items.words = NULL;
165 1.109 rillig f->items.freeIt = NULL;
166 1.114 rillig Buf_Init(&f->curBody);
167 1.109 rillig f->short_var = FALSE;
168 1.109 rillig f->sub_next = 0;
169 1.43 dsl
170 1.33 dsl /* Grab the variables. Terminate on "in". */
171 1.93 rillig for (;;) {
172 1.72 rillig size_t len;
173 1.72 rillig
174 1.105 rillig cpp_skip_whitespace(&p);
175 1.105 rillig if (*p == '\0') {
176 1.33 dsl Parse_Error(PARSE_FATAL, "missing `in' in for");
177 1.109 rillig For_Free(f);
178 1.33 dsl return -1;
179 1.33 dsl }
180 1.72 rillig
181 1.104 rillig /* XXX: This allows arbitrary variable names; see directive-for.mk. */
182 1.106 rillig for (len = 1; p[len] != '\0' && !ch_isspace(p[len]); len++)
183 1.33 dsl continue;
184 1.104 rillig
185 1.105 rillig if (len == 2 && p[0] == 'i' && p[1] == 'n') {
186 1.105 rillig p += 2;
187 1.33 dsl break;
188 1.33 dsl }
189 1.43 dsl if (len == 1)
190 1.109 rillig f->short_var = TRUE;
191 1.69 rillig
192 1.109 rillig ForAddVar(f, p, len);
193 1.105 rillig p += len;
194 1.32 dsl }
195 1.1 cgd
196 1.109 rillig if (f->vars.len == 0) {
197 1.32 dsl Parse_Error(PARSE_FATAL, "no iteration variables in for");
198 1.109 rillig For_Free(f);
199 1.32 dsl return -1;
200 1.32 dsl }
201 1.4 christos
202 1.105 rillig cpp_skip_whitespace(&p);
203 1.32 dsl
204 1.72 rillig {
205 1.85 rillig char *items;
206 1.105 rillig (void)Var_Subst(p, VAR_GLOBAL, VARE_WANTRES, &items);
207 1.85 rillig /* TODO: handle errors */
208 1.109 rillig f->items = Str_Words(items, FALSE);
209 1.72 rillig free(items);
210 1.65 rillig
211 1.109 rillig if (f->items.len == 1 && f->items.words[0][0] == '\0')
212 1.109 rillig f->items.len = 0; /* .for var in ${:U} */
213 1.72 rillig }
214 1.72 rillig
215 1.72 rillig {
216 1.95 rillig size_t nitems, nvars;
217 1.7 christos
218 1.109 rillig if ((nitems = f->items.len) > 0 && nitems % (nvars = f->vars.len)) {
219 1.49 sjg Parse_Error(PARSE_FATAL,
220 1.65 rillig "Wrong number of words (%zu) in .for substitution list"
221 1.107 rillig " with %zu variables", nitems, nvars);
222 1.49 sjg /*
223 1.49 sjg * Return 'success' so that the body of the .for loop is
224 1.49 sjg * accumulated.
225 1.49 sjg * Remove all items so that the loop doesn't iterate.
226 1.49 sjg */
227 1.109 rillig f->items.len = 0;
228 1.49 sjg }
229 1.32 dsl }
230 1.32 dsl
231 1.109 rillig accumFor = f;
232 1.32 dsl forLevel = 1;
233 1.32 dsl return 1;
234 1.32 dsl }
235 1.7 christos
236 1.35 dsl /*
237 1.35 dsl * Add another line to a .for loop.
238 1.81 rillig * Returns FALSE when the matching .endfor is reached.
239 1.35 dsl */
240 1.81 rillig Boolean
241 1.73 rillig For_Accum(const char *line)
242 1.32 dsl {
243 1.73 rillig const char *ptr = line;
244 1.26 dsl
245 1.26 dsl if (*ptr == '.') {
246 1.92 rillig ptr++;
247 1.92 rillig cpp_skip_whitespace(&ptr);
248 1.1 cgd
249 1.106 rillig if (IsEndfor(ptr)) {
250 1.89 rillig DEBUG1(FOR, "For: end for %d\n", forLevel);
251 1.32 dsl if (--forLevel <= 0)
252 1.81 rillig return FALSE;
253 1.106 rillig } else if (IsFor(ptr)) {
254 1.1 cgd forLevel++;
255 1.89 rillig DEBUG1(FOR, "For: new loop %d\n", forLevel);
256 1.1 cgd }
257 1.1 cgd }
258 1.1 cgd
259 1.103 rillig Buf_AddStr(&accumFor->body, line);
260 1.103 rillig Buf_AddByte(&accumFor->body, '\n');
261 1.81 rillig return TRUE;
262 1.1 cgd }
263 1.1 cgd
264 1.42 dsl
265 1.59 rillig static size_t
266 1.45 dsl for_var_len(const char *var)
267 1.45 dsl {
268 1.45 dsl char ch, var_start, var_end;
269 1.61 rillig int depth;
270 1.61 rillig size_t len;
271 1.45 dsl
272 1.45 dsl var_start = *var;
273 1.113 rillig if (var_start == '\0')
274 1.45 dsl /* just escape the $ */
275 1.45 dsl return 0;
276 1.45 dsl
277 1.45 dsl if (var_start == '(')
278 1.45 dsl var_end = ')';
279 1.45 dsl else if (var_start == '{')
280 1.45 dsl var_end = '}';
281 1.45 dsl else
282 1.45 dsl /* Single char variable */
283 1.45 dsl return 1;
284 1.45 dsl
285 1.61 rillig depth = 1;
286 1.113 rillig for (len = 1; (ch = var[len++]) != '\0';) {
287 1.45 dsl if (ch == var_start)
288 1.45 dsl depth++;
289 1.45 dsl else if (ch == var_end && --depth == 0)
290 1.45 dsl return len;
291 1.45 dsl }
292 1.45 dsl
293 1.45 dsl /* Variable end not found, escape the $ */
294 1.45 dsl return 0;
295 1.45 dsl }
296 1.45 dsl
297 1.115 rillig /* The .for loop substitutes the items as ${:U<value>...}, which means
298 1.115 rillig * that characters that break this syntax must be backslash-escaped. */
299 1.115 rillig static Boolean
300 1.115 rillig NeedsEscapes(const char *word, char endc)
301 1.115 rillig {
302 1.115 rillig const char *p;
303 1.115 rillig
304 1.115 rillig for (p = word; *p != '\0'; p++) {
305 1.115 rillig if (*p == ':' || *p == '$' || *p == '\\' || *p == endc)
306 1.115 rillig return TRUE;
307 1.115 rillig }
308 1.115 rillig return FALSE;
309 1.115 rillig }
310 1.115 rillig
311 1.110 rillig /* While expanding the body of a .for loop, write the item in the ${:U...}
312 1.115 rillig * expression, escaping characters as needed.
313 1.115 rillig *
314 1.115 rillig * The result is later unescaped by ApplyModifier_Defined. */
315 1.42 dsl static void
316 1.110 rillig Buf_AddEscaped(Buffer *cmds, const char *item, char ech)
317 1.42 dsl {
318 1.61 rillig char ch;
319 1.61 rillig
320 1.115 rillig if (!NeedsEscapes(item, ech)) {
321 1.59 rillig Buf_AddStr(cmds, item);
322 1.42 dsl return;
323 1.42 dsl }
324 1.42 dsl
325 1.74 rillig /* Escape ':', '$', '\\' and 'ech' - these will be removed later by
326 1.74 rillig * :U processing, see ApplyModifier_Defined. */
327 1.95 rillig while ((ch = *item++) != '\0') {
328 1.45 dsl if (ch == '$') {
329 1.59 rillig size_t len = for_var_len(item);
330 1.45 dsl if (len != 0) {
331 1.62 rillig Buf_AddBytes(cmds, item - 1, len + 1);
332 1.45 dsl item += len;
333 1.45 dsl continue;
334 1.45 dsl }
335 1.45 dsl Buf_AddByte(cmds, '\\');
336 1.45 dsl } else if (ch == ':' || ch == '\\' || ch == ech)
337 1.42 dsl Buf_AddByte(cmds, '\\');
338 1.42 dsl Buf_AddByte(cmds, ch);
339 1.42 dsl }
340 1.42 dsl }
341 1.42 dsl
342 1.109 rillig /* While expanding the body of a .for loop, replace expressions like
343 1.109 rillig * ${i}, ${i:...}, $(i) or $(i:...) with their ${:U...} expansion. */
344 1.97 rillig static void
345 1.110 rillig SubstVarLong(For *f, const char **pp, const char **inout_mark, char ech)
346 1.97 rillig {
347 1.97 rillig size_t i;
348 1.110 rillig const char *p = *pp;
349 1.97 rillig
350 1.109 rillig for (i = 0; i < f->vars.len; i++) {
351 1.109 rillig ForVar *forVar = Vector_Get(&f->vars, i);
352 1.97 rillig char *var = forVar->name;
353 1.97 rillig size_t vlen = forVar->len;
354 1.97 rillig
355 1.110 rillig /* XXX: undefined behavior for p if vlen is longer than p? */
356 1.110 rillig if (memcmp(p, var, vlen) != 0)
357 1.97 rillig continue;
358 1.97 rillig /* XXX: why test for backslash here? */
359 1.110 rillig if (p[vlen] != ':' && p[vlen] != ech && p[vlen] != '\\')
360 1.97 rillig continue;
361 1.97 rillig
362 1.97 rillig /* Found a variable match. Replace with :U<value> */
363 1.110 rillig Buf_AddBytesBetween(&f->curBody, *inout_mark, p);
364 1.109 rillig Buf_AddStr(&f->curBody, ":U");
365 1.110 rillig Buf_AddEscaped(&f->curBody, f->items.words[f->sub_next + i], ech);
366 1.110 rillig
367 1.110 rillig p += vlen;
368 1.110 rillig *inout_mark = p;
369 1.97 rillig break;
370 1.97 rillig }
371 1.97 rillig
372 1.110 rillig *pp = p;
373 1.97 rillig }
374 1.97 rillig
375 1.109 rillig /* While expanding the body of a .for loop, replace single-character
376 1.109 rillig * variable expressions like $i with their ${:U...} expansion. */
377 1.98 rillig static void
378 1.116 rillig SubstVarShort(For *f, char ch, const char **pp, const char **inout_mark)
379 1.98 rillig {
380 1.110 rillig const char *p = *pp;
381 1.98 rillig size_t i;
382 1.98 rillig
383 1.111 rillig /* Probably a single character name, ignore $$ and stupid ones. */
384 1.109 rillig if (!f->short_var || strchr("}):$", ch) != NULL) {
385 1.110 rillig p++;
386 1.110 rillig *pp = p;
387 1.98 rillig return;
388 1.98 rillig }
389 1.98 rillig
390 1.109 rillig for (i = 0; i < f->vars.len; i++) {
391 1.109 rillig ForVar *var = Vector_Get(&f->vars, i);
392 1.110 rillig const char *varname = var->name;
393 1.109 rillig if (varname[0] != ch || varname[1] != '\0')
394 1.98 rillig continue;
395 1.98 rillig
396 1.98 rillig /* Found a variable match. Replace with ${:U<value>} */
397 1.110 rillig Buf_AddBytesBetween(&f->curBody, *inout_mark, p);
398 1.109 rillig Buf_AddStr(&f->curBody, "{:U");
399 1.110 rillig Buf_AddEscaped(&f->curBody, f->items.words[f->sub_next + i], '}');
400 1.109 rillig Buf_AddByte(&f->curBody, '}');
401 1.110 rillig
402 1.110 rillig *inout_mark = ++p;
403 1.98 rillig break;
404 1.98 rillig }
405 1.98 rillig
406 1.110 rillig *pp = p;
407 1.98 rillig }
408 1.98 rillig
409 1.95 rillig /*
410 1.95 rillig * Scan the for loop body and replace references to the loop variables
411 1.95 rillig * with variable references that expand to the required text.
412 1.95 rillig *
413 1.95 rillig * Using variable expansions ensures that the .for loop can't generate
414 1.95 rillig * syntax, and that the later parsing will still see a variable.
415 1.95 rillig * We assume that the null variable will never be defined.
416 1.95 rillig *
417 1.95 rillig * The detection of substitutions of the loop control variable is naive.
418 1.95 rillig * Many of the modifiers use \ to escape $ (not $) so it is possible
419 1.95 rillig * to contrive a makefile where an unwanted substitution happens.
420 1.95 rillig */
421 1.43 dsl static char *
422 1.109 rillig ForIterate(void *v_arg, size_t *out_len)
423 1.1 cgd {
424 1.109 rillig For *f = v_arg;
425 1.110 rillig const char *p;
426 1.110 rillig const char *mark; /* where the last replacement left off */
427 1.77 rillig const char *body_end;
428 1.76 rillig char *cmds_str;
429 1.7 christos
430 1.109 rillig if (f->sub_next + f->vars.len > f->items.len) {
431 1.43 dsl /* No more iterations */
432 1.109 rillig For_Free(f);
433 1.43 dsl return NULL;
434 1.43 dsl }
435 1.1 cgd
436 1.109 rillig Buf_Empty(&f->curBody);
437 1.7 christos
438 1.110 rillig mark = Buf_GetAll(&f->body, NULL);
439 1.110 rillig body_end = mark + Buf_Len(&f->body);
440 1.110 rillig for (p = mark; (p = strchr(p, '$')) != NULL;) {
441 1.95 rillig char ch, ech;
442 1.110 rillig ch = *++p;
443 1.53 riastrad if ((ch == '(' && (ech = ')', 1)) || (ch == '{' && (ech = '}', 1))) {
444 1.110 rillig p++;
445 1.43 dsl /* Check variable name against the .for loop variables */
446 1.110 rillig SubstVarLong(f, &p, &mark, ech);
447 1.43 dsl continue;
448 1.43 dsl }
449 1.95 rillig if (ch == '\0')
450 1.43 dsl break;
451 1.97 rillig
452 1.110 rillig SubstVarShort(f, ch, &p, &mark);
453 1.43 dsl }
454 1.110 rillig Buf_AddBytesBetween(&f->curBody, mark, body_end);
455 1.43 dsl
456 1.109 rillig *out_len = Buf_Len(&f->curBody);
457 1.109 rillig cmds_str = Buf_GetAll(&f->curBody, NULL);
458 1.89 rillig DEBUG1(FOR, "For: loop body:\n%s", cmds_str);
459 1.39 dsl
460 1.109 rillig f->sub_next += f->vars.len;
461 1.43 dsl
462 1.76 rillig return cmds_str;
463 1.43 dsl }
464 1.7 christos
465 1.60 rillig /* Run the for loop, imitating the actions of an include file. */
466 1.43 dsl void
467 1.43 dsl For_Run(int lineno)
468 1.54 rillig {
469 1.109 rillig For *f = accumFor;
470 1.43 dsl accumFor = NULL;
471 1.1 cgd
472 1.109 rillig if (f->items.len == 0) {
473 1.58 rillig /* Nothing to expand - possibly due to an earlier syntax error. */
474 1.109 rillig For_Free(f);
475 1.58 rillig return;
476 1.43 dsl }
477 1.54 rillig
478 1.109 rillig Parse_SetInput(NULL, lineno, -1, ForIterate, f);
479 1.1 cgd }
480