parse.c revision 1.705 1 1.705 rillig /* $NetBSD: parse.c,v 1.705 2023/08/19 10:52:13 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.402 rillig /*
72 1.402 rillig * Parsing of makefiles.
73 1.402 rillig *
74 1.402 rillig * Parse_File is the main entry point and controls most of the other
75 1.402 rillig * functions in this module.
76 1.1 cgd *
77 1.1 cgd * Interface:
78 1.402 rillig * Parse_Init Initialize the module
79 1.338 rillig *
80 1.383 rillig * Parse_End Clean up the module
81 1.338 rillig *
82 1.402 rillig * Parse_File Parse a top-level makefile. Included files are
83 1.537 rillig * handled by IncludeFile instead.
84 1.402 rillig *
85 1.609 rillig * Parse_VarAssign
86 1.609 rillig * Try to parse the given line as a variable assignment.
87 1.609 rillig * Used by MainParseArgs to determine if an argument is
88 1.609 rillig * a target or a variable assignment. Used internally
89 1.609 rillig * for pretty much the same thing.
90 1.402 rillig *
91 1.402 rillig * Parse_Error Report a parse error, a warning or an informational
92 1.402 rillig * message.
93 1.338 rillig *
94 1.697 rillig * Parse_MainName Populate the list of targets to create.
95 1.1 cgd */
96 1.1 cgd
97 1.170 dholland #include <sys/types.h>
98 1.171 dholland #include <sys/stat.h>
99 1.84 wiz #include <errno.h>
100 1.5 cgd #include <stdarg.h>
101 1.84 wiz
102 1.1 cgd #include "make.h"
103 1.5 cgd #include "dir.h"
104 1.5 cgd #include "job.h"
105 1.1 cgd #include "pathnames.h"
106 1.1 cgd
107 1.303 rillig /* "@(#)parse.c 8.3 (Berkeley) 3/19/94" */
108 1.705 rillig MAKE_RCSID("$NetBSD: parse.c,v 1.705 2023/08/19 10:52:13 rillig Exp $");
109 1.700 rillig
110 1.700 rillig /* Detects a multiple-inclusion guard in a makefile. */
111 1.700 rillig typedef enum {
112 1.700 rillig GS_START, /* at the beginning of the file */
113 1.700 rillig GS_COND, /* after the guard condition */
114 1.700 rillig GS_DONE, /* after the closing .endif */
115 1.700 rillig GS_NO /* the file is not guarded */
116 1.700 rillig } GuardState;
117 1.166 dholland
118 1.1 cgd /*
119 1.627 rillig * A file being read.
120 1.1 cgd */
121 1.627 rillig typedef struct IncludedFile {
122 1.576 rillig FStr name; /* absolute or relative to the cwd */
123 1.661 rillig unsigned lineno; /* 1-based */
124 1.661 rillig unsigned readLines; /* the number of physical lines that have
125 1.639 rillig * been read from the file */
126 1.661 rillig unsigned forHeadLineno; /* 1-based */
127 1.661 rillig unsigned forBodyReadLines; /* the number of physical lines that have
128 1.627 rillig * been read from the file above the body of
129 1.639 rillig * the .for loop */
130 1.687 rillig unsigned int condMinDepth; /* depth of nested 'if' directives, at the
131 1.687 rillig * beginning of the file */
132 1.618 rillig bool depending; /* state of doing_depend on EOF */
133 1.469 rillig
134 1.618 rillig Buffer buf; /* the file's content or the body of the .for
135 1.667 rillig * loop; either empty or ends with '\n' */
136 1.704 rillig char *buf_ptr; /* next char to be read from buf */
137 1.571 rillig char *buf_end; /* buf_end[-1] == '\n' */
138 1.469 rillig
139 1.702 rillig GuardState guardState;
140 1.702 rillig Guard *guard;
141 1.700 rillig
142 1.616 rillig struct ForLoop *forLoop;
143 1.627 rillig } IncludedFile;
144 1.1 cgd
145 1.628 rillig /* Special attributes for target nodes. */
146 1.386 rillig typedef enum ParseSpecial {
147 1.469 rillig SP_ATTRIBUTE, /* Generic attribute */
148 1.469 rillig SP_BEGIN, /* .BEGIN */
149 1.469 rillig SP_DEFAULT, /* .DEFAULT */
150 1.469 rillig SP_DELETE_ON_ERROR, /* .DELETE_ON_ERROR */
151 1.469 rillig SP_END, /* .END */
152 1.469 rillig SP_ERROR, /* .ERROR */
153 1.469 rillig SP_IGNORE, /* .IGNORE */
154 1.469 rillig SP_INCLUDES, /* .INCLUDES; not mentioned in the manual page */
155 1.469 rillig SP_INTERRUPT, /* .INTERRUPT */
156 1.469 rillig SP_LIBS, /* .LIBS; not mentioned in the manual page */
157 1.589 rillig SP_MAIN, /* .MAIN and no user-specified targets to make */
158 1.469 rillig SP_META, /* .META */
159 1.469 rillig SP_MFLAGS, /* .MFLAGS or .MAKEFLAGS */
160 1.469 rillig SP_NOMETA, /* .NOMETA */
161 1.469 rillig SP_NOMETA_CMP, /* .NOMETA_CMP */
162 1.469 rillig SP_NOPATH, /* .NOPATH */
163 1.691 sjg SP_NOREADONLY, /* .NOREADONLY */
164 1.469 rillig SP_NOT, /* Not special */
165 1.469 rillig SP_NOTPARALLEL, /* .NOTPARALLEL or .NO_PARALLEL */
166 1.469 rillig SP_NULL, /* .NULL; not mentioned in the manual page */
167 1.469 rillig SP_OBJDIR, /* .OBJDIR */
168 1.469 rillig SP_ORDER, /* .ORDER */
169 1.469 rillig SP_PARALLEL, /* .PARALLEL; not mentioned in the manual page */
170 1.469 rillig SP_PATH, /* .PATH or .PATH.suffix */
171 1.469 rillig SP_PHONY, /* .PHONY */
172 1.48 sjg #ifdef POSIX
173 1.469 rillig SP_POSIX, /* .POSIX; not mentioned in the manual page */
174 1.48 sjg #endif
175 1.469 rillig SP_PRECIOUS, /* .PRECIOUS */
176 1.691 sjg SP_READONLY, /* .READONLY */
177 1.469 rillig SP_SHELL, /* .SHELL */
178 1.469 rillig SP_SILENT, /* .SILENT */
179 1.469 rillig SP_SINGLESHELL, /* .SINGLESHELL; not mentioned in the manual page */
180 1.469 rillig SP_STALE, /* .STALE */
181 1.469 rillig SP_SUFFIXES, /* .SUFFIXES */
182 1.692 sjg SP_SYSPATH, /* .SYSPATH */
183 1.469 rillig SP_WAIT /* .WAIT */
184 1.1 cgd } ParseSpecial;
185 1.1 cgd
186 1.368 rillig typedef List SearchPathList;
187 1.392 rillig typedef ListNode SearchPathListNode;
188 1.368 rillig
189 1.656 sjg
190 1.656 sjg typedef enum VarAssignOp {
191 1.656 sjg VAR_NORMAL, /* = */
192 1.656 sjg VAR_APPEND, /* += */
193 1.656 sjg VAR_DEFAULT, /* ?= */
194 1.656 sjg VAR_SUBST, /* := */
195 1.656 sjg VAR_SHELL /* != or :sh= */
196 1.656 sjg } VarAssignOp;
197 1.656 sjg
198 1.656 sjg typedef struct VarAssign {
199 1.656 sjg char *varname; /* unexpanded */
200 1.656 sjg VarAssignOp op;
201 1.656 sjg const char *value; /* unexpanded */
202 1.656 sjg } VarAssign;
203 1.656 sjg
204 1.656 sjg static bool Parse_IsVar(const char *, VarAssign *);
205 1.658 rillig static void Parse_Var(VarAssign *, GNode *);
206 1.656 sjg
207 1.166 dholland /*
208 1.631 rillig * The target to be made if no targets are specified in the command line.
209 1.631 rillig * This is the first target defined in any of the makefiles.
210 1.166 dholland */
211 1.631 rillig GNode *mainNode;
212 1.166 dholland
213 1.524 rillig /*
214 1.524 rillig * During parsing, the targets from the left-hand side of the currently
215 1.415 rillig * active dependency line, or NULL if the current line does not belong to a
216 1.415 rillig * dependency line, for example because it is a variable assignment.
217 1.318 rillig *
218 1.524 rillig * See unit-tests/deptgt.mk, keyword "parse.c:targets".
219 1.524 rillig */
220 1.322 rillig static GNodeList *targets;
221 1.166 dholland
222 1.166 dholland #ifdef CLEANUP
223 1.524 rillig /*
224 1.524 rillig * All shell commands for all targets, in no particular order and possibly
225 1.372 rillig * with duplicates. Kept in a separate list since the commands from .USE or
226 1.372 rillig * .USEBEFORE nodes are shared with other GNodes, thereby giving up the
227 1.524 rillig * easily understandable ownership over the allocated strings.
228 1.524 rillig */
229 1.461 rillig static StringList targCmds = LST_INIT;
230 1.166 dholland #endif
231 1.166 dholland
232 1.166 dholland /*
233 1.152 dsl * Predecessor node for handling .ORDER. Initialized to NULL when .ORDER
234 1.628 rillig * is seen, then set to each successive source on the line.
235 1.1 cgd */
236 1.407 rillig static GNode *order_pred;
237 1.1 cgd
238 1.561 rillig static int parseErrors = 0;
239 1.166 dholland
240 1.166 dholland /*
241 1.532 rillig * The include chain of makefiles. At index 0 is the top-level makefile from
242 1.532 rillig * the command line, followed by the included files or .for loops, up to and
243 1.532 rillig * including the current file.
244 1.532 rillig *
245 1.532 rillig * See PrintStackTrace for how to interpret the data.
246 1.319 rillig */
247 1.627 rillig static Vector /* of IncludedFile */ includes;
248 1.400 rillig
249 1.549 rillig SearchPath *parseIncPath; /* directories for "..." includes */
250 1.549 rillig SearchPath *sysIncPath; /* directories for <...> includes */
251 1.414 rillig SearchPath *defSysIncPath; /* default for sysIncPath */
252 1.166 dholland
253 1.1 cgd /*
254 1.1 cgd * The parseKeywords table is searched using binary search when deciding
255 1.697 rillig * if a target or source is special.
256 1.1 cgd */
257 1.168 dholland static const struct {
258 1.590 rillig const char name[17];
259 1.590 rillig ParseSpecial special; /* when used as a target */
260 1.590 rillig GNodeType targetAttr; /* when used as a source */
261 1.1 cgd } parseKeywords[] = {
262 1.466 rillig { ".BEGIN", SP_BEGIN, OP_NONE },
263 1.466 rillig { ".DEFAULT", SP_DEFAULT, OP_NONE },
264 1.466 rillig { ".DELETE_ON_ERROR", SP_DELETE_ON_ERROR, OP_NONE },
265 1.466 rillig { ".END", SP_END, OP_NONE },
266 1.466 rillig { ".ERROR", SP_ERROR, OP_NONE },
267 1.404 rillig { ".EXEC", SP_ATTRIBUTE, OP_EXEC },
268 1.404 rillig { ".IGNORE", SP_IGNORE, OP_IGNORE },
269 1.466 rillig { ".INCLUDES", SP_INCLUDES, OP_NONE },
270 1.466 rillig { ".INTERRUPT", SP_INTERRUPT, OP_NONE },
271 1.404 rillig { ".INVISIBLE", SP_ATTRIBUTE, OP_INVISIBLE },
272 1.404 rillig { ".JOIN", SP_ATTRIBUTE, OP_JOIN },
273 1.466 rillig { ".LIBS", SP_LIBS, OP_NONE },
274 1.404 rillig { ".MADE", SP_ATTRIBUTE, OP_MADE },
275 1.466 rillig { ".MAIN", SP_MAIN, OP_NONE },
276 1.404 rillig { ".MAKE", SP_ATTRIBUTE, OP_MAKE },
277 1.466 rillig { ".MAKEFLAGS", SP_MFLAGS, OP_NONE },
278 1.404 rillig { ".META", SP_META, OP_META },
279 1.466 rillig { ".MFLAGS", SP_MFLAGS, OP_NONE },
280 1.404 rillig { ".NOMETA", SP_NOMETA, OP_NOMETA },
281 1.404 rillig { ".NOMETA_CMP", SP_NOMETA_CMP, OP_NOMETA_CMP },
282 1.404 rillig { ".NOPATH", SP_NOPATH, OP_NOPATH },
283 1.691 sjg { ".NOREADONLY", SP_NOREADONLY, OP_NONE },
284 1.404 rillig { ".NOTMAIN", SP_ATTRIBUTE, OP_NOTMAIN },
285 1.466 rillig { ".NOTPARALLEL", SP_NOTPARALLEL, OP_NONE },
286 1.466 rillig { ".NO_PARALLEL", SP_NOTPARALLEL, OP_NONE },
287 1.466 rillig { ".NULL", SP_NULL, OP_NONE },
288 1.466 rillig { ".OBJDIR", SP_OBJDIR, OP_NONE },
289 1.404 rillig { ".OPTIONAL", SP_ATTRIBUTE, OP_OPTIONAL },
290 1.466 rillig { ".ORDER", SP_ORDER, OP_NONE },
291 1.466 rillig { ".PARALLEL", SP_PARALLEL, OP_NONE },
292 1.466 rillig { ".PATH", SP_PATH, OP_NONE },
293 1.404 rillig { ".PHONY", SP_PHONY, OP_PHONY },
294 1.48 sjg #ifdef POSIX
295 1.466 rillig { ".POSIX", SP_POSIX, OP_NONE },
296 1.48 sjg #endif
297 1.404 rillig { ".PRECIOUS", SP_PRECIOUS, OP_PRECIOUS },
298 1.691 sjg { ".READONLY", SP_READONLY, OP_NONE },
299 1.404 rillig { ".RECURSIVE", SP_ATTRIBUTE, OP_MAKE },
300 1.466 rillig { ".SHELL", SP_SHELL, OP_NONE },
301 1.404 rillig { ".SILENT", SP_SILENT, OP_SILENT },
302 1.466 rillig { ".SINGLESHELL", SP_SINGLESHELL, OP_NONE },
303 1.466 rillig { ".STALE", SP_STALE, OP_NONE },
304 1.466 rillig { ".SUFFIXES", SP_SUFFIXES, OP_NONE },
305 1.692 sjg { ".SYSPATH", SP_SYSPATH, OP_NONE },
306 1.404 rillig { ".USE", SP_ATTRIBUTE, OP_USE },
307 1.404 rillig { ".USEBEFORE", SP_ATTRIBUTE, OP_USEBEFORE },
308 1.466 rillig { ".WAIT", SP_WAIT, OP_NONE },
309 1.1 cgd };
310 1.1 cgd
311 1.669 rillig enum PosixState posix_state = PS_NOT_YET;
312 1.170 dholland
313 1.702 rillig static HashTable /* full file name -> Guard */ guards;
314 1.700 rillig
315 1.627 rillig static IncludedFile *
316 1.618 rillig GetInclude(size_t i)
317 1.618 rillig {
318 1.686 rillig assert(i < includes.len);
319 1.618 rillig return Vector_Get(&includes, i);
320 1.618 rillig }
321 1.618 rillig
322 1.697 rillig /* The makefile that is currently being read. */
323 1.627 rillig static IncludedFile *
324 1.618 rillig CurFile(void)
325 1.618 rillig {
326 1.618 rillig return GetInclude(includes.len - 1);
327 1.618 rillig }
328 1.618 rillig
329 1.687 rillig unsigned int
330 1.687 rillig CurFile_CondMinDepth(void)
331 1.687 rillig {
332 1.687 rillig return CurFile()->condMinDepth;
333 1.687 rillig }
334 1.687 rillig
335 1.616 rillig static Buffer
336 1.675 rillig LoadFile(const char *path, int fd)
337 1.414 rillig {
338 1.522 rillig ssize_t n;
339 1.522 rillig Buffer buf;
340 1.612 rillig size_t bufSize;
341 1.612 rillig struct stat st;
342 1.414 rillig
343 1.612 rillig bufSize = fstat(fd, &st) == 0 && S_ISREG(st.st_mode) &&
344 1.634 rillig st.st_size > 0 && st.st_size < 1024 * 1024 * 1024
345 1.612 rillig ? (size_t)st.st_size : 1024;
346 1.612 rillig Buf_InitSize(&buf, bufSize);
347 1.170 dholland
348 1.428 rillig for (;;) {
349 1.522 rillig if (buf.len == buf.cap) {
350 1.634 rillig if (buf.cap >= 512 * 1024 * 1024) {
351 1.221 riastrad Error("%s: file too large", path);
352 1.518 rillig exit(2); /* Not 1 so -q can distinguish error */
353 1.221 riastrad }
354 1.523 rillig Buf_Expand(&buf);
355 1.170 dholland }
356 1.522 rillig assert(buf.len < buf.cap);
357 1.522 rillig n = read(fd, buf.data + buf.len, buf.cap - buf.len);
358 1.522 rillig if (n < 0) {
359 1.170 dholland Error("%s: read error: %s", path, strerror(errno));
360 1.518 rillig exit(2); /* Not 1 so -q can distinguish error */
361 1.170 dholland }
362 1.522 rillig if (n == 0)
363 1.170 dholland break;
364 1.430 rillig
365 1.522 rillig buf.len += (size_t)n;
366 1.170 dholland }
367 1.522 rillig assert(buf.len <= buf.cap);
368 1.170 dholland
369 1.522 rillig if (!Buf_EndsWith(&buf, '\n'))
370 1.522 rillig Buf_AddByte(&buf, '\n');
371 1.170 dholland
372 1.630 rillig return buf; /* may not be null-terminated */
373 1.170 dholland }
374 1.170 dholland
375 1.659 rillig /*
376 1.659 rillig * Print the current chain of .include and .for directives. In Parse_Fatal
377 1.659 rillig * or other functions that already print the location, includingInnermost
378 1.659 rillig * would be redundant, but in other cases like Error or Fatal it needs to be
379 1.659 rillig * included.
380 1.659 rillig */
381 1.659 rillig void
382 1.659 rillig PrintStackTrace(bool includingInnermost)
383 1.532 rillig {
384 1.627 rillig const IncludedFile *entries;
385 1.532 rillig size_t i, n;
386 1.532 rillig
387 1.532 rillig n = includes.len;
388 1.532 rillig if (n == 0)
389 1.532 rillig return;
390 1.643 rillig
391 1.686 rillig entries = GetInclude(0);
392 1.659 rillig if (!includingInnermost && entries[n - 1].forLoop == NULL)
393 1.643 rillig n--; /* already in the diagnostic */
394 1.532 rillig
395 1.532 rillig for (i = n; i-- > 0;) {
396 1.627 rillig const IncludedFile *entry = entries + i;
397 1.576 rillig const char *fname = entry->name.str;
398 1.532 rillig char dirbuf[MAXPATHLEN + 1];
399 1.532 rillig
400 1.698 rillig if (fname[0] != '/' && strcmp(fname, "(stdin)") != 0) {
401 1.698 rillig const char *realPath = realpath(fname, dirbuf);
402 1.698 rillig if (realPath != NULL)
403 1.698 rillig fname = realPath;
404 1.698 rillig }
405 1.532 rillig
406 1.643 rillig if (entry->forLoop != NULL) {
407 1.644 rillig char *details = ForLoop_Details(entry->forLoop);
408 1.661 rillig debug_printf("\tin .for loop from %s:%u with %s\n",
409 1.644 rillig fname, entry->forHeadLineno, details);
410 1.644 rillig free(details);
411 1.646 rillig } else if (i + 1 < n && entries[i + 1].forLoop != NULL) {
412 1.646 rillig /* entry->lineno is not a useful line number */
413 1.646 rillig } else
414 1.661 rillig debug_printf("\tin %s:%u\n", fname, entry->lineno);
415 1.532 rillig }
416 1.532 rillig }
417 1.77 christos
418 1.279 rillig /* Check if the current character is escaped on the current line. */
419 1.553 rillig static bool
420 1.602 rillig IsEscaped(const char *line, const char *p)
421 1.77 christos {
422 1.628 rillig bool escaped = false;
423 1.594 rillig while (p > line && *--p == '\\')
424 1.628 rillig escaped = !escaped;
425 1.628 rillig return escaped;
426 1.77 christos }
427 1.77 christos
428 1.524 rillig /*
429 1.704 rillig * Add the filename and lineno to the GNode so that we remember where its
430 1.704 rillig * last command was added or where it was mentioned in a .depend file.
431 1.524 rillig */
432 1.278 rillig static void
433 1.562 rillig RememberLocation(GNode *gn)
434 1.278 rillig {
435 1.627 rillig IncludedFile *curFile = CurFile();
436 1.576 rillig gn->fname = Str_Intern(curFile->name.str);
437 1.639 rillig gn->lineno = curFile->lineno;
438 1.278 rillig }
439 1.278 rillig
440 1.524 rillig /*
441 1.524 rillig * Look in the table of keywords for one matching the given string.
442 1.524 rillig * Return the index of the keyword, or -1 if it isn't there.
443 1.524 rillig */
444 1.1 cgd static int
445 1.602 rillig FindKeyword(const char *str)
446 1.1 cgd {
447 1.469 rillig int start = 0;
448 1.469 rillig int end = sizeof parseKeywords / sizeof parseKeywords[0] - 1;
449 1.1 cgd
450 1.611 rillig while (start <= end) {
451 1.469 rillig int curr = start + (end - start) / 2;
452 1.469 rillig int diff = strcmp(str, parseKeywords[curr].name);
453 1.469 rillig
454 1.469 rillig if (diff == 0)
455 1.469 rillig return curr;
456 1.469 rillig if (diff < 0)
457 1.469 rillig end = curr - 1;
458 1.469 rillig else
459 1.469 rillig start = curr + 1;
460 1.611 rillig }
461 1.430 rillig
462 1.469 rillig return -1;
463 1.1 cgd }
464 1.1 cgd
465 1.660 rillig void
466 1.680 rillig PrintLocation(FILE *f, bool useVars, const GNode *gn)
467 1.291 rillig {
468 1.469 rillig char dirbuf[MAXPATHLEN + 1];
469 1.505 rillig FStr dir, base;
470 1.680 rillig const char *fname;
471 1.680 rillig unsigned lineno;
472 1.680 rillig
473 1.680 rillig if (gn != NULL) {
474 1.680 rillig fname = gn->fname;
475 1.680 rillig lineno = gn->lineno;
476 1.680 rillig } else if (includes.len > 0) {
477 1.680 rillig IncludedFile *curFile = CurFile();
478 1.680 rillig fname = curFile->name.str;
479 1.680 rillig lineno = curFile->lineno;
480 1.680 rillig } else
481 1.680 rillig return;
482 1.291 rillig
483 1.653 rillig if (!useVars || fname[0] == '/' || strcmp(fname, "(stdin)") == 0) {
484 1.661 rillig (void)fprintf(f, "\"%s\" line %u: ", fname, lineno);
485 1.299 rillig return;
486 1.299 rillig }
487 1.291 rillig
488 1.548 rillig dir = Var_Value(SCOPE_GLOBAL, ".PARSEDIR");
489 1.505 rillig if (dir.str == NULL)
490 1.505 rillig dir.str = ".";
491 1.505 rillig if (dir.str[0] != '/')
492 1.505 rillig dir.str = realpath(dir.str, dirbuf);
493 1.505 rillig
494 1.548 rillig base = Var_Value(SCOPE_GLOBAL, ".PARSEFILE");
495 1.505 rillig if (base.str == NULL)
496 1.505 rillig base.str = str_basename(fname);
497 1.505 rillig
498 1.661 rillig (void)fprintf(f, "\"%s/%s\" line %u: ", dir.str, base.str, lineno);
499 1.505 rillig
500 1.505 rillig FStr_Done(&base);
501 1.505 rillig FStr_Done(&dir);
502 1.291 rillig }
503 1.291 rillig
504 1.680 rillig static void MAKE_ATTR_PRINTFLIKE(5, 0)
505 1.680 rillig ParseVErrorInternal(FILE *f, bool useVars, const GNode *gn,
506 1.664 rillig ParseErrorLevel level, const char *fmt, va_list ap)
507 1.38 christos {
508 1.553 rillig static bool fatal_warning_error_printed = false;
509 1.56 christos
510 1.148 sjg (void)fprintf(f, "%s: ", progname);
511 1.63 christos
512 1.680 rillig PrintLocation(f, useVars, gn);
513 1.664 rillig if (level == PARSE_WARNING)
514 1.127 dsl (void)fprintf(f, "warning: ");
515 1.127 dsl (void)vfprintf(f, fmt, ap);
516 1.127 dsl (void)fprintf(f, "\n");
517 1.127 dsl (void)fflush(f);
518 1.300 rillig
519 1.664 rillig if (level == PARSE_FATAL)
520 1.621 rillig parseErrors++;
521 1.664 rillig if (level == PARSE_WARNING && opts.parseWarnFatal) {
522 1.621 rillig if (!fatal_warning_error_printed) {
523 1.621 rillig Error("parsing warnings being treated as errors");
524 1.621 rillig fatal_warning_error_printed = true;
525 1.621 rillig }
526 1.621 rillig parseErrors++;
527 1.56 christos }
528 1.532 rillig
529 1.642 rillig if (DEBUG(PARSE))
530 1.659 rillig PrintStackTrace(false);
531 1.38 christos }
532 1.38 christos
533 1.680 rillig static void MAKE_ATTR_PRINTFLIKE(3, 4)
534 1.680 rillig ParseErrorInternal(const GNode *gn,
535 1.664 rillig ParseErrorLevel level, const char *fmt, ...)
536 1.203 joerg {
537 1.203 joerg va_list ap;
538 1.203 joerg
539 1.441 rillig (void)fflush(stdout);
540 1.203 joerg va_start(ap, fmt);
541 1.680 rillig ParseVErrorInternal(stderr, false, gn, level, fmt, ap);
542 1.203 joerg va_end(ap);
543 1.203 joerg
544 1.622 rillig if (opts.debug_file != stdout && opts.debug_file != stderr) {
545 1.203 joerg va_start(ap, fmt);
546 1.680 rillig ParseVErrorInternal(opts.debug_file, false, gn,
547 1.664 rillig level, fmt, ap);
548 1.203 joerg va_end(ap);
549 1.203 joerg }
550 1.203 joerg }
551 1.203 joerg
552 1.524 rillig /*
553 1.524 rillig * Print a parse error message, including location information.
554 1.441 rillig *
555 1.441 rillig * If the level is PARSE_FATAL, continue parsing until the end of the
556 1.441 rillig * current top-level makefile, then exit (see Parse_File).
557 1.38 christos *
558 1.524 rillig * Fmt is given without a trailing newline.
559 1.524 rillig */
560 1.1 cgd void
561 1.664 rillig Parse_Error(ParseErrorLevel level, const char *fmt, ...)
562 1.1 cgd {
563 1.1 cgd va_list ap;
564 1.156 dsl
565 1.633 rillig (void)fflush(stdout);
566 1.156 dsl va_start(ap, fmt);
567 1.680 rillig ParseVErrorInternal(stderr, true, NULL, level, fmt, ap);
568 1.1 cgd va_end(ap);
569 1.127 dsl
570 1.622 rillig if (opts.debug_file != stdout && opts.debug_file != stderr) {
571 1.127 dsl va_start(ap, fmt);
572 1.680 rillig ParseVErrorInternal(opts.debug_file, true, NULL,
573 1.664 rillig level, fmt, ap);
574 1.127 dsl va_end(ap);
575 1.127 dsl }
576 1.1 cgd }
577 1.1 cgd
578 1.161 sjg
579 1.524 rillig /*
580 1.602 rillig * Handle an .info, .warning or .error directive. For an .error directive,
581 1.602 rillig * exit immediately.
582 1.524 rillig */
583 1.503 rillig static void
584 1.602 rillig HandleMessage(ParseErrorLevel level, const char *levelName, const char *umsg)
585 1.161 sjg {
586 1.475 rillig char *xmsg;
587 1.469 rillig
588 1.503 rillig if (umsg[0] == '\0') {
589 1.503 rillig Parse_Error(PARSE_FATAL, "Missing argument for \".%s\"",
590 1.503 rillig levelName);
591 1.503 rillig return;
592 1.503 rillig }
593 1.469 rillig
594 1.694 rillig xmsg = Var_Subst(umsg, SCOPE_CMDLINE, VARE_WANTRES);
595 1.469 rillig /* TODO: handle errors */
596 1.469 rillig
597 1.475 rillig Parse_Error(level, "%s", xmsg);
598 1.475 rillig free(xmsg);
599 1.469 rillig
600 1.475 rillig if (level == PARSE_FATAL) {
601 1.655 rillig PrintOnError(NULL, "\n");
602 1.469 rillig exit(1);
603 1.469 rillig }
604 1.161 sjg }
605 1.161 sjg
606 1.524 rillig /*
607 1.630 rillig * Add the child to the parent's children, and for non-special targets, vice
608 1.630 rillig * versa. Special targets such as .END do not need to be informed once the
609 1.630 rillig * child target has been made.
610 1.524 rillig */
611 1.382 rillig static void
612 1.553 rillig LinkSource(GNode *pgn, GNode *cgn, bool isSpecial)
613 1.382 rillig {
614 1.469 rillig if ((pgn->type & OP_DOUBLEDEP) && !Lst_IsEmpty(&pgn->cohorts))
615 1.469 rillig pgn = pgn->cohorts.last->datum;
616 1.316 rillig
617 1.469 rillig Lst_Append(&pgn->children, cgn);
618 1.469 rillig pgn->unmade++;
619 1.316 rillig
620 1.469 rillig /* Special targets like .END don't need any children. */
621 1.469 rillig if (!isSpecial)
622 1.469 rillig Lst_Append(&cgn->parents, pgn);
623 1.469 rillig
624 1.469 rillig if (DEBUG(PARSE)) {
625 1.586 rillig debug_printf("# LinkSource: added child %s - %s\n",
626 1.586 rillig pgn->name, cgn->name);
627 1.469 rillig Targ_PrintNode(pgn, 0);
628 1.469 rillig Targ_PrintNode(cgn, 0);
629 1.469 rillig }
630 1.1 cgd }
631 1.1 cgd
632 1.382 rillig /* Add the node to each target from the current dependency group. */
633 1.382 rillig static void
634 1.553 rillig LinkToTargets(GNode *gn, bool isSpecial)
635 1.382 rillig {
636 1.469 rillig GNodeListNode *ln;
637 1.469 rillig
638 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next)
639 1.469 rillig LinkSource(ln->datum, gn, isSpecial);
640 1.382 rillig }
641 1.382 rillig
642 1.553 rillig static bool
643 1.337 rillig TryApplyDependencyOperator(GNode *gn, GNodeType op)
644 1.1 cgd {
645 1.1 cgd /*
646 1.469 rillig * If the node occurred on the left-hand side of a dependency and the
647 1.469 rillig * operator also defines a dependency, they must match.
648 1.1 cgd */
649 1.469 rillig if ((op & OP_OPMASK) && (gn->type & OP_OPMASK) &&
650 1.469 rillig ((op & OP_OPMASK) != (gn->type & OP_OPMASK))) {
651 1.469 rillig Parse_Error(PARSE_FATAL, "Inconsistent operator for %s",
652 1.469 rillig gn->name);
653 1.553 rillig return false;
654 1.469 rillig }
655 1.469 rillig
656 1.469 rillig if (op == OP_DOUBLEDEP && (gn->type & OP_OPMASK) == OP_DOUBLEDEP) {
657 1.469 rillig /*
658 1.697 rillig * If the node was on the left-hand side of a '::' operator,
659 1.469 rillig * we need to create a new instance of it for the children
660 1.469 rillig * and commands on this dependency line since each of these
661 1.469 rillig * dependency groups has its own attributes and commands,
662 1.469 rillig * separate from the others.
663 1.469 rillig *
664 1.469 rillig * The new instance is placed on the 'cohorts' list of the
665 1.469 rillig * initial one (note the initial one is not on its own
666 1.469 rillig * cohorts list) and the new instance is linked to all
667 1.469 rillig * parents of the initial instance.
668 1.469 rillig */
669 1.469 rillig GNode *cohort;
670 1.27 christos
671 1.469 rillig /*
672 1.469 rillig * Propagate copied bits to the initial node. They'll be
673 1.469 rillig * propagated back to the rest of the cohorts later.
674 1.469 rillig */
675 1.688 rillig gn->type |= op & (unsigned)~OP_OPMASK;
676 1.33 mycroft
677 1.469 rillig cohort = Targ_NewInternalNode(gn->name);
678 1.469 rillig if (doing_depend)
679 1.562 rillig RememberLocation(cohort);
680 1.469 rillig /*
681 1.469 rillig * Make the cohort invisible as well to avoid duplicating it
682 1.469 rillig * into other variables. True, parents of this target won't
683 1.469 rillig * tend to do anything with their local variables, but better
684 1.469 rillig * safe than sorry.
685 1.469 rillig *
686 1.469 rillig * (I think this is pointless now, since the relevant list
687 1.469 rillig * traversals will no longer see this node anyway. -mycroft)
688 1.469 rillig */
689 1.469 rillig cohort->type = op | OP_INVISIBLE;
690 1.469 rillig Lst_Append(&gn->cohorts, cohort);
691 1.469 rillig cohort->centurion = gn;
692 1.469 rillig gn->unmade_cohorts++;
693 1.469 rillig snprintf(cohort->cohort_num, sizeof cohort->cohort_num, "#%d",
694 1.469 rillig (unsigned int)gn->unmade_cohorts % 1000000);
695 1.469 rillig } else {
696 1.469 rillig /*
697 1.469 rillig * We don't want to nuke any previous flags (whatever they
698 1.469 rillig * were) so we just OR the new operator into the old.
699 1.469 rillig */
700 1.469 rillig gn->type |= op;
701 1.469 rillig }
702 1.33 mycroft
703 1.553 rillig return true;
704 1.337 rillig }
705 1.337 rillig
706 1.337 rillig static void
707 1.337 rillig ApplyDependencyOperator(GNodeType op)
708 1.337 rillig {
709 1.469 rillig GNodeListNode *ln;
710 1.469 rillig
711 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next)
712 1.469 rillig if (!TryApplyDependencyOperator(ln->datum, op))
713 1.469 rillig break;
714 1.1 cgd }
715 1.1 cgd
716 1.467 rillig /*
717 1.467 rillig * We add a .WAIT node in the dependency list. After any dynamic dependencies
718 1.467 rillig * (and filename globbing) have happened, it is given a dependency on each
719 1.467 rillig * previous child, back until the previous .WAIT node. The next child won't
720 1.467 rillig * be scheduled until the .WAIT node is built.
721 1.467 rillig *
722 1.467 rillig * We give each .WAIT node a unique name (mainly for diagnostics).
723 1.467 rillig */
724 1.467 rillig static void
725 1.593 rillig ApplyDependencySourceWait(bool isSpecial)
726 1.467 rillig {
727 1.645 rillig static unsigned wait_number = 0;
728 1.671 rillig char name[6 + 10 + 1];
729 1.467 rillig GNode *gn;
730 1.467 rillig
731 1.671 rillig snprintf(name, sizeof name, ".WAIT_%u", ++wait_number);
732 1.671 rillig gn = Targ_NewInternalNode(name);
733 1.467 rillig if (doing_depend)
734 1.562 rillig RememberLocation(gn);
735 1.467 rillig gn->type = OP_WAIT | OP_PHONY | OP_DEPENDS | OP_NOTMAIN;
736 1.467 rillig LinkToTargets(gn, isSpecial);
737 1.467 rillig }
738 1.467 rillig
739 1.553 rillig static bool
740 1.593 rillig ApplyDependencySourceKeyword(const char *src, ParseSpecial special)
741 1.1 cgd {
742 1.468 rillig int keywd;
743 1.590 rillig GNodeType targetAttr;
744 1.1 cgd
745 1.468 rillig if (*src != '.' || !ch_isupper(src[1]))
746 1.553 rillig return false;
747 1.468 rillig
748 1.602 rillig keywd = FindKeyword(src);
749 1.468 rillig if (keywd == -1)
750 1.553 rillig return false;
751 1.468 rillig
752 1.590 rillig targetAttr = parseKeywords[keywd].targetAttr;
753 1.590 rillig if (targetAttr != OP_NONE) {
754 1.590 rillig ApplyDependencyOperator(targetAttr);
755 1.553 rillig return true;
756 1.468 rillig }
757 1.590 rillig if (parseKeywords[keywd].special == SP_WAIT) {
758 1.593 rillig ApplyDependencySourceWait(special != SP_NOT);
759 1.553 rillig return true;
760 1.1 cgd }
761 1.553 rillig return false;
762 1.368 rillig }
763 1.18 christos
764 1.630 rillig /*
765 1.630 rillig * In a line like ".MAIN: source1 source2", add all sources to the list of
766 1.630 rillig * things to create, but only if the user didn't specify a target on the
767 1.630 rillig * command line and .MAIN occurs for the first time.
768 1.630 rillig *
769 1.630 rillig * See HandleDependencyTargetSpecial, branch SP_MAIN.
770 1.630 rillig * See unit-tests/cond-func-make-main.mk.
771 1.630 rillig */
772 1.368 rillig static void
773 1.593 rillig ApplyDependencySourceMain(const char *src)
774 1.368 rillig {
775 1.469 rillig Lst_Append(&opts.create, bmake_strdup(src));
776 1.469 rillig /*
777 1.469 rillig * Add the name to the .TARGETS variable as well, so the user can
778 1.469 rillig * employ that, if desired.
779 1.469 rillig */
780 1.542 rillig Global_Append(".TARGETS", src);
781 1.368 rillig }
782 1.18 christos
783 1.665 rillig /*
784 1.665 rillig * For the sources of a .ORDER target, create predecessor/successor links
785 1.665 rillig * between the previous source and the current one.
786 1.665 rillig */
787 1.368 rillig static void
788 1.593 rillig ApplyDependencySourceOrder(const char *src)
789 1.368 rillig {
790 1.469 rillig GNode *gn;
791 1.665 rillig
792 1.469 rillig gn = Targ_GetNode(src);
793 1.469 rillig if (doing_depend)
794 1.562 rillig RememberLocation(gn);
795 1.469 rillig if (order_pred != NULL) {
796 1.469 rillig Lst_Append(&order_pred->order_succ, gn);
797 1.469 rillig Lst_Append(&gn->order_pred, order_pred);
798 1.469 rillig if (DEBUG(PARSE)) {
799 1.586 rillig debug_printf(
800 1.592 rillig "# .ORDER forces '%s' to be made before '%s'\n",
801 1.586 rillig order_pred->name, gn->name);
802 1.469 rillig Targ_PrintNode(order_pred, 0);
803 1.469 rillig Targ_PrintNode(gn, 0);
804 1.469 rillig }
805 1.469 rillig }
806 1.469 rillig /*
807 1.469 rillig * The current source now becomes the predecessor for the next one.
808 1.469 rillig */
809 1.469 rillig order_pred = gn;
810 1.368 rillig }
811 1.368 rillig
812 1.630 rillig /* The source is not an attribute, so find/create a node for it. */
813 1.368 rillig static void
814 1.593 rillig ApplyDependencySourceOther(const char *src, GNodeType targetAttr,
815 1.587 rillig ParseSpecial special)
816 1.368 rillig {
817 1.469 rillig GNode *gn;
818 1.469 rillig
819 1.469 rillig gn = Targ_GetNode(src);
820 1.469 rillig if (doing_depend)
821 1.562 rillig RememberLocation(gn);
822 1.590 rillig if (targetAttr != OP_NONE)
823 1.590 rillig gn->type |= targetAttr;
824 1.469 rillig else
825 1.587 rillig LinkToTargets(gn, special != SP_NOT);
826 1.1 cgd }
827 1.1 cgd
828 1.469 rillig /*
829 1.469 rillig * Given the name of a source in a dependency line, figure out if it is an
830 1.590 rillig * attribute (such as .SILENT) and if so, apply it to all targets. Otherwise
831 1.368 rillig * decide if there is some attribute which should be applied *to* the source
832 1.368 rillig * because of some special target (such as .PHONY) and apply it if so.
833 1.590 rillig * Otherwise, make the source a child of the targets.
834 1.368 rillig */
835 1.368 rillig static void
836 1.593 rillig ApplyDependencySource(GNodeType targetAttr, const char *src,
837 1.590 rillig ParseSpecial special)
838 1.368 rillig {
839 1.593 rillig if (ApplyDependencySourceKeyword(src, special))
840 1.469 rillig return;
841 1.368 rillig
842 1.587 rillig if (special == SP_MAIN)
843 1.593 rillig ApplyDependencySourceMain(src);
844 1.587 rillig else if (special == SP_ORDER)
845 1.593 rillig ApplyDependencySourceOrder(src);
846 1.469 rillig else
847 1.593 rillig ApplyDependencySourceOther(src, targetAttr, special);
848 1.368 rillig }
849 1.368 rillig
850 1.469 rillig /*
851 1.469 rillig * If we have yet to decide on a main target to make, in the absence of any
852 1.335 rillig * user input, we want the first target on the first dependency line that is
853 1.469 rillig * actually a real target (i.e. isn't a .USE or .EXEC rule) to be made.
854 1.469 rillig */
855 1.335 rillig static void
856 1.630 rillig MaybeUpdateMainTarget(void)
857 1.1 cgd {
858 1.469 rillig GNodeListNode *ln;
859 1.335 rillig
860 1.469 rillig if (mainNode != NULL)
861 1.469 rillig return;
862 1.335 rillig
863 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next) {
864 1.469 rillig GNode *gn = ln->datum;
865 1.589 rillig if (GNode_IsMainCandidate(gn)) {
866 1.469 rillig DEBUG1(MAKE, "Setting main node to \"%s\"\n", gn->name);
867 1.469 rillig mainNode = gn;
868 1.469 rillig return;
869 1.469 rillig }
870 1.335 rillig }
871 1.1 cgd }
872 1.1 cgd
873 1.311 rillig static void
874 1.630 rillig InvalidLineType(const char *line)
875 1.311 rillig {
876 1.630 rillig if (strncmp(line, "<<<<<<", 6) == 0 ||
877 1.630 rillig strncmp(line, ">>>>>>", 6) == 0)
878 1.469 rillig Parse_Error(PARSE_FATAL,
879 1.563 rillig "Makefile appears to contain unresolved CVS/RCS/??? merge conflicts");
880 1.630 rillig else if (line[0] == '.') {
881 1.630 rillig const char *dirstart = line + 1;
882 1.469 rillig const char *dirend;
883 1.469 rillig cpp_skip_whitespace(&dirstart);
884 1.469 rillig dirend = dirstart;
885 1.469 rillig while (ch_isalnum(*dirend) || *dirend == '-')
886 1.469 rillig dirend++;
887 1.469 rillig Parse_Error(PARSE_FATAL, "Unknown directive \"%.*s\"",
888 1.311 rillig (int)(dirend - dirstart), dirstart);
889 1.469 rillig } else
890 1.705 rillig Parse_Error(PARSE_FATAL, "Invalid line '%s'", line);
891 1.311 rillig }
892 1.311 rillig
893 1.314 rillig static void
894 1.599 rillig ParseDependencyTargetWord(char **pp, const char *lstart)
895 1.314 rillig {
896 1.469 rillig const char *cp = *pp;
897 1.469 rillig
898 1.469 rillig while (*cp != '\0') {
899 1.469 rillig if ((ch_isspace(*cp) || *cp == '!' || *cp == ':' ||
900 1.469 rillig *cp == '(') &&
901 1.602 rillig !IsEscaped(lstart, cp))
902 1.469 rillig break;
903 1.314 rillig
904 1.469 rillig if (*cp == '$') {
905 1.469 rillig /*
906 1.469 rillig * Must be a dynamic source (would have been expanded
907 1.619 rillig * otherwise).
908 1.469 rillig *
909 1.469 rillig * There should be no errors in this, as they would
910 1.469 rillig * have been discovered in the initial Var_Subst and
911 1.469 rillig * we wouldn't be here.
912 1.469 rillig */
913 1.693 rillig FStr val = Var_Parse(&cp, SCOPE_CMDLINE,
914 1.693 rillig VARE_PARSE_ONLY);
915 1.624 rillig FStr_Done(&val);
916 1.469 rillig } else
917 1.469 rillig cp++;
918 1.469 rillig }
919 1.314 rillig
920 1.599 rillig *pp += cp - *pp;
921 1.314 rillig }
922 1.314 rillig
923 1.559 rillig /*
924 1.559 rillig * Handle special targets like .PATH, .DEFAULT, .BEGIN, .ORDER.
925 1.559 rillig *
926 1.559 rillig * See the tests deptgt-*.mk.
927 1.559 rillig */
928 1.368 rillig static void
929 1.602 rillig HandleDependencyTargetSpecial(const char *targetName,
930 1.602 rillig ParseSpecial *inout_special,
931 1.602 rillig SearchPathList **inout_paths)
932 1.368 rillig {
933 1.587 rillig switch (*inout_special) {
934 1.469 rillig case SP_PATH:
935 1.469 rillig if (*inout_paths == NULL)
936 1.469 rillig *inout_paths = Lst_New();
937 1.469 rillig Lst_Append(*inout_paths, &dirSearchPath);
938 1.469 rillig break;
939 1.692 sjg case SP_SYSPATH:
940 1.692 sjg if (*inout_paths == NULL)
941 1.692 sjg *inout_paths = Lst_New();
942 1.692 sjg Lst_Append(*inout_paths, sysIncPath);
943 1.692 sjg break;
944 1.469 rillig case SP_MAIN:
945 1.469 rillig /*
946 1.469 rillig * Allow targets from the command line to override the
947 1.469 rillig * .MAIN node.
948 1.469 rillig */
949 1.469 rillig if (!Lst_IsEmpty(&opts.create))
950 1.587 rillig *inout_special = SP_NOT;
951 1.469 rillig break;
952 1.469 rillig case SP_BEGIN:
953 1.469 rillig case SP_END:
954 1.469 rillig case SP_STALE:
955 1.469 rillig case SP_ERROR:
956 1.469 rillig case SP_INTERRUPT: {
957 1.530 rillig GNode *gn = Targ_GetNode(targetName);
958 1.469 rillig if (doing_depend)
959 1.562 rillig RememberLocation(gn);
960 1.469 rillig gn->type |= OP_NOTMAIN | OP_SPECIAL;
961 1.469 rillig Lst_Append(targets, gn);
962 1.469 rillig break;
963 1.469 rillig }
964 1.469 rillig case SP_DEFAULT: {
965 1.469 rillig /*
966 1.469 rillig * Need to create a node to hang commands on, but we don't
967 1.469 rillig * want it in the graph, nor do we want it to be the Main
968 1.469 rillig * Target. We claim the node is a transformation rule to make
969 1.469 rillig * life easier later, when we'll use Make_HandleUse to
970 1.469 rillig * actually apply the .DEFAULT commands.
971 1.469 rillig */
972 1.469 rillig GNode *gn = GNode_New(".DEFAULT");
973 1.469 rillig gn->type |= OP_NOTMAIN | OP_TRANSFORM;
974 1.469 rillig Lst_Append(targets, gn);
975 1.469 rillig defaultNode = gn;
976 1.469 rillig break;
977 1.469 rillig }
978 1.469 rillig case SP_DELETE_ON_ERROR:
979 1.553 rillig deleteOnError = true;
980 1.469 rillig break;
981 1.469 rillig case SP_NOTPARALLEL:
982 1.469 rillig opts.maxJobs = 1;
983 1.469 rillig break;
984 1.469 rillig case SP_SINGLESHELL:
985 1.553 rillig opts.compatMake = true;
986 1.469 rillig break;
987 1.469 rillig case SP_ORDER:
988 1.469 rillig order_pred = NULL;
989 1.469 rillig break;
990 1.469 rillig default:
991 1.469 rillig break;
992 1.469 rillig }
993 1.368 rillig }
994 1.368 rillig
995 1.553 rillig static bool
996 1.602 rillig HandleDependencyTargetPath(const char *suffixName,
997 1.602 rillig SearchPathList **inout_paths)
998 1.368 rillig {
999 1.469 rillig SearchPath *path;
1000 1.368 rillig
1001 1.530 rillig path = Suff_GetPath(suffixName);
1002 1.469 rillig if (path == NULL) {
1003 1.469 rillig Parse_Error(PARSE_FATAL,
1004 1.530 rillig "Suffix '%s' not defined (yet)", suffixName);
1005 1.553 rillig return false;
1006 1.469 rillig }
1007 1.430 rillig
1008 1.469 rillig if (*inout_paths == NULL)
1009 1.469 rillig *inout_paths = Lst_New();
1010 1.469 rillig Lst_Append(*inout_paths, path);
1011 1.430 rillig
1012 1.553 rillig return true;
1013 1.368 rillig }
1014 1.368 rillig
1015 1.628 rillig /* See if it's a special target and if so set inout_special to match it. */
1016 1.553 rillig static bool
1017 1.602 rillig HandleDependencyTarget(const char *targetName,
1018 1.602 rillig ParseSpecial *inout_special,
1019 1.602 rillig GNodeType *inout_targetAttr,
1020 1.602 rillig SearchPathList **inout_paths)
1021 1.364 rillig {
1022 1.469 rillig int keywd;
1023 1.469 rillig
1024 1.530 rillig if (!(targetName[0] == '.' && ch_isupper(targetName[1])))
1025 1.553 rillig return true;
1026 1.469 rillig
1027 1.469 rillig /*
1028 1.469 rillig * See if the target is a special target that must have it
1029 1.469 rillig * or its sources handled specially.
1030 1.469 rillig */
1031 1.602 rillig keywd = FindKeyword(targetName);
1032 1.469 rillig if (keywd != -1) {
1033 1.587 rillig if (*inout_special == SP_PATH &&
1034 1.590 rillig parseKeywords[keywd].special != SP_PATH) {
1035 1.469 rillig Parse_Error(PARSE_FATAL, "Mismatched special targets");
1036 1.553 rillig return false;
1037 1.469 rillig }
1038 1.469 rillig
1039 1.590 rillig *inout_special = parseKeywords[keywd].special;
1040 1.590 rillig *inout_targetAttr = parseKeywords[keywd].targetAttr;
1041 1.469 rillig
1042 1.602 rillig HandleDependencyTargetSpecial(targetName, inout_special,
1043 1.469 rillig inout_paths);
1044 1.364 rillig
1045 1.530 rillig } else if (strncmp(targetName, ".PATH", 5) == 0) {
1046 1.587 rillig *inout_special = SP_PATH;
1047 1.602 rillig if (!HandleDependencyTargetPath(targetName + 5, inout_paths))
1048 1.553 rillig return false;
1049 1.469 rillig }
1050 1.553 rillig return true;
1051 1.368 rillig }
1052 1.368 rillig
1053 1.368 rillig static void
1054 1.677 rillig HandleSingleDependencyTargetMundane(const char *name)
1055 1.677 rillig {
1056 1.677 rillig GNode *gn = Suff_IsTransform(name)
1057 1.677 rillig ? Suff_AddTransform(name)
1058 1.677 rillig : Targ_GetNode(name);
1059 1.677 rillig if (doing_depend)
1060 1.677 rillig RememberLocation(gn);
1061 1.677 rillig
1062 1.677 rillig Lst_Append(targets, gn);
1063 1.677 rillig }
1064 1.677 rillig
1065 1.677 rillig static void
1066 1.678 rillig HandleDependencyTargetMundane(const char *targetName)
1067 1.368 rillig {
1068 1.678 rillig if (Dir_HasWildcards(targetName)) {
1069 1.678 rillig StringList targetNames = LST_INIT;
1070 1.595 rillig
1071 1.469 rillig SearchPath *emptyPath = SearchPath_New();
1072 1.595 rillig SearchPath_Expand(emptyPath, targetName, &targetNames);
1073 1.469 rillig SearchPath_Free(emptyPath);
1074 1.678 rillig
1075 1.678 rillig while (!Lst_IsEmpty(&targetNames)) {
1076 1.678 rillig char *targName = Lst_Dequeue(&targetNames);
1077 1.678 rillig HandleSingleDependencyTargetMundane(targName);
1078 1.679 rillig free(targName);
1079 1.678 rillig }
1080 1.595 rillig } else
1081 1.678 rillig HandleSingleDependencyTargetMundane(targetName);
1082 1.368 rillig }
1083 1.368 rillig
1084 1.368 rillig static void
1085 1.603 rillig SkipExtraTargets(char **pp, const char *lstart)
1086 1.368 rillig {
1087 1.553 rillig bool warning = false;
1088 1.628 rillig const char *p = *pp;
1089 1.368 rillig
1090 1.628 rillig while (*p != '\0') {
1091 1.628 rillig if (!IsEscaped(lstart, p) && (*p == '!' || *p == ':'))
1092 1.469 rillig break;
1093 1.628 rillig if (IsEscaped(lstart, p) || (*p != ' ' && *p != '\t'))
1094 1.553 rillig warning = true;
1095 1.628 rillig p++;
1096 1.469 rillig }
1097 1.690 rillig if (warning) {
1098 1.690 rillig const char *start = *pp;
1099 1.690 rillig cpp_skip_whitespace(&start);
1100 1.690 rillig Parse_Error(PARSE_WARNING, "Extra target '%.*s' ignored",
1101 1.690 rillig (int)(p - start), start);
1102 1.690 rillig }
1103 1.430 rillig
1104 1.628 rillig *pp += p - *pp;
1105 1.368 rillig }
1106 1.368 rillig
1107 1.368 rillig static void
1108 1.628 rillig CheckSpecialMundaneMixture(ParseSpecial special)
1109 1.368 rillig {
1110 1.587 rillig switch (special) {
1111 1.469 rillig case SP_DEFAULT:
1112 1.469 rillig case SP_STALE:
1113 1.469 rillig case SP_BEGIN:
1114 1.469 rillig case SP_END:
1115 1.469 rillig case SP_ERROR:
1116 1.469 rillig case SP_INTERRUPT:
1117 1.469 rillig /*
1118 1.469 rillig * These create nodes on which to hang commands, so targets
1119 1.469 rillig * shouldn't be empty.
1120 1.469 rillig */
1121 1.469 rillig case SP_NOT:
1122 1.665 rillig /* Nothing special here -- targets may be empty. */
1123 1.469 rillig break;
1124 1.582 rillig default:
1125 1.582 rillig Parse_Error(PARSE_WARNING,
1126 1.582 rillig "Special and mundane targets don't mix. "
1127 1.582 rillig "Mundane ones ignored");
1128 1.582 rillig break;
1129 1.469 rillig }
1130 1.368 rillig }
1131 1.368 rillig
1132 1.560 rillig /*
1133 1.560 rillig * In a dependency line like 'targets: sources' or 'targets! sources', parse
1134 1.560 rillig * the operator ':', '::' or '!' from between the targets and the sources.
1135 1.560 rillig */
1136 1.578 rillig static GNodeType
1137 1.578 rillig ParseDependencyOp(char **pp)
1138 1.368 rillig {
1139 1.578 rillig if (**pp == '!')
1140 1.578 rillig return (*pp)++, OP_FORCE;
1141 1.681 rillig if (**pp == ':' && (*pp)[1] == ':')
1142 1.630 rillig return *pp += 2, OP_DOUBLEDEP;
1143 1.681 rillig else if (**pp == ':')
1144 1.681 rillig return (*pp)++, OP_DEPENDS;
1145 1.578 rillig else
1146 1.681 rillig return OP_NONE;
1147 1.368 rillig }
1148 1.364 rillig
1149 1.368 rillig static void
1150 1.692 sjg ClearPaths(ParseSpecial special, SearchPathList *paths)
1151 1.392 rillig {
1152 1.469 rillig if (paths != NULL) {
1153 1.469 rillig SearchPathListNode *ln;
1154 1.469 rillig for (ln = paths->first; ln != NULL; ln = ln->next)
1155 1.469 rillig SearchPath_Clear(ln->datum);
1156 1.469 rillig }
1157 1.692 sjg if (special == SP_SYSPATH)
1158 1.692 sjg Dir_SetSYSPATH();
1159 1.692 sjg else
1160 1.692 sjg Dir_SetPATH();
1161 1.392 rillig }
1162 1.392 rillig
1163 1.673 rillig static char *
1164 1.673 rillig FindInDirOfIncludingFile(const char *file)
1165 1.673 rillig {
1166 1.673 rillig char *fullname, *incdir, *slash, *newName;
1167 1.673 rillig int i;
1168 1.673 rillig
1169 1.673 rillig fullname = NULL;
1170 1.673 rillig incdir = bmake_strdup(CurFile()->name.str);
1171 1.673 rillig slash = strrchr(incdir, '/');
1172 1.673 rillig if (slash != NULL) {
1173 1.673 rillig *slash = '\0';
1174 1.673 rillig /*
1175 1.673 rillig * Now do lexical processing of leading "../" on the
1176 1.673 rillig * filename.
1177 1.673 rillig */
1178 1.673 rillig for (i = 0; strncmp(file + i, "../", 3) == 0; i += 3) {
1179 1.673 rillig slash = strrchr(incdir + 1, '/');
1180 1.673 rillig if (slash == NULL || strcmp(slash, "/..") == 0)
1181 1.673 rillig break;
1182 1.673 rillig *slash = '\0';
1183 1.673 rillig }
1184 1.673 rillig newName = str_concat3(incdir, "/", file + i);
1185 1.673 rillig fullname = Dir_FindFile(newName, parseIncPath);
1186 1.673 rillig if (fullname == NULL)
1187 1.673 rillig fullname = Dir_FindFile(newName, &dirSearchPath);
1188 1.673 rillig free(newName);
1189 1.673 rillig }
1190 1.673 rillig free(incdir);
1191 1.673 rillig return fullname;
1192 1.673 rillig }
1193 1.673 rillig
1194 1.674 rillig static char *
1195 1.674 rillig FindInQuotPath(const char *file)
1196 1.674 rillig {
1197 1.674 rillig const char *suff;
1198 1.674 rillig SearchPath *suffPath;
1199 1.674 rillig char *fullname;
1200 1.674 rillig
1201 1.674 rillig fullname = FindInDirOfIncludingFile(file);
1202 1.674 rillig if (fullname == NULL &&
1203 1.674 rillig (suff = strrchr(file, '.')) != NULL &&
1204 1.674 rillig (suffPath = Suff_GetPath(suff)) != NULL)
1205 1.674 rillig fullname = Dir_FindFile(file, suffPath);
1206 1.674 rillig if (fullname == NULL)
1207 1.674 rillig fullname = Dir_FindFile(file, parseIncPath);
1208 1.674 rillig if (fullname == NULL)
1209 1.674 rillig fullname = Dir_FindFile(file, &dirSearchPath);
1210 1.674 rillig return fullname;
1211 1.674 rillig }
1212 1.674 rillig
1213 1.701 rillig static bool
1214 1.701 rillig SkipGuarded(const char *fullname)
1215 1.701 rillig {
1216 1.702 rillig Guard *guard = HashTable_FindValue(&guards, fullname);
1217 1.702 rillig if (guard != NULL && guard->kind == GK_VARIABLE
1218 1.702 rillig && GNode_ValueDirect(SCOPE_GLOBAL, guard->name) != NULL)
1219 1.702 rillig goto skip;
1220 1.702 rillig if (guard != NULL && guard->kind == GK_TARGET
1221 1.702 rillig && Targ_FindNode(guard->name) != NULL)
1222 1.702 rillig goto skip;
1223 1.701 rillig return false;
1224 1.702 rillig
1225 1.702 rillig skip:
1226 1.702 rillig DEBUG2(PARSE, "Skipping '%s' because '%s' is defined\n",
1227 1.702 rillig fullname, guard->name);
1228 1.702 rillig return true;
1229 1.701 rillig }
1230 1.701 rillig
1231 1.668 sjg /*
1232 1.668 sjg * Handle one of the .[-ds]include directives by remembering the current file
1233 1.668 sjg * and pushing the included file on the stack. After the included file has
1234 1.668 sjg * finished, parsing continues with the including file; see Parse_PushInput
1235 1.668 sjg * and ParseEOF.
1236 1.668 sjg *
1237 1.668 sjg * System includes are looked up in sysIncPath, any other includes are looked
1238 1.668 sjg * up in the parsedir and then in the directories specified by the -I command
1239 1.668 sjg * line options.
1240 1.668 sjg */
1241 1.668 sjg static void
1242 1.668 sjg IncludeFile(const char *file, bool isSystem, bool depinc, bool silent)
1243 1.668 sjg {
1244 1.668 sjg Buffer buf;
1245 1.668 sjg char *fullname; /* full pathname of file */
1246 1.668 sjg int fd;
1247 1.668 sjg
1248 1.668 sjg fullname = file[0] == '/' ? bmake_strdup(file) : NULL;
1249 1.668 sjg
1250 1.674 rillig if (fullname == NULL && !isSystem)
1251 1.674 rillig fullname = FindInQuotPath(file);
1252 1.668 sjg
1253 1.668 sjg if (fullname == NULL) {
1254 1.668 sjg SearchPath *path = Lst_IsEmpty(&sysIncPath->dirs)
1255 1.668 sjg ? defSysIncPath : sysIncPath;
1256 1.668 sjg fullname = Dir_FindFile(file, path);
1257 1.668 sjg }
1258 1.668 sjg
1259 1.668 sjg if (fullname == NULL) {
1260 1.668 sjg if (!silent)
1261 1.668 sjg Parse_Error(PARSE_FATAL, "Could not find %s", file);
1262 1.668 sjg return;
1263 1.668 sjg }
1264 1.668 sjg
1265 1.701 rillig if (SkipGuarded(fullname))
1266 1.700 rillig return;
1267 1.700 rillig
1268 1.674 rillig if ((fd = open(fullname, O_RDONLY)) == -1) {
1269 1.668 sjg if (!silent)
1270 1.668 sjg Parse_Error(PARSE_FATAL, "Cannot open %s", fullname);
1271 1.668 sjg free(fullname);
1272 1.668 sjg return;
1273 1.668 sjg }
1274 1.668 sjg
1275 1.675 rillig buf = LoadFile(fullname, fd);
1276 1.668 sjg (void)close(fd);
1277 1.668 sjg
1278 1.668 sjg Parse_PushInput(fullname, 1, 0, buf, NULL);
1279 1.668 sjg if (depinc)
1280 1.668 sjg doing_depend = depinc; /* only turn it on */
1281 1.668 sjg free(fullname);
1282 1.668 sjg }
1283 1.668 sjg
1284 1.630 rillig /* Handle a "dependency" line like '.SPECIAL:' without any sources. */
1285 1.392 rillig static void
1286 1.630 rillig HandleDependencySourcesEmpty(ParseSpecial special, SearchPathList *paths)
1287 1.368 rillig {
1288 1.587 rillig switch (special) {
1289 1.469 rillig case SP_SUFFIXES:
1290 1.469 rillig Suff_ClearSuffixes();
1291 1.469 rillig break;
1292 1.469 rillig case SP_PRECIOUS:
1293 1.553 rillig allPrecious = true;
1294 1.469 rillig break;
1295 1.469 rillig case SP_IGNORE:
1296 1.553 rillig opts.ignoreErrors = true;
1297 1.469 rillig break;
1298 1.469 rillig case SP_SILENT:
1299 1.584 rillig opts.silent = true;
1300 1.469 rillig break;
1301 1.469 rillig case SP_PATH:
1302 1.692 sjg case SP_SYSPATH:
1303 1.692 sjg ClearPaths(special, paths);
1304 1.469 rillig break;
1305 1.368 rillig #ifdef POSIX
1306 1.469 rillig case SP_POSIX:
1307 1.669 rillig if (posix_state == PS_NOW_OR_NEVER) {
1308 1.670 sjg /*
1309 1.670 sjg * With '-r', 'posix.mk' (if it exists)
1310 1.670 sjg * can effectively substitute for 'sys.mk',
1311 1.670 sjg * otherwise it is an extension.
1312 1.670 sjg */
1313 1.669 rillig Global_Set("%POSIX", "1003.2");
1314 1.669 rillig IncludeFile("posix.mk", true, false, true);
1315 1.668 sjg }
1316 1.469 rillig break;
1317 1.368 rillig #endif
1318 1.469 rillig default:
1319 1.469 rillig break;
1320 1.469 rillig }
1321 1.368 rillig }
1322 1.364 rillig
1323 1.393 rillig static void
1324 1.393 rillig AddToPaths(const char *dir, SearchPathList *paths)
1325 1.393 rillig {
1326 1.469 rillig if (paths != NULL) {
1327 1.469 rillig SearchPathListNode *ln;
1328 1.469 rillig for (ln = paths->first; ln != NULL; ln = ln->next)
1329 1.529 rillig (void)SearchPath_Add(ln->datum, dir);
1330 1.469 rillig }
1331 1.393 rillig }
1332 1.393 rillig
1333 1.368 rillig /*
1334 1.610 rillig * If the target was one that doesn't take files as its sources but takes
1335 1.610 rillig * something like suffixes, we take each space-separated word on the line as
1336 1.610 rillig * a something and deal with it accordingly.
1337 1.368 rillig */
1338 1.368 rillig static void
1339 1.622 rillig ParseDependencySourceSpecial(ParseSpecial special, const char *word,
1340 1.556 rillig SearchPathList *paths)
1341 1.368 rillig {
1342 1.587 rillig switch (special) {
1343 1.469 rillig case SP_SUFFIXES:
1344 1.632 rillig Suff_AddSuffix(word);
1345 1.469 rillig break;
1346 1.469 rillig case SP_PATH:
1347 1.469 rillig AddToPaths(word, paths);
1348 1.469 rillig break;
1349 1.469 rillig case SP_INCLUDES:
1350 1.469 rillig Suff_AddInclude(word);
1351 1.469 rillig break;
1352 1.469 rillig case SP_LIBS:
1353 1.469 rillig Suff_AddLib(word);
1354 1.469 rillig break;
1355 1.691 sjg case SP_NOREADONLY:
1356 1.691 sjg Var_ReadOnly(word, false);
1357 1.691 sjg break;
1358 1.469 rillig case SP_NULL:
1359 1.469 rillig Suff_SetNull(word);
1360 1.469 rillig break;
1361 1.469 rillig case SP_OBJDIR:
1362 1.553 rillig Main_SetObjdir(false, "%s", word);
1363 1.469 rillig break;
1364 1.691 sjg case SP_READONLY:
1365 1.691 sjg Var_ReadOnly(word, true);
1366 1.691 sjg break;
1367 1.692 sjg case SP_SYSPATH:
1368 1.692 sjg AddToPaths(word, paths);
1369 1.692 sjg break;
1370 1.469 rillig default:
1371 1.469 rillig break;
1372 1.469 rillig }
1373 1.368 rillig }
1374 1.364 rillig
1375 1.553 rillig static bool
1376 1.601 rillig ApplyDependencyTarget(char *name, char *nameEnd, ParseSpecial *inout_special,
1377 1.601 rillig GNodeType *inout_targetAttr,
1378 1.601 rillig SearchPathList **inout_paths)
1379 1.601 rillig {
1380 1.601 rillig char savec = *nameEnd;
1381 1.601 rillig *nameEnd = '\0';
1382 1.601 rillig
1383 1.602 rillig if (!HandleDependencyTarget(name, inout_special,
1384 1.601 rillig inout_targetAttr, inout_paths))
1385 1.601 rillig return false;
1386 1.601 rillig
1387 1.601 rillig if (*inout_special == SP_NOT && *name != '\0')
1388 1.602 rillig HandleDependencyTargetMundane(name);
1389 1.601 rillig else if (*inout_special == SP_PATH && *name != '.' && *name != '\0')
1390 1.601 rillig Parse_Error(PARSE_WARNING, "Extra target (%s) ignored", name);
1391 1.601 rillig
1392 1.601 rillig *nameEnd = savec;
1393 1.601 rillig return true;
1394 1.601 rillig }
1395 1.601 rillig
1396 1.601 rillig static bool
1397 1.689 rillig ParseDependencyTargets(char **pp,
1398 1.556 rillig const char *lstart,
1399 1.587 rillig ParseSpecial *inout_special,
1400 1.590 rillig GNodeType *inout_targetAttr,
1401 1.595 rillig SearchPathList **inout_paths)
1402 1.368 rillig {
1403 1.689 rillig char *p = *pp;
1404 1.469 rillig
1405 1.469 rillig for (;;) {
1406 1.689 rillig char *tgt = p;
1407 1.625 rillig
1408 1.689 rillig ParseDependencyTargetWord(&p, lstart);
1409 1.469 rillig
1410 1.469 rillig /*
1411 1.469 rillig * If the word is followed by a left parenthesis, it's the
1412 1.596 rillig * name of one or more files inside an archive.
1413 1.469 rillig */
1414 1.689 rillig if (!IsEscaped(lstart, p) && *p == '(') {
1415 1.689 rillig p = tgt;
1416 1.689 rillig if (!Arch_ParseArchive(&p, targets, SCOPE_CMDLINE)) {
1417 1.469 rillig Parse_Error(PARSE_FATAL,
1418 1.469 rillig "Error in archive specification: \"%s\"",
1419 1.469 rillig tgt);
1420 1.553 rillig return false;
1421 1.469 rillig }
1422 1.469 rillig continue;
1423 1.469 rillig }
1424 1.444 rillig
1425 1.689 rillig if (*p == '\0') {
1426 1.602 rillig InvalidLineType(lstart);
1427 1.553 rillig return false;
1428 1.469 rillig }
1429 1.27 christos
1430 1.689 rillig if (!ApplyDependencyTarget(tgt, p, inout_special,
1431 1.590 rillig inout_targetAttr, inout_paths))
1432 1.553 rillig return false;
1433 1.118 dsl
1434 1.587 rillig if (*inout_special != SP_NOT && *inout_special != SP_PATH)
1435 1.689 rillig SkipExtraTargets(&p, lstart);
1436 1.469 rillig else
1437 1.689 rillig pp_skip_whitespace(&p);
1438 1.368 rillig
1439 1.689 rillig if (*p == '\0')
1440 1.469 rillig break;
1441 1.689 rillig if ((*p == '!' || *p == ':') && !IsEscaped(lstart, p))
1442 1.469 rillig break;
1443 1.469 rillig }
1444 1.430 rillig
1445 1.689 rillig *pp = p;
1446 1.553 rillig return true;
1447 1.368 rillig }
1448 1.27 christos
1449 1.368 rillig static void
1450 1.597 rillig ParseDependencySourcesSpecial(char *start,
1451 1.587 rillig ParseSpecial special, SearchPathList *paths)
1452 1.368 rillig {
1453 1.469 rillig char savec;
1454 1.204 dholland
1455 1.469 rillig while (*start != '\0') {
1456 1.597 rillig char *end = start;
1457 1.469 rillig while (*end != '\0' && !ch_isspace(*end))
1458 1.469 rillig end++;
1459 1.469 rillig savec = *end;
1460 1.469 rillig *end = '\0';
1461 1.587 rillig ParseDependencySourceSpecial(special, start, paths);
1462 1.469 rillig *end = savec;
1463 1.469 rillig if (savec != '\0')
1464 1.469 rillig end++;
1465 1.469 rillig pp_skip_whitespace(&end);
1466 1.469 rillig start = end;
1467 1.469 rillig }
1468 1.368 rillig }
1469 1.368 rillig
1470 1.656 sjg static void
1471 1.656 sjg LinkVarToTargets(VarAssign *var)
1472 1.656 sjg {
1473 1.656 sjg GNodeListNode *ln;
1474 1.656 sjg
1475 1.656 sjg for (ln = targets->first; ln != NULL; ln = ln->next)
1476 1.658 rillig Parse_Var(var, ln->datum);
1477 1.656 sjg }
1478 1.656 sjg
1479 1.553 rillig static bool
1480 1.597 rillig ParseDependencySourcesMundane(char *start,
1481 1.590 rillig ParseSpecial special, GNodeType targetAttr)
1482 1.368 rillig {
1483 1.469 rillig while (*start != '\0') {
1484 1.597 rillig char *end = start;
1485 1.656 sjg VarAssign var;
1486 1.656 sjg
1487 1.656 sjg /*
1488 1.656 sjg * Check for local variable assignment,
1489 1.656 sjg * rest of the line is the value.
1490 1.656 sjg */
1491 1.656 sjg if (Parse_IsVar(start, &var)) {
1492 1.656 sjg /*
1493 1.656 sjg * Check if this makefile has disabled
1494 1.656 sjg * setting local variables.
1495 1.656 sjg */
1496 1.657 rillig bool target_vars = GetBooleanExpr(
1497 1.657 rillig "${.MAKE.TARGET_LOCAL_VARIABLES}", true);
1498 1.656 sjg
1499 1.656 sjg if (target_vars)
1500 1.656 sjg LinkVarToTargets(&var);
1501 1.656 sjg free(var.varname);
1502 1.656 sjg if (target_vars)
1503 1.656 sjg return true;
1504 1.656 sjg }
1505 1.657 rillig
1506 1.367 rillig /*
1507 1.469 rillig * The targets take real sources, so we must beware of archive
1508 1.469 rillig * specifications (i.e. things with left parentheses in them)
1509 1.469 rillig * and handle them accordingly.
1510 1.367 rillig */
1511 1.469 rillig for (; *end != '\0' && !ch_isspace(*end); end++) {
1512 1.469 rillig if (*end == '(' && end > start && end[-1] != '$') {
1513 1.469 rillig /*
1514 1.469 rillig * Only stop for a left parenthesis if it
1515 1.469 rillig * isn't at the start of a word (that'll be
1516 1.469 rillig * for variable changes later) and isn't
1517 1.469 rillig * preceded by a dollar sign (a dynamic
1518 1.469 rillig * source).
1519 1.469 rillig */
1520 1.469 rillig break;
1521 1.469 rillig }
1522 1.469 rillig }
1523 1.368 rillig
1524 1.469 rillig if (*end == '(') {
1525 1.469 rillig GNodeList sources = LST_INIT;
1526 1.545 rillig if (!Arch_ParseArchive(&start, &sources,
1527 1.545 rillig SCOPE_CMDLINE)) {
1528 1.469 rillig Parse_Error(PARSE_FATAL,
1529 1.469 rillig "Error in source archive spec \"%s\"",
1530 1.469 rillig start);
1531 1.553 rillig return false;
1532 1.469 rillig }
1533 1.368 rillig
1534 1.469 rillig while (!Lst_IsEmpty(&sources)) {
1535 1.469 rillig GNode *gn = Lst_Dequeue(&sources);
1536 1.593 rillig ApplyDependencySource(targetAttr, gn->name,
1537 1.590 rillig special);
1538 1.469 rillig }
1539 1.469 rillig Lst_Done(&sources);
1540 1.469 rillig end = start;
1541 1.469 rillig } else {
1542 1.469 rillig if (*end != '\0') {
1543 1.469 rillig *end = '\0';
1544 1.469 rillig end++;
1545 1.469 rillig }
1546 1.368 rillig
1547 1.593 rillig ApplyDependencySource(targetAttr, start, special);
1548 1.469 rillig }
1549 1.469 rillig pp_skip_whitespace(&end);
1550 1.469 rillig start = end;
1551 1.368 rillig }
1552 1.553 rillig return true;
1553 1.368 rillig }
1554 1.1 cgd
1555 1.559 rillig /*
1556 1.626 rillig * From a dependency line like 'targets: sources', parse the sources.
1557 1.559 rillig *
1558 1.559 rillig * See the tests depsrc-*.mk.
1559 1.559 rillig */
1560 1.558 rillig static void
1561 1.597 rillig ParseDependencySources(char *p, GNodeType targetAttr,
1562 1.587 rillig ParseSpecial special, SearchPathList **inout_paths)
1563 1.558 rillig {
1564 1.597 rillig if (*p == '\0') {
1565 1.630 rillig HandleDependencySourcesEmpty(special, *inout_paths);
1566 1.587 rillig } else if (special == SP_MFLAGS) {
1567 1.597 rillig Main_ParseArgLine(p);
1568 1.626 rillig return;
1569 1.587 rillig } else if (special == SP_SHELL) {
1570 1.597 rillig if (!Job_ParseShell(p)) {
1571 1.558 rillig Parse_Error(PARSE_FATAL,
1572 1.558 rillig "improper shell specification");
1573 1.558 rillig return;
1574 1.558 rillig }
1575 1.626 rillig return;
1576 1.587 rillig } else if (special == SP_NOTPARALLEL || special == SP_SINGLESHELL ||
1577 1.587 rillig special == SP_DELETE_ON_ERROR) {
1578 1.626 rillig return;
1579 1.558 rillig }
1580 1.558 rillig
1581 1.558 rillig /* Now go for the sources. */
1582 1.691 sjg switch (special) {
1583 1.691 sjg case SP_INCLUDES:
1584 1.691 sjg case SP_LIBS:
1585 1.691 sjg case SP_NOREADONLY:
1586 1.691 sjg case SP_NULL:
1587 1.691 sjg case SP_OBJDIR:
1588 1.691 sjg case SP_PATH:
1589 1.691 sjg case SP_READONLY:
1590 1.691 sjg case SP_SUFFIXES:
1591 1.692 sjg case SP_SYSPATH:
1592 1.597 rillig ParseDependencySourcesSpecial(p, special, *inout_paths);
1593 1.558 rillig if (*inout_paths != NULL) {
1594 1.558 rillig Lst_Free(*inout_paths);
1595 1.558 rillig *inout_paths = NULL;
1596 1.558 rillig }
1597 1.587 rillig if (special == SP_PATH)
1598 1.558 rillig Dir_SetPATH();
1599 1.692 sjg if (special == SP_SYSPATH)
1600 1.692 sjg Dir_SetSYSPATH();
1601 1.691 sjg break;
1602 1.691 sjg default:
1603 1.558 rillig assert(*inout_paths == NULL);
1604 1.597 rillig if (!ParseDependencySourcesMundane(p, special, targetAttr))
1605 1.558 rillig return;
1606 1.691 sjg break;
1607 1.558 rillig }
1608 1.558 rillig
1609 1.630 rillig MaybeUpdateMainTarget();
1610 1.558 rillig }
1611 1.558 rillig
1612 1.524 rillig /*
1613 1.524 rillig * Parse a dependency line consisting of targets, followed by a dependency
1614 1.368 rillig * operator, optionally followed by sources.
1615 1.368 rillig *
1616 1.368 rillig * The nodes of the sources are linked as children to the nodes of the
1617 1.368 rillig * targets. Nodes are created as necessary.
1618 1.368 rillig *
1619 1.368 rillig * The operator is applied to each node in the global 'targets' list,
1620 1.585 rillig * which is where the nodes found for the targets are kept.
1621 1.368 rillig *
1622 1.368 rillig * The sources are parsed in much the same way as the targets, except
1623 1.368 rillig * that they are expanded using the wildcarding scheme of the C-Shell,
1624 1.441 rillig * and a target is created for each expanded word. Each of the resulting
1625 1.441 rillig * nodes is then linked to each of the targets as one of its children.
1626 1.368 rillig *
1627 1.368 rillig * Certain targets and sources such as .PHONY or .PRECIOUS are handled
1628 1.585 rillig * specially, see ParseSpecial.
1629 1.368 rillig *
1630 1.585 rillig * Transformation rules such as '.c.o' are also handled here, see
1631 1.585 rillig * Suff_AddTransform.
1632 1.441 rillig *
1633 1.441 rillig * Upon return, the value of the line is unspecified.
1634 1.368 rillig */
1635 1.368 rillig static void
1636 1.556 rillig ParseDependency(char *line)
1637 1.368 rillig {
1638 1.600 rillig char *p;
1639 1.583 rillig SearchPathList *paths; /* search paths to alter when parsing a list
1640 1.583 rillig * of .PATH targets */
1641 1.590 rillig GNodeType targetAttr; /* from special sources */
1642 1.600 rillig ParseSpecial special; /* in special targets, the children are
1643 1.600 rillig * linked as children of the parent but not
1644 1.600 rillig * vice versa */
1645 1.681 rillig GNodeType op;
1646 1.469 rillig
1647 1.556 rillig DEBUG1(PARSE, "ParseDependency(%s)\n", line);
1648 1.600 rillig p = line;
1649 1.600 rillig paths = NULL;
1650 1.590 rillig targetAttr = OP_NONE;
1651 1.600 rillig special = SP_NOT;
1652 1.469 rillig
1653 1.600 rillig if (!ParseDependencyTargets(&p, line, &special, &targetAttr, &paths))
1654 1.469 rillig goto out;
1655 1.469 rillig
1656 1.469 rillig if (!Lst_IsEmpty(targets))
1657 1.628 rillig CheckSpecialMundaneMixture(special);
1658 1.469 rillig
1659 1.681 rillig op = ParseDependencyOp(&p);
1660 1.681 rillig if (op == OP_NONE) {
1661 1.681 rillig InvalidLineType(line);
1662 1.681 rillig goto out;
1663 1.681 rillig }
1664 1.681 rillig ApplyDependencyOperator(op);
1665 1.469 rillig
1666 1.600 rillig pp_skip_whitespace(&p);
1667 1.469 rillig
1668 1.600 rillig ParseDependencySources(p, targetAttr, special, &paths);
1669 1.1 cgd
1670 1.112 christos out:
1671 1.469 rillig if (paths != NULL)
1672 1.469 rillig Lst_Free(paths);
1673 1.1 cgd }
1674 1.1 cgd
1675 1.469 rillig /*
1676 1.469 rillig * Determine the assignment operator and adjust the end of the variable
1677 1.469 rillig * name accordingly.
1678 1.469 rillig */
1679 1.606 rillig static VarAssign
1680 1.606 rillig AdjustVarassignOp(const char *name, const char *nameEnd, const char *op,
1681 1.606 rillig const char *value)
1682 1.388 rillig {
1683 1.469 rillig VarAssignOp type;
1684 1.606 rillig VarAssign va;
1685 1.469 rillig
1686 1.469 rillig if (op > name && op[-1] == '+') {
1687 1.579 rillig op--;
1688 1.469 rillig type = VAR_APPEND;
1689 1.469 rillig
1690 1.469 rillig } else if (op > name && op[-1] == '?') {
1691 1.469 rillig op--;
1692 1.469 rillig type = VAR_DEFAULT;
1693 1.469 rillig
1694 1.469 rillig } else if (op > name && op[-1] == ':') {
1695 1.469 rillig op--;
1696 1.469 rillig type = VAR_SUBST;
1697 1.469 rillig
1698 1.469 rillig } else if (op > name && op[-1] == '!') {
1699 1.469 rillig op--;
1700 1.469 rillig type = VAR_SHELL;
1701 1.388 rillig
1702 1.469 rillig } else {
1703 1.469 rillig type = VAR_NORMAL;
1704 1.388 rillig #ifdef SUNSHCMD
1705 1.469 rillig while (op > name && ch_isspace(op[-1]))
1706 1.469 rillig op--;
1707 1.388 rillig
1708 1.608 rillig if (op - name >= 3 && memcmp(op - 3, ":sh", 3) == 0) {
1709 1.579 rillig op -= 3;
1710 1.469 rillig type = VAR_SHELL;
1711 1.469 rillig }
1712 1.469 rillig #endif
1713 1.388 rillig }
1714 1.388 rillig
1715 1.606 rillig va.varname = bmake_strsedup(name, nameEnd < op ? nameEnd : op);
1716 1.606 rillig va.op = type;
1717 1.606 rillig va.value = value;
1718 1.606 rillig return va;
1719 1.388 rillig }
1720 1.388 rillig
1721 1.469 rillig /*
1722 1.469 rillig * Parse a variable assignment, consisting of a single-word variable name,
1723 1.368 rillig * optional whitespace, an assignment operator, optional whitespace and the
1724 1.368 rillig * variable value.
1725 1.84 wiz *
1726 1.410 rillig * Note: There is a lexical ambiguity with assignment modifier characters
1727 1.410 rillig * in variable names. This routine interprets the character before the =
1728 1.410 rillig * as a modifier. Therefore, an assignment like
1729 1.410 rillig * C++=/usr/bin/CC
1730 1.410 rillig * is interpreted as "C+ +=" instead of "C++ =".
1731 1.410 rillig *
1732 1.469 rillig * Used for both lines in a file and command line arguments.
1733 1.469 rillig */
1734 1.605 rillig static bool
1735 1.368 rillig Parse_IsVar(const char *p, VarAssign *out_var)
1736 1.1 cgd {
1737 1.652 rillig const char *nameStart, *nameEnd, *firstSpace, *eq;
1738 1.469 rillig int level = 0;
1739 1.469 rillig
1740 1.469 rillig cpp_skip_hspace(&p); /* Skip to variable name */
1741 1.469 rillig
1742 1.469 rillig /*
1743 1.665 rillig * During parsing, the '+' of the operator '+=' is initially parsed
1744 1.469 rillig * as part of the variable name. It is later corrected, as is the
1745 1.652 rillig * ':sh' modifier. Of these two (nameEnd and eq), the earlier one
1746 1.469 rillig * determines the actual end of the variable name.
1747 1.469 rillig */
1748 1.652 rillig
1749 1.606 rillig nameStart = p;
1750 1.652 rillig firstSpace = NULL;
1751 1.356 rillig
1752 1.469 rillig /*
1753 1.469 rillig * Scan for one of the assignment operators outside a variable
1754 1.469 rillig * expansion.
1755 1.469 rillig */
1756 1.469 rillig while (*p != '\0') {
1757 1.469 rillig char ch = *p++;
1758 1.469 rillig if (ch == '(' || ch == '{') {
1759 1.469 rillig level++;
1760 1.469 rillig continue;
1761 1.469 rillig }
1762 1.469 rillig if (ch == ')' || ch == '}') {
1763 1.469 rillig level--;
1764 1.469 rillig continue;
1765 1.469 rillig }
1766 1.469 rillig
1767 1.469 rillig if (level != 0)
1768 1.469 rillig continue;
1769 1.469 rillig
1770 1.652 rillig if ((ch == ' ' || ch == '\t') && firstSpace == NULL)
1771 1.652 rillig firstSpace = p - 1;
1772 1.469 rillig while (ch == ' ' || ch == '\t')
1773 1.469 rillig ch = *p++;
1774 1.368 rillig
1775 1.662 sjg if (ch == '\0')
1776 1.662 sjg return false;
1777 1.191 sjg #ifdef SUNSHCMD
1778 1.469 rillig if (ch == ':' && p[0] == 's' && p[1] == 'h') {
1779 1.469 rillig p += 2;
1780 1.469 rillig continue;
1781 1.469 rillig }
1782 1.469 rillig #endif
1783 1.607 rillig if (ch == '=')
1784 1.606 rillig eq = p - 1;
1785 1.607 rillig else if (*p == '=' &&
1786 1.607 rillig (ch == '+' || ch == ':' || ch == '?' || ch == '!'))
1787 1.606 rillig eq = p;
1788 1.607 rillig else if (firstSpace != NULL)
1789 1.553 rillig return false;
1790 1.607 rillig else
1791 1.607 rillig continue;
1792 1.607 rillig
1793 1.607 rillig nameEnd = firstSpace != NULL ? firstSpace : eq;
1794 1.607 rillig p = eq + 1;
1795 1.607 rillig cpp_skip_whitespace(&p);
1796 1.607 rillig *out_var = AdjustVarassignOp(nameStart, nameEnd, eq, p);
1797 1.607 rillig return true;
1798 1.191 sjg }
1799 1.1 cgd
1800 1.553 rillig return false;
1801 1.1 cgd }
1802 1.1 cgd
1803 1.469 rillig /*
1804 1.469 rillig * Check for syntax errors such as unclosed expressions or unknown modifiers.
1805 1.469 rillig */
1806 1.368 rillig static void
1807 1.546 rillig VarCheckSyntax(VarAssignOp type, const char *uvalue, GNode *scope)
1808 1.368 rillig {
1809 1.515 rillig if (opts.strict) {
1810 1.469 rillig if (type != VAR_SUBST && strchr(uvalue, '$') != NULL) {
1811 1.694 rillig char *expandedValue = Var_Subst(uvalue,
1812 1.694 rillig scope, VARE_PARSE_ONLY);
1813 1.469 rillig /* TODO: handle errors */
1814 1.469 rillig free(expandedValue);
1815 1.469 rillig }
1816 1.243 sjg }
1817 1.368 rillig }
1818 1.368 rillig
1819 1.630 rillig /* Perform a variable assignment that uses the operator ':='. */
1820 1.390 rillig static void
1821 1.548 rillig VarAssign_EvalSubst(GNode *scope, const char *name, const char *uvalue,
1822 1.506 rillig FStr *out_avalue)
1823 1.390 rillig {
1824 1.469 rillig char *evalue;
1825 1.469 rillig
1826 1.469 rillig /*
1827 1.469 rillig * make sure that we set the variable the first time to nothing
1828 1.538 rillig * so that it gets substituted.
1829 1.538 rillig *
1830 1.538 rillig * TODO: Add a test that demonstrates why this code is needed,
1831 1.538 rillig * apart from making the debug log longer.
1832 1.633 rillig *
1833 1.630 rillig * XXX: The variable name is expanded up to 3 times.
1834 1.469 rillig */
1835 1.548 rillig if (!Var_ExistsExpand(scope, name))
1836 1.548 rillig Var_SetExpand(scope, name, "");
1837 1.469 rillig
1838 1.694 rillig evalue = Var_Subst(uvalue, scope, VARE_KEEP_DOLLAR_UNDEF);
1839 1.469 rillig /* TODO: handle errors */
1840 1.520 rillig
1841 1.548 rillig Var_SetExpand(scope, name, evalue);
1842 1.390 rillig
1843 1.536 rillig *out_avalue = FStr_InitOwn(evalue);
1844 1.390 rillig }
1845 1.390 rillig
1846 1.630 rillig /* Perform a variable assignment that uses the operator '!='. */
1847 1.390 rillig static void
1848 1.546 rillig VarAssign_EvalShell(const char *name, const char *uvalue, GNode *scope,
1849 1.506 rillig FStr *out_avalue)
1850 1.390 rillig {
1851 1.507 rillig FStr cmd;
1852 1.648 rillig char *output, *error;
1853 1.469 rillig
1854 1.507 rillig cmd = FStr_InitRefer(uvalue);
1855 1.650 rillig Var_Expand(&cmd, SCOPE_CMDLINE, VARE_UNDEFERR);
1856 1.469 rillig
1857 1.648 rillig output = Cmd_Exec(cmd.str, &error);
1858 1.648 rillig Var_SetExpand(scope, name, output);
1859 1.648 rillig *out_avalue = FStr_InitOwn(output);
1860 1.648 rillig if (error != NULL) {
1861 1.648 rillig Parse_Error(PARSE_WARNING, "%s", error);
1862 1.648 rillig free(error);
1863 1.648 rillig }
1864 1.390 rillig
1865 1.507 rillig FStr_Done(&cmd);
1866 1.390 rillig }
1867 1.390 rillig
1868 1.524 rillig /*
1869 1.524 rillig * Perform a variable assignment.
1870 1.391 rillig *
1871 1.554 rillig * The actual value of the variable is returned in *out_true_avalue.
1872 1.538 rillig * Especially for VAR_SUBST and VAR_SHELL this can differ from the literal
1873 1.538 rillig * value.
1874 1.538 rillig *
1875 1.538 rillig * Return whether the assignment was actually performed, which is usually
1876 1.538 rillig * the case. It is only skipped if the operator is '?=' and the variable
1877 1.538 rillig * already exists.
1878 1.524 rillig */
1879 1.553 rillig static bool
1880 1.391 rillig VarAssign_Eval(const char *name, VarAssignOp op, const char *uvalue,
1881 1.554 rillig GNode *scope, FStr *out_true_avalue)
1882 1.368 rillig {
1883 1.506 rillig FStr avalue = FStr_InitRefer(uvalue);
1884 1.469 rillig
1885 1.469 rillig if (op == VAR_APPEND)
1886 1.548 rillig Var_AppendExpand(scope, name, uvalue);
1887 1.469 rillig else if (op == VAR_SUBST)
1888 1.548 rillig VarAssign_EvalSubst(scope, name, uvalue, &avalue);
1889 1.469 rillig else if (op == VAR_SHELL)
1890 1.546 rillig VarAssign_EvalShell(name, uvalue, scope, &avalue);
1891 1.469 rillig else {
1892 1.630 rillig /* XXX: The variable name is expanded up to 2 times. */
1893 1.548 rillig if (op == VAR_DEFAULT && Var_ExistsExpand(scope, name))
1894 1.553 rillig return false;
1895 1.353 rillig
1896 1.469 rillig /* Normal assignment -- just do it. */
1897 1.548 rillig Var_SetExpand(scope, name, uvalue);
1898 1.469 rillig }
1899 1.469 rillig
1900 1.554 rillig *out_true_avalue = avalue;
1901 1.553 rillig return true;
1902 1.368 rillig }
1903 1.368 rillig
1904 1.368 rillig static void
1905 1.368 rillig VarAssignSpecial(const char *name, const char *avalue)
1906 1.368 rillig {
1907 1.696 rillig if (strcmp(name, ".MAKEOVERRIDES") == 0)
1908 1.583 rillig Main_ExportMAKEFLAGS(false); /* re-export MAKEFLAGS */
1909 1.469 rillig else if (strcmp(name, ".CURDIR") == 0) {
1910 1.469 rillig /*
1911 1.469 rillig * Someone is being (too?) clever...
1912 1.469 rillig * Let's pretend they know what they are doing and
1913 1.469 rillig * re-initialize the 'cur' CachedDir.
1914 1.469 rillig */
1915 1.469 rillig Dir_InitCur(avalue);
1916 1.469 rillig Dir_SetPATH();
1917 1.696 rillig } else if (strcmp(name, ".MAKE.JOB.PREFIX") == 0)
1918 1.469 rillig Job_SetPrefix();
1919 1.695 rillig else if (strcmp(name, ".MAKE.EXPORTED") == 0)
1920 1.473 rillig Var_ExportVars(avalue);
1921 1.368 rillig }
1922 1.368 rillig
1923 1.579 rillig /* Perform the variable assignment in the given scope. */
1924 1.605 rillig static void
1925 1.658 rillig Parse_Var(VarAssign *var, GNode *scope)
1926 1.368 rillig {
1927 1.583 rillig FStr avalue; /* actual value (maybe expanded) */
1928 1.368 rillig
1929 1.546 rillig VarCheckSyntax(var->op, var->value, scope);
1930 1.546 rillig if (VarAssign_Eval(var->varname, var->op, var->value, scope, &avalue)) {
1931 1.506 rillig VarAssignSpecial(var->varname, avalue.str);
1932 1.506 rillig FStr_Done(&avalue);
1933 1.506 rillig }
1934 1.656 sjg }
1935 1.657 rillig
1936 1.200 christos
1937 1.524 rillig /*
1938 1.524 rillig * See if the command possibly calls a sub-make by using the variable
1939 1.524 rillig * expressions ${.MAKE}, ${MAKE} or the plain word "make".
1940 1.524 rillig */
1941 1.553 rillig static bool
1942 1.432 rillig MaybeSubMake(const char *cmd)
1943 1.195 christos {
1944 1.469 rillig const char *start;
1945 1.432 rillig
1946 1.469 rillig for (start = cmd; *start != '\0'; start++) {
1947 1.469 rillig const char *p = start;
1948 1.469 rillig char endc;
1949 1.469 rillig
1950 1.469 rillig /* XXX: What if progname != "make"? */
1951 1.579 rillig if (strncmp(p, "make", 4) == 0)
1952 1.469 rillig if (start == cmd || !ch_isalnum(p[-1]))
1953 1.469 rillig if (!ch_isalnum(p[4]))
1954 1.553 rillig return true;
1955 1.469 rillig
1956 1.469 rillig if (*p != '$')
1957 1.469 rillig continue;
1958 1.469 rillig p++;
1959 1.469 rillig
1960 1.469 rillig if (*p == '{')
1961 1.469 rillig endc = '}';
1962 1.469 rillig else if (*p == '(')
1963 1.469 rillig endc = ')';
1964 1.469 rillig else
1965 1.469 rillig continue;
1966 1.469 rillig p++;
1967 1.432 rillig
1968 1.469 rillig if (*p == '.') /* Accept either ${.MAKE} or ${MAKE}. */
1969 1.469 rillig p++;
1970 1.432 rillig
1971 1.619 rillig if (strncmp(p, "MAKE", 4) == 0 && p[4] == endc)
1972 1.619 rillig return true;
1973 1.469 rillig }
1974 1.553 rillig return false;
1975 1.195 christos }
1976 1.195 christos
1977 1.524 rillig /*
1978 1.524 rillig * Append the command to the target node.
1979 1.1 cgd *
1980 1.327 rillig * The node may be marked as a submake node if the command is determined to
1981 1.524 rillig * be that.
1982 1.524 rillig */
1983 1.327 rillig static void
1984 1.593 rillig GNode_AddCommand(GNode *gn, char *cmd)
1985 1.9 jtc {
1986 1.469 rillig /* Add to last (ie current) cohort for :: targets */
1987 1.469 rillig if ((gn->type & OP_DOUBLEDEP) && gn->cohorts.last != NULL)
1988 1.469 rillig gn = gn->cohorts.last->datum;
1989 1.469 rillig
1990 1.469 rillig /* if target already supplied, ignore commands */
1991 1.469 rillig if (!(gn->type & OP_HAS_COMMANDS)) {
1992 1.469 rillig Lst_Append(&gn->commands, cmd);
1993 1.469 rillig if (MaybeSubMake(cmd))
1994 1.469 rillig gn->type |= OP_SUBMAKE;
1995 1.562 rillig RememberLocation(gn);
1996 1.469 rillig } else {
1997 1.327 rillig #if 0
1998 1.469 rillig /* XXX: We cannot do this until we fix the tree */
1999 1.469 rillig Lst_Append(&gn->commands, cmd);
2000 1.469 rillig Parse_Error(PARSE_WARNING,
2001 1.469 rillig "overriding commands for target \"%s\"; "
2002 1.661 rillig "previous commands defined at %s: %u ignored",
2003 1.469 rillig gn->name, gn->fname, gn->lineno);
2004 1.203 joerg #else
2005 1.469 rillig Parse_Error(PARSE_WARNING,
2006 1.374 rillig "duplicate script for target \"%s\" ignored",
2007 1.374 rillig gn->name);
2008 1.680 rillig ParseErrorInternal(gn, PARSE_WARNING,
2009 1.469 rillig "using previous script for \"%s\" defined here",
2010 1.469 rillig gn->name);
2011 1.203 joerg #endif
2012 1.469 rillig }
2013 1.1 cgd }
2014 1.1 cgd
2015 1.469 rillig /*
2016 1.469 rillig * Add a directory to the path searched for included makefiles bracketed
2017 1.469 rillig * by double-quotes.
2018 1.469 rillig */
2019 1.1 cgd void
2020 1.344 rillig Parse_AddIncludeDir(const char *dir)
2021 1.1 cgd {
2022 1.529 rillig (void)SearchPath_Add(parseIncPath, dir);
2023 1.1 cgd }
2024 1.1 cgd
2025 1.123 dsl
2026 1.566 rillig /*
2027 1.566 rillig * Parse a directive like '.include' or '.-include'.
2028 1.566 rillig *
2029 1.566 rillig * .include "user-makefile.mk"
2030 1.566 rillig * .include <system-makefile.mk>
2031 1.566 rillig */
2032 1.123 dsl static void
2033 1.556 rillig ParseInclude(char *directive)
2034 1.123 dsl {
2035 1.567 rillig char endc; /* '>' or '"' */
2036 1.567 rillig char *p;
2037 1.553 rillig bool silent = directive[0] != 'i';
2038 1.566 rillig FStr file;
2039 1.123 dsl
2040 1.566 rillig p = directive + (silent ? 8 : 7);
2041 1.566 rillig pp_skip_hspace(&p);
2042 1.123 dsl
2043 1.566 rillig if (*p != '"' && *p != '<') {
2044 1.469 rillig Parse_Error(PARSE_FATAL,
2045 1.374 rillig ".include filename must be delimited by '\"' or '<'");
2046 1.469 rillig return;
2047 1.469 rillig }
2048 1.123 dsl
2049 1.566 rillig if (*p++ == '<')
2050 1.469 rillig endc = '>';
2051 1.469 rillig else
2052 1.469 rillig endc = '"';
2053 1.566 rillig file = FStr_InitRefer(p);
2054 1.469 rillig
2055 1.469 rillig /* Skip to matching delimiter */
2056 1.566 rillig while (*p != '\0' && *p != endc)
2057 1.566 rillig p++;
2058 1.123 dsl
2059 1.566 rillig if (*p != endc) {
2060 1.469 rillig Parse_Error(PARSE_FATAL,
2061 1.441 rillig "Unclosed .include filename. '%c' expected", endc);
2062 1.469 rillig return;
2063 1.469 rillig }
2064 1.430 rillig
2065 1.566 rillig *p = '\0';
2066 1.123 dsl
2067 1.650 rillig Var_Expand(&file, SCOPE_CMDLINE, VARE_WANTRES);
2068 1.567 rillig IncludeFile(file.str, endc == '>', directive[0] == 'd', silent);
2069 1.567 rillig FStr_Done(&file);
2070 1.1 cgd }
2071 1.1 cgd
2072 1.524 rillig /*
2073 1.524 rillig * Split filename into dirname + basename, then assign these to the
2074 1.524 rillig * given variables.
2075 1.524 rillig */
2076 1.193 christos static void
2077 1.281 rillig SetFilenameVars(const char *filename, const char *dirvar, const char *filevar)
2078 1.193 christos {
2079 1.550 rillig const char *slash, *basename;
2080 1.550 rillig FStr dirname;
2081 1.469 rillig
2082 1.469 rillig slash = strrchr(filename, '/');
2083 1.469 rillig if (slash == NULL) {
2084 1.550 rillig dirname = FStr_InitRefer(curdir);
2085 1.469 rillig basename = filename;
2086 1.469 rillig } else {
2087 1.550 rillig dirname = FStr_InitOwn(bmake_strsedup(filename, slash));
2088 1.469 rillig basename = slash + 1;
2089 1.469 rillig }
2090 1.281 rillig
2091 1.568 rillig Global_Set(dirvar, dirname.str);
2092 1.568 rillig Global_Set(filevar, basename);
2093 1.469 rillig
2094 1.586 rillig DEBUG4(PARSE, "SetFilenameVars: ${%s} = `%s' ${%s} = `%s'\n",
2095 1.586 rillig dirvar, dirname.str, filevar, basename);
2096 1.550 rillig FStr_Done(&dirname);
2097 1.281 rillig }
2098 1.281 rillig
2099 1.469 rillig /*
2100 1.469 rillig * Return the immediately including file.
2101 1.281 rillig *
2102 1.281 rillig * This is made complicated since the .for loop is implemented as a special
2103 1.469 rillig * kind of .include; see For_Run.
2104 1.469 rillig */
2105 1.281 rillig static const char *
2106 1.281 rillig GetActuallyIncludingFile(void)
2107 1.281 rillig {
2108 1.469 rillig size_t i;
2109 1.627 rillig const IncludedFile *incs = GetInclude(0);
2110 1.193 christos
2111 1.469 rillig for (i = includes.len; i >= 2; i--)
2112 1.617 rillig if (incs[i - 1].forLoop == NULL)
2113 1.576 rillig return incs[i - 2].name.str;
2114 1.469 rillig return NULL;
2115 1.193 christos }
2116 1.281 rillig
2117 1.285 rillig /* Set .PARSEDIR, .PARSEFILE, .INCLUDEDFROMDIR and .INCLUDEDFROMFILE. */
2118 1.44 aidan static void
2119 1.593 rillig SetParseFile(const char *filename)
2120 1.44 aidan {
2121 1.469 rillig const char *including;
2122 1.44 aidan
2123 1.469 rillig SetFilenameVars(filename, ".PARSEDIR", ".PARSEFILE");
2124 1.281 rillig
2125 1.469 rillig including = GetActuallyIncludingFile();
2126 1.469 rillig if (including != NULL) {
2127 1.469 rillig SetFilenameVars(including,
2128 1.469 rillig ".INCLUDEDFROMDIR", ".INCLUDEDFROMFILE");
2129 1.469 rillig } else {
2130 1.547 rillig Global_Delete(".INCLUDEDFROMDIR");
2131 1.547 rillig Global_Delete(".INCLUDEDFROMFILE");
2132 1.469 rillig }
2133 1.44 aidan }
2134 1.44 aidan
2135 1.553 rillig static bool
2136 1.418 rillig StrContainsWord(const char *str, const char *word)
2137 1.418 rillig {
2138 1.469 rillig size_t strLen = strlen(str);
2139 1.469 rillig size_t wordLen = strlen(word);
2140 1.588 rillig const char *p;
2141 1.469 rillig
2142 1.469 rillig if (strLen < wordLen)
2143 1.585 rillig return false;
2144 1.469 rillig
2145 1.469 rillig for (p = str; p != NULL; p = strchr(p, ' ')) {
2146 1.469 rillig if (*p == ' ')
2147 1.469 rillig p++;
2148 1.588 rillig if (p > str + strLen - wordLen)
2149 1.585 rillig return false;
2150 1.469 rillig
2151 1.469 rillig if (memcmp(p, word, wordLen) == 0 &&
2152 1.469 rillig (p[wordLen] == '\0' || p[wordLen] == ' '))
2153 1.553 rillig return true;
2154 1.469 rillig }
2155 1.553 rillig return false;
2156 1.469 rillig }
2157 1.469 rillig
2158 1.469 rillig /*
2159 1.469 rillig * XXX: Searching through a set of words with this linear search is
2160 1.469 rillig * inefficient for variables that contain thousands of words.
2161 1.469 rillig *
2162 1.469 rillig * XXX: The paths in this list don't seem to be normalized in any way.
2163 1.469 rillig */
2164 1.553 rillig static bool
2165 1.418 rillig VarContainsWord(const char *varname, const char *word)
2166 1.418 rillig {
2167 1.548 rillig FStr val = Var_Value(SCOPE_GLOBAL, varname);
2168 1.553 rillig bool found = val.str != NULL && StrContainsWord(val.str, word);
2169 1.505 rillig FStr_Done(&val);
2170 1.469 rillig return found;
2171 1.418 rillig }
2172 1.418 rillig
2173 1.524 rillig /*
2174 1.524 rillig * Track the makefiles we read - so makefiles can set dependencies on them.
2175 1.441 rillig * Avoid adding anything more than once.
2176 1.441 rillig *
2177 1.441 rillig * Time complexity: O(n) per call, in total O(n^2), where n is the number
2178 1.524 rillig * of makefiles that have been loaded.
2179 1.524 rillig */
2180 1.184 sjg static void
2181 1.593 rillig TrackInput(const char *name)
2182 1.184 sjg {
2183 1.696 rillig if (!VarContainsWord(".MAKE.MAKEFILES", name))
2184 1.696 rillig Global_Append(".MAKE.MAKEFILES", name);
2185 1.184 sjg }
2186 1.137 sjg
2187 1.44 aidan
2188 1.630 rillig /* Parse from the given buffer, later return to the current file. */
2189 1.5 cgd void
2190 1.661 rillig Parse_PushInput(const char *name, unsigned lineno, unsigned readLines,
2191 1.661 rillig Buffer buf, struct ForLoop *forLoop)
2192 1.5 cgd {
2193 1.627 rillig IncludedFile *curFile;
2194 1.469 rillig
2195 1.617 rillig if (forLoop != NULL)
2196 1.576 rillig name = CurFile()->name.str;
2197 1.469 rillig else
2198 1.593 rillig TrackInput(name);
2199 1.469 rillig
2200 1.661 rillig DEBUG3(PARSE, "Parse_PushInput: %s %s, line %u\n",
2201 1.617 rillig forLoop != NULL ? ".for loop in": "file", name, lineno);
2202 1.5 cgd
2203 1.469 rillig curFile = Vector_Push(&includes);
2204 1.576 rillig curFile->name = FStr_InitOwn(bmake_strdup(name));
2205 1.639 rillig curFile->lineno = lineno;
2206 1.639 rillig curFile->readLines = readLines;
2207 1.639 rillig curFile->forHeadLineno = lineno;
2208 1.639 rillig curFile->forBodyReadLines = readLines;
2209 1.616 rillig curFile->buf = buf;
2210 1.469 rillig curFile->depending = doing_depend; /* restore this on EOF */
2211 1.702 rillig curFile->guardState = forLoop == NULL ? GS_START : GS_NO;
2212 1.702 rillig curFile->guard = NULL;
2213 1.616 rillig curFile->forLoop = forLoop;
2214 1.469 rillig
2215 1.616 rillig if (forLoop != NULL && !For_NextIteration(forLoop, &curFile->buf))
2216 1.616 rillig abort(); /* see For_Run */
2217 1.469 rillig
2218 1.616 rillig curFile->buf_ptr = curFile->buf.data;
2219 1.616 rillig curFile->buf_end = curFile->buf.data + curFile->buf.len;
2220 1.687 rillig curFile->condMinDepth = cond_depth;
2221 1.593 rillig SetParseFile(name);
2222 1.5 cgd }
2223 1.5 cgd
2224 1.375 rillig /* Check if the directive is an include directive. */
2225 1.553 rillig static bool
2226 1.553 rillig IsInclude(const char *dir, bool sysv)
2227 1.228 christos {
2228 1.298 rillig if (dir[0] == 's' || dir[0] == '-' || (dir[0] == 'd' && !sysv))
2229 1.298 rillig dir++;
2230 1.228 christos
2231 1.298 rillig if (strncmp(dir, "include", 7) != 0)
2232 1.553 rillig return false;
2233 1.228 christos
2234 1.248 rillig /* Space is not mandatory for BSD .include */
2235 1.298 rillig return !sysv || ch_isspace(dir[7]);
2236 1.228 christos }
2237 1.228 christos
2238 1.228 christos
2239 1.5 cgd #ifdef SYSVINCLUDE
2240 1.284 rillig /* Check if the line is a SYSV include directive. */
2241 1.553 rillig static bool
2242 1.228 christos IsSysVInclude(const char *line)
2243 1.228 christos {
2244 1.228 christos const char *p;
2245 1.228 christos
2246 1.553 rillig if (!IsInclude(line, true))
2247 1.553 rillig return false;
2248 1.228 christos
2249 1.375 rillig /* Avoid interpreting a dependency line as an include */
2250 1.228 christos for (p = line; (p = strchr(p, ':')) != NULL;) {
2251 1.430 rillig
2252 1.430 rillig /* end of line -> it's a dependency */
2253 1.430 rillig if (*++p == '\0')
2254 1.553 rillig return false;
2255 1.430 rillig
2256 1.430 rillig /* '::' operator or ': ' -> it's a dependency */
2257 1.430 rillig if (*p == ':' || ch_isspace(*p))
2258 1.553 rillig return false;
2259 1.228 christos }
2260 1.553 rillig return true;
2261 1.228 christos }
2262 1.228 christos
2263 1.284 rillig /* Push to another file. The line points to the word "include". */
2264 1.5 cgd static void
2265 1.84 wiz ParseTraditionalInclude(char *line)
2266 1.5 cgd {
2267 1.469 rillig char *cp; /* current position in file spec */
2268 1.553 rillig bool done = false;
2269 1.553 rillig bool silent = line[0] != 'i';
2270 1.469 rillig char *file = line + (silent ? 8 : 7);
2271 1.469 rillig char *all_files;
2272 1.469 rillig
2273 1.586 rillig DEBUG1(PARSE, "ParseTraditionalInclude: %s\n", file);
2274 1.469 rillig
2275 1.469 rillig pp_skip_whitespace(&file);
2276 1.469 rillig
2277 1.694 rillig all_files = Var_Subst(file, SCOPE_CMDLINE, VARE_WANTRES);
2278 1.469 rillig /* TODO: handle errors */
2279 1.469 rillig
2280 1.469 rillig for (file = all_files; !done; file = cp + 1) {
2281 1.469 rillig /* Skip to end of line or next whitespace */
2282 1.469 rillig for (cp = file; *cp != '\0' && !ch_isspace(*cp); cp++)
2283 1.469 rillig continue;
2284 1.469 rillig
2285 1.469 rillig if (*cp != '\0')
2286 1.469 rillig *cp = '\0';
2287 1.469 rillig else
2288 1.553 rillig done = true;
2289 1.38 christos
2290 1.553 rillig IncludeFile(file, false, false, silent);
2291 1.469 rillig }
2292 1.580 rillig
2293 1.469 rillig free(all_files);
2294 1.5 cgd }
2295 1.5 cgd #endif
2296 1.5 cgd
2297 1.183 sjg #ifdef GMAKEEXPORT
2298 1.375 rillig /* Parse "export <variable>=<value>", and actually export it. */
2299 1.182 christos static void
2300 1.182 christos ParseGmakeExport(char *line)
2301 1.182 christos {
2302 1.469 rillig char *variable = line + 6;
2303 1.469 rillig char *value;
2304 1.182 christos
2305 1.586 rillig DEBUG1(PARSE, "ParseGmakeExport: %s\n", variable);
2306 1.182 christos
2307 1.469 rillig pp_skip_whitespace(&variable);
2308 1.182 christos
2309 1.526 rillig for (value = variable; *value != '\0' && *value != '='; value++)
2310 1.469 rillig continue;
2311 1.182 christos
2312 1.469 rillig if (*value != '=') {
2313 1.469 rillig Parse_Error(PARSE_FATAL,
2314 1.284 rillig "Variable/Value missing from \"export\"");
2315 1.469 rillig return;
2316 1.469 rillig }
2317 1.469 rillig *value++ = '\0'; /* terminate variable */
2318 1.323 rillig
2319 1.469 rillig /*
2320 1.469 rillig * Expand the value before putting it in the environment.
2321 1.469 rillig */
2322 1.694 rillig value = Var_Subst(value, SCOPE_CMDLINE, VARE_WANTRES);
2323 1.469 rillig /* TODO: handle errors */
2324 1.469 rillig
2325 1.469 rillig setenv(variable, value, 1);
2326 1.469 rillig free(value);
2327 1.182 christos }
2328 1.182 christos #endif
2329 1.182 christos
2330 1.469 rillig /*
2331 1.469 rillig * Called when EOF is reached in the current file. If we were reading an
2332 1.441 rillig * include file or a .for loop, the includes stack is popped and things set
2333 1.441 rillig * up to go back to reading the previous file at the previous location.
2334 1.1 cgd *
2335 1.1 cgd * Results:
2336 1.553 rillig * true to continue parsing, i.e. it had only reached the end of an
2337 1.553 rillig * included file, false if the main file has been parsed completely.
2338 1.1 cgd */
2339 1.553 rillig static bool
2340 1.123 dsl ParseEOF(void)
2341 1.1 cgd {
2342 1.627 rillig IncludedFile *curFile = CurFile();
2343 1.469 rillig
2344 1.616 rillig doing_depend = curFile->depending;
2345 1.616 rillig if (curFile->forLoop != NULL &&
2346 1.616 rillig For_NextIteration(curFile->forLoop, &curFile->buf)) {
2347 1.616 rillig curFile->buf_ptr = curFile->buf.data;
2348 1.616 rillig curFile->buf_end = curFile->buf.data + curFile->buf.len;
2349 1.627 rillig curFile->readLines = curFile->forBodyReadLines;
2350 1.616 rillig return true;
2351 1.615 rillig }
2352 1.469 rillig
2353 1.687 rillig Cond_EndFile();
2354 1.469 rillig
2355 1.702 rillig if (curFile->guardState == GS_DONE)
2356 1.702 rillig HashTable_Set(&guards, curFile->name.str, curFile->guard);
2357 1.702 rillig else if (curFile->guard != NULL) {
2358 1.702 rillig free(curFile->guard->name);
2359 1.702 rillig free(curFile->guard);
2360 1.700 rillig }
2361 1.700 rillig
2362 1.576 rillig FStr_Done(&curFile->name);
2363 1.616 rillig Buf_Done(&curFile->buf);
2364 1.647 rillig if (curFile->forLoop != NULL)
2365 1.647 rillig ForLoop_Free(curFile->forLoop);
2366 1.469 rillig Vector_Pop(&includes);
2367 1.155 dsl
2368 1.469 rillig if (includes.len == 0) {
2369 1.469 rillig /* We've run out of input */
2370 1.547 rillig Global_Delete(".PARSEDIR");
2371 1.547 rillig Global_Delete(".PARSEFILE");
2372 1.547 rillig Global_Delete(".INCLUDEDFROMDIR");
2373 1.547 rillig Global_Delete(".INCLUDEDFROMFILE");
2374 1.553 rillig return false;
2375 1.469 rillig }
2376 1.170 dholland
2377 1.469 rillig curFile = CurFile();
2378 1.661 rillig DEBUG2(PARSE, "ParseEOF: returning to file %s, line %u\n",
2379 1.641 rillig curFile->name.str, curFile->readLines + 1);
2380 1.1 cgd
2381 1.593 rillig SetParseFile(curFile->name.str);
2382 1.553 rillig return true;
2383 1.1 cgd }
2384 1.1 cgd
2385 1.493 rillig typedef enum ParseRawLineResult {
2386 1.493 rillig PRLR_LINE,
2387 1.493 rillig PRLR_EOF,
2388 1.493 rillig PRLR_ERROR
2389 1.493 rillig } ParseRawLineResult;
2390 1.493 rillig
2391 1.489 rillig /*
2392 1.492 rillig * Parse until the end of a line, taking into account lines that end with
2393 1.571 rillig * backslash-newline. The resulting line goes from out_line to out_line_end;
2394 1.571 rillig * the line is not null-terminated.
2395 1.489 rillig */
2396 1.493 rillig static ParseRawLineResult
2397 1.627 rillig ParseRawLine(IncludedFile *curFile, char **out_line, char **out_line_end,
2398 1.636 rillig char **out_firstBackslash, char **out_commentLineEnd)
2399 1.489 rillig {
2400 1.493 rillig char *line = curFile->buf_ptr;
2401 1.570 rillig char *buf_end = curFile->buf_end;
2402 1.492 rillig char *p = line;
2403 1.489 rillig char *line_end = line;
2404 1.492 rillig char *firstBackslash = NULL;
2405 1.636 rillig char *commentLineEnd = NULL;
2406 1.493 rillig ParseRawLineResult res = PRLR_LINE;
2407 1.489 rillig
2408 1.627 rillig curFile->readLines++;
2409 1.490 rillig
2410 1.489 rillig for (;;) {
2411 1.492 rillig char ch;
2412 1.492 rillig
2413 1.570 rillig if (p == buf_end) {
2414 1.493 rillig res = PRLR_EOF;
2415 1.489 rillig break;
2416 1.489 rillig }
2417 1.489 rillig
2418 1.492 rillig ch = *p;
2419 1.637 rillig if (ch == '\0' || (ch == '\\' && p[1] == '\0')) {
2420 1.492 rillig Parse_Error(PARSE_FATAL, "Zero byte read from file");
2421 1.493 rillig return PRLR_ERROR;
2422 1.489 rillig }
2423 1.489 rillig
2424 1.492 rillig /* Treat next character after '\' as literal. */
2425 1.489 rillig if (ch == '\\') {
2426 1.492 rillig if (firstBackslash == NULL)
2427 1.492 rillig firstBackslash = p;
2428 1.511 rillig if (p[1] == '\n') {
2429 1.627 rillig curFile->readLines++;
2430 1.570 rillig if (p + 2 == buf_end) {
2431 1.511 rillig line_end = p;
2432 1.511 rillig *line_end = '\n';
2433 1.511 rillig p += 2;
2434 1.511 rillig continue;
2435 1.511 rillig }
2436 1.511 rillig }
2437 1.492 rillig p += 2;
2438 1.492 rillig line_end = p;
2439 1.570 rillig assert(p <= buf_end);
2440 1.489 rillig continue;
2441 1.489 rillig }
2442 1.489 rillig
2443 1.489 rillig /*
2444 1.492 rillig * Remember the first '#' for comment stripping, unless
2445 1.492 rillig * the previous char was '[', as in the modifier ':[#]'.
2446 1.492 rillig */
2447 1.636 rillig if (ch == '#' && commentLineEnd == NULL &&
2448 1.492 rillig !(p > line && p[-1] == '['))
2449 1.636 rillig commentLineEnd = line_end;
2450 1.489 rillig
2451 1.492 rillig p++;
2452 1.489 rillig if (ch == '\n')
2453 1.489 rillig break;
2454 1.489 rillig
2455 1.489 rillig /* We are not interested in trailing whitespace. */
2456 1.489 rillig if (!ch_isspace(ch))
2457 1.492 rillig line_end = p;
2458 1.489 rillig }
2459 1.489 rillig
2460 1.635 rillig curFile->buf_ptr = p;
2461 1.490 rillig *out_line = line;
2462 1.489 rillig *out_line_end = line_end;
2463 1.492 rillig *out_firstBackslash = firstBackslash;
2464 1.636 rillig *out_commentLineEnd = commentLineEnd;
2465 1.493 rillig return res;
2466 1.489 rillig }
2467 1.489 rillig
2468 1.491 rillig /*
2469 1.491 rillig * Beginning at start, unescape '\#' to '#' and replace backslash-newline
2470 1.491 rillig * with a single space.
2471 1.491 rillig */
2472 1.485 rillig static void
2473 1.508 rillig UnescapeBackslash(char *line, char *start)
2474 1.487 rillig {
2475 1.638 rillig const char *src = start;
2476 1.491 rillig char *dst = start;
2477 1.491 rillig char *spaceStart = line;
2478 1.485 rillig
2479 1.485 rillig for (;;) {
2480 1.491 rillig char ch = *src++;
2481 1.485 rillig if (ch != '\\') {
2482 1.485 rillig if (ch == '\0')
2483 1.485 rillig break;
2484 1.491 rillig *dst++ = ch;
2485 1.485 rillig continue;
2486 1.485 rillig }
2487 1.485 rillig
2488 1.491 rillig ch = *src++;
2489 1.485 rillig if (ch == '\0') {
2490 1.635 rillig /* Delete '\\' at the end of the buffer. */
2491 1.491 rillig dst--;
2492 1.485 rillig break;
2493 1.485 rillig }
2494 1.485 rillig
2495 1.635 rillig /* Delete '\\' from before '#' on non-command lines. */
2496 1.635 rillig if (ch == '#' && line[0] != '\t')
2497 1.491 rillig *dst++ = ch;
2498 1.635 rillig else if (ch == '\n') {
2499 1.638 rillig cpp_skip_hspace(&src);
2500 1.635 rillig *dst++ = ' ';
2501 1.635 rillig } else {
2502 1.635 rillig /* Leave '\\' in the buffer for later. */
2503 1.491 rillig *dst++ = '\\';
2504 1.491 rillig *dst++ = ch;
2505 1.635 rillig /* Keep an escaped ' ' at the line end. */
2506 1.635 rillig spaceStart = dst;
2507 1.485 rillig }
2508 1.485 rillig }
2509 1.485 rillig
2510 1.487 rillig /* Delete any trailing spaces - eg from empty continuations */
2511 1.491 rillig while (dst > spaceStart && ch_isspace(dst[-1]))
2512 1.491 rillig dst--;
2513 1.491 rillig *dst = '\0';
2514 1.485 rillig }
2515 1.485 rillig
2516 1.593 rillig typedef enum LineKind {
2517 1.495 rillig /*
2518 1.498 rillig * Return the next line that is neither empty nor a comment.
2519 1.495 rillig * Backslash line continuations are folded into a single space.
2520 1.495 rillig * A trailing comment, if any, is discarded.
2521 1.495 rillig */
2522 1.593 rillig LK_NONEMPTY,
2523 1.495 rillig
2524 1.495 rillig /*
2525 1.498 rillig * Return the next line, even if it is empty or a comment.
2526 1.499 rillig * Preserve backslash-newline to keep the line numbers correct.
2527 1.495 rillig *
2528 1.495 rillig * Used in .for loops to collect the body of the loop while waiting
2529 1.495 rillig * for the corresponding .endfor.
2530 1.495 rillig */
2531 1.593 rillig LK_FOR_BODY,
2532 1.495 rillig
2533 1.495 rillig /*
2534 1.499 rillig * Return the next line that starts with a dot.
2535 1.495 rillig * Backslash line continuations are folded into a single space.
2536 1.495 rillig * A trailing comment, if any, is discarded.
2537 1.495 rillig *
2538 1.495 rillig * Used in .if directives to skip over irrelevant branches while
2539 1.495 rillig * waiting for the corresponding .endif.
2540 1.495 rillig */
2541 1.593 rillig LK_DOT
2542 1.593 rillig } LineKind;
2543 1.127 dsl
2544 1.640 rillig /*
2545 1.640 rillig * Return the next "interesting" logical line from the current file. The
2546 1.640 rillig * returned string will be freed at the end of including the file.
2547 1.640 rillig */
2548 1.127 dsl static char *
2549 1.593 rillig ReadLowLevelLine(LineKind kind)
2550 1.5 cgd {
2551 1.627 rillig IncludedFile *curFile = CurFile();
2552 1.639 rillig ParseRawLineResult res;
2553 1.469 rillig char *line;
2554 1.469 rillig char *line_end;
2555 1.492 rillig char *firstBackslash;
2556 1.636 rillig char *commentLineEnd;
2557 1.469 rillig
2558 1.127 dsl for (;;) {
2559 1.639 rillig curFile->lineno = curFile->readLines + 1;
2560 1.639 rillig res = ParseRawLine(curFile,
2561 1.636 rillig &line, &line_end, &firstBackslash, &commentLineEnd);
2562 1.493 rillig if (res == PRLR_ERROR)
2563 1.489 rillig return NULL;
2564 1.27 christos
2565 1.636 rillig if (line == line_end || line == commentLineEnd) {
2566 1.493 rillig if (res == PRLR_EOF)
2567 1.469 rillig return NULL;
2568 1.593 rillig if (kind != LK_FOR_BODY)
2569 1.494 rillig continue;
2570 1.469 rillig }
2571 1.5 cgd
2572 1.469 rillig /* We now have a line of data */
2573 1.514 rillig assert(ch_isspace(*line_end));
2574 1.469 rillig *line_end = '\0';
2575 1.5 cgd
2576 1.593 rillig if (kind == LK_FOR_BODY)
2577 1.499 rillig return line; /* Don't join the physical lines. */
2578 1.5 cgd
2579 1.593 rillig if (kind == LK_DOT && line[0] != '.')
2580 1.499 rillig continue;
2581 1.127 dsl break;
2582 1.127 dsl }
2583 1.5 cgd
2584 1.636 rillig if (commentLineEnd != NULL && line[0] != '\t')
2585 1.636 rillig *commentLineEnd = '\0';
2586 1.637 rillig if (firstBackslash != NULL)
2587 1.637 rillig UnescapeBackslash(line, firstBackslash);
2588 1.469 rillig return line;
2589 1.5 cgd }
2590 1.1 cgd
2591 1.553 rillig static bool
2592 1.593 rillig SkipIrrelevantBranches(void)
2593 1.501 rillig {
2594 1.640 rillig const char *line;
2595 1.501 rillig
2596 1.593 rillig while ((line = ReadLowLevelLine(LK_DOT)) != NULL) {
2597 1.604 rillig if (Cond_EvalLine(line) == CR_TRUE)
2598 1.640 rillig return true;
2599 1.501 rillig /*
2600 1.640 rillig * TODO: Check for typos in .elif directives such as .elsif
2601 1.640 rillig * or .elseif.
2602 1.501 rillig *
2603 1.640 rillig * This check will probably duplicate some of the code in
2604 1.640 rillig * ParseLine. Most of the code there cannot apply, only
2605 1.640 rillig * ParseVarassign and ParseDependencyLine can, and to prevent
2606 1.640 rillig * code duplication, these would need to be called with a
2607 1.640 rillig * flag called onlyCheckSyntax.
2608 1.501 rillig *
2609 1.501 rillig * See directive-elif.mk for details.
2610 1.501 rillig */
2611 1.501 rillig }
2612 1.501 rillig
2613 1.640 rillig return false;
2614 1.501 rillig }
2615 1.501 rillig
2616 1.553 rillig static bool
2617 1.500 rillig ParseForLoop(const char *line)
2618 1.500 rillig {
2619 1.500 rillig int rval;
2620 1.661 rillig unsigned forHeadLineno;
2621 1.661 rillig unsigned bodyReadLines;
2622 1.629 rillig int forLevel;
2623 1.500 rillig
2624 1.500 rillig rval = For_Eval(line);
2625 1.500 rillig if (rval == 0)
2626 1.553 rillig return false; /* Not a .for line */
2627 1.500 rillig if (rval < 0)
2628 1.553 rillig return true; /* Syntax error - error printed, ignore line */
2629 1.500 rillig
2630 1.642 rillig forHeadLineno = CurFile()->lineno;
2631 1.642 rillig bodyReadLines = CurFile()->readLines;
2632 1.642 rillig
2633 1.616 rillig /* Accumulate the loop body until the matching '.endfor'. */
2634 1.629 rillig forLevel = 1;
2635 1.500 rillig do {
2636 1.593 rillig line = ReadLowLevelLine(LK_FOR_BODY);
2637 1.500 rillig if (line == NULL) {
2638 1.500 rillig Parse_Error(PARSE_FATAL,
2639 1.572 rillig "Unexpected end of file in .for loop");
2640 1.500 rillig break;
2641 1.500 rillig }
2642 1.629 rillig } while (For_Accum(line, &forLevel));
2643 1.500 rillig
2644 1.639 rillig For_Run(forHeadLineno, bodyReadLines);
2645 1.616 rillig return true;
2646 1.500 rillig }
2647 1.500 rillig
2648 1.469 rillig /*
2649 1.482 rillig * Read an entire line from the input file.
2650 1.482 rillig *
2651 1.482 rillig * Empty lines, .if and .for are completely handled by this function,
2652 1.482 rillig * leaving only variable assignments, other directives, dependency lines
2653 1.482 rillig * and shell commands to the caller.
2654 1.1 cgd *
2655 1.638 rillig * Return a line without trailing whitespace, or NULL for EOF. The returned
2656 1.638 rillig * string will be freed at the end of including the file.
2657 1.1 cgd */
2658 1.1 cgd static char *
2659 1.593 rillig ReadHighLevelLine(void)
2660 1.1 cgd {
2661 1.500 rillig char *line;
2662 1.700 rillig CondResult condResult;
2663 1.469 rillig
2664 1.469 rillig for (;;) {
2665 1.700 rillig IncludedFile *curFile = CurFile();
2666 1.593 rillig line = ReadLowLevelLine(LK_NONEMPTY);
2667 1.669 rillig if (posix_state == PS_MAYBE_NEXT_LINE)
2668 1.669 rillig posix_state = PS_NOW_OR_NEVER;
2669 1.669 rillig else
2670 1.669 rillig posix_state = PS_TOO_LATE;
2671 1.469 rillig if (line == NULL)
2672 1.469 rillig return NULL;
2673 1.469 rillig
2674 1.702 rillig if (curFile->guardState != GS_NO
2675 1.702 rillig && ((curFile->guardState == GS_START && line[0] != '.')
2676 1.702 rillig || curFile->guardState == GS_DONE))
2677 1.702 rillig curFile->guardState = GS_NO;
2678 1.469 rillig if (line[0] != '.')
2679 1.469 rillig return line;
2680 1.469 rillig
2681 1.700 rillig condResult = Cond_EvalLine(line);
2682 1.702 rillig if (curFile->guardState == GS_START) {
2683 1.702 rillig Guard *guard;
2684 1.703 rillig if (condResult != CR_ERROR
2685 1.702 rillig && (guard = Cond_ExtractGuard(line)) != NULL) {
2686 1.702 rillig curFile->guardState = GS_COND;
2687 1.702 rillig curFile->guard = guard;
2688 1.700 rillig } else
2689 1.702 rillig curFile->guardState = GS_NO;
2690 1.700 rillig }
2691 1.700 rillig switch (condResult) {
2692 1.604 rillig case CR_FALSE: /* May also mean a syntax error. */
2693 1.593 rillig if (!SkipIrrelevantBranches())
2694 1.482 rillig return NULL;
2695 1.469 rillig continue;
2696 1.604 rillig case CR_TRUE:
2697 1.469 rillig continue;
2698 1.604 rillig case CR_ERROR: /* Not a conditional line */
2699 1.500 rillig if (ParseForLoop(line))
2700 1.469 rillig continue;
2701 1.500 rillig break;
2702 1.469 rillig }
2703 1.469 rillig return line;
2704 1.1 cgd }
2705 1.1 cgd }
2706 1.1 cgd
2707 1.331 rillig static void
2708 1.329 rillig FinishDependencyGroup(void)
2709 1.1 cgd {
2710 1.469 rillig GNodeListNode *ln;
2711 1.430 rillig
2712 1.469 rillig if (targets == NULL)
2713 1.469 rillig return;
2714 1.371 rillig
2715 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next) {
2716 1.469 rillig GNode *gn = ln->datum;
2717 1.371 rillig
2718 1.469 rillig Suff_EndTransform(gn);
2719 1.371 rillig
2720 1.469 rillig /*
2721 1.469 rillig * Mark the target as already having commands if it does, to
2722 1.469 rillig * keep from having shell commands on multiple dependency
2723 1.469 rillig * lines.
2724 1.469 rillig */
2725 1.469 rillig if (!Lst_IsEmpty(&gn->commands))
2726 1.469 rillig gn->type |= OP_HAS_COMMANDS;
2727 1.469 rillig }
2728 1.430 rillig
2729 1.469 rillig Lst_Free(targets);
2730 1.469 rillig targets = NULL;
2731 1.1 cgd }
2732 1.27 christos
2733 1.327 rillig /* Add the command to each target from the current dependency spec. */
2734 1.326 rillig static void
2735 1.375 rillig ParseLine_ShellCommand(const char *p)
2736 1.326 rillig {
2737 1.469 rillig cpp_skip_whitespace(&p);
2738 1.469 rillig if (*p == '\0')
2739 1.469 rillig return; /* skip empty commands */
2740 1.327 rillig
2741 1.469 rillig if (targets == NULL) {
2742 1.469 rillig Parse_Error(PARSE_FATAL,
2743 1.469 rillig "Unassociated shell command \"%s\"", p);
2744 1.469 rillig return;
2745 1.469 rillig }
2746 1.327 rillig
2747 1.469 rillig {
2748 1.469 rillig char *cmd = bmake_strdup(p);
2749 1.469 rillig GNodeListNode *ln;
2750 1.469 rillig
2751 1.469 rillig for (ln = targets->first; ln != NULL; ln = ln->next) {
2752 1.469 rillig GNode *gn = ln->datum;
2753 1.593 rillig GNode_AddCommand(gn, cmd);
2754 1.469 rillig }
2755 1.326 rillig #ifdef CLEANUP
2756 1.469 rillig Lst_Append(&targCmds, cmd);
2757 1.326 rillig #endif
2758 1.469 rillig }
2759 1.326 rillig }
2760 1.1 cgd
2761 1.683 rillig static void
2762 1.699 rillig HandleBreak(const char *arg)
2763 1.683 rillig {
2764 1.683 rillig IncludedFile *curFile = CurFile();
2765 1.683 rillig
2766 1.699 rillig if (arg[0] != '\0')
2767 1.699 rillig Parse_Error(PARSE_FATAL,
2768 1.699 rillig "The .break directive does not take arguments");
2769 1.699 rillig
2770 1.683 rillig if (curFile->forLoop != NULL) {
2771 1.683 rillig /* pretend we reached EOF */
2772 1.683 rillig For_Break(curFile->forLoop);
2773 1.687 rillig cond_depth = CurFile_CondMinDepth();
2774 1.683 rillig ParseEOF();
2775 1.683 rillig } else
2776 1.683 rillig Parse_Error(PARSE_FATAL, "break outside of for loop");
2777 1.683 rillig }
2778 1.683 rillig
2779 1.474 rillig /*
2780 1.477 rillig * See if the line starts with one of the known directives, and if so, handle
2781 1.477 rillig * the directive.
2782 1.474 rillig */
2783 1.553 rillig static bool
2784 1.379 rillig ParseDirective(char *line)
2785 1.379 rillig {
2786 1.474 rillig char *cp = line + 1;
2787 1.569 rillig const char *arg;
2788 1.569 rillig Substring dir;
2789 1.474 rillig
2790 1.474 rillig pp_skip_whitespace(&cp);
2791 1.553 rillig if (IsInclude(cp, false)) {
2792 1.556 rillig ParseInclude(cp);
2793 1.553 rillig return true;
2794 1.474 rillig }
2795 1.379 rillig
2796 1.569 rillig dir.start = cp;
2797 1.651 rillig while (ch_islower(*cp) || *cp == '-')
2798 1.475 rillig cp++;
2799 1.569 rillig dir.end = cp;
2800 1.475 rillig
2801 1.475 rillig if (*cp != '\0' && !ch_isspace(*cp))
2802 1.553 rillig return false;
2803 1.475 rillig
2804 1.475 rillig pp_skip_whitespace(&cp);
2805 1.475 rillig arg = cp;
2806 1.475 rillig
2807 1.683 rillig if (Substring_Equals(dir, "break"))
2808 1.699 rillig HandleBreak(arg);
2809 1.683 rillig else if (Substring_Equals(dir, "undef"))
2810 1.569 rillig Var_Undef(arg);
2811 1.581 rillig else if (Substring_Equals(dir, "export"))
2812 1.517 rillig Var_Export(VEM_PLAIN, arg);
2813 1.581 rillig else if (Substring_Equals(dir, "export-env"))
2814 1.517 rillig Var_Export(VEM_ENV, arg);
2815 1.581 rillig else if (Substring_Equals(dir, "export-literal"))
2816 1.476 rillig Var_Export(VEM_LITERAL, arg);
2817 1.581 rillig else if (Substring_Equals(dir, "unexport"))
2818 1.553 rillig Var_UnExport(false, arg);
2819 1.581 rillig else if (Substring_Equals(dir, "unexport-env"))
2820 1.553 rillig Var_UnExport(true, arg);
2821 1.581 rillig else if (Substring_Equals(dir, "info"))
2822 1.602 rillig HandleMessage(PARSE_INFO, "info", arg);
2823 1.581 rillig else if (Substring_Equals(dir, "warning"))
2824 1.602 rillig HandleMessage(PARSE_WARNING, "warning", arg);
2825 1.581 rillig else if (Substring_Equals(dir, "error"))
2826 1.602 rillig HandleMessage(PARSE_FATAL, "error", arg);
2827 1.581 rillig else
2828 1.581 rillig return false;
2829 1.581 rillig return true;
2830 1.379 rillig }
2831 1.379 rillig
2832 1.605 rillig bool
2833 1.605 rillig Parse_VarAssign(const char *line, bool finishDependencyGroup, GNode *scope)
2834 1.379 rillig {
2835 1.469 rillig VarAssign var;
2836 1.430 rillig
2837 1.469 rillig if (!Parse_IsVar(line, &var))
2838 1.553 rillig return false;
2839 1.605 rillig if (finishDependencyGroup)
2840 1.605 rillig FinishDependencyGroup();
2841 1.605 rillig Parse_Var(&var, scope);
2842 1.658 rillig free(var.varname);
2843 1.553 rillig return true;
2844 1.379 rillig }
2845 1.379 rillig
2846 1.700 rillig void
2847 1.700 rillig Parse_GuardElse(void)
2848 1.700 rillig {
2849 1.700 rillig IncludedFile *curFile = CurFile();
2850 1.700 rillig if (cond_depth == curFile->condMinDepth + 1)
2851 1.702 rillig curFile->guardState = GS_NO;
2852 1.700 rillig }
2853 1.700 rillig
2854 1.700 rillig void
2855 1.700 rillig Parse_GuardEndif(void)
2856 1.700 rillig {
2857 1.700 rillig IncludedFile *curFile = CurFile();
2858 1.702 rillig if (cond_depth == curFile->condMinDepth
2859 1.702 rillig && curFile->guardState == GS_COND)
2860 1.702 rillig curFile->guardState = GS_DONE;
2861 1.700 rillig }
2862 1.700 rillig
2863 1.380 rillig static char *
2864 1.380 rillig FindSemicolon(char *p)
2865 1.380 rillig {
2866 1.469 rillig int level = 0;
2867 1.469 rillig
2868 1.469 rillig for (; *p != '\0'; p++) {
2869 1.469 rillig if (*p == '\\' && p[1] != '\0') {
2870 1.469 rillig p++;
2871 1.469 rillig continue;
2872 1.469 rillig }
2873 1.380 rillig
2874 1.469 rillig if (*p == '$' && (p[1] == '(' || p[1] == '{'))
2875 1.469 rillig level++;
2876 1.469 rillig else if (level > 0 && (*p == ')' || *p == '}'))
2877 1.469 rillig level--;
2878 1.469 rillig else if (level == 0 && *p == ';')
2879 1.469 rillig break;
2880 1.469 rillig }
2881 1.469 rillig return p;
2882 1.380 rillig }
2883 1.380 rillig
2884 1.524 rillig /*
2885 1.654 rillig * dependency -> [target...] op [source...] [';' command]
2886 1.524 rillig * op -> ':' | '::' | '!'
2887 1.524 rillig */
2888 1.379 rillig static void
2889 1.555 rillig ParseDependencyLine(char *line)
2890 1.379 rillig {
2891 1.557 rillig VarEvalMode emode;
2892 1.469 rillig char *expanded_line;
2893 1.469 rillig const char *shellcmd = NULL;
2894 1.469 rillig
2895 1.469 rillig /*
2896 1.469 rillig * For some reason - probably to make the parser impossible -
2897 1.469 rillig * a ';' can be used to separate commands from dependencies.
2898 1.654 rillig * Attempt to skip over ';' inside substitution patterns.
2899 1.469 rillig */
2900 1.469 rillig {
2901 1.469 rillig char *semicolon = FindSemicolon(line);
2902 1.469 rillig if (*semicolon != '\0') {
2903 1.469 rillig /* Terminate the dependency list at the ';' */
2904 1.469 rillig *semicolon = '\0';
2905 1.469 rillig shellcmd = semicolon + 1;
2906 1.469 rillig }
2907 1.469 rillig }
2908 1.379 rillig
2909 1.469 rillig /*
2910 1.469 rillig * We now know it's a dependency line so it needs to have all
2911 1.469 rillig * variables expanded before being parsed.
2912 1.469 rillig *
2913 1.469 rillig * XXX: Ideally the dependency line would first be split into
2914 1.469 rillig * its left-hand side, dependency operator and right-hand side,
2915 1.469 rillig * and then each side would be expanded on its own. This would
2916 1.469 rillig * allow for the left-hand side to allow only defined variables
2917 1.469 rillig * and to allow variables on the right-hand side to be undefined
2918 1.469 rillig * as well.
2919 1.469 rillig *
2920 1.469 rillig * Parsing the line first would also prevent that targets
2921 1.469 rillig * generated from variable expressions are interpreted as the
2922 1.469 rillig * dependency operator, such as in "target${:U\:} middle: source",
2923 1.469 rillig * in which the middle is interpreted as a source, not a target.
2924 1.469 rillig */
2925 1.469 rillig
2926 1.583 rillig /*
2927 1.583 rillig * In lint mode, allow undefined variables to appear in dependency
2928 1.583 rillig * lines.
2929 1.469 rillig *
2930 1.583 rillig * Ideally, only the right-hand side would allow undefined variables
2931 1.583 rillig * since it is common to have optional dependencies. Having undefined
2932 1.583 rillig * variables on the left-hand side is more unusual though. Since
2933 1.583 rillig * both sides are expanded in a single pass, there is not much choice
2934 1.583 rillig * what to do here.
2935 1.469 rillig *
2936 1.583 rillig * In normal mode, it does not matter whether undefined variables are
2937 1.583 rillig * allowed or not since as of 2020-09-14, Var_Parse does not print
2938 1.583 rillig * any parse errors in such a case. It simply returns the special
2939 1.583 rillig * empty string var_Error, which cannot be detected in the result of
2940 1.583 rillig * Var_Subst.
2941 1.583 rillig */
2942 1.557 rillig emode = opts.strict ? VARE_WANTRES : VARE_UNDEFERR;
2943 1.694 rillig expanded_line = Var_Subst(line, SCOPE_CMDLINE, emode);
2944 1.469 rillig /* TODO: handle errors */
2945 1.469 rillig
2946 1.469 rillig /* Need a fresh list for the target nodes */
2947 1.469 rillig if (targets != NULL)
2948 1.469 rillig Lst_Free(targets);
2949 1.469 rillig targets = Lst_New();
2950 1.379 rillig
2951 1.556 rillig ParseDependency(expanded_line);
2952 1.469 rillig free(expanded_line);
2953 1.380 rillig
2954 1.469 rillig if (shellcmd != NULL)
2955 1.469 rillig ParseLine_ShellCommand(shellcmd);
2956 1.379 rillig }
2957 1.379 rillig
2958 1.381 rillig static void
2959 1.381 rillig ParseLine(char *line)
2960 1.381 rillig {
2961 1.477 rillig /*
2962 1.477 rillig * Lines that begin with '.' can be pretty much anything:
2963 1.477 rillig * - directives like '.include' or '.if',
2964 1.477 rillig * - suffix rules like '.c.o:',
2965 1.477 rillig * - dependencies for filenames that start with '.',
2966 1.477 rillig * - variable assignments like '.tmp=value'.
2967 1.477 rillig */
2968 1.474 rillig if (line[0] == '.' && ParseDirective(line))
2969 1.469 rillig return;
2970 1.381 rillig
2971 1.478 rillig if (line[0] == '\t') {
2972 1.469 rillig ParseLine_ShellCommand(line + 1);
2973 1.469 rillig return;
2974 1.469 rillig }
2975 1.381 rillig
2976 1.381 rillig #ifdef SYSVINCLUDE
2977 1.469 rillig if (IsSysVInclude(line)) {
2978 1.469 rillig /*
2979 1.469 rillig * It's an S3/S5-style "include".
2980 1.469 rillig */
2981 1.469 rillig ParseTraditionalInclude(line);
2982 1.469 rillig return;
2983 1.469 rillig }
2984 1.381 rillig #endif
2985 1.381 rillig
2986 1.381 rillig #ifdef GMAKEEXPORT
2987 1.469 rillig if (strncmp(line, "export", 6) == 0 && ch_isspace(line[6]) &&
2988 1.469 rillig strchr(line, ':') == NULL) {
2989 1.469 rillig /*
2990 1.469 rillig * It's a Gmake "export".
2991 1.469 rillig */
2992 1.469 rillig ParseGmakeExport(line);
2993 1.469 rillig return;
2994 1.469 rillig }
2995 1.381 rillig #endif
2996 1.381 rillig
2997 1.605 rillig if (Parse_VarAssign(line, true, SCOPE_GLOBAL))
2998 1.469 rillig return;
2999 1.381 rillig
3000 1.469 rillig FinishDependencyGroup();
3001 1.381 rillig
3002 1.555 rillig ParseDependencyLine(line);
3003 1.381 rillig }
3004 1.381 rillig
3005 1.469 rillig /*
3006 1.469 rillig * Parse a top-level makefile, incorporating its content into the global
3007 1.441 rillig * dependency graph.
3008 1.1 cgd */
3009 1.1 cgd void
3010 1.125 dsl Parse_File(const char *name, int fd)
3011 1.1 cgd {
3012 1.613 rillig char *line;
3013 1.616 rillig Buffer buf;
3014 1.170 dholland
3015 1.675 rillig buf = LoadFile(name, fd != -1 ? fd : STDIN_FILENO);
3016 1.613 rillig if (fd != -1)
3017 1.613 rillig (void)close(fd);
3018 1.1 cgd
3019 1.469 rillig assert(targets == NULL);
3020 1.44 aidan
3021 1.639 rillig Parse_PushInput(name, 1, 0, buf, NULL);
3022 1.1 cgd
3023 1.469 rillig do {
3024 1.593 rillig while ((line = ReadHighLevelLine()) != NULL) {
3025 1.661 rillig DEBUG2(PARSE, "Parsing line %u: %s\n",
3026 1.639 rillig CurFile()->lineno, line);
3027 1.469 rillig ParseLine(line);
3028 1.469 rillig }
3029 1.469 rillig /* Reached EOF, but it may be just EOF of an include file. */
3030 1.469 rillig } while (ParseEOF());
3031 1.1 cgd
3032 1.469 rillig FinishDependencyGroup();
3033 1.328 rillig
3034 1.561 rillig if (parseErrors != 0) {
3035 1.469 rillig (void)fflush(stdout);
3036 1.469 rillig (void)fprintf(stderr,
3037 1.655 rillig "%s: Fatal errors encountered -- cannot continue\n",
3038 1.469 rillig progname);
3039 1.655 rillig PrintOnError(NULL, "");
3040 1.469 rillig exit(1);
3041 1.469 rillig }
3042 1.1 cgd }
3043 1.1 cgd
3044 1.383 rillig /* Initialize the parsing module. */
3045 1.5 cgd void
3046 1.84 wiz Parse_Init(void)
3047 1.1 cgd {
3048 1.469 rillig mainNode = NULL;
3049 1.469 rillig parseIncPath = SearchPath_New();
3050 1.469 rillig sysIncPath = SearchPath_New();
3051 1.469 rillig defSysIncPath = SearchPath_New();
3052 1.627 rillig Vector_Init(&includes, sizeof(IncludedFile));
3053 1.700 rillig HashTable_Init(&guards);
3054 1.1 cgd }
3055 1.9 jtc
3056 1.383 rillig /* Clean up the parsing module. */
3057 1.9 jtc void
3058 1.84 wiz Parse_End(void)
3059 1.9 jtc {
3060 1.45 mycroft #ifdef CLEANUP
3061 1.700 rillig HashIter hi;
3062 1.700 rillig
3063 1.469 rillig Lst_DoneCall(&targCmds, free);
3064 1.469 rillig assert(targets == NULL);
3065 1.469 rillig SearchPath_Free(defSysIncPath);
3066 1.469 rillig SearchPath_Free(sysIncPath);
3067 1.469 rillig SearchPath_Free(parseIncPath);
3068 1.469 rillig assert(includes.len == 0);
3069 1.469 rillig Vector_Done(&includes);
3070 1.700 rillig HashIter_Init(&hi, &guards);
3071 1.702 rillig while (HashIter_Next(&hi) != NULL) {
3072 1.702 rillig Guard *guard = hi.entry->value;
3073 1.702 rillig free(guard->name);
3074 1.702 rillig free(guard);
3075 1.702 rillig }
3076 1.700 rillig HashTable_Done(&guards);
3077 1.45 mycroft #endif
3078 1.9 jtc }
3079 1.27 christos
3080 1.1 cgd
3081 1.697 rillig /* Populate the list with the single main target to create, or error out. */
3082 1.461 rillig void
3083 1.461 rillig Parse_MainName(GNodeList *mainList)
3084 1.1 cgd {
3085 1.469 rillig if (mainNode == NULL)
3086 1.469 rillig Punt("no target to make.");
3087 1.430 rillig
3088 1.527 rillig Lst_Append(mainList, mainNode);
3089 1.527 rillig if (mainNode->type & OP_DOUBLEDEP)
3090 1.469 rillig Lst_AppendAll(mainList, &mainNode->cohorts);
3091 1.441 rillig
3092 1.542 rillig Global_Append(".TARGETS", mainNode->name);
3093 1.59 christos }
3094 1.420 rillig
3095 1.420 rillig int
3096 1.561 rillig Parse_NumErrors(void)
3097 1.420 rillig {
3098 1.561 rillig return parseErrors;
3099 1.420 rillig }
3100