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