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