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