Home | History | Annotate | Line # | Download | only in make
      1  1.361    rillig /*	$NetBSD: make.h,v 1.361 2025/07/06 07:11:31 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.244    rillig /*
     76    1.1       cgd  * make.h --
     77  1.290    rillig  *	The global definitions for make
     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.259    rillig #if defined(__GNUC__)
    105  1.230    rillig #define MAKE_GNUC_PREREQ(x, y)						\
    106   1.52      yamt 	((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) ||			\
    107   1.52      yamt 	 (__GNUC__ > (x)))
    108  1.278    rillig #else
    109  1.230    rillig #define MAKE_GNUC_PREREQ(x, y)	0
    110  1.278    rillig #endif
    111   1.52      yamt 
    112  1.340    rillig #if MAKE_GNUC_PREREQ(2, 7) || lint
    113  1.230    rillig #define MAKE_ATTR_UNUSED	__attribute__((__unused__))
    114   1.51       jmc #else
    115  1.230    rillig #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.230    rillig #define MAKE_ATTR_DEAD		__attribute__((__noreturn__))
    120   1.89     joerg #elif defined(__GNUC__)
    121  1.230    rillig #define MAKE_ATTR_DEAD		__volatile
    122   1.89     joerg #else
    123  1.230    rillig #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.273    rillig #if MAKE_GNUC_PREREQ(4, 0)
    134  1.278    rillig #define MAKE_ATTR_USE		__attribute__((__warn_unused_result__))
    135  1.273    rillig #else
    136  1.278    rillig #define MAKE_ATTR_USE		/* delete */
    137  1.273    rillig #endif
    138  1.273    rillig 
    139  1.332    rillig #if MAKE_GNUC_PREREQ(8, 0)
    140  1.332    rillig #define MAKE_ATTR_NOINLINE		__attribute__((__noinline__))
    141  1.332    rillig #else
    142  1.332    rillig #define MAKE_ATTR_NOINLINE		/* delete */
    143  1.332    rillig #endif
    144  1.332    rillig 
    145  1.299    rillig #if __STDC_VERSION__ >= 199901L || defined(lint)
    146  1.205    rillig #define MAKE_INLINE static inline MAKE_ATTR_UNUSED
    147  1.298    rillig #else
    148  1.298    rillig #define MAKE_INLINE static MAKE_ATTR_UNUSED
    149  1.298    rillig #endif
    150  1.264    rillig 
    151  1.264    rillig /* MAKE_STATIC marks a function that may or may not be inlined. */
    152  1.264    rillig #if defined(lint)
    153  1.264    rillig /* As of 2021-07-31, NetBSD lint ignores __attribute__((unused)). */
    154  1.264    rillig #define MAKE_STATIC MAKE_INLINE
    155  1.264    rillig #else
    156  1.262    rillig #define MAKE_STATIC static MAKE_ATTR_UNUSED
    157  1.264    rillig #endif
    158  1.205    rillig 
    159  1.257    rillig #if __STDC_VERSION__ >= 199901L || defined(lint) || defined(USE_C99_BOOLEAN)
    160  1.235    rillig #include <stdbool.h>
    161  1.265    rillig #elif defined(__bool_true_false_are_defined)
    162  1.265    rillig /*
    163  1.265    rillig  * All files of make must be compiled with the same definition of bool.
    164  1.265    rillig  * Since one of the files includes <stdbool.h>, that means the header is
    165  1.265    rillig  * available on this platform.  Recompile everything with -DUSE_C99_BOOLEAN.
    166  1.265    rillig  */
    167  1.265    rillig #error "<stdbool.h> is included in pre-C99 mode"
    168  1.265    rillig #elif defined(bool) || defined(true) || defined(false)
    169  1.265    rillig /*
    170  1.265    rillig  * In pre-C99 mode, make does not expect that bool is already defined.
    171  1.265    rillig  * You need to ensure that all translation units use the same definition for
    172  1.265    rillig  * bool.
    173  1.265    rillig  */
    174  1.265    rillig #error "bool/true/false is defined in pre-C99 mode"
    175  1.130    rillig #else
    176  1.265    rillig typedef unsigned char bool;
    177  1.257    rillig #define true	1
    178  1.257    rillig #define false	0
    179  1.140    rillig #endif
    180  1.127    rillig 
    181  1.349    rillig /*
    182  1.349    rillig  * In code coverage mode with gcc>=12, calling vfork/exec does not mark any
    183  1.349    rillig  * further code from the parent process as covered. gcc-10.5.0 is fine, as
    184  1.349    rillig  * are fork/exec calls, as well as posix_spawn.
    185  1.349    rillig  */
    186  1.349    rillig #ifndef FORK_FUNCTION
    187  1.349    rillig #define FORK_FUNCTION vfork
    188  1.349    rillig #endif
    189  1.349    rillig 
    190    1.1       cgd #include "lst.h"
    191  1.261    rillig #include "make_malloc.h"
    192  1.261    rillig #include "str.h"
    193   1.22   mycroft #include "hash.h"
    194    1.1       cgd #include "config.h"
    195    1.3       cgd #include "buf.h"
    196    1.1       cgd 
    197  1.216    rillig /*
    198  1.216    rillig  * The typical flow of states is:
    199  1.216    rillig  *
    200  1.216    rillig  * The direct successful path:
    201  1.216    rillig  * UNMADE -> BEINGMADE -> MADE.
    202  1.216    rillig  *
    203  1.216    rillig  * The direct error path:
    204  1.216    rillig  * UNMADE -> BEINGMADE -> ERROR.
    205  1.216    rillig  *
    206  1.216    rillig  * The successful path when dependencies need to be made first:
    207  1.216    rillig  * UNMADE -> DEFERRED -> REQUESTED -> BEINGMADE -> MADE.
    208  1.216    rillig  *
    209  1.216    rillig  * A node that has dependencies, and one of the dependencies cannot be made:
    210  1.216    rillig  * UNMADE -> DEFERRED -> ABORTED.
    211  1.216    rillig  *
    212  1.216    rillig  * A node that turns out to be up-to-date:
    213  1.216    rillig  * UNMADE -> BEINGMADE -> UPTODATE.
    214  1.216    rillig  */
    215  1.181    rillig typedef enum GNodeMade {
    216  1.219    rillig 	/* Not examined yet. */
    217  1.219    rillig 	UNMADE,
    218  1.277    rillig 	/*
    219  1.277    rillig 	 * The node has been examined but is not yet ready since its
    220  1.277    rillig 	 * dependencies have to be made first.
    221  1.277    rillig 	 */
    222  1.219    rillig 	DEFERRED,
    223  1.219    rillig 
    224  1.219    rillig 	/* The node is on the toBeMade list. */
    225  1.219    rillig 	REQUESTED,
    226  1.219    rillig 
    227  1.277    rillig 	/*
    228  1.277    rillig 	 * The node is already being made. Trying to build a node in this
    229  1.277    rillig 	 * state indicates a cycle in the graph.
    230  1.277    rillig 	 */
    231  1.219    rillig 	BEINGMADE,
    232  1.219    rillig 
    233  1.219    rillig 	/* Was out-of-date and has been made. */
    234  1.219    rillig 	MADE,
    235  1.219    rillig 	/* Was already up-to-date, does not need to be made. */
    236  1.219    rillig 	UPTODATE,
    237  1.277    rillig 	/*
    238  1.277    rillig 	 * An error occurred while it was being made. Used only in compat
    239  1.277    rillig 	 * mode.
    240  1.277    rillig 	 */
    241  1.219    rillig 	ERROR,
    242  1.277    rillig 	/*
    243  1.277    rillig 	 * The target was aborted due to an error making a dependency. Used
    244  1.277    rillig 	 * only in compat mode.
    245  1.277    rillig 	 */
    246  1.219    rillig 	ABORTED
    247  1.119    rillig } GNodeMade;
    248    1.1       cgd 
    249  1.241    rillig /*
    250  1.241    rillig  * The OP_ constants are used when parsing a dependency line as a way of
    251  1.120    rillig  * communicating to other parts of the program the way in which a target
    252  1.120    rillig  * should be made.
    253  1.120    rillig  *
    254  1.241    rillig  * Some of the OP_ constants can be combined, others cannot.
    255  1.263    rillig  *
    256  1.263    rillig  * See the tests depsrc-*.mk and deptgt-*.mk.
    257  1.241    rillig  */
    258  1.159    rillig typedef enum GNodeType {
    259  1.219    rillig 	OP_NONE		= 0,
    260  1.209    rillig 
    261  1.277    rillig 	/*
    262  1.277    rillig 	 * The dependency operator ':' is the most common one.  The commands
    263  1.277    rillig 	 * of this node are executed if any child is out-of-date.
    264  1.277    rillig 	 */
    265  1.219    rillig 	OP_DEPENDS	= 1 << 0,
    266  1.277    rillig 	/*
    267  1.277    rillig 	 * The dependency operator '!' always executes its commands, even if
    268  1.277    rillig 	 * its children are up-to-date.
    269  1.277    rillig 	 */
    270  1.219    rillig 	OP_FORCE	= 1 << 1,
    271  1.277    rillig 	/*
    272  1.277    rillig 	 * The dependency operator '::' behaves like ':', except that it
    273  1.219    rillig 	 * allows multiple dependency groups to be defined.  Each of these
    274  1.277    rillig 	 * groups is executed on its own, independently from the others. Each
    275  1.277    rillig 	 * individual dependency group is called a cohort.
    276  1.277    rillig 	 */
    277  1.219    rillig 	OP_DOUBLEDEP	= 1 << 2,
    278  1.219    rillig 
    279  1.219    rillig 	/* Matches the dependency operators ':', '!' and '::'. */
    280  1.219    rillig 	OP_OPMASK	= OP_DEPENDS | OP_FORCE | OP_DOUBLEDEP,
    281  1.219    rillig 
    282  1.219    rillig 	/* Don't care if the target doesn't exist and can't be created. */
    283  1.219    rillig 	OP_OPTIONAL	= 1 << 3,
    284  1.219    rillig 	/* Use associated commands for parents. */
    285  1.219    rillig 	OP_USE		= 1 << 4,
    286  1.277    rillig 	/*
    287  1.277    rillig 	 * Target is never out of date, but always execute commands anyway.
    288  1.277    rillig 	 * Its time doesn't matter, so it has none...sort of.
    289  1.277    rillig 	 */
    290  1.219    rillig 	OP_EXEC		= 1 << 5,
    291  1.277    rillig 	/*
    292  1.277    rillig 	 * Ignore non-zero exit status from shell commands when creating the
    293  1.277    rillig 	 * node.
    294  1.277    rillig 	 */
    295  1.219    rillig 	OP_IGNORE	= 1 << 6,
    296  1.219    rillig 	/* Don't remove the target when interrupted. */
    297  1.219    rillig 	OP_PRECIOUS	= 1 << 7,
    298  1.219    rillig 	/* Don't echo commands when executed. */
    299  1.219    rillig 	OP_SILENT	= 1 << 8,
    300  1.277    rillig 	/*
    301  1.277    rillig 	 * Target is a recursive make so its commands should always be
    302  1.277    rillig 	 * executed when it is out of date, regardless of the state of the -n
    303  1.277    rillig 	 * or -t flags.
    304  1.277    rillig 	 */
    305  1.219    rillig 	OP_MAKE		= 1 << 9,
    306  1.277    rillig 	/*
    307  1.277    rillig 	 * Target is out-of-date only if any of its children was out-of-date.
    308  1.277    rillig 	 */
    309  1.219    rillig 	OP_JOIN		= 1 << 10,
    310  1.219    rillig 	/* Assume the children of the node have been already made. */
    311  1.219    rillig 	OP_MADE		= 1 << 11,
    312  1.219    rillig 	/* Special .BEGIN, .END or .INTERRUPT. */
    313  1.219    rillig 	OP_SPECIAL	= 1 << 12,
    314  1.219    rillig 	/* Like .USE, only prepend commands. */
    315  1.219    rillig 	OP_USEBEFORE	= 1 << 13,
    316  1.277    rillig 	/*
    317  1.277    rillig 	 * The node is invisible to its parents. I.e. it doesn't show up in
    318  1.277    rillig 	 * the parents' local variables (.IMPSRC, .ALLSRC).
    319  1.277    rillig 	 */
    320  1.219    rillig 	OP_INVISIBLE	= 1 << 14,
    321  1.277    rillig 	/*
    322  1.277    rillig 	 * The node does not become the main target, even if it is the first
    323  1.277    rillig 	 * target in the first makefile.
    324  1.277    rillig 	 */
    325  1.219    rillig 	OP_NOTMAIN	= 1 << 15,
    326  1.219    rillig 	/* Not a file target; run always. */
    327  1.219    rillig 	OP_PHONY	= 1 << 16,
    328  1.219    rillig 	/* Don't search for the file in the path. */
    329  1.219    rillig 	OP_NOPATH	= 1 << 17,
    330  1.277    rillig 	/*
    331  1.277    rillig 	 * In a dependency line "target: source1 .WAIT source2", source1 is
    332  1.219    rillig 	 * made first, including its children.  Once that is finished,
    333  1.219    rillig 	 * source2 is made, including its children.  The .WAIT keyword may
    334  1.277    rillig 	 * appear more than once in a single dependency declaration.
    335  1.277    rillig 	 */
    336  1.219    rillig 	OP_WAIT		= 1 << 18,
    337  1.219    rillig 	/* .NOMETA do not create a .meta file */
    338  1.219    rillig 	OP_NOMETA	= 1 << 19,
    339  1.219    rillig 	/* .META we _do_ want a .meta file */
    340  1.219    rillig 	OP_META		= 1 << 20,
    341  1.219    rillig 	/* Do not compare commands in .meta file */
    342  1.219    rillig 	OP_NOMETA_CMP	= 1 << 21,
    343  1.219    rillig 	/* Possibly a submake node */
    344  1.219    rillig 	OP_SUBMAKE	= 1 << 22,
    345  1.219    rillig 
    346  1.219    rillig 	/* Attributes applied by PMake */
    347  1.219    rillig 
    348  1.219    rillig 	/* The node is a transformation rule, such as ".c.o". */
    349  1.219    rillig 	OP_TRANSFORM	= 1 << 30,
    350  1.219    rillig 	/* Target is a member of an archive */
    351  1.219    rillig 	/* XXX: How does this differ from OP_ARCHV? */
    352  1.219    rillig 	OP_MEMBER	= 1 << 29,
    353  1.277    rillig 	/*
    354  1.277    rillig 	 * The node is a library, its name has the form "-l<libname>".
    355  1.277    rillig 	 */
    356  1.219    rillig 	OP_LIB		= 1 << 28,
    357  1.277    rillig 	/*
    358  1.277    rillig 	 * The node is an archive member, its name has the form
    359  1.277    rillig 	 * "archive(member)".
    360  1.277    rillig 	 */
    361  1.219    rillig 	/* XXX: How does this differ from OP_MEMBER? */
    362  1.219    rillig 	OP_ARCHV	= 1 << 27,
    363  1.277    rillig 	/*
    364  1.277    rillig 	 * Target has all the commands it should. Used when parsing to catch
    365  1.219    rillig 	 * multiple command groups for a target.  Only applies to the
    366  1.277    rillig 	 * dependency operators ':' and '!', but not to '::'.
    367  1.277    rillig 	 */
    368  1.219    rillig 	OP_HAS_COMMANDS	= 1 << 26,
    369  1.277    rillig 	/*
    370  1.277    rillig 	 * The special command "..." has been seen. All further commands from
    371  1.277    rillig 	 * this node will be saved on the .END node instead, to be executed
    372  1.277    rillig 	 * at the very end.
    373  1.277    rillig 	 */
    374  1.219    rillig 	OP_SAVE_CMDS	= 1 << 25,
    375  1.277    rillig 	/*
    376  1.277    rillig 	 * Already processed by Suff_FindDeps, to find dependencies from
    377  1.277    rillig 	 * suffix transformation rules.
    378  1.277    rillig 	 */
    379  1.219    rillig 	OP_DEPS_FOUND	= 1 << 24,
    380  1.219    rillig 	/* Node found while expanding .ALLSRC */
    381  1.298    rillig 	OP_MARK		= 1 << 23
    382  1.120    rillig } GNodeType;
    383  1.120    rillig 
    384  1.269    rillig typedef struct GNodeFlags {
    385  1.219    rillig 	/* this target needs to be (re)made */
    386  1.268    rillig 	bool remake:1;
    387  1.219    rillig 	/* children of this target were made */
    388  1.268    rillig 	bool childMade:1;
    389  1.219    rillig 	/* children don't exist, and we pretend made */
    390  1.268    rillig 	bool force:1;
    391  1.219    rillig 	/* Set by Make_ProcessWait() */
    392  1.268    rillig 	bool doneWait:1;
    393  1.219    rillig 	/* Build requested by .ORDER processing */
    394  1.268    rillig 	bool doneOrder:1;
    395  1.219    rillig 	/* Node created from .depend */
    396  1.268    rillig 	bool fromDepend:1;
    397  1.219    rillig 	/* We do it once only */
    398  1.268    rillig 	bool doneAllsrc:1;
    399  1.219    rillig 	/* Used by MakePrintStatus */
    400  1.268    rillig 	bool cycle:1;
    401  1.219    rillig 	/* Used by MakePrintStatus */
    402  1.268    rillig 	bool doneCycle:1;
    403  1.119    rillig } GNodeFlags;
    404    1.1       cgd 
    405  1.143    rillig typedef struct List StringList;
    406  1.143    rillig typedef struct ListNode StringListNode;
    407  1.144    rillig 
    408  1.143    rillig typedef struct List GNodeList;
    409  1.143    rillig typedef struct ListNode GNodeListNode;
    410  1.143    rillig 
    411  1.246    rillig typedef struct SearchPath {
    412  1.246    rillig 	List /* of CachedDir */ dirs;
    413  1.246    rillig } SearchPath;
    414  1.144    rillig 
    415  1.241    rillig /*
    416  1.241    rillig  * A graph node represents a target that can possibly be made, including its
    417  1.331    rillig  * relation to other targets.
    418  1.241    rillig  */
    419  1.119    rillig typedef struct GNode {
    420  1.219    rillig 	/* The target's name, such as "clean" or "make.c" */
    421  1.219    rillig 	char *name;
    422  1.219    rillig 	/* The unexpanded name of a .USE node */
    423  1.219    rillig 	char *uname;
    424  1.277    rillig 	/*
    425  1.277    rillig 	 * The full pathname of the file belonging to the target.
    426  1.277    rillig 	 *
    427  1.219    rillig 	 * XXX: What about .PHONY targets? These don't have an associated
    428  1.277    rillig 	 * path.
    429  1.277    rillig 	 */
    430  1.219    rillig 	char *path;
    431  1.219    rillig 
    432  1.277    rillig 	/*
    433  1.277    rillig 	 * The type of operator used to define the sources (see the OP flags
    434  1.219    rillig 	 * below).
    435  1.277    rillig 	 *
    436  1.277    rillig 	 * XXX: This looks like a wild mixture of type and flags.
    437  1.277    rillig 	 */
    438  1.219    rillig 	GNodeType type;
    439  1.219    rillig 	GNodeFlags flags;
    440  1.219    rillig 
    441  1.219    rillig 	/* The state of processing on this node */
    442  1.219    rillig 	GNodeMade made;
    443  1.219    rillig 	/* The number of unmade children */
    444  1.219    rillig 	int unmade;
    445  1.219    rillig 
    446  1.277    rillig 	/*
    447  1.277    rillig 	 * The modification time; 0 means the node does not have a
    448  1.277    rillig 	 * corresponding file; see GNode_IsOODate.
    449  1.277    rillig 	 */
    450  1.219    rillig 	time_t mtime;
    451  1.219    rillig 	struct GNode *youngestChild;
    452  1.219    rillig 
    453  1.277    rillig 	/*
    454  1.277    rillig 	 * The GNodes for which this node is an implied source. May be empty.
    455  1.277    rillig 	 * For example, when there is an inference rule for .c.o, the node
    456  1.277    rillig 	 * for file.c has the node for file.o in this list.
    457  1.277    rillig 	 */
    458  1.225    rillig 	GNodeList implicitParents;
    459  1.219    rillig 
    460  1.277    rillig 	/*
    461  1.277    rillig 	 * The nodes that depend on this one, or in other words, the nodes
    462  1.277    rillig 	 * for which this is a source.
    463  1.277    rillig 	 */
    464  1.222    rillig 	GNodeList parents;
    465  1.219    rillig 	/* The nodes on which this one depends. */
    466  1.222    rillig 	GNodeList children;
    467  1.219    rillig 
    468  1.277    rillig 	/*
    469  1.277    rillig 	 * .ORDER nodes we need made. The nodes that must be made (if they're
    470  1.219    rillig 	 * made) before this node can be made, but that do not enter into the
    471  1.277    rillig 	 * datedness of this node.
    472  1.277    rillig 	 */
    473  1.223    rillig 	GNodeList order_pred;
    474  1.277    rillig 	/*
    475  1.277    rillig 	 * .ORDER nodes who need us. The nodes that must be made (if they're
    476  1.219    rillig 	 * made at all) after this node is made, but that do not depend on
    477  1.277    rillig 	 * this node, in the normal sense.
    478  1.277    rillig 	 */
    479  1.223    rillig 	GNodeList order_succ;
    480  1.219    rillig 
    481  1.245    rillig 	/*
    482  1.245    rillig 	 * Other nodes of the same name, for targets that were defined using
    483  1.245    rillig 	 * the '::' dependency operator (OP_DOUBLEDEP).
    484  1.245    rillig 	 */
    485  1.224    rillig 	GNodeList cohorts;
    486  1.219    rillig 	/* The "#n" suffix for this cohort, or "" for other nodes */
    487  1.219    rillig 	char cohort_num[8];
    488  1.219    rillig 	/* The number of unmade instances on the cohorts list */
    489  1.219    rillig 	int unmade_cohorts;
    490  1.277    rillig 	/*
    491  1.277    rillig 	 * Pointer to the first instance of a '::' node; only set when on a
    492  1.277    rillig 	 * cohorts list
    493  1.277    rillig 	 */
    494  1.219    rillig 	struct GNode *centurion;
    495  1.219    rillig 
    496  1.219    rillig 	/* Last time (sequence number) we tried to make this node */
    497  1.353    rillig 	unsigned checked_seqno;
    498  1.219    rillig 
    499  1.252    rillig 	/*
    500  1.252    rillig 	 * The "local" variables that are specific to this target and this
    501  1.219    rillig 	 * target only, such as $@, $<, $?.
    502  1.219    rillig 	 *
    503  1.252    rillig 	 * Also used for the global variable scopes SCOPE_GLOBAL,
    504  1.252    rillig 	 * SCOPE_CMDLINE, SCOPE_INTERNAL, which contain variables with
    505  1.252    rillig 	 * arbitrary names.
    506  1.252    rillig 	 */
    507  1.219    rillig 	HashTable /* of Var pointer */ vars;
    508  1.219    rillig 
    509  1.219    rillig 	/* The commands to be given to a shell to create this target. */
    510  1.221    rillig 	StringList commands;
    511  1.219    rillig 
    512  1.277    rillig 	/*
    513  1.277    rillig 	 * Suffix for the node (determined by Suff_FindDeps and opaque to
    514  1.277    rillig 	 * everyone but the Suff module)
    515  1.277    rillig 	 */
    516  1.219    rillig 	struct Suffix *suffix;
    517  1.219    rillig 
    518  1.271    rillig 	/* Filename where the GNode got defined, unlimited lifetime */
    519  1.219    rillig 	const char *fname;
    520  1.285    rillig 	/* Line number where the GNode got defined, 1-based */
    521  1.297    rillig 	unsigned lineno;
    522  1.329       sjg 	int exit_status;
    523    1.1       cgd } GNode;
    524    1.1       cgd 
    525  1.300    rillig /*
    526  1.300    rillig  * Keep track of whether to include <posix.mk> when parsing the line
    527  1.300    rillig  * '.POSIX:'.
    528  1.300    rillig  */
    529  1.300    rillig extern enum PosixState {
    530  1.300    rillig 	PS_NOT_YET,
    531  1.300    rillig 	PS_MAYBE_NEXT_LINE,
    532  1.300    rillig 	PS_NOW_OR_NEVER,
    533  1.352       sjg 	PS_SET,
    534  1.300    rillig 	PS_TOO_LATE
    535  1.300    rillig } posix_state;
    536  1.300    rillig 
    537  1.188    rillig /* Error levels for diagnostics during parsing. */
    538  1.167    rillig typedef enum ParseErrorLevel {
    539  1.277    rillig 	/*
    540  1.277    rillig 	 * Exit when the current top-level makefile has been parsed
    541  1.277    rillig 	 * completely.
    542  1.277    rillig 	 */
    543  1.219    rillig 	PARSE_FATAL = 1,
    544  1.219    rillig 	/* Print "warning"; may be upgraded to fatal by the -w option. */
    545  1.219    rillig 	PARSE_WARNING,
    546  1.219    rillig 	/* Informational, mainly used during development of makefiles. */
    547  1.219    rillig 	PARSE_INFO
    548  1.167    rillig } ParseErrorLevel;
    549    1.1       cgd 
    550    1.1       cgd /*
    551  1.141    rillig  * Values returned by Cond_EvalLine and Cond_EvalCondition.
    552    1.1       cgd  */
    553  1.284    rillig typedef enum CondResult {
    554  1.283    rillig 	CR_TRUE,		/* Parse the next lines */
    555  1.283    rillig 	CR_FALSE,		/* Skip the next lines */
    556  1.283    rillig 	CR_ERROR		/* Unknown directive or parse error */
    557  1.284    rillig } CondResult;
    558    1.1       cgd 
    559  1.323    rillig typedef struct {
    560  1.323    rillig 	enum GuardKind {
    561  1.323    rillig 		GK_VARIABLE,
    562  1.323    rillig 		GK_TARGET
    563  1.323    rillig 	} kind;
    564  1.323    rillig 	char *name;
    565  1.323    rillig } Guard;
    566  1.323    rillig 
    567  1.190    rillig /* Names of the variables that are "local" to a specific target. */
    568  1.277    rillig #define TARGET	"@"		/* Target of dependency */
    569  1.277    rillig #define OODATE	"?"		/* All out-of-date sources */
    570  1.277    rillig #define ALLSRC	">"		/* All sources */
    571  1.277    rillig #define IMPSRC	"<"		/* Source implied by transformation */
    572  1.277    rillig #define PREFIX	"*"		/* Common prefix */
    573  1.277    rillig #define ARCHIVE	"!"		/* Archive in "archive(member)" syntax */
    574  1.277    rillig #define MEMBER	"%"		/* Member in "archive(member)" syntax */
    575  1.148    rillig 
    576    1.1       cgd /*
    577   1.11  christos  * Global Variables
    578    1.1       cgd  */
    579    1.1       cgd 
    580  1.190    rillig /* True if every target is precious */
    581  1.257    rillig extern bool allPrecious;
    582  1.190    rillig /* True if failed targets should be deleted */
    583  1.257    rillig extern bool deleteOnError;
    584  1.257    rillig /* true while processing .depend */
    585  1.257    rillig extern bool doing_depend;
    586  1.190    rillig /* .DEFAULT rule */
    587  1.207    rillig extern GNode *defaultNode;
    588  1.190    rillig 
    589  1.241    rillig /*
    590  1.241    rillig  * Variables defined internally by make which should not override those set
    591  1.241    rillig  * by makefiles.
    592  1.241    rillig  */
    593  1.252    rillig extern GNode *SCOPE_INTERNAL;
    594  1.255    rillig /* Variables defined in a global scope, e.g in the makefile itself. */
    595  1.252    rillig extern GNode *SCOPE_GLOBAL;
    596  1.190    rillig /* Variables defined on the command line. */
    597  1.252    rillig extern GNode *SCOPE_CMDLINE;
    598  1.190    rillig 
    599  1.241    rillig /*
    600  1.331    rillig  * Value returned by Var_Parse when an error is encountered. It points to an
    601  1.331    rillig  * empty string, so naive callers needn't worry about it.
    602  1.241    rillig  */
    603  1.190    rillig extern char var_Error[];
    604  1.190    rillig 
    605  1.190    rillig /* The time at the start of this whole process */
    606  1.190    rillig extern time_t now;
    607    1.1       cgd 
    608  1.241    rillig /*
    609  1.241    rillig  * The list of directories to search when looking for targets (set by the
    610  1.241    rillig  * special target .PATH).
    611  1.241    rillig  */
    612  1.229    rillig extern SearchPath dirSearchPath;
    613  1.186    rillig /* Used for .include "...". */
    614  1.186    rillig extern SearchPath *parseIncPath;
    615  1.241    rillig /*
    616  1.249    rillig  * Used for .include <...>, for the built-in sys.mk and for makefiles from
    617  1.249    rillig  * the command line arguments.
    618  1.241    rillig  */
    619  1.186    rillig extern SearchPath *sysIncPath;
    620  1.186    rillig /* The default for sysIncPath. */
    621  1.186    rillig extern SearchPath *defSysIncPath;
    622   1.32  christos 
    623  1.191    rillig /* Startup directory */
    624  1.191    rillig extern char curdir[];
    625  1.191    rillig /* The basename of the program name, suffixed with [n] for sub-makes.  */
    626  1.234    rillig extern const char *progname;
    627  1.248    rillig extern int makelevel;
    628  1.191    rillig /* Name of the .depend makefile */
    629  1.191    rillig extern char *makeDependfile;
    630  1.187    rillig /* If we replaced environ, this will be non-NULL. */
    631  1.187    rillig extern char **savedEnv;
    632  1.287    rillig extern GNode *mainNode;
    633   1.30  sommerfe 
    634  1.190    rillig extern pid_t myPid;
    635   1.82       sjg 
    636  1.219    rillig #define MAKEFLAGS	".MAKEFLAGS"
    637   1.91       sjg #ifndef MAKE_LEVEL_ENV
    638   1.91       sjg # define MAKE_LEVEL_ENV	"MAKELEVEL"
    639   1.91       sjg #endif
    640    1.1       cgd 
    641  1.272    rillig typedef struct DebugFlags {
    642  1.275    rillig 	bool DEBUG_ARCH:1;
    643  1.275    rillig 	bool DEBUG_COND:1;
    644  1.275    rillig 	bool DEBUG_CWD:1;
    645  1.275    rillig 	bool DEBUG_DIR:1;
    646  1.275    rillig 	bool DEBUG_ERROR:1;
    647  1.275    rillig 	bool DEBUG_FOR:1;
    648  1.275    rillig 	bool DEBUG_GRAPH1:1;
    649  1.275    rillig 	bool DEBUG_GRAPH2:1;
    650  1.275    rillig 	bool DEBUG_GRAPH3:1;
    651  1.275    rillig 	bool DEBUG_HASH:1;
    652  1.275    rillig 	bool DEBUG_JOB:1;
    653  1.275    rillig 	bool DEBUG_LOUD:1;
    654  1.275    rillig 	bool DEBUG_MAKE:1;
    655  1.275    rillig 	bool DEBUG_META:1;
    656  1.275    rillig 	bool DEBUG_PARSE:1;
    657  1.275    rillig 	bool DEBUG_SCRIPT:1;
    658  1.275    rillig 	bool DEBUG_SHELL:1;
    659  1.275    rillig 	bool DEBUG_SUFF:1;
    660  1.275    rillig 	bool DEBUG_TARG:1;
    661  1.275    rillig 	bool DEBUG_VAR:1;
    662  1.170    rillig } DebugFlags;
    663  1.170    rillig 
    664  1.219    rillig #define CONCAT(a, b) a##b
    665    1.1       cgd 
    666  1.272    rillig #define DEBUG(module) (opts.debug.CONCAT(DEBUG_, module))
    667    1.1       cgd 
    668  1.151    rillig void debug_printf(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
    669  1.150    rillig 
    670  1.232    rillig #define DEBUG_IMPL(module, args) \
    671  1.232    rillig 	do { \
    672  1.232    rillig 		if (DEBUG(module)) \
    673  1.232    rillig 			debug_printf args; \
    674  1.266    rillig 	} while (false)
    675  1.232    rillig 
    676  1.296    rillig #define DEBUG0(module, fmt) \
    677  1.296    rillig 	DEBUG_IMPL(module, (fmt))
    678  1.149    rillig #define DEBUG1(module, fmt, arg1) \
    679  1.232    rillig 	DEBUG_IMPL(module, (fmt, arg1))
    680  1.149    rillig #define DEBUG2(module, fmt, arg1, arg2) \
    681  1.232    rillig 	DEBUG_IMPL(module, (fmt, arg1, arg2))
    682  1.149    rillig #define DEBUG3(module, fmt, arg1, arg2, arg3) \
    683  1.232    rillig 	DEBUG_IMPL(module, (fmt, arg1, arg2, arg3))
    684  1.149    rillig #define DEBUG4(module, fmt, arg1, arg2, arg3, arg4) \
    685  1.232    rillig 	DEBUG_IMPL(module, (fmt, arg1, arg2, arg3, arg4))
    686  1.149    rillig #define DEBUG5(module, fmt, arg1, arg2, arg3, arg4, arg5) \
    687  1.232    rillig 	DEBUG_IMPL(module, (fmt, arg1, arg2, arg3, arg4, arg5))
    688  1.149    rillig 
    689  1.173    rillig typedef enum PrintVarsMode {
    690  1.219    rillig 	PVM_NONE,
    691  1.219    rillig 	PVM_UNEXPANDED,
    692  1.219    rillig 	PVM_EXPANDED
    693  1.173    rillig } PrintVarsMode;
    694  1.173    rillig 
    695  1.173    rillig /* Command line options */
    696  1.173    rillig typedef struct CmdOpts {
    697  1.331    rillig 	/* -B: whether to be compatible to traditional make */
    698  1.257    rillig 	bool compatMake;
    699  1.173    rillig 
    700  1.277    rillig 	/*
    701  1.331    rillig 	 * -d: debug control: There is one flag per module.  It is up to the
    702  1.277    rillig 	 * module what debug information to print.
    703  1.277    rillig 	 */
    704  1.219    rillig 	DebugFlags debug;
    705  1.173    rillig 
    706  1.348    rillig 	/* -dF: debug output is written here - default stderr */
    707  1.219    rillig 	FILE *debug_file;
    708  1.173    rillig 
    709  1.277    rillig 	/*
    710  1.277    rillig 	 * -dL: lint mode
    711  1.219    rillig 	 *
    712  1.219    rillig 	 * Runs make in strict mode, with additional checks and better error
    713  1.277    rillig 	 * handling.
    714  1.277    rillig 	 */
    715  1.257    rillig 	bool strict;
    716  1.204    rillig 
    717  1.219    rillig 	/* -dV: for the -V option, print unexpanded variable values */
    718  1.257    rillig 	bool debugVflag;
    719  1.174    rillig 
    720  1.219    rillig 	/* -e: check environment variables before global variables */
    721  1.257    rillig 	bool checkEnvFirst;
    722  1.173    rillig 
    723  1.219    rillig 	/* -f: the makefiles to read */
    724  1.226    rillig 	StringList makefiles;
    725  1.173    rillig 
    726  1.219    rillig 	/* -i: if true, ignore all errors from shell commands */
    727  1.257    rillig 	bool ignoreErrors;
    728  1.173    rillig 
    729  1.277    rillig 	/*
    730  1.277    rillig 	 * -j: the maximum number of jobs that can run in parallel; this is
    731  1.277    rillig 	 * coordinated with the submakes
    732  1.277    rillig 	 */
    733  1.219    rillig 	int maxJobs;
    734  1.173    rillig 
    735  1.277    rillig 	/*
    736  1.277    rillig 	 * -k: if true and an error occurs while making a node, continue
    737  1.277    rillig 	 * making nodes that do not depend on the erroneous node
    738  1.277    rillig 	 */
    739  1.257    rillig 	bool keepgoing;
    740  1.173    rillig 
    741  1.219    rillig 	/* -N: execute no commands from the targets */
    742  1.257    rillig 	bool noRecursiveExecute;
    743  1.173    rillig 
    744  1.219    rillig 	/* -n: execute almost no commands from the targets */
    745  1.257    rillig 	bool noExecute;
    746  1.173    rillig 
    747  1.250    rillig 	/*
    748  1.250    rillig 	 * -q: if true, do not really make anything, just see if the targets
    749  1.250    rillig 	 * are out-of-date
    750  1.250    rillig 	 */
    751  1.279    rillig 	bool query;
    752  1.173    rillig 
    753  1.250    rillig 	/* -r: raw mode, do not load the builtin rules. */
    754  1.257    rillig 	bool noBuiltins;
    755  1.173    rillig 
    756  1.219    rillig 	/* -s: don't echo the shell commands before executing them */
    757  1.279    rillig 	bool silent;
    758  1.173    rillig 
    759  1.277    rillig 	/*
    760  1.277    rillig 	 * -t: touch the targets if they are out-of-date, but don't actually
    761  1.277    rillig 	 * make them
    762  1.277    rillig 	 */
    763  1.279    rillig 	bool touch;
    764  1.173    rillig 
    765  1.219    rillig 	/* -[Vv]: print expanded or unexpanded selected variables */
    766  1.219    rillig 	PrintVarsMode printVars;
    767  1.219    rillig 	/* -[Vv]: the variables to print */
    768  1.227    rillig 	StringList variables;
    769  1.173    rillig 
    770  1.219    rillig 	/* -W: if true, makefile parsing warnings are treated as errors */
    771  1.257    rillig 	bool parseWarnFatal;
    772  1.173    rillig 
    773  1.250    rillig 	/* -w: print 'Entering' and 'Leaving' for submakes */
    774  1.257    rillig 	bool enterFlag;
    775  1.173    rillig 
    776  1.277    rillig 	/*
    777  1.277    rillig 	 * -X: if true, do not export variables set on the command line to
    778  1.277    rillig 	 * the environment.
    779  1.277    rillig 	 */
    780  1.257    rillig 	bool varNoExportEnv;
    781  1.173    rillig 
    782  1.277    rillig 	/*
    783  1.277    rillig 	 * The target names specified on the command line. Used to resolve
    784  1.277    rillig 	 * .if make(...) statements.
    785  1.277    rillig 	 */
    786  1.228    rillig 	StringList create;
    787  1.173    rillig 
    788  1.302    rillig 	/*
    789  1.302    rillig 	 * Randomize the order in which the targets from toBeMade are made,
    790  1.302    rillig 	 * to catch undeclared dependencies.
    791  1.302    rillig 	 */
    792  1.302    rillig 	bool randomizeTargets;
    793  1.173    rillig } CmdOpts;
    794  1.173    rillig 
    795  1.173    rillig extern CmdOpts opts;
    796  1.319    rillig extern bool forceJobs;
    797  1.319    rillig extern char **environ;
    798  1.173    rillig 
    799  1.290    rillig /* arch.c */
    800  1.290    rillig void Arch_Init(void);
    801  1.341    rillig #ifdef CLEANUP
    802  1.290    rillig void Arch_End(void);
    803  1.341    rillig #endif
    804  1.290    rillig 
    805  1.290    rillig bool Arch_ParseArchive(char **, GNodeList *, GNode *);
    806  1.290    rillig void Arch_Touch(GNode *);
    807  1.290    rillig void Arch_TouchLib(GNode *);
    808  1.321    rillig void Arch_UpdateMTime(GNode *);
    809  1.321    rillig void Arch_UpdateMemberMTime(GNode *);
    810  1.290    rillig void Arch_FindLib(GNode *, SearchPath *);
    811  1.290    rillig bool Arch_LibOODate(GNode *) MAKE_ATTR_USE;
    812  1.290    rillig bool Arch_IsLib(GNode *) MAKE_ATTR_USE;
    813  1.290    rillig 
    814  1.290    rillig /* compat.c */
    815  1.290    rillig bool Compat_RunCommand(const char *, GNode *, StringListNode *);
    816  1.301    rillig void Compat_MakeAll(GNodeList *);
    817  1.290    rillig void Compat_Make(GNode *, GNode *);
    818  1.290    rillig 
    819  1.290    rillig /* cond.c */
    820  1.353    rillig extern unsigned cond_depth;
    821  1.290    rillig CondResult Cond_EvalCondition(const char *) MAKE_ATTR_USE;
    822  1.290    rillig CondResult Cond_EvalLine(const char *) MAKE_ATTR_USE;
    823  1.323    rillig Guard *Cond_ExtractGuard(const char *) MAKE_ATTR_USE;
    824  1.307    rillig void Cond_EndFile(void);
    825    1.1       cgd 
    826  1.290    rillig /* dir.c; see also dir.h */
    827  1.290    rillig 
    828  1.290    rillig MAKE_INLINE const char * MAKE_ATTR_USE
    829  1.290    rillig str_basename(const char *pathname)
    830  1.290    rillig {
    831  1.290    rillig 	const char *lastSlash = strrchr(pathname, '/');
    832  1.290    rillig 	return lastSlash != NULL ? lastSlash + 1 : pathname;
    833  1.290    rillig }
    834  1.290    rillig 
    835  1.290    rillig MAKE_INLINE SearchPath * MAKE_ATTR_USE
    836  1.290    rillig SearchPath_New(void)
    837  1.290    rillig {
    838  1.290    rillig 	SearchPath *path = bmake_malloc(sizeof *path);
    839  1.290    rillig 	Lst_Init(&path->dirs);
    840  1.290    rillig 	return path;
    841  1.290    rillig }
    842  1.290    rillig 
    843  1.290    rillig void SearchPath_Free(SearchPath *);
    844  1.290    rillig 
    845  1.290    rillig /* for.c */
    846  1.290    rillig struct ForLoop;
    847  1.290    rillig int For_Eval(const char *) MAKE_ATTR_USE;
    848  1.290    rillig bool For_Accum(const char *, int *) MAKE_ATTR_USE;
    849  1.297    rillig void For_Run(unsigned, unsigned);
    850  1.290    rillig bool For_NextIteration(struct ForLoop *, Buffer *);
    851  1.320    rillig char *ForLoop_Details(const struct ForLoop *);
    852  1.290    rillig void ForLoop_Free(struct ForLoop *);
    853  1.304       sjg void For_Break(struct ForLoop *);
    854  1.290    rillig 
    855  1.290    rillig /* job.c */
    856  1.290    rillig void JobReapChild(pid_t, int, bool);
    857  1.290    rillig 
    858  1.344       sjg /* longer than this we use a temp file */
    859  1.344       sjg #ifndef MAKE_CMDLEN_LIMIT
    860  1.344       sjg # define MAKE_CMDLEN_LIMIT 1000
    861  1.344       sjg #endif
    862  1.290    rillig /* main.c */
    863  1.290    rillig void Main_ParseArgLine(const char *);
    864  1.361    rillig void Cmd_Argv(const char *, size_t, const char *[5], char *, size_t,
    865  1.361    rillig     bool, bool);
    866  1.290    rillig char *Cmd_Exec(const char *, char **) MAKE_ATTR_USE;
    867  1.359    rillig void Var_ExportStackTrace(const char *, const char *);
    868  1.290    rillig void Error(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
    869  1.290    rillig void Fatal(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2) MAKE_ATTR_DEAD;
    870  1.290    rillig void Punt(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2) MAKE_ATTR_DEAD;
    871  1.290    rillig void DieHorribly(void) MAKE_ATTR_DEAD;
    872  1.308    rillig int unlink_file(const char *) MAKE_ATTR_USE;
    873  1.290    rillig void execDie(const char *, const char *);
    874  1.290    rillig char *getTmpdir(void) MAKE_ATTR_USE;
    875  1.290    rillig bool ParseBoolean(const char *, bool) MAKE_ATTR_USE;
    876  1.290    rillig const char *cached_realpath(const char *, char *);
    877  1.291       sjg bool GetBooleanExpr(const char *, bool);
    878  1.290    rillig 
    879  1.290    rillig /* parse.c */
    880  1.343    rillig extern int parseErrors;
    881  1.290    rillig void Parse_Init(void);
    882  1.341    rillig #ifdef CLEANUP
    883  1.290    rillig void Parse_End(void);
    884  1.341    rillig #endif
    885  1.290    rillig 
    886  1.303    rillig void PrintLocation(FILE *, bool, const GNode *);
    887  1.360    rillig const char *GetParentStackTrace(void);
    888  1.357    rillig char *GetStackTrace(bool);
    889  1.293    rillig void PrintStackTrace(bool);
    890  1.290    rillig void Parse_Error(ParseErrorLevel, const char *, ...) MAKE_ATTR_PRINTFLIKE(2, 3);
    891  1.290    rillig bool Parse_VarAssign(const char *, bool, GNode *) MAKE_ATTR_USE;
    892  1.290    rillig void Parse_File(const char *, int);
    893  1.297    rillig void Parse_PushInput(const char *, unsigned, unsigned, Buffer,
    894  1.297    rillig 		     struct ForLoop *);
    895  1.290    rillig void Parse_MainName(GNodeList *);
    896  1.353    rillig unsigned CurFile_CondMinDepth(void) MAKE_ATTR_USE;
    897  1.322    rillig void Parse_GuardElse(void);
    898  1.322    rillig void Parse_GuardEndif(void);
    899  1.290    rillig 
    900  1.290    rillig 
    901  1.290    rillig /* suff.c */
    902  1.290    rillig void Suff_Init(void);
    903  1.341    rillig #ifdef CLEANUP
    904  1.290    rillig void Suff_End(void);
    905  1.341    rillig #endif
    906  1.290    rillig 
    907  1.290    rillig void Suff_ClearSuffixes(void);
    908  1.290    rillig bool Suff_IsTransform(const char *) MAKE_ATTR_USE;
    909  1.290    rillig GNode *Suff_AddTransform(const char *);
    910  1.290    rillig void Suff_EndTransform(GNode *);
    911  1.290    rillig void Suff_AddSuffix(const char *);
    912  1.290    rillig SearchPath *Suff_GetPath(const char *) MAKE_ATTR_USE;
    913  1.290    rillig void Suff_ExtendPaths(void);
    914  1.290    rillig void Suff_AddInclude(const char *);
    915  1.290    rillig void Suff_AddLib(const char *);
    916  1.290    rillig void Suff_FindDeps(GNode *);
    917  1.290    rillig SearchPath *Suff_FindPath(GNode *) MAKE_ATTR_USE;
    918  1.290    rillig void Suff_SetNull(const char *);
    919  1.290    rillig void Suff_PrintAll(void);
    920  1.290    rillig char *Suff_NamesStr(void) MAKE_ATTR_USE;
    921  1.290    rillig 
    922  1.290    rillig /* targ.c */
    923  1.290    rillig void Targ_Init(void);
    924  1.290    rillig void Targ_End(void);
    925  1.290    rillig 
    926  1.290    rillig void Targ_Stats(void);
    927  1.290    rillig GNodeList *Targ_List(void) MAKE_ATTR_USE;
    928  1.290    rillig GNode *GNode_New(const char *) MAKE_ATTR_USE;
    929  1.290    rillig GNode *Targ_FindNode(const char *) MAKE_ATTR_USE;
    930  1.290    rillig GNode *Targ_GetNode(const char *) MAKE_ATTR_USE;
    931  1.290    rillig GNode *Targ_NewInternalNode(const char *) MAKE_ATTR_USE;
    932  1.290    rillig GNode *Targ_GetEndNode(void);
    933  1.290    rillig void Targ_FindList(GNodeList *, StringList *);
    934  1.290    rillig void Targ_PrintCmds(GNode *);
    935  1.290    rillig void Targ_PrintNode(GNode *, int);
    936  1.290    rillig void Targ_PrintNodes(GNodeList *, int);
    937  1.290    rillig const char *Targ_FmtTime(time_t) MAKE_ATTR_USE;
    938  1.290    rillig void Targ_PrintType(GNodeType);
    939  1.290    rillig void Targ_PrintGraph(int);
    940  1.290    rillig void Targ_Propagate(void);
    941  1.290    rillig const char *GNodeMade_Name(GNodeMade) MAKE_ATTR_USE;
    942  1.335    rillig #ifdef CLEANUP
    943  1.335    rillig void Parse_RegisterCommand(char *);
    944  1.335    rillig #else
    945  1.335    rillig MAKE_INLINE
    946  1.335    rillig void Parse_RegisterCommand(char *cmd MAKE_ATTR_UNUSED)
    947  1.335    rillig {
    948  1.335    rillig }
    949  1.335    rillig #endif
    950  1.290    rillig 
    951  1.290    rillig /* var.c */
    952  1.290    rillig 
    953  1.290    rillig typedef enum VarEvalMode {
    954  1.290    rillig 
    955  1.290    rillig 	/*
    956  1.290    rillig 	 * Only parse the expression but don't evaluate any part of it.
    957  1.290    rillig 	 *
    958  1.290    rillig 	 * TODO: Document what Var_Parse and Var_Subst return in this mode.
    959  1.290    rillig 	 *  As of 2021-03-15, they return unspecified, inconsistent results.
    960  1.290    rillig 	 */
    961  1.338    rillig 	VARE_PARSE,
    962  1.290    rillig 
    963  1.317    rillig 	/*
    964  1.317    rillig 	 * Parse text in which '${...}' and '$(...)' are not parsed as
    965  1.317    rillig 	 * subexpressions (with all their individual escaping rules) but
    966  1.317    rillig 	 * instead simply as text with balanced '${}' or '$()'.  Other '$'
    967  1.317    rillig 	 * are copied verbatim.
    968  1.317    rillig 	 */
    969  1.317    rillig 	VARE_PARSE_BALANCED,
    970  1.317    rillig 
    971  1.290    rillig 	/* Parse and evaluate the expression. */
    972  1.338    rillig 	VARE_EVAL,
    973  1.290    rillig 
    974  1.290    rillig 	/*
    975  1.290    rillig 	 * Parse and evaluate the expression.  It is an error if a
    976  1.290    rillig 	 * subexpression evaluates to undefined.
    977  1.290    rillig 	 */
    978  1.348    rillig 	VARE_EVAL_DEFINED_LOUD,
    979  1.348    rillig 
    980  1.348    rillig 	/*
    981  1.348    rillig 	 * Parse and evaluate the expression.  It is a silent error if a
    982  1.348    rillig 	 * subexpression evaluates to undefined.
    983  1.348    rillig 	 */
    984  1.338    rillig 	VARE_EVAL_DEFINED,
    985  1.290    rillig 
    986  1.290    rillig 	/*
    987  1.290    rillig 	 * Parse and evaluate the expression.  Keep undefined variables as-is
    988  1.290    rillig 	 * instead of expanding them to an empty string.
    989  1.290    rillig 	 *
    990  1.290    rillig 	 * Example for a ':=' assignment:
    991  1.290    rillig 	 *	CFLAGS = $(.INCLUDES)
    992  1.290    rillig 	 *	CFLAGS := -I.. $(CFLAGS)
    993  1.290    rillig 	 *	# If .INCLUDES (an undocumented special variable, by the
    994  1.290    rillig 	 *	# way) is still undefined, the updated CFLAGS becomes
    995  1.290    rillig 	 *	# "-I.. $(.INCLUDES)".
    996  1.290    rillig 	 */
    997  1.338    rillig 	VARE_EVAL_KEEP_UNDEFINED,
    998  1.290    rillig 
    999  1.290    rillig 	/*
   1000  1.290    rillig 	 * Parse and evaluate the expression.  Keep '$$' as '$$' and preserve
   1001  1.290    rillig 	 * undefined subexpressions.
   1002  1.290    rillig 	 */
   1003  1.338    rillig 	VARE_EVAL_KEEP_DOLLAR_AND_UNDEFINED
   1004  1.290    rillig } VarEvalMode;
   1005  1.290    rillig 
   1006  1.290    rillig typedef enum VarSetFlags {
   1007  1.290    rillig 	VAR_SET_NONE		= 0,
   1008  1.290    rillig 
   1009  1.290    rillig 	/* do not export */
   1010  1.290    rillig 	VAR_SET_NO_EXPORT	= 1 << 0,
   1011  1.290    rillig 
   1012  1.290    rillig 	/*
   1013  1.290    rillig 	 * Make the variable read-only. No further modification is possible,
   1014  1.318    rillig 	 * except for another call to Var_Set with the same flag. See the
   1015  1.318    rillig 	 * special targets '.NOREADONLY' and '.READONLY'.
   1016  1.290    rillig 	 */
   1017  1.333       sjg 	VAR_SET_READONLY	= 1 << 1,
   1018  1.333       sjg 	VAR_SET_INTERNAL	= 1 << 2
   1019  1.290    rillig } VarSetFlags;
   1020  1.290    rillig 
   1021  1.290    rillig typedef enum VarExportMode {
   1022  1.337       sjg 	/* .export-all */
   1023  1.337       sjg 	VEM_ALL,
   1024  1.290    rillig 	/* .export-env */
   1025  1.290    rillig 	VEM_ENV,
   1026  1.290    rillig 	/* .export: Initial export or update an already exported variable. */
   1027  1.290    rillig 	VEM_PLAIN,
   1028  1.290    rillig 	/* .export-literal: Do not expand the variable value. */
   1029  1.290    rillig 	VEM_LITERAL
   1030  1.290    rillig } VarExportMode;
   1031  1.290    rillig 
   1032  1.290    rillig void Var_Delete(GNode *, const char *);
   1033  1.334    rillig #ifdef CLEANUP
   1034  1.334    rillig void Var_DeleteAll(GNode *scope);
   1035  1.334    rillig #endif
   1036  1.290    rillig void Var_Undef(const char *);
   1037  1.290    rillig void Var_Set(GNode *, const char *, const char *);
   1038  1.290    rillig void Var_SetExpand(GNode *, const char *, const char *);
   1039  1.290    rillig void Var_SetWithFlags(GNode *, const char *, const char *, VarSetFlags);
   1040  1.290    rillig void Var_Append(GNode *, const char *, const char *);
   1041  1.290    rillig void Var_AppendExpand(GNode *, const char *, const char *);
   1042  1.290    rillig bool Var_Exists(GNode *, const char *) MAKE_ATTR_USE;
   1043  1.290    rillig bool Var_ExistsExpand(GNode *, const char *) MAKE_ATTR_USE;
   1044  1.290    rillig FStr Var_Value(GNode *, const char *) MAKE_ATTR_USE;
   1045  1.290    rillig const char *GNode_ValueDirect(GNode *, const char *) MAKE_ATTR_USE;
   1046  1.312    rillig FStr Var_Parse(const char **, GNode *, VarEvalMode);
   1047  1.313    rillig char *Var_Subst(const char *, GNode *, VarEvalMode);
   1048  1.339    rillig char *Var_SubstInTarget(const char *, GNode *);
   1049  1.290    rillig void Var_Expand(FStr *, GNode *, VarEvalMode);
   1050  1.290    rillig void Var_Stats(void);
   1051  1.290    rillig void Var_Dump(GNode *);
   1052  1.328       sjg void Var_ReexportVars(GNode *);
   1053  1.290    rillig void Var_Export(VarExportMode, const char *);
   1054  1.290    rillig void Var_ExportVars(const char *);
   1055  1.290    rillig void Var_UnExport(bool, const char *);
   1056  1.310       sjg void Var_ReadOnly(const char *, bool);
   1057  1.290    rillig 
   1058  1.290    rillig void Global_Set(const char *, const char *);
   1059  1.290    rillig void Global_Append(const char *, const char *);
   1060  1.290    rillig void Global_Delete(const char *);
   1061  1.311       sjg void Global_Set_ReadOnly(const char *, const char *);
   1062  1.290    rillig 
   1063  1.356    rillig void EvalStack_PushMakeflags(const char *);
   1064  1.356    rillig void EvalStack_Pop(void);
   1065  1.357    rillig bool EvalStack_Details(Buffer *buf) MAKE_ATTR_USE;
   1066  1.330    rillig 
   1067  1.290    rillig /* util.c */
   1068  1.290    rillig typedef void (*SignalProc)(int);
   1069  1.290    rillig SignalProc bmake_signal(int, SignalProc);
   1070  1.290    rillig 
   1071  1.290    rillig /* make.c */
   1072  1.199    rillig void GNode_UpdateYoungestChild(GNode *, GNode *);
   1073  1.274    rillig bool GNode_IsOODate(GNode *) MAKE_ATTR_USE;
   1074  1.144    rillig void Make_ExpandUse(GNodeList *);
   1075  1.274    rillig time_t Make_Recheck(GNode *) MAKE_ATTR_USE;
   1076   1.44       wiz void Make_HandleUse(GNode *, GNode *);
   1077   1.44       wiz void Make_Update(GNode *);
   1078  1.260    rillig void GNode_SetLocalVars(GNode *);
   1079  1.355    rillig bool Make_MakeParallel(GNodeList *);
   1080  1.274    rillig bool shouldDieQuietly(GNode *, int) MAKE_ATTR_USE;
   1081   1.80       sjg void PrintOnError(GNode *, const char *);
   1082  1.257    rillig void Main_ExportMAKEFLAGS(bool);
   1083  1.257    rillig bool Main_SetObjdir(bool, const char *, ...) MAKE_ATTR_PRINTFLIKE(2, 3);
   1084  1.274    rillig int mkTempFile(const char *, char *, size_t) MAKE_ATTR_USE;
   1085  1.327    rillig void AppendWords(StringList *, char *);
   1086  1.126    rillig void GNode_FprintDetails(FILE *, const char *, const GNode *, const char *);
   1087  1.274    rillig bool GNode_ShouldExecute(GNode *gn) MAKE_ATTR_USE;
   1088  1.354    rillig char *GNodeType_ToString(GNodeType);
   1089  1.155    rillig 
   1090  1.164    rillig /* See if the node was seen on the left-hand side of a dependency operator. */
   1091  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1092  1.164    rillig GNode_IsTarget(const GNode *gn)
   1093  1.155    rillig {
   1094  1.270    rillig 	return (gn->type & OP_OPMASK) != OP_NONE;
   1095  1.155    rillig }
   1096  1.155    rillig 
   1097  1.274    rillig MAKE_INLINE const char * MAKE_ATTR_USE
   1098  1.172    rillig GNode_Path(const GNode *gn)
   1099  1.172    rillig {
   1100  1.219    rillig 	return gn->path != NULL ? gn->path : gn->name;
   1101  1.172    rillig }
   1102  1.172    rillig 
   1103  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1104  1.218    rillig GNode_IsWaitingFor(const GNode *gn)
   1105  1.218    rillig {
   1106  1.268    rillig 	return gn->flags.remake && gn->made <= REQUESTED;
   1107  1.218    rillig }
   1108  1.218    rillig 
   1109  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1110  1.218    rillig GNode_IsReady(const GNode *gn)
   1111  1.218    rillig {
   1112  1.218    rillig 	return gn->made > DEFERRED;
   1113  1.218    rillig }
   1114  1.218    rillig 
   1115  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1116  1.218    rillig GNode_IsDone(const GNode *gn)
   1117  1.218    rillig {
   1118  1.218    rillig 	return gn->made >= MADE;
   1119  1.218    rillig }
   1120  1.218    rillig 
   1121  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1122  1.217    rillig GNode_IsError(const GNode *gn)
   1123  1.217    rillig {
   1124  1.217    rillig 	return gn->made == ERROR || gn->made == ABORTED;
   1125  1.217    rillig }
   1126  1.217    rillig 
   1127  1.280    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1128  1.280    rillig GNode_IsMainCandidate(const GNode *gn)
   1129  1.280    rillig {
   1130  1.281    rillig 	return (gn->type & (OP_NOTMAIN | OP_USE | OP_USEBEFORE |
   1131  1.281    rillig 			    OP_EXEC | OP_TRANSFORM)) == 0;
   1132  1.280    rillig }
   1133  1.280    rillig 
   1134  1.286    rillig /* Return whether the target file should be preserved on interrupt. */
   1135  1.286    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1136  1.286    rillig GNode_IsPrecious(const GNode *gn)
   1137  1.286    rillig {
   1138  1.286    rillig 	/* XXX: Why are '::' targets precious? */
   1139  1.286    rillig 	return allPrecious || gn->type & (OP_PRECIOUS | OP_DOUBLEDEP);
   1140  1.286    rillig }
   1141  1.286    rillig 
   1142  1.274    rillig MAKE_INLINE const char * MAKE_ATTR_USE
   1143  1.254    rillig GNode_VarTarget(GNode *gn) { return GNode_ValueDirect(gn, TARGET); }
   1144  1.274    rillig MAKE_INLINE const char * MAKE_ATTR_USE
   1145  1.254    rillig GNode_VarOodate(GNode *gn) { return GNode_ValueDirect(gn, OODATE); }
   1146  1.274    rillig MAKE_INLINE const char * MAKE_ATTR_USE
   1147  1.254    rillig GNode_VarAllsrc(GNode *gn) { return GNode_ValueDirect(gn, ALLSRC); }
   1148  1.274    rillig MAKE_INLINE const char * MAKE_ATTR_USE
   1149  1.254    rillig GNode_VarImpsrc(GNode *gn) { return GNode_ValueDirect(gn, IMPSRC); }
   1150  1.274    rillig MAKE_INLINE const char * MAKE_ATTR_USE
   1151  1.254    rillig GNode_VarPrefix(GNode *gn) { return GNode_ValueDirect(gn, PREFIX); }
   1152  1.274    rillig MAKE_INLINE const char * MAKE_ATTR_USE
   1153  1.254    rillig GNode_VarArchive(GNode *gn) { return GNode_ValueDirect(gn, ARCHIVE); }
   1154  1.274    rillig MAKE_INLINE const char * MAKE_ATTR_USE
   1155  1.254    rillig GNode_VarMember(GNode *gn) { return GNode_ValueDirect(gn, MEMBER); }
   1156  1.178    rillig 
   1157  1.274    rillig MAKE_INLINE void * MAKE_ATTR_USE
   1158  1.264    rillig UNCONST(const void *ptr)
   1159  1.264    rillig {
   1160  1.264    rillig 	void *ret;
   1161  1.264    rillig 	memcpy(&ret, &ptr, sizeof(ret));
   1162  1.264    rillig 	return ret;
   1163  1.264    rillig }
   1164   1.49       sjg 
   1165   1.96     pooka /* At least GNU/Hurd systems lack hardcoded MAXPATHLEN/PATH_MAX */
   1166   1.96     pooka #include <limits.h>
   1167   1.96     pooka #ifndef MAXPATHLEN
   1168   1.96     pooka #define MAXPATHLEN	4096
   1169   1.96     pooka #endif
   1170   1.96     pooka #ifndef PATH_MAX
   1171   1.96     pooka #define PATH_MAX	MAXPATHLEN
   1172   1.96     pooka #endif
   1173   1.96     pooka 
   1174  1.103       sjg #if defined(SYSV)
   1175  1.219    rillig #define KILLPG(pid, sig) kill(-(pid), (sig))
   1176  1.103       sjg #else
   1177  1.219    rillig #define KILLPG(pid, sig) killpg((pid), (sig))
   1178  1.103       sjg #endif
   1179  1.103       sjg 
   1180  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1181  1.195    rillig ch_isalnum(char ch) { return isalnum((unsigned char)ch) != 0; }
   1182  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1183  1.195    rillig ch_isalpha(char ch) { return isalpha((unsigned char)ch) != 0; }
   1184  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1185  1.195    rillig ch_isdigit(char ch) { return isdigit((unsigned char)ch) != 0; }
   1186  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1187  1.289    rillig ch_islower(char ch) { return islower((unsigned char)ch) != 0; }
   1188  1.289    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1189  1.358       sjg ch_isprint(char ch) { return isprint((unsigned char)ch) != 0; }
   1190  1.358       sjg MAKE_INLINE bool MAKE_ATTR_USE
   1191  1.195    rillig ch_isspace(char ch) { return isspace((unsigned char)ch) != 0; }
   1192  1.274    rillig MAKE_INLINE bool MAKE_ATTR_USE
   1193  1.195    rillig ch_isupper(char ch) { return isupper((unsigned char)ch) != 0; }
   1194  1.274    rillig MAKE_INLINE char MAKE_ATTR_USE
   1195  1.195    rillig ch_tolower(char ch) { return (char)tolower((unsigned char)ch); }
   1196  1.274    rillig MAKE_INLINE char MAKE_ATTR_USE
   1197  1.195    rillig ch_toupper(char ch) { return (char)toupper((unsigned char)ch); }
   1198  1.139    rillig 
   1199  1.205    rillig MAKE_INLINE void
   1200  1.155    rillig cpp_skip_whitespace(const char **pp)
   1201  1.155    rillig {
   1202  1.219    rillig 	while (ch_isspace(**pp))
   1203  1.219    rillig 		(*pp)++;
   1204  1.155    rillig }
   1205  1.155    rillig 
   1206  1.205    rillig MAKE_INLINE void
   1207  1.196    rillig cpp_skip_hspace(const char **pp)
   1208  1.196    rillig {
   1209  1.219    rillig 	while (**pp == ' ' || **pp == '\t')
   1210  1.219    rillig 		(*pp)++;
   1211  1.196    rillig }
   1212  1.196    rillig 
   1213  1.288    rillig MAKE_INLINE bool
   1214  1.288    rillig cpp_skip_string(const char **pp, const char *s)
   1215  1.288    rillig {
   1216  1.288    rillig 	const char *p = *pp;
   1217  1.288    rillig 	while (*p == *s && *s != '\0')
   1218  1.288    rillig 		p++, s++;
   1219  1.288    rillig 	if (*s == '\0')
   1220  1.288    rillig 		*pp = p;
   1221  1.288    rillig 	return *s == '\0';
   1222  1.288    rillig }
   1223  1.288    rillig 
   1224  1.205    rillig MAKE_INLINE void
   1225  1.155    rillig pp_skip_whitespace(char **pp)
   1226  1.155    rillig {
   1227  1.219    rillig 	while (ch_isspace(**pp))
   1228  1.219    rillig 		(*pp)++;
   1229  1.155    rillig }
   1230  1.155    rillig 
   1231  1.205    rillig MAKE_INLINE void
   1232  1.197    rillig pp_skip_hspace(char **pp)
   1233  1.197    rillig {
   1234  1.219    rillig 	while (**pp == ' ' || **pp == '\t')
   1235  1.219    rillig 		(*pp)++;
   1236  1.197    rillig }
   1237  1.197    rillig 
   1238  1.238    rillig #if defined(lint)
   1239  1.324    rillig void do_not_define_rcsid(void); /* for lint */
   1240  1.325    rillig # define MAKE_RCSID(id) void do_not_define_rcsid(void)
   1241  1.238    rillig #elif defined(MAKE_NATIVE)
   1242  1.249    rillig # include <sys/cdefs.h>
   1243  1.249    rillig # define MAKE_RCSID(id) __RCSID(id)
   1244  1.238    rillig #elif defined(MAKE_ALL_IN_ONE) && defined(__COUNTER__)
   1245  1.249    rillig # define MAKE_RCSID_CONCAT(x, y) CONCAT(x, y)
   1246  1.249    rillig # define MAKE_RCSID(id) static volatile char \
   1247  1.238    rillig 	MAKE_RCSID_CONCAT(rcsid_, __COUNTER__)[] = id
   1248  1.220    rillig #elif defined(MAKE_ALL_IN_ONE)
   1249  1.325    rillig # define MAKE_RCSID(id) void do_not_define_rcsid(void)
   1250  1.142    rillig #else
   1251  1.249    rillig # define MAKE_RCSID(id) static volatile char rcsid[] = id
   1252  1.142    rillig #endif
   1253  1.142    rillig 
   1254  1.276    rillig #endif
   1255