Home | History | Annotate | Line # | Download | only in make
targ.c revision 1.96
      1  1.96    rillig /*	$NetBSD: targ.c,v 1.96 2020/09/26 16:18:44 rillig 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.30       agc  *
      7  1.30       agc  * This code is derived from software contributed to Berkeley by
      8  1.30       agc  * Adam de Boor.
      9  1.30       agc  *
     10  1.30       agc  * Redistribution and use in source and binary forms, with or without
     11  1.30       agc  * modification, are permitted provided that the following conditions
     12  1.30       agc  * are met:
     13  1.30       agc  * 1. Redistributions of source code must retain the above copyright
     14  1.30       agc  *    notice, this list of conditions and the following disclaimer.
     15  1.30       agc  * 2. Redistributions in binary form must reproduce the above copyright
     16  1.30       agc  *    notice, this list of conditions and the following disclaimer in the
     17  1.30       agc  *    documentation and/or other materials provided with the distribution.
     18  1.30       agc  * 3. Neither the name of the University nor the names of its contributors
     19  1.30       agc  *    may be used to endorse or promote products derived from this software
     20  1.30       agc  *    without specific prior written permission.
     21  1.30       agc  *
     22  1.30       agc  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23  1.30       agc  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24  1.30       agc  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25  1.30       agc  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26  1.30       agc  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27  1.30       agc  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28  1.30       agc  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29  1.30       agc  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30  1.30       agc  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31  1.30       agc  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32  1.30       agc  * SUCH DAMAGE.
     33  1.30       agc  */
     34  1.30       agc 
     35  1.30       agc /*
     36   1.1       cgd  * Copyright (c) 1989 by Berkeley Softworks
     37   1.1       cgd  * All rights reserved.
     38   1.1       cgd  *
     39   1.1       cgd  * This code is derived from software contributed to Berkeley by
     40   1.1       cgd  * Adam de Boor.
     41   1.1       cgd  *
     42   1.1       cgd  * Redistribution and use in source and binary forms, with or without
     43   1.1       cgd  * modification, are permitted provided that the following conditions
     44   1.1       cgd  * are met:
     45   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     46   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     47   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     48   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     49   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     50   1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     51   1.1       cgd  *    must display the following acknowledgement:
     52   1.1       cgd  *	This product includes software developed by the University of
     53   1.1       cgd  *	California, Berkeley and its contributors.
     54   1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     55   1.1       cgd  *    may be used to endorse or promote products derived from this software
     56   1.1       cgd  *    without specific prior written permission.
     57   1.1       cgd  *
     58   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     59   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     60   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     61   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     62   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     63   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     64   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     65   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     66   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     67   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     68   1.1       cgd  * SUCH DAMAGE.
     69   1.1       cgd  */
     70   1.1       cgd 
     71   1.1       cgd /*-
     72   1.1       cgd  * targ.c --
     73   1.1       cgd  *	Functions for maintaining the Lst allTargets. Target nodes are
     74  1.77    rillig  *	kept in two structures: a Lst and a hash table.
     75   1.1       cgd  *
     76   1.1       cgd  * Interface:
     77   1.1       cgd  *	Targ_Init 	    	Initialization procedure.
     78   1.1       cgd  *
     79   1.4       jtc  *	Targ_End 	    	Cleanup the module
     80   1.4       jtc  *
     81  1.12  christos  *	Targ_List 	    	Return the list of all targets so far.
     82  1.12  christos  *
     83   1.1       cgd  *	Targ_NewGN	    	Create a new GNode for the passed target
     84   1.1       cgd  *	    	  	    	(string). The node is *not* placed in the
     85   1.1       cgd  *	    	  	    	hash table, though all its fields are
     86   1.1       cgd  *	    	  	    	initialized.
     87   1.1       cgd  *
     88   1.1       cgd  *	Targ_FindNode	    	Find the node for a given target, creating
     89   1.1       cgd  *	    	  	    	and storing it if it doesn't exist and the
     90   1.1       cgd  *	    	  	    	flags are right (TARG_CREATE)
     91   1.1       cgd  *
     92   1.1       cgd  *	Targ_FindList	    	Given a list of names, find nodes for all
     93  1.95    rillig  *	    	  	    	of them, creating them as necessary.
     94   1.1       cgd  *
     95   1.1       cgd  *	Targ_Ignore	    	Return TRUE if errors should be ignored when
     96   1.1       cgd  *	    	  	    	creating the given target.
     97   1.1       cgd  *
     98   1.1       cgd  *	Targ_Silent	    	Return TRUE if we should be silent when
     99   1.1       cgd  *	    	  	    	creating the given target.
    100   1.1       cgd  *
    101   1.1       cgd  *	Targ_Precious	    	Return TRUE if the target is precious and
    102   1.1       cgd  *	    	  	    	should not be removed if we are interrupted.
    103   1.1       cgd  *
    104  1.42       apb  *	Targ_Propagate		Propagate information between related
    105  1.42       apb  *				nodes.	Should be called after the
    106  1.42       apb  *				makefiles are parsed but before any
    107  1.42       apb  *				action is taken.
    108  1.42       apb  *
    109   1.1       cgd  * Debugging:
    110   1.1       cgd  *	Targ_PrintGraph	    	Print out the entire graphm all variables
    111   1.1       cgd  *	    	  	    	and statistics for the directory cache. Should
    112   1.1       cgd  *	    	  	    	print something for suffixes, too, but...
    113   1.1       cgd  */
    114   1.1       cgd 
    115   1.1       cgd #include	  <stdio.h>
    116   1.1       cgd #include	  <time.h>
    117  1.28       wiz 
    118   1.1       cgd #include	  "make.h"
    119   1.3       cgd #include	  "dir.h"
    120   1.1       cgd 
    121  1.88    rillig /*	"@(#)targ.c	8.2 (Berkeley) 3/19/94"	*/
    122  1.96    rillig MAKE_RCSID("$NetBSD: targ.c,v 1.96 2020/09/26 16:18:44 rillig Exp $");
    123  1.88    rillig 
    124  1.89    rillig static GNodeList *allTargets;	/* the list of all targets found so far */
    125  1.18   mycroft #ifdef CLEANUP
    126  1.89    rillig static GNodeList *allGNs;	/* List of all the GNodes */
    127  1.18   mycroft #endif
    128   1.1       cgd static Hash_Table targets;	/* a hash table of same */
    129   1.1       cgd 
    130  1.55       dsl static int TargPrintOnlySrc(void *, void *);
    131  1.18   mycroft #ifdef CLEANUP
    132  1.55       dsl static void TargFreeGN(void *);
    133  1.18   mycroft #endif
    134   1.4       jtc 
    135   1.1       cgd void
    136  1.28       wiz Targ_Init(void)
    137   1.1       cgd {
    138  1.65    rillig     allTargets = Lst_Init();
    139  1.83    rillig     Hash_InitTable(&targets);
    140   1.1       cgd }
    141   1.1       cgd 
    142   1.4       jtc void
    143  1.28       wiz Targ_End(void)
    144   1.4       jtc {
    145  1.64       sjg     Targ_Stats();
    146  1.18   mycroft #ifdef CLEANUP
    147  1.76    rillig     Lst_Free(allTargets);
    148  1.73    rillig     if (allGNs != NULL)
    149  1.76    rillig 	Lst_Destroy(allGNs, TargFreeGN);
    150   1.4       jtc     Hash_DeleteTable(&targets);
    151  1.18   mycroft #endif
    152  1.12  christos }
    153  1.12  christos 
    154  1.64       sjg void
    155  1.64       sjg Targ_Stats(void)
    156  1.64       sjg {
    157  1.64       sjg     Hash_DebugStats(&targets, "targets");
    158  1.64       sjg }
    159  1.64       sjg 
    160  1.77    rillig /* Return the list of all targets. */
    161  1.89    rillig GNodeList *
    162  1.28       wiz Targ_List(void)
    163  1.12  christos {
    164  1.12  christos     return allTargets;
    165   1.4       jtc }
    166   1.4       jtc 
    167  1.77    rillig /* Create and initialize a new graph node. The gnode is added to the list of
    168  1.77    rillig  * all gnodes.
    169   1.1       cgd  *
    170  1.28       wiz  * Input:
    171  1.91    rillig  *	name		the name of the node, such as "clean", "src.c", ".END"
    172   1.1       cgd  */
    173   1.1       cgd GNode *
    174  1.29  christos Targ_NewGN(const char *name)
    175   1.1       cgd {
    176  1.28       wiz     GNode *gn;
    177   1.1       cgd 
    178  1.53     joerg     gn = bmake_malloc(sizeof(GNode));
    179  1.53     joerg     gn->name = bmake_strdup(name);
    180  1.11  christos     gn->uname = NULL;
    181  1.29  christos     gn->path = NULL;
    182  1.77    rillig     gn->type = name[0] == '-' && name[1] == 'l' ? OP_LIB : 0;
    183   1.1       cgd     gn->unmade =    	0;
    184  1.27        pk     gn->unmade_cohorts = 0;
    185  1.45       dsl     gn->cohort_num[0] = 0;
    186  1.27        pk     gn->centurion =    	NULL;
    187   1.1       cgd     gn->made = 	    	UNMADE;
    188  1.16  christos     gn->flags = 	0;
    189  1.56  christos     gn->checked =	0;
    190  1.56  christos     gn->mtime =		0;
    191  1.56  christos     gn->cmgn =		NULL;
    192  1.80    rillig     gn->implicitParents = Lst_Init();
    193  1.65    rillig     gn->cohorts =   	Lst_Init();
    194  1.65    rillig     gn->parents =   	Lst_Init();
    195  1.65    rillig     gn->children =  	Lst_Init();
    196  1.65    rillig     gn->order_pred =  	Lst_Init();
    197  1.65    rillig     gn->order_succ =  	Lst_Init();
    198  1.83    rillig     Hash_InitTable(&gn->context);
    199  1.65    rillig     gn->commands =  	Lst_Init();
    200   1.3       cgd     gn->suffix =	NULL;
    201  1.77    rillig     gn->fname = 	NULL;
    202  1.21  christos     gn->lineno =	0;
    203   1.1       cgd 
    204  1.18   mycroft #ifdef CLEANUP
    205   1.4       jtc     if (allGNs == NULL)
    206  1.65    rillig 	allGNs = Lst_Init();
    207  1.76    rillig     Lst_Append(allGNs, gn);
    208  1.18   mycroft #endif
    209   1.4       jtc 
    210  1.63    rillig     return gn;
    211   1.1       cgd }
    212   1.1       cgd 
    213  1.18   mycroft #ifdef CLEANUP
    214   1.4       jtc static void
    215  1.55       dsl TargFreeGN(void *gnp)
    216   1.4       jtc {
    217  1.37  christos     GNode *gn = (GNode *)gnp;
    218   1.4       jtc 
    219   1.4       jtc     free(gn->name);
    220  1.61  christos     free(gn->uname);
    221  1.61  christos     free(gn->path);
    222   1.4       jtc 
    223  1.80    rillig     Lst_Free(gn->implicitParents);
    224  1.76    rillig     Lst_Free(gn->cohorts);
    225  1.76    rillig     Lst_Free(gn->parents);
    226  1.76    rillig     Lst_Free(gn->children);
    227  1.76    rillig     Lst_Free(gn->order_succ);
    228  1.76    rillig     Lst_Free(gn->order_pred);
    229  1.17   mycroft     Hash_DeleteTable(&gn->context);
    230  1.76    rillig     Lst_Free(gn->commands);
    231  1.77    rillig 
    232  1.77    rillig     /* XXX: does gn->suffix need to be freed? It is reference-counted. */
    233  1.77    rillig     /* gn->fname points to name allocated when file was opened, don't free */
    234  1.77    rillig 
    235  1.36  christos     free(gn);
    236   1.4       jtc }
    237  1.18   mycroft #endif
    238   1.4       jtc 
    239  1.95    rillig /* Get the existing global node, or return NULL. */
    240  1.95    rillig GNode *
    241  1.95    rillig Targ_FindNode(const char *name)
    242  1.95    rillig {
    243  1.96    rillig     return Hash_FindValue(&targets, name);
    244  1.95    rillig }
    245  1.95    rillig 
    246  1.95    rillig /* Get the existing global node, or create it. */
    247  1.95    rillig GNode *
    248  1.95    rillig Targ_GetNode(const char *name)
    249  1.95    rillig {
    250  1.96    rillig 
    251  1.96    rillig     Boolean isNew;
    252  1.96    rillig     Hash_Entry *he = Hash_CreateEntry(&targets, name, &isNew);
    253  1.96    rillig     if (!isNew)
    254  1.96    rillig 	return Hash_GetValue(he);
    255  1.96    rillig 
    256  1.96    rillig     {
    257  1.96    rillig 	GNode *gn = Targ_NewInternalNode(name);
    258  1.96    rillig 	Hash_SetValue(he, gn);
    259  1.96    rillig 	return gn;
    260  1.96    rillig     }
    261  1.95    rillig }
    262  1.95    rillig 
    263  1.95    rillig /* Create a node, register it in .ALLTARGETS but don't store it in the
    264  1.95    rillig  * table of global nodes.  This means it cannot be found by name.
    265  1.95    rillig  *
    266  1.95    rillig  * This is used for internal nodes, such as cohorts or .WAIT nodes. */
    267  1.95    rillig GNode *
    268  1.95    rillig Targ_NewInternalNode(const char *name)
    269  1.95    rillig {
    270  1.96    rillig     GNode *gn = Targ_NewGN(name);
    271  1.96    rillig     Var_Append(".ALLTARGETS", name, VAR_GLOBAL);
    272  1.96    rillig     Lst_Append(allTargets, gn);
    273  1.96    rillig     if (doing_depend)
    274  1.96    rillig 	gn->flags |= FROM_DEPEND;
    275  1.96    rillig     return gn;
    276  1.95    rillig }
    277  1.95    rillig 
    278  1.90    rillig /* Return the .END node, which contains the commands to be executed when
    279  1.90    rillig  * everything else is done. */
    280  1.90    rillig GNode *Targ_GetEndNode(void)
    281  1.90    rillig {
    282  1.90    rillig     /* Save the node locally to avoid having to search for it all the time. */
    283  1.90    rillig     static GNode *endNode = NULL;
    284  1.90    rillig     if (endNode == NULL) {
    285  1.95    rillig 	endNode = Targ_GetNode(".END");
    286  1.90    rillig 	endNode->type = OP_SPECIAL;
    287  1.90    rillig     }
    288  1.90    rillig     return endNode;
    289  1.90    rillig }
    290  1.90    rillig 
    291  1.77    rillig /* Make a complete list of GNodes from the given list of names.
    292  1.77    rillig  * If flags is TARG_CREATE, nodes will be created for all names in
    293  1.77    rillig  * names which do not yet have graph nodes. If flags is TARG_NOCREATE,
    294  1.77    rillig  * an error message will be printed for each name which can't be found.
    295   1.1       cgd  *
    296  1.28       wiz  * Input:
    297  1.28       wiz  *	name		list of names to find
    298  1.28       wiz  *	flags		flags used if no node is found for a given name
    299  1.28       wiz  *
    300   1.1       cgd  * Results:
    301   1.1       cgd  *	A complete list of graph nodes corresponding to all instances of all
    302  1.10  christos  *	the names in names.
    303   1.1       cgd  */
    304  1.89    rillig GNodeList *
    305  1.95    rillig Targ_FindList(StringList *names)
    306   1.1       cgd {
    307  1.89    rillig     GNodeList *nodes;
    308  1.89    rillig     StringListNode *ln;
    309   1.1       cgd 
    310  1.65    rillig     nodes = Lst_Init();
    311   1.1       cgd 
    312  1.76    rillig     Lst_Open(names);
    313  1.76    rillig     while ((ln = Lst_Next(names)) != NULL) {
    314  1.96    rillig 	char *name = LstNode_Datum(ln);
    315  1.96    rillig 	GNode *gn = Targ_GetNode(name);
    316  1.95    rillig 	Lst_Append(nodes, gn);
    317   1.1       cgd     }
    318  1.76    rillig     Lst_Close(names);
    319  1.63    rillig     return nodes;
    320   1.1       cgd }
    321   1.1       cgd 
    322  1.77    rillig /* Return true if should ignore errors when creating gn. */
    323   1.1       cgd Boolean
    324  1.28       wiz Targ_Ignore(GNode *gn)
    325   1.1       cgd {
    326  1.77    rillig     return ignoreErrors || gn->type & OP_IGNORE;
    327   1.1       cgd }
    328   1.1       cgd 
    329  1.77    rillig /* Return true if be silent when creating gn. */
    330   1.1       cgd Boolean
    331  1.28       wiz Targ_Silent(GNode *gn)
    332   1.1       cgd {
    333  1.77    rillig     return beSilent || gn->type & OP_SILENT;
    334   1.1       cgd }
    335   1.1       cgd 
    336  1.77    rillig /* See if the given target is precious. */
    337   1.1       cgd Boolean
    338  1.28       wiz Targ_Precious(GNode *gn)
    339   1.1       cgd {
    340  1.77    rillig     return allPrecious || gn->type & (OP_PRECIOUS | OP_DOUBLEDEP);
    341   1.1       cgd }
    342   1.1       cgd 
    343   1.1       cgd /******************* DEBUG INFO PRINTING ****************/
    344   1.1       cgd 
    345   1.1       cgd static GNode	  *mainTarg;	/* the main target, as set by Targ_SetMain */
    346  1.77    rillig 
    347  1.77    rillig /* Set our idea of the main target we'll be creating. Used for debugging
    348  1.77    rillig  * output. */
    349   1.1       cgd void
    350  1.28       wiz Targ_SetMain(GNode *gn)
    351   1.1       cgd {
    352   1.1       cgd     mainTarg = gn;
    353   1.1       cgd }
    354   1.1       cgd 
    355  1.86    rillig static void
    356  1.89    rillig PrintNodeNames(GNodeList *gnodes)
    357   1.1       cgd {
    358  1.89    rillig     GNodeListNode *node;
    359  1.38       dsl 
    360  1.85    rillig     for (node = Lst_First(gnodes); node != NULL; node = LstNode_Next(node)) {
    361  1.85    rillig 	GNode *gn = LstNode_Datum(node);
    362  1.85    rillig 	fprintf(debug_file, " %s%s", gn->name, gn->cohort_num);
    363  1.85    rillig     }
    364  1.85    rillig }
    365  1.38       dsl 
    366  1.85    rillig static void
    367  1.89    rillig PrintNodeNamesLine(const char *label, GNodeList *gnodes)
    368  1.85    rillig {
    369  1.85    rillig     if (Lst_IsEmpty(gnodes))
    370  1.85    rillig 	return;
    371  1.85    rillig     fprintf(debug_file, "# %s:", label);
    372  1.85    rillig     PrintNodeNames(gnodes);
    373  1.85    rillig     fprintf(debug_file, "\n");
    374   1.1       cgd }
    375   1.1       cgd 
    376  1.84    rillig void
    377  1.84    rillig Targ_PrintCmds(GNode *gn)
    378  1.84    rillig {
    379  1.93    rillig     StringListNode *node = Lst_First(gn->commands);
    380  1.93    rillig     for (; node != NULL; node = LstNode_Next(node)) {
    381  1.93    rillig 	const char *cmd = LstNode_Datum(node);
    382  1.93    rillig 	fprintf(debug_file, "\t%s\n", cmd);
    383  1.93    rillig     }
    384  1.84    rillig }
    385  1.84    rillig 
    386  1.77    rillig /* Format a modification time in some reasonable way and return it.
    387  1.77    rillig  * The time is placed in a static area, so it is overwritten with each call. */
    388   1.1       cgd char *
    389  1.28       wiz Targ_FmtTime(time_t tm)
    390   1.1       cgd {
    391   1.1       cgd     struct tm	  	*parts;
    392  1.15  christos     static char	  	buf[128];
    393   1.1       cgd 
    394  1.25   reinoud     parts = localtime(&tm);
    395  1.15  christos     (void)strftime(buf, sizeof buf, "%k:%M:%S %b %d, %Y", parts);
    396  1.63    rillig     return buf;
    397   1.1       cgd }
    398  1.10  christos 
    399  1.77    rillig /* Print out a type field giving only those attributes the user can set. */
    400   1.1       cgd void
    401  1.52  christos Targ_PrintType(int type)
    402   1.1       cgd {
    403  1.28       wiz     int    tbit;
    404  1.10  christos 
    405  1.82    rillig #define PRINTBIT(attr)	case CONCAT(OP_,attr): fprintf(debug_file, " ." #attr); break
    406  1.82    rillig #define PRINTDBIT(attr) case CONCAT(OP_,attr): if (DEBUG(TARG))fprintf(debug_file, " ." #attr); break
    407   1.1       cgd 
    408   1.1       cgd     type &= ~OP_OPMASK;
    409   1.1       cgd 
    410   1.1       cgd     while (type) {
    411  1.52  christos 	tbit = 1 << (ffs(type) - 1);
    412   1.1       cgd 	type &= ~tbit;
    413   1.1       cgd 
    414   1.1       cgd 	switch(tbit) {
    415  1.96    rillig 	PRINTBIT(OPTIONAL);
    416  1.96    rillig 	PRINTBIT(USE);
    417  1.96    rillig 	PRINTBIT(EXEC);
    418  1.96    rillig 	PRINTBIT(IGNORE);
    419  1.96    rillig 	PRINTBIT(PRECIOUS);
    420  1.96    rillig 	PRINTBIT(SILENT);
    421  1.96    rillig 	PRINTBIT(MAKE);
    422  1.96    rillig 	PRINTBIT(JOIN);
    423  1.96    rillig 	PRINTBIT(INVISIBLE);
    424  1.96    rillig 	PRINTBIT(NOTMAIN);
    425  1.96    rillig 	PRINTDBIT(LIB);
    426   1.1       cgd 	    /*XXX: MEMBER is defined, so CONCAT(OP_,MEMBER) gives OP_"%" */
    427  1.96    rillig 	case OP_MEMBER: if (DEBUG(TARG))fprintf(debug_file, " .MEMBER"); break;
    428  1.96    rillig 	PRINTDBIT(ARCHV);
    429  1.96    rillig 	PRINTDBIT(MADE);
    430  1.96    rillig 	PRINTDBIT(PHONY);
    431   1.1       cgd 	}
    432   1.1       cgd     }
    433   1.1       cgd }
    434   1.1       cgd 
    435  1.45       dsl static const char *
    436  1.71    rillig made_name(GNodeMade made)
    437  1.45       dsl {
    438  1.45       dsl     switch (made) {
    439  1.45       dsl     case UNMADE:     return "unmade";
    440  1.45       dsl     case DEFERRED:   return "deferred";
    441  1.45       dsl     case REQUESTED:  return "requested";
    442  1.45       dsl     case BEINGMADE:  return "being made";
    443  1.45       dsl     case MADE:       return "made";
    444  1.45       dsl     case UPTODATE:   return "up-to-date";
    445  1.45       dsl     case ERROR:      return "error when made";
    446  1.45       dsl     case ABORTED:    return "aborted";
    447  1.45       dsl     default:         return "unknown enum_made value";
    448  1.45       dsl     }
    449  1.45       dsl }
    450  1.45       dsl 
    451  1.87    rillig static int
    452  1.87    rillig PrintNode(void *gnp, void *passp)
    453   1.1       cgd {
    454  1.87    rillig     GNode *gn = gnp;
    455  1.87    rillig     int pass = *(const int *)passp;
    456  1.45       dsl 
    457  1.72    rillig     fprintf(debug_file, "# %s%s", gn->name, gn->cohort_num);
    458  1.72    rillig     GNode_FprintDetails(debug_file, ", ", gn, "\n");
    459  1.45       dsl     if (gn->flags == 0)
    460  1.45       dsl 	return 0;
    461  1.45       dsl 
    462   1.1       cgd     if (!OP_NOP(gn->type)) {
    463  1.43       dsl 	fprintf(debug_file, "#\n");
    464   1.1       cgd 	if (gn == mainTarg) {
    465  1.43       dsl 	    fprintf(debug_file, "# *** MAIN TARGET ***\n");
    466   1.1       cgd 	}
    467  1.45       dsl 	if (pass >= 2) {
    468   1.1       cgd 	    if (gn->unmade) {
    469  1.43       dsl 		fprintf(debug_file, "# %d unmade children\n", gn->unmade);
    470   1.1       cgd 	    } else {
    471  1.43       dsl 		fprintf(debug_file, "# No unmade children\n");
    472   1.1       cgd 	    }
    473  1.22  christos 	    if (! (gn->type & (OP_JOIN|OP_USE|OP_USEBEFORE|OP_EXEC))) {
    474   1.1       cgd 		if (gn->mtime != 0) {
    475  1.43       dsl 		    fprintf(debug_file, "# last modified %s: %s\n",
    476  1.96    rillig 			    Targ_FmtTime(gn->mtime),
    477  1.96    rillig 			    made_name(gn->made));
    478   1.1       cgd 		} else if (gn->made != UNMADE) {
    479  1.43       dsl 		    fprintf(debug_file, "# non-existent (maybe): %s\n",
    480  1.96    rillig 			    made_name(gn->made));
    481   1.1       cgd 		} else {
    482  1.43       dsl 		    fprintf(debug_file, "# unmade\n");
    483   1.1       cgd 		}
    484   1.1       cgd 	    }
    485  1.85    rillig 	    PrintNodeNamesLine("implicit parents", gn->implicitParents);
    486  1.41       dsl 	} else {
    487  1.41       dsl 	    if (gn->unmade)
    488  1.43       dsl 		fprintf(debug_file, "# %d unmade children\n", gn->unmade);
    489   1.1       cgd 	}
    490  1.85    rillig 	PrintNodeNamesLine("parents", gn->parents);
    491  1.85    rillig 	PrintNodeNamesLine("order_pred", gn->order_pred);
    492  1.85    rillig 	PrintNodeNamesLine("order_succ", gn->order_succ);
    493  1.10  christos 
    494  1.43       dsl 	fprintf(debug_file, "%-16s", gn->name);
    495   1.1       cgd 	switch (gn->type & OP_OPMASK) {
    496  1.96    rillig 	case OP_DEPENDS:
    497  1.96    rillig 	    fprintf(debug_file, ":"); break;
    498  1.96    rillig 	case OP_FORCE:
    499  1.96    rillig 	    fprintf(debug_file, "!"); break;
    500  1.96    rillig 	case OP_DOUBLEDEP:
    501  1.96    rillig 	    fprintf(debug_file, "::"); break;
    502   1.1       cgd 	}
    503  1.34  christos 	Targ_PrintType(gn->type);
    504  1.85    rillig 	PrintNodeNames(gn->children);
    505  1.43       dsl 	fprintf(debug_file, "\n");
    506  1.84    rillig 	Targ_PrintCmds(gn);
    507  1.43       dsl 	fprintf(debug_file, "\n\n");
    508  1.20   mycroft 	if (gn->type & OP_DOUBLEDEP) {
    509  1.92    rillig 	    Lst_ForEachUntil(gn->cohorts, PrintNode, passp);
    510   1.1       cgd 	}
    511   1.1       cgd     }
    512  1.63    rillig     return 0;
    513   1.1       cgd }
    514   1.1       cgd 
    515  1.87    rillig /* Print the contents of a node. */
    516  1.87    rillig void
    517  1.87    rillig Targ_PrintNode(GNode *gn, int pass)
    518  1.87    rillig {
    519  1.87    rillig     PrintNode(gn, &pass);
    520  1.87    rillig }
    521  1.87    rillig 
    522  1.87    rillig void
    523  1.89    rillig Targ_PrintNodes(GNodeList *gnodes, int pass)
    524  1.87    rillig {
    525  1.92    rillig     Lst_ForEachUntil(gnodes, PrintNode, &pass);
    526  1.87    rillig }
    527  1.87    rillig 
    528  1.77    rillig /* Print only those targets that are just a source.
    529  1.77    rillig  * The name of each file is printed, preceded by #\t. */
    530   1.1       cgd static int
    531  1.57     joerg TargPrintOnlySrc(void *gnp, void *dummy MAKE_ATTR_UNUSED)
    532   1.4       jtc {
    533  1.37  christos     GNode   	  *gn = (GNode *)gnp;
    534  1.45       dsl     if (!OP_NOP(gn->type))
    535  1.45       dsl 	return 0;
    536   1.4       jtc 
    537  1.82    rillig     fprintf(debug_file, "#\t%s [%s]",
    538  1.45       dsl 	    gn->name, gn->path ? gn->path : gn->name);
    539  1.45       dsl     Targ_PrintType(gn->type);
    540  1.45       dsl     fprintf(debug_file, "\n");
    541  1.45       dsl 
    542  1.45       dsl     return 0;
    543   1.1       cgd }
    544   1.1       cgd 
    545  1.77    rillig /* Input:
    546  1.77    rillig  *	pass		1 => before processing
    547  1.77    rillig  *			2 => after processing
    548  1.77    rillig  *			3 => after processing, an error occurred
    549   1.1       cgd  */
    550   1.3       cgd void
    551  1.28       wiz Targ_PrintGraph(int pass)
    552   1.1       cgd {
    553  1.43       dsl     fprintf(debug_file, "#*** Input graph:\n");
    554  1.92    rillig     Lst_ForEachUntil(allTargets, PrintNode, &pass);
    555  1.43       dsl     fprintf(debug_file, "\n\n");
    556  1.43       dsl     fprintf(debug_file, "#\n#   Files that are only sources:\n");
    557  1.92    rillig     Lst_ForEachUntil(allTargets, TargPrintOnlySrc, NULL);
    558  1.43       dsl     fprintf(debug_file, "#*** Global Variables:\n");
    559  1.34  christos     Var_Dump(VAR_GLOBAL);
    560  1.43       dsl     fprintf(debug_file, "#*** Command-line Variables:\n");
    561  1.34  christos     Var_Dump(VAR_CMD);
    562  1.43       dsl     fprintf(debug_file, "\n");
    563   1.1       cgd     Dir_PrintDirectories();
    564  1.43       dsl     fprintf(debug_file, "\n");
    565   1.1       cgd     Suff_PrintAll();
    566  1.19   mycroft }
    567  1.19   mycroft 
    568  1.78    rillig /* Propagate some type information to cohort nodes (those from the ::
    569  1.78    rillig  * dependency operator).
    570  1.77    rillig  *
    571  1.78    rillig  * Should be called after the makefiles are parsed but before any action is
    572  1.78    rillig  * taken. */
    573  1.78    rillig void
    574  1.78    rillig Targ_Propagate(void)
    575  1.19   mycroft {
    576  1.89    rillig     GNodeListNode *pn, *cn;
    577  1.45       dsl 
    578  1.78    rillig     for (pn = Lst_First(allTargets); pn != NULL; pn = LstNode_Next(pn)) {
    579  1.79    rillig 	GNode *pgn = LstNode_Datum(pn);
    580  1.19   mycroft 
    581  1.78    rillig 	if (!(pgn->type & OP_DOUBLEDEP))
    582  1.78    rillig 	    continue;
    583  1.42       apb 
    584  1.78    rillig 	for (cn = Lst_First(pgn->cohorts); cn != NULL; cn = LstNode_Next(cn)) {
    585  1.79    rillig 	    GNode *cgn = LstNode_Datum(cn);
    586  1.42       apb 
    587  1.78    rillig 	    cgn->type |= pgn->type & ~OP_OPMASK;
    588  1.78    rillig 	}
    589  1.78    rillig     }
    590   1.1       cgd }
    591