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