targ.c revision 1.13 1 1.13 christos /* $NetBSD: targ.c,v 1.13 1997/07/01 21:17:42 christos Exp $ */
2 1.5 christos
3 1.1 cgd /*
4 1.10 christos * Copyright (c) 1988, 1989, 1990, 1993
5 1.10 christos * The Regents of the University of California. All rights reserved.
6 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
7 1.1 cgd * All rights reserved.
8 1.1 cgd *
9 1.1 cgd * This code is derived from software contributed to Berkeley by
10 1.1 cgd * Adam de Boor.
11 1.1 cgd *
12 1.1 cgd * Redistribution and use in source and binary forms, with or without
13 1.1 cgd * modification, are permitted provided that the following conditions
14 1.1 cgd * are met:
15 1.1 cgd * 1. Redistributions of source code must retain the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer.
17 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 cgd * notice, this list of conditions and the following disclaimer in the
19 1.1 cgd * documentation and/or other materials provided with the distribution.
20 1.1 cgd * 3. All advertising materials mentioning features or use of this software
21 1.1 cgd * must display the following acknowledgement:
22 1.1 cgd * This product includes software developed by the University of
23 1.1 cgd * California, Berkeley and its contributors.
24 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
25 1.1 cgd * may be used to endorse or promote products derived from this software
26 1.1 cgd * without specific prior written permission.
27 1.1 cgd *
28 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 1.1 cgd * SUCH DAMAGE.
39 1.1 cgd */
40 1.1 cgd
41 1.13 christos #include <sys/cdefs.h>
42 1.1 cgd #ifndef lint
43 1.9 thorpej #if 0
44 1.10 christos static char sccsid[] = "@(#)targ.c 8.2 (Berkeley) 3/19/94";
45 1.9 thorpej #else
46 1.13 christos __RCSID("$NetBSD: targ.c,v 1.13 1997/07/01 21:17:42 christos Exp $");
47 1.9 thorpej #endif
48 1.1 cgd #endif /* not lint */
49 1.1 cgd
50 1.1 cgd /*-
51 1.1 cgd * targ.c --
52 1.1 cgd * Functions for maintaining the Lst allTargets. Target nodes are
53 1.1 cgd * kept in two structures: a Lst, maintained by the list library, and a
54 1.1 cgd * hash table, maintained by the hash library.
55 1.1 cgd *
56 1.1 cgd * Interface:
57 1.1 cgd * Targ_Init Initialization procedure.
58 1.1 cgd *
59 1.4 jtc * Targ_End Cleanup the module
60 1.4 jtc *
61 1.12 christos * Targ_List Return the list of all targets so far.
62 1.12 christos *
63 1.1 cgd * Targ_NewGN Create a new GNode for the passed target
64 1.1 cgd * (string). The node is *not* placed in the
65 1.1 cgd * hash table, though all its fields are
66 1.1 cgd * initialized.
67 1.1 cgd *
68 1.1 cgd * Targ_FindNode Find the node for a given target, creating
69 1.1 cgd * and storing it if it doesn't exist and the
70 1.1 cgd * flags are right (TARG_CREATE)
71 1.1 cgd *
72 1.1 cgd * Targ_FindList Given a list of names, find nodes for all
73 1.1 cgd * of them. If a name doesn't exist and the
74 1.1 cgd * TARG_NOCREATE flag was given, an error message
75 1.1 cgd * is printed. Else, if a name doesn't exist,
76 1.1 cgd * its node is created.
77 1.1 cgd *
78 1.1 cgd * Targ_Ignore Return TRUE if errors should be ignored when
79 1.1 cgd * creating the given target.
80 1.1 cgd *
81 1.1 cgd * Targ_Silent Return TRUE if we should be silent when
82 1.1 cgd * creating the given target.
83 1.1 cgd *
84 1.1 cgd * Targ_Precious Return TRUE if the target is precious and
85 1.1 cgd * should not be removed if we are interrupted.
86 1.1 cgd *
87 1.1 cgd * Debugging:
88 1.1 cgd * Targ_PrintGraph Print out the entire graphm all variables
89 1.1 cgd * and statistics for the directory cache. Should
90 1.1 cgd * print something for suffixes, too, but...
91 1.1 cgd */
92 1.1 cgd
93 1.1 cgd #include <stdio.h>
94 1.1 cgd #include <time.h>
95 1.1 cgd #include "make.h"
96 1.1 cgd #include "hash.h"
97 1.3 cgd #include "dir.h"
98 1.1 cgd
99 1.1 cgd static Lst allTargets; /* the list of all targets found so far */
100 1.4 jtc static Lst allGNs; /* List of all the GNodes */
101 1.1 cgd static Hash_Table targets; /* a hash table of same */
102 1.1 cgd
103 1.1 cgd #define HTSIZE 191 /* initial size of hash table */
104 1.1 cgd
105 1.4 jtc static int TargPrintOnlySrc __P((ClientData, ClientData));
106 1.4 jtc static int TargPrintName __P((ClientData, ClientData));
107 1.4 jtc static int TargPrintNode __P((ClientData, ClientData));
108 1.4 jtc static void TargFreeGN __P((ClientData));
109 1.4 jtc
110 1.1 cgd /*-
111 1.1 cgd *-----------------------------------------------------------------------
112 1.1 cgd * Targ_Init --
113 1.1 cgd * Initialize this module
114 1.1 cgd *
115 1.1 cgd * Results:
116 1.1 cgd * None
117 1.1 cgd *
118 1.1 cgd * Side Effects:
119 1.1 cgd * The allTargets list and the targets hash table are initialized
120 1.1 cgd *-----------------------------------------------------------------------
121 1.1 cgd */
122 1.1 cgd void
123 1.1 cgd Targ_Init ()
124 1.1 cgd {
125 1.1 cgd allTargets = Lst_Init (FALSE);
126 1.1 cgd Hash_InitTable (&targets, HTSIZE);
127 1.1 cgd }
128 1.1 cgd
129 1.1 cgd /*-
130 1.1 cgd *-----------------------------------------------------------------------
131 1.4 jtc * Targ_End --
132 1.4 jtc * Finalize this module
133 1.4 jtc *
134 1.4 jtc * Results:
135 1.4 jtc * None
136 1.4 jtc *
137 1.4 jtc * Side Effects:
138 1.4 jtc * All lists and gnodes are cleared
139 1.4 jtc *-----------------------------------------------------------------------
140 1.4 jtc */
141 1.4 jtc void
142 1.4 jtc Targ_End ()
143 1.4 jtc {
144 1.4 jtc Lst_Destroy(allTargets, NOFREE);
145 1.4 jtc if (allGNs)
146 1.4 jtc Lst_Destroy(allGNs, TargFreeGN);
147 1.4 jtc Hash_DeleteTable(&targets);
148 1.12 christos }
149 1.12 christos
150 1.12 christos /*-
151 1.12 christos *-----------------------------------------------------------------------
152 1.12 christos * Targ_List --
153 1.12 christos * Return the list of all targets
154 1.12 christos *
155 1.12 christos * Results:
156 1.12 christos * The list of all targets.
157 1.12 christos *
158 1.12 christos * Side Effects:
159 1.12 christos * None
160 1.12 christos *-----------------------------------------------------------------------
161 1.12 christos */
162 1.12 christos Lst
163 1.12 christos Targ_List ()
164 1.12 christos {
165 1.12 christos return allTargets;
166 1.4 jtc }
167 1.4 jtc
168 1.4 jtc /*-
169 1.4 jtc *-----------------------------------------------------------------------
170 1.1 cgd * Targ_NewGN --
171 1.1 cgd * Create and initialize a new graph node
172 1.1 cgd *
173 1.1 cgd * Results:
174 1.1 cgd * An initialized graph node with the name field filled with a copy
175 1.1 cgd * of the passed name
176 1.1 cgd *
177 1.1 cgd * Side Effects:
178 1.4 jtc * The gnode is added to the list of all gnodes.
179 1.1 cgd *-----------------------------------------------------------------------
180 1.1 cgd */
181 1.1 cgd GNode *
182 1.1 cgd Targ_NewGN (name)
183 1.1 cgd char *name; /* the name to stick in the new node */
184 1.1 cgd {
185 1.1 cgd register GNode *gn;
186 1.1 cgd
187 1.1 cgd gn = (GNode *) emalloc (sizeof (GNode));
188 1.8 christos gn->name = estrdup (name);
189 1.11 christos gn->uname = NULL;
190 1.1 cgd gn->path = (char *) 0;
191 1.1 cgd if (name[0] == '-' && name[1] == 'l') {
192 1.1 cgd gn->type = OP_LIB;
193 1.1 cgd } else {
194 1.1 cgd gn->type = 0;
195 1.1 cgd }
196 1.1 cgd gn->unmade = 0;
197 1.1 cgd gn->make = FALSE;
198 1.1 cgd gn->made = UNMADE;
199 1.1 cgd gn->childMade = FALSE;
200 1.6 christos gn->order = 0;
201 1.1 cgd gn->mtime = gn->cmtime = 0;
202 1.1 cgd gn->iParents = Lst_Init (FALSE);
203 1.1 cgd gn->cohorts = Lst_Init (FALSE);
204 1.1 cgd gn->parents = Lst_Init (FALSE);
205 1.1 cgd gn->children = Lst_Init (FALSE);
206 1.4 jtc gn->successors = Lst_Init (FALSE);
207 1.4 jtc gn->preds = Lst_Init (FALSE);
208 1.1 cgd gn->context = Lst_Init (FALSE);
209 1.1 cgd gn->commands = Lst_Init (FALSE);
210 1.3 cgd gn->suffix = NULL;
211 1.1 cgd
212 1.4 jtc if (allGNs == NULL)
213 1.4 jtc allGNs = Lst_Init(FALSE);
214 1.4 jtc Lst_AtEnd(allGNs, (ClientData) gn);
215 1.4 jtc
216 1.1 cgd return (gn);
217 1.1 cgd }
218 1.1 cgd
219 1.1 cgd /*-
220 1.1 cgd *-----------------------------------------------------------------------
221 1.4 jtc * TargFreeGN --
222 1.4 jtc * Destroy a GNode
223 1.4 jtc *
224 1.4 jtc * Results:
225 1.4 jtc * None.
226 1.4 jtc *
227 1.4 jtc * Side Effects:
228 1.4 jtc * None.
229 1.4 jtc *-----------------------------------------------------------------------
230 1.4 jtc */
231 1.4 jtc static void
232 1.4 jtc TargFreeGN (gnp)
233 1.4 jtc ClientData gnp;
234 1.4 jtc {
235 1.4 jtc GNode *gn = (GNode *) gnp;
236 1.4 jtc
237 1.4 jtc
238 1.4 jtc free(gn->name);
239 1.11 christos if (gn->uname)
240 1.11 christos free(gn->uname);
241 1.4 jtc if (gn->path)
242 1.4 jtc free(gn->path);
243 1.4 jtc
244 1.4 jtc Lst_Destroy(gn->iParents, NOFREE);
245 1.4 jtc Lst_Destroy(gn->cohorts, NOFREE);
246 1.4 jtc Lst_Destroy(gn->parents, NOFREE);
247 1.4 jtc Lst_Destroy(gn->children, NOFREE);
248 1.4 jtc Lst_Destroy(gn->successors, NOFREE);
249 1.4 jtc Lst_Destroy(gn->preds, NOFREE);
250 1.4 jtc Lst_Destroy(gn->context, NOFREE);
251 1.4 jtc Lst_Destroy(gn->commands, NOFREE);
252 1.4 jtc free((Address)gn);
253 1.4 jtc }
254 1.4 jtc
255 1.4 jtc
256 1.4 jtc /*-
257 1.4 jtc *-----------------------------------------------------------------------
258 1.1 cgd * Targ_FindNode --
259 1.1 cgd * Find a node in the list using the given name for matching
260 1.1 cgd *
261 1.1 cgd * Results:
262 1.1 cgd * The node in the list if it was. If it wasn't, return NILGNODE of
263 1.1 cgd * flags was TARG_NOCREATE or the newly created and initialized node
264 1.1 cgd * if it was TARG_CREATE
265 1.1 cgd *
266 1.1 cgd * Side Effects:
267 1.1 cgd * Sometimes a node is created and added to the list
268 1.1 cgd *-----------------------------------------------------------------------
269 1.1 cgd */
270 1.1 cgd GNode *
271 1.1 cgd Targ_FindNode (name, flags)
272 1.1 cgd char *name; /* the name to find */
273 1.1 cgd int flags; /* flags governing events when target not
274 1.1 cgd * found */
275 1.1 cgd {
276 1.1 cgd GNode *gn; /* node in that element */
277 1.1 cgd Hash_Entry *he; /* New or used hash entry for node */
278 1.1 cgd Boolean isNew; /* Set TRUE if Hash_CreateEntry had to create */
279 1.1 cgd /* an entry for the node */
280 1.1 cgd
281 1.1 cgd
282 1.1 cgd if (flags & TARG_CREATE) {
283 1.1 cgd he = Hash_CreateEntry (&targets, name, &isNew);
284 1.1 cgd if (isNew) {
285 1.1 cgd gn = Targ_NewGN (name);
286 1.1 cgd Hash_SetValue (he, gn);
287 1.1 cgd (void) Lst_AtEnd (allTargets, (ClientData)gn);
288 1.1 cgd }
289 1.1 cgd } else {
290 1.1 cgd he = Hash_FindEntry (&targets, name);
291 1.1 cgd }
292 1.1 cgd
293 1.1 cgd if (he == (Hash_Entry *) NULL) {
294 1.1 cgd return (NILGNODE);
295 1.1 cgd } else {
296 1.1 cgd return ((GNode *) Hash_GetValue (he));
297 1.1 cgd }
298 1.1 cgd }
299 1.1 cgd
300 1.1 cgd /*-
301 1.1 cgd *-----------------------------------------------------------------------
302 1.1 cgd * Targ_FindList --
303 1.10 christos * Make a complete list of GNodes from the given list of names
304 1.1 cgd *
305 1.1 cgd * Results:
306 1.1 cgd * A complete list of graph nodes corresponding to all instances of all
307 1.10 christos * the names in names.
308 1.1 cgd *
309 1.1 cgd * Side Effects:
310 1.1 cgd * If flags is TARG_CREATE, nodes will be created for all names in
311 1.1 cgd * names which do not yet have graph nodes. If flags is TARG_NOCREATE,
312 1.1 cgd * an error message will be printed for each name which can't be found.
313 1.1 cgd * -----------------------------------------------------------------------
314 1.1 cgd */
315 1.1 cgd Lst
316 1.1 cgd Targ_FindList (names, flags)
317 1.1 cgd Lst names; /* list of names to find */
318 1.1 cgd int flags; /* flags used if no node is found for a given
319 1.1 cgd * name */
320 1.1 cgd {
321 1.1 cgd Lst nodes; /* result list */
322 1.1 cgd register LstNode ln; /* name list element */
323 1.1 cgd register GNode *gn; /* node in tLn */
324 1.1 cgd char *name;
325 1.1 cgd
326 1.1 cgd nodes = Lst_Init (FALSE);
327 1.1 cgd
328 1.1 cgd if (Lst_Open (names) == FAILURE) {
329 1.1 cgd return (nodes);
330 1.1 cgd }
331 1.1 cgd while ((ln = Lst_Next (names)) != NILLNODE) {
332 1.1 cgd name = (char *)Lst_Datum(ln);
333 1.1 cgd gn = Targ_FindNode (name, flags);
334 1.1 cgd if (gn != NILGNODE) {
335 1.1 cgd /*
336 1.1 cgd * Note: Lst_AtEnd must come before the Lst_Concat so the nodes
337 1.1 cgd * are added to the list in the order in which they were
338 1.1 cgd * encountered in the makefile.
339 1.1 cgd */
340 1.1 cgd (void) Lst_AtEnd (nodes, (ClientData)gn);
341 1.1 cgd if (gn->type & OP_DOUBLEDEP) {
342 1.1 cgd (void)Lst_Concat (nodes, gn->cohorts, LST_CONCNEW);
343 1.1 cgd }
344 1.1 cgd } else if (flags == TARG_NOCREATE) {
345 1.1 cgd Error ("\"%s\" -- target unknown.", name);
346 1.1 cgd }
347 1.1 cgd }
348 1.1 cgd Lst_Close (names);
349 1.1 cgd return (nodes);
350 1.1 cgd }
351 1.1 cgd
352 1.1 cgd /*-
353 1.1 cgd *-----------------------------------------------------------------------
354 1.1 cgd * Targ_Ignore --
355 1.1 cgd * Return true if should ignore errors when creating gn
356 1.1 cgd *
357 1.1 cgd * Results:
358 1.1 cgd * TRUE if should ignore errors
359 1.1 cgd *
360 1.1 cgd * Side Effects:
361 1.1 cgd * None
362 1.1 cgd *-----------------------------------------------------------------------
363 1.1 cgd */
364 1.1 cgd Boolean
365 1.1 cgd Targ_Ignore (gn)
366 1.1 cgd GNode *gn; /* node to check for */
367 1.1 cgd {
368 1.1 cgd if (ignoreErrors || gn->type & OP_IGNORE) {
369 1.1 cgd return (TRUE);
370 1.1 cgd } else {
371 1.1 cgd return (FALSE);
372 1.1 cgd }
373 1.1 cgd }
374 1.1 cgd
375 1.1 cgd /*-
376 1.1 cgd *-----------------------------------------------------------------------
377 1.1 cgd * Targ_Silent --
378 1.1 cgd * Return true if be silent when creating gn
379 1.1 cgd *
380 1.1 cgd * Results:
381 1.1 cgd * TRUE if should be silent
382 1.1 cgd *
383 1.1 cgd * Side Effects:
384 1.1 cgd * None
385 1.1 cgd *-----------------------------------------------------------------------
386 1.1 cgd */
387 1.1 cgd Boolean
388 1.1 cgd Targ_Silent (gn)
389 1.1 cgd GNode *gn; /* node to check for */
390 1.1 cgd {
391 1.1 cgd if (beSilent || gn->type & OP_SILENT) {
392 1.1 cgd return (TRUE);
393 1.1 cgd } else {
394 1.1 cgd return (FALSE);
395 1.1 cgd }
396 1.1 cgd }
397 1.1 cgd
398 1.1 cgd /*-
399 1.1 cgd *-----------------------------------------------------------------------
400 1.1 cgd * Targ_Precious --
401 1.1 cgd * See if the given target is precious
402 1.1 cgd *
403 1.1 cgd * Results:
404 1.1 cgd * TRUE if it is precious. FALSE otherwise
405 1.1 cgd *
406 1.1 cgd * Side Effects:
407 1.1 cgd * None
408 1.1 cgd *-----------------------------------------------------------------------
409 1.1 cgd */
410 1.1 cgd Boolean
411 1.1 cgd Targ_Precious (gn)
412 1.1 cgd GNode *gn; /* the node to check */
413 1.1 cgd {
414 1.1 cgd if (allPrecious || (gn->type & (OP_PRECIOUS|OP_DOUBLEDEP))) {
415 1.1 cgd return (TRUE);
416 1.1 cgd } else {
417 1.1 cgd return (FALSE);
418 1.1 cgd }
419 1.1 cgd }
420 1.1 cgd
421 1.1 cgd /******************* DEBUG INFO PRINTING ****************/
422 1.1 cgd
423 1.1 cgd static GNode *mainTarg; /* the main target, as set by Targ_SetMain */
424 1.10 christos /*-
425 1.1 cgd *-----------------------------------------------------------------------
426 1.1 cgd * Targ_SetMain --
427 1.1 cgd * Set our idea of the main target we'll be creating. Used for
428 1.1 cgd * debugging output.
429 1.1 cgd *
430 1.1 cgd * Results:
431 1.1 cgd * None.
432 1.1 cgd *
433 1.1 cgd * Side Effects:
434 1.1 cgd * "mainTarg" is set to the main target's node.
435 1.1 cgd *-----------------------------------------------------------------------
436 1.1 cgd */
437 1.1 cgd void
438 1.1 cgd Targ_SetMain (gn)
439 1.1 cgd GNode *gn; /* The main target we'll create */
440 1.1 cgd {
441 1.1 cgd mainTarg = gn;
442 1.1 cgd }
443 1.1 cgd
444 1.1 cgd static int
445 1.4 jtc TargPrintName (gnp, ppath)
446 1.4 jtc ClientData gnp;
447 1.4 jtc ClientData ppath;
448 1.1 cgd {
449 1.4 jtc GNode *gn = (GNode *) gnp;
450 1.1 cgd printf ("%s ", gn->name);
451 1.1 cgd #ifdef notdef
452 1.1 cgd if (ppath) {
453 1.1 cgd if (gn->path) {
454 1.1 cgd printf ("[%s] ", gn->path);
455 1.1 cgd }
456 1.1 cgd if (gn == mainTarg) {
457 1.1 cgd printf ("(MAIN NAME) ");
458 1.1 cgd }
459 1.1 cgd }
460 1.3 cgd #endif /* notdef */
461 1.4 jtc return (ppath ? 0 : 0);
462 1.1 cgd }
463 1.1 cgd
464 1.1 cgd
465 1.1 cgd int
466 1.4 jtc Targ_PrintCmd (cmd, dummy)
467 1.4 jtc ClientData cmd;
468 1.4 jtc ClientData dummy;
469 1.1 cgd {
470 1.4 jtc printf ("\t%s\n", (char *) cmd);
471 1.4 jtc return (dummy ? 0 : 0);
472 1.1 cgd }
473 1.1 cgd
474 1.1 cgd /*-
475 1.1 cgd *-----------------------------------------------------------------------
476 1.1 cgd * Targ_FmtTime --
477 1.1 cgd * Format a modification time in some reasonable way and return it.
478 1.1 cgd *
479 1.1 cgd * Results:
480 1.1 cgd * The time reformatted.
481 1.1 cgd *
482 1.1 cgd * Side Effects:
483 1.1 cgd * The time is placed in a static area, so it is overwritten
484 1.1 cgd * with each call.
485 1.1 cgd *
486 1.1 cgd *-----------------------------------------------------------------------
487 1.1 cgd */
488 1.1 cgd char *
489 1.1 cgd Targ_FmtTime (time)
490 1.1 cgd time_t time;
491 1.1 cgd {
492 1.1 cgd struct tm *parts;
493 1.1 cgd static char buf[40];
494 1.1 cgd static char *months[] = {
495 1.1 cgd "Jan", "Feb", "Mar", "Apr", "May", "Jun",
496 1.1 cgd "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
497 1.1 cgd };
498 1.1 cgd
499 1.1 cgd parts = localtime(&time);
500 1.1 cgd
501 1.7 jtc sprintf (buf, "%d:%02d:%02d %s %d, %d",
502 1.1 cgd parts->tm_hour, parts->tm_min, parts->tm_sec,
503 1.7 jtc months[parts->tm_mon], parts->tm_mday, 1900 + parts->tm_year);
504 1.1 cgd return(buf);
505 1.1 cgd }
506 1.10 christos
507 1.1 cgd /*-
508 1.1 cgd *-----------------------------------------------------------------------
509 1.1 cgd * Targ_PrintType --
510 1.1 cgd * Print out a type field giving only those attributes the user can
511 1.1 cgd * set.
512 1.1 cgd *
513 1.1 cgd * Results:
514 1.1 cgd *
515 1.1 cgd * Side Effects:
516 1.1 cgd *
517 1.1 cgd *-----------------------------------------------------------------------
518 1.1 cgd */
519 1.1 cgd void
520 1.1 cgd Targ_PrintType (type)
521 1.1 cgd register int type;
522 1.1 cgd {
523 1.1 cgd register int tbit;
524 1.10 christos
525 1.1 cgd #ifdef __STDC__
526 1.1 cgd #define PRINTBIT(attr) case CONCAT(OP_,attr): printf("." #attr " "); break
527 1.1 cgd #define PRINTDBIT(attr) case CONCAT(OP_,attr): if (DEBUG(TARG)) printf("." #attr " "); break
528 1.1 cgd #else
529 1.1 cgd #define PRINTBIT(attr) case CONCAT(OP_,attr): printf(".attr "); break
530 1.1 cgd #define PRINTDBIT(attr) case CONCAT(OP_,attr): if (DEBUG(TARG)) printf(".attr "); break
531 1.1 cgd #endif /* __STDC__ */
532 1.1 cgd
533 1.1 cgd type &= ~OP_OPMASK;
534 1.1 cgd
535 1.1 cgd while (type) {
536 1.1 cgd tbit = 1 << (ffs(type) - 1);
537 1.1 cgd type &= ~tbit;
538 1.1 cgd
539 1.1 cgd switch(tbit) {
540 1.1 cgd PRINTBIT(OPTIONAL);
541 1.1 cgd PRINTBIT(USE);
542 1.1 cgd PRINTBIT(EXEC);
543 1.1 cgd PRINTBIT(IGNORE);
544 1.1 cgd PRINTBIT(PRECIOUS);
545 1.1 cgd PRINTBIT(SILENT);
546 1.1 cgd PRINTBIT(MAKE);
547 1.1 cgd PRINTBIT(JOIN);
548 1.1 cgd PRINTBIT(INVISIBLE);
549 1.1 cgd PRINTBIT(NOTMAIN);
550 1.1 cgd PRINTDBIT(LIB);
551 1.1 cgd /*XXX: MEMBER is defined, so CONCAT(OP_,MEMBER) gives OP_"%" */
552 1.1 cgd case OP_MEMBER: if (DEBUG(TARG)) printf(".MEMBER "); break;
553 1.1 cgd PRINTDBIT(ARCHV);
554 1.1 cgd }
555 1.1 cgd }
556 1.1 cgd }
557 1.1 cgd
558 1.1 cgd /*-
559 1.1 cgd *-----------------------------------------------------------------------
560 1.1 cgd * TargPrintNode --
561 1.1 cgd * print the contents of a node
562 1.1 cgd *-----------------------------------------------------------------------
563 1.1 cgd */
564 1.1 cgd static int
565 1.4 jtc TargPrintNode (gnp, passp)
566 1.4 jtc ClientData gnp;
567 1.4 jtc ClientData passp;
568 1.1 cgd {
569 1.4 jtc GNode *gn = (GNode *) gnp;
570 1.4 jtc int pass = *(int *) passp;
571 1.1 cgd if (!OP_NOP(gn->type)) {
572 1.1 cgd printf("#\n");
573 1.1 cgd if (gn == mainTarg) {
574 1.1 cgd printf("# *** MAIN TARGET ***\n");
575 1.1 cgd }
576 1.1 cgd if (pass == 2) {
577 1.1 cgd if (gn->unmade) {
578 1.1 cgd printf("# %d unmade children\n", gn->unmade);
579 1.1 cgd } else {
580 1.1 cgd printf("# No unmade children\n");
581 1.1 cgd }
582 1.1 cgd if (! (gn->type & (OP_JOIN|OP_USE|OP_EXEC))) {
583 1.1 cgd if (gn->mtime != 0) {
584 1.1 cgd printf("# last modified %s: %s\n",
585 1.1 cgd Targ_FmtTime(gn->mtime),
586 1.1 cgd (gn->made == UNMADE ? "unmade" :
587 1.1 cgd (gn->made == MADE ? "made" :
588 1.1 cgd (gn->made == UPTODATE ? "up-to-date" :
589 1.1 cgd "error when made"))));
590 1.1 cgd } else if (gn->made != UNMADE) {
591 1.1 cgd printf("# non-existent (maybe): %s\n",
592 1.1 cgd (gn->made == MADE ? "made" :
593 1.1 cgd (gn->made == UPTODATE ? "up-to-date" :
594 1.1 cgd (gn->made == ERROR ? "error when made" :
595 1.1 cgd "aborted"))));
596 1.1 cgd } else {
597 1.1 cgd printf("# unmade\n");
598 1.1 cgd }
599 1.1 cgd }
600 1.1 cgd if (!Lst_IsEmpty (gn->iParents)) {
601 1.1 cgd printf("# implicit parents: ");
602 1.1 cgd Lst_ForEach (gn->iParents, TargPrintName, (ClientData)0);
603 1.3 cgd fputc ('\n', stdout);
604 1.1 cgd }
605 1.1 cgd }
606 1.1 cgd if (!Lst_IsEmpty (gn->parents)) {
607 1.1 cgd printf("# parents: ");
608 1.1 cgd Lst_ForEach (gn->parents, TargPrintName, (ClientData)0);
609 1.3 cgd fputc ('\n', stdout);
610 1.1 cgd }
611 1.10 christos
612 1.1 cgd printf("%-16s", gn->name);
613 1.1 cgd switch (gn->type & OP_OPMASK) {
614 1.1 cgd case OP_DEPENDS:
615 1.1 cgd printf(": "); break;
616 1.1 cgd case OP_FORCE:
617 1.1 cgd printf("! "); break;
618 1.1 cgd case OP_DOUBLEDEP:
619 1.1 cgd printf(":: "); break;
620 1.1 cgd }
621 1.1 cgd Targ_PrintType (gn->type);
622 1.1 cgd Lst_ForEach (gn->children, TargPrintName, (ClientData)0);
623 1.3 cgd fputc ('\n', stdout);
624 1.1 cgd Lst_ForEach (gn->commands, Targ_PrintCmd, (ClientData)0);
625 1.1 cgd printf("\n\n");
626 1.1 cgd if (gn->type & OP_DOUBLEDEP) {
627 1.4 jtc Lst_ForEach (gn->cohorts, TargPrintNode, (ClientData)&pass);
628 1.1 cgd }
629 1.1 cgd }
630 1.1 cgd return (0);
631 1.1 cgd }
632 1.1 cgd
633 1.1 cgd /*-
634 1.1 cgd *-----------------------------------------------------------------------
635 1.1 cgd * TargPrintOnlySrc --
636 1.1 cgd * Print only those targets that are just a source.
637 1.1 cgd *
638 1.1 cgd * Results:
639 1.1 cgd * 0.
640 1.1 cgd *
641 1.1 cgd * Side Effects:
642 1.1 cgd * The name of each file is printed preceeded by #\t
643 1.1 cgd *
644 1.1 cgd *-----------------------------------------------------------------------
645 1.1 cgd */
646 1.1 cgd static int
647 1.4 jtc TargPrintOnlySrc(gnp, dummy)
648 1.4 jtc ClientData gnp;
649 1.4 jtc ClientData dummy;
650 1.4 jtc {
651 1.4 jtc GNode *gn = (GNode *) gnp;
652 1.4 jtc if (OP_NOP(gn->type))
653 1.4 jtc printf("#\t%s [%s]\n", gn->name, gn->path ? gn->path : gn->name);
654 1.4 jtc
655 1.4 jtc return (dummy ? 0 : 0);
656 1.1 cgd }
657 1.1 cgd
658 1.1 cgd /*-
659 1.1 cgd *-----------------------------------------------------------------------
660 1.1 cgd * Targ_PrintGraph --
661 1.1 cgd * print the entire graph. heh heh
662 1.1 cgd *
663 1.1 cgd * Results:
664 1.1 cgd * none
665 1.1 cgd *
666 1.1 cgd * Side Effects:
667 1.1 cgd * lots o' output
668 1.1 cgd *-----------------------------------------------------------------------
669 1.1 cgd */
670 1.3 cgd void
671 1.1 cgd Targ_PrintGraph (pass)
672 1.1 cgd int pass; /* Which pass this is. 1 => no processing
673 1.1 cgd * 2 => processing done */
674 1.1 cgd {
675 1.1 cgd printf("#*** Input graph:\n");
676 1.4 jtc Lst_ForEach (allTargets, TargPrintNode, (ClientData)&pass);
677 1.1 cgd printf("\n\n");
678 1.1 cgd printf("#\n# Files that are only sources:\n");
679 1.4 jtc Lst_ForEach (allTargets, TargPrintOnlySrc, (ClientData) 0);
680 1.1 cgd printf("#*** Global Variables:\n");
681 1.1 cgd Var_Dump (VAR_GLOBAL);
682 1.1 cgd printf("#*** Command-line Variables:\n");
683 1.1 cgd Var_Dump (VAR_CMD);
684 1.1 cgd printf("\n");
685 1.1 cgd Dir_PrintDirectories();
686 1.1 cgd printf("\n");
687 1.1 cgd Suff_PrintAll();
688 1.1 cgd }
689