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