Home | History | Annotate | Line # | Download | only in make
make.h revision 1.64.2.1
      1  1.64.2.1    bouyer /*	$NetBSD: make.h,v 1.64.2.1 2006/12/20 22:42:11 bouyer Exp $	*/
      2       1.6  christos 
      3       1.1       cgd /*
      4       1.6  christos  * Copyright (c) 1988, 1989, 1990, 1993
      5       1.6  christos  *	The Regents of the University of California.  All rights reserved.
      6      1.47       agc  *
      7      1.47       agc  * This code is derived from software contributed to Berkeley by
      8      1.47       agc  * Adam de Boor.
      9      1.47       agc  *
     10      1.47       agc  * Redistribution and use in source and binary forms, with or without
     11      1.47       agc  * modification, are permitted provided that the following conditions
     12      1.47       agc  * are met:
     13      1.47       agc  * 1. Redistributions of source code must retain the above copyright
     14      1.47       agc  *    notice, this list of conditions and the following disclaimer.
     15      1.47       agc  * 2. Redistributions in binary form must reproduce the above copyright
     16      1.47       agc  *    notice, this list of conditions and the following disclaimer in the
     17      1.47       agc  *    documentation and/or other materials provided with the distribution.
     18      1.47       agc  * 3. Neither the name of the University nor the names of its contributors
     19      1.47       agc  *    may be used to endorse or promote products derived from this software
     20      1.47       agc  *    without specific prior written permission.
     21      1.47       agc  *
     22      1.47       agc  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23      1.47       agc  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24      1.47       agc  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25      1.47       agc  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26      1.47       agc  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27      1.47       agc  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28      1.47       agc  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29      1.47       agc  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30      1.47       agc  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31      1.47       agc  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32      1.47       agc  * SUCH DAMAGE.
     33      1.47       agc  *
     34      1.47       agc  *	from: @(#)make.h	8.3 (Berkeley) 6/13/95
     35      1.47       agc  */
     36      1.47       agc 
     37      1.47       agc /*
     38       1.1       cgd  * Copyright (c) 1989 by Berkeley Softworks
     39       1.1       cgd  * All rights reserved.
     40       1.1       cgd  *
     41       1.1       cgd  * This code is derived from software contributed to Berkeley by
     42       1.1       cgd  * Adam de Boor.
     43       1.1       cgd  *
     44       1.1       cgd  * Redistribution and use in source and binary forms, with or without
     45       1.1       cgd  * modification, are permitted provided that the following conditions
     46       1.1       cgd  * are met:
     47       1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     48       1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     49       1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     50       1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     51       1.1       cgd  *    documentation and/or other materials provided with the distribution.
     52       1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     53       1.1       cgd  *    must display the following acknowledgement:
     54       1.1       cgd  *	This product includes software developed by the University of
     55       1.1       cgd  *	California, Berkeley and its contributors.
     56       1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     57       1.1       cgd  *    may be used to endorse or promote products derived from this software
     58       1.1       cgd  *    without specific prior written permission.
     59       1.1       cgd  *
     60       1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     61       1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     62       1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     63       1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     64       1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     65       1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     66       1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     67       1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     68       1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     69       1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     70       1.1       cgd  * SUCH DAMAGE.
     71       1.1       cgd  *
     72      1.11  christos  *	from: @(#)make.h	8.3 (Berkeley) 6/13/95
     73       1.1       cgd  */
     74       1.1       cgd 
     75       1.1       cgd /*-
     76       1.1       cgd  * make.h --
     77       1.1       cgd  *	The global definitions for pmake
     78       1.1       cgd  */
     79       1.1       cgd 
     80       1.1       cgd #ifndef _MAKE_H_
     81       1.1       cgd #define _MAKE_H_
     82       1.1       cgd 
     83       1.1       cgd #include <sys/types.h>
     84      1.13  christos #include <sys/param.h>
     85      1.44       wiz 
     86      1.44       wiz #include <ctype.h>
     87       1.3       cgd #include <stdio.h>
     88      1.44       wiz #include <stdlib.h>
     89       1.1       cgd #include <string.h>
     90      1.44       wiz #include <unistd.h>
     91      1.12  christos 
     92      1.19        tv #ifdef BSD4_4
     93      1.12  christos # include <sys/cdefs.h>
     94       1.4     glass #endif
     95      1.12  christos 
     96      1.52      yamt #if !defined(__GNUC_PREREQ__)
     97      1.52      yamt #if defined(__GNUC__)
     98      1.52      yamt #define	__GNUC_PREREQ__(x, y)						\
     99      1.52      yamt 	((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) ||			\
    100      1.52      yamt 	 (__GNUC__ > (x)))
    101      1.52      yamt #else /* defined(__GNUC__) */
    102      1.52      yamt #define	__GNUC_PREREQ__(x, y)	0
    103      1.52      yamt #endif /* defined(__GNUC__) */
    104      1.52      yamt #endif /* !defined(__GNUC_PREREQ__) */
    105      1.52      yamt 
    106      1.51       jmc #if !defined(__unused)
    107      1.51       jmc #if __GNUC_PREREQ__(2, 7)
    108      1.51       jmc #define __unused        __attribute__((__unused__))
    109      1.51       jmc #else
    110      1.51       jmc #define __unused        /* delete */
    111      1.51       jmc #endif
    112      1.51       jmc #endif
    113      1.44       wiz 
    114       1.1       cgd #include "sprite.h"
    115       1.1       cgd #include "lst.h"
    116      1.22   mycroft #include "hash.h"
    117       1.1       cgd #include "config.h"
    118       1.3       cgd #include "buf.h"
    119       1.1       cgd 
    120       1.1       cgd /*-
    121       1.1       cgd  * The structure for an individual graph node. Each node has several
    122       1.1       cgd  * pieces of data associated with it.
    123       1.1       cgd  *	1) the name of the target it describes
    124       1.1       cgd  *	2) the location of the target file in the file system.
    125       1.1       cgd  *	3) the type of operator used to define its sources (qv. parse.c)
    126       1.1       cgd  *	4) whether it is involved in this invocation of make
    127       1.1       cgd  *	5) whether the target has been remade
    128       1.1       cgd  *	6) whether any of its children has been remade
    129       1.1       cgd  *	7) the number of its children that are, as yet, unmade
    130       1.1       cgd  *	8) its modification time
    131       1.1       cgd  *	9) the modification time of its youngest child (qv. make.c)
    132      1.58       apb  *	10) a list of nodes for which this is a source (parents)
    133      1.58       apb  *	11) a list of nodes on which this depends (children)
    134       1.1       cgd  *	12) a list of nodes that depend on this, as gleaned from the
    135      1.58       apb  *	    transformation rules (iParents)
    136      1.58       apb  *	13) a list of ancestor nodes, which includes parents, iParents,
    137      1.58       apb  *	    and recursive parents of parents
    138      1.58       apb  *	14) a list of nodes of the same name created by the :: operator
    139      1.58       apb  *	15) a list of nodes that must be made (if they're made) before
    140      1.58       apb  *	    this node can be, but that do not enter into the datedness of
    141       1.1       cgd  *	    this node.
    142      1.58       apb  *	16) a list of nodes that must be made (if they're made) before
    143      1.58       apb  *	    this node or any child of this node can be, but that do not
    144      1.58       apb  *	    enter into the datedness of this node.
    145      1.58       apb  *	17) a list of nodes that must be made (if they're made) after
    146       1.1       cgd  *	    this node is, but that do not depend on this node, in the
    147       1.1       cgd  *	    normal sense.
    148      1.58       apb  *	18) a Lst of ``local'' variables that are specific to this target
    149       1.1       cgd  *	   and this target only (qv. var.c [$@ $< $?, etc.])
    150      1.58       apb  *	19) a Lst of strings that are commands to be given to a shell
    151      1.11  christos  *	   to create this target.
    152       1.1       cgd  */
    153       1.1       cgd typedef struct GNode {
    154       1.1       cgd     char            *name;     	/* The target's name */
    155      1.14  christos     char            *uname;    	/* The unexpanded name of a .USE node */
    156       1.1       cgd     char    	    *path;     	/* The full pathname of the file */
    157       1.1       cgd     int             type;      	/* Its type (see the OP flags, below) */
    158       1.1       cgd 
    159      1.21  christos     int             flags;
    160      1.64       dsl #define REMAKE		0x1    	/* this target needs to be (re)made */
    161      1.21  christos #define	CHILDMADE	0x2	/* children of this target were made */
    162      1.21  christos #define FORCE		0x4	/* children don't exist, and we pretend made */
    163      1.64       dsl #define DONE_WAIT	0x8	/* Set by Make_ProcessWait() */
    164      1.64       dsl #define DONE_ORDER	0x10	/* Build requested by .ORDER processing */
    165      1.64       dsl #define CYCLE		0x1000  /* Used by MakePrintStatus */
    166      1.64       dsl #define ENDCYCLE	0x2000  /* Used by MakePrintStatus */
    167      1.64       dsl #define ONCYCLE		0x4000  /* Used by MakePrintStatus */
    168      1.64       dsl #define DONECYCLE	0x8000  /* Used by MakePrintStatus */
    169      1.64       dsl     enum enum_made {
    170      1.64       dsl 	UNMADE, DEFERRED, REQUESTED, BEINGMADE,
    171      1.64       dsl 	MADE, UPTODATE, ERROR, ABORTED
    172       1.1       cgd     }	    	    made;    	/* Set to reflect the state of processing
    173       1.1       cgd 				 * on this node:
    174       1.1       cgd 				 *  UNMADE - Not examined yet
    175      1.64       dsl 				 *  DEFERRED - Examined once (building child)
    176      1.64       dsl 				 *  REQUESTED - on toBeMade list
    177       1.1       cgd 				 *  BEINGMADE - Target is already being made.
    178      1.64       dsl 				 *  	Indicates a cycle in the graph.
    179       1.1       cgd 				 *  MADE - Was out-of-date and has been made
    180       1.1       cgd 				 *  UPTODATE - Was already up-to-date
    181      1.37       wiz 				 *  ERROR - An error occurred while it was being
    182       1.1       cgd 				 *  	made (used only in compat mode)
    183       1.1       cgd 				 *  ABORTED - The target was aborted due to
    184       1.1       cgd 				 *  	an error making an inferior (compat).
    185       1.1       cgd 				 */
    186       1.1       cgd     int             unmade;    	/* The number of unmade children */
    187       1.1       cgd 
    188      1.18      fair     time_t          mtime;     	/* Its modification time */
    189      1.18      fair     time_t     	    cmtime;    	/* The modification time of its youngest
    190       1.1       cgd 				 * child */
    191       1.1       cgd 
    192       1.1       cgd     Lst     	    iParents;  	/* Links to parents for which this is an
    193       1.1       cgd 				 * implied source, if any */
    194       1.1       cgd     Lst	    	    cohorts;  	/* Other nodes for the :: operator */
    195       1.1       cgd     Lst             parents;   	/* Nodes that depend on this one */
    196       1.1       cgd     Lst             children;  	/* Nodes on which this one depends */
    197      1.64       dsl     Lst             order_pred;	/* .ORDER nodes we need made */
    198      1.64       dsl     Lst             order_succ;	/* .ORDER nodes who need us */
    199      1.64       dsl 
    200      1.64       dsl     char	    cohort_num[8]; /* #n for this cohort */
    201      1.43        pk     int		    unmade_cohorts;/* # of unmade instances on the
    202      1.43        pk 				      cohorts list */
    203      1.43        pk     struct GNode    *centurion;	/* Pointer to the first instance of a ::
    204      1.43        pk 				   node; only set when on a cohorts list */
    205       1.1       cgd 
    206      1.22   mycroft     Hash_Table      context;	/* The local variables */
    207       1.1       cgd     Lst             commands;  	/* Creation commands */
    208       1.1       cgd 
    209       1.1       cgd     struct _Suff    *suffix;	/* Suffix for the node (determined by
    210       1.1       cgd 				 * Suff_FindDeps and opaque to everyone
    211       1.1       cgd 				 * but the Suff module) */
    212  1.64.2.1    bouyer     const char	    *fname;	/* filename where the GNode got defined */
    213      1.33  christos     int		     lineno;	/* line number where the GNode got defined */
    214       1.1       cgd } GNode;
    215       1.1       cgd 
    216       1.1       cgd /*
    217      1.11  christos  * Manifest constants
    218       1.1       cgd  */
    219       1.1       cgd #define NILGNODE	((GNode *) NIL)
    220       1.1       cgd 
    221       1.1       cgd /*
    222       1.1       cgd  * The OP_ constants are used when parsing a dependency line as a way of
    223       1.1       cgd  * communicating to other parts of the program the way in which a target
    224       1.1       cgd  * should be made. These constants are bitwise-OR'ed together and
    225       1.1       cgd  * placed in the 'type' field of each node. Any node that has
    226       1.1       cgd  * a 'type' field which satisfies the OP_NOP function was never never on
    227       1.1       cgd  * the lefthand side of an operator, though it may have been on the
    228      1.11  christos  * righthand side...
    229       1.1       cgd  */
    230       1.1       cgd #define OP_DEPENDS	0x00000001  /* Execution of commands depends on
    231       1.1       cgd 				     * kids (:) */
    232       1.1       cgd #define OP_FORCE	0x00000002  /* Always execute commands (!) */
    233       1.1       cgd #define OP_DOUBLEDEP	0x00000004  /* Execution of commands depends on kids
    234       1.1       cgd 				     * per line (::) */
    235       1.1       cgd #define OP_OPMASK	(OP_DEPENDS|OP_FORCE|OP_DOUBLEDEP)
    236       1.1       cgd 
    237       1.1       cgd #define OP_OPTIONAL	0x00000008  /* Don't care if the target doesn't
    238       1.1       cgd 				     * exist and can't be created */
    239       1.1       cgd #define OP_USE		0x00000010  /* Use associated commands for parents */
    240       1.1       cgd #define OP_EXEC	  	0x00000020  /* Target is never out of date, but always
    241       1.1       cgd 				     * execute commands anyway. Its time
    242       1.1       cgd 				     * doesn't matter, so it has none...sort
    243       1.1       cgd 				     * of */
    244       1.1       cgd #define OP_IGNORE	0x00000040  /* Ignore errors when creating the node */
    245       1.1       cgd #define OP_PRECIOUS	0x00000080  /* Don't remove the target when
    246       1.1       cgd 				     * interrupted */
    247       1.1       cgd #define OP_SILENT	0x00000100  /* Don't echo commands when executed */
    248      1.40  christos #define OP_MAKE		0x00000200  /* Target is a recursive make so its
    249       1.1       cgd 				     * commands should always be executed when
    250       1.1       cgd 				     * it is out of date, regardless of the
    251       1.1       cgd 				     * state of the -n or -t flags */
    252       1.1       cgd #define OP_JOIN 	0x00000400  /* Target is out-of-date only if any of its
    253       1.1       cgd 				     * children was out-of-date */
    254      1.41  christos #define	OP_MADE		0x00000800  /* Assume the children of the node have
    255      1.41  christos 				     * been already made */
    256      1.54  christos #define OP_SPECIAL	0x00001000  /* Special .BEGIN, .END, .INTERRUPT */
    257      1.36  christos #define	OP_USEBEFORE	0x00002000  /* Like .USE, only prepend commands */
    258       1.1       cgd #define OP_INVISIBLE	0x00004000  /* The node is invisible to its parents.
    259       1.1       cgd 				     * I.e. it doesn't show up in the parents's
    260       1.1       cgd 				     * local variables. */
    261       1.1       cgd #define OP_NOTMAIN	0x00008000  /* The node is exempt from normal 'main
    262       1.1       cgd 				     * target' processing in parse.c */
    263       1.6  christos #define OP_PHONY	0x00010000  /* Not a file target; run always */
    264      1.17       gwr #define OP_NOPATH	0x00020000  /* Don't search for file in the path */
    265      1.64       dsl #define OP_WAIT 	0x00040000  /* .WAIT phony node */
    266       1.1       cgd /* Attributes applied by PMake */
    267       1.1       cgd #define OP_TRANSFORM	0x80000000  /* The node is a transformation rule */
    268       1.1       cgd #define OP_MEMBER 	0x40000000  /* Target is a member of an archive */
    269       1.1       cgd #define OP_LIB	  	0x20000000  /* Target is a library */
    270       1.1       cgd #define OP_ARCHV  	0x10000000  /* Target is an archive construct */
    271       1.1       cgd #define OP_HAS_COMMANDS	0x08000000  /* Target has all the commands it should.
    272       1.1       cgd 				     * Used when parsing to catch multiple
    273       1.1       cgd 				     * commands for a target */
    274       1.1       cgd #define OP_SAVE_CMDS	0x04000000  /* Saving commands on .END (Compat) */
    275       1.1       cgd #define OP_DEPS_FOUND	0x02000000  /* Already processed by Suff_FindDeps */
    276      1.29   mycroft #define	OP_MARK		0x01000000  /* Node found while expanding .ALLSRC */
    277       1.1       cgd 
    278      1.31  sommerfe #define NoExecute(gn) ((gn->type & OP_MAKE) ? noRecursiveExecute : noExecute)
    279       1.1       cgd /*
    280       1.1       cgd  * OP_NOP will return TRUE if the node with the given type was not the
    281       1.1       cgd  * object of a dependency operator
    282       1.1       cgd  */
    283       1.1       cgd #define OP_NOP(t)	(((t) & OP_OPMASK) == 0x00000000)
    284      1.16  christos 
    285      1.16  christos #define OP_NOTARGET (OP_NOTMAIN|OP_USE|OP_EXEC|OP_TRANSFORM)
    286       1.1       cgd 
    287       1.1       cgd /*
    288       1.1       cgd  * The TARG_ constants are used when calling the Targ_FindNode and
    289       1.1       cgd  * Targ_FindList functions in targ.c. They simply tell the functions what to
    290       1.1       cgd  * do if the desired node(s) is (are) not found. If the TARG_CREATE constant
    291       1.1       cgd  * is given, a new, empty node will be created for the target, placed in the
    292       1.1       cgd  * table of all targets and its address returned. If TARG_NOCREATE is given,
    293      1.11  christos  * a NIL pointer will be returned.
    294       1.1       cgd  */
    295      1.64       dsl #define TARG_NOCREATE	0x00	  /* don't create it */
    296       1.1       cgd #define TARG_CREATE	0x01	  /* create node if not found */
    297      1.64       dsl #define TARG_NOHASH	0x02	  /* don't look in/add to hash table */
    298       1.1       cgd 
    299       1.1       cgd /*
    300       1.1       cgd  * There are several places where expandable buffers are used (parse.c and
    301       1.1       cgd  * var.c). This constant is merely the starting point for those buffers. If
    302       1.1       cgd  * lines tend to be much shorter than this, it would be best to reduce BSIZE.
    303       1.1       cgd  * If longer, it should be increased. Reducing it will cause more copying to
    304       1.1       cgd  * be done for longer lines, but will save space for shorter ones. In any
    305       1.1       cgd  * case, it ought to be a power of two simply because most storage allocation
    306      1.11  christos  * schemes allocate in powers of two.
    307       1.1       cgd  */
    308       1.3       cgd #define MAKE_BSIZE		256	/* starting size for expandable buffers */
    309       1.1       cgd 
    310       1.1       cgd /*
    311       1.1       cgd  * These constants are all used by the Str_Concat function to decide how the
    312       1.1       cgd  * final string should look. If STR_ADDSPACE is given, a space will be
    313       1.1       cgd  * placed between the two strings. If STR_ADDSLASH is given, a '/' will
    314       1.1       cgd  * be used instead of a space. If neither is given, no intervening characters
    315       1.1       cgd  * will be placed between the two strings in the final output. If the
    316       1.1       cgd  * STR_DOFREE bit is set, the two input strings will be freed before
    317      1.11  christos  * Str_Concat returns.
    318       1.1       cgd  */
    319       1.1       cgd #define STR_ADDSPACE	0x01	/* add a space when Str_Concat'ing */
    320      1.46  christos #define STR_ADDSLASH	0x02	/* add a slash when Str_Concat'ing */
    321       1.1       cgd 
    322       1.1       cgd /*
    323       1.1       cgd  * Error levels for parsing. PARSE_FATAL means the process cannot continue
    324       1.1       cgd  * once the makefile has been parsed. PARSE_WARNING means it can. Passed
    325       1.1       cgd  * as the first argument to Parse_Error.
    326       1.1       cgd  */
    327       1.1       cgd #define PARSE_WARNING	2
    328       1.1       cgd #define PARSE_FATAL	1
    329       1.1       cgd 
    330       1.1       cgd /*
    331       1.1       cgd  * Values returned by Cond_Eval.
    332       1.1       cgd  */
    333       1.1       cgd #define COND_PARSE	0   	/* Parse the next lines */
    334       1.1       cgd #define COND_SKIP 	1   	/* Skip the next lines */
    335       1.1       cgd #define COND_INVALID	2   	/* Not a conditional statement */
    336       1.1       cgd 
    337       1.1       cgd /*
    338       1.1       cgd  * Definitions for the "local" variables. Used only for clarity.
    339       1.1       cgd  */
    340       1.1       cgd #define TARGET	  	  "@" 	/* Target of dependency */
    341       1.1       cgd #define OODATE	  	  "?" 	/* All out-of-date sources */
    342       1.1       cgd #define ALLSRC	  	  ">" 	/* All sources */
    343       1.1       cgd #define IMPSRC	  	  "<" 	/* Source implied by transformation */
    344       1.1       cgd #define PREFIX	  	  "*" 	/* Common prefix */
    345       1.1       cgd #define ARCHIVE	  	  "!" 	/* Archive in "archive(member)" syntax */
    346       1.1       cgd #define MEMBER	  	  "%" 	/* Member in "archive(member)" syntax */
    347       1.1       cgd 
    348       1.1       cgd #define FTARGET           "@F"  /* file part of TARGET */
    349       1.1       cgd #define DTARGET           "@D"  /* directory part of TARGET */
    350       1.1       cgd #define FIMPSRC           "<F"  /* file part of IMPSRC */
    351       1.1       cgd #define DIMPSRC           "<D"  /* directory part of IMPSRC */
    352       1.1       cgd #define FPREFIX           "*F"  /* file part of PREFIX */
    353       1.1       cgd #define DPREFIX           "*D"  /* directory part of PREFIX */
    354       1.1       cgd 
    355       1.1       cgd /*
    356      1.11  christos  * Global Variables
    357       1.1       cgd  */
    358       1.1       cgd extern Lst  	create;	    	/* The list of target names specified on the
    359       1.1       cgd 				 * command line. used to resolve #if
    360       1.1       cgd 				 * make(...) statements */
    361       1.1       cgd extern Lst     	dirSearchPath; 	/* The list of directories to search when
    362       1.1       cgd 				 * looking for targets */
    363       1.1       cgd 
    364       1.3       cgd extern Boolean	compatMake;	/* True if we are make compatible */
    365       1.1       cgd extern Boolean	ignoreErrors;  	/* True if should ignore all errors */
    366       1.1       cgd extern Boolean  beSilent;    	/* True if should print no commands */
    367       1.1       cgd extern Boolean  noExecute;    	/* True if should execute nothing */
    368      1.31  sommerfe extern Boolean  noRecursiveExecute;    	/* True if should execute nothing */
    369       1.1       cgd extern Boolean  allPrecious;   	/* True if every target is precious */
    370       1.1       cgd extern Boolean  keepgoing;    	/* True if should continue on unaffected
    371       1.1       cgd 				 * portions of the graph when have an error
    372       1.1       cgd 				 * in one portion */
    373       1.1       cgd extern Boolean 	touchFlag;    	/* TRUE if targets should just be 'touched'
    374       1.1       cgd 				 * if out of date. Set by the -t flag */
    375       1.1       cgd extern Boolean 	queryFlag;    	/* TRUE if we aren't supposed to really make
    376       1.1       cgd 				 * anything, just see if the targets are out-
    377       1.1       cgd 				 * of-date */
    378       1.1       cgd 
    379       1.1       cgd extern Boolean	checkEnvFirst;	/* TRUE if environment should be searched for
    380       1.1       cgd 				 * variables before the global context */
    381      1.30  sommerfe extern Boolean	jobServer;	/* a jobServer already exists */
    382       1.1       cgd 
    383      1.32  christos extern Boolean	parseWarnFatal;	/* TRUE if makefile parsing warnings are
    384      1.32  christos 				 * treated as errors */
    385      1.45   thorpej 
    386      1.45   thorpej extern Boolean	varNoExportEnv;	/* TRUE if we should not export variables
    387      1.45   thorpej 				 * set on the command line to the env. */
    388      1.32  christos 
    389       1.1       cgd extern GNode    *DEFAULT;    	/* .DEFAULT rule */
    390       1.1       cgd 
    391       1.1       cgd extern GNode    *VAR_GLOBAL;   	/* Variables defined in a global context, e.g
    392       1.1       cgd 				 * in the Makefile itself */
    393       1.1       cgd extern GNode    *VAR_CMD;    	/* Variables defined on the command line */
    394      1.26   mycroft extern GNode	*VAR_FOR;	/* Iteration variables */
    395       1.1       cgd extern char    	var_Error[];   	/* Value returned by Var_Parse when an error
    396       1.1       cgd 				 * is encountered. It actually points to
    397       1.1       cgd 				 * an empty string, so naive callers needn't
    398       1.1       cgd 				 * worry about it. */
    399       1.1       cgd 
    400       1.1       cgd extern time_t 	now;	    	/* The time at the start of this whole
    401       1.1       cgd 				 * process */
    402       1.1       cgd 
    403       1.1       cgd extern Boolean	oldVars;    	/* Do old-style variable substitution */
    404       1.9  christos 
    405       1.9  christos extern Lst	sysIncPath;	/* The system include path. */
    406      1.38        tv extern Lst	defIncPath;	/* The default include path. */
    407      1.32  christos 
    408      1.32  christos extern char	*progname;	/* The program name */
    409      1.30  sommerfe 
    410      1.30  sommerfe #define	MAKEFLAGS	".MAKEFLAGS"
    411      1.35       sjg #define	MAKEOVERRIDES	".MAKEOVERRIDES"
    412       1.1       cgd 
    413       1.1       cgd /*
    414       1.1       cgd  * debug control:
    415       1.1       cgd  *	There is one bit per module.  It is up to the module what debug
    416       1.1       cgd  *	information to print.
    417       1.1       cgd  */
    418      1.63       dsl FILE *debug_file;		/* Output written here - default stdout */
    419       1.1       cgd extern int debug;
    420       1.1       cgd #define	DEBUG_ARCH	0x0001
    421       1.1       cgd #define	DEBUG_COND	0x0002
    422       1.1       cgd #define	DEBUG_DIR	0x0004
    423       1.1       cgd #define	DEBUG_GRAPH1	0x0008
    424       1.1       cgd #define	DEBUG_GRAPH2	0x0010
    425       1.1       cgd #define	DEBUG_JOB	0x0020
    426       1.1       cgd #define	DEBUG_MAKE	0x0040
    427       1.1       cgd #define	DEBUG_SUFF	0x0080
    428       1.1       cgd #define	DEBUG_TARG	0x0100
    429       1.1       cgd #define	DEBUG_VAR	0x0200
    430       1.3       cgd #define DEBUG_FOR	0x0400
    431      1.34       sjg #define DEBUG_SHELL	0x0800
    432      1.48      jmmv #define DEBUG_ERROR	0x1000
    433      1.50       dsl #define	DEBUG_GRAPH3	0x10000
    434      1.55       jmc #define DEBUG_SCRIPT	0x20000
    435      1.57       dsl #define DEBUG_PARSE	0x40000
    436       1.1       cgd 
    437       1.1       cgd #define CONCAT(a,b)	a##b
    438       1.1       cgd 
    439       1.1       cgd #define	DEBUG(module)	(debug & CONCAT(DEBUG_,module))
    440       1.1       cgd 
    441       1.1       cgd /*
    442       1.1       cgd  * Since there are so many, all functions that return non-integer values are
    443       1.1       cgd  * extracted by means of a sed script or two and stuck in the file "nonints.h"
    444       1.1       cgd  */
    445       1.1       cgd #include "nonints.h"
    446       1.1       cgd 
    447      1.44       wiz int Make_TimeStamp(GNode *, GNode *);
    448      1.44       wiz Boolean Make_OODate(GNode *);
    449      1.64       dsl void Make_ExpandUse(Lst);
    450      1.44       wiz time_t Make_Recheck(GNode *);
    451      1.44       wiz void Make_HandleUse(GNode *, GNode *);
    452      1.44       wiz void Make_Update(GNode *);
    453      1.44       wiz void Make_DoAllVar(GNode *);
    454      1.44       wiz Boolean Make_Run(Lst);
    455      1.46  christos char * Check_Cwd_Cmd(const char *);
    456      1.46  christos void Check_Cwd(const char **);
    457      1.46  christos void PrintOnError(const char *);
    458      1.44       wiz void Main_ExportMAKEFLAGS(Boolean);
    459      1.44       wiz Boolean Main_SetObjdir(const char *);
    460      1.46  christos 
    461      1.46  christos #ifdef __GNUC__
    462      1.46  christos #define UNCONST(ptr)	({ 		\
    463      1.46  christos     union __unconst {			\
    464      1.46  christos 	const void *__cp;		\
    465      1.46  christos 	void *__p;			\
    466      1.46  christos     } __d;				\
    467      1.46  christos     __d.__cp = ptr, __d.__p; })
    468      1.46  christos #else
    469      1.46  christos #define UNCONST(ptr)	(void *)(ptr)
    470      1.49       sjg #endif
    471      1.49       sjg 
    472      1.49       sjg #ifndef MIN
    473      1.49       sjg #define MIN(a, b) ((a < b) ? a : b)
    474      1.49       sjg #endif
    475      1.49       sjg #ifndef MAX
    476      1.49       sjg #define MAX(a, b) ((a > b) ? a : b)
    477      1.46  christos #endif
    478       1.3       cgd 
    479       1.3       cgd #endif /* _MAKE_H_ */
    480