1 /* $NetBSD: make.c,v 1.31 2000/06/11 07:39:52 mycroft Exp $ */ 2 3 /* 4 * Copyright (c) 1988, 1989, 1990, 1993 5 * The Regents of the University of California. All rights reserved. 6 * Copyright (c) 1989 by Berkeley Softworks 7 * All rights reserved. 8 * 9 * This code is derived from software contributed to Berkeley by 10 * Adam de Boor. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the University of 23 * California, Berkeley and its contributors. 24 * 4. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 */ 40 41 #ifdef MAKE_BOOTSTRAP 42 static char rcsid[] = "$NetBSD: make.c,v 1.31 2000/06/11 07:39:52 mycroft Exp $"; 43 #else 44 #include <sys/cdefs.h> 45 #ifndef lint 46 #if 0 47 static char sccsid[] = "@(#)make.c 8.1 (Berkeley) 6/6/93"; 48 #else 49 __RCSID("$NetBSD: make.c,v 1.31 2000/06/11 07:39:52 mycroft Exp $"); 50 #endif 51 #endif /* not lint */ 52 #endif 53 54 /*- 55 * make.c -- 56 * The functions which perform the examination of targets and 57 * their suitability for creation 58 * 59 * Interface: 60 * Make_Run Initialize things for the module and recreate 61 * whatever needs recreating. Returns TRUE if 62 * work was (or would have been) done and FALSE 63 * otherwise. 64 * 65 * Make_Update Update all parents of a given child. Performs 66 * various bookkeeping chores like the updating 67 * of the cmtime field of the parent, filling 68 * of the IMPSRC context variable, etc. It will 69 * place the parent on the toBeMade queue if it 70 * should be. 71 * 72 * Make_TimeStamp Function to set the parent's cmtime field 73 * based on a child's modification time. 74 * 75 * Make_DoAllVar Set up the various local variables for a 76 * target, including the .ALLSRC variable, making 77 * sure that any variable that needs to exist 78 * at the very least has the empty value. 79 * 80 * Make_OODate Determine if a target is out-of-date. 81 * 82 * Make_HandleUse See if a child is a .USE node for a parent 83 * and perform the .USE actions if so. 84 * 85 * Make_ExpandUse Expand .USE nodes and return the new list of 86 * targets. 87 */ 88 89 #include "make.h" 90 #include "hash.h" 91 #include "dir.h" 92 #include "job.h" 93 94 static Lst toBeMade; /* The current fringe of the graph. These 95 * are nodes which await examination by 96 * MakeOODate. It is added to by 97 * Make_Update and subtracted from by 98 * MakeStartJobs */ 99 static int numNodes; /* Number of nodes to be processed. If this 100 * is non-zero when Job_Empty() returns 101 * TRUE, there's a cycle in the graph */ 102 103 static int MakeAddChild __P((ClientData, ClientData)); 104 static int MakeFindChild __P((ClientData, ClientData)); 105 static int MakeUnmark __P((ClientData, ClientData)); 106 static int MakeAddAllSrc __P((ClientData, ClientData)); 107 static int MakeTimeStamp __P((ClientData, ClientData)); 108 static int MakeHandleUse __P((ClientData, ClientData)); 109 static Boolean MakeStartJobs __P((void)); 110 static int MakePrintStatus __P((ClientData, ClientData)); 111 /*- 112 *----------------------------------------------------------------------- 113 * Make_TimeStamp -- 114 * Set the cmtime field of a parent node based on the mtime stamp in its 115 * child. Called from MakeOODate via Lst_ForEach. 116 * 117 * Results: 118 * Always returns 0. 119 * 120 * Side Effects: 121 * The cmtime of the parent node will be changed if the mtime 122 * field of the child is greater than it. 123 *----------------------------------------------------------------------- 124 */ 125 int 126 Make_TimeStamp (pgn, cgn) 127 GNode *pgn; /* the current parent */ 128 GNode *cgn; /* the child we've just examined */ 129 { 130 if (cgn->mtime > pgn->cmtime) { 131 pgn->cmtime = cgn->mtime; 132 } 133 return (0); 134 } 135 136 static int 137 MakeTimeStamp (pgn, cgn) 138 ClientData pgn; /* the current parent */ 139 ClientData cgn; /* the child we've just examined */ 140 { 141 return Make_TimeStamp((GNode *) pgn, (GNode *) cgn); 142 } 143 144 /*- 145 *----------------------------------------------------------------------- 146 * Make_OODate -- 147 * See if a given node is out of date with respect to its sources. 148 * Used by Make_Run when deciding which nodes to place on the 149 * toBeMade queue initially and by Make_Update to screen out USE and 150 * EXEC nodes. In the latter case, however, any other sort of node 151 * must be considered out-of-date since at least one of its children 152 * will have been recreated. 153 * 154 * Results: 155 * TRUE if the node is out of date. FALSE otherwise. 156 * 157 * Side Effects: 158 * The mtime field of the node and the cmtime field of its parents 159 * will/may be changed. 160 *----------------------------------------------------------------------- 161 */ 162 Boolean 163 Make_OODate (gn) 164 register GNode *gn; /* the node to check */ 165 { 166 Boolean oodate; 167 168 /* 169 * Certain types of targets needn't even be sought as their datedness 170 * doesn't depend on their modification time... 171 */ 172 if ((gn->type & (OP_JOIN|OP_USE|OP_EXEC)) == 0) { 173 (void) Dir_MTime (gn); 174 if (DEBUG(MAKE)) { 175 if (gn->mtime != 0) { 176 printf ("modified %s...", Targ_FmtTime(gn->mtime)); 177 } else { 178 printf ("non-existent..."); 179 } 180 } 181 } 182 183 /* 184 * A target is remade in one of the following circumstances: 185 * its modification time is smaller than that of its youngest child 186 * and it would actually be run (has commands or type OP_NOP) 187 * it's the object of a force operator 188 * it has no children, was on the lhs of an operator and doesn't exist 189 * already. 190 * 191 * Libraries are only considered out-of-date if the archive module says 192 * they are. 193 * 194 * These weird rules are brought to you by Backward-Compatability and 195 * the strange people who wrote 'Make'. 196 */ 197 if (gn->type & OP_USE) { 198 /* 199 * If the node is a USE node it is *never* out of date 200 * no matter *what*. 201 */ 202 if (DEBUG(MAKE)) { 203 printf(".USE node..."); 204 } 205 oodate = FALSE; 206 } else if ((gn->type & OP_LIB) && 207 ((gn->mtime==0) || Arch_IsLib(gn))) { 208 if (DEBUG(MAKE)) { 209 printf("library..."); 210 } 211 212 /* 213 * always out of date if no children and :: target 214 * or non-existent. 215 */ 216 oodate = (gn->cmtime == 0 || Arch_LibOODate (gn) || 217 (gn->cmtime == 0 && (gn->type & OP_DOUBLEDEP))); 218 } else if (gn->type & OP_JOIN) { 219 /* 220 * A target with the .JOIN attribute is only considered 221 * out-of-date if any of its children was out-of-date. 222 */ 223 if (DEBUG(MAKE)) { 224 printf(".JOIN node..."); 225 } 226 if (DEBUG(MAKE)) { 227 printf("source %smade...", gn->flags & CHILDMADE ? "" : "not "); 228 } 229 oodate = (gn->flags & CHILDMADE) ? 1 : 0; 230 } else if (gn->type & (OP_FORCE|OP_EXEC|OP_PHONY)) { 231 /* 232 * A node which is the object of the force (!) operator or which has 233 * the .EXEC attribute is always considered out-of-date. 234 */ 235 if (DEBUG(MAKE)) { 236 if (gn->type & OP_FORCE) { 237 printf("! operator..."); 238 } else if (gn->type & OP_PHONY) { 239 printf(".PHONY node..."); 240 } else { 241 printf(".EXEC node..."); 242 } 243 } 244 oodate = TRUE; 245 } else if ((gn->mtime < gn->cmtime) || 246 ((gn->cmtime == 0) && 247 ((gn->mtime==0) || (gn->type & OP_DOUBLEDEP)))) 248 { 249 /* 250 * A node whose modification time is less than that of its 251 * youngest child or that has no children (cmtime == 0) and 252 * either doesn't exist (mtime == 0) or was the object of a 253 * :: operator is out-of-date. Why? Because that's the way Make does 254 * it. 255 */ 256 if (DEBUG(MAKE)) { 257 if (gn->mtime < gn->cmtime) { 258 printf("modified before source..."); 259 } else if (gn->mtime == 0) { 260 printf("non-existent and no sources..."); 261 } else { 262 printf(":: operator and no sources..."); 263 } 264 } 265 oodate = TRUE; 266 } else { 267 /* 268 * When a non-existing child with no sources 269 * (such as a typically used FORCE source) has been made and 270 * the target of the child (usually a directory) has the same 271 * timestamp as the timestamp just given to the non-existing child 272 * after it was considered made. 273 */ 274 if (DEBUG(MAKE)) { 275 if (gn->flags & FORCE) 276 printf("non existing child..."); 277 } 278 oodate = (gn->flags & FORCE) ? 1 : 0; 279 } 280 281 /* 282 * If the target isn't out-of-date, the parents need to know its 283 * modification time. Note that targets that appear to be out-of-date 284 * but aren't, because they have no commands and aren't of type OP_NOP, 285 * have their mtime stay below their children's mtime to keep parents from 286 * thinking they're out-of-date. 287 */ 288 if (!oodate) { 289 Lst_ForEach (gn->parents, MakeTimeStamp, (ClientData)gn); 290 } 291 292 return (oodate); 293 } 294 295 /*- 296 *----------------------------------------------------------------------- 297 * MakeAddChild -- 298 * Function used by Make_Run to add a child to the list l. 299 * It will only add the child if its make field is FALSE. 300 * 301 * Results: 302 * Always returns 0 303 * 304 * Side Effects: 305 * The given list is extended 306 *----------------------------------------------------------------------- 307 */ 308 static int 309 MakeAddChild (gnp, lp) 310 ClientData gnp; /* the node to add */ 311 ClientData lp; /* the list to which to add it */ 312 { 313 GNode *gn = (GNode *) gnp; 314 Lst l = (Lst) lp; 315 316 if ((gn->flags & REMAKE) == 0 && !(gn->type & OP_USE)) { 317 (void)Lst_EnQueue (l, (ClientData)gn); 318 } 319 return (0); 320 } 321 322 /*- 323 *----------------------------------------------------------------------- 324 * MakeFindChild -- 325 * Function used by Make_Run to find the pathname of a child 326 * that was already made. 327 * 328 * Results: 329 * Always returns 0 330 * 331 * Side Effects: 332 * The path and mtime of the node and the cmtime of the parent are 333 * updated 334 *----------------------------------------------------------------------- 335 */ 336 static int 337 MakeFindChild (gnp, pgnp) 338 ClientData gnp; /* the node to find */ 339 ClientData pgnp; 340 { 341 GNode *gn = (GNode *) gnp; 342 GNode *pgn = (GNode *) pgnp; 343 344 (void) Dir_MTime(gn); 345 Make_TimeStamp(pgn, gn); 346 gn->made = UPTODATE; 347 348 return (0); 349 } 350 351 /*- 352 *----------------------------------------------------------------------- 353 * Make_HandleUse -- 354 * Function called by Make_Run and SuffApplyTransform on the downward 355 * pass to handle .USE and transformation nodes. A callback function 356 * for Lst_ForEach, it implements the .USE and transformation 357 * functionality by copying the node's commands, type flags 358 * and children to the parent node. Should be called before the 359 * children are enqueued to be looked at by MakeAddChild. 360 * 361 * A .USE node is much like an explicit transformation rule, except 362 * its commands are always added to the target node, even if the 363 * target already has commands. 364 * 365 * Results: 366 * returns 0. 367 * 368 * Side Effects: 369 * Children and commands may be added to the parent and the parent's 370 * type may be changed. 371 * 372 *----------------------------------------------------------------------- 373 */ 374 int 375 Make_HandleUse (cgn, pgn) 376 register GNode *cgn; /* The .USE node */ 377 register GNode *pgn; /* The target of the .USE node */ 378 { 379 register LstNode ln; /* An element in the children list */ 380 381 if (cgn->type & (OP_USE|OP_TRANSFORM)) { 382 if ((cgn->type & OP_USE) || Lst_IsEmpty(pgn->commands)) { 383 /* 384 * .USE or transformation and target has no commands -- append 385 * the child's commands to the parent. 386 */ 387 (void) Lst_Concat (pgn->commands, cgn->commands, LST_CONCNEW); 388 } 389 390 if (Lst_Open (cgn->children) == SUCCESS) { 391 while ((ln = Lst_Next (cgn->children)) != NILLNODE) { 392 register GNode *tgn, *gn = (GNode *)Lst_Datum (ln); 393 394 /* 395 * Expand variables in the .USE node's name 396 * and save the unexpanded form. 397 * We don't need to do this for commands. 398 * They get expanded properly when we execute. 399 */ 400 if (gn->uname == NULL) { 401 gn->uname = gn->name; 402 } else { 403 if (gn->name) 404 free(gn->name); 405 } 406 gn->name = Var_Subst(NULL, gn->uname, pgn, FALSE); 407 if (gn->name && gn->uname && strcmp(gn->name, gn->uname) != 0) { 408 /* See if we have a target for this node. */ 409 tgn = Targ_FindNode(gn->name, TARG_NOCREATE); 410 if (tgn != NILGNODE) 411 gn = tgn; 412 } 413 414 (void) Lst_AtEnd (pgn->children, gn); 415 (void) Lst_AtEnd (gn->parents, pgn); 416 pgn->unmade += 1; 417 } 418 Lst_Close (cgn->children); 419 } 420 421 pgn->type |= cgn->type & ~(OP_OPMASK|OP_USE|OP_TRANSFORM); 422 423 /* 424 * This child node is now "made", so we decrement the count of 425 * unmade children in the parent... We also remove the child 426 * from the parent's list to accurately reflect the number of decent 427 * children the parent has. This is used by Make_Run to decide 428 * whether to queue the parent or examine its children... 429 */ 430 if ((cgn->type & OP_USE) && 431 (ln = Lst_Member (pgn->children, (ClientData) cgn)) != NILLNODE) { 432 Lst_Remove(pgn->children, ln); 433 pgn->unmade--; 434 } 435 } 436 return (0); 437 } 438 439 static int 440 MakeHandleUse (cgnp, pgnp) 441 ClientData cgnp; /* the child we've just examined */ 442 ClientData pgnp; /* the current parent */ 443 { 444 GNode *cgn = (GNode *) cgnp; 445 GNode *pgn = (GNode *) pgnp; 446 447 if (cgn->type & OP_MARK) 448 return (0); 449 cgn->type |= OP_MARK; 450 451 return Make_HandleUse(cgn, pgn); 452 } 453 454 455 /*- 456 *----------------------------------------------------------------------- 457 * Make_Recheck -- 458 * Check the modification time of a gnode, and update it as described 459 * in the comments below. 460 * 461 * Results: 462 * returns 0 if the gnode does not exist, or it's filesystem 463 * time if it does. 464 * 465 * Side Effects: 466 * the gnode's modification time and path name are affected. 467 * 468 *----------------------------------------------------------------------- 469 */ 470 time_t 471 Make_Recheck (gn) 472 GNode *gn; 473 { 474 time_t mtime = Dir_MTime(gn); 475 476 #ifndef RECHECK 477 /* 478 * We can't re-stat the thing, but we can at least take care of rules 479 * where a target depends on a source that actually creates the 480 * target, but only if it has changed, e.g. 481 * 482 * parse.h : parse.o 483 * 484 * parse.o : parse.y 485 * yacc -d parse.y 486 * cc -c y.tab.c 487 * mv y.tab.o parse.o 488 * cmp -s y.tab.h parse.h || mv y.tab.h parse.h 489 * 490 * In this case, if the definitions produced by yacc haven't changed 491 * from before, parse.h won't have been updated and gn->mtime will 492 * reflect the current modification time for parse.h. This is 493 * something of a kludge, I admit, but it's a useful one.. 494 * XXX: People like to use a rule like 495 * 496 * FRC: 497 * 498 * To force things that depend on FRC to be made, so we have to 499 * check for gn->children being empty as well... 500 */ 501 if (!Lst_IsEmpty(gn->commands) || Lst_IsEmpty(gn->children)) { 502 gn->mtime = now; 503 } 504 #else 505 /* 506 * This is what Make does and it's actually a good thing, as it 507 * allows rules like 508 * 509 * cmp -s y.tab.h parse.h || cp y.tab.h parse.h 510 * 511 * to function as intended. Unfortunately, thanks to the stateless 512 * nature of NFS (by which I mean the loose coupling of two clients 513 * using the same file from a common server), there are times 514 * when the modification time of a file created on a remote 515 * machine will not be modified before the local stat() implied by 516 * the Dir_MTime occurs, thus leading us to believe that the file 517 * is unchanged, wreaking havoc with files that depend on this one. 518 * 519 * I have decided it is better to make too much than to make too 520 * little, so this stuff is commented out unless you're sure it's ok. 521 * -- ardeb 1/12/88 522 */ 523 /* 524 * Christos, 4/9/92: If we are saving commands pretend that 525 * the target is made now. Otherwise archives with ... rules 526 * don't work! 527 */ 528 if ((noExecute && !(gn->type & OP_MAKE)) || 529 (gn->type & OP_SAVE_CMDS) || mtime == 0) { 530 if (DEBUG(MAKE)) { 531 printf("update time to now: %s\n", Targ_FmtTime(gn->mtime)); 532 } 533 gn->mtime = now; 534 } 535 else { 536 if (DEBUG(MAKE)) { 537 printf("current update time: %s\n", Targ_FmtTime(gn->mtime)); 538 } 539 } 540 #endif 541 return mtime; 542 } 543 544 /*- 545 *----------------------------------------------------------------------- 546 * Make_Update -- 547 * Perform update on the parents of a node. Used by JobFinish once 548 * a node has been dealt with and by MakeStartJobs if it finds an 549 * up-to-date node. 550 * 551 * Results: 552 * Always returns 0 553 * 554 * Side Effects: 555 * The unmade field of pgn is decremented and pgn may be placed on 556 * the toBeMade queue if this field becomes 0. 557 * 558 * If the child was made, the parent's flag CHILDMADE field will be 559 * set true and its cmtime set to now. 560 * 561 * If the child is not up-to-date and still does not exist, 562 * set the FORCE flag on the parents. 563 * 564 * If the child wasn't made, the cmtime field of the parent will be 565 * altered if the child's mtime is big enough. 566 * 567 * Finally, if the child is the implied source for the parent, the 568 * parent's IMPSRC variable is set appropriately. 569 * 570 *----------------------------------------------------------------------- 571 */ 572 void 573 Make_Update (cgn) 574 register GNode *cgn; /* the child node */ 575 { 576 register GNode *pgn; /* the parent node */ 577 register char *cname; /* the child's name */ 578 register LstNode ln; /* Element in parents and iParents lists */ 579 time_t mtime = -1; 580 char *p1; 581 582 cname = Var_Value (TARGET, cgn, &p1); 583 if (p1) 584 free(p1); 585 586 /* 587 * If the child was actually made, see what its modification time is 588 * now -- some rules won't actually update the file. If the file still 589 * doesn't exist, make its mtime now. 590 */ 591 if (cgn->made != UPTODATE) { 592 mtime = Make_Recheck(cgn); 593 } 594 595 if (Lst_Open (cgn->parents) == SUCCESS) { 596 while ((ln = Lst_Next (cgn->parents)) != NILLNODE) { 597 pgn = (GNode *)Lst_Datum (ln); 598 if (mtime == 0) 599 pgn->flags |= FORCE; 600 if (pgn->flags & REMAKE) { 601 pgn->unmade -= 1; 602 603 if ( ! (cgn->type & (OP_EXEC|OP_USE))) { 604 if (cgn->made == MADE) 605 pgn->flags |= CHILDMADE; 606 (void)Make_TimeStamp (pgn, cgn); 607 } 608 if (pgn->unmade == 0) { 609 /* 610 * Queue the node up -- any unmade predecessors will 611 * be dealt with in MakeStartJobs. 612 */ 613 (void)Lst_EnQueue (toBeMade, (ClientData)pgn); 614 } else if (pgn->unmade < 0) { 615 Error ("Graph cycles through %s", pgn->name); 616 } 617 } 618 } 619 Lst_Close (cgn->parents); 620 } 621 /* 622 * Deal with successor nodes. If any is marked for making and has an unmade 623 * count of 0, has not been made and isn't in the examination queue, 624 * it means we need to place it in the queue as it restrained itself 625 * before. 626 */ 627 for (ln = Lst_First(cgn->successors); ln != NILLNODE; ln = Lst_Succ(ln)) { 628 GNode *succ = (GNode *)Lst_Datum(ln); 629 630 if ((succ->flags & REMAKE) && succ->unmade == 0 && succ->made == UNMADE && 631 Lst_Member(toBeMade, (ClientData)succ) == NILLNODE) 632 { 633 (void)Lst_EnQueue(toBeMade, (ClientData)succ); 634 } 635 } 636 637 /* 638 * Set the .PREFIX and .IMPSRC variables for all the implied parents 639 * of this node. 640 */ 641 if (Lst_Open (cgn->iParents) == SUCCESS) { 642 char *p1; 643 char *cpref = Var_Value(PREFIX, cgn, &p1); 644 645 while ((ln = Lst_Next (cgn->iParents)) != NILLNODE) { 646 pgn = (GNode *)Lst_Datum (ln); 647 if (pgn->flags & REMAKE) { 648 Var_Set (IMPSRC, cname, pgn); 649 Var_Set (PREFIX, cpref, pgn); 650 } 651 } 652 if (p1) 653 free(p1); 654 Lst_Close (cgn->iParents); 655 } 656 } 657 658 /*- 659 *----------------------------------------------------------------------- 660 * MakeAddAllSrc -- 661 * Add a child's name to the ALLSRC and OODATE variables of the given 662 * node. Called from Make_DoAllVar via Lst_ForEach. A child is added only 663 * if it has not been given the .EXEC, .USE or .INVISIBLE attributes. 664 * .EXEC and .USE children are very rarely going to be files, so... 665 * A child is added to the OODATE variable if its modification time is 666 * later than that of its parent, as defined by Make, except if the 667 * parent is a .JOIN node. In that case, it is only added to the OODATE 668 * variable if it was actually made (since .JOIN nodes don't have 669 * modification times, the comparison is rather unfair...).. 670 * 671 * Results: 672 * Always returns 0 673 * 674 * Side Effects: 675 * The ALLSRC variable for the given node is extended. 676 *----------------------------------------------------------------------- 677 */ 678 static int 679 MakeUnmark (cgnp, pgnp) 680 ClientData cgnp; 681 ClientData pgnp; 682 { 683 GNode *cgn = (GNode *) cgnp; 684 685 cgn->type &= ~OP_MARK; 686 return (0); 687 } 688 689 static int 690 MakeAddAllSrc (cgnp, pgnp) 691 ClientData cgnp; /* The child to add */ 692 ClientData pgnp; /* The parent to whose ALLSRC variable it should be */ 693 /* added */ 694 { 695 GNode *cgn = (GNode *) cgnp; 696 GNode *pgn = (GNode *) pgnp; 697 698 if (cgn->type & OP_MARK) 699 return (0); 700 cgn->type |= OP_MARK; 701 702 if ((cgn->type & (OP_EXEC|OP_USE|OP_INVISIBLE)) == 0) { 703 char *child; 704 char *p1 = NULL; 705 706 if (cgn->type & OP_ARCHV) 707 child = Var_Value (MEMBER, cgn, &p1); 708 else 709 child = cgn->path ? cgn->path : cgn->name; 710 Var_Append (ALLSRC, child, pgn); 711 if (pgn->type & OP_JOIN) { 712 if (cgn->made == MADE) { 713 Var_Append(OODATE, child, pgn); 714 } 715 } else if ((pgn->mtime < cgn->mtime) || 716 (cgn->mtime >= now && cgn->made == MADE)) 717 { 718 /* 719 * It goes in the OODATE variable if the parent is younger than the 720 * child or if the child has been modified more recently than 721 * the start of the make. This is to keep pmake from getting 722 * confused if something else updates the parent after the 723 * make starts (shouldn't happen, I know, but sometimes it 724 * does). In such a case, if we've updated the kid, the parent 725 * is likely to have a modification time later than that of 726 * the kid and anything that relies on the OODATE variable will 727 * be hosed. 728 * 729 * XXX: This will cause all made children to go in the OODATE 730 * variable, even if they're not touched, if RECHECK isn't defined, 731 * since cgn->mtime is set to now in Make_Update. According to 732 * some people, this is good... 733 */ 734 Var_Append(OODATE, child, pgn); 735 } 736 if (p1) 737 free(p1); 738 } 739 return (0); 740 } 741 742 /*- 743 *----------------------------------------------------------------------- 744 * Make_DoAllVar -- 745 * Set up the ALLSRC and OODATE variables. Sad to say, it must be 746 * done separately, rather than while traversing the graph. This is 747 * because Make defined OODATE to contain all sources whose modification 748 * times were later than that of the target, *not* those sources that 749 * were out-of-date. Since in both compatibility and native modes, 750 * the modification time of the parent isn't found until the child 751 * has been dealt with, we have to wait until now to fill in the 752 * variable. As for ALLSRC, the ordering is important and not 753 * guaranteed when in native mode, so it must be set here, too. 754 * 755 * Results: 756 * None 757 * 758 * Side Effects: 759 * The ALLSRC and OODATE variables of the given node is filled in. 760 * If the node is a .JOIN node, its TARGET variable will be set to 761 * match its ALLSRC variable. 762 *----------------------------------------------------------------------- 763 */ 764 void 765 Make_DoAllVar (gn) 766 GNode *gn; 767 { 768 Lst_ForEach (gn->children, MakeUnmark, (ClientData) gn); 769 Lst_ForEach (gn->children, MakeAddAllSrc, (ClientData) gn); 770 771 if (!Var_Exists (OODATE, gn)) { 772 Var_Set (OODATE, "", gn); 773 } 774 if (!Var_Exists (ALLSRC, gn)) { 775 Var_Set (ALLSRC, "", gn); 776 } 777 778 if (gn->type & OP_JOIN) { 779 char *p1; 780 Var_Set (TARGET, Var_Value (ALLSRC, gn, &p1), gn); 781 if (p1) 782 free(p1); 783 } 784 } 785 786 /*- 787 *----------------------------------------------------------------------- 788 * MakeStartJobs -- 789 * Start as many jobs as possible. 790 * 791 * Results: 792 * If the query flag was given to pmake, no job will be started, 793 * but as soon as an out-of-date target is found, this function 794 * returns TRUE. At all other times, this function returns FALSE. 795 * 796 * Side Effects: 797 * Nodes are removed from the toBeMade queue and job table slots 798 * are filled. 799 * 800 *----------------------------------------------------------------------- 801 */ 802 static Boolean 803 MakeStartJobs () 804 { 805 register GNode *gn; 806 807 while (!Job_Full() && !Lst_IsEmpty (toBeMade)) { 808 gn = (GNode *) Lst_DeQueue (toBeMade); 809 if (DEBUG(MAKE)) { 810 printf ("Examining %s...", gn->name); 811 } 812 /* 813 * Make sure any and all predecessors that are going to be made, 814 * have been. 815 */ 816 if (!Lst_IsEmpty(gn->preds)) { 817 LstNode ln; 818 819 for (ln = Lst_First(gn->preds); ln != NILLNODE; ln = Lst_Succ(ln)){ 820 GNode *pgn = (GNode *)Lst_Datum(ln); 821 822 if ((pgn->flags & REMAKE) && pgn->made == UNMADE) { 823 if (DEBUG(MAKE)) { 824 printf("predecessor %s not made yet.\n", pgn->name); 825 } 826 break; 827 } 828 } 829 /* 830 * If ln isn't nil, there's a predecessor as yet unmade, so we 831 * just drop this node on the floor. When the node in question 832 * has been made, it will notice this node as being ready to 833 * make but as yet unmade and will place the node on the queue. 834 */ 835 if (ln != NILLNODE) { 836 continue; 837 } 838 } 839 840 numNodes--; 841 if (Make_OODate (gn)) { 842 if (DEBUG(MAKE)) { 843 printf ("out-of-date\n"); 844 } 845 if (queryFlag) { 846 return (TRUE); 847 } 848 Make_DoAllVar (gn); 849 Job_Make (gn); 850 } else { 851 if (DEBUG(MAKE)) { 852 printf ("up-to-date\n"); 853 } 854 gn->made = UPTODATE; 855 if (gn->type & OP_JOIN) { 856 /* 857 * Even for an up-to-date .JOIN node, we need it to have its 858 * context variables so references to it get the correct 859 * value for .TARGET when building up the context variables 860 * of its parent(s)... 861 */ 862 Make_DoAllVar (gn); 863 } 864 865 Make_Update (gn); 866 } 867 } 868 return (FALSE); 869 } 870 871 /*- 872 *----------------------------------------------------------------------- 873 * MakePrintStatus -- 874 * Print the status of a top-level node, viz. it being up-to-date 875 * already or not created due to an error in a lower level. 876 * Callback function for Make_Run via Lst_ForEach. 877 * 878 * Results: 879 * Always returns 0. 880 * 881 * Side Effects: 882 * A message may be printed. 883 * 884 *----------------------------------------------------------------------- 885 */ 886 static int 887 MakePrintStatus(gnp, cyclep) 888 ClientData gnp; /* Node to examine */ 889 ClientData cyclep; /* True if gn->unmade being non-zero implies 890 * a cycle in the graph, not an error in an 891 * inferior */ 892 { 893 GNode *gn = (GNode *) gnp; 894 Boolean cycle = *(Boolean *) cyclep; 895 if (gn->made == UPTODATE) { 896 printf ("`%s' is up to date.\n", gn->name); 897 } else if (gn->unmade != 0) { 898 if (cycle) { 899 Boolean t = TRUE; 900 /* 901 * If printing cycles and came to one that has unmade children, 902 * print out the cycle by recursing on its children. Note a 903 * cycle like: 904 * a : b 905 * b : c 906 * c : b 907 * will cause this to erroneously complain about a being in 908 * the cycle, but this is a good approximation. 909 */ 910 if (gn->made == CYCLE) { 911 Error("Graph cycles through `%s'", gn->name); 912 gn->made = ENDCYCLE; 913 Lst_ForEach(gn->children, MakePrintStatus, (ClientData) &t); 914 gn->made = UNMADE; 915 } else if (gn->made != ENDCYCLE) { 916 gn->made = CYCLE; 917 Lst_ForEach(gn->children, MakePrintStatus, (ClientData) &t); 918 } 919 } else { 920 printf ("`%s' not remade because of errors.\n", gn->name); 921 } 922 } 923 return (0); 924 } 925 926 927 /*- 928 *----------------------------------------------------------------------- 929 * Make_ExpandUse -- 930 * Expand .USE nodes and create a new targets list 931 * Results: 932 * The new list of targets. 933 * 934 * Side Effects: 935 * numNodes is set to the number of elements in the list of targets. 936 *----------------------------------------------------------------------- 937 */ 938 Lst 939 Make_ExpandUse (targs) 940 Lst targs; /* the initial list of targets */ 941 { 942 register GNode *gn; /* a temporary pointer */ 943 register Lst examine; /* List of targets to examine */ 944 register Lst ntargs; /* List of new targets to be made */ 945 946 ntargs = Lst_Init (FALSE); 947 948 examine = Lst_Duplicate(targs, NOCOPY); 949 numNodes = 0; 950 951 /* 952 * Make an initial downward pass over the graph, marking nodes to be made 953 * as we go down. We call Suff_FindDeps to find where a node is and 954 * to get some children for it if it has none and also has no commands. 955 * If the node is a leaf, we stick it on the toBeMade queue to 956 * be looked at in a minute, otherwise we add its children to our queue 957 * and go on about our business. 958 */ 959 while (!Lst_IsEmpty (examine)) { 960 gn = (GNode *) Lst_DeQueue (examine); 961 962 if ((gn->type & OP_DOUBLEDEP) && !Lst_IsEmpty (gn->cohorts)) { 963 Lst new; 964 new = Lst_Duplicate (gn->cohorts, NOCOPY); 965 Lst_Concat (new, examine, LST_CONCLINK); 966 examine = new; 967 } 968 969 if ((gn->flags & REMAKE) == 0) { 970 gn->flags |= REMAKE; 971 numNodes++; 972 973 /* 974 * Apply any .USE rules before looking for implicit dependencies 975 * to make sure everything has commands that should... 976 * Make sure that the TARGET is set, so that we can make 977 * expansions. 978 */ 979 if (gn->type & OP_ARCHV) { 980 char *eoa, *eon; 981 eoa = strchr(gn->name, '('); 982 eon = strchr(gn->name, ')'); 983 if (eoa == NULL || eon == NULL) 984 continue; 985 *eoa = '\0'; 986 *eon = '\0'; 987 Var_Set (MEMBER, eoa + 1, gn); 988 Var_Set (ARCHIVE, gn->name, gn); 989 *eoa = '('; 990 *eon = ')'; 991 } 992 993 (void)Dir_MTime(gn); 994 Var_Set (TARGET, gn->path ? gn->path : gn->name, gn); 995 Lst_ForEach (gn->children, MakeUnmark, (ClientData)gn); 996 Lst_ForEach (gn->children, MakeHandleUse, (ClientData)gn); 997 Suff_FindDeps (gn); 998 999 if (gn->unmade != 0 && (gn->type & OP_MADE) == 0) { 1000 Lst_ForEach (gn->children, MakeAddChild, (ClientData)examine); 1001 } else { 1002 (void)Lst_EnQueue (ntargs, (ClientData)gn); 1003 if (gn->type & OP_MADE) 1004 Lst_ForEach (gn->children, MakeFindChild, (ClientData)gn); 1005 } 1006 } 1007 } 1008 1009 Lst_Destroy (examine, NOFREE); 1010 return ntargs; 1011 } 1012 1013 /*- 1014 *----------------------------------------------------------------------- 1015 * Make_Run -- 1016 * Initialize the nodes to remake and the list of nodes which are 1017 * ready to be made by doing a breadth-first traversal of the graph 1018 * starting from the nodes in the given list. Once this traversal 1019 * is finished, all the 'leaves' of the graph are in the toBeMade 1020 * queue. 1021 * Using this queue and the Job module, work back up the graph, 1022 * calling on MakeStartJobs to keep the job table as full as 1023 * possible. 1024 * 1025 * Results: 1026 * TRUE if work was done. FALSE otherwise. 1027 * 1028 * Side Effects: 1029 * The make field of all nodes involved in the creation of the given 1030 * targets is set to 1. The toBeMade list is set to contain all the 1031 * 'leaves' of these subgraphs. 1032 *----------------------------------------------------------------------- 1033 */ 1034 Boolean 1035 Make_Run (targs) 1036 Lst targs; /* the initial list of targets */ 1037 { 1038 int errors; /* Number of errors the Job module reports */ 1039 1040 toBeMade = Make_ExpandUse (targs); 1041 1042 if (queryFlag) { 1043 /* 1044 * We wouldn't do any work unless we could start some jobs in the 1045 * next loop... (we won't actually start any, of course, this is just 1046 * to see if any of the targets was out of date) 1047 */ 1048 return (MakeStartJobs()); 1049 } else { 1050 /* 1051 * Initialization. At the moment, no jobs are running and until some 1052 * get started, nothing will happen since the remaining upward 1053 * traversal of the graph is performed by the routines in job.c upon 1054 * the finishing of a job. So we fill the Job table as much as we can 1055 * before going into our loop. 1056 */ 1057 (void) MakeStartJobs(); 1058 } 1059 1060 /* 1061 * Main Loop: The idea here is that the ending of jobs will take 1062 * care of the maintenance of data structures and the waiting for output 1063 * will cause us to be idle most of the time while our children run as 1064 * much as possible. Because the job table is kept as full as possible, 1065 * the only time when it will be empty is when all the jobs which need 1066 * running have been run, so that is the end condition of this loop. 1067 * Note that the Job module will exit if there were any errors unless the 1068 * keepgoing flag was given. 1069 */ 1070 while (!Job_Empty ()) { 1071 Job_CatchOutput (); 1072 Job_CatchChildren (!usePipes); 1073 (void)MakeStartJobs(); 1074 } 1075 1076 errors = Job_Finish(); 1077 1078 /* 1079 * Print the final status of each target. E.g. if it wasn't made 1080 * because some inferior reported an error. 1081 */ 1082 errors = ((errors == 0) && (numNodes != 0)); 1083 Lst_ForEach(targs, MakePrintStatus, (ClientData) &errors); 1084 1085 return (TRUE); 1086 } 1087