for.c revision 1.40 1 1.40 dsl /* $NetBSD: for.c,v 1.40 2008/12/21 19:19:55 dsl 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.40 dsl static char rcsid[] = "$NetBSD: for.c,v 1.40 2008/12/21 19:19:55 dsl 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.40 dsl __RCSID("$NetBSD: for.c,v 1.40 2008/12/21 19:19:55 dsl 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.1 cgd /*
65 1.1 cgd * For statements are of the form:
66 1.1 cgd *
67 1.1 cgd * .for <variable> in <varlist>
68 1.1 cgd * ...
69 1.1 cgd * .endfor
70 1.1 cgd *
71 1.1 cgd * The trick is to look for the matching end inside for for loop
72 1.1 cgd * To do that, we count the current nesting level of the for loops.
73 1.1 cgd * and the .endfor statements, accumulating all the statements between
74 1.4 christos * the initial .for loop and the matching .endfor;
75 1.1 cgd * then we evaluate the for loop for each variable in the varlist.
76 1.7 christos *
77 1.7 christos * Note that any nested fors are just passed through; they get handled
78 1.7 christos * recursively in For_Eval when we're expanding the enclosing for in
79 1.7 christos * For_Run.
80 1.1 cgd */
81 1.1 cgd
82 1.1 cgd static int forLevel = 0; /* Nesting level */
83 1.1 cgd
84 1.1 cgd /*
85 1.1 cgd * State of a for loop.
86 1.1 cgd */
87 1.2 jtc typedef struct _For {
88 1.7 christos Buffer buf; /* Body of loop */
89 1.38 dsl strlist_t vars; /* Iteration variables */
90 1.38 dsl strlist_t items; /* Substitution items */
91 1.2 jtc } For;
92 1.1 cgd
93 1.7 christos static For accumFor; /* Loop being accumulated */
94 1.1 cgd
95 1.1 cgd
96 1.7 christos
98 1.33 dsl static char *
99 1.33 dsl make_str(const char *ptr, int len)
100 1.33 dsl {
101 1.33 dsl char *new_ptr;
102 1.33 dsl
103 1.33 dsl new_ptr = bmake_malloc(len + 1);
104 1.33 dsl memcpy(new_ptr, ptr, len);
105 1.33 dsl new_ptr[len] = 0;
106 1.33 dsl return new_ptr;
107 1.33 dsl }
108 1.7 christos
109 1.7 christos /*-
110 1.1 cgd *-----------------------------------------------------------------------
111 1.1 cgd * For_Eval --
112 1.1 cgd * Evaluate the for loop in the passed line. The line
113 1.1 cgd * looks like this:
114 1.1 cgd * .for <variable> in <varlist>
115 1.13 wiz *
116 1.13 wiz * Input:
117 1.13 wiz * line Line to parse
118 1.1 cgd *
119 1.35 dsl * Results:
120 1.35 dsl * 0: Not a .for statement, parse the line
121 1.35 dsl * 1: We found a for loop
122 1.1 cgd * -1: A .for statement with a bad syntax error, discard.
123 1.1 cgd *
124 1.1 cgd * Side Effects:
125 1.1 cgd * None.
126 1.1 cgd *
127 1.1 cgd *-----------------------------------------------------------------------
128 1.1 cgd */
129 1.13 wiz int
130 1.1 cgd For_Eval(char *line)
131 1.33 dsl {
132 1.33 dsl char *ptr = line, *sub;
133 1.39 dsl int len;
134 1.39 dsl int i;
135 1.40 dsl int escapes;
136 1.40 dsl int depth;
137 1.33 dsl char ch;
138 1.33 dsl
139 1.33 dsl /* Forget anything we previously knew about - it cannot be useful */
140 1.32 dsl memset(&accumFor, 0, sizeof accumFor);
141 1.32 dsl
142 1.32 dsl forLevel = 0;
143 1.32 dsl for (ptr++; *ptr && isspace((unsigned char) *ptr); ptr++)
144 1.32 dsl continue;
145 1.32 dsl /*
146 1.32 dsl * If we are not in a for loop quickly determine if the statement is
147 1.32 dsl * a for.
148 1.32 dsl */
149 1.32 dsl if (ptr[0] != 'f' || ptr[1] != 'o' || ptr[2] != 'r' ||
150 1.32 dsl !isspace((unsigned char) ptr[3])) {
151 1.32 dsl if (ptr[0] == 'e' && strncmp(ptr+1, "ndfor", 5) == 0) {
152 1.32 dsl Parse_Error(PARSE_FATAL, "for-less endfor");
153 1.32 dsl return -1;
154 1.32 dsl }
155 1.32 dsl return 0;
156 1.32 dsl }
157 1.1 cgd ptr += 3;
158 1.32 dsl
159 1.32 dsl /*
160 1.32 dsl * we found a for loop, and now we are going to parse it.
161 1.1 cgd */
162 1.33 dsl
163 1.33 dsl /* Grab the variables. Terminate on "in". */
164 1.32 dsl for (;; ptr += len) {
165 1.32 dsl while (*ptr && isspace((unsigned char) *ptr))
166 1.33 dsl ptr++;
167 1.33 dsl if (*ptr == '\0') {
168 1.33 dsl Parse_Error(PARSE_FATAL, "missing `in' in for");
169 1.33 dsl return -1;
170 1.33 dsl }
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.38 dsl }
177 1.32 dsl strlist_add_str(&accumFor.vars, make_str(ptr, len));
178 1.1 cgd }
179 1.38 dsl
180 1.32 dsl if (strlist_num(&accumFor.vars) == 0) {
181 1.32 dsl Parse_Error(PARSE_FATAL, "no iteration variables in for");
182 1.32 dsl return -1;
183 1.4 christos }
184 1.32 dsl
185 1.32 dsl while (*ptr && isspace((unsigned char) *ptr))
186 1.32 dsl ptr++;
187 1.32 dsl
188 1.32 dsl /*
189 1.39 dsl * Make a list with the remaining words
190 1.39 dsl * The values are substituted as ${:U<value>... so we must \ escape
191 1.32 dsl * characters that break that syntax - particularly ':', maybe $ and \.
192 1.32 dsl */
193 1.4 christos sub = Var_Subst(NULL, ptr, VAR_GLOBAL, FALSE);
194 1.38 dsl
195 1.33 dsl for (ptr = sub;; ptr += len) {
196 1.33 dsl while (*ptr && isspace((unsigned char)*ptr))
197 1.33 dsl ptr++;
198 1.33 dsl if (*ptr == 0)
199 1.39 dsl break;
200 1.39 dsl escapes = 0;
201 1.39 dsl for (len = 0; ptr[len] && !isspace((unsigned char)ptr[len]); len++)
202 1.39 dsl if (ptr[len] == ':')
203 1.39 dsl escapes++;
204 1.39 dsl if (escapes == 0)
205 1.39 dsl strlist_add_str(&accumFor.items, make_str(ptr, len));
206 1.39 dsl else {
207 1.39 dsl char *item = bmake_malloc(len + escapes + 1);
208 1.40 dsl strlist_add_str(&accumFor.items, item);
209 1.40 dsl for (depth= 0, i = 0; i < len; i++) {
210 1.40 dsl ch = ptr[i];
211 1.40 dsl /* Loose determination of nested variable definitions. */
212 1.40 dsl if (ch == '(' || ch == '{')
213 1.40 dsl depth++;
214 1.40 dsl else if (ch == ')' || ch == '}')
215 1.40 dsl depth--;
216 1.39 dsl else if (ch == ':' && depth == 0)
217 1.40 dsl *item++ = '\\';
218 1.39 dsl *item++ = ch;
219 1.39 dsl }
220 1.39 dsl *item = 0;
221 1.33 dsl }
222 1.1 cgd }
223 1.33 dsl
224 1.7 christos free(sub);
225 1.38 dsl
226 1.33 dsl if (strlist_num(&accumFor.items) % strlist_num(&accumFor.vars)) {
227 1.33 dsl Parse_Error(PARSE_FATAL,
228 1.38 dsl "Wrong number of words in .for substitution list %d %d",
229 1.33 dsl strlist_num(&accumFor.items), strlist_num(&accumFor.vars));
230 1.33 dsl /*
231 1.33 dsl * Return 'success' so that the body of the .for loop is accumulated.
232 1.33 dsl * The loop will have zero iterations expanded due a later test.
233 1.32 dsl */
234 1.32 dsl }
235 1.32 dsl
236 1.32 dsl accumFor.buf = Buf_Init(0);
237 1.32 dsl forLevel = 1;
238 1.32 dsl return 1;
239 1.7 christos }
240 1.35 dsl
241 1.35 dsl /*
242 1.35 dsl * Add another line to a .for loop.
243 1.35 dsl * Returns 0 when the matching .enfor is reached.
244 1.35 dsl */
245 1.32 dsl
246 1.32 dsl int
247 1.32 dsl For_Accum(char *line)
248 1.32 dsl {
249 1.26 dsl char *ptr = line;
250 1.26 dsl
251 1.1 cgd if (*ptr == '.') {
252 1.2 jtc
253 1.1 cgd for (ptr++; *ptr && isspace((unsigned char) *ptr); ptr++)
254 1.1 cgd continue;
255 1.2 jtc
256 1.26 dsl if (strncmp(ptr, "endfor", 6) == 0 &&
257 1.1 cgd (isspace((unsigned char) ptr[6]) || !ptr[6])) {
258 1.23 dsl if (DEBUG(FOR))
259 1.32 dsl (void)fprintf(debug_file, "For: end for %d\n", forLevel);
260 1.1 cgd if (--forLevel <= 0)
261 1.26 dsl return 0;
262 1.2 jtc } else if (strncmp(ptr, "for", 3) == 0 &&
263 1.1 cgd isspace((unsigned char) ptr[3])) {
264 1.1 cgd forLevel++;
265 1.23 dsl if (DEBUG(FOR))
266 1.1 cgd (void)fprintf(debug_file, "For: new loop %d\n", forLevel);
267 1.1 cgd }
268 1.1 cgd }
269 1.32 dsl
270 1.32 dsl Buf_AddBytes(accumFor.buf, strlen(line), (Byte *)line);
271 1.32 dsl Buf_AddByte(accumFor.buf, (Byte)'\n');
272 1.1 cgd return 1;
273 1.1 cgd }
274 1.1 cgd
275 1.1 cgd
276 1.1 cgd /*-
278 1.7 christos *-----------------------------------------------------------------------
279 1.1 cgd * For_Run --
280 1.1 cgd * Run the for loop, imitating the actions of an include file
281 1.1 cgd *
282 1.1 cgd * Results:
283 1.1 cgd * None.
284 1.1 cgd *
285 1.1 cgd * Side Effects:
286 1.1 cgd * None.
287 1.1 cgd *
288 1.1 cgd *-----------------------------------------------------------------------
289 1.16 enami */
290 1.1 cgd void
291 1.2 jtc For_Run(int lineno)
292 1.38 dsl {
293 1.39 dsl For arg;
294 1.39 dsl int i, len;
295 1.38 dsl unsigned int num_items;
296 1.39 dsl char *for_body;
297 1.39 dsl char *var, *item;
298 1.39 dsl char *cp;
299 1.39 dsl char *cmd_cp;
300 1.39 dsl char *body_end;
301 1.39 dsl char ch;
302 1.7 christos Buffer cmds;
303 1.7 christos int short_var;
304 1.38 dsl
305 1.1 cgd arg = accumFor;
306 1.39 dsl memset(&accumFor, 0, sizeof accumFor);
307 1.39 dsl
308 1.33 dsl num_items = strlist_num(&arg.items);
309 1.38 dsl if (num_items % strlist_num(&arg.vars))
310 1.7 christos /* Error message already printed */
311 1.39 dsl goto out;
312 1.39 dsl
313 1.39 dsl short_var = 0;
314 1.39 dsl STRLIST_FOREACH(var, &arg.vars, i) {
315 1.39 dsl if (var[1] == 0) {
316 1.10 mycroft short_var = 1;
317 1.7 christos break;
318 1.7 christos }
319 1.39 dsl }
320 1.39 dsl
321 1.39 dsl /*
322 1.39 dsl * Scan the for loop body and replace references to the loop variables
323 1.39 dsl * with variable references that expand to the required text.
324 1.39 dsl * Using variable expansions ensures that the .for loop can't generate
325 1.39 dsl * syntax, and that the later parsing will still see a variable.
326 1.39 dsl * We assume that the null variable will never be defined.
327 1.39 dsl *
328 1.39 dsl * The detection of substitions of the loop control variable is naive.
329 1.39 dsl * Many of the modifiers use \ to escape $ (not $) so it is possible
330 1.39 dsl * to contrive a makefile where an unwanted substitution happens.
331 1.39 dsl *
332 1.39 dsl * Each loop expansion is fed back into the parser as if it were an
333 1.39 dsl * include file. This means we have to generate the last iteration first.
334 1.39 dsl */
335 1.39 dsl while (num_items != 0) {
336 1.39 dsl num_items -= strlist_num(&arg.vars);
337 1.39 dsl for_body = (char *)Buf_GetAll(arg.buf, &len);
338 1.39 dsl body_end = for_body + len;
339 1.39 dsl cmds = Buf_Init(len + 256);
340 1.39 dsl cmd_cp = for_body;
341 1.39 dsl for (cp = for_body; (cp = strchr(cp, '$')) != NULL;) {
342 1.39 dsl ch = *++cp;
343 1.39 dsl if (ch == '(' || ch == '{') {
344 1.39 dsl char ech = ch == '(' ? ')' : '}';
345 1.39 dsl cp++;
346 1.39 dsl /* Check variable name against the .for loop varoables */
347 1.39 dsl STRLIST_FOREACH(var, &arg.vars, i) {
348 1.39 dsl len = strlen(var);
349 1.39 dsl if (memcmp(cp, var, len) != 0)
350 1.39 dsl continue;
351 1.39 dsl if (cp[len] != ':' && cp[len] != ech)
352 1.39 dsl continue;
353 1.39 dsl /* Found a variable match. Replace with ${:U<value> */
354 1.39 dsl Buf_AddBytes(cmds, cp - cmd_cp, cmd_cp);
355 1.39 dsl Buf_AddBytes(cmds, 2, ":U");
356 1.39 dsl cp += len;
357 1.39 dsl cmd_cp = cp;
358 1.39 dsl item = strlist_str(&arg.items, num_items + i);
359 1.39 dsl Buf_AddBytes(cmds, strlen(item), item);
360 1.39 dsl break;
361 1.39 dsl }
362 1.39 dsl continue;
363 1.39 dsl }
364 1.39 dsl if (ch == 0)
365 1.39 dsl break;
366 1.39 dsl /* Probably a single character name, ignore $$ and stupid ones. */
367 1.39 dsl if (!short_var || strchr("}):$", ch) != NULL) {
368 1.39 dsl cp++;
369 1.39 dsl continue;
370 1.39 dsl }
371 1.39 dsl STRLIST_FOREACH(var, &arg.vars, i) {
372 1.39 dsl if (var[0] != ch || var[1] != 0)
373 1.39 dsl continue;
374 1.39 dsl /* Found a variable match. Replace with ${:U<value>} */
375 1.39 dsl Buf_AddBytes(cmds, cp - cmd_cp, cmd_cp);
376 1.39 dsl Buf_AddBytes(cmds, 3, "{:U");
377 1.39 dsl cmd_cp = ++cp;
378 1.39 dsl item = strlist_str(&arg.items, num_items + i);
379 1.39 dsl Buf_AddBytes(cmds, strlen(item), item);
380 1.39 dsl Buf_AddBytes(cmds, 1, "}");
381 1.39 dsl break;
382 1.39 dsl }
383 1.39 dsl }
384 1.39 dsl Buf_AddBytes(cmds, body_end - cmd_cp, cmd_cp);
385 1.39 dsl
386 1.39 dsl cp = Buf_GetAll(cmds, NULL);
387 1.39 dsl if (DEBUG(FOR))
388 1.39 dsl (void)fprintf(debug_file, "For: loop body:\n%s", cp);
389 1.39 dsl Parse_SetInput(NULL, lineno, -1, cp);
390 1.7 christos Buf_Destroy(cmds, FALSE);
391 1.38 dsl }
392 1.38 dsl
393 1.38 dsl out:
394 1.1 cgd strlist_clean(&arg.vars);
395 1.1 cgd strlist_clean(&arg.items);
396 1.1 cgd
397 Buf_Destroy(arg.buf, TRUE);
398 }
399