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