1 /* $NetBSD: make.c,v 1.248 2021/11/28 23:12:51 rillig Exp $ */
4 * Copyright (c) 1988, 1989, 1990, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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.
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
36 * Copyright (c) 1989 by Berkeley Softworks
37 * All rights reserved.
39 * This code is derived from software contributed to Berkeley by
42 * Redistribution and use in source and binary forms, with or without
43 * modification, are permitted provided that the following conditions
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.
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
72 * Examination of targets and their suitability for creation.
75 * Make_Run Initialize things for the module. Returns true if
76 * work was (or would have been) done.
78 * Make_Update After a target is made, update all its parents.
79 * Perform various bookkeeping chores like the updating
80 * of the youngestChild field of the parent, filling
81 * of the IMPSRC variable, etc. Place the parent on the
82 * toBeMade queue if it should be.
84 * GNode_UpdateYoungestChild
85 * Update the node's youngestChild field based on the
86 * child's modification time.
89 * Set up the various local variables for a
90 * target, including the .ALLSRC variable, making
91 * sure that any variable that needs to exist
92 * at the very least has the empty value.
94 * GNode_IsOODate Determine if a target is out-of-date.
96 * Make_HandleUse See if a child is a .USE node for a parent
97 * and perform the .USE actions if so.
99 * Make_ExpandUse Expand .USE nodes
106 /* "@(#)make.c 8.1 (Berkeley) 6/6/93" */
107 MAKE_RCSID("$NetBSD: make.c,v 1.248 2021/11/28 23:12:51 rillig Exp $");
109 /* Sequence # to detect recursion. */
110 static unsigned int checked_seqno = 1;
113 * The current fringe of the graph.
114 * These are nodes which await examination by MakeOODate.
115 * It is added to by Make_Update and subtracted from by MakeStartJobs
117 static GNodeList toBeMade = LST_INIT;
121 debug_printf(const char *fmt, ...)
126 vfprintf(opts.debug_file, fmt, args);
130 MAKE_ATTR_DEAD static void
131 make_abort(GNode *gn, int lineno)
134 debug_printf("make_abort from line %d\n", lineno);
135 Targ_PrintNode(gn, 2);
136 Targ_PrintNodes(&toBeMade, 2);
142 GNodeType_ToString(GNodeType type, void **freeIt)
146 Buf_InitSize(&buf, 32);
147 #define ADD(flag) Buf_AddFlag(&buf, (type & (flag)) != OP_NONE, #flag)
175 ADD(OP_HAS_COMMANDS);
180 return buf.len == 0 ? "none" : (*freeIt = Buf_DoneData(&buf));
184 GNodeFlags_ToString(GNodeFlags flags, void **freeIt)
188 Buf_InitSize(&buf, 32);
189 #define ADD(flag, name) Buf_AddFlag(&buf, flags.flag, name)
190 ADD(remake, "REMAKE");
191 ADD(childMade, "CHILDMADE");
193 ADD(doneWait, "DONE_WAIT");
194 ADD(doneOrder, "DONE_ORDER");
195 ADD(fromDepend, "FROM_DEPEND");
196 ADD(doneAllsrc, "DONE_ALLSRC");
198 ADD(doneCycle, "DONECYCLE");
200 return buf.len == 0 ? "none" : (*freeIt = Buf_DoneData(&buf));
204 GNode_FprintDetails(FILE *f, const char *prefix, const GNode *gn,
207 void *type_freeIt = NULL;
208 void *flags_freeIt = NULL;
210 fprintf(f, "%s%s, type %s, flags %s%s",
212 GNodeMade_Name(gn->made),
213 GNodeType_ToString(gn->type, &type_freeIt),
214 GNodeFlags_ToString(gn->flags, &flags_freeIt),
221 GNode_ShouldExecute(GNode *gn)
223 return !((gn->type & OP_MAKE)
224 ? opts.noRecursiveExecute
228 /* Update the youngest child of the node, according to the given child. */
230 GNode_UpdateYoungestChild(GNode *gn, GNode *cgn)
232 if (gn->youngestChild == NULL || cgn->mtime > gn->youngestChild->mtime)
233 gn->youngestChild = cgn;
237 IsOODateRegular(GNode *gn)
239 /* These rules are inherited from the original Make. */
241 if (gn->youngestChild != NULL) {
242 if (gn->mtime < gn->youngestChild->mtime) {
243 DEBUG1(MAKE, "modified before source \"%s\"...",
244 GNode_Path(gn->youngestChild));
250 if (gn->mtime == 0 && !(gn->type & OP_OPTIONAL)) {
251 DEBUG0(MAKE, "nonexistent and no sources...");
255 if (gn->type & OP_DOUBLEDEP) {
256 DEBUG0(MAKE, ":: operator and no sources...");
264 * See if the node is out of date with respect to its sources.
266 * Used by Make_Run when deciding which nodes to place on the
267 * toBeMade queue initially and by Make_Update to screen out .USE and
268 * .EXEC nodes. In the latter case, however, any other sort of node
269 * must be considered out-of-date since at least one of its children
270 * will have been recreated.
272 * The mtime field of the node and the youngestChild field of its parents
276 GNode_IsOODate(GNode *gn)
281 * Certain types of targets needn't even be sought as their datedness
282 * doesn't depend on their modification time...
284 if (!(gn->type & (OP_JOIN | OP_USE | OP_USEBEFORE | OP_EXEC))) {
285 Dir_UpdateMTime(gn, true);
288 debug_printf("modified %s...",
289 Targ_FmtTime(gn->mtime));
291 debug_printf("nonexistent...");
296 * A target is remade in one of the following circumstances:
298 * its modification time is smaller than that of its youngest
299 * child and it would actually be run (has commands or is not
302 * it's the object of a force operator
304 * it has no children, was on the lhs of an operator and doesn't
307 * Libraries are only considered out-of-date if the archive module
310 * These weird rules are brought to you by Backward-Compatibility
311 * and the strange people who wrote 'Make'.
313 if (gn->type & (OP_USE | OP_USEBEFORE)) {
315 * If the node is a USE node it is *never* out of date
318 DEBUG0(MAKE, ".USE node...");
320 } else if ((gn->type & OP_LIB) && (gn->mtime == 0 || Arch_IsLib(gn))) {
321 DEBUG0(MAKE, "library...");
324 * always out of date if no children and :: target
327 oodate = (gn->mtime == 0 || Arch_LibOODate(gn) ||
328 (gn->youngestChild == NULL &&
329 (gn->type & OP_DOUBLEDEP)));
330 } else if (gn->type & OP_JOIN) {
332 * A target with the .JOIN attribute is only considered
333 * out-of-date if any of its children was out-of-date.
335 DEBUG0(MAKE, ".JOIN node...");
336 DEBUG1(MAKE, "source %smade...",
337 gn->flags.childMade ? "" : "not ");
338 oodate = gn->flags.childMade;
339 } else if (gn->type & (OP_FORCE | OP_EXEC | OP_PHONY)) {
341 * A node which is the object of the force (!) operator or
342 * which has the .EXEC attribute is always considered
346 if (gn->type & OP_FORCE) {
347 debug_printf("! operator...");
348 } else if (gn->type & OP_PHONY) {
349 debug_printf(".PHONY node...");
351 debug_printf(".EXEC node...");
355 } else if (IsOODateRegular(gn)) {
359 * When a nonexistent child with no sources
360 * (such as a typically used FORCE source) has been made and
361 * the target of the child (usually a directory) has the same
362 * timestamp as the timestamp just given to the nonexistent
363 * child after it was considered made.
367 debug_printf("non existing child...");
369 oodate = gn->flags.force;
374 oodate = meta_oodate(gn, oodate);
379 * If the target isn't out-of-date, the parents need to know its
380 * modification time. Note that targets that appear to be out-of-date
381 * but aren't, because they have no commands and are GNode_IsTarget,
382 * have their mtime stay below their children's mtime to keep parents
383 * from thinking they're out-of-date.
387 for (ln = gn->parents.first; ln != NULL; ln = ln->next)
388 GNode_UpdateYoungestChild(ln->datum, gn);
395 PretendAllChildrenAreMade(GNode *pgn)
399 for (ln = pgn->children.first; ln != NULL; ln = ln->next) {
400 GNode *cgn = ln->datum;
402 /* This may also update cgn->path. */
403 Dir_UpdateMTime(cgn, false);
404 GNode_UpdateYoungestChild(pgn, cgn);
410 * Called by Make_Run and SuffApplyTransform on the downward pass to handle
411 * .USE and transformation nodes, by copying the child node's commands, type
412 * flags and children to the parent node.
414 * A .USE node is much like an explicit transformation rule, except its
415 * commands are always added to the target node, even if the target already
419 * cgn The source node, which is either a .USE/.USEBEFORE
420 * node or a transformation node (OP_TRANSFORM).
421 * pgn The target node
424 Make_HandleUse(GNode *cgn, GNode *pgn)
426 GNodeListNode *ln; /* An element in the children list */
429 if (!(cgn->type & (OP_USE | OP_USEBEFORE | OP_TRANSFORM))) {
430 debug_printf("Make_HandleUse: called for plain node %s\n",
432 /* XXX: debug mode should not affect control flow */
437 if ((cgn->type & (OP_USE | OP_USEBEFORE)) ||
438 Lst_IsEmpty(&pgn->commands)) {
439 if (cgn->type & OP_USEBEFORE) {
441 Lst_PrependAll(&pgn->commands, &cgn->commands);
443 /* .USE, or target has no commands */
444 Lst_AppendAll(&pgn->commands, &cgn->commands);
448 for (ln = cgn->children.first; ln != NULL; ln = ln->next) {
449 GNode *gn = ln->datum;
452 * Expand variables in the .USE node's name
453 * and save the unexpanded form.
454 * We don't need to do this for commands.
455 * They get expanded properly when we execute.
457 if (gn->uname == NULL) {
458 gn->uname = gn->name;
462 (void)Var_Subst(gn->uname, pgn, VARE_WANTRES, &gn->name);
463 /* TODO: handle errors */
464 if (gn->uname != NULL && strcmp(gn->name, gn->uname) != 0) {
465 /* See if we have a target for this node. */
466 GNode *tgn = Targ_FindNode(gn->name);
471 Lst_Append(&pgn->children, gn);
472 Lst_Append(&gn->parents, pgn);
477 cgn->type & ~(OP_OPMASK | OP_USE | OP_USEBEFORE | OP_TRANSFORM);
481 * Used by Make_Run on the downward pass to handle .USE nodes. Should be
482 * called before the children are enqueued to be looked at by MakeAddChild.
484 * For a .USE child, the commands, type flags and children are copied to the
485 * parent node, and since the relation to the .USE node is then no longer
486 * needed, that relation is removed.
489 * cgn the child, which may be a .USE node
490 * pgn the current parent
493 MakeHandleUse(GNode *cgn, GNode *pgn, GNodeListNode *ln)
497 unmarked = !(cgn->type & OP_MARK);
498 cgn->type |= OP_MARK;
500 if (!(cgn->type & (OP_USE | OP_USEBEFORE)))
504 Make_HandleUse(cgn, pgn);
507 * This child node is now "made", so we decrement the count of
508 * unmade children in the parent... We also remove the child
509 * from the parent's list to accurately reflect the number of decent
510 * children the parent has. This is used by Make_Run to decide
511 * whether to queue the parent or examine its children...
513 Lst_Remove(&pgn->children, ln);
518 HandleUseNodes(GNode *gn)
520 GNodeListNode *ln, *nln;
521 for (ln = gn->children.first; ln != NULL; ln = nln) {
523 MakeHandleUse(ln->datum, gn, ln);
529 * Check the modification time of a gnode, and update it if necessary.
530 * Return 0 if the gnode does not exist, or its filesystem time if it does.
533 Make_Recheck(GNode *gn)
537 Dir_UpdateMTime(gn, true);
542 * We can't re-stat the thing, but we can at least take care of rules
543 * where a target depends on a source that actually creates the
544 * target, but only if it has changed, e.g.
552 * cmp -s y.tab.h parse.h || mv y.tab.h parse.h
554 * In this case, if the definitions produced by yacc haven't changed
555 * from before, parse.h won't have been updated and gn->mtime will
556 * reflect the current modification time for parse.h. This is
557 * something of a kludge, I admit, but it's a useful one.
559 * XXX: People like to use a rule like "FRC:" to force things that
560 * depend on FRC to be made, so we have to check for gn->children
561 * being empty as well.
563 if (!Lst_IsEmpty(gn->commands) || Lst_IsEmpty(gn->children)) {
568 * This is what Make does and it's actually a good thing, as it
571 * cmp -s y.tab.h parse.h || cp y.tab.h parse.h
573 * to function as intended. Unfortunately, thanks to the stateless
574 * nature of NFS (by which I mean the loose coupling of two clients
575 * using the same file from a common server), there are times when
576 * the modification time of a file created on a remote machine
577 * will not be modified before the local stat() implied by the
578 * Dir_UpdateMTime occurs, thus leading us to believe that the file
579 * is unchanged, wreaking havoc with files that depend on this one.
581 * I have decided it is better to make too much than to make too
582 * little, so this stuff is commented out unless you're sure it's ok.
586 * Christos, 4/9/92: If we are saving commands, pretend that
587 * the target is made now. Otherwise archives with '...' rules
590 if (!GNode_ShouldExecute(gn) || (gn->type & OP_SAVE_CMDS) ||
591 (mtime == 0 && !(gn->type & OP_WAIT))) {
592 DEBUG2(MAKE, " recheck(%s): update time from %s to now\n",
594 gn->mtime == 0 ? "nonexistent" : Targ_FmtTime(gn->mtime));
597 DEBUG2(MAKE, " recheck(%s): current update time: %s\n",
598 gn->name, Targ_FmtTime(gn->mtime));
602 /* XXX: The returned mtime may differ from gn->mtime.
608 * Set the .PREFIX and .IMPSRC variables for all the implied parents
612 UpdateImplicitParentsVars(GNode *cgn, const char *cname)
615 const char *cpref = GNode_VarPrefix(cgn);
617 for (ln = cgn->implicitParents.first; ln != NULL; ln = ln->next) {
618 GNode *pgn = ln->datum;
619 if (pgn->flags.remake) {
620 Var_Set(pgn, IMPSRC, cname);
622 Var_Set(pgn, PREFIX, cpref);
627 /* See if a .ORDER rule stops us from building this node. */
629 IsWaitingForOrder(GNode *gn)
633 for (ln = gn->order_pred.first; ln != NULL; ln = ln->next) {
634 GNode *ogn = ln->datum;
636 if (GNode_IsDone(ogn) || !ogn->flags.remake)
640 "IsWaitingForOrder: Waiting for .ORDER node \"%s%s\"\n",
641 ogn->name, ogn->cohort_num);
647 static void MakeBuildParent(GNode *, GNodeListNode *);
650 ScheduleOrderSuccessors(GNode *gn)
652 GNodeListNode *toBeMadeNext = toBeMade.first;
655 for (ln = gn->order_succ.first; ln != NULL; ln = ln->next)
656 MakeBuildParent(ln->datum, toBeMadeNext);
660 * Perform update on the parents of a node. Used by JobFinish once
661 * a node has been dealt with and by MakeStartJobs if it finds an
664 * The unmade field of pgn is decremented and pgn may be placed on
665 * the toBeMade queue if this field becomes 0.
667 * If the child was made, the parent's flag CHILDMADE field will be
670 * If the child is not up-to-date and still does not exist,
671 * set the FORCE flag on the parents.
673 * If the child wasn't made, the youngestChild field of the parent will be
674 * altered if the child's mtime is big enough.
676 * Finally, if the child is the implied source for the parent, the
677 * parent's IMPSRC variable is set appropriately.
680 Make_Update(GNode *cgn)
682 const char *cname; /* the child's name */
688 /* It is save to re-examine any nodes again */
691 cname = GNode_VarTarget(cgn);
693 DEBUG2(MAKE, "Make_Update: %s%s\n", cgn->name, cgn->cohort_num);
696 * If the child was actually made, see what its modification time is
697 * now -- some rules won't actually update the file. If the file
698 * still doesn't exist, make its mtime now.
700 if (cgn->made != UPTODATE) {
701 mtime = Make_Recheck(cgn);
705 * If this is a `::' node, we must consult its first instance
706 * which is where all parents are linked.
708 if ((centurion = cgn->centurion) != NULL) {
709 if (!Lst_IsEmpty(&cgn->parents))
710 Punt("%s%s: cohort has parents", cgn->name,
712 centurion->unmade_cohorts--;
713 if (centurion->unmade_cohorts < 0)
714 Error("Graph cycles through centurion %s",
719 parents = ¢urion->parents;
721 /* If this was a .ORDER node, schedule the RHS */
722 ScheduleOrderSuccessors(centurion);
724 /* Now mark all the parents as having one less unmade child */
725 for (ln = parents->first; ln != NULL; ln = ln->next) {
726 GNode *pgn = ln->datum;
729 debug_printf("inspect parent %s%s: ", pgn->name,
731 GNode_FprintDetails(opts.debug_file, "", pgn, "");
732 debug_printf(", unmade %d ", pgn->unmade - 1);
735 if (!pgn->flags.remake) {
736 /* This parent isn't needed */
737 DEBUG0(MAKE, "- not needed\n");
740 if (mtime == 0 && !(cgn->type & OP_WAIT))
741 pgn->flags.force = true;
744 * If the parent has the .MADE attribute, its timestamp got
745 * updated to that of its newest child, and its unmade
746 * child count got set to zero in Make_ExpandUse().
747 * However other things might cause us to build one of its
748 * children - and so we mustn't do any processing here when
749 * the child build finishes.
751 if (pgn->type & OP_MADE) {
752 DEBUG0(MAKE, "- .MADE\n");
756 if (!(cgn->type & (OP_EXEC | OP_USE | OP_USEBEFORE))) {
757 if (cgn->made == MADE)
758 pgn->flags.childMade = true;
759 GNode_UpdateYoungestChild(pgn, cgn);
763 * A parent must wait for the completion of all instances
764 * of a `::' dependency.
766 if (centurion->unmade_cohorts != 0 ||
767 !GNode_IsDone(centurion)) {
769 "- centurion made %d, %d unmade cohorts\n",
770 centurion->made, centurion->unmade_cohorts);
774 /* One more child of this parent is now made */
776 if (pgn->unmade < 0) {
778 debug_printf("Graph cycles through %s%s\n",
779 pgn->name, pgn->cohort_num);
782 Error("Graph cycles through %s%s", pgn->name,
787 * We must always rescan the parents of .WAIT and .ORDER
790 if (pgn->unmade != 0 && !(centurion->type & OP_WAIT)
791 && !centurion->flags.doneOrder) {
792 DEBUG0(MAKE, "- unmade children\n");
795 if (pgn->made != DEFERRED) {
797 * Either this parent is on a different branch of
798 * the tree, or it on the RHS of a .WAIT directive
799 * or it is already on the toBeMade list.
801 DEBUG0(MAKE, "- not deferred\n");
805 if (IsWaitingForOrder(pgn))
809 debug_printf("- %s%s made, schedule %s%s (made %d)\n",
810 cgn->name, cgn->cohort_num,
811 pgn->name, pgn->cohort_num, pgn->made);
812 Targ_PrintNode(pgn, 2);
814 /* Ok, we can schedule the parent again */
815 pgn->made = REQUESTED;
816 Lst_Enqueue(&toBeMade, pgn);
819 UpdateImplicitParentsVars(cgn, cname);
823 UnmarkChildren(GNode *gn)
827 for (ln = gn->children.first; ln != NULL; ln = ln->next) {
828 GNode *child = ln->datum;
829 child->type &= ~OP_MARK;
834 * Add a child's name to the ALLSRC and OODATE variables of the given
835 * node, but only if it has not been given the .EXEC, .USE or .INVISIBLE
836 * attributes. .EXEC and .USE children are very rarely going to be files,
839 * If the child is a .JOIN node, its ALLSRC is propagated to the parent.
841 * A child is added to the OODATE variable if its modification time is
842 * later than that of its parent, as defined by Make, except if the
843 * parent is a .JOIN node. In that case, it is only added to the OODATE
844 * variable if it was actually made (since .JOIN nodes don't have
845 * modification times, the comparison is rather unfair...)..
848 * cgn The child to add
849 * pgn The parent to whose ALLSRC variable it should
853 MakeAddAllSrc(GNode *cgn, GNode *pgn)
855 const char *child, *allsrc;
857 if (cgn->type & OP_MARK)
859 cgn->type |= OP_MARK;
861 if (cgn->type & (OP_EXEC | OP_USE | OP_USEBEFORE | OP_INVISIBLE))
864 if (cgn->type & OP_ARCHV)
865 child = GNode_VarMember(cgn);
867 child = GNode_Path(cgn);
869 if (cgn->type & OP_JOIN)
870 allsrc = GNode_VarAllsrc(cgn);
875 Var_Append(pgn, ALLSRC, allsrc);
877 if (pgn->type & OP_JOIN) {
878 if (cgn->made == MADE)
879 Var_Append(pgn, OODATE, child);
881 } else if ((pgn->mtime < cgn->mtime) ||
882 (cgn->mtime >= now && cgn->made == MADE)) {
884 * It goes in the OODATE variable if the parent is
885 * younger than the child or if the child has been
886 * modified more recently than the start of the make.
887 * This is to keep pmake from getting confused if
888 * something else updates the parent after the make
889 * starts (shouldn't happen, I know, but sometimes it
890 * does). In such a case, if we've updated the child,
891 * the parent is likely to have a modification time
892 * later than that of the child and anything that
893 * relies on the OODATE variable will be hosed.
895 * XXX: This will cause all made children to go in
896 * the OODATE variable, even if they're not touched,
897 * if RECHECK isn't defined, since cgn->mtime is set
898 * to now in Make_Update. According to some people,
901 Var_Append(pgn, OODATE, child);
906 * Set up the ALLSRC and OODATE variables. Sad to say, it must be
907 * done separately, rather than while traversing the graph. This is
908 * because Make defined OODATE to contain all sources whose modification
909 * times were later than that of the target, *not* those sources that
910 * were out-of-date. Since in both compatibility and native modes,
911 * the modification time of the parent isn't found until the child
912 * has been dealt with, we have to wait until now to fill in the
913 * variable. As for ALLSRC, the ordering is important and not
914 * guaranteed when in native mode, so it must be set here, too.
916 * If the node is a .JOIN node, its TARGET variable will be set to
917 * match its ALLSRC variable.
920 GNode_SetLocalVars(GNode *gn)
924 if (gn->flags.doneAllsrc)
928 for (ln = gn->children.first; ln != NULL; ln = ln->next)
929 MakeAddAllSrc(ln->datum, gn);
931 if (!Var_Exists(gn, OODATE))
932 Var_Set(gn, OODATE, "");
933 if (!Var_Exists(gn, ALLSRC))
934 Var_Set(gn, ALLSRC, "");
936 if (gn->type & OP_JOIN)
937 Var_Set(gn, TARGET, GNode_VarAllsrc(gn));
938 gn->flags.doneAllsrc = true;
942 MakeBuildChild(GNode *cn, GNodeListNode *toBeMadeNext)
946 debug_printf("MakeBuildChild: inspect %s%s, ",
947 cn->name, cn->cohort_num);
948 GNode_FprintDetails(opts.debug_file, "", cn, "\n");
950 if (GNode_IsReady(cn))
953 /* If this node is on the RHS of a .ORDER, check LHSs. */
954 if (IsWaitingForOrder(cn)) {
955 /* Can't build this (or anything else in this child list) yet */
957 return false; /* but keep looking */
960 DEBUG2(MAKE, "MakeBuildChild: schedule %s%s\n",
961 cn->name, cn->cohort_num);
963 cn->made = REQUESTED;
964 if (toBeMadeNext == NULL)
965 Lst_Append(&toBeMade, cn);
967 Lst_InsertBefore(&toBeMade, toBeMadeNext, cn);
969 if (cn->unmade_cohorts != 0) {
972 for (ln = cn->cohorts.first; ln != NULL; ln = ln->next)
973 if (MakeBuildChild(ln->datum, toBeMadeNext))
978 * If this node is a .WAIT node with unmade children
979 * then don't add the next sibling.
981 return cn->type & OP_WAIT && cn->unmade > 0;
984 /* When a .ORDER LHS node completes, we do this on each RHS. */
986 MakeBuildParent(GNode *pn, GNodeListNode *toBeMadeNext)
988 if (pn->made != DEFERRED)
991 if (!MakeBuildChild(pn, toBeMadeNext)) {
992 /* When this node is built, reschedule its parents. */
993 pn->flags.doneOrder = true;
998 MakeChildren(GNode *gn)
1000 GNodeListNode *toBeMadeNext = toBeMade.first;
1003 for (ln = gn->children.first; ln != NULL; ln = ln->next)
1004 if (MakeBuildChild(ln->datum, toBeMadeNext))
1009 * Start as many jobs as possible, taking them from the toBeMade queue.
1011 * If the -q option was given, no job will be started,
1012 * but as soon as an out-of-date target is found, this function
1013 * returns true. In all other cases, this function returns false.
1019 bool have_token = false;
1021 while (!Lst_IsEmpty(&toBeMade)) {
1023 * Get token now to avoid cycling job-list when we only
1026 if (!have_token && !Job_TokenWithdraw())
1030 gn = Lst_Dequeue(&toBeMade);
1031 DEBUG2(MAKE, "Examining %s%s...\n", gn->name, gn->cohort_num);
1033 if (gn->made != REQUESTED) {
1035 * XXX: Replace %d with string representation;
1038 DEBUG1(MAKE, "state %d\n", gn->made);
1040 make_abort(gn, __LINE__);
1043 if (gn->checked_seqno == checked_seqno) {
1045 * We've already looked at this node since a job
1048 DEBUG2(MAKE, "already checked %s%s\n", gn->name,
1050 gn->made = DEFERRED;
1053 gn->checked_seqno = checked_seqno;
1055 if (gn->unmade != 0) {
1057 * We can't build this yet, add all unmade children
1058 * to toBeMade, just before the current first element.
1060 gn->made = DEFERRED;
1064 /* and drop this node on the floor */
1065 DEBUG2(MAKE, "dropped %s%s\n", gn->name,
1070 gn->made = BEINGMADE;
1071 if (GNode_IsOODate(gn)) {
1072 DEBUG0(MAKE, "out-of-date\n");
1075 GNode_SetLocalVars(gn);
1079 DEBUG0(MAKE, "up-to-date\n");
1080 gn->made = UPTODATE;
1081 if (gn->type & OP_JOIN) {
1083 * Even for an up-to-date .JOIN node, we
1084 * need it to have its local variables so
1085 * references to it get the correct value
1086 * for .TARGET when building up the local
1087 * variables of its parent(s)...
1089 GNode_SetLocalVars(gn);
1101 /* Print the status of a .ORDER node. */
1103 MakePrintStatusOrderNode(GNode *ogn, GNode *gn)
1105 if (!GNode_IsWaitingFor(ogn))
1108 printf(" `%s%s' has .ORDER dependency against %s%s ",
1109 gn->name, gn->cohort_num, ogn->name, ogn->cohort_num);
1110 GNode_FprintDetails(stdout, "(", ogn, ")\n");
1112 if (DEBUG(MAKE) && opts.debug_file != stdout) {
1113 debug_printf(" `%s%s' has .ORDER dependency against %s%s ",
1114 gn->name, gn->cohort_num, ogn->name, ogn->cohort_num);
1115 GNode_FprintDetails(opts.debug_file, "(", ogn, ")\n");
1120 MakePrintStatusOrder(GNode *gn)
1123 for (ln = gn->order_pred.first; ln != NULL; ln = ln->next)
1124 MakePrintStatusOrderNode(ln->datum, gn);
1127 static void MakePrintStatusList(GNodeList *, int *);
1130 * Print the status of a top-level node, viz. it being up-to-date already
1131 * or not created due to an error in a lower level.
1134 MakePrintStatus(GNode *gn, int *errors)
1136 if (gn->flags.doneCycle) {
1138 * We've completely processed this node before, don't do
1144 if (gn->unmade == 0) {
1145 gn->flags.doneCycle = true;
1148 printf("`%s%s' is up to date.\n", gn->name,
1158 printf("`%s%s' was not built", gn->name,
1160 GNode_FprintDetails(stdout, " (", gn, ")!\n");
1161 if (DEBUG(MAKE) && opts.debug_file != stdout) {
1162 debug_printf("`%s%s' was not built", gn->name,
1164 GNode_FprintDetails(opts.debug_file, " (", gn,
1167 /* Most likely problem is actually caused by .ORDER */
1168 MakePrintStatusOrder(gn);
1171 /* Errors - already counted */
1172 printf("`%s%s' not remade because of errors.\n",
1173 gn->name, gn->cohort_num);
1174 if (DEBUG(MAKE) && opts.debug_file != stdout)
1176 "`%s%s' not remade because of errors.\n",
1177 gn->name, gn->cohort_num);
1183 DEBUG3(MAKE, "MakePrintStatus: %s%s has %d unmade children\n",
1184 gn->name, gn->cohort_num, gn->unmade);
1186 * If printing cycles and came to one that has unmade children,
1187 * print out the cycle by recursing on its children.
1189 if (!gn->flags.cycle) {
1190 /* First time we've seen this node, check all children */
1191 gn->flags.cycle = true;
1192 MakePrintStatusList(&gn->children, errors);
1193 /* Mark that this node needn't be processed again */
1194 gn->flags.doneCycle = true;
1198 /* Only output the error once per node */
1199 gn->flags.doneCycle = true;
1200 Error("Graph cycles through `%s%s'", gn->name, gn->cohort_num);
1201 if ((*errors)++ > 100)
1202 /* Abandon the whole error report */
1205 /* Reporting for our children will give the rest of the loop */
1206 MakePrintStatusList(&gn->children, errors);
1211 MakePrintStatusList(GNodeList *gnodes, int *errors)
1215 for (ln = gnodes->first; ln != NULL; ln = ln->next)
1216 if (MakePrintStatus(ln->datum, errors))
1221 ExamineLater(GNodeList *examine, GNodeList *toBeExamined)
1225 for (ln = toBeExamined->first; ln != NULL; ln = ln->next) {
1226 GNode *gn = ln->datum;
1228 if (gn->flags.remake)
1230 if (gn->type & (OP_USE | OP_USEBEFORE))
1233 DEBUG2(MAKE, "ExamineLater: need to examine \"%s%s\"\n",
1234 gn->name, gn->cohort_num);
1235 Lst_Enqueue(examine, gn);
1240 * Expand .USE nodes and create a new targets list.
1243 * targs the initial list of targets
1246 Make_ExpandUse(GNodeList *targs)
1248 GNodeList examine = LST_INIT; /* Queue of targets to examine */
1249 Lst_AppendAll(&examine, targs);
1252 * Make an initial downward pass over the graph, marking nodes to
1253 * be made as we go down.
1255 * We call Suff_FindDeps to find where a node is and to get some
1256 * children for it if it has none and also has no commands. If the
1257 * node is a leaf, we stick it on the toBeMade queue to be looked
1258 * at in a minute, otherwise we add its children to our queue and
1259 * go on about our business.
1261 while (!Lst_IsEmpty(&examine)) {
1262 GNode *gn = Lst_Dequeue(&examine);
1264 if (gn->flags.remake)
1265 /* We've looked at this one already */
1267 gn->flags.remake = true;
1268 DEBUG2(MAKE, "Make_ExpandUse: examine %s%s\n",
1269 gn->name, gn->cohort_num);
1271 if (gn->type & OP_DOUBLEDEP)
1272 Lst_PrependAll(&examine, &gn->cohorts);
1275 * Apply any .USE rules before looking for implicit
1276 * dependencies to make sure everything has commands that
1279 * Make sure that the TARGET is set, so that we can make
1282 if (gn->type & OP_ARCHV) {
1283 char *eoa = strchr(gn->name, '(');
1284 char *eon = strchr(gn->name, ')');
1285 if (eoa == NULL || eon == NULL)
1289 Var_Set(gn, MEMBER, eoa + 1);
1290 Var_Set(gn, ARCHIVE, gn->name);
1295 Dir_UpdateMTime(gn, false);
1296 Var_Set(gn, TARGET, GNode_Path(gn));
1300 if (!(gn->type & OP_MADE))
1303 PretendAllChildrenAreMade(gn);
1304 if (gn->unmade != 0) {
1307 "%s%s still has %d unmade children\n",
1308 gn->name, gn->cohort_num, gn->unmade);
1312 if (gn->unmade != 0)
1313 ExamineLater(&examine, &gn->children);
1319 /* Make the .WAIT node depend on the previous children */
1321 add_wait_dependency(GNodeListNode *owln, GNode *wn)
1326 for (cln = owln; (cn = cln->datum) != wn; cln = cln->next) {
1327 DEBUG3(MAKE, ".WAIT: add dependency %s%s -> %s\n",
1328 cn->name, cn->cohort_num, wn->name);
1330 /* XXX: This pattern should be factored out, it repeats often */
1331 Lst_Append(&wn->children, cn);
1333 Lst_Append(&cn->parents, wn);
1337 /* Convert .WAIT nodes into dependencies. */
1339 Make_ProcessWait(GNodeList *targs)
1341 GNode *pgn; /* 'parent' node we are examining */
1342 GNodeListNode *owln; /* Previous .WAIT node */
1343 GNodeList examine; /* List of targets to examine */
1346 * We need all the nodes to have a common parent in order for the
1347 * .WAIT and .ORDER scheduling to work.
1348 * Perhaps this should be done earlier...
1351 pgn = GNode_New(".MAIN");
1352 pgn->flags.remake = true;
1353 pgn->type = OP_PHONY | OP_DEPENDS;
1354 /* Get it displayed in the diag dumps */
1355 Lst_Prepend(Targ_List(), pgn);
1359 for (ln = targs->first; ln != NULL; ln = ln->next) {
1360 GNode *cgn = ln->datum;
1362 Lst_Append(&pgn->children, cgn);
1363 Lst_Append(&cgn->parents, pgn);
1368 /* Start building with the 'dummy' .MAIN' node */
1369 MakeBuildChild(pgn, NULL);
1372 Lst_Append(&examine, pgn);
1374 while (!Lst_IsEmpty(&examine)) {
1377 pgn = Lst_Dequeue(&examine);
1379 /* We only want to process each child-list once */
1380 if (pgn->flags.doneWait)
1382 pgn->flags.doneWait = true;
1383 DEBUG1(MAKE, "Make_ProcessWait: examine %s\n", pgn->name);
1385 if (pgn->type & OP_DOUBLEDEP)
1386 Lst_PrependAll(&examine, &pgn->cohorts);
1388 owln = pgn->children.first;
1389 for (ln = pgn->children.first; ln != NULL; ln = ln->next) {
1390 GNode *cgn = ln->datum;
1391 if (cgn->type & OP_WAIT) {
1392 add_wait_dependency(owln, cgn);
1395 Lst_Append(&examine, cgn);
1404 * Initialize the nodes to remake and the list of nodes which are ready to
1405 * be made by doing a breadth-first traversal of the graph starting from the
1406 * nodes in the given list. Once this traversal is finished, all the 'leaves'
1407 * of the graph are in the toBeMade queue.
1409 * Using this queue and the Job module, work back up the graph, calling on
1410 * MakeStartJobs to keep the job table as full as possible.
1413 * targs the initial list of targets
1416 * True if work was done, false otherwise.
1419 * The make field of all nodes involved in the creation of the given
1420 * targets is set to 1. The toBeMade list is set to contain all the
1421 * 'leaves' of these subgraphs.
1424 Make_Run(GNodeList *targs)
1426 int errors; /* Number of errors the Job module reports */
1428 /* Start trying to make the current targets... */
1429 Lst_Init(&toBeMade);
1431 Make_ExpandUse(targs);
1432 Make_ProcessWait(targs);
1435 debug_printf("#***# full graph\n");
1439 if (opts.queryFlag) {
1441 * We wouldn't do any work unless we could start some jobs
1442 * in the next loop... (we won't actually start any, of
1443 * course, this is just to see if any of the targets was out
1446 return MakeStartJobs();
1449 * Initialization. At the moment, no jobs are running and until some
1450 * get started, nothing will happen since the remaining upward
1451 * traversal of the graph is performed by the routines in job.c upon
1452 * the finishing of a job. So we fill the Job table as much as we can
1453 * before going into our loop.
1455 (void)MakeStartJobs();
1458 * Main Loop: The idea here is that the ending of jobs will take
1459 * care of the maintenance of data structures and the waiting for
1460 * output will cause us to be idle most of the time while our
1461 * children run as much as possible. Because the job table is kept
1462 * as full as possible, the only time when it will be empty is when
1463 * all the jobs which need running have been run, so that is the end
1464 * condition of this loop. Note that the Job module will exit if
1465 * there were any errors unless the keepgoing flag was given.
1467 while (!Lst_IsEmpty(&toBeMade) || jobTokensRunning > 0) {
1469 (void)MakeStartJobs();
1472 errors = Job_Finish();
1475 * Print the final status of each target. E.g. if it wasn't made
1476 * because some inferior reported an error.
1478 DEBUG1(MAKE, "done: errors %d\n", errors);
1480 MakePrintStatusList(targs, &errors);
1482 debug_printf("done: errors %d\n", errors);