Annotation of src/usr.bin/make/targ.c, Revision 1.80
1.80 ! espie 1: /* $OpenBSD: targ.c,v 1.79 2019/12/21 15:28:17 espie Exp $ */
1.6 millert 2: /* $NetBSD: targ.c,v 1.11 1997/02/20 16:51:50 christos Exp $ */
1.1 deraadt 3:
4: /*
1.31 espie 5: * Copyright (c) 1999 Marc Espie.
6: *
7: * Extensive code changes for the OpenBSD project.
8: *
9: * Redistribution and use in source and binary forms, with or without
10: * modification, are permitted provided that the following conditions
11: * are met:
12: * 1. Redistributions of source code must retain the above copyright
13: * notice, this list of conditions and the following disclaimer.
14: * 2. Redistributions in binary form must reproduce the above copyright
15: * notice, this list of conditions and the following disclaimer in the
16: * documentation and/or other materials provided with the distribution.
17: *
18: * THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
19: * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20: * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21: * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBSD
22: * PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23: * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24: * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25: * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26: * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27: * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28: * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29: */
30: /*
1.5 millert 31: * Copyright (c) 1988, 1989, 1990, 1993
32: * The Regents of the University of California. All rights reserved.
1.1 deraadt 33: * Copyright (c) 1989 by Berkeley Softworks
34: * All rights reserved.
35: *
36: * This code is derived from software contributed to Berkeley by
37: * Adam de Boor.
38: *
39: * Redistribution and use in source and binary forms, with or without
40: * modification, are permitted provided that the following conditions
41: * are met:
42: * 1. Redistributions of source code must retain the above copyright
43: * notice, this list of conditions and the following disclaimer.
44: * 2. Redistributions in binary form must reproduce the above copyright
45: * notice, this list of conditions and the following disclaimer in the
46: * documentation and/or other materials provided with the distribution.
1.38 millert 47: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 48: * may be used to endorse or promote products derived from this software
49: * without specific prior written permission.
50: *
51: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
52: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
53: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
54: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
55: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
56: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
57: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
58: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
59: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
60: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61: * SUCH DAMAGE.
62: */
63:
64: /*-
65: * targ.c --
1.27 espie 66: * Target nodes are kept into a hash table.
1.1 deraadt 67: *
68: * Interface:
1.31 espie 69: * Targ_Init Initialization procedure.
1.1 deraadt 70: *
1.31 espie 71: * Targ_NewGN Create a new GNode for the passed target
72: * (string). The node is *not* placed in the
73: * hash table, though all its fields are
74: * initialized.
1.1 deraadt 75: *
1.31 espie 76: * Targ_FindNode Find the node for a given target, creating
77: * and storing it if it doesn't exist and the
78: * flags are right (TARG_CREATE)
1.1 deraadt 79: *
1.31 espie 80: * Targ_FindList Given a list of names, find nodes for all
81: * of them, creating nodes if needed.
1.1 deraadt 82: *
1.32 espie 83: * Targ_Ignore Return true if errors should be ignored when
1.31 espie 84: * creating the given target.
1.1 deraadt 85: *
1.32 espie 86: * Targ_Silent Return true if we should be silent when
1.31 espie 87: * creating the given target.
1.1 deraadt 88: *
1.32 espie 89: * Targ_Precious Return true if the target is precious and
1.31 espie 90: * should not be removed if we are interrupted.
1.1 deraadt 91: *
92: * Debugging:
1.31 espie 93: * Targ_PrintGraph Print out the entire graphm all variables
94: * and statistics for the directory cache. Should
95: * print something for suffixes, too, but...
1.1 deraadt 96: */
97:
1.34 espie 98: #include <limits.h>
1.32 espie 99: #include <stddef.h>
1.70 espie 100: #include <stdint.h>
1.32 espie 101: #include <stdio.h>
1.67 espie 102: #include <stdlib.h>
1.33 espie 103: #include <string.h>
1.70 espie 104: #include <ohash.h>
1.32 espie 105: #include "config.h"
106: #include "defines.h"
107: #include "stats.h"
108: #include "suff.h"
109: #include "var.h"
110: #include "targ.h"
111: #include "memory.h"
112: #include "gnode.h"
113: #include "extern.h"
114: #include "timestamp.h"
115: #include "lst.h"
1.46 espie 116: #include "node_int.h"
117: #include "nodehashconsts.h"
1.67 espie 118: #include "dump.h"
1.31 espie 119:
1.57 espie 120: static struct ohash targets; /* hash table of targets */
1.46 espie 121: struct ohash_info gnode_info = {
1.75 espie 122: offsetof(GNode, name), NULL, hash_calloc, hash_free, element_alloc
1.42 espie 123: };
1.1 deraadt 124:
1.48 espie 125: #define Targ_FindConstantNode(n, f) Targ_FindNodeh(n, sizeof(n), K_##n, f)
126:
1.1 deraadt 127:
1.46 espie 128: GNode *begin_node, *end_node, *interrupt_node, *DEFAULT;
129:
1.1 deraadt 130: void
1.39 espie 131: Targ_Init(void)
1.1 deraadt 132: {
1.42 espie 133: /* A small make file already creates 200 targets. */
134: ohash_init(&targets, 10, &gnode_info);
1.46 espie 135: begin_node = Targ_FindConstantNode(NODE_BEGIN, TARG_CREATE);
136: begin_node->type |= OP_DUMMY | OP_NOTMAIN | OP_NODEFAULT;
137: end_node = Targ_FindConstantNode(NODE_END, TARG_CREATE);
138: end_node->type |= OP_DUMMY | OP_NOTMAIN | OP_NODEFAULT;
139: interrupt_node = Targ_FindConstantNode(NODE_INTERRUPT, TARG_CREATE);
140: interrupt_node->type |= OP_DUMMY | OP_NOTMAIN | OP_NODEFAULT;
141: DEFAULT = Targ_FindConstantNode(NODE_DEFAULT, TARG_CREATE);
142: DEFAULT->type |= OP_DUMMY | OP_NOTMAIN| OP_TRANSFORM | OP_NODEFAULT;
143:
1.1 deraadt 144: }
145:
146: GNode *
1.46 espie 147: Targ_NewGNi(const char *name, const char *ename)
1.1 deraadt 148: {
1.42 espie 149: GNode *gn;
1.1 deraadt 150:
1.42 espie 151: gn = ohash_create_entry(&gnode_info, name, &ename);
152: gn->path = NULL;
1.68 espie 153: gn->type = 0;
1.46 espie 154: gn->special = SPECIAL_NONE;
1.80 ! espie 155: gn->children_left = 0;
1.51 espie 156: gn->must_make = false;
1.53 espie 157: gn->built_status = UNKNOWN;
1.78 espie 158: gn->in_cycle = false;
1.80 ! espie 159: gn->child_rebuilt = false;
1.46 espie 160: gn->order = 0;
1.42 espie 161: ts_set_out_of_date(gn->mtime);
1.71 espie 162: gn->youngest = gn;
1.42 espie 163: Lst_Init(&gn->cohorts);
164: Lst_Init(&gn->parents);
165: Lst_Init(&gn->children);
1.80 ! espie 166: Lst_Init(&gn->predecessors);
1.42 espie 167: Lst_Init(&gn->successors);
168: SymTable_Init(&gn->context);
1.50 espie 169: gn->impliedsrc = NULL;
1.42 espie 170: Lst_Init(&gn->commands);
1.56 espie 171: gn->suffix = NULL;
1.57 espie 172: gn->next = NULL;
173: gn->basename = NULL;
174: gn->sibling = gn;
1.69 espie 175: gn->groupling = NULL;
1.1 deraadt 176:
1.31 espie 177: #ifdef STATS_GN_CREATION
1.42 espie 178: STAT_GN_COUNT++;
1.10 espie 179: #endif
1.1 deraadt 180:
1.42 espie 181: return gn;
1.1 deraadt 182: }
183:
1.46 espie 184: GNode *
185: Targ_FindNodei(const char *name, const char *ename, int flags)
186: {
187: uint32_t hv;
188:
189: hv = ohash_interval(name, &ename);
190: return Targ_FindNodeih(name, ename, hv, flags);
191: }
1.1 deraadt 192:
193: GNode *
1.46 espie 194: Targ_FindNodeih(const char *name, const char *ename, uint32_t hv, int flags)
1.1 deraadt 195: {
1.46 espie 196: GNode *gn;
1.42 espie 197: unsigned int slot;
1.27 espie 198:
1.46 espie 199: slot = ohash_lookup_interval(&targets, name, ename, hv);
1.27 espie 200:
1.42 espie 201: gn = ohash_find(&targets, slot);
1.31 espie 202:
1.42 espie 203: if (gn == NULL && (flags & TARG_CREATE)) {
204: gn = Targ_NewGNi(name, ename);
205: ohash_insert(&targets, slot, gn);
206: }
1.1 deraadt 207:
1.42 espie 208: return gn;
1.1 deraadt 209: }
210:
1.20 espie 211: void
1.46 espie 212: Targ_FindList(Lst nodes, Lst names)
1.1 deraadt 213: {
1.46 espie 214: LstNode ln;
215: GNode *gn;
1.42 espie 216: char *name;
217:
218: for (ln = Lst_First(names); ln != NULL; ln = Lst_Adv(ln)) {
1.77 espie 219: name = Lst_Datum(ln);
1.42 espie 220: gn = Targ_FindNode(name, TARG_CREATE);
221: /* Note: Lst_AtEnd must come before the Lst_Concat so the nodes
222: * are added to the list in the order in which they were
223: * encountered in the makefile. */
224: Lst_AtEnd(nodes, gn);
225: if (gn->type & OP_DOUBLEDEP)
226: Lst_Concat(nodes, &gn->cohorts);
227: }
1.1 deraadt 228: }
229:
1.32 espie 230: bool
1.39 espie 231: Targ_Ignore(GNode *gn)
1.1 deraadt 232: {
1.42 espie 233: if (ignoreErrors || gn->type & OP_IGNORE)
234: return true;
235: else
236: return false;
1.1 deraadt 237: }
238:
1.32 espie 239: bool
1.39 espie 240: Targ_Silent(GNode *gn)
1.1 deraadt 241: {
1.42 espie 242: if (beSilent || gn->type & OP_SILENT)
243: return true;
244: else
245: return false;
1.1 deraadt 246: }
247:
1.32 espie 248: bool
1.39 espie 249: Targ_Precious(GNode *gn)
1.1 deraadt 250: {
1.58 espie 251: if (allPrecious || (gn->type & (OP_PRECIOUS|OP_DOUBLEDEP|OP_PHONY)))
1.42 espie 252: return true;
253: else
254: return false;
1.1 deraadt 255: }
256:
1.17 espie 257: void
1.66 espie 258: Targ_PrintCmd(void *p)
1.1 deraadt 259: {
1.76 espie 260: const struct command *cmd = p;
1.66 espie 261: printf("\t%s\n", cmd->string);
1.1 deraadt 262: }
263:
264: void
1.39 espie 265: Targ_PrintType(int type)
1.1 deraadt 266: {
1.42 espie 267: int tbit;
1.5 millert 268:
1.46 espie 269: #define PRINTBIT(attr) case CONCAT(OP_,attr): printf("." #attr " "); break
270: #define PRINTDBIT(attr) case CONCAT(OP_,attr): if (DEBUG(TARG)) printf("." #attr " "); break
1.42 espie 271:
272: type &= ~OP_OPMASK;
273:
274: while (type) {
275: tbit = 1 << (ffs(type) - 1);
276: type &= ~tbit;
277:
278: switch (tbit) {
279: PRINTBIT(OPTIONAL);
280: PRINTBIT(USE);
281: PRINTBIT(EXEC);
282: PRINTBIT(IGNORE);
283: PRINTBIT(PRECIOUS);
284: PRINTBIT(SILENT);
285: PRINTBIT(MAKE);
286: PRINTBIT(JOIN);
287: PRINTBIT(INVISIBLE);
288: PRINTBIT(NOTMAIN);
289: /*XXX: MEMBER is defined, so CONCAT(OP_,MEMBER) gives OP_"%" */
1.45 espie 290: case OP_MEMBER:
291: if (DEBUG(TARG))
292: printf(".MEMBER ");
1.42 espie 293: break;
294: PRINTDBIT(ARCHV);
295: }
1.46 espie 296: }
1.1 deraadt 297: }
1.67 espie 298:
1.54 espie 299: const char *
1.52 espie 300: status_to_string(GNode *gn)
301: {
302: switch (gn->built_status) {
1.53 espie 303: case UNKNOWN:
304: return "unknown";
1.79 espie 305: case REBUILT:
1.52 espie 306: return "made";
307: case UPTODATE:
308: return "up-to-date";
309: case ERROR:
310: return "error when made";
311: case ABORTED:
312: return "aborted";
313: default:
314: return "other status";
315: }
1.49 espie 316: }
317:
1.57 espie 318: struct ohash *
319: targets_hash()
1.49 espie 320: {
1.57 espie 321: return &targets;
1.1 deraadt 322: }
1.65 espie 323:
324: GNode *
325: Targ_FindNodeh(const char *name, size_t n, uint32_t hv, int flags)
326: {
327: return Targ_FindNodeih(name, name + n - 1, hv, flags);
328: }
![[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