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