Home | History | Annotate | Line # | Download | only in make
make.h revision 1.131
      1  1.131    rillig /*	$NetBSD: make.h,v 1.131 2020/08/29 08:09:07 rillig 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.116    rillig #ifndef MAKE_MAKE_H
     81  1.116    rillig #define MAKE_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.123    rillig #include <assert.h>
     87   1.44       wiz #include <ctype.h>
     88   1.97  christos #include <fcntl.h>
     89    1.3       cgd #include <stdio.h>
     90   1.44       wiz #include <stdlib.h>
     91    1.1       cgd #include <string.h>
     92   1.44       wiz #include <unistd.h>
     93   1.12  christos 
     94   1.19        tv #ifdef BSD4_4
     95   1.12  christos # include <sys/cdefs.h>
     96    1.4     glass #endif
     97   1.12  christos 
     98   1.97  christos #ifndef FD_CLOEXEC
     99   1.97  christos #define FD_CLOEXEC 1
    100   1.97  christos #endif
    101   1.97  christos 
    102   1.52      yamt #if defined(__GNUC__)
    103   1.89     joerg #define	MAKE_GNUC_PREREQ(x, y)						\
    104   1.52      yamt 	((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) ||			\
    105   1.52      yamt 	 (__GNUC__ > (x)))
    106   1.52      yamt #else /* defined(__GNUC__) */
    107   1.90  dholland #define	MAKE_GNUC_PREREQ(x, y)	0
    108   1.52      yamt #endif /* defined(__GNUC__) */
    109   1.52      yamt 
    110   1.89     joerg #if MAKE_GNUC_PREREQ(2, 7)
    111   1.89     joerg #define	MAKE_ATTR_UNUSED	__attribute__((__unused__))
    112   1.51       jmc #else
    113   1.89     joerg #define	MAKE_ATTR_UNUSED	/* delete */
    114   1.51       jmc #endif
    115   1.89     joerg 
    116   1.89     joerg #if MAKE_GNUC_PREREQ(2, 5)
    117   1.89     joerg #define	MAKE_ATTR_DEAD		__attribute__((__noreturn__))
    118   1.89     joerg #elif defined(__GNUC__)
    119   1.89     joerg #define	MAKE_ATTR_DEAD		__volatile
    120   1.89     joerg #else
    121   1.89     joerg #define	MAKE_ATTR_DEAD		/* delete */
    122   1.51       jmc #endif
    123   1.44       wiz 
    124   1.89     joerg #if MAKE_GNUC_PREREQ(2, 7)
    125   1.89     joerg #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg)	\
    126   1.89     joerg 	    __attribute__((__format__ (__printf__, fmtarg, firstvararg)))
    127   1.89     joerg #else
    128   1.89     joerg #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg)	/* delete */
    129   1.87     joerg #endif
    130   1.87     joerg 
    131  1.127    rillig /*
    132  1.127    rillig  * A boolean type is defined as an integer, not an enum. This allows a
    133  1.127    rillig  * boolean argument to be an expression that isn't strictly 0 or 1 valued.
    134  1.127    rillig  */
    135  1.127    rillig 
    136  1.131    rillig #ifdef USE_DOUBLE_BOOLEAN
    137  1.131    rillig /* During development, to find type mismatches in function declarations. */
    138  1.130    rillig typedef double Boolean;
    139  1.131    rillig #elif defined(USE_UCHAR_BOOLEAN)
    140  1.131    rillig /* During development, to find code that depends on the exact value of TRUE or
    141  1.131    rillig  * that stores other values in Boolean variables. */
    142  1.131    rillig typedef unsigned char Boolean;
    143  1.131    rillig #define TRUE ((unsigned char)0xFF)
    144  1.131    rillig #define FALSE ((unsigned char)0x00)
    145  1.130    rillig #else
    146  1.127    rillig typedef int Boolean;
    147  1.130    rillig #endif
    148  1.127    rillig #ifndef TRUE
    149  1.127    rillig #define TRUE	1
    150  1.127    rillig #endif /* TRUE */
    151  1.127    rillig #ifndef FALSE
    152  1.127    rillig #define FALSE	0
    153  1.127    rillig #endif /* FALSE */
    154  1.127    rillig 
    155  1.127    rillig /*
    156  1.127    rillig  * Functions that must return a status can return a ReturnStatus to
    157  1.127    rillig  * indicate success or type of failure.
    158  1.127    rillig  */
    159  1.127    rillig 
    160  1.127    rillig typedef int  ReturnStatus;
    161  1.127    rillig 
    162  1.127    rillig /*
    163  1.127    rillig  * The following statuses overlap with the first 2 generic statuses
    164  1.127    rillig  * defined in status.h:
    165  1.127    rillig  *
    166  1.127    rillig  * SUCCESS			There was no error.
    167  1.127    rillig  * FAILURE			There was a general error.
    168  1.127    rillig  */
    169  1.127    rillig 
    170  1.127    rillig #define	SUCCESS			0x00000000
    171  1.127    rillig #define	FAILURE			0x00000001
    172  1.127    rillig 
    173    1.1       cgd #include "lst.h"
    174  1.128    rillig #include "enum.h"
    175   1.22   mycroft #include "hash.h"
    176    1.1       cgd #include "config.h"
    177    1.3       cgd #include "buf.h"
    178   1.78       dsl #include "make_malloc.h"
    179    1.1       cgd 
    180  1.119    rillig typedef enum  {
    181  1.119    rillig     UNMADE,			/* Not examined yet */
    182  1.119    rillig     DEFERRED,			/* Examined once (building child) */
    183  1.119    rillig     REQUESTED,			/* on toBeMade list */
    184  1.119    rillig     BEINGMADE,			/* Target is already being made.
    185  1.119    rillig 				 * Indicates a cycle in the graph. */
    186  1.119    rillig     MADE,			/* Was out-of-date and has been made */
    187  1.119    rillig     UPTODATE,			/* Was already up-to-date */
    188  1.119    rillig     ERROR,			/* An error occurred while it was being
    189  1.119    rillig 				 * made (used only in compat mode) */
    190  1.119    rillig     ABORTED			/* The target was aborted due to an error
    191  1.119    rillig 				 * making an inferior (compat). */
    192  1.119    rillig } GNodeMade;
    193    1.1       cgd 
    194  1.120    rillig /* The OP_ constants are used when parsing a dependency line as a way of
    195  1.120    rillig  * communicating to other parts of the program the way in which a target
    196  1.120    rillig  * should be made.
    197  1.120    rillig  *
    198  1.120    rillig  * These constants are bitwise-OR'ed together and placed in the 'type' field
    199  1.120    rillig  * of each node. Any node that has a 'type' field which satisfies the OP_NOP
    200  1.120    rillig  * function was never never on the left-hand side of an operator, though it
    201  1.120    rillig  * may have been on the right-hand side... */
    202  1.120    rillig typedef enum {
    203  1.120    rillig     /* Execution of commands depends on children (:) */
    204  1.120    rillig     OP_DEPENDS		= 1 << 0,
    205  1.120    rillig     /* Always execute commands (!) */
    206  1.120    rillig     OP_FORCE		= 1 << 1,
    207  1.120    rillig     /* Execution of commands depends on children per line (::) */
    208  1.120    rillig     OP_DOUBLEDEP	= 1 << 2,
    209  1.120    rillig 
    210  1.120    rillig     OP_OPMASK		= OP_DEPENDS|OP_FORCE|OP_DOUBLEDEP,
    211  1.120    rillig 
    212  1.120    rillig     /* Don't care if the target doesn't exist and can't be created */
    213  1.120    rillig     OP_OPTIONAL		= 1 << 3,
    214  1.120    rillig     /* Use associated commands for parents */
    215  1.120    rillig     OP_USE		= 1 << 4,
    216  1.120    rillig     /* Target is never out of date, but always execute commands anyway.
    217  1.120    rillig      * Its time doesn't matter, so it has none...sort of */
    218  1.120    rillig     OP_EXEC	  	= 1 << 5,
    219  1.120    rillig     /* Ignore errors when creating the node */
    220  1.120    rillig     OP_IGNORE		= 1 << 6,
    221  1.120    rillig     /* Don't remove the target when interrupted */
    222  1.120    rillig     OP_PRECIOUS		= 1 << 7,
    223  1.120    rillig     /* Don't echo commands when executed */
    224  1.120    rillig     OP_SILENT		= 1 << 8,
    225  1.120    rillig     /* Target is a recursive make so its commands should always be executed
    226  1.120    rillig      * when it is out of date, regardless of the state of the -n or -t flags */
    227  1.120    rillig     OP_MAKE		= 1 << 9,
    228  1.120    rillig     /* Target is out-of-date only if any of its children was out-of-date */
    229  1.120    rillig     OP_JOIN		= 1 << 10,
    230  1.120    rillig     /* Assume the children of the node have been already made */
    231  1.120    rillig     OP_MADE		= 1 << 11,
    232  1.120    rillig     /* Special .BEGIN, .END, .INTERRUPT */
    233  1.120    rillig     OP_SPECIAL		= 1 << 12,
    234  1.120    rillig     /* Like .USE, only prepend commands */
    235  1.120    rillig     OP_USEBEFORE	= 1 << 13,
    236  1.120    rillig     /* The node is invisible to its parents. I.e. it doesn't show up in the
    237  1.120    rillig      * parents' local variables. */
    238  1.120    rillig     OP_INVISIBLE	= 1 << 14,
    239  1.120    rillig     /* The node is exempt from normal 'main target' processing in parse.c */
    240  1.120    rillig     OP_NOTMAIN		= 1 << 15,
    241  1.120    rillig     /* Not a file target; run always */
    242  1.120    rillig     OP_PHONY		= 1 << 16,
    243  1.120    rillig     /* Don't search for file in the path */
    244  1.120    rillig     OP_NOPATH		= 1 << 17,
    245  1.120    rillig     /* .WAIT phony node */
    246  1.120    rillig     OP_WAIT		= 1 << 18,
    247  1.120    rillig     /* .NOMETA do not create a .meta file */
    248  1.120    rillig     OP_NOMETA		= 1 << 19,
    249  1.120    rillig     /* .META we _do_ want a .meta file */
    250  1.120    rillig     OP_META		= 1 << 20,
    251  1.120    rillig     /* Do not compare commands in .meta file */
    252  1.120    rillig     OP_NOMETA_CMP	= 1 << 21,
    253  1.120    rillig     /* Possibly a submake node */
    254  1.120    rillig     OP_SUBMAKE		= 1 << 22,
    255  1.120    rillig 
    256  1.120    rillig     /* Attributes applied by PMake */
    257  1.120    rillig 
    258  1.120    rillig     /* The node is a transformation rule */
    259  1.120    rillig     OP_TRANSFORM	= 1 << 31,
    260  1.120    rillig     /* Target is a member of an archive */
    261  1.120    rillig     OP_MEMBER		= 1 << 30,
    262  1.120    rillig     /* Target is a library */
    263  1.120    rillig     OP_LIB		= 1 << 29,
    264  1.120    rillig     /* Target is an archive construct */
    265  1.120    rillig     OP_ARCHV		= 1 << 28,
    266  1.120    rillig     /* Target has all the commands it should. Used when parsing to catch
    267  1.120    rillig      * multiple commands for a target. */
    268  1.120    rillig     OP_HAS_COMMANDS	= 1 << 27,
    269  1.120    rillig     /* Saving commands on .END (Compat) */
    270  1.120    rillig     OP_SAVE_CMDS	= 1 << 26,
    271  1.120    rillig     /* Already processed by Suff_FindDeps */
    272  1.120    rillig     OP_DEPS_FOUND	= 1 << 25,
    273  1.120    rillig     /* Node found while expanding .ALLSRC */
    274  1.120    rillig     OP_MARK		= 1 << 24
    275  1.120    rillig } GNodeType;
    276  1.120    rillig 
    277  1.119    rillig typedef enum {
    278  1.119    rillig     REMAKE	= 0x0001,	/* this target needs to be (re)made */
    279  1.119    rillig     CHILDMADE	= 0x0002,	/* children of this target were made */
    280  1.119    rillig     FORCE	= 0x0004,	/* children don't exist, and we pretend made */
    281  1.119    rillig     DONE_WAIT	= 0x0008,	/* Set by Make_ProcessWait() */
    282  1.119    rillig     DONE_ORDER	= 0x0010,	/* Build requested by .ORDER processing */
    283  1.119    rillig     FROM_DEPEND	= 0x0020,	/* Node created from .depend */
    284  1.119    rillig     DONE_ALLSRC	= 0x0040,	/* We do it once only */
    285  1.119    rillig     CYCLE	= 0x1000,	/* Used by MakePrintStatus */
    286  1.119    rillig     DONECYCLE	= 0x2000,	/* Used by MakePrintStatus */
    287  1.119    rillig     INTERNAL	= 0x4000	/* Internal use only */
    288  1.119    rillig } GNodeFlags;
    289    1.1       cgd 
    290  1.119    rillig /* A graph node represents a target that can possibly be made, including its
    291  1.119    rillig  * relation to other targets and a lot of other details. */
    292  1.119    rillig typedef struct GNode {
    293  1.119    rillig     /* The target's name, such as "clean" or "make.c" */
    294  1.119    rillig     char *name;
    295  1.119    rillig     /* The unexpanded name of a .USE node */
    296  1.119    rillig     char *uname;
    297  1.119    rillig     /* The full pathname of the file belonging to the target.
    298  1.119    rillig      * XXX: What about .PHONY targets? These don't have an associated path. */
    299  1.119    rillig     char *path;
    300  1.119    rillig 
    301  1.119    rillig     /* The type of operator used to define the sources (see the OP flags below).
    302  1.119    rillig      * XXX: This looks like a wild mixture of type and flags. */
    303  1.124    rillig     GNodeType type;
    304  1.119    rillig     /* whether it is involved in this invocation of make */
    305  1.119    rillig     GNodeFlags flags;
    306  1.119    rillig 
    307  1.119    rillig     /* The state of processing on this node */
    308  1.119    rillig     GNodeMade made;
    309  1.119    rillig     int unmade;			/* The number of unmade children */
    310  1.119    rillig 
    311  1.119    rillig     time_t mtime;		/* Its modification time */
    312  1.119    rillig     struct GNode *cmgn;		/* The youngest child */
    313  1.119    rillig 
    314  1.119    rillig     /* Links to parents for which this is an implied source. May be empty.
    315  1.119    rillig      * Nodes that depend on this, as gleaned from the transformation rules. */
    316  1.119    rillig     Lst iParents;
    317  1.119    rillig 
    318  1.119    rillig     /* Other nodes of the same name for the :: operator. */
    319  1.119    rillig     Lst cohorts;
    320  1.119    rillig 
    321  1.119    rillig     /* The nodes that depend on this one, or in other words, the nodes for
    322  1.119    rillig      * which this is a source. */
    323  1.119    rillig     Lst parents;
    324  1.119    rillig     /* The nodes on which this one depends. */
    325  1.119    rillig     Lst children;
    326  1.119    rillig 
    327  1.119    rillig     /* .ORDER nodes we need made. The nodes that must be made (if they're
    328  1.119    rillig      * made) before this node can be made, but that do not enter into the
    329  1.119    rillig      * datedness of this node. */
    330  1.119    rillig     Lst order_pred;
    331  1.119    rillig     /* .ORDER nodes who need us. The nodes that must be made (if they're made
    332  1.119    rillig      * at all) after this node is made, but that do not depend on this node,
    333  1.119    rillig      * in the normal sense. */
    334  1.119    rillig     Lst order_succ;
    335  1.119    rillig 
    336  1.119    rillig     /* #n for this cohort */
    337  1.119    rillig     char cohort_num[8];
    338  1.119    rillig     /* The number of unmade instances on the cohorts list */
    339  1.119    rillig     int unmade_cohorts;
    340  1.129    rillig     /* Pointer to the first instance of a '::' node; only set when on a
    341  1.129    rillig      * cohorts list */
    342  1.119    rillig     struct GNode *centurion;
    343  1.119    rillig 
    344  1.122    rillig     /* Last time (sequence number) we tried to make this node */
    345  1.122    rillig     unsigned int checked;
    346  1.119    rillig 
    347  1.119    rillig     /* The "local" variables that are specific to this target and this target
    348  1.119    rillig      * only, such as $@, $<, $?. */
    349  1.119    rillig     Hash_Table context;
    350  1.119    rillig 
    351  1.119    rillig     /* The commands to be given to a shell to create this target. */
    352  1.119    rillig     Lst commands;
    353  1.119    rillig 
    354  1.119    rillig     /* Suffix for the node (determined by Suff_FindDeps and opaque to everyone
    355  1.119    rillig      * but the Suff module) */
    356  1.119    rillig     struct Suff *suffix;
    357  1.119    rillig 
    358  1.119    rillig     /* filename where the GNode got defined */
    359  1.119    rillig     const char *fname;
    360  1.119    rillig     /* line number where the GNode got defined */
    361  1.119    rillig     int lineno;
    362    1.1       cgd } GNode;
    363    1.1       cgd 
    364   1.31  sommerfe #define NoExecute(gn) ((gn->type & OP_MAKE) ? noRecursiveExecute : noExecute)
    365    1.1       cgd /*
    366    1.1       cgd  * OP_NOP will return TRUE if the node with the given type was not the
    367    1.1       cgd  * object of a dependency operator
    368    1.1       cgd  */
    369    1.1       cgd #define OP_NOP(t)	(((t) & OP_OPMASK) == 0x00000000)
    370   1.16  christos 
    371   1.95     joerg #define OP_NOTARGET (OP_NOTMAIN|OP_USE|OP_EXEC|OP_TRANSFORM)
    372    1.1       cgd 
    373    1.1       cgd /*
    374    1.1       cgd  * The TARG_ constants are used when calling the Targ_FindNode and
    375    1.1       cgd  * Targ_FindList functions in targ.c. They simply tell the functions what to
    376    1.1       cgd  * do if the desired node(s) is (are) not found. If the TARG_CREATE constant
    377    1.1       cgd  * is given, a new, empty node will be created for the target, placed in the
    378    1.1       cgd  * table of all targets and its address returned. If TARG_NOCREATE is given,
    379   1.76       dsl  * a NULL pointer will be returned.
    380    1.1       cgd  */
    381   1.64       dsl #define TARG_NOCREATE	0x00	  /* don't create it */
    382    1.1       cgd #define TARG_CREATE	0x01	  /* create node if not found */
    383   1.64       dsl #define TARG_NOHASH	0x02	  /* don't look in/add to hash table */
    384    1.1       cgd 
    385    1.1       cgd /*
    386    1.1       cgd  * Error levels for parsing. PARSE_FATAL means the process cannot continue
    387    1.1       cgd  * once the makefile has been parsed. PARSE_WARNING means it can. Passed
    388    1.1       cgd  * as the first argument to Parse_Error.
    389    1.1       cgd  */
    390  1.104       sjg #define PARSE_INFO	3
    391    1.1       cgd #define PARSE_WARNING	2
    392    1.1       cgd #define PARSE_FATAL	1
    393    1.1       cgd 
    394    1.1       cgd /*
    395    1.1       cgd  * Values returned by Cond_Eval.
    396    1.1       cgd  */
    397  1.113    rillig typedef enum {
    398  1.113    rillig     COND_PARSE,			/* Parse the next lines */
    399  1.113    rillig     COND_SKIP,			/* Skip the next lines */
    400  1.113    rillig     COND_INVALID		/* Not a conditional statement */
    401  1.113    rillig } CondEvalResult;
    402    1.1       cgd 
    403    1.1       cgd /*
    404    1.1       cgd  * Definitions for the "local" variables. Used only for clarity.
    405    1.1       cgd  */
    406    1.1       cgd #define TARGET	  	  "@" 	/* Target of dependency */
    407    1.1       cgd #define OODATE	  	  "?" 	/* All out-of-date sources */
    408    1.1       cgd #define ALLSRC	  	  ">" 	/* All sources */
    409    1.1       cgd #define IMPSRC	  	  "<" 	/* Source implied by transformation */
    410    1.1       cgd #define PREFIX	  	  "*" 	/* Common prefix */
    411    1.1       cgd #define ARCHIVE	  	  "!" 	/* Archive in "archive(member)" syntax */
    412    1.1       cgd #define MEMBER	  	  "%" 	/* Member in "archive(member)" syntax */
    413    1.1       cgd 
    414    1.1       cgd #define FTARGET           "@F"  /* file part of TARGET */
    415    1.1       cgd #define DTARGET           "@D"  /* directory part of TARGET */
    416    1.1       cgd #define FIMPSRC           "<F"  /* file part of IMPSRC */
    417    1.1       cgd #define DIMPSRC           "<D"  /* directory part of IMPSRC */
    418    1.1       cgd #define FPREFIX           "*F"  /* file part of PREFIX */
    419    1.1       cgd #define DPREFIX           "*D"  /* directory part of PREFIX */
    420    1.1       cgd 
    421    1.1       cgd /*
    422   1.11  christos  * Global Variables
    423    1.1       cgd  */
    424    1.1       cgd extern Lst  	create;	    	/* The list of target names specified on the
    425    1.1       cgd 				 * command line. used to resolve #if
    426    1.1       cgd 				 * make(...) statements */
    427    1.1       cgd extern Lst     	dirSearchPath; 	/* The list of directories to search when
    428    1.1       cgd 				 * looking for targets */
    429    1.1       cgd 
    430    1.3       cgd extern Boolean	compatMake;	/* True if we are make compatible */
    431    1.1       cgd extern Boolean	ignoreErrors;  	/* True if should ignore all errors */
    432    1.1       cgd extern Boolean  beSilent;    	/* True if should print no commands */
    433    1.1       cgd extern Boolean  noExecute;    	/* True if should execute nothing */
    434   1.31  sommerfe extern Boolean  noRecursiveExecute;    	/* True if should execute nothing */
    435    1.1       cgd extern Boolean  allPrecious;   	/* True if every target is precious */
    436  1.101  dholland extern Boolean  deleteOnError;	/* True if failed targets should be deleted */
    437    1.1       cgd extern Boolean  keepgoing;    	/* True if should continue on unaffected
    438    1.1       cgd 				 * portions of the graph when have an error
    439    1.1       cgd 				 * in one portion */
    440    1.1       cgd extern Boolean 	touchFlag;    	/* TRUE if targets should just be 'touched'
    441    1.1       cgd 				 * if out of date. Set by the -t flag */
    442    1.1       cgd extern Boolean 	queryFlag;    	/* TRUE if we aren't supposed to really make
    443    1.1       cgd 				 * anything, just see if the targets are out-
    444    1.1       cgd 				 * of-date */
    445   1.71       dsl extern Boolean	doing_depend;	/* TRUE if processing .depend */
    446    1.1       cgd 
    447    1.1       cgd extern Boolean	checkEnvFirst;	/* TRUE if environment should be searched for
    448    1.1       cgd 				 * variables before the global context */
    449    1.1       cgd 
    450   1.32  christos extern Boolean	parseWarnFatal;	/* TRUE if makefile parsing warnings are
    451   1.32  christos 				 * treated as errors */
    452   1.45   thorpej 
    453   1.45   thorpej extern Boolean	varNoExportEnv;	/* TRUE if we should not export variables
    454   1.45   thorpej 				 * set on the command line to the env. */
    455   1.32  christos 
    456    1.1       cgd extern GNode    *DEFAULT;    	/* .DEFAULT rule */
    457    1.1       cgd 
    458   1.92       sjg extern GNode	*VAR_INTERNAL;	/* Variables defined internally by make
    459   1.92       sjg 				 * which should not override those set by
    460   1.92       sjg 				 * makefiles.
    461   1.92       sjg 				 */
    462    1.1       cgd extern GNode    *VAR_GLOBAL;   	/* Variables defined in a global context, e.g
    463    1.1       cgd 				 * in the Makefile itself */
    464    1.1       cgd extern GNode    *VAR_CMD;    	/* Variables defined on the command line */
    465    1.1       cgd extern char    	var_Error[];   	/* Value returned by Var_Parse when an error
    466    1.1       cgd 				 * is encountered. It actually points to
    467    1.1       cgd 				 * an empty string, so naive callers needn't
    468    1.1       cgd 				 * worry about it. */
    469    1.1       cgd 
    470    1.1       cgd extern time_t 	now;	    	/* The time at the start of this whole
    471    1.1       cgd 				 * process */
    472    1.1       cgd 
    473    1.1       cgd extern Boolean	oldVars;    	/* Do old-style variable substitution */
    474    1.9  christos 
    475    1.9  christos extern Lst	sysIncPath;	/* The system include path. */
    476   1.38        tv extern Lst	defIncPath;	/* The default include path. */
    477   1.32  christos 
    478   1.85     joerg extern char	curdir[];	/* Startup directory */
    479   1.32  christos extern char	*progname;	/* The program name */
    480   1.80       sjg extern char	*makeDependfile; /* .depend */
    481   1.88       sjg extern char	**savedEnv;	 /* if we replaced environ this will be non-NULL */
    482   1.30  sommerfe 
    483  1.111    rillig extern int	makelevel;
    484  1.111    rillig 
    485   1.82       sjg /*
    486   1.82       sjg  * We cannot vfork() in a child of vfork().
    487   1.82       sjg  * Most systems do not enforce this but some do.
    488   1.82       sjg  */
    489   1.82       sjg #define vFork() ((getpid() == myPid) ? vfork() : fork())
    490   1.82       sjg extern pid_t	myPid;
    491   1.82       sjg 
    492   1.30  sommerfe #define	MAKEFLAGS	".MAKEFLAGS"
    493   1.35       sjg #define	MAKEOVERRIDES	".MAKEOVERRIDES"
    494   1.70       sjg #define	MAKE_JOB_PREFIX	".MAKE.JOB.PREFIX" /* prefix for job target output */
    495   1.70       sjg #define	MAKE_EXPORTED	".MAKE.EXPORTED"   /* variables we export */
    496   1.70       sjg #define	MAKE_MAKEFILES	".MAKE.MAKEFILES"  /* all the makefiles we read */
    497   1.79       sjg #define	MAKE_LEVEL	".MAKE.LEVEL"	   /* recursion level */
    498   1.80       sjg #define MAKEFILE_PREFERENCE ".MAKE.MAKEFILE_PREFERENCE"
    499   1.80       sjg #define MAKE_DEPENDFILE	".MAKE.DEPENDFILE" /* .depend */
    500   1.80       sjg #define MAKE_MODE	".MAKE.MODE"
    501   1.91       sjg #ifndef MAKE_LEVEL_ENV
    502   1.91       sjg # define MAKE_LEVEL_ENV	"MAKELEVEL"
    503   1.91       sjg #endif
    504    1.1       cgd 
    505    1.1       cgd /*
    506    1.1       cgd  * debug control:
    507    1.1       cgd  *	There is one bit per module.  It is up to the module what debug
    508    1.1       cgd  *	information to print.
    509    1.1       cgd  */
    510  1.117    rillig extern FILE *debug_file;	/* Output is written here - default stderr */
    511    1.1       cgd extern int debug;
    512   1.75  christos #define	DEBUG_ARCH	0x00001
    513   1.75  christos #define	DEBUG_COND	0x00002
    514   1.75  christos #define	DEBUG_DIR	0x00004
    515   1.75  christos #define	DEBUG_GRAPH1	0x00008
    516   1.75  christos #define	DEBUG_GRAPH2	0x00010
    517   1.75  christos #define	DEBUG_JOB	0x00020
    518   1.75  christos #define	DEBUG_MAKE	0x00040
    519   1.75  christos #define	DEBUG_SUFF	0x00080
    520   1.75  christos #define	DEBUG_TARG	0x00100
    521   1.75  christos #define	DEBUG_VAR	0x00200
    522   1.75  christos #define DEBUG_FOR	0x00400
    523   1.75  christos #define DEBUG_SHELL	0x00800
    524   1.75  christos #define DEBUG_ERROR	0x01000
    525   1.75  christos #define DEBUG_LOUD	0x02000
    526   1.83       sjg #define DEBUG_META	0x04000
    527  1.110       sjg #define DEBUG_HASH	0x08000
    528   1.83       sjg 
    529   1.72       sjg #define DEBUG_GRAPH3	0x10000
    530   1.55       jmc #define DEBUG_SCRIPT	0x20000
    531   1.57       dsl #define DEBUG_PARSE	0x40000
    532   1.75  christos #define DEBUG_CWD	0x80000
    533    1.1       cgd 
    534  1.112       sjg #define DEBUG_LINT	0x100000
    535  1.112       sjg 
    536    1.1       cgd #define CONCAT(a,b)	a##b
    537    1.1       cgd 
    538    1.1       cgd #define	DEBUG(module)	(debug & CONCAT(DEBUG_,module))
    539    1.1       cgd 
    540    1.1       cgd #include "nonints.h"
    541    1.1       cgd 
    542   1.44       wiz int Make_TimeStamp(GNode *, GNode *);
    543   1.44       wiz Boolean Make_OODate(GNode *);
    544   1.64       dsl void Make_ExpandUse(Lst);
    545   1.44       wiz time_t Make_Recheck(GNode *);
    546   1.44       wiz void Make_HandleUse(GNode *, GNode *);
    547   1.44       wiz void Make_Update(GNode *);
    548   1.44       wiz void Make_DoAllVar(GNode *);
    549   1.44       wiz Boolean Make_Run(Lst);
    550  1.108       sjg int dieQuietly(GNode *, int);
    551   1.80       sjg void PrintOnError(GNode *, const char *);
    552   1.44       wiz void Main_ExportMAKEFLAGS(Boolean);
    553  1.102  christos Boolean Main_SetObjdir(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
    554   1.81       sjg int mkTempFile(const char *, char **);
    555   1.86       sjg int str2Lst_Append(Lst, char *, const char *);
    556  1.100       sjg int cached_lstat(const char *, void *);
    557  1.100       sjg int cached_stat(const char *, void *);
    558  1.126    rillig void GNode_FprintDetails(FILE *, const char *, const GNode *, const char *);
    559   1.46  christos 
    560   1.46  christos #ifdef __GNUC__
    561   1.46  christos #define UNCONST(ptr)	({ 		\
    562   1.46  christos     union __unconst {			\
    563   1.46  christos 	const void *__cp;		\
    564   1.46  christos 	void *__p;			\
    565   1.46  christos     } __d;				\
    566   1.46  christos     __d.__cp = ptr, __d.__p; })
    567   1.46  christos #else
    568   1.74  christos #define UNCONST(ptr)	(void *)(ptr)
    569   1.49       sjg #endif
    570   1.49       sjg 
    571   1.49       sjg #ifndef MIN
    572   1.49       sjg #define MIN(a, b) ((a < b) ? a : b)
    573   1.49       sjg #endif
    574   1.49       sjg #ifndef MAX
    575   1.49       sjg #define MAX(a, b) ((a > b) ? a : b)
    576   1.46  christos #endif
    577    1.3       cgd 
    578   1.96     pooka /* At least GNU/Hurd systems lack hardcoded MAXPATHLEN/PATH_MAX */
    579   1.96     pooka #include <limits.h>
    580   1.96     pooka #ifndef MAXPATHLEN
    581   1.96     pooka #define MAXPATHLEN	4096
    582   1.96     pooka #endif
    583   1.96     pooka #ifndef PATH_MAX
    584   1.96     pooka #define PATH_MAX	MAXPATHLEN
    585   1.96     pooka #endif
    586   1.96     pooka 
    587  1.103       sjg #if defined(SYSV)
    588  1.103       sjg #define KILLPG(pid, sig)	kill(-(pid), (sig))
    589  1.103       sjg #else
    590  1.103       sjg #define KILLPG(pid, sig)	killpg((pid), (sig))
    591  1.103       sjg #endif
    592  1.103       sjg 
    593  1.116    rillig #endif /* MAKE_MAKE_H */
    594