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