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