Home | History | Annotate | Line # | Download | only in make
parse.c revision 1.615
      1  1.615    rillig /*	$NetBSD: parse.c,v 1.615 2022/01/02 00:07:20 rillig Exp $	*/
      2   1.15  christos 
      3    1.1       cgd /*
      4   1.27  christos  * Copyright (c) 1988, 1989, 1990, 1993
      5   1.27  christos  *	The Regents of the University of California.  All rights reserved.
      6   1.94       agc  *
      7   1.94       agc  * This code is derived from software contributed to Berkeley by
      8   1.94       agc  * Adam de Boor.
      9   1.94       agc  *
     10   1.94       agc  * Redistribution and use in source and binary forms, with or without
     11   1.94       agc  * modification, are permitted provided that the following conditions
     12   1.94       agc  * are met:
     13   1.94       agc  * 1. Redistributions of source code must retain the above copyright
     14   1.94       agc  *    notice, this list of conditions and the following disclaimer.
     15   1.94       agc  * 2. Redistributions in binary form must reproduce the above copyright
     16   1.94       agc  *    notice, this list of conditions and the following disclaimer in the
     17   1.94       agc  *    documentation and/or other materials provided with the distribution.
     18   1.94       agc  * 3. Neither the name of the University nor the names of its contributors
     19   1.94       agc  *    may be used to endorse or promote products derived from this software
     20   1.94       agc  *    without specific prior written permission.
     21   1.94       agc  *
     22   1.94       agc  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23   1.94       agc  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24   1.94       agc  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25   1.94       agc  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26   1.94       agc  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27   1.94       agc  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28   1.94       agc  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29   1.94       agc  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30   1.94       agc  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31   1.94       agc  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32   1.94       agc  * SUCH DAMAGE.
     33   1.94       agc  */
     34   1.94       agc 
     35   1.94       agc /*
     36    1.1       cgd  * Copyright (c) 1989 by Berkeley Softworks
     37    1.1       cgd  * All rights reserved.
     38    1.1       cgd  *
     39    1.1       cgd  * This code is derived from software contributed to Berkeley by
     40    1.1       cgd  * Adam de Boor.
     41    1.1       cgd  *
     42    1.1       cgd  * Redistribution and use in source and binary forms, with or without
     43    1.1       cgd  * modification, are permitted provided that the following conditions
     44    1.1       cgd  * are met:
     45    1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     46    1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     47    1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     48    1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     49    1.1       cgd  *    documentation and/or other materials provided with the distribution.
     50    1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     51    1.1       cgd  *    must display the following acknowledgement:
     52    1.1       cgd  *	This product includes software developed by the University of
     53    1.1       cgd  *	California, Berkeley and its contributors.
     54    1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     55    1.1       cgd  *    may be used to endorse or promote products derived from this software
     56    1.1       cgd  *    without specific prior written permission.
     57    1.1       cgd  *
     58    1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     59    1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     60    1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     61    1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     62    1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     63    1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     64    1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     65    1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     66    1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     67    1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     68    1.1       cgd  * SUCH DAMAGE.
     69    1.1       cgd  */
     70    1.1       cgd 
     71  1.402    rillig /*
     72  1.402    rillig  * Parsing of makefiles.
     73  1.402    rillig  *
     74  1.402    rillig  * Parse_File is the main entry point and controls most of the other
     75  1.402    rillig  * functions in this module.
     76    1.1       cgd  *
     77  1.402    rillig  * The directories for the .include "..." directive are kept in
     78  1.402    rillig  * 'parseIncPath', while those for .include <...> are kept in 'sysIncPath'.
     79  1.402    rillig  * The targets currently being defined are kept in 'targets'.
     80    1.1       cgd  *
     81    1.1       cgd  * Interface:
     82  1.402    rillig  *	Parse_Init	Initialize the module
     83  1.338    rillig  *
     84  1.383    rillig  *	Parse_End	Clean up the module
     85  1.338    rillig  *
     86  1.402    rillig  *	Parse_File	Parse a top-level makefile.  Included files are
     87  1.537    rillig  *			handled by IncludeFile instead.
     88  1.402    rillig  *
     89  1.609    rillig  *	Parse_VarAssign
     90  1.609    rillig  *			Try to parse the given line as a variable assignment.
     91  1.609    rillig  *			Used by MainParseArgs to determine if an argument is
     92  1.609    rillig  *			a target or a variable assignment.  Used internally
     93  1.609    rillig  *			for pretty much the same thing.
     94  1.402    rillig  *
     95  1.402    rillig  *	Parse_Error	Report a parse error, a warning or an informational
     96  1.402    rillig  *			message.
     97  1.338    rillig  *
     98  1.609    rillig  *	Parse_MainName	Returns a list of the single main target to create.
     99    1.1       cgd  */
    100    1.1       cgd 
    101  1.170  dholland #include <sys/types.h>
    102  1.171  dholland #include <sys/stat.h>
    103   1.84       wiz #include <errno.h>
    104    1.5       cgd #include <stdarg.h>
    105  1.225      maya #include <stdint.h>
    106   1.84       wiz 
    107    1.1       cgd #include "make.h"
    108    1.5       cgd #include "dir.h"
    109    1.5       cgd #include "job.h"
    110    1.1       cgd #include "pathnames.h"
    111    1.1       cgd 
    112  1.303    rillig /*	"@(#)parse.c	8.3 (Berkeley) 3/19/94"	*/
    113  1.615    rillig MAKE_RCSID("$NetBSD: parse.c,v 1.615 2022/01/02 00:07:20 rillig Exp $");
    114  1.303    rillig 
    115  1.248    rillig /* types and constants */
    116  1.166  dholland 
    117    1.1       cgd /*
    118  1.166  dholland  * Structure for a file being read ("included file")
    119    1.1       cgd  */
    120    1.1       cgd typedef struct IFile {
    121  1.576    rillig 	FStr name;		/* absolute or relative to the cwd */
    122  1.553    rillig 	bool fromForLoop;	/* simulated .include by the .for loop */
    123  1.469    rillig 	int lineno;		/* current line number in file */
    124  1.469    rillig 	int first_lineno;	/* line number of start of text */
    125  1.469    rillig 	unsigned int cond_depth; /* 'if' nesting when file opened */
    126  1.553    rillig 	bool depending;	/* state of doing_depend on EOF */
    127  1.469    rillig 
    128  1.571    rillig 	/*
    129  1.571    rillig 	 * The buffer from which the file's content is read.  The buffer
    130  1.571    rillig 	 * always ends with '\n', the buffer is not null-terminated, that is,
    131  1.571    rillig 	 * buf_end[0] is already out of bounds.
    132  1.571    rillig 	 */
    133  1.469    rillig 	char *buf_freeIt;
    134  1.469    rillig 	char *buf_ptr;		/* next char to be read */
    135  1.571    rillig 	char *buf_end;		/* buf_end[-1] == '\n' */
    136  1.469    rillig 
    137  1.471    rillig 	/* Function to read more data, with a single opaque argument. */
    138  1.471    rillig 	ReadMoreProc readMore;
    139  1.471    rillig 	void *readMoreArg;
    140  1.471    rillig 
    141  1.469    rillig 	struct loadedfile *lf;	/* loadedfile object, if any */
    142    1.5       cgd } IFile;
    143    1.1       cgd 
    144  1.166  dholland /*
    145  1.166  dholland  * Tokens for target attributes
    146    1.1       cgd  */
    147  1.386    rillig typedef enum ParseSpecial {
    148  1.469    rillig 	SP_ATTRIBUTE,	/* Generic attribute */
    149  1.469    rillig 	SP_BEGIN,	/* .BEGIN */
    150  1.469    rillig 	SP_DEFAULT,	/* .DEFAULT */
    151  1.469    rillig 	SP_DELETE_ON_ERROR, /* .DELETE_ON_ERROR */
    152  1.469    rillig 	SP_END,		/* .END */
    153  1.469    rillig 	SP_ERROR,	/* .ERROR */
    154  1.469    rillig 	SP_IGNORE,	/* .IGNORE */
    155  1.469    rillig 	SP_INCLUDES,	/* .INCLUDES; not mentioned in the manual page */
    156  1.469    rillig 	SP_INTERRUPT,	/* .INTERRUPT */
    157  1.469    rillig 	SP_LIBS,	/* .LIBS; not mentioned in the manual page */
    158  1.589    rillig 	SP_MAIN,	/* .MAIN and no user-specified targets to make */
    159  1.469    rillig 	SP_META,	/* .META */
    160  1.469    rillig 	SP_MFLAGS,	/* .MFLAGS or .MAKEFLAGS */
    161  1.469    rillig 	SP_NOMETA,	/* .NOMETA */
    162  1.469    rillig 	SP_NOMETA_CMP,	/* .NOMETA_CMP */
    163  1.469    rillig 	SP_NOPATH,	/* .NOPATH */
    164  1.469    rillig 	SP_NOT,		/* Not special */
    165  1.469    rillig 	SP_NOTPARALLEL,	/* .NOTPARALLEL or .NO_PARALLEL */
    166  1.469    rillig 	SP_NULL,	/* .NULL; not mentioned in the manual page */
    167  1.469    rillig 	SP_OBJDIR,	/* .OBJDIR */
    168  1.469    rillig 	SP_ORDER,	/* .ORDER */
    169  1.469    rillig 	SP_PARALLEL,	/* .PARALLEL; not mentioned in the manual page */
    170  1.469    rillig 	SP_PATH,	/* .PATH or .PATH.suffix */
    171  1.469    rillig 	SP_PHONY,	/* .PHONY */
    172   1.48       sjg #ifdef POSIX
    173  1.469    rillig 	SP_POSIX,	/* .POSIX; not mentioned in the manual page */
    174   1.48       sjg #endif
    175  1.469    rillig 	SP_PRECIOUS,	/* .PRECIOUS */
    176  1.469    rillig 	SP_SHELL,	/* .SHELL */
    177  1.469    rillig 	SP_SILENT,	/* .SILENT */
    178  1.469    rillig 	SP_SINGLESHELL,	/* .SINGLESHELL; not mentioned in the manual page */
    179  1.469    rillig 	SP_STALE,	/* .STALE */
    180  1.469    rillig 	SP_SUFFIXES,	/* .SUFFIXES */
    181  1.469    rillig 	SP_WAIT		/* .WAIT */
    182    1.1       cgd } ParseSpecial;
    183    1.1       cgd 
    184  1.368    rillig typedef List SearchPathList;
    185  1.392    rillig typedef ListNode SearchPathListNode;
    186  1.368    rillig 
    187  1.248    rillig /* result data */
    188  1.166  dholland 
    189  1.166  dholland /*
    190  1.589    rillig  * The main target to create. This is the first target defined in any of the
    191  1.589    rillig  * makefiles.
    192  1.166  dholland  */
    193  1.166  dholland static GNode *mainNode;
    194  1.166  dholland 
    195  1.248    rillig /* eval state */
    196  1.166  dholland 
    197  1.524    rillig /*
    198  1.524    rillig  * During parsing, the targets from the left-hand side of the currently
    199  1.415    rillig  * active dependency line, or NULL if the current line does not belong to a
    200  1.415    rillig  * dependency line, for example because it is a variable assignment.
    201  1.318    rillig  *
    202  1.524    rillig  * See unit-tests/deptgt.mk, keyword "parse.c:targets".
    203  1.524    rillig  */
    204  1.322    rillig static GNodeList *targets;
    205  1.166  dholland 
    206  1.166  dholland #ifdef CLEANUP
    207  1.524    rillig /*
    208  1.524    rillig  * All shell commands for all targets, in no particular order and possibly
    209  1.372    rillig  * with duplicates.  Kept in a separate list since the commands from .USE or
    210  1.372    rillig  * .USEBEFORE nodes are shared with other GNodes, thereby giving up the
    211  1.524    rillig  * easily understandable ownership over the allocated strings.
    212  1.524    rillig  */
    213  1.461    rillig static StringList targCmds = LST_INIT;
    214  1.166  dholland #endif
    215  1.166  dholland 
    216  1.166  dholland /*
    217  1.152       dsl  * Predecessor node for handling .ORDER. Initialized to NULL when .ORDER
    218    1.1       cgd  * seen, then set to each successive source on the line.
    219    1.1       cgd  */
    220  1.407    rillig static GNode *order_pred;
    221    1.1       cgd 
    222  1.248    rillig /* parser state */
    223  1.166  dholland 
    224  1.166  dholland /* number of fatal errors */
    225  1.561    rillig static int parseErrors = 0;
    226  1.166  dholland 
    227  1.166  dholland /*
    228  1.166  dholland  * Variables for doing includes
    229  1.166  dholland  */
    230  1.166  dholland 
    231  1.524    rillig /*
    232  1.532    rillig  * The include chain of makefiles.  At index 0 is the top-level makefile from
    233  1.532    rillig  * the command line, followed by the included files or .for loops, up to and
    234  1.532    rillig  * including the current file.
    235  1.532    rillig  *
    236  1.532    rillig  * See PrintStackTrace for how to interpret the data.
    237  1.319    rillig  */
    238  1.408    rillig static Vector /* of IFile */ includes;
    239  1.400    rillig 
    240  1.400    rillig static IFile *
    241  1.400    rillig GetInclude(size_t i)
    242  1.400    rillig {
    243  1.469    rillig 	return Vector_Get(&includes, i);
    244  1.408    rillig }
    245  1.408    rillig 
    246  1.408    rillig /* The file that is currently being read. */
    247  1.408    rillig static IFile *
    248  1.408    rillig CurFile(void)
    249  1.408    rillig {
    250  1.469    rillig 	return GetInclude(includes.len - 1);
    251  1.400    rillig }
    252  1.166  dholland 
    253  1.409    rillig /* include paths */
    254  1.549    rillig SearchPath *parseIncPath;	/* directories for "..." includes */
    255  1.549    rillig SearchPath *sysIncPath;		/* directories for <...> includes */
    256  1.414    rillig SearchPath *defSysIncPath;	/* default for sysIncPath */
    257  1.166  dholland 
    258  1.248    rillig /* parser tables */
    259  1.166  dholland 
    260    1.1       cgd /*
    261    1.1       cgd  * The parseKeywords table is searched using binary search when deciding
    262    1.1       cgd  * if a target or source is special. The 'spec' field is the ParseSpecial
    263  1.404    rillig  * type of the keyword (SP_NOT if the keyword isn't special as a target) while
    264    1.1       cgd  * the 'op' field is the operator to apply to the list of targets if the
    265    1.1       cgd  * keyword is used as a source ("0" if the keyword isn't special as a source)
    266    1.1       cgd  */
    267  1.168  dholland static const struct {
    268  1.590    rillig 	const char name[17];
    269  1.590    rillig 	ParseSpecial special;	/* when used as a target */
    270  1.590    rillig 	GNodeType targetAttr;	/* when used as a source */
    271    1.1       cgd } parseKeywords[] = {
    272  1.466    rillig     { ".BEGIN",		SP_BEGIN,	OP_NONE },
    273  1.466    rillig     { ".DEFAULT",	SP_DEFAULT,	OP_NONE },
    274  1.466    rillig     { ".DELETE_ON_ERROR", SP_DELETE_ON_ERROR, OP_NONE },
    275  1.466    rillig     { ".END",		SP_END,		OP_NONE },
    276  1.466    rillig     { ".ERROR",		SP_ERROR,	OP_NONE },
    277  1.404    rillig     { ".EXEC",		SP_ATTRIBUTE,	OP_EXEC },
    278  1.404    rillig     { ".IGNORE",	SP_IGNORE,	OP_IGNORE },
    279  1.466    rillig     { ".INCLUDES",	SP_INCLUDES,	OP_NONE },
    280  1.466    rillig     { ".INTERRUPT",	SP_INTERRUPT,	OP_NONE },
    281  1.404    rillig     { ".INVISIBLE",	SP_ATTRIBUTE,	OP_INVISIBLE },
    282  1.404    rillig     { ".JOIN",		SP_ATTRIBUTE,	OP_JOIN },
    283  1.466    rillig     { ".LIBS",		SP_LIBS,	OP_NONE },
    284  1.404    rillig     { ".MADE",		SP_ATTRIBUTE,	OP_MADE },
    285  1.466    rillig     { ".MAIN",		SP_MAIN,	OP_NONE },
    286  1.404    rillig     { ".MAKE",		SP_ATTRIBUTE,	OP_MAKE },
    287  1.466    rillig     { ".MAKEFLAGS",	SP_MFLAGS,	OP_NONE },
    288  1.404    rillig     { ".META",		SP_META,	OP_META },
    289  1.466    rillig     { ".MFLAGS",	SP_MFLAGS,	OP_NONE },
    290  1.404    rillig     { ".NOMETA",	SP_NOMETA,	OP_NOMETA },
    291  1.404    rillig     { ".NOMETA_CMP",	SP_NOMETA_CMP,	OP_NOMETA_CMP },
    292  1.404    rillig     { ".NOPATH",	SP_NOPATH,	OP_NOPATH },
    293  1.404    rillig     { ".NOTMAIN",	SP_ATTRIBUTE,	OP_NOTMAIN },
    294  1.466    rillig     { ".NOTPARALLEL",	SP_NOTPARALLEL,	OP_NONE },
    295  1.466    rillig     { ".NO_PARALLEL",	SP_NOTPARALLEL,	OP_NONE },
    296  1.466    rillig     { ".NULL",		SP_NULL,	OP_NONE },
    297  1.466    rillig     { ".OBJDIR",	SP_OBJDIR,	OP_NONE },
    298  1.404    rillig     { ".OPTIONAL",	SP_ATTRIBUTE,	OP_OPTIONAL },
    299  1.466    rillig     { ".ORDER",		SP_ORDER,	OP_NONE },
    300  1.466    rillig     { ".PARALLEL",	SP_PARALLEL,	OP_NONE },
    301  1.466    rillig     { ".PATH",		SP_PATH,	OP_NONE },
    302  1.404    rillig     { ".PHONY",		SP_PHONY,	OP_PHONY },
    303   1.48       sjg #ifdef POSIX
    304  1.466    rillig     { ".POSIX",		SP_POSIX,	OP_NONE },
    305   1.48       sjg #endif
    306  1.404    rillig     { ".PRECIOUS",	SP_PRECIOUS,	OP_PRECIOUS },
    307  1.404    rillig     { ".RECURSIVE",	SP_ATTRIBUTE,	OP_MAKE },
    308  1.466    rillig     { ".SHELL",		SP_SHELL,	OP_NONE },
    309  1.404    rillig     { ".SILENT",	SP_SILENT,	OP_SILENT },
    310  1.466    rillig     { ".SINGLESHELL",	SP_SINGLESHELL,	OP_NONE },
    311  1.466    rillig     { ".STALE",		SP_STALE,	OP_NONE },
    312  1.466    rillig     { ".SUFFIXES",	SP_SUFFIXES,	OP_NONE },
    313  1.404    rillig     { ".USE",		SP_ATTRIBUTE,	OP_USE },
    314  1.404    rillig     { ".USEBEFORE",	SP_ATTRIBUTE,	OP_USEBEFORE },
    315  1.466    rillig     { ".WAIT",		SP_WAIT,	OP_NONE },
    316    1.1       cgd };
    317    1.1       cgd 
    318  1.248    rillig /* file loader */
    319  1.170  dholland 
    320  1.170  dholland struct loadedfile {
    321  1.612    rillig 	char *buf;		/* contents buffer, not null-terminated */
    322  1.469    rillig 	size_t len;		/* length of contents */
    323  1.553    rillig 	bool used;		/* XXX: have we used the data yet */
    324  1.170  dholland };
    325  1.170  dholland 
    326  1.441    rillig /* XXX: What is the lifetime of the path? Who manages the memory? */
    327  1.170  dholland static struct loadedfile *
    328  1.573    rillig loadedfile_create(char *buf, size_t buflen)
    329  1.170  dholland {
    330  1.170  dholland 	struct loadedfile *lf;
    331  1.170  dholland 
    332  1.427    rillig 	lf = bmake_malloc(sizeof *lf);
    333  1.522    rillig 	lf->buf = buf;
    334  1.522    rillig 	lf->len = buflen;
    335  1.553    rillig 	lf->used = false;
    336  1.170  dholland 	return lf;
    337  1.170  dholland }
    338  1.170  dholland 
    339  1.170  dholland static void
    340  1.170  dholland loadedfile_destroy(struct loadedfile *lf)
    341  1.170  dholland {
    342  1.522    rillig 	free(lf->buf);
    343  1.170  dholland 	free(lf);
    344  1.170  dholland }
    345  1.170  dholland 
    346  1.170  dholland /*
    347  1.471    rillig  * readMore() operation for loadedfile, as needed by the weird and twisted
    348  1.471    rillig  * logic below. Once that's cleaned up, we can get rid of lf->used.
    349  1.170  dholland  */
    350  1.170  dholland static char *
    351  1.471    rillig loadedfile_readMore(void *x, size_t *len)
    352  1.170  dholland {
    353  1.170  dholland 	struct loadedfile *lf = x;
    354  1.170  dholland 
    355  1.430    rillig 	if (lf->used)
    356  1.170  dholland 		return NULL;
    357  1.430    rillig 
    358  1.553    rillig 	lf->used = true;
    359  1.170  dholland 	*len = lf->len;
    360  1.170  dholland 	return lf->buf;
    361  1.170  dholland }
    362  1.170  dholland 
    363  1.414    rillig static struct loadedfile *
    364  1.414    rillig loadfile(const char *path, int fd)
    365  1.414    rillig {
    366  1.522    rillig 	ssize_t n;
    367  1.522    rillig 	Buffer buf;
    368  1.612    rillig 	size_t bufSize;
    369  1.612    rillig 	struct stat st;
    370  1.414    rillig 
    371  1.612    rillig 	bufSize = fstat(fd, &st) == 0 && S_ISREG(st.st_mode) &&
    372  1.612    rillig 		  st.st_size >= 0 && st.st_size <= 0x3fffffff
    373  1.612    rillig 	    ? (size_t)st.st_size : 1024;
    374  1.612    rillig 	Buf_InitSize(&buf, bufSize);
    375  1.170  dholland 
    376  1.428    rillig 	for (;;) {
    377  1.522    rillig 		if (buf.len == buf.cap) {
    378  1.522    rillig 			if (buf.cap > 0x1fffffff) {
    379  1.221  riastrad 				errno = EFBIG;
    380  1.221  riastrad 				Error("%s: file too large", path);
    381  1.518    rillig 				exit(2); /* Not 1 so -q can distinguish error */
    382  1.221  riastrad 			}
    383  1.523    rillig 			Buf_Expand(&buf);
    384  1.170  dholland 		}
    385  1.522    rillig 		assert(buf.len < buf.cap);
    386  1.522    rillig 		n = read(fd, buf.data + buf.len, buf.cap - buf.len);
    387  1.522    rillig 		if (n < 0) {
    388  1.170  dholland 			Error("%s: read error: %s", path, strerror(errno));
    389  1.518    rillig 			exit(2);	/* Not 1 so -q can distinguish error */
    390  1.170  dholland 		}
    391  1.522    rillig 		if (n == 0)
    392  1.170  dholland 			break;
    393  1.430    rillig 
    394  1.522    rillig 		buf.len += (size_t)n;
    395  1.170  dholland 	}
    396  1.522    rillig 	assert(buf.len <= buf.cap);
    397  1.170  dholland 
    398  1.522    rillig 	if (!Buf_EndsWith(&buf, '\n'))
    399  1.522    rillig 		Buf_AddByte(&buf, '\n');
    400  1.170  dholland 
    401  1.577    rillig 	return loadedfile_create(buf.data, buf.len);
    402  1.170  dholland }
    403  1.170  dholland 
    404  1.532    rillig static void
    405  1.532    rillig PrintStackTrace(void)
    406  1.532    rillig {
    407  1.532    rillig 	const IFile *entries;
    408  1.532    rillig 	size_t i, n;
    409  1.532    rillig 
    410  1.612    rillig 	if (!DEBUG(PARSE))
    411  1.532    rillig 		return;
    412  1.532    rillig 
    413  1.532    rillig 	entries = GetInclude(0);
    414  1.532    rillig 	n = includes.len;
    415  1.532    rillig 	if (n == 0)
    416  1.532    rillig 		return;
    417  1.532    rillig 	n--;			/* This entry is already in the diagnostic. */
    418  1.532    rillig 
    419  1.532    rillig 	/*
    420  1.532    rillig 	 * For the IFiles with fromForLoop, lineno seems to be sorted
    421  1.532    rillig 	 * backwards.  This is because lineno is the number of completely
    422  1.532    rillig 	 * parsed lines, which for a .for loop is right after the
    423  1.532    rillig 	 * corresponding .endfor.  The intuitive line number comes from
    424  1.532    rillig 	 * first_lineno instead, which points at the start of the .for loop.
    425  1.532    rillig 	 *
    426  1.532    rillig 	 * To make the stack trace intuitive, the entry below each chain of
    427  1.532    rillig 	 * .for loop entries must be ignored completely since neither its
    428  1.532    rillig 	 * lineno nor its first_lineno is useful.  Instead, the topmost of
    429  1.532    rillig 	 * each chain of .for loop entries needs to be printed twice, once
    430  1.532    rillig 	 * with its first_lineno and once with its lineno.
    431  1.532    rillig 	 */
    432  1.532    rillig 
    433  1.532    rillig 	for (i = n; i-- > 0;) {
    434  1.532    rillig 		const IFile *entry = entries + i;
    435  1.576    rillig 		const char *fname = entry->name.str;
    436  1.553    rillig 		bool printLineno;
    437  1.532    rillig 		char dirbuf[MAXPATHLEN + 1];
    438  1.532    rillig 
    439  1.532    rillig 		if (fname[0] != '/' && strcmp(fname, "(stdin)") != 0)
    440  1.532    rillig 			fname = realpath(fname, dirbuf);
    441  1.532    rillig 
    442  1.532    rillig 		printLineno = !entry->fromForLoop;
    443  1.532    rillig 		if (i + 1 < n && entries[i + 1].fromForLoop == printLineno)
    444  1.532    rillig 			printLineno = entry->fromForLoop;
    445  1.532    rillig 
    446  1.532    rillig 		if (printLineno)
    447  1.532    rillig 			debug_printf("\tin .include from %s:%d\n",
    448  1.532    rillig 			    fname, entry->lineno);
    449  1.532    rillig 		if (entry->fromForLoop)
    450  1.532    rillig 			debug_printf("\tin .for loop from %s:%d\n",
    451  1.532    rillig 			    fname, entry->first_lineno);
    452  1.532    rillig 	}
    453  1.532    rillig }
    454   1.77  christos 
    455  1.279    rillig /* Check if the current character is escaped on the current line. */
    456  1.553    rillig static bool
    457  1.602    rillig IsEscaped(const char *line, const char *p)
    458   1.77  christos {
    459  1.553    rillig 	bool active = false;
    460  1.594    rillig 	while (p > line && *--p == '\\')
    461  1.469    rillig 		active = !active;
    462  1.594    rillig 	return active;
    463   1.77  christos }
    464   1.77  christos 
    465  1.524    rillig /*
    466  1.524    rillig  * Add the filename and lineno to the GNode so that we remember where it
    467  1.524    rillig  * was first defined.
    468  1.524    rillig  */
    469  1.278    rillig static void
    470  1.562    rillig RememberLocation(GNode *gn)
    471  1.278    rillig {
    472  1.469    rillig 	IFile *curFile = CurFile();
    473  1.576    rillig 	gn->fname = Str_Intern(curFile->name.str);
    474  1.469    rillig 	gn->lineno = curFile->lineno;
    475  1.278    rillig }
    476  1.278    rillig 
    477  1.524    rillig /*
    478  1.524    rillig  * Look in the table of keywords for one matching the given string.
    479  1.524    rillig  * Return the index of the keyword, or -1 if it isn't there.
    480  1.524    rillig  */
    481    1.1       cgd static int
    482  1.602    rillig FindKeyword(const char *str)
    483    1.1       cgd {
    484  1.469    rillig 	int start = 0;
    485  1.469    rillig 	int end = sizeof parseKeywords / sizeof parseKeywords[0] - 1;
    486    1.1       cgd 
    487  1.611    rillig 	while (start <= end) {
    488  1.469    rillig 		int curr = start + (end - start) / 2;
    489  1.469    rillig 		int diff = strcmp(str, parseKeywords[curr].name);
    490  1.469    rillig 
    491  1.469    rillig 		if (diff == 0)
    492  1.469    rillig 			return curr;
    493  1.469    rillig 		if (diff < 0)
    494  1.469    rillig 			end = curr - 1;
    495  1.469    rillig 		else
    496  1.469    rillig 			start = curr + 1;
    497  1.611    rillig 	}
    498  1.430    rillig 
    499  1.469    rillig 	return -1;
    500    1.1       cgd }
    501    1.1       cgd 
    502  1.291    rillig static void
    503  1.441    rillig PrintLocation(FILE *f, const char *fname, size_t lineno)
    504  1.291    rillig {
    505  1.469    rillig 	char dirbuf[MAXPATHLEN + 1];
    506  1.505    rillig 	FStr dir, base;
    507  1.291    rillig 
    508  1.441    rillig 	if (*fname == '/' || strcmp(fname, "(stdin)") == 0) {
    509  1.481    rillig 		(void)fprintf(f, "\"%s\" line %u: ", fname, (unsigned)lineno);
    510  1.299    rillig 		return;
    511  1.299    rillig 	}
    512  1.291    rillig 
    513  1.583    rillig 	/*
    514  1.583    rillig 	 * Find out which makefile is the culprit. We try ${.PARSEDIR} and
    515  1.583    rillig 	 * apply realpath(3) if not absolute.
    516  1.583    rillig 	 */
    517  1.291    rillig 
    518  1.548    rillig 	dir = Var_Value(SCOPE_GLOBAL, ".PARSEDIR");
    519  1.505    rillig 	if (dir.str == NULL)
    520  1.505    rillig 		dir.str = ".";
    521  1.505    rillig 	if (dir.str[0] != '/')
    522  1.505    rillig 		dir.str = realpath(dir.str, dirbuf);
    523  1.505    rillig 
    524  1.548    rillig 	base = Var_Value(SCOPE_GLOBAL, ".PARSEFILE");
    525  1.505    rillig 	if (base.str == NULL)
    526  1.505    rillig 		base.str = str_basename(fname);
    527  1.505    rillig 
    528  1.505    rillig 	(void)fprintf(f, "\"%s/%s\" line %u: ",
    529  1.505    rillig 	    dir.str, base.str, (unsigned)lineno);
    530  1.505    rillig 
    531  1.505    rillig 	FStr_Done(&base);
    532  1.505    rillig 	FStr_Done(&dir);
    533  1.291    rillig }
    534  1.291    rillig 
    535   1.38  christos static void
    536  1.441    rillig ParseVErrorInternal(FILE *f, const char *fname, size_t lineno,
    537  1.398    rillig 		    ParseErrorLevel type, const char *fmt, va_list ap)
    538   1.38  christos {
    539  1.553    rillig 	static bool fatal_warning_error_printed = false;
    540   1.56  christos 
    541  1.148       sjg 	(void)fprintf(f, "%s: ", progname);
    542   1.63  christos 
    543  1.441    rillig 	if (fname != NULL)
    544  1.441    rillig 		PrintLocation(f, fname, lineno);
    545   1.38  christos 	if (type == PARSE_WARNING)
    546  1.127       dsl 		(void)fprintf(f, "warning: ");
    547  1.127       dsl 	(void)vfprintf(f, fmt, ap);
    548  1.127       dsl 	(void)fprintf(f, "\n");
    549  1.127       dsl 	(void)fflush(f);
    550  1.300    rillig 
    551  1.226       sjg 	if (type == PARSE_INFO)
    552  1.532    rillig 		goto print_stack_trace;
    553  1.533    rillig 	if (type == PARSE_WARNING && !opts.parseWarnFatal)
    554  1.533    rillig 		goto print_stack_trace;
    555  1.561    rillig 	parseErrors++;
    556  1.533    rillig 	if (type == PARSE_WARNING && !fatal_warning_error_printed) {
    557   1.56  christos 		Error("parsing warnings being treated as errors");
    558  1.553    rillig 		fatal_warning_error_printed = true;
    559   1.56  christos 	}
    560  1.532    rillig 
    561  1.532    rillig print_stack_trace:
    562  1.532    rillig 	PrintStackTrace();
    563   1.38  christos }
    564   1.38  christos 
    565  1.203     joerg static void
    566  1.441    rillig ParseErrorInternal(const char *fname, size_t lineno,
    567  1.441    rillig 		   ParseErrorLevel type, const char *fmt, ...)
    568  1.203     joerg {
    569  1.203     joerg 	va_list ap;
    570  1.203     joerg 
    571  1.441    rillig 	(void)fflush(stdout);
    572  1.203     joerg 	va_start(ap, fmt);
    573  1.441    rillig 	ParseVErrorInternal(stderr, fname, lineno, type, fmt, ap);
    574  1.203     joerg 	va_end(ap);
    575  1.203     joerg 
    576  1.401    rillig 	if (opts.debug_file != stderr && opts.debug_file != stdout) {
    577  1.203     joerg 		va_start(ap, fmt);
    578  1.441    rillig 		ParseVErrorInternal(opts.debug_file, fname, lineno, type,
    579  1.469    rillig 		    fmt, ap);
    580  1.203     joerg 		va_end(ap);
    581  1.203     joerg 	}
    582  1.203     joerg }
    583  1.203     joerg 
    584  1.524    rillig /*
    585  1.524    rillig  * Print a parse error message, including location information.
    586  1.441    rillig  *
    587  1.441    rillig  * If the level is PARSE_FATAL, continue parsing until the end of the
    588  1.441    rillig  * current top-level makefile, then exit (see Parse_File).
    589   1.38  christos  *
    590  1.524    rillig  * Fmt is given without a trailing newline.
    591  1.524    rillig  */
    592    1.1       cgd void
    593  1.398    rillig Parse_Error(ParseErrorLevel type, const char *fmt, ...)
    594    1.1       cgd {
    595    1.1       cgd 	va_list ap;
    596  1.156       dsl 	const char *fname;
    597  1.156       dsl 	size_t lineno;
    598   1.84       wiz 
    599  1.408    rillig 	if (includes.len == 0) {
    600  1.156       dsl 		fname = NULL;
    601  1.156       dsl 		lineno = 0;
    602  1.156       dsl 	} else {
    603  1.408    rillig 		IFile *curFile = CurFile();
    604  1.576    rillig 		fname = curFile->name.str;
    605  1.369    rillig 		lineno = (size_t)curFile->lineno;
    606  1.148       sjg 	}
    607  1.156       dsl 
    608  1.156       dsl 	va_start(ap, fmt);
    609  1.163       sjg 	(void)fflush(stdout);
    610  1.156       dsl 	ParseVErrorInternal(stderr, fname, lineno, type, fmt, ap);
    611    1.1       cgd 	va_end(ap);
    612  1.127       dsl 
    613  1.401    rillig 	if (opts.debug_file != stderr && opts.debug_file != stdout) {
    614  1.127       dsl 		va_start(ap, fmt);
    615  1.401    rillig 		ParseVErrorInternal(opts.debug_file, fname, lineno, type,
    616  1.469    rillig 		    fmt, ap);
    617  1.127       dsl 		va_end(ap);
    618  1.127       dsl 	}
    619    1.1       cgd }
    620    1.1       cgd 
    621  1.161       sjg 
    622  1.524    rillig /*
    623  1.602    rillig  * Handle an .info, .warning or .error directive.  For an .error directive,
    624  1.602    rillig  * exit immediately.
    625  1.524    rillig  */
    626  1.503    rillig static void
    627  1.602    rillig HandleMessage(ParseErrorLevel level, const char *levelName, const char *umsg)
    628  1.161       sjg {
    629  1.475    rillig 	char *xmsg;
    630  1.469    rillig 
    631  1.503    rillig 	if (umsg[0] == '\0') {
    632  1.503    rillig 		Parse_Error(PARSE_FATAL, "Missing argument for \".%s\"",
    633  1.503    rillig 		    levelName);
    634  1.503    rillig 		return;
    635  1.503    rillig 	}
    636  1.469    rillig 
    637  1.545    rillig 	(void)Var_Subst(umsg, SCOPE_CMDLINE, VARE_WANTRES, &xmsg);
    638  1.469    rillig 	/* TODO: handle errors */
    639  1.469    rillig 
    640  1.475    rillig 	Parse_Error(level, "%s", xmsg);
    641  1.475    rillig 	free(xmsg);
    642  1.469    rillig 
    643  1.475    rillig 	if (level == PARSE_FATAL) {
    644  1.469    rillig 		PrintOnError(NULL, NULL);
    645  1.469    rillig 		exit(1);
    646  1.469    rillig 	}
    647  1.161       sjg }
    648  1.161       sjg 
    649  1.524    rillig /*
    650  1.524    rillig  * Add the child to the parent's children.
    651    1.1       cgd  *
    652  1.382    rillig  * Additionally, add the parent to the child's parents, but only if the
    653  1.382    rillig  * target is not special.  An example for such a special target is .END,
    654  1.524    rillig  * which does not need to be informed once the child target has been made.
    655  1.524    rillig  */
    656  1.382    rillig static void
    657  1.553    rillig LinkSource(GNode *pgn, GNode *cgn, bool isSpecial)
    658  1.382    rillig {
    659  1.469    rillig 	if ((pgn->type & OP_DOUBLEDEP) && !Lst_IsEmpty(&pgn->cohorts))
    660  1.469    rillig 		pgn = pgn->cohorts.last->datum;
    661  1.316    rillig 
    662  1.469    rillig 	Lst_Append(&pgn->children, cgn);
    663  1.469    rillig 	pgn->unmade++;
    664  1.316    rillig 
    665  1.469    rillig 	/* Special targets like .END don't need any children. */
    666  1.469    rillig 	if (!isSpecial)
    667  1.469    rillig 		Lst_Append(&cgn->parents, pgn);
    668  1.469    rillig 
    669  1.469    rillig 	if (DEBUG(PARSE)) {
    670  1.586    rillig 		debug_printf("# LinkSource: added child %s - %s\n",
    671  1.586    rillig 		    pgn->name, cgn->name);
    672  1.469    rillig 		Targ_PrintNode(pgn, 0);
    673  1.469    rillig 		Targ_PrintNode(cgn, 0);
    674  1.469    rillig 	}
    675    1.1       cgd }
    676    1.1       cgd 
    677  1.382    rillig /* Add the node to each target from the current dependency group. */
    678  1.382    rillig static void
    679  1.553    rillig LinkToTargets(GNode *gn, bool isSpecial)
    680  1.382    rillig {
    681  1.469    rillig 	GNodeListNode *ln;
    682  1.469    rillig 
    683  1.469    rillig 	for (ln = targets->first; ln != NULL; ln = ln->next)
    684  1.469    rillig 		LinkSource(ln->datum, gn, isSpecial);
    685  1.382    rillig }
    686  1.382    rillig 
    687  1.553    rillig static bool
    688  1.337    rillig TryApplyDependencyOperator(GNode *gn, GNodeType op)
    689    1.1       cgd {
    690    1.1       cgd 	/*
    691  1.469    rillig 	 * If the node occurred on the left-hand side of a dependency and the
    692  1.469    rillig 	 * operator also defines a dependency, they must match.
    693    1.1       cgd 	 */
    694  1.469    rillig 	if ((op & OP_OPMASK) && (gn->type & OP_OPMASK) &&
    695  1.469    rillig 	    ((op & OP_OPMASK) != (gn->type & OP_OPMASK))) {
    696  1.469    rillig 		Parse_Error(PARSE_FATAL, "Inconsistent operator for %s",
    697  1.469    rillig 		    gn->name);
    698  1.553    rillig 		return false;
    699  1.469    rillig 	}
    700  1.469    rillig 
    701  1.469    rillig 	if (op == OP_DOUBLEDEP && (gn->type & OP_OPMASK) == OP_DOUBLEDEP) {
    702  1.469    rillig 		/*
    703  1.469    rillig 		 * If the node was of the left-hand side of a '::' operator,
    704  1.469    rillig 		 * we need to create a new instance of it for the children
    705  1.469    rillig 		 * and commands on this dependency line since each of these
    706  1.469    rillig 		 * dependency groups has its own attributes and commands,
    707  1.469    rillig 		 * separate from the others.
    708  1.469    rillig 		 *
    709  1.469    rillig 		 * The new instance is placed on the 'cohorts' list of the
    710  1.469    rillig 		 * initial one (note the initial one is not on its own
    711  1.469    rillig 		 * cohorts list) and the new instance is linked to all
    712  1.469    rillig 		 * parents of the initial instance.
    713  1.469    rillig 		 */
    714  1.469    rillig 		GNode *cohort;
    715   1.27  christos 
    716  1.469    rillig 		/*
    717  1.469    rillig 		 * Propagate copied bits to the initial node.  They'll be
    718  1.469    rillig 		 * propagated back to the rest of the cohorts later.
    719  1.469    rillig 		 */
    720  1.469    rillig 		gn->type |= op & ~OP_OPMASK;
    721   1.33   mycroft 
    722  1.469    rillig 		cohort = Targ_NewInternalNode(gn->name);
    723  1.469    rillig 		if (doing_depend)
    724  1.562    rillig 			RememberLocation(cohort);
    725  1.469    rillig 		/*
    726  1.469    rillig 		 * Make the cohort invisible as well to avoid duplicating it
    727  1.469    rillig 		 * into other variables. True, parents of this target won't
    728  1.469    rillig 		 * tend to do anything with their local variables, but better
    729  1.469    rillig 		 * safe than sorry.
    730  1.469    rillig 		 *
    731  1.469    rillig 		 * (I think this is pointless now, since the relevant list
    732  1.469    rillig 		 * traversals will no longer see this node anyway. -mycroft)
    733  1.469    rillig 		 */
    734  1.469    rillig 		cohort->type = op | OP_INVISIBLE;
    735  1.469    rillig 		Lst_Append(&gn->cohorts, cohort);
    736  1.469    rillig 		cohort->centurion = gn;
    737  1.469    rillig 		gn->unmade_cohorts++;
    738  1.469    rillig 		snprintf(cohort->cohort_num, sizeof cohort->cohort_num, "#%d",
    739  1.469    rillig 		    (unsigned int)gn->unmade_cohorts % 1000000);
    740  1.469    rillig 	} else {
    741  1.469    rillig 		/*
    742  1.469    rillig 		 * We don't want to nuke any previous flags (whatever they
    743  1.469    rillig 		 * were) so we just OR the new operator into the old.
    744  1.469    rillig 		 */
    745  1.469    rillig 		gn->type |= op;
    746  1.469    rillig 	}
    747   1.33   mycroft 
    748  1.553    rillig 	return true;
    749  1.337    rillig }
    750  1.337    rillig 
    751  1.337    rillig static void
    752  1.337    rillig ApplyDependencyOperator(GNodeType op)
    753  1.337    rillig {
    754  1.469    rillig 	GNodeListNode *ln;
    755  1.469    rillig 
    756  1.469    rillig 	for (ln = targets->first; ln != NULL; ln = ln->next)
    757  1.469    rillig 		if (!TryApplyDependencyOperator(ln->datum, op))
    758  1.469    rillig 			break;
    759    1.1       cgd }
    760    1.1       cgd 
    761  1.467    rillig /*
    762  1.467    rillig  * We add a .WAIT node in the dependency list. After any dynamic dependencies
    763  1.467    rillig  * (and filename globbing) have happened, it is given a dependency on each
    764  1.467    rillig  * previous child, back until the previous .WAIT node. The next child won't
    765  1.467    rillig  * be scheduled until the .WAIT node is built.
    766  1.467    rillig  *
    767  1.467    rillig  * We give each .WAIT node a unique name (mainly for diagnostics).
    768  1.467    rillig  */
    769  1.467    rillig static void
    770  1.593    rillig ApplyDependencySourceWait(bool isSpecial)
    771  1.467    rillig {
    772  1.467    rillig 	static int wait_number = 0;
    773  1.467    rillig 	char wait_src[16];
    774  1.467    rillig 	GNode *gn;
    775  1.467    rillig 
    776  1.467    rillig 	snprintf(wait_src, sizeof wait_src, ".WAIT_%u", ++wait_number);
    777  1.467    rillig 	gn = Targ_NewInternalNode(wait_src);
    778  1.467    rillig 	if (doing_depend)
    779  1.562    rillig 		RememberLocation(gn);
    780  1.467    rillig 	gn->type = OP_WAIT | OP_PHONY | OP_DEPENDS | OP_NOTMAIN;
    781  1.467    rillig 	LinkToTargets(gn, isSpecial);
    782  1.467    rillig 
    783  1.467    rillig }
    784  1.467    rillig 
    785  1.553    rillig static bool
    786  1.593    rillig ApplyDependencySourceKeyword(const char *src, ParseSpecial special)
    787    1.1       cgd {
    788  1.468    rillig 	int keywd;
    789  1.590    rillig 	GNodeType targetAttr;
    790    1.1       cgd 
    791  1.468    rillig 	if (*src != '.' || !ch_isupper(src[1]))
    792  1.553    rillig 		return false;
    793  1.468    rillig 
    794  1.602    rillig 	keywd = FindKeyword(src);
    795  1.468    rillig 	if (keywd == -1)
    796  1.553    rillig 		return false;
    797  1.468    rillig 
    798  1.590    rillig 	targetAttr = parseKeywords[keywd].targetAttr;
    799  1.590    rillig 	if (targetAttr != OP_NONE) {
    800  1.590    rillig 		ApplyDependencyOperator(targetAttr);
    801  1.553    rillig 		return true;
    802  1.468    rillig 	}
    803  1.590    rillig 	if (parseKeywords[keywd].special == SP_WAIT) {
    804  1.593    rillig 		ApplyDependencySourceWait(special != SP_NOT);
    805  1.553    rillig 		return true;
    806    1.1       cgd 	}
    807  1.553    rillig 	return false;
    808  1.368    rillig }
    809   1.18  christos 
    810  1.368    rillig static void
    811  1.593    rillig ApplyDependencySourceMain(const char *src)
    812  1.368    rillig {
    813  1.469    rillig 	/*
    814  1.549    rillig 	 * In a line like ".MAIN: source1 source2", add all sources to the
    815  1.549    rillig 	 * list of things to create, but only if the user didn't specify a
    816  1.549    rillig 	 * target on the command line and .MAIN occurs for the first time.
    817  1.469    rillig 	 *
    818  1.602    rillig 	 * See HandleDependencyTargetSpecial, branch SP_MAIN.
    819  1.469    rillig 	 * See unit-tests/cond-func-make-main.mk.
    820  1.469    rillig 	 */
    821  1.469    rillig 	Lst_Append(&opts.create, bmake_strdup(src));
    822  1.469    rillig 	/*
    823  1.469    rillig 	 * Add the name to the .TARGETS variable as well, so the user can
    824  1.469    rillig 	 * employ that, if desired.
    825  1.469    rillig 	 */
    826  1.542    rillig 	Global_Append(".TARGETS", src);
    827  1.368    rillig }
    828   1.18  christos 
    829  1.368    rillig static void
    830  1.593    rillig ApplyDependencySourceOrder(const char *src)
    831  1.368    rillig {
    832  1.469    rillig 	GNode *gn;
    833  1.469    rillig 	/*
    834  1.469    rillig 	 * Create proper predecessor/successor links between the previous
    835  1.469    rillig 	 * source and the current one.
    836  1.469    rillig 	 */
    837  1.469    rillig 	gn = Targ_GetNode(src);
    838  1.469    rillig 	if (doing_depend)
    839  1.562    rillig 		RememberLocation(gn);
    840  1.469    rillig 	if (order_pred != NULL) {
    841  1.469    rillig 		Lst_Append(&order_pred->order_succ, gn);
    842  1.469    rillig 		Lst_Append(&gn->order_pred, order_pred);
    843  1.469    rillig 		if (DEBUG(PARSE)) {
    844  1.586    rillig 			debug_printf(
    845  1.592    rillig 			    "# .ORDER forces '%s' to be made before '%s'\n",
    846  1.586    rillig 			    order_pred->name, gn->name);
    847  1.469    rillig 			Targ_PrintNode(order_pred, 0);
    848  1.469    rillig 			Targ_PrintNode(gn, 0);
    849  1.469    rillig 		}
    850  1.469    rillig 	}
    851  1.469    rillig 	/*
    852  1.469    rillig 	 * The current source now becomes the predecessor for the next one.
    853  1.469    rillig 	 */
    854  1.469    rillig 	order_pred = gn;
    855  1.368    rillig }
    856  1.368    rillig 
    857  1.368    rillig static void
    858  1.593    rillig ApplyDependencySourceOther(const char *src, GNodeType targetAttr,
    859  1.587    rillig 			   ParseSpecial special)
    860  1.368    rillig {
    861  1.469    rillig 	GNode *gn;
    862  1.469    rillig 
    863  1.469    rillig 	/*
    864  1.549    rillig 	 * The source is not an attribute, so find/create a node for it.
    865  1.549    rillig 	 * After that, apply any operator to it from a special target or
    866  1.549    rillig 	 * link it to its parents, as appropriate.
    867  1.469    rillig 	 *
    868  1.549    rillig 	 * In the case of a source that was the object of a '::' operator,
    869  1.469    rillig 	 * the attribute is applied to all of its instances (as kept in
    870  1.469    rillig 	 * the 'cohorts' list of the node) or all the cohorts are linked
    871  1.469    rillig 	 * to all the targets.
    872  1.469    rillig 	 */
    873  1.363    rillig 
    874  1.469    rillig 	/* Find/create the 'src' node and attach to all targets */
    875  1.469    rillig 	gn = Targ_GetNode(src);
    876  1.469    rillig 	if (doing_depend)
    877  1.562    rillig 		RememberLocation(gn);
    878  1.590    rillig 	if (targetAttr != OP_NONE)
    879  1.590    rillig 		gn->type |= targetAttr;
    880  1.469    rillig 	else
    881  1.587    rillig 		LinkToTargets(gn, special != SP_NOT);
    882    1.1       cgd }
    883    1.1       cgd 
    884  1.469    rillig /*
    885  1.469    rillig  * Given the name of a source in a dependency line, figure out if it is an
    886  1.590    rillig  * attribute (such as .SILENT) and if so, apply it to all targets. Otherwise
    887  1.368    rillig  * decide if there is some attribute which should be applied *to* the source
    888  1.368    rillig  * because of some special target (such as .PHONY) and apply it if so.
    889  1.590    rillig  * Otherwise, make the source a child of the targets.
    890  1.368    rillig  */
    891  1.368    rillig static void
    892  1.593    rillig ApplyDependencySource(GNodeType targetAttr, const char *src,
    893  1.590    rillig 		      ParseSpecial special)
    894  1.368    rillig {
    895  1.593    rillig 	if (ApplyDependencySourceKeyword(src, special))
    896  1.469    rillig 		return;
    897  1.368    rillig 
    898  1.587    rillig 	if (special == SP_MAIN)
    899  1.593    rillig 		ApplyDependencySourceMain(src);
    900  1.587    rillig 	else if (special == SP_ORDER)
    901  1.593    rillig 		ApplyDependencySourceOrder(src);
    902  1.469    rillig 	else
    903  1.593    rillig 		ApplyDependencySourceOther(src, targetAttr, special);
    904  1.368    rillig }
    905  1.368    rillig 
    906  1.469    rillig /*
    907  1.469    rillig  * If we have yet to decide on a main target to make, in the absence of any
    908  1.335    rillig  * user input, we want the first target on the first dependency line that is
    909  1.469    rillig  * actually a real target (i.e. isn't a .USE or .EXEC rule) to be made.
    910  1.469    rillig  */
    911  1.335    rillig static void
    912  1.335    rillig FindMainTarget(void)
    913    1.1       cgd {
    914  1.469    rillig 	GNodeListNode *ln;
    915  1.335    rillig 
    916  1.469    rillig 	if (mainNode != NULL)
    917  1.469    rillig 		return;
    918  1.335    rillig 
    919  1.469    rillig 	for (ln = targets->first; ln != NULL; ln = ln->next) {
    920  1.469    rillig 		GNode *gn = ln->datum;
    921  1.589    rillig 		if (GNode_IsMainCandidate(gn)) {
    922  1.469    rillig 			DEBUG1(MAKE, "Setting main node to \"%s\"\n", gn->name);
    923  1.469    rillig 			mainNode = gn;
    924  1.469    rillig 			Targ_SetMain(gn);
    925  1.469    rillig 			return;
    926  1.469    rillig 		}
    927  1.335    rillig 	}
    928    1.1       cgd }
    929    1.1       cgd 
    930  1.311    rillig static void
    931  1.602    rillig InvalidLineType(const char *lstart)
    932  1.311    rillig {
    933  1.469    rillig 	if ((strncmp(lstart, "<<<<<<", 6) == 0) ||
    934  1.469    rillig 	    (strncmp(lstart, "======", 6) == 0) ||
    935  1.469    rillig 	    (strncmp(lstart, ">>>>>>", 6) == 0))
    936  1.469    rillig 		Parse_Error(PARSE_FATAL,
    937  1.563    rillig 		    "Makefile appears to contain unresolved CVS/RCS/??? merge conflicts");
    938  1.469    rillig 	else if (lstart[0] == '.') {
    939  1.469    rillig 		const char *dirstart = lstart + 1;
    940  1.469    rillig 		const char *dirend;
    941  1.469    rillig 		cpp_skip_whitespace(&dirstart);
    942  1.469    rillig 		dirend = dirstart;
    943  1.469    rillig 		while (ch_isalnum(*dirend) || *dirend == '-')
    944  1.469    rillig 			dirend++;
    945  1.469    rillig 		Parse_Error(PARSE_FATAL, "Unknown directive \"%.*s\"",
    946  1.311    rillig 		    (int)(dirend - dirstart), dirstart);
    947  1.469    rillig 	} else
    948  1.535    rillig 		Parse_Error(PARSE_FATAL, "Invalid line type");
    949  1.311    rillig }
    950  1.311    rillig 
    951  1.314    rillig static void
    952  1.599    rillig ParseDependencyTargetWord(char **pp, const char *lstart)
    953  1.314    rillig {
    954  1.469    rillig 	const char *cp = *pp;
    955  1.469    rillig 
    956  1.469    rillig 	while (*cp != '\0') {
    957  1.469    rillig 		if ((ch_isspace(*cp) || *cp == '!' || *cp == ':' ||
    958  1.469    rillig 		     *cp == '(') &&
    959  1.602    rillig 		    !IsEscaped(lstart, cp))
    960  1.469    rillig 			break;
    961  1.314    rillig 
    962  1.469    rillig 		if (*cp == '$') {
    963  1.469    rillig 			/*
    964  1.469    rillig 			 * Must be a dynamic source (would have been expanded
    965  1.469    rillig 			 * otherwise), so call the Var module to parse the
    966  1.469    rillig 			 * puppy so we can safely advance beyond it.
    967  1.469    rillig 			 *
    968  1.469    rillig 			 * There should be no errors in this, as they would
    969  1.469    rillig 			 * have been discovered in the initial Var_Subst and
    970  1.469    rillig 			 * we wouldn't be here.
    971  1.469    rillig 			 */
    972  1.469    rillig 			const char *nested_p = cp;
    973  1.504    rillig 			FStr nested_val;
    974  1.314    rillig 
    975  1.551    rillig 			(void)Var_Parse(&nested_p, SCOPE_CMDLINE,
    976  1.551    rillig 			    VARE_PARSE_ONLY, &nested_val);
    977  1.469    rillig 			/* TODO: handle errors */
    978  1.504    rillig 			FStr_Done(&nested_val);
    979  1.469    rillig 			cp += nested_p - cp;
    980  1.469    rillig 		} else
    981  1.469    rillig 			cp++;
    982  1.469    rillig 	}
    983  1.314    rillig 
    984  1.599    rillig 	*pp += cp - *pp;
    985  1.314    rillig }
    986  1.314    rillig 
    987  1.559    rillig /*
    988  1.559    rillig  * Handle special targets like .PATH, .DEFAULT, .BEGIN, .ORDER.
    989  1.559    rillig  *
    990  1.559    rillig  * See the tests deptgt-*.mk.
    991  1.559    rillig  */
    992  1.368    rillig static void
    993  1.602    rillig HandleDependencyTargetSpecial(const char *targetName,
    994  1.602    rillig 			      ParseSpecial *inout_special,
    995  1.602    rillig 			      SearchPathList **inout_paths)
    996  1.368    rillig {
    997  1.587    rillig 	switch (*inout_special) {
    998  1.469    rillig 	case SP_PATH:
    999  1.469    rillig 		if (*inout_paths == NULL)
   1000  1.469    rillig 			*inout_paths = Lst_New();
   1001  1.469    rillig 		Lst_Append(*inout_paths, &dirSearchPath);
   1002  1.469    rillig 		break;
   1003  1.469    rillig 	case SP_MAIN:
   1004  1.469    rillig 		/*
   1005  1.469    rillig 		 * Allow targets from the command line to override the
   1006  1.469    rillig 		 * .MAIN node.
   1007  1.469    rillig 		 */
   1008  1.469    rillig 		if (!Lst_IsEmpty(&opts.create))
   1009  1.587    rillig 			*inout_special = SP_NOT;
   1010  1.469    rillig 		break;
   1011  1.469    rillig 	case SP_BEGIN:
   1012  1.469    rillig 	case SP_END:
   1013  1.469    rillig 	case SP_STALE:
   1014  1.469    rillig 	case SP_ERROR:
   1015  1.469    rillig 	case SP_INTERRUPT: {
   1016  1.530    rillig 		GNode *gn = Targ_GetNode(targetName);
   1017  1.469    rillig 		if (doing_depend)
   1018  1.562    rillig 			RememberLocation(gn);
   1019  1.469    rillig 		gn->type |= OP_NOTMAIN | OP_SPECIAL;
   1020  1.469    rillig 		Lst_Append(targets, gn);
   1021  1.469    rillig 		break;
   1022  1.469    rillig 	}
   1023  1.469    rillig 	case SP_DEFAULT: {
   1024  1.469    rillig 		/*
   1025  1.469    rillig 		 * Need to create a node to hang commands on, but we don't
   1026  1.469    rillig 		 * want it in the graph, nor do we want it to be the Main
   1027  1.469    rillig 		 * Target. We claim the node is a transformation rule to make
   1028  1.469    rillig 		 * life easier later, when we'll use Make_HandleUse to
   1029  1.469    rillig 		 * actually apply the .DEFAULT commands.
   1030  1.469    rillig 		 */
   1031  1.469    rillig 		GNode *gn = GNode_New(".DEFAULT");
   1032  1.469    rillig 		gn->type |= OP_NOTMAIN | OP_TRANSFORM;
   1033  1.469    rillig 		Lst_Append(targets, gn);
   1034  1.469    rillig 		defaultNode = gn;
   1035  1.469    rillig 		break;
   1036  1.469    rillig 	}
   1037  1.469    rillig 	case SP_DELETE_ON_ERROR:
   1038  1.553    rillig 		deleteOnError = true;
   1039  1.469    rillig 		break;
   1040  1.469    rillig 	case SP_NOTPARALLEL:
   1041  1.469    rillig 		opts.maxJobs = 1;
   1042  1.469    rillig 		break;
   1043  1.469    rillig 	case SP_SINGLESHELL:
   1044  1.553    rillig 		opts.compatMake = true;
   1045  1.469    rillig 		break;
   1046  1.469    rillig 	case SP_ORDER:
   1047  1.469    rillig 		order_pred = NULL;
   1048  1.469    rillig 		break;
   1049  1.469    rillig 	default:
   1050  1.469    rillig 		break;
   1051  1.469    rillig 	}
   1052  1.368    rillig }
   1053  1.368    rillig 
   1054  1.553    rillig static bool
   1055  1.602    rillig HandleDependencyTargetPath(const char *suffixName,
   1056  1.602    rillig 			   SearchPathList **inout_paths)
   1057  1.368    rillig {
   1058  1.469    rillig 	SearchPath *path;
   1059  1.368    rillig 
   1060  1.530    rillig 	path = Suff_GetPath(suffixName);
   1061  1.469    rillig 	if (path == NULL) {
   1062  1.469    rillig 		Parse_Error(PARSE_FATAL,
   1063  1.530    rillig 		    "Suffix '%s' not defined (yet)", suffixName);
   1064  1.553    rillig 		return false;
   1065  1.469    rillig 	}
   1066  1.430    rillig 
   1067  1.469    rillig 	if (*inout_paths == NULL)
   1068  1.469    rillig 		*inout_paths = Lst_New();
   1069  1.469    rillig 	Lst_Append(*inout_paths, path);
   1070  1.430    rillig 
   1071  1.553    rillig 	return true;
   1072  1.368    rillig }
   1073  1.368    rillig 
   1074  1.368    rillig /*
   1075  1.587    rillig  * See if it's a special target and if so set inout_special to match it.
   1076  1.364    rillig  */
   1077  1.553    rillig static bool
   1078  1.602    rillig HandleDependencyTarget(const char *targetName,
   1079  1.602    rillig 		       ParseSpecial *inout_special,
   1080  1.602    rillig 		       GNodeType *inout_targetAttr,
   1081  1.602    rillig 		       SearchPathList **inout_paths)
   1082  1.364    rillig {
   1083  1.469    rillig 	int keywd;
   1084  1.469    rillig 
   1085  1.530    rillig 	if (!(targetName[0] == '.' && ch_isupper(targetName[1])))
   1086  1.553    rillig 		return true;
   1087  1.469    rillig 
   1088  1.469    rillig 	/*
   1089  1.469    rillig 	 * See if the target is a special target that must have it
   1090  1.469    rillig 	 * or its sources handled specially.
   1091  1.469    rillig 	 */
   1092  1.602    rillig 	keywd = FindKeyword(targetName);
   1093  1.469    rillig 	if (keywd != -1) {
   1094  1.587    rillig 		if (*inout_special == SP_PATH &&
   1095  1.590    rillig 		    parseKeywords[keywd].special != SP_PATH) {
   1096  1.469    rillig 			Parse_Error(PARSE_FATAL, "Mismatched special targets");
   1097  1.553    rillig 			return false;
   1098  1.469    rillig 		}
   1099  1.469    rillig 
   1100  1.590    rillig 		*inout_special = parseKeywords[keywd].special;
   1101  1.590    rillig 		*inout_targetAttr = parseKeywords[keywd].targetAttr;
   1102  1.469    rillig 
   1103  1.602    rillig 		HandleDependencyTargetSpecial(targetName, inout_special,
   1104  1.469    rillig 		    inout_paths);
   1105  1.364    rillig 
   1106  1.530    rillig 	} else if (strncmp(targetName, ".PATH", 5) == 0) {
   1107  1.587    rillig 		*inout_special = SP_PATH;
   1108  1.602    rillig 		if (!HandleDependencyTargetPath(targetName + 5, inout_paths))
   1109  1.553    rillig 			return false;
   1110  1.469    rillig 	}
   1111  1.553    rillig 	return true;
   1112  1.368    rillig }
   1113  1.368    rillig 
   1114  1.368    rillig static void
   1115  1.602    rillig HandleDependencyTargetMundane(char *targetName)
   1116  1.368    rillig {
   1117  1.595    rillig 	StringList targetNames = LST_INIT;
   1118  1.595    rillig 
   1119  1.530    rillig 	if (Dir_HasWildcards(targetName)) {
   1120  1.469    rillig 		SearchPath *emptyPath = SearchPath_New();
   1121  1.595    rillig 		SearchPath_Expand(emptyPath, targetName, &targetNames);
   1122  1.469    rillig 		SearchPath_Free(emptyPath);
   1123  1.595    rillig 	} else
   1124  1.595    rillig 		Lst_Append(&targetNames, targetName);
   1125  1.368    rillig 
   1126  1.595    rillig 	while (!Lst_IsEmpty(&targetNames)) {
   1127  1.595    rillig 		char *targName = Lst_Dequeue(&targetNames);
   1128  1.469    rillig 		GNode *gn = Suff_IsTransform(targName)
   1129  1.368    rillig 		    ? Suff_AddTransform(targName)
   1130  1.368    rillig 		    : Targ_GetNode(targName);
   1131  1.469    rillig 		if (doing_depend)
   1132  1.562    rillig 			RememberLocation(gn);
   1133  1.368    rillig 
   1134  1.469    rillig 		Lst_Append(targets, gn);
   1135  1.469    rillig 	}
   1136  1.368    rillig }
   1137  1.368    rillig 
   1138  1.368    rillig static void
   1139  1.603    rillig SkipExtraTargets(char **pp, const char *lstart)
   1140  1.368    rillig {
   1141  1.553    rillig 	bool warning = false;
   1142  1.603    rillig 	const char *cp = *pp;
   1143  1.368    rillig 
   1144  1.469    rillig 	while (*cp != '\0') {
   1145  1.602    rillig 		if (!IsEscaped(lstart, cp) && (*cp == '!' || *cp == ':'))
   1146  1.469    rillig 			break;
   1147  1.602    rillig 		if (IsEscaped(lstart, cp) || (*cp != ' ' && *cp != '\t'))
   1148  1.553    rillig 			warning = true;
   1149  1.469    rillig 		cp++;
   1150  1.469    rillig 	}
   1151  1.469    rillig 	if (warning)
   1152  1.469    rillig 		Parse_Error(PARSE_WARNING, "Extra target ignored");
   1153  1.430    rillig 
   1154  1.603    rillig 	*pp += cp - *pp;
   1155  1.368    rillig }
   1156  1.368    rillig 
   1157  1.368    rillig static void
   1158  1.587    rillig ParseDependencyCheckSpecial(ParseSpecial special)
   1159  1.368    rillig {
   1160  1.587    rillig 	switch (special) {
   1161  1.469    rillig 	case SP_DEFAULT:
   1162  1.469    rillig 	case SP_STALE:
   1163  1.469    rillig 	case SP_BEGIN:
   1164  1.469    rillig 	case SP_END:
   1165  1.469    rillig 	case SP_ERROR:
   1166  1.469    rillig 	case SP_INTERRUPT:
   1167  1.469    rillig 		/*
   1168  1.469    rillig 		 * These create nodes on which to hang commands, so targets
   1169  1.469    rillig 		 * shouldn't be empty.
   1170  1.469    rillig 		 */
   1171  1.469    rillig 	case SP_NOT:
   1172  1.583    rillig 		/*
   1173  1.583    rillig 		 * Nothing special here -- targets can be empty if it wants.
   1174  1.583    rillig 		 */
   1175  1.469    rillig 		break;
   1176  1.582    rillig 	default:
   1177  1.582    rillig 		Parse_Error(PARSE_WARNING,
   1178  1.582    rillig 		    "Special and mundane targets don't mix. "
   1179  1.582    rillig 		    "Mundane ones ignored");
   1180  1.582    rillig 		break;
   1181  1.469    rillig 	}
   1182  1.368    rillig }
   1183  1.368    rillig 
   1184  1.560    rillig /*
   1185  1.560    rillig  * In a dependency line like 'targets: sources' or 'targets! sources', parse
   1186  1.560    rillig  * the operator ':', '::' or '!' from between the targets and the sources.
   1187  1.560    rillig  */
   1188  1.578    rillig static GNodeType
   1189  1.578    rillig ParseDependencyOp(char **pp)
   1190  1.368    rillig {
   1191  1.578    rillig 	if (**pp == '!')
   1192  1.578    rillig 		return (*pp)++, OP_FORCE;
   1193  1.578    rillig 	if ((*pp)[1] == ':')
   1194  1.578    rillig 		return (*pp) += 2, OP_DOUBLEDEP;
   1195  1.578    rillig 	else
   1196  1.578    rillig 		return (*pp)++, OP_DEPENDS;
   1197  1.368    rillig }
   1198  1.364    rillig 
   1199  1.368    rillig static void
   1200  1.392    rillig ClearPaths(SearchPathList *paths)
   1201  1.392    rillig {
   1202  1.469    rillig 	if (paths != NULL) {
   1203  1.469    rillig 		SearchPathListNode *ln;
   1204  1.469    rillig 		for (ln = paths->first; ln != NULL; ln = ln->next)
   1205  1.469    rillig 			SearchPath_Clear(ln->datum);
   1206  1.469    rillig 	}
   1207  1.392    rillig 
   1208  1.469    rillig 	Dir_SetPATH();
   1209  1.392    rillig }
   1210  1.392    rillig 
   1211  1.558    rillig /*
   1212  1.558    rillig  * Several special targets take different actions if present with no
   1213  1.558    rillig  * sources:
   1214  1.558    rillig  *	a .SUFFIXES line with no sources clears out all old suffixes
   1215  1.558    rillig  *	a .PRECIOUS line makes all targets precious
   1216  1.558    rillig  *	a .IGNORE line ignores errors for all targets
   1217  1.558    rillig  *	a .SILENT line creates silence when making all targets
   1218  1.558    rillig  *	a .PATH removes all directories from the search path(s).
   1219  1.558    rillig  */
   1220  1.392    rillig static void
   1221  1.587    rillig ParseDependencySourcesEmpty(ParseSpecial special, SearchPathList *paths)
   1222  1.368    rillig {
   1223  1.587    rillig 	switch (special) {
   1224  1.469    rillig 	case SP_SUFFIXES:
   1225  1.469    rillig 		Suff_ClearSuffixes();
   1226  1.469    rillig 		break;
   1227  1.469    rillig 	case SP_PRECIOUS:
   1228  1.553    rillig 		allPrecious = true;
   1229  1.469    rillig 		break;
   1230  1.469    rillig 	case SP_IGNORE:
   1231  1.553    rillig 		opts.ignoreErrors = true;
   1232  1.469    rillig 		break;
   1233  1.469    rillig 	case SP_SILENT:
   1234  1.584    rillig 		opts.silent = true;
   1235  1.469    rillig 		break;
   1236  1.469    rillig 	case SP_PATH:
   1237  1.469    rillig 		ClearPaths(paths);
   1238  1.469    rillig 		break;
   1239  1.368    rillig #ifdef POSIX
   1240  1.469    rillig 	case SP_POSIX:
   1241  1.540    rillig 		Global_Set("%POSIX", "1003.2");
   1242  1.469    rillig 		break;
   1243  1.368    rillig #endif
   1244  1.469    rillig 	default:
   1245  1.469    rillig 		break;
   1246  1.469    rillig 	}
   1247  1.368    rillig }
   1248  1.364    rillig 
   1249  1.393    rillig static void
   1250  1.393    rillig AddToPaths(const char *dir, SearchPathList *paths)
   1251  1.393    rillig {
   1252  1.469    rillig 	if (paths != NULL) {
   1253  1.469    rillig 		SearchPathListNode *ln;
   1254  1.469    rillig 		for (ln = paths->first; ln != NULL; ln = ln->next)
   1255  1.529    rillig 			(void)SearchPath_Add(ln->datum, dir);
   1256  1.469    rillig 	}
   1257  1.393    rillig }
   1258  1.393    rillig 
   1259  1.368    rillig /*
   1260  1.610    rillig  * If the target was one that doesn't take files as its sources but takes
   1261  1.610    rillig  * something like suffixes, we take each space-separated word on the line as
   1262  1.610    rillig  * a something and deal with it accordingly.
   1263  1.368    rillig  */
   1264  1.368    rillig static void
   1265  1.587    rillig ParseDependencySourceSpecial(ParseSpecial special, char *word,
   1266  1.556    rillig 			     SearchPathList *paths)
   1267  1.368    rillig {
   1268  1.587    rillig 	switch (special) {
   1269  1.469    rillig 	case SP_SUFFIXES:
   1270  1.469    rillig 		Suff_AddSuffix(word, &mainNode);
   1271  1.469    rillig 		break;
   1272  1.469    rillig 	case SP_PATH:
   1273  1.469    rillig 		AddToPaths(word, paths);
   1274  1.469    rillig 		break;
   1275  1.469    rillig 	case SP_INCLUDES:
   1276  1.469    rillig 		Suff_AddInclude(word);
   1277  1.469    rillig 		break;
   1278  1.469    rillig 	case SP_LIBS:
   1279  1.469    rillig 		Suff_AddLib(word);
   1280  1.469    rillig 		break;
   1281  1.469    rillig 	case SP_NULL:
   1282  1.469    rillig 		Suff_SetNull(word);
   1283  1.469    rillig 		break;
   1284  1.469    rillig 	case SP_OBJDIR:
   1285  1.553    rillig 		Main_SetObjdir(false, "%s", word);
   1286  1.469    rillig 		break;
   1287  1.469    rillig 	default:
   1288  1.469    rillig 		break;
   1289  1.469    rillig 	}
   1290  1.368    rillig }
   1291  1.364    rillig 
   1292  1.553    rillig static bool
   1293  1.601    rillig ApplyDependencyTarget(char *name, char *nameEnd, ParseSpecial *inout_special,
   1294  1.601    rillig 		      GNodeType *inout_targetAttr,
   1295  1.601    rillig 		      SearchPathList **inout_paths)
   1296  1.601    rillig {
   1297  1.601    rillig 	char savec = *nameEnd;
   1298  1.601    rillig 	*nameEnd = '\0';
   1299  1.601    rillig 
   1300  1.602    rillig 	if (!HandleDependencyTarget(name, inout_special,
   1301  1.601    rillig 	    inout_targetAttr, inout_paths))
   1302  1.601    rillig 		return false;
   1303  1.601    rillig 
   1304  1.601    rillig 	if (*inout_special == SP_NOT && *name != '\0')
   1305  1.602    rillig 		HandleDependencyTargetMundane(name);
   1306  1.601    rillig 	else if (*inout_special == SP_PATH && *name != '.' && *name != '\0')
   1307  1.601    rillig 		Parse_Error(PARSE_WARNING, "Extra target (%s) ignored", name);
   1308  1.601    rillig 
   1309  1.601    rillig 	*nameEnd = savec;
   1310  1.601    rillig 	return true;
   1311  1.601    rillig }
   1312  1.601    rillig 
   1313  1.601    rillig static bool
   1314  1.556    rillig ParseDependencyTargets(char **inout_cp,
   1315  1.556    rillig 		       const char *lstart,
   1316  1.587    rillig 		       ParseSpecial *inout_special,
   1317  1.590    rillig 		       GNodeType *inout_targetAttr,
   1318  1.595    rillig 		       SearchPathList **inout_paths)
   1319  1.368    rillig {
   1320  1.469    rillig 	char *cp;
   1321  1.598    rillig 	char *tgt = *inout_cp;
   1322  1.469    rillig 
   1323  1.469    rillig 	for (;;) {
   1324  1.469    rillig 		/* Find the end of the next word. */
   1325  1.469    rillig 		cp = tgt;
   1326  1.599    rillig 		ParseDependencyTargetWord(&cp, lstart);
   1327  1.469    rillig 
   1328  1.469    rillig 		/*
   1329  1.469    rillig 		 * If the word is followed by a left parenthesis, it's the
   1330  1.596    rillig 		 * name of one or more files inside an archive.
   1331  1.469    rillig 		 */
   1332  1.602    rillig 		if (!IsEscaped(lstart, cp) && *cp == '(') {
   1333  1.545    rillig 			if (!Arch_ParseArchive(&tgt, targets, SCOPE_CMDLINE)) {
   1334  1.469    rillig 				Parse_Error(PARSE_FATAL,
   1335  1.469    rillig 				    "Error in archive specification: \"%s\"",
   1336  1.469    rillig 				    tgt);
   1337  1.553    rillig 				return false;
   1338  1.469    rillig 			}
   1339  1.469    rillig 
   1340  1.469    rillig 			cp = tgt;
   1341  1.469    rillig 			continue;
   1342  1.469    rillig 		}
   1343  1.444    rillig 
   1344  1.469    rillig 		if (*cp == '\0') {
   1345  1.602    rillig 			InvalidLineType(lstart);
   1346  1.553    rillig 			return false;
   1347  1.469    rillig 		}
   1348   1.27  christos 
   1349  1.601    rillig 		if (!ApplyDependencyTarget(tgt, cp, inout_special,
   1350  1.590    rillig 		    inout_targetAttr, inout_paths))
   1351  1.553    rillig 			return false;
   1352  1.118       dsl 
   1353  1.587    rillig 		if (*inout_special != SP_NOT && *inout_special != SP_PATH)
   1354  1.603    rillig 			SkipExtraTargets(&cp, lstart);
   1355  1.469    rillig 		else
   1356  1.469    rillig 			pp_skip_whitespace(&cp);
   1357  1.368    rillig 
   1358  1.469    rillig 		tgt = cp;
   1359  1.469    rillig 		if (*tgt == '\0')
   1360  1.469    rillig 			break;
   1361  1.602    rillig 		if ((*tgt == '!' || *tgt == ':') && !IsEscaped(lstart, tgt))
   1362  1.469    rillig 			break;
   1363  1.469    rillig 	}
   1364  1.430    rillig 
   1365  1.469    rillig 	*inout_cp = cp;
   1366  1.553    rillig 	return true;
   1367  1.368    rillig }
   1368   1.27  christos 
   1369  1.368    rillig static void
   1370  1.597    rillig ParseDependencySourcesSpecial(char *start,
   1371  1.587    rillig 			      ParseSpecial special, SearchPathList *paths)
   1372  1.368    rillig {
   1373  1.469    rillig 	char savec;
   1374  1.204  dholland 
   1375  1.469    rillig 	while (*start != '\0') {
   1376  1.597    rillig 		char *end = start;
   1377  1.469    rillig 		while (*end != '\0' && !ch_isspace(*end))
   1378  1.469    rillig 			end++;
   1379  1.469    rillig 		savec = *end;
   1380  1.469    rillig 		*end = '\0';
   1381  1.587    rillig 		ParseDependencySourceSpecial(special, start, paths);
   1382  1.469    rillig 		*end = savec;
   1383  1.469    rillig 		if (savec != '\0')
   1384  1.469    rillig 			end++;
   1385  1.469    rillig 		pp_skip_whitespace(&end);
   1386  1.469    rillig 		start = end;
   1387  1.469    rillig 	}
   1388  1.368    rillig }
   1389  1.368    rillig 
   1390  1.553    rillig static bool
   1391  1.597    rillig ParseDependencySourcesMundane(char *start,
   1392  1.590    rillig 			      ParseSpecial special, GNodeType targetAttr)
   1393  1.368    rillig {
   1394  1.469    rillig 	while (*start != '\0') {
   1395  1.597    rillig 		char *end = start;
   1396  1.367    rillig 		/*
   1397  1.469    rillig 		 * The targets take real sources, so we must beware of archive
   1398  1.469    rillig 		 * specifications (i.e. things with left parentheses in them)
   1399  1.469    rillig 		 * and handle them accordingly.
   1400  1.367    rillig 		 */
   1401  1.469    rillig 		for (; *end != '\0' && !ch_isspace(*end); end++) {
   1402  1.469    rillig 			if (*end == '(' && end > start && end[-1] != '$') {
   1403  1.469    rillig 				/*
   1404  1.469    rillig 				 * Only stop for a left parenthesis if it
   1405  1.469    rillig 				 * isn't at the start of a word (that'll be
   1406  1.469    rillig 				 * for variable changes later) and isn't
   1407  1.469    rillig 				 * preceded by a dollar sign (a dynamic
   1408  1.469    rillig 				 * source).
   1409  1.469    rillig 				 */
   1410  1.469    rillig 				break;
   1411  1.469    rillig 			}
   1412  1.469    rillig 		}
   1413  1.368    rillig 
   1414  1.469    rillig 		if (*end == '(') {
   1415  1.469    rillig 			GNodeList sources = LST_INIT;
   1416  1.545    rillig 			if (!Arch_ParseArchive(&start, &sources,
   1417  1.545    rillig 			    SCOPE_CMDLINE)) {
   1418  1.469    rillig 				Parse_Error(PARSE_FATAL,
   1419  1.469    rillig 				    "Error in source archive spec \"%s\"",
   1420  1.469    rillig 				    start);
   1421  1.553    rillig 				return false;
   1422  1.469    rillig 			}
   1423  1.368    rillig 
   1424  1.469    rillig 			while (!Lst_IsEmpty(&sources)) {
   1425  1.469    rillig 				GNode *gn = Lst_Dequeue(&sources);
   1426  1.593    rillig 				ApplyDependencySource(targetAttr, gn->name,
   1427  1.590    rillig 				    special);
   1428  1.469    rillig 			}
   1429  1.469    rillig 			Lst_Done(&sources);
   1430  1.469    rillig 			end = start;
   1431  1.469    rillig 		} else {
   1432  1.469    rillig 			if (*end != '\0') {
   1433  1.469    rillig 				*end = '\0';
   1434  1.469    rillig 				end++;
   1435  1.469    rillig 			}
   1436  1.368    rillig 
   1437  1.593    rillig 			ApplyDependencySource(targetAttr, start, special);
   1438  1.469    rillig 		}
   1439  1.469    rillig 		pp_skip_whitespace(&end);
   1440  1.469    rillig 		start = end;
   1441  1.368    rillig 	}
   1442  1.553    rillig 	return true;
   1443  1.368    rillig }
   1444    1.1       cgd 
   1445  1.559    rillig /*
   1446  1.559    rillig  * In a dependency line like 'targets: sources', parse the sources.
   1447  1.559    rillig  *
   1448  1.559    rillig  * See the tests depsrc-*.mk.
   1449  1.559    rillig  */
   1450  1.558    rillig static void
   1451  1.597    rillig ParseDependencySources(char *p, GNodeType targetAttr,
   1452  1.587    rillig 		       ParseSpecial special, SearchPathList **inout_paths)
   1453  1.558    rillig {
   1454  1.597    rillig 	if (*p == '\0') {
   1455  1.587    rillig 		ParseDependencySourcesEmpty(special, *inout_paths);
   1456  1.587    rillig 	} else if (special == SP_MFLAGS) {
   1457  1.597    rillig 		Main_ParseArgLine(p);
   1458  1.558    rillig 		/*
   1459  1.558    rillig 		 * Set the initial character to a null-character so the loop
   1460  1.558    rillig 		 * to get sources won't get anything.
   1461  1.558    rillig 		 */
   1462  1.597    rillig 		*p = '\0';
   1463  1.587    rillig 	} else if (special == SP_SHELL) {
   1464  1.597    rillig 		if (!Job_ParseShell(p)) {
   1465  1.558    rillig 			Parse_Error(PARSE_FATAL,
   1466  1.558    rillig 			    "improper shell specification");
   1467  1.558    rillig 			return;
   1468  1.558    rillig 		}
   1469  1.597    rillig 		*p = '\0';
   1470  1.587    rillig 	} else if (special == SP_NOTPARALLEL || special == SP_SINGLESHELL ||
   1471  1.587    rillig 		   special == SP_DELETE_ON_ERROR) {
   1472  1.597    rillig 		*p = '\0';
   1473  1.558    rillig 	}
   1474  1.558    rillig 
   1475  1.558    rillig 	/* Now go for the sources. */
   1476  1.587    rillig 	if (special == SP_SUFFIXES || special == SP_PATH ||
   1477  1.587    rillig 	    special == SP_INCLUDES || special == SP_LIBS ||
   1478  1.587    rillig 	    special == SP_NULL || special == SP_OBJDIR) {
   1479  1.597    rillig 		ParseDependencySourcesSpecial(p, special, *inout_paths);
   1480  1.558    rillig 		if (*inout_paths != NULL) {
   1481  1.558    rillig 			Lst_Free(*inout_paths);
   1482  1.558    rillig 			*inout_paths = NULL;
   1483  1.558    rillig 		}
   1484  1.587    rillig 		if (special == SP_PATH)
   1485  1.558    rillig 			Dir_SetPATH();
   1486  1.558    rillig 	} else {
   1487  1.558    rillig 		assert(*inout_paths == NULL);
   1488  1.597    rillig 		if (!ParseDependencySourcesMundane(p, special, targetAttr))
   1489  1.558    rillig 			return;
   1490  1.558    rillig 	}
   1491  1.558    rillig 
   1492  1.558    rillig 	FindMainTarget();
   1493  1.558    rillig }
   1494  1.558    rillig 
   1495  1.524    rillig /*
   1496  1.524    rillig  * Parse a dependency line consisting of targets, followed by a dependency
   1497  1.368    rillig  * operator, optionally followed by sources.
   1498  1.368    rillig  *
   1499  1.368    rillig  * The nodes of the sources are linked as children to the nodes of the
   1500  1.368    rillig  * targets. Nodes are created as necessary.
   1501  1.368    rillig  *
   1502  1.368    rillig  * The operator is applied to each node in the global 'targets' list,
   1503  1.585    rillig  * which is where the nodes found for the targets are kept.
   1504  1.368    rillig  *
   1505  1.368    rillig  * The sources are parsed in much the same way as the targets, except
   1506  1.368    rillig  * that they are expanded using the wildcarding scheme of the C-Shell,
   1507  1.441    rillig  * and a target is created for each expanded word. Each of the resulting
   1508  1.441    rillig  * nodes is then linked to each of the targets as one of its children.
   1509  1.368    rillig  *
   1510  1.368    rillig  * Certain targets and sources such as .PHONY or .PRECIOUS are handled
   1511  1.585    rillig  * specially, see ParseSpecial.
   1512  1.368    rillig  *
   1513  1.585    rillig  * Transformation rules such as '.c.o' are also handled here, see
   1514  1.585    rillig  * Suff_AddTransform.
   1515  1.441    rillig  *
   1516  1.441    rillig  * Upon return, the value of the line is unspecified.
   1517  1.368    rillig  */
   1518  1.368    rillig static void
   1519  1.556    rillig ParseDependency(char *line)
   1520  1.368    rillig {
   1521  1.600    rillig 	char *p;
   1522  1.583    rillig 	SearchPathList *paths;	/* search paths to alter when parsing a list
   1523  1.583    rillig 				 * of .PATH targets */
   1524  1.590    rillig 	GNodeType targetAttr;	/* from special sources */
   1525  1.600    rillig 	ParseSpecial special;	/* in special targets, the children are
   1526  1.600    rillig 				 * linked as children of the parent but not
   1527  1.600    rillig 				 * vice versa */
   1528  1.469    rillig 
   1529  1.556    rillig 	DEBUG1(PARSE, "ParseDependency(%s)\n", line);
   1530  1.600    rillig 	p = line;
   1531  1.600    rillig 	paths = NULL;
   1532  1.590    rillig 	targetAttr = OP_NONE;
   1533  1.600    rillig 	special = SP_NOT;
   1534  1.469    rillig 
   1535  1.600    rillig 	if (!ParseDependencyTargets(&p, line, &special, &targetAttr, &paths))
   1536  1.469    rillig 		goto out;
   1537  1.469    rillig 
   1538  1.469    rillig 	if (!Lst_IsEmpty(targets))
   1539  1.587    rillig 		ParseDependencyCheckSpecial(special);
   1540  1.469    rillig 
   1541  1.600    rillig 	ApplyDependencyOperator(ParseDependencyOp(&p));
   1542  1.469    rillig 
   1543  1.600    rillig 	pp_skip_whitespace(&p);
   1544  1.469    rillig 
   1545  1.600    rillig 	ParseDependencySources(p, targetAttr, special, &paths);
   1546    1.1       cgd 
   1547  1.112  christos out:
   1548  1.469    rillig 	if (paths != NULL)
   1549  1.469    rillig 		Lst_Free(paths);
   1550    1.1       cgd }
   1551    1.1       cgd 
   1552  1.605    rillig typedef enum VarAssignOp {
   1553  1.605    rillig 	VAR_NORMAL,		/* = */
   1554  1.605    rillig 	VAR_APPEND,		/* += */
   1555  1.605    rillig 	VAR_DEFAULT,		/* ?= */
   1556  1.605    rillig 	VAR_SUBST,		/* := */
   1557  1.605    rillig 	VAR_SHELL		/* != or :sh= */
   1558  1.605    rillig } VarAssignOp;
   1559  1.605    rillig 
   1560  1.605    rillig typedef struct VarAssign {
   1561  1.605    rillig 	char *varname;		/* unexpanded */
   1562  1.605    rillig 	VarAssignOp op;
   1563  1.605    rillig 	const char *value;	/* unexpanded */
   1564  1.605    rillig } VarAssign;
   1565  1.605    rillig 
   1566  1.469    rillig /*
   1567  1.469    rillig  * Determine the assignment operator and adjust the end of the variable
   1568  1.469    rillig  * name accordingly.
   1569  1.469    rillig  */
   1570  1.606    rillig static VarAssign
   1571  1.606    rillig AdjustVarassignOp(const char *name, const char *nameEnd, const char *op,
   1572  1.606    rillig 		  const char *value)
   1573  1.388    rillig {
   1574  1.469    rillig 	VarAssignOp type;
   1575  1.606    rillig 	VarAssign va;
   1576  1.469    rillig 
   1577  1.469    rillig 	if (op > name && op[-1] == '+') {
   1578  1.579    rillig 		op--;
   1579  1.469    rillig 		type = VAR_APPEND;
   1580  1.469    rillig 
   1581  1.469    rillig 	} else if (op > name && op[-1] == '?') {
   1582  1.469    rillig 		op--;
   1583  1.469    rillig 		type = VAR_DEFAULT;
   1584  1.469    rillig 
   1585  1.469    rillig 	} else if (op > name && op[-1] == ':') {
   1586  1.469    rillig 		op--;
   1587  1.469    rillig 		type = VAR_SUBST;
   1588  1.469    rillig 
   1589  1.469    rillig 	} else if (op > name && op[-1] == '!') {
   1590  1.469    rillig 		op--;
   1591  1.469    rillig 		type = VAR_SHELL;
   1592  1.388    rillig 
   1593  1.469    rillig 	} else {
   1594  1.469    rillig 		type = VAR_NORMAL;
   1595  1.388    rillig #ifdef SUNSHCMD
   1596  1.469    rillig 		while (op > name && ch_isspace(op[-1]))
   1597  1.469    rillig 			op--;
   1598  1.388    rillig 
   1599  1.608    rillig 		if (op - name >= 3 && memcmp(op - 3, ":sh", 3) == 0) {
   1600  1.579    rillig 			op -= 3;
   1601  1.469    rillig 			type = VAR_SHELL;
   1602  1.469    rillig 		}
   1603  1.469    rillig #endif
   1604  1.388    rillig 	}
   1605  1.388    rillig 
   1606  1.606    rillig 	va.varname = bmake_strsedup(name, nameEnd < op ? nameEnd : op);
   1607  1.606    rillig 	va.op = type;
   1608  1.606    rillig 	va.value = value;
   1609  1.606    rillig 	return va;
   1610  1.388    rillig }
   1611  1.388    rillig 
   1612  1.469    rillig /*
   1613  1.469    rillig  * Parse a variable assignment, consisting of a single-word variable name,
   1614  1.368    rillig  * optional whitespace, an assignment operator, optional whitespace and the
   1615  1.368    rillig  * variable value.
   1616   1.84       wiz  *
   1617  1.410    rillig  * Note: There is a lexical ambiguity with assignment modifier characters
   1618  1.410    rillig  * in variable names. This routine interprets the character before the =
   1619  1.410    rillig  * as a modifier. Therefore, an assignment like
   1620  1.410    rillig  *	C++=/usr/bin/CC
   1621  1.410    rillig  * is interpreted as "C+ +=" instead of "C++ =".
   1622  1.410    rillig  *
   1623  1.469    rillig  * Used for both lines in a file and command line arguments.
   1624  1.469    rillig  */
   1625  1.605    rillig static bool
   1626  1.368    rillig Parse_IsVar(const char *p, VarAssign *out_var)
   1627    1.1       cgd {
   1628  1.606    rillig 	const char *nameStart;
   1629  1.606    rillig 	const char *nameEnd;
   1630  1.606    rillig 	const char *eq;
   1631  1.469    rillig 	const char *firstSpace = NULL;
   1632  1.469    rillig 	int level = 0;
   1633  1.469    rillig 
   1634  1.469    rillig 	cpp_skip_hspace(&p);	/* Skip to variable name */
   1635  1.469    rillig 
   1636  1.469    rillig 	/*
   1637  1.469    rillig 	 * During parsing, the '+' of the '+=' operator is initially parsed
   1638  1.469    rillig 	 * as part of the variable name.  It is later corrected, as is the
   1639  1.469    rillig 	 * ':sh' modifier. Of these two (nameEnd and op), the earlier one
   1640  1.469    rillig 	 * determines the actual end of the variable name.
   1641  1.469    rillig 	 */
   1642  1.606    rillig 	nameStart = p;
   1643  1.368    rillig #ifdef CLEANUP
   1644  1.606    rillig 	nameEnd = NULL;
   1645  1.606    rillig 	eq = NULL;
   1646  1.368    rillig #endif
   1647  1.356    rillig 
   1648  1.469    rillig 	/*
   1649  1.469    rillig 	 * Scan for one of the assignment operators outside a variable
   1650  1.469    rillig 	 * expansion.
   1651  1.469    rillig 	 */
   1652  1.469    rillig 	while (*p != '\0') {
   1653  1.469    rillig 		char ch = *p++;
   1654  1.469    rillig 		if (ch == '(' || ch == '{') {
   1655  1.469    rillig 			level++;
   1656  1.469    rillig 			continue;
   1657  1.469    rillig 		}
   1658  1.469    rillig 		if (ch == ')' || ch == '}') {
   1659  1.469    rillig 			level--;
   1660  1.469    rillig 			continue;
   1661  1.469    rillig 		}
   1662  1.469    rillig 
   1663  1.469    rillig 		if (level != 0)
   1664  1.469    rillig 			continue;
   1665  1.469    rillig 
   1666  1.469    rillig 		if (ch == ' ' || ch == '\t')
   1667  1.469    rillig 			if (firstSpace == NULL)
   1668  1.469    rillig 				firstSpace = p - 1;
   1669  1.469    rillig 		while (ch == ' ' || ch == '\t')
   1670  1.469    rillig 			ch = *p++;
   1671  1.368    rillig 
   1672  1.191       sjg #ifdef SUNSHCMD
   1673  1.469    rillig 		if (ch == ':' && p[0] == 's' && p[1] == 'h') {
   1674  1.469    rillig 			p += 2;
   1675  1.469    rillig 			continue;
   1676  1.469    rillig 		}
   1677  1.469    rillig #endif
   1678  1.607    rillig 		if (ch == '=')
   1679  1.606    rillig 			eq = p - 1;
   1680  1.607    rillig 		else if (*p == '=' &&
   1681  1.607    rillig 		    (ch == '+' || ch == ':' || ch == '?' || ch == '!'))
   1682  1.606    rillig 			eq = p;
   1683  1.607    rillig 		else if (firstSpace != NULL)
   1684  1.553    rillig 			return false;
   1685  1.607    rillig 		else
   1686  1.607    rillig 			continue;
   1687  1.607    rillig 
   1688  1.607    rillig 		nameEnd = firstSpace != NULL ? firstSpace : eq;
   1689  1.607    rillig 		p = eq + 1;
   1690  1.607    rillig 		cpp_skip_whitespace(&p);
   1691  1.607    rillig 		*out_var = AdjustVarassignOp(nameStart, nameEnd, eq, p);
   1692  1.607    rillig 		return true;
   1693  1.191       sjg 	}
   1694    1.1       cgd 
   1695  1.553    rillig 	return false;
   1696    1.1       cgd }
   1697    1.1       cgd 
   1698  1.469    rillig /*
   1699  1.469    rillig  * Check for syntax errors such as unclosed expressions or unknown modifiers.
   1700  1.469    rillig  */
   1701  1.368    rillig static void
   1702  1.546    rillig VarCheckSyntax(VarAssignOp type, const char *uvalue, GNode *scope)
   1703  1.368    rillig {
   1704  1.515    rillig 	if (opts.strict) {
   1705  1.469    rillig 		if (type != VAR_SUBST && strchr(uvalue, '$') != NULL) {
   1706  1.469    rillig 			char *expandedValue;
   1707  1.469    rillig 
   1708  1.551    rillig 			(void)Var_Subst(uvalue, scope, VARE_PARSE_ONLY,
   1709  1.469    rillig 			    &expandedValue);
   1710  1.469    rillig 			/* TODO: handle errors */
   1711  1.469    rillig 			free(expandedValue);
   1712  1.469    rillig 		}
   1713  1.243       sjg 	}
   1714  1.368    rillig }
   1715  1.368    rillig 
   1716  1.390    rillig static void
   1717  1.548    rillig VarAssign_EvalSubst(GNode *scope, const char *name, const char *uvalue,
   1718  1.506    rillig 		    FStr *out_avalue)
   1719  1.390    rillig {
   1720  1.469    rillig 	char *evalue;
   1721  1.469    rillig 
   1722  1.469    rillig 	/*
   1723  1.469    rillig 	 * make sure that we set the variable the first time to nothing
   1724  1.538    rillig 	 * so that it gets substituted.
   1725  1.538    rillig 	 *
   1726  1.538    rillig 	 * TODO: Add a test that demonstrates why this code is needed,
   1727  1.538    rillig 	 *  apart from making the debug log longer.
   1728  1.469    rillig 	 */
   1729  1.548    rillig 	if (!Var_ExistsExpand(scope, name))
   1730  1.548    rillig 		Var_SetExpand(scope, name, "");
   1731  1.469    rillig 
   1732  1.552    rillig 	(void)Var_Subst(uvalue, scope, VARE_KEEP_DOLLAR_UNDEF, &evalue);
   1733  1.469    rillig 	/* TODO: handle errors */
   1734  1.520    rillig 
   1735  1.548    rillig 	Var_SetExpand(scope, name, evalue);
   1736  1.390    rillig 
   1737  1.536    rillig 	*out_avalue = FStr_InitOwn(evalue);
   1738  1.390    rillig }
   1739  1.390    rillig 
   1740  1.390    rillig static void
   1741  1.546    rillig VarAssign_EvalShell(const char *name, const char *uvalue, GNode *scope,
   1742  1.506    rillig 		    FStr *out_avalue)
   1743  1.390    rillig {
   1744  1.507    rillig 	FStr cmd;
   1745  1.507    rillig 	const char *errfmt;
   1746  1.469    rillig 	char *cmdOut;
   1747  1.469    rillig 
   1748  1.507    rillig 	cmd = FStr_InitRefer(uvalue);
   1749  1.507    rillig 	if (strchr(cmd.str, '$') != NULL) {
   1750  1.507    rillig 		char *expanded;
   1751  1.552    rillig 		(void)Var_Subst(cmd.str, SCOPE_CMDLINE, VARE_UNDEFERR,
   1752  1.552    rillig 		    &expanded);
   1753  1.469    rillig 		/* TODO: handle errors */
   1754  1.507    rillig 		cmd = FStr_InitOwn(expanded);
   1755  1.469    rillig 	}
   1756  1.469    rillig 
   1757  1.507    rillig 	cmdOut = Cmd_Exec(cmd.str, &errfmt);
   1758  1.548    rillig 	Var_SetExpand(scope, name, cmdOut);
   1759  1.506    rillig 	*out_avalue = FStr_InitOwn(cmdOut);
   1760  1.390    rillig 
   1761  1.469    rillig 	if (errfmt != NULL)
   1762  1.509    rillig 		Parse_Error(PARSE_WARNING, errfmt, cmd.str);
   1763  1.390    rillig 
   1764  1.507    rillig 	FStr_Done(&cmd);
   1765  1.390    rillig }
   1766  1.390    rillig 
   1767  1.524    rillig /*
   1768  1.524    rillig  * Perform a variable assignment.
   1769  1.391    rillig  *
   1770  1.554    rillig  * The actual value of the variable is returned in *out_true_avalue.
   1771  1.538    rillig  * Especially for VAR_SUBST and VAR_SHELL this can differ from the literal
   1772  1.538    rillig  * value.
   1773  1.538    rillig  *
   1774  1.538    rillig  * Return whether the assignment was actually performed, which is usually
   1775  1.538    rillig  * the case.  It is only skipped if the operator is '?=' and the variable
   1776  1.538    rillig  * already exists.
   1777  1.524    rillig  */
   1778  1.553    rillig static bool
   1779  1.391    rillig VarAssign_Eval(const char *name, VarAssignOp op, const char *uvalue,
   1780  1.554    rillig 	       GNode *scope, FStr *out_true_avalue)
   1781  1.368    rillig {
   1782  1.506    rillig 	FStr avalue = FStr_InitRefer(uvalue);
   1783  1.469    rillig 
   1784  1.469    rillig 	if (op == VAR_APPEND)
   1785  1.548    rillig 		Var_AppendExpand(scope, name, uvalue);
   1786  1.469    rillig 	else if (op == VAR_SUBST)
   1787  1.548    rillig 		VarAssign_EvalSubst(scope, name, uvalue, &avalue);
   1788  1.469    rillig 	else if (op == VAR_SHELL)
   1789  1.546    rillig 		VarAssign_EvalShell(name, uvalue, scope, &avalue);
   1790  1.469    rillig 	else {
   1791  1.548    rillig 		if (op == VAR_DEFAULT && Var_ExistsExpand(scope, name))
   1792  1.553    rillig 			return false;
   1793  1.353    rillig 
   1794  1.469    rillig 		/* Normal assignment -- just do it. */
   1795  1.548    rillig 		Var_SetExpand(scope, name, uvalue);
   1796  1.469    rillig 	}
   1797  1.469    rillig 
   1798  1.554    rillig 	*out_true_avalue = avalue;
   1799  1.553    rillig 	return true;
   1800  1.368    rillig }
   1801  1.368    rillig 
   1802  1.368    rillig static void
   1803  1.368    rillig VarAssignSpecial(const char *name, const char *avalue)
   1804  1.368    rillig {
   1805  1.469    rillig 	if (strcmp(name, MAKEOVERRIDES) == 0)
   1806  1.583    rillig 		Main_ExportMAKEFLAGS(false);	/* re-export MAKEFLAGS */
   1807  1.469    rillig 	else if (strcmp(name, ".CURDIR") == 0) {
   1808  1.469    rillig 		/*
   1809  1.469    rillig 		 * Someone is being (too?) clever...
   1810  1.469    rillig 		 * Let's pretend they know what they are doing and
   1811  1.469    rillig 		 * re-initialize the 'cur' CachedDir.
   1812  1.469    rillig 		 */
   1813  1.469    rillig 		Dir_InitCur(avalue);
   1814  1.469    rillig 		Dir_SetPATH();
   1815  1.469    rillig 	} else if (strcmp(name, MAKE_JOB_PREFIX) == 0)
   1816  1.469    rillig 		Job_SetPrefix();
   1817  1.469    rillig 	else if (strcmp(name, MAKE_EXPORTED) == 0)
   1818  1.473    rillig 		Var_ExportVars(avalue);
   1819  1.368    rillig }
   1820  1.368    rillig 
   1821  1.579    rillig /* Perform the variable assignment in the given scope. */
   1822  1.605    rillig static void
   1823  1.556    rillig Parse_Var(VarAssign *var, GNode *scope)
   1824  1.368    rillig {
   1825  1.583    rillig 	FStr avalue;		/* actual value (maybe expanded) */
   1826  1.368    rillig 
   1827  1.546    rillig 	VarCheckSyntax(var->op, var->value, scope);
   1828  1.546    rillig 	if (VarAssign_Eval(var->varname, var->op, var->value, scope, &avalue)) {
   1829  1.506    rillig 		VarAssignSpecial(var->varname, avalue.str);
   1830  1.506    rillig 		FStr_Done(&avalue);
   1831  1.506    rillig 	}
   1832  1.368    rillig 
   1833  1.469    rillig 	free(var->varname);
   1834    1.1       cgd }
   1835   1.23  christos 
   1836  1.200  christos 
   1837  1.524    rillig /*
   1838  1.524    rillig  * See if the command possibly calls a sub-make by using the variable
   1839  1.524    rillig  * expressions ${.MAKE}, ${MAKE} or the plain word "make".
   1840  1.524    rillig  */
   1841  1.553    rillig static bool
   1842  1.432    rillig MaybeSubMake(const char *cmd)
   1843  1.195  christos {
   1844  1.469    rillig 	const char *start;
   1845  1.432    rillig 
   1846  1.469    rillig 	for (start = cmd; *start != '\0'; start++) {
   1847  1.469    rillig 		const char *p = start;
   1848  1.469    rillig 		char endc;
   1849  1.469    rillig 
   1850  1.469    rillig 		/* XXX: What if progname != "make"? */
   1851  1.579    rillig 		if (strncmp(p, "make", 4) == 0)
   1852  1.469    rillig 			if (start == cmd || !ch_isalnum(p[-1]))
   1853  1.469    rillig 				if (!ch_isalnum(p[4]))
   1854  1.553    rillig 					return true;
   1855  1.469    rillig 
   1856  1.469    rillig 		if (*p != '$')
   1857  1.469    rillig 			continue;
   1858  1.469    rillig 		p++;
   1859  1.469    rillig 
   1860  1.469    rillig 		if (*p == '{')
   1861  1.469    rillig 			endc = '}';
   1862  1.469    rillig 		else if (*p == '(')
   1863  1.469    rillig 			endc = ')';
   1864  1.469    rillig 		else
   1865  1.469    rillig 			continue;
   1866  1.469    rillig 		p++;
   1867  1.432    rillig 
   1868  1.469    rillig 		if (*p == '.')	/* Accept either ${.MAKE} or ${MAKE}. */
   1869  1.469    rillig 			p++;
   1870  1.432    rillig 
   1871  1.579    rillig 		if (strncmp(p, "MAKE", 4) == 0)
   1872  1.469    rillig 			if (p[4] == endc)
   1873  1.553    rillig 				return true;
   1874  1.469    rillig 	}
   1875  1.553    rillig 	return false;
   1876  1.195  christos }
   1877  1.195  christos 
   1878  1.524    rillig /*
   1879  1.524    rillig  * Append the command to the target node.
   1880    1.1       cgd  *
   1881  1.327    rillig  * The node may be marked as a submake node if the command is determined to
   1882  1.524    rillig  * be that.
   1883  1.524    rillig  */
   1884  1.327    rillig static void
   1885  1.593    rillig GNode_AddCommand(GNode *gn, char *cmd)
   1886    1.9       jtc {
   1887  1.469    rillig 	/* Add to last (ie current) cohort for :: targets */
   1888  1.469    rillig 	if ((gn->type & OP_DOUBLEDEP) && gn->cohorts.last != NULL)
   1889  1.469    rillig 		gn = gn->cohorts.last->datum;
   1890  1.469    rillig 
   1891  1.469    rillig 	/* if target already supplied, ignore commands */
   1892  1.469    rillig 	if (!(gn->type & OP_HAS_COMMANDS)) {
   1893  1.469    rillig 		Lst_Append(&gn->commands, cmd);
   1894  1.469    rillig 		if (MaybeSubMake(cmd))
   1895  1.469    rillig 			gn->type |= OP_SUBMAKE;
   1896  1.562    rillig 		RememberLocation(gn);
   1897  1.469    rillig 	} else {
   1898  1.327    rillig #if 0
   1899  1.469    rillig 		/* XXX: We cannot do this until we fix the tree */
   1900  1.469    rillig 		Lst_Append(&gn->commands, cmd);
   1901  1.469    rillig 		Parse_Error(PARSE_WARNING,
   1902  1.469    rillig 		    "overriding commands for target \"%s\"; "
   1903  1.469    rillig 		    "previous commands defined at %s: %d ignored",
   1904  1.469    rillig 		    gn->name, gn->fname, gn->lineno);
   1905  1.203     joerg #else
   1906  1.469    rillig 		Parse_Error(PARSE_WARNING,
   1907  1.374    rillig 		    "duplicate script for target \"%s\" ignored",
   1908  1.374    rillig 		    gn->name);
   1909  1.469    rillig 		ParseErrorInternal(gn->fname, (size_t)gn->lineno, PARSE_WARNING,
   1910  1.469    rillig 		    "using previous script for \"%s\" defined here",
   1911  1.469    rillig 		    gn->name);
   1912  1.203     joerg #endif
   1913  1.469    rillig 	}
   1914    1.1       cgd }
   1915    1.1       cgd 
   1916  1.469    rillig /*
   1917  1.469    rillig  * Add a directory to the path searched for included makefiles bracketed
   1918  1.469    rillig  * by double-quotes.
   1919  1.469    rillig  */
   1920    1.1       cgd void
   1921  1.344    rillig Parse_AddIncludeDir(const char *dir)
   1922    1.1       cgd {
   1923  1.529    rillig 	(void)SearchPath_Add(parseIncPath, dir);
   1924    1.1       cgd }
   1925    1.1       cgd 
   1926  1.524    rillig /*
   1927  1.524    rillig  * Handle one of the .[-ds]include directives by remembering the current file
   1928  1.441    rillig  * and pushing the included file on the stack.  After the included file has
   1929  1.574    rillig  * finished, parsing continues with the including file; see Parse_PushInput
   1930  1.441    rillig  * and ParseEOF.
   1931  1.441    rillig  *
   1932  1.441    rillig  * System includes are looked up in sysIncPath, any other includes are looked
   1933  1.441    rillig  * up in the parsedir and then in the directories specified by the -I command
   1934  1.441    rillig  * line options.
   1935    1.1       cgd  */
   1936    1.1       cgd static void
   1937  1.567    rillig IncludeFile(const char *file, bool isSystem, bool depinc, bool silent)
   1938    1.1       cgd {
   1939  1.469    rillig 	struct loadedfile *lf;
   1940  1.469    rillig 	char *fullname;		/* full pathname of file */
   1941  1.469    rillig 	char *newName;
   1942  1.469    rillig 	char *slash, *incdir;
   1943  1.469    rillig 	int fd;
   1944  1.469    rillig 	int i;
   1945  1.469    rillig 
   1946  1.469    rillig 	fullname = file[0] == '/' ? bmake_strdup(file) : NULL;
   1947  1.469    rillig 
   1948  1.469    rillig 	if (fullname == NULL && !isSystem) {
   1949  1.469    rillig 		/*
   1950  1.469    rillig 		 * Include files contained in double-quotes are first searched
   1951  1.469    rillig 		 * relative to the including file's location. We don't want to
   1952  1.469    rillig 		 * cd there, of course, so we just tack on the old file's
   1953  1.469    rillig 		 * leading path components and call Dir_FindFile to see if
   1954  1.469    rillig 		 * we can locate the file.
   1955  1.469    rillig 		 */
   1956  1.469    rillig 
   1957  1.576    rillig 		incdir = bmake_strdup(CurFile()->name.str);
   1958  1.469    rillig 		slash = strrchr(incdir, '/');
   1959  1.469    rillig 		if (slash != NULL) {
   1960  1.469    rillig 			*slash = '\0';
   1961  1.469    rillig 			/*
   1962  1.469    rillig 			 * Now do lexical processing of leading "../" on the
   1963  1.469    rillig 			 * filename.
   1964  1.469    rillig 			 */
   1965  1.469    rillig 			for (i = 0; strncmp(file + i, "../", 3) == 0; i += 3) {
   1966  1.469    rillig 				slash = strrchr(incdir + 1, '/');
   1967  1.469    rillig 				if (slash == NULL || strcmp(slash, "/..") == 0)
   1968  1.469    rillig 					break;
   1969  1.469    rillig 				*slash = '\0';
   1970  1.469    rillig 			}
   1971  1.469    rillig 			newName = str_concat3(incdir, "/", file + i);
   1972  1.469    rillig 			fullname = Dir_FindFile(newName, parseIncPath);
   1973  1.469    rillig 			if (fullname == NULL)
   1974  1.469    rillig 				fullname = Dir_FindFile(newName,
   1975  1.469    rillig 				    &dirSearchPath);
   1976  1.469    rillig 			free(newName);
   1977  1.469    rillig 		}
   1978  1.469    rillig 		free(incdir);
   1979  1.469    rillig 
   1980  1.469    rillig 		if (fullname == NULL) {
   1981  1.469    rillig 			/*
   1982  1.469    rillig 			 * Makefile wasn't found in same directory as included
   1983  1.469    rillig 			 * makefile.
   1984  1.469    rillig 			 *
   1985  1.469    rillig 			 * Search for it first on the -I search path, then on
   1986  1.469    rillig 			 * the .PATH search path, if not found in a -I
   1987  1.469    rillig 			 * directory. If we have a suffix-specific path, we
   1988  1.469    rillig 			 * should use that.
   1989  1.469    rillig 			 */
   1990  1.469    rillig 			const char *suff;
   1991  1.469    rillig 			SearchPath *suffPath = NULL;
   1992  1.469    rillig 
   1993  1.516    rillig 			if ((suff = strrchr(file, '.')) != NULL) {
   1994  1.469    rillig 				suffPath = Suff_GetPath(suff);
   1995  1.469    rillig 				if (suffPath != NULL)
   1996  1.469    rillig 					fullname = Dir_FindFile(file, suffPath);
   1997  1.469    rillig 			}
   1998  1.469    rillig 			if (fullname == NULL) {
   1999  1.469    rillig 				fullname = Dir_FindFile(file, parseIncPath);
   2000  1.469    rillig 				if (fullname == NULL)
   2001  1.469    rillig 					fullname = Dir_FindFile(file,
   2002  1.469    rillig 					    &dirSearchPath);
   2003  1.469    rillig 			}
   2004  1.469    rillig 		}
   2005    1.1       cgd 	}
   2006  1.140       dsl 
   2007  1.469    rillig 	/* Looking for a system file or file still not found */
   2008  1.142       sjg 	if (fullname == NULL) {
   2009  1.469    rillig 		/*
   2010  1.469    rillig 		 * Look for it on the system path
   2011  1.469    rillig 		 */
   2012  1.531    rillig 		SearchPath *path = Lst_IsEmpty(&sysIncPath->dirs)
   2013  1.531    rillig 		    ? defSysIncPath : sysIncPath;
   2014  1.469    rillig 		fullname = Dir_FindFile(file, path);
   2015  1.469    rillig 	}
   2016  1.469    rillig 
   2017  1.469    rillig 	if (fullname == NULL) {
   2018  1.469    rillig 		if (!silent)
   2019  1.469    rillig 			Parse_Error(PARSE_FATAL, "Could not find %s", file);
   2020  1.469    rillig 		return;
   2021  1.469    rillig 	}
   2022  1.469    rillig 
   2023  1.469    rillig 	/* Actually open the file... */
   2024  1.469    rillig 	fd = open(fullname, O_RDONLY);
   2025  1.469    rillig 	if (fd == -1) {
   2026  1.469    rillig 		if (!silent)
   2027  1.469    rillig 			Parse_Error(PARSE_FATAL, "Cannot open %s", fullname);
   2028  1.469    rillig 		free(fullname);
   2029  1.469    rillig 		return;
   2030  1.469    rillig 	}
   2031  1.469    rillig 
   2032  1.469    rillig 	/* load it */
   2033  1.469    rillig 	lf = loadfile(fullname, fd);
   2034  1.613    rillig 	(void)close(fd);
   2035  1.469    rillig 
   2036  1.469    rillig 	/* Start reading from this file next */
   2037  1.614    rillig 	Parse_PushInput(fullname, 0, loadedfile_readMore, lf);
   2038  1.469    rillig 	CurFile()->lf = lf;
   2039  1.469    rillig 	if (depinc)
   2040  1.469    rillig 		doing_depend = depinc;	/* only turn it on */
   2041  1.575    rillig 	free(fullname);
   2042  1.123       dsl }
   2043  1.123       dsl 
   2044  1.566    rillig /*
   2045  1.566    rillig  * Parse a directive like '.include' or '.-include'.
   2046  1.566    rillig  *
   2047  1.566    rillig  * .include "user-makefile.mk"
   2048  1.566    rillig  * .include <system-makefile.mk>
   2049  1.566    rillig  */
   2050  1.123       dsl static void
   2051  1.556    rillig ParseInclude(char *directive)
   2052  1.123       dsl {
   2053  1.567    rillig 	char endc;		/* '>' or '"' */
   2054  1.567    rillig 	char *p;
   2055  1.553    rillig 	bool silent = directive[0] != 'i';
   2056  1.566    rillig 	FStr file;
   2057  1.123       dsl 
   2058  1.566    rillig 	p = directive + (silent ? 8 : 7);
   2059  1.566    rillig 	pp_skip_hspace(&p);
   2060  1.123       dsl 
   2061  1.566    rillig 	if (*p != '"' && *p != '<') {
   2062  1.469    rillig 		Parse_Error(PARSE_FATAL,
   2063  1.374    rillig 		    ".include filename must be delimited by '\"' or '<'");
   2064  1.469    rillig 		return;
   2065  1.469    rillig 	}
   2066  1.123       dsl 
   2067  1.566    rillig 	if (*p++ == '<')
   2068  1.469    rillig 		endc = '>';
   2069  1.469    rillig 	else
   2070  1.469    rillig 		endc = '"';
   2071  1.566    rillig 	file = FStr_InitRefer(p);
   2072  1.469    rillig 
   2073  1.469    rillig 	/* Skip to matching delimiter */
   2074  1.566    rillig 	while (*p != '\0' && *p != endc)
   2075  1.566    rillig 		p++;
   2076  1.123       dsl 
   2077  1.566    rillig 	if (*p != endc) {
   2078  1.469    rillig 		Parse_Error(PARSE_FATAL,
   2079  1.441    rillig 		    "Unclosed .include filename. '%c' expected", endc);
   2080  1.469    rillig 		return;
   2081  1.469    rillig 	}
   2082  1.430    rillig 
   2083  1.566    rillig 	*p = '\0';
   2084  1.123       dsl 
   2085  1.567    rillig 	if (strchr(file.str, '$') != NULL) {
   2086  1.567    rillig 		char *xfile;
   2087  1.567    rillig 		Var_Subst(file.str, SCOPE_CMDLINE, VARE_WANTRES, &xfile);
   2088  1.567    rillig 		/* TODO: handle errors */
   2089  1.567    rillig 		file = FStr_InitOwn(xfile);
   2090  1.567    rillig 	}
   2091  1.123       dsl 
   2092  1.567    rillig 	IncludeFile(file.str, endc == '>', directive[0] == 'd', silent);
   2093  1.567    rillig 	FStr_Done(&file);
   2094    1.1       cgd }
   2095    1.1       cgd 
   2096  1.524    rillig /*
   2097  1.524    rillig  * Split filename into dirname + basename, then assign these to the
   2098  1.524    rillig  * given variables.
   2099  1.524    rillig  */
   2100  1.193  christos static void
   2101  1.281    rillig SetFilenameVars(const char *filename, const char *dirvar, const char *filevar)
   2102  1.193  christos {
   2103  1.550    rillig 	const char *slash, *basename;
   2104  1.550    rillig 	FStr dirname;
   2105  1.469    rillig 
   2106  1.469    rillig 	slash = strrchr(filename, '/');
   2107  1.469    rillig 	if (slash == NULL) {
   2108  1.550    rillig 		dirname = FStr_InitRefer(curdir);
   2109  1.469    rillig 		basename = filename;
   2110  1.469    rillig 	} else {
   2111  1.550    rillig 		dirname = FStr_InitOwn(bmake_strsedup(filename, slash));
   2112  1.469    rillig 		basename = slash + 1;
   2113  1.469    rillig 	}
   2114  1.281    rillig 
   2115  1.568    rillig 	Global_Set(dirvar, dirname.str);
   2116  1.568    rillig 	Global_Set(filevar, basename);
   2117  1.469    rillig 
   2118  1.586    rillig 	DEBUG4(PARSE, "SetFilenameVars: ${%s} = `%s' ${%s} = `%s'\n",
   2119  1.586    rillig 	    dirvar, dirname.str, filevar, basename);
   2120  1.550    rillig 	FStr_Done(&dirname);
   2121  1.281    rillig }
   2122  1.281    rillig 
   2123  1.469    rillig /*
   2124  1.469    rillig  * Return the immediately including file.
   2125  1.281    rillig  *
   2126  1.281    rillig  * This is made complicated since the .for loop is implemented as a special
   2127  1.469    rillig  * kind of .include; see For_Run.
   2128  1.469    rillig  */
   2129  1.281    rillig static const char *
   2130  1.281    rillig GetActuallyIncludingFile(void)
   2131  1.281    rillig {
   2132  1.469    rillig 	size_t i;
   2133  1.469    rillig 	const IFile *incs = GetInclude(0);
   2134  1.193  christos 
   2135  1.469    rillig 	for (i = includes.len; i >= 2; i--)
   2136  1.469    rillig 		if (!incs[i - 1].fromForLoop)
   2137  1.576    rillig 			return incs[i - 2].name.str;
   2138  1.469    rillig 	return NULL;
   2139  1.193  christos }
   2140  1.281    rillig 
   2141  1.285    rillig /* Set .PARSEDIR, .PARSEFILE, .INCLUDEDFROMDIR and .INCLUDEDFROMFILE. */
   2142   1.44     aidan static void
   2143  1.593    rillig SetParseFile(const char *filename)
   2144   1.44     aidan {
   2145  1.469    rillig 	const char *including;
   2146   1.44     aidan 
   2147  1.469    rillig 	SetFilenameVars(filename, ".PARSEDIR", ".PARSEFILE");
   2148  1.281    rillig 
   2149  1.469    rillig 	including = GetActuallyIncludingFile();
   2150  1.469    rillig 	if (including != NULL) {
   2151  1.469    rillig 		SetFilenameVars(including,
   2152  1.469    rillig 		    ".INCLUDEDFROMDIR", ".INCLUDEDFROMFILE");
   2153  1.469    rillig 	} else {
   2154  1.547    rillig 		Global_Delete(".INCLUDEDFROMDIR");
   2155  1.547    rillig 		Global_Delete(".INCLUDEDFROMFILE");
   2156  1.469    rillig 	}
   2157   1.44     aidan }
   2158   1.44     aidan 
   2159  1.553    rillig static bool
   2160  1.418    rillig StrContainsWord(const char *str, const char *word)
   2161  1.418    rillig {
   2162  1.469    rillig 	size_t strLen = strlen(str);
   2163  1.469    rillig 	size_t wordLen = strlen(word);
   2164  1.588    rillig 	const char *p;
   2165  1.469    rillig 
   2166  1.469    rillig 	if (strLen < wordLen)
   2167  1.585    rillig 		return false;
   2168  1.469    rillig 
   2169  1.469    rillig 	for (p = str; p != NULL; p = strchr(p, ' ')) {
   2170  1.469    rillig 		if (*p == ' ')
   2171  1.469    rillig 			p++;
   2172  1.588    rillig 		if (p > str + strLen - wordLen)
   2173  1.585    rillig 			return false;
   2174  1.469    rillig 
   2175  1.469    rillig 		if (memcmp(p, word, wordLen) == 0 &&
   2176  1.469    rillig 		    (p[wordLen] == '\0' || p[wordLen] == ' '))
   2177  1.553    rillig 			return true;
   2178  1.469    rillig 	}
   2179  1.553    rillig 	return false;
   2180  1.469    rillig }
   2181  1.469    rillig 
   2182  1.469    rillig /*
   2183  1.469    rillig  * XXX: Searching through a set of words with this linear search is
   2184  1.469    rillig  * inefficient for variables that contain thousands of words.
   2185  1.469    rillig  *
   2186  1.469    rillig  * XXX: The paths in this list don't seem to be normalized in any way.
   2187  1.469    rillig  */
   2188  1.553    rillig static bool
   2189  1.418    rillig VarContainsWord(const char *varname, const char *word)
   2190  1.418    rillig {
   2191  1.548    rillig 	FStr val = Var_Value(SCOPE_GLOBAL, varname);
   2192  1.553    rillig 	bool found = val.str != NULL && StrContainsWord(val.str, word);
   2193  1.505    rillig 	FStr_Done(&val);
   2194  1.469    rillig 	return found;
   2195  1.418    rillig }
   2196  1.418    rillig 
   2197  1.524    rillig /*
   2198  1.524    rillig  * Track the makefiles we read - so makefiles can set dependencies on them.
   2199  1.441    rillig  * Avoid adding anything more than once.
   2200  1.441    rillig  *
   2201  1.441    rillig  * Time complexity: O(n) per call, in total O(n^2), where n is the number
   2202  1.524    rillig  * of makefiles that have been loaded.
   2203  1.524    rillig  */
   2204  1.184       sjg static void
   2205  1.593    rillig TrackInput(const char *name)
   2206  1.184       sjg {
   2207  1.469    rillig 	if (!VarContainsWord(MAKE_MAKEFILES, name))
   2208  1.542    rillig 		Global_Append(MAKE_MAKEFILES, name);
   2209  1.184       sjg }
   2210  1.137       sjg 
   2211   1.44     aidan 
   2212  1.469    rillig /*
   2213  1.469    rillig  * Start parsing from the given source.
   2214    1.5       cgd  *
   2215  1.469    rillig  * The given file is added to the includes stack.
   2216  1.469    rillig  */
   2217    1.5       cgd void
   2218  1.614    rillig Parse_PushInput(const char *name, int lineno,
   2219  1.471    rillig 	       ReadMoreProc readMore, void *readMoreArg)
   2220    1.5       cgd {
   2221  1.469    rillig 	IFile *curFile;
   2222  1.469    rillig 	char *buf;
   2223  1.469    rillig 	size_t len;
   2224  1.553    rillig 	bool fromForLoop = name == NULL;
   2225  1.469    rillig 
   2226  1.469    rillig 	if (fromForLoop)
   2227  1.576    rillig 		name = CurFile()->name.str;
   2228  1.469    rillig 	else
   2229  1.593    rillig 		TrackInput(name);
   2230  1.469    rillig 
   2231  1.574    rillig 	DEBUG3(PARSE, "Parse_PushInput: %s %s, line %d\n",
   2232  1.497    rillig 	    readMore == loadedfile_readMore ? "file" : ".for loop in",
   2233  1.497    rillig 	    name, lineno);
   2234    1.5       cgd 
   2235  1.469    rillig 	curFile = Vector_Push(&includes);
   2236  1.576    rillig 	curFile->name = FStr_InitOwn(bmake_strdup(name));
   2237  1.469    rillig 	curFile->fromForLoop = fromForLoop;
   2238  1.496    rillig 	curFile->lineno = lineno;
   2239  1.496    rillig 	curFile->first_lineno = lineno;
   2240  1.471    rillig 	curFile->readMore = readMore;
   2241  1.471    rillig 	curFile->readMoreArg = readMoreArg;
   2242  1.469    rillig 	curFile->lf = NULL;
   2243  1.469    rillig 	curFile->depending = doing_depend;	/* restore this on EOF */
   2244  1.469    rillig 
   2245  1.471    rillig 	assert(readMore != NULL);
   2246  1.469    rillig 
   2247  1.469    rillig 	/* Get first block of input data */
   2248  1.471    rillig 	buf = curFile->readMore(curFile->readMoreArg, &len);
   2249  1.469    rillig 	if (buf == NULL) {
   2250  1.469    rillig 		/* Was all a waste of time ... */
   2251  1.576    rillig 		FStr_Done(&curFile->name);
   2252  1.469    rillig 		free(curFile);
   2253  1.469    rillig 		return;
   2254  1.469    rillig 	}
   2255  1.469    rillig 	curFile->buf_freeIt = buf;
   2256  1.469    rillig 	curFile->buf_ptr = buf;
   2257  1.469    rillig 	curFile->buf_end = buf + len;
   2258  1.469    rillig 
   2259  1.469    rillig 	curFile->cond_depth = Cond_save_depth();
   2260  1.593    rillig 	SetParseFile(name);
   2261    1.5       cgd }
   2262    1.5       cgd 
   2263  1.375    rillig /* Check if the directive is an include directive. */
   2264  1.553    rillig static bool
   2265  1.553    rillig IsInclude(const char *dir, bool sysv)
   2266  1.228  christos {
   2267  1.298    rillig 	if (dir[0] == 's' || dir[0] == '-' || (dir[0] == 'd' && !sysv))
   2268  1.298    rillig 		dir++;
   2269  1.228  christos 
   2270  1.298    rillig 	if (strncmp(dir, "include", 7) != 0)
   2271  1.553    rillig 		return false;
   2272  1.228  christos 
   2273  1.248    rillig 	/* Space is not mandatory for BSD .include */
   2274  1.298    rillig 	return !sysv || ch_isspace(dir[7]);
   2275  1.228  christos }
   2276  1.228  christos 
   2277  1.228  christos 
   2278    1.5       cgd #ifdef SYSVINCLUDE
   2279  1.284    rillig /* Check if the line is a SYSV include directive. */
   2280  1.553    rillig static bool
   2281  1.228  christos IsSysVInclude(const char *line)
   2282  1.228  christos {
   2283  1.228  christos 	const char *p;
   2284  1.228  christos 
   2285  1.553    rillig 	if (!IsInclude(line, true))
   2286  1.553    rillig 		return false;
   2287  1.228  christos 
   2288  1.375    rillig 	/* Avoid interpreting a dependency line as an include */
   2289  1.228  christos 	for (p = line; (p = strchr(p, ':')) != NULL;) {
   2290  1.430    rillig 
   2291  1.430    rillig 		/* end of line -> it's a dependency */
   2292  1.430    rillig 		if (*++p == '\0')
   2293  1.553    rillig 			return false;
   2294  1.430    rillig 
   2295  1.430    rillig 		/* '::' operator or ': ' -> it's a dependency */
   2296  1.430    rillig 		if (*p == ':' || ch_isspace(*p))
   2297  1.553    rillig 			return false;
   2298  1.228  christos 	}
   2299  1.553    rillig 	return true;
   2300  1.228  christos }
   2301  1.228  christos 
   2302  1.284    rillig /* Push to another file.  The line points to the word "include". */
   2303    1.5       cgd static void
   2304   1.84       wiz ParseTraditionalInclude(char *line)
   2305    1.5       cgd {
   2306  1.469    rillig 	char *cp;		/* current position in file spec */
   2307  1.553    rillig 	bool done = false;
   2308  1.553    rillig 	bool silent = line[0] != 'i';
   2309  1.469    rillig 	char *file = line + (silent ? 8 : 7);
   2310  1.469    rillig 	char *all_files;
   2311  1.469    rillig 
   2312  1.586    rillig 	DEBUG1(PARSE, "ParseTraditionalInclude: %s\n", file);
   2313  1.469    rillig 
   2314  1.469    rillig 	pp_skip_whitespace(&file);
   2315  1.469    rillig 
   2316  1.545    rillig 	(void)Var_Subst(file, SCOPE_CMDLINE, VARE_WANTRES, &all_files);
   2317  1.469    rillig 	/* TODO: handle errors */
   2318  1.469    rillig 
   2319  1.469    rillig 	for (file = all_files; !done; file = cp + 1) {
   2320  1.469    rillig 		/* Skip to end of line or next whitespace */
   2321  1.469    rillig 		for (cp = file; *cp != '\0' && !ch_isspace(*cp); cp++)
   2322  1.469    rillig 			continue;
   2323  1.469    rillig 
   2324  1.469    rillig 		if (*cp != '\0')
   2325  1.469    rillig 			*cp = '\0';
   2326  1.469    rillig 		else
   2327  1.553    rillig 			done = true;
   2328   1.38  christos 
   2329  1.553    rillig 		IncludeFile(file, false, false, silent);
   2330  1.469    rillig 	}
   2331  1.580    rillig 
   2332  1.469    rillig 	free(all_files);
   2333    1.5       cgd }
   2334    1.5       cgd #endif
   2335    1.5       cgd 
   2336  1.183       sjg #ifdef GMAKEEXPORT
   2337  1.375    rillig /* Parse "export <variable>=<value>", and actually export it. */
   2338  1.182  christos static void
   2339  1.182  christos ParseGmakeExport(char *line)
   2340  1.182  christos {
   2341  1.469    rillig 	char *variable = line + 6;
   2342  1.469    rillig 	char *value;
   2343  1.182  christos 
   2344  1.586    rillig 	DEBUG1(PARSE, "ParseGmakeExport: %s\n", variable);
   2345  1.182  christos 
   2346  1.469    rillig 	pp_skip_whitespace(&variable);
   2347  1.182  christos 
   2348  1.526    rillig 	for (value = variable; *value != '\0' && *value != '='; value++)
   2349  1.469    rillig 		continue;
   2350  1.182  christos 
   2351  1.469    rillig 	if (*value != '=') {
   2352  1.469    rillig 		Parse_Error(PARSE_FATAL,
   2353  1.284    rillig 		    "Variable/Value missing from \"export\"");
   2354  1.469    rillig 		return;
   2355  1.469    rillig 	}
   2356  1.469    rillig 	*value++ = '\0';	/* terminate variable */
   2357  1.323    rillig 
   2358  1.469    rillig 	/*
   2359  1.469    rillig 	 * Expand the value before putting it in the environment.
   2360  1.469    rillig 	 */
   2361  1.545    rillig 	(void)Var_Subst(value, SCOPE_CMDLINE, VARE_WANTRES, &value);
   2362  1.469    rillig 	/* TODO: handle errors */
   2363  1.469    rillig 
   2364  1.469    rillig 	setenv(variable, value, 1);
   2365  1.469    rillig 	free(value);
   2366  1.182  christos }
   2367  1.182  christos #endif
   2368  1.182  christos 
   2369  1.469    rillig /*
   2370  1.469    rillig  * Called when EOF is reached in the current file. If we were reading an
   2371  1.441    rillig  * include file or a .for loop, the includes stack is popped and things set
   2372  1.441    rillig  * up to go back to reading the previous file at the previous location.
   2373    1.1       cgd  *
   2374    1.1       cgd  * Results:
   2375  1.553    rillig  *	true to continue parsing, i.e. it had only reached the end of an
   2376  1.553    rillig  *	included file, false if the main file has been parsed completely.
   2377    1.1       cgd  */
   2378  1.553    rillig static bool
   2379  1.123       dsl ParseEOF(void)
   2380    1.1       cgd {
   2381  1.469    rillig 	char *ptr;
   2382  1.469    rillig 	size_t len;
   2383  1.469    rillig 	IFile *curFile = CurFile();
   2384  1.469    rillig 
   2385  1.471    rillig 	assert(curFile->readMore != NULL);
   2386  1.469    rillig 
   2387  1.469    rillig 	doing_depend = curFile->depending;	/* restore this */
   2388  1.469    rillig 	/* get next input buffer, if any */
   2389  1.471    rillig 	ptr = curFile->readMore(curFile->readMoreArg, &len);
   2390  1.469    rillig 	curFile->buf_ptr = ptr;
   2391  1.469    rillig 	curFile->buf_freeIt = ptr;
   2392  1.470    rillig 	curFile->buf_end = ptr == NULL ? NULL : ptr + len;
   2393  1.615    rillig 	if (ptr != NULL) {
   2394  1.615    rillig 		curFile->lineno = curFile->first_lineno;
   2395  1.553    rillig 		return true;	/* Iterate again */
   2396  1.615    rillig 	}
   2397  1.469    rillig 
   2398  1.583    rillig 	/*
   2399  1.583    rillig 	 * Ensure the makefile (or .for loop) didn't have mismatched
   2400  1.583    rillig 	 * conditionals.
   2401  1.583    rillig 	 */
   2402  1.469    rillig 	Cond_restore_depth(curFile->cond_depth);
   2403  1.469    rillig 
   2404  1.469    rillig 	if (curFile->lf != NULL) {
   2405  1.469    rillig 		loadedfile_destroy(curFile->lf);
   2406  1.469    rillig 		curFile->lf = NULL;
   2407  1.469    rillig 	}
   2408  1.469    rillig 
   2409  1.576    rillig 	FStr_Done(&curFile->name);
   2410  1.469    rillig 	free(curFile->buf_freeIt);
   2411  1.469    rillig 	Vector_Pop(&includes);
   2412  1.155       dsl 
   2413  1.469    rillig 	if (includes.len == 0) {
   2414  1.469    rillig 		/* We've run out of input */
   2415  1.547    rillig 		Global_Delete(".PARSEDIR");
   2416  1.547    rillig 		Global_Delete(".PARSEFILE");
   2417  1.547    rillig 		Global_Delete(".INCLUDEDFROMDIR");
   2418  1.547    rillig 		Global_Delete(".INCLUDEDFROMFILE");
   2419  1.553    rillig 		return false;
   2420  1.469    rillig 	}
   2421  1.170  dholland 
   2422  1.469    rillig 	curFile = CurFile();
   2423  1.469    rillig 	DEBUG2(PARSE, "ParseEOF: returning to file %s, line %d\n",
   2424  1.576    rillig 	    curFile->name.str, curFile->lineno);
   2425    1.1       cgd 
   2426  1.593    rillig 	SetParseFile(curFile->name.str);
   2427  1.553    rillig 	return true;
   2428    1.1       cgd }
   2429    1.1       cgd 
   2430  1.493    rillig typedef enum ParseRawLineResult {
   2431  1.493    rillig 	PRLR_LINE,
   2432  1.493    rillig 	PRLR_EOF,
   2433  1.493    rillig 	PRLR_ERROR
   2434  1.493    rillig } ParseRawLineResult;
   2435  1.493    rillig 
   2436  1.489    rillig /*
   2437  1.492    rillig  * Parse until the end of a line, taking into account lines that end with
   2438  1.571    rillig  * backslash-newline.  The resulting line goes from out_line to out_line_end;
   2439  1.571    rillig  * the line is not null-terminated.
   2440  1.489    rillig  */
   2441  1.493    rillig static ParseRawLineResult
   2442  1.493    rillig ParseRawLine(IFile *curFile, char **out_line, char **out_line_end,
   2443  1.493    rillig 	     char **out_firstBackslash, char **out_firstComment)
   2444  1.489    rillig {
   2445  1.493    rillig 	char *line = curFile->buf_ptr;
   2446  1.570    rillig 	char *buf_end = curFile->buf_end;
   2447  1.492    rillig 	char *p = line;
   2448  1.489    rillig 	char *line_end = line;
   2449  1.492    rillig 	char *firstBackslash = NULL;
   2450  1.492    rillig 	char *firstComment = NULL;
   2451  1.493    rillig 	ParseRawLineResult res = PRLR_LINE;
   2452  1.489    rillig 
   2453  1.493    rillig 	curFile->lineno++;
   2454  1.490    rillig 
   2455  1.489    rillig 	for (;;) {
   2456  1.492    rillig 		char ch;
   2457  1.492    rillig 
   2458  1.570    rillig 		if (p == buf_end) {
   2459  1.493    rillig 			res = PRLR_EOF;
   2460  1.489    rillig 			break;
   2461  1.489    rillig 		}
   2462  1.489    rillig 
   2463  1.492    rillig 		ch = *p;
   2464  1.489    rillig 		if (ch == '\0' ||
   2465  1.570    rillig 		    (ch == '\\' && p + 1 < buf_end && p[1] == '\0')) {
   2466  1.492    rillig 			Parse_Error(PARSE_FATAL, "Zero byte read from file");
   2467  1.493    rillig 			return PRLR_ERROR;
   2468  1.489    rillig 		}
   2469  1.489    rillig 
   2470  1.492    rillig 		/* Treat next character after '\' as literal. */
   2471  1.489    rillig 		if (ch == '\\') {
   2472  1.492    rillig 			if (firstBackslash == NULL)
   2473  1.492    rillig 				firstBackslash = p;
   2474  1.511    rillig 			if (p[1] == '\n') {
   2475  1.493    rillig 				curFile->lineno++;
   2476  1.570    rillig 				if (p + 2 == buf_end) {
   2477  1.511    rillig 					line_end = p;
   2478  1.511    rillig 					*line_end = '\n';
   2479  1.511    rillig 					p += 2;
   2480  1.511    rillig 					continue;
   2481  1.511    rillig 				}
   2482  1.511    rillig 			}
   2483  1.492    rillig 			p += 2;
   2484  1.492    rillig 			line_end = p;
   2485  1.570    rillig 			assert(p <= buf_end);
   2486  1.489    rillig 			continue;
   2487  1.489    rillig 		}
   2488  1.489    rillig 
   2489  1.489    rillig 		/*
   2490  1.492    rillig 		 * Remember the first '#' for comment stripping, unless
   2491  1.492    rillig 		 * the previous char was '[', as in the modifier ':[#]'.
   2492  1.492    rillig 		 */
   2493  1.492    rillig 		if (ch == '#' && firstComment == NULL &&
   2494  1.492    rillig 		    !(p > line && p[-1] == '['))
   2495  1.492    rillig 			firstComment = line_end;
   2496  1.489    rillig 
   2497  1.492    rillig 		p++;
   2498  1.489    rillig 		if (ch == '\n')
   2499  1.489    rillig 			break;
   2500  1.489    rillig 
   2501  1.489    rillig 		/* We are not interested in trailing whitespace. */
   2502  1.489    rillig 		if (!ch_isspace(ch))
   2503  1.492    rillig 			line_end = p;
   2504  1.489    rillig 	}
   2505  1.489    rillig 
   2506  1.490    rillig 	*out_line = line;
   2507  1.493    rillig 	curFile->buf_ptr = p;
   2508  1.489    rillig 	*out_line_end = line_end;
   2509  1.492    rillig 	*out_firstBackslash = firstBackslash;
   2510  1.492    rillig 	*out_firstComment = firstComment;
   2511  1.493    rillig 	return res;
   2512  1.489    rillig }
   2513  1.489    rillig 
   2514  1.491    rillig /*
   2515  1.491    rillig  * Beginning at start, unescape '\#' to '#' and replace backslash-newline
   2516  1.491    rillig  * with a single space.
   2517  1.491    rillig  */
   2518  1.485    rillig static void
   2519  1.508    rillig UnescapeBackslash(char *line, char *start)
   2520  1.487    rillig {
   2521  1.491    rillig 	char *src = start;
   2522  1.491    rillig 	char *dst = start;
   2523  1.491    rillig 	char *spaceStart = line;
   2524  1.485    rillig 
   2525  1.485    rillig 	for (;;) {
   2526  1.491    rillig 		char ch = *src++;
   2527  1.485    rillig 		if (ch != '\\') {
   2528  1.485    rillig 			if (ch == '\0')
   2529  1.485    rillig 				break;
   2530  1.491    rillig 			*dst++ = ch;
   2531  1.485    rillig 			continue;
   2532  1.485    rillig 		}
   2533  1.485    rillig 
   2534  1.491    rillig 		ch = *src++;
   2535  1.485    rillig 		if (ch == '\0') {
   2536  1.485    rillig 			/* Delete '\\' at end of buffer */
   2537  1.491    rillig 			dst--;
   2538  1.485    rillig 			break;
   2539  1.485    rillig 		}
   2540  1.485    rillig 
   2541  1.485    rillig 		/* Delete '\\' from before '#' on non-command lines */
   2542  1.485    rillig 		if (ch == '#' && line[0] != '\t') {
   2543  1.491    rillig 			*dst++ = ch;
   2544  1.485    rillig 			continue;
   2545  1.485    rillig 		}
   2546  1.485    rillig 
   2547  1.485    rillig 		if (ch != '\n') {
   2548  1.485    rillig 			/* Leave '\\' in buffer for later */
   2549  1.491    rillig 			*dst++ = '\\';
   2550  1.485    rillig 			/*
   2551  1.485    rillig 			 * Make sure we don't delete an escaped ' ' from the
   2552  1.485    rillig 			 * line end.
   2553  1.485    rillig 			 */
   2554  1.491    rillig 			spaceStart = dst + 1;
   2555  1.491    rillig 			*dst++ = ch;
   2556  1.485    rillig 			continue;
   2557  1.485    rillig 		}
   2558  1.485    rillig 
   2559  1.485    rillig 		/*
   2560  1.485    rillig 		 * Escaped '\n' -- replace following whitespace with a single
   2561  1.485    rillig 		 * ' '.
   2562  1.485    rillig 		 */
   2563  1.491    rillig 		pp_skip_hspace(&src);
   2564  1.491    rillig 		*dst++ = ' ';
   2565  1.485    rillig 	}
   2566  1.485    rillig 
   2567  1.487    rillig 	/* Delete any trailing spaces - eg from empty continuations */
   2568  1.491    rillig 	while (dst > spaceStart && ch_isspace(dst[-1]))
   2569  1.491    rillig 		dst--;
   2570  1.491    rillig 	*dst = '\0';
   2571  1.485    rillig }
   2572  1.485    rillig 
   2573  1.593    rillig typedef enum LineKind {
   2574  1.495    rillig 	/*
   2575  1.498    rillig 	 * Return the next line that is neither empty nor a comment.
   2576  1.495    rillig 	 * Backslash line continuations are folded into a single space.
   2577  1.495    rillig 	 * A trailing comment, if any, is discarded.
   2578  1.495    rillig 	 */
   2579  1.593    rillig 	LK_NONEMPTY,
   2580  1.495    rillig 
   2581  1.495    rillig 	/*
   2582  1.498    rillig 	 * Return the next line, even if it is empty or a comment.
   2583  1.499    rillig 	 * Preserve backslash-newline to keep the line numbers correct.
   2584  1.495    rillig 	 *
   2585  1.495    rillig 	 * Used in .for loops to collect the body of the loop while waiting
   2586  1.495    rillig 	 * for the corresponding .endfor.
   2587  1.495    rillig 	 */
   2588  1.593    rillig 	LK_FOR_BODY,
   2589  1.495    rillig 
   2590  1.495    rillig 	/*
   2591  1.499    rillig 	 * Return the next line that starts with a dot.
   2592  1.495    rillig 	 * Backslash line continuations are folded into a single space.
   2593  1.495    rillig 	 * A trailing comment, if any, is discarded.
   2594  1.495    rillig 	 *
   2595  1.495    rillig 	 * Used in .if directives to skip over irrelevant branches while
   2596  1.495    rillig 	 * waiting for the corresponding .endif.
   2597  1.495    rillig 	 */
   2598  1.593    rillig 	LK_DOT
   2599  1.593    rillig } LineKind;
   2600  1.127       dsl 
   2601  1.498    rillig /* Return the next "interesting" logical line from the current file. */
   2602  1.127       dsl static char *
   2603  1.593    rillig ReadLowLevelLine(LineKind kind)
   2604    1.5       cgd {
   2605  1.493    rillig 	IFile *curFile = CurFile();
   2606  1.469    rillig 	char *line;
   2607  1.469    rillig 	char *line_end;
   2608  1.492    rillig 	char *firstBackslash;
   2609  1.492    rillig 	char *firstComment;
   2610  1.469    rillig 
   2611  1.127       dsl 	for (;;) {
   2612  1.493    rillig 		ParseRawLineResult res = ParseRawLine(curFile,
   2613  1.493    rillig 		    &line, &line_end, &firstBackslash, &firstComment);
   2614  1.493    rillig 		if (res == PRLR_ERROR)
   2615  1.489    rillig 			return NULL;
   2616   1.27  christos 
   2617  1.492    rillig 		if (line_end == line || firstComment == line) {
   2618  1.493    rillig 			if (res == PRLR_EOF)
   2619  1.469    rillig 				return NULL;
   2620  1.593    rillig 			if (kind != LK_FOR_BODY)
   2621  1.494    rillig 				continue;
   2622  1.469    rillig 		}
   2623    1.5       cgd 
   2624  1.469    rillig 		/* We now have a line of data */
   2625  1.514    rillig 		assert(ch_isspace(*line_end));
   2626  1.469    rillig 		*line_end = '\0';
   2627    1.5       cgd 
   2628  1.593    rillig 		if (kind == LK_FOR_BODY)
   2629  1.499    rillig 			return line;	/* Don't join the physical lines. */
   2630    1.5       cgd 
   2631  1.593    rillig 		if (kind == LK_DOT && line[0] != '.')
   2632  1.499    rillig 			continue;
   2633  1.127       dsl 		break;
   2634  1.127       dsl 	}
   2635    1.5       cgd 
   2636  1.583    rillig 	/* Ignore anything after a non-escaped '#' in non-commands. */
   2637  1.512    rillig 	if (firstComment != NULL && line[0] != '\t')
   2638  1.512    rillig 		*firstComment = '\0';
   2639  1.469    rillig 
   2640  1.469    rillig 	/* If we didn't see a '\\' then the in-situ data is fine. */
   2641  1.492    rillig 	if (firstBackslash == NULL)
   2642  1.469    rillig 		return line;
   2643  1.469    rillig 
   2644  1.469    rillig 	/* Remove escapes from '\n' and '#' */
   2645  1.492    rillig 	UnescapeBackslash(line, firstBackslash);
   2646   1.27  christos 
   2647  1.469    rillig 	return line;
   2648    1.5       cgd }
   2649    1.1       cgd 
   2650  1.553    rillig static bool
   2651  1.593    rillig SkipIrrelevantBranches(void)
   2652  1.501    rillig {
   2653  1.501    rillig 	char *line;
   2654  1.501    rillig 
   2655  1.593    rillig 	while ((line = ReadLowLevelLine(LK_DOT)) != NULL) {
   2656  1.604    rillig 		if (Cond_EvalLine(line) == CR_TRUE)
   2657  1.501    rillig 			break;
   2658  1.501    rillig 		/*
   2659  1.501    rillig 		 * TODO: Check for typos in .elif directives
   2660  1.501    rillig 		 * such as .elsif or .elseif.
   2661  1.501    rillig 		 *
   2662  1.501    rillig 		 * This check will probably duplicate some of
   2663  1.501    rillig 		 * the code in ParseLine.  Most of the code
   2664  1.501    rillig 		 * there cannot apply, only ParseVarassign and
   2665  1.555    rillig 		 * ParseDependencyLine can, and to prevent code
   2666  1.501    rillig 		 * duplication, these would need to be called
   2667  1.501    rillig 		 * with a flag called onlyCheckSyntax.
   2668  1.501    rillig 		 *
   2669  1.501    rillig 		 * See directive-elif.mk for details.
   2670  1.501    rillig 		 */
   2671  1.501    rillig 	}
   2672  1.501    rillig 
   2673  1.501    rillig 	return line != NULL;
   2674  1.501    rillig }
   2675  1.501    rillig 
   2676  1.553    rillig static bool
   2677  1.500    rillig ParseForLoop(const char *line)
   2678  1.500    rillig {
   2679  1.500    rillig 	int rval;
   2680  1.500    rillig 	int firstLineno;
   2681  1.500    rillig 
   2682  1.500    rillig 	rval = For_Eval(line);
   2683  1.500    rillig 	if (rval == 0)
   2684  1.553    rillig 		return false;	/* Not a .for line */
   2685  1.500    rillig 	if (rval < 0)
   2686  1.553    rillig 		return true;	/* Syntax error - error printed, ignore line */
   2687  1.500    rillig 
   2688  1.500    rillig 	firstLineno = CurFile()->lineno;
   2689  1.500    rillig 
   2690  1.500    rillig 	/* Accumulate loop lines until matching .endfor */
   2691  1.500    rillig 	do {
   2692  1.593    rillig 		line = ReadLowLevelLine(LK_FOR_BODY);
   2693  1.500    rillig 		if (line == NULL) {
   2694  1.500    rillig 			Parse_Error(PARSE_FATAL,
   2695  1.572    rillig 			    "Unexpected end of file in .for loop");
   2696  1.500    rillig 			break;
   2697  1.500    rillig 		}
   2698  1.500    rillig 	} while (For_Accum(line));
   2699  1.500    rillig 
   2700  1.500    rillig 	For_Run(firstLineno);	/* Stash each iteration as a new 'input file' */
   2701  1.500    rillig 
   2702  1.553    rillig 	return true;		/* Read next line from for-loop buffer */
   2703  1.500    rillig }
   2704  1.500    rillig 
   2705  1.469    rillig /*
   2706  1.482    rillig  * Read an entire line from the input file.
   2707  1.482    rillig  *
   2708  1.482    rillig  * Empty lines, .if and .for are completely handled by this function,
   2709  1.482    rillig  * leaving only variable assignments, other directives, dependency lines
   2710  1.482    rillig  * and shell commands to the caller.
   2711    1.1       cgd  *
   2712    1.1       cgd  * Results:
   2713  1.482    rillig  *	A line without its newline and without any trailing whitespace,
   2714  1.482    rillig  *	or NULL.
   2715    1.1       cgd  */
   2716    1.1       cgd static char *
   2717  1.593    rillig ReadHighLevelLine(void)
   2718    1.1       cgd {
   2719  1.500    rillig 	char *line;
   2720  1.469    rillig 
   2721  1.469    rillig 	for (;;) {
   2722  1.593    rillig 		line = ReadLowLevelLine(LK_NONEMPTY);
   2723  1.469    rillig 		if (line == NULL)
   2724  1.469    rillig 			return NULL;
   2725  1.469    rillig 
   2726  1.469    rillig 		if (line[0] != '.')
   2727  1.469    rillig 			return line;
   2728  1.469    rillig 
   2729  1.469    rillig 		/*
   2730  1.469    rillig 		 * The line might be a conditional. Ask the conditional module
   2731  1.469    rillig 		 * about it and act accordingly
   2732  1.469    rillig 		 */
   2733  1.469    rillig 		switch (Cond_EvalLine(line)) {
   2734  1.604    rillig 		case CR_FALSE:	/* May also mean a syntax error. */
   2735  1.593    rillig 			if (!SkipIrrelevantBranches())
   2736  1.482    rillig 				return NULL;
   2737  1.469    rillig 			continue;
   2738  1.604    rillig 		case CR_TRUE:
   2739  1.469    rillig 			continue;
   2740  1.604    rillig 		case CR_ERROR:	/* Not a conditional line */
   2741  1.500    rillig 			if (ParseForLoop(line))
   2742  1.469    rillig 				continue;
   2743  1.500    rillig 			break;
   2744  1.469    rillig 		}
   2745  1.469    rillig 		return line;
   2746    1.1       cgd 	}
   2747    1.1       cgd }
   2748    1.1       cgd 
   2749  1.331    rillig static void
   2750  1.329    rillig FinishDependencyGroup(void)
   2751    1.1       cgd {
   2752  1.469    rillig 	GNodeListNode *ln;
   2753  1.430    rillig 
   2754  1.469    rillig 	if (targets == NULL)
   2755  1.469    rillig 		return;
   2756  1.371    rillig 
   2757  1.469    rillig 	for (ln = targets->first; ln != NULL; ln = ln->next) {
   2758  1.469    rillig 		GNode *gn = ln->datum;
   2759  1.371    rillig 
   2760  1.469    rillig 		Suff_EndTransform(gn);
   2761  1.371    rillig 
   2762  1.469    rillig 		/*
   2763  1.469    rillig 		 * Mark the target as already having commands if it does, to
   2764  1.469    rillig 		 * keep from having shell commands on multiple dependency
   2765  1.469    rillig 		 * lines.
   2766  1.469    rillig 		 */
   2767  1.469    rillig 		if (!Lst_IsEmpty(&gn->commands))
   2768  1.469    rillig 			gn->type |= OP_HAS_COMMANDS;
   2769  1.469    rillig 	}
   2770  1.430    rillig 
   2771  1.469    rillig 	Lst_Free(targets);
   2772  1.469    rillig 	targets = NULL;
   2773    1.1       cgd }
   2774   1.27  christos 
   2775  1.327    rillig /* Add the command to each target from the current dependency spec. */
   2776  1.326    rillig static void
   2777  1.375    rillig ParseLine_ShellCommand(const char *p)
   2778  1.326    rillig {
   2779  1.469    rillig 	cpp_skip_whitespace(&p);
   2780  1.469    rillig 	if (*p == '\0')
   2781  1.469    rillig 		return;		/* skip empty commands */
   2782  1.327    rillig 
   2783  1.469    rillig 	if (targets == NULL) {
   2784  1.469    rillig 		Parse_Error(PARSE_FATAL,
   2785  1.469    rillig 		    "Unassociated shell command \"%s\"", p);
   2786  1.469    rillig 		return;
   2787  1.469    rillig 	}
   2788  1.327    rillig 
   2789  1.469    rillig 	{
   2790  1.469    rillig 		char *cmd = bmake_strdup(p);
   2791  1.469    rillig 		GNodeListNode *ln;
   2792  1.469    rillig 
   2793  1.469    rillig 		for (ln = targets->first; ln != NULL; ln = ln->next) {
   2794  1.469    rillig 			GNode *gn = ln->datum;
   2795  1.593    rillig 			GNode_AddCommand(gn, cmd);
   2796  1.469    rillig 		}
   2797  1.326    rillig #ifdef CLEANUP
   2798  1.469    rillig 		Lst_Append(&targCmds, cmd);
   2799  1.326    rillig #endif
   2800  1.469    rillig 	}
   2801  1.326    rillig }
   2802    1.1       cgd 
   2803  1.474    rillig /*
   2804  1.477    rillig  * See if the line starts with one of the known directives, and if so, handle
   2805  1.477    rillig  * the directive.
   2806  1.474    rillig  */
   2807  1.553    rillig static bool
   2808  1.379    rillig ParseDirective(char *line)
   2809  1.379    rillig {
   2810  1.474    rillig 	char *cp = line + 1;
   2811  1.569    rillig 	const char *arg;
   2812  1.569    rillig 	Substring dir;
   2813  1.474    rillig 
   2814  1.474    rillig 	pp_skip_whitespace(&cp);
   2815  1.553    rillig 	if (IsInclude(cp, false)) {
   2816  1.556    rillig 		ParseInclude(cp);
   2817  1.553    rillig 		return true;
   2818  1.474    rillig 	}
   2819  1.379    rillig 
   2820  1.569    rillig 	dir.start = cp;
   2821  1.475    rillig 	while (ch_isalpha(*cp) || *cp == '-')
   2822  1.475    rillig 		cp++;
   2823  1.569    rillig 	dir.end = cp;
   2824  1.475    rillig 
   2825  1.475    rillig 	if (*cp != '\0' && !ch_isspace(*cp))
   2826  1.553    rillig 		return false;
   2827  1.475    rillig 
   2828  1.475    rillig 	pp_skip_whitespace(&cp);
   2829  1.475    rillig 	arg = cp;
   2830  1.475    rillig 
   2831  1.581    rillig 	if (Substring_Equals(dir, "undef"))
   2832  1.569    rillig 		Var_Undef(arg);
   2833  1.581    rillig 	else if (Substring_Equals(dir, "export"))
   2834  1.517    rillig 		Var_Export(VEM_PLAIN, arg);
   2835  1.581    rillig 	else if (Substring_Equals(dir, "export-env"))
   2836  1.517    rillig 		Var_Export(VEM_ENV, arg);
   2837  1.581    rillig 	else if (Substring_Equals(dir, "export-literal"))
   2838  1.476    rillig 		Var_Export(VEM_LITERAL, arg);
   2839  1.581    rillig 	else if (Substring_Equals(dir, "unexport"))
   2840  1.553    rillig 		Var_UnExport(false, arg);
   2841  1.581    rillig 	else if (Substring_Equals(dir, "unexport-env"))
   2842  1.553    rillig 		Var_UnExport(true, arg);
   2843  1.581    rillig 	else if (Substring_Equals(dir, "info"))
   2844  1.602    rillig 		HandleMessage(PARSE_INFO, "info", arg);
   2845  1.581    rillig 	else if (Substring_Equals(dir, "warning"))
   2846  1.602    rillig 		HandleMessage(PARSE_WARNING, "warning", arg);
   2847  1.581    rillig 	else if (Substring_Equals(dir, "error"))
   2848  1.602    rillig 		HandleMessage(PARSE_FATAL, "error", arg);
   2849  1.581    rillig 	else
   2850  1.581    rillig 		return false;
   2851  1.581    rillig 	return true;
   2852  1.379    rillig }
   2853  1.379    rillig 
   2854  1.605    rillig bool
   2855  1.605    rillig Parse_VarAssign(const char *line, bool finishDependencyGroup, GNode *scope)
   2856  1.379    rillig {
   2857  1.469    rillig 	VarAssign var;
   2858  1.430    rillig 
   2859  1.469    rillig 	if (!Parse_IsVar(line, &var))
   2860  1.553    rillig 		return false;
   2861  1.605    rillig 	if (finishDependencyGroup)
   2862  1.605    rillig 		FinishDependencyGroup();
   2863  1.605    rillig 	Parse_Var(&var, scope);
   2864  1.553    rillig 	return true;
   2865  1.379    rillig }
   2866  1.379    rillig 
   2867  1.380    rillig static char *
   2868  1.380    rillig FindSemicolon(char *p)
   2869  1.380    rillig {
   2870  1.469    rillig 	int level = 0;
   2871  1.469    rillig 
   2872  1.469    rillig 	for (; *p != '\0'; p++) {
   2873  1.469    rillig 		if (*p == '\\' && p[1] != '\0') {
   2874  1.469    rillig 			p++;
   2875  1.469    rillig 			continue;
   2876  1.469    rillig 		}
   2877  1.380    rillig 
   2878  1.469    rillig 		if (*p == '$' && (p[1] == '(' || p[1] == '{'))
   2879  1.469    rillig 			level++;
   2880  1.469    rillig 		else if (level > 0 && (*p == ')' || *p == '}'))
   2881  1.469    rillig 			level--;
   2882  1.469    rillig 		else if (level == 0 && *p == ';')
   2883  1.469    rillig 			break;
   2884  1.469    rillig 	}
   2885  1.469    rillig 	return p;
   2886  1.380    rillig }
   2887  1.380    rillig 
   2888  1.524    rillig /*
   2889  1.557    rillig  * dependency	-> target... op [source...] [';' command]
   2890  1.524    rillig  * op		-> ':' | '::' | '!'
   2891  1.524    rillig  */
   2892  1.379    rillig static void
   2893  1.555    rillig ParseDependencyLine(char *line)
   2894  1.379    rillig {
   2895  1.557    rillig 	VarEvalMode emode;
   2896  1.469    rillig 	char *expanded_line;
   2897  1.469    rillig 	const char *shellcmd = NULL;
   2898  1.469    rillig 
   2899  1.469    rillig 	/*
   2900  1.469    rillig 	 * For some reason - probably to make the parser impossible -
   2901  1.469    rillig 	 * a ';' can be used to separate commands from dependencies.
   2902  1.469    rillig 	 * Attempt to avoid ';' inside substitution patterns.
   2903  1.469    rillig 	 */
   2904  1.469    rillig 	{
   2905  1.469    rillig 		char *semicolon = FindSemicolon(line);
   2906  1.469    rillig 		if (*semicolon != '\0') {
   2907  1.469    rillig 			/* Terminate the dependency list at the ';' */
   2908  1.469    rillig 			*semicolon = '\0';
   2909  1.469    rillig 			shellcmd = semicolon + 1;
   2910  1.469    rillig 		}
   2911  1.469    rillig 	}
   2912  1.379    rillig 
   2913  1.469    rillig 	/*
   2914  1.469    rillig 	 * We now know it's a dependency line so it needs to have all
   2915  1.469    rillig 	 * variables expanded before being parsed.
   2916  1.469    rillig 	 *
   2917  1.469    rillig 	 * XXX: Ideally the dependency line would first be split into
   2918  1.469    rillig 	 * its left-hand side, dependency operator and right-hand side,
   2919  1.469    rillig 	 * and then each side would be expanded on its own.  This would
   2920  1.469    rillig 	 * allow for the left-hand side to allow only defined variables
   2921  1.469    rillig 	 * and to allow variables on the right-hand side to be undefined
   2922  1.469    rillig 	 * as well.
   2923  1.469    rillig 	 *
   2924  1.469    rillig 	 * Parsing the line first would also prevent that targets
   2925  1.469    rillig 	 * generated from variable expressions are interpreted as the
   2926  1.469    rillig 	 * dependency operator, such as in "target${:U\:} middle: source",
   2927  1.469    rillig 	 * in which the middle is interpreted as a source, not a target.
   2928  1.469    rillig 	 */
   2929  1.469    rillig 
   2930  1.583    rillig 	/*
   2931  1.583    rillig 	 * In lint mode, allow undefined variables to appear in dependency
   2932  1.583    rillig 	 * lines.
   2933  1.469    rillig 	 *
   2934  1.583    rillig 	 * Ideally, only the right-hand side would allow undefined variables
   2935  1.583    rillig 	 * since it is common to have optional dependencies. Having undefined
   2936  1.583    rillig 	 * variables on the left-hand side is more unusual though.  Since
   2937  1.583    rillig 	 * both sides are expanded in a single pass, there is not much choice
   2938  1.583    rillig 	 * what to do here.
   2939  1.469    rillig 	 *
   2940  1.583    rillig 	 * In normal mode, it does not matter whether undefined variables are
   2941  1.583    rillig 	 * allowed or not since as of 2020-09-14, Var_Parse does not print
   2942  1.583    rillig 	 * any parse errors in such a case. It simply returns the special
   2943  1.583    rillig 	 * empty string var_Error, which cannot be detected in the result of
   2944  1.583    rillig 	 * Var_Subst.
   2945  1.583    rillig 	 */
   2946  1.557    rillig 	emode = opts.strict ? VARE_WANTRES : VARE_UNDEFERR;
   2947  1.557    rillig 	(void)Var_Subst(line, SCOPE_CMDLINE, emode, &expanded_line);
   2948  1.469    rillig 	/* TODO: handle errors */
   2949  1.469    rillig 
   2950  1.469    rillig 	/* Need a fresh list for the target nodes */
   2951  1.469    rillig 	if (targets != NULL)
   2952  1.469    rillig 		Lst_Free(targets);
   2953  1.469    rillig 	targets = Lst_New();
   2954  1.379    rillig 
   2955  1.556    rillig 	ParseDependency(expanded_line);
   2956  1.469    rillig 	free(expanded_line);
   2957  1.380    rillig 
   2958  1.469    rillig 	if (shellcmd != NULL)
   2959  1.469    rillig 		ParseLine_ShellCommand(shellcmd);
   2960  1.379    rillig }
   2961  1.379    rillig 
   2962  1.381    rillig static void
   2963  1.381    rillig ParseLine(char *line)
   2964  1.381    rillig {
   2965  1.477    rillig 	/*
   2966  1.477    rillig 	 * Lines that begin with '.' can be pretty much anything:
   2967  1.477    rillig 	 *	- directives like '.include' or '.if',
   2968  1.477    rillig 	 *	- suffix rules like '.c.o:',
   2969  1.477    rillig 	 *	- dependencies for filenames that start with '.',
   2970  1.477    rillig 	 *	- variable assignments like '.tmp=value'.
   2971  1.477    rillig 	 */
   2972  1.474    rillig 	if (line[0] == '.' && ParseDirective(line))
   2973  1.469    rillig 		return;
   2974  1.381    rillig 
   2975  1.478    rillig 	if (line[0] == '\t') {
   2976  1.469    rillig 		ParseLine_ShellCommand(line + 1);
   2977  1.469    rillig 		return;
   2978  1.469    rillig 	}
   2979  1.381    rillig 
   2980  1.381    rillig #ifdef SYSVINCLUDE
   2981  1.469    rillig 	if (IsSysVInclude(line)) {
   2982  1.469    rillig 		/*
   2983  1.469    rillig 		 * It's an S3/S5-style "include".
   2984  1.469    rillig 		 */
   2985  1.469    rillig 		ParseTraditionalInclude(line);
   2986  1.469    rillig 		return;
   2987  1.469    rillig 	}
   2988  1.381    rillig #endif
   2989  1.381    rillig 
   2990  1.381    rillig #ifdef GMAKEEXPORT
   2991  1.469    rillig 	if (strncmp(line, "export", 6) == 0 && ch_isspace(line[6]) &&
   2992  1.469    rillig 	    strchr(line, ':') == NULL) {
   2993  1.469    rillig 		/*
   2994  1.469    rillig 		 * It's a Gmake "export".
   2995  1.469    rillig 		 */
   2996  1.469    rillig 		ParseGmakeExport(line);
   2997  1.469    rillig 		return;
   2998  1.469    rillig 	}
   2999  1.381    rillig #endif
   3000  1.381    rillig 
   3001  1.605    rillig 	if (Parse_VarAssign(line, true, SCOPE_GLOBAL))
   3002  1.469    rillig 		return;
   3003  1.381    rillig 
   3004  1.469    rillig 	FinishDependencyGroup();
   3005  1.381    rillig 
   3006  1.555    rillig 	ParseDependencyLine(line);
   3007  1.381    rillig }
   3008  1.381    rillig 
   3009  1.469    rillig /*
   3010  1.469    rillig  * Parse a top-level makefile, incorporating its content into the global
   3011  1.441    rillig  * dependency graph.
   3012    1.1       cgd  */
   3013    1.1       cgd void
   3014  1.125       dsl Parse_File(const char *name, int fd)
   3015    1.1       cgd {
   3016  1.613    rillig 	char *line;
   3017  1.469    rillig 	struct loadedfile *lf;
   3018  1.170  dholland 
   3019  1.613    rillig 	lf = loadfile(name, fd != -1 ? fd : STDIN_FILENO);
   3020  1.613    rillig 	if (fd != -1)
   3021  1.613    rillig 		(void)close(fd);
   3022    1.1       cgd 
   3023  1.469    rillig 	assert(targets == NULL);
   3024   1.44     aidan 
   3025  1.614    rillig 	Parse_PushInput(name, 0, loadedfile_readMore, lf);
   3026  1.469    rillig 	CurFile()->lf = lf;
   3027    1.1       cgd 
   3028  1.469    rillig 	do {
   3029  1.593    rillig 		while ((line = ReadHighLevelLine()) != NULL) {
   3030  1.591    rillig 			DEBUG2(PARSE, "Parsing line %d: %s\n",
   3031  1.469    rillig 			    CurFile()->lineno, line);
   3032  1.469    rillig 			ParseLine(line);
   3033  1.469    rillig 		}
   3034  1.469    rillig 		/* Reached EOF, but it may be just EOF of an include file. */
   3035  1.469    rillig 	} while (ParseEOF());
   3036    1.1       cgd 
   3037  1.469    rillig 	FinishDependencyGroup();
   3038  1.328    rillig 
   3039  1.561    rillig 	if (parseErrors != 0) {
   3040  1.469    rillig 		(void)fflush(stdout);
   3041  1.469    rillig 		(void)fprintf(stderr,
   3042  1.469    rillig 		    "%s: Fatal errors encountered -- cannot continue",
   3043  1.469    rillig 		    progname);
   3044  1.469    rillig 		PrintOnError(NULL, NULL);
   3045  1.469    rillig 		exit(1);
   3046  1.469    rillig 	}
   3047    1.1       cgd }
   3048    1.1       cgd 
   3049  1.383    rillig /* Initialize the parsing module. */
   3050    1.5       cgd void
   3051   1.84       wiz Parse_Init(void)
   3052    1.1       cgd {
   3053  1.469    rillig 	mainNode = NULL;
   3054  1.469    rillig 	parseIncPath = SearchPath_New();
   3055  1.469    rillig 	sysIncPath = SearchPath_New();
   3056  1.469    rillig 	defSysIncPath = SearchPath_New();
   3057  1.469    rillig 	Vector_Init(&includes, sizeof(IFile));
   3058    1.1       cgd }
   3059    1.9       jtc 
   3060  1.383    rillig /* Clean up the parsing module. */
   3061    1.9       jtc void
   3062   1.84       wiz Parse_End(void)
   3063    1.9       jtc {
   3064   1.45   mycroft #ifdef CLEANUP
   3065  1.469    rillig 	Lst_DoneCall(&targCmds, free);
   3066  1.469    rillig 	assert(targets == NULL);
   3067  1.469    rillig 	SearchPath_Free(defSysIncPath);
   3068  1.469    rillig 	SearchPath_Free(sysIncPath);
   3069  1.469    rillig 	SearchPath_Free(parseIncPath);
   3070  1.469    rillig 	assert(includes.len == 0);
   3071  1.469    rillig 	Vector_Done(&includes);
   3072   1.45   mycroft #endif
   3073    1.9       jtc }
   3074   1.27  christos 
   3075    1.1       cgd 
   3076  1.441    rillig /*
   3077  1.441    rillig  * Return a list containing the single main target to create.
   3078  1.441    rillig  * If no such target exists, we Punt with an obnoxious error message.
   3079    1.1       cgd  */
   3080  1.461    rillig void
   3081  1.461    rillig Parse_MainName(GNodeList *mainList)
   3082    1.1       cgd {
   3083  1.469    rillig 	if (mainNode == NULL)
   3084  1.469    rillig 		Punt("no target to make.");
   3085  1.430    rillig 
   3086  1.527    rillig 	Lst_Append(mainList, mainNode);
   3087  1.527    rillig 	if (mainNode->type & OP_DOUBLEDEP)
   3088  1.469    rillig 		Lst_AppendAll(mainList, &mainNode->cohorts);
   3089  1.441    rillig 
   3090  1.542    rillig 	Global_Append(".TARGETS", mainNode->name);
   3091   1.59  christos }
   3092  1.420    rillig 
   3093  1.420    rillig int
   3094  1.561    rillig Parse_NumErrors(void)
   3095  1.420    rillig {
   3096  1.561    rillig 	return parseErrors;
   3097  1.420    rillig }
   3098