source: trunk/src/kmk/make.c@ 14

Last change on this file since 14 was 9, checked in by bird, 23 years ago

Initial revision
  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 27.0 KB
Line 
1/*
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
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Adam de Boor.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. 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.
25 *
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
36 * SUCH DAMAGE.
37 *
38 * @(#)make.c 8.1 (Berkeley) 6/6/93
39 */
40
41#include <sys/cdefs.h>
42__FBSDID("$FreeBSD: src/usr.bin/make/make.c,v 1.23 2002/10/09 03:42:10 jmallett Exp $");
43
44/*-
45 * make.c --
46 * The functions which perform the examination of targets and
47 * their suitability for creation
48 *
49 * Interface:
50 * Make_Run Initialize things for the module and recreate
51 * whatever needs recreating. Returns TRUE if
52 * work was (or would have been) done and FALSE
53 * otherwise.
54 *
55 * Make_Update Update all parents of a given child. Performs
56 * various bookkeeping chores like the updating
57 * of the cmtime field of the parent, filling
58 * of the IMPSRC context variable, etc. It will
59 * place the parent on the toBeMade queue if it
60 * should be.
61 *
62 * Make_TimeStamp Function to set the parent's cmtime field
63 * based on a child's modification time.
64 *
65 * Make_DoAllVar Set up the various local variables for a
66 * target, including the .ALLSRC variable, making
67 * sure that any variable that needs to exist
68 * at the very least has the empty value.
69 *
70 * Make_OODate Determine if a target is out-of-date.
71 *
72 * Make_HandleUse See if a child is a .USE node for a parent
73 * and perform the .USE actions if so.
74 */
75
76#include "make.h"
77#include "hash.h"
78#include "dir.h"
79#include "job.h"
80
81static Lst toBeMade; /* The current fringe of the graph. These
82 * are nodes which await examination by
83 * MakeOODate. It is added to by
84 * Make_Update and subtracted from by
85 * MakeStartJobs */
86static int numNodes; /* Number of nodes to be processed. If this
87 * is non-zero when Job_Empty() returns
88 * TRUE, there's a cycle in the graph */
89
90static int MakeAddChild(void *, void *);
91static int MakeAddAllSrc(void *, void *);
92static int MakeTimeStamp(void *, void *);
93static int MakeHandleUse(void *, void *);
94static Boolean MakeStartJobs(void);
95static int MakePrintStatus(void *, void *);
96/*-
97 *-----------------------------------------------------------------------
98 * Make_TimeStamp --
99 * Set the cmtime field of a parent node based on the mtime stamp in its
100 * child. Called from MakeOODate via Lst_ForEach.
101 *
102 * Results:
103 * Always returns 0.
104 *
105 * Side Effects:
106 * The cmtime of the parent node will be changed if the mtime
107 * field of the child is greater than it.
108 *-----------------------------------------------------------------------
109 */
110int
111Make_TimeStamp (GNode *pgn, GNode *cgn)
112{
113 if (cgn->mtime > pgn->cmtime) {
114 pgn->cmtime = cgn->mtime;
115 }
116 return (0);
117}
118
119static int
120MakeTimeStamp (void *pgn, void *cgn)
121{
122 return Make_TimeStamp((GNode *) pgn, (GNode *) cgn);
123}
124
125
126/*-
127 *-----------------------------------------------------------------------
128 * Make_OODate --
129 * See if a given node is out of date with respect to its sources.
130 * Used by Make_Run when deciding which nodes to place on the
131 * toBeMade queue initially and by Make_Update to screen out USE and
132 * EXEC nodes. In the latter case, however, any other sort of node
133 * must be considered out-of-date since at least one of its children
134 * will have been recreated.
135 *
136 * Results:
137 * TRUE if the node is out of date. FALSE otherwise.
138 *
139 * Side Effects:
140 * The mtime field of the node and the cmtime field of its parents
141 * will/may be changed.
142 *-----------------------------------------------------------------------
143 */
144Boolean
145Make_OODate (GNode *gn)
146{
147 Boolean oodate;
148
149 /*
150 * Certain types of targets needn't even be sought as their datedness
151 * doesn't depend on their modification time...
152 */
153 if ((gn->type & (OP_JOIN|OP_USE|OP_EXEC)) == 0) {
154 (void) Dir_MTime (gn);
155 if (gn->mtime != 0) {
156 DEBUGF(MAKE, ("modified %s...", Targ_FmtTime(gn->mtime)));
157 } else {
158 DEBUGF(MAKE, ("non-existent..."));
159 }
160 }
161
162 /*
163 * A target is remade in one of the following circumstances:
164 * its modification time is smaller than that of its youngest child
165 * and it would actually be run (has commands or type OP_NOP)
166 * it's the object of a force operator
167 * it has no children, was on the lhs of an operator and doesn't exist
168 * already.
169 *
170 * Libraries are only considered out-of-date if the archive module says
171 * they are.
172 *
173 * These weird rules are brought to you by Backward-Compatability and
174 * the strange people who wrote 'Make'.
175 */
176 if (gn->type & OP_USE) {
177 /*
178 * If the node is a USE node it is *never* out of date
179 * no matter *what*.
180 */
181 DEBUGF(MAKE, (".USE node..."));
182 oodate = FALSE;
183 } else if (gn->type & OP_LIB) {
184 DEBUGF(MAKE, ("library..."));
185
186 /*
187 * always out of date if no children and :: target
188 */
189
190 oodate = Arch_LibOODate (gn) ||
191 ((gn->cmtime == 0) && (gn->type & OP_DOUBLEDEP));
192 } else if (gn->type & OP_JOIN) {
193 /*
194 * A target with the .JOIN attribute is only considered
195 * out-of-date if any of its children was out-of-date.
196 */
197 DEBUGF(MAKE, (".JOIN node..."));
198 oodate = gn->childMade;
199 } else if (gn->type & (OP_FORCE|OP_EXEC|OP_PHONY)) {
200 /*
201 * A node which is the object of the force (!) operator or which has
202 * the .EXEC attribute is always considered out-of-date.
203 */
204 if (gn->type & OP_FORCE) {
205 DEBUGF(MAKE, ("! operator..."));
206 } else if (gn->type & OP_PHONY) {
207 DEBUGF(MAKE, (".PHONY node..."));
208 } else {
209 DEBUGF(MAKE, (".EXEC node..."));
210 }
211 oodate = TRUE;
212 } else if ((gn->mtime < gn->cmtime) ||
213 ((gn->cmtime == 0) &&
214 ((gn->mtime==0) || (gn->type & OP_DOUBLEDEP))))
215 {
216 /*
217 * A node whose modification time is less than that of its
218 * youngest child or that has no children (cmtime == 0) and
219 * either doesn't exist (mtime == 0) or was the object of a
220 * :: operator is out-of-date. Why? Because that's the way Make does
221 * it.
222 */
223 if (gn->mtime < gn->cmtime) {
224 DEBUGF(MAKE, ("modified before source..."));
225 } else if (gn->mtime == 0) {
226 DEBUGF(MAKE, ("non-existent and no sources..."));
227 } else {
228 DEBUGF(MAKE, (":: operator and no sources..."));
229 }
230 oodate = TRUE;
231 } else
232 oodate = FALSE;
233
234 /*
235 * If the target isn't out-of-date, the parents need to know its
236 * modification time. Note that targets that appear to be out-of-date
237 * but aren't, because they have no commands and aren't of type OP_NOP,
238 * have their mtime stay below their children's mtime to keep parents from
239 * thinking they're out-of-date.
240 */
241 if (!oodate) {
242 Lst_ForEach (gn->parents, MakeTimeStamp, (void *)gn);
243 }
244
245 return (oodate);
246}
247
248
249/*-
250 *-----------------------------------------------------------------------
251 * MakeAddChild --
252 * Function used by Make_Run to add a child to the list l.
253 * It will only add the child if its make field is FALSE.
254 *
255 * Results:
256 * Always returns 0
257 *
258 * Side Effects:
259 * The given list is extended
260 *-----------------------------------------------------------------------
261 */
262static int
263MakeAddChild (void *gnp, void *lp)
264{
265 GNode *gn = (GNode *) gnp;
266 Lst l = (Lst) lp;
267
268 if (!gn->make && !(gn->type & OP_USE)) {
269 (void)Lst_EnQueue (l, (void *)gn);
270 }
271 return (0);
272}
273
274
275/*-
276 *-----------------------------------------------------------------------
277 * Make_HandleUse --
278 * Function called by Make_Run and SuffApplyTransform on the downward
279 * pass to handle .USE and transformation nodes. A callback function
280 * for Lst_ForEach, it implements the .USE and transformation
281 * functionality by copying the node's commands, type flags
282 * and children to the parent node. Should be called before the
283 * children are enqueued to be looked at by MakeAddChild.
284 *
285 * A .USE node is much like an explicit transformation rule, except
286 * its commands are always added to the target node, even if the
287 * target already has commands.
288 *
289 * Results:
290 * returns 0.
291 *
292 * Side Effects:
293 * Children and commands may be added to the parent and the parent's
294 * type may be changed.
295 *
296 *-----------------------------------------------------------------------
297 */
298int
299Make_HandleUse (GNode *cgn, GNode *pgn)
300{
301 GNode *gn; /* A child of the .USE node */
302 LstNode ln; /* An element in the children list */
303
304 if (cgn->type & (OP_USE|OP_TRANSFORM)) {
305 if ((cgn->type & OP_USE) || Lst_IsEmpty(pgn->commands)) {
306 /*
307 * .USE or transformation and target has no commands -- append
308 * the child's commands to the parent.
309 */
310 (void) Lst_Concat (pgn->commands, cgn->commands, LST_CONCNEW);
311 }
312
313 if (Lst_Open (cgn->children) == SUCCESS) {
314 while ((ln = Lst_Next (cgn->children)) != NULL) {
315 gn = (GNode *)Lst_Datum (ln);
316
317 if (Lst_Member (pgn->children, gn) == NULL) {
318 (void) Lst_AtEnd (pgn->children, gn);
319 (void) Lst_AtEnd (gn->parents, pgn);
320 pgn->unmade += 1;
321 }
322 }
323 Lst_Close (cgn->children);
324 }
325
326 pgn->type |= cgn->type & ~(OP_OPMASK|OP_USE|OP_TRANSFORM);
327
328 /*
329 * This child node is now "made", so we decrement the count of
330 * unmade children in the parent... We also remove the child
331 * from the parent's list to accurately reflect the number of decent
332 * children the parent has. This is used by Make_Run to decide
333 * whether to queue the parent or examine its children...
334 */
335 if (cgn->type & OP_USE) {
336 pgn->unmade--;
337 }
338 }
339 return (0);
340}
341static int
342MakeHandleUse (void *pgn, void *cgn)
343{
344 return Make_HandleUse((GNode *) pgn, (GNode *) cgn);
345}
346
347
348/*-
349 *-----------------------------------------------------------------------
350 * Make_Update --
351 * Perform update on the parents of a node. Used by JobFinish once
352 * a node has been dealt with and by MakeStartJobs if it finds an
353 * up-to-date node.
354 *
355 * Results:
356 * Always returns 0
357 *
358 * Side Effects:
359 * The unmade field of pgn is decremented and pgn may be placed on
360 * the toBeMade queue if this field becomes 0.
361 *
362 * If the child was made, the parent's childMade field will be set true
363 * and its cmtime set to now.
364 *
365 * If the child wasn't made, the cmtime field of the parent will be
366 * altered if the child's mtime is big enough.
367 *
368 * Finally, if the child is the implied source for the parent, the
369 * parent's IMPSRC variable is set appropriately.
370 *
371 *-----------------------------------------------------------------------
372 */
373void
374Make_Update (GNode *cgn)
375{
376 GNode *pgn; /* the parent node */
377 char *cname; /* the child's name */
378 LstNode ln; /* Element in parents and iParents lists */
379 char *p1;
380
381 cname = Var_Value (TARGET, cgn, &p1);
382 efree(p1);
383
384 /*
385 * If the child was actually made, see what its modification time is
386 * now -- some rules won't actually update the file. If the file still
387 * doesn't exist, make its mtime now.
388 */
389 if (cgn->made != UPTODATE) {
390#ifndef RECHECK
391 /*
392 * We can't re-stat the thing, but we can at least take care of rules
393 * where a target depends on a source that actually creates the
394 * target, but only if it has changed, e.g.
395 *
396 * parse.h : parse.o
397 *
398 * parse.o : parse.y
399 * yacc -d parse.y
400 * cc -c y.tab.c
401 * mv y.tab.o parse.o
402 * cmp -s y.tab.h parse.h || mv y.tab.h parse.h
403 *
404 * In this case, if the definitions produced by yacc haven't changed
405 * from before, parse.h won't have been updated and cgn->mtime will
406 * reflect the current modification time for parse.h. This is
407 * something of a kludge, I admit, but it's a useful one..
408 * XXX: People like to use a rule like
409 *
410 * FRC:
411 *
412 * To force things that depend on FRC to be made, so we have to
413 * check for gn->children being empty as well...
414 */
415 if (!Lst_IsEmpty(cgn->commands) || Lst_IsEmpty(cgn->children)) {
416 cgn->mtime = now;
417 }
418#else
419 /*
420 * This is what Make does and it's actually a good thing, as it
421 * allows rules like
422 *
423 * cmp -s y.tab.h parse.h || cp y.tab.h parse.h
424 *
425 * to function as intended. Unfortunately, thanks to the stateless
426 * nature of NFS (by which I mean the loose coupling of two clients
427 * using the same file from a common server), there are times
428 * when the modification time of a file created on a remote
429 * machine will not be modified before the local stat() implied by
430 * the Dir_MTime occurs, thus leading us to believe that the file
431 * is unchanged, wreaking havoc with files that depend on this one.
432 *
433 * I have decided it is better to make too much than to make too
434 * little, so this stuff is commented out unless you're sure it's ok.
435 * -- ardeb 1/12/88
436 */
437 /*
438 * Christos, 4/9/92: If we are saving commands pretend that
439 * the target is made now. Otherwise archives with ... rules
440 * don't work!
441 */
442 if (noExecute || (cgn->type & OP_SAVE_CMDS) || Dir_MTime(cgn) == 0) {
443 cgn->mtime = now;
444 }
445 DEBUGF(MAKE, ("update time: %s\n", Targ_FmtTime(cgn->mtime)));
446#endif
447 }
448
449 if (Lst_Open (cgn->parents) == SUCCESS) {
450 while ((ln = Lst_Next (cgn->parents)) != NULL) {
451 pgn = (GNode *)Lst_Datum (ln);
452 if (pgn->make) {
453 pgn->unmade -= 1;
454
455 if ( ! (cgn->type & (OP_EXEC|OP_USE))) {
456 if (cgn->made == MADE) {
457 pgn->childMade = TRUE;
458 if (pgn->cmtime < cgn->mtime) {
459 pgn->cmtime = cgn->mtime;
460 }
461 } else {
462 (void)Make_TimeStamp (pgn, cgn);
463 }
464 }
465 if (pgn->unmade == 0) {
466 /*
467 * Queue the node up -- any unmade predecessors will
468 * be dealt with in MakeStartJobs.
469 */
470 (void)Lst_EnQueue (toBeMade, (void *)pgn);
471 } else if (pgn->unmade < 0) {
472 Error ("Graph cycles through %s", pgn->name);
473 }
474 }
475 }
476 Lst_Close (cgn->parents);
477 }
478 /*
479 * Deal with successor nodes. If any is marked for making and has an unmade
480 * count of 0, has not been made and isn't in the examination queue,
481 * it means we need to place it in the queue as it restrained itself
482 * before.
483 */
484 for (ln = Lst_First(cgn->successors); ln != NULL; ln = Lst_Succ(ln)) {
485 GNode *succ = (GNode *)Lst_Datum(ln);
486
487 if (succ->make && succ->unmade == 0 && succ->made == UNMADE &&
488 Lst_Member(toBeMade, (void *)succ) == NULL)
489 {
490 (void)Lst_EnQueue(toBeMade, (void *)succ);
491 }
492 }
493
494 /*
495 * Set the .PREFIX and .IMPSRC variables for all the implied parents
496 * of this node.
497 */
498 if (Lst_Open (cgn->iParents) == SUCCESS) {
499 char *ptr;
500 char *cpref = Var_Value(PREFIX, cgn, &ptr);
501
502 while ((ln = Lst_Next (cgn->iParents)) != NULL) {
503 pgn = (GNode *)Lst_Datum (ln);
504 if (pgn->make) {
505 Var_Set (IMPSRC, cname, pgn);
506 Var_Set (PREFIX, cpref, pgn);
507 }
508 }
509 efree(ptr);
510 Lst_Close (cgn->iParents);
511 }
512}
513
514
515/*-
516 *-----------------------------------------------------------------------
517 * MakeAddAllSrc --
518 * Add a child's name to the ALLSRC and OODATE variables of the given
519 * node. Called from Make_DoAllVar via Lst_ForEach. A child is added only
520 * if it has not been given the .EXEC, .USE or .INVISIBLE attributes.
521 * .EXEC and .USE children are very rarely going to be files, so...
522 * A child is added to the OODATE variable if its modification time is
523 * later than that of its parent, as defined by Make, except if the
524 * parent is a .JOIN node. In that case, it is only added to the OODATE
525 * variable if it was actually made (since .JOIN nodes don't have
526 * modification times, the comparison is rather unfair...)..
527 *
528 * Results:
529 * Always returns 0
530 *
531 * Side Effects:
532 * The ALLSRC variable for the given node is extended.
533 *-----------------------------------------------------------------------
534 */
535static int
536MakeAddAllSrc (void *cgnp, void *pgnp)
537{
538 GNode *cgn = (GNode *) cgnp;
539 GNode *pgn = (GNode *) pgnp;
540 if ((cgn->type & (OP_EXEC|OP_USE|OP_INVISIBLE)) == 0) {
541 char *child;
542 char *p1 = NULL;
543
544 if (OP_NOP(cgn->type)) {
545 /*
546 * this node is only source; use the specific pathname for it
547 */
548 child = cgn->path ? cgn->path : cgn->name;
549 }
550 else
551 child = Var_Value(TARGET, cgn, &p1);
552 Var_Append (ALLSRC, child, pgn);
553 if (pgn->type & OP_JOIN) {
554 if (cgn->made == MADE) {
555 Var_Append(OODATE, child, pgn);
556 }
557 } else if ((pgn->mtime < cgn->mtime) ||
558 (cgn->mtime >= now && cgn->made == MADE))
559 {
560 /*
561 * It goes in the OODATE variable if the parent is younger than the
562 * child or if the child has been modified more recently than
563 * the start of the make. This is to keep pmake from getting
564 * confused if something else updates the parent after the
565 * make starts (shouldn't happen, I know, but sometimes it
566 * does). In such a case, if we've updated the kid, the parent
567 * is likely to have a modification time later than that of
568 * the kid and anything that relies on the OODATE variable will
569 * be hosed.
570 *
571 * XXX: This will cause all made children to go in the OODATE
572 * variable, even if they're not touched, if RECHECK isn't defined,
573 * since cgn->mtime is set to now in Make_Update. According to
574 * some people, this is good...
575 */
576 Var_Append(OODATE, child, pgn);
577 }
578 efree(p1);
579 }
580 return (0);
581}
582
583
584/*-
585 *-----------------------------------------------------------------------
586 * Make_DoAllVar --
587 * Set up the ALLSRC and OODATE variables. Sad to say, it must be
588 * done separately, rather than while traversing the graph. This is
589 * because Make defined OODATE to contain all sources whose modification
590 * times were later than that of the target, *not* those sources that
591 * were out-of-date. Since in both compatibility and native modes,
592 * the modification time of the parent isn't found until the child
593 * has been dealt with, we have to wait until now to fill in the
594 * variable. As for ALLSRC, the ordering is important and not
595 * guaranteed when in native mode, so it must be set here, too.
596 *
597 * Results:
598 * None
599 *
600 * Side Effects:
601 * The ALLSRC and OODATE variables of the given node is filled in.
602 * If the node is a .JOIN node, its TARGET variable will be set to
603 * match its ALLSRC variable.
604 *-----------------------------------------------------------------------
605 */
606void
607Make_DoAllVar (GNode *gn)
608{
609 Lst_ForEach (gn->children, MakeAddAllSrc, (void *) gn);
610
611 if (!Var_Exists (OODATE, gn)) {
612 Var_Set (OODATE, "", gn);
613 }
614 if (!Var_Exists (ALLSRC, gn)) {
615 Var_Set (ALLSRC, "", gn);
616 }
617
618 if (gn->type & OP_JOIN) {
619 char *p1;
620 Var_Set (TARGET, Var_Value (ALLSRC, gn, &p1), gn);
621 efree(p1);
622 }
623}
624
625
626/*-
627 *-----------------------------------------------------------------------
628 * MakeStartJobs --
629 * Start as many jobs as possible.
630 *
631 * Results:
632 * If the query flag was given to pmake, no job will be started,
633 * but as soon as an out-of-date target is found, this function
634 * returns TRUE. At all other times, this function returns FALSE.
635 *
636 * Side Effects:
637 * Nodes are removed from the toBeMade queue and job table slots
638 * are filled.
639 *
640 *-----------------------------------------------------------------------
641 */
642static Boolean
643MakeStartJobs (void)
644{
645 GNode *gn;
646
647 while (!Job_Full() && !Lst_IsEmpty (toBeMade)) {
648 gn = (GNode *) Lst_DeQueue (toBeMade);
649 DEBUGF(MAKE, ("Examining %s...", gn->name));
650 /*
651 * Make sure any and all predecessors that are going to be made,
652 * have been.
653 */
654 if (!Lst_IsEmpty(gn->preds)) {
655 LstNode ln;
656
657 for (ln = Lst_First(gn->preds); ln != NULL; ln = Lst_Succ(ln)){
658 GNode *pgn = (GNode *)Lst_Datum(ln);
659
660 if (pgn->make && pgn->made == UNMADE) {
661 DEBUGF(MAKE, ("predecessor %s not made yet.\n", pgn->name));
662 break;
663 }
664 }
665 /*
666 * If ln isn't NULL, there's a predecessor as yet unmade, so we
667 * just drop this node on the floor. When the node in question
668 * has been made, it will notice this node as being ready to
669 * make but as yet unmade and will place the node on the queue.
670 */
671 if (ln != NULL) {
672 continue;
673 }
674 }
675
676 numNodes--;
677 if (Make_OODate (gn)) {
678 DEBUGF(MAKE, ("out-of-date\n"));
679 if (queryFlag) {
680 return (TRUE);
681 }
682 Make_DoAllVar (gn);
683 Job_Make (gn);
684 } else {
685 DEBUGF(MAKE, ("up-to-date\n"));
686 gn->made = UPTODATE;
687 if (gn->type & OP_JOIN) {
688 /*
689 * Even for an up-to-date .JOIN node, we need it to have its
690 * context variables so references to it get the correct
691 * value for .TARGET when building up the context variables
692 * of its parent(s)...
693 */
694 Make_DoAllVar (gn);
695 }
696
697 Make_Update (gn);
698 }
699 }
700 return (FALSE);
701}
702
703
704/*-
705 *-----------------------------------------------------------------------
706 * MakePrintStatus --
707 * Print the status of a top-level node, viz. it being up-to-date
708 * already or not created due to an error in a lower level.
709 * Callback function for Make_Run via Lst_ForEach. If gn->unmade is
710 * nonzero and that is meant to imply a cycle in the graph, then
711 * cycle is TRUE.
712 *
713 * Results:
714 * Always returns 0.
715 *
716 * Side Effects:
717 * A message may be printed.
718 *
719 *-----------------------------------------------------------------------
720 */
721static int
722MakePrintStatus(void *gnp, void *cyclep)
723{
724 GNode *gn = (GNode *) gnp;
725 Boolean cycle = *(Boolean *) cyclep;
726 if (gn->made == UPTODATE) {
727 printf ("`%s' is up to date.\n", gn->name);
728 } else if (gn->unmade != 0) {
729 if (cycle) {
730 Boolean t = TRUE;
731 /*
732 * If printing cycles and came to one that has unmade children,
733 * print out the cycle by recursing on its children. Note a
734 * cycle like:
735 * a : b
736 * b : c
737 * c : b
738 * will cause this to erroneously complain about a being in
739 * the cycle, but this is a good approximation.
740 */
741 if (gn->made == CYCLE) {
742 Error("Graph cycles through `%s'", gn->name);
743 gn->made = ENDCYCLE;
744 Lst_ForEach(gn->children, MakePrintStatus, (void *) &t);
745 gn->made = UNMADE;
746 } else if (gn->made != ENDCYCLE) {
747 gn->made = CYCLE;
748 Lst_ForEach(gn->children, MakePrintStatus, (void *) &t);
749 }
750 } else {
751 printf ("`%s' not remade because of errors.\n", gn->name);
752 }
753 }
754 return (0);
755}
756
757
758/*-
759 *-----------------------------------------------------------------------
760 * Make_Run --
761 * Initialize the nodes to remake and the list of nodes which are
762 * ready to be made by doing a breadth-first traversal of the graph
763 * starting from the nodes in the given list. Once this traversal
764 * is finished, all the 'leaves' of the graph are in the toBeMade
765 * queue.
766 * Using this queue and the Job module, work back up the graph,
767 * calling on MakeStartJobs to keep the job table as full as
768 * possible.
769 *
770 * Results:
771 * TRUE if work was done. FALSE otherwise.
772 *
773 * Side Effects:
774 * The make field of all nodes involved in the creation of the given
775 * targets is set to 1. The toBeMade list is set to contain all the
776 * 'leaves' of these subgraphs.
777 *-----------------------------------------------------------------------
778 */
779Boolean
780Make_Run (Lst targs)
781{
782 GNode *gn; /* a temporary pointer */
783 Lst examine; /* List of targets to examine */
784 int errors; /* Number of errors the Job module reports */
785
786 toBeMade = Lst_Init (FALSE);
787
788 examine = Lst_Duplicate(targs, NOCOPY);
789 numNodes = 0;
790
791 /*
792 * Make an initial downward pass over the graph, marking nodes to be made
793 * as we go down. We call Suff_FindDeps to find where a node is and
794 * to get some children for it if it has none and also has no commands.
795 * If the node is a leaf, we stick it on the toBeMade queue to
796 * be looked at in a minute, otherwise we add its children to our queue
797 * and go on about our business.
798 */
799 while (!Lst_IsEmpty (examine)) {
800 gn = (GNode *) Lst_DeQueue (examine);
801
802 if (!gn->make) {
803 gn->make = TRUE;
804 numNodes++;
805
806 /*
807 * Apply any .USE rules before looking for implicit dependencies
808 * to make sure everything has commands that should...
809 */
810 Lst_ForEach (gn->children, MakeHandleUse, (void *)gn);
811 Suff_FindDeps (gn);
812
813 if (gn->unmade != 0) {
814 Lst_ForEach (gn->children, MakeAddChild, (void *)examine);
815 } else {
816 (void)Lst_EnQueue (toBeMade, (void *)gn);
817 }
818 }
819 }
820
821 Lst_Destroy (examine, NOFREE);
822
823 if (queryFlag) {
824 /*
825 * We wouldn't do any work unless we could start some jobs in the
826 * next loop... (we won't actually start any, of course, this is just
827 * to see if any of the targets was out of date)
828 */
829 return (MakeStartJobs());
830 } else {
831 /*
832 * Initialization. At the moment, no jobs are running and until some
833 * get started, nothing will happen since the remaining upward
834 * traversal of the graph is performed by the routines in job.c upon
835 * the finishing of a job. So we fill the Job table as much as we can
836 * before going into our loop.
837 */
838 (void) MakeStartJobs();
839 }
840
841 /*
842 * Main Loop: The idea here is that the ending of jobs will take
843 * care of the maintenance of data structures and the waiting for output
844 * will cause us to be idle most of the time while our children run as
845 * much as possible. Because the job table is kept as full as possible,
846 * the only time when it will be empty is when all the jobs which need
847 * running have been run, so that is the end condition of this loop.
848 * Note that the Job module will exit if there were any errors unless the
849 * keepgoing flag was given.
850 */
851 while (!Job_Empty ()) {
852 Job_CatchOutput ();
853 Job_CatchChildren (!usePipes);
854 (void)MakeStartJobs();
855 }
856
857 errors = Job_Finish();
858
859 /*
860 * Print the final status of each target. E.g. if it wasn't made
861 * because some inferior reported an error.
862 */
863 errors = ((errors == 0) && (numNodes != 0));
864 Lst_ForEach(targs, MakePrintStatus, (void *) &errors);
865
866 return (TRUE);
867}
Note: See TracBrowser for help on using the repository browser.