for.c revision 1.63 1 1.63 rillig /* $NetBSD: for.c,v 1.63 2020/08/09 19:51:02 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.17 ross #ifndef MAKE_NATIVE
33 1.63 rillig static char rcsid[] = "$NetBSD: for.c,v 1.63 2020/08/09 19:51:02 rillig Exp $";
34 1.6 lukem #else
35 1.5 christos #include <sys/cdefs.h>
36 1.1 cgd #ifndef lint
37 1.3 christos #if 0
38 1.4 christos static char sccsid[] = "@(#)for.c 8.1 (Berkeley) 6/6/93";
39 1.3 christos #else
40 1.63 rillig __RCSID("$NetBSD: for.c,v 1.63 2020/08/09 19:51:02 rillig Exp $");
41 1.3 christos #endif
42 1.1 cgd #endif /* not lint */
43 1.6 lukem #endif
44 1.1 cgd
45 1.1 cgd /*-
46 1.1 cgd * for.c --
47 1.1 cgd * Functions to handle loops in a makefile.
48 1.1 cgd *
49 1.1 cgd * Interface:
50 1.1 cgd * For_Eval Evaluate the loop in the passed line.
51 1.1 cgd * For_Run Run accumulated loop
52 1.1 cgd *
53 1.1 cgd */
54 1.1 cgd
55 1.13 wiz #include <assert.h>
56 1.1 cgd #include <ctype.h>
57 1.13 wiz
58 1.1 cgd #include "make.h"
59 1.1 cgd #include "hash.h"
60 1.1 cgd #include "dir.h"
61 1.1 cgd #include "buf.h"
62 1.38 dsl #include "strlist.h"
63 1.1 cgd
64 1.44 dsl #define FOR_SUB_ESCAPE_CHAR 1
65 1.42 dsl #define FOR_SUB_ESCAPE_BRACE 2
66 1.42 dsl #define FOR_SUB_ESCAPE_PAREN 4
67 1.42 dsl
68 1.1 cgd /*
69 1.1 cgd * For statements are of the form:
70 1.1 cgd *
71 1.1 cgd * .for <variable> in <varlist>
72 1.1 cgd * ...
73 1.1 cgd * .endfor
74 1.1 cgd *
75 1.1 cgd * The trick is to look for the matching end inside for for loop
76 1.1 cgd * To do that, we count the current nesting level of the for loops.
77 1.1 cgd * and the .endfor statements, accumulating all the statements between
78 1.4 christos * the initial .for loop and the matching .endfor;
79 1.1 cgd * then we evaluate the for loop for each variable in the varlist.
80 1.7 christos *
81 1.7 christos * Note that any nested fors are just passed through; they get handled
82 1.7 christos * recursively in For_Eval when we're expanding the enclosing for in
83 1.7 christos * For_Run.
84 1.1 cgd */
85 1.1 cgd
86 1.63 rillig static int forLevel = 0; /* Nesting level */
87 1.1 cgd
88 1.1 cgd /*
89 1.1 cgd * State of a for loop.
90 1.1 cgd */
91 1.57 rillig typedef struct {
92 1.63 rillig Buffer buf; /* Body of loop */
93 1.63 rillig strlist_t vars; /* Iteration variables */
94 1.63 rillig strlist_t items; /* Substitution items */
95 1.63 rillig char *parse_buf;
96 1.63 rillig int short_var;
97 1.63 rillig int sub_next;
98 1.2 jtc } For;
99 1.1 cgd
100 1.63 rillig static For *accumFor; /* Loop being accumulated */
101 1.1 cgd
102 1.7 christos
103 1.33 dsl static char *
104 1.33 dsl make_str(const char *ptr, int len)
105 1.33 dsl {
106 1.63 rillig char *new_ptr;
107 1.33 dsl
108 1.63 rillig new_ptr = bmake_malloc(len + 1);
109 1.63 rillig memcpy(new_ptr, ptr, len);
110 1.63 rillig new_ptr[len] = 0;
111 1.63 rillig return new_ptr;
112 1.33 dsl }
113 1.33 dsl
114 1.43 dsl static void
115 1.43 dsl For_Free(For *arg)
116 1.43 dsl {
117 1.46 dsl Buf_Destroy(&arg->buf, TRUE);
118 1.43 dsl strlist_clean(&arg->vars);
119 1.43 dsl strlist_clean(&arg->items);
120 1.43 dsl free(arg->parse_buf);
121 1.43 dsl
122 1.43 dsl free(arg);
123 1.43 dsl }
124 1.43 dsl
125 1.7 christos /*-
126 1.7 christos *-----------------------------------------------------------------------
127 1.1 cgd * For_Eval --
128 1.1 cgd * Evaluate the for loop in the passed line. The line
129 1.1 cgd * looks like this:
130 1.1 cgd * .for <variable> in <varlist>
131 1.1 cgd *
132 1.13 wiz * Input:
133 1.13 wiz * line Line to parse
134 1.13 wiz *
135 1.1 cgd * Results:
136 1.35 dsl * 0: Not a .for statement, parse the line
137 1.35 dsl * 1: We found a for loop
138 1.35 dsl * -1: A .for statement with a bad syntax error, discard.
139 1.1 cgd *
140 1.1 cgd * Side Effects:
141 1.1 cgd * None.
142 1.1 cgd *
143 1.1 cgd *-----------------------------------------------------------------------
144 1.1 cgd */
145 1.1 cgd int
146 1.13 wiz For_Eval(char *line)
147 1.1 cgd {
148 1.43 dsl For *new_for;
149 1.33 dsl char *ptr = line, *sub;
150 1.33 dsl int len;
151 1.39 dsl int escapes;
152 1.42 dsl unsigned char ch;
153 1.49 sjg char **words, *word_buf;
154 1.49 sjg int n, nwords;
155 1.33 dsl
156 1.43 dsl /* Skip the '.' and any following whitespace */
157 1.63 rillig for (ptr++; *ptr && isspace((unsigned char)*ptr); ptr++)
158 1.32 dsl continue;
159 1.43 dsl
160 1.32 dsl /*
161 1.32 dsl * If we are not in a for loop quickly determine if the statement is
162 1.32 dsl * a for.
163 1.32 dsl */
164 1.32 dsl if (ptr[0] != 'f' || ptr[1] != 'o' || ptr[2] != 'r' ||
165 1.63 rillig !isspace((unsigned char)ptr[3])) {
166 1.63 rillig if (ptr[0] == 'e' && strncmp(ptr + 1, "ndfor", 5) == 0) {
167 1.32 dsl Parse_Error(PARSE_FATAL, "for-less endfor");
168 1.32 dsl return -1;
169 1.32 dsl }
170 1.32 dsl return 0;
171 1.32 dsl }
172 1.32 dsl ptr += 3;
173 1.1 cgd
174 1.32 dsl /*
175 1.32 dsl * we found a for loop, and now we are going to parse it.
176 1.32 dsl */
177 1.1 cgd
178 1.43 dsl new_for = bmake_malloc(sizeof *new_for);
179 1.43 dsl memset(new_for, 0, sizeof *new_for);
180 1.43 dsl
181 1.33 dsl /* Grab the variables. Terminate on "in". */
182 1.33 dsl for (;; ptr += len) {
183 1.63 rillig while (*ptr && isspace((unsigned char)*ptr))
184 1.32 dsl ptr++;
185 1.33 dsl if (*ptr == '\0') {
186 1.33 dsl Parse_Error(PARSE_FATAL, "missing `in' in for");
187 1.43 dsl For_Free(new_for);
188 1.33 dsl return -1;
189 1.33 dsl }
190 1.33 dsl for (len = 1; ptr[len] && !isspace((unsigned char)ptr[len]); len++)
191 1.33 dsl continue;
192 1.33 dsl if (len == 2 && ptr[0] == 'i' && ptr[1] == 'n') {
193 1.33 dsl ptr += 2;
194 1.33 dsl break;
195 1.33 dsl }
196 1.43 dsl if (len == 1)
197 1.43 dsl new_for->short_var = 1;
198 1.43 dsl strlist_add_str(&new_for->vars, make_str(ptr, len), len);
199 1.32 dsl }
200 1.1 cgd
201 1.43 dsl if (strlist_num(&new_for->vars) == 0) {
202 1.32 dsl Parse_Error(PARSE_FATAL, "no iteration variables in for");
203 1.43 dsl For_Free(new_for);
204 1.32 dsl return -1;
205 1.32 dsl }
206 1.4 christos
207 1.63 rillig while (*ptr && isspace((unsigned char)*ptr))
208 1.32 dsl ptr++;
209 1.32 dsl
210 1.32 dsl /*
211 1.32 dsl * Make a list with the remaining words
212 1.42 dsl * The values are substituted as ${:U<value>...} so we must \ escape
213 1.44 dsl * characters that break that syntax.
214 1.44 dsl * Variables are fully expanded - so it is safe for escape $.
215 1.44 dsl * We can't do the escapes here - because we don't know whether
216 1.44 dsl * we are substuting into ${...} or $(...).
217 1.32 dsl */
218 1.56 rillig sub = Var_Subst(ptr, VAR_GLOBAL, VARE_WANTRES);
219 1.4 christos
220 1.49 sjg /*
221 1.49 sjg * Split into words allowing for quoted strings.
222 1.49 sjg */
223 1.49 sjg words = brk_string(sub, &nwords, FALSE, &word_buf);
224 1.49 sjg
225 1.49 sjg free(sub);
226 1.54 rillig
227 1.49 sjg if (words != NULL) {
228 1.49 sjg for (n = 0; n < nwords; n++) {
229 1.49 sjg ptr = words[n];
230 1.49 sjg if (!*ptr)
231 1.49 sjg continue;
232 1.49 sjg escapes = 0;
233 1.49 sjg while ((ch = *ptr++)) {
234 1.63 rillig switch (ch) {
235 1.49 sjg case ':':
236 1.49 sjg case '$':
237 1.49 sjg case '\\':
238 1.49 sjg escapes |= FOR_SUB_ESCAPE_CHAR;
239 1.49 sjg break;
240 1.49 sjg case ')':
241 1.49 sjg escapes |= FOR_SUB_ESCAPE_PAREN;
242 1.49 sjg break;
243 1.49 sjg case /*{*/ '}':
244 1.49 sjg escapes |= FOR_SUB_ESCAPE_BRACE;
245 1.49 sjg break;
246 1.49 sjg }
247 1.49 sjg }
248 1.49 sjg /*
249 1.49 sjg * We have to dup words[n] to maintain the semantics of
250 1.49 sjg * strlist.
251 1.49 sjg */
252 1.49 sjg strlist_add_str(&new_for->items, bmake_strdup(words[n]), escapes);
253 1.39 dsl }
254 1.1 cgd
255 1.49 sjg free(words);
256 1.49 sjg free(word_buf);
257 1.7 christos
258 1.49 sjg if ((len = strlist_num(&new_for->items)) > 0 &&
259 1.49 sjg len % (n = strlist_num(&new_for->vars))) {
260 1.49 sjg Parse_Error(PARSE_FATAL,
261 1.49 sjg "Wrong number of words (%d) in .for substitution list"
262 1.49 sjg " with %d vars", len, n);
263 1.49 sjg /*
264 1.49 sjg * Return 'success' so that the body of the .for loop is
265 1.49 sjg * accumulated.
266 1.49 sjg * Remove all items so that the loop doesn't iterate.
267 1.49 sjg */
268 1.49 sjg strlist_clean(&new_for->items);
269 1.49 sjg }
270 1.32 dsl }
271 1.32 dsl
272 1.62 rillig Buf_Init(&new_for->buf, 0);
273 1.43 dsl accumFor = new_for;
274 1.32 dsl forLevel = 1;
275 1.32 dsl return 1;
276 1.32 dsl }
277 1.7 christos
278 1.35 dsl /*
279 1.35 dsl * Add another line to a .for loop.
280 1.43 dsl * Returns 0 when the matching .endfor is reached.
281 1.35 dsl */
282 1.35 dsl
283 1.32 dsl int
284 1.32 dsl For_Accum(char *line)
285 1.32 dsl {
286 1.32 dsl char *ptr = line;
287 1.26 dsl
288 1.26 dsl if (*ptr == '.') {
289 1.1 cgd
290 1.63 rillig for (ptr++; *ptr && isspace((unsigned char)*ptr); ptr++)
291 1.1 cgd continue;
292 1.1 cgd
293 1.2 jtc if (strncmp(ptr, "endfor", 6) == 0 &&
294 1.63 rillig (isspace((unsigned char)ptr[6]) || !ptr[6])) {
295 1.1 cgd if (DEBUG(FOR))
296 1.23 dsl (void)fprintf(debug_file, "For: end for %d\n", forLevel);
297 1.32 dsl if (--forLevel <= 0)
298 1.1 cgd return 0;
299 1.26 dsl } else if (strncmp(ptr, "for", 3) == 0 &&
300 1.63 rillig isspace((unsigned char)ptr[3])) {
301 1.1 cgd forLevel++;
302 1.1 cgd if (DEBUG(FOR))
303 1.23 dsl (void)fprintf(debug_file, "For: new loop %d\n", forLevel);
304 1.1 cgd }
305 1.1 cgd }
306 1.1 cgd
307 1.59 rillig Buf_AddStr(&accumFor->buf, line);
308 1.46 dsl Buf_AddByte(&accumFor->buf, '\n');
309 1.32 dsl return 1;
310 1.1 cgd }
311 1.1 cgd
312 1.42 dsl
313 1.59 rillig static size_t
314 1.45 dsl for_var_len(const char *var)
315 1.45 dsl {
316 1.45 dsl char ch, var_start, var_end;
317 1.61 rillig int depth;
318 1.61 rillig size_t len;
319 1.45 dsl
320 1.45 dsl var_start = *var;
321 1.45 dsl if (var_start == 0)
322 1.45 dsl /* just escape the $ */
323 1.45 dsl return 0;
324 1.45 dsl
325 1.45 dsl if (var_start == '(')
326 1.45 dsl var_end = ')';
327 1.45 dsl else if (var_start == '{')
328 1.45 dsl var_end = '}';
329 1.45 dsl else
330 1.45 dsl /* Single char variable */
331 1.45 dsl return 1;
332 1.45 dsl
333 1.61 rillig depth = 1;
334 1.45 dsl for (len = 1; (ch = var[len++]) != 0;) {
335 1.45 dsl if (ch == var_start)
336 1.45 dsl depth++;
337 1.45 dsl else if (ch == var_end && --depth == 0)
338 1.45 dsl return len;
339 1.45 dsl }
340 1.45 dsl
341 1.45 dsl /* Variable end not found, escape the $ */
342 1.45 dsl return 0;
343 1.45 dsl }
344 1.45 dsl
345 1.42 dsl static void
346 1.46 dsl for_substitute(Buffer *cmds, strlist_t *items, unsigned int item_no, char ech)
347 1.42 dsl {
348 1.61 rillig char ch;
349 1.61 rillig
350 1.42 dsl const char *item = strlist_str(items, item_no);
351 1.42 dsl
352 1.42 dsl /* If there were no escapes, or the only escape is the other variable
353 1.42 dsl * terminator, then just substitute the full string */
354 1.42 dsl if (!(strlist_info(items, item_no) &
355 1.63 rillig (ech == ')' ? ~FOR_SUB_ESCAPE_BRACE : ~FOR_SUB_ESCAPE_PAREN))) {
356 1.59 rillig Buf_AddStr(cmds, item);
357 1.42 dsl return;
358 1.42 dsl }
359 1.42 dsl
360 1.44 dsl /* Escape ':', '$', '\\' and 'ech' - removed by :U processing */
361 1.45 dsl while ((ch = *item++) != 0) {
362 1.45 dsl if (ch == '$') {
363 1.59 rillig size_t len = for_var_len(item);
364 1.45 dsl if (len != 0) {
365 1.62 rillig Buf_AddBytes(cmds, item - 1, len + 1);
366 1.45 dsl item += len;
367 1.45 dsl continue;
368 1.45 dsl }
369 1.45 dsl Buf_AddByte(cmds, '\\');
370 1.45 dsl } else if (ch == ':' || ch == '\\' || ch == ech)
371 1.42 dsl Buf_AddByte(cmds, '\\');
372 1.42 dsl Buf_AddByte(cmds, ch);
373 1.42 dsl }
374 1.42 dsl }
375 1.42 dsl
376 1.43 dsl static char *
377 1.48 dholland For_Iterate(void *v_arg, size_t *ret_len)
378 1.1 cgd {
379 1.43 dsl For *arg = v_arg;
380 1.59 rillig int i;
381 1.42 dsl char *var;
382 1.39 dsl char *cp;
383 1.39 dsl char *cmd_cp;
384 1.39 dsl char *body_end;
385 1.39 dsl char ch;
386 1.39 dsl Buffer cmds;
387 1.61 rillig size_t cmd_len;
388 1.7 christos
389 1.43 dsl if (arg->sub_next + strlist_num(&arg->vars) > strlist_num(&arg->items)) {
390 1.43 dsl /* No more iterations */
391 1.43 dsl For_Free(arg);
392 1.43 dsl return NULL;
393 1.43 dsl }
394 1.1 cgd
395 1.43 dsl free(arg->parse_buf);
396 1.43 dsl arg->parse_buf = NULL;
397 1.7 christos
398 1.39 dsl /*
399 1.39 dsl * Scan the for loop body and replace references to the loop variables
400 1.39 dsl * with variable references that expand to the required text.
401 1.39 dsl * Using variable expansions ensures that the .for loop can't generate
402 1.39 dsl * syntax, and that the later parsing will still see a variable.
403 1.39 dsl * We assume that the null variable will never be defined.
404 1.39 dsl *
405 1.39 dsl * The detection of substitions of the loop control variable is naive.
406 1.39 dsl * Many of the modifiers use \ to escape $ (not $) so it is possible
407 1.39 dsl * to contrive a makefile where an unwanted substitution happens.
408 1.39 dsl */
409 1.43 dsl
410 1.62 rillig cmd_cp = Buf_GetAll(&arg->buf, &cmd_len);
411 1.59 rillig body_end = cmd_cp + cmd_len;
412 1.62 rillig Buf_Init(&cmds, cmd_len + 256);
413 1.43 dsl for (cp = cmd_cp; (cp = strchr(cp, '$')) != NULL;) {
414 1.43 dsl char ech;
415 1.43 dsl ch = *++cp;
416 1.53 riastrad if ((ch == '(' && (ech = ')', 1)) || (ch == '{' && (ech = '}', 1))) {
417 1.43 dsl cp++;
418 1.43 dsl /* Check variable name against the .for loop variables */
419 1.43 dsl STRLIST_FOREACH(var, &arg->vars, i) {
420 1.59 rillig size_t vlen = strlist_info(&arg->vars, i);
421 1.59 rillig if (memcmp(cp, var, vlen) != 0)
422 1.43 dsl continue;
423 1.59 rillig if (cp[vlen] != ':' && cp[vlen] != ech && cp[vlen] != '\\')
424 1.39 dsl continue;
425 1.43 dsl /* Found a variable match. Replace with :U<value> */
426 1.59 rillig Buf_AddBytesBetween(&cmds, cmd_cp, cp);
427 1.59 rillig Buf_AddStr(&cmds, ":U");
428 1.59 rillig cp += vlen;
429 1.43 dsl cmd_cp = cp;
430 1.46 dsl for_substitute(&cmds, &arg->items, arg->sub_next + i, ech);
431 1.39 dsl break;
432 1.39 dsl }
433 1.43 dsl continue;
434 1.43 dsl }
435 1.43 dsl if (ch == 0)
436 1.43 dsl break;
437 1.43 dsl /* Probably a single character name, ignore $$ and stupid ones. {*/
438 1.43 dsl if (!arg->short_var || strchr("}):$", ch) != NULL) {
439 1.43 dsl cp++;
440 1.43 dsl continue;
441 1.43 dsl }
442 1.43 dsl STRLIST_FOREACH(var, &arg->vars, i) {
443 1.43 dsl if (var[0] != ch || var[1] != 0)
444 1.43 dsl continue;
445 1.43 dsl /* Found a variable match. Replace with ${:U<value>} */
446 1.59 rillig Buf_AddBytesBetween(&cmds, cmd_cp, cp);
447 1.59 rillig Buf_AddStr(&cmds, "{:U");
448 1.43 dsl cmd_cp = ++cp;
449 1.46 dsl for_substitute(&cmds, &arg->items, arg->sub_next + i, /*{*/ '}');
450 1.59 rillig Buf_AddByte(&cmds, '}');
451 1.43 dsl break;
452 1.39 dsl }
453 1.43 dsl }
454 1.59 rillig Buf_AddBytesBetween(&cmds, cmd_cp, body_end);
455 1.43 dsl
456 1.46 dsl cp = Buf_Destroy(&cmds, FALSE);
457 1.43 dsl if (DEBUG(FOR))
458 1.43 dsl (void)fprintf(debug_file, "For: loop body:\n%s", cp);
459 1.39 dsl
460 1.43 dsl arg->sub_next += strlist_num(&arg->vars);
461 1.43 dsl
462 1.43 dsl arg->parse_buf = cp;
463 1.48 dholland *ret_len = strlen(cp);
464 1.43 dsl return cp;
465 1.43 dsl }
466 1.7 christos
467 1.60 rillig /* Run the for loop, imitating the actions of an include file. */
468 1.43 dsl void
469 1.43 dsl For_Run(int lineno)
470 1.54 rillig {
471 1.43 dsl For *arg;
472 1.54 rillig
473 1.43 dsl arg = accumFor;
474 1.43 dsl accumFor = NULL;
475 1.1 cgd
476 1.43 dsl if (strlist_num(&arg->items) == 0) {
477 1.58 rillig /* Nothing to expand - possibly due to an earlier syntax error. */
478 1.58 rillig For_Free(arg);
479 1.58 rillig return;
480 1.43 dsl }
481 1.54 rillig
482 1.43 dsl Parse_SetInput(NULL, lineno, -1, For_Iterate, arg);
483 1.1 cgd }
484