Annotation of src/usr.bin/make/targ.c, Revision 1.48
1.31 espie 1: /* $OpenPackages$ */
1.48 ! espie 2: /* $OpenBSD: targ.c,v 1.47 2007/09/17 14:05:34 espie Exp $ */
1.6 millert 3: /* $NetBSD: targ.c,v 1.11 1997/02/20 16:51:50 christos Exp $ */
1.1 deraadt 4:
5: /*
1.31 espie 6: * Copyright (c) 1999 Marc Espie.
7: *
8: * Extensive code changes for the OpenBSD project.
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: *
19: * THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
20: * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21: * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22: * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBSD
23: * PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24: * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25: * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26: * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27: * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28: * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29: * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30: */
31: /*
1.5 millert 32: * Copyright (c) 1988, 1989, 1990, 1993
33: * The Regents of the University of California. All rights reserved.
1.1 deraadt 34: * Copyright (c) 1989 by Berkeley Softworks
35: * All rights reserved.
36: *
37: * This code is derived from software contributed to Berkeley by
38: * Adam de Boor.
39: *
40: * Redistribution and use in source and binary forms, with or without
41: * modification, are permitted provided that the following conditions
42: * are met:
43: * 1. Redistributions of source code must retain the above copyright
44: * notice, this list of conditions and the following disclaimer.
45: * 2. Redistributions in binary form must reproduce the above copyright
46: * notice, this list of conditions and the following disclaimer in the
47: * documentation and/or other materials provided with the distribution.
1.38 millert 48: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 49: * may be used to endorse or promote products derived from this software
50: * without specific prior written permission.
51: *
52: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
53: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
56: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
57: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
58: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
59: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
61: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62: * SUCH DAMAGE.
63: */
64:
65: /*-
66: * targ.c --
1.27 espie 67: * Target nodes are kept into a hash table.
1.1 deraadt 68: *
69: * Interface:
1.31 espie 70: * Targ_Init Initialization procedure.
1.1 deraadt 71: *
1.31 espie 72: * Targ_End Cleanup the module
1.1 deraadt 73: *
1.31 espie 74: * Targ_NewGN Create a new GNode for the passed target
75: * (string). The node is *not* placed in the
76: * hash table, though all its fields are
77: * initialized.
1.1 deraadt 78: *
1.31 espie 79: * Targ_FindNode Find the node for a given target, creating
80: * and storing it if it doesn't exist and the
81: * flags are right (TARG_CREATE)
1.1 deraadt 82: *
1.31 espie 83: * Targ_FindList Given a list of names, find nodes for all
84: * of them, creating nodes if needed.
1.1 deraadt 85: *
1.32 espie 86: * Targ_Ignore Return true if errors should be ignored when
1.31 espie 87: * creating the given target.
1.1 deraadt 88: *
1.32 espie 89: * Targ_Silent Return true if we should be silent when
1.31 espie 90: * creating the given target.
1.1 deraadt 91: *
1.32 espie 92: * Targ_Precious Return true if the target is precious and
1.31 espie 93: * should not be removed if we are interrupted.
1.1 deraadt 94: *
95: * Debugging:
1.31 espie 96: * Targ_PrintGraph Print out the entire graphm all variables
97: * and statistics for the directory cache. Should
98: * print something for suffixes, too, but...
1.1 deraadt 99: */
100:
1.34 espie 101: #include <limits.h>
1.32 espie 102: #include <stddef.h>
103: #include <stdio.h>
1.40 espie 104: #include <stdint.h>
1.33 espie 105: #include <string.h>
1.32 espie 106: #include "config.h"
107: #include "defines.h"
108: #include "ohash.h"
109: #include "stats.h"
110: #include "suff.h"
111: #include "var.h"
112: #include "targ.h"
113: #include "memory.h"
114: #include "gnode.h"
115: #include "extern.h"
116: #include "timestamp.h"
117: #include "lst.h"
1.46 espie 118: #include "node_int.h"
119: #include "nodehashconsts.h"
1.37 espie 120: #ifdef CLEANUP
121: #include <stdlib.h>
122: #endif
1.31 espie 123:
124: static struct ohash targets; /* a hash table of same */
1.46 espie 125: struct ohash_info gnode_info = {
126: offsetof(GNode, name), NULL, hash_alloc, hash_free, element_alloc
1.42 espie 127: };
1.1 deraadt 128:
1.31 espie 129: static void TargPrintOnlySrc(GNode *);
130: static void TargPrintName(void *);
131: static void TargPrintNode(GNode *, int);
1.10 espie 132: #ifdef CLEANUP
1.37 espie 133: static LIST allTargets;
1.31 espie 134: static void TargFreeGN(void *);
1.10 espie 135: #endif
1.48 ! espie 136: #define Targ_FindConstantNode(n, f) Targ_FindNodeh(n, sizeof(n), K_##n, f)
! 137:
1.1 deraadt 138:
1.46 espie 139: GNode *begin_node, *end_node, *interrupt_node, *DEFAULT;
140:
1.1 deraadt 141: void
1.39 espie 142: Targ_Init(void)
1.1 deraadt 143: {
1.42 espie 144: /* A small make file already creates 200 targets. */
145: ohash_init(&targets, 10, &gnode_info);
1.37 espie 146: #ifdef CLEANUP
1.42 espie 147: Lst_Init(&allTargets);
1.37 espie 148: #endif
1.46 espie 149: begin_node = Targ_FindConstantNode(NODE_BEGIN, TARG_CREATE);
150: begin_node->type |= OP_DUMMY | OP_NOTMAIN | OP_NODEFAULT;
151: end_node = Targ_FindConstantNode(NODE_END, TARG_CREATE);
152: end_node->type |= OP_DUMMY | OP_NOTMAIN | OP_NODEFAULT;
153: interrupt_node = Targ_FindConstantNode(NODE_INTERRUPT, TARG_CREATE);
154: interrupt_node->type |= OP_DUMMY | OP_NOTMAIN | OP_NODEFAULT;
155: DEFAULT = Targ_FindConstantNode(NODE_DEFAULT, TARG_CREATE);
156: DEFAULT->type |= OP_DUMMY | OP_NOTMAIN| OP_TRANSFORM | OP_NODEFAULT;
157:
1.1 deraadt 158: }
159:
1.32 espie 160: #ifdef CLEANUP
1.1 deraadt 161: void
1.39 espie 162: Targ_End(void)
1.1 deraadt 163: {
1.42 espie 164: Lst_Every(&allTargets, TargFreeGN);
165: ohash_delete(&targets);
1.32 espie 166: }
1.10 espie 167: #endif
1.1 deraadt 168:
169: GNode *
1.46 espie 170: Targ_NewGNi(const char *name, const char *ename)
1.1 deraadt 171: {
1.42 espie 172: GNode *gn;
1.1 deraadt 173:
1.42 espie 174: gn = ohash_create_entry(&gnode_info, name, &ename);
175: gn->path = NULL;
1.46 espie 176: if (name[0] == '-' && name[1] == 'l')
1.42 espie 177: gn->type = OP_LIB;
1.46 espie 178: else
1.42 espie 179: gn->type = 0;
1.46 espie 180:
181: gn->special = SPECIAL_NONE;
182: gn->unmade = 0;
183: gn->make = false;
184: gn->made = UNMADE;
1.42 espie 185: gn->childMade = false;
1.46 espie 186: gn->order = 0;
1.42 espie 187: ts_set_out_of_date(gn->mtime);
188: ts_set_out_of_date(gn->cmtime);
189: Lst_Init(&gn->iParents);
190: Lst_Init(&gn->cohorts);
191: Lst_Init(&gn->parents);
192: Lst_Init(&gn->children);
193: Lst_Init(&gn->successors);
194: Lst_Init(&gn->preds);
195: SymTable_Init(&gn->context);
196: gn->lineno = 0;
197: gn->fname = NULL;
198: Lst_Init(&gn->commands);
199: gn->suffix = NULL;
1.1 deraadt 200:
1.31 espie 201: #ifdef STATS_GN_CREATION
1.42 espie 202: STAT_GN_COUNT++;
1.10 espie 203: #endif
1.1 deraadt 204:
1.37 espie 205: #ifdef CLEANUP
1.42 espie 206: Lst_AtEnd(&allTargets, gn);
1.37 espie 207: #endif
1.42 espie 208: return gn;
1.1 deraadt 209: }
210:
1.10 espie 211: #ifdef CLEANUP
1.1 deraadt 212: static void
1.39 espie 213: TargFreeGN(void *gnp)
1.1 deraadt 214: {
1.42 espie 215: GNode *gn = (GNode *)gnp;
1.1 deraadt 216:
1.42 espie 217: efree(gn->path);
218: Lst_Destroy(&gn->iParents, NOFREE);
219: Lst_Destroy(&gn->cohorts, NOFREE);
220: Lst_Destroy(&gn->parents, NOFREE);
221: Lst_Destroy(&gn->children, NOFREE);
222: Lst_Destroy(&gn->successors, NOFREE);
223: Lst_Destroy(&gn->preds, NOFREE);
224: Lst_Destroy(&gn->commands, NOFREE);
225: SymTable_Destroy(&gn->context);
226: free(gn);
1.1 deraadt 227: }
1.10 espie 228: #endif
1.1 deraadt 229:
1.46 espie 230: GNode *
231: Targ_FindNodei(const char *name, const char *ename, int flags)
232: {
233: uint32_t hv;
234:
235: hv = ohash_interval(name, &ename);
236: return Targ_FindNodeih(name, ename, hv, flags);
237: }
1.1 deraadt 238:
239: GNode *
1.46 espie 240: Targ_FindNodeih(const char *name, const char *ename, uint32_t hv, int flags)
1.1 deraadt 241: {
1.46 espie 242: GNode *gn;
1.42 espie 243: unsigned int slot;
1.27 espie 244:
1.46 espie 245: slot = ohash_lookup_interval(&targets, name, ename, hv);
1.27 espie 246:
1.42 espie 247: gn = ohash_find(&targets, slot);
1.31 espie 248:
1.42 espie 249: if (gn == NULL && (flags & TARG_CREATE)) {
250: gn = Targ_NewGNi(name, ename);
251: ohash_insert(&targets, slot, gn);
252: }
1.1 deraadt 253:
1.42 espie 254: return gn;
1.1 deraadt 255: }
256:
1.20 espie 257: void
1.46 espie 258: Targ_FindList(Lst nodes, Lst names)
1.1 deraadt 259: {
1.46 espie 260: LstNode ln;
261: GNode *gn;
1.42 espie 262: char *name;
263:
264: for (ln = Lst_First(names); ln != NULL; ln = Lst_Adv(ln)) {
265: name = (char *)Lst_Datum(ln);
266: gn = Targ_FindNode(name, TARG_CREATE);
267: /* Note: Lst_AtEnd must come before the Lst_Concat so the nodes
268: * are added to the list in the order in which they were
269: * encountered in the makefile. */
270: Lst_AtEnd(nodes, gn);
271: if (gn->type & OP_DOUBLEDEP)
272: Lst_Concat(nodes, &gn->cohorts);
273: }
1.1 deraadt 274: }
275:
1.32 espie 276: bool
1.39 espie 277: Targ_Ignore(GNode *gn)
1.1 deraadt 278: {
1.42 espie 279: if (ignoreErrors || gn->type & OP_IGNORE)
280: return true;
281: else
282: return false;
1.1 deraadt 283: }
284:
1.32 espie 285: bool
1.39 espie 286: Targ_Silent(GNode *gn)
1.1 deraadt 287: {
1.42 espie 288: if (beSilent || gn->type & OP_SILENT)
289: return true;
290: else
291: return false;
1.1 deraadt 292: }
293:
1.32 espie 294: bool
1.39 espie 295: Targ_Precious(GNode *gn)
1.1 deraadt 296: {
1.42 espie 297: if (allPrecious || (gn->type & (OP_PRECIOUS|OP_DOUBLEDEP)))
298: return true;
299: else
300: return false;
1.1 deraadt 301: }
302:
1.17 espie 303: static void
1.39 espie 304: TargPrintName(void *gnp)
1.1 deraadt 305: {
1.42 espie 306: GNode *gn = (GNode *)gnp;
307: printf("%s ", gn->name);
1.1 deraadt 308: }
309:
310:
1.17 espie 311: void
1.39 espie 312: Targ_PrintCmd(void *cmd)
1.1 deraadt 313: {
1.42 espie 314: printf("\t%s\n", (char *)cmd);
1.1 deraadt 315: }
316:
317: void
1.39 espie 318: Targ_PrintType(int type)
1.1 deraadt 319: {
1.42 espie 320: int tbit;
1.5 millert 321:
1.46 espie 322: #define PRINTBIT(attr) case CONCAT(OP_,attr): printf("." #attr " "); break
323: #define PRINTDBIT(attr) case CONCAT(OP_,attr): if (DEBUG(TARG)) printf("." #attr " "); break
1.42 espie 324:
325: type &= ~OP_OPMASK;
326:
327: while (type) {
328: tbit = 1 << (ffs(type) - 1);
329: type &= ~tbit;
330:
331: switch (tbit) {
332: PRINTBIT(OPTIONAL);
333: PRINTBIT(USE);
334: PRINTBIT(EXEC);
335: PRINTBIT(IGNORE);
336: PRINTBIT(PRECIOUS);
337: PRINTBIT(SILENT);
338: PRINTBIT(MAKE);
339: PRINTBIT(JOIN);
340: PRINTBIT(INVISIBLE);
341: PRINTBIT(NOTMAIN);
342: PRINTDBIT(LIB);
343: /*XXX: MEMBER is defined, so CONCAT(OP_,MEMBER) gives OP_"%" */
1.45 espie 344: case OP_MEMBER:
345: if (DEBUG(TARG))
346: printf(".MEMBER ");
1.42 espie 347: break;
348: PRINTDBIT(ARCHV);
349: }
1.46 espie 350: }
1.1 deraadt 351: }
352:
1.17 espie 353: static void
1.39 espie 354: TargPrintNode(GNode *gn, int pass)
1.1 deraadt 355: {
1.42 espie 356: if (OP_NOP(gn->type))
357: return;
1.1 deraadt 358: printf("#\n");
359: if (pass == 2) {
1.46 espie 360: printf("# %d unmade children\n", gn->unmade);
1.42 espie 361: if (! (gn->type & (OP_JOIN|OP_USE|OP_EXEC))) {
362: if (!is_out_of_date(gn->mtime)) {
363: printf("# last modified %s: %s\n",
1.46 espie 364: time_to_string(gn->mtime),
365: (gn->made == UNMADE ? "unmade" :
366: (gn->made == MADE ? "made" :
367: (gn->made == UPTODATE ? "up-to-date" :
368: "error when made"))));
1.42 espie 369: } else if (gn->made != UNMADE) {
370: printf("# non-existent (maybe): %s\n",
1.46 espie 371: (gn->made == MADE ? "made" :
372: (gn->made == UPTODATE ? "up-to-date" :
373: (gn->made == ERROR ? "error when made" :
374: "aborted"))));
1.42 espie 375: } else {
376: printf("# unmade\n");
377: }
378: }
379: if (!Lst_IsEmpty(&gn->iParents)) {
380: printf("# implicit parents: ");
381: Lst_Every(&gn->iParents, TargPrintName);
382: fputc('\n', stdout);
1.31 espie 383: }
1.1 deraadt 384: }
1.19 espie 385: if (!Lst_IsEmpty(&gn->parents)) {
1.42 espie 386: printf("# parents: ");
387: Lst_Every(&gn->parents, TargPrintName);
388: fputc('\n', stdout);
1.1 deraadt 389: }
1.5 millert 390:
1.1 deraadt 391: printf("%-16s", gn->name);
392: switch (gn->type & OP_OPMASK) {
1.42 espie 393: case OP_DEPENDS:
1.1 deraadt 394: printf(": "); break;
1.42 espie 395: case OP_FORCE:
1.1 deraadt 396: printf("! "); break;
1.42 espie 397: case OP_DOUBLEDEP:
1.1 deraadt 398: printf(":: "); break;
399: }
1.17 espie 400: Targ_PrintType(gn->type);
1.19 espie 401: Lst_Every(&gn->children, TargPrintName);
1.17 espie 402: fputc('\n', stdout);
1.19 espie 403: Lst_Every(&gn->commands, Targ_PrintCmd);
1.1 deraadt 404: printf("\n\n");
1.27 espie 405: if (gn->type & OP_DOUBLEDEP) {
1.42 espie 406: LstNode ln;
1.31 espie 407:
1.42 espie 408: for (ln = Lst_First(&gn->cohorts); ln != NULL; ln = Lst_Adv(ln))
409: TargPrintNode((GNode *)Lst_Datum(ln), pass);
1.27 espie 410: }
1.1 deraadt 411: }
412:
1.17 espie 413: static void
1.39 espie 414: TargPrintOnlySrc(GNode *gn)
1.1 deraadt 415: {
1.47 espie 416: if (OP_NOP(gn->type) && gn->special == SPECIAL_NONE &&
417: !(gn->type & OP_DUMMY))
1.42 espie 418: printf("#\t%s [%s]\n", gn->name,
419: gn->path != NULL ? gn->path : gn->name);
1.1 deraadt 420: }
421:
422: void
1.39 espie 423: Targ_PrintGraph(int pass) /* Which pass this is. 1 => no processing
1.31 espie 424: * 2 => processing done */
1.1 deraadt 425: {
1.42 espie 426: GNode *gn;
427: unsigned int i;
1.27 espie 428:
1.42 espie 429: printf("#*** Input graph:\n");
430: for (gn = ohash_first(&targets, &i); gn != NULL;
431: gn = ohash_next(&targets, &i))
432: TargPrintNode(gn, pass);
433: printf("\n\n");
434: printf("#\n# Files that are only sources:\n");
435: for (gn = ohash_first(&targets, &i); gn != NULL;
436: gn = ohash_next(&targets, &i))
1.46 espie 437: TargPrintOnlySrc(gn);
1.42 espie 438: Var_Dump();
439: printf("\n");
1.46 espie 440: #ifdef DEBUG_DIRECTORY_CACHE
441: Dir_PrintDirectories();
442: printf("\n");
443: #endif
1.42 espie 444: Suff_PrintAll();
1.1 deraadt 445: }
![[BACK]](/icons/back.gif){kind=icon}
Return to targ.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / make