Home | History | Annotate | Line # | Download | only in make
parse.c revision 1.392
      1  1.392    rillig /*	$NetBSD: parse.c,v 1.392 2020/10/19 20:51:18 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.1       cgd /*-
     72    1.1       cgd  * parse.c --
     73    1.1       cgd  *	Functions to parse a makefile.
     74    1.1       cgd  *
     75    1.1       cgd  *	One function, Parse_Init, must be called before any functions
     76    1.1       cgd  *	in this module are used. After that, the function Parse_File is the
     77    1.1       cgd  *	main entry point and controls most of the other functions in this
     78    1.1       cgd  *	module.
     79    1.1       cgd  *
     80    1.1       cgd  *	Most important structures are kept in Lsts. Directories for
     81  1.123       dsl  *	the .include "..." function are kept in the 'parseIncPath' Lst, while
     82  1.123       dsl  *	those for the .include <...> are kept in the 'sysIncPath' Lst. The
     83    1.1       cgd  *	targets currently being defined are kept in the 'targets' Lst.
     84    1.1       cgd  *
     85    1.1       cgd  *	The variables 'fname' and 'lineno' are used to track the name
     86    1.1       cgd  *	of the current file and the line number in that file so that error
     87    1.1       cgd  *	messages can be more meaningful.
     88    1.1       cgd  *
     89    1.1       cgd  * Interface:
     90  1.338    rillig  *	Parse_Init	Initialization function which must be
     91  1.338    rillig  *			called before anything else in this module
     92  1.338    rillig  *			is used.
     93  1.338    rillig  *
     94  1.383    rillig  *	Parse_End	Clean up the module
     95  1.338    rillig  *
     96  1.338    rillig  *	Parse_File	Function used to parse a makefile. It must
     97  1.338    rillig  *			be given the name of the file, which should
     98  1.338    rillig  *			already have been opened, and a function
     99  1.338    rillig  *			to call to read a character from the file.
    100  1.338    rillig  *
    101  1.338    rillig  *	Parse_IsVar	Returns TRUE if the given line is a
    102  1.338    rillig  *			variable assignment. Used by MainParseArgs
    103  1.338    rillig  *			to determine if an argument is a target
    104  1.338    rillig  *			or a variable assignment. Used internally
    105  1.338    rillig  *			for pretty much the same thing...
    106  1.338    rillig  *
    107  1.338    rillig  *	Parse_Error	Function called when an error occurs in
    108  1.338    rillig  *			parsing. Used by the variable and
    109  1.338    rillig  *			conditional modules.
    110  1.338    rillig  *
    111  1.338    rillig  *	Parse_MainName	Returns a Lst of the main target to create.
    112    1.1       cgd  */
    113    1.1       cgd 
    114  1.170  dholland #include <sys/types.h>
    115  1.170  dholland #include <sys/mman.h>
    116  1.171  dholland #include <sys/stat.h>
    117   1.84       wiz #include <errno.h>
    118    1.5       cgd #include <stdarg.h>
    119  1.225      maya #include <stdint.h>
    120   1.84       wiz 
    121  1.177  nakayama #ifndef MAP_FILE
    122  1.177  nakayama #define MAP_FILE 0
    123  1.177  nakayama #endif
    124  1.170  dholland #ifndef MAP_COPY
    125  1.170  dholland #define MAP_COPY MAP_PRIVATE
    126  1.170  dholland #endif
    127  1.170  dholland 
    128    1.1       cgd #include "make.h"
    129    1.5       cgd #include "dir.h"
    130    1.5       cgd #include "job.h"
    131    1.1       cgd #include "pathnames.h"
    132    1.1       cgd 
    133  1.303    rillig /*	"@(#)parse.c	8.3 (Berkeley) 3/19/94"	*/
    134  1.392    rillig MAKE_RCSID("$NetBSD: parse.c,v 1.392 2020/10/19 20:51:18 rillig Exp $");
    135  1.303    rillig 
    136  1.248    rillig /* types and constants */
    137  1.166  dholland 
    138    1.1       cgd /*
    139  1.166  dholland  * Structure for a file being read ("included file")
    140    1.1       cgd  */
    141    1.1       cgd typedef struct IFile {
    142  1.338    rillig     char *fname;		/* name of file */
    143  1.338    rillig     Boolean fromForLoop;	/* simulated .include by the .for loop */
    144  1.338    rillig     int lineno;			/* current line number in file */
    145  1.338    rillig     int first_lineno;		/* line number of start of text */
    146  1.369    rillig     unsigned int cond_depth;	/* 'if' nesting when file opened */
    147  1.338    rillig     Boolean depending;		/* state of doing_depend on EOF */
    148  1.338    rillig     char *P_str;		/* point to base of string buffer */
    149  1.338    rillig     char *P_ptr;		/* point to next char of string buffer */
    150  1.338    rillig     char *P_end;		/* point to the end of string buffer */
    151  1.338    rillig     char *(*nextbuf)(void *, size_t *); /* Function to get more data */
    152  1.338    rillig     void *nextbuf_arg;		/* Opaque arg for nextbuf() */
    153  1.338    rillig     struct loadedfile *lf;	/* loadedfile object, if any */
    154    1.5       cgd } IFile;
    155    1.1       cgd 
    156  1.166  dholland /*
    157  1.166  dholland  * Tokens for target attributes
    158    1.1       cgd  */
    159  1.386    rillig typedef enum ParseSpecial {
    160  1.338    rillig     Begin,		/* .BEGIN */
    161  1.338    rillig     Default,		/* .DEFAULT */
    162  1.338    rillig     DeleteOnError,	/* .DELETE_ON_ERROR */
    163  1.338    rillig     End,		/* .END */
    164  1.338    rillig     dotError,		/* .ERROR */
    165  1.338    rillig     Ignore,		/* .IGNORE */
    166  1.338    rillig     Includes,		/* .INCLUDES */
    167  1.338    rillig     Interrupt,		/* .INTERRUPT */
    168  1.338    rillig     Libs,		/* .LIBS */
    169  1.338    rillig     Meta,		/* .META */
    170  1.338    rillig     MFlags,		/* .MFLAGS or .MAKEFLAGS */
    171  1.338    rillig     Main,		/* .MAIN and we don't have anything user-specified to
    172  1.338    rillig 			 * make */
    173  1.338    rillig     NoExport,		/* .NOEXPORT */
    174  1.338    rillig     NoMeta,		/* .NOMETA */
    175  1.338    rillig     NoMetaCmp,		/* .NOMETA_CMP */
    176  1.338    rillig     NoPath,		/* .NOPATH */
    177  1.338    rillig     Not,		/* Not special */
    178  1.338    rillig     NotParallel,	/* .NOTPARALLEL */
    179  1.338    rillig     Null,		/* .NULL */
    180  1.338    rillig     ExObjdir,		/* .OBJDIR */
    181  1.338    rillig     Order,		/* .ORDER */
    182  1.338    rillig     Parallel,		/* .PARALLEL */
    183  1.338    rillig     ExPath,		/* .PATH */
    184  1.338    rillig     Phony,		/* .PHONY */
    185   1.48       sjg #ifdef POSIX
    186  1.338    rillig     Posix,		/* .POSIX */
    187   1.48       sjg #endif
    188  1.338    rillig     Precious,		/* .PRECIOUS */
    189  1.338    rillig     ExShell,		/* .SHELL */
    190  1.338    rillig     Silent,		/* .SILENT */
    191  1.338    rillig     SingleShell,	/* .SINGLESHELL */
    192  1.338    rillig     Stale,		/* .STALE */
    193  1.338    rillig     Suffixes,		/* .SUFFIXES */
    194  1.338    rillig     Wait,		/* .WAIT */
    195  1.338    rillig     Attribute		/* Generic attribute */
    196    1.1       cgd } ParseSpecial;
    197    1.1       cgd 
    198  1.368    rillig typedef List SearchPathList;
    199  1.392    rillig typedef ListNode SearchPathListNode;
    200  1.368    rillig 
    201  1.248    rillig /* result data */
    202  1.166  dholland 
    203  1.166  dholland /*
    204  1.166  dholland  * The main target to create. This is the first target on the first
    205  1.166  dholland  * dependency line in the first makefile.
    206  1.166  dholland  */
    207  1.166  dholland static GNode *mainNode;
    208  1.166  dholland 
    209  1.248    rillig /* eval state */
    210  1.166  dholland 
    211  1.336    rillig /* During parsing, the targets from the currently active dependency line,
    212  1.336    rillig  * or NULL if the current line does not belong to a dependency line, for
    213  1.336    rillig  * example because it is a variable assignment.
    214  1.318    rillig  *
    215  1.318    rillig  * See unit-tests/deptgt.mk, keyword "parse.c:targets". */
    216  1.322    rillig static GNodeList *targets;
    217  1.166  dholland 
    218  1.166  dholland #ifdef CLEANUP
    219  1.372    rillig /* All shell commands for all targets, in no particular order and possibly
    220  1.372    rillig  * with duplicates.  Kept in a separate list since the commands from .USE or
    221  1.372    rillig  * .USEBEFORE nodes are shared with other GNodes, thereby giving up the
    222  1.372    rillig  * easily understandable ownership over the allocated strings. */
    223  1.322    rillig static StringList *targCmds;
    224  1.166  dholland #endif
    225  1.166  dholland 
    226  1.166  dholland /*
    227  1.152       dsl  * Predecessor node for handling .ORDER. Initialized to NULL when .ORDER
    228    1.1       cgd  * seen, then set to each successive source on the line.
    229    1.1       cgd  */
    230  1.374    rillig static GNode *predecessor;
    231    1.1       cgd 
    232  1.248    rillig /* parser state */
    233  1.166  dholland 
    234  1.166  dholland /* number of fatal errors */
    235  1.166  dholland static int fatals = 0;
    236  1.166  dholland 
    237  1.166  dholland /*
    238  1.166  dholland  * Variables for doing includes
    239  1.166  dholland  */
    240  1.166  dholland 
    241  1.166  dholland /* current file being read */
    242  1.166  dholland static IFile *curFile;
    243  1.166  dholland 
    244  1.319    rillig /* The include chain of makefiles that leads to curFile.  At the bottom of
    245  1.319    rillig  * the stack is the top-level makefile from the command line, and on top of
    246  1.319    rillig  * this file, there are the included files or .for loops, up to but excluding
    247  1.319    rillig  * curFile.
    248  1.319    rillig  *
    249  1.319    rillig  * This data could be used to print stack traces on parse errors.  As of
    250  1.319    rillig  * 2020-09-14, this is not done though.  It seems quite simple to print the
    251  1.319    rillig  * tuples (fname:lineno:fromForLoop), from top to bottom.  This simple idea is
    252  1.319    rillig  * made complicated by the fact that the .for loops also use this stack for
    253  1.319    rillig  * storing information.
    254  1.319    rillig  *
    255  1.319    rillig  * The lineno fields of the IFiles with fromForLoop == TRUE look confusing,
    256  1.319    rillig  * which is demonstrated by the test 'include-main.mk'.  They seem sorted
    257  1.319    rillig  * backwards since they tell the number of completely parsed lines, which for
    258  1.319    rillig  * a .for loop is right after the terminating .endfor.  To compensate for this
    259  1.319    rillig  * confusion, there is another field first_lineno pointing at the start of the
    260  1.319    rillig  * .for loop, 1-based for human consumption.
    261  1.319    rillig  *
    262  1.319    rillig  * To make the stack trace intuitive, the entry below the first .for loop must
    263  1.319    rillig  * be ignored completely since neither its lineno nor its first_lineno is
    264  1.319    rillig  * useful.  Instead, the topmost .for loop needs to be printed twice, once
    265  1.319    rillig  * with its first_lineno and once with its lineno.
    266  1.319    rillig  *
    267  1.319    rillig  * As of 2020-09-15, using the above rules, the stack trace for the .info line
    268  1.319    rillig  * in include-subsub.mk would be:
    269  1.319    rillig  *
    270  1.319    rillig  *	curFile:	include-subsub.mk:4
    271  1.319    rillig  *			(lineno, from an .include)
    272  1.319    rillig  *	includes[4]:	include-sub.mk:32
    273  1.319    rillig  *			(lineno, from a .for loop below an .include)
    274  1.319    rillig  *	includes[4]:	include-sub.mk:31
    275  1.319    rillig  *			(first_lineno, from a .for loop, lineno == 32)
    276  1.319    rillig  *	includes[3]:	include-sub.mk:30
    277  1.319    rillig  *			(first_lineno, from a .for loop, lineno == 33)
    278  1.319    rillig  *	includes[2]:	include-sub.mk:29
    279  1.319    rillig  *			(first_lineno, from a .for loop, lineno == 34)
    280  1.319    rillig  *	includes[1]:	include-sub.mk:35
    281  1.319    rillig  *			(not printed since it is below a .for loop)
    282  1.319    rillig  *	includes[0]:	include-main.mk:27
    283  1.319    rillig  */
    284  1.384    rillig static Vector /* of IFile pointer */ includes;
    285  1.166  dholland 
    286  1.166  dholland /* include paths (lists of directories) */
    287  1.322    rillig SearchPath *parseIncPath;	/* dirs for "..." includes */
    288  1.322    rillig SearchPath *sysIncPath;		/* dirs for <...> includes */
    289  1.322    rillig SearchPath *defIncPath;		/* default for sysIncPath */
    290  1.166  dholland 
    291  1.248    rillig /* parser tables */
    292  1.166  dholland 
    293    1.1       cgd /*
    294    1.1       cgd  * The parseKeywords table is searched using binary search when deciding
    295    1.1       cgd  * if a target or source is special. The 'spec' field is the ParseSpecial
    296    1.1       cgd  * type of the keyword ("Not" if the keyword isn't special as a target) while
    297    1.1       cgd  * the 'op' field is the operator to apply to the list of targets if the
    298    1.1       cgd  * keyword is used as a source ("0" if the keyword isn't special as a source)
    299    1.1       cgd  */
    300  1.168  dholland static const struct {
    301  1.338    rillig     const char   *name;		/* Name of keyword */
    302  1.338    rillig     ParseSpecial  spec;		/* Type when used as a target */
    303  1.338    rillig     GNodeType	  op;		/* Operator when used as a source */
    304    1.1       cgd } parseKeywords[] = {
    305  1.338    rillig     { ".BEGIN",		Begin,		0 },
    306  1.338    rillig     { ".DEFAULT",	Default,	0 },
    307  1.338    rillig     { ".DELETE_ON_ERROR", DeleteOnError, 0 },
    308  1.338    rillig     { ".END",		End,		0 },
    309  1.338    rillig     { ".ERROR",		dotError,	0 },
    310  1.338    rillig     { ".EXEC",		Attribute,	OP_EXEC },
    311  1.338    rillig     { ".IGNORE",	Ignore,		OP_IGNORE },
    312  1.338    rillig     { ".INCLUDES",	Includes,	0 },
    313  1.338    rillig     { ".INTERRUPT",	Interrupt,	0 },
    314  1.338    rillig     { ".INVISIBLE",	Attribute,	OP_INVISIBLE },
    315  1.338    rillig     { ".JOIN",		Attribute,	OP_JOIN },
    316  1.338    rillig     { ".LIBS",		Libs,		0 },
    317  1.338    rillig     { ".MADE",		Attribute,	OP_MADE },
    318  1.338    rillig     { ".MAIN",		Main,		0 },
    319  1.338    rillig     { ".MAKE",		Attribute,	OP_MAKE },
    320  1.338    rillig     { ".MAKEFLAGS",	MFlags,		0 },
    321  1.338    rillig     { ".META",		Meta,		OP_META },
    322  1.338    rillig     { ".MFLAGS",	MFlags,		0 },
    323  1.338    rillig     { ".NOMETA",	NoMeta,		OP_NOMETA },
    324  1.338    rillig     { ".NOMETA_CMP",	NoMetaCmp,	OP_NOMETA_CMP },
    325  1.338    rillig     { ".NOPATH",	NoPath,		OP_NOPATH },
    326  1.338    rillig     { ".NOTMAIN",	Attribute,	OP_NOTMAIN },
    327  1.338    rillig     { ".NOTPARALLEL",	NotParallel,	0 },
    328  1.338    rillig     { ".NO_PARALLEL",	NotParallel,	0 },
    329  1.338    rillig     { ".NULL",		Null,		0 },
    330  1.338    rillig     { ".OBJDIR",	ExObjdir,	0 },
    331  1.338    rillig     { ".OPTIONAL",	Attribute,	OP_OPTIONAL },
    332  1.338    rillig     { ".ORDER",		Order,		0 },
    333  1.338    rillig     { ".PARALLEL",	Parallel,	0 },
    334  1.338    rillig     { ".PATH",		ExPath,		0 },
    335  1.338    rillig     { ".PHONY",		Phony,		OP_PHONY },
    336   1.48       sjg #ifdef POSIX
    337  1.338    rillig     { ".POSIX",		Posix,		0 },
    338   1.48       sjg #endif
    339  1.338    rillig     { ".PRECIOUS",	Precious,	OP_PRECIOUS },
    340  1.338    rillig     { ".RECURSIVE",	Attribute,	OP_MAKE },
    341  1.338    rillig     { ".SHELL",		ExShell,	0 },
    342  1.338    rillig     { ".SILENT",	Silent,		OP_SILENT },
    343  1.338    rillig     { ".SINGLESHELL",	SingleShell,	0 },
    344  1.338    rillig     { ".STALE",		Stale,		0 },
    345  1.338    rillig     { ".SUFFIXES",	Suffixes,	0 },
    346  1.338    rillig     { ".USE",		Attribute,	OP_USE },
    347  1.338    rillig     { ".USEBEFORE",	Attribute,	OP_USEBEFORE },
    348  1.338    rillig     { ".WAIT",		Wait,		0 },
    349    1.1       cgd };
    350    1.1       cgd 
    351  1.248    rillig /* file loader */
    352  1.170  dholland 
    353  1.170  dholland struct loadedfile {
    354  1.170  dholland 	const char *path;		/* name, for error reports */
    355  1.170  dholland 	char *buf;			/* contents buffer */
    356  1.170  dholland 	size_t len;			/* length of contents */
    357  1.170  dholland 	size_t maplen;			/* length of mmap area, or 0 */
    358  1.170  dholland 	Boolean used;			/* XXX: have we used the data yet */
    359  1.170  dholland };
    360  1.170  dholland 
    361  1.170  dholland static struct loadedfile *
    362  1.170  dholland loadedfile_create(const char *path)
    363  1.170  dholland {
    364  1.170  dholland 	struct loadedfile *lf;
    365  1.170  dholland 
    366  1.170  dholland 	lf = bmake_malloc(sizeof(*lf));
    367  1.242    rillig 	lf->path = path == NULL ? "(stdin)" : path;
    368  1.170  dholland 	lf->buf = NULL;
    369  1.170  dholland 	lf->len = 0;
    370  1.170  dholland 	lf->maplen = 0;
    371  1.170  dholland 	lf->used = FALSE;
    372  1.170  dholland 	return lf;
    373  1.170  dholland }
    374  1.170  dholland 
    375  1.170  dholland static void
    376  1.170  dholland loadedfile_destroy(struct loadedfile *lf)
    377  1.170  dholland {
    378  1.170  dholland 	if (lf->buf != NULL) {
    379  1.170  dholland 		if (lf->maplen > 0) {
    380  1.170  dholland 			munmap(lf->buf, lf->maplen);
    381  1.170  dholland 		} else {
    382  1.170  dholland 			free(lf->buf);
    383  1.170  dholland 		}
    384  1.170  dholland 	}
    385  1.170  dholland 	free(lf);
    386  1.170  dholland }
    387  1.170  dholland 
    388  1.170  dholland /*
    389  1.170  dholland  * nextbuf() operation for loadedfile, as needed by the weird and twisted
    390  1.170  dholland  * logic below. Once that's cleaned up, we can get rid of lf->used...
    391  1.170  dholland  */
    392  1.170  dholland static char *
    393  1.170  dholland loadedfile_nextbuf(void *x, size_t *len)
    394  1.170  dholland {
    395  1.170  dholland 	struct loadedfile *lf = x;
    396  1.170  dholland 
    397  1.170  dholland 	if (lf->used) {
    398  1.170  dholland 		return NULL;
    399  1.170  dholland 	}
    400  1.170  dholland 	lf->used = TRUE;
    401  1.170  dholland 	*len = lf->len;
    402  1.170  dholland 	return lf->buf;
    403  1.170  dholland }
    404  1.170  dholland 
    405  1.170  dholland /*
    406  1.170  dholland  * Try to get the size of a file.
    407  1.170  dholland  */
    408  1.272    rillig static Boolean
    409  1.170  dholland load_getsize(int fd, size_t *ret)
    410  1.170  dholland {
    411  1.170  dholland 	struct stat st;
    412  1.170  dholland 
    413  1.170  dholland 	if (fstat(fd, &st) < 0) {
    414  1.272    rillig 		return FALSE;
    415  1.170  dholland 	}
    416  1.170  dholland 
    417  1.170  dholland 	if (!S_ISREG(st.st_mode)) {
    418  1.272    rillig 		return FALSE;
    419  1.170  dholland 	}
    420  1.170  dholland 
    421  1.170  dholland 	/*
    422  1.170  dholland 	 * st_size is an off_t, which is 64 bits signed; *ret is
    423  1.170  dholland 	 * size_t, which might be 32 bits unsigned or 64 bits
    424  1.170  dholland 	 * unsigned. Rather than being elaborate, just punt on
    425  1.170  dholland 	 * files that are more than 2^31 bytes. We should never
    426  1.170  dholland 	 * see a makefile that size in practice...
    427  1.170  dholland 	 *
    428  1.170  dholland 	 * While we're at it reject negative sizes too, just in case.
    429  1.170  dholland 	 */
    430  1.170  dholland 	if (st.st_size < 0 || st.st_size > 0x7fffffff) {
    431  1.272    rillig 		return FALSE;
    432  1.170  dholland 	}
    433  1.170  dholland 
    434  1.170  dholland 	*ret = (size_t) st.st_size;
    435  1.272    rillig 	return TRUE;
    436  1.170  dholland }
    437  1.170  dholland 
    438  1.170  dholland /*
    439  1.170  dholland  * Read in a file.
    440  1.170  dholland  *
    441  1.170  dholland  * Until the path search logic can be moved under here instead of
    442  1.170  dholland  * being in the caller in another source file, we need to have the fd
    443  1.170  dholland  * passed in already open. Bleh.
    444  1.170  dholland  *
    445  1.170  dholland  * If the path is NULL use stdin and (to insure against fd leaks)
    446  1.170  dholland  * assert that the caller passed in -1.
    447  1.170  dholland  */
    448  1.170  dholland static struct loadedfile *
    449  1.170  dholland loadfile(const char *path, int fd)
    450  1.170  dholland {
    451  1.170  dholland 	struct loadedfile *lf;
    452  1.369    rillig 	static unsigned long pagesize = 0;
    453  1.170  dholland 	ssize_t result;
    454  1.170  dholland 	size_t bufpos;
    455  1.170  dholland 
    456  1.170  dholland 	lf = loadedfile_create(path);
    457  1.170  dholland 
    458  1.170  dholland 	if (path == NULL) {
    459  1.170  dholland 		assert(fd == -1);
    460  1.170  dholland 		fd = STDIN_FILENO;
    461  1.170  dholland 	} else {
    462  1.170  dholland #if 0 /* notyet */
    463  1.170  dholland 		fd = open(path, O_RDONLY);
    464  1.170  dholland 		if (fd < 0) {
    465  1.170  dholland 			...
    466  1.170  dholland 			Error("%s: %s", path, strerror(errno));
    467  1.170  dholland 			exit(1);
    468  1.170  dholland 		}
    469  1.170  dholland #endif
    470  1.170  dholland 	}
    471  1.170  dholland 
    472  1.272    rillig 	if (load_getsize(fd, &lf->len)) {
    473  1.170  dholland 		/* found a size, try mmap */
    474  1.227       sjg 		if (pagesize == 0)
    475  1.369    rillig 			pagesize = (unsigned long)sysconf(_SC_PAGESIZE);
    476  1.369    rillig 		if (pagesize == 0 || pagesize == (unsigned long)-1) {
    477  1.170  dholland 			pagesize = 0x1000;
    478  1.170  dholland 		}
    479  1.170  dholland 		/* round size up to a page */
    480  1.170  dholland 		lf->maplen = pagesize * ((lf->len + pagesize - 1)/pagesize);
    481  1.170  dholland 
    482  1.170  dholland 		/*
    483  1.170  dholland 		 * XXX hack for dealing with empty files; remove when
    484  1.170  dholland 		 * we're no longer limited by interfacing to the old
    485  1.170  dholland 		 * logic elsewhere in this file.
    486  1.170  dholland 		 */
    487  1.170  dholland 		if (lf->maplen == 0) {
    488  1.170  dholland 			lf->maplen = pagesize;
    489  1.170  dholland 		}
    490  1.170  dholland 
    491  1.170  dholland 		/*
    492  1.170  dholland 		 * FUTURE: remove PROT_WRITE when the parser no longer
    493  1.170  dholland 		 * needs to scribble on the input.
    494  1.170  dholland 		 */
    495  1.170  dholland 		lf->buf = mmap(NULL, lf->maplen, PROT_READ|PROT_WRITE,
    496  1.170  dholland 			       MAP_FILE|MAP_COPY, fd, 0);
    497  1.170  dholland 		if (lf->buf != MAP_FAILED) {
    498  1.170  dholland 			/* succeeded */
    499  1.178       dsl 			if (lf->len == lf->maplen && lf->buf[lf->len - 1] != '\n') {
    500  1.220      maya 				char *b = bmake_malloc(lf->len + 1);
    501  1.178       dsl 				b[lf->len] = '\n';
    502  1.178       dsl 				memcpy(b, lf->buf, lf->len++);
    503  1.178       dsl 				munmap(lf->buf, lf->maplen);
    504  1.178       dsl 				lf->maplen = 0;
    505  1.178       dsl 				lf->buf = b;
    506  1.178       dsl 			}
    507  1.170  dholland 			goto done;
    508  1.170  dholland 		}
    509  1.170  dholland 	}
    510  1.170  dholland 
    511  1.170  dholland 	/* cannot mmap; load the traditional way */
    512  1.170  dholland 
    513  1.170  dholland 	lf->maplen = 0;
    514  1.170  dholland 	lf->len = 1024;
    515  1.170  dholland 	lf->buf = bmake_malloc(lf->len);
    516  1.170  dholland 
    517  1.170  dholland 	bufpos = 0;
    518  1.170  dholland 	while (1) {
    519  1.170  dholland 		assert(bufpos <= lf->len);
    520  1.170  dholland 		if (bufpos == lf->len) {
    521  1.221  riastrad 			if (lf->len > SIZE_MAX/2) {
    522  1.221  riastrad 				errno = EFBIG;
    523  1.221  riastrad 				Error("%s: file too large", path);
    524  1.221  riastrad 				exit(1);
    525  1.221  riastrad 			}
    526  1.170  dholland 			lf->len *= 2;
    527  1.170  dholland 			lf->buf = bmake_realloc(lf->buf, lf->len);
    528  1.170  dholland 		}
    529  1.221  riastrad 		assert(bufpos < lf->len);
    530  1.170  dholland 		result = read(fd, lf->buf + bufpos, lf->len - bufpos);
    531  1.170  dholland 		if (result < 0) {
    532  1.170  dholland 			Error("%s: read error: %s", path, strerror(errno));
    533  1.170  dholland 			exit(1);
    534  1.170  dholland 		}
    535  1.170  dholland 		if (result == 0) {
    536  1.170  dholland 			break;
    537  1.170  dholland 		}
    538  1.369    rillig 		bufpos += (size_t)result;
    539  1.170  dholland 	}
    540  1.170  dholland 	assert(bufpos <= lf->len);
    541  1.173  dholland 	lf->len = bufpos;
    542  1.170  dholland 
    543  1.170  dholland 	/* truncate malloc region to actual length (maybe not useful) */
    544  1.172  dholland 	if (lf->len > 0) {
    545  1.218       sjg 		/* as for mmap case, ensure trailing \n */
    546  1.218       sjg 		if (lf->buf[lf->len - 1] != '\n')
    547  1.218       sjg 			lf->len++;
    548  1.172  dholland 		lf->buf = bmake_realloc(lf->buf, lf->len);
    549  1.218       sjg 		lf->buf[lf->len - 1] = '\n';
    550  1.172  dholland 	}
    551  1.170  dholland 
    552  1.170  dholland done:
    553  1.170  dholland 	if (path != NULL) {
    554  1.170  dholland 		close(fd);
    555  1.170  dholland 	}
    556  1.170  dholland 	return lf;
    557  1.170  dholland }
    558  1.170  dholland 
    559  1.248    rillig /* old code */
    560   1.77  christos 
    561  1.279    rillig /* Check if the current character is escaped on the current line. */
    562  1.279    rillig static Boolean
    563   1.84       wiz ParseIsEscaped(const char *line, const char *c)
    564   1.77  christos {
    565  1.280    rillig     Boolean active = FALSE;
    566   1.77  christos     for (;;) {
    567   1.77  christos 	if (line == c)
    568   1.77  christos 	    return active;
    569   1.77  christos 	if (*--c != '\\')
    570   1.77  christos 	    return active;
    571   1.77  christos 	active = !active;
    572   1.77  christos     }
    573   1.77  christos }
    574   1.77  christos 
    575  1.278    rillig /* Add the filename and lineno to the GNode so that we remember where it
    576  1.278    rillig  * was first defined. */
    577  1.278    rillig static void
    578  1.278    rillig ParseMark(GNode *gn)
    579  1.278    rillig {
    580  1.278    rillig     gn->fname = curFile->fname;
    581  1.278    rillig     gn->lineno = curFile->lineno;
    582  1.278    rillig }
    583  1.278    rillig 
    584  1.368    rillig /* Look in the table of keywords for one matching the given string.
    585  1.368    rillig  * Return the index of the keyword, or -1 if it isn't there. */
    586    1.1       cgd static int
    587  1.120       dsl ParseFindKeyword(const char *str)
    588    1.1       cgd {
    589  1.374    rillig     int start, end, cur;
    590  1.374    rillig     int diff;
    591   1.27  christos 
    592    1.1       cgd     start = 0;
    593  1.375    rillig     end = sizeof parseKeywords / sizeof parseKeywords[0] - 1;
    594    1.1       cgd 
    595    1.1       cgd     do {
    596  1.375    rillig 	cur = start + (end - start) / 2;
    597  1.103  christos 	diff = strcmp(str, parseKeywords[cur].name);
    598    1.1       cgd 
    599    1.1       cgd 	if (diff == 0) {
    600  1.235    rillig 	    return cur;
    601    1.1       cgd 	} else if (diff < 0) {
    602    1.1       cgd 	    end = cur - 1;
    603    1.1       cgd 	} else {
    604    1.1       cgd 	    start = cur + 1;
    605    1.1       cgd 	}
    606    1.1       cgd     } while (start <= end);
    607  1.235    rillig     return -1;
    608    1.1       cgd }
    609    1.1       cgd 
    610  1.291    rillig static void
    611  1.305    rillig PrintLocation(FILE *f, const char *filename, size_t lineno)
    612  1.291    rillig {
    613  1.291    rillig 	char dirbuf[MAXPATHLEN+1];
    614  1.305    rillig 	const char *dir, *base;
    615  1.305    rillig 	char *dir_freeIt, *base_freeIt;
    616  1.291    rillig 
    617  1.305    rillig 	if (*filename == '/' || strcmp(filename, "(stdin)") == 0) {
    618  1.305    rillig 		(void)fprintf(f, "\"%s\" line %zu: ", filename, lineno);
    619  1.299    rillig 		return;
    620  1.299    rillig 	}
    621  1.291    rillig 
    622  1.299    rillig 	/* Find out which makefile is the culprit.
    623  1.299    rillig 	 * We try ${.PARSEDIR} and apply realpath(3) if not absolute. */
    624  1.291    rillig 
    625  1.299    rillig 	dir = Var_Value(".PARSEDIR", VAR_GLOBAL, &dir_freeIt);
    626  1.299    rillig 	if (dir == NULL)
    627  1.299    rillig 		dir = ".";
    628  1.299    rillig 	if (*dir != '/')
    629  1.299    rillig 		dir = realpath(dir, dirbuf);
    630  1.299    rillig 
    631  1.305    rillig 	base = Var_Value(".PARSEFILE", VAR_GLOBAL, &base_freeIt);
    632  1.305    rillig 	if (base == NULL) {
    633  1.305    rillig 		const char *slash = strrchr(filename, '/');
    634  1.305    rillig 		base = slash != NULL ? slash + 1 : filename;
    635  1.299    rillig 	}
    636  1.299    rillig 
    637  1.305    rillig 	(void)fprintf(f, "\"%s/%s\" line %zu: ", dir, base, lineno);
    638  1.305    rillig 	bmake_free(base_freeIt);
    639  1.299    rillig 	bmake_free(dir_freeIt);
    640  1.291    rillig }
    641  1.291    rillig 
    642  1.300    rillig /* Print a parse error message, including location information.
    643    1.1       cgd  *
    644  1.300    rillig  * Increment "fatals" if the level is PARSE_FATAL, and continue parsing
    645  1.300    rillig  * until the end of the current top-level makefile, then exit (see
    646  1.368    rillig  * Parse_File). */
    647   1.38  christos static void
    648  1.127       dsl ParseVErrorInternal(FILE *f, const char *cfname, size_t clineno, int type,
    649  1.122       dsl     const char *fmt, va_list ap)
    650   1.38  christos {
    651   1.56  christos 	static Boolean fatal_warning_error_printed = FALSE;
    652   1.56  christos 
    653  1.148       sjg 	(void)fprintf(f, "%s: ", progname);
    654   1.63  christos 
    655  1.291    rillig 	if (cfname != NULL)
    656  1.291    rillig 		PrintLocation(f, cfname, clineno);
    657   1.38  christos 	if (type == PARSE_WARNING)
    658  1.127       dsl 		(void)fprintf(f, "warning: ");
    659  1.127       dsl 	(void)vfprintf(f, fmt, ap);
    660  1.127       dsl 	(void)fprintf(f, "\n");
    661  1.127       dsl 	(void)fflush(f);
    662  1.300    rillig 
    663  1.226       sjg 	if (type == PARSE_INFO)
    664  1.226       sjg 		return;
    665   1.56  christos 	if (type == PARSE_FATAL || parseWarnFatal)
    666  1.300    rillig 		fatals++;
    667   1.56  christos 	if (parseWarnFatal && !fatal_warning_error_printed) {
    668   1.56  christos 		Error("parsing warnings being treated as errors");
    669   1.56  christos 		fatal_warning_error_printed = TRUE;
    670   1.56  christos 	}
    671   1.38  christos }
    672   1.38  christos 
    673  1.203     joerg static void
    674  1.203     joerg ParseErrorInternal(const char *cfname, size_t clineno, int type,
    675  1.374    rillig 		   const char *fmt, ...)
    676  1.203     joerg {
    677  1.203     joerg 	va_list ap;
    678  1.203     joerg 
    679  1.203     joerg 	va_start(ap, fmt);
    680  1.203     joerg 	(void)fflush(stdout);
    681  1.203     joerg 	ParseVErrorInternal(stderr, cfname, clineno, type, fmt, ap);
    682  1.203     joerg 	va_end(ap);
    683  1.203     joerg 
    684  1.203     joerg 	if (debug_file != stderr && debug_file != stdout) {
    685  1.203     joerg 		va_start(ap, fmt);
    686  1.203     joerg 		ParseVErrorInternal(debug_file, cfname, clineno, type, fmt, ap);
    687  1.203     joerg 		va_end(ap);
    688  1.203     joerg 	}
    689  1.203     joerg }
    690  1.203     joerg 
    691  1.289    rillig /* External interface to ParseErrorInternal; uses the default filename and
    692  1.289    rillig  * line number.
    693   1.38  christos  *
    694  1.289    rillig  * Fmt is given without a trailing newline. */
    695    1.1       cgd void
    696   1.93  christos Parse_Error(int type, const char *fmt, ...)
    697    1.1       cgd {
    698    1.1       cgd 	va_list ap;
    699  1.156       dsl 	const char *fname;
    700  1.156       dsl 	size_t lineno;
    701   1.84       wiz 
    702  1.152       dsl 	if (curFile == NULL) {
    703  1.156       dsl 		fname = NULL;
    704  1.156       dsl 		lineno = 0;
    705  1.156       dsl 	} else {
    706  1.156       dsl 		fname = curFile->fname;
    707  1.369    rillig 		lineno = (size_t)curFile->lineno;
    708  1.148       sjg 	}
    709  1.156       dsl 
    710  1.156       dsl 	va_start(ap, fmt);
    711  1.163       sjg 	(void)fflush(stdout);
    712  1.156       dsl 	ParseVErrorInternal(stderr, fname, lineno, type, fmt, ap);
    713    1.1       cgd 	va_end(ap);
    714  1.127       dsl 
    715  1.131       dsl 	if (debug_file != stderr && debug_file != stdout) {
    716  1.127       dsl 		va_start(ap, fmt);
    717  1.156       dsl 		ParseVErrorInternal(debug_file, fname, lineno, type, fmt, ap);
    718  1.127       dsl 		va_end(ap);
    719  1.127       dsl 	}
    720    1.1       cgd }
    721    1.1       cgd 
    722  1.161       sjg 
    723  1.301    rillig /* Parse a .info .warning or .error directive.
    724  1.161       sjg  *
    725  1.301    rillig  * The input is the line minus the ".".  We substitute variables, print the
    726  1.301    rillig  * message and exit(1) (for .error) or just print a warning if the directive
    727  1.301    rillig  * is malformed.
    728  1.161       sjg  */
    729  1.164       sjg static Boolean
    730  1.377    rillig ParseMessage(const char *directive)
    731  1.161       sjg {
    732  1.377    rillig     const char *p = directive;
    733  1.377    rillig     int mtype = *p == 'i' ? PARSE_INFO :
    734  1.377    rillig 		*p == 'w' ? PARSE_WARNING : PARSE_FATAL;
    735  1.377    rillig     char *arg;
    736  1.164       sjg 
    737  1.377    rillig     while (ch_isalpha(*p))
    738  1.377    rillig 	p++;
    739  1.377    rillig     if (!ch_isspace(*p))
    740  1.377    rillig 	return FALSE;		/* missing argument */
    741  1.161       sjg 
    742  1.377    rillig     cpp_skip_whitespace(&p);
    743  1.377    rillig     (void)Var_Subst(p, VAR_CMD, VARE_WANTRES, &arg);
    744  1.377    rillig     /* TODO: handle errors */
    745  1.161       sjg 
    746  1.377    rillig     Parse_Error(mtype, "%s", arg);
    747  1.377    rillig     free(arg);
    748  1.161       sjg 
    749  1.161       sjg     if (mtype == PARSE_FATAL) {
    750  1.339       sjg 	PrintOnError(NULL, NULL);
    751  1.161       sjg 	exit(1);
    752  1.161       sjg     }
    753  1.164       sjg     return TRUE;
    754  1.161       sjg }
    755  1.161       sjg 
    756  1.316    rillig /* Add the child to the parent's children.
    757    1.1       cgd  *
    758  1.382    rillig  * Additionally, add the parent to the child's parents, but only if the
    759  1.382    rillig  * target is not special.  An example for such a special target is .END,
    760  1.382    rillig  * which does not need to be informed once the child target has been made. */
    761  1.382    rillig static void
    762  1.382    rillig LinkSource(GNode *pgn, GNode *cgn, Boolean isSpecial)
    763  1.382    rillig {
    764  1.268    rillig     if ((pgn->type & OP_DOUBLEDEP) && !Lst_IsEmpty(pgn->cohorts))
    765  1.274    rillig 	pgn = LstNode_Datum(Lst_Last(pgn->cohorts));
    766  1.316    rillig 
    767  1.268    rillig     Lst_Append(pgn->children, cgn);
    768  1.343    rillig     pgn->unmade++;
    769  1.316    rillig 
    770  1.382    rillig     /* Special targets like .END don't need any children. */
    771  1.382    rillig     if (!isSpecial)
    772  1.268    rillig 	Lst_Append(cgn->parents, pgn);
    773  1.316    rillig 
    774  1.109       dsl     if (DEBUG(PARSE)) {
    775  1.342    rillig 	debug_printf("# %s: added child %s - %s\n",
    776  1.342    rillig 		     __func__, pgn->name, cgn->name);
    777  1.109       dsl 	Targ_PrintNode(pgn, 0);
    778  1.109       dsl 	Targ_PrintNode(cgn, 0);
    779  1.109       dsl     }
    780    1.1       cgd }
    781    1.1       cgd 
    782  1.382    rillig /* Add the node to each target from the current dependency group. */
    783  1.382    rillig static void
    784  1.382    rillig LinkToTargets(GNode *gn, Boolean isSpecial)
    785  1.382    rillig {
    786  1.382    rillig     GNodeListNode *ln;
    787  1.382    rillig     for (ln = targets->first; ln != NULL; ln = ln->next)
    788  1.382    rillig 	LinkSource(ln->datum, gn, isSpecial);
    789  1.382    rillig }
    790  1.382    rillig 
    791  1.337    rillig static Boolean
    792  1.337    rillig TryApplyDependencyOperator(GNode *gn, GNodeType op)
    793    1.1       cgd {
    794    1.1       cgd     /*
    795    1.1       cgd      * If the dependency mask of the operator and the node don't match and
    796    1.1       cgd      * the node has actually had an operator applied to it before, and
    797   1.27  christos      * the operator actually has some dependency information in it, complain.
    798    1.1       cgd      */
    799    1.1       cgd     if (((op & OP_OPMASK) != (gn->type & OP_OPMASK)) &&
    800    1.1       cgd 	!OP_NOP(gn->type) && !OP_NOP(op))
    801    1.1       cgd     {
    802   1.97  christos 	Parse_Error(PARSE_FATAL, "Inconsistent operator for %s", gn->name);
    803  1.337    rillig 	return FALSE;
    804    1.1       cgd     }
    805    1.1       cgd 
    806  1.242    rillig     if (op == OP_DOUBLEDEP && (gn->type & OP_OPMASK) == OP_DOUBLEDEP) {
    807    1.1       cgd 	/*
    808    1.1       cgd 	 * If the node was the object of a :: operator, we need to create a
    809    1.1       cgd 	 * new instance of it for the children and commands on this dependency
    810    1.1       cgd 	 * line. The new instance is placed on the 'cohorts' list of the
    811    1.1       cgd 	 * initial one (note the initial one is not on its own cohorts list)
    812    1.1       cgd 	 * and the new instance is linked to all parents of the initial
    813    1.1       cgd 	 * instance.
    814    1.1       cgd 	 */
    815  1.374    rillig 	GNode *cohort;
    816   1.27  christos 
    817   1.33   mycroft 	/*
    818   1.46   mycroft 	 * Propagate copied bits to the initial node.  They'll be propagated
    819   1.46   mycroft 	 * back to the rest of the cohorts later.
    820   1.33   mycroft 	 */
    821   1.46   mycroft 	gn->type |= op & ~OP_OPMASK;
    822   1.33   mycroft 
    823  1.332    rillig 	cohort = Targ_NewInternalNode(gn->name);
    824  1.186  christos 	if (doing_depend)
    825  1.186  christos 	    ParseMark(cohort);
    826    1.1       cgd 	/*
    827    1.1       cgd 	 * Make the cohort invisible as well to avoid duplicating it into
    828    1.1       cgd 	 * other variables. True, parents of this target won't tend to do
    829    1.1       cgd 	 * anything with their local variables, but better safe than
    830   1.46   mycroft 	 * sorry. (I think this is pointless now, since the relevant list
    831   1.46   mycroft 	 * traversals will no longer see this node anyway. -mycroft)
    832    1.1       cgd 	 */
    833   1.46   mycroft 	cohort->type = op | OP_INVISIBLE;
    834  1.268    rillig 	Lst_Append(gn->cohorts, cohort);
    835   1.83        pk 	cohort->centurion = gn;
    836  1.343    rillig 	gn->unmade_cohorts++;
    837  1.120       dsl 	snprintf(cohort->cohort_num, sizeof cohort->cohort_num, "#%d",
    838  1.387    rillig 		 (unsigned int)gn->unmade_cohorts % 1000000);
    839   1.46   mycroft     } else {
    840    1.1       cgd 	/*
    841   1.46   mycroft 	 * We don't want to nuke any previous flags (whatever they were) so we
    842   1.46   mycroft 	 * just OR the new operator into the old
    843    1.1       cgd 	 */
    844   1.46   mycroft 	gn->type |= op;
    845    1.1       cgd     }
    846   1.33   mycroft 
    847  1.337    rillig     return TRUE;
    848  1.337    rillig }
    849  1.337    rillig 
    850  1.337    rillig static void
    851  1.337    rillig ApplyDependencyOperator(GNodeType op)
    852  1.337    rillig {
    853  1.337    rillig     GNodeListNode *ln;
    854  1.337    rillig     for (ln = targets->first; ln != NULL; ln = ln->next)
    855  1.373    rillig 	if (!TryApplyDependencyOperator(ln->datum, op))
    856  1.337    rillig 	    break;
    857    1.1       cgd }
    858    1.1       cgd 
    859  1.368    rillig static Boolean
    860  1.368    rillig ParseDoSrcKeyword(const char *src, ParseSpecial specType)
    861    1.1       cgd {
    862  1.120       dsl     static int wait_number = 0;
    863  1.120       dsl     char wait_src[16];
    864  1.368    rillig     GNode *gn;
    865    1.1       cgd 
    866  1.290    rillig     if (*src == '.' && ch_isupper(src[1])) {
    867    1.1       cgd 	int keywd = ParseFindKeyword(src);
    868    1.1       cgd 	if (keywd != -1) {
    869   1.18  christos 	    int op = parseKeywords[keywd].op;
    870   1.18  christos 	    if (op != 0) {
    871  1.337    rillig 		ApplyDependencyOperator(op);
    872  1.368    rillig 		return TRUE;
    873   1.18  christos 	    }
    874   1.18  christos 	    if (parseKeywords[keywd].spec == Wait) {
    875  1.120       dsl 		/*
    876  1.120       dsl 		 * We add a .WAIT node in the dependency list.
    877  1.120       dsl 		 * After any dynamic dependencies (and filename globbing)
    878  1.120       dsl 		 * have happened, it is given a dependency on the each
    879  1.120       dsl 		 * previous child back to and previous .WAIT node.
    880  1.120       dsl 		 * The next child won't be scheduled until the .WAIT node
    881  1.120       dsl 		 * is built.
    882  1.120       dsl 		 * We give each .WAIT node a unique name (mainly for diag).
    883  1.120       dsl 		 */
    884  1.120       dsl 		snprintf(wait_src, sizeof wait_src, ".WAIT_%u", ++wait_number);
    885  1.332    rillig 		gn = Targ_NewInternalNode(wait_src);
    886  1.186  christos 		if (doing_depend)
    887  1.186  christos 		    ParseMark(gn);
    888  1.120       dsl 		gn->type = OP_WAIT | OP_PHONY | OP_DEPENDS | OP_NOTMAIN;
    889  1.382    rillig 		LinkToTargets(gn, specType != Not);
    890  1.368    rillig 		return TRUE;
    891   1.18  christos 	    }
    892    1.1       cgd 	}
    893    1.1       cgd     }
    894  1.368    rillig     return FALSE;
    895  1.368    rillig }
    896   1.18  christos 
    897  1.368    rillig static void
    898  1.368    rillig ParseDoSrcMain(const char *src)
    899  1.368    rillig {
    900  1.368    rillig     /*
    901  1.368    rillig      * If we have noted the existence of a .MAIN, it means we need
    902  1.368    rillig      * to add the sources of said target to the list of things
    903  1.368    rillig      * to create. The string 'src' is likely to be free, so we
    904  1.368    rillig      * must make a new copy of it. Note that this will only be
    905  1.368    rillig      * invoked if the user didn't specify a target on the command
    906  1.368    rillig      * line. This is to allow #ifmake's to succeed, or something...
    907  1.368    rillig      */
    908  1.368    rillig     Lst_Append(create, bmake_strdup(src));
    909  1.368    rillig     /*
    910  1.368    rillig      * Add the name to the .TARGETS variable as well, so the user can
    911  1.368    rillig      * employ that, if desired.
    912  1.368    rillig      */
    913  1.368    rillig     Var_Append(".TARGETS", src, VAR_GLOBAL);
    914  1.368    rillig }
    915   1.18  christos 
    916  1.368    rillig static void
    917  1.368    rillig ParseDoSrcOrder(const char *src)
    918  1.368    rillig {
    919  1.368    rillig     GNode *gn;
    920  1.368    rillig     /*
    921  1.368    rillig      * Create proper predecessor/successor links between the previous
    922  1.368    rillig      * source and the current one.
    923  1.368    rillig      */
    924  1.368    rillig     gn = Targ_GetNode(src);
    925  1.368    rillig     if (doing_depend)
    926  1.368    rillig 	ParseMark(gn);
    927  1.368    rillig     if (predecessor != NULL) {
    928  1.368    rillig 	Lst_Append(predecessor->order_succ, gn);
    929  1.368    rillig 	Lst_Append(gn->order_pred, predecessor);
    930  1.368    rillig 	if (DEBUG(PARSE)) {
    931  1.368    rillig 	    debug_printf("# %s: added Order dependency %s - %s\n",
    932  1.368    rillig 			 __func__, predecessor->name, gn->name);
    933  1.368    rillig 	    Targ_PrintNode(predecessor, 0);
    934  1.368    rillig 	    Targ_PrintNode(gn, 0);
    935    1.1       cgd 	}
    936  1.368    rillig     }
    937  1.368    rillig     /*
    938  1.368    rillig      * The current source now becomes the predecessor for the next one.
    939  1.368    rillig      */
    940  1.368    rillig     predecessor = gn;
    941  1.368    rillig }
    942  1.368    rillig 
    943  1.368    rillig static void
    944  1.368    rillig ParseDoSrcOther(const char *src, GNodeType tOp, ParseSpecial specType)
    945  1.368    rillig {
    946  1.368    rillig     GNode *gn;
    947  1.363    rillig 
    948  1.368    rillig     /*
    949  1.368    rillig      * If the source is not an attribute, we need to find/create
    950  1.368    rillig      * a node for it. After that we can apply any operator to it
    951  1.368    rillig      * from a special target or link it to its parents, as
    952  1.368    rillig      * appropriate.
    953  1.368    rillig      *
    954  1.368    rillig      * In the case of a source that was the object of a :: operator,
    955  1.368    rillig      * the attribute is applied to all of its instances (as kept in
    956  1.368    rillig      * the 'cohorts' list of the node) or all the cohorts are linked
    957  1.368    rillig      * to all the targets.
    958  1.368    rillig      */
    959   1.18  christos 
    960  1.368    rillig     /* Find/create the 'src' node and attach to all targets */
    961  1.368    rillig     gn = Targ_GetNode(src);
    962  1.368    rillig     if (doing_depend)
    963  1.368    rillig 	ParseMark(gn);
    964  1.368    rillig     if (tOp) {
    965  1.368    rillig 	gn->type |= tOp;
    966  1.368    rillig     } else {
    967  1.382    rillig 	LinkToTargets(gn, specType != Not);
    968   1.18  christos     }
    969    1.1       cgd }
    970    1.1       cgd 
    971  1.368    rillig /* Given the name of a source in a dependency line, figure out if it is an
    972  1.368    rillig  * attribute (such as .SILENT) and apply it to the targets if it is. Else
    973  1.368    rillig  * decide if there is some attribute which should be applied *to* the source
    974  1.368    rillig  * because of some special target (such as .PHONY) and apply it if so.
    975  1.368    rillig  * Otherwise, make the source a child of the targets in the list 'targets'.
    976  1.368    rillig  *
    977  1.368    rillig  * Input:
    978  1.368    rillig  *	tOp		operator (if any) from special targets
    979  1.368    rillig  *	src		name of the source to handle
    980  1.368    rillig  */
    981  1.368    rillig static void
    982  1.368    rillig ParseDoSrc(GNodeType tOp, const char *src, ParseSpecial specType)
    983  1.368    rillig {
    984  1.368    rillig     if (ParseDoSrcKeyword(src, specType))
    985  1.373    rillig 	return;
    986  1.368    rillig 
    987  1.368    rillig     if (specType == Main)
    988  1.373    rillig 	ParseDoSrcMain(src);
    989  1.368    rillig     else if (specType == Order)
    990  1.373    rillig 	ParseDoSrcOrder(src);
    991  1.368    rillig     else
    992  1.373    rillig 	ParseDoSrcOther(src, tOp, specType);
    993  1.368    rillig }
    994  1.368    rillig 
    995  1.335    rillig /* If we have yet to decide on a main target to make, in the absence of any
    996  1.335    rillig  * user input, we want the first target on the first dependency line that is
    997  1.335    rillig  * actually a real target (i.e. isn't a .USE or .EXEC rule) to be made. */
    998  1.335    rillig static void
    999  1.335    rillig FindMainTarget(void)
   1000    1.1       cgd {
   1001  1.335    rillig     GNodeListNode *ln;
   1002  1.335    rillig 
   1003  1.335    rillig     if (mainNode != NULL)
   1004  1.373    rillig 	return;
   1005  1.335    rillig 
   1006  1.335    rillig     for (ln = targets->first; ln != NULL; ln = ln->next) {
   1007  1.335    rillig 	GNode *gn = ln->datum;
   1008  1.335    rillig 	if (!(gn->type & OP_NOTARGET)) {
   1009  1.335    rillig 	    mainNode = gn;
   1010  1.335    rillig 	    Targ_SetMain(gn);
   1011  1.335    rillig 	    return;
   1012  1.335    rillig 	}
   1013    1.1       cgd     }
   1014    1.1       cgd }
   1015    1.1       cgd 
   1016  1.331    rillig static void
   1017  1.157       dsl ParseAddDir(void *path, void *name)
   1018    1.1       cgd {
   1019  1.322    rillig     (void)Dir_AddDir(path, name);
   1020    1.1       cgd }
   1021    1.1       cgd 
   1022  1.311    rillig /*
   1023  1.311    rillig  * We got to the end of the line while we were still looking at targets.
   1024  1.311    rillig  *
   1025  1.311    rillig  * Ending a dependency line without an operator is a Bozo no-no.  As a
   1026  1.311    rillig  * heuristic, this is also often triggered by undetected conflicts from
   1027  1.311    rillig  * cvs/rcs merges.
   1028  1.311    rillig  */
   1029  1.311    rillig static void
   1030  1.311    rillig ParseErrorNoDependency(const char *lstart, const char *line)
   1031  1.311    rillig {
   1032  1.311    rillig     if ((strncmp(line, "<<<<<<", 6) == 0) ||
   1033  1.311    rillig 	(strncmp(line, "======", 6) == 0) ||
   1034  1.311    rillig 	(strncmp(line, ">>>>>>", 6) == 0))
   1035  1.311    rillig 	Parse_Error(PARSE_FATAL,
   1036  1.311    rillig 		    "Makefile appears to contain unresolved cvs/rcs/??? merge conflicts");
   1037  1.311    rillig     else if (lstart[0] == '.') {
   1038  1.311    rillig 	const char *dirstart = lstart + 1;
   1039  1.311    rillig 	const char *dirend;
   1040  1.368    rillig 	cpp_skip_whitespace(&dirstart);
   1041  1.311    rillig 	dirend = dirstart;
   1042  1.311    rillig 	while (ch_isalnum(*dirend) || *dirend == '-')
   1043  1.311    rillig 	    dirend++;
   1044  1.311    rillig 	Parse_Error(PARSE_FATAL, "Unknown directive \"%.*s\"",
   1045  1.311    rillig 		    (int)(dirend - dirstart), dirstart);
   1046  1.311    rillig     } else
   1047  1.311    rillig 	Parse_Error(PARSE_FATAL, "Need an operator");
   1048  1.311    rillig }
   1049  1.311    rillig 
   1050  1.314    rillig static void
   1051  1.314    rillig ParseDependencyTargetWord(/*const*/ char **pp, const char *lstart)
   1052  1.314    rillig {
   1053  1.314    rillig     /*const*/ char *cp = *pp;
   1054  1.314    rillig 
   1055  1.314    rillig     while (*cp != '\0') {
   1056  1.314    rillig 	if ((ch_isspace(*cp) || *cp == '!' || *cp == ':' || *cp == '(') &&
   1057  1.314    rillig 	    !ParseIsEscaped(lstart, cp))
   1058  1.314    rillig 	    break;
   1059  1.314    rillig 
   1060  1.314    rillig 	if (*cp == '$') {
   1061  1.314    rillig 	    /*
   1062  1.314    rillig 	     * Must be a dynamic source (would have been expanded
   1063  1.314    rillig 	     * otherwise), so call the Var module to parse the puppy
   1064  1.314    rillig 	     * so we can safely advance beyond it...There should be
   1065  1.314    rillig 	     * no errors in this, as they would have been discovered
   1066  1.314    rillig 	     * in the initial Var_Subst and we wouldn't be here.
   1067  1.314    rillig 	     */
   1068  1.314    rillig 	    const char *nested_p = cp;
   1069  1.314    rillig 	    const char *nested_val;
   1070  1.374    rillig 	    void *freeIt;
   1071  1.314    rillig 
   1072  1.314    rillig 	    (void)Var_Parse(&nested_p, VAR_CMD, VARE_UNDEFERR|VARE_WANTRES,
   1073  1.314    rillig 			    &nested_val, &freeIt);
   1074  1.314    rillig 	    /* TODO: handle errors */
   1075  1.314    rillig 	    free(freeIt);
   1076  1.314    rillig 	    cp += nested_p - cp;
   1077  1.314    rillig 	} else
   1078  1.314    rillig 	    cp++;
   1079  1.314    rillig     }
   1080  1.314    rillig 
   1081  1.314    rillig     *pp = cp;
   1082  1.314    rillig }
   1083  1.314    rillig 
   1084  1.368    rillig /*
   1085  1.368    rillig  * Certain special targets have special semantics:
   1086  1.368    rillig  *	.PATH		Have to set the dirSearchPath
   1087  1.368    rillig  *			variable too
   1088  1.368    rillig  *	.MAIN		Its sources are only used if
   1089  1.368    rillig  *			nothing has been specified to
   1090  1.368    rillig  *			create.
   1091  1.368    rillig  *	.DEFAULT	Need to create a node to hang
   1092  1.368    rillig  *			commands on, but we don't want
   1093  1.368    rillig  *			it in the graph, nor do we want
   1094  1.368    rillig  *			it to be the Main Target, so we
   1095  1.368    rillig  *			create it, set OP_NOTMAIN and
   1096  1.368    rillig  *			add it to the list, setting
   1097  1.368    rillig  *			DEFAULT to the new node for
   1098  1.368    rillig  *			later use. We claim the node is
   1099  1.368    rillig  *			A transformation rule to make
   1100  1.368    rillig  *			life easier later, when we'll
   1101  1.368    rillig  *			use Make_HandleUse to actually
   1102  1.368    rillig  *			apply the .DEFAULT commands.
   1103  1.368    rillig  *	.PHONY		The list of targets
   1104  1.368    rillig  *	.NOPATH		Don't search for file in the path
   1105  1.368    rillig  *	.STALE
   1106  1.368    rillig  *	.BEGIN
   1107  1.368    rillig  *	.END
   1108  1.368    rillig  *	.ERROR
   1109  1.368    rillig  *	.DELETE_ON_ERROR
   1110  1.368    rillig  *	.INTERRUPT	Are not to be considered the
   1111  1.368    rillig  *			main target.
   1112  1.368    rillig  *	.NOTPARALLEL	Make only one target at a time.
   1113  1.368    rillig  *	.SINGLESHELL	Create a shell for each command.
   1114  1.368    rillig  *	.ORDER		Must set initial predecessor to NULL
   1115  1.368    rillig  */
   1116  1.368    rillig static void
   1117  1.368    rillig ParseDoDependencyTargetSpecial(ParseSpecial *const inout_specType,
   1118  1.368    rillig 			       const char *const line,
   1119  1.368    rillig 			       SearchPathList **const inout_paths)
   1120  1.368    rillig {
   1121  1.368    rillig     switch (*inout_specType) {
   1122  1.368    rillig     case ExPath:
   1123  1.368    rillig 	if (*inout_paths == NULL) {
   1124  1.385    rillig 	    *inout_paths = Lst_New();
   1125  1.368    rillig 	}
   1126  1.368    rillig 	Lst_Append(*inout_paths, dirSearchPath);
   1127  1.368    rillig 	break;
   1128  1.368    rillig     case Main:
   1129  1.368    rillig 	if (!Lst_IsEmpty(create)) {
   1130  1.368    rillig 	    *inout_specType = Not;
   1131  1.368    rillig 	}
   1132  1.368    rillig 	break;
   1133  1.368    rillig     case Begin:
   1134  1.368    rillig     case End:
   1135  1.368    rillig     case Stale:
   1136  1.368    rillig     case dotError:
   1137  1.368    rillig     case Interrupt: {
   1138  1.368    rillig 	GNode *gn = Targ_GetNode(line);
   1139  1.368    rillig 	if (doing_depend)
   1140  1.368    rillig 	    ParseMark(gn);
   1141  1.368    rillig 	gn->type |= OP_NOTMAIN|OP_SPECIAL;
   1142  1.368    rillig 	Lst_Append(targets, gn);
   1143  1.368    rillig 	break;
   1144  1.368    rillig     }
   1145  1.368    rillig     case Default: {
   1146  1.368    rillig 	GNode *gn = Targ_NewGN(".DEFAULT");
   1147  1.368    rillig 	gn->type |= OP_NOTMAIN|OP_TRANSFORM;
   1148  1.368    rillig 	Lst_Append(targets, gn);
   1149  1.368    rillig 	DEFAULT = gn;
   1150  1.368    rillig 	break;
   1151  1.368    rillig     }
   1152  1.368    rillig     case DeleteOnError:
   1153  1.368    rillig 	deleteOnError = TRUE;
   1154  1.368    rillig 	break;
   1155  1.368    rillig     case NotParallel:
   1156  1.368    rillig 	maxJobs = 1;
   1157  1.368    rillig 	break;
   1158  1.368    rillig     case SingleShell:
   1159  1.368    rillig 	compatMake = TRUE;
   1160  1.368    rillig 	break;
   1161  1.368    rillig     case Order:
   1162  1.368    rillig 	predecessor = NULL;
   1163  1.368    rillig 	break;
   1164  1.368    rillig     default:
   1165  1.368    rillig 	break;
   1166  1.368    rillig     }
   1167  1.368    rillig }
   1168  1.368    rillig 
   1169  1.368    rillig /*
   1170  1.368    rillig  * .PATH<suffix> has to be handled specially.
   1171  1.368    rillig  * Call on the suffix module to give us a path to modify.
   1172  1.368    rillig  */
   1173  1.368    rillig static Boolean
   1174  1.368    rillig ParseDoDependencyTargetPath(const char *const line,
   1175  1.368    rillig 			    SearchPathList **const inout_paths)
   1176  1.368    rillig {
   1177  1.368    rillig     SearchPath *path;
   1178  1.368    rillig 
   1179  1.368    rillig     path = Suff_GetPath(&line[5]);
   1180  1.368    rillig     if (path == NULL) {
   1181  1.368    rillig 	Parse_Error(PARSE_FATAL,
   1182  1.368    rillig 		    "Suffix '%s' not defined (yet)",
   1183  1.368    rillig 		    &line[5]);
   1184  1.368    rillig 	return FALSE;
   1185  1.368    rillig     } else {
   1186  1.368    rillig 	if (*inout_paths == NULL) {
   1187  1.385    rillig 	    *inout_paths = Lst_New();
   1188  1.368    rillig 	}
   1189  1.368    rillig 	Lst_Append(*inout_paths, path);
   1190  1.368    rillig     }
   1191  1.368    rillig     return TRUE;
   1192  1.368    rillig }
   1193  1.368    rillig 
   1194  1.368    rillig /*
   1195  1.368    rillig  * See if it's a special target and if so set specType to match it.
   1196  1.364    rillig  */
   1197  1.368    rillig static Boolean
   1198  1.368    rillig ParseDoDependencyTarget(const char *const line,
   1199  1.368    rillig 			ParseSpecial *const inout_specType,
   1200  1.368    rillig 			GNodeType *out_tOp,
   1201  1.368    rillig 			SearchPathList **inout_paths)
   1202  1.364    rillig {
   1203  1.368    rillig     int keywd;
   1204  1.364    rillig 
   1205  1.368    rillig     if (!(*line == '.' && ch_isupper(line[1])))
   1206  1.368    rillig 	return TRUE;
   1207  1.364    rillig 
   1208  1.364    rillig     /*
   1209  1.368    rillig      * See if the target is a special target that must have it
   1210  1.368    rillig      * or its sources handled specially.
   1211  1.364    rillig      */
   1212  1.368    rillig     keywd = ParseFindKeyword(line);
   1213  1.368    rillig     if (keywd != -1) {
   1214  1.368    rillig 	if (*inout_specType == ExPath && parseKeywords[keywd].spec != ExPath) {
   1215  1.368    rillig 	    Parse_Error(PARSE_FATAL, "Mismatched special targets");
   1216  1.368    rillig 	    return FALSE;
   1217  1.368    rillig 	}
   1218  1.368    rillig 
   1219  1.368    rillig 	*inout_specType = parseKeywords[keywd].spec;
   1220  1.368    rillig 	*out_tOp = parseKeywords[keywd].op;
   1221  1.368    rillig 
   1222  1.368    rillig 	ParseDoDependencyTargetSpecial(inout_specType, line, inout_paths);
   1223  1.368    rillig 
   1224  1.368    rillig     } else if (strncmp(line, ".PATH", 5) == 0) {
   1225  1.368    rillig 	*inout_specType = ExPath;
   1226  1.368    rillig 	if (!ParseDoDependencyTargetPath(line, inout_paths))
   1227  1.368    rillig 	    return FALSE;
   1228  1.368    rillig     }
   1229  1.368    rillig     return TRUE;
   1230  1.368    rillig }
   1231  1.368    rillig 
   1232  1.368    rillig static void
   1233  1.368    rillig ParseDoDependencyTargetMundane(char *const line,
   1234  1.368    rillig 			       StringList *const curTargs)
   1235  1.368    rillig {
   1236  1.368    rillig     if (Dir_HasWildcards(line)) {
   1237  1.368    rillig 	/*
   1238  1.368    rillig 	 * Targets are to be sought only in the current directory,
   1239  1.368    rillig 	 * so create an empty path for the thing. Note we need to
   1240  1.368    rillig 	 * use Dir_Destroy in the destruction of the path as the
   1241  1.368    rillig 	 * Dir module could have added a directory to the path...
   1242  1.368    rillig 	 */
   1243  1.385    rillig 	SearchPath *emptyPath = Lst_New();
   1244  1.368    rillig 
   1245  1.368    rillig 	Dir_Expand(line, emptyPath, curTargs);
   1246  1.368    rillig 
   1247  1.368    rillig 	Lst_Destroy(emptyPath, Dir_Destroy);
   1248  1.368    rillig     } else {
   1249  1.368    rillig 	/*
   1250  1.368    rillig 	 * No wildcards, but we want to avoid code duplication,
   1251  1.368    rillig 	 * so create a list with the word on it.
   1252  1.368    rillig 	 */
   1253  1.368    rillig 	Lst_Append(curTargs, line);
   1254  1.368    rillig     }
   1255  1.368    rillig 
   1256  1.368    rillig     /* Apply the targets. */
   1257  1.368    rillig 
   1258  1.374    rillig     while (!Lst_IsEmpty(curTargs)) {
   1259  1.368    rillig 	char *targName = Lst_Dequeue(curTargs);
   1260  1.368    rillig 	GNode *gn = Suff_IsTransform(targName)
   1261  1.368    rillig 		    ? Suff_AddTransform(targName)
   1262  1.368    rillig 		    : Targ_GetNode(targName);
   1263  1.368    rillig 	if (doing_depend)
   1264  1.368    rillig 	    ParseMark(gn);
   1265  1.368    rillig 
   1266  1.368    rillig 	Lst_Append(targets, gn);
   1267  1.368    rillig     }
   1268  1.368    rillig }
   1269  1.368    rillig 
   1270  1.368    rillig static void
   1271  1.368    rillig ParseDoDependencyTargetExtraWarn(char **pp, const char *lstart)
   1272  1.368    rillig {
   1273  1.368    rillig     Boolean warning = FALSE;
   1274  1.368    rillig     char *cp = *pp;
   1275  1.368    rillig 
   1276  1.368    rillig     while (*cp && (ParseIsEscaped(lstart, cp) ||
   1277  1.368    rillig 		   (*cp != '!' && *cp != ':'))) {
   1278  1.368    rillig 	if (ParseIsEscaped(lstart, cp) ||
   1279  1.368    rillig 	    (*cp != ' ' && *cp != '\t')) {
   1280  1.368    rillig 	    warning = TRUE;
   1281  1.368    rillig 	}
   1282  1.368    rillig 	cp++;
   1283  1.368    rillig     }
   1284  1.368    rillig     if (warning) {
   1285  1.368    rillig 	Parse_Error(PARSE_WARNING, "Extra target ignored");
   1286  1.368    rillig     }
   1287  1.368    rillig     *pp = cp;
   1288  1.368    rillig }
   1289  1.368    rillig 
   1290  1.368    rillig static void
   1291  1.368    rillig ParseDoDependencyCheckSpec(ParseSpecial const specType)
   1292  1.368    rillig {
   1293  1.374    rillig     switch (specType) {
   1294  1.368    rillig     default:
   1295  1.368    rillig 	Parse_Error(PARSE_WARNING,
   1296  1.368    rillig 		    "Special and mundane targets don't mix. Mundane ones ignored");
   1297  1.368    rillig 	break;
   1298  1.368    rillig     case Default:
   1299  1.368    rillig     case Stale:
   1300  1.368    rillig     case Begin:
   1301  1.368    rillig     case End:
   1302  1.368    rillig     case dotError:
   1303  1.368    rillig     case Interrupt:
   1304  1.368    rillig 	/*
   1305  1.368    rillig 	 * These four create nodes on which to hang commands, so
   1306  1.368    rillig 	 * targets shouldn't be empty...
   1307  1.368    rillig 	 */
   1308  1.368    rillig     case Not:
   1309  1.368    rillig 	/*
   1310  1.368    rillig 	 * Nothing special here -- targets can be empty if it wants.
   1311  1.368    rillig 	 */
   1312  1.368    rillig 	break;
   1313  1.368    rillig     }
   1314  1.368    rillig }
   1315  1.368    rillig 
   1316  1.368    rillig static Boolean
   1317  1.368    rillig ParseDoDependencyParseOp(char **const pp, const char *const lstart,
   1318  1.368    rillig 			 GNodeType *const out_op)
   1319  1.368    rillig {
   1320  1.368    rillig     const char *cp = *pp;
   1321  1.368    rillig 
   1322  1.368    rillig     if (*cp == '!') {
   1323  1.368    rillig 	*out_op = OP_FORCE;
   1324  1.368    rillig 	(*pp)++;
   1325  1.368    rillig 	return TRUE;
   1326  1.368    rillig     }
   1327  1.368    rillig 
   1328  1.368    rillig     if (*cp == ':') {
   1329  1.368    rillig 	if (cp[1] == ':') {
   1330  1.368    rillig 	    *out_op = OP_DOUBLEDEP;
   1331  1.368    rillig 	    (*pp) += 2;
   1332  1.368    rillig 	} else {
   1333  1.368    rillig 	    *out_op = OP_DEPENDS;
   1334  1.368    rillig 	    (*pp)++;
   1335  1.368    rillig 	}
   1336  1.368    rillig 	return TRUE;
   1337  1.368    rillig     }
   1338  1.364    rillig 
   1339  1.368    rillig     {
   1340  1.368    rillig 	const char *msg = lstart[0] == '.' ? "Unknown directive"
   1341  1.368    rillig 					   : "Missing dependency operator";
   1342  1.368    rillig 	Parse_Error(PARSE_FATAL, "%s", msg);
   1343  1.368    rillig 	return FALSE;
   1344  1.368    rillig     }
   1345  1.368    rillig }
   1346  1.364    rillig 
   1347  1.368    rillig static void
   1348  1.392    rillig ClearPaths(SearchPathList *paths)
   1349  1.392    rillig {
   1350  1.392    rillig     if (paths != NULL) {
   1351  1.392    rillig 	SearchPathListNode *ln;
   1352  1.392    rillig 	for (ln = paths->first; ln != NULL; ln = ln->next)
   1353  1.392    rillig 	    Dir_ClearPath(ln->datum);
   1354  1.392    rillig     }
   1355  1.392    rillig 
   1356  1.392    rillig     Dir_SetPATH();
   1357  1.392    rillig }
   1358  1.392    rillig 
   1359  1.392    rillig static void
   1360  1.368    rillig ParseDoDependencySourcesEmpty(ParseSpecial const specType,
   1361  1.368    rillig 			      SearchPathList *const paths)
   1362  1.368    rillig {
   1363  1.368    rillig     switch (specType) {
   1364  1.368    rillig     case Suffixes:
   1365  1.368    rillig 	Suff_ClearSuffixes();
   1366  1.368    rillig 	break;
   1367  1.368    rillig     case Precious:
   1368  1.368    rillig 	allPrecious = TRUE;
   1369  1.368    rillig 	break;
   1370  1.368    rillig     case Ignore:
   1371  1.368    rillig 	ignoreErrors = TRUE;
   1372  1.368    rillig 	break;
   1373  1.368    rillig     case Silent:
   1374  1.368    rillig 	beSilent = TRUE;
   1375  1.368    rillig 	break;
   1376  1.368    rillig     case ExPath:
   1377  1.392    rillig 	ClearPaths(paths);
   1378  1.368    rillig 	break;
   1379  1.368    rillig #ifdef POSIX
   1380  1.368    rillig     case Posix:
   1381  1.368    rillig 	Var_Set("%POSIX", "1003.2", VAR_GLOBAL);
   1382  1.368    rillig 	break;
   1383  1.368    rillig #endif
   1384  1.368    rillig     default:
   1385  1.368    rillig 	break;
   1386  1.368    rillig     }
   1387  1.368    rillig }
   1388  1.364    rillig 
   1389  1.368    rillig /*
   1390  1.368    rillig  * If the target was one that doesn't take files as its sources
   1391  1.368    rillig  * but takes something like suffixes, we take each
   1392  1.368    rillig  * space-separated word on the line as a something and deal
   1393  1.368    rillig  * with it accordingly.
   1394  1.368    rillig  *
   1395  1.368    rillig  * If the target was .SUFFIXES, we take each source as a
   1396  1.368    rillig  * suffix and add it to the list of suffixes maintained by the
   1397  1.368    rillig  * Suff module.
   1398  1.368    rillig  *
   1399  1.368    rillig  * If the target was a .PATH, we add the source as a directory
   1400  1.368    rillig  * to search on the search path.
   1401  1.368    rillig  *
   1402  1.368    rillig  * If it was .INCLUDES, the source is taken to be the suffix of
   1403  1.368    rillig  * files which will be #included and whose search path should
   1404  1.368    rillig  * be present in the .INCLUDES variable.
   1405  1.368    rillig  *
   1406  1.368    rillig  * If it was .LIBS, the source is taken to be the suffix of
   1407  1.368    rillig  * files which are considered libraries and whose search path
   1408  1.368    rillig  * should be present in the .LIBS variable.
   1409  1.368    rillig  *
   1410  1.368    rillig  * If it was .NULL, the source is the suffix to use when a file
   1411  1.368    rillig  * has no valid suffix.
   1412  1.368    rillig  *
   1413  1.368    rillig  * If it was .OBJDIR, the source is a new definition for .OBJDIR,
   1414  1.368    rillig  * and will cause make to do a new chdir to that path.
   1415  1.368    rillig  */
   1416  1.368    rillig static void
   1417  1.368    rillig ParseDoDependencySourceSpecial(ParseSpecial const specType, char *const line,
   1418  1.368    rillig 			       SearchPathList *const paths)
   1419  1.368    rillig {
   1420  1.368    rillig     switch (specType) {
   1421  1.368    rillig     case Suffixes:
   1422  1.368    rillig 	Suff_AddSuffix(line, &mainNode);
   1423  1.368    rillig 	break;
   1424  1.368    rillig     case ExPath:
   1425  1.368    rillig 	if (paths != NULL)
   1426  1.368    rillig 	    Lst_ForEach(paths, ParseAddDir, line);
   1427  1.368    rillig 	break;
   1428  1.368    rillig     case Includes:
   1429  1.368    rillig 	Suff_AddInclude(line);
   1430  1.368    rillig 	break;
   1431  1.368    rillig     case Libs:
   1432  1.368    rillig 	Suff_AddLib(line);
   1433  1.368    rillig 	break;
   1434  1.368    rillig     case Null:
   1435  1.368    rillig 	Suff_SetNull(line);
   1436  1.368    rillig 	break;
   1437  1.368    rillig     case ExObjdir:
   1438  1.368    rillig 	Main_SetObjdir("%s", line);
   1439  1.368    rillig 	break;
   1440  1.368    rillig     default:
   1441  1.368    rillig 	break;
   1442  1.368    rillig     }
   1443  1.368    rillig }
   1444  1.364    rillig 
   1445  1.368    rillig static Boolean
   1446  1.368    rillig ParseDoDependencyTargets(char **const inout_cp,
   1447  1.368    rillig 			 char **const inout_line,
   1448  1.368    rillig 			 const char *const lstart,
   1449  1.368    rillig 			 ParseSpecial *const inout_specType,
   1450  1.368    rillig 			 GNodeType *const inout_tOp,
   1451  1.368    rillig 			 SearchPathList **const inout_paths,
   1452  1.368    rillig 			 StringList *const curTargs)
   1453  1.368    rillig {
   1454  1.368    rillig     char *cp = *inout_cp;
   1455  1.368    rillig     char *line = *inout_line;
   1456  1.368    rillig     char savec;
   1457  1.204  dholland 
   1458  1.336    rillig     for (;;) {
   1459  1.204  dholland 	/*
   1460  1.204  dholland 	 * Here LINE points to the beginning of the next word, and
   1461  1.204  dholland 	 * LSTART points to the actual beginning of the line.
   1462  1.204  dholland 	 */
   1463  1.204  dholland 
   1464  1.204  dholland 	/* Find the end of the next word. */
   1465  1.314    rillig 	cp = line;
   1466  1.314    rillig 	ParseDependencyTargetWord(&cp, lstart);
   1467  1.121       dsl 
   1468  1.204  dholland 	/*
   1469  1.204  dholland 	 * If the word is followed by a left parenthesis, it's the
   1470  1.204  dholland 	 * name of an object file inside an archive (ar file).
   1471  1.204  dholland 	 */
   1472  1.310    rillig 	if (!ParseIsEscaped(lstart, cp) && *cp == '(') {
   1473    1.1       cgd 	    /*
   1474  1.203     joerg 	     * Archives must be handled specially to make sure the OP_ARCHV
   1475  1.203     joerg 	     * flag is set in their 'type' field, for one thing, and because
   1476  1.203     joerg 	     * things like "archive(file1.o file2.o file3.o)" are permissible.
   1477  1.203     joerg 	     * Arch_ParseArchive will set 'line' to be the first non-blank
   1478  1.203     joerg 	     * after the archive-spec. It creates/finds nodes for the members
   1479  1.272    rillig 	     * and places them on the given list, returning TRUE if all
   1480  1.272    rillig 	     * went well and FALSE if there was an error in the
   1481  1.203     joerg 	     * specification. On error, line should remain untouched.
   1482    1.1       cgd 	     */
   1483  1.264    rillig 	    if (!Arch_ParseArchive(&line, targets, VAR_CMD)) {
   1484   1.97  christos 		Parse_Error(PARSE_FATAL,
   1485  1.368    rillig 			    "Error in archive specification: \"%s\"", line);
   1486  1.368    rillig 		return FALSE;
   1487  1.203     joerg 	    } else {
   1488  1.204  dholland 		/* Done with this word; on to the next. */
   1489  1.213  matthias 		cp = line;
   1490    1.1       cgd 		continue;
   1491  1.203     joerg 	    }
   1492    1.1       cgd 	}
   1493   1.27  christos 
   1494    1.1       cgd 	if (!*cp) {
   1495  1.311    rillig 	    ParseErrorNoDependency(lstart, line);
   1496  1.368    rillig 	    return FALSE;
   1497    1.1       cgd 	}
   1498  1.204  dholland 
   1499  1.204  dholland 	/* Insert a null terminator. */
   1500  1.204  dholland 	savec = *cp;
   1501    1.1       cgd 	*cp = '\0';
   1502  1.118       dsl 
   1503  1.368    rillig 	if (!ParseDoDependencyTarget(line, inout_specType, inout_tOp,
   1504  1.368    rillig 				     inout_paths))
   1505  1.368    rillig 	    return FALSE;
   1506  1.368    rillig 
   1507    1.1       cgd 	/*
   1508  1.368    rillig 	 * Have word in line. Get or create its node and stick it at
   1509  1.368    rillig 	 * the end of the targets list
   1510    1.1       cgd 	 */
   1511  1.368    rillig 	if (*inout_specType == Not && *line != '\0') {
   1512  1.368    rillig 	    ParseDoDependencyTargetMundane(line, curTargs);
   1513  1.368    rillig 	} else if (*inout_specType == ExPath && *line != '.' && *line != '\0') {
   1514  1.368    rillig 	    Parse_Error(PARSE_WARNING, "Extra target (%s) ignored", line);
   1515  1.368    rillig 	}
   1516  1.368    rillig 
   1517  1.368    rillig 	/* Don't need the inserted null terminator any more. */
   1518  1.368    rillig 	*cp = savec;
   1519  1.368    rillig 
   1520  1.368    rillig 	/*
   1521  1.368    rillig 	 * If it is a special type and not .PATH, it's the only target we
   1522  1.368    rillig 	 * allow on this line...
   1523  1.368    rillig 	 */
   1524  1.368    rillig 	if (*inout_specType != Not && *inout_specType != ExPath) {
   1525  1.368    rillig 	    ParseDoDependencyTargetExtraWarn(&cp, lstart);
   1526  1.368    rillig 	} else {
   1527  1.368    rillig 	    pp_skip_whitespace(&cp);
   1528  1.368    rillig 	}
   1529  1.368    rillig 	line = cp;
   1530  1.368    rillig 	if (*line == '\0')
   1531  1.368    rillig 	    break;
   1532  1.368    rillig 	if ((*line == '!' || *line == ':') && !ParseIsEscaped(lstart, line))
   1533  1.368    rillig 	    break;
   1534  1.368    rillig     }
   1535  1.368    rillig 
   1536  1.368    rillig     *inout_cp = cp;
   1537  1.368    rillig     *inout_line = line;
   1538  1.368    rillig     return TRUE;
   1539  1.368    rillig }
   1540   1.27  christos 
   1541  1.368    rillig static void
   1542  1.368    rillig ParseDoDependencySourcesSpecial(char *line, char *cp,
   1543  1.368    rillig 				ParseSpecial specType, SearchPathList *paths)
   1544  1.368    rillig {
   1545  1.368    rillig     char savec;
   1546  1.204  dholland 
   1547  1.368    rillig     while (*line) {
   1548  1.368    rillig 	while (*cp && !ch_isspace(*cp)) {
   1549  1.368    rillig 	    cp++;
   1550  1.368    rillig 	}
   1551  1.368    rillig 	savec = *cp;
   1552  1.368    rillig 	*cp = '\0';
   1553  1.368    rillig 	ParseDoDependencySourceSpecial(specType, line, paths);
   1554  1.368    rillig 	*cp = savec;
   1555  1.368    rillig 	if (savec != '\0') {
   1556  1.368    rillig 	    cp++;
   1557  1.368    rillig 	}
   1558  1.368    rillig 	pp_skip_whitespace(&cp);
   1559  1.368    rillig 	line = cp;
   1560  1.368    rillig     }
   1561  1.368    rillig }
   1562  1.368    rillig 
   1563  1.368    rillig static Boolean
   1564  1.368    rillig ParseDoDependencySourcesMundane(char *line, char *cp,
   1565  1.374    rillig 				ParseSpecial specType, GNodeType tOp)
   1566  1.368    rillig {
   1567  1.368    rillig     while (*line) {
   1568  1.368    rillig 	/*
   1569  1.368    rillig 	 * The targets take real sources, so we must beware of archive
   1570  1.368    rillig 	 * specifications (i.e. things with left parentheses in them)
   1571  1.368    rillig 	 * and handle them accordingly.
   1572  1.368    rillig 	 */
   1573  1.368    rillig 	for (; *cp && !ch_isspace(*cp); cp++) {
   1574  1.368    rillig 	    if (*cp == '(' && cp > line && cp[-1] != '$') {
   1575  1.367    rillig 		/*
   1576  1.368    rillig 		 * Only stop for a left parenthesis if it isn't at the
   1577  1.368    rillig 		 * start of a word (that'll be for variable changes
   1578  1.368    rillig 		 * later) and isn't preceded by a dollar sign (a dynamic
   1579  1.368    rillig 		 * source).
   1580  1.367    rillig 		 */
   1581  1.368    rillig 		break;
   1582  1.368    rillig 	    }
   1583  1.368    rillig 	}
   1584  1.368    rillig 
   1585  1.368    rillig 	if (*cp == '(') {
   1586  1.385    rillig 	    GNodeList *sources = Lst_New();
   1587  1.368    rillig 	    if (!Arch_ParseArchive(&line, sources, VAR_CMD)) {
   1588  1.368    rillig 		Parse_Error(PARSE_FATAL,
   1589  1.368    rillig 			    "Error in source archive spec \"%s\"", line);
   1590  1.368    rillig 		return FALSE;
   1591  1.368    rillig 	    }
   1592  1.368    rillig 
   1593  1.368    rillig 	    while (!Lst_IsEmpty(sources)) {
   1594  1.368    rillig 		GNode *gn = Lst_Dequeue(sources);
   1595  1.368    rillig 		ParseDoSrc(tOp, gn->name, specType);
   1596  1.368    rillig 	    }
   1597  1.368    rillig 	    Lst_Free(sources);
   1598  1.368    rillig 	    cp = line;
   1599  1.368    rillig 	} else {
   1600  1.368    rillig 	    if (*cp) {
   1601  1.368    rillig 		*cp = '\0';
   1602  1.368    rillig 		cp++;
   1603  1.368    rillig 	    }
   1604  1.368    rillig 
   1605  1.368    rillig 	    ParseDoSrc(tOp, line, specType);
   1606  1.368    rillig 	}
   1607  1.368    rillig 	pp_skip_whitespace(&cp);
   1608  1.368    rillig 	line = cp;
   1609  1.368    rillig     }
   1610  1.368    rillig     return TRUE;
   1611  1.368    rillig }
   1612    1.1       cgd 
   1613  1.368    rillig /* Parse a dependency line consisting of targets, followed by a dependency
   1614  1.368    rillig  * operator, optionally followed by sources.
   1615  1.368    rillig  *
   1616  1.368    rillig  * The nodes of the sources are linked as children to the nodes of the
   1617  1.368    rillig  * targets. Nodes are created as necessary.
   1618  1.368    rillig  *
   1619  1.368    rillig  * The operator is applied to each node in the global 'targets' list,
   1620  1.368    rillig  * which is where the nodes found for the targets are kept, by means of
   1621  1.368    rillig  * the ParseDoOp function.
   1622  1.368    rillig  *
   1623  1.368    rillig  * The sources are parsed in much the same way as the targets, except
   1624  1.368    rillig  * that they are expanded using the wildcarding scheme of the C-Shell,
   1625  1.368    rillig  * and all instances of the resulting words in the list of all targets
   1626  1.368    rillig  * are found. Each of the resulting nodes is then linked to each of the
   1627  1.368    rillig  * targets as one of its children.
   1628  1.368    rillig  *
   1629  1.368    rillig  * Certain targets and sources such as .PHONY or .PRECIOUS are handled
   1630  1.368    rillig  * specially. These are the ones detailed by the specType variable.
   1631  1.368    rillig  *
   1632  1.368    rillig  * The storing of transformation rules such as '.c.o' is also taken care of
   1633  1.368    rillig  * here. A target is recognized as a transformation rule by calling
   1634  1.368    rillig  * Suff_IsTransform. If it is a transformation rule, its node is gotten
   1635  1.368    rillig  * from the suffix module via Suff_AddTransform rather than the standard
   1636  1.368    rillig  * Targ_FindNode in the target module.
   1637  1.368    rillig  */
   1638  1.368    rillig static void
   1639  1.368    rillig ParseDoDependency(char *line)
   1640  1.368    rillig {
   1641  1.368    rillig     char *cp;			/* our current position */
   1642  1.368    rillig     GNodeType op;		/* the operator on the line */
   1643  1.368    rillig     SearchPathList *paths;	/* search paths to alter when parsing
   1644  1.368    rillig 				 * a list of .PATH targets */
   1645  1.368    rillig     int tOp;			/* operator from special target */
   1646  1.368    rillig     StringList *curTargs;	/* target names to be found and added
   1647  1.368    rillig 				 * to the targets list */
   1648  1.374    rillig     char *lstart = line;
   1649  1.366    rillig 
   1650  1.368    rillig     /*
   1651  1.368    rillig      * specType contains the SPECial TYPE of the current target. It is Not
   1652  1.368    rillig      * if the target is unspecial. If it *is* special, however, the children
   1653  1.368    rillig      * are linked as children of the parent but not vice versa.
   1654  1.368    rillig      */
   1655  1.368    rillig     ParseSpecial specType = Not;
   1656  1.366    rillig 
   1657  1.368    rillig     DEBUG1(PARSE, "ParseDoDependency(%s)\n", line);
   1658  1.368    rillig     tOp = 0;
   1659  1.366    rillig 
   1660  1.368    rillig     paths = NULL;
   1661  1.366    rillig 
   1662  1.385    rillig     curTargs = Lst_New();
   1663  1.365    rillig 
   1664  1.368    rillig     /*
   1665  1.368    rillig      * First, grind through the targets.
   1666  1.368    rillig      */
   1667  1.368    rillig     if (!ParseDoDependencyTargets(&cp, &line, lstart, &specType, &tOp, &paths,
   1668  1.368    rillig 				  curTargs))
   1669  1.368    rillig 	goto out;
   1670  1.365    rillig 
   1671    1.1       cgd     /*
   1672    1.1       cgd      * Don't need the list of target names anymore...
   1673    1.1       cgd      */
   1674  1.268    rillig     Lst_Free(curTargs);
   1675  1.112  christos     curTargs = NULL;
   1676    1.1       cgd 
   1677  1.368    rillig     if (!Lst_IsEmpty(targets))
   1678  1.373    rillig 	ParseDoDependencyCheckSpec(specType);
   1679    1.1       cgd 
   1680    1.1       cgd     /*
   1681  1.368    rillig      * Have now parsed all the target names. Must parse the operator next.
   1682    1.1       cgd      */
   1683  1.368    rillig     if (!ParseDoDependencyParseOp(&cp, lstart, &op))
   1684  1.373    rillig 	goto out;
   1685    1.1       cgd 
   1686  1.204  dholland     /*
   1687  1.204  dholland      * Apply the operator to the target. This is how we remember which
   1688  1.204  dholland      * operator a target was defined with. It fails if the operator
   1689  1.204  dholland      * used isn't consistent across all references.
   1690  1.204  dholland      */
   1691  1.337    rillig     ApplyDependencyOperator(op);
   1692    1.1       cgd 
   1693    1.1       cgd     /*
   1694  1.204  dholland      * Onward to the sources.
   1695  1.204  dholland      *
   1696  1.204  dholland      * LINE will now point to the first source word, if any, or the
   1697  1.204  dholland      * end of the string if not.
   1698    1.1       cgd      */
   1699  1.368    rillig     pp_skip_whitespace(&cp);
   1700    1.1       cgd     line = cp;
   1701    1.1       cgd 
   1702    1.1       cgd     /*
   1703    1.1       cgd      * Several special targets take different actions if present with no
   1704    1.1       cgd      * sources:
   1705    1.1       cgd      *	a .SUFFIXES line with no sources clears out all old suffixes
   1706    1.1       cgd      *	a .PRECIOUS line makes all targets precious
   1707    1.1       cgd      *	a .IGNORE line ignores errors for all targets
   1708    1.1       cgd      *	a .SILENT line creates silence when making all targets
   1709    1.1       cgd      *	a .PATH removes all directories from the search path(s).
   1710    1.1       cgd      */
   1711    1.1       cgd     if (!*line) {
   1712  1.373    rillig 	ParseDoDependencySourcesEmpty(specType, paths);
   1713    1.1       cgd     } else if (specType == MFlags) {
   1714    1.1       cgd 	/*
   1715    1.1       cgd 	 * Call on functions in main.c to deal with these arguments and
   1716    1.1       cgd 	 * set the initial character to a null-character so the loop to
   1717    1.1       cgd 	 * get sources won't get anything
   1718    1.1       cgd 	 */
   1719   1.97  christos 	Main_ParseArgLine(line);
   1720    1.1       cgd 	*line = '\0';
   1721    1.5       cgd     } else if (specType == ExShell) {
   1722  1.272    rillig 	if (!Job_ParseShell(line)) {
   1723   1.97  christos 	    Parse_Error(PARSE_FATAL, "improper shell specification");
   1724  1.112  christos 	    goto out;
   1725    1.1       cgd 	}
   1726    1.1       cgd 	*line = '\0';
   1727  1.242    rillig     } else if (specType == NotParallel || specType == SingleShell ||
   1728  1.374    rillig 	       specType == DeleteOnError) {
   1729    1.1       cgd 	*line = '\0';
   1730    1.1       cgd     }
   1731   1.27  christos 
   1732    1.1       cgd     /*
   1733   1.27  christos      * NOW GO FOR THE SOURCES
   1734    1.1       cgd      */
   1735  1.242    rillig     if (specType == Suffixes || specType == ExPath ||
   1736  1.242    rillig 	specType == Includes || specType == Libs ||
   1737  1.242    rillig 	specType == Null || specType == ExObjdir)
   1738    1.1       cgd     {
   1739  1.373    rillig 	ParseDoDependencySourcesSpecial(line, cp, specType, paths);
   1740    1.1       cgd 	if (paths) {
   1741  1.268    rillig 	    Lst_Free(paths);
   1742  1.222  riastrad 	    paths = NULL;
   1743    1.1       cgd 	}
   1744   1.85       sjg 	if (specType == ExPath)
   1745   1.85       sjg 	    Dir_SetPATH();
   1746    1.1       cgd     } else {
   1747  1.222  riastrad 	assert(paths == NULL);
   1748  1.373    rillig 	if (!ParseDoDependencySourcesMundane(line, cp, specType, tOp))
   1749  1.373    rillig 	    goto out;
   1750    1.1       cgd     }
   1751   1.27  christos 
   1752  1.335    rillig     FindMainTarget();
   1753    1.1       cgd 
   1754  1.112  christos out:
   1755  1.263    rillig     if (paths != NULL)
   1756  1.268    rillig 	Lst_Free(paths);
   1757  1.263    rillig     if (curTargs != NULL)
   1758  1.268    rillig 	Lst_Free(curTargs);
   1759    1.1       cgd }
   1760    1.1       cgd 
   1761  1.389    rillig typedef struct VarAssignParsed {
   1762  1.389    rillig     const char *nameStart;	/* unexpanded */
   1763  1.389    rillig     const char *nameEnd;	/* before operator adjustment */
   1764  1.389    rillig     const char *eq;		/* the '=' of the assignment operator */
   1765  1.389    rillig } VarAssignParsed;
   1766  1.389    rillig 
   1767  1.388    rillig /* Determine the assignment operator and adjust the end of the variable
   1768  1.388    rillig  * name accordingly. */
   1769  1.388    rillig static void
   1770  1.389    rillig AdjustVarassignOp(const VarAssignParsed *pvar, const char *value,
   1771  1.389    rillig 		  VarAssign *out_var)
   1772  1.388    rillig {
   1773  1.389    rillig     const char *op = pvar->eq;
   1774  1.389    rillig     const char * const name = pvar->nameStart;
   1775  1.388    rillig     VarAssignOp type;
   1776  1.388    rillig 
   1777  1.388    rillig     if (op > name && op[-1] == '+') {
   1778  1.388    rillig 	type = VAR_APPEND;
   1779  1.388    rillig 	op--;
   1780  1.388    rillig 
   1781  1.388    rillig     } else if (op > name && op[-1] == '?') {
   1782  1.388    rillig 	op--;
   1783  1.388    rillig 	type = VAR_DEFAULT;
   1784  1.388    rillig 
   1785  1.388    rillig     } else if (op > name && op[-1] == ':') {
   1786  1.388    rillig 	op--;
   1787  1.388    rillig 	type = VAR_SUBST;
   1788  1.388    rillig 
   1789  1.388    rillig     } else if (op > name && op[-1] == '!') {
   1790  1.388    rillig 	op--;
   1791  1.388    rillig 	type = VAR_SHELL;
   1792  1.388    rillig 
   1793  1.388    rillig     } else {
   1794  1.388    rillig 	type = VAR_NORMAL;
   1795  1.388    rillig #ifdef SUNSHCMD
   1796  1.388    rillig 	while (op > name && ch_isspace(op[-1]))
   1797  1.388    rillig 	    op--;
   1798  1.388    rillig 
   1799  1.388    rillig 	if (op >= name + 3 && op[-3] == ':' && op[-2] == 's' && op[-1] == 'h') {
   1800  1.388    rillig 	    type = VAR_SHELL;
   1801  1.388    rillig 	    op -= 3;
   1802  1.388    rillig 	}
   1803  1.388    rillig #endif
   1804  1.388    rillig     }
   1805  1.388    rillig 
   1806  1.388    rillig     {
   1807  1.389    rillig 	const char *nameEnd = pvar->nameEnd < op ? pvar->nameEnd : op;
   1808  1.389    rillig 	out_var->varname = bmake_strsedup(pvar->nameStart, nameEnd);
   1809  1.389    rillig 	out_var->op = type;
   1810  1.389    rillig 	out_var->value = value;
   1811  1.388    rillig     }
   1812  1.388    rillig }
   1813  1.388    rillig 
   1814  1.368    rillig /* Parse a variable assignment, consisting of a single-word variable name,
   1815  1.368    rillig  * optional whitespace, an assignment operator, optional whitespace and the
   1816  1.368    rillig  * variable value.
   1817   1.84       wiz  *
   1818  1.368    rillig  * Used for both lines in a file and command line arguments. */
   1819    1.1       cgd Boolean
   1820  1.368    rillig Parse_IsVar(const char *p, VarAssign *out_var)
   1821    1.1       cgd {
   1822  1.389    rillig     VarAssignParsed pvar;
   1823  1.368    rillig     const char *firstSpace = NULL;
   1824  1.154       dsl     char ch;
   1825   1.16  christos     int level = 0;
   1826    1.1       cgd 
   1827  1.368    rillig     /* Skip to variable name */
   1828  1.368    rillig     while (*p == ' ' || *p == '\t')
   1829  1.368    rillig 	p++;
   1830  1.368    rillig 
   1831  1.368    rillig     /* During parsing, the '+' of the '+=' operator is initially parsed
   1832  1.368    rillig      * as part of the variable name.  It is later corrected, as is the ':sh'
   1833  1.368    rillig      * modifier. Of these two (nameEnd and op), the earlier one determines the
   1834  1.368    rillig      * actual end of the variable name. */
   1835  1.389    rillig     pvar.nameStart = p;
   1836  1.368    rillig #ifdef CLEANUP
   1837  1.389    rillig     pvar.nameEnd = NULL;
   1838  1.389    rillig     pvar.eq = NULL;
   1839  1.368    rillig #endif
   1840  1.356    rillig 
   1841  1.154       dsl     /* Scan for one of the assignment operators outside a variable expansion */
   1842  1.368    rillig     while ((ch = *p++) != 0) {
   1843  1.154       dsl 	if (ch == '(' || ch == '{') {
   1844   1.16  christos 	    level++;
   1845  1.154       dsl 	    continue;
   1846  1.154       dsl 	}
   1847  1.154       dsl 	if (ch == ')' || ch == '}') {
   1848   1.16  christos 	    level--;
   1849  1.154       dsl 	    continue;
   1850  1.154       dsl 	}
   1851  1.368    rillig 
   1852  1.154       dsl 	if (level != 0)
   1853  1.154       dsl 	    continue;
   1854  1.368    rillig 
   1855  1.368    rillig 	if (ch == ' ' || ch == '\t')
   1856  1.368    rillig 	    if (firstSpace == NULL)
   1857  1.373    rillig 		firstSpace = p - 1;
   1858  1.368    rillig 	while (ch == ' ' || ch == '\t')
   1859  1.368    rillig 	    ch = *p++;
   1860  1.368    rillig 
   1861  1.191       sjg #ifdef SUNSHCMD
   1862  1.368    rillig 	if (ch == ':' && strncmp(p, "sh", 2) == 0) {
   1863  1.368    rillig 	    p += 2;
   1864  1.191       sjg 	    continue;
   1865  1.191       sjg 	}
   1866  1.191       sjg #endif
   1867  1.368    rillig 	if (ch == '=') {
   1868  1.389    rillig 	    pvar.eq = p - 1;
   1869  1.389    rillig 	    pvar.nameEnd = firstSpace != NULL ? firstSpace : p - 1;
   1870  1.368    rillig 	    cpp_skip_whitespace(&p);
   1871  1.389    rillig 	    AdjustVarassignOp(&pvar, p, out_var);
   1872  1.154       dsl 	    return TRUE;
   1873  1.368    rillig 	}
   1874  1.368    rillig 	if (*p == '=' && (ch == '+' || ch == ':' || ch == '?' || ch == '!')) {
   1875  1.389    rillig 	    pvar.eq = p;
   1876  1.389    rillig 	    pvar.nameEnd = firstSpace != NULL ? firstSpace : p;
   1877  1.368    rillig 	    p++;
   1878  1.368    rillig 	    cpp_skip_whitespace(&p);
   1879  1.389    rillig 	    AdjustVarassignOp(&pvar, p, out_var);
   1880  1.154       dsl 	    return TRUE;
   1881  1.368    rillig 	}
   1882  1.368    rillig 	if (firstSpace != NULL)
   1883  1.154       dsl 	    return FALSE;
   1884  1.154       dsl     }
   1885    1.1       cgd 
   1886  1.154       dsl     return FALSE;
   1887    1.1       cgd }
   1888    1.1       cgd 
   1889  1.368    rillig static void
   1890  1.368    rillig VarCheckSyntax(VarAssignOp type, const char *uvalue, GNode *ctxt)
   1891  1.368    rillig {
   1892  1.243       sjg     if (DEBUG(LINT)) {
   1893  1.368    rillig 	if (type != VAR_SUBST && strchr(uvalue, '$') != NULL) {
   1894  1.368    rillig 	    /* Check for syntax errors such as unclosed expressions or
   1895  1.368    rillig 	     * unknown modifiers. */
   1896  1.325    rillig 	    char *expandedValue;
   1897  1.243       sjg 
   1898  1.368    rillig 	    (void)Var_Subst(uvalue, ctxt, VARE_NONE, &expandedValue);
   1899  1.323    rillig 	    /* TODO: handle errors */
   1900  1.325    rillig 	    free(expandedValue);
   1901  1.243       sjg 	}
   1902  1.243       sjg     }
   1903  1.368    rillig }
   1904  1.368    rillig 
   1905  1.390    rillig static void
   1906  1.391    rillig VarAssign_EvalSubst(const char *name, const char *uvalue, GNode *ctxt,
   1907  1.390    rillig 		    const char **out_avalue, void **out_avalue_freeIt)
   1908  1.390    rillig {
   1909  1.390    rillig     const char *avalue = uvalue;
   1910  1.390    rillig     char *evalue;
   1911  1.390    rillig     /*
   1912  1.390    rillig      * Allow variables in the old value to be undefined, but leave their
   1913  1.390    rillig      * expressions alone -- this is done by forcing oldVars to be false.
   1914  1.390    rillig      * XXX: This can cause recursive variables, but that's not hard to do,
   1915  1.390    rillig      * and this allows someone to do something like
   1916  1.390    rillig      *
   1917  1.390    rillig      *  CFLAGS = $(.INCLUDES)
   1918  1.390    rillig      *  CFLAGS := -I.. $(CFLAGS)
   1919  1.390    rillig      *
   1920  1.390    rillig      * And not get an error.
   1921  1.390    rillig      */
   1922  1.390    rillig     Boolean oldOldVars = oldVars;
   1923  1.390    rillig 
   1924  1.390    rillig     oldVars = FALSE;
   1925  1.390    rillig 
   1926  1.390    rillig     /*
   1927  1.390    rillig      * make sure that we set the variable the first time to nothing
   1928  1.390    rillig      * so that it gets substituted!
   1929  1.390    rillig      */
   1930  1.390    rillig     if (!Var_Exists(name, ctxt))
   1931  1.390    rillig 	Var_Set(name, "", ctxt);
   1932  1.390    rillig 
   1933  1.390    rillig     (void)Var_Subst(uvalue, ctxt, VARE_WANTRES|VARE_ASSIGN, &evalue);
   1934  1.390    rillig     /* TODO: handle errors */
   1935  1.390    rillig     oldVars = oldOldVars;
   1936  1.390    rillig     avalue = evalue;
   1937  1.390    rillig     Var_Set(name, avalue, ctxt);
   1938  1.390    rillig 
   1939  1.390    rillig     *out_avalue = avalue;
   1940  1.390    rillig     *out_avalue_freeIt = evalue;
   1941  1.390    rillig }
   1942  1.390    rillig 
   1943  1.390    rillig static void
   1944  1.391    rillig VarAssign_EvalShell(const char *name, const char *uvalue, GNode *ctxt,
   1945  1.390    rillig 		    const char **out_avalue, void **out_avalue_freeIt)
   1946  1.390    rillig {
   1947  1.390    rillig     const char *cmd, *errfmt;
   1948  1.390    rillig     char *cmdOut;
   1949  1.390    rillig     void *cmd_freeIt = NULL;
   1950  1.390    rillig 
   1951  1.390    rillig     cmd = uvalue;
   1952  1.390    rillig     if (strchr(cmd, '$') != NULL) {
   1953  1.390    rillig 	char *ecmd;
   1954  1.390    rillig 	(void)Var_Subst(cmd, VAR_CMD, VARE_UNDEFERR|VARE_WANTRES, &ecmd);
   1955  1.390    rillig 	/* TODO: handle errors */
   1956  1.390    rillig 	cmd = cmd_freeIt = ecmd;
   1957  1.390    rillig     }
   1958  1.390    rillig 
   1959  1.390    rillig     cmdOut = Cmd_Exec(cmd, &errfmt);
   1960  1.391    rillig     Var_Set(name, cmdOut, ctxt);
   1961  1.390    rillig     *out_avalue = *out_avalue_freeIt = cmdOut;
   1962  1.390    rillig 
   1963  1.390    rillig     if (errfmt)
   1964  1.390    rillig 	Parse_Error(PARSE_WARNING, errfmt, cmd);
   1965  1.390    rillig 
   1966  1.390    rillig     free(cmd_freeIt);
   1967  1.390    rillig }
   1968  1.390    rillig 
   1969  1.391    rillig /* Perform a variable assignment.
   1970  1.391    rillig  *
   1971  1.391    rillig  * The actual value of the variable is returned in *out_avalue and
   1972  1.391    rillig  * *out_avalue_freeIt.  Especially for VAR_SUBST and VAR_SHELL this can differ
   1973  1.391    rillig  * from the literal value.
   1974  1.391    rillig  *
   1975  1.391    rillig  * Return whether the assignment was actually done.  The assignment is only
   1976  1.391    rillig  * skipped if the operator is '?=' and the variable already exists. */
   1977  1.368    rillig static Boolean
   1978  1.391    rillig VarAssign_Eval(const char *name, VarAssignOp op, const char *uvalue,
   1979  1.391    rillig 	       GNode *ctxt, const char **out_avalue, void **out_avalue_freeIt)
   1980  1.368    rillig {
   1981  1.368    rillig     const char *avalue = uvalue;
   1982  1.368    rillig     void *avalue_freeIt = NULL;
   1983  1.353    rillig 
   1984  1.391    rillig     if (op == VAR_APPEND) {
   1985  1.368    rillig 	Var_Append(name, uvalue, ctxt);
   1986  1.391    rillig     } else if (op == VAR_SUBST) {
   1987  1.391    rillig         VarAssign_EvalSubst(name, uvalue, ctxt, &avalue, &avalue_freeIt);
   1988  1.391    rillig     } else if (op == VAR_SHELL) {
   1989  1.391    rillig         VarAssign_EvalShell(name, uvalue, ctxt, &avalue, &avalue_freeIt);
   1990    1.1       cgd     } else {
   1991  1.391    rillig 	if (op == VAR_DEFAULT && Var_Exists(name, ctxt)) {
   1992  1.368    rillig 	    *out_avalue_freeIt = NULL;
   1993  1.368    rillig 	    return FALSE;
   1994  1.368    rillig 	}
   1995  1.368    rillig 
   1996  1.368    rillig 	/* Normal assignment -- just do it. */
   1997  1.368    rillig 	Var_Set(name, uvalue, ctxt);
   1998    1.1       cgd     }
   1999  1.368    rillig 
   2000  1.368    rillig     *out_avalue = avalue;
   2001  1.368    rillig     *out_avalue_freeIt = avalue_freeIt;
   2002  1.368    rillig     return TRUE;
   2003  1.368    rillig }
   2004  1.368    rillig 
   2005  1.368    rillig static void
   2006  1.368    rillig VarAssignSpecial(const char *name, const char *avalue)
   2007  1.368    rillig {
   2008  1.368    rillig     if (strcmp(name, MAKEOVERRIDES) == 0)
   2009   1.74        tv 	Main_ExportMAKEFLAGS(FALSE);	/* re-export MAKEFLAGS */
   2010  1.368    rillig     else if (strcmp(name, ".CURDIR") == 0) {
   2011   1.85       sjg 	/*
   2012  1.321    rillig 	 * Someone is being (too?) clever...
   2013   1.85       sjg 	 * Let's pretend they know what they are doing and
   2014  1.321    rillig 	 * re-initialize the 'cur' CachedDir.
   2015   1.85       sjg 	 */
   2016  1.368    rillig 	Dir_InitCur(avalue);
   2017   1.85       sjg 	Dir_SetPATH();
   2018  1.368    rillig     } else if (strcmp(name, MAKE_JOB_PREFIX) == 0) {
   2019  1.135       sjg 	Job_SetPrefix();
   2020  1.368    rillig     } else if (strcmp(name, MAKE_EXPORTED) == 0) {
   2021  1.368    rillig 	Var_Export(avalue, FALSE);
   2022   1.85       sjg     }
   2023  1.368    rillig }
   2024  1.368    rillig 
   2025  1.368    rillig /* Take the variable assignment in the passed line and execute it.
   2026  1.368    rillig  *
   2027  1.368    rillig  * Note: There is a lexical ambiguity with assignment modifier characters
   2028  1.368    rillig  * in variable names. This routine interprets the character before the =
   2029  1.368    rillig  * as a modifier. Therefore, an assignment like
   2030  1.368    rillig  *	C++=/usr/bin/CC
   2031  1.368    rillig  * is interpreted as "C+ +=" instead of "C++ =".
   2032  1.368    rillig  *
   2033  1.368    rillig  * Input:
   2034  1.368    rillig  *	p		A line guaranteed to be a variable assignment
   2035  1.368    rillig  *			(see Parse_IsVar).
   2036  1.368    rillig  *	ctxt		Context in which to do the assignment
   2037  1.368    rillig  */
   2038  1.368    rillig void
   2039  1.368    rillig Parse_DoVar(VarAssign *var, GNode *ctxt)
   2040  1.368    rillig {
   2041  1.368    rillig     const char *avalue;		/* actual value (maybe expanded) */
   2042  1.368    rillig     void *avalue_freeIt;
   2043  1.368    rillig 
   2044  1.368    rillig     VarCheckSyntax(var->op, var->value, ctxt);
   2045  1.391    rillig     if (VarAssign_Eval(var->varname, var->op, var->value, ctxt,
   2046  1.391    rillig 		       &avalue, &avalue_freeIt))
   2047  1.368    rillig 	VarAssignSpecial(var->varname, avalue);
   2048  1.368    rillig 
   2049  1.368    rillig     free(avalue_freeIt);
   2050  1.368    rillig     free(var->varname);
   2051    1.1       cgd }
   2052   1.23  christos 
   2053  1.200  christos 
   2054  1.203     joerg /*
   2055  1.195  christos  * ParseMaybeSubMake --
   2056  1.338    rillig  *	Scan the command string to see if it a possible submake node
   2057  1.195  christos  * Input:
   2058  1.195  christos  *	cmd		the command to scan
   2059  1.195  christos  * Results:
   2060  1.195  christos  *	TRUE if the command is possibly a submake, FALSE if not.
   2061  1.195  christos  */
   2062  1.195  christos static Boolean
   2063  1.195  christos ParseMaybeSubMake(const char *cmd)
   2064  1.195  christos {
   2065  1.197    justin     size_t i;
   2066  1.195  christos     static struct {
   2067  1.195  christos 	const char *name;
   2068  1.195  christos 	size_t len;
   2069  1.195  christos     } vals[] = {
   2070  1.195  christos #define MKV(A)	{	A, sizeof(A) - 1	}
   2071  1.195  christos 	MKV("${MAKE}"),
   2072  1.195  christos 	MKV("${.MAKE}"),
   2073  1.195  christos 	MKV("$(MAKE)"),
   2074  1.195  christos 	MKV("$(.MAKE)"),
   2075  1.195  christos 	MKV("make"),
   2076  1.195  christos     };
   2077  1.375    rillig     for (i = 0; i < sizeof vals / sizeof vals[0]; i++) {
   2078  1.195  christos 	char *ptr;
   2079  1.195  christos 	if ((ptr = strstr(cmd, vals[i].name)) == NULL)
   2080  1.195  christos 	    continue;
   2081  1.290    rillig 	if ((ptr == cmd || !ch_isalnum(ptr[-1]))
   2082  1.290    rillig 	    && !ch_isalnum(ptr[vals[i].len]))
   2083  1.195  christos 	    return TRUE;
   2084  1.195  christos     }
   2085  1.195  christos     return FALSE;
   2086  1.195  christos }
   2087  1.195  christos 
   2088  1.327    rillig /* Append the command to the target node.
   2089    1.1       cgd  *
   2090  1.327    rillig  * The node may be marked as a submake node if the command is determined to
   2091  1.327    rillig  * be that. */
   2092  1.327    rillig static void
   2093  1.327    rillig ParseAddCmd(GNode *gn, char *cmd)
   2094    1.9       jtc {
   2095  1.120       dsl     /* Add to last (ie current) cohort for :: targets */
   2096  1.327    rillig     if ((gn->type & OP_DOUBLEDEP) && gn->cohorts->last != NULL)
   2097  1.327    rillig 	gn = gn->cohorts->last->datum;
   2098  1.120       dsl 
   2099  1.203     joerg     /* if target already supplied, ignore commands */
   2100  1.203     joerg     if (!(gn->type & OP_HAS_COMMANDS)) {
   2101  1.268    rillig 	Lst_Append(gn->commands, cmd);
   2102  1.203     joerg 	if (ParseMaybeSubMake(cmd))
   2103  1.203     joerg 	    gn->type |= OP_SUBMAKE;
   2104  1.203     joerg 	ParseMark(gn);
   2105  1.203     joerg     } else {
   2106  1.327    rillig #if 0
   2107  1.203     joerg 	/* XXX: We cannot do this until we fix the tree */
   2108  1.268    rillig 	Lst_Append(gn->commands, cmd);
   2109  1.203     joerg 	Parse_Error(PARSE_WARNING,
   2110  1.203     joerg 		     "overriding commands for target \"%s\"; "
   2111  1.203     joerg 		     "previous commands defined at %s: %d ignored",
   2112  1.203     joerg 		     gn->name, gn->fname, gn->lineno);
   2113  1.203     joerg #else
   2114  1.203     joerg 	Parse_Error(PARSE_WARNING,
   2115  1.374    rillig 		    "duplicate script for target \"%s\" ignored",
   2116  1.374    rillig 		    gn->name);
   2117  1.369    rillig 	ParseErrorInternal(gn->fname, (size_t)gn->lineno, PARSE_WARNING,
   2118  1.374    rillig 			   "using previous script for \"%s\" defined here",
   2119  1.374    rillig 			   gn->name);
   2120  1.203     joerg #endif
   2121  1.200  christos     }
   2122    1.1       cgd }
   2123    1.1       cgd 
   2124  1.284    rillig /* Add a directory to the path searched for included makefiles bracketed
   2125  1.284    rillig  * by double-quotes. */
   2126    1.1       cgd void
   2127  1.344    rillig Parse_AddIncludeDir(const char *dir)
   2128    1.1       cgd {
   2129  1.103  christos     (void)Dir_AddDir(parseIncPath, dir);
   2130    1.1       cgd }
   2131    1.1       cgd 
   2132  1.284    rillig /* Push to another file.
   2133    1.1       cgd  *
   2134  1.284    rillig  * The input is the line minus the '.'. A file spec is a string enclosed in
   2135  1.284    rillig  * <> or "". The <> file is looked for only in sysIncPath. The "" file is
   2136  1.284    rillig  * first searched in the parsedir and then in the directories specified by
   2137  1.284    rillig  * the -I command line options.
   2138    1.1       cgd  */
   2139    1.1       cgd static void
   2140  1.210       sjg Parse_include_file(char *file, Boolean isSystem, Boolean depinc, int silent)
   2141    1.1       cgd {
   2142  1.170  dholland     struct loadedfile *lf;
   2143  1.374    rillig     char *fullname;		/* full pathname of file */
   2144  1.374    rillig     char *newName;
   2145  1.374    rillig     char *prefEnd, *incdir;
   2146  1.374    rillig     int fd;
   2147  1.374    rillig     int i;
   2148    1.1       cgd 
   2149    1.1       cgd     /*
   2150    1.1       cgd      * Now we know the file's name and its search path, we attempt to
   2151    1.1       cgd      * find the durn thing. A return of NULL indicates the file don't
   2152    1.1       cgd      * exist.
   2153    1.1       cgd      */
   2154  1.147     joerg     fullname = file[0] == '/' ? bmake_strdup(file) : NULL;
   2155   1.76   reinoud 
   2156  1.140       dsl     if (fullname == NULL && !isSystem) {
   2157    1.1       cgd 	/*
   2158    1.1       cgd 	 * Include files contained in double-quotes are first searched for
   2159    1.1       cgd 	 * relative to the including file's location. We don't want to
   2160    1.1       cgd 	 * cd there, of course, so we just tack on the old file's
   2161    1.1       cgd 	 * leading path components and call Dir_FindFile to see if
   2162    1.1       cgd 	 * we can locate the beast.
   2163    1.1       cgd 	 */
   2164    1.1       cgd 
   2165  1.147     joerg 	incdir = bmake_strdup(curFile->fname);
   2166  1.140       dsl 	prefEnd = strrchr(incdir, '/');
   2167  1.105  christos 	if (prefEnd != NULL) {
   2168    1.1       cgd 	    *prefEnd = '\0';
   2169  1.140       dsl 	    /* Now do lexical processing of leading "../" on the filename */
   2170  1.140       dsl 	    for (i = 0; strncmp(file + i, "../", 3) == 0; i += 3) {
   2171  1.140       dsl 		prefEnd = strrchr(incdir + 1, '/');
   2172  1.140       dsl 		if (prefEnd == NULL || strcmp(prefEnd, "/..") == 0)
   2173  1.140       dsl 		    break;
   2174  1.140       dsl 		*prefEnd = '\0';
   2175  1.140       dsl 	    }
   2176  1.251    rillig 	    newName = str_concat3(incdir, "/", file + i);
   2177   1.97  christos 	    fullname = Dir_FindFile(newName, parseIncPath);
   2178  1.140       dsl 	    if (fullname == NULL)
   2179    1.1       cgd 		fullname = Dir_FindFile(newName, dirSearchPath);
   2180  1.103  christos 	    free(newName);
   2181    1.1       cgd 	}
   2182  1.140       dsl 	free(incdir);
   2183  1.140       dsl 
   2184  1.142       sjg 	if (fullname == NULL) {
   2185   1.76   reinoud 	    /*
   2186  1.246    rillig 	     * Makefile wasn't found in same directory as included makefile.
   2187   1.76   reinoud 	     * Search for it first on the -I search path,
   2188   1.76   reinoud 	     * then on the .PATH search path, if not found in a -I directory.
   2189  1.142       sjg 	     * If we have a suffix specific path we should use that.
   2190   1.76   reinoud 	     */
   2191  1.142       sjg 	    char *suff;
   2192  1.322    rillig 	    SearchPath *suffPath = NULL;
   2193  1.142       sjg 
   2194  1.145  christos 	    if ((suff = strrchr(file, '.'))) {
   2195  1.142       sjg 		suffPath = Suff_GetPath(suff);
   2196  1.152       dsl 		if (suffPath != NULL) {
   2197  1.142       sjg 		    fullname = Dir_FindFile(file, suffPath);
   2198  1.142       sjg 		}
   2199  1.142       sjg 	    }
   2200  1.105  christos 	    if (fullname == NULL) {
   2201  1.142       sjg 		fullname = Dir_FindFile(file, parseIncPath);
   2202  1.142       sjg 		if (fullname == NULL) {
   2203  1.142       sjg 		    fullname = Dir_FindFile(file, dirSearchPath);
   2204  1.142       sjg 		}
   2205   1.76   reinoud 	    }
   2206  1.142       sjg 	}
   2207    1.1       cgd     }
   2208    1.1       cgd 
   2209   1.76   reinoud     /* Looking for a system file or file still not found */
   2210  1.105  christos     if (fullname == NULL) {
   2211    1.1       cgd 	/*
   2212   1.76   reinoud 	 * Look for it on the system path
   2213    1.1       cgd 	 */
   2214  1.375    rillig 	SearchPath *path = Lst_IsEmpty(sysIncPath) ? defIncPath : sysIncPath;
   2215  1.375    rillig 	fullname = Dir_FindFile(file, path);
   2216    1.1       cgd     }
   2217    1.1       cgd 
   2218  1.105  christos     if (fullname == NULL) {
   2219   1.38  christos 	if (!silent)
   2220   1.97  christos 	    Parse_Error(PARSE_FATAL, "Could not find %s", file);
   2221    1.1       cgd 	return;
   2222    1.1       cgd     }
   2223    1.1       cgd 
   2224  1.125       dsl     /* Actually open the file... */
   2225  1.125       dsl     fd = open(fullname, O_RDONLY);
   2226  1.125       dsl     if (fd == -1) {
   2227   1.38  christos 	if (!silent)
   2228   1.97  christos 	    Parse_Error(PARSE_FATAL, "Cannot open %s", fullname);
   2229  1.140       dsl 	free(fullname);
   2230  1.125       dsl 	return;
   2231  1.123       dsl     }
   2232  1.125       dsl 
   2233  1.170  dholland     /* load it */
   2234  1.170  dholland     lf = loadfile(fullname, fd);
   2235  1.170  dholland 
   2236  1.125       dsl     /* Start reading from this file next */
   2237  1.170  dholland     Parse_SetInput(fullname, 0, -1, loadedfile_nextbuf, lf);
   2238  1.170  dholland     curFile->lf = lf;
   2239  1.210       sjg     if (depinc)
   2240  1.374    rillig 	doing_depend = depinc;	/* only turn it on */
   2241  1.123       dsl }
   2242  1.123       dsl 
   2243  1.123       dsl static void
   2244  1.123       dsl ParseDoInclude(char *line)
   2245  1.123       dsl {
   2246  1.374    rillig     char endc;			/* the character which ends the file spec */
   2247  1.374    rillig     char *cp;			/* current position in file spec */
   2248  1.374    rillig     int silent = *line != 'i';
   2249  1.375    rillig     char *file = line + (silent ? 8 : 7);
   2250  1.123       dsl 
   2251  1.123       dsl     /* Skip to delimiter character so we know where to look */
   2252  1.123       dsl     while (*file == ' ' || *file == '\t')
   2253  1.123       dsl 	file++;
   2254  1.123       dsl 
   2255  1.123       dsl     if (*file != '"' && *file != '<') {
   2256  1.123       dsl 	Parse_Error(PARSE_FATAL,
   2257  1.374    rillig 		    ".include filename must be delimited by '\"' or '<'");
   2258  1.123       dsl 	return;
   2259  1.123       dsl     }
   2260  1.123       dsl 
   2261  1.123       dsl     /*
   2262  1.123       dsl      * Set the search path on which to find the include file based on the
   2263  1.123       dsl      * characters which bracket its name. Angle-brackets imply it's
   2264  1.123       dsl      * a system Makefile while double-quotes imply it's a user makefile
   2265  1.123       dsl      */
   2266  1.123       dsl     if (*file == '<') {
   2267  1.123       dsl 	endc = '>';
   2268  1.123       dsl     } else {
   2269  1.123       dsl 	endc = '"';
   2270  1.123       dsl     }
   2271  1.123       dsl 
   2272  1.123       dsl     /* Skip to matching delimiter */
   2273  1.123       dsl     for (cp = ++file; *cp && *cp != endc; cp++)
   2274  1.123       dsl 	continue;
   2275  1.123       dsl 
   2276  1.123       dsl     if (*cp != endc) {
   2277  1.123       dsl 	Parse_Error(PARSE_FATAL,
   2278  1.374    rillig 		    "Unclosed %cinclude filename. '%c' expected",
   2279  1.374    rillig 		    '.', endc);
   2280  1.123       dsl 	return;
   2281    1.1       cgd     }
   2282  1.123       dsl     *cp = '\0';
   2283  1.123       dsl 
   2284  1.123       dsl     /*
   2285  1.123       dsl      * Substitute for any variables in the file name before trying to
   2286  1.123       dsl      * find the thing.
   2287  1.123       dsl      */
   2288  1.323    rillig     (void)Var_Subst(file, VAR_CMD, VARE_WANTRES, &file);
   2289  1.323    rillig     /* TODO: handle errors */
   2290  1.123       dsl 
   2291  1.242    rillig     Parse_include_file(file, endc == '>', *line == 'd', silent);
   2292  1.123       dsl     free(file);
   2293    1.1       cgd }
   2294    1.1       cgd 
   2295  1.281    rillig /* Split filename into dirname + basename, then assign these to the
   2296  1.281    rillig  * given variables. */
   2297  1.193  christos static void
   2298  1.281    rillig SetFilenameVars(const char *filename, const char *dirvar, const char *filevar)
   2299  1.193  christos {
   2300  1.281    rillig     const char *slash, *dirname, *basename;
   2301  1.281    rillig     void *freeIt;
   2302  1.281    rillig 
   2303  1.281    rillig     slash = strrchr(filename, '/');
   2304  1.281    rillig     if (slash == NULL) {
   2305  1.281    rillig 	dirname = curdir;
   2306  1.281    rillig 	basename = filename;
   2307  1.281    rillig 	freeIt = NULL;
   2308  1.281    rillig     } else {
   2309  1.281    rillig 	dirname = freeIt = bmake_strsedup(filename, slash);
   2310  1.281    rillig 	basename = slash + 1;
   2311  1.281    rillig     }
   2312  1.193  christos 
   2313  1.281    rillig     Var_Set(dirvar, dirname, VAR_GLOBAL);
   2314  1.281    rillig     Var_Set(filevar, basename, VAR_GLOBAL);
   2315  1.193  christos 
   2316  1.341    rillig     DEBUG5(PARSE, "%s: ${%s} = `%s' ${%s} = `%s'\n",
   2317  1.341    rillig 	   __func__, dirvar, dirname, filevar, basename);
   2318  1.281    rillig     free(freeIt);
   2319  1.281    rillig }
   2320  1.281    rillig 
   2321  1.281    rillig /* Return the immediately including file.
   2322  1.281    rillig  *
   2323  1.281    rillig  * This is made complicated since the .for loop is implemented as a special
   2324  1.281    rillig  * kind of .include; see For_Run. */
   2325  1.281    rillig static const char *
   2326  1.281    rillig GetActuallyIncludingFile(void)
   2327  1.281    rillig {
   2328  1.281    rillig     size_t i;
   2329  1.193  christos 
   2330  1.282    rillig     for (i = includes.len; i > 0; i--) {
   2331  1.282    rillig 	IFile *parent = includes.items[i - 1];
   2332  1.284    rillig 	IFile *child = i < includes.len ? includes.items[i] : curFile;
   2333  1.281    rillig 	if (!child->fromForLoop)
   2334  1.282    rillig 	    return parent->fname;
   2335  1.281    rillig     }
   2336  1.282    rillig     return NULL;
   2337  1.193  christos }
   2338  1.281    rillig 
   2339  1.285    rillig /* Set .PARSEDIR, .PARSEFILE, .INCLUDEDFROMDIR and .INCLUDEDFROMFILE. */
   2340   1.44     aidan static void
   2341  1.122       dsl ParseSetParseFile(const char *filename)
   2342   1.44     aidan {
   2343  1.281    rillig     const char *including;
   2344   1.44     aidan 
   2345  1.281    rillig     SetFilenameVars(filename, ".PARSEDIR", ".PARSEFILE");
   2346  1.281    rillig 
   2347  1.281    rillig     including = GetActuallyIncludingFile();
   2348  1.281    rillig     if (including != NULL) {
   2349  1.281    rillig 	SetFilenameVars(including,
   2350  1.281    rillig 			".INCLUDEDFROMDIR", ".INCLUDEDFROMFILE");
   2351   1.44     aidan     } else {
   2352  1.281    rillig 	Var_Delete(".INCLUDEDFROMDIR", VAR_GLOBAL);
   2353  1.281    rillig 	Var_Delete(".INCLUDEDFROMFILE", VAR_GLOBAL);
   2354   1.44     aidan     }
   2355   1.44     aidan }
   2356   1.44     aidan 
   2357  1.284    rillig /* Track the makefiles we read - so makefiles can set dependencies on them.
   2358  1.284    rillig  * Avoid adding anything more than once. */
   2359  1.184       sjg static void
   2360  1.184       sjg ParseTrackInput(const char *name)
   2361  1.184       sjg {
   2362  1.184       sjg     char *fp = NULL;
   2363  1.236    rillig 
   2364  1.244    rillig     const char *old = Var_Value(MAKE_MAKEFILES, VAR_GLOBAL, &fp);
   2365  1.184       sjg     if (old) {
   2366  1.244    rillig 	size_t name_len = strlen(name);
   2367  1.244    rillig 	const char *ep = old + strlen(old) - name_len;
   2368  1.184       sjg 	/* does it contain name? */
   2369  1.184       sjg 	for (; old != NULL; old = strchr(old, ' ')) {
   2370  1.184       sjg 	    if (*old == ' ')
   2371  1.184       sjg 		old++;
   2372  1.206       sjg 	    if (old >= ep)
   2373  1.374    rillig 		break;		/* cannot contain name */
   2374  1.374    rillig 	    if (memcmp(old, name, name_len) == 0 &&
   2375  1.374    rillig 		(old[name_len] == '\0' || old[name_len] == ' '))
   2376  1.184       sjg 		goto cleanup;
   2377  1.184       sjg 	}
   2378  1.184       sjg     }
   2379  1.374    rillig     Var_Append(MAKE_MAKEFILES, name, VAR_GLOBAL);
   2380  1.374    rillig cleanup:
   2381  1.245    rillig     bmake_free(fp);
   2382  1.184       sjg }
   2383  1.137       sjg 
   2384   1.44     aidan 
   2385  1.276    rillig /* Start Parsing from the given source.
   2386    1.5       cgd  *
   2387  1.276    rillig  * The given file is added to the includes stack. */
   2388    1.5       cgd void
   2389  1.170  dholland Parse_SetInput(const char *name, int line, int fd,
   2390  1.374    rillig 	       char *(*nextbuf)(void *, size_t *), void *arg)
   2391    1.5       cgd {
   2392  1.155       dsl     char *buf;
   2393  1.170  dholland     size_t len;
   2394  1.281    rillig     Boolean fromForLoop = name == NULL;
   2395  1.155       dsl 
   2396  1.281    rillig     if (fromForLoop)
   2397  1.127       dsl 	name = curFile->fname;
   2398  1.139       dsl     else
   2399  1.184       sjg 	ParseTrackInput(name);
   2400  1.127       dsl 
   2401  1.127       dsl     if (DEBUG(PARSE))
   2402  1.342    rillig 	debug_printf("%s: file %s, line %d, fd %d, nextbuf %s, arg %p\n",
   2403  1.342    rillig 		     __func__, name, line, fd,
   2404  1.342    rillig 		     nextbuf == loadedfile_nextbuf ? "loadedfile" : "other",
   2405  1.342    rillig 		     arg);
   2406  1.127       dsl 
   2407  1.155       dsl     if (fd == -1 && nextbuf == NULL)
   2408  1.125       dsl 	/* sanity */
   2409  1.125       dsl 	return;
   2410  1.125       dsl 
   2411  1.132       dsl     if (curFile != NULL)
   2412  1.281    rillig 	/* Save existing file info */
   2413  1.384    rillig 	Vector_Push(&includes, curFile);
   2414    1.5       cgd 
   2415  1.125       dsl     /* Allocate and fill in new structure */
   2416  1.147     joerg     curFile = bmake_malloc(sizeof *curFile);
   2417  1.125       dsl 
   2418  1.125       dsl     /*
   2419  1.125       dsl      * Once the previous state has been saved, we can get down to reading
   2420  1.125       dsl      * the new file. We set up the name of the file to be the absolute
   2421  1.125       dsl      * name of the include file so error messages refer to the right
   2422  1.125       dsl      * place.
   2423  1.125       dsl      */
   2424  1.189       sjg     curFile->fname = bmake_strdup(name);
   2425  1.281    rillig     curFile->fromForLoop = fromForLoop;
   2426  1.125       dsl     curFile->lineno = line;
   2427  1.155       dsl     curFile->first_lineno = line;
   2428  1.155       dsl     curFile->nextbuf = nextbuf;
   2429  1.155       dsl     curFile->nextbuf_arg = arg;
   2430  1.170  dholland     curFile->lf = NULL;
   2431  1.212       sjg     curFile->depending = doing_depend;	/* restore this on EOF */
   2432  1.170  dholland 
   2433  1.170  dholland     assert(nextbuf != NULL);
   2434  1.125       dsl 
   2435  1.170  dholland     /* Get first block of input data */
   2436  1.170  dholland     buf = curFile->nextbuf(curFile->nextbuf_arg, &len);
   2437  1.170  dholland     if (buf == NULL) {
   2438  1.246    rillig 	/* Was all a waste of time ... */
   2439  1.189       sjg 	if (curFile->fname)
   2440  1.189       sjg 	    free(curFile->fname);
   2441  1.170  dholland 	free(curFile);
   2442  1.170  dholland 	return;
   2443  1.125       dsl     }
   2444  1.170  dholland     curFile->P_str = buf;
   2445  1.170  dholland     curFile->P_ptr = buf;
   2446  1.374    rillig     curFile->P_end = buf + len;
   2447    1.5       cgd 
   2448  1.155       dsl     curFile->cond_depth = Cond_save_depth();
   2449  1.155       dsl     ParseSetParseFile(name);
   2450    1.5       cgd }
   2451    1.5       cgd 
   2452  1.375    rillig /* Check if the directive is an include directive. */
   2453  1.228  christos static Boolean
   2454  1.298    rillig IsInclude(const char *dir, Boolean sysv)
   2455  1.228  christos {
   2456  1.298    rillig 	if (dir[0] == 's' || dir[0] == '-' || (dir[0] == 'd' && !sysv))
   2457  1.298    rillig 		dir++;
   2458  1.228  christos 
   2459  1.298    rillig 	if (strncmp(dir, "include", 7) != 0)
   2460  1.228  christos 		return FALSE;
   2461  1.228  christos 
   2462  1.248    rillig 	/* Space is not mandatory for BSD .include */
   2463  1.298    rillig 	return !sysv || ch_isspace(dir[7]);
   2464  1.228  christos }
   2465  1.228  christos 
   2466  1.228  christos 
   2467    1.5       cgd #ifdef SYSVINCLUDE
   2468  1.284    rillig /* Check if the line is a SYSV include directive. */
   2469  1.228  christos static Boolean
   2470  1.228  christos IsSysVInclude(const char *line)
   2471  1.228  christos {
   2472  1.228  christos 	const char *p;
   2473  1.228  christos 
   2474  1.228  christos 	if (!IsInclude(line, TRUE))
   2475  1.228  christos 		return FALSE;
   2476  1.228  christos 
   2477  1.375    rillig 	/* Avoid interpreting a dependency line as an include */
   2478  1.228  christos 	for (p = line; (p = strchr(p, ':')) != NULL;) {
   2479  1.228  christos 		if (*++p == '\0') {
   2480  1.228  christos 			/* end of line -> dependency */
   2481  1.228  christos 			return FALSE;
   2482  1.228  christos 		}
   2483  1.290    rillig 		if (*p == ':' || ch_isspace(*p)) {
   2484  1.228  christos 			/* :: operator or ': ' -> dependency */
   2485  1.228  christos 			return FALSE;
   2486  1.228  christos 		}
   2487  1.228  christos 	}
   2488  1.228  christos 	return TRUE;
   2489  1.228  christos }
   2490  1.228  christos 
   2491  1.284    rillig /* Push to another file.  The line points to the word "include". */
   2492    1.5       cgd static void
   2493   1.84       wiz ParseTraditionalInclude(char *line)
   2494    1.5       cgd {
   2495  1.374    rillig     char *cp;			/* current position in file spec */
   2496  1.374    rillig     int done = 0;
   2497  1.374    rillig     int silent = line[0] != 'i';
   2498  1.374    rillig     char *file = line + (silent ? 8 : 7);
   2499  1.374    rillig     char *all_files;
   2500    1.5       cgd 
   2501  1.341    rillig     DEBUG2(PARSE, "%s: %s\n", __func__, file);
   2502  1.111  ginsbach 
   2503  1.368    rillig     pp_skip_whitespace(&file);
   2504    1.5       cgd 
   2505  1.111  ginsbach     /*
   2506  1.111  ginsbach      * Substitute for any variables in the file name before trying to
   2507  1.111  ginsbach      * find the thing.
   2508  1.111  ginsbach      */
   2509  1.323    rillig     (void)Var_Subst(file, VAR_CMD, VARE_WANTRES, &all_files);
   2510  1.323    rillig     /* TODO: handle errors */
   2511  1.111  ginsbach 
   2512    1.5       cgd     if (*file == '\0') {
   2513  1.374    rillig 	Parse_Error(PARSE_FATAL, "Filename missing from \"include\"");
   2514  1.224  riastrad 	goto out;
   2515    1.5       cgd     }
   2516    1.5       cgd 
   2517  1.123       dsl     for (file = all_files; !done; file = cp + 1) {
   2518  1.123       dsl 	/* Skip to end of line or next whitespace */
   2519  1.290    rillig 	for (cp = file; *cp && !ch_isspace(*cp); cp++)
   2520   1.38  christos 	    continue;
   2521   1.38  christos 
   2522   1.38  christos 	if (*cp)
   2523   1.38  christos 	    *cp = '\0';
   2524   1.38  christos 	else
   2525   1.38  christos 	    done = 1;
   2526   1.38  christos 
   2527  1.210       sjg 	Parse_include_file(file, FALSE, FALSE, silent);
   2528    1.5       cgd     }
   2529  1.224  riastrad out:
   2530  1.123       dsl     free(all_files);
   2531    1.5       cgd }
   2532    1.5       cgd #endif
   2533    1.5       cgd 
   2534  1.183       sjg #ifdef GMAKEEXPORT
   2535  1.375    rillig /* Parse "export <variable>=<value>", and actually export it. */
   2536  1.182  christos static void
   2537  1.182  christos ParseGmakeExport(char *line)
   2538  1.182  christos {
   2539  1.375    rillig     char *variable = line + 6;
   2540  1.374    rillig     char *value;
   2541  1.182  christos 
   2542  1.341    rillig     DEBUG2(PARSE, "%s: %s\n", __func__, variable);
   2543  1.182  christos 
   2544  1.368    rillig     pp_skip_whitespace(&variable);
   2545  1.182  christos 
   2546  1.182  christos     for (value = variable; *value && *value != '='; value++)
   2547  1.182  christos 	continue;
   2548  1.182  christos 
   2549  1.182  christos     if (*value != '=') {
   2550  1.182  christos 	Parse_Error(PARSE_FATAL,
   2551  1.284    rillig 		    "Variable/Value missing from \"export\"");
   2552  1.182  christos 	return;
   2553  1.182  christos     }
   2554  1.374    rillig     *value++ = '\0';		/* terminate variable */
   2555  1.182  christos 
   2556  1.182  christos     /*
   2557  1.183       sjg      * Expand the value before putting it in the environment.
   2558  1.182  christos      */
   2559  1.323    rillig     (void)Var_Subst(value, VAR_CMD, VARE_WANTRES, &value);
   2560  1.323    rillig     /* TODO: handle errors */
   2561  1.323    rillig 
   2562  1.182  christos     setenv(variable, value, 1);
   2563  1.223  riastrad     free(value);
   2564  1.182  christos }
   2565  1.182  christos #endif
   2566  1.182  christos 
   2567  1.284    rillig /* Called when EOF is reached in the current file. If we were reading an
   2568  1.284    rillig  * include file, the includes stack is popped and things set up to go back
   2569  1.284    rillig  * to reading the previous file at the previous location.
   2570    1.1       cgd  *
   2571    1.1       cgd  * Results:
   2572  1.376    rillig  *	TRUE to continue parsing, i.e. it had only reached the end of an
   2573  1.376    rillig  *	included file, FALSE if the main file has been parsed completely.
   2574    1.1       cgd  */
   2575  1.376    rillig static Boolean
   2576  1.123       dsl ParseEOF(void)
   2577    1.1       cgd {
   2578  1.155       dsl     char *ptr;
   2579  1.170  dholland     size_t len;
   2580  1.170  dholland 
   2581  1.170  dholland     assert(curFile->nextbuf != NULL);
   2582  1.155       dsl 
   2583  1.210       sjg     doing_depend = curFile->depending;	/* restore this */
   2584  1.170  dholland     /* get next input buffer, if any */
   2585  1.170  dholland     ptr = curFile->nextbuf(curFile->nextbuf_arg, &len);
   2586  1.170  dholland     curFile->P_ptr = ptr;
   2587  1.170  dholland     curFile->P_str = ptr;
   2588  1.170  dholland     curFile->P_end = ptr + len;
   2589  1.170  dholland     curFile->lineno = curFile->first_lineno;
   2590  1.170  dholland     if (ptr != NULL) {
   2591  1.170  dholland 	/* Iterate again */
   2592  1.376    rillig 	return TRUE;
   2593  1.155       dsl     }
   2594  1.155       dsl 
   2595  1.132       dsl     /* Ensure the makefile (or loop) didn't have mismatched conditionals */
   2596  1.132       dsl     Cond_restore_depth(curFile->cond_depth);
   2597  1.131       dsl 
   2598  1.170  dholland     if (curFile->lf != NULL) {
   2599  1.374    rillig 	loadedfile_destroy(curFile->lf);
   2600  1.374    rillig 	curFile->lf = NULL;
   2601  1.170  dholland     }
   2602  1.170  dholland 
   2603  1.125       dsl     /* Dispose of curFile info */
   2604  1.125       dsl     /* Leak curFile->fname because all the gnodes have pointers to it */
   2605  1.125       dsl     free(curFile->P_str);
   2606  1.125       dsl     free(curFile);
   2607  1.125       dsl 
   2608  1.384    rillig     if (Vector_IsEmpty(&includes)) {
   2609  1.258    rillig 	curFile = NULL;
   2610  1.125       dsl 	/* We've run out of input */
   2611   1.44     aidan 	Var_Delete(".PARSEDIR", VAR_GLOBAL);
   2612   1.44     aidan 	Var_Delete(".PARSEFILE", VAR_GLOBAL);
   2613  1.194  christos 	Var_Delete(".INCLUDEDFROMDIR", VAR_GLOBAL);
   2614  1.194  christos 	Var_Delete(".INCLUDEDFROMFILE", VAR_GLOBAL);
   2615  1.376    rillig 	return FALSE;
   2616    1.1       cgd     }
   2617    1.1       cgd 
   2618  1.384    rillig     curFile = Vector_Pop(&includes);
   2619  1.341    rillig     DEBUG2(PARSE, "ParseEOF: returning to file %s, line %d\n",
   2620  1.341    rillig 	   curFile->fname, curFile->lineno);
   2621  1.127       dsl 
   2622  1.125       dsl     ParseSetParseFile(curFile->fname);
   2623  1.376    rillig     return TRUE;
   2624    1.1       cgd }
   2625    1.1       cgd 
   2626  1.127       dsl #define PARSE_RAW 1
   2627  1.127       dsl #define PARSE_SKIP 2
   2628  1.127       dsl 
   2629  1.127       dsl static char *
   2630  1.368    rillig ParseGetLine(int flags)
   2631    1.5       cgd {
   2632  1.125       dsl     IFile *cf = curFile;
   2633  1.127       dsl     char *ptr;
   2634  1.125       dsl     char ch;
   2635  1.127       dsl     char *line;
   2636  1.127       dsl     char *line_end;
   2637  1.127       dsl     char *escaped;
   2638  1.127       dsl     char *comment;
   2639  1.127       dsl     char *tp;
   2640  1.125       dsl 
   2641  1.127       dsl     /* Loop through blank lines and comment lines */
   2642  1.125       dsl     for (;;) {
   2643  1.127       dsl 	cf->lineno++;
   2644  1.127       dsl 	line = cf->P_ptr;
   2645  1.127       dsl 	ptr = line;
   2646  1.127       dsl 	line_end = line;
   2647  1.127       dsl 	escaped = NULL;
   2648  1.127       dsl 	comment = NULL;
   2649  1.127       dsl 	for (;;) {
   2650  1.170  dholland 	    if (cf->P_end != NULL && ptr == cf->P_end) {
   2651  1.170  dholland 		/* end of buffer */
   2652  1.170  dholland 		ch = 0;
   2653  1.170  dholland 		break;
   2654  1.170  dholland 	    }
   2655  1.127       dsl 	    ch = *ptr;
   2656  1.127       dsl 	    if (ch == 0 || (ch == '\\' && ptr[1] == 0)) {
   2657  1.127       dsl 		if (cf->P_end == NULL)
   2658  1.127       dsl 		    /* End of string (aka for loop) data */
   2659  1.127       dsl 		    break;
   2660  1.190       sjg 		/* see if there is more we can parse */
   2661  1.190       sjg 		while (ptr++ < cf->P_end) {
   2662  1.190       sjg 		    if ((ch = *ptr) == '\n') {
   2663  1.190       sjg 			if (ptr > line && ptr[-1] == '\\')
   2664  1.190       sjg 			    continue;
   2665  1.190       sjg 			Parse_Error(PARSE_WARNING,
   2666  1.374    rillig 				    "Zero byte read from file, "
   2667  1.374    rillig 				    "skipping rest of line.");
   2668  1.190       sjg 			break;
   2669  1.190       sjg 		    }
   2670  1.190       sjg 		}
   2671  1.170  dholland 		if (cf->nextbuf != NULL) {
   2672  1.170  dholland 		    /*
   2673  1.170  dholland 		     * End of this buffer; return EOF and outer logic
   2674  1.170  dholland 		     * will get the next one. (eww)
   2675  1.170  dholland 		     */
   2676  1.127       dsl 		    break;
   2677  1.127       dsl 		}
   2678  1.170  dholland 		Parse_Error(PARSE_FATAL, "Zero byte read from file");
   2679  1.170  dholland 		return NULL;
   2680  1.127       dsl 	    }
   2681  1.127       dsl 
   2682  1.127       dsl 	    if (ch == '\\') {
   2683  1.127       dsl 		/* Don't treat next character as special, remember first one */
   2684  1.127       dsl 		if (escaped == NULL)
   2685  1.127       dsl 		    escaped = ptr;
   2686  1.127       dsl 		if (ptr[1] == '\n')
   2687  1.127       dsl 		    cf->lineno++;
   2688  1.127       dsl 		ptr += 2;
   2689  1.127       dsl 		line_end = ptr;
   2690  1.127       dsl 		continue;
   2691  1.127       dsl 	    }
   2692  1.127       dsl 	    if (ch == '#' && comment == NULL) {
   2693  1.127       dsl 		/* Remember first '#' for comment stripping */
   2694  1.181       sjg 		/* Unless previous char was '[', as in modifier :[#] */
   2695  1.181       sjg 		if (!(ptr > line && ptr[-1] == '['))
   2696  1.181       sjg 		    comment = line_end;
   2697  1.127       dsl 	    }
   2698  1.127       dsl 	    ptr++;
   2699  1.125       dsl 	    if (ch == '\n')
   2700  1.127       dsl 		break;
   2701  1.290    rillig 	    if (!ch_isspace(ch))
   2702  1.127       dsl 		/* We are not interested in trailing whitespace */
   2703  1.127       dsl 		line_end = ptr;
   2704  1.127       dsl 	}
   2705  1.125       dsl 
   2706  1.127       dsl 	/* Save next 'to be processed' location */
   2707  1.127       dsl 	cf->P_ptr = ptr;
   2708  1.127       dsl 
   2709  1.127       dsl 	/* Check we have a non-comment, non-blank line */
   2710  1.127       dsl 	if (line_end == line || comment == line) {
   2711  1.127       dsl 	    if (ch == 0)
   2712  1.127       dsl 		/* At end of file */
   2713  1.127       dsl 		return NULL;
   2714  1.127       dsl 	    /* Parse another line */
   2715  1.125       dsl 	    continue;
   2716  1.127       dsl 	}
   2717  1.125       dsl 
   2718  1.127       dsl 	/* We now have a line of data */
   2719  1.127       dsl 	*line_end = 0;
   2720   1.27  christos 
   2721  1.127       dsl 	if (flags & PARSE_RAW) {
   2722  1.127       dsl 	    /* Leave '\' (etc) in line buffer (eg 'for' lines) */
   2723  1.127       dsl 	    return line;
   2724  1.127       dsl 	}
   2725    1.5       cgd 
   2726  1.127       dsl 	if (flags & PARSE_SKIP) {
   2727  1.127       dsl 	    /* Completely ignore non-directives */
   2728  1.127       dsl 	    if (line[0] != '.')
   2729  1.127       dsl 		continue;
   2730  1.127       dsl 	    /* We could do more of the .else/.elif/.endif checks here */
   2731  1.127       dsl 	}
   2732  1.127       dsl 	break;
   2733  1.127       dsl     }
   2734    1.5       cgd 
   2735  1.127       dsl     /* Brutally ignore anything after a non-escaped '#' in non-commands */
   2736  1.127       dsl     if (comment != NULL && line[0] != '\t') {
   2737  1.127       dsl 	line_end = comment;
   2738  1.127       dsl 	*line_end = 0;
   2739  1.127       dsl     }
   2740    1.5       cgd 
   2741  1.127       dsl     /* If we didn't see a '\\' then the in-situ data is fine */
   2742  1.368    rillig     if (escaped == NULL)
   2743  1.127       dsl 	return line;
   2744    1.5       cgd 
   2745  1.127       dsl     /* Remove escapes from '\n' and '#' */
   2746  1.127       dsl     tp = ptr = escaped;
   2747  1.127       dsl     escaped = line;
   2748  1.127       dsl     for (; ; *tp++ = ch) {
   2749  1.127       dsl 	ch = *ptr++;
   2750  1.127       dsl 	if (ch != '\\') {
   2751  1.127       dsl 	    if (ch == 0)
   2752  1.127       dsl 		break;
   2753  1.127       dsl 	    continue;
   2754  1.127       dsl 	}
   2755    1.5       cgd 
   2756  1.127       dsl 	ch = *ptr++;
   2757  1.127       dsl 	if (ch == 0) {
   2758  1.127       dsl 	    /* Delete '\\' at end of buffer */
   2759  1.127       dsl 	    tp--;
   2760  1.127       dsl 	    break;
   2761  1.127       dsl 	}
   2762   1.27  christos 
   2763  1.130       dsl 	if (ch == '#' && line[0] != '\t')
   2764  1.130       dsl 	    /* Delete '\\' from before '#' on non-command lines */
   2765  1.127       dsl 	    continue;
   2766   1.27  christos 
   2767  1.127       dsl 	if (ch != '\n') {
   2768  1.127       dsl 	    /* Leave '\\' in buffer for later */
   2769  1.127       dsl 	    *tp++ = '\\';
   2770  1.127       dsl 	    /* Make sure we don't delete an escaped ' ' from the line end */
   2771  1.127       dsl 	    escaped = tp + 1;
   2772  1.127       dsl 	    continue;
   2773  1.127       dsl 	}
   2774   1.27  christos 
   2775  1.203     joerg 	/* Escaped '\n' replace following whitespace with a single ' ' */
   2776  1.203     joerg 	while (ptr[0] == ' ' || ptr[0] == '\t')
   2777  1.203     joerg 	    ptr++;
   2778  1.203     joerg 	ch = ' ';
   2779  1.127       dsl     }
   2780   1.27  christos 
   2781  1.127       dsl     /* Delete any trailing spaces - eg from empty continuations */
   2782  1.290    rillig     while (tp > escaped && ch_isspace(tp[-1]))
   2783  1.127       dsl 	tp--;
   2784   1.27  christos 
   2785  1.127       dsl     *tp = 0;
   2786    1.5       cgd     return line;
   2787    1.5       cgd }
   2788    1.1       cgd 
   2789  1.284    rillig /* Read an entire line from the input file. Called only by Parse_File.
   2790    1.1       cgd  *
   2791    1.1       cgd  * Results:
   2792  1.284    rillig  *	A line without its newline.
   2793    1.1       cgd  *
   2794    1.1       cgd  * Side Effects:
   2795    1.1       cgd  *	Only those associated with reading a character
   2796    1.1       cgd  */
   2797    1.1       cgd static char *
   2798   1.84       wiz ParseReadLine(void)
   2799    1.1       cgd {
   2800  1.338    rillig     char *line;			/* Result */
   2801  1.338    rillig     int lineno;			/* Saved line # */
   2802  1.338    rillig     int rval;
   2803    1.1       cgd 
   2804    1.5       cgd     for (;;) {
   2805  1.368    rillig 	line = ParseGetLine(0);
   2806  1.127       dsl 	if (line == NULL)
   2807  1.127       dsl 	    return NULL;
   2808    1.1       cgd 
   2809  1.127       dsl 	if (line[0] != '.')
   2810  1.127       dsl 	    return line;
   2811  1.121       dsl 
   2812  1.121       dsl 	/*
   2813  1.127       dsl 	 * The line might be a conditional. Ask the conditional module
   2814  1.127       dsl 	 * about it and act accordingly
   2815  1.121       dsl 	 */
   2816  1.302    rillig 	switch (Cond_EvalLine(line)) {
   2817  1.127       dsl 	case COND_SKIP:
   2818  1.127       dsl 	    /* Skip to next conditional that evaluates to COND_PARSE.  */
   2819  1.127       dsl 	    do {
   2820  1.368    rillig 		line = ParseGetLine(PARSE_SKIP);
   2821  1.302    rillig 	    } while (line && Cond_EvalLine(line) != COND_PARSE);
   2822  1.127       dsl 	    if (line == NULL)
   2823  1.121       dsl 		break;
   2824  1.127       dsl 	    continue;
   2825  1.127       dsl 	case COND_PARSE:
   2826  1.127       dsl 	    continue;
   2827  1.127       dsl 	case COND_INVALID:    /* Not a conditional line */
   2828  1.151       dsl 	    /* Check for .for loops */
   2829  1.151       dsl 	    rval = For_Eval(line);
   2830  1.151       dsl 	    if (rval == 0)
   2831  1.151       dsl 		/* Not a .for line */
   2832    1.1       cgd 		break;
   2833  1.151       dsl 	    if (rval < 0)
   2834  1.151       dsl 		/* Syntax error - error printed, ignore line */
   2835  1.151       dsl 		continue;
   2836  1.151       dsl 	    /* Start of a .for loop */
   2837  1.127       dsl 	    lineno = curFile->lineno;
   2838  1.151       dsl 	    /* Accumulate loop lines until matching .endfor */
   2839  1.121       dsl 	    do {
   2840  1.368    rillig 		line = ParseGetLine(PARSE_RAW);
   2841  1.121       dsl 		if (line == NULL) {
   2842  1.121       dsl 		    Parse_Error(PARSE_FATAL,
   2843  1.374    rillig 				"Unexpected end of file in for loop.");
   2844    1.5       cgd 		    break;
   2845  1.121       dsl 		}
   2846  1.151       dsl 	    } while (For_Accum(line));
   2847  1.127       dsl 	    /* Stash each iteration as a new 'input file' */
   2848  1.127       dsl 	    For_Run(lineno);
   2849  1.127       dsl 	    /* Read next line from for-loop buffer */
   2850  1.127       dsl 	    continue;
   2851    1.1       cgd 	}
   2852  1.235    rillig 	return line;
   2853    1.1       cgd     }
   2854    1.1       cgd }
   2855    1.1       cgd 
   2856  1.331    rillig static void
   2857  1.329    rillig FinishDependencyGroup(void)
   2858    1.1       cgd {
   2859  1.330    rillig     if (targets != NULL) {
   2860  1.371    rillig 	GNodeListNode *ln;
   2861  1.371    rillig 	for (ln = targets->first; ln != NULL; ln = ln->next) {
   2862  1.371    rillig 	    GNode *gn = ln->datum;
   2863  1.371    rillig 
   2864  1.371    rillig 	    Suff_EndTransform(gn);
   2865  1.371    rillig 
   2866  1.371    rillig 	    /* Mark the target as already having commands if it does, to
   2867  1.371    rillig 	     * keep from having shell commands on multiple dependency lines. */
   2868  1.371    rillig 	    if (!Lst_IsEmpty(gn->commands))
   2869  1.371    rillig 		gn->type |= OP_HAS_COMMANDS;
   2870  1.371    rillig 	}
   2871  1.371    rillig 
   2872  1.371    rillig 	Lst_Free(targets);
   2873  1.336    rillig 	targets = NULL;
   2874    1.1       cgd     }
   2875    1.1       cgd }
   2876   1.27  christos 
   2877  1.327    rillig /* Add the command to each target from the current dependency spec. */
   2878  1.326    rillig static void
   2879  1.375    rillig ParseLine_ShellCommand(const char *p)
   2880  1.326    rillig {
   2881  1.375    rillig     cpp_skip_whitespace(&p);
   2882  1.375    rillig     if (*p == '\0')
   2883  1.327    rillig 	return;			/* skip empty commands */
   2884  1.327    rillig 
   2885  1.330    rillig     if (targets == NULL) {
   2886  1.375    rillig 	Parse_Error(PARSE_FATAL, "Unassociated shell command \"%s\"", p);
   2887  1.327    rillig 	return;
   2888  1.330    rillig     }
   2889  1.327    rillig 
   2890  1.327    rillig     {
   2891  1.375    rillig 	char *cmd = bmake_strdup(p);
   2892  1.327    rillig 	GNodeListNode *ln;
   2893  1.327    rillig 
   2894  1.327    rillig 	for (ln = targets->first; ln != NULL; ln = ln->next) {
   2895  1.327    rillig 	    GNode *gn = ln->datum;
   2896  1.327    rillig 	    ParseAddCmd(gn, cmd);
   2897  1.327    rillig 	}
   2898  1.326    rillig #ifdef CLEANUP
   2899  1.327    rillig 	Lst_Append(targCmds, cmd);
   2900  1.326    rillig #endif
   2901  1.326    rillig     }
   2902  1.326    rillig }
   2903    1.1       cgd 
   2904  1.379    rillig static Boolean
   2905  1.379    rillig ParseDirective(char *line)
   2906  1.379    rillig {
   2907  1.379    rillig     char *cp;
   2908  1.379    rillig 
   2909  1.379    rillig     if (*line == '.') {
   2910  1.379    rillig 	/*
   2911  1.379    rillig 	 * Lines that begin with the special character may be
   2912  1.379    rillig 	 * include or undef directives.
   2913  1.379    rillig 	 * On the other hand they can be suffix rules (.c.o: ...)
   2914  1.379    rillig 	 * or just dependencies for filenames that start '.'.
   2915  1.379    rillig 	 */
   2916  1.379    rillig 	cp = line + 1;
   2917  1.379    rillig 	pp_skip_whitespace(&cp);
   2918  1.379    rillig 	if (IsInclude(cp, FALSE)) {
   2919  1.379    rillig 	    ParseDoInclude(cp);
   2920  1.379    rillig 	    return TRUE;
   2921  1.379    rillig 	}
   2922  1.379    rillig 	if (strncmp(cp, "undef", 5) == 0) {
   2923  1.379    rillig 	    const char *varname;
   2924  1.379    rillig 	    cp += 5;
   2925  1.379    rillig 	    pp_skip_whitespace(&cp);
   2926  1.379    rillig 	    varname = cp;
   2927  1.379    rillig 	    for (; !ch_isspace(*cp) && *cp != '\0'; cp++)
   2928  1.379    rillig 		continue;
   2929  1.379    rillig 	    *cp = '\0';
   2930  1.379    rillig 	    Var_Delete(varname, VAR_GLOBAL);
   2931  1.379    rillig 	    /* TODO: undefine all variables, not only the first */
   2932  1.379    rillig 	    /* TODO: use Str_Words, like everywhere else */
   2933  1.379    rillig 	    return TRUE;
   2934  1.379    rillig 	} else if (strncmp(cp, "export", 6) == 0) {
   2935  1.379    rillig 	    cp += 6;
   2936  1.379    rillig 	    pp_skip_whitespace(&cp);
   2937  1.379    rillig 	    Var_Export(cp, TRUE);
   2938  1.379    rillig 	    return TRUE;
   2939  1.379    rillig 	} else if (strncmp(cp, "unexport", 8) == 0) {
   2940  1.379    rillig 	    Var_UnExport(cp);
   2941  1.379    rillig 	    return TRUE;
   2942  1.379    rillig 	} else if (strncmp(cp, "info", 4) == 0 ||
   2943  1.379    rillig 		   strncmp(cp, "error", 5) == 0 ||
   2944  1.379    rillig 		   strncmp(cp, "warning", 7) == 0) {
   2945  1.379    rillig 	    if (ParseMessage(cp))
   2946  1.379    rillig 		return TRUE;
   2947  1.379    rillig 	}
   2948  1.379    rillig     }
   2949  1.379    rillig     return FALSE;
   2950  1.379    rillig }
   2951  1.379    rillig 
   2952  1.379    rillig static Boolean
   2953  1.379    rillig ParseVarassign(const char *line)
   2954  1.379    rillig {
   2955  1.379    rillig     VarAssign var;
   2956  1.379    rillig     if (Parse_IsVar(line, &var)) {
   2957  1.379    rillig 	FinishDependencyGroup();
   2958  1.379    rillig 	Parse_DoVar(&var, VAR_GLOBAL);
   2959  1.379    rillig 	return TRUE;
   2960  1.379    rillig     }
   2961  1.379    rillig     return FALSE;
   2962  1.379    rillig }
   2963  1.379    rillig 
   2964  1.380    rillig static char *
   2965  1.380    rillig FindSemicolon(char *p)
   2966  1.380    rillig {
   2967  1.380    rillig     int level = 0;
   2968  1.380    rillig 
   2969  1.380    rillig     for (; *p != '\0'; p++) {
   2970  1.380    rillig 	if (*p == '\\' && p[1] != '\0') {
   2971  1.380    rillig 	    p++;
   2972  1.380    rillig 	    continue;
   2973  1.380    rillig 	}
   2974  1.380    rillig 
   2975  1.380    rillig 	if (*p == '$' && (p[1] == '(' || p[1] == '{')) {
   2976  1.380    rillig 	    level++;
   2977  1.380    rillig 	    continue;
   2978  1.380    rillig 	}
   2979  1.380    rillig 
   2980  1.380    rillig 	if (level > 0 && (*p == ')' || *p == '}')) {
   2981  1.380    rillig 	    level--;
   2982  1.380    rillig 	    continue;
   2983  1.380    rillig 	}
   2984  1.380    rillig 
   2985  1.380    rillig 	if (level == 0 && *p == ';') {
   2986  1.380    rillig 	    break;
   2987  1.380    rillig 	}
   2988  1.380    rillig     }
   2989  1.380    rillig     return p;
   2990  1.380    rillig }
   2991  1.380    rillig 
   2992  1.379    rillig /* dependency	-> target... op [source...]
   2993  1.379    rillig  * op		-> ':' | '::' | '!' */
   2994  1.379    rillig static void
   2995  1.380    rillig ParseDependency(char *line)
   2996  1.379    rillig {
   2997  1.379    rillig     VarEvalFlags eflags;
   2998  1.379    rillig     char *expanded_line;
   2999  1.380    rillig     const char *shellcmd = NULL;
   3000  1.379    rillig 
   3001  1.379    rillig     /*
   3002  1.379    rillig      * For some reason - probably to make the parser impossible -
   3003  1.379    rillig      * a ';' can be used to separate commands from dependencies.
   3004  1.379    rillig      * Attempt to avoid ';' inside substitution patterns.
   3005  1.379    rillig      */
   3006  1.379    rillig     {
   3007  1.380    rillig         char *semicolon = FindSemicolon(line);
   3008  1.380    rillig 	if (*semicolon != '\0') {
   3009  1.380    rillig 	    /* Terminate the dependency list at the ';' */
   3010  1.380    rillig 	    *semicolon = '\0';
   3011  1.380    rillig 	    shellcmd = semicolon + 1;
   3012  1.379    rillig 	}
   3013  1.379    rillig     }
   3014  1.379    rillig 
   3015  1.379    rillig     /*
   3016  1.379    rillig      * We now know it's a dependency line so it needs to have all
   3017  1.379    rillig      * variables expanded before being parsed.
   3018  1.379    rillig      *
   3019  1.379    rillig      * XXX: Ideally the dependency line would first be split into
   3020  1.379    rillig      * its left-hand side, dependency operator and right-hand side,
   3021  1.379    rillig      * and then each side would be expanded on its own.  This would
   3022  1.379    rillig      * allow for the left-hand side to allow only defined variables
   3023  1.379    rillig      * and to allow variables on the right-hand side to be undefined
   3024  1.379    rillig      * as well.
   3025  1.379    rillig      *
   3026  1.379    rillig      * Parsing the line first would also prevent that targets
   3027  1.379    rillig      * generated from variable expressions are interpreted as the
   3028  1.379    rillig      * dependency operator, such as in "target${:U:} middle: source",
   3029  1.379    rillig      * in which the middle is interpreted as a source, not a target.
   3030  1.379    rillig      */
   3031  1.379    rillig 
   3032  1.379    rillig     /* In lint mode, allow undefined variables to appear in
   3033  1.379    rillig      * dependency lines.
   3034  1.379    rillig      *
   3035  1.379    rillig      * Ideally, only the right-hand side would allow undefined
   3036  1.379    rillig      * variables since it is common to have no dependencies.
   3037  1.379    rillig      * Having undefined variables on the left-hand side is more
   3038  1.379    rillig      * unusual though.  Since both sides are expanded in a single
   3039  1.379    rillig      * pass, there is not much choice what to do here.
   3040  1.379    rillig      *
   3041  1.379    rillig      * In normal mode, it does not matter whether undefined
   3042  1.379    rillig      * variables are allowed or not since as of 2020-09-14,
   3043  1.379    rillig      * Var_Parse does not print any parse errors in such a case.
   3044  1.379    rillig      * It simply returns the special empty string var_Error,
   3045  1.379    rillig      * which cannot be detected in the result of Var_Subst. */
   3046  1.379    rillig     eflags = DEBUG(LINT) ? VARE_WANTRES : VARE_UNDEFERR | VARE_WANTRES;
   3047  1.379    rillig     (void)Var_Subst(line, VAR_CMD, eflags, &expanded_line);
   3048  1.379    rillig     /* TODO: handle errors */
   3049  1.379    rillig 
   3050  1.379    rillig     /* Need a fresh list for the target nodes */
   3051  1.379    rillig     if (targets != NULL)
   3052  1.379    rillig 	Lst_Free(targets);
   3053  1.385    rillig     targets = Lst_New();
   3054  1.379    rillig 
   3055  1.379    rillig     ParseDoDependency(expanded_line);
   3056  1.379    rillig     free(expanded_line);
   3057  1.380    rillig 
   3058  1.380    rillig     if (shellcmd != NULL)
   3059  1.380    rillig 	ParseLine_ShellCommand(shellcmd);
   3060  1.379    rillig }
   3061  1.379    rillig 
   3062  1.381    rillig static void
   3063  1.381    rillig ParseLine(char *line)
   3064  1.381    rillig {
   3065  1.381    rillig     if (ParseDirective(line))
   3066  1.381    rillig 	return;
   3067  1.381    rillig 
   3068  1.381    rillig     if (*line == '\t') {
   3069  1.381    rillig 	ParseLine_ShellCommand(line + 1);
   3070  1.381    rillig 	return;
   3071  1.381    rillig     }
   3072  1.381    rillig 
   3073  1.381    rillig #ifdef SYSVINCLUDE
   3074  1.381    rillig     if (IsSysVInclude(line)) {
   3075  1.381    rillig 	/*
   3076  1.381    rillig 	 * It's an S3/S5-style "include".
   3077  1.381    rillig 	 */
   3078  1.381    rillig 	ParseTraditionalInclude(line);
   3079  1.381    rillig 	return;
   3080  1.381    rillig     }
   3081  1.381    rillig #endif
   3082  1.381    rillig 
   3083  1.381    rillig #ifdef GMAKEEXPORT
   3084  1.381    rillig     if (strncmp(line, "export", 6) == 0 && ch_isspace(line[6]) &&
   3085  1.381    rillig 	strchr(line, ':') == NULL) {
   3086  1.381    rillig 	/*
   3087  1.381    rillig 	 * It's a Gmake "export".
   3088  1.381    rillig 	 */
   3089  1.381    rillig 	ParseGmakeExport(line);
   3090  1.381    rillig 	return;
   3091  1.381    rillig     }
   3092  1.381    rillig #endif
   3093  1.381    rillig 
   3094  1.381    rillig     if (ParseVarassign(line))
   3095  1.381    rillig 	return;
   3096  1.381    rillig 
   3097  1.381    rillig     FinishDependencyGroup();
   3098  1.381    rillig 
   3099  1.381    rillig     ParseDependency(line);
   3100  1.381    rillig }
   3101  1.381    rillig 
   3102  1.297    rillig /* Parse a top-level makefile into its component parts, incorporating them
   3103  1.297    rillig  * into the global dependency graph.
   3104    1.1       cgd  *
   3105   1.84       wiz  * Input:
   3106  1.297    rillig  *	name		The name of the file being read
   3107  1.297    rillig  *	fd		The open file to parse; will be closed at the end
   3108    1.1       cgd  */
   3109    1.1       cgd void
   3110  1.125       dsl Parse_File(const char *name, int fd)
   3111    1.1       cgd {
   3112  1.374    rillig     char *line;			/* the line we're working on */
   3113  1.170  dholland     struct loadedfile *lf;
   3114  1.170  dholland 
   3115  1.170  dholland     lf = loadfile(name, fd);
   3116    1.1       cgd 
   3117  1.330    rillig     assert(targets == NULL);
   3118    1.1       cgd     fatals = 0;
   3119   1.44     aidan 
   3120  1.242    rillig     if (name == NULL)
   3121  1.242    rillig 	name = "(stdin)";
   3122  1.170  dholland 
   3123  1.170  dholland     Parse_SetInput(name, 0, -1, loadedfile_nextbuf, lf);
   3124  1.170  dholland     curFile->lf = lf;
   3125    1.1       cgd 
   3126    1.1       cgd     do {
   3127  1.381    rillig 	while ((line = ParseReadLine()) != NULL) {
   3128  1.341    rillig 	    DEBUG2(PARSE, "ParseReadLine (%d): '%s'\n", curFile->lineno, line);
   3129  1.381    rillig 	    ParseLine(line);
   3130    1.1       cgd 	}
   3131    1.1       cgd 	/*
   3132   1.27  christos 	 * Reached EOF, but it may be just EOF of an include file...
   3133    1.1       cgd 	 */
   3134  1.376    rillig     } while (ParseEOF());
   3135    1.1       cgd 
   3136  1.329    rillig     FinishDependencyGroup();
   3137  1.328    rillig 
   3138    1.1       cgd     if (fatals) {
   3139  1.163       sjg 	(void)fflush(stdout);
   3140   1.63  christos 	(void)fprintf(stderr,
   3141  1.374    rillig 		      "%s: Fatal errors encountered -- cannot continue",
   3142  1.374    rillig 		      progname);
   3143  1.161       sjg 	PrintOnError(NULL, NULL);
   3144  1.103  christos 	exit(1);
   3145    1.1       cgd     }
   3146    1.1       cgd }
   3147    1.1       cgd 
   3148  1.383    rillig /* Initialize the parsing module. */
   3149    1.5       cgd void
   3150   1.84       wiz Parse_Init(void)
   3151    1.1       cgd {
   3152  1.152       dsl     mainNode = NULL;
   3153  1.385    rillig     parseIncPath = Lst_New();
   3154  1.385    rillig     sysIncPath = Lst_New();
   3155  1.385    rillig     defIncPath = Lst_New();
   3156  1.384    rillig     Vector_Init(&includes);
   3157   1.45   mycroft #ifdef CLEANUP
   3158  1.385    rillig     targCmds = Lst_New();
   3159   1.45   mycroft #endif
   3160    1.1       cgd }
   3161    1.9       jtc 
   3162  1.383    rillig /* Clean up the parsing module. */
   3163    1.9       jtc void
   3164   1.84       wiz Parse_End(void)
   3165    1.9       jtc {
   3166   1.45   mycroft #ifdef CLEANUP
   3167  1.268    rillig     Lst_Destroy(targCmds, free);
   3168  1.336    rillig     assert(targets == NULL);
   3169  1.268    rillig     Lst_Destroy(defIncPath, Dir_Destroy);
   3170  1.268    rillig     Lst_Destroy(sysIncPath, Dir_Destroy);
   3171  1.268    rillig     Lst_Destroy(parseIncPath, Dir_Destroy);
   3172  1.384    rillig     assert(Vector_IsEmpty(&includes));
   3173  1.384    rillig     Vector_Done(&includes);
   3174   1.45   mycroft #endif
   3175    1.9       jtc }
   3176   1.27  christos 
   3177    1.1       cgd 
   3178    1.1       cgd /*-
   3179    1.1       cgd  *-----------------------------------------------------------------------
   3180    1.1       cgd  * Parse_MainName --
   3181    1.1       cgd  *	Return a Lst of the main target to create for main()'s sake. If
   3182    1.1       cgd  *	no such target exists, we Punt with an obnoxious error message.
   3183    1.1       cgd  *
   3184    1.1       cgd  * Results:
   3185    1.1       cgd  *	A Lst of the single node to create.
   3186    1.1       cgd  *
   3187    1.1       cgd  * Side Effects:
   3188    1.1       cgd  *	None.
   3189    1.1       cgd  *
   3190    1.1       cgd  *-----------------------------------------------------------------------
   3191    1.1       cgd  */
   3192  1.322    rillig GNodeList *
   3193   1.84       wiz Parse_MainName(void)
   3194    1.1       cgd {
   3195  1.322    rillig     GNodeList *mainList;
   3196    1.1       cgd 
   3197  1.385    rillig     mainList = Lst_New();
   3198    1.1       cgd 
   3199  1.152       dsl     if (mainNode == NULL) {
   3200   1.97  christos 	Punt("no target to make.");
   3201  1.246    rillig 	/*NOTREACHED*/
   3202    1.1       cgd     } else if (mainNode->type & OP_DOUBLEDEP) {
   3203  1.268    rillig 	Lst_Append(mainList, mainNode);
   3204  1.268    rillig 	Lst_AppendAll(mainList, mainNode->cohorts);
   3205  1.374    rillig     } else
   3206  1.268    rillig 	Lst_Append(mainList, mainNode);
   3207   1.81        pk     Var_Append(".TARGETS", mainNode->name, VAR_GLOBAL);
   3208  1.235    rillig     return mainList;
   3209   1.59  christos }
   3210