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