Home | History | Annotate | Line # | Download | only in make
make.h revision 1.94
      1 /*	$NetBSD: make.h,v 1.94 2014/08/23 15:05:40 christos Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1988, 1989, 1990, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * This code is derived from software contributed to Berkeley by
      8  * Adam de Boor.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. Neither the name of the University nor the names of its contributors
     19  *    may be used to endorse or promote products derived from this software
     20  *    without specific prior written permission.
     21  *
     22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32  * SUCH DAMAGE.
     33  *
     34  *	from: @(#)make.h	8.3 (Berkeley) 6/13/95
     35  */
     36 
     37 /*
     38  * Copyright (c) 1989 by Berkeley Softworks
     39  * All rights reserved.
     40  *
     41  * This code is derived from software contributed to Berkeley by
     42  * Adam de Boor.
     43  *
     44  * Redistribution and use in source and binary forms, with or without
     45  * modification, are permitted provided that the following conditions
     46  * are met:
     47  * 1. Redistributions of source code must retain the above copyright
     48  *    notice, this list of conditions and the following disclaimer.
     49  * 2. Redistributions in binary form must reproduce the above copyright
     50  *    notice, this list of conditions and the following disclaimer in the
     51  *    documentation and/or other materials provided with the distribution.
     52  * 3. All advertising materials mentioning features or use of this software
     53  *    must display the following acknowledgement:
     54  *	This product includes software developed by the University of
     55  *	California, Berkeley and its contributors.
     56  * 4. Neither the name of the University nor the names of its contributors
     57  *    may be used to endorse or promote products derived from this software
     58  *    without specific prior written permission.
     59  *
     60  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     61  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     62  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     63  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     64  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     65  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     66  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     67  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     68  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     69  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     70  * SUCH DAMAGE.
     71  *
     72  *	from: @(#)make.h	8.3 (Berkeley) 6/13/95
     73  */
     74 
     75 /*-
     76  * make.h --
     77  *	The global definitions for pmake
     78  */
     79 
     80 #ifndef _MAKE_H_
     81 #define _MAKE_H_
     82 
     83 #include <sys/types.h>
     84 #include <sys/param.h>
     85 
     86 #include <ctype.h>
     87 #include <stdio.h>
     88 #include <stdlib.h>
     89 #include <string.h>
     90 #include <unistd.h>
     91 
     92 #ifdef BSD4_4
     93 # include <sys/cdefs.h>
     94 #endif
     95 
     96 #if defined(__GNUC__)
     97 #define	MAKE_GNUC_PREREQ(x, y)						\
     98 	((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) ||			\
     99 	 (__GNUC__ > (x)))
    100 #else /* defined(__GNUC__) */
    101 #define	MAKE_GNUC_PREREQ(x, y)	0
    102 #endif /* defined(__GNUC__) */
    103 
    104 #if MAKE_GNUC_PREREQ(2, 7)
    105 #define	MAKE_ATTR_UNUSED	__attribute__((__unused__))
    106 #else
    107 #define	MAKE_ATTR_UNUSED	/* delete */
    108 #endif
    109 
    110 #if MAKE_GNUC_PREREQ(2, 5)
    111 #define	MAKE_ATTR_DEAD		__attribute__((__noreturn__))
    112 #elif defined(__GNUC__)
    113 #define	MAKE_ATTR_DEAD		__volatile
    114 #else
    115 #define	MAKE_ATTR_DEAD		/* delete */
    116 #endif
    117 
    118 #if MAKE_GNUC_PREREQ(2, 7)
    119 #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg)	\
    120 	    __attribute__((__format__ (__printf__, fmtarg, firstvararg)))
    121 #else
    122 #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg)	/* delete */
    123 #endif
    124 
    125 #include "sprite.h"
    126 #include "lst.h"
    127 #include "hash.h"
    128 #include "config.h"
    129 #include "buf.h"
    130 #include "make_malloc.h"
    131 
    132 /*-
    133  * The structure for an individual graph node. Each node has several
    134  * pieces of data associated with it.
    135  *	1) the name of the target it describes
    136  *	2) the location of the target file in the file system.
    137  *	3) the type of operator used to define its sources (qv. parse.c)
    138  *	4) whether it is involved in this invocation of make
    139  *	5) whether the target has been remade
    140  *	6) whether any of its children has been remade
    141  *	7) the number of its children that are, as yet, unmade
    142  *	8) its modification time
    143  *	9) the modification time of its youngest child (qv. make.c)
    144  *	10) a list of nodes for which this is a source (parents)
    145  *	11) a list of nodes on which this depends (children)
    146  *	12) a list of nodes that depend on this, as gleaned from the
    147  *	    transformation rules (iParents)
    148  *	13) a list of ancestor nodes, which includes parents, iParents,
    149  *	    and recursive parents of parents
    150  *	14) a list of nodes of the same name created by the :: operator
    151  *	15) a list of nodes that must be made (if they're made) before
    152  *	    this node can be, but that do not enter into the datedness of
    153  *	    this node.
    154  *	16) a list of nodes that must be made (if they're made) before
    155  *	    this node or any child of this node can be, but that do not
    156  *	    enter into the datedness of this node.
    157  *	17) a list of nodes that must be made (if they're made) after
    158  *	    this node is, but that do not depend on this node, in the
    159  *	    normal sense.
    160  *	18) a Lst of ``local'' variables that are specific to this target
    161  *	   and this target only (qv. var.c [$@ $< $?, etc.])
    162  *	19) a Lst of strings that are commands to be given to a shell
    163  *	   to create this target.
    164  */
    165 typedef struct GNode {
    166     char            *name;     	/* The target's name */
    167     char            *uname;    	/* The unexpanded name of a .USE node */
    168     char    	    *path;     	/* The full pathname of the file */
    169     int             type;      	/* Its type (see the OP flags, below) */
    170     int		    gType;	/* Bits in type set by special targets (global)
    171 				 * instead of special sources (local).
    172 				 * These are preserved if the target is
    173 				 * redefined.
    174 				 */
    175     int             flags;
    176 #define REMAKE		0x1    	/* this target needs to be (re)made */
    177 #define	CHILDMADE	0x2	/* children of this target were made */
    178 #define FORCE		0x4	/* children don't exist, and we pretend made */
    179 #define DONE_WAIT	0x8	/* Set by Make_ProcessWait() */
    180 #define DONE_ORDER	0x10	/* Build requested by .ORDER processing */
    181 #define FROM_DEPEND	0x20	/* Node created from .depend */
    182 #define DONE_ALLSRC	0x40	/* We do it once only */
    183 #define CYCLE		0x1000  /* Used by MakePrintStatus */
    184 #define DONECYCLE	0x2000  /* Used by MakePrintStatus */
    185     enum enum_made {
    186 	UNMADE, DEFERRED, REQUESTED, BEINGMADE,
    187 	MADE, UPTODATE, ERROR, ABORTED
    188     }	    	    made;    	/* Set to reflect the state of processing
    189 				 * on this node:
    190 				 *  UNMADE - Not examined yet
    191 				 *  DEFERRED - Examined once (building child)
    192 				 *  REQUESTED - on toBeMade list
    193 				 *  BEINGMADE - Target is already being made.
    194 				 *  	Indicates a cycle in the graph.
    195 				 *  MADE - Was out-of-date and has been made
    196 				 *  UPTODATE - Was already up-to-date
    197 				 *  ERROR - An error occurred while it was being
    198 				 *  	made (used only in compat mode)
    199 				 *  ABORTED - The target was aborted due to
    200 				 *  	an error making an inferior (compat).
    201 				 */
    202     int             unmade;    	/* The number of unmade children */
    203 
    204     time_t          mtime;     	/* Its modification time */
    205     struct GNode    *cmgn;    	/* The youngest child */
    206 
    207     Lst     	    iParents;  	/* Links to parents for which this is an
    208 				 * implied source, if any */
    209     Lst	    	    cohorts;  	/* Other nodes for the :: operator */
    210     Lst             parents;   	/* Nodes that depend on this one */
    211     Lst             children;  	/* Nodes on which this one depends */
    212 
    213     /*
    214      * Support for clearing dependencies from an overridden rule.
    215      * Items in children from first_local_child to last_local_child
    216      * (inclusive) were added by a rule with commands.  We must store
    217      * the position instead of the value as the value might be in the list
    218      * multiple times.  It is this fact which allows us to clear the locally
    219      * defined dependencies in the first place, as the extras are still
    220      * left in the list.
    221      *
    222      * We can differentiate between extra dependency rules and full
    223      * rules only when the first command line is read and the new
    224      * dependencies are already added.  Because we need to store
    225      * the position, not the value, the future values for these fields
    226      * must be tracked individually for each node, not globally by the Parse
    227      * module like the type bits can be.  The _tmp fields are used for this
    228      * purpose.  They are cleared for each target on a dependency line when
    229      * the dependency operator is found and updated when new sources are
    230      * added.  If a command section follows, the values are copied to
    231      * the actual fields.
    232      */
    233     LstNode	    first_local_child;
    234     LstNode	    first_local_child_tmp;
    235     LstNode	    last_local_child;
    236     LstNode	    last_local_child_tmp;
    237 
    238     Lst             order_pred;	/* .ORDER nodes we need made */
    239     Lst             order_succ;	/* .ORDER nodes who need us */
    240 
    241     char	    cohort_num[8]; /* #n for this cohort */
    242     int		    unmade_cohorts;/* # of unmade instances on the
    243 				      cohorts list */
    244     struct GNode    *centurion;	/* Pointer to the first instance of a ::
    245 				   node; only set when on a cohorts list */
    246     unsigned int    checked;    /* Last time we tried to makle this node */
    247 
    248     Hash_Table      context;	/* The local variables */
    249     Lst             commands;  	/* Creation commands */
    250 
    251     struct _Suff    *suffix;	/* Suffix for the node (determined by
    252 				 * Suff_FindDeps and opaque to everyone
    253 				 * but the Suff module) */
    254     const char	    *fname;	/* filename where the GNode got defined */
    255     int		     lineno;	/* line number where the GNode got defined */
    256 } GNode;
    257 
    258 /*
    259  * The OP_ constants are used when parsing a dependency line as a way of
    260  * communicating to other parts of the program the way in which a target
    261  * should be made. These constants are bitwise-OR'ed together and
    262  * placed in the 'type' field of each node. Any node that has
    263  * a 'type' field which satisfies the OP_NOP function was never never on
    264  * the lefthand side of an operator, though it may have been on the
    265  * righthand side...
    266  */
    267 #define OP_DEPENDS	0x00000001  /* Execution of commands depends on
    268 				     * kids (:) */
    269 #define OP_FORCE	0x00000002  /* Always execute commands (!) */
    270 #define OP_DOUBLEDEP	0x00000004  /* Execution of commands depends on kids
    271 				     * per line (::) */
    272 #define OP_OPMASK	(OP_DEPENDS|OP_FORCE|OP_DOUBLEDEP)
    273 
    274 #define OP_OPTIONAL	0x00000008  /* Don't care if the target doesn't
    275 				     * exist and can't be created */
    276 #define OP_USE		0x00000010  /* Use associated commands for parents */
    277 #define OP_EXEC	  	0x00000020  /* Target is never out of date, but always
    278 				     * execute commands anyway. Its time
    279 				     * doesn't matter, so it has none...sort
    280 				     * of */
    281 #define OP_IGNORE	0x00000040  /* Ignore errors when creating the node */
    282 #define OP_PRECIOUS	0x00000080  /* Don't remove the target when
    283 				     * interrupted */
    284 #define OP_SILENT	0x00000100  /* Don't echo commands when executed */
    285 #define OP_MAKE		0x00000200  /* Target is a recursive make so its
    286 				     * commands should always be executed when
    287 				     * it is out of date, regardless of the
    288 				     * state of the -n or -t flags */
    289 #define OP_JOIN 	0x00000400  /* Target is out-of-date only if any of its
    290 				     * children was out-of-date */
    291 #define	OP_MADE		0x00000800  /* Assume the children of the node have
    292 				     * been already made */
    293 #define OP_SPECIAL	0x00001000  /* Special .BEGIN, .END, .INTERRUPT */
    294 #define	OP_USEBEFORE	0x00002000  /* Like .USE, only prepend commands */
    295 #define OP_INVISIBLE	0x00004000  /* The node is invisible to its parents.
    296 				     * I.e. it doesn't show up in the parents's
    297 				     * local variables. */
    298 #define OP_NOTMAIN	0x00008000  /* The node is exempt from normal 'main
    299 				     * target' processing in parse.c */
    300 #define OP_PHONY	0x00010000  /* Not a file target; run always */
    301 #define OP_NOPATH	0x00020000  /* Don't search for file in the path */
    302 #define OP_WAIT 	0x00040000  /* .WAIT phony node */
    303 #define OP_NOMETA	0x00080000  /* .NOMETA do not create a .meta file */
    304 #define OP_META		0x00100000  /* .META we _do_ want a .meta file */
    305 #define OP_NOMETA_CMP	0x00200000  /* Do not compare commands in .meta file */
    306 #define OP_SUBMAKE	0x00400000  /* Possibly a submake node */
    307 /* Attributes applied by PMake */
    308 #define OP_FROM_SYS_MK  0x00800000  /* The node was defined in sys.mk */
    309 #define OP_TRANSFORM	0x80000000  /* The node is a transformation rule */
    310 #define OP_MEMBER 	0x40000000  /* Target is a member of an archive */
    311 #define OP_LIB	  	0x20000000  /* Target is a library */
    312 #define OP_ARCHV  	0x10000000  /* Target is an archive construct */
    313 #define OP_HAS_COMMANDS	0x08000000  /* Target has all the commands it should.
    314 				     * Used when parsing to catch multiple
    315 				     * commands for a target */
    316 #define OP_SAVE_CMDS	0x04000000  /* Saving commands on .END (Compat) */
    317 #define OP_DEPS_FOUND	0x02000000  /* Already processed by Suff_FindDeps */
    318 #define	OP_MARK		0x01000000  /* Node found while expanding .ALLSRC */
    319 
    320 #define NoExecute(gn) ((gn->type & OP_MAKE) ? noRecursiveExecute : noExecute)
    321 /*
    322  * OP_NOP will return TRUE if the node with the given type was not the
    323  * object of a dependency operator
    324  */
    325 #define OP_NOP(t)	(((t) & OP_OPMASK) == 0x00000000)
    326 
    327 #define OP_NOTARGET (OP_NOTMAIN|OP_USE|OP_EXEC|OP_TRANSFORM|OP_FROM_SYS_MK)
    328 
    329 /* All OP_* bits set by special sources or targets. */
    330 #define OP_ATTRIBUTE_MASK \
    331   ( OP_OPTIONAL  | OP_USE  | OP_EXEC   | OP_IGNORE  | OP_PRECIOUS |   \
    332     OP_SILENT    | OP_MAKE | OP_JOIN   | OP_MADE    | OP_SPECIAL |    \
    333     OP_USEBEFORE | OP_INVISIBLE        | OP_NOTMAIN | OP_PHONY |      \
    334     OP_NOPATH    | OP_WAIT | OP_NOMETA | OP_META    | OP_NOMETA_CMP )
    335 /*
    336  * The TARG_ constants are used when calling the Targ_FindNode and
    337  * Targ_FindList functions in targ.c. They simply tell the functions what to
    338  * do if the desired node(s) is (are) not found. If the TARG_CREATE constant
    339  * is given, a new, empty node will be created for the target, placed in the
    340  * table of all targets and its address returned. If TARG_NOCREATE is given,
    341  * a NULL pointer will be returned.
    342  */
    343 #define TARG_NOCREATE	0x00	  /* don't create it */
    344 #define TARG_CREATE	0x01	  /* create node if not found */
    345 #define TARG_NOHASH	0x02	  /* don't look in/add to hash table */
    346 
    347 /*
    348  * These constants are all used by the Str_Concat function to decide how the
    349  * final string should look. If STR_ADDSPACE is given, a space will be
    350  * placed between the two strings. If STR_ADDSLASH is given, a '/' will
    351  * be used instead of a space. If neither is given, no intervening characters
    352  * will be placed between the two strings in the final output. If the
    353  * STR_DOFREE bit is set, the two input strings will be freed before
    354  * Str_Concat returns.
    355  */
    356 #define STR_ADDSPACE	0x01	/* add a space when Str_Concat'ing */
    357 #define STR_ADDSLASH	0x02	/* add a slash when Str_Concat'ing */
    358 
    359 /*
    360  * Error levels for parsing. PARSE_FATAL means the process cannot continue
    361  * once the makefile has been parsed. PARSE_WARNING means it can. Passed
    362  * as the first argument to Parse_Error.
    363  */
    364 #define PARSE_WARNING	2
    365 #define PARSE_FATAL	1
    366 
    367 /*
    368  * Values returned by Cond_Eval.
    369  */
    370 #define COND_PARSE	0   	/* Parse the next lines */
    371 #define COND_SKIP 	1   	/* Skip the next lines */
    372 #define COND_INVALID	2   	/* Not a conditional statement */
    373 
    374 /*
    375  * Definitions for the "local" variables. Used only for clarity.
    376  */
    377 #define TARGET	  	  "@" 	/* Target of dependency */
    378 #define OODATE	  	  "?" 	/* All out-of-date sources */
    379 #define ALLSRC	  	  ">" 	/* All sources */
    380 #define IMPSRC	  	  "<" 	/* Source implied by transformation */
    381 #define PREFIX	  	  "*" 	/* Common prefix */
    382 #define ARCHIVE	  	  "!" 	/* Archive in "archive(member)" syntax */
    383 #define MEMBER	  	  "%" 	/* Member in "archive(member)" syntax */
    384 
    385 #define FTARGET           "@F"  /* file part of TARGET */
    386 #define DTARGET           "@D"  /* directory part of TARGET */
    387 #define FIMPSRC           "<F"  /* file part of IMPSRC */
    388 #define DIMPSRC           "<D"  /* directory part of IMPSRC */
    389 #define FPREFIX           "*F"  /* file part of PREFIX */
    390 #define DPREFIX           "*D"  /* directory part of PREFIX */
    391 
    392 /*
    393  * Global Variables
    394  */
    395 extern Lst  	create;	    	/* The list of target names specified on the
    396 				 * command line. used to resolve #if
    397 				 * make(...) statements */
    398 extern Lst     	dirSearchPath; 	/* The list of directories to search when
    399 				 * looking for targets */
    400 
    401 extern Boolean	compatMake;	/* True if we are make compatible */
    402 extern Boolean	ignoreErrors;  	/* True if should ignore all errors */
    403 extern Boolean  beSilent;    	/* True if should print no commands */
    404 extern Boolean  noExecute;    	/* True if should execute nothing */
    405 extern Boolean  noRecursiveExecute;    	/* True if should execute nothing */
    406 extern Boolean  allPrecious;   	/* True if every target is precious */
    407 extern Boolean  keepgoing;    	/* True if should continue on unaffected
    408 				 * portions of the graph when have an error
    409 				 * in one portion */
    410 extern Boolean 	touchFlag;    	/* TRUE if targets should just be 'touched'
    411 				 * if out of date. Set by the -t flag */
    412 extern Boolean 	queryFlag;    	/* TRUE if we aren't supposed to really make
    413 				 * anything, just see if the targets are out-
    414 				 * of-date */
    415 extern Boolean	doing_depend;	/* TRUE if processing .depend */
    416 
    417 extern Boolean	checkEnvFirst;	/* TRUE if environment should be searched for
    418 				 * variables before the global context */
    419 extern Boolean	jobServer;	/* a jobServer already exists */
    420 
    421 extern Boolean	parseWarnFatal;	/* TRUE if makefile parsing warnings are
    422 				 * treated as errors */
    423 
    424 extern Boolean	varNoExportEnv;	/* TRUE if we should not export variables
    425 				 * set on the command line to the env. */
    426 
    427 extern GNode    *DEFAULT;    	/* .DEFAULT rule */
    428 
    429 extern GNode	*VAR_INTERNAL;	/* Variables defined internally by make
    430 				 * which should not override those set by
    431 				 * makefiles.
    432 				 */
    433 extern GNode    *VAR_GLOBAL;   	/* Variables defined in a global context, e.g
    434 				 * in the Makefile itself */
    435 extern GNode    *VAR_CMD;    	/* Variables defined on the command line */
    436 extern GNode	*VAR_FOR;	/* Iteration variables */
    437 extern char    	var_Error[];   	/* Value returned by Var_Parse when an error
    438 				 * is encountered. It actually points to
    439 				 * an empty string, so naive callers needn't
    440 				 * worry about it. */
    441 
    442 extern time_t 	now;	    	/* The time at the start of this whole
    443 				 * process */
    444 
    445 extern Boolean	oldVars;    	/* Do old-style variable substitution */
    446 
    447 extern Lst	sysIncPath;	/* The system include path. */
    448 extern Lst	defIncPath;	/* The default include path. */
    449 
    450 extern char	curdir[];	/* Startup directory */
    451 extern char	*progname;	/* The program name */
    452 extern char	*makeDependfile; /* .depend */
    453 extern char	**savedEnv;	 /* if we replaced environ this will be non-NULL */
    454 
    455 /*
    456  * We cannot vfork() in a child of vfork().
    457  * Most systems do not enforce this but some do.
    458  */
    459 #define vFork() ((getpid() == myPid) ? vfork() : fork())
    460 extern pid_t	myPid;
    461 
    462 #define	MAKEFLAGS	".MAKEFLAGS"
    463 #define	MAKEOVERRIDES	".MAKEOVERRIDES"
    464 #define	MAKE_JOB_PREFIX	".MAKE.JOB.PREFIX" /* prefix for job target output */
    465 #define	MAKE_EXPORTED	".MAKE.EXPORTED"   /* variables we export */
    466 #define	MAKE_MAKEFILES	".MAKE.MAKEFILES"  /* all the makefiles we read */
    467 #define	MAKE_LEVEL	".MAKE.LEVEL"	   /* recursion level */
    468 #define MAKEFILE_PREFERENCE ".MAKE.MAKEFILE_PREFERENCE"
    469 #define MAKE_DEPENDFILE	".MAKE.DEPENDFILE" /* .depend */
    470 #define MAKE_MODE	".MAKE.MODE"
    471 #ifndef MAKE_LEVEL_ENV
    472 # define MAKE_LEVEL_ENV	"MAKELEVEL"
    473 #endif
    474 
    475 /*
    476  * debug control:
    477  *	There is one bit per module.  It is up to the module what debug
    478  *	information to print.
    479  */
    480 FILE *debug_file;		/* Output written here - default stdout */
    481 extern int debug;
    482 #define	DEBUG_ARCH	0x00001
    483 #define	DEBUG_COND	0x00002
    484 #define	DEBUG_DIR	0x00004
    485 #define	DEBUG_GRAPH1	0x00008
    486 #define	DEBUG_GRAPH2	0x00010
    487 #define	DEBUG_JOB	0x00020
    488 #define	DEBUG_MAKE	0x00040
    489 #define	DEBUG_SUFF	0x00080
    490 #define	DEBUG_TARG	0x00100
    491 #define	DEBUG_VAR	0x00200
    492 #define DEBUG_FOR	0x00400
    493 #define DEBUG_SHELL	0x00800
    494 #define DEBUG_ERROR	0x01000
    495 #define DEBUG_LOUD	0x02000
    496 #define DEBUG_META	0x04000
    497 
    498 #define DEBUG_GRAPH3	0x10000
    499 #define DEBUG_SCRIPT	0x20000
    500 #define DEBUG_PARSE	0x40000
    501 #define DEBUG_CWD	0x80000
    502 
    503 #define CONCAT(a,b)	a##b
    504 
    505 #define	DEBUG(module)	(debug & CONCAT(DEBUG_,module))
    506 
    507 #include "nonints.h"
    508 
    509 int Make_TimeStamp(GNode *, GNode *);
    510 Boolean Make_OODate(GNode *);
    511 void Make_ExpandUse(Lst);
    512 time_t Make_Recheck(GNode *);
    513 void Make_HandleUse(GNode *, GNode *);
    514 void Make_SetImpsrcLocalVar(GNode *, GNode *);
    515 void Make_Update(GNode *);
    516 void Make_DoAllVar(GNode *);
    517 Boolean Make_Run(Lst);
    518 char * Check_Cwd_Cmd(const char *);
    519 void Check_Cwd(const char **);
    520 void PrintOnError(GNode *, const char *);
    521 void Main_ExportMAKEFLAGS(Boolean);
    522 Boolean Main_SetObjdir(const char *);
    523 int mkTempFile(const char *, char **);
    524 int str2Lst_Append(Lst, char *, const char *);
    525 
    526 #ifdef __GNUC__
    527 #define UNCONST(ptr)	({ 		\
    528     union __unconst {			\
    529 	const void *__cp;		\
    530 	void *__p;			\
    531     } __d;				\
    532     __d.__cp = ptr, __d.__p; })
    533 #else
    534 #define UNCONST(ptr)	(void *)(ptr)
    535 #endif
    536 
    537 #ifndef MIN
    538 #define MIN(a, b) ((a < b) ? a : b)
    539 #endif
    540 #ifndef MAX
    541 #define MAX(a, b) ((a > b) ? a : b)
    542 #endif
    543 
    544 #endif /* _MAKE_H_ */
    545