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