2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1989 by Berkeley Softworks
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. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 static char sccsid[] = "@(#)make.c 8.1 (Berkeley) 6/6/93";
43 static const char rcsid[] =
44 "$FreeBSD: src/usr.bin/make/make.c,v 1.11 1999/09/11 13:08:01 hoek Exp $";
50 * The functions which perform the examination of targets and
51 * their suitability for creation
54 * Make_Run Initialize things for the module and recreate
55 * whatever needs recreating. Returns TRUE if
56 * work was (or would have been) done and FALSE
59 * Make_Update Update all parents of a given child. Performs
60 * various bookkeeping chores like the updating
61 * of the cmtime field of the parent, filling
62 * of the IMPSRC context variable, etc. It will
63 * place the parent on the toBeMade queue if it
66 * Make_TimeStamp Function to set the parent's cmtime field
67 * based on a child's modification time.
69 * Make_DoAllVar Set up the various local variables for a
70 * target, including the .ALLSRC variable, making
71 * sure that any variable that needs to exist
72 * at the very least has the empty value.
74 * Make_OODate Determine if a target is out-of-date.
76 * Make_HandleUse See if a child is a .USE node for a parent
77 * and perform the .USE actions if so.
85 static Lst toBeMade; /* The current fringe of the graph. These
86 * are nodes which await examination by
87 * MakeOODate. It is added to by
88 * Make_Update and subtracted from by
90 static int numNodes; /* Number of nodes to be processed. If this
91 * is non-zero when Job_Empty() returns
92 * TRUE, there's a cycle in the graph */
94 static int MakeAddChild __P((ClientData, ClientData));
95 static int MakeAddAllSrc __P((ClientData, ClientData));
96 static int MakeTimeStamp __P((ClientData, ClientData));
97 static int MakeHandleUse __P((ClientData, ClientData));
98 static Boolean MakeStartJobs __P((void));
99 static int MakePrintStatus __P((ClientData, ClientData));
101 *-----------------------------------------------------------------------
103 * Set the cmtime field of a parent node based on the mtime stamp in its
104 * child. Called from MakeOODate via Lst_ForEach.
110 * The cmtime of the parent node will be changed if the mtime
111 * field of the child is greater than it.
112 *-----------------------------------------------------------------------
115 Make_TimeStamp (pgn, cgn)
116 GNode *pgn; /* the current parent */
117 GNode *cgn; /* the child we've just examined */
119 if (cgn->mtime > pgn->cmtime) {
120 pgn->cmtime = cgn->mtime;
126 MakeTimeStamp (pgn, cgn)
127 ClientData pgn; /* the current parent */
128 ClientData cgn; /* the child we've just examined */
130 return Make_TimeStamp((GNode *) pgn, (GNode *) cgn);
134 *-----------------------------------------------------------------------
136 * See if a given node is out of date with respect to its sources.
137 * Used by Make_Run when deciding which nodes to place on the
138 * toBeMade queue initially and by Make_Update to screen out USE and
139 * EXEC nodes. In the latter case, however, any other sort of node
140 * must be considered out-of-date since at least one of its children
141 * will have been recreated.
144 * TRUE if the node is out of date. FALSE otherwise.
147 * The mtime field of the node and the cmtime field of its parents
148 * will/may be changed.
149 *-----------------------------------------------------------------------
153 register GNode *gn; /* the node to check */
158 * Certain types of targets needn't even be sought as their datedness
159 * doesn't depend on their modification time...
161 if ((gn->type & (OP_JOIN|OP_USE|OP_EXEC)) == 0) {
162 (void) Dir_MTime (gn);
164 if (gn->mtime != 0) {
165 printf ("modified %s...", Targ_FmtTime(gn->mtime));
167 printf ("non-existent...");
173 * A target is remade in one of the following circumstances:
174 * its modification time is smaller than that of its youngest child
175 * and it would actually be run (has commands or type OP_NOP)
176 * it's the object of a force operator
177 * it has no children, was on the lhs of an operator and doesn't exist
180 * Libraries are only considered out-of-date if the archive module says
183 * These weird rules are brought to you by Backward-Compatability and
184 * the strange people who wrote 'Make'.
186 if (gn->type & OP_USE) {
188 * If the node is a USE node it is *never* out of date
192 printf(".USE node...");
195 } else if (gn->type & OP_LIB) {
197 printf("library...");
201 * always out of date if no children and :: target
204 oodate = Arch_LibOODate (gn) ||
205 ((gn->cmtime == 0) && (gn->type & OP_DOUBLEDEP));
206 } else if (gn->type & OP_JOIN) {
208 * A target with the .JOIN attribute is only considered
209 * out-of-date if any of its children was out-of-date.
212 printf(".JOIN node...");
214 oodate = gn->childMade;
215 } else if (gn->type & (OP_FORCE|OP_EXEC|OP_PHONY)) {
217 * A node which is the object of the force (!) operator or which has
218 * the .EXEC attribute is always considered out-of-date.
221 if (gn->type & OP_FORCE) {
222 printf("! operator...");
223 } else if (gn->type & OP_PHONY) {
224 printf(".PHONY node...");
226 printf(".EXEC node...");
230 } else if ((gn->mtime < gn->cmtime) ||
231 ((gn->cmtime == 0) &&
232 ((gn->mtime==0) || (gn->type & OP_DOUBLEDEP))))
235 * A node whose modification time is less than that of its
236 * youngest child or that has no children (cmtime == 0) and
237 * either doesn't exist (mtime == 0) or was the object of a
238 * :: operator is out-of-date. Why? Because that's the way Make does
242 if (gn->mtime < gn->cmtime) {
243 printf("modified before source...");
244 } else if (gn->mtime == 0) {
245 printf("non-existent and no sources...");
247 printf(":: operator and no sources...");
255 printf("source %smade...", gn->childMade ? "" : "not ");
257 oodate = gn->childMade;
264 * If the target isn't out-of-date, the parents need to know its
265 * modification time. Note that targets that appear to be out-of-date
266 * but aren't, because they have no commands and aren't of type OP_NOP,
267 * have their mtime stay below their children's mtime to keep parents from
268 * thinking they're out-of-date.
271 Lst_ForEach (gn->parents, MakeTimeStamp, (ClientData)gn);
278 *-----------------------------------------------------------------------
280 * Function used by Make_Run to add a child to the list l.
281 * It will only add the child if its make field is FALSE.
287 * The given list is extended
288 *-----------------------------------------------------------------------
291 MakeAddChild (gnp, lp)
292 ClientData gnp; /* the node to add */
293 ClientData lp; /* the list to which to add it */
295 GNode *gn = (GNode *) gnp;
298 if (!gn->make && !(gn->type & OP_USE)) {
299 (void)Lst_EnQueue (l, (ClientData)gn);
305 *-----------------------------------------------------------------------
307 * Function called by Make_Run and SuffApplyTransform on the downward
308 * pass to handle .USE and transformation nodes. A callback function
309 * for Lst_ForEach, it implements the .USE and transformation
310 * functionality by copying the node's commands, type flags
311 * and children to the parent node. Should be called before the
312 * children are enqueued to be looked at by MakeAddChild.
314 * A .USE node is much like an explicit transformation rule, except
315 * its commands are always added to the target node, even if the
316 * target already has commands.
322 * Children and commands may be added to the parent and the parent's
323 * type may be changed.
325 *-----------------------------------------------------------------------
328 Make_HandleUse (cgn, pgn)
329 register GNode *cgn; /* The .USE node */
330 register GNode *pgn; /* The target of the .USE node */
332 register GNode *gn; /* A child of the .USE node */
333 register LstNode ln; /* An element in the children list */
335 if (cgn->type & (OP_USE|OP_TRANSFORM)) {
336 if ((cgn->type & OP_USE) || Lst_IsEmpty(pgn->commands)) {
338 * .USE or transformation and target has no commands -- append
339 * the child's commands to the parent.
341 (void) Lst_Concat (pgn->commands, cgn->commands, LST_CONCNEW);
344 if (Lst_Open (cgn->children) == SUCCESS) {
345 while ((ln = Lst_Next (cgn->children)) != NILLNODE) {
346 gn = (GNode *)Lst_Datum (ln);
348 if (Lst_Member (pgn->children, gn) == NILLNODE) {
349 (void) Lst_AtEnd (pgn->children, gn);
350 (void) Lst_AtEnd (gn->parents, pgn);
354 Lst_Close (cgn->children);
357 pgn->type |= cgn->type & ~(OP_OPMASK|OP_USE|OP_TRANSFORM);
360 * This child node is now "made", so we decrement the count of
361 * unmade children in the parent... We also remove the child
362 * from the parent's list to accurately reflect the number of decent
363 * children the parent has. This is used by Make_Run to decide
364 * whether to queue the parent or examine its children...
366 if (cgn->type & OP_USE) {
373 MakeHandleUse (pgn, cgn)
374 ClientData pgn; /* the current parent */
375 ClientData cgn; /* the child we've just examined */
377 return Make_HandleUse((GNode *) pgn, (GNode *) cgn);
381 *-----------------------------------------------------------------------
383 * Perform update on the parents of a node. Used by JobFinish once
384 * a node has been dealt with and by MakeStartJobs if it finds an
391 * The unmade field of pgn is decremented and pgn may be placed on
392 * the toBeMade queue if this field becomes 0.
394 * If the child was made, the parent's childMade field will be set true
395 * and its cmtime set to now.
397 * If the child wasn't made, the cmtime field of the parent will be
398 * altered if the child's mtime is big enough.
400 * Finally, if the child is the implied source for the parent, the
401 * parent's IMPSRC variable is set appropriately.
403 *-----------------------------------------------------------------------
407 register GNode *cgn; /* the child node */
409 register GNode *pgn; /* the parent node */
410 register char *cname; /* the child's name */
411 register LstNode ln; /* Element in parents and iParents lists */
414 cname = Var_Value (TARGET, cgn, &p1);
418 * If the child was actually made, see what its modification time is
419 * now -- some rules won't actually update the file. If the file still
420 * doesn't exist, make its mtime now.
422 if (cgn->made != UPTODATE) {
425 * We can't re-stat the thing, but we can at least take care of rules
426 * where a target depends on a source that actually creates the
427 * target, but only if it has changed, e.g.
435 * cmp -s y.tab.h parse.h || mv y.tab.h parse.h
437 * In this case, if the definitions produced by yacc haven't changed
438 * from before, parse.h won't have been updated and cgn->mtime will
439 * reflect the current modification time for parse.h. This is
440 * something of a kludge, I admit, but it's a useful one..
441 * XXX: People like to use a rule like
445 * To force things that depend on FRC to be made, so we have to
446 * check for gn->children being empty as well...
448 if (!Lst_IsEmpty(cgn->commands) || Lst_IsEmpty(cgn->children)) {
453 * This is what Make does and it's actually a good thing, as it
456 * cmp -s y.tab.h parse.h || cp y.tab.h parse.h
458 * to function as intended. Unfortunately, thanks to the stateless
459 * nature of NFS (by which I mean the loose coupling of two clients
460 * using the same file from a common server), there are times
461 * when the modification time of a file created on a remote
462 * machine will not be modified before the local stat() implied by
463 * the Dir_MTime occurs, thus leading us to believe that the file
464 * is unchanged, wreaking havoc with files that depend on this one.
466 * I have decided it is better to make too much than to make too
467 * little, so this stuff is commented out unless you're sure it's ok.
471 * Christos, 4/9/92: If we are saving commands pretend that
472 * the target is made now. Otherwise archives with ... rules
475 if (noExecute || (cgn->type & OP_SAVE_CMDS) || Dir_MTime(cgn) == 0) {
479 printf("update time: %s\n", Targ_FmtTime(cgn->mtime));
484 if (Lst_Open (cgn->parents) == SUCCESS) {
485 while ((ln = Lst_Next (cgn->parents)) != NILLNODE) {
486 pgn = (GNode *)Lst_Datum (ln);
490 if ( ! (cgn->type & (OP_EXEC|OP_USE))) {
491 if (cgn->made == MADE) {
492 pgn->childMade = TRUE;
493 if (pgn->cmtime < cgn->mtime) {
494 pgn->cmtime = cgn->mtime;
497 (void)Make_TimeStamp (pgn, cgn);
500 if (pgn->unmade == 0) {
502 * Queue the node up -- any unmade predecessors will
503 * be dealt with in MakeStartJobs.
505 (void)Lst_EnQueue (toBeMade, (ClientData)pgn);
506 } else if (pgn->unmade < 0) {
507 Error ("Graph cycles through %s", pgn->name);
511 Lst_Close (cgn->parents);
514 * Deal with successor nodes. If any is marked for making and has an unmade
515 * count of 0, has not been made and isn't in the examination queue,
516 * it means we need to place it in the queue as it restrained itself
519 for (ln = Lst_First(cgn->successors); ln != NILLNODE; ln = Lst_Succ(ln)) {
520 GNode *succ = (GNode *)Lst_Datum(ln);
522 if (succ->make && succ->unmade == 0 && succ->made == UNMADE &&
523 Lst_Member(toBeMade, (ClientData)succ) == NILLNODE)
525 (void)Lst_EnQueue(toBeMade, (ClientData)succ);
530 * Set the .PREFIX and .IMPSRC variables for all the implied parents
533 if (Lst_Open (cgn->iParents) == SUCCESS) {
535 char *cpref = Var_Value(PREFIX, cgn, &p1);
537 while ((ln = Lst_Next (cgn->iParents)) != NILLNODE) {
538 pgn = (GNode *)Lst_Datum (ln);
540 Var_Set (IMPSRC, cname, pgn);
541 Var_Set (PREFIX, cpref, pgn);
545 Lst_Close (cgn->iParents);
550 *-----------------------------------------------------------------------
552 * Add a child's name to the ALLSRC and OODATE variables of the given
553 * node. Called from Make_DoAllVar via Lst_ForEach. A child is added only
554 * if it has not been given the .EXEC, .USE or .INVISIBLE attributes.
555 * .EXEC and .USE children are very rarely going to be files, so...
556 * A child is added to the OODATE variable if its modification time is
557 * later than that of its parent, as defined by Make, except if the
558 * parent is a .JOIN node. In that case, it is only added to the OODATE
559 * variable if it was actually made (since .JOIN nodes don't have
560 * modification times, the comparison is rather unfair...)..
566 * The ALLSRC variable for the given node is extended.
567 *-----------------------------------------------------------------------
570 MakeAddAllSrc (cgnp, pgnp)
571 ClientData cgnp; /* The child to add */
572 ClientData pgnp; /* The parent to whose ALLSRC variable it should be */
575 GNode *cgn = (GNode *) cgnp;
576 GNode *pgn = (GNode *) pgnp;
577 if ((cgn->type & (OP_EXEC|OP_USE|OP_INVISIBLE)) == 0) {
581 if (OP_NOP(cgn->type)) {
583 * this node is only source; use the specific pathname for it
585 child = cgn->path ? cgn->path : cgn->name;
588 child = Var_Value(TARGET, cgn, &p1);
589 Var_Append (ALLSRC, child, pgn);
590 if (pgn->type & OP_JOIN) {
591 if (cgn->made == MADE) {
592 Var_Append(OODATE, child, pgn);
594 } else if ((pgn->mtime < cgn->mtime) ||
595 (cgn->mtime >= now && cgn->made == MADE))
598 * It goes in the OODATE variable if the parent is younger than the
599 * child or if the child has been modified more recently than
600 * the start of the make. This is to keep pmake from getting
601 * confused if something else updates the parent after the
602 * make starts (shouldn't happen, I know, but sometimes it
603 * does). In such a case, if we've updated the kid, the parent
604 * is likely to have a modification time later than that of
605 * the kid and anything that relies on the OODATE variable will
608 * XXX: This will cause all made children to go in the OODATE
609 * variable, even if they're not touched, if RECHECK isn't defined,
610 * since cgn->mtime is set to now in Make_Update. According to
611 * some people, this is good...
613 Var_Append(OODATE, child, pgn);
621 *-----------------------------------------------------------------------
623 * Set up the ALLSRC and OODATE variables. Sad to say, it must be
624 * done separately, rather than while traversing the graph. This is
625 * because Make defined OODATE to contain all sources whose modification
626 * times were later than that of the target, *not* those sources that
627 * were out-of-date. Since in both compatibility and native modes,
628 * the modification time of the parent isn't found until the child
629 * has been dealt with, we have to wait until now to fill in the
630 * variable. As for ALLSRC, the ordering is important and not
631 * guaranteed when in native mode, so it must be set here, too.
637 * The ALLSRC and OODATE variables of the given node is filled in.
638 * If the node is a .JOIN node, its TARGET variable will be set to
639 * match its ALLSRC variable.
640 *-----------------------------------------------------------------------
646 Lst_ForEach (gn->children, MakeAddAllSrc, (ClientData) gn);
648 if (!Var_Exists (OODATE, gn)) {
649 Var_Set (OODATE, "", gn);
651 if (!Var_Exists (ALLSRC, gn)) {
652 Var_Set (ALLSRC, "", gn);
655 if (gn->type & OP_JOIN) {
657 Var_Set (TARGET, Var_Value (ALLSRC, gn, &p1), gn);
663 *-----------------------------------------------------------------------
665 * Start as many jobs as possible.
668 * If the query flag was given to pmake, no job will be started,
669 * but as soon as an out-of-date target is found, this function
670 * returns TRUE. At all other times, this function returns FALSE.
673 * Nodes are removed from the toBeMade queue and job table slots
676 *-----------------------------------------------------------------------
683 while (!Job_Full() && !Lst_IsEmpty (toBeMade)) {
684 gn = (GNode *) Lst_DeQueue (toBeMade);
686 printf ("Examining %s...", gn->name);
689 * Make sure any and all predecessors that are going to be made,
692 if (!Lst_IsEmpty(gn->preds)) {
695 for (ln = Lst_First(gn->preds); ln != NILLNODE; ln = Lst_Succ(ln)){
696 GNode *pgn = (GNode *)Lst_Datum(ln);
698 if (pgn->make && pgn->made == UNMADE) {
700 printf("predecessor %s not made yet.\n", pgn->name);
706 * If ln isn't nil, there's a predecessor as yet unmade, so we
707 * just drop this node on the floor. When the node in question
708 * has been made, it will notice this node as being ready to
709 * make but as yet unmade and will place the node on the queue.
711 if (ln != NILLNODE) {
717 if (Make_OODate (gn)) {
719 printf ("out-of-date\n");
728 printf ("up-to-date\n");
731 if (gn->type & OP_JOIN) {
733 * Even for an up-to-date .JOIN node, we need it to have its
734 * context variables so references to it get the correct
735 * value for .TARGET when building up the context variables
736 * of its parent(s)...
748 *-----------------------------------------------------------------------
750 * Print the status of a top-level node, viz. it being up-to-date
751 * already or not created due to an error in a lower level.
752 * Callback function for Make_Run via Lst_ForEach.
758 * A message may be printed.
760 *-----------------------------------------------------------------------
763 MakePrintStatus(gnp, cyclep)
764 ClientData gnp; /* Node to examine */
765 ClientData cyclep; /* True if gn->unmade being non-zero implies
766 * a cycle in the graph, not an error in an
769 GNode *gn = (GNode *) gnp;
770 Boolean cycle = *(Boolean *) cyclep;
771 if (gn->made == UPTODATE) {
772 printf ("`%s' is up to date.\n", gn->name);
773 } else if (gn->unmade != 0) {
777 * If printing cycles and came to one that has unmade children,
778 * print out the cycle by recursing on its children. Note a
783 * will cause this to erroneously complain about a being in
784 * the cycle, but this is a good approximation.
786 if (gn->made == CYCLE) {
787 Error("Graph cycles through `%s'", gn->name);
789 Lst_ForEach(gn->children, MakePrintStatus, (ClientData) &t);
791 } else if (gn->made != ENDCYCLE) {
793 Lst_ForEach(gn->children, MakePrintStatus, (ClientData) &t);
796 printf ("`%s' not remade because of errors.\n", gn->name);
803 *-----------------------------------------------------------------------
805 * Initialize the nodes to remake and the list of nodes which are
806 * ready to be made by doing a breadth-first traversal of the graph
807 * starting from the nodes in the given list. Once this traversal
808 * is finished, all the 'leaves' of the graph are in the toBeMade
810 * Using this queue and the Job module, work back up the graph,
811 * calling on MakeStartJobs to keep the job table as full as
815 * TRUE if work was done. FALSE otherwise.
818 * The make field of all nodes involved in the creation of the given
819 * targets is set to 1. The toBeMade list is set to contain all the
820 * 'leaves' of these subgraphs.
821 *-----------------------------------------------------------------------
825 Lst targs; /* the initial list of targets */
827 register GNode *gn; /* a temporary pointer */
828 register Lst examine; /* List of targets to examine */
829 int errors; /* Number of errors the Job module reports */
831 toBeMade = Lst_Init (FALSE);
833 examine = Lst_Duplicate(targs, NOCOPY);
837 * Make an initial downward pass over the graph, marking nodes to be made
838 * as we go down. We call Suff_FindDeps to find where a node is and
839 * to get some children for it if it has none and also has no commands.
840 * If the node is a leaf, we stick it on the toBeMade queue to
841 * be looked at in a minute, otherwise we add its children to our queue
842 * and go on about our business.
844 while (!Lst_IsEmpty (examine)) {
845 gn = (GNode *) Lst_DeQueue (examine);
852 * Apply any .USE rules before looking for implicit dependencies
853 * to make sure everything has commands that should...
855 Lst_ForEach (gn->children, MakeHandleUse, (ClientData)gn);
858 if (gn->unmade != 0) {
859 Lst_ForEach (gn->children, MakeAddChild, (ClientData)examine);
861 (void)Lst_EnQueue (toBeMade, (ClientData)gn);
866 Lst_Destroy (examine, NOFREE);
870 * We wouldn't do any work unless we could start some jobs in the
871 * next loop... (we won't actually start any, of course, this is just
872 * to see if any of the targets was out of date)
874 return (MakeStartJobs());
877 * Initialization. At the moment, no jobs are running and until some
878 * get started, nothing will happen since the remaining upward
879 * traversal of the graph is performed by the routines in job.c upon
880 * the finishing of a job. So we fill the Job table as much as we can
881 * before going into our loop.
883 (void) MakeStartJobs();
887 * Main Loop: The idea here is that the ending of jobs will take
888 * care of the maintenance of data structures and the waiting for output
889 * will cause us to be idle most of the time while our children run as
890 * much as possible. Because the job table is kept as full as possible,
891 * the only time when it will be empty is when all the jobs which need
892 * running have been run, so that is the end condition of this loop.
893 * Note that the Job module will exit if there were any errors unless the
894 * keepgoing flag was given.
896 while (!Job_Empty ()) {
898 Job_CatchChildren (!usePipes);
899 (void)MakeStartJobs();
905 * Print the final status of each target. E.g. if it wasn't made
906 * because some inferior reported an error.
908 errors = ((errors == 0) && (numNodes != 0));
909 Lst_ForEach(targs, MakePrintStatus, (ClientData) &errors);