parse.c revision 1.383 1 1.383 rillig /* $NetBSD: parse.c,v 1.383 2020/10/17 21:32:30 rillig Exp $ */
2 1.15 christos
3 1.1 cgd /*
4 1.27 christos * Copyright (c) 1988, 1989, 1990, 1993
5 1.27 christos * The Regents of the University of California. All rights reserved.
6 1.94 agc *
7 1.94 agc * This code is derived from software contributed to Berkeley by
8 1.94 agc * Adam de Boor.
9 1.94 agc *
10 1.94 agc * Redistribution and use in source and binary forms, with or without
11 1.94 agc * modification, are permitted provided that the following conditions
12 1.94 agc * are met:
13 1.94 agc * 1. Redistributions of source code must retain the above copyright
14 1.94 agc * notice, this list of conditions and the following disclaimer.
15 1.94 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.94 agc * notice, this list of conditions and the following disclaimer in the
17 1.94 agc * documentation and/or other materials provided with the distribution.
18 1.94 agc * 3. Neither the name of the University nor the names of its contributors
19 1.94 agc * may be used to endorse or promote products derived from this software
20 1.94 agc * without specific prior written permission.
21 1.94 agc *
22 1.94 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.94 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.94 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.94 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.94 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.94 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.94 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.94 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.94 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.94 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.94 agc * SUCH DAMAGE.
33 1.94 agc */
34 1.94 agc
35 1.94 agc /*
36 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
37 1.1 cgd * All rights reserved.
38 1.1 cgd *
39 1.1 cgd * This code is derived from software contributed to Berkeley by
40 1.1 cgd * Adam de Boor.
41 1.1 cgd *
42 1.1 cgd * Redistribution and use in source and binary forms, with or without
43 1.1 cgd * modification, are permitted provided that the following conditions
44 1.1 cgd * are met:
45 1.1 cgd * 1. Redistributions of source code must retain the above copyright
46 1.1 cgd * notice, this list of conditions and the following disclaimer.
47 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
48 1.1 cgd * notice, this list of conditions and the following disclaimer in the
49 1.1 cgd * documentation and/or other materials provided with the distribution.
50 1.1 cgd * 3. All advertising materials mentioning features or use of this software
51 1.1 cgd * must display the following acknowledgement:
52 1.1 cgd * This product includes software developed by the University of
53 1.1 cgd * California, Berkeley and its contributors.
54 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
55 1.1 cgd * may be used to endorse or promote products derived from this software
56 1.1 cgd * without specific prior written permission.
57 1.1 cgd *
58 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
59 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
61 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
62 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
63 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
64 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
65 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
66 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
67 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
68 1.1 cgd * SUCH DAMAGE.
69 1.1 cgd */
70 1.1 cgd
71 1.1 cgd /*-
72 1.1 cgd * parse.c --
73 1.1 cgd * Functions to parse a makefile.
74 1.1 cgd *
75 1.1 cgd * One function, Parse_Init, must be called before any functions
76 1.1 cgd * in this module are used. After that, the function Parse_File is the
77 1.1 cgd * main entry point and controls most of the other functions in this
78 1.1 cgd * module.
79 1.1 cgd *
80 1.1 cgd * Most important structures are kept in Lsts. Directories for
81 1.123 dsl * the .include "..." function are kept in the 'parseIncPath' Lst, while
82 1.123 dsl * those for the .include <...> are kept in the 'sysIncPath' Lst. The
83 1.1 cgd * targets currently being defined are kept in the 'targets' Lst.
84 1.1 cgd *
85 1.1 cgd * The variables 'fname' and 'lineno' are used to track the name
86 1.1 cgd * of the current file and the line number in that file so that error
87 1.1 cgd * messages can be more meaningful.
88 1.1 cgd *
89 1.1 cgd * Interface:
90 1.338 rillig * Parse_Init Initialization function which must be
91 1.338 rillig * called before anything else in this module
92 1.338 rillig * is used.
93 1.338 rillig *
94 1.383 rillig * Parse_End Clean up the module
95 1.338 rillig *
96 1.338 rillig * Parse_File Function used to parse a makefile. It must
97 1.338 rillig * be given the name of the file, which should
98 1.338 rillig * already have been opened, and a function
99 1.338 rillig * to call to read a character from the file.
100 1.338 rillig *
101 1.338 rillig * Parse_IsVar Returns TRUE if the given line is a
102 1.338 rillig * variable assignment. Used by MainParseArgs
103 1.338 rillig * to determine if an argument is a target
104 1.338 rillig * or a variable assignment. Used internally
105 1.338 rillig * for pretty much the same thing...
106 1.338 rillig *
107 1.338 rillig * Parse_Error Function called when an error occurs in
108 1.338 rillig * parsing. Used by the variable and
109 1.338 rillig * conditional modules.
110 1.338 rillig *
111 1.338 rillig * Parse_MainName Returns a Lst of the main target to create.
112 1.1 cgd */
113 1.1 cgd
114 1.170 dholland #include <sys/types.h>
115 1.170 dholland #include <sys/mman.h>
116 1.171 dholland #include <sys/stat.h>
117 1.84 wiz #include <errno.h>
118 1.5 cgd #include <stdarg.h>
119 1.225 maya #include <stdint.h>
120 1.84 wiz
121 1.177 nakayama #ifndef MAP_FILE
122 1.177 nakayama #define MAP_FILE 0
123 1.177 nakayama #endif
124 1.170 dholland #ifndef MAP_COPY
125 1.170 dholland #define MAP_COPY MAP_PRIVATE
126 1.170 dholland #endif
127 1.170 dholland
128 1.1 cgd #include "make.h"
129 1.5 cgd #include "dir.h"
130 1.5 cgd #include "job.h"
131 1.1 cgd #include "pathnames.h"
132 1.1 cgd
133 1.303 rillig /* "@(#)parse.c 8.3 (Berkeley) 3/19/94" */
134 1.383 rillig MAKE_RCSID("$NetBSD: parse.c,v 1.383 2020/10/17 21:32:30 rillig Exp $");
135 1.303 rillig
136 1.248 rillig /* types and constants */
137 1.166 dholland
138 1.1 cgd /*
139 1.166 dholland * Structure for a file being read ("included file")
140 1.1 cgd */
141 1.1 cgd typedef struct IFile {
142 1.338 rillig char *fname; /* name of file */
143 1.338 rillig Boolean fromForLoop; /* simulated .include by the .for loop */
144 1.338 rillig int lineno; /* current line number in file */
145 1.338 rillig int first_lineno; /* line number of start of text */
146 1.369 rillig unsigned int cond_depth; /* 'if' nesting when file opened */
147 1.338 rillig Boolean depending; /* state of doing_depend on EOF */
148 1.338 rillig char *P_str; /* point to base of string buffer */
149 1.338 rillig char *P_ptr; /* point to next char of string buffer */
150 1.338 rillig char *P_end; /* point to the end of string buffer */
151 1.338 rillig char *(*nextbuf)(void *, size_t *); /* Function to get more data */
152 1.338 rillig void *nextbuf_arg; /* Opaque arg for nextbuf() */
153 1.338 rillig struct loadedfile *lf; /* loadedfile object, if any */
154 1.5 cgd } IFile;
155 1.1 cgd
156 1.166 dholland /*
157 1.166 dholland * Tokens for target attributes
158 1.1 cgd */
159 1.1 cgd typedef enum {
160 1.338 rillig Begin, /* .BEGIN */
161 1.338 rillig Default, /* .DEFAULT */
162 1.338 rillig DeleteOnError, /* .DELETE_ON_ERROR */
163 1.338 rillig End, /* .END */
164 1.338 rillig dotError, /* .ERROR */
165 1.338 rillig Ignore, /* .IGNORE */
166 1.338 rillig Includes, /* .INCLUDES */
167 1.338 rillig Interrupt, /* .INTERRUPT */
168 1.338 rillig Libs, /* .LIBS */
169 1.338 rillig Meta, /* .META */
170 1.338 rillig MFlags, /* .MFLAGS or .MAKEFLAGS */
171 1.338 rillig Main, /* .MAIN and we don't have anything user-specified to
172 1.338 rillig * make */
173 1.338 rillig NoExport, /* .NOEXPORT */
174 1.338 rillig NoMeta, /* .NOMETA */
175 1.338 rillig NoMetaCmp, /* .NOMETA_CMP */
176 1.338 rillig NoPath, /* .NOPATH */
177 1.338 rillig Not, /* Not special */
178 1.338 rillig NotParallel, /* .NOTPARALLEL */
179 1.338 rillig Null, /* .NULL */
180 1.338 rillig ExObjdir, /* .OBJDIR */
181 1.338 rillig Order, /* .ORDER */
182 1.338 rillig Parallel, /* .PARALLEL */
183 1.338 rillig ExPath, /* .PATH */
184 1.338 rillig Phony, /* .PHONY */
185 1.48 sjg #ifdef POSIX
186 1.338 rillig Posix, /* .POSIX */
187 1.48 sjg #endif
188 1.338 rillig Precious, /* .PRECIOUS */
189 1.338 rillig ExShell, /* .SHELL */
190 1.338 rillig Silent, /* .SILENT */
191 1.338 rillig SingleShell, /* .SINGLESHELL */
192 1.338 rillig Stale, /* .STALE */
193 1.338 rillig Suffixes, /* .SUFFIXES */
194 1.338 rillig Wait, /* .WAIT */
195 1.338 rillig Attribute /* Generic attribute */
196 1.1 cgd } ParseSpecial;
197 1.1 cgd
198 1.368 rillig typedef List SearchPathList;
199 1.368 rillig
200 1.248 rillig /* result data */
201 1.166 dholland
202 1.166 dholland /*
203 1.166 dholland * The main target to create. This is the first target on the first
204 1.166 dholland * dependency line in the first makefile.
205 1.166 dholland */
206 1.166 dholland static GNode *mainNode;
207 1.166 dholland
208 1.248 rillig /* eval state */
209 1.166 dholland
210 1.336 rillig /* During parsing, the targets from the currently active dependency line,
211 1.336 rillig * or NULL if the current line does not belong to a dependency line, for
212 1.336 rillig * example because it is a variable assignment.
213 1.318 rillig *
214 1.318 rillig * See unit-tests/deptgt.mk, keyword "parse.c:targets". */
215 1.322 rillig static GNodeList *targets;
216 1.166 dholland
217 1.166 dholland #ifdef CLEANUP
218 1.372 rillig /* All shell commands for all targets, in no particular order and possibly
219 1.372 rillig * with duplicates. Kept in a separate list since the commands from .USE or
220 1.372 rillig * .USEBEFORE nodes are shared with other GNodes, thereby giving up the
221 1.372 rillig * easily understandable ownership over the allocated strings. */
222 1.322 rillig static StringList *targCmds;
223 1.166 dholland #endif
224 1.166 dholland
225 1.166 dholland /*
226 1.152 dsl * Predecessor node for handling .ORDER. Initialized to NULL when .ORDER
227 1.1 cgd * seen, then set to each successive source on the line.
228 1.1 cgd */
229 1.374 rillig static GNode *predecessor;
230 1.1 cgd
231 1.248 rillig /* parser state */
232 1.166 dholland
233 1.166 dholland /* number of fatal errors */
234 1.166 dholland static int fatals = 0;
235 1.166 dholland
236 1.166 dholland /*
237 1.166 dholland * Variables for doing includes
238 1.166 dholland */
239 1.166 dholland
240 1.166 dholland /* current file being read */
241 1.166 dholland static IFile *curFile;
242 1.166 dholland
243 1.319 rillig /* The include chain of makefiles that leads to curFile. At the bottom of
244 1.319 rillig * the stack is the top-level makefile from the command line, and on top of
245 1.319 rillig * this file, there are the included files or .for loops, up to but excluding
246 1.319 rillig * curFile.
247 1.319 rillig *
248 1.319 rillig * This data could be used to print stack traces on parse errors. As of
249 1.319 rillig * 2020-09-14, this is not done though. It seems quite simple to print the
250 1.319 rillig * tuples (fname:lineno:fromForLoop), from top to bottom. This simple idea is
251 1.319 rillig * made complicated by the fact that the .for loops also use this stack for
252 1.319 rillig * storing information.
253 1.319 rillig *
254 1.319 rillig * The lineno fields of the IFiles with fromForLoop == TRUE look confusing,
255 1.319 rillig * which is demonstrated by the test 'include-main.mk'. They seem sorted
256 1.319 rillig * backwards since they tell the number of completely parsed lines, which for
257 1.319 rillig * a .for loop is right after the terminating .endfor. To compensate for this
258 1.319 rillig * confusion, there is another field first_lineno pointing at the start of the
259 1.319 rillig * .for loop, 1-based for human consumption.
260 1.319 rillig *
261 1.319 rillig * To make the stack trace intuitive, the entry below the first .for loop must
262 1.319 rillig * be ignored completely since neither its lineno nor its first_lineno is
263 1.319 rillig * useful. Instead, the topmost .for loop needs to be printed twice, once
264 1.319 rillig * with its first_lineno and once with its lineno.
265 1.319 rillig *
266 1.319 rillig * As of 2020-09-15, using the above rules, the stack trace for the .info line
267 1.319 rillig * in include-subsub.mk would be:
268 1.319 rillig *
269 1.319 rillig * curFile: include-subsub.mk:4
270 1.319 rillig * (lineno, from an .include)
271 1.319 rillig * includes[4]: include-sub.mk:32
272 1.319 rillig * (lineno, from a .for loop below an .include)
273 1.319 rillig * includes[4]: include-sub.mk:31
274 1.319 rillig * (first_lineno, from a .for loop, lineno == 32)
275 1.319 rillig * includes[3]: include-sub.mk:30
276 1.319 rillig * (first_lineno, from a .for loop, lineno == 33)
277 1.319 rillig * includes[2]: include-sub.mk:29
278 1.319 rillig * (first_lineno, from a .for loop, lineno == 34)
279 1.319 rillig * includes[1]: include-sub.mk:35
280 1.319 rillig * (not printed since it is below a .for loop)
281 1.319 rillig * includes[0]: include-main.mk:27
282 1.319 rillig */
283 1.276 rillig static Stack /* of *IFile */ includes;
284 1.166 dholland
285 1.166 dholland /* include paths (lists of directories) */
286 1.322 rillig SearchPath *parseIncPath; /* dirs for "..." includes */
287 1.322 rillig SearchPath *sysIncPath; /* dirs for <...> includes */
288 1.322 rillig SearchPath *defIncPath; /* default for sysIncPath */
289 1.166 dholland
290 1.248 rillig /* parser tables */
291 1.166 dholland
292 1.1 cgd /*
293 1.1 cgd * The parseKeywords table is searched using binary search when deciding
294 1.1 cgd * if a target or source is special. The 'spec' field is the ParseSpecial
295 1.1 cgd * type of the keyword ("Not" if the keyword isn't special as a target) while
296 1.1 cgd * the 'op' field is the operator to apply to the list of targets if the
297 1.1 cgd * keyword is used as a source ("0" if the keyword isn't special as a source)
298 1.1 cgd */
299 1.168 dholland static const struct {
300 1.338 rillig const char *name; /* Name of keyword */
301 1.338 rillig ParseSpecial spec; /* Type when used as a target */
302 1.338 rillig GNodeType op; /* Operator when used as a source */
303 1.1 cgd } parseKeywords[] = {
304 1.338 rillig { ".BEGIN", Begin, 0 },
305 1.338 rillig { ".DEFAULT", Default, 0 },
306 1.338 rillig { ".DELETE_ON_ERROR", DeleteOnError, 0 },
307 1.338 rillig { ".END", End, 0 },
308 1.338 rillig { ".ERROR", dotError, 0 },
309 1.338 rillig { ".EXEC", Attribute, OP_EXEC },
310 1.338 rillig { ".IGNORE", Ignore, OP_IGNORE },
311 1.338 rillig { ".INCLUDES", Includes, 0 },
312 1.338 rillig { ".INTERRUPT", Interrupt, 0 },
313 1.338 rillig { ".INVISIBLE", Attribute, OP_INVISIBLE },
314 1.338 rillig { ".JOIN", Attribute, OP_JOIN },
315 1.338 rillig { ".LIBS", Libs, 0 },
316 1.338 rillig { ".MADE", Attribute, OP_MADE },
317 1.338 rillig { ".MAIN", Main, 0 },
318 1.338 rillig { ".MAKE", Attribute, OP_MAKE },
319 1.338 rillig { ".MAKEFLAGS", MFlags, 0 },
320 1.338 rillig { ".META", Meta, OP_META },
321 1.338 rillig { ".MFLAGS", MFlags, 0 },
322 1.338 rillig { ".NOMETA", NoMeta, OP_NOMETA },
323 1.338 rillig { ".NOMETA_CMP", NoMetaCmp, OP_NOMETA_CMP },
324 1.338 rillig { ".NOPATH", NoPath, OP_NOPATH },
325 1.338 rillig { ".NOTMAIN", Attribute, OP_NOTMAIN },
326 1.338 rillig { ".NOTPARALLEL", NotParallel, 0 },
327 1.338 rillig { ".NO_PARALLEL", NotParallel, 0 },
328 1.338 rillig { ".NULL", Null, 0 },
329 1.338 rillig { ".OBJDIR", ExObjdir, 0 },
330 1.338 rillig { ".OPTIONAL", Attribute, OP_OPTIONAL },
331 1.338 rillig { ".ORDER", Order, 0 },
332 1.338 rillig { ".PARALLEL", Parallel, 0 },
333 1.338 rillig { ".PATH", ExPath, 0 },
334 1.338 rillig { ".PHONY", Phony, OP_PHONY },
335 1.48 sjg #ifdef POSIX
336 1.338 rillig { ".POSIX", Posix, 0 },
337 1.48 sjg #endif
338 1.338 rillig { ".PRECIOUS", Precious, OP_PRECIOUS },
339 1.338 rillig { ".RECURSIVE", Attribute, OP_MAKE },
340 1.338 rillig { ".SHELL", ExShell, 0 },
341 1.338 rillig { ".SILENT", Silent, OP_SILENT },
342 1.338 rillig { ".SINGLESHELL", SingleShell, 0 },
343 1.338 rillig { ".STALE", Stale, 0 },
344 1.338 rillig { ".SUFFIXES", Suffixes, 0 },
345 1.338 rillig { ".USE", Attribute, OP_USE },
346 1.338 rillig { ".USEBEFORE", Attribute, OP_USEBEFORE },
347 1.338 rillig { ".WAIT", Wait, 0 },
348 1.1 cgd };
349 1.1 cgd
350 1.248 rillig /* file loader */
351 1.170 dholland
352 1.170 dholland struct loadedfile {
353 1.170 dholland const char *path; /* name, for error reports */
354 1.170 dholland char *buf; /* contents buffer */
355 1.170 dholland size_t len; /* length of contents */
356 1.170 dholland size_t maplen; /* length of mmap area, or 0 */
357 1.170 dholland Boolean used; /* XXX: have we used the data yet */
358 1.170 dholland };
359 1.170 dholland
360 1.170 dholland static struct loadedfile *
361 1.170 dholland loadedfile_create(const char *path)
362 1.170 dholland {
363 1.170 dholland struct loadedfile *lf;
364 1.170 dholland
365 1.170 dholland lf = bmake_malloc(sizeof(*lf));
366 1.242 rillig lf->path = path == NULL ? "(stdin)" : path;
367 1.170 dholland lf->buf = NULL;
368 1.170 dholland lf->len = 0;
369 1.170 dholland lf->maplen = 0;
370 1.170 dholland lf->used = FALSE;
371 1.170 dholland return lf;
372 1.170 dholland }
373 1.170 dholland
374 1.170 dholland static void
375 1.170 dholland loadedfile_destroy(struct loadedfile *lf)
376 1.170 dholland {
377 1.170 dholland if (lf->buf != NULL) {
378 1.170 dholland if (lf->maplen > 0) {
379 1.170 dholland munmap(lf->buf, lf->maplen);
380 1.170 dholland } else {
381 1.170 dholland free(lf->buf);
382 1.170 dholland }
383 1.170 dholland }
384 1.170 dholland free(lf);
385 1.170 dholland }
386 1.170 dholland
387 1.170 dholland /*
388 1.170 dholland * nextbuf() operation for loadedfile, as needed by the weird and twisted
389 1.170 dholland * logic below. Once that's cleaned up, we can get rid of lf->used...
390 1.170 dholland */
391 1.170 dholland static char *
392 1.170 dholland loadedfile_nextbuf(void *x, size_t *len)
393 1.170 dholland {
394 1.170 dholland struct loadedfile *lf = x;
395 1.170 dholland
396 1.170 dholland if (lf->used) {
397 1.170 dholland return NULL;
398 1.170 dholland }
399 1.170 dholland lf->used = TRUE;
400 1.170 dholland *len = lf->len;
401 1.170 dholland return lf->buf;
402 1.170 dholland }
403 1.170 dholland
404 1.170 dholland /*
405 1.170 dholland * Try to get the size of a file.
406 1.170 dholland */
407 1.272 rillig static Boolean
408 1.170 dholland load_getsize(int fd, size_t *ret)
409 1.170 dholland {
410 1.170 dholland struct stat st;
411 1.170 dholland
412 1.170 dholland if (fstat(fd, &st) < 0) {
413 1.272 rillig return FALSE;
414 1.170 dholland }
415 1.170 dholland
416 1.170 dholland if (!S_ISREG(st.st_mode)) {
417 1.272 rillig return FALSE;
418 1.170 dholland }
419 1.170 dholland
420 1.170 dholland /*
421 1.170 dholland * st_size is an off_t, which is 64 bits signed; *ret is
422 1.170 dholland * size_t, which might be 32 bits unsigned or 64 bits
423 1.170 dholland * unsigned. Rather than being elaborate, just punt on
424 1.170 dholland * files that are more than 2^31 bytes. We should never
425 1.170 dholland * see a makefile that size in practice...
426 1.170 dholland *
427 1.170 dholland * While we're at it reject negative sizes too, just in case.
428 1.170 dholland */
429 1.170 dholland if (st.st_size < 0 || st.st_size > 0x7fffffff) {
430 1.272 rillig return FALSE;
431 1.170 dholland }
432 1.170 dholland
433 1.170 dholland *ret = (size_t) st.st_size;
434 1.272 rillig return TRUE;
435 1.170 dholland }
436 1.170 dholland
437 1.170 dholland /*
438 1.170 dholland * Read in a file.
439 1.170 dholland *
440 1.170 dholland * Until the path search logic can be moved under here instead of
441 1.170 dholland * being in the caller in another source file, we need to have the fd
442 1.170 dholland * passed in already open. Bleh.
443 1.170 dholland *
444 1.170 dholland * If the path is NULL use stdin and (to insure against fd leaks)
445 1.170 dholland * assert that the caller passed in -1.
446 1.170 dholland */
447 1.170 dholland static struct loadedfile *
448 1.170 dholland loadfile(const char *path, int fd)
449 1.170 dholland {
450 1.170 dholland struct loadedfile *lf;
451 1.369 rillig static unsigned long pagesize = 0;
452 1.170 dholland ssize_t result;
453 1.170 dholland size_t bufpos;
454 1.170 dholland
455 1.170 dholland lf = loadedfile_create(path);
456 1.170 dholland
457 1.170 dholland if (path == NULL) {
458 1.170 dholland assert(fd == -1);
459 1.170 dholland fd = STDIN_FILENO;
460 1.170 dholland } else {
461 1.170 dholland #if 0 /* notyet */
462 1.170 dholland fd = open(path, O_RDONLY);
463 1.170 dholland if (fd < 0) {
464 1.170 dholland ...
465 1.170 dholland Error("%s: %s", path, strerror(errno));
466 1.170 dholland exit(1);
467 1.170 dholland }
468 1.170 dholland #endif
469 1.170 dholland }
470 1.170 dholland
471 1.272 rillig if (load_getsize(fd, &lf->len)) {
472 1.170 dholland /* found a size, try mmap */
473 1.227 sjg if (pagesize == 0)
474 1.369 rillig pagesize = (unsigned long)sysconf(_SC_PAGESIZE);
475 1.369 rillig if (pagesize == 0 || pagesize == (unsigned long)-1) {
476 1.170 dholland pagesize = 0x1000;
477 1.170 dholland }
478 1.170 dholland /* round size up to a page */
479 1.170 dholland lf->maplen = pagesize * ((lf->len + pagesize - 1)/pagesize);
480 1.170 dholland
481 1.170 dholland /*
482 1.170 dholland * XXX hack for dealing with empty files; remove when
483 1.170 dholland * we're no longer limited by interfacing to the old
484 1.170 dholland * logic elsewhere in this file.
485 1.170 dholland */
486 1.170 dholland if (lf->maplen == 0) {
487 1.170 dholland lf->maplen = pagesize;
488 1.170 dholland }
489 1.170 dholland
490 1.170 dholland /*
491 1.170 dholland * FUTURE: remove PROT_WRITE when the parser no longer
492 1.170 dholland * needs to scribble on the input.
493 1.170 dholland */
494 1.170 dholland lf->buf = mmap(NULL, lf->maplen, PROT_READ|PROT_WRITE,
495 1.170 dholland MAP_FILE|MAP_COPY, fd, 0);
496 1.170 dholland if (lf->buf != MAP_FAILED) {
497 1.170 dholland /* succeeded */
498 1.178 dsl if (lf->len == lf->maplen && lf->buf[lf->len - 1] != '\n') {
499 1.220 maya char *b = bmake_malloc(lf->len + 1);
500 1.178 dsl b[lf->len] = '\n';
501 1.178 dsl memcpy(b, lf->buf, lf->len++);
502 1.178 dsl munmap(lf->buf, lf->maplen);
503 1.178 dsl lf->maplen = 0;
504 1.178 dsl lf->buf = b;
505 1.178 dsl }
506 1.170 dholland goto done;
507 1.170 dholland }
508 1.170 dholland }
509 1.170 dholland
510 1.170 dholland /* cannot mmap; load the traditional way */
511 1.170 dholland
512 1.170 dholland lf->maplen = 0;
513 1.170 dholland lf->len = 1024;
514 1.170 dholland lf->buf = bmake_malloc(lf->len);
515 1.170 dholland
516 1.170 dholland bufpos = 0;
517 1.170 dholland while (1) {
518 1.170 dholland assert(bufpos <= lf->len);
519 1.170 dholland if (bufpos == lf->len) {
520 1.221 riastrad if (lf->len > SIZE_MAX/2) {
521 1.221 riastrad errno = EFBIG;
522 1.221 riastrad Error("%s: file too large", path);
523 1.221 riastrad exit(1);
524 1.221 riastrad }
525 1.170 dholland lf->len *= 2;
526 1.170 dholland lf->buf = bmake_realloc(lf->buf, lf->len);
527 1.170 dholland }
528 1.221 riastrad assert(bufpos < lf->len);
529 1.170 dholland result = read(fd, lf->buf + bufpos, lf->len - bufpos);
530 1.170 dholland if (result < 0) {
531 1.170 dholland Error("%s: read error: %s", path, strerror(errno));
532 1.170 dholland exit(1);
533 1.170 dholland }
534 1.170 dholland if (result == 0) {
535 1.170 dholland break;
536 1.170 dholland }
537 1.369 rillig bufpos += (size_t)result;
538 1.170 dholland }
539 1.170 dholland assert(bufpos <= lf->len);
540 1.173 dholland lf->len = bufpos;
541 1.170 dholland
542 1.170 dholland /* truncate malloc region to actual length (maybe not useful) */
543 1.172 dholland if (lf->len > 0) {
544 1.218 sjg /* as for mmap case, ensure trailing \n */
545 1.218 sjg if (lf->buf[lf->len - 1] != '\n')
546 1.218 sjg lf->len++;
547 1.172 dholland lf->buf = bmake_realloc(lf->buf, lf->len);
548 1.218 sjg lf->buf[lf->len - 1] = '\n';
549 1.172 dholland }
550 1.170 dholland
551 1.170 dholland done:
552 1.170 dholland if (path != NULL) {
553 1.170 dholland close(fd);
554 1.170 dholland }
555 1.170 dholland return lf;
556 1.170 dholland }
557 1.170 dholland
558 1.248 rillig /* old code */
559 1.77 christos
560 1.279 rillig /* Check if the current character is escaped on the current line. */
561 1.279 rillig static Boolean
562 1.84 wiz ParseIsEscaped(const char *line, const char *c)
563 1.77 christos {
564 1.280 rillig Boolean active = FALSE;
565 1.77 christos for (;;) {
566 1.77 christos if (line == c)
567 1.77 christos return active;
568 1.77 christos if (*--c != '\\')
569 1.77 christos return active;
570 1.77 christos active = !active;
571 1.77 christos }
572 1.77 christos }
573 1.77 christos
574 1.278 rillig /* Add the filename and lineno to the GNode so that we remember where it
575 1.278 rillig * was first defined. */
576 1.278 rillig static void
577 1.278 rillig ParseMark(GNode *gn)
578 1.278 rillig {
579 1.278 rillig gn->fname = curFile->fname;
580 1.278 rillig gn->lineno = curFile->lineno;
581 1.278 rillig }
582 1.278 rillig
583 1.368 rillig /* Look in the table of keywords for one matching the given string.
584 1.368 rillig * Return the index of the keyword, or -1 if it isn't there. */
585 1.1 cgd static int
586 1.120 dsl ParseFindKeyword(const char *str)
587 1.1 cgd {
588 1.374 rillig int start, end, cur;
589 1.374 rillig int diff;
590 1.27 christos
591 1.1 cgd start = 0;
592 1.375 rillig end = sizeof parseKeywords / sizeof parseKeywords[0] - 1;
593 1.1 cgd
594 1.1 cgd do {
595 1.375 rillig cur = start + (end - start) / 2;
596 1.103 christos diff = strcmp(str, parseKeywords[cur].name);
597 1.1 cgd
598 1.1 cgd if (diff == 0) {
599 1.235 rillig return cur;
600 1.1 cgd } else if (diff < 0) {
601 1.1 cgd end = cur - 1;
602 1.1 cgd } else {
603 1.1 cgd start = cur + 1;
604 1.1 cgd }
605 1.1 cgd } while (start <= end);
606 1.235 rillig return -1;
607 1.1 cgd }
608 1.1 cgd
609 1.291 rillig static void
610 1.305 rillig PrintLocation(FILE *f, const char *filename, size_t lineno)
611 1.291 rillig {
612 1.291 rillig char dirbuf[MAXPATHLEN+1];
613 1.305 rillig const char *dir, *base;
614 1.305 rillig char *dir_freeIt, *base_freeIt;
615 1.291 rillig
616 1.305 rillig if (*filename == '/' || strcmp(filename, "(stdin)") == 0) {
617 1.305 rillig (void)fprintf(f, "\"%s\" line %zu: ", filename, lineno);
618 1.299 rillig return;
619 1.299 rillig }
620 1.291 rillig
621 1.299 rillig /* Find out which makefile is the culprit.
622 1.299 rillig * We try ${.PARSEDIR} and apply realpath(3) if not absolute. */
623 1.291 rillig
624 1.299 rillig dir = Var_Value(".PARSEDIR", VAR_GLOBAL, &dir_freeIt);
625 1.299 rillig if (dir == NULL)
626 1.299 rillig dir = ".";
627 1.299 rillig if (*dir != '/')
628 1.299 rillig dir = realpath(dir, dirbuf);
629 1.299 rillig
630 1.305 rillig base = Var_Value(".PARSEFILE", VAR_GLOBAL, &base_freeIt);
631 1.305 rillig if (base == NULL) {
632 1.305 rillig const char *slash = strrchr(filename, '/');
633 1.305 rillig base = slash != NULL ? slash + 1 : filename;
634 1.299 rillig }
635 1.299 rillig
636 1.305 rillig (void)fprintf(f, "\"%s/%s\" line %zu: ", dir, base, lineno);
637 1.305 rillig bmake_free(base_freeIt);
638 1.299 rillig bmake_free(dir_freeIt);
639 1.291 rillig }
640 1.291 rillig
641 1.300 rillig /* Print a parse error message, including location information.
642 1.1 cgd *
643 1.300 rillig * Increment "fatals" if the level is PARSE_FATAL, and continue parsing
644 1.300 rillig * until the end of the current top-level makefile, then exit (see
645 1.368 rillig * Parse_File). */
646 1.38 christos static void
647 1.127 dsl ParseVErrorInternal(FILE *f, const char *cfname, size_t clineno, int type,
648 1.122 dsl const char *fmt, va_list ap)
649 1.38 christos {
650 1.56 christos static Boolean fatal_warning_error_printed = FALSE;
651 1.56 christos
652 1.148 sjg (void)fprintf(f, "%s: ", progname);
653 1.63 christos
654 1.291 rillig if (cfname != NULL)
655 1.291 rillig PrintLocation(f, cfname, clineno);
656 1.38 christos if (type == PARSE_WARNING)
657 1.127 dsl (void)fprintf(f, "warning: ");
658 1.127 dsl (void)vfprintf(f, fmt, ap);
659 1.127 dsl (void)fprintf(f, "\n");
660 1.127 dsl (void)fflush(f);
661 1.300 rillig
662 1.226 sjg if (type == PARSE_INFO)
663 1.226 sjg return;
664 1.56 christos if (type == PARSE_FATAL || parseWarnFatal)
665 1.300 rillig fatals++;
666 1.56 christos if (parseWarnFatal && !fatal_warning_error_printed) {
667 1.56 christos Error("parsing warnings being treated as errors");
668 1.56 christos fatal_warning_error_printed = TRUE;
669 1.56 christos }
670 1.38 christos }
671 1.38 christos
672 1.203 joerg static void
673 1.203 joerg ParseErrorInternal(const char *cfname, size_t clineno, int type,
674 1.374 rillig const char *fmt, ...)
675 1.203 joerg {
676 1.203 joerg va_list ap;
677 1.203 joerg
678 1.203 joerg va_start(ap, fmt);
679 1.203 joerg (void)fflush(stdout);
680 1.203 joerg ParseVErrorInternal(stderr, cfname, clineno, type, fmt, ap);
681 1.203 joerg va_end(ap);
682 1.203 joerg
683 1.203 joerg if (debug_file != stderr && debug_file != stdout) {
684 1.203 joerg va_start(ap, fmt);
685 1.203 joerg ParseVErrorInternal(debug_file, cfname, clineno, type, fmt, ap);
686 1.203 joerg va_end(ap);
687 1.203 joerg }
688 1.203 joerg }
689 1.203 joerg
690 1.289 rillig /* External interface to ParseErrorInternal; uses the default filename and
691 1.289 rillig * line number.
692 1.38 christos *
693 1.289 rillig * Fmt is given without a trailing newline. */
694 1.1 cgd void
695 1.93 christos Parse_Error(int type, const char *fmt, ...)
696 1.1 cgd {
697 1.1 cgd va_list ap;
698 1.156 dsl const char *fname;
699 1.156 dsl size_t lineno;
700 1.84 wiz
701 1.152 dsl if (curFile == NULL) {
702 1.156 dsl fname = NULL;
703 1.156 dsl lineno = 0;
704 1.156 dsl } else {
705 1.156 dsl fname = curFile->fname;
706 1.369 rillig lineno = (size_t)curFile->lineno;
707 1.148 sjg }
708 1.156 dsl
709 1.156 dsl va_start(ap, fmt);
710 1.163 sjg (void)fflush(stdout);
711 1.156 dsl ParseVErrorInternal(stderr, fname, lineno, type, fmt, ap);
712 1.1 cgd va_end(ap);
713 1.127 dsl
714 1.131 dsl if (debug_file != stderr && debug_file != stdout) {
715 1.127 dsl va_start(ap, fmt);
716 1.156 dsl ParseVErrorInternal(debug_file, fname, lineno, type, fmt, ap);
717 1.127 dsl va_end(ap);
718 1.127 dsl }
719 1.1 cgd }
720 1.1 cgd
721 1.161 sjg
722 1.301 rillig /* Parse a .info .warning or .error directive.
723 1.161 sjg *
724 1.301 rillig * The input is the line minus the ".". We substitute variables, print the
725 1.301 rillig * message and exit(1) (for .error) or just print a warning if the directive
726 1.301 rillig * is malformed.
727 1.161 sjg */
728 1.164 sjg static Boolean
729 1.377 rillig ParseMessage(const char *directive)
730 1.161 sjg {
731 1.377 rillig const char *p = directive;
732 1.377 rillig int mtype = *p == 'i' ? PARSE_INFO :
733 1.377 rillig *p == 'w' ? PARSE_WARNING : PARSE_FATAL;
734 1.377 rillig char *arg;
735 1.164 sjg
736 1.377 rillig while (ch_isalpha(*p))
737 1.377 rillig p++;
738 1.377 rillig if (!ch_isspace(*p))
739 1.377 rillig return FALSE; /* missing argument */
740 1.161 sjg
741 1.377 rillig cpp_skip_whitespace(&p);
742 1.377 rillig (void)Var_Subst(p, VAR_CMD, VARE_WANTRES, &arg);
743 1.377 rillig /* TODO: handle errors */
744 1.161 sjg
745 1.377 rillig Parse_Error(mtype, "%s", arg);
746 1.377 rillig free(arg);
747 1.161 sjg
748 1.161 sjg if (mtype == PARSE_FATAL) {
749 1.339 sjg PrintOnError(NULL, NULL);
750 1.161 sjg exit(1);
751 1.161 sjg }
752 1.164 sjg return TRUE;
753 1.161 sjg }
754 1.161 sjg
755 1.316 rillig /* Add the child to the parent's children.
756 1.1 cgd *
757 1.382 rillig * Additionally, add the parent to the child's parents, but only if the
758 1.382 rillig * target is not special. An example for such a special target is .END,
759 1.382 rillig * which does not need to be informed once the child target has been made. */
760 1.382 rillig static void
761 1.382 rillig LinkSource(GNode *pgn, GNode *cgn, Boolean isSpecial)
762 1.382 rillig {
763 1.268 rillig if ((pgn->type & OP_DOUBLEDEP) && !Lst_IsEmpty(pgn->cohorts))
764 1.274 rillig pgn = LstNode_Datum(Lst_Last(pgn->cohorts));
765 1.316 rillig
766 1.268 rillig Lst_Append(pgn->children, cgn);
767 1.343 rillig pgn->unmade++;
768 1.316 rillig
769 1.382 rillig /* Special targets like .END don't need any children. */
770 1.382 rillig if (!isSpecial)
771 1.268 rillig Lst_Append(cgn->parents, pgn);
772 1.316 rillig
773 1.109 dsl if (DEBUG(PARSE)) {
774 1.342 rillig debug_printf("# %s: added child %s - %s\n",
775 1.342 rillig __func__, pgn->name, cgn->name);
776 1.109 dsl Targ_PrintNode(pgn, 0);
777 1.109 dsl Targ_PrintNode(cgn, 0);
778 1.109 dsl }
779 1.1 cgd }
780 1.1 cgd
781 1.382 rillig /* Add the node to each target from the current dependency group. */
782 1.382 rillig static void
783 1.382 rillig LinkToTargets(GNode *gn, Boolean isSpecial)
784 1.382 rillig {
785 1.382 rillig GNodeListNode *ln;
786 1.382 rillig for (ln = targets->first; ln != NULL; ln = ln->next)
787 1.382 rillig LinkSource(ln->datum, gn, isSpecial);
788 1.382 rillig }
789 1.382 rillig
790 1.337 rillig static Boolean
791 1.337 rillig TryApplyDependencyOperator(GNode *gn, GNodeType op)
792 1.1 cgd {
793 1.1 cgd /*
794 1.1 cgd * If the dependency mask of the operator and the node don't match and
795 1.1 cgd * the node has actually had an operator applied to it before, and
796 1.27 christos * the operator actually has some dependency information in it, complain.
797 1.1 cgd */
798 1.1 cgd if (((op & OP_OPMASK) != (gn->type & OP_OPMASK)) &&
799 1.1 cgd !OP_NOP(gn->type) && !OP_NOP(op))
800 1.1 cgd {
801 1.97 christos Parse_Error(PARSE_FATAL, "Inconsistent operator for %s", gn->name);
802 1.337 rillig return FALSE;
803 1.1 cgd }
804 1.1 cgd
805 1.242 rillig if (op == OP_DOUBLEDEP && (gn->type & OP_OPMASK) == OP_DOUBLEDEP) {
806 1.1 cgd /*
807 1.1 cgd * If the node was the object of a :: operator, we need to create a
808 1.1 cgd * new instance of it for the children and commands on this dependency
809 1.1 cgd * line. The new instance is placed on the 'cohorts' list of the
810 1.1 cgd * initial one (note the initial one is not on its own cohorts list)
811 1.1 cgd * and the new instance is linked to all parents of the initial
812 1.1 cgd * instance.
813 1.1 cgd */
814 1.374 rillig GNode *cohort;
815 1.27 christos
816 1.33 mycroft /*
817 1.46 mycroft * Propagate copied bits to the initial node. They'll be propagated
818 1.46 mycroft * back to the rest of the cohorts later.
819 1.33 mycroft */
820 1.46 mycroft gn->type |= op & ~OP_OPMASK;
821 1.33 mycroft
822 1.332 rillig cohort = Targ_NewInternalNode(gn->name);
823 1.186 christos if (doing_depend)
824 1.186 christos ParseMark(cohort);
825 1.1 cgd /*
826 1.1 cgd * Make the cohort invisible as well to avoid duplicating it into
827 1.1 cgd * other variables. True, parents of this target won't tend to do
828 1.1 cgd * anything with their local variables, but better safe than
829 1.46 mycroft * sorry. (I think this is pointless now, since the relevant list
830 1.46 mycroft * traversals will no longer see this node anyway. -mycroft)
831 1.1 cgd */
832 1.46 mycroft cohort->type = op | OP_INVISIBLE;
833 1.268 rillig Lst_Append(gn->cohorts, cohort);
834 1.83 pk cohort->centurion = gn;
835 1.343 rillig gn->unmade_cohorts++;
836 1.120 dsl snprintf(cohort->cohort_num, sizeof cohort->cohort_num, "#%d",
837 1.374 rillig gn->unmade_cohorts % 1000000);
838 1.46 mycroft } else {
839 1.1 cgd /*
840 1.46 mycroft * We don't want to nuke any previous flags (whatever they were) so we
841 1.46 mycroft * just OR the new operator into the old
842 1.1 cgd */
843 1.46 mycroft gn->type |= op;
844 1.1 cgd }
845 1.33 mycroft
846 1.337 rillig return TRUE;
847 1.337 rillig }
848 1.337 rillig
849 1.337 rillig static void
850 1.337 rillig ApplyDependencyOperator(GNodeType op)
851 1.337 rillig {
852 1.337 rillig GNodeListNode *ln;
853 1.337 rillig for (ln = targets->first; ln != NULL; ln = ln->next)
854 1.373 rillig if (!TryApplyDependencyOperator(ln->datum, op))
855 1.337 rillig break;
856 1.1 cgd }
857 1.1 cgd
858 1.368 rillig static Boolean
859 1.368 rillig ParseDoSrcKeyword(const char *src, ParseSpecial specType)
860 1.1 cgd {
861 1.120 dsl static int wait_number = 0;
862 1.120 dsl char wait_src[16];
863 1.368 rillig GNode *gn;
864 1.1 cgd
865 1.290 rillig if (*src == '.' && ch_isupper(src[1])) {
866 1.1 cgd int keywd = ParseFindKeyword(src);
867 1.1 cgd if (keywd != -1) {
868 1.18 christos int op = parseKeywords[keywd].op;
869 1.18 christos if (op != 0) {
870 1.337 rillig ApplyDependencyOperator(op);
871 1.368 rillig return TRUE;
872 1.18 christos }
873 1.18 christos if (parseKeywords[keywd].spec == Wait) {
874 1.120 dsl /*
875 1.120 dsl * We add a .WAIT node in the dependency list.
876 1.120 dsl * After any dynamic dependencies (and filename globbing)
877 1.120 dsl * have happened, it is given a dependency on the each
878 1.120 dsl * previous child back to and previous .WAIT node.
879 1.120 dsl * The next child won't be scheduled until the .WAIT node
880 1.120 dsl * is built.
881 1.120 dsl * We give each .WAIT node a unique name (mainly for diag).
882 1.120 dsl */
883 1.120 dsl snprintf(wait_src, sizeof wait_src, ".WAIT_%u", ++wait_number);
884 1.332 rillig gn = Targ_NewInternalNode(wait_src);
885 1.186 christos if (doing_depend)
886 1.186 christos ParseMark(gn);
887 1.120 dsl gn->type = OP_WAIT | OP_PHONY | OP_DEPENDS | OP_NOTMAIN;
888 1.382 rillig LinkToTargets(gn, specType != Not);
889 1.368 rillig return TRUE;
890 1.18 christos }
891 1.1 cgd }
892 1.1 cgd }
893 1.368 rillig return FALSE;
894 1.368 rillig }
895 1.18 christos
896 1.368 rillig static void
897 1.368 rillig ParseDoSrcMain(const char *src)
898 1.368 rillig {
899 1.368 rillig /*
900 1.368 rillig * If we have noted the existence of a .MAIN, it means we need
901 1.368 rillig * to add the sources of said target to the list of things
902 1.368 rillig * to create. The string 'src' is likely to be free, so we
903 1.368 rillig * must make a new copy of it. Note that this will only be
904 1.368 rillig * invoked if the user didn't specify a target on the command
905 1.368 rillig * line. This is to allow #ifmake's to succeed, or something...
906 1.368 rillig */
907 1.368 rillig Lst_Append(create, bmake_strdup(src));
908 1.368 rillig /*
909 1.368 rillig * Add the name to the .TARGETS variable as well, so the user can
910 1.368 rillig * employ that, if desired.
911 1.368 rillig */
912 1.368 rillig Var_Append(".TARGETS", src, VAR_GLOBAL);
913 1.368 rillig }
914 1.18 christos
915 1.368 rillig static void
916 1.368 rillig ParseDoSrcOrder(const char *src)
917 1.368 rillig {
918 1.368 rillig GNode *gn;
919 1.368 rillig /*
920 1.368 rillig * Create proper predecessor/successor links between the previous
921 1.368 rillig * source and the current one.
922 1.368 rillig */
923 1.368 rillig gn = Targ_GetNode(src);
924 1.368 rillig if (doing_depend)
925 1.368 rillig ParseMark(gn);
926 1.368 rillig if (predecessor != NULL) {
927 1.368 rillig Lst_Append(predecessor->order_succ, gn);
928 1.368 rillig Lst_Append(gn->order_pred, predecessor);
929 1.368 rillig if (DEBUG(PARSE)) {
930 1.368 rillig debug_printf("# %s: added Order dependency %s - %s\n",
931 1.368 rillig __func__, predecessor->name, gn->name);
932 1.368 rillig Targ_PrintNode(predecessor, 0);
933 1.368 rillig Targ_PrintNode(gn, 0);
934 1.1 cgd }
935 1.368 rillig }
936 1.368 rillig /*
937 1.368 rillig * The current source now becomes the predecessor for the next one.
938 1.368 rillig */
939 1.368 rillig predecessor = gn;
940 1.368 rillig }
941 1.368 rillig
942 1.368 rillig static void
943 1.368 rillig ParseDoSrcOther(const char *src, GNodeType tOp, ParseSpecial specType)
944 1.368 rillig {
945 1.368 rillig GNode *gn;
946 1.363 rillig
947 1.368 rillig /*
948 1.368 rillig * If the source is not an attribute, we need to find/create
949 1.368 rillig * a node for it. After that we can apply any operator to it
950 1.368 rillig * from a special target or link it to its parents, as
951 1.368 rillig * appropriate.
952 1.368 rillig *
953 1.368 rillig * In the case of a source that was the object of a :: operator,
954 1.368 rillig * the attribute is applied to all of its instances (as kept in
955 1.368 rillig * the 'cohorts' list of the node) or all the cohorts are linked
956 1.368 rillig * to all the targets.
957 1.368 rillig */
958 1.18 christos
959 1.368 rillig /* Find/create the 'src' node and attach to all targets */
960 1.368 rillig gn = Targ_GetNode(src);
961 1.368 rillig if (doing_depend)
962 1.368 rillig ParseMark(gn);
963 1.368 rillig if (tOp) {
964 1.368 rillig gn->type |= tOp;
965 1.368 rillig } else {
966 1.382 rillig LinkToTargets(gn, specType != Not);
967 1.18 christos }
968 1.1 cgd }
969 1.1 cgd
970 1.368 rillig /* Given the name of a source in a dependency line, figure out if it is an
971 1.368 rillig * attribute (such as .SILENT) and apply it to the targets if it is. Else
972 1.368 rillig * decide if there is some attribute which should be applied *to* the source
973 1.368 rillig * because of some special target (such as .PHONY) and apply it if so.
974 1.368 rillig * Otherwise, make the source a child of the targets in the list 'targets'.
975 1.368 rillig *
976 1.368 rillig * Input:
977 1.368 rillig * tOp operator (if any) from special targets
978 1.368 rillig * src name of the source to handle
979 1.368 rillig */
980 1.368 rillig static void
981 1.368 rillig ParseDoSrc(GNodeType tOp, const char *src, ParseSpecial specType)
982 1.368 rillig {
983 1.368 rillig if (ParseDoSrcKeyword(src, specType))
984 1.373 rillig return;
985 1.368 rillig
986 1.368 rillig if (specType == Main)
987 1.373 rillig ParseDoSrcMain(src);
988 1.368 rillig else if (specType == Order)
989 1.373 rillig ParseDoSrcOrder(src);
990 1.368 rillig else
991 1.373 rillig ParseDoSrcOther(src, tOp, specType);
992 1.368 rillig }
993 1.368 rillig
994 1.335 rillig /* If we have yet to decide on a main target to make, in the absence of any
995 1.335 rillig * user input, we want the first target on the first dependency line that is
996 1.335 rillig * actually a real target (i.e. isn't a .USE or .EXEC rule) to be made. */
997 1.335 rillig static void
998 1.335 rillig FindMainTarget(void)
999 1.1 cgd {
1000 1.335 rillig GNodeListNode *ln;
1001 1.335 rillig
1002 1.335 rillig if (mainNode != NULL)
1003 1.373 rillig return;
1004 1.335 rillig
1005 1.335 rillig for (ln = targets->first; ln != NULL; ln = ln->next) {
1006 1.335 rillig GNode *gn = ln->datum;
1007 1.335 rillig if (!(gn->type & OP_NOTARGET)) {
1008 1.335 rillig mainNode = gn;
1009 1.335 rillig Targ_SetMain(gn);
1010 1.335 rillig return;
1011 1.335 rillig }
1012 1.1 cgd }
1013 1.1 cgd }
1014 1.1 cgd
1015 1.331 rillig static void
1016 1.157 dsl ParseAddDir(void *path, void *name)
1017 1.1 cgd {
1018 1.322 rillig (void)Dir_AddDir(path, name);
1019 1.1 cgd }
1020 1.1 cgd
1021 1.331 rillig static void
1022 1.331 rillig ParseClearPath(void *path, void *unused MAKE_ATTR_UNUSED)
1023 1.1 cgd {
1024 1.322 rillig Dir_ClearPath(path);
1025 1.1 cgd }
1026 1.1 cgd
1027 1.311 rillig /*
1028 1.311 rillig * We got to the end of the line while we were still looking at targets.
1029 1.311 rillig *
1030 1.311 rillig * Ending a dependency line without an operator is a Bozo no-no. As a
1031 1.311 rillig * heuristic, this is also often triggered by undetected conflicts from
1032 1.311 rillig * cvs/rcs merges.
1033 1.311 rillig */
1034 1.311 rillig static void
1035 1.311 rillig ParseErrorNoDependency(const char *lstart, const char *line)
1036 1.311 rillig {
1037 1.311 rillig if ((strncmp(line, "<<<<<<", 6) == 0) ||
1038 1.311 rillig (strncmp(line, "======", 6) == 0) ||
1039 1.311 rillig (strncmp(line, ">>>>>>", 6) == 0))
1040 1.311 rillig Parse_Error(PARSE_FATAL,
1041 1.311 rillig "Makefile appears to contain unresolved cvs/rcs/??? merge conflicts");
1042 1.311 rillig else if (lstart[0] == '.') {
1043 1.311 rillig const char *dirstart = lstart + 1;
1044 1.311 rillig const char *dirend;
1045 1.368 rillig cpp_skip_whitespace(&dirstart);
1046 1.311 rillig dirend = dirstart;
1047 1.311 rillig while (ch_isalnum(*dirend) || *dirend == '-')
1048 1.311 rillig dirend++;
1049 1.311 rillig Parse_Error(PARSE_FATAL, "Unknown directive \"%.*s\"",
1050 1.311 rillig (int)(dirend - dirstart), dirstart);
1051 1.311 rillig } else
1052 1.311 rillig Parse_Error(PARSE_FATAL, "Need an operator");
1053 1.311 rillig }
1054 1.311 rillig
1055 1.314 rillig static void
1056 1.314 rillig ParseDependencyTargetWord(/*const*/ char **pp, const char *lstart)
1057 1.314 rillig {
1058 1.314 rillig /*const*/ char *cp = *pp;
1059 1.314 rillig
1060 1.314 rillig while (*cp != '\0') {
1061 1.314 rillig if ((ch_isspace(*cp) || *cp == '!' || *cp == ':' || *cp == '(') &&
1062 1.314 rillig !ParseIsEscaped(lstart, cp))
1063 1.314 rillig break;
1064 1.314 rillig
1065 1.314 rillig if (*cp == '$') {
1066 1.314 rillig /*
1067 1.314 rillig * Must be a dynamic source (would have been expanded
1068 1.314 rillig * otherwise), so call the Var module to parse the puppy
1069 1.314 rillig * so we can safely advance beyond it...There should be
1070 1.314 rillig * no errors in this, as they would have been discovered
1071 1.314 rillig * in the initial Var_Subst and we wouldn't be here.
1072 1.314 rillig */
1073 1.314 rillig const char *nested_p = cp;
1074 1.314 rillig const char *nested_val;
1075 1.374 rillig void *freeIt;
1076 1.314 rillig
1077 1.314 rillig (void)Var_Parse(&nested_p, VAR_CMD, VARE_UNDEFERR|VARE_WANTRES,
1078 1.314 rillig &nested_val, &freeIt);
1079 1.314 rillig /* TODO: handle errors */
1080 1.314 rillig free(freeIt);
1081 1.314 rillig cp += nested_p - cp;
1082 1.314 rillig } else
1083 1.314 rillig cp++;
1084 1.314 rillig }
1085 1.314 rillig
1086 1.314 rillig *pp = cp;
1087 1.314 rillig }
1088 1.314 rillig
1089 1.368 rillig /*
1090 1.368 rillig * Certain special targets have special semantics:
1091 1.368 rillig * .PATH Have to set the dirSearchPath
1092 1.368 rillig * variable too
1093 1.368 rillig * .MAIN Its sources are only used if
1094 1.368 rillig * nothing has been specified to
1095 1.368 rillig * create.
1096 1.368 rillig * .DEFAULT Need to create a node to hang
1097 1.368 rillig * commands on, but we don't want
1098 1.368 rillig * it in the graph, nor do we want
1099 1.368 rillig * it to be the Main Target, so we
1100 1.368 rillig * create it, set OP_NOTMAIN and
1101 1.368 rillig * add it to the list, setting
1102 1.368 rillig * DEFAULT to the new node for
1103 1.368 rillig * later use. We claim the node is
1104 1.368 rillig * A transformation rule to make
1105 1.368 rillig * life easier later, when we'll
1106 1.368 rillig * use Make_HandleUse to actually
1107 1.368 rillig * apply the .DEFAULT commands.
1108 1.368 rillig * .PHONY The list of targets
1109 1.368 rillig * .NOPATH Don't search for file in the path
1110 1.368 rillig * .STALE
1111 1.368 rillig * .BEGIN
1112 1.368 rillig * .END
1113 1.368 rillig * .ERROR
1114 1.368 rillig * .DELETE_ON_ERROR
1115 1.368 rillig * .INTERRUPT Are not to be considered the
1116 1.368 rillig * main target.
1117 1.368 rillig * .NOTPARALLEL Make only one target at a time.
1118 1.368 rillig * .SINGLESHELL Create a shell for each command.
1119 1.368 rillig * .ORDER Must set initial predecessor to NULL
1120 1.368 rillig */
1121 1.368 rillig static void
1122 1.368 rillig ParseDoDependencyTargetSpecial(ParseSpecial *const inout_specType,
1123 1.368 rillig const char *const line,
1124 1.368 rillig SearchPathList **const inout_paths)
1125 1.368 rillig {
1126 1.368 rillig switch (*inout_specType) {
1127 1.368 rillig case ExPath:
1128 1.368 rillig if (*inout_paths == NULL) {
1129 1.368 rillig *inout_paths = Lst_Init();
1130 1.368 rillig }
1131 1.368 rillig Lst_Append(*inout_paths, dirSearchPath);
1132 1.368 rillig break;
1133 1.368 rillig case Main:
1134 1.368 rillig if (!Lst_IsEmpty(create)) {
1135 1.368 rillig *inout_specType = Not;
1136 1.368 rillig }
1137 1.368 rillig break;
1138 1.368 rillig case Begin:
1139 1.368 rillig case End:
1140 1.368 rillig case Stale:
1141 1.368 rillig case dotError:
1142 1.368 rillig case Interrupt: {
1143 1.368 rillig GNode *gn = Targ_GetNode(line);
1144 1.368 rillig if (doing_depend)
1145 1.368 rillig ParseMark(gn);
1146 1.368 rillig gn->type |= OP_NOTMAIN|OP_SPECIAL;
1147 1.368 rillig Lst_Append(targets, gn);
1148 1.368 rillig break;
1149 1.368 rillig }
1150 1.368 rillig case Default: {
1151 1.368 rillig GNode *gn = Targ_NewGN(".DEFAULT");
1152 1.368 rillig gn->type |= OP_NOTMAIN|OP_TRANSFORM;
1153 1.368 rillig Lst_Append(targets, gn);
1154 1.368 rillig DEFAULT = gn;
1155 1.368 rillig break;
1156 1.368 rillig }
1157 1.368 rillig case DeleteOnError:
1158 1.368 rillig deleteOnError = TRUE;
1159 1.368 rillig break;
1160 1.368 rillig case NotParallel:
1161 1.368 rillig maxJobs = 1;
1162 1.368 rillig break;
1163 1.368 rillig case SingleShell:
1164 1.368 rillig compatMake = TRUE;
1165 1.368 rillig break;
1166 1.368 rillig case Order:
1167 1.368 rillig predecessor = NULL;
1168 1.368 rillig break;
1169 1.368 rillig default:
1170 1.368 rillig break;
1171 1.368 rillig }
1172 1.368 rillig }
1173 1.368 rillig
1174 1.368 rillig /*
1175 1.368 rillig * .PATH<suffix> has to be handled specially.
1176 1.368 rillig * Call on the suffix module to give us a path to modify.
1177 1.368 rillig */
1178 1.368 rillig static Boolean
1179 1.368 rillig ParseDoDependencyTargetPath(const char *const line,
1180 1.368 rillig SearchPathList **const inout_paths)
1181 1.368 rillig {
1182 1.368 rillig SearchPath *path;
1183 1.368 rillig
1184 1.368 rillig path = Suff_GetPath(&line[5]);
1185 1.368 rillig if (path == NULL) {
1186 1.368 rillig Parse_Error(PARSE_FATAL,
1187 1.368 rillig "Suffix '%s' not defined (yet)",
1188 1.368 rillig &line[5]);
1189 1.368 rillig return FALSE;
1190 1.368 rillig } else {
1191 1.368 rillig if (*inout_paths == NULL) {
1192 1.368 rillig *inout_paths = Lst_Init();
1193 1.368 rillig }
1194 1.368 rillig Lst_Append(*inout_paths, path);
1195 1.368 rillig }
1196 1.368 rillig return TRUE;
1197 1.368 rillig }
1198 1.368 rillig
1199 1.368 rillig /*
1200 1.368 rillig * See if it's a special target and if so set specType to match it.
1201 1.364 rillig */
1202 1.368 rillig static Boolean
1203 1.368 rillig ParseDoDependencyTarget(const char *const line,
1204 1.368 rillig ParseSpecial *const inout_specType,
1205 1.368 rillig GNodeType *out_tOp,
1206 1.368 rillig SearchPathList **inout_paths)
1207 1.364 rillig {
1208 1.368 rillig int keywd;
1209 1.364 rillig
1210 1.368 rillig if (!(*line == '.' && ch_isupper(line[1])))
1211 1.368 rillig return TRUE;
1212 1.364 rillig
1213 1.364 rillig /*
1214 1.368 rillig * See if the target is a special target that must have it
1215 1.368 rillig * or its sources handled specially.
1216 1.364 rillig */
1217 1.368 rillig keywd = ParseFindKeyword(line);
1218 1.368 rillig if (keywd != -1) {
1219 1.368 rillig if (*inout_specType == ExPath && parseKeywords[keywd].spec != ExPath) {
1220 1.368 rillig Parse_Error(PARSE_FATAL, "Mismatched special targets");
1221 1.368 rillig return FALSE;
1222 1.368 rillig }
1223 1.368 rillig
1224 1.368 rillig *inout_specType = parseKeywords[keywd].spec;
1225 1.368 rillig *out_tOp = parseKeywords[keywd].op;
1226 1.368 rillig
1227 1.368 rillig ParseDoDependencyTargetSpecial(inout_specType, line, inout_paths);
1228 1.368 rillig
1229 1.368 rillig } else if (strncmp(line, ".PATH", 5) == 0) {
1230 1.368 rillig *inout_specType = ExPath;
1231 1.368 rillig if (!ParseDoDependencyTargetPath(line, inout_paths))
1232 1.368 rillig return FALSE;
1233 1.368 rillig }
1234 1.368 rillig return TRUE;
1235 1.368 rillig }
1236 1.368 rillig
1237 1.368 rillig static void
1238 1.368 rillig ParseDoDependencyTargetMundane(char *const line,
1239 1.368 rillig StringList *const curTargs)
1240 1.368 rillig {
1241 1.368 rillig if (Dir_HasWildcards(line)) {
1242 1.368 rillig /*
1243 1.368 rillig * Targets are to be sought only in the current directory,
1244 1.368 rillig * so create an empty path for the thing. Note we need to
1245 1.368 rillig * use Dir_Destroy in the destruction of the path as the
1246 1.368 rillig * Dir module could have added a directory to the path...
1247 1.368 rillig */
1248 1.368 rillig SearchPath *emptyPath = Lst_Init();
1249 1.368 rillig
1250 1.368 rillig Dir_Expand(line, emptyPath, curTargs);
1251 1.368 rillig
1252 1.368 rillig Lst_Destroy(emptyPath, Dir_Destroy);
1253 1.368 rillig } else {
1254 1.368 rillig /*
1255 1.368 rillig * No wildcards, but we want to avoid code duplication,
1256 1.368 rillig * so create a list with the word on it.
1257 1.368 rillig */
1258 1.368 rillig Lst_Append(curTargs, line);
1259 1.368 rillig }
1260 1.368 rillig
1261 1.368 rillig /* Apply the targets. */
1262 1.368 rillig
1263 1.374 rillig while (!Lst_IsEmpty(curTargs)) {
1264 1.368 rillig char *targName = Lst_Dequeue(curTargs);
1265 1.368 rillig GNode *gn = Suff_IsTransform(targName)
1266 1.368 rillig ? Suff_AddTransform(targName)
1267 1.368 rillig : Targ_GetNode(targName);
1268 1.368 rillig if (doing_depend)
1269 1.368 rillig ParseMark(gn);
1270 1.368 rillig
1271 1.368 rillig Lst_Append(targets, gn);
1272 1.368 rillig }
1273 1.368 rillig }
1274 1.368 rillig
1275 1.368 rillig static void
1276 1.368 rillig ParseDoDependencyTargetExtraWarn(char **pp, const char *lstart)
1277 1.368 rillig {
1278 1.368 rillig Boolean warning = FALSE;
1279 1.368 rillig char *cp = *pp;
1280 1.368 rillig
1281 1.368 rillig while (*cp && (ParseIsEscaped(lstart, cp) ||
1282 1.368 rillig (*cp != '!' && *cp != ':'))) {
1283 1.368 rillig if (ParseIsEscaped(lstart, cp) ||
1284 1.368 rillig (*cp != ' ' && *cp != '\t')) {
1285 1.368 rillig warning = TRUE;
1286 1.368 rillig }
1287 1.368 rillig cp++;
1288 1.368 rillig }
1289 1.368 rillig if (warning) {
1290 1.368 rillig Parse_Error(PARSE_WARNING, "Extra target ignored");
1291 1.368 rillig }
1292 1.368 rillig *pp = cp;
1293 1.368 rillig }
1294 1.368 rillig
1295 1.368 rillig static void
1296 1.368 rillig ParseDoDependencyCheckSpec(ParseSpecial const specType)
1297 1.368 rillig {
1298 1.374 rillig switch (specType) {
1299 1.368 rillig default:
1300 1.368 rillig Parse_Error(PARSE_WARNING,
1301 1.368 rillig "Special and mundane targets don't mix. Mundane ones ignored");
1302 1.368 rillig break;
1303 1.368 rillig case Default:
1304 1.368 rillig case Stale:
1305 1.368 rillig case Begin:
1306 1.368 rillig case End:
1307 1.368 rillig case dotError:
1308 1.368 rillig case Interrupt:
1309 1.368 rillig /*
1310 1.368 rillig * These four create nodes on which to hang commands, so
1311 1.368 rillig * targets shouldn't be empty...
1312 1.368 rillig */
1313 1.368 rillig case Not:
1314 1.368 rillig /*
1315 1.368 rillig * Nothing special here -- targets can be empty if it wants.
1316 1.368 rillig */
1317 1.368 rillig break;
1318 1.368 rillig }
1319 1.368 rillig }
1320 1.368 rillig
1321 1.368 rillig static Boolean
1322 1.368 rillig ParseDoDependencyParseOp(char **const pp, const char *const lstart,
1323 1.368 rillig GNodeType *const out_op)
1324 1.368 rillig {
1325 1.368 rillig const char *cp = *pp;
1326 1.368 rillig
1327 1.368 rillig if (*cp == '!') {
1328 1.368 rillig *out_op = OP_FORCE;
1329 1.368 rillig (*pp)++;
1330 1.368 rillig return TRUE;
1331 1.368 rillig }
1332 1.368 rillig
1333 1.368 rillig if (*cp == ':') {
1334 1.368 rillig if (cp[1] == ':') {
1335 1.368 rillig *out_op = OP_DOUBLEDEP;
1336 1.368 rillig (*pp) += 2;
1337 1.368 rillig } else {
1338 1.368 rillig *out_op = OP_DEPENDS;
1339 1.368 rillig (*pp)++;
1340 1.368 rillig }
1341 1.368 rillig return TRUE;
1342 1.368 rillig }
1343 1.364 rillig
1344 1.368 rillig {
1345 1.368 rillig const char *msg = lstart[0] == '.' ? "Unknown directive"
1346 1.368 rillig : "Missing dependency operator";
1347 1.368 rillig Parse_Error(PARSE_FATAL, "%s", msg);
1348 1.368 rillig return FALSE;
1349 1.368 rillig }
1350 1.368 rillig }
1351 1.364 rillig
1352 1.368 rillig static void
1353 1.368 rillig ParseDoDependencySourcesEmpty(ParseSpecial const specType,
1354 1.368 rillig SearchPathList *const paths)
1355 1.368 rillig {
1356 1.368 rillig switch (specType) {
1357 1.368 rillig case Suffixes:
1358 1.368 rillig Suff_ClearSuffixes();
1359 1.368 rillig break;
1360 1.368 rillig case Precious:
1361 1.368 rillig allPrecious = TRUE;
1362 1.368 rillig break;
1363 1.368 rillig case Ignore:
1364 1.368 rillig ignoreErrors = TRUE;
1365 1.368 rillig break;
1366 1.368 rillig case Silent:
1367 1.368 rillig beSilent = TRUE;
1368 1.368 rillig break;
1369 1.368 rillig case ExPath:
1370 1.368 rillig if (paths != NULL)
1371 1.368 rillig Lst_ForEach(paths, ParseClearPath, NULL);
1372 1.368 rillig Dir_SetPATH();
1373 1.368 rillig break;
1374 1.368 rillig #ifdef POSIX
1375 1.368 rillig case Posix:
1376 1.368 rillig Var_Set("%POSIX", "1003.2", VAR_GLOBAL);
1377 1.368 rillig break;
1378 1.368 rillig #endif
1379 1.368 rillig default:
1380 1.368 rillig break;
1381 1.368 rillig }
1382 1.368 rillig }
1383 1.364 rillig
1384 1.368 rillig /*
1385 1.368 rillig * If the target was one that doesn't take files as its sources
1386 1.368 rillig * but takes something like suffixes, we take each
1387 1.368 rillig * space-separated word on the line as a something and deal
1388 1.368 rillig * with it accordingly.
1389 1.368 rillig *
1390 1.368 rillig * If the target was .SUFFIXES, we take each source as a
1391 1.368 rillig * suffix and add it to the list of suffixes maintained by the
1392 1.368 rillig * Suff module.
1393 1.368 rillig *
1394 1.368 rillig * If the target was a .PATH, we add the source as a directory
1395 1.368 rillig * to search on the search path.
1396 1.368 rillig *
1397 1.368 rillig * If it was .INCLUDES, the source is taken to be the suffix of
1398 1.368 rillig * files which will be #included and whose search path should
1399 1.368 rillig * be present in the .INCLUDES variable.
1400 1.368 rillig *
1401 1.368 rillig * If it was .LIBS, the source is taken to be the suffix of
1402 1.368 rillig * files which are considered libraries and whose search path
1403 1.368 rillig * should be present in the .LIBS variable.
1404 1.368 rillig *
1405 1.368 rillig * If it was .NULL, the source is the suffix to use when a file
1406 1.368 rillig * has no valid suffix.
1407 1.368 rillig *
1408 1.368 rillig * If it was .OBJDIR, the source is a new definition for .OBJDIR,
1409 1.368 rillig * and will cause make to do a new chdir to that path.
1410 1.368 rillig */
1411 1.368 rillig static void
1412 1.368 rillig ParseDoDependencySourceSpecial(ParseSpecial const specType, char *const line,
1413 1.368 rillig SearchPathList *const paths)
1414 1.368 rillig {
1415 1.368 rillig switch (specType) {
1416 1.368 rillig case Suffixes:
1417 1.368 rillig Suff_AddSuffix(line, &mainNode);
1418 1.368 rillig break;
1419 1.368 rillig case ExPath:
1420 1.368 rillig if (paths != NULL)
1421 1.368 rillig Lst_ForEach(paths, ParseAddDir, line);
1422 1.368 rillig break;
1423 1.368 rillig case Includes:
1424 1.368 rillig Suff_AddInclude(line);
1425 1.368 rillig break;
1426 1.368 rillig case Libs:
1427 1.368 rillig Suff_AddLib(line);
1428 1.368 rillig break;
1429 1.368 rillig case Null:
1430 1.368 rillig Suff_SetNull(line);
1431 1.368 rillig break;
1432 1.368 rillig case ExObjdir:
1433 1.368 rillig Main_SetObjdir("%s", line);
1434 1.368 rillig break;
1435 1.368 rillig default:
1436 1.368 rillig break;
1437 1.368 rillig }
1438 1.368 rillig }
1439 1.364 rillig
1440 1.368 rillig static Boolean
1441 1.368 rillig ParseDoDependencyTargets(char **const inout_cp,
1442 1.368 rillig char **const inout_line,
1443 1.368 rillig const char *const lstart,
1444 1.368 rillig ParseSpecial *const inout_specType,
1445 1.368 rillig GNodeType *const inout_tOp,
1446 1.368 rillig SearchPathList **const inout_paths,
1447 1.368 rillig StringList *const curTargs)
1448 1.368 rillig {
1449 1.368 rillig char *cp = *inout_cp;
1450 1.368 rillig char *line = *inout_line;
1451 1.368 rillig char savec;
1452 1.204 dholland
1453 1.336 rillig for (;;) {
1454 1.204 dholland /*
1455 1.204 dholland * Here LINE points to the beginning of the next word, and
1456 1.204 dholland * LSTART points to the actual beginning of the line.
1457 1.204 dholland */
1458 1.204 dholland
1459 1.204 dholland /* Find the end of the next word. */
1460 1.314 rillig cp = line;
1461 1.314 rillig ParseDependencyTargetWord(&cp, lstart);
1462 1.121 dsl
1463 1.204 dholland /*
1464 1.204 dholland * If the word is followed by a left parenthesis, it's the
1465 1.204 dholland * name of an object file inside an archive (ar file).
1466 1.204 dholland */
1467 1.310 rillig if (!ParseIsEscaped(lstart, cp) && *cp == '(') {
1468 1.1 cgd /*
1469 1.203 joerg * Archives must be handled specially to make sure the OP_ARCHV
1470 1.203 joerg * flag is set in their 'type' field, for one thing, and because
1471 1.203 joerg * things like "archive(file1.o file2.o file3.o)" are permissible.
1472 1.203 joerg * Arch_ParseArchive will set 'line' to be the first non-blank
1473 1.203 joerg * after the archive-spec. It creates/finds nodes for the members
1474 1.272 rillig * and places them on the given list, returning TRUE if all
1475 1.272 rillig * went well and FALSE if there was an error in the
1476 1.203 joerg * specification. On error, line should remain untouched.
1477 1.1 cgd */
1478 1.264 rillig if (!Arch_ParseArchive(&line, targets, VAR_CMD)) {
1479 1.97 christos Parse_Error(PARSE_FATAL,
1480 1.368 rillig "Error in archive specification: \"%s\"", line);
1481 1.368 rillig return FALSE;
1482 1.203 joerg } else {
1483 1.204 dholland /* Done with this word; on to the next. */
1484 1.213 matthias cp = line;
1485 1.1 cgd continue;
1486 1.203 joerg }
1487 1.1 cgd }
1488 1.27 christos
1489 1.1 cgd if (!*cp) {
1490 1.311 rillig ParseErrorNoDependency(lstart, line);
1491 1.368 rillig return FALSE;
1492 1.1 cgd }
1493 1.204 dholland
1494 1.204 dholland /* Insert a null terminator. */
1495 1.204 dholland savec = *cp;
1496 1.1 cgd *cp = '\0';
1497 1.118 dsl
1498 1.368 rillig if (!ParseDoDependencyTarget(line, inout_specType, inout_tOp,
1499 1.368 rillig inout_paths))
1500 1.368 rillig return FALSE;
1501 1.368 rillig
1502 1.1 cgd /*
1503 1.368 rillig * Have word in line. Get or create its node and stick it at
1504 1.368 rillig * the end of the targets list
1505 1.1 cgd */
1506 1.368 rillig if (*inout_specType == Not && *line != '\0') {
1507 1.368 rillig ParseDoDependencyTargetMundane(line, curTargs);
1508 1.368 rillig } else if (*inout_specType == ExPath && *line != '.' && *line != '\0') {
1509 1.368 rillig Parse_Error(PARSE_WARNING, "Extra target (%s) ignored", line);
1510 1.368 rillig }
1511 1.368 rillig
1512 1.368 rillig /* Don't need the inserted null terminator any more. */
1513 1.368 rillig *cp = savec;
1514 1.368 rillig
1515 1.368 rillig /*
1516 1.368 rillig * If it is a special type and not .PATH, it's the only target we
1517 1.368 rillig * allow on this line...
1518 1.368 rillig */
1519 1.368 rillig if (*inout_specType != Not && *inout_specType != ExPath) {
1520 1.368 rillig ParseDoDependencyTargetExtraWarn(&cp, lstart);
1521 1.368 rillig } else {
1522 1.368 rillig pp_skip_whitespace(&cp);
1523 1.368 rillig }
1524 1.368 rillig line = cp;
1525 1.368 rillig if (*line == '\0')
1526 1.368 rillig break;
1527 1.368 rillig if ((*line == '!' || *line == ':') && !ParseIsEscaped(lstart, line))
1528 1.368 rillig break;
1529 1.368 rillig }
1530 1.368 rillig
1531 1.368 rillig *inout_cp = cp;
1532 1.368 rillig *inout_line = line;
1533 1.368 rillig return TRUE;
1534 1.368 rillig }
1535 1.27 christos
1536 1.368 rillig static void
1537 1.368 rillig ParseDoDependencySourcesSpecial(char *line, char *cp,
1538 1.368 rillig ParseSpecial specType, SearchPathList *paths)
1539 1.368 rillig {
1540 1.368 rillig char savec;
1541 1.204 dholland
1542 1.368 rillig while (*line) {
1543 1.368 rillig while (*cp && !ch_isspace(*cp)) {
1544 1.368 rillig cp++;
1545 1.368 rillig }
1546 1.368 rillig savec = *cp;
1547 1.368 rillig *cp = '\0';
1548 1.368 rillig ParseDoDependencySourceSpecial(specType, line, paths);
1549 1.368 rillig *cp = savec;
1550 1.368 rillig if (savec != '\0') {
1551 1.368 rillig cp++;
1552 1.368 rillig }
1553 1.368 rillig pp_skip_whitespace(&cp);
1554 1.368 rillig line = cp;
1555 1.368 rillig }
1556 1.368 rillig }
1557 1.368 rillig
1558 1.368 rillig static Boolean
1559 1.368 rillig ParseDoDependencySourcesMundane(char *line, char *cp,
1560 1.374 rillig ParseSpecial specType, GNodeType tOp)
1561 1.368 rillig {
1562 1.368 rillig while (*line) {
1563 1.368 rillig /*
1564 1.368 rillig * The targets take real sources, so we must beware of archive
1565 1.368 rillig * specifications (i.e. things with left parentheses in them)
1566 1.368 rillig * and handle them accordingly.
1567 1.368 rillig */
1568 1.368 rillig for (; *cp && !ch_isspace(*cp); cp++) {
1569 1.368 rillig if (*cp == '(' && cp > line && cp[-1] != '$') {
1570 1.367 rillig /*
1571 1.368 rillig * Only stop for a left parenthesis if it isn't at the
1572 1.368 rillig * start of a word (that'll be for variable changes
1573 1.368 rillig * later) and isn't preceded by a dollar sign (a dynamic
1574 1.368 rillig * source).
1575 1.367 rillig */
1576 1.368 rillig break;
1577 1.368 rillig }
1578 1.368 rillig }
1579 1.368 rillig
1580 1.368 rillig if (*cp == '(') {
1581 1.368 rillig GNodeList *sources = Lst_Init();
1582 1.368 rillig if (!Arch_ParseArchive(&line, sources, VAR_CMD)) {
1583 1.368 rillig Parse_Error(PARSE_FATAL,
1584 1.368 rillig "Error in source archive spec \"%s\"", line);
1585 1.368 rillig return FALSE;
1586 1.368 rillig }
1587 1.368 rillig
1588 1.368 rillig while (!Lst_IsEmpty(sources)) {
1589 1.368 rillig GNode *gn = Lst_Dequeue(sources);
1590 1.368 rillig ParseDoSrc(tOp, gn->name, specType);
1591 1.368 rillig }
1592 1.368 rillig Lst_Free(sources);
1593 1.368 rillig cp = line;
1594 1.368 rillig } else {
1595 1.368 rillig if (*cp) {
1596 1.368 rillig *cp = '\0';
1597 1.368 rillig cp++;
1598 1.368 rillig }
1599 1.368 rillig
1600 1.368 rillig ParseDoSrc(tOp, line, specType);
1601 1.368 rillig }
1602 1.368 rillig pp_skip_whitespace(&cp);
1603 1.368 rillig line = cp;
1604 1.368 rillig }
1605 1.368 rillig return TRUE;
1606 1.368 rillig }
1607 1.1 cgd
1608 1.368 rillig /* Parse a dependency line consisting of targets, followed by a dependency
1609 1.368 rillig * operator, optionally followed by sources.
1610 1.368 rillig *
1611 1.368 rillig * The nodes of the sources are linked as children to the nodes of the
1612 1.368 rillig * targets. Nodes are created as necessary.
1613 1.368 rillig *
1614 1.368 rillig * The operator is applied to each node in the global 'targets' list,
1615 1.368 rillig * which is where the nodes found for the targets are kept, by means of
1616 1.368 rillig * the ParseDoOp function.
1617 1.368 rillig *
1618 1.368 rillig * The sources are parsed in much the same way as the targets, except
1619 1.368 rillig * that they are expanded using the wildcarding scheme of the C-Shell,
1620 1.368 rillig * and all instances of the resulting words in the list of all targets
1621 1.368 rillig * are found. Each of the resulting nodes is then linked to each of the
1622 1.368 rillig * targets as one of its children.
1623 1.368 rillig *
1624 1.368 rillig * Certain targets and sources such as .PHONY or .PRECIOUS are handled
1625 1.368 rillig * specially. These are the ones detailed by the specType variable.
1626 1.368 rillig *
1627 1.368 rillig * The storing of transformation rules such as '.c.o' is also taken care of
1628 1.368 rillig * here. A target is recognized as a transformation rule by calling
1629 1.368 rillig * Suff_IsTransform. If it is a transformation rule, its node is gotten
1630 1.368 rillig * from the suffix module via Suff_AddTransform rather than the standard
1631 1.368 rillig * Targ_FindNode in the target module.
1632 1.368 rillig */
1633 1.368 rillig static void
1634 1.368 rillig ParseDoDependency(char *line)
1635 1.368 rillig {
1636 1.368 rillig char *cp; /* our current position */
1637 1.368 rillig GNodeType op; /* the operator on the line */
1638 1.368 rillig SearchPathList *paths; /* search paths to alter when parsing
1639 1.368 rillig * a list of .PATH targets */
1640 1.368 rillig int tOp; /* operator from special target */
1641 1.368 rillig StringList *curTargs; /* target names to be found and added
1642 1.368 rillig * to the targets list */
1643 1.374 rillig char *lstart = line;
1644 1.366 rillig
1645 1.368 rillig /*
1646 1.368 rillig * specType contains the SPECial TYPE of the current target. It is Not
1647 1.368 rillig * if the target is unspecial. If it *is* special, however, the children
1648 1.368 rillig * are linked as children of the parent but not vice versa.
1649 1.368 rillig */
1650 1.368 rillig ParseSpecial specType = Not;
1651 1.366 rillig
1652 1.368 rillig DEBUG1(PARSE, "ParseDoDependency(%s)\n", line);
1653 1.368 rillig tOp = 0;
1654 1.366 rillig
1655 1.368 rillig paths = NULL;
1656 1.366 rillig
1657 1.368 rillig curTargs = Lst_Init();
1658 1.365 rillig
1659 1.368 rillig /*
1660 1.368 rillig * First, grind through the targets.
1661 1.368 rillig */
1662 1.368 rillig if (!ParseDoDependencyTargets(&cp, &line, lstart, &specType, &tOp, &paths,
1663 1.368 rillig curTargs))
1664 1.368 rillig goto out;
1665 1.365 rillig
1666 1.1 cgd /*
1667 1.1 cgd * Don't need the list of target names anymore...
1668 1.1 cgd */
1669 1.268 rillig Lst_Free(curTargs);
1670 1.112 christos curTargs = NULL;
1671 1.1 cgd
1672 1.368 rillig if (!Lst_IsEmpty(targets))
1673 1.373 rillig ParseDoDependencyCheckSpec(specType);
1674 1.1 cgd
1675 1.1 cgd /*
1676 1.368 rillig * Have now parsed all the target names. Must parse the operator next.
1677 1.1 cgd */
1678 1.368 rillig if (!ParseDoDependencyParseOp(&cp, lstart, &op))
1679 1.373 rillig goto out;
1680 1.1 cgd
1681 1.204 dholland /*
1682 1.204 dholland * Apply the operator to the target. This is how we remember which
1683 1.204 dholland * operator a target was defined with. It fails if the operator
1684 1.204 dholland * used isn't consistent across all references.
1685 1.204 dholland */
1686 1.337 rillig ApplyDependencyOperator(op);
1687 1.1 cgd
1688 1.1 cgd /*
1689 1.204 dholland * Onward to the sources.
1690 1.204 dholland *
1691 1.204 dholland * LINE will now point to the first source word, if any, or the
1692 1.204 dholland * end of the string if not.
1693 1.1 cgd */
1694 1.368 rillig pp_skip_whitespace(&cp);
1695 1.1 cgd line = cp;
1696 1.1 cgd
1697 1.1 cgd /*
1698 1.1 cgd * Several special targets take different actions if present with no
1699 1.1 cgd * sources:
1700 1.1 cgd * a .SUFFIXES line with no sources clears out all old suffixes
1701 1.1 cgd * a .PRECIOUS line makes all targets precious
1702 1.1 cgd * a .IGNORE line ignores errors for all targets
1703 1.1 cgd * a .SILENT line creates silence when making all targets
1704 1.1 cgd * a .PATH removes all directories from the search path(s).
1705 1.1 cgd */
1706 1.1 cgd if (!*line) {
1707 1.373 rillig ParseDoDependencySourcesEmpty(specType, paths);
1708 1.1 cgd } else if (specType == MFlags) {
1709 1.1 cgd /*
1710 1.1 cgd * Call on functions in main.c to deal with these arguments and
1711 1.1 cgd * set the initial character to a null-character so the loop to
1712 1.1 cgd * get sources won't get anything
1713 1.1 cgd */
1714 1.97 christos Main_ParseArgLine(line);
1715 1.1 cgd *line = '\0';
1716 1.5 cgd } else if (specType == ExShell) {
1717 1.272 rillig if (!Job_ParseShell(line)) {
1718 1.97 christos Parse_Error(PARSE_FATAL, "improper shell specification");
1719 1.112 christos goto out;
1720 1.1 cgd }
1721 1.1 cgd *line = '\0';
1722 1.242 rillig } else if (specType == NotParallel || specType == SingleShell ||
1723 1.374 rillig specType == DeleteOnError) {
1724 1.1 cgd *line = '\0';
1725 1.1 cgd }
1726 1.27 christos
1727 1.1 cgd /*
1728 1.27 christos * NOW GO FOR THE SOURCES
1729 1.1 cgd */
1730 1.242 rillig if (specType == Suffixes || specType == ExPath ||
1731 1.242 rillig specType == Includes || specType == Libs ||
1732 1.242 rillig specType == Null || specType == ExObjdir)
1733 1.1 cgd {
1734 1.373 rillig ParseDoDependencySourcesSpecial(line, cp, specType, paths);
1735 1.1 cgd if (paths) {
1736 1.268 rillig Lst_Free(paths);
1737 1.222 riastrad paths = NULL;
1738 1.1 cgd }
1739 1.85 sjg if (specType == ExPath)
1740 1.85 sjg Dir_SetPATH();
1741 1.1 cgd } else {
1742 1.222 riastrad assert(paths == NULL);
1743 1.373 rillig if (!ParseDoDependencySourcesMundane(line, cp, specType, tOp))
1744 1.373 rillig goto out;
1745 1.1 cgd }
1746 1.27 christos
1747 1.335 rillig FindMainTarget();
1748 1.1 cgd
1749 1.112 christos out:
1750 1.263 rillig if (paths != NULL)
1751 1.268 rillig Lst_Free(paths);
1752 1.263 rillig if (curTargs != NULL)
1753 1.268 rillig Lst_Free(curTargs);
1754 1.1 cgd }
1755 1.1 cgd
1756 1.368 rillig /* Parse a variable assignment, consisting of a single-word variable name,
1757 1.368 rillig * optional whitespace, an assignment operator, optional whitespace and the
1758 1.368 rillig * variable value.
1759 1.84 wiz *
1760 1.368 rillig * Used for both lines in a file and command line arguments. */
1761 1.1 cgd Boolean
1762 1.368 rillig Parse_IsVar(const char *p, VarAssign *out_var)
1763 1.1 cgd {
1764 1.368 rillig const char *firstSpace = NULL;
1765 1.154 dsl char ch;
1766 1.16 christos int level = 0;
1767 1.1 cgd
1768 1.368 rillig /* Skip to variable name */
1769 1.368 rillig while (*p == ' ' || *p == '\t')
1770 1.368 rillig p++;
1771 1.368 rillig
1772 1.368 rillig /* During parsing, the '+' of the '+=' operator is initially parsed
1773 1.368 rillig * as part of the variable name. It is later corrected, as is the ':sh'
1774 1.368 rillig * modifier. Of these two (nameEnd and op), the earlier one determines the
1775 1.368 rillig * actual end of the variable name. */
1776 1.368 rillig out_var->nameStart = p;
1777 1.368 rillig #ifdef CLEANUP
1778 1.368 rillig out_var->nameEndDraft = NULL;
1779 1.368 rillig out_var->varname = NULL;
1780 1.368 rillig out_var->eq = NULL;
1781 1.368 rillig out_var->op = VAR_NORMAL;
1782 1.368 rillig out_var->value = NULL;
1783 1.368 rillig #endif
1784 1.356 rillig
1785 1.154 dsl /* Scan for one of the assignment operators outside a variable expansion */
1786 1.368 rillig while ((ch = *p++) != 0) {
1787 1.154 dsl if (ch == '(' || ch == '{') {
1788 1.16 christos level++;
1789 1.154 dsl continue;
1790 1.154 dsl }
1791 1.154 dsl if (ch == ')' || ch == '}') {
1792 1.16 christos level--;
1793 1.154 dsl continue;
1794 1.154 dsl }
1795 1.368 rillig
1796 1.154 dsl if (level != 0)
1797 1.154 dsl continue;
1798 1.368 rillig
1799 1.368 rillig if (ch == ' ' || ch == '\t')
1800 1.368 rillig if (firstSpace == NULL)
1801 1.373 rillig firstSpace = p - 1;
1802 1.368 rillig while (ch == ' ' || ch == '\t')
1803 1.368 rillig ch = *p++;
1804 1.368 rillig
1805 1.191 sjg #ifdef SUNSHCMD
1806 1.368 rillig if (ch == ':' && strncmp(p, "sh", 2) == 0) {
1807 1.368 rillig p += 2;
1808 1.191 sjg continue;
1809 1.191 sjg }
1810 1.191 sjg #endif
1811 1.368 rillig if (ch == '=') {
1812 1.368 rillig out_var->eq = p - 1;
1813 1.368 rillig out_var->nameEndDraft = firstSpace != NULL ? firstSpace : p - 1;
1814 1.368 rillig out_var->op = VAR_NORMAL;
1815 1.368 rillig cpp_skip_whitespace(&p);
1816 1.368 rillig out_var->value = p;
1817 1.154 dsl return TRUE;
1818 1.368 rillig }
1819 1.368 rillig if (*p == '=' && (ch == '+' || ch == ':' || ch == '?' || ch == '!')) {
1820 1.368 rillig out_var->eq = p;
1821 1.368 rillig out_var->nameEndDraft = firstSpace != NULL ? firstSpace : p;
1822 1.368 rillig out_var->op = ch == '+' ? VAR_APPEND :
1823 1.368 rillig ch == ':' ? VAR_SUBST :
1824 1.368 rillig ch == '?' ? VAR_DEFAULT : VAR_SHELL;
1825 1.368 rillig p++;
1826 1.368 rillig cpp_skip_whitespace(&p);
1827 1.368 rillig out_var->value = p;
1828 1.154 dsl return TRUE;
1829 1.368 rillig }
1830 1.368 rillig if (firstSpace != NULL)
1831 1.154 dsl return FALSE;
1832 1.154 dsl }
1833 1.1 cgd
1834 1.154 dsl return FALSE;
1835 1.1 cgd }
1836 1.1 cgd
1837 1.368 rillig /* Determine the assignment operator and adjust the end of the variable
1838 1.368 rillig * name accordingly. */
1839 1.368 rillig static void
1840 1.368 rillig ParseVarassignOp(VarAssign *var)
1841 1.354 rillig {
1842 1.368 rillig const char *op = var->eq;
1843 1.368 rillig const char * const name = var->nameStart;
1844 1.368 rillig VarAssignOp type;
1845 1.368 rillig
1846 1.368 rillig if (op > name && op[-1] == '+') {
1847 1.368 rillig type = VAR_APPEND;
1848 1.368 rillig op--;
1849 1.368 rillig
1850 1.368 rillig } else if (op > name && op[-1] == '?') {
1851 1.373 rillig op--;
1852 1.373 rillig type = VAR_DEFAULT;
1853 1.368 rillig
1854 1.368 rillig } else if (op > name && op[-1] == ':') {
1855 1.368 rillig op--;
1856 1.368 rillig type = VAR_SUBST;
1857 1.368 rillig
1858 1.368 rillig } else if (op > name && op[-1] == '!') {
1859 1.368 rillig op--;
1860 1.368 rillig type = VAR_SHELL;
1861 1.367 rillig
1862 1.368 rillig } else {
1863 1.368 rillig type = VAR_NORMAL;
1864 1.368 rillig #ifdef SUNSHCMD
1865 1.368 rillig while (op > name && ch_isspace(op[-1]))
1866 1.368 rillig op--;
1867 1.367 rillig
1868 1.368 rillig if (op >= name + 3 && op[-3] == ':' && op[-2] == 's' && op[-1] == 'h') {
1869 1.368 rillig type = VAR_SHELL;
1870 1.368 rillig op -= 3;
1871 1.367 rillig }
1872 1.368 rillig #endif
1873 1.367 rillig }
1874 1.367 rillig
1875 1.368 rillig {
1876 1.368 rillig const char *nameEnd = var->nameEndDraft < op ? var->nameEndDraft : op;
1877 1.368 rillig var->varname = bmake_strsedup(var->nameStart, nameEnd);
1878 1.368 rillig var->op = type;
1879 1.1 cgd }
1880 1.368 rillig }
1881 1.1 cgd
1882 1.368 rillig static void
1883 1.368 rillig VarCheckSyntax(VarAssignOp type, const char *uvalue, GNode *ctxt)
1884 1.368 rillig {
1885 1.243 sjg if (DEBUG(LINT)) {
1886 1.368 rillig if (type != VAR_SUBST && strchr(uvalue, '$') != NULL) {
1887 1.368 rillig /* Check for syntax errors such as unclosed expressions or
1888 1.368 rillig * unknown modifiers. */
1889 1.325 rillig char *expandedValue;
1890 1.243 sjg
1891 1.368 rillig (void)Var_Subst(uvalue, ctxt, VARE_NONE, &expandedValue);
1892 1.323 rillig /* TODO: handle errors */
1893 1.325 rillig free(expandedValue);
1894 1.243 sjg }
1895 1.243 sjg }
1896 1.368 rillig }
1897 1.368 rillig
1898 1.368 rillig static Boolean
1899 1.368 rillig VarAssign_Eval(VarAssign *var, GNode *ctxt,
1900 1.368 rillig const char **out_avalue, void **out_avalue_freeIt)
1901 1.368 rillig {
1902 1.368 rillig const char *uvalue = var->value;
1903 1.368 rillig const char *name = var->varname;
1904 1.368 rillig const VarAssignOp type = var->op;
1905 1.368 rillig const char *avalue = uvalue;
1906 1.368 rillig void *avalue_freeIt = NULL;
1907 1.353 rillig
1908 1.1 cgd if (type == VAR_APPEND) {
1909 1.368 rillig Var_Append(name, uvalue, ctxt);
1910 1.1 cgd } else if (type == VAR_SUBST) {
1911 1.373 rillig char *evalue;
1912 1.1 cgd /*
1913 1.1 cgd * Allow variables in the old value to be undefined, but leave their
1914 1.295 rillig * expressions alone -- this is done by forcing oldVars to be false.
1915 1.1 cgd * XXX: This can cause recursive variables, but that's not hard to do,
1916 1.1 cgd * and this allows someone to do something like
1917 1.1 cgd *
1918 1.1 cgd * CFLAGS = $(.INCLUDES)
1919 1.1 cgd * CFLAGS := -I.. $(CFLAGS)
1920 1.1 cgd *
1921 1.1 cgd * And not get an error.
1922 1.1 cgd */
1923 1.374 rillig Boolean oldOldVars = oldVars;
1924 1.1 cgd
1925 1.1 cgd oldVars = FALSE;
1926 1.42 christos
1927 1.42 christos /*
1928 1.42 christos * make sure that we set the variable the first time to nothing
1929 1.42 christos * so that it gets substituted!
1930 1.42 christos */
1931 1.368 rillig if (!Var_Exists(name, ctxt))
1932 1.368 rillig Var_Set(name, "", ctxt);
1933 1.42 christos
1934 1.368 rillig (void)Var_Subst(uvalue, ctxt, VARE_WANTRES|VARE_ASSIGN, &evalue);
1935 1.323 rillig /* TODO: handle errors */
1936 1.1 cgd oldVars = oldOldVars;
1937 1.368 rillig avalue = evalue;
1938 1.368 rillig avalue_freeIt = evalue;
1939 1.1 cgd
1940 1.368 rillig Var_Set(name, avalue, ctxt);
1941 1.1 cgd } else if (type == VAR_SHELL) {
1942 1.373 rillig const char *cmd, *errfmt;
1943 1.373 rillig char *cmdOut;
1944 1.373 rillig void *cmd_freeIt = NULL;
1945 1.368 rillig
1946 1.368 rillig cmd = uvalue;
1947 1.368 rillig if (strchr(cmd, '$') != NULL) {
1948 1.368 rillig char *ecmd;
1949 1.368 rillig (void)Var_Subst(cmd, VAR_CMD, VARE_UNDEFERR|VARE_WANTRES, &ecmd);
1950 1.323 rillig /* TODO: handle errors */
1951 1.368 rillig cmd = cmd_freeIt = ecmd;
1952 1.1 cgd }
1953 1.1 cgd
1954 1.368 rillig cmdOut = Cmd_Exec(cmd, &errfmt);
1955 1.368 rillig Var_Set(name, cmdOut, ctxt);
1956 1.368 rillig avalue = avalue_freeIt = cmdOut;
1957 1.368 rillig
1958 1.368 rillig if (errfmt)
1959 1.368 rillig Parse_Error(PARSE_WARNING, errfmt, cmd);
1960 1.1 cgd
1961 1.368 rillig free(cmd_freeIt);
1962 1.1 cgd } else {
1963 1.368 rillig if (type == VAR_DEFAULT && Var_Exists(var->varname, ctxt)) {
1964 1.368 rillig *out_avalue_freeIt = NULL;
1965 1.368 rillig return FALSE;
1966 1.368 rillig }
1967 1.368 rillig
1968 1.368 rillig /* Normal assignment -- just do it. */
1969 1.368 rillig Var_Set(name, uvalue, ctxt);
1970 1.1 cgd }
1971 1.368 rillig
1972 1.368 rillig *out_avalue = avalue;
1973 1.368 rillig *out_avalue_freeIt = avalue_freeIt;
1974 1.368 rillig return TRUE;
1975 1.368 rillig }
1976 1.368 rillig
1977 1.368 rillig static void
1978 1.368 rillig VarAssignSpecial(const char *name, const char *avalue)
1979 1.368 rillig {
1980 1.368 rillig if (strcmp(name, MAKEOVERRIDES) == 0)
1981 1.74 tv Main_ExportMAKEFLAGS(FALSE); /* re-export MAKEFLAGS */
1982 1.368 rillig else if (strcmp(name, ".CURDIR") == 0) {
1983 1.85 sjg /*
1984 1.321 rillig * Someone is being (too?) clever...
1985 1.85 sjg * Let's pretend they know what they are doing and
1986 1.321 rillig * re-initialize the 'cur' CachedDir.
1987 1.85 sjg */
1988 1.368 rillig Dir_InitCur(avalue);
1989 1.85 sjg Dir_SetPATH();
1990 1.368 rillig } else if (strcmp(name, MAKE_JOB_PREFIX) == 0) {
1991 1.135 sjg Job_SetPrefix();
1992 1.368 rillig } else if (strcmp(name, MAKE_EXPORTED) == 0) {
1993 1.368 rillig Var_Export(avalue, FALSE);
1994 1.85 sjg }
1995 1.368 rillig }
1996 1.368 rillig
1997 1.368 rillig /* Take the variable assignment in the passed line and execute it.
1998 1.368 rillig *
1999 1.368 rillig * Note: There is a lexical ambiguity with assignment modifier characters
2000 1.368 rillig * in variable names. This routine interprets the character before the =
2001 1.368 rillig * as a modifier. Therefore, an assignment like
2002 1.368 rillig * C++=/usr/bin/CC
2003 1.368 rillig * is interpreted as "C+ +=" instead of "C++ =".
2004 1.368 rillig *
2005 1.368 rillig * Input:
2006 1.368 rillig * p A line guaranteed to be a variable assignment
2007 1.368 rillig * (see Parse_IsVar).
2008 1.368 rillig * ctxt Context in which to do the assignment
2009 1.368 rillig */
2010 1.368 rillig void
2011 1.368 rillig Parse_DoVar(VarAssign *var, GNode *ctxt)
2012 1.368 rillig {
2013 1.368 rillig const char *avalue; /* actual value (maybe expanded) */
2014 1.368 rillig void *avalue_freeIt;
2015 1.368 rillig
2016 1.368 rillig ParseVarassignOp(var);
2017 1.368 rillig
2018 1.368 rillig VarCheckSyntax(var->op, var->value, ctxt);
2019 1.368 rillig if (VarAssign_Eval(var, ctxt, &avalue, &avalue_freeIt))
2020 1.368 rillig VarAssignSpecial(var->varname, avalue);
2021 1.368 rillig
2022 1.368 rillig free(avalue_freeIt);
2023 1.368 rillig free(var->varname);
2024 1.1 cgd }
2025 1.23 christos
2026 1.200 christos
2027 1.203 joerg /*
2028 1.195 christos * ParseMaybeSubMake --
2029 1.338 rillig * Scan the command string to see if it a possible submake node
2030 1.195 christos * Input:
2031 1.195 christos * cmd the command to scan
2032 1.195 christos * Results:
2033 1.195 christos * TRUE if the command is possibly a submake, FALSE if not.
2034 1.195 christos */
2035 1.195 christos static Boolean
2036 1.195 christos ParseMaybeSubMake(const char *cmd)
2037 1.195 christos {
2038 1.197 justin size_t i;
2039 1.195 christos static struct {
2040 1.195 christos const char *name;
2041 1.195 christos size_t len;
2042 1.195 christos } vals[] = {
2043 1.195 christos #define MKV(A) { A, sizeof(A) - 1 }
2044 1.195 christos MKV("${MAKE}"),
2045 1.195 christos MKV("${.MAKE}"),
2046 1.195 christos MKV("$(MAKE)"),
2047 1.195 christos MKV("$(.MAKE)"),
2048 1.195 christos MKV("make"),
2049 1.195 christos };
2050 1.375 rillig for (i = 0; i < sizeof vals / sizeof vals[0]; i++) {
2051 1.195 christos char *ptr;
2052 1.195 christos if ((ptr = strstr(cmd, vals[i].name)) == NULL)
2053 1.195 christos continue;
2054 1.290 rillig if ((ptr == cmd || !ch_isalnum(ptr[-1]))
2055 1.290 rillig && !ch_isalnum(ptr[vals[i].len]))
2056 1.195 christos return TRUE;
2057 1.195 christos }
2058 1.195 christos return FALSE;
2059 1.195 christos }
2060 1.195 christos
2061 1.327 rillig /* Append the command to the target node.
2062 1.1 cgd *
2063 1.327 rillig * The node may be marked as a submake node if the command is determined to
2064 1.327 rillig * be that. */
2065 1.327 rillig static void
2066 1.327 rillig ParseAddCmd(GNode *gn, char *cmd)
2067 1.9 jtc {
2068 1.120 dsl /* Add to last (ie current) cohort for :: targets */
2069 1.327 rillig if ((gn->type & OP_DOUBLEDEP) && gn->cohorts->last != NULL)
2070 1.327 rillig gn = gn->cohorts->last->datum;
2071 1.120 dsl
2072 1.203 joerg /* if target already supplied, ignore commands */
2073 1.203 joerg if (!(gn->type & OP_HAS_COMMANDS)) {
2074 1.268 rillig Lst_Append(gn->commands, cmd);
2075 1.203 joerg if (ParseMaybeSubMake(cmd))
2076 1.203 joerg gn->type |= OP_SUBMAKE;
2077 1.203 joerg ParseMark(gn);
2078 1.203 joerg } else {
2079 1.327 rillig #if 0
2080 1.203 joerg /* XXX: We cannot do this until we fix the tree */
2081 1.268 rillig Lst_Append(gn->commands, cmd);
2082 1.203 joerg Parse_Error(PARSE_WARNING,
2083 1.203 joerg "overriding commands for target \"%s\"; "
2084 1.203 joerg "previous commands defined at %s: %d ignored",
2085 1.203 joerg gn->name, gn->fname, gn->lineno);
2086 1.203 joerg #else
2087 1.203 joerg Parse_Error(PARSE_WARNING,
2088 1.374 rillig "duplicate script for target \"%s\" ignored",
2089 1.374 rillig gn->name);
2090 1.369 rillig ParseErrorInternal(gn->fname, (size_t)gn->lineno, PARSE_WARNING,
2091 1.374 rillig "using previous script for \"%s\" defined here",
2092 1.374 rillig gn->name);
2093 1.203 joerg #endif
2094 1.200 christos }
2095 1.1 cgd }
2096 1.1 cgd
2097 1.284 rillig /* Add a directory to the path searched for included makefiles bracketed
2098 1.284 rillig * by double-quotes. */
2099 1.1 cgd void
2100 1.344 rillig Parse_AddIncludeDir(const char *dir)
2101 1.1 cgd {
2102 1.103 christos (void)Dir_AddDir(parseIncPath, dir);
2103 1.1 cgd }
2104 1.1 cgd
2105 1.284 rillig /* Push to another file.
2106 1.1 cgd *
2107 1.284 rillig * The input is the line minus the '.'. A file spec is a string enclosed in
2108 1.284 rillig * <> or "". The <> file is looked for only in sysIncPath. The "" file is
2109 1.284 rillig * first searched in the parsedir and then in the directories specified by
2110 1.284 rillig * the -I command line options.
2111 1.1 cgd */
2112 1.1 cgd static void
2113 1.210 sjg Parse_include_file(char *file, Boolean isSystem, Boolean depinc, int silent)
2114 1.1 cgd {
2115 1.170 dholland struct loadedfile *lf;
2116 1.374 rillig char *fullname; /* full pathname of file */
2117 1.374 rillig char *newName;
2118 1.374 rillig char *prefEnd, *incdir;
2119 1.374 rillig int fd;
2120 1.374 rillig int i;
2121 1.1 cgd
2122 1.1 cgd /*
2123 1.1 cgd * Now we know the file's name and its search path, we attempt to
2124 1.1 cgd * find the durn thing. A return of NULL indicates the file don't
2125 1.1 cgd * exist.
2126 1.1 cgd */
2127 1.147 joerg fullname = file[0] == '/' ? bmake_strdup(file) : NULL;
2128 1.76 reinoud
2129 1.140 dsl if (fullname == NULL && !isSystem) {
2130 1.1 cgd /*
2131 1.1 cgd * Include files contained in double-quotes are first searched for
2132 1.1 cgd * relative to the including file's location. We don't want to
2133 1.1 cgd * cd there, of course, so we just tack on the old file's
2134 1.1 cgd * leading path components and call Dir_FindFile to see if
2135 1.1 cgd * we can locate the beast.
2136 1.1 cgd */
2137 1.1 cgd
2138 1.147 joerg incdir = bmake_strdup(curFile->fname);
2139 1.140 dsl prefEnd = strrchr(incdir, '/');
2140 1.105 christos if (prefEnd != NULL) {
2141 1.1 cgd *prefEnd = '\0';
2142 1.140 dsl /* Now do lexical processing of leading "../" on the filename */
2143 1.140 dsl for (i = 0; strncmp(file + i, "../", 3) == 0; i += 3) {
2144 1.140 dsl prefEnd = strrchr(incdir + 1, '/');
2145 1.140 dsl if (prefEnd == NULL || strcmp(prefEnd, "/..") == 0)
2146 1.140 dsl break;
2147 1.140 dsl *prefEnd = '\0';
2148 1.140 dsl }
2149 1.251 rillig newName = str_concat3(incdir, "/", file + i);
2150 1.97 christos fullname = Dir_FindFile(newName, parseIncPath);
2151 1.140 dsl if (fullname == NULL)
2152 1.1 cgd fullname = Dir_FindFile(newName, dirSearchPath);
2153 1.103 christos free(newName);
2154 1.1 cgd }
2155 1.140 dsl free(incdir);
2156 1.140 dsl
2157 1.142 sjg if (fullname == NULL) {
2158 1.76 reinoud /*
2159 1.246 rillig * Makefile wasn't found in same directory as included makefile.
2160 1.76 reinoud * Search for it first on the -I search path,
2161 1.76 reinoud * then on the .PATH search path, if not found in a -I directory.
2162 1.142 sjg * If we have a suffix specific path we should use that.
2163 1.76 reinoud */
2164 1.142 sjg char *suff;
2165 1.322 rillig SearchPath *suffPath = NULL;
2166 1.142 sjg
2167 1.145 christos if ((suff = strrchr(file, '.'))) {
2168 1.142 sjg suffPath = Suff_GetPath(suff);
2169 1.152 dsl if (suffPath != NULL) {
2170 1.142 sjg fullname = Dir_FindFile(file, suffPath);
2171 1.142 sjg }
2172 1.142 sjg }
2173 1.105 christos if (fullname == NULL) {
2174 1.142 sjg fullname = Dir_FindFile(file, parseIncPath);
2175 1.142 sjg if (fullname == NULL) {
2176 1.142 sjg fullname = Dir_FindFile(file, dirSearchPath);
2177 1.142 sjg }
2178 1.76 reinoud }
2179 1.142 sjg }
2180 1.1 cgd }
2181 1.1 cgd
2182 1.76 reinoud /* Looking for a system file or file still not found */
2183 1.105 christos if (fullname == NULL) {
2184 1.1 cgd /*
2185 1.76 reinoud * Look for it on the system path
2186 1.1 cgd */
2187 1.375 rillig SearchPath *path = Lst_IsEmpty(sysIncPath) ? defIncPath : sysIncPath;
2188 1.375 rillig fullname = Dir_FindFile(file, path);
2189 1.1 cgd }
2190 1.1 cgd
2191 1.105 christos if (fullname == NULL) {
2192 1.38 christos if (!silent)
2193 1.97 christos Parse_Error(PARSE_FATAL, "Could not find %s", file);
2194 1.1 cgd return;
2195 1.1 cgd }
2196 1.1 cgd
2197 1.125 dsl /* Actually open the file... */
2198 1.125 dsl fd = open(fullname, O_RDONLY);
2199 1.125 dsl if (fd == -1) {
2200 1.38 christos if (!silent)
2201 1.97 christos Parse_Error(PARSE_FATAL, "Cannot open %s", fullname);
2202 1.140 dsl free(fullname);
2203 1.125 dsl return;
2204 1.123 dsl }
2205 1.125 dsl
2206 1.170 dholland /* load it */
2207 1.170 dholland lf = loadfile(fullname, fd);
2208 1.170 dholland
2209 1.125 dsl /* Start reading from this file next */
2210 1.170 dholland Parse_SetInput(fullname, 0, -1, loadedfile_nextbuf, lf);
2211 1.170 dholland curFile->lf = lf;
2212 1.210 sjg if (depinc)
2213 1.374 rillig doing_depend = depinc; /* only turn it on */
2214 1.123 dsl }
2215 1.123 dsl
2216 1.123 dsl static void
2217 1.123 dsl ParseDoInclude(char *line)
2218 1.123 dsl {
2219 1.374 rillig char endc; /* the character which ends the file spec */
2220 1.374 rillig char *cp; /* current position in file spec */
2221 1.374 rillig int silent = *line != 'i';
2222 1.375 rillig char *file = line + (silent ? 8 : 7);
2223 1.123 dsl
2224 1.123 dsl /* Skip to delimiter character so we know where to look */
2225 1.123 dsl while (*file == ' ' || *file == '\t')
2226 1.123 dsl file++;
2227 1.123 dsl
2228 1.123 dsl if (*file != '"' && *file != '<') {
2229 1.123 dsl Parse_Error(PARSE_FATAL,
2230 1.374 rillig ".include filename must be delimited by '\"' or '<'");
2231 1.123 dsl return;
2232 1.123 dsl }
2233 1.123 dsl
2234 1.123 dsl /*
2235 1.123 dsl * Set the search path on which to find the include file based on the
2236 1.123 dsl * characters which bracket its name. Angle-brackets imply it's
2237 1.123 dsl * a system Makefile while double-quotes imply it's a user makefile
2238 1.123 dsl */
2239 1.123 dsl if (*file == '<') {
2240 1.123 dsl endc = '>';
2241 1.123 dsl } else {
2242 1.123 dsl endc = '"';
2243 1.123 dsl }
2244 1.123 dsl
2245 1.123 dsl /* Skip to matching delimiter */
2246 1.123 dsl for (cp = ++file; *cp && *cp != endc; cp++)
2247 1.123 dsl continue;
2248 1.123 dsl
2249 1.123 dsl if (*cp != endc) {
2250 1.123 dsl Parse_Error(PARSE_FATAL,
2251 1.374 rillig "Unclosed %cinclude filename. '%c' expected",
2252 1.374 rillig '.', endc);
2253 1.123 dsl return;
2254 1.1 cgd }
2255 1.123 dsl *cp = '\0';
2256 1.123 dsl
2257 1.123 dsl /*
2258 1.123 dsl * Substitute for any variables in the file name before trying to
2259 1.123 dsl * find the thing.
2260 1.123 dsl */
2261 1.323 rillig (void)Var_Subst(file, VAR_CMD, VARE_WANTRES, &file);
2262 1.323 rillig /* TODO: handle errors */
2263 1.123 dsl
2264 1.242 rillig Parse_include_file(file, endc == '>', *line == 'd', silent);
2265 1.123 dsl free(file);
2266 1.1 cgd }
2267 1.1 cgd
2268 1.281 rillig /* Split filename into dirname + basename, then assign these to the
2269 1.281 rillig * given variables. */
2270 1.193 christos static void
2271 1.281 rillig SetFilenameVars(const char *filename, const char *dirvar, const char *filevar)
2272 1.193 christos {
2273 1.281 rillig const char *slash, *dirname, *basename;
2274 1.281 rillig void *freeIt;
2275 1.281 rillig
2276 1.281 rillig slash = strrchr(filename, '/');
2277 1.281 rillig if (slash == NULL) {
2278 1.281 rillig dirname = curdir;
2279 1.281 rillig basename = filename;
2280 1.281 rillig freeIt = NULL;
2281 1.281 rillig } else {
2282 1.281 rillig dirname = freeIt = bmake_strsedup(filename, slash);
2283 1.281 rillig basename = slash + 1;
2284 1.281 rillig }
2285 1.193 christos
2286 1.281 rillig Var_Set(dirvar, dirname, VAR_GLOBAL);
2287 1.281 rillig Var_Set(filevar, basename, VAR_GLOBAL);
2288 1.193 christos
2289 1.341 rillig DEBUG5(PARSE, "%s: ${%s} = `%s' ${%s} = `%s'\n",
2290 1.341 rillig __func__, dirvar, dirname, filevar, basename);
2291 1.281 rillig free(freeIt);
2292 1.281 rillig }
2293 1.281 rillig
2294 1.281 rillig /* Return the immediately including file.
2295 1.281 rillig *
2296 1.281 rillig * This is made complicated since the .for loop is implemented as a special
2297 1.281 rillig * kind of .include; see For_Run. */
2298 1.281 rillig static const char *
2299 1.281 rillig GetActuallyIncludingFile(void)
2300 1.281 rillig {
2301 1.281 rillig size_t i;
2302 1.193 christos
2303 1.281 rillig /* XXX: Stack was supposed to be an opaque data structure. */
2304 1.282 rillig for (i = includes.len; i > 0; i--) {
2305 1.282 rillig IFile *parent = includes.items[i - 1];
2306 1.284 rillig IFile *child = i < includes.len ? includes.items[i] : curFile;
2307 1.281 rillig if (!child->fromForLoop)
2308 1.282 rillig return parent->fname;
2309 1.281 rillig }
2310 1.282 rillig return NULL;
2311 1.193 christos }
2312 1.281 rillig
2313 1.285 rillig /* Set .PARSEDIR, .PARSEFILE, .INCLUDEDFROMDIR and .INCLUDEDFROMFILE. */
2314 1.44 aidan static void
2315 1.122 dsl ParseSetParseFile(const char *filename)
2316 1.44 aidan {
2317 1.281 rillig const char *including;
2318 1.44 aidan
2319 1.281 rillig SetFilenameVars(filename, ".PARSEDIR", ".PARSEFILE");
2320 1.281 rillig
2321 1.281 rillig including = GetActuallyIncludingFile();
2322 1.281 rillig if (including != NULL) {
2323 1.281 rillig SetFilenameVars(including,
2324 1.281 rillig ".INCLUDEDFROMDIR", ".INCLUDEDFROMFILE");
2325 1.44 aidan } else {
2326 1.281 rillig Var_Delete(".INCLUDEDFROMDIR", VAR_GLOBAL);
2327 1.281 rillig Var_Delete(".INCLUDEDFROMFILE", VAR_GLOBAL);
2328 1.44 aidan }
2329 1.44 aidan }
2330 1.44 aidan
2331 1.284 rillig /* Track the makefiles we read - so makefiles can set dependencies on them.
2332 1.284 rillig * Avoid adding anything more than once. */
2333 1.184 sjg static void
2334 1.184 sjg ParseTrackInput(const char *name)
2335 1.184 sjg {
2336 1.184 sjg char *fp = NULL;
2337 1.236 rillig
2338 1.244 rillig const char *old = Var_Value(MAKE_MAKEFILES, VAR_GLOBAL, &fp);
2339 1.184 sjg if (old) {
2340 1.244 rillig size_t name_len = strlen(name);
2341 1.244 rillig const char *ep = old + strlen(old) - name_len;
2342 1.184 sjg /* does it contain name? */
2343 1.184 sjg for (; old != NULL; old = strchr(old, ' ')) {
2344 1.184 sjg if (*old == ' ')
2345 1.184 sjg old++;
2346 1.206 sjg if (old >= ep)
2347 1.374 rillig break; /* cannot contain name */
2348 1.374 rillig if (memcmp(old, name, name_len) == 0 &&
2349 1.374 rillig (old[name_len] == '\0' || old[name_len] == ' '))
2350 1.184 sjg goto cleanup;
2351 1.184 sjg }
2352 1.184 sjg }
2353 1.374 rillig Var_Append(MAKE_MAKEFILES, name, VAR_GLOBAL);
2354 1.374 rillig cleanup:
2355 1.245 rillig bmake_free(fp);
2356 1.184 sjg }
2357 1.137 sjg
2358 1.44 aidan
2359 1.276 rillig /* Start Parsing from the given source.
2360 1.5 cgd *
2361 1.276 rillig * The given file is added to the includes stack. */
2362 1.5 cgd void
2363 1.170 dholland Parse_SetInput(const char *name, int line, int fd,
2364 1.374 rillig char *(*nextbuf)(void *, size_t *), void *arg)
2365 1.5 cgd {
2366 1.155 dsl char *buf;
2367 1.170 dholland size_t len;
2368 1.281 rillig Boolean fromForLoop = name == NULL;
2369 1.155 dsl
2370 1.281 rillig if (fromForLoop)
2371 1.127 dsl name = curFile->fname;
2372 1.139 dsl else
2373 1.184 sjg ParseTrackInput(name);
2374 1.127 dsl
2375 1.127 dsl if (DEBUG(PARSE))
2376 1.342 rillig debug_printf("%s: file %s, line %d, fd %d, nextbuf %s, arg %p\n",
2377 1.342 rillig __func__, name, line, fd,
2378 1.342 rillig nextbuf == loadedfile_nextbuf ? "loadedfile" : "other",
2379 1.342 rillig arg);
2380 1.127 dsl
2381 1.155 dsl if (fd == -1 && nextbuf == NULL)
2382 1.125 dsl /* sanity */
2383 1.125 dsl return;
2384 1.125 dsl
2385 1.132 dsl if (curFile != NULL)
2386 1.281 rillig /* Save existing file info */
2387 1.276 rillig Stack_Push(&includes, curFile);
2388 1.5 cgd
2389 1.125 dsl /* Allocate and fill in new structure */
2390 1.147 joerg curFile = bmake_malloc(sizeof *curFile);
2391 1.125 dsl
2392 1.125 dsl /*
2393 1.125 dsl * Once the previous state has been saved, we can get down to reading
2394 1.125 dsl * the new file. We set up the name of the file to be the absolute
2395 1.125 dsl * name of the include file so error messages refer to the right
2396 1.125 dsl * place.
2397 1.125 dsl */
2398 1.189 sjg curFile->fname = bmake_strdup(name);
2399 1.281 rillig curFile->fromForLoop = fromForLoop;
2400 1.125 dsl curFile->lineno = line;
2401 1.155 dsl curFile->first_lineno = line;
2402 1.155 dsl curFile->nextbuf = nextbuf;
2403 1.155 dsl curFile->nextbuf_arg = arg;
2404 1.170 dholland curFile->lf = NULL;
2405 1.212 sjg curFile->depending = doing_depend; /* restore this on EOF */
2406 1.170 dholland
2407 1.170 dholland assert(nextbuf != NULL);
2408 1.125 dsl
2409 1.170 dholland /* Get first block of input data */
2410 1.170 dholland buf = curFile->nextbuf(curFile->nextbuf_arg, &len);
2411 1.170 dholland if (buf == NULL) {
2412 1.246 rillig /* Was all a waste of time ... */
2413 1.189 sjg if (curFile->fname)
2414 1.189 sjg free(curFile->fname);
2415 1.170 dholland free(curFile);
2416 1.170 dholland return;
2417 1.125 dsl }
2418 1.170 dholland curFile->P_str = buf;
2419 1.170 dholland curFile->P_ptr = buf;
2420 1.374 rillig curFile->P_end = buf + len;
2421 1.5 cgd
2422 1.155 dsl curFile->cond_depth = Cond_save_depth();
2423 1.155 dsl ParseSetParseFile(name);
2424 1.5 cgd }
2425 1.5 cgd
2426 1.375 rillig /* Check if the directive is an include directive. */
2427 1.228 christos static Boolean
2428 1.298 rillig IsInclude(const char *dir, Boolean sysv)
2429 1.228 christos {
2430 1.298 rillig if (dir[0] == 's' || dir[0] == '-' || (dir[0] == 'd' && !sysv))
2431 1.298 rillig dir++;
2432 1.228 christos
2433 1.298 rillig if (strncmp(dir, "include", 7) != 0)
2434 1.228 christos return FALSE;
2435 1.228 christos
2436 1.248 rillig /* Space is not mandatory for BSD .include */
2437 1.298 rillig return !sysv || ch_isspace(dir[7]);
2438 1.228 christos }
2439 1.228 christos
2440 1.228 christos
2441 1.5 cgd #ifdef SYSVINCLUDE
2442 1.284 rillig /* Check if the line is a SYSV include directive. */
2443 1.228 christos static Boolean
2444 1.228 christos IsSysVInclude(const char *line)
2445 1.228 christos {
2446 1.228 christos const char *p;
2447 1.228 christos
2448 1.228 christos if (!IsInclude(line, TRUE))
2449 1.228 christos return FALSE;
2450 1.228 christos
2451 1.375 rillig /* Avoid interpreting a dependency line as an include */
2452 1.228 christos for (p = line; (p = strchr(p, ':')) != NULL;) {
2453 1.228 christos if (*++p == '\0') {
2454 1.228 christos /* end of line -> dependency */
2455 1.228 christos return FALSE;
2456 1.228 christos }
2457 1.290 rillig if (*p == ':' || ch_isspace(*p)) {
2458 1.228 christos /* :: operator or ': ' -> dependency */
2459 1.228 christos return FALSE;
2460 1.228 christos }
2461 1.228 christos }
2462 1.228 christos return TRUE;
2463 1.228 christos }
2464 1.228 christos
2465 1.284 rillig /* Push to another file. The line points to the word "include". */
2466 1.5 cgd static void
2467 1.84 wiz ParseTraditionalInclude(char *line)
2468 1.5 cgd {
2469 1.374 rillig char *cp; /* current position in file spec */
2470 1.374 rillig int done = 0;
2471 1.374 rillig int silent = line[0] != 'i';
2472 1.374 rillig char *file = line + (silent ? 8 : 7);
2473 1.374 rillig char *all_files;
2474 1.5 cgd
2475 1.341 rillig DEBUG2(PARSE, "%s: %s\n", __func__, file);
2476 1.111 ginsbach
2477 1.368 rillig pp_skip_whitespace(&file);
2478 1.5 cgd
2479 1.111 ginsbach /*
2480 1.111 ginsbach * Substitute for any variables in the file name before trying to
2481 1.111 ginsbach * find the thing.
2482 1.111 ginsbach */
2483 1.323 rillig (void)Var_Subst(file, VAR_CMD, VARE_WANTRES, &all_files);
2484 1.323 rillig /* TODO: handle errors */
2485 1.111 ginsbach
2486 1.5 cgd if (*file == '\0') {
2487 1.374 rillig Parse_Error(PARSE_FATAL, "Filename missing from \"include\"");
2488 1.224 riastrad goto out;
2489 1.5 cgd }
2490 1.5 cgd
2491 1.123 dsl for (file = all_files; !done; file = cp + 1) {
2492 1.123 dsl /* Skip to end of line or next whitespace */
2493 1.290 rillig for (cp = file; *cp && !ch_isspace(*cp); cp++)
2494 1.38 christos continue;
2495 1.38 christos
2496 1.38 christos if (*cp)
2497 1.38 christos *cp = '\0';
2498 1.38 christos else
2499 1.38 christos done = 1;
2500 1.38 christos
2501 1.210 sjg Parse_include_file(file, FALSE, FALSE, silent);
2502 1.5 cgd }
2503 1.224 riastrad out:
2504 1.123 dsl free(all_files);
2505 1.5 cgd }
2506 1.5 cgd #endif
2507 1.5 cgd
2508 1.183 sjg #ifdef GMAKEEXPORT
2509 1.375 rillig /* Parse "export <variable>=<value>", and actually export it. */
2510 1.182 christos static void
2511 1.182 christos ParseGmakeExport(char *line)
2512 1.182 christos {
2513 1.375 rillig char *variable = line + 6;
2514 1.374 rillig char *value;
2515 1.182 christos
2516 1.341 rillig DEBUG2(PARSE, "%s: %s\n", __func__, variable);
2517 1.182 christos
2518 1.368 rillig pp_skip_whitespace(&variable);
2519 1.182 christos
2520 1.182 christos for (value = variable; *value && *value != '='; value++)
2521 1.182 christos continue;
2522 1.182 christos
2523 1.182 christos if (*value != '=') {
2524 1.182 christos Parse_Error(PARSE_FATAL,
2525 1.284 rillig "Variable/Value missing from \"export\"");
2526 1.182 christos return;
2527 1.182 christos }
2528 1.374 rillig *value++ = '\0'; /* terminate variable */
2529 1.182 christos
2530 1.182 christos /*
2531 1.183 sjg * Expand the value before putting it in the environment.
2532 1.182 christos */
2533 1.323 rillig (void)Var_Subst(value, VAR_CMD, VARE_WANTRES, &value);
2534 1.323 rillig /* TODO: handle errors */
2535 1.323 rillig
2536 1.182 christos setenv(variable, value, 1);
2537 1.223 riastrad free(value);
2538 1.182 christos }
2539 1.182 christos #endif
2540 1.182 christos
2541 1.284 rillig /* Called when EOF is reached in the current file. If we were reading an
2542 1.284 rillig * include file, the includes stack is popped and things set up to go back
2543 1.284 rillig * to reading the previous file at the previous location.
2544 1.1 cgd *
2545 1.1 cgd * Results:
2546 1.376 rillig * TRUE to continue parsing, i.e. it had only reached the end of an
2547 1.376 rillig * included file, FALSE if the main file has been parsed completely.
2548 1.1 cgd */
2549 1.376 rillig static Boolean
2550 1.123 dsl ParseEOF(void)
2551 1.1 cgd {
2552 1.155 dsl char *ptr;
2553 1.170 dholland size_t len;
2554 1.170 dholland
2555 1.170 dholland assert(curFile->nextbuf != NULL);
2556 1.155 dsl
2557 1.210 sjg doing_depend = curFile->depending; /* restore this */
2558 1.170 dholland /* get next input buffer, if any */
2559 1.170 dholland ptr = curFile->nextbuf(curFile->nextbuf_arg, &len);
2560 1.170 dholland curFile->P_ptr = ptr;
2561 1.170 dholland curFile->P_str = ptr;
2562 1.170 dholland curFile->P_end = ptr + len;
2563 1.170 dholland curFile->lineno = curFile->first_lineno;
2564 1.170 dholland if (ptr != NULL) {
2565 1.170 dholland /* Iterate again */
2566 1.376 rillig return TRUE;
2567 1.155 dsl }
2568 1.155 dsl
2569 1.132 dsl /* Ensure the makefile (or loop) didn't have mismatched conditionals */
2570 1.132 dsl Cond_restore_depth(curFile->cond_depth);
2571 1.131 dsl
2572 1.170 dholland if (curFile->lf != NULL) {
2573 1.374 rillig loadedfile_destroy(curFile->lf);
2574 1.374 rillig curFile->lf = NULL;
2575 1.170 dholland }
2576 1.170 dholland
2577 1.125 dsl /* Dispose of curFile info */
2578 1.125 dsl /* Leak curFile->fname because all the gnodes have pointers to it */
2579 1.125 dsl free(curFile->P_str);
2580 1.125 dsl free(curFile);
2581 1.125 dsl
2582 1.276 rillig if (Stack_IsEmpty(&includes)) {
2583 1.258 rillig curFile = NULL;
2584 1.125 dsl /* We've run out of input */
2585 1.44 aidan Var_Delete(".PARSEDIR", VAR_GLOBAL);
2586 1.44 aidan Var_Delete(".PARSEFILE", VAR_GLOBAL);
2587 1.194 christos Var_Delete(".INCLUDEDFROMDIR", VAR_GLOBAL);
2588 1.194 christos Var_Delete(".INCLUDEDFROMFILE", VAR_GLOBAL);
2589 1.376 rillig return FALSE;
2590 1.1 cgd }
2591 1.1 cgd
2592 1.276 rillig curFile = Stack_Pop(&includes);
2593 1.341 rillig DEBUG2(PARSE, "ParseEOF: returning to file %s, line %d\n",
2594 1.341 rillig curFile->fname, curFile->lineno);
2595 1.127 dsl
2596 1.125 dsl ParseSetParseFile(curFile->fname);
2597 1.376 rillig return TRUE;
2598 1.1 cgd }
2599 1.1 cgd
2600 1.127 dsl #define PARSE_RAW 1
2601 1.127 dsl #define PARSE_SKIP 2
2602 1.127 dsl
2603 1.127 dsl static char *
2604 1.368 rillig ParseGetLine(int flags)
2605 1.5 cgd {
2606 1.125 dsl IFile *cf = curFile;
2607 1.127 dsl char *ptr;
2608 1.125 dsl char ch;
2609 1.127 dsl char *line;
2610 1.127 dsl char *line_end;
2611 1.127 dsl char *escaped;
2612 1.127 dsl char *comment;
2613 1.127 dsl char *tp;
2614 1.125 dsl
2615 1.127 dsl /* Loop through blank lines and comment lines */
2616 1.125 dsl for (;;) {
2617 1.127 dsl cf->lineno++;
2618 1.127 dsl line = cf->P_ptr;
2619 1.127 dsl ptr = line;
2620 1.127 dsl line_end = line;
2621 1.127 dsl escaped = NULL;
2622 1.127 dsl comment = NULL;
2623 1.127 dsl for (;;) {
2624 1.170 dholland if (cf->P_end != NULL && ptr == cf->P_end) {
2625 1.170 dholland /* end of buffer */
2626 1.170 dholland ch = 0;
2627 1.170 dholland break;
2628 1.170 dholland }
2629 1.127 dsl ch = *ptr;
2630 1.127 dsl if (ch == 0 || (ch == '\\' && ptr[1] == 0)) {
2631 1.127 dsl if (cf->P_end == NULL)
2632 1.127 dsl /* End of string (aka for loop) data */
2633 1.127 dsl break;
2634 1.190 sjg /* see if there is more we can parse */
2635 1.190 sjg while (ptr++ < cf->P_end) {
2636 1.190 sjg if ((ch = *ptr) == '\n') {
2637 1.190 sjg if (ptr > line && ptr[-1] == '\\')
2638 1.190 sjg continue;
2639 1.190 sjg Parse_Error(PARSE_WARNING,
2640 1.374 rillig "Zero byte read from file, "
2641 1.374 rillig "skipping rest of line.");
2642 1.190 sjg break;
2643 1.190 sjg }
2644 1.190 sjg }
2645 1.170 dholland if (cf->nextbuf != NULL) {
2646 1.170 dholland /*
2647 1.170 dholland * End of this buffer; return EOF and outer logic
2648 1.170 dholland * will get the next one. (eww)
2649 1.170 dholland */
2650 1.127 dsl break;
2651 1.127 dsl }
2652 1.170 dholland Parse_Error(PARSE_FATAL, "Zero byte read from file");
2653 1.170 dholland return NULL;
2654 1.127 dsl }
2655 1.127 dsl
2656 1.127 dsl if (ch == '\\') {
2657 1.127 dsl /* Don't treat next character as special, remember first one */
2658 1.127 dsl if (escaped == NULL)
2659 1.127 dsl escaped = ptr;
2660 1.127 dsl if (ptr[1] == '\n')
2661 1.127 dsl cf->lineno++;
2662 1.127 dsl ptr += 2;
2663 1.127 dsl line_end = ptr;
2664 1.127 dsl continue;
2665 1.127 dsl }
2666 1.127 dsl if (ch == '#' && comment == NULL) {
2667 1.127 dsl /* Remember first '#' for comment stripping */
2668 1.181 sjg /* Unless previous char was '[', as in modifier :[#] */
2669 1.181 sjg if (!(ptr > line && ptr[-1] == '['))
2670 1.181 sjg comment = line_end;
2671 1.127 dsl }
2672 1.127 dsl ptr++;
2673 1.125 dsl if (ch == '\n')
2674 1.127 dsl break;
2675 1.290 rillig if (!ch_isspace(ch))
2676 1.127 dsl /* We are not interested in trailing whitespace */
2677 1.127 dsl line_end = ptr;
2678 1.127 dsl }
2679 1.125 dsl
2680 1.127 dsl /* Save next 'to be processed' location */
2681 1.127 dsl cf->P_ptr = ptr;
2682 1.127 dsl
2683 1.127 dsl /* Check we have a non-comment, non-blank line */
2684 1.127 dsl if (line_end == line || comment == line) {
2685 1.127 dsl if (ch == 0)
2686 1.127 dsl /* At end of file */
2687 1.127 dsl return NULL;
2688 1.127 dsl /* Parse another line */
2689 1.125 dsl continue;
2690 1.127 dsl }
2691 1.125 dsl
2692 1.127 dsl /* We now have a line of data */
2693 1.127 dsl *line_end = 0;
2694 1.27 christos
2695 1.127 dsl if (flags & PARSE_RAW) {
2696 1.127 dsl /* Leave '\' (etc) in line buffer (eg 'for' lines) */
2697 1.127 dsl return line;
2698 1.127 dsl }
2699 1.5 cgd
2700 1.127 dsl if (flags & PARSE_SKIP) {
2701 1.127 dsl /* Completely ignore non-directives */
2702 1.127 dsl if (line[0] != '.')
2703 1.127 dsl continue;
2704 1.127 dsl /* We could do more of the .else/.elif/.endif checks here */
2705 1.127 dsl }
2706 1.127 dsl break;
2707 1.127 dsl }
2708 1.5 cgd
2709 1.127 dsl /* Brutally ignore anything after a non-escaped '#' in non-commands */
2710 1.127 dsl if (comment != NULL && line[0] != '\t') {
2711 1.127 dsl line_end = comment;
2712 1.127 dsl *line_end = 0;
2713 1.127 dsl }
2714 1.5 cgd
2715 1.127 dsl /* If we didn't see a '\\' then the in-situ data is fine */
2716 1.368 rillig if (escaped == NULL)
2717 1.127 dsl return line;
2718 1.5 cgd
2719 1.127 dsl /* Remove escapes from '\n' and '#' */
2720 1.127 dsl tp = ptr = escaped;
2721 1.127 dsl escaped = line;
2722 1.127 dsl for (; ; *tp++ = ch) {
2723 1.127 dsl ch = *ptr++;
2724 1.127 dsl if (ch != '\\') {
2725 1.127 dsl if (ch == 0)
2726 1.127 dsl break;
2727 1.127 dsl continue;
2728 1.127 dsl }
2729 1.5 cgd
2730 1.127 dsl ch = *ptr++;
2731 1.127 dsl if (ch == 0) {
2732 1.127 dsl /* Delete '\\' at end of buffer */
2733 1.127 dsl tp--;
2734 1.127 dsl break;
2735 1.127 dsl }
2736 1.27 christos
2737 1.130 dsl if (ch == '#' && line[0] != '\t')
2738 1.130 dsl /* Delete '\\' from before '#' on non-command lines */
2739 1.127 dsl continue;
2740 1.27 christos
2741 1.127 dsl if (ch != '\n') {
2742 1.127 dsl /* Leave '\\' in buffer for later */
2743 1.127 dsl *tp++ = '\\';
2744 1.127 dsl /* Make sure we don't delete an escaped ' ' from the line end */
2745 1.127 dsl escaped = tp + 1;
2746 1.127 dsl continue;
2747 1.127 dsl }
2748 1.27 christos
2749 1.203 joerg /* Escaped '\n' replace following whitespace with a single ' ' */
2750 1.203 joerg while (ptr[0] == ' ' || ptr[0] == '\t')
2751 1.203 joerg ptr++;
2752 1.203 joerg ch = ' ';
2753 1.127 dsl }
2754 1.27 christos
2755 1.127 dsl /* Delete any trailing spaces - eg from empty continuations */
2756 1.290 rillig while (tp > escaped && ch_isspace(tp[-1]))
2757 1.127 dsl tp--;
2758 1.27 christos
2759 1.127 dsl *tp = 0;
2760 1.5 cgd return line;
2761 1.5 cgd }
2762 1.1 cgd
2763 1.284 rillig /* Read an entire line from the input file. Called only by Parse_File.
2764 1.1 cgd *
2765 1.1 cgd * Results:
2766 1.284 rillig * A line without its newline.
2767 1.1 cgd *
2768 1.1 cgd * Side Effects:
2769 1.1 cgd * Only those associated with reading a character
2770 1.1 cgd */
2771 1.1 cgd static char *
2772 1.84 wiz ParseReadLine(void)
2773 1.1 cgd {
2774 1.338 rillig char *line; /* Result */
2775 1.338 rillig int lineno; /* Saved line # */
2776 1.338 rillig int rval;
2777 1.1 cgd
2778 1.5 cgd for (;;) {
2779 1.368 rillig line = ParseGetLine(0);
2780 1.127 dsl if (line == NULL)
2781 1.127 dsl return NULL;
2782 1.1 cgd
2783 1.127 dsl if (line[0] != '.')
2784 1.127 dsl return line;
2785 1.121 dsl
2786 1.121 dsl /*
2787 1.127 dsl * The line might be a conditional. Ask the conditional module
2788 1.127 dsl * about it and act accordingly
2789 1.121 dsl */
2790 1.302 rillig switch (Cond_EvalLine(line)) {
2791 1.127 dsl case COND_SKIP:
2792 1.127 dsl /* Skip to next conditional that evaluates to COND_PARSE. */
2793 1.127 dsl do {
2794 1.368 rillig line = ParseGetLine(PARSE_SKIP);
2795 1.302 rillig } while (line && Cond_EvalLine(line) != COND_PARSE);
2796 1.127 dsl if (line == NULL)
2797 1.121 dsl break;
2798 1.127 dsl continue;
2799 1.127 dsl case COND_PARSE:
2800 1.127 dsl continue;
2801 1.127 dsl case COND_INVALID: /* Not a conditional line */
2802 1.151 dsl /* Check for .for loops */
2803 1.151 dsl rval = For_Eval(line);
2804 1.151 dsl if (rval == 0)
2805 1.151 dsl /* Not a .for line */
2806 1.1 cgd break;
2807 1.151 dsl if (rval < 0)
2808 1.151 dsl /* Syntax error - error printed, ignore line */
2809 1.151 dsl continue;
2810 1.151 dsl /* Start of a .for loop */
2811 1.127 dsl lineno = curFile->lineno;
2812 1.151 dsl /* Accumulate loop lines until matching .endfor */
2813 1.121 dsl do {
2814 1.368 rillig line = ParseGetLine(PARSE_RAW);
2815 1.121 dsl if (line == NULL) {
2816 1.121 dsl Parse_Error(PARSE_FATAL,
2817 1.374 rillig "Unexpected end of file in for loop.");
2818 1.5 cgd break;
2819 1.121 dsl }
2820 1.151 dsl } while (For_Accum(line));
2821 1.127 dsl /* Stash each iteration as a new 'input file' */
2822 1.127 dsl For_Run(lineno);
2823 1.127 dsl /* Read next line from for-loop buffer */
2824 1.127 dsl continue;
2825 1.1 cgd }
2826 1.235 rillig return line;
2827 1.1 cgd }
2828 1.1 cgd }
2829 1.1 cgd
2830 1.331 rillig static void
2831 1.329 rillig FinishDependencyGroup(void)
2832 1.1 cgd {
2833 1.330 rillig if (targets != NULL) {
2834 1.371 rillig GNodeListNode *ln;
2835 1.371 rillig for (ln = targets->first; ln != NULL; ln = ln->next) {
2836 1.371 rillig GNode *gn = ln->datum;
2837 1.371 rillig
2838 1.371 rillig Suff_EndTransform(gn);
2839 1.371 rillig
2840 1.371 rillig /* Mark the target as already having commands if it does, to
2841 1.371 rillig * keep from having shell commands on multiple dependency lines. */
2842 1.371 rillig if (!Lst_IsEmpty(gn->commands))
2843 1.371 rillig gn->type |= OP_HAS_COMMANDS;
2844 1.371 rillig }
2845 1.371 rillig
2846 1.371 rillig Lst_Free(targets);
2847 1.336 rillig targets = NULL;
2848 1.1 cgd }
2849 1.1 cgd }
2850 1.27 christos
2851 1.327 rillig /* Add the command to each target from the current dependency spec. */
2852 1.326 rillig static void
2853 1.375 rillig ParseLine_ShellCommand(const char *p)
2854 1.326 rillig {
2855 1.375 rillig cpp_skip_whitespace(&p);
2856 1.375 rillig if (*p == '\0')
2857 1.327 rillig return; /* skip empty commands */
2858 1.327 rillig
2859 1.330 rillig if (targets == NULL) {
2860 1.375 rillig Parse_Error(PARSE_FATAL, "Unassociated shell command \"%s\"", p);
2861 1.327 rillig return;
2862 1.330 rillig }
2863 1.327 rillig
2864 1.327 rillig {
2865 1.375 rillig char *cmd = bmake_strdup(p);
2866 1.327 rillig GNodeListNode *ln;
2867 1.327 rillig
2868 1.327 rillig for (ln = targets->first; ln != NULL; ln = ln->next) {
2869 1.327 rillig GNode *gn = ln->datum;
2870 1.327 rillig ParseAddCmd(gn, cmd);
2871 1.327 rillig }
2872 1.326 rillig #ifdef CLEANUP
2873 1.327 rillig Lst_Append(targCmds, cmd);
2874 1.326 rillig #endif
2875 1.326 rillig }
2876 1.326 rillig }
2877 1.1 cgd
2878 1.379 rillig static Boolean
2879 1.379 rillig ParseDirective(char *line)
2880 1.379 rillig {
2881 1.379 rillig char *cp;
2882 1.379 rillig
2883 1.379 rillig if (*line == '.') {
2884 1.379 rillig /*
2885 1.379 rillig * Lines that begin with the special character may be
2886 1.379 rillig * include or undef directives.
2887 1.379 rillig * On the other hand they can be suffix rules (.c.o: ...)
2888 1.379 rillig * or just dependencies for filenames that start '.'.
2889 1.379 rillig */
2890 1.379 rillig cp = line + 1;
2891 1.379 rillig pp_skip_whitespace(&cp);
2892 1.379 rillig if (IsInclude(cp, FALSE)) {
2893 1.379 rillig ParseDoInclude(cp);
2894 1.379 rillig return TRUE;
2895 1.379 rillig }
2896 1.379 rillig if (strncmp(cp, "undef", 5) == 0) {
2897 1.379 rillig const char *varname;
2898 1.379 rillig cp += 5;
2899 1.379 rillig pp_skip_whitespace(&cp);
2900 1.379 rillig varname = cp;
2901 1.379 rillig for (; !ch_isspace(*cp) && *cp != '\0'; cp++)
2902 1.379 rillig continue;
2903 1.379 rillig *cp = '\0';
2904 1.379 rillig Var_Delete(varname, VAR_GLOBAL);
2905 1.379 rillig /* TODO: undefine all variables, not only the first */
2906 1.379 rillig /* TODO: use Str_Words, like everywhere else */
2907 1.379 rillig return TRUE;
2908 1.379 rillig } else if (strncmp(cp, "export", 6) == 0) {
2909 1.379 rillig cp += 6;
2910 1.379 rillig pp_skip_whitespace(&cp);
2911 1.379 rillig Var_Export(cp, TRUE);
2912 1.379 rillig return TRUE;
2913 1.379 rillig } else if (strncmp(cp, "unexport", 8) == 0) {
2914 1.379 rillig Var_UnExport(cp);
2915 1.379 rillig return TRUE;
2916 1.379 rillig } else if (strncmp(cp, "info", 4) == 0 ||
2917 1.379 rillig strncmp(cp, "error", 5) == 0 ||
2918 1.379 rillig strncmp(cp, "warning", 7) == 0) {
2919 1.379 rillig if (ParseMessage(cp))
2920 1.379 rillig return TRUE;
2921 1.379 rillig }
2922 1.379 rillig }
2923 1.379 rillig return FALSE;
2924 1.379 rillig }
2925 1.379 rillig
2926 1.379 rillig static Boolean
2927 1.379 rillig ParseVarassign(const char *line)
2928 1.379 rillig {
2929 1.379 rillig VarAssign var;
2930 1.379 rillig if (Parse_IsVar(line, &var)) {
2931 1.379 rillig FinishDependencyGroup();
2932 1.379 rillig Parse_DoVar(&var, VAR_GLOBAL);
2933 1.379 rillig return TRUE;
2934 1.379 rillig }
2935 1.379 rillig return FALSE;
2936 1.379 rillig }
2937 1.379 rillig
2938 1.380 rillig static char *
2939 1.380 rillig FindSemicolon(char *p)
2940 1.380 rillig {
2941 1.380 rillig int level = 0;
2942 1.380 rillig
2943 1.380 rillig for (; *p != '\0'; p++) {
2944 1.380 rillig if (*p == '\\' && p[1] != '\0') {
2945 1.380 rillig p++;
2946 1.380 rillig continue;
2947 1.380 rillig }
2948 1.380 rillig
2949 1.380 rillig if (*p == '$' && (p[1] == '(' || p[1] == '{')) {
2950 1.380 rillig level++;
2951 1.380 rillig continue;
2952 1.380 rillig }
2953 1.380 rillig
2954 1.380 rillig if (level > 0 && (*p == ')' || *p == '}')) {
2955 1.380 rillig level--;
2956 1.380 rillig continue;
2957 1.380 rillig }
2958 1.380 rillig
2959 1.380 rillig if (level == 0 && *p == ';') {
2960 1.380 rillig break;
2961 1.380 rillig }
2962 1.380 rillig }
2963 1.380 rillig return p;
2964 1.380 rillig }
2965 1.380 rillig
2966 1.379 rillig /* dependency -> target... op [source...]
2967 1.379 rillig * op -> ':' | '::' | '!' */
2968 1.379 rillig static void
2969 1.380 rillig ParseDependency(char *line)
2970 1.379 rillig {
2971 1.379 rillig VarEvalFlags eflags;
2972 1.379 rillig char *expanded_line;
2973 1.380 rillig const char *shellcmd = NULL;
2974 1.379 rillig
2975 1.379 rillig /*
2976 1.379 rillig * For some reason - probably to make the parser impossible -
2977 1.379 rillig * a ';' can be used to separate commands from dependencies.
2978 1.379 rillig * Attempt to avoid ';' inside substitution patterns.
2979 1.379 rillig */
2980 1.379 rillig {
2981 1.380 rillig char *semicolon = FindSemicolon(line);
2982 1.380 rillig if (*semicolon != '\0') {
2983 1.380 rillig /* Terminate the dependency list at the ';' */
2984 1.380 rillig *semicolon = '\0';
2985 1.380 rillig shellcmd = semicolon + 1;
2986 1.379 rillig }
2987 1.379 rillig }
2988 1.379 rillig
2989 1.379 rillig /*
2990 1.379 rillig * We now know it's a dependency line so it needs to have all
2991 1.379 rillig * variables expanded before being parsed.
2992 1.379 rillig *
2993 1.379 rillig * XXX: Ideally the dependency line would first be split into
2994 1.379 rillig * its left-hand side, dependency operator and right-hand side,
2995 1.379 rillig * and then each side would be expanded on its own. This would
2996 1.379 rillig * allow for the left-hand side to allow only defined variables
2997 1.379 rillig * and to allow variables on the right-hand side to be undefined
2998 1.379 rillig * as well.
2999 1.379 rillig *
3000 1.379 rillig * Parsing the line first would also prevent that targets
3001 1.379 rillig * generated from variable expressions are interpreted as the
3002 1.379 rillig * dependency operator, such as in "target${:U:} middle: source",
3003 1.379 rillig * in which the middle is interpreted as a source, not a target.
3004 1.379 rillig */
3005 1.379 rillig
3006 1.379 rillig /* In lint mode, allow undefined variables to appear in
3007 1.379 rillig * dependency lines.
3008 1.379 rillig *
3009 1.379 rillig * Ideally, only the right-hand side would allow undefined
3010 1.379 rillig * variables since it is common to have no dependencies.
3011 1.379 rillig * Having undefined variables on the left-hand side is more
3012 1.379 rillig * unusual though. Since both sides are expanded in a single
3013 1.379 rillig * pass, there is not much choice what to do here.
3014 1.379 rillig *
3015 1.379 rillig * In normal mode, it does not matter whether undefined
3016 1.379 rillig * variables are allowed or not since as of 2020-09-14,
3017 1.379 rillig * Var_Parse does not print any parse errors in such a case.
3018 1.379 rillig * It simply returns the special empty string var_Error,
3019 1.379 rillig * which cannot be detected in the result of Var_Subst. */
3020 1.379 rillig eflags = DEBUG(LINT) ? VARE_WANTRES : VARE_UNDEFERR | VARE_WANTRES;
3021 1.379 rillig (void)Var_Subst(line, VAR_CMD, eflags, &expanded_line);
3022 1.379 rillig /* TODO: handle errors */
3023 1.379 rillig
3024 1.379 rillig /* Need a fresh list for the target nodes */
3025 1.379 rillig if (targets != NULL)
3026 1.379 rillig Lst_Free(targets);
3027 1.379 rillig targets = Lst_Init();
3028 1.379 rillig
3029 1.379 rillig ParseDoDependency(expanded_line);
3030 1.379 rillig free(expanded_line);
3031 1.380 rillig
3032 1.380 rillig if (shellcmd != NULL)
3033 1.380 rillig ParseLine_ShellCommand(shellcmd);
3034 1.379 rillig }
3035 1.379 rillig
3036 1.381 rillig static void
3037 1.381 rillig ParseLine(char *line)
3038 1.381 rillig {
3039 1.381 rillig if (ParseDirective(line))
3040 1.381 rillig return;
3041 1.381 rillig
3042 1.381 rillig if (*line == '\t') {
3043 1.381 rillig ParseLine_ShellCommand(line + 1);
3044 1.381 rillig return;
3045 1.381 rillig }
3046 1.381 rillig
3047 1.381 rillig #ifdef SYSVINCLUDE
3048 1.381 rillig if (IsSysVInclude(line)) {
3049 1.381 rillig /*
3050 1.381 rillig * It's an S3/S5-style "include".
3051 1.381 rillig */
3052 1.381 rillig ParseTraditionalInclude(line);
3053 1.381 rillig return;
3054 1.381 rillig }
3055 1.381 rillig #endif
3056 1.381 rillig
3057 1.381 rillig #ifdef GMAKEEXPORT
3058 1.381 rillig if (strncmp(line, "export", 6) == 0 && ch_isspace(line[6]) &&
3059 1.381 rillig strchr(line, ':') == NULL) {
3060 1.381 rillig /*
3061 1.381 rillig * It's a Gmake "export".
3062 1.381 rillig */
3063 1.381 rillig ParseGmakeExport(line);
3064 1.381 rillig return;
3065 1.381 rillig }
3066 1.381 rillig #endif
3067 1.381 rillig
3068 1.381 rillig if (ParseVarassign(line))
3069 1.381 rillig return;
3070 1.381 rillig
3071 1.381 rillig FinishDependencyGroup();
3072 1.381 rillig
3073 1.381 rillig ParseDependency(line);
3074 1.381 rillig }
3075 1.381 rillig
3076 1.297 rillig /* Parse a top-level makefile into its component parts, incorporating them
3077 1.297 rillig * into the global dependency graph.
3078 1.1 cgd *
3079 1.84 wiz * Input:
3080 1.297 rillig * name The name of the file being read
3081 1.297 rillig * fd The open file to parse; will be closed at the end
3082 1.1 cgd */
3083 1.1 cgd void
3084 1.125 dsl Parse_File(const char *name, int fd)
3085 1.1 cgd {
3086 1.374 rillig char *line; /* the line we're working on */
3087 1.170 dholland struct loadedfile *lf;
3088 1.170 dholland
3089 1.170 dholland lf = loadfile(name, fd);
3090 1.1 cgd
3091 1.330 rillig assert(targets == NULL);
3092 1.1 cgd fatals = 0;
3093 1.44 aidan
3094 1.242 rillig if (name == NULL)
3095 1.242 rillig name = "(stdin)";
3096 1.170 dholland
3097 1.170 dholland Parse_SetInput(name, 0, -1, loadedfile_nextbuf, lf);
3098 1.170 dholland curFile->lf = lf;
3099 1.1 cgd
3100 1.1 cgd do {
3101 1.381 rillig while ((line = ParseReadLine()) != NULL) {
3102 1.341 rillig DEBUG2(PARSE, "ParseReadLine (%d): '%s'\n", curFile->lineno, line);
3103 1.381 rillig ParseLine(line);
3104 1.1 cgd }
3105 1.1 cgd /*
3106 1.27 christos * Reached EOF, but it may be just EOF of an include file...
3107 1.1 cgd */
3108 1.376 rillig } while (ParseEOF());
3109 1.1 cgd
3110 1.329 rillig FinishDependencyGroup();
3111 1.328 rillig
3112 1.1 cgd if (fatals) {
3113 1.163 sjg (void)fflush(stdout);
3114 1.63 christos (void)fprintf(stderr,
3115 1.374 rillig "%s: Fatal errors encountered -- cannot continue",
3116 1.374 rillig progname);
3117 1.161 sjg PrintOnError(NULL, NULL);
3118 1.103 christos exit(1);
3119 1.1 cgd }
3120 1.1 cgd }
3121 1.1 cgd
3122 1.383 rillig /* Initialize the parsing module. */
3123 1.5 cgd void
3124 1.84 wiz Parse_Init(void)
3125 1.1 cgd {
3126 1.152 dsl mainNode = NULL;
3127 1.252 rillig parseIncPath = Lst_Init();
3128 1.252 rillig sysIncPath = Lst_Init();
3129 1.252 rillig defIncPath = Lst_Init();
3130 1.276 rillig Stack_Init(&includes);
3131 1.45 mycroft #ifdef CLEANUP
3132 1.252 rillig targCmds = Lst_Init();
3133 1.45 mycroft #endif
3134 1.1 cgd }
3135 1.9 jtc
3136 1.383 rillig /* Clean up the parsing module. */
3137 1.9 jtc void
3138 1.84 wiz Parse_End(void)
3139 1.9 jtc {
3140 1.45 mycroft #ifdef CLEANUP
3141 1.268 rillig Lst_Destroy(targCmds, free);
3142 1.336 rillig assert(targets == NULL);
3143 1.268 rillig Lst_Destroy(defIncPath, Dir_Destroy);
3144 1.268 rillig Lst_Destroy(sysIncPath, Dir_Destroy);
3145 1.268 rillig Lst_Destroy(parseIncPath, Dir_Destroy);
3146 1.276 rillig assert(Stack_IsEmpty(&includes));
3147 1.276 rillig Stack_Done(&includes);
3148 1.45 mycroft #endif
3149 1.9 jtc }
3150 1.27 christos
3151 1.1 cgd
3152 1.1 cgd /*-
3153 1.1 cgd *-----------------------------------------------------------------------
3154 1.1 cgd * Parse_MainName --
3155 1.1 cgd * Return a Lst of the main target to create for main()'s sake. If
3156 1.1 cgd * no such target exists, we Punt with an obnoxious error message.
3157 1.1 cgd *
3158 1.1 cgd * Results:
3159 1.1 cgd * A Lst of the single node to create.
3160 1.1 cgd *
3161 1.1 cgd * Side Effects:
3162 1.1 cgd * None.
3163 1.1 cgd *
3164 1.1 cgd *-----------------------------------------------------------------------
3165 1.1 cgd */
3166 1.322 rillig GNodeList *
3167 1.84 wiz Parse_MainName(void)
3168 1.1 cgd {
3169 1.322 rillig GNodeList *mainList;
3170 1.1 cgd
3171 1.252 rillig mainList = Lst_Init();
3172 1.1 cgd
3173 1.152 dsl if (mainNode == NULL) {
3174 1.97 christos Punt("no target to make.");
3175 1.246 rillig /*NOTREACHED*/
3176 1.1 cgd } else if (mainNode->type & OP_DOUBLEDEP) {
3177 1.268 rillig Lst_Append(mainList, mainNode);
3178 1.268 rillig Lst_AppendAll(mainList, mainNode->cohorts);
3179 1.374 rillig } else
3180 1.268 rillig Lst_Append(mainList, mainNode);
3181 1.81 pk Var_Append(".TARGETS", mainNode->name, VAR_GLOBAL);
3182 1.235 rillig return mainList;
3183 1.59 christos }
3184