1 /* $OpenBSD: parse.c,v 1.132 2020/01/26 12:41:21 espie Exp $ */ 2 /* $NetBSD: parse.c,v 1.29 1997/03/10 21:20:04 christos Exp $ */ 3 4 /* 5 * Copyright (c) 1999 Marc Espie. 6 * 7 * Extensive code changes for the OpenBSD project. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS 19 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBSD 22 * PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 */ 30 /* 31 * Copyright (c) 1988, 1989, 1990, 1993 32 * The Regents of the University of California. All rights reserved. 33 * Copyright (c) 1989 by Berkeley Softworks 34 * All rights reserved. 35 * 36 * This code is derived from software contributed to Berkeley by 37 * Adam de Boor. 38 * 39 * Redistribution and use in source and binary forms, with or without 40 * modification, are permitted provided that the following conditions 41 * are met: 42 * 1. Redistributions of source code must retain the above copyright 43 * notice, this list of conditions and the following disclaimer. 44 * 2. Redistributions in binary form must reproduce the above copyright 45 * notice, this list of conditions and the following disclaimer in the 46 * documentation and/or other materials provided with the distribution. 47 * 3. Neither the name of the University nor the names of its contributors 48 * may be used to endorse or promote products derived from this software 49 * without specific prior written permission. 50 * 51 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 52 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 53 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 54 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 55 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 56 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 57 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 58 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 59 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 60 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 61 * SUCH DAMAGE. 62 */ 63 64 #include <assert.h> 65 #include <ctype.h> 66 #include <stddef.h> 67 #include <stdio.h> 68 #include <stdlib.h> 69 #include <string.h> 70 #include <ohash.h> 71 #include "config.h" 72 #include "defines.h" 73 #include "dir.h" 74 #include "direxpand.h" 75 #include "job.h" 76 #include "buf.h" 77 #include "for.h" 78 #include "lowparse.h" 79 #include "arch.h" 80 #include "cond.h" 81 #include "suff.h" 82 #include "parse.h" 83 #include "var.h" 84 #include "targ.h" 85 #include "error.h" 86 #include "str.h" 87 #include "main.h" 88 #include "gnode.h" 89 #include "memory.h" 90 #include "extern.h" 91 #include "lst.h" 92 #include "parsevar.h" 93 #include "stats.h" 94 #include "garray.h" 95 #include "node_int.h" 96 #include "nodehashconsts.h" 97 98 99 /* gsources and gtargets should be local to some functions, but they're 100 * set as persistent arrays for performance reasons. 101 */ 102 static struct growableArray gsources, gtargets; 103 static struct ohash htargets; 104 static bool htargets_setup = false; 105 #define SOURCES_SIZE 128 106 #define TARGETS_SIZE 32 107 108 static LIST theUserIncPath;/* list of directories for "..." includes */ 109 static LIST theSysIncPath; /* list of directories for <...> includes */ 110 Lst systemIncludePath = &theSysIncPath; 111 Lst userIncludePath = &theUserIncPath; 112 113 static GNode *mainNode; /* The main target to create. This is the 114 * first target on the first dependency 115 * line in the first makefile */ 116 /*- 117 * specType contains the special TYPE of the current target. It is 118 * SPECIAL_NONE if the target is unspecial. If it *is* special, however, 119 * the children are linked as children of the parent but not vice versa. 120 * This variable is set in ParseDoDependency 121 */ 122 123 static unsigned int specType; 124 static int waiting; 125 126 /* 127 * Predecessor node for handling .ORDER. Initialized to NULL when .ORDER 128 * seen, then set to each successive source on the line. 129 */ 130 static GNode *predecessor; 131 132 static void ParseLinkSrc(GNode *, GNode *); 133 static int ParseDoOp(GNode **, unsigned int); 134 static void ParseDoSpecial(GNode *, unsigned int); 135 static int ParseAddDep(GNode *, GNode *); 136 static void ParseDoSrc(struct growableArray *, struct growableArray *, int, 137 const char *, const char *); 138 static int ParseFindMain(void *, void *); 139 static void ParseClearPath(void *); 140 141 static void add_target_node(const char *, const char *); 142 static void add_target_nodes(const char *, const char *); 143 static void apply_op(struct growableArray *, unsigned int, GNode *); 144 static void ParseDoDependency(const char *); 145 static void ParseAddCmd(void *, void *); 146 static void ParseHasCommands(void *); 147 static bool handle_poison(const char *); 148 static bool handle_for_loop(Buffer, const char *); 149 static bool handle_undef(const char *); 150 #define ParseReadLoopLine(linebuf) Parse_ReadUnparsedLine(linebuf, "for loop") 151 static bool handle_bsd_command(Buffer, Buffer, const char *); 152 static bool register_target(GNode *, struct ohash *); 153 static char *strip_comments(Buffer, const char *); 154 static char *resolve_include_filename(const char *, const char *, bool); 155 static void handle_include_file(const char *, const char *, bool, bool); 156 static bool lookup_bsd_include(const char *); 157 static void lookup_sysv_style_include(const char *, const char *, bool); 158 static void lookup_sysv_include(const char *, const char *); 159 static void lookup_conditional_include(const char *, const char *); 160 static bool parse_as_special_line(Buffer, Buffer, const char *); 161 static unsigned int parse_operator(const char **); 162 163 static const char *parse_do_targets(Lst, unsigned int *, const char *); 164 static void parse_target_line(struct growableArray *, const char *, 165 const char *, bool *); 166 167 static void finish_commands(struct growableArray *); 168 static void parse_commands(struct growableArray *, const char *); 169 static void create_special_nodes(void); 170 static bool found_delimiter(const char *); 171 static unsigned int handle_special_targets(Lst); 172 static void dump_targets(void); 173 static void dedup_targets(struct growableArray *); 174 static void build_target_group(struct growableArray *, struct ohash *t); 175 static void reset_target_hash(void); 176 177 178 #define P(k) k, sizeof(k), K_##k 179 180 static struct { 181 const char *keyword; 182 size_t sz; 183 uint32_t hv; 184 unsigned int special; 185 unsigned int special_op; 186 } specials[] = { 187 { P(NODE_EXEC), SPECIAL_DEPRECATED, 0 }, 188 { P(NODE_IGNORE), SPECIAL_IGNORE, OP_IGNORE }, 189 { P(NODE_INCLUDES), SPECIAL_DEPRECATED, 0 }, 190 { P(NODE_INVISIBLE), SPECIAL_DEPRECATED, 0 }, 191 { P(NODE_JOIN), SPECIAL_DEPRECATED, 0 }, 192 { P(NODE_LIBS), SPECIAL_DEPRECATED, 0 }, 193 { P(NODE_MADE), SPECIAL_DEPRECATED, 0 }, 194 { P(NODE_MAIN), SPECIAL_MAIN, 0 }, 195 { P(NODE_MAKE), SPECIAL_MAKE, OP_MAKE }, 196 { P(NODE_MAKEFLAGS), SPECIAL_MFLAGS, 0 }, 197 { P(NODE_MFLAGS), SPECIAL_MFLAGS, 0 }, 198 { P(NODE_NOTMAIN), SPECIAL_NOTMAIN, OP_NOTMAIN }, 199 { P(NODE_NOTPARALLEL), SPECIAL_NOTPARALLEL, 0 }, 200 { P(NODE_NO_PARALLEL), SPECIAL_NOTPARALLEL, 0 }, 201 { P(NODE_NULL), SPECIAL_DEPRECATED, 0 }, 202 { P(NODE_OPTIONAL), SPECIAL_OPTIONAL, OP_OPTIONAL }, 203 { P(NODE_ORDER), SPECIAL_ORDER, 0 }, 204 { P(NODE_PARALLEL), SPECIAL_PARALLEL, 0 }, 205 { P(NODE_PATH), SPECIAL_PATH, 0 }, 206 { P(NODE_PHONY), SPECIAL_PHONY, OP_PHONY }, 207 { P(NODE_PRECIOUS), SPECIAL_PRECIOUS, OP_PRECIOUS }, 208 { P(NODE_RECURSIVE), SPECIAL_MAKE, OP_MAKE }, 209 { P(NODE_SILENT), SPECIAL_SILENT, OP_SILENT }, 210 { P(NODE_SINGLESHELL), SPECIAL_NOTHING, 0 }, 211 { P(NODE_SUFFIXES), SPECIAL_SUFFIXES, 0 }, 212 { P(NODE_USE), SPECIAL_USE, OP_USE }, 213 { P(NODE_WAIT), SPECIAL_WAIT, 0 }, 214 { P(NODE_CHEAP), SPECIAL_CHEAP, OP_CHEAP }, 215 { P(NODE_EXPENSIVE), SPECIAL_EXPENSIVE, OP_EXPENSIVE }, 216 { P(NODE_POSIX), SPECIAL_NOTHING, 0 }, 217 { P(NODE_SCCS_GET), SPECIAL_NOTHING, 0 }, 218 }; 219 220 #undef P 221 222 static void 223 create_special_nodes() 224 { 225 unsigned int i; 226 227 for (i = 0; i < sizeof(specials)/sizeof(specials[0]); i++) { 228 (void)Targ_mk_special_node(specials[i].keyword, 229 specials[i].sz, specials[i].hv, 230 OP_ZERO, specials[i].special, specials[i].special_op); 231 } 232 } 233 234 /*- 235 *--------------------------------------------------------------------- 236 * ParseLinkSrc -- 237 * Link the parent node to its new child. Used by 238 * ParseDoDependency. If the specType isn't 'Not', the parent 239 * isn't linked as a parent of the child. 240 * 241 * Side Effects: 242 * New elements are added to the parents list of cgn and the 243 * children list of cgn. the children_left field of pgn is updated 244 * to reflect the additional child. 245 *--------------------------------------------------------------------- 246 */ 247 static void 248 ParseLinkSrc(GNode *pgn, GNode *cgn) 249 { 250 if (Lst_AddNew(&pgn->children, cgn)) { 251 if (specType == SPECIAL_NONE) 252 Lst_AtEnd(&cgn->parents, pgn); 253 pgn->children_left++; 254 } 255 } 256 257 static char * 258 operator_string(int op) 259 { 260 /* XXX we don't bother freeing this, it's used for a fatal error 261 * anyways 262 */ 263 char *result = emalloc(5); 264 char *t = result; 265 if (op & OP_DEPENDS) { 266 *t++ = ':'; 267 } 268 if (op & OP_FORCE) { 269 *t++ = '!'; 270 } 271 if (op & OP_DOUBLEDEP) { 272 *t++ = ':'; 273 *t++ = ':'; 274 } 275 *t = 0; 276 return result; 277 } 278 279 /*- 280 *--------------------------------------------------------------------- 281 * ParseDoOp -- 282 * Apply the parsed operator to the given target node. Used in a 283 * Array_Find call by ParseDoDependency once all targets have 284 * been found and their operator parsed. If the previous and new 285 * operators are incompatible, a major error is taken, and the find 286 * stops early 287 * 288 * Side Effects: 289 * The node gets the right dependency operator. 290 * Cohorts may be created for double dep. 291 *--------------------------------------------------------------------- 292 */ 293 static int 294 ParseDoOp(GNode **gnp, unsigned int op) 295 { 296 GNode *gn = *gnp; 297 298 assert(op == (op & OP_OPMASK)); 299 300 /* if the node didn't already appear on the left hand side (no known 301 * dependency operator), we don't need to do much. */ 302 if (!OP_NOP(gn->type)) { 303 /* 304 * If the dependency mask of the operator and the node don't 305 * match and the node has actually had an operator applied to 306 * it before, and the operator actually has some dependency 307 * information in it, complain. */ 308 if (op != (gn->type & OP_OPMASK)) { 309 Parse_Error(PARSE_FATAL, 310 "Inconsistent dependency operator for target %s\n" 311 "\t(was %s%s, now %s%s)", 312 gn->name, gn->name, operator_string(gn->type), 313 gn->name, operator_string(op)); 314 return 0; 315 } 316 317 if (op == OP_DOUBLEDEP) { 318 /* If the node was the object of a :: operator, we need 319 * to create a new instance of it for the children and 320 * commands on this dependency line. The new instance 321 * is placed on the 'cohorts' list of the initial one 322 * (note the initial one is not on its own cohorts 323 * list) and the new instance is linked to all parents 324 * of the initial instance. */ 325 GNode *cohort; 326 LstNode ln; 327 328 cohort = Targ_NewGN(gn->name); 329 /* Duplicate links to parents so graph traversal is 330 * simple. Perhaps some type bits should be 331 * duplicated? 332 * 333 * Make the cohort invisible as well to avoid 334 * duplicating it into other variables. True, parents 335 * of this target won't tend to do anything with their 336 * local variables, but better safe than sorry. */ 337 for (ln = Lst_First(&gn->parents); ln != NULL; 338 ln = Lst_Adv(ln)) 339 ParseLinkSrc(Lst_Datum(ln), cohort); 340 cohort->type = OP_DOUBLEDEP|OP_INVISIBLE; 341 Lst_AtEnd(&gn->cohorts, cohort); 342 343 /* Replace the node in the targets list with the new 344 * copy */ 345 *gnp = cohort; 346 gn = cohort; 347 } 348 } 349 /* Preserve possible special flags already applied to the operator */ 350 gn->type |= op; 351 return 1; 352 } 353 354 static void 355 ParseDoSpecial(GNode *gn, unsigned int special_op) 356 { 357 gn->type |= special_op; 358 } 359 360 /*- 361 *--------------------------------------------------------------------- 362 * ParseAddDep -- 363 * Check if the pair of GNodes given needs to be synchronized. 364 * This has to be when two nodes are on different sides of a 365 * .WAIT directive. 366 * 367 * Results: 368 * Returns 0 if the two targets need to be ordered, 1 otherwise. 369 * If it returns 0, the search can stop. 370 * 371 * Side Effects: 372 * A dependency can be added between the two nodes. 373 * 374 *--------------------------------------------------------------------- 375 */ 376 static int 377 ParseAddDep(GNode *p, GNode *s) 378 { 379 if (p->order < s->order) { 380 /* XXX: This can cause cycles but finding them is hard 381 * and debugging output will show the problem. */ 382 Lst_AtEnd(&s->predecessors, p); 383 Lst_AtEnd(&p->successors, s); 384 return 1; 385 } else 386 return 0; 387 } 388 389 static void 390 apply_op(struct growableArray *targets, unsigned int op, GNode *gn) 391 { 392 if (op) 393 gn->type |= op; 394 else 395 Array_ForEach(targets, ParseLinkSrc, gn); 396 } 397 398 /*- 399 *--------------------------------------------------------------------- 400 * ParseDoSrc -- 401 * Given the name of a source, figure out if it is an attribute 402 * and apply it to the targets if it is. Else decide if there is 403 * some attribute which should be applied *to* the source because 404 * of some special target and apply it if so. Otherwise, make the 405 * source be a child of the targets in the list 'targets' 406 * 407 * Side Effects: 408 * Operator bits may be added to the list of targets or to the source. 409 * The targets may have a new source added to their lists of children. 410 *--------------------------------------------------------------------- 411 */ 412 static void 413 ParseDoSrc( 414 struct growableArray *targets, 415 struct growableArray *sources, 416 int tOp, /* operator (if any) from special targets */ 417 const char *src, /* name of the source to handle */ 418 const char *esrc) 419 { 420 GNode *gn = Targ_FindNodei(src, esrc, TARG_CREATE); 421 if (gn->special == SPECIAL_DEPRECATED) { 422 Parse_Error(PARSE_FATAL, "Deprecated keyword found %s\n", 423 gn->name); 424 return; 425 } 426 if (gn->special_op) { 427 Array_ForEach(targets, ParseDoSpecial, gn->special_op); 428 return; 429 } 430 if (gn->special == SPECIAL_WAIT) { 431 waiting++; 432 return; 433 } 434 435 switch (specType) { 436 case SPECIAL_MAIN: 437 /* 438 * If we have noted the existence of a .MAIN, it means we need 439 * to add the sources of said target to the list of things 440 * to create. Note that this will only be invoked if the user 441 * didn't specify a target on the command line. This is to 442 * allow #ifmake's to succeed, or something... 443 */ 444 Lst_AtEnd(create, gn->name); 445 /* 446 * Add the name to the .TARGETS variable as well, so the user 447 * can employ that, if desired. 448 */ 449 Var_Append(".TARGETS", gn->name); 450 return; 451 452 case SPECIAL_ORDER: 453 /* 454 * Create proper predecessor/successor links between the 455 * previous source and the current one. 456 */ 457 if (predecessor != NULL) { 458 Lst_AtEnd(&predecessor->successors, gn); 459 Lst_AtEnd(&gn->predecessors, predecessor); 460 } 461 predecessor = gn; 462 break; 463 464 default: 465 /* 466 * In the case of a source that was the object of a :: operator, 467 * the attribute is applied to all of its instances (as kept in 468 * the 'cohorts' list of the node) or all the cohorts are linked 469 * to all the targets. 470 */ 471 apply_op(targets, tOp, gn); 472 if ((gn->type & OP_OPMASK) == OP_DOUBLEDEP) { 473 LstNode ln; 474 475 for (ln=Lst_First(&gn->cohorts); ln != NULL; 476 ln = Lst_Adv(ln)){ 477 apply_op(targets, tOp, Lst_Datum(ln)); 478 } 479 } 480 break; 481 } 482 483 gn->order = waiting; 484 Array_AtEnd(sources, gn); 485 if (waiting) 486 Array_Find(sources, ParseAddDep, gn); 487 } 488 489 /*- 490 *----------------------------------------------------------------------- 491 * ParseFindMain -- 492 * Find a real target in the list and set it to be the main one. 493 * Called by ParseDoDependency when a main target hasn't been found 494 * yet. 495 * 496 * Results: 497 * 1 if main not found yet, 0 if it is. 498 * 499 * Side Effects: 500 * mainNode is changed and. 501 *----------------------------------------------------------------------- 502 */ 503 static int 504 ParseFindMain(void *gnp, void *dummy UNUSED) 505 { 506 GNode *gn = gnp; 507 508 if ((gn->type & OP_NOTARGET) == 0 && gn->special == SPECIAL_NONE) { 509 mainNode = gn; 510 return 0; 511 } else { 512 return 1; 513 } 514 } 515 516 /*- 517 *----------------------------------------------------------------------- 518 * ParseClearPath -- 519 * Reinit path to an empty path 520 *----------------------------------------------------------------------- 521 */ 522 static void 523 ParseClearPath(void *p) 524 { 525 Lst path = p; 526 527 Lst_Destroy(path, Dir_Destroy); 528 Lst_Init(path); 529 } 530 531 static void 532 add_target_node(const char *line, const char *end) 533 { 534 GNode *gn; 535 536 gn = Suff_ParseAsTransform(line, end); 537 538 if (gn == NULL) { 539 gn = Targ_FindNodei(line, end, TARG_CREATE); 540 gn->type &= ~OP_DUMMY; 541 } 542 543 Array_AtEnd(>argets, gn); 544 } 545 546 static void 547 add_target_nodes(const char *line, const char *end) 548 { 549 550 if (Dir_HasWildcardsi(line, end)) { 551 /* 552 * Targets are to be sought only in the current directory, 553 * so create an empty path for the thing. Note we need to 554 * use Dir_Destroy in the destruction of the path as the 555 * Dir module could have added a directory to the path... 556 */ 557 char *targName; 558 LIST emptyPath; 559 LIST curTargs; 560 561 Lst_Init(&emptyPath); 562 Lst_Init(&curTargs); 563 Dir_Expandi(line, end, &emptyPath, &curTargs); 564 Lst_Destroy(&emptyPath, Dir_Destroy); 565 while ((targName = Lst_DeQueue(&curTargs)) != NULL) { 566 add_target_node(targName, targName + strlen(targName)); 567 } 568 Lst_Destroy(&curTargs, NOFREE); 569 } else { 570 add_target_node(line, end); 571 } 572 } 573 574 /* special target line check: a proper delimiter is a ':' or '!', but 575 * we don't want to end a target on such a character if there is a better 576 * match later on. 577 * By "better" I mean one that is followed by whitespace. This allows the 578 * user to have targets like: 579 * fie::fi:fo: fum 580 * where "fie::fi:fo" is the target. In real life this is used for perl5 581 * library man pages where "::" separates an object from its class. Ie: 582 * "File::Spec::Unix". 583 * This behaviour is also consistent with other versions of make. 584 */ 585 static bool 586 found_delimiter(const char *s) 587 { 588 if (*s == '!' || *s == ':') { 589 const char *p = s + 1; 590 591 if (*s == ':' && *p == ':') 592 p++; 593 594 /* Found the best match already. */ 595 if (ISSPACE(*p) || *p == '\0') 596 return true; 597 598 do { 599 p += strcspn(p, "!:"); 600 if (*p == '\0') 601 break; 602 p++; 603 } while (*p != '\0' && !ISSPACE(*p)); 604 605 /* No better match later on... */ 606 if (*p == '\0') 607 return true; 608 } 609 return false; 610 } 611 612 static const char * 613 parse_do_targets(Lst paths, unsigned int *op, const char *line) 614 { 615 const char *cp; 616 617 do { 618 for (cp = line; *cp && !ISSPACE(*cp) && *cp != '(';) { 619 if (*cp == '$') 620 /* Must be a dynamic source (would have been 621 * expanded otherwise), so call the Var module 622 * to parse the puppy so we can safely advance 623 * beyond it...There should be no errors in 624 * this, as they would have been discovered in 625 * the initial Var_Subst and we wouldn't be 626 * here. */ 627 Var_ParseSkip(&cp, NULL); 628 else { 629 if (found_delimiter(cp)) 630 break; 631 cp++; 632 } 633 } 634 635 if (*cp == '(') { 636 LIST temp; 637 Lst_Init(&temp); 638 /* Archives must be handled specially to make sure the 639 * OP_ARCHV flag is set in their 'type' field, for one 640 * thing, and because things like "archive(file1.o 641 * file2.o file3.o)" are permissible. 642 * Arch_ParseArchive will set 'line' to be the first 643 * non-blank after the archive-spec. It creates/finds 644 * nodes for the members and places them on the given 645 * list, returning true if all went well and false if 646 * there was an error in the specification. On error, 647 * line should remain untouched. */ 648 if (!Arch_ParseArchive(&line, &temp, NULL)) { 649 Parse_Error(PARSE_FATAL, 650 "Error in archive specification: \"%s\"", 651 line); 652 return NULL; 653 } else { 654 AppendList2Array(&temp, >argets); 655 Lst_Destroy(&temp, NOFREE); 656 cp = line; 657 continue; 658 } 659 } 660 if (*cp == '\0') { 661 /* Ending a dependency line without an operator is a 662 * Bozo no-no */ 663 /* Deeper check for cvs conflicts */ 664 if (gtargets.n > 0 && 665 (strcmp(gtargets.a[0]->name, "<<<<<<<") == 0 || 666 strcmp(gtargets.a[0]->name, ">>>>>>>") == 0)) { 667 Parse_Error(PARSE_FATAL, 668 "Need an operator (likely from a cvs update conflict)"); 669 } else { 670 Parse_Error(PARSE_FATAL, 671 "Need an operator in '%s'", line); 672 } 673 return NULL; 674 } 675 /* 676 * Have word in line. Get or create its nodes and stick it at 677 * the end of the targets list 678 */ 679 if (*line != '\0') 680 add_target_nodes(line, cp); 681 682 while (ISSPACE(*cp)) 683 cp++; 684 line = cp; 685 } while (*line != '!' && *line != ':' && *line); 686 *op = handle_special_targets(paths); 687 return cp; 688 } 689 690 static void 691 dump_targets() 692 { 693 size_t i; 694 for (i = 0; i < gtargets.n; i++) 695 fprintf(stderr, "%s", gtargets.a[i]->name); 696 fprintf(stderr, "\n"); 697 } 698 699 static unsigned int 700 handle_special_targets(Lst paths) 701 { 702 size_t i; 703 int seen_path = 0; 704 int seen_special = 0; 705 int seen_normal = 0; 706 int type; 707 708 for (i = 0; i < gtargets.n; i++) { 709 type = gtargets.a[i]->special; 710 if (type == SPECIAL_DEPRECATED) { 711 Parse_Error(PARSE_FATAL, 712 "Deprecated keyword found %s\n", 713 gtargets.a[i]->name); 714 specType = SPECIAL_ERROR; 715 return 0; 716 } 717 if (type == SPECIAL_PATH) { 718 seen_path++; 719 Lst_AtEnd(paths, find_suffix_path(gtargets.a[i])); 720 } else if (type != 0) 721 seen_special++; 722 else 723 seen_normal++; 724 } 725 if ((seen_path != 0) + (seen_special != 0) + (seen_normal != 0) > 1) { 726 Parse_Error(PARSE_FATAL, "Wrong mix of special targets"); 727 dump_targets(); 728 specType = SPECIAL_ERROR; 729 return 0; 730 } 731 if (seen_normal != 0) { 732 specType = SPECIAL_NONE; 733 return 0; 734 } else if (seen_path != 0) { 735 specType = SPECIAL_PATH; 736 return 0; 737 } else if (seen_special == 0) { 738 specType = SPECIAL_NONE; 739 return 0; 740 } else if (seen_special != 1) { 741 Parse_Error(PARSE_FATAL, 742 "Mixing special targets is not allowed"); 743 dump_targets(); 744 return 0; 745 } else if (seen_special == 1) { 746 specType = gtargets.a[0]->special; 747 switch (specType) { 748 case SPECIAL_MAIN: 749 if (!Lst_IsEmpty(create)) { 750 specType = SPECIAL_NONE; 751 } 752 break; 753 case SPECIAL_NOTPARALLEL: 754 set_notparallel(); 755 break; 756 case SPECIAL_ORDER: 757 predecessor = NULL; 758 break; 759 default: 760 break; 761 } 762 return gtargets.a[0]->special_op; 763 } else { 764 /* we're allowed to have 0 target */ 765 specType = SPECIAL_NONE; 766 return 0; 767 } 768 } 769 770 static unsigned int 771 parse_operator(const char **pos) 772 { 773 const char *cp = *pos; 774 unsigned int op = OP_ERROR; 775 776 if (*cp == '!') { 777 op = OP_FORCE; 778 } else if (*cp == ':') { 779 if (cp[1] == ':') { 780 op = OP_DOUBLEDEP; 781 cp++; 782 } else { 783 op = OP_DEPENDS; 784 } 785 } else { 786 Parse_Error(PARSE_FATAL, "Missing dependency operator"); 787 return OP_ERROR; 788 } 789 790 cp++; /* Advance beyond operator */ 791 792 /* Get to the first source */ 793 while (ISSPACE(*cp)) 794 cp++; 795 *pos = cp; 796 return op; 797 } 798 799 /*- 800 *--------------------------------------------------------------------- 801 * ParseDoDependency -- 802 * Parse the dependency line in line. 803 * 804 * Side Effects: 805 * The nodes of the sources are linked as children to the nodes of the 806 * targets. Some nodes may be created. 807 * 808 * We parse a dependency line by first extracting words from the line and 809 * finding nodes in the list of all targets with that name. This is done 810 * until a character is encountered which is an operator character. Currently 811 * these are only ! and :. At this point the operator is parsed and the 812 * pointer into the line advanced until the first source is encountered. 813 * The parsed operator is applied to each node in the 'targets' list, 814 * which is where the nodes found for the targets are kept, by means of 815 * the ParseDoOp function. 816 * The sources are read in much the same way as the targets were except 817 * that now they are expanded using the wildcarding scheme of the C-Shell 818 * and all instances of the resulting words in the list of all targets 819 * are found. Each of the resulting nodes is then linked to each of the 820 * targets as one of its children. 821 * Certain targets are handled specially. These are the ones detailed 822 * by the specType variable. 823 * The storing of transformation rules is also taken care of here. 824 * A target is recognized as a transformation rule by calling 825 * Suff_IsTransform. If it is a transformation rule, its node is gotten 826 * from the suffix module via Suff_AddTransform rather than the standard 827 * Targ_FindNode in the target module. 828 *--------------------------------------------------------------------- 829 */ 830 static void 831 ParseDoDependency(const char *line) /* the line to parse */ 832 { 833 const char *cp; /* our current position */ 834 unsigned int op; /* the operator on the line */ 835 LIST paths; /* List of search paths to alter when parsing 836 * a list of .PATH targets */ 837 unsigned int tOp; /* operator from special target */ 838 839 waiting = 0; 840 Lst_Init(&paths); 841 842 Array_Reset(&gsources); 843 844 cp = parse_do_targets(&paths, &tOp, line); 845 assert(specType == SPECIAL_PATH || Lst_IsEmpty(&paths)); 846 if (cp == NULL || specType == SPECIAL_ERROR) { 847 /* invalidate targets for further processing */ 848 Array_Reset(>argets); 849 return; 850 } 851 852 op = parse_operator(&cp); 853 if (op == OP_ERROR) { 854 /* invalidate targets for further processing */ 855 Array_Reset(>argets); 856 return; 857 } 858 859 Array_FindP(>argets, ParseDoOp, op); 860 dedup_targets(>argets); 861 862 line = cp; 863 864 /* Several special targets have specific semantics with no source: 865 * .SUFFIXES clears out all old suffixes 866 * .PRECIOUS/.IGNORE/.SILENT 867 * apply to all target 868 * .PATH clears out all search paths. */ 869 if (!*line) { 870 switch (specType) { 871 case SPECIAL_SUFFIXES: 872 Suff_DisableAllSuffixes(); 873 break; 874 case SPECIAL_PRECIOUS: 875 allPrecious = true; 876 break; 877 case SPECIAL_IGNORE: 878 ignoreErrors = true; 879 break; 880 case SPECIAL_SILENT: 881 beSilent = true; 882 break; 883 case SPECIAL_PATH: 884 Lst_Every(&paths, ParseClearPath); 885 break; 886 default: 887 break; 888 } 889 } else if (specType == SPECIAL_MFLAGS) { 890 Main_ParseArgLine(line); 891 return; 892 } else if (specType == SPECIAL_NOTPARALLEL) { 893 return; 894 } 895 896 /* NOW GO FOR THE SOURCES */ 897 if (specType == SPECIAL_SUFFIXES || specType == SPECIAL_PATH || 898 specType == SPECIAL_NOTHING) { 899 while (*line) { 900 /* Some special targets take a list of space-separated 901 * words. For each word, 902 * 903 * if .SUFFIXES, add it to the list of suffixes maintained 904 * by suff.c. 905 * 906 * if .PATHS, add it as a directory on the main search path. 907 * 908 * if .LIBS/.INCLUDE/.NULL... this has been deprecated, 909 * ignore 910 */ 911 while (*cp && !ISSPACE(*cp)) 912 cp++; 913 switch (specType) { 914 case SPECIAL_SUFFIXES: 915 Suff_AddSuffixi(line, cp); 916 break; 917 case SPECIAL_PATH: 918 { 919 LstNode ln; 920 921 for (ln = Lst_First(&paths); ln != NULL; 922 ln = Lst_Adv(ln)) 923 Dir_AddDiri(Lst_Datum(ln), line, cp); 924 break; 925 Lst_Destroy(&paths, NOFREE); 926 } 927 default: 928 break; 929 } 930 if (*cp != '\0') 931 cp++; 932 while (ISSPACE(*cp)) 933 cp++; 934 line = cp; 935 } 936 } else { 937 while (*line) { 938 /* 939 * The targets take real sources, so we must beware of 940 * archive specifications (i.e. things with left 941 * parentheses in them) and handle them accordingly. 942 */ 943 while (*cp && !ISSPACE(*cp)) { 944 if (*cp == '(' && cp > line && cp[-1] != '$') { 945 /* 946 * Only stop for a left parenthesis if 947 * it isn't at the start of a word 948 * (that'll be for variable changes 949 * later) and isn't preceded by a 950 * dollar sign (a dynamic source). 951 */ 952 break; 953 } else { 954 cp++; 955 } 956 } 957 958 if (*cp == '(') { 959 GNode *gn; 960 LIST sources; /* list of archive source 961 * names after expansion */ 962 963 Lst_Init(&sources); 964 if (!Arch_ParseArchive(&line, &sources, NULL)) { 965 Parse_Error(PARSE_FATAL, 966 "Error in source archive spec \"%s\"", 967 line); 968 return; 969 } 970 971 while ((gn = Lst_DeQueue(&sources)) != NULL) 972 ParseDoSrc(>argets, &gsources, tOp, 973 gn->name, NULL); 974 cp = line; 975 } else { 976 const char *endSrc = cp; 977 978 ParseDoSrc(>argets, &gsources, tOp, line, 979 endSrc); 980 if (*cp) 981 cp++; 982 } 983 while (ISSPACE(*cp)) 984 cp++; 985 line = cp; 986 } 987 } 988 989 if (mainNode == NULL) { 990 /* If we have yet to decide on a main target to make, in the 991 * absence of any user input, we want the first target on 992 * the first dependency line that is actually a real target 993 * (i.e. isn't a .USE or .EXEC rule) to be made. */ 994 Array_Find(>argets, ParseFindMain, NULL); 995 } 996 } 997 998 /*- 999 * ParseAddCmd -- 1000 * Lst_ForEach function to add a command line to all targets 1001 * 1002 * The new command may be added to the commands list of the node. 1003 * 1004 * If the target already had commands, we ignore the new ones, but 1005 * we note that we got double commands (in case we actually get to run 1006 * that ambiguous target). 1007 * 1008 * Note this does not apply to :: dependency lines, since those 1009 * will generate fresh cloned nodes and add them to the cohorts 1010 * field of the main node. 1011 */ 1012 static void 1013 ParseAddCmd(void *gnp, void *cmd) 1014 { 1015 GNode *gn = gnp; 1016 1017 if (!(gn->type & OP_HAS_COMMANDS)) 1018 Lst_AtEnd(&gn->commands, cmd); 1019 else 1020 gn->type |= OP_DOUBLE; 1021 } 1022 1023 /*- 1024 *----------------------------------------------------------------------- 1025 * ParseHasCommands -- 1026 * Record that the target gained commands through OP_HAS_COMMANDS, 1027 * so that double command lists may be ignored. 1028 *----------------------------------------------------------------------- 1029 */ 1030 static void 1031 ParseHasCommands(void *gnp) 1032 { 1033 GNode *gn = gnp; 1034 gn->type |= OP_HAS_COMMANDS; 1035 1036 } 1037 1038 1039 /* Strip comments from line. Build a copy in buffer if necessary, */ 1040 static char * 1041 strip_comments(Buffer copy, const char *line) 1042 { 1043 const char *comment; 1044 const char *p; 1045 1046 comment = strchr(line, '#'); 1047 if (comment == NULL) 1048 return (char *)line; 1049 else { 1050 Buf_Reset(copy); 1051 1052 for (p = line; *p != '\0'; p++) { 1053 if (*p == '\\') { 1054 if (p[1] == '#') { 1055 Buf_Addi(copy, line, p); 1056 Buf_AddChar(copy, '#'); 1057 line = p+2; 1058 } 1059 if (p[1] != '\0') 1060 p++; 1061 } else if (*p == '#') 1062 break; 1063 } 1064 Buf_Addi(copy, line, p); 1065 return Buf_Retrieve(copy); 1066 } 1067 } 1068 1069 1070 1071 /*** 1072 *** Support for various include constructs 1073 ***/ 1074 1075 1076 void 1077 Parse_AddIncludeDir(const char *dir) 1078 { 1079 Dir_AddDir(userIncludePath, dir); 1080 } 1081 1082 static char * 1083 resolve_include_filename(const char *file, const char *efile, bool isSystem) 1084 { 1085 char *fullname; 1086 1087 /* Look up system files on the system path first */ 1088 if (isSystem) { 1089 fullname = Dir_FindFileNoDoti(file, efile, systemIncludePath); 1090 if (fullname) 1091 return fullname; 1092 } 1093 1094 /* Handle non-system non-absolute files... */ 1095 if (!isSystem && file[0] != '/') { 1096 /* ... by looking first under the same directory as the 1097 * current file */ 1098 char *slash = NULL; 1099 const char *fname; 1100 1101 fname = Parse_Getfilename(); 1102 1103 if (fname != NULL) 1104 slash = strrchr(fname, '/'); 1105 1106 if (slash != NULL) { 1107 char *newName; 1108 1109 newName = Str_concati(fname, slash, file, efile, '/'); 1110 fullname = Dir_FindFile(newName, userIncludePath); 1111 if (fullname == NULL) 1112 fullname = Dir_FindFile(newName, defaultPath); 1113 free(newName); 1114 if (fullname) 1115 return fullname; 1116 } 1117 } 1118 1119 /* Now look first on the -I search path, then on the .PATH 1120 * search path, if not found in a -I directory. 1121 * XXX: Suffix specific? */ 1122 fullname = Dir_FindFilei(file, efile, userIncludePath); 1123 if (fullname) 1124 return fullname; 1125 fullname = Dir_FindFilei(file, efile, defaultPath); 1126 if (fullname) 1127 return fullname; 1128 1129 /* Still haven't found the makefile. Look for it on the system 1130 * path as a last resort (if we haven't already). */ 1131 if (isSystem) 1132 return NULL; 1133 else 1134 return Dir_FindFilei(file, efile, systemIncludePath); 1135 } 1136 1137 static void 1138 handle_include_file(const char *file, const char *efile, bool isSystem, 1139 bool errIfNotFound) 1140 { 1141 char *fullname; 1142 1143 fullname = resolve_include_filename(file, efile, isSystem); 1144 if (fullname == NULL && errIfNotFound) 1145 Parse_Error(PARSE_FATAL, "Could not find %.*s", 1146 (int)(efile - file), file); 1147 1148 if (fullname != NULL) { 1149 FILE *f; 1150 1151 f = fopen(fullname, "r"); 1152 if (f == NULL && errIfNotFound) 1153 Parse_Error(PARSE_FATAL, "Cannot open %s", fullname); 1154 else 1155 Parse_FromFile(fullname, f); 1156 } 1157 } 1158 1159 /* .include <file> (system) or .include "file" (normal) */ 1160 static bool 1161 lookup_bsd_include(const char *file) 1162 { 1163 char endc; 1164 const char *efile; 1165 char *file2; 1166 bool isSystem; 1167 1168 /* find starting delimiter */ 1169 while (ISSPACE(*file)) 1170 file++; 1171 1172 /* determine type of file */ 1173 if (*file == '<') { 1174 isSystem = true; 1175 endc = '>'; 1176 } else if (*file == '"') { 1177 isSystem = false; 1178 endc = '"'; 1179 } else { 1180 Parse_Error(PARSE_WARNING, 1181 ".include filename must be delimited by '\"' or '<'"); 1182 return false; 1183 } 1184 1185 /* delimit file name between file and efile */ 1186 for (efile = ++file; *efile != endc; efile++) { 1187 if (*efile == '\0') { 1188 Parse_Error(PARSE_WARNING, 1189 "Unclosed .include filename. '%c' expected", endc); 1190 return false; 1191 } 1192 } 1193 /* Substitute for any variables in the file name before trying to 1194 * find the thing. */ 1195 file2 = Var_Substi(file, efile, NULL, false); 1196 handle_include_file(file2, strchr(file2, '\0'), isSystem, true); 1197 free(file2); 1198 return true; 1199 } 1200 1201 1202 static void 1203 lookup_sysv_style_include(const char *line, const char *directive, 1204 bool errIfMissing) 1205 { 1206 char *file; 1207 char *name; 1208 char *ename; 1209 bool okay = false; 1210 1211 /* Substitute for any variables in the file name before trying to 1212 * find the thing. */ 1213 file = Var_Subst(line, NULL, false); 1214 1215 /* sys5 allows for list of files separated by spaces */ 1216 name = file; 1217 while (1) { 1218 /* find beginning of name */ 1219 while (ISSPACE(*name)) 1220 name++; 1221 if (*name == '\0') 1222 break; 1223 for (ename = name; *ename != '\0' && !ISSPACE(*ename);) 1224 ename++; 1225 handle_include_file(name, ename, true, errIfMissing); 1226 okay = true; 1227 name = ename; 1228 } 1229 1230 free(file); 1231 if (!okay) { 1232 Parse_Error(PARSE_FATAL, "Filename missing from \"%s\"", 1233 directive); 1234 } 1235 } 1236 1237 1238 /* system V construct: include file */ 1239 static void 1240 lookup_sysv_include(const char *file, const char *directive) 1241 { 1242 lookup_sysv_style_include(file, directive, true); 1243 } 1244 1245 1246 /* sinclude file and -include file */ 1247 static void 1248 lookup_conditional_include(const char *file, const char *directive) 1249 { 1250 lookup_sysv_style_include(file, directive, false); 1251 } 1252 1253 1254 /*** 1255 *** BSD-specific . constructs 1256 *** They all follow the same pattern: 1257 *** if the syntax matches BSD stuff, then we're committed to handle 1258 *** them and report fatal errors (like, include file not existing) 1259 *** otherwise, we return false, and hope somebody else will handle it. 1260 ***/ 1261 1262 static bool 1263 handle_poison(const char *line) 1264 { 1265 const char *p = line; 1266 int type = POISON_NORMAL; 1267 bool not = false; 1268 bool paren_to_match = false; 1269 const char *name, *ename; 1270 1271 while (ISSPACE(*p)) 1272 p++; 1273 if (*p == '!') { 1274 not = true; 1275 p++; 1276 } 1277 while (ISSPACE(*p)) 1278 p++; 1279 if (strncmp(p, "defined", 7) == 0) { 1280 type = POISON_DEFINED; 1281 p += 7; 1282 } else if (strncmp(p, "empty", 5) == 0) { 1283 type = POISON_EMPTY; 1284 p += 5; 1285 } 1286 while (ISSPACE(*p)) 1287 p++; 1288 if (*p == '(') { 1289 paren_to_match = true; 1290 p++; 1291 } 1292 while (ISSPACE(*p)) 1293 p++; 1294 name = ename = p; 1295 while (*p != '\0' && !ISSPACE(*p)) { 1296 if (*p == ')' && paren_to_match) { 1297 paren_to_match = false; 1298 p++; 1299 break; 1300 } 1301 p++; 1302 ename = p; 1303 } 1304 while (ISSPACE(*p)) 1305 p++; 1306 switch(type) { 1307 case POISON_NORMAL: 1308 case POISON_EMPTY: 1309 if (not) 1310 type = POISON_INVALID; 1311 break; 1312 case POISON_DEFINED: 1313 if (not) 1314 type = POISON_NOT_DEFINED; 1315 else 1316 type = POISON_INVALID; 1317 break; 1318 } 1319 if ((*p != '\0' && *p != '#') || type == POISON_INVALID) { 1320 Parse_Error(PARSE_WARNING, "Invalid syntax for .poison: %s", 1321 line); 1322 return false; 1323 } else { 1324 Var_Mark(name, ename, type); 1325 return true; 1326 } 1327 } 1328 1329 1330 static bool 1331 handle_for_loop(Buffer linebuf, const char *line) 1332 { 1333 For *loop; 1334 1335 loop = For_Eval(line); 1336 if (loop != NULL) { 1337 bool ok; 1338 do { 1339 /* Find the matching endfor. */ 1340 line = ParseReadLoopLine(linebuf); 1341 if (line == NULL) { 1342 Parse_Error(PARSE_FATAL, 1343 "Unexpected end of file in for loop.\n"); 1344 return false; 1345 } 1346 ok = For_Accumulate(loop, line); 1347 } while (ok); 1348 For_Run(loop); 1349 return true; 1350 } else 1351 return false; 1352 } 1353 1354 static bool 1355 handle_undef(const char *line) 1356 { 1357 const char *eline; 1358 1359 while (ISSPACE(*line)) 1360 line++; 1361 for (eline = line; !ISSPACE(*eline) && *eline != '\0';) 1362 eline++; 1363 Var_Deletei(line, eline); 1364 return true; 1365 } 1366 1367 /* global hub for the construct */ 1368 static bool 1369 handle_bsd_command(Buffer linebuf, Buffer copy, const char *line) 1370 { 1371 char *stripped; 1372 1373 while (ISSPACE(*line)) 1374 line++; 1375 1376 /* delegate basic classification to the conditional module */ 1377 switch (Cond_Eval(line)) { 1378 case COND_SKIP: 1379 /* Skip to next conditional that evaluates to COND_PARSE. */ 1380 do { 1381 line = Parse_ReadNextConditionalLine(linebuf); 1382 if (line != NULL) { 1383 while (ISSPACE(*line)) 1384 line++; 1385 stripped = strip_comments(copy, line); 1386 } 1387 } while (line != NULL && Cond_Eval(stripped) != COND_PARSE); 1388 /* FALLTHROUGH */ 1389 case COND_PARSE: 1390 return true; 1391 case COND_ISFOR: 1392 return handle_for_loop(linebuf, line + 3); 1393 case COND_ISINCLUDE: 1394 return lookup_bsd_include(line + 7); 1395 case COND_ISPOISON: 1396 return handle_poison(line + 6); 1397 case COND_ISUNDEF: 1398 return handle_undef(line + 5); 1399 default: 1400 break; 1401 } 1402 1403 return false; 1404 } 1405 1406 /* postprocess group of targets prior to linking stuff with them */ 1407 static bool 1408 register_target(GNode *gn, struct ohash *t) 1409 { 1410 unsigned int slot; 1411 uint32_t hv; 1412 const char *ename = NULL; 1413 GNode *gn2; 1414 1415 hv = ohash_interval(gn->name, &ename); 1416 1417 slot = ohash_lookup_interval(t, gn->name, ename, hv); 1418 gn2 = ohash_find(t, slot); 1419 1420 if (gn2 == NULL) { 1421 ohash_insert(t, slot, gn); 1422 return true; 1423 } else 1424 return false; 1425 } 1426 1427 static void 1428 build_target_group(struct growableArray *targets, struct ohash *t) 1429 { 1430 LstNode ln; 1431 bool seen_target = false; 1432 unsigned int i; 1433 1434 /* may be 0 if wildcard expansion resulted in zero match */ 1435 if (targets->n <= 1) 1436 return; 1437 1438 /* Perform checks to see if we must tie targets together */ 1439 /* XXX */ 1440 if (targets->a[0]->type & OP_TRANSFORM) 1441 return; 1442 1443 for (ln = Lst_First(&targets->a[0]->commands); ln != NULL; 1444 ln = Lst_Adv(ln)) { 1445 struct command *cmd = Lst_Datum(ln); 1446 if (Var_Check_for_target(cmd->string)) { 1447 seen_target = true; 1448 break; 1449 } 1450 } 1451 if (DEBUG(TARGGROUP)) { 1452 fprintf(stderr, 1453 seen_target ? "No target group at %lu: ": 1454 "Target group at %lu:", Parse_Getlineno()); 1455 for (i = 0; i < targets->n; i++) 1456 fprintf(stderr, " %s", targets->a[i]->name); 1457 fprintf(stderr, "\n"); 1458 } 1459 if (seen_target) 1460 return; 1461 1462 GNode *gn, *gn2; 1463 /* targets may already participate in groupling lists, 1464 * so rebuild the circular list "from scratch" 1465 */ 1466 1467 for (i = 0; i < targets->n; i++) { 1468 gn = targets->a[i]; 1469 for (gn2 = gn->groupling; gn2 != gn; gn2 = gn2->groupling) { 1470 if (!gn2) 1471 break; 1472 register_target(gn2, t); 1473 } 1474 } 1475 1476 for (gn = ohash_first(t, &i); gn != NULL; gn = ohash_next(t, &i)) { 1477 gn->groupling = gn2; 1478 gn2 = gn; 1479 } 1480 gn = ohash_first(t, &i); 1481 gn->groupling = gn2; 1482 } 1483 1484 static void 1485 reset_target_hash() 1486 { 1487 if (htargets_setup) 1488 ohash_delete(&htargets); 1489 ohash_init(&htargets, 5, &gnode_info); 1490 htargets_setup = true; 1491 } 1492 1493 void 1494 Parse_End() 1495 { 1496 if (htargets_setup) 1497 ohash_delete(&htargets); 1498 } 1499 1500 static void 1501 dedup_targets(struct growableArray *targets) 1502 { 1503 unsigned int i, j; 1504 1505 if (targets->n <= 1) 1506 return; 1507 1508 reset_target_hash(); 1509 /* first let's de-dup the list */ 1510 for (i = 0, j = 0; i < targets->n; i++) { 1511 GNode *gn = targets->a[i]; 1512 if (register_target(gn, &htargets)) 1513 targets->a[j++] = targets->a[i]; 1514 } 1515 targets->n = j; 1516 } 1517 1518 1519 /*** 1520 *** handle a group of commands 1521 ***/ 1522 1523 static void 1524 finish_commands(struct growableArray *targets) 1525 { 1526 build_target_group(targets, &htargets); 1527 Array_Every(targets, ParseHasCommands); 1528 } 1529 1530 static void 1531 parse_commands(struct growableArray *targets, const char *line) 1532 { 1533 /* add the command to the list of 1534 * commands of all targets in the dependency spec */ 1535 1536 struct command *cmd; 1537 size_t len = strlen(line); 1538 1539 cmd = emalloc(sizeof(struct command) + len); 1540 memcpy(&cmd->string, line, len+1); 1541 Parse_FillLocation(&cmd->location); 1542 1543 Array_ForEach(targets, ParseAddCmd, cmd); 1544 } 1545 1546 static bool 1547 parse_as_special_line(Buffer buf, Buffer copy, const char *line) 1548 { 1549 if (*line == '.' && handle_bsd_command(buf, copy, line+1)) 1550 return true; 1551 if (FEATURES(FEATURE_SYSVINCLUDE) && 1552 strncmp(line, "include", 7) == 0 && 1553 ISSPACE(line[7]) && 1554 strchr(line, ':') == NULL) { 1555 /* It's an S3/S5-style "include". */ 1556 lookup_sysv_include(line + 7, "include"); 1557 return true; 1558 } 1559 if (FEATURES(FEATURE_CONDINCLUDE) && 1560 strncmp(line, "sinclude", 8) == 0 && 1561 ISSPACE(line[8]) && 1562 strchr(line, ':') == NULL) { 1563 lookup_conditional_include(line+8, "sinclude"); 1564 return true; 1565 } 1566 if (FEATURES(FEATURE_CONDINCLUDE) && 1567 strncmp(line, "-include", 8) == 0 && 1568 ISSPACE(line[8]) && 1569 strchr(line, ':') == NULL) { 1570 lookup_conditional_include(line+8, "-include"); 1571 return true; 1572 } 1573 return false; 1574 } 1575 1576 static void 1577 parse_target_line(struct growableArray *targets, const char *line, 1578 const char *stripped, bool *pcommands_seen) 1579 { 1580 size_t pos; 1581 char *end; 1582 char *cp; 1583 char *cmd; 1584 1585 /* let's start a new set of commands */ 1586 Array_Reset(targets); 1587 1588 /* XXX this is a dirty heuristic to handle target: dep ; commands */ 1589 cmd = NULL; 1590 /* First we need to find eventual dependencies */ 1591 pos = strcspn(stripped, ":!"); 1592 /* go over :!, and find ; */ 1593 if (stripped[pos] != '\0' && 1594 (end = strchr(stripped+pos+1, ';')) != NULL) { 1595 if (line != stripped) 1596 /* find matching ; in original... The 1597 * original might be slightly longer. */ 1598 cmd = strchr(line+(end-stripped), ';'); 1599 else 1600 cmd = end; 1601 /* kill end of line. */ 1602 *end = '\0'; 1603 } 1604 /* We now know it's a dependency line so it needs to 1605 * have all variables expanded before being parsed. 1606 */ 1607 cp = Var_Subst(stripped, NULL, false); 1608 ParseDoDependency(cp); 1609 free(cp); 1610 1611 /* Parse command if it's not empty. */ 1612 if (cmd != NULL) { 1613 do { 1614 cmd++; 1615 } while (ISSPACE(*cmd)); 1616 if (*cmd != '\0') { 1617 parse_commands(targets, cmd); 1618 *pcommands_seen = true; 1619 } 1620 } 1621 } 1622 1623 void 1624 Parse_File(const char *filename, FILE *stream) 1625 { 1626 char *line; 1627 bool expectingCommands = false; 1628 bool commands_seen = false; 1629 1630 /* permanent spaces to shave time */ 1631 static BUFFER buf; 1632 static BUFFER copy; 1633 1634 Buf_Reinit(&buf, MAKE_BSIZE); 1635 Buf_Reinit(©, MAKE_BSIZE); 1636 1637 Parse_FromFile(filename, stream); 1638 do { 1639 while ((line = Parse_ReadNormalLine(&buf)) != NULL) { 1640 if (*line == '\t') { 1641 if (expectingCommands) { 1642 commands_seen = true; 1643 parse_commands(>argets, line+1); 1644 } else 1645 Parse_Error(PARSE_FATAL, 1646 "Unassociated shell command \"%s\"", 1647 line); 1648 } else { 1649 const char *stripped = strip_comments(©, 1650 line); 1651 if (!parse_as_special_line(&buf, ©, 1652 stripped)) { 1653 if (commands_seen) 1654 finish_commands(>argets); 1655 commands_seen = false; 1656 if (Parse_As_Var_Assignment(stripped)) 1657 expectingCommands = false; 1658 else { 1659 parse_target_line(>argets, 1660 line, stripped, 1661 &commands_seen); 1662 expectingCommands = true; 1663 } 1664 } 1665 } 1666 } 1667 } while (Parse_NextFile()); 1668 1669 if (commands_seen) 1670 finish_commands(>argets); 1671 /* Make sure conditionals are clean. */ 1672 Cond_End(); 1673 1674 Parse_ReportErrors(); 1675 } 1676 1677 void 1678 Parse_Init(void) 1679 { 1680 mainNode = NULL; 1681 Static_Lst_Init(userIncludePath); 1682 Static_Lst_Init(systemIncludePath); 1683 Array_Init(>argets, TARGETS_SIZE); 1684 Array_Init(&gsources, SOURCES_SIZE); 1685 create_special_nodes(); 1686 } 1687 1688 void 1689 Parse_MainName(Lst listmain) /* result list */ 1690 { 1691 if (mainNode == NULL) { 1692 Punt("no target to make."); 1693 /*NOTREACHED*/ 1694 } else if (mainNode->type & OP_DOUBLEDEP) { 1695 Lst_AtEnd(listmain, mainNode); 1696 Lst_Concat(listmain, &mainNode->cohorts); 1697 } 1698 else 1699 Lst_AtEnd(listmain, mainNode); 1700 } 1701