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