Home | History | Annotate | Line # | Download | only in make
var.c revision 1.304
      1  1.304    rillig /*	$NetBSD: var.c,v 1.304 2020/07/24 08:06:28 rillig Exp $	*/
      2   1.11  christos 
      3    1.1       cgd /*
      4   1.15  christos  * Copyright (c) 1988, 1989, 1990, 1993
      5   1.15  christos  *	The Regents of the University of California.  All rights reserved.
      6   1.80       agc  *
      7   1.80       agc  * This code is derived from software contributed to Berkeley by
      8   1.80       agc  * Adam de Boor.
      9   1.80       agc  *
     10   1.80       agc  * Redistribution and use in source and binary forms, with or without
     11   1.80       agc  * modification, are permitted provided that the following conditions
     12   1.80       agc  * are met:
     13   1.80       agc  * 1. Redistributions of source code must retain the above copyright
     14   1.80       agc  *    notice, this list of conditions and the following disclaimer.
     15   1.80       agc  * 2. Redistributions in binary form must reproduce the above copyright
     16   1.80       agc  *    notice, this list of conditions and the following disclaimer in the
     17   1.80       agc  *    documentation and/or other materials provided with the distribution.
     18   1.80       agc  * 3. Neither the name of the University nor the names of its contributors
     19   1.80       agc  *    may be used to endorse or promote products derived from this software
     20   1.80       agc  *    without specific prior written permission.
     21   1.80       agc  *
     22   1.80       agc  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23   1.80       agc  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24   1.80       agc  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25   1.80       agc  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26   1.80       agc  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27   1.80       agc  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28   1.80       agc  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29   1.80       agc  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30   1.80       agc  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31   1.80       agc  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32   1.80       agc  * SUCH DAMAGE.
     33   1.80       agc  */
     34   1.80       agc 
     35   1.80       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.88      ross #ifndef MAKE_NATIVE
     72  1.304    rillig static char rcsid[] = "$NetBSD: var.c,v 1.304 2020/07/24 08:06:28 rillig Exp $";
     73   1.23     lukem #else
     74   1.19  christos #include <sys/cdefs.h>
     75    1.1       cgd #ifndef lint
     76   1.11  christos #if 0
     77   1.15  christos static char sccsid[] = "@(#)var.c	8.3 (Berkeley) 3/19/94";
     78   1.11  christos #else
     79  1.304    rillig __RCSID("$NetBSD: var.c,v 1.304 2020/07/24 08:06:28 rillig Exp $");
     80   1.11  christos #endif
     81    1.1       cgd #endif /* not lint */
     82   1.23     lukem #endif
     83    1.1       cgd 
     84    1.1       cgd /*-
     85    1.1       cgd  * var.c --
     86    1.1       cgd  *	Variable-handling functions
     87    1.1       cgd  *
     88    1.1       cgd  * Interface:
     89  1.138       dsl  *	Var_Set		    Set the value of a variable in the given
     90  1.138       dsl  *			    context. The variable is created if it doesn't
     91  1.292    rillig  *			    yet exist.
     92    1.1       cgd  *
     93    1.1       cgd  *	Var_Append	    Append more characters to an existing variable
     94  1.138       dsl  *			    in the given context. The variable needn't
     95  1.138       dsl  *			    exist already -- it will be created if it doesn't.
     96  1.138       dsl  *			    A space is placed between the old value and the
     97  1.138       dsl  *			    new one.
     98    1.1       cgd  *
     99    1.1       cgd  *	Var_Exists	    See if a variable exists.
    100    1.1       cgd  *
    101    1.1       cgd  *	Var_Value 	    Return the value of a variable in a context or
    102  1.138       dsl  *			    NULL if the variable is undefined.
    103    1.1       cgd  *
    104  1.250    rillig  *	Var_Subst 	    Substitute either a single variable or all
    105  1.292    rillig  *			    variables in a string, using the given context.
    106    1.1       cgd  *
    107    1.1       cgd  *	Var_Parse 	    Parse a variable expansion from a string and
    108  1.138       dsl  *			    return the result and the number of characters
    109  1.138       dsl  *			    consumed.
    110    1.1       cgd  *
    111    1.1       cgd  *	Var_Delete	    Delete a variable in a context.
    112    1.1       cgd  *
    113    1.1       cgd  *	Var_Init  	    Initialize this module.
    114    1.1       cgd  *
    115    1.1       cgd  * Debugging:
    116    1.1       cgd  *	Var_Dump  	    Print out all variables defined in the given
    117  1.138       dsl  *			    context.
    118    1.1       cgd  *
    119    1.1       cgd  * XXX: There's a lot of duplication in these functions.
    120    1.1       cgd  */
    121    1.1       cgd 
    122  1.157       sjg #include    <sys/stat.h>
    123   1.31       gwr #ifndef NO_REGEX
    124   1.28  wsanchez #include    <sys/types.h>
    125   1.16  christos #include    <regex.h>
    126   1.17  christos #endif
    127   1.70       wiz #include    <ctype.h>
    128  1.163     joerg #include    <inttypes.h>
    129  1.292    rillig #include    <limits.h>
    130   1.17  christos #include    <stdlib.h>
    131  1.166   tsutsui #include    <time.h>
    132   1.70       wiz 
    133    1.1       cgd #include    "make.h"
    134    1.1       cgd #include    "buf.h"
    135  1.103       sjg #include    "dir.h"
    136  1.111    rillig #include    "job.h"
    137  1.193  christos #include    "metachar.h"
    138    1.1       cgd 
    139    1.1       cgd /*
    140  1.170       sjg  * This lets us tell if we have replaced the original environ
    141  1.170       sjg  * (which we cannot free).
    142  1.170       sjg  */
    143  1.170       sjg char **savedEnv = NULL;
    144  1.170       sjg 
    145  1.170       sjg /*
    146    1.1       cgd  * This is a harmless return value for Var_Parse that can be used by Var_Subst
    147    1.1       cgd  * to determine if there was an error in parsing -- easier than returning
    148    1.1       cgd  * a flag, as things outside this module don't give a hoot.
    149    1.1       cgd  */
    150  1.249    rillig char var_Error[] = "";
    151    1.1       cgd 
    152    1.1       cgd /*
    153  1.259    rillig  * Similar to var_Error, but returned when the 'VARE_UNDEFERR' flag for
    154  1.292    rillig  * Var_Parse is not set. Why not just use a constant? Well, GCC likes
    155  1.202  christos  * to condense identical string instances...
    156    1.1       cgd  */
    157  1.249    rillig static char varNoError[] = "";
    158    1.1       cgd 
    159    1.1       cgd /*
    160  1.205       sjg  * Traditionally we consume $$ during := like any other expansion.
    161  1.205       sjg  * Other make's do not.
    162  1.205       sjg  * This knob allows controlling the behavior.
    163  1.292    rillig  * FALSE to consume $$ during := assignment.
    164  1.292    rillig  * TRUE to preserve $$ during := assignment.
    165  1.205       sjg  */
    166  1.205       sjg #define SAVE_DOLLARS ".MAKE.SAVE_DOLLARS"
    167  1.205       sjg static Boolean save_dollars = TRUE;
    168  1.205       sjg 
    169  1.205       sjg /*
    170    1.1       cgd  * Internally, variables are contained in four different contexts.
    171  1.292    rillig  *	1) the environment. They cannot be changed. If an environment
    172  1.292    rillig  *	    variable is appended to, the result is placed in the global
    173    1.1       cgd  *	    context.
    174    1.1       cgd  *	2) the global context. Variables set in the Makefile are located in
    175  1.292    rillig  *	    the global context.
    176    1.1       cgd  *	3) the command-line context. All variables set on the command line
    177    1.1       cgd  *	   are placed in this context. They are UNALTERABLE once placed here.
    178    1.1       cgd  *	4) the local context. Each target has associated with it a context
    179    1.1       cgd  *	   list. On this list are located the structures describing such
    180    1.1       cgd  *	   local variables as $(@) and $(*)
    181    1.1       cgd  * The four contexts are searched in the reverse order from which they are
    182  1.292    rillig  * listed (but see checkEnvFirst).
    183    1.1       cgd  */
    184  1.240    rillig GNode          *VAR_INTERNAL;	/* variables from make itself */
    185  1.240    rillig GNode          *VAR_GLOBAL;	/* variables from the makefile */
    186  1.240    rillig GNode          *VAR_CMD;	/* variables defined on the command-line */
    187  1.240    rillig 
    188  1.260    rillig typedef enum {
    189  1.260    rillig     FIND_CMD		= 0x01,	/* look in VAR_CMD when searching */
    190  1.260    rillig     FIND_GLOBAL		= 0x02,	/* look in VAR_GLOBAL as well */
    191  1.260    rillig     FIND_ENV		= 0x04	/* look in the environment also */
    192  1.260    rillig } VarFindFlags;
    193    1.1       cgd 
    194  1.228    rillig typedef enum {
    195  1.292    rillig     VAR_IN_USE		= 0x01,	/* Variable's value is currently being used
    196  1.292    rillig 				 * by Var_Parse or Var_Subst.
    197  1.228    rillig 				 * Used to avoid endless recursion */
    198  1.240    rillig     VAR_FROM_ENV	= 0x02,	/* Variable comes from the environment */
    199  1.240    rillig     VAR_JUNK		= 0x04,	/* Variable is a junk variable that
    200  1.228    rillig 				 * should be destroyed when done with
    201  1.228    rillig 				 * it. Used by Var_Parse for undefined,
    202  1.228    rillig 				 * modified variables */
    203  1.240    rillig     VAR_KEEP		= 0x08,	/* Variable is VAR_JUNK, but we found
    204  1.228    rillig 				 * a use for it in some modifier and
    205  1.228    rillig 				 * the value is therefore valid */
    206  1.240    rillig     VAR_EXPORTED	= 0x10,	/* Variable is exported */
    207  1.240    rillig     VAR_REEXPORT	= 0x20,	/* Indicate if var needs re-export.
    208  1.228    rillig 				 * This would be true if it contains $'s */
    209  1.240    rillig     VAR_FROM_CMD	= 0x40	/* Variable came from command line */
    210  1.228    rillig } Var_Flags;
    211  1.228    rillig 
    212    1.1       cgd typedef struct Var {
    213    1.1       cgd     char          *name;	/* the variable's name */
    214  1.138       dsl     Buffer	  val;		/* its value */
    215  1.228    rillig     Var_Flags	  flags;    	/* miscellaneous status flags */
    216    1.1       cgd }  Var;
    217    1.1       cgd 
    218  1.118       sjg /*
    219  1.118       sjg  * Exporting vars is expensive so skip it if we can
    220  1.118       sjg  */
    221  1.292    rillig typedef enum {
    222  1.292    rillig     VAR_EXPORTED_NONE,
    223  1.292    rillig     VAR_EXPORTED_YES,
    224  1.292    rillig     VAR_EXPORTED_ALL
    225  1.292    rillig } VarExportedMode;
    226  1.292    rillig static VarExportedMode var_exportedVars = VAR_EXPORTED_NONE;
    227  1.292    rillig 
    228  1.292    rillig typedef enum {
    229  1.292    rillig     /*
    230  1.292    rillig      * We pass this to Var_Export when doing the initial export
    231  1.292    rillig      * or after updating an exported var.
    232  1.292    rillig      */
    233  1.292    rillig     VAR_EXPORT_PARENT	= 0x01,
    234  1.292    rillig     /*
    235  1.292    rillig      * We pass this to Var_Export1 to tell it to leave the value alone.
    236  1.292    rillig      */
    237  1.292    rillig     VAR_EXPORT_LITERAL	= 0x02
    238  1.292    rillig } VarExportFlags;
    239   1.16  christos 
    240  1.261    rillig /* Flags for pattern matching in the :S and :C modifiers */
    241  1.229    rillig typedef enum {
    242  1.261    rillig     VARP_SUB_GLOBAL	= 0x01,	/* Apply substitution globally */
    243  1.261    rillig     VARP_SUB_ONE	= 0x02,	/* Apply substitution to one word */
    244  1.261    rillig     VARP_SUB_MATCHED	= 0x04,	/* There was a match */
    245  1.288    rillig     VARP_ANCHOR_START	= 0x08,	/* Match at start of word */
    246  1.288    rillig     VARP_ANCHOR_END	= 0x10	/* Match at end of word */
    247  1.261    rillig } VarPatternFlags;
    248   1.16  christos 
    249  1.230    rillig typedef enum {
    250  1.292    rillig     VAR_NO_EXPORT	= 0x01	/* do not export */
    251  1.230    rillig } VarSet_Flags;
    252   1.65       sjg 
    253  1.100  christos #define BROPEN	'{'
    254  1.100  christos #define BRCLOSE	'}'
    255  1.100  christos #define PROPEN	'('
    256  1.100  christos #define PRCLOSE	')'
    257  1.100  christos 
    258    1.1       cgd /*-
    259    1.1       cgd  *-----------------------------------------------------------------------
    260    1.1       cgd  * VarFind --
    261    1.1       cgd  *	Find the given variable in the given context and any other contexts
    262    1.1       cgd  *	indicated.
    263    1.1       cgd  *
    264   1.70       wiz  * Input:
    265   1.70       wiz  *	name		name to find
    266   1.70       wiz  *	ctxt		context in which to find it
    267  1.260    rillig  *	flags		FIND_GLOBAL	look in VAR_GLOBAL as well
    268  1.260    rillig  *			FIND_CMD	look in VAR_CMD as well
    269  1.260    rillig  *			FIND_ENV	look in the environment as well
    270   1.70       wiz  *
    271    1.1       cgd  * Results:
    272    1.1       cgd  *	A pointer to the structure describing the desired variable or
    273  1.136       dsl  *	NULL if the variable does not exist.
    274    1.1       cgd  *
    275    1.1       cgd  * Side Effects:
    276    1.1       cgd  *	None
    277    1.1       cgd  *-----------------------------------------------------------------------
    278    1.1       cgd  */
    279    1.1       cgd static Var *
    280  1.260    rillig VarFind(const char *name, GNode *ctxt, VarFindFlags flags)
    281    1.1       cgd {
    282   1.36   mycroft     Hash_Entry         	*var;
    283  1.138       dsl     Var			*v;
    284    1.1       cgd 
    285  1.242    rillig     /*
    286  1.242    rillig      * If the variable name begins with a '.', it could very well be one of
    287  1.242    rillig      * the local ones.  We check the name against all the local variables
    288  1.242    rillig      * and substitute the short version in for 'name' if it matches one of
    289  1.242    rillig      * them.
    290  1.242    rillig      */
    291  1.242    rillig     if (*name == '.' && isupper((unsigned char) name[1])) {
    292  1.242    rillig 	switch (name[1]) {
    293  1.242    rillig 	case 'A':
    294  1.257    rillig 	    if (strcmp(name, ".ALLSRC") == 0)
    295  1.242    rillig 		name = ALLSRC;
    296  1.257    rillig 	    if (strcmp(name, ".ARCHIVE") == 0)
    297  1.242    rillig 		name = ARCHIVE;
    298  1.242    rillig 	    break;
    299  1.242    rillig 	case 'I':
    300  1.257    rillig 	    if (strcmp(name, ".IMPSRC") == 0)
    301  1.242    rillig 		name = IMPSRC;
    302  1.242    rillig 	    break;
    303  1.242    rillig 	case 'M':
    304  1.257    rillig 	    if (strcmp(name, ".MEMBER") == 0)
    305  1.242    rillig 		name = MEMBER;
    306  1.242    rillig 	    break;
    307  1.242    rillig 	case 'O':
    308  1.257    rillig 	    if (strcmp(name, ".OODATE") == 0)
    309  1.242    rillig 		name = OODATE;
    310  1.242    rillig 	    break;
    311  1.242    rillig 	case 'P':
    312  1.257    rillig 	    if (strcmp(name, ".PREFIX") == 0)
    313  1.242    rillig 		name = PREFIX;
    314  1.242    rillig 	    break;
    315  1.242    rillig 	case 'T':
    316  1.257    rillig 	    if (strcmp(name, ".TARGET") == 0)
    317  1.242    rillig 		name = TARGET;
    318  1.242    rillig 	    break;
    319  1.242    rillig 	}
    320  1.242    rillig     }
    321  1.242    rillig 
    322  1.160  christos #ifdef notyet
    323  1.160  christos     /* for compatibility with gmake */
    324  1.160  christos     if (name[0] == '^' && name[1] == '\0')
    325  1.242    rillig 	name = ALLSRC;
    326  1.160  christos #endif
    327  1.160  christos 
    328    1.1       cgd     /*
    329    1.1       cgd      * First look for the variable in the given context. If it's not there,
    330    1.1       cgd      * look for it in VAR_CMD, VAR_GLOBAL and the environment, in that order,
    331    1.1       cgd      * depending on the FIND_* flags in 'flags'
    332    1.1       cgd      */
    333   1.92  christos     var = Hash_FindEntry(&ctxt->context, name);
    334    1.1       cgd 
    335  1.231    rillig     if (var == NULL && (flags & FIND_CMD) && ctxt != VAR_CMD) {
    336   1.92  christos 	var = Hash_FindEntry(&VAR_CMD->context, name);
    337    1.1       cgd     }
    338  1.231    rillig     if (!checkEnvFirst && var == NULL && (flags & FIND_GLOBAL) &&
    339  1.231    rillig 	ctxt != VAR_GLOBAL)
    340    1.1       cgd     {
    341   1.92  christos 	var = Hash_FindEntry(&VAR_GLOBAL->context, name);
    342  1.231    rillig 	if (var == NULL && ctxt != VAR_INTERNAL) {
    343  1.184       sjg 	    /* VAR_INTERNAL is subordinate to VAR_GLOBAL */
    344  1.184       sjg 	    var = Hash_FindEntry(&VAR_INTERNAL->context, name);
    345  1.184       sjg 	}
    346    1.1       cgd     }
    347  1.231    rillig     if (var == NULL && (flags & FIND_ENV)) {
    348    1.1       cgd 	char *env;
    349    1.1       cgd 
    350   1.97  christos 	if ((env = getenv(name)) != NULL) {
    351  1.257    rillig 	    int len;
    352   1.15  christos 
    353  1.134     joerg 	    v = bmake_malloc(sizeof(Var));
    354  1.134     joerg 	    v->name = bmake_strdup(name);
    355    1.1       cgd 
    356    1.1       cgd 	    len = strlen(env);
    357   1.15  christos 
    358  1.146       dsl 	    Buf_Init(&v->val, len + 1);
    359  1.146       dsl 	    Buf_AddBytes(&v->val, len, env);
    360   1.15  christos 
    361    1.1       cgd 	    v->flags = VAR_FROM_ENV;
    362  1.231    rillig 	    return v;
    363    1.1       cgd 	} else if (checkEnvFirst && (flags & FIND_GLOBAL) &&
    364  1.231    rillig 		   ctxt != VAR_GLOBAL)
    365    1.1       cgd 	{
    366   1.92  christos 	    var = Hash_FindEntry(&VAR_GLOBAL->context, name);
    367  1.231    rillig 	    if (var == NULL && ctxt != VAR_INTERNAL) {
    368  1.184       sjg 		var = Hash_FindEntry(&VAR_INTERNAL->context, name);
    369  1.184       sjg 	    }
    370   1.36   mycroft 	    if (var == NULL) {
    371  1.136       dsl 		return NULL;
    372    1.1       cgd 	    } else {
    373  1.231    rillig 		return (Var *)Hash_GetValue(var);
    374    1.1       cgd 	    }
    375    1.1       cgd 	} else {
    376  1.136       dsl 	    return NULL;
    377    1.1       cgd 	}
    378   1.36   mycroft     } else if (var == NULL) {
    379  1.136       dsl 	return NULL;
    380    1.1       cgd     } else {
    381  1.231    rillig 	return (Var *)Hash_GetValue(var);
    382    1.1       cgd     }
    383    1.1       cgd }
    384    1.1       cgd 
    385    1.1       cgd /*-
    386    1.1       cgd  *-----------------------------------------------------------------------
    387  1.105  christos  * VarFreeEnv  --
    388  1.105  christos  *	If the variable is an environment variable, free it
    389  1.105  christos  *
    390  1.105  christos  * Input:
    391  1.105  christos  *	v		the variable
    392  1.105  christos  *	destroy		true if the value buffer should be destroyed.
    393  1.105  christos  *
    394  1.105  christos  * Results:
    395  1.105  christos  *	1 if it is an environment variable 0 ow.
    396  1.105  christos  *
    397  1.105  christos  * Side Effects:
    398  1.105  christos  *	The variable is free'ed if it is an environent variable.
    399  1.105  christos  *-----------------------------------------------------------------------
    400  1.105  christos  */
    401  1.105  christos static Boolean
    402  1.105  christos VarFreeEnv(Var *v, Boolean destroy)
    403  1.105  christos {
    404  1.257    rillig     if (!(v->flags & VAR_FROM_ENV))
    405  1.105  christos 	return FALSE;
    406  1.105  christos     free(v->name);
    407  1.146       dsl     Buf_Destroy(&v->val, destroy);
    408  1.105  christos     free(v);
    409  1.105  christos     return TRUE;
    410  1.105  christos }
    411  1.105  christos 
    412  1.105  christos /*-
    413  1.105  christos  *-----------------------------------------------------------------------
    414    1.1       cgd  * VarAdd  --
    415    1.1       cgd  *	Add a new variable of name name and value val to the given context
    416    1.1       cgd  *
    417   1.70       wiz  * Input:
    418   1.70       wiz  *	name		name of variable to add
    419   1.70       wiz  *	val		value to set it to
    420   1.70       wiz  *	ctxt		context in which to set it
    421   1.70       wiz  *
    422    1.1       cgd  * Side Effects:
    423    1.1       cgd  *	The new variable is placed at the front of the given context
    424    1.1       cgd  *	The name and val arguments are duplicated so they may
    425    1.1       cgd  *	safely be freed.
    426    1.1       cgd  *-----------------------------------------------------------------------
    427    1.1       cgd  */
    428    1.5       cgd static void
    429   1.73  christos VarAdd(const char *name, const char *val, GNode *ctxt)
    430    1.1       cgd {
    431   1.70       wiz     Var   	  *v;
    432  1.138       dsl     int		  len;
    433   1.70       wiz     Hash_Entry    *h;
    434    1.1       cgd 
    435  1.134     joerg     v = bmake_malloc(sizeof(Var));
    436    1.1       cgd 
    437  1.257    rillig     len = val != NULL ? strlen(val) : 0;
    438  1.242    rillig     Buf_Init(&v->val, len + 1);
    439  1.146       dsl     Buf_AddBytes(&v->val, len, val);
    440    1.1       cgd 
    441    1.1       cgd     v->flags = 0;
    442    1.1       cgd 
    443   1.92  christos     h = Hash_CreateEntry(&ctxt->context, name, NULL);
    444   1.36   mycroft     Hash_SetValue(h, v);
    445   1.37  sommerfe     v->name = h->name;
    446  1.257    rillig     if (DEBUG(VAR) && !(ctxt->flags & INTERNAL)) {
    447  1.114       dsl 	fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
    448    1.1       cgd     }
    449    1.1       cgd }
    450    1.1       cgd 
    451    1.1       cgd /*-
    452    1.1       cgd  *-----------------------------------------------------------------------
    453    1.1       cgd  * Var_Delete --
    454    1.1       cgd  *	Remove a variable from a context.
    455    1.1       cgd  *
    456    1.1       cgd  * Side Effects:
    457    1.1       cgd  *	The Var structure is removed and freed.
    458    1.1       cgd  *
    459    1.1       cgd  *-----------------------------------------------------------------------
    460    1.1       cgd  */
    461    1.1       cgd void
    462   1.73  christos Var_Delete(const char *name, GNode *ctxt)
    463    1.1       cgd {
    464   1.36   mycroft     Hash_Entry 	  *ln;
    465  1.174       sjg     char *cp;
    466  1.231    rillig 
    467  1.257    rillig     if (strchr(name, '$') != NULL) {
    468  1.259    rillig 	cp = Var_Subst(NULL, name, VAR_GLOBAL, VARE_WANTRES);
    469  1.174       sjg     } else {
    470  1.257    rillig 	cp = UNCONST(name);
    471  1.174       sjg     }
    472  1.174       sjg     ln = Hash_FindEntry(&ctxt->context, cp);
    473    1.1       cgd     if (DEBUG(VAR)) {
    474  1.117       dsl 	fprintf(debug_file, "%s:delete %s%s\n",
    475  1.174       sjg 	    ctxt->name, cp, ln ? "" : " (not found)");
    476  1.174       sjg     }
    477  1.257    rillig     if (cp != name)
    478  1.174       sjg 	free(cp);
    479   1.36   mycroft     if (ln != NULL) {
    480  1.257    rillig 	Var *v = (Var *)Hash_GetValue(ln);
    481  1.292    rillig 	if (v->flags & VAR_EXPORTED)
    482  1.118       sjg 	    unsetenv(v->name);
    483  1.292    rillig 	if (strcmp(MAKE_EXPORTED, v->name) == 0)
    484  1.155       sjg 	    var_exportedVars = VAR_EXPORTED_NONE;
    485   1.37  sommerfe 	if (v->name != ln->name)
    486  1.242    rillig 	    free(v->name);
    487   1.36   mycroft 	Hash_DeleteEntry(&ctxt->context, ln);
    488  1.146       dsl 	Buf_Destroy(&v->val, TRUE);
    489   1.98  christos 	free(v);
    490    1.1       cgd     }
    491    1.1       cgd }
    492    1.1       cgd 
    493  1.118       sjg 
    494  1.118       sjg /*
    495  1.118       sjg  * Export a var.
    496  1.118       sjg  * We ignore make internal variables (those which start with '.')
    497  1.118       sjg  * Also we jump through some hoops to avoid calling setenv
    498  1.118       sjg  * more than necessary since it can leak.
    499  1.152       sjg  * We only manipulate flags of vars if 'parent' is set.
    500  1.118       sjg  */
    501  1.118       sjg static int
    502  1.292    rillig Var_Export1(const char *name, VarExportFlags flags)
    503  1.118       sjg {
    504  1.118       sjg     char tmp[BUFSIZ];
    505  1.118       sjg     Var *v;
    506  1.118       sjg     char *val = NULL;
    507  1.118       sjg     int n;
    508  1.292    rillig     VarExportFlags parent = flags & VAR_EXPORT_PARENT;
    509  1.118       sjg 
    510  1.118       sjg     if (*name == '.')
    511  1.240    rillig 	return 0;		/* skip internals */
    512  1.118       sjg     if (!name[1]) {
    513  1.118       sjg 	/*
    514  1.118       sjg 	 * A single char.
    515  1.118       sjg 	 * If it is one of the vars that should only appear in
    516  1.118       sjg 	 * local context, skip it, else we can get Var_Subst
    517  1.118       sjg 	 * into a loop.
    518  1.118       sjg 	 */
    519  1.118       sjg 	switch (name[0]) {
    520  1.118       sjg 	case '@':
    521  1.118       sjg 	case '%':
    522  1.118       sjg 	case '*':
    523  1.118       sjg 	case '!':
    524  1.118       sjg 	    return 0;
    525  1.118       sjg 	}
    526  1.118       sjg     }
    527  1.118       sjg     v = VarFind(name, VAR_GLOBAL, 0);
    528  1.257    rillig     if (v == NULL)
    529  1.118       sjg 	return 0;
    530  1.152       sjg     if (!parent &&
    531  1.292    rillig 	(v->flags & (VAR_EXPORTED | VAR_REEXPORT)) == VAR_EXPORTED) {
    532  1.118       sjg 	return 0;			/* nothing to do */
    533  1.118       sjg     }
    534  1.146       dsl     val = Buf_GetAll(&v->val, NULL);
    535  1.203       sjg     if ((flags & VAR_EXPORT_LITERAL) == 0 && strchr(val, '$')) {
    536  1.152       sjg 	if (parent) {
    537  1.118       sjg 	    /*
    538  1.152       sjg 	     * Flag this as something we need to re-export.
    539  1.118       sjg 	     * No point actually exporting it now though,
    540  1.118       sjg 	     * the child can do it at the last minute.
    541  1.118       sjg 	     */
    542  1.292    rillig 	    v->flags |= (VAR_EXPORTED | VAR_REEXPORT);
    543  1.118       sjg 	    return 1;
    544  1.118       sjg 	}
    545  1.158       sjg 	if (v->flags & VAR_IN_USE) {
    546  1.158       sjg 	    /*
    547  1.158       sjg 	     * We recursed while exporting in a child.
    548  1.158       sjg 	     * This isn't going to end well, just skip it.
    549  1.158       sjg 	     */
    550  1.158       sjg 	    return 0;
    551  1.158       sjg 	}
    552  1.118       sjg 	n = snprintf(tmp, sizeof(tmp), "${%s}", name);
    553  1.147     lukem 	if (n < (int)sizeof(tmp)) {
    554  1.259    rillig 	    val = Var_Subst(NULL, tmp, VAR_GLOBAL, VARE_WANTRES);
    555  1.118       sjg 	    setenv(name, val, 1);
    556  1.118       sjg 	    free(val);
    557  1.118       sjg 	}
    558  1.118       sjg     } else {
    559  1.292    rillig 	if (parent)
    560  1.152       sjg 	    v->flags &= ~VAR_REEXPORT;	/* once will do */
    561  1.292    rillig 	if (parent || !(v->flags & VAR_EXPORTED))
    562  1.118       sjg 	    setenv(name, val, 1);
    563  1.118       sjg     }
    564  1.118       sjg     /*
    565  1.118       sjg      * This is so Var_Set knows to call Var_Export again...
    566  1.118       sjg      */
    567  1.152       sjg     if (parent) {
    568  1.152       sjg 	v->flags |= VAR_EXPORTED;
    569  1.152       sjg     }
    570  1.118       sjg     return 1;
    571  1.118       sjg }
    572  1.118       sjg 
    573  1.241    rillig static void
    574  1.241    rillig Var_ExportVars_callback(void *entry, void *unused MAKE_ATTR_UNUSED)
    575  1.241    rillig {
    576  1.242    rillig     Var *var = entry;
    577  1.242    rillig     Var_Export1(var->name, 0);
    578  1.241    rillig }
    579  1.241    rillig 
    580  1.118       sjg /*
    581  1.118       sjg  * This gets called from our children.
    582  1.118       sjg  */
    583  1.118       sjg void
    584  1.118       sjg Var_ExportVars(void)
    585  1.118       sjg {
    586  1.118       sjg     char tmp[BUFSIZ];
    587  1.118       sjg     char *val;
    588  1.118       sjg     int n;
    589  1.118       sjg 
    590  1.182  christos     /*
    591  1.182  christos      * Several make's support this sort of mechanism for tracking
    592  1.182  christos      * recursion - but each uses a different name.
    593  1.182  christos      * We allow the makefiles to update MAKELEVEL and ensure
    594  1.182  christos      * children see a correctly incremented value.
    595  1.182  christos      */
    596  1.182  christos     snprintf(tmp, sizeof(tmp), "%d", makelevel + 1);
    597  1.182  christos     setenv(MAKE_LEVEL_ENV, tmp, 1);
    598  1.182  christos 
    599  1.118       sjg     if (VAR_EXPORTED_NONE == var_exportedVars)
    600  1.118       sjg 	return;
    601  1.118       sjg 
    602  1.118       sjg     if (VAR_EXPORTED_ALL == var_exportedVars) {
    603  1.241    rillig 	/* Ouch! This is crazy... */
    604  1.241    rillig 	Hash_ForEach(&VAR_GLOBAL->context, Var_ExportVars_callback, NULL);
    605  1.118       sjg 	return;
    606  1.118       sjg     }
    607  1.118       sjg     /*
    608  1.118       sjg      * We have a number of exported vars,
    609  1.118       sjg      */
    610  1.118       sjg     n = snprintf(tmp, sizeof(tmp), "${" MAKE_EXPORTED ":O:u}");
    611  1.147     lukem     if (n < (int)sizeof(tmp)) {
    612  1.118       sjg 	char **av;
    613  1.118       sjg 	char *as;
    614  1.127  christos 	int ac;
    615  1.118       sjg 	int i;
    616  1.142       dsl 
    617  1.259    rillig 	val = Var_Subst(NULL, tmp, VAR_GLOBAL, VARE_WANTRES);
    618  1.200       sjg 	if (*val) {
    619  1.200       sjg 	    av = brk_string(val, &ac, FALSE, &as);
    620  1.257    rillig 	    for (i = 0; i < ac; i++)
    621  1.200       sjg 		Var_Export1(av[i], 0);
    622  1.200       sjg 	    free(as);
    623  1.200       sjg 	    free(av);
    624  1.118       sjg 	}
    625  1.118       sjg 	free(val);
    626  1.118       sjg     }
    627  1.118       sjg }
    628  1.118       sjg 
    629  1.118       sjg /*
    630  1.118       sjg  * This is called when .export is seen or
    631  1.118       sjg  * .MAKE.EXPORTED is modified.
    632  1.118       sjg  * It is also called when any exported var is modified.
    633  1.118       sjg  */
    634  1.118       sjg void
    635  1.118       sjg Var_Export(char *str, int isExport)
    636  1.118       sjg {
    637  1.118       sjg     char **av;
    638  1.118       sjg     char *as;
    639  1.302    rillig     VarExportFlags flags;
    640  1.127  christos     int ac;
    641  1.118       sjg     int i;
    642  1.118       sjg 
    643  1.118       sjg     if (isExport && (!str || !str[0])) {
    644  1.118       sjg 	var_exportedVars = VAR_EXPORTED_ALL; /* use with caution! */
    645  1.118       sjg 	return;
    646  1.118       sjg     }
    647  1.118       sjg 
    648  1.203       sjg     flags = 0;
    649  1.159       sjg     if (strncmp(str, "-env", 4) == 0) {
    650  1.159       sjg 	str += 4;
    651  1.203       sjg     } else if (strncmp(str, "-literal", 8) == 0) {
    652  1.203       sjg 	str += 8;
    653  1.203       sjg 	flags |= VAR_EXPORT_LITERAL;
    654  1.159       sjg     } else {
    655  1.203       sjg 	flags |= VAR_EXPORT_PARENT;
    656  1.159       sjg     }
    657  1.302    rillig 
    658  1.302    rillig     char *val = Var_Subst(NULL, str, VAR_GLOBAL, VARE_WANTRES);
    659  1.200       sjg     if (*val) {
    660  1.200       sjg 	av = brk_string(val, &ac, FALSE, &as);
    661  1.200       sjg 	for (i = 0; i < ac; i++) {
    662  1.302    rillig 	    const char *name = av[i];
    663  1.200       sjg 	    if (!name[1]) {
    664  1.200       sjg 		/*
    665  1.200       sjg 		 * A single char.
    666  1.200       sjg 		 * If it is one of the vars that should only appear in
    667  1.200       sjg 		 * local context, skip it, else we can get Var_Subst
    668  1.200       sjg 		 * into a loop.
    669  1.200       sjg 		 */
    670  1.200       sjg 		switch (name[0]) {
    671  1.200       sjg 		case '@':
    672  1.200       sjg 		case '%':
    673  1.200       sjg 		case '*':
    674  1.200       sjg 		case '!':
    675  1.200       sjg 		    continue;
    676  1.200       sjg 		}
    677  1.118       sjg 	    }
    678  1.203       sjg 	    if (Var_Export1(name, flags)) {
    679  1.200       sjg 		if (VAR_EXPORTED_ALL != var_exportedVars)
    680  1.200       sjg 		    var_exportedVars = VAR_EXPORTED_YES;
    681  1.203       sjg 		if (isExport && (flags & VAR_EXPORT_PARENT)) {
    682  1.200       sjg 		    Var_Append(MAKE_EXPORTED, name, VAR_GLOBAL);
    683  1.200       sjg 		}
    684  1.118       sjg 	    }
    685  1.118       sjg 	}
    686  1.200       sjg 	free(as);
    687  1.200       sjg 	free(av);
    688  1.118       sjg     }
    689  1.118       sjg     free(val);
    690  1.118       sjg }
    691  1.118       sjg 
    692  1.155       sjg 
    693  1.257    rillig extern char **environ;
    694  1.257    rillig 
    695  1.155       sjg /*
    696  1.155       sjg  * This is called when .unexport[-env] is seen.
    697  1.155       sjg  */
    698  1.155       sjg void
    699  1.155       sjg Var_UnExport(char *str)
    700  1.155       sjg {
    701  1.155       sjg     char tmp[BUFSIZ];
    702  1.155       sjg     char *vlist;
    703  1.155       sjg     char *cp;
    704  1.155       sjg     Boolean unexport_env;
    705  1.155       sjg     int n;
    706  1.155       sjg 
    707  1.257    rillig     if (str == NULL || str[0] == '\0')
    708  1.242    rillig 	return;			/* assert? */
    709  1.155       sjg 
    710  1.155       sjg     vlist = NULL;
    711  1.155       sjg 
    712  1.155       sjg     str += 8;
    713  1.155       sjg     unexport_env = (strncmp(str, "-env", 4) == 0);
    714  1.155       sjg     if (unexport_env) {
    715  1.155       sjg 	char **newenv;
    716  1.155       sjg 
    717  1.179       sjg 	cp = getenv(MAKE_LEVEL_ENV);	/* we should preserve this */
    718  1.170       sjg 	if (environ == savedEnv) {
    719  1.155       sjg 	    /* we have been here before! */
    720  1.155       sjg 	    newenv = bmake_realloc(environ, 2 * sizeof(char *));
    721  1.155       sjg 	} else {
    722  1.170       sjg 	    if (savedEnv) {
    723  1.170       sjg 		free(savedEnv);
    724  1.170       sjg 		savedEnv = NULL;
    725  1.155       sjg 	    }
    726  1.155       sjg 	    newenv = bmake_malloc(2 * sizeof(char *));
    727  1.155       sjg 	}
    728  1.155       sjg 	if (!newenv)
    729  1.155       sjg 	    return;
    730  1.155       sjg 	/* Note: we cannot safely free() the original environ. */
    731  1.170       sjg 	environ = savedEnv = newenv;
    732  1.155       sjg 	newenv[0] = NULL;
    733  1.155       sjg 	newenv[1] = NULL;
    734  1.221       sjg 	if (cp && *cp)
    735  1.221       sjg 	    setenv(MAKE_LEVEL_ENV, cp, 1);
    736  1.155       sjg     } else {
    737  1.155       sjg 	for (; *str != '\n' && isspace((unsigned char) *str); str++)
    738  1.155       sjg 	    continue;
    739  1.155       sjg 	if (str[0] && str[0] != '\n') {
    740  1.155       sjg 	    vlist = str;
    741  1.155       sjg 	}
    742  1.155       sjg     }
    743  1.155       sjg 
    744  1.155       sjg     if (!vlist) {
    745  1.155       sjg 	/* Using .MAKE.EXPORTED */
    746  1.257    rillig 	vlist = Var_Subst(NULL, "${" MAKE_EXPORTED ":O:u}", VAR_GLOBAL,
    747  1.259    rillig 			  VARE_WANTRES);
    748  1.155       sjg     }
    749  1.155       sjg     if (vlist) {
    750  1.155       sjg 	Var *v;
    751  1.155       sjg 	char **av;
    752  1.155       sjg 	char *as;
    753  1.155       sjg 	int ac;
    754  1.155       sjg 	int i;
    755  1.155       sjg 
    756  1.155       sjg 	av = brk_string(vlist, &ac, FALSE, &as);
    757  1.155       sjg 	for (i = 0; i < ac; i++) {
    758  1.155       sjg 	    v = VarFind(av[i], VAR_GLOBAL, 0);
    759  1.155       sjg 	    if (!v)
    760  1.155       sjg 		continue;
    761  1.155       sjg 	    if (!unexport_env &&
    762  1.292    rillig 		(v->flags & (VAR_EXPORTED | VAR_REEXPORT)) == VAR_EXPORTED)
    763  1.155       sjg 		unsetenv(v->name);
    764  1.292    rillig 	    v->flags &= ~(VAR_EXPORTED | VAR_REEXPORT);
    765  1.155       sjg 	    /*
    766  1.155       sjg 	     * If we are unexporting a list,
    767  1.155       sjg 	     * remove each one from .MAKE.EXPORTED.
    768  1.155       sjg 	     * If we are removing them all,
    769  1.155       sjg 	     * just delete .MAKE.EXPORTED below.
    770  1.155       sjg 	     */
    771  1.155       sjg 	    if (vlist == str) {
    772  1.155       sjg 		n = snprintf(tmp, sizeof(tmp),
    773  1.155       sjg 			     "${" MAKE_EXPORTED ":N%s}", v->name);
    774  1.155       sjg 		if (n < (int)sizeof(tmp)) {
    775  1.259    rillig 		    cp = Var_Subst(NULL, tmp, VAR_GLOBAL, VARE_WANTRES);
    776  1.230    rillig 		    Var_Set(MAKE_EXPORTED, cp, VAR_GLOBAL);
    777  1.155       sjg 		    free(cp);
    778  1.155       sjg 		}
    779  1.155       sjg 	    }
    780  1.155       sjg 	}
    781  1.155       sjg 	free(as);
    782  1.155       sjg 	free(av);
    783  1.155       sjg 	if (vlist != str) {
    784  1.155       sjg 	    Var_Delete(MAKE_EXPORTED, VAR_GLOBAL);
    785  1.155       sjg 	    free(vlist);
    786  1.155       sjg 	}
    787  1.155       sjg     }
    788  1.155       sjg }
    789  1.155       sjg 
    790  1.230    rillig static void
    791  1.242    rillig Var_Set_with_flags(const char *name, const char *val, GNode *ctxt,
    792  1.242    rillig 		   VarSet_Flags flags)
    793    1.1       cgd {
    794  1.249    rillig     Var *v;
    795  1.139       dsl     char *expanded_name = NULL;
    796  1.142       dsl 
    797    1.1       cgd     /*
    798    1.1       cgd      * We only look for a variable in the given context since anything set
    799    1.1       cgd      * here will override anything in a lower context, so there's not much
    800    1.1       cgd      * point in searching them all just to save a bit of memory...
    801    1.1       cgd      */
    802  1.139       dsl     if (strchr(name, '$') != NULL) {
    803  1.259    rillig 	expanded_name = Var_Subst(NULL, name, ctxt, VARE_WANTRES);
    804  1.257    rillig 	if (expanded_name[0] == '\0') {
    805  1.139       dsl 	    if (DEBUG(VAR)) {
    806  1.139       dsl 		fprintf(debug_file, "Var_Set(\"%s\", \"%s\", ...) "
    807  1.139       dsl 			"name expands to empty string - ignored\n",
    808  1.139       dsl 			name, val);
    809  1.139       dsl 	    }
    810  1.139       dsl 	    free(expanded_name);
    811  1.139       dsl 	    return;
    812  1.139       dsl 	}
    813  1.139       dsl 	name = expanded_name;
    814  1.139       dsl     }
    815  1.129       sjg     if (ctxt == VAR_GLOBAL) {
    816  1.129       sjg 	v = VarFind(name, VAR_CMD, 0);
    817  1.136       dsl 	if (v != NULL) {
    818  1.131       sjg 	    if ((v->flags & VAR_FROM_CMD)) {
    819  1.131       sjg 		if (DEBUG(VAR)) {
    820  1.131       sjg 		    fprintf(debug_file, "%s:%s = %s ignored!\n", ctxt->name, name, val);
    821  1.131       sjg 		}
    822  1.131       sjg 		goto out;
    823  1.131       sjg 	    }
    824  1.131       sjg 	    VarFreeEnv(v, TRUE);
    825  1.129       sjg 	}
    826  1.129       sjg     }
    827   1.92  christos     v = VarFind(name, ctxt, 0);
    828  1.136       dsl     if (v == NULL) {
    829  1.183       sjg 	if (ctxt == VAR_CMD && (flags & VAR_NO_EXPORT) == 0) {
    830  1.183       sjg 	    /*
    831  1.183       sjg 	     * This var would normally prevent the same name being added
    832  1.183       sjg 	     * to VAR_GLOBAL, so delete it from there if needed.
    833  1.183       sjg 	     * Otherwise -V name may show the wrong value.
    834  1.183       sjg 	     */
    835  1.183       sjg 	    Var_Delete(name, VAR_GLOBAL);
    836  1.183       sjg 	}
    837   1.92  christos 	VarAdd(name, val, ctxt);
    838    1.1       cgd     } else {
    839  1.146       dsl 	Buf_Empty(&v->val);
    840  1.218       sjg 	if (val)
    841  1.218       sjg 	    Buf_AddBytes(&v->val, strlen(val), val);
    842    1.1       cgd 
    843    1.1       cgd 	if (DEBUG(VAR)) {
    844  1.114       dsl 	    fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
    845    1.1       cgd 	}
    846  1.118       sjg 	if ((v->flags & VAR_EXPORTED)) {
    847  1.152       sjg 	    Var_Export1(name, VAR_EXPORT_PARENT);
    848  1.118       sjg 	}
    849    1.1       cgd     }
    850    1.1       cgd     /*
    851    1.1       cgd      * Any variables given on the command line are automatically exported
    852    1.1       cgd      * to the environment (as per POSIX standard)
    853    1.1       cgd      */
    854   1.65       sjg     if (ctxt == VAR_CMD && (flags & VAR_NO_EXPORT) == 0) {
    855  1.136       dsl 	if (v == NULL) {
    856  1.131       sjg 	    /* we just added it */
    857  1.131       sjg 	    v = VarFind(name, ctxt, 0);
    858  1.131       sjg 	}
    859  1.151  christos 	if (v != NULL)
    860  1.150  christos 	    v->flags |= VAR_FROM_CMD;
    861   1.71   thorpej 	/*
    862   1.71   thorpej 	 * If requested, don't export these in the environment
    863   1.71   thorpej 	 * individually.  We still put them in MAKEOVERRIDES so
    864   1.71   thorpej 	 * that the command-line settings continue to override
    865   1.71   thorpej 	 * Makefile settings.
    866   1.71   thorpej 	 */
    867   1.71   thorpej 	if (varNoExportEnv != TRUE)
    868  1.218       sjg 	    setenv(name, val ? val : "", 1);
    869   1.62       sjg 
    870   1.64       sjg 	Var_Append(MAKEOVERRIDES, name, VAR_GLOBAL);
    871    1.1       cgd     }
    872  1.292    rillig     if (name[0] == '.' && strcmp(name, SAVE_DOLLARS) == 0)
    873  1.292    rillig 	save_dollars = s2Boolean(val, save_dollars);
    874  1.205       sjg 
    875  1.242    rillig out:
    876  1.196  christos     free(expanded_name);
    877  1.136       dsl     if (v != NULL)
    878  1.107  christos 	VarFreeEnv(v, TRUE);
    879    1.1       cgd }
    880    1.1       cgd 
    881    1.1       cgd /*-
    882    1.1       cgd  *-----------------------------------------------------------------------
    883  1.230    rillig  * Var_Set --
    884  1.230    rillig  *	Set the variable name to the value val in the given context.
    885  1.230    rillig  *
    886  1.230    rillig  * Input:
    887  1.230    rillig  *	name		name of variable to set
    888  1.230    rillig  *	val		value to give to the variable
    889  1.230    rillig  *	ctxt		context in which to set it
    890  1.230    rillig  *
    891  1.230    rillig  * Side Effects:
    892  1.230    rillig  *	If the variable doesn't yet exist, a new record is created for it.
    893  1.230    rillig  *	Else the old value is freed and the new one stuck in its place
    894  1.230    rillig  *
    895  1.230    rillig  * Notes:
    896  1.230    rillig  *	The variable is searched for only in its context before being
    897  1.230    rillig  *	created in that context. I.e. if the context is VAR_GLOBAL,
    898  1.230    rillig  *	only VAR_GLOBAL->context is searched. Likewise if it is VAR_CMD, only
    899  1.230    rillig  *	VAR_CMD->context is searched. This is done to avoid the literally
    900  1.230    rillig  *	thousands of unnecessary strcmp's that used to be done to
    901  1.230    rillig  *	set, say, $(@) or $(<).
    902  1.230    rillig  *	If the context is VAR_GLOBAL though, we check if the variable
    903  1.230    rillig  *	was set in VAR_CMD from the command line and skip it if so.
    904  1.230    rillig  *-----------------------------------------------------------------------
    905  1.230    rillig  */
    906  1.230    rillig void
    907  1.230    rillig Var_Set(const char *name, const char *val, GNode *ctxt)
    908  1.230    rillig {
    909  1.242    rillig     Var_Set_with_flags(name, val, ctxt, 0);
    910  1.230    rillig }
    911  1.230    rillig 
    912  1.230    rillig /*-
    913  1.230    rillig  *-----------------------------------------------------------------------
    914    1.1       cgd  * Var_Append --
    915    1.1       cgd  *	The variable of the given name has the given value appended to it in
    916    1.1       cgd  *	the given context.
    917    1.1       cgd  *
    918   1.70       wiz  * Input:
    919   1.70       wiz  *	name		name of variable to modify
    920   1.70       wiz  *	val		String to append to it
    921   1.70       wiz  *	ctxt		Context in which this should occur
    922   1.70       wiz  *
    923    1.1       cgd  * Side Effects:
    924    1.1       cgd  *	If the variable doesn't exist, it is created. Else the strings
    925    1.1       cgd  *	are concatenated (with a space in between).
    926    1.1       cgd  *
    927    1.1       cgd  * Notes:
    928    1.1       cgd  *	Only if the variable is being sought in the global context is the
    929    1.1       cgd  *	environment searched.
    930    1.1       cgd  *	XXX: Knows its calling circumstances in that if called with ctxt
    931    1.1       cgd  *	an actual target, it will only search that context since only
    932    1.1       cgd  *	a local variable could be being appended to. This is actually
    933    1.1       cgd  *	a big win and must be tolerated.
    934    1.1       cgd  *-----------------------------------------------------------------------
    935    1.1       cgd  */
    936    1.1       cgd void
    937   1.73  christos Var_Append(const char *name, const char *val, GNode *ctxt)
    938    1.1       cgd {
    939  1.249    rillig     Var *v;
    940  1.249    rillig     Hash_Entry *h;
    941  1.139       dsl     char *expanded_name = NULL;
    942    1.1       cgd 
    943  1.139       dsl     if (strchr(name, '$') != NULL) {
    944  1.259    rillig 	expanded_name = Var_Subst(NULL, name, ctxt, VARE_WANTRES);
    945  1.257    rillig 	if (expanded_name[0] == '\0') {
    946  1.139       dsl 	    if (DEBUG(VAR)) {
    947  1.139       dsl 		fprintf(debug_file, "Var_Append(\"%s\", \"%s\", ...) "
    948  1.139       dsl 			"name expands to empty string - ignored\n",
    949  1.139       dsl 			name, val);
    950  1.139       dsl 	    }
    951  1.139       dsl 	    free(expanded_name);
    952  1.139       dsl 	    return;
    953  1.139       dsl 	}
    954  1.139       dsl 	name = expanded_name;
    955  1.139       dsl     }
    956  1.142       dsl 
    957  1.260    rillig     v = VarFind(name, ctxt, ctxt == VAR_GLOBAL ? (FIND_CMD | FIND_ENV) : 0);
    958    1.1       cgd 
    959  1.136       dsl     if (v == NULL) {
    960  1.230    rillig 	Var_Set(name, val, ctxt);
    961  1.217       sjg     } else if (ctxt == VAR_CMD || !(v->flags & VAR_FROM_CMD)) {
    962  1.146       dsl 	Buf_AddByte(&v->val, ' ');
    963  1.146       dsl 	Buf_AddBytes(&v->val, strlen(val), val);
    964    1.1       cgd 
    965    1.1       cgd 	if (DEBUG(VAR)) {
    966  1.114       dsl 	    fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name,
    967  1.242    rillig 		    Buf_GetAll(&v->val, NULL));
    968    1.1       cgd 	}
    969    1.1       cgd 
    970    1.1       cgd 	if (v->flags & VAR_FROM_ENV) {
    971    1.1       cgd 	    /*
    972    1.1       cgd 	     * If the original variable came from the environment, we
    973    1.1       cgd 	     * have to install it in the global context (we could place
    974    1.1       cgd 	     * it in the environment, but then we should provide a way to
    975    1.1       cgd 	     * export other variables...)
    976    1.1       cgd 	     */
    977    1.1       cgd 	    v->flags &= ~VAR_FROM_ENV;
    978   1.92  christos 	    h = Hash_CreateEntry(&ctxt->context, name, NULL);
    979   1.36   mycroft 	    Hash_SetValue(h, v);
    980    1.1       cgd 	}
    981    1.1       cgd     }
    982  1.196  christos     free(expanded_name);
    983    1.1       cgd }
    984    1.1       cgd 
    985    1.1       cgd /*-
    986    1.1       cgd  *-----------------------------------------------------------------------
    987    1.1       cgd  * Var_Exists --
    988    1.1       cgd  *	See if the given variable exists.
    989    1.1       cgd  *
    990   1.70       wiz  * Input:
    991   1.70       wiz  *	name		Variable to find
    992   1.70       wiz  *	ctxt		Context in which to start search
    993   1.70       wiz  *
    994    1.1       cgd  * Results:
    995    1.1       cgd  *	TRUE if it does, FALSE if it doesn't
    996    1.1       cgd  *
    997    1.1       cgd  * Side Effects:
    998    1.1       cgd  *	None.
    999    1.1       cgd  *
   1000    1.1       cgd  *-----------------------------------------------------------------------
   1001    1.1       cgd  */
   1002    1.1       cgd Boolean
   1003   1.73  christos Var_Exists(const char *name, GNode *ctxt)
   1004    1.1       cgd {
   1005  1.138       dsl     Var		  *v;
   1006  1.128       sjg     char          *cp;
   1007    1.1       cgd 
   1008  1.257    rillig     if ((cp = strchr(name, '$')) != NULL)
   1009  1.259    rillig 	cp = Var_Subst(NULL, name, ctxt, VARE_WANTRES);
   1010  1.260    rillig     v = VarFind(cp ? cp : name, ctxt, FIND_CMD | FIND_GLOBAL | FIND_ENV);
   1011  1.196  christos     free(cp);
   1012  1.257    rillig     if (v == NULL)
   1013  1.231    rillig 	return FALSE;
   1014  1.231    rillig 
   1015  1.231    rillig     (void)VarFreeEnv(v, TRUE);
   1016  1.231    rillig     return TRUE;
   1017    1.1       cgd }
   1018    1.1       cgd 
   1019    1.1       cgd /*-
   1020    1.1       cgd  *-----------------------------------------------------------------------
   1021    1.1       cgd  * Var_Value --
   1022    1.1       cgd  *	Return the value of the named variable in the given context
   1023    1.1       cgd  *
   1024   1.70       wiz  * Input:
   1025   1.70       wiz  *	name		name to find
   1026   1.70       wiz  *	ctxt		context in which to search for it
   1027   1.70       wiz  *
   1028    1.1       cgd  * Results:
   1029    1.1       cgd  *	The value if the variable exists, NULL if it doesn't
   1030    1.1       cgd  *
   1031    1.1       cgd  * Side Effects:
   1032    1.1       cgd  *	None
   1033    1.1       cgd  *-----------------------------------------------------------------------
   1034    1.1       cgd  */
   1035    1.1       cgd char *
   1036   1.73  christos Var_Value(const char *name, GNode *ctxt, char **frp)
   1037    1.1       cgd {
   1038  1.257    rillig     Var *v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
   1039    1.6       jtc     *frp = NULL;
   1040  1.231    rillig     if (v == NULL)
   1041  1.136       dsl 	return NULL;
   1042  1.231    rillig 
   1043  1.257    rillig     char *p = Buf_GetAll(&v->val, NULL);
   1044  1.231    rillig     if (VarFreeEnv(v, FALSE))
   1045  1.231    rillig 	*frp = p;
   1046  1.231    rillig     return p;
   1047    1.1       cgd }
   1048    1.1       cgd 
   1049  1.244    rillig 
   1050  1.278    rillig /* SepBuf is a string being built from "words", interleaved with separators. */
   1051  1.278    rillig typedef struct {
   1052  1.278    rillig     Buffer buf;
   1053  1.278    rillig     Boolean needSep;
   1054  1.278    rillig     char sep;
   1055  1.278    rillig } SepBuf;
   1056  1.278    rillig 
   1057  1.278    rillig static void
   1058  1.278    rillig SepBuf_Init(SepBuf *buf, char sep)
   1059  1.278    rillig {
   1060  1.278    rillig     Buf_Init(&buf->buf, 32 /* bytes */);
   1061  1.278    rillig     buf->needSep = FALSE;
   1062  1.278    rillig     buf->sep = sep;
   1063  1.278    rillig }
   1064  1.278    rillig 
   1065  1.278    rillig static void
   1066  1.278    rillig SepBuf_Sep(SepBuf *buf)
   1067  1.278    rillig {
   1068  1.278    rillig     buf->needSep = TRUE;
   1069  1.278    rillig }
   1070  1.278    rillig 
   1071  1.278    rillig static void
   1072  1.278    rillig SepBuf_AddBytes(SepBuf *buf, const void *mem, size_t mem_size)
   1073  1.278    rillig {
   1074  1.278    rillig     if (mem_size == 0)
   1075  1.278    rillig 	return;
   1076  1.278    rillig     if (buf->needSep && buf->sep != '\0') {
   1077  1.278    rillig 	Buf_AddByte(&buf->buf, buf->sep);
   1078  1.278    rillig 	buf->needSep = FALSE;
   1079  1.278    rillig     }
   1080  1.278    rillig     Buf_AddBytes(&buf->buf, mem_size, mem);
   1081  1.278    rillig }
   1082  1.278    rillig 
   1083  1.278    rillig static char *
   1084  1.278    rillig SepBuf_Destroy(SepBuf *buf, Boolean free_buf)
   1085  1.278    rillig {
   1086  1.278    rillig     return Buf_Destroy(&buf->buf, free_buf);
   1087  1.278    rillig }
   1088  1.278    rillig 
   1089  1.278    rillig 
   1090  1.291    rillig /* This callback for ModifyWords gets a single word from an expression and
   1091  1.244    rillig  * typically adds a modification of this word to the buffer. It may also do
   1092  1.278    rillig  * nothing or add several words. */
   1093  1.295    rillig typedef void (*ModifyWordsCallback)(const char *word, SepBuf *buf, void *data);
   1094  1.244    rillig 
   1095  1.244    rillig 
   1096  1.291    rillig /* Callback for ModifyWords to implement the :H modifier.
   1097  1.244    rillig  * Add the dirname of the given word to the buffer. */
   1098  1.278    rillig static void
   1099  1.295    rillig ModifyWord_Head(const char *word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED)
   1100    1.1       cgd {
   1101  1.238    rillig     const char *slash = strrchr(word, '/');
   1102  1.238    rillig     if (slash != NULL)
   1103  1.278    rillig 	SepBuf_AddBytes(buf, word, slash - word);
   1104  1.238    rillig     else
   1105  1.278    rillig 	SepBuf_AddBytes(buf, ".", 1);
   1106    1.1       cgd }
   1107    1.1       cgd 
   1108  1.291    rillig /* Callback for ModifyWords to implement the :T modifier.
   1109  1.244    rillig  * Add the basename of the given word to the buffer. */
   1110  1.278    rillig static void
   1111  1.295    rillig ModifyWord_Tail(const char *word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED)
   1112    1.1       cgd {
   1113  1.238    rillig     const char *slash = strrchr(word, '/');
   1114  1.238    rillig     const char *base = slash != NULL ? slash + 1 : word;
   1115  1.278    rillig     SepBuf_AddBytes(buf, base, strlen(base));
   1116    1.1       cgd }
   1117    1.1       cgd 
   1118  1.291    rillig /* Callback for ModifyWords to implement the :E modifier.
   1119  1.244    rillig  * Add the filename suffix of the given word to the buffer, if it exists. */
   1120  1.278    rillig static void
   1121  1.295    rillig ModifyWord_Suffix(const char *word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED)
   1122    1.1       cgd {
   1123  1.239    rillig     const char *dot = strrchr(word, '.');
   1124  1.278    rillig     if (dot != NULL)
   1125  1.278    rillig 	SepBuf_AddBytes(buf, dot + 1, strlen(dot + 1));
   1126    1.1       cgd }
   1127    1.1       cgd 
   1128  1.291    rillig /* Callback for ModifyWords to implement the :R modifier.
   1129  1.291    rillig  * Add the basename of the given word to the buffer. */
   1130  1.278    rillig static void
   1131  1.295    rillig ModifyWord_Root(const char *word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED)
   1132    1.1       cgd {
   1133  1.239    rillig     char *dot = strrchr(word, '.');
   1134  1.247     lukem     size_t len = dot != NULL ? (size_t)(dot - word) : strlen(word);
   1135  1.278    rillig     SepBuf_AddBytes(buf, word, len);
   1136    1.1       cgd }
   1137    1.1       cgd 
   1138  1.291    rillig /* Callback for ModifyWords to implement the :M modifier.
   1139  1.244    rillig  * Place the word in the buffer if it matches the given pattern. */
   1140  1.278    rillig static void
   1141  1.295    rillig ModifyWord_Match(const char *word, SepBuf *buf, void *data)
   1142    1.1       cgd {
   1143  1.244    rillig     const char *pattern = data;
   1144  1.137  christos     if (DEBUG(VAR))
   1145  1.244    rillig 	fprintf(debug_file, "VarMatch [%s] [%s]\n", word, pattern);
   1146  1.278    rillig     if (Str_Match(word, pattern))
   1147  1.278    rillig 	SepBuf_AddBytes(buf, word, strlen(word));
   1148    1.1       cgd }
   1149    1.1       cgd 
   1150  1.291    rillig /* Callback for ModifyWords to implement the :N modifier.
   1151  1.291    rillig  * Place the word in the buffer if it doesn't match the given pattern. */
   1152  1.291    rillig static void
   1153  1.295    rillig ModifyWord_NoMatch(const char *word, SepBuf *buf, void *data)
   1154  1.291    rillig {
   1155  1.291    rillig     const char *pattern = data;
   1156  1.291    rillig     if (!Str_Match(word, pattern))
   1157  1.291    rillig 	SepBuf_AddBytes(buf, word, strlen(word));
   1158  1.291    rillig }
   1159  1.291    rillig 
   1160   1.13  christos #ifdef SYSVVARSUB
   1161  1.256    rillig /*-
   1162  1.256    rillig  *-----------------------------------------------------------------------
   1163  1.256    rillig  * Str_SYSVMatch --
   1164  1.256    rillig  *	Check word against pattern for a match (% is wild),
   1165  1.256    rillig  *
   1166  1.256    rillig  * Input:
   1167  1.256    rillig  *	word		Word to examine
   1168  1.256    rillig  *	pattern		Pattern to examine against
   1169  1.256    rillig  *	len		Number of characters to substitute
   1170  1.256    rillig  *
   1171  1.256    rillig  * Results:
   1172  1.256    rillig  *	Returns the beginning position of a match or null. The number
   1173  1.256    rillig  *	of characters matched is returned in len.
   1174  1.256    rillig  *-----------------------------------------------------------------------
   1175  1.256    rillig  */
   1176  1.277    rillig static const char *
   1177  1.256    rillig Str_SYSVMatch(const char *word, const char *pattern, size_t *len,
   1178  1.256    rillig     Boolean *hasPercent)
   1179  1.256    rillig {
   1180  1.256    rillig     const char *p = pattern;
   1181  1.256    rillig     const char *w = word;
   1182  1.256    rillig     const char *m;
   1183  1.256    rillig 
   1184  1.256    rillig     *hasPercent = FALSE;
   1185  1.256    rillig     if (*p == '\0') {
   1186  1.256    rillig 	/* Null pattern is the whole string */
   1187  1.256    rillig 	*len = strlen(w);
   1188  1.277    rillig 	return w;
   1189  1.256    rillig     }
   1190  1.256    rillig 
   1191  1.256    rillig     if ((m = strchr(p, '%')) != NULL) {
   1192  1.256    rillig 	*hasPercent = TRUE;
   1193  1.256    rillig 	if (*w == '\0') {
   1194  1.256    rillig 		/* empty word does not match pattern */
   1195  1.256    rillig 		return NULL;
   1196  1.256    rillig 	}
   1197  1.256    rillig 	/* check that the prefix matches */
   1198  1.256    rillig 	for (; p != m && *w && *w == *p; w++, p++)
   1199  1.256    rillig 	     continue;
   1200  1.256    rillig 
   1201  1.256    rillig 	if (p != m)
   1202  1.256    rillig 	    return NULL;	/* No match */
   1203  1.256    rillig 
   1204  1.256    rillig 	if (*++p == '\0') {
   1205  1.256    rillig 	    /* No more pattern, return the rest of the string */
   1206  1.256    rillig 	    *len = strlen(w);
   1207  1.277    rillig 	    return w;
   1208  1.256    rillig 	}
   1209  1.256    rillig     }
   1210  1.256    rillig 
   1211  1.256    rillig     m = w;
   1212  1.256    rillig 
   1213  1.256    rillig     /* Find a matching tail */
   1214  1.277    rillig     do {
   1215  1.256    rillig 	if (strcmp(p, w) == 0) {
   1216  1.256    rillig 	    *len = w - m;
   1217  1.277    rillig 	    return m;
   1218  1.256    rillig 	}
   1219  1.277    rillig     } while (*w++ != '\0');
   1220  1.256    rillig 
   1221  1.256    rillig     return NULL;
   1222  1.256    rillig }
   1223  1.256    rillig 
   1224  1.256    rillig 
   1225  1.256    rillig /*-
   1226  1.256    rillig  *-----------------------------------------------------------------------
   1227  1.256    rillig  * Str_SYSVSubst --
   1228  1.256    rillig  *	Substitute '%' on the pattern with len characters from src.
   1229  1.256    rillig  *	If the pattern does not contain a '%' prepend len characters
   1230  1.256    rillig  *	from src.
   1231  1.256    rillig  *
   1232  1.256    rillig  * Side Effects:
   1233  1.256    rillig  *	Places result on buf
   1234  1.256    rillig  *-----------------------------------------------------------------------
   1235  1.256    rillig  */
   1236  1.256    rillig static void
   1237  1.278    rillig Str_SYSVSubst(SepBuf *buf, const char *pat, const char *src, size_t len,
   1238  1.278    rillig 	      Boolean lhsHasPercent)
   1239  1.256    rillig {
   1240  1.256    rillig     const char *m;
   1241  1.256    rillig 
   1242  1.256    rillig     if ((m = strchr(pat, '%')) != NULL && lhsHasPercent) {
   1243  1.256    rillig 	/* Copy the prefix */
   1244  1.278    rillig 	SepBuf_AddBytes(buf, pat, m - pat);
   1245  1.256    rillig 	/* skip the % */
   1246  1.256    rillig 	pat = m + 1;
   1247  1.256    rillig     }
   1248  1.256    rillig     if (m != NULL || !lhsHasPercent) {
   1249  1.256    rillig 	/* Copy the pattern */
   1250  1.278    rillig 	SepBuf_AddBytes(buf, src, len);
   1251  1.256    rillig     }
   1252  1.256    rillig 
   1253  1.256    rillig     /* append the rest */
   1254  1.278    rillig     SepBuf_AddBytes(buf, pat, strlen(pat));
   1255  1.256    rillig }
   1256  1.256    rillig 
   1257  1.256    rillig 
   1258  1.276    rillig typedef struct {
   1259  1.295    rillig     GNode *ctx;
   1260  1.276    rillig     const char *lhs;
   1261  1.276    rillig     const char *rhs;
   1262  1.291    rillig } ModifyWord_SYSVSubstArgs;
   1263  1.276    rillig 
   1264  1.291    rillig /* Callback for ModifyWords to implement the :%.from=%.to modifier. */
   1265  1.278    rillig static void
   1266  1.295    rillig ModifyWord_SYSVSubst(const char *word, SepBuf *buf, void *data)
   1267    1.5       cgd {
   1268  1.291    rillig     const ModifyWord_SYSVSubstArgs *args = data;
   1269    1.5       cgd 
   1270  1.276    rillig     size_t len;
   1271  1.276    rillig     Boolean hasPercent;
   1272  1.276    rillig     const char *ptr = Str_SYSVMatch(word, args->lhs, &len, &hasPercent);
   1273  1.276    rillig     if (ptr != NULL) {
   1274  1.295    rillig 	char *varexp = Var_Subst(NULL, args->rhs, args->ctx, VARE_WANTRES);
   1275  1.223  christos 	Str_SYSVSubst(buf, varexp, ptr, len, hasPercent);
   1276   1.61  explorer 	free(varexp);
   1277   1.61  explorer     } else {
   1278  1.278    rillig 	SepBuf_AddBytes(buf, word, strlen(word));
   1279   1.61  explorer     }
   1280    1.5       cgd }
   1281   1.13  christos #endif
   1282    1.5       cgd 
   1283    1.1       cgd 
   1284  1.291    rillig typedef struct {
   1285  1.291    rillig     const char	*lhs;
   1286  1.291    rillig     size_t	lhsLen;
   1287  1.291    rillig     const char	*rhs;
   1288  1.291    rillig     size_t	rhsLen;
   1289  1.291    rillig     VarPatternFlags pflags;
   1290  1.291    rillig } ModifyWord_SubstArgs;
   1291  1.291    rillig 
   1292  1.291    rillig /* Callback for ModifyWords to implement the :S,from,to, modifier.
   1293  1.244    rillig  * Perform a string substitution on the given word. */
   1294  1.278    rillig static void
   1295  1.295    rillig ModifyWord_Subst(const char *word, SepBuf *buf, void *data)
   1296    1.1       cgd {
   1297  1.279    rillig     size_t wordLen = strlen(word);
   1298  1.291    rillig     ModifyWord_SubstArgs *args = data;
   1299  1.281    rillig     const VarPatternFlags pflags = args->pflags;
   1300    1.1       cgd 
   1301  1.279    rillig     if ((pflags & (VARP_SUB_ONE | VARP_SUB_MATCHED)) ==
   1302  1.279    rillig 	(VARP_SUB_ONE | VARP_SUB_MATCHED))
   1303  1.279    rillig 	goto nosub;
   1304  1.279    rillig 
   1305  1.288    rillig     if (args->pflags & VARP_ANCHOR_START) {
   1306  1.282    rillig 	if (wordLen < args->lhsLen ||
   1307  1.282    rillig 	    memcmp(word, args->lhs, args->lhsLen) != 0)
   1308    1.1       cgd 	    goto nosub;
   1309  1.279    rillig 
   1310  1.288    rillig 	if (args->pflags & VARP_ANCHOR_END) {
   1311  1.281    rillig 	    if (wordLen != args->lhsLen)
   1312    1.1       cgd 		goto nosub;
   1313  1.279    rillig 
   1314  1.281    rillig 	    SepBuf_AddBytes(buf, args->rhs, args->rhsLen);
   1315  1.281    rillig 	    args->pflags |= VARP_SUB_MATCHED;
   1316    1.1       cgd 	} else {
   1317  1.281    rillig 	    SepBuf_AddBytes(buf, args->rhs, args->rhsLen);
   1318  1.281    rillig 	    SepBuf_AddBytes(buf, word + args->lhsLen, wordLen - args->lhsLen);
   1319  1.281    rillig 	    args->pflags |= VARP_SUB_MATCHED;
   1320    1.1       cgd 	}
   1321  1.278    rillig 	return;
   1322    1.1       cgd     }
   1323  1.279    rillig 
   1324  1.288    rillig     if (args->pflags & VARP_ANCHOR_END) {
   1325  1.281    rillig 	if (wordLen < args->lhsLen)
   1326  1.280    rillig 	    goto nosub;
   1327  1.281    rillig 	const char *start = word + (wordLen - args->lhsLen);
   1328  1.281    rillig 	if (memcmp(start, args->lhs, args->lhsLen) != 0)
   1329  1.279    rillig 	    goto nosub;
   1330  1.279    rillig 
   1331  1.280    rillig 	SepBuf_AddBytes(buf, word, start - word);
   1332  1.281    rillig 	SepBuf_AddBytes(buf, args->rhs, args->rhsLen);
   1333  1.281    rillig 	args->pflags |= VARP_SUB_MATCHED;
   1334  1.279    rillig 	return;
   1335  1.279    rillig     }
   1336  1.279    rillig 
   1337  1.279    rillig     /* unanchored */
   1338  1.279    rillig     const char *cp;
   1339  1.281    rillig     while ((cp = Str_FindSubstring(word, args->lhs)) != NULL) {
   1340  1.279    rillig 	SepBuf_AddBytes(buf, word, cp - word);
   1341  1.281    rillig 	SepBuf_AddBytes(buf, args->rhs, args->rhsLen);
   1342  1.281    rillig 	wordLen -= (cp - word) + args->lhsLen;
   1343  1.281    rillig 	word = cp + args->lhsLen;
   1344  1.281    rillig 	if (wordLen == 0 || !(args->pflags & VARP_SUB_GLOBAL))
   1345  1.279    rillig 	    break;
   1346  1.281    rillig 	args->pflags |= VARP_SUB_MATCHED;
   1347  1.279    rillig     }
   1348  1.242    rillig nosub:
   1349  1.278    rillig     SepBuf_AddBytes(buf, word, wordLen);
   1350    1.1       cgd }
   1351    1.1       cgd 
   1352   1.31       gwr #ifndef NO_REGEX
   1353   1.16  christos /*-
   1354   1.16  christos  *-----------------------------------------------------------------------
   1355   1.16  christos  * VarREError --
   1356   1.16  christos  *	Print the error caused by a regcomp or regexec call.
   1357   1.16  christos  *
   1358   1.16  christos  * Side Effects:
   1359   1.16  christos  *	An error gets printed.
   1360   1.16  christos  *
   1361   1.16  christos  *-----------------------------------------------------------------------
   1362   1.16  christos  */
   1363   1.16  christos static void
   1364  1.202  christos VarREError(int reerr, regex_t *pat, const char *str)
   1365   1.16  christos {
   1366   1.16  christos     char *errbuf;
   1367  1.127  christos     int errlen;
   1368   1.16  christos 
   1369  1.202  christos     errlen = regerror(reerr, pat, 0, 0);
   1370  1.134     joerg     errbuf = bmake_malloc(errlen);
   1371  1.202  christos     regerror(reerr, pat, errbuf, errlen);
   1372   1.16  christos     Error("%s: %s", str, errbuf);
   1373   1.16  christos     free(errbuf);
   1374   1.16  christos }
   1375   1.16  christos 
   1376  1.291    rillig typedef struct {
   1377  1.291    rillig     regex_t	   re;
   1378  1.291    rillig     int		   nsub;
   1379  1.291    rillig     char 	  *replace;
   1380  1.291    rillig     VarPatternFlags pflags;
   1381  1.303    rillig     regmatch_t 	  matches[10];
   1382  1.291    rillig } ModifyWord_SubstRegexArgs;
   1383  1.291    rillig 
   1384  1.291    rillig /* Callback for ModifyWords to implement the :C/from/to/ modifier.
   1385  1.244    rillig  * Perform a regex substitution on the given word. */
   1386  1.278    rillig static void
   1387  1.295    rillig ModifyWord_SubstRegex(const char *word, SepBuf *buf, void *data)
   1388   1.16  christos {
   1389  1.304    rillig     ModifyWord_SubstRegexArgs *args = data;
   1390   1.16  christos     int xrv;
   1391  1.253    rillig     const char *wp = word;
   1392   1.16  christos     char *rp;
   1393   1.20  christos     int flags = 0;
   1394   1.16  christos 
   1395  1.304    rillig     if ((args->pflags & (VARP_SUB_ONE | VARP_SUB_MATCHED)) ==
   1396  1.261    rillig 	(VARP_SUB_ONE | VARP_SUB_MATCHED))
   1397   1.16  christos 	xrv = REG_NOMATCH;
   1398   1.16  christos     else {
   1399   1.16  christos     tryagain:
   1400  1.304    rillig 	xrv = regexec(&args->re, wp, args->nsub, args->matches, flags);
   1401   1.16  christos     }
   1402   1.16  christos 
   1403   1.16  christos     switch (xrv) {
   1404   1.16  christos     case 0:
   1405  1.304    rillig 	args->pflags |= VARP_SUB_MATCHED;
   1406  1.304    rillig 	SepBuf_AddBytes(buf, wp, args->matches[0].rm_so);
   1407   1.16  christos 
   1408  1.304    rillig 	for (rp = args->replace; *rp; rp++) {
   1409  1.278    rillig 	    if (*rp == '\\' && (rp[1] == '&' || rp[1] == '\\')) {
   1410  1.278    rillig 		SepBuf_AddBytes(buf, rp + 1, 1);
   1411   1.16  christos 		rp++;
   1412  1.278    rillig 	    } else if (*rp == '&' ||
   1413  1.278    rillig 		(*rp == '\\' && isdigit((unsigned char)rp[1]))) {
   1414   1.16  christos 		int n;
   1415   1.16  christos 		char errstr[3];
   1416   1.16  christos 
   1417   1.16  christos 		if (*rp == '&') {
   1418   1.16  christos 		    n = 0;
   1419   1.16  christos 		    errstr[0] = '&';
   1420   1.16  christos 		    errstr[1] = '\0';
   1421   1.16  christos 		} else {
   1422   1.16  christos 		    n = rp[1] - '0';
   1423   1.16  christos 		    errstr[0] = '\\';
   1424   1.16  christos 		    errstr[1] = rp[1];
   1425   1.16  christos 		    errstr[2] = '\0';
   1426   1.16  christos 		    rp++;
   1427   1.16  christos 		}
   1428   1.16  christos 
   1429  1.304    rillig 		if (n >= args->nsub) {
   1430  1.294    rillig 		    Error("No subexpression %s", errstr);
   1431  1.304    rillig 		} else if ((args->matches[n].rm_so == -1) &&
   1432  1.304    rillig 			   (args->matches[n].rm_eo == -1)) {
   1433  1.294    rillig 		    Error("No match for subexpression %s", errstr);
   1434  1.242    rillig 		} else {
   1435  1.304    rillig 		    const char *subbuf = wp + args->matches[n].rm_so;
   1436  1.304    rillig 		    int sublen = args->matches[n].rm_eo -
   1437  1.304    rillig 				 args->matches[n].rm_so;
   1438  1.294    rillig 		    SepBuf_AddBytes(buf, subbuf, sublen);
   1439   1.16  christos 		}
   1440   1.16  christos 
   1441   1.16  christos 	    } else {
   1442  1.278    rillig 		SepBuf_AddBytes(buf, rp, 1);
   1443   1.16  christos 	    }
   1444   1.16  christos 	}
   1445  1.304    rillig 	wp += args->matches[0].rm_eo;
   1446  1.304    rillig 	if (args->pflags & VARP_SUB_GLOBAL) {
   1447   1.20  christos 	    flags |= REG_NOTBOL;
   1448  1.304    rillig 	    if (args->matches[0].rm_so == 0 && args->matches[0].rm_eo == 0) {
   1449  1.278    rillig 		SepBuf_AddBytes(buf, wp, 1);
   1450   1.20  christos 		wp++;
   1451   1.20  christos 	    }
   1452   1.20  christos 	    if (*wp)
   1453   1.20  christos 		goto tryagain;
   1454   1.20  christos 	}
   1455   1.16  christos 	if (*wp) {
   1456  1.278    rillig 	    SepBuf_AddBytes(buf, wp, strlen(wp));
   1457   1.16  christos 	}
   1458   1.16  christos 	break;
   1459   1.16  christos     default:
   1460  1.304    rillig 	VarREError(xrv, &args->re, "Unexpected regex error");
   1461  1.242    rillig 	/* fall through */
   1462   1.16  christos     case REG_NOMATCH:
   1463  1.278    rillig 	SepBuf_AddBytes(buf, wp, strlen(wp));
   1464   1.16  christos 	break;
   1465   1.16  christos     }
   1466   1.16  christos }
   1467   1.17  christos #endif
   1468   1.16  christos 
   1469   1.16  christos 
   1470  1.291    rillig typedef struct {
   1471  1.295    rillig     GNode	*ctx;
   1472  1.291    rillig     char	*tvar;		/* name of temporary variable */
   1473  1.291    rillig     char	*str;		/* string to expand */
   1474  1.291    rillig     VarEvalFlags eflags;
   1475  1.291    rillig } ModifyWord_LoopArgs;
   1476  1.291    rillig 
   1477  1.291    rillig /* Callback for ModifyWords to implement the :@var (at) ...@ modifier of ODE make. */
   1478  1.278    rillig static void
   1479  1.295    rillig ModifyWord_Loop(const char *word, SepBuf *buf, void *data)
   1480   1.40       sjg {
   1481  1.278    rillig     if (word[0] == '\0')
   1482  1.278    rillig 	return;
   1483  1.278    rillig 
   1484  1.295    rillig     const ModifyWord_LoopArgs *args = data;
   1485  1.295    rillig     Var_Set_with_flags(args->tvar, word, args->ctx, VAR_NO_EXPORT);
   1486  1.295    rillig     char *s = Var_Subst(NULL, args->str, args->ctx, args->eflags);
   1487  1.278    rillig     if (DEBUG(VAR)) {
   1488  1.278    rillig 	fprintf(debug_file,
   1489  1.291    rillig 		"ModifyWord_Loop: in \"%s\", replace \"%s\" with \"%s\" "
   1490  1.278    rillig 		"to \"%s\"\n",
   1491  1.295    rillig 		word, args->tvar, args->str, s ? s : "(null)");
   1492  1.278    rillig     }
   1493   1.64       sjg 
   1494  1.278    rillig     if (s != NULL && s[0] != '\0') {
   1495  1.278    rillig 	if (s[0] == '\n' || (buf->buf.count > 0 &&
   1496  1.278    rillig 	    buf->buf.buffer[buf->buf.count - 1] == '\n'))
   1497  1.278    rillig 	    buf->needSep = FALSE;
   1498  1.278    rillig 	SepBuf_AddBytes(buf, s, strlen(s));
   1499   1.40       sjg     }
   1500  1.278    rillig     free(s);
   1501   1.40       sjg }
   1502   1.40       sjg 
   1503   1.81       sjg 
   1504   1.81       sjg /*-
   1505  1.291    rillig  * Implements the :[first..last] modifier.
   1506  1.292    rillig  * This is a special case of ModifyWords since we want to be able
   1507  1.291    rillig  * to scan the list backwards if first > last.
   1508   1.81       sjg  */
   1509   1.81       sjg static char *
   1510  1.301    rillig VarSelectWords(Byte sep, Boolean oneBigWord, const char *str, int first,
   1511  1.301    rillig 	       int last)
   1512   1.81       sjg {
   1513  1.278    rillig     SepBuf buf;
   1514  1.240    rillig     char **av;			/* word list */
   1515  1.240    rillig     char *as;			/* word list memory */
   1516  1.127  christos     int ac, i;
   1517   1.81       sjg     int start, end, step;
   1518  1.142       dsl 
   1519  1.301    rillig     SepBuf_Init(&buf, sep);
   1520   1.81       sjg 
   1521  1.301    rillig     if (oneBigWord) {
   1522   1.81       sjg 	/* fake what brk_string() would do if there were only one word */
   1523   1.81       sjg 	ac = 1;
   1524  1.242    rillig 	av = bmake_malloc((ac + 1) * sizeof(char *));
   1525  1.134     joerg 	as = bmake_strdup(str);
   1526   1.81       sjg 	av[0] = as;
   1527   1.81       sjg 	av[1] = NULL;
   1528   1.81       sjg     } else {
   1529   1.81       sjg 	av = brk_string(str, &ac, FALSE, &as);
   1530   1.81       sjg     }
   1531   1.81       sjg 
   1532   1.81       sjg     /*
   1533   1.81       sjg      * Now sanitize seldata.
   1534   1.81       sjg      * If seldata->start or seldata->end are negative, convert them to
   1535   1.81       sjg      * the positive equivalents (-1 gets converted to argc, -2 gets
   1536   1.81       sjg      * converted to (argc-1), etc.).
   1537   1.81       sjg      */
   1538  1.290    rillig     if (first < 0)
   1539  1.290    rillig 	first += ac + 1;
   1540  1.290    rillig     if (last < 0)
   1541  1.290    rillig 	last += ac + 1;
   1542   1.81       sjg 
   1543   1.81       sjg     /*
   1544   1.81       sjg      * We avoid scanning more of the list than we need to.
   1545   1.81       sjg      */
   1546  1.290    rillig     if (first > last) {
   1547  1.290    rillig 	start = MIN(ac, first) - 1;
   1548  1.290    rillig 	end = MAX(0, last - 1);
   1549   1.81       sjg 	step = -1;
   1550   1.81       sjg     } else {
   1551  1.290    rillig 	start = MAX(0, first - 1);
   1552  1.290    rillig 	end = MIN(ac, last);
   1553   1.81       sjg 	step = 1;
   1554   1.81       sjg     }
   1555   1.81       sjg 
   1556  1.296    rillig     for (i = start; (step < 0) == (i >= end); i += step) {
   1557  1.278    rillig 	if (av[i][0] != '\0') {
   1558  1.278    rillig 	    SepBuf_AddBytes(&buf, av[i], strlen(av[i]));
   1559  1.278    rillig 	    SepBuf_Sep(&buf);
   1560   1.81       sjg 	}
   1561   1.81       sjg     }
   1562   1.81       sjg 
   1563   1.81       sjg     free(as);
   1564   1.81       sjg     free(av);
   1565   1.81       sjg 
   1566  1.278    rillig     return SepBuf_Destroy(&buf, FALSE);
   1567   1.81       sjg }
   1568   1.81       sjg 
   1569  1.156       sjg 
   1570  1.291    rillig /* Callback for ModifyWords to implement the :tA modifier.
   1571  1.244    rillig  * Replace each word with the result of realpath() if successful. */
   1572  1.278    rillig static void
   1573  1.295    rillig ModifyWord_Realpath(const char *word, SepBuf *buf, void *data MAKE_ATTR_UNUSED)
   1574  1.156       sjg {
   1575  1.242    rillig     struct stat st;
   1576  1.242    rillig     char rbuf[MAXPATHLEN];
   1577  1.231    rillig 
   1578  1.278    rillig     char *rp = cached_realpath(word, rbuf);
   1579  1.257    rillig     if (rp != NULL && *rp == '/' && stat(rp, &st) == 0)
   1580  1.242    rillig 	word = rp;
   1581  1.231    rillig 
   1582  1.278    rillig     SepBuf_AddBytes(buf, word, strlen(word));
   1583  1.156       sjg }
   1584  1.156       sjg 
   1585    1.1       cgd /*-
   1586    1.1       cgd  *-----------------------------------------------------------------------
   1587  1.244    rillig  * Modify each of the words of the passed string using the given function.
   1588    1.1       cgd  *
   1589   1.70       wiz  * Input:
   1590  1.278    rillig  *	str		String whose words should be modified
   1591  1.291    rillig  *	modifyWord	Function that modifies a single word
   1592  1.291    rillig  *	data		Custom data for modifyWord
   1593   1.70       wiz  *
   1594    1.1       cgd  * Results:
   1595    1.1       cgd  *	A string of all the words modified appropriately.
   1596    1.1       cgd  *-----------------------------------------------------------------------
   1597    1.1       cgd  */
   1598    1.1       cgd static char *
   1599  1.301    rillig ModifyWords(GNode *ctx, Byte sep, Boolean oneBigWord,
   1600  1.291    rillig 	    const char *str, ModifyWordsCallback modifyWord, void *data)
   1601    1.1       cgd {
   1602  1.278    rillig     SepBuf result;
   1603  1.240    rillig     char **av;			/* word list */
   1604  1.240    rillig     char *as;			/* word list memory */
   1605  1.127  christos     int ac, i;
   1606    1.7       jtc 
   1607  1.301    rillig     SepBuf_Init(&result, sep);
   1608    1.1       cgd 
   1609  1.301    rillig     if (oneBigWord) {
   1610   1.81       sjg 	/* fake what brk_string() would do if there were only one word */
   1611   1.81       sjg 	ac = 1;
   1612  1.242    rillig 	av = bmake_malloc((ac + 1) * sizeof(char *));
   1613  1.134     joerg 	as = bmake_strdup(str);
   1614   1.81       sjg 	av[0] = as;
   1615   1.81       sjg 	av[1] = NULL;
   1616   1.81       sjg     } else {
   1617   1.81       sjg 	av = brk_string(str, &ac, FALSE, &as);
   1618   1.81       sjg     }
   1619    1.1       cgd 
   1620  1.255    rillig     if (DEBUG(VAR)) {
   1621  1.292    rillig 	fprintf(debug_file, "ModifyWords: split \"%s\" into %d words\n",
   1622  1.255    rillig 		str, ac);
   1623  1.255    rillig     }
   1624  1.255    rillig 
   1625  1.278    rillig     for (i = 0; i < ac; i++) {
   1626  1.278    rillig 	size_t orig_count = result.buf.count;
   1627  1.295    rillig 	modifyWord(av[i], &result, data);
   1628  1.278    rillig 	size_t count = result.buf.count;
   1629  1.278    rillig 	if (count != orig_count)
   1630  1.278    rillig 	    SepBuf_Sep(&result);
   1631  1.278    rillig     }
   1632   1.24  christos 
   1633   1.24  christos     free(as);
   1634   1.24  christos     free(av);
   1635   1.15  christos 
   1636  1.278    rillig     return SepBuf_Destroy(&result, FALSE);
   1637    1.1       cgd }
   1638    1.1       cgd 
   1639   1.35  christos 
   1640   1.35  christos static int
   1641   1.70       wiz VarWordCompare(const void *a, const void *b)
   1642   1.35  christos {
   1643  1.242    rillig     int r = strcmp(*(const char * const *)a, *(const char * const *)b);
   1644  1.242    rillig     return r;
   1645   1.35  christos }
   1646   1.35  christos 
   1647  1.224       sjg static int
   1648  1.224       sjg VarWordCompareReverse(const void *a, const void *b)
   1649  1.224       sjg {
   1650  1.242    rillig     int r = strcmp(*(const char * const *)b, *(const char * const *)a);
   1651  1.242    rillig     return r;
   1652  1.224       sjg }
   1653  1.224       sjg 
   1654   1.35  christos /*-
   1655   1.35  christos  *-----------------------------------------------------------------------
   1656   1.93       sjg  * VarOrder --
   1657   1.93       sjg  *	Order the words in the string.
   1658   1.35  christos  *
   1659   1.70       wiz  * Input:
   1660   1.93       sjg  *	str		String whose words should be sorted.
   1661   1.93       sjg  *	otype		How to order: s - sort, x - random.
   1662   1.70       wiz  *
   1663   1.35  christos  * Results:
   1664   1.93       sjg  *	A string containing the words ordered.
   1665   1.35  christos  *
   1666   1.35  christos  * Side Effects:
   1667   1.35  christos  *	None.
   1668   1.35  christos  *
   1669   1.35  christos  *-----------------------------------------------------------------------
   1670   1.35  christos  */
   1671   1.35  christos static char *
   1672   1.93       sjg VarOrder(const char *str, const char otype)
   1673   1.35  christos {
   1674  1.240    rillig     Buffer buf;			/* Buffer for the new string */
   1675  1.240    rillig     char **av;			/* word list [first word does not count] */
   1676  1.240    rillig     char *as;			/* word list memory */
   1677  1.127  christos     int ac, i;
   1678   1.35  christos 
   1679  1.146       dsl     Buf_Init(&buf, 0);
   1680   1.35  christos 
   1681   1.35  christos     av = brk_string(str, &ac, FALSE, &as);
   1682   1.35  christos 
   1683  1.240    rillig     if (ac > 0) {
   1684   1.93       sjg 	switch (otype) {
   1685  1.240    rillig 	case 'r':		/* reverse sort alphabetically */
   1686  1.224       sjg 	    qsort(av, ac, sizeof(char *), VarWordCompareReverse);
   1687  1.224       sjg 	    break;
   1688  1.240    rillig 	case 's':		/* sort alphabetically */
   1689   1.93       sjg 	    qsort(av, ac, sizeof(char *), VarWordCompare);
   1690   1.93       sjg 	    break;
   1691  1.240    rillig 	case 'x':		/* randomize */
   1692  1.240    rillig 	    {
   1693  1.240    rillig 		/*
   1694  1.240    rillig 		 * We will use [ac..2] range for mod factors. This will produce
   1695  1.240    rillig 		 * random numbers in [(ac-1)..0] interval, and minimal
   1696  1.240    rillig 		 * reasonable value for mod factor is 2 (the mod 1 will produce
   1697  1.240    rillig 		 * 0 with probability 1).
   1698  1.240    rillig 		 */
   1699  1.240    rillig 		for (i = ac - 1; i > 0; i--) {
   1700  1.240    rillig 		    int rndidx = random() % (i + 1);
   1701  1.240    rillig 		    char *t = av[i];
   1702   1.93       sjg 		    av[i] = av[rndidx];
   1703   1.93       sjg 		    av[rndidx] = t;
   1704   1.93       sjg 		}
   1705   1.93       sjg 	    }
   1706   1.93       sjg 	}
   1707  1.240    rillig     }
   1708   1.35  christos 
   1709   1.35  christos     for (i = 0; i < ac; i++) {
   1710  1.146       dsl 	Buf_AddBytes(&buf, strlen(av[i]), av[i]);
   1711   1.35  christos 	if (i != ac - 1)
   1712  1.146       dsl 	    Buf_AddByte(&buf, ' ');
   1713   1.35  christos     }
   1714   1.35  christos 
   1715   1.35  christos     free(as);
   1716   1.35  christos     free(av);
   1717   1.35  christos 
   1718  1.146       dsl     return Buf_Destroy(&buf, FALSE);
   1719   1.35  christos }
   1720   1.35  christos 
   1721   1.35  christos 
   1722    1.1       cgd /*-
   1723    1.1       cgd  *-----------------------------------------------------------------------
   1724   1.55  christos  * VarUniq --
   1725   1.55  christos  *	Remove adjacent duplicate words.
   1726   1.55  christos  *
   1727   1.70       wiz  * Input:
   1728   1.70       wiz  *	str		String whose words should be sorted
   1729   1.70       wiz  *
   1730   1.55  christos  * Results:
   1731   1.55  christos  *	A string containing the resulting words.
   1732   1.55  christos  *
   1733   1.55  christos  * Side Effects:
   1734   1.55  christos  *	None.
   1735   1.55  christos  *
   1736   1.55  christos  *-----------------------------------------------------------------------
   1737   1.55  christos  */
   1738   1.55  christos static char *
   1739   1.73  christos VarUniq(const char *str)
   1740   1.55  christos {
   1741  1.240    rillig     Buffer	  buf;		/* Buffer for new string */
   1742  1.240    rillig     char 	**av;		/* List of words to affect */
   1743  1.240    rillig     char 	 *as;		/* Word list memory */
   1744  1.127  christos     int 	  ac, i, j;
   1745   1.55  christos 
   1746  1.146       dsl     Buf_Init(&buf, 0);
   1747   1.55  christos     av = brk_string(str, &ac, FALSE, &as);
   1748   1.55  christos 
   1749   1.55  christos     if (ac > 1) {
   1750   1.55  christos 	for (j = 0, i = 1; i < ac; i++)
   1751   1.55  christos 	    if (strcmp(av[i], av[j]) != 0 && (++j != i))
   1752   1.55  christos 		av[j] = av[i];
   1753   1.55  christos 	ac = j + 1;
   1754   1.55  christos     }
   1755   1.55  christos 
   1756   1.55  christos     for (i = 0; i < ac; i++) {
   1757  1.146       dsl 	Buf_AddBytes(&buf, strlen(av[i]), av[i]);
   1758   1.55  christos 	if (i != ac - 1)
   1759  1.146       dsl 	    Buf_AddByte(&buf, ' ');
   1760   1.55  christos     }
   1761   1.55  christos 
   1762   1.55  christos     free(as);
   1763   1.55  christos     free(av);
   1764   1.55  christos 
   1765  1.146       dsl     return Buf_Destroy(&buf, FALSE);
   1766   1.55  christos }
   1767   1.55  christos 
   1768  1.210       sjg /*-
   1769  1.210       sjg  *-----------------------------------------------------------------------
   1770  1.210       sjg  * VarRange --
   1771  1.210       sjg  *	Return an integer sequence
   1772  1.210       sjg  *
   1773  1.210       sjg  * Input:
   1774  1.210       sjg  *	str		String whose words provide default range
   1775  1.210       sjg  *	ac		range length, if 0 use str words
   1776  1.210       sjg  *
   1777  1.210       sjg  * Side Effects:
   1778  1.210       sjg  *	None.
   1779  1.210       sjg  *
   1780  1.210       sjg  *-----------------------------------------------------------------------
   1781  1.210       sjg  */
   1782  1.210       sjg static char *
   1783  1.210       sjg VarRange(const char *str, int ac)
   1784  1.210       sjg {
   1785  1.240    rillig     Buffer	  buf;		/* Buffer for new string */
   1786  1.240    rillig     char	  tmp[32];	/* each element */
   1787  1.240    rillig     char 	**av;		/* List of words to affect */
   1788  1.240    rillig     char 	 *as;		/* Word list memory */
   1789  1.210       sjg     int 	  i, n;
   1790  1.210       sjg 
   1791  1.210       sjg     Buf_Init(&buf, 0);
   1792  1.210       sjg     if (ac > 0) {
   1793  1.210       sjg 	as = NULL;
   1794  1.210       sjg 	av = NULL;
   1795  1.210       sjg     } else {
   1796  1.210       sjg 	av = brk_string(str, &ac, FALSE, &as);
   1797  1.210       sjg     }
   1798  1.210       sjg     for (i = 0; i < ac; i++) {
   1799  1.210       sjg 	n = snprintf(tmp, sizeof(tmp), "%d", 1 + i);
   1800  1.210       sjg 	if (n >= (int)sizeof(tmp))
   1801  1.210       sjg 	    break;
   1802  1.210       sjg 	Buf_AddBytes(&buf, n, tmp);
   1803  1.210       sjg 	if (i != ac - 1)
   1804  1.210       sjg 	    Buf_AddByte(&buf, ' ');
   1805  1.210       sjg     }
   1806  1.210       sjg 
   1807  1.210       sjg     free(as);
   1808  1.210       sjg     free(av);
   1809  1.210       sjg 
   1810  1.210       sjg     return Buf_Destroy(&buf, FALSE);
   1811  1.210       sjg }
   1812  1.210       sjg 
   1813   1.55  christos 
   1814   1.55  christos /*-
   1815  1.265    rillig  * Parse a text part of a modifier such as the "from" and "to" in :S/from/to/
   1816  1.265    rillig  * or the :@ modifier. Nested variables in the text are expanded unless
   1817  1.287    rillig  * VARE_NOSUBST is set.
   1818  1.265    rillig  *
   1819  1.265    rillig  * The text part is parsed until the next delimiter.  To escape the delimiter,
   1820  1.265    rillig  * a backslash or a dollar, put a backslash before it.
   1821  1.265    rillig  *
   1822  1.265    rillig  * Return the expanded string or NULL if the delimiter was missing.
   1823  1.265    rillig  * If pattern is specified, handle escaped ampersands and replace unescaped
   1824  1.265    rillig  * ampersands with the lhs of the pattern (for the :S and :C modifiers).
   1825  1.265    rillig  *
   1826  1.265    rillig  * If length is specified, return the string length of the buffer.
   1827  1.265    rillig  * If mpflags is specified and the last character of the pattern is a $,
   1828  1.288    rillig  * set the VARP_ANCHOR_END bit of mpflags.
   1829   1.16  christos  */
   1830   1.16  christos static char *
   1831  1.266    rillig ParseModifierPart(GNode *ctxt, const char **tstr, int delim,
   1832  1.266    rillig 		  VarEvalFlags eflags, VarPatternFlags *mpflags,
   1833  1.291    rillig 		  size_t *length, ModifyWord_SubstArgs *subst)
   1834   1.16  christos {
   1835   1.73  christos     const char *cp;
   1836  1.146       dsl     char *rstr;
   1837  1.146       dsl     Buffer buf;
   1838  1.281    rillig     size_t junk;
   1839  1.261    rillig     VarEvalFlags errnum = eflags & VARE_UNDEFERR;
   1840  1.146       dsl 
   1841  1.146       dsl     Buf_Init(&buf, 0);
   1842   1.16  christos     if (length == NULL)
   1843   1.16  christos 	length = &junk;
   1844   1.16  christos 
   1845   1.16  christos     /*
   1846   1.16  christos      * Skim through until the matching delimiter is found;
   1847   1.16  christos      * pick up variable substitutions on the way. Also allow
   1848   1.16  christos      * backslashes to quote the delimiter, $, and \, but don't
   1849   1.16  christos      * touch other backslashes.
   1850   1.16  christos      */
   1851  1.278    rillig     for (cp = *tstr; *cp != '\0' && *cp != delim; cp++) {
   1852  1.263    rillig 	Boolean is_escaped = cp[0] == '\\' && (cp[1] == delim ||
   1853  1.281    rillig 	    cp[1] == '\\' || cp[1] == '$' || (subst != NULL && cp[1] == '&'));
   1854  1.263    rillig 	if (is_escaped) {
   1855  1.146       dsl 	    Buf_AddByte(&buf, cp[1]);
   1856   1.16  christos 	    cp++;
   1857   1.16  christos 	} else if (*cp == '$') {
   1858  1.288    rillig 	    if (cp[1] == delim) {	/* Unescaped $ at end of pattern */
   1859  1.261    rillig 		if (mpflags == NULL)
   1860  1.146       dsl 		    Buf_AddByte(&buf, *cp);
   1861   1.16  christos 		else
   1862  1.288    rillig 		    *mpflags |= VARP_ANCHOR_END;
   1863   1.40       sjg 	    } else {
   1864  1.287    rillig 		if (!(eflags & VARE_NOSUBST)) {
   1865   1.40       sjg 		    char   *cp2;
   1866  1.127  christos 		    int     len;
   1867  1.104  christos 		    void   *freeIt;
   1868   1.40       sjg 
   1869   1.40       sjg 		    /*
   1870   1.40       sjg 		     * If unescaped dollar sign not before the
   1871   1.40       sjg 		     * delimiter, assume it's a variable
   1872   1.40       sjg 		     * substitution and recurse.
   1873   1.40       sjg 		     */
   1874  1.261    rillig 		    cp2 = Var_Parse(cp, ctxt, errnum | (eflags & VARE_WANTRES),
   1875  1.249    rillig 				    &len, &freeIt);
   1876  1.146       dsl 		    Buf_AddBytes(&buf, strlen(cp2), cp2);
   1877  1.196  christos 		    free(freeIt);
   1878   1.40       sjg 		    cp += len - 1;
   1879   1.40       sjg 		} else {
   1880   1.73  christos 		    const char *cp2 = &cp[1];
   1881   1.16  christos 
   1882  1.100  christos 		    if (*cp2 == PROPEN || *cp2 == BROPEN) {
   1883   1.40       sjg 			/*
   1884   1.40       sjg 			 * Find the end of this variable reference
   1885   1.40       sjg 			 * and suck it in without further ado.
   1886  1.232    rillig 			 * It will be interpreted later.
   1887   1.40       sjg 			 */
   1888   1.40       sjg 			int have = *cp2;
   1889  1.100  christos 			int want = (*cp2 == PROPEN) ? PRCLOSE : BRCLOSE;
   1890   1.40       sjg 			int depth = 1;
   1891   1.40       sjg 
   1892   1.40       sjg 			for (++cp2; *cp2 != '\0' && depth > 0; ++cp2) {
   1893   1.40       sjg 			    if (cp2[-1] != '\\') {
   1894   1.40       sjg 				if (*cp2 == have)
   1895   1.40       sjg 				    ++depth;
   1896   1.40       sjg 				if (*cp2 == want)
   1897   1.40       sjg 				    --depth;
   1898   1.40       sjg 			    }
   1899   1.40       sjg 			}
   1900  1.146       dsl 			Buf_AddBytes(&buf, cp2 - cp, cp);
   1901   1.40       sjg 			cp = --cp2;
   1902   1.40       sjg 		    } else
   1903  1.146       dsl 			Buf_AddByte(&buf, *cp);
   1904   1.40       sjg 		}
   1905   1.16  christos 	    }
   1906  1.281    rillig 	} else if (subst != NULL && *cp == '&')
   1907  1.281    rillig 	    Buf_AddBytes(&buf, subst->lhsLen, subst->lhs);
   1908   1.16  christos 	else
   1909  1.146       dsl 	    Buf_AddByte(&buf, *cp);
   1910   1.16  christos     }
   1911   1.16  christos 
   1912   1.16  christos     if (*cp != delim) {
   1913   1.16  christos 	*tstr = cp;
   1914   1.16  christos 	*length = 0;
   1915   1.16  christos 	return NULL;
   1916   1.16  christos     }
   1917  1.146       dsl 
   1918  1.146       dsl     *tstr = ++cp;
   1919  1.146       dsl     *length = Buf_Size(&buf);
   1920  1.146       dsl     rstr = Buf_Destroy(&buf, FALSE);
   1921  1.146       dsl     if (DEBUG(VAR))
   1922  1.278    rillig 	fprintf(debug_file, "Modifier part: \"%s\"\n", rstr);
   1923  1.146       dsl     return rstr;
   1924   1.16  christos }
   1925   1.16  christos 
   1926   1.16  christos /*-
   1927   1.16  christos  *-----------------------------------------------------------------------
   1928   1.16  christos  * VarQuote --
   1929  1.194   mlelstv  *	Quote shell meta-characters and space characters in the string
   1930  1.220  christos  *	if quoteDollar is set, also quote and double any '$' characters.
   1931   1.16  christos  *
   1932   1.16  christos  * Results:
   1933   1.16  christos  *	The quoted string
   1934   1.16  christos  *
   1935   1.16  christos  * Side Effects:
   1936   1.16  christos  *	None.
   1937   1.16  christos  *
   1938   1.16  christos  *-----------------------------------------------------------------------
   1939   1.16  christos  */
   1940   1.16  christos static char *
   1941  1.220  christos VarQuote(char *str, Boolean quoteDollar)
   1942   1.16  christos {
   1943  1.293    rillig     Buffer buf;
   1944  1.146       dsl     Buf_Init(&buf, 0);
   1945  1.193  christos 
   1946  1.193  christos     for (; *str != '\0'; str++) {
   1947  1.193  christos 	if (*str == '\n') {
   1948  1.293    rillig 	    const char *newline = Shell_GetNewline();
   1949  1.293    rillig 	    if (newline == NULL)
   1950  1.293    rillig 		newline = "\\\n";
   1951  1.293    rillig 	    Buf_AddBytes(&buf, strlen(newline), newline);
   1952  1.193  christos 	    continue;
   1953  1.193  christos 	}
   1954  1.195  christos 	if (isspace((unsigned char)*str) || ismeta((unsigned char)*str))
   1955  1.146       dsl 	    Buf_AddByte(&buf, '\\');
   1956  1.193  christos 	Buf_AddByte(&buf, *str);
   1957  1.220  christos 	if (quoteDollar && *str == '$')
   1958  1.219  christos 	    Buf_AddBytes(&buf, 2, "\\$");
   1959   1.16  christos     }
   1960  1.193  christos 
   1961  1.146       dsl     str = Buf_Destroy(&buf, FALSE);
   1962  1.137  christos     if (DEBUG(VAR))
   1963  1.137  christos 	fprintf(debug_file, "QuoteMeta: [%s]\n", str);
   1964   1.16  christos     return str;
   1965   1.16  christos }
   1966   1.16  christos 
   1967   1.68        pk /*-
   1968   1.68        pk  *-----------------------------------------------------------------------
   1969  1.163     joerg  * VarHash --
   1970  1.163     joerg  *      Hash the string using the MurmurHash3 algorithm.
   1971  1.163     joerg  *      Output is computed using 32bit Little Endian arithmetic.
   1972  1.163     joerg  *
   1973  1.163     joerg  * Input:
   1974  1.163     joerg  *	str		String to modify
   1975  1.163     joerg  *
   1976  1.163     joerg  * Results:
   1977  1.163     joerg  *      Hash value of str, encoded as 8 hex digits.
   1978  1.163     joerg  *
   1979  1.163     joerg  * Side Effects:
   1980  1.163     joerg  *      None.
   1981  1.163     joerg  *
   1982  1.163     joerg  *-----------------------------------------------------------------------
   1983  1.163     joerg  */
   1984  1.163     joerg static char *
   1985  1.252    rillig VarHash(const char *str)
   1986  1.163     joerg {
   1987  1.163     joerg     static const char    hexdigits[16] = "0123456789abcdef";
   1988  1.163     joerg     Buffer         buf;
   1989  1.163     joerg     size_t         len, len2;
   1990  1.252    rillig     const unsigned char *ustr = (const unsigned char *)str;
   1991  1.163     joerg     uint32_t       h, k, c1, c2;
   1992  1.163     joerg 
   1993  1.163     joerg     h  = 0x971e137bU;
   1994  1.163     joerg     c1 = 0x95543787U;
   1995  1.163     joerg     c2 = 0x2ad7eb25U;
   1996  1.163     joerg     len2 = strlen(str);
   1997  1.163     joerg 
   1998  1.163     joerg     for (len = len2; len; ) {
   1999  1.163     joerg 	k = 0;
   2000  1.163     joerg 	switch (len) {
   2001  1.163     joerg 	default:
   2002  1.252    rillig 	    k = ((uint32_t)ustr[3] << 24) |
   2003  1.252    rillig 		((uint32_t)ustr[2] << 16) |
   2004  1.252    rillig 		((uint32_t)ustr[1] << 8) |
   2005  1.252    rillig 		(uint32_t)ustr[0];
   2006  1.163     joerg 	    len -= 4;
   2007  1.163     joerg 	    ustr += 4;
   2008  1.163     joerg 	    break;
   2009  1.163     joerg 	case 3:
   2010  1.252    rillig 	    k |= (uint32_t)ustr[2] << 16;
   2011  1.222       mrg 	    /* FALLTHROUGH */
   2012  1.163     joerg 	case 2:
   2013  1.252    rillig 	    k |= (uint32_t)ustr[1] << 8;
   2014  1.222       mrg 	    /* FALLTHROUGH */
   2015  1.163     joerg 	case 1:
   2016  1.252    rillig 	    k |= (uint32_t)ustr[0];
   2017  1.163     joerg 	    len = 0;
   2018  1.163     joerg 	}
   2019  1.163     joerg 	c1 = c1 * 5 + 0x7b7d159cU;
   2020  1.163     joerg 	c2 = c2 * 5 + 0x6bce6396U;
   2021  1.163     joerg 	k *= c1;
   2022  1.163     joerg 	k = (k << 11) ^ (k >> 21);
   2023  1.163     joerg 	k *= c2;
   2024  1.163     joerg 	h = (h << 13) ^ (h >> 19);
   2025  1.163     joerg 	h = h * 5 + 0x52dce729U;
   2026  1.163     joerg 	h ^= k;
   2027  1.242    rillig     }
   2028  1.242    rillig     h ^= len2;
   2029  1.242    rillig     h *= 0x85ebca6b;
   2030  1.242    rillig     h ^= h >> 13;
   2031  1.242    rillig     h *= 0xc2b2ae35;
   2032  1.242    rillig     h ^= h >> 16;
   2033  1.242    rillig 
   2034  1.242    rillig     Buf_Init(&buf, 0);
   2035  1.242    rillig     for (len = 0; len < 8; ++len) {
   2036  1.242    rillig 	Buf_AddByte(&buf, hexdigits[h & 15]);
   2037  1.242    rillig 	h >>= 4;
   2038  1.249    rillig     }
   2039  1.163     joerg 
   2040  1.249    rillig     return Buf_Destroy(&buf, FALSE);
   2041  1.163     joerg }
   2042  1.163     joerg 
   2043  1.164       sjg static char *
   2044  1.209       sjg VarStrftime(const char *fmt, int zulu, time_t utc)
   2045  1.164       sjg {
   2046  1.164       sjg     char buf[BUFSIZ];
   2047  1.164       sjg 
   2048  1.209       sjg     if (!utc)
   2049  1.209       sjg 	time(&utc);
   2050  1.164       sjg     if (!*fmt)
   2051  1.164       sjg 	fmt = "%c";
   2052  1.164       sjg     strftime(buf, sizeof(buf), fmt, zulu ? gmtime(&utc) : localtime(&utc));
   2053  1.235    rillig 
   2054  1.164       sjg     buf[sizeof(buf) - 1] = '\0';
   2055  1.164       sjg     return bmake_strdup(buf);
   2056  1.164       sjg }
   2057  1.164       sjg 
   2058  1.236    rillig typedef struct {
   2059  1.236    rillig     /* const parameters */
   2060  1.267    rillig     int startc;			/* '\0' or '{' or '(' */
   2061  1.236    rillig     int endc;
   2062  1.242    rillig     Var *v;
   2063  1.236    rillig     GNode *ctxt;
   2064  1.268    rillig     VarEvalFlags eflags;
   2065  1.242    rillig     int *lengthPtr;
   2066  1.242    rillig     void **freePtr;
   2067  1.236    rillig 
   2068  1.236    rillig     /* read-write */
   2069  1.236    rillig     char *nstr;
   2070  1.236    rillig     const char *start;
   2071  1.300    rillig     const char *cp;		/* The position where parsing continues
   2072  1.300    rillig 				 * after the current modifier. */
   2073  1.236    rillig     char termc;			/* Character which terminated scan */
   2074  1.298    rillig     char missing_delim;		/* For error reporting */
   2075  1.236    rillig     int modifier;		/* that we are processing */
   2076  1.301    rillig 
   2077  1.301    rillig     Byte	sep;		/* Word separator in expansions */
   2078  1.301    rillig     Boolean	oneBigWord;	/* TRUE if we will treat the variable as a
   2079  1.301    rillig 				 * single big word, even if it contains
   2080  1.301    rillig 				 * embedded spaces (as opposed to the
   2081  1.301    rillig 				 * usual behaviour of treating it as
   2082  1.301    rillig 				 * several space-separated words). */
   2083  1.236    rillig 
   2084  1.236    rillig     /* result */
   2085  1.236    rillig     char *newStr;		/* New value to return */
   2086  1.236    rillig } ApplyModifiersState;
   2087  1.236    rillig 
   2088  1.236    rillig /* we now have some modifiers with long names */
   2089  1.236    rillig #define STRMOD_MATCH(s, want, n) \
   2090  1.236    rillig     (strncmp(s, want, n) == 0 && (s[n] == st->endc || s[n] == ':'))
   2091  1.236    rillig #define STRMOD_MATCHX(s, want, n) \
   2092  1.246    rillig     (strncmp(s, want, n) == 0 && \
   2093  1.246    rillig      (s[n] == st->endc || s[n] == ':' || s[n] == '='))
   2094  1.236    rillig #define CHARMOD_MATCH(c) (c == st->endc || c == ':')
   2095  1.236    rillig 
   2096  1.236    rillig /* :@var (at) ...${var}...@ */
   2097  1.236    rillig static Boolean
   2098  1.299    rillig ApplyModifier_Loop(const char *mod, ApplyModifiersState *st) {
   2099  1.291    rillig     ModifyWord_LoopArgs args;
   2100  1.236    rillig 
   2101  1.295    rillig     args.ctx = st->ctxt;
   2102  1.299    rillig     st->cp = mod + 1;
   2103  1.298    rillig     char delim = '@';
   2104  1.298    rillig     args.tvar = ParseModifierPart(st->ctxt, &st->cp, delim,
   2105  1.288    rillig 				  st->eflags | VARE_NOSUBST,
   2106  1.288    rillig 				  NULL, NULL, NULL);
   2107  1.298    rillig     if (args.tvar == NULL) {
   2108  1.298    rillig 	st->missing_delim = delim;
   2109  1.236    rillig 	return FALSE;
   2110  1.298    rillig     }
   2111  1.236    rillig 
   2112  1.298    rillig     args.str = ParseModifierPart(st->ctxt, &st->cp, delim,
   2113  1.288    rillig 				 st->eflags | VARE_NOSUBST,
   2114  1.288    rillig 				 NULL, NULL, NULL);
   2115  1.298    rillig     if (args.str == NULL) {
   2116  1.298    rillig 	st->missing_delim = delim;
   2117  1.236    rillig 	return FALSE;
   2118  1.298    rillig     }
   2119  1.236    rillig 
   2120  1.236    rillig     st->termc = *st->cp;
   2121  1.236    rillig 
   2122  1.291    rillig     args.eflags = st->eflags & (VARE_UNDEFERR | VARE_WANTRES);
   2123  1.301    rillig     int prev_sep = st->sep;
   2124  1.301    rillig     st->sep = ' ';		/* XXX: this is inconsistent */
   2125  1.301    rillig     st->newStr = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->nstr,
   2126  1.291    rillig 			     ModifyWord_Loop, &args);
   2127  1.301    rillig     st->sep = prev_sep;
   2128  1.291    rillig     Var_Delete(args.tvar, st->ctxt);
   2129  1.291    rillig     free(args.tvar);
   2130  1.291    rillig     free(args.str);
   2131  1.236    rillig     return TRUE;
   2132  1.236    rillig }
   2133  1.236    rillig 
   2134  1.236    rillig /* :Ddefined or :Uundefined */
   2135  1.236    rillig static void
   2136  1.299    rillig ApplyModifier_Defined(const char *mod, ApplyModifiersState *st)
   2137  1.236    rillig {
   2138  1.242    rillig     Buffer buf;			/* Buffer for patterns */
   2139  1.268    rillig     VarEvalFlags neflags;
   2140  1.236    rillig 
   2141  1.268    rillig     if (st->eflags & VARE_WANTRES) {
   2142  1.268    rillig 	Boolean wantres;
   2143  1.299    rillig 	if (*mod == 'U')
   2144  1.236    rillig 	    wantres = ((st->v->flags & VAR_JUNK) != 0);
   2145  1.236    rillig 	else
   2146  1.236    rillig 	    wantres = ((st->v->flags & VAR_JUNK) == 0);
   2147  1.268    rillig 	neflags = st->eflags & ~VARE_WANTRES;
   2148  1.236    rillig 	if (wantres)
   2149  1.268    rillig 	    neflags |= VARE_WANTRES;
   2150  1.236    rillig     } else
   2151  1.268    rillig 	neflags = st->eflags;
   2152  1.236    rillig 
   2153  1.236    rillig     /*
   2154  1.302    rillig      * Pass through mod looking for 1) escaped delimiters,
   2155  1.236    rillig      * '$'s and backslashes (place the escaped character in
   2156  1.236    rillig      * uninterpreted) and 2) unescaped $'s that aren't before
   2157  1.236    rillig      * the delimiter (expand the variable substitution).
   2158  1.236    rillig      * The result is left in the Buffer buf.
   2159  1.236    rillig      */
   2160  1.236    rillig     Buf_Init(&buf, 0);
   2161  1.299    rillig     for (st->cp = mod + 1;
   2162  1.236    rillig 	 *st->cp != st->endc && *st->cp != ':' && *st->cp != '\0';
   2163  1.236    rillig 	 st->cp++) {
   2164  1.236    rillig 	if (*st->cp == '\\' &&
   2165  1.236    rillig 	    (st->cp[1] == ':' || st->cp[1] == '$' || st->cp[1] == st->endc ||
   2166  1.236    rillig 	     st->cp[1] == '\\')) {
   2167  1.236    rillig 	    Buf_AddByte(&buf, st->cp[1]);
   2168  1.236    rillig 	    st->cp++;
   2169  1.236    rillig 	} else if (*st->cp == '$') {
   2170  1.236    rillig 	    /*
   2171  1.236    rillig 	     * If unescaped dollar sign, assume it's a
   2172  1.236    rillig 	     * variable substitution and recurse.
   2173  1.236    rillig 	     */
   2174  1.236    rillig 	    char    *cp2;
   2175  1.236    rillig 	    int	    len;
   2176  1.236    rillig 	    void    *freeIt;
   2177  1.236    rillig 
   2178  1.268    rillig 	    cp2 = Var_Parse(st->cp, st->ctxt, neflags, &len, &freeIt);
   2179  1.236    rillig 	    Buf_AddBytes(&buf, strlen(cp2), cp2);
   2180  1.236    rillig 	    free(freeIt);
   2181  1.236    rillig 	    st->cp += len - 1;
   2182  1.236    rillig 	} else {
   2183  1.236    rillig 	    Buf_AddByte(&buf, *st->cp);
   2184  1.236    rillig 	}
   2185  1.236    rillig     }
   2186  1.236    rillig 
   2187  1.236    rillig     st->termc = *st->cp;
   2188  1.236    rillig 
   2189  1.257    rillig     if (st->v->flags & VAR_JUNK)
   2190  1.236    rillig 	st->v->flags |= VAR_KEEP;
   2191  1.268    rillig     if (neflags & VARE_WANTRES) {
   2192  1.236    rillig 	st->newStr = Buf_Destroy(&buf, FALSE);
   2193  1.236    rillig     } else {
   2194  1.236    rillig 	st->newStr = st->nstr;
   2195  1.236    rillig 	Buf_Destroy(&buf, TRUE);
   2196  1.236    rillig     }
   2197  1.236    rillig }
   2198  1.236    rillig 
   2199  1.236    rillig /* :gmtime */
   2200  1.236    rillig static Boolean
   2201  1.299    rillig ApplyModifier_Gmtime(const char *mod, ApplyModifiersState *st)
   2202  1.236    rillig {
   2203  1.236    rillig     time_t utc;
   2204  1.236    rillig     char *ep;
   2205  1.236    rillig 
   2206  1.299    rillig     st->cp = mod + 1;		/* make sure it is set */
   2207  1.299    rillig     if (!STRMOD_MATCHX(mod, "gmtime", 6))
   2208  1.236    rillig 	return FALSE;
   2209  1.299    rillig     if (mod[6] == '=') {
   2210  1.299    rillig 	utc = strtoul(mod + 7, &ep, 10);
   2211  1.236    rillig 	st->cp = ep;
   2212  1.236    rillig     } else {
   2213  1.236    rillig 	utc = 0;
   2214  1.299    rillig 	st->cp = mod + 6;
   2215  1.236    rillig     }
   2216  1.236    rillig     st->newStr = VarStrftime(st->nstr, 1, utc);
   2217  1.236    rillig     st->termc = *st->cp;
   2218  1.236    rillig     return TRUE;
   2219  1.236    rillig }
   2220  1.236    rillig 
   2221  1.236    rillig /* :localtime */
   2222  1.236    rillig static Boolean
   2223  1.299    rillig ApplyModifier_Localtime(const char *mod, ApplyModifiersState *st)
   2224  1.236    rillig {
   2225  1.236    rillig     time_t utc;
   2226  1.236    rillig     char *ep;
   2227  1.236    rillig 
   2228  1.299    rillig     st->cp = mod + 1;	/* make sure it is set */
   2229  1.299    rillig     if (!STRMOD_MATCHX(mod, "localtime", 9))
   2230  1.236    rillig 	return FALSE;
   2231  1.236    rillig 
   2232  1.299    rillig     if (mod[9] == '=') {
   2233  1.299    rillig 	utc = strtoul(mod + 10, &ep, 10);
   2234  1.236    rillig 	st->cp = ep;
   2235  1.236    rillig     } else {
   2236  1.236    rillig 	utc = 0;
   2237  1.299    rillig 	st->cp = mod + 9;
   2238  1.236    rillig     }
   2239  1.236    rillig     st->newStr = VarStrftime(st->nstr, 0, utc);
   2240  1.236    rillig     st->termc = *st->cp;
   2241  1.236    rillig     return TRUE;
   2242  1.236    rillig }
   2243  1.236    rillig 
   2244  1.236    rillig /* :hash */
   2245  1.236    rillig static Boolean
   2246  1.299    rillig ApplyModifier_Hash(const char *mod, ApplyModifiersState *st)
   2247  1.236    rillig {
   2248  1.299    rillig     st->cp = mod + 1;	/* make sure it is set */
   2249  1.299    rillig     if (!STRMOD_MATCH(mod, "hash", 4))
   2250  1.236    rillig 	return FALSE;
   2251  1.236    rillig     st->newStr = VarHash(st->nstr);
   2252  1.299    rillig     st->cp = mod + 4;
   2253  1.236    rillig     st->termc = *st->cp;
   2254  1.236    rillig     return TRUE;
   2255  1.236    rillig }
   2256  1.236    rillig 
   2257  1.236    rillig /* :P */
   2258  1.236    rillig static void
   2259  1.299    rillig ApplyModifier_Path(const char *mod, ApplyModifiersState *st)
   2260  1.236    rillig {
   2261  1.236    rillig     if ((st->v->flags & VAR_JUNK) != 0)
   2262  1.236    rillig 	st->v->flags |= VAR_KEEP;
   2263  1.299    rillig     GNode *gn = Targ_FindNode(st->v->name, TARG_NOCREATE);
   2264  1.236    rillig     if (gn == NULL || gn->type & OP_NOPATH) {
   2265  1.236    rillig 	st->newStr = NULL;
   2266  1.236    rillig     } else if (gn->path) {
   2267  1.236    rillig 	st->newStr = bmake_strdup(gn->path);
   2268  1.236    rillig     } else {
   2269  1.236    rillig 	st->newStr = Dir_FindFile(st->v->name, Suff_FindPath(gn));
   2270  1.236    rillig     }
   2271  1.236    rillig     if (!st->newStr)
   2272  1.236    rillig 	st->newStr = bmake_strdup(st->v->name);
   2273  1.299    rillig     st->cp = mod + 1;
   2274  1.299    rillig     st->termc = *st->cp;
   2275  1.236    rillig }
   2276  1.236    rillig 
   2277  1.236    rillig /* :!cmd! */
   2278  1.236    rillig static Boolean
   2279  1.299    rillig ApplyModifier_Exclam(const char *mod, ApplyModifiersState *st)
   2280  1.236    rillig {
   2281  1.299    rillig     st->cp = mod + 1;
   2282  1.298    rillig     char delim = '!';
   2283  1.298    rillig     char *cmd = ParseModifierPart(st->ctxt, &st->cp, delim, st->eflags,
   2284  1.274    rillig 				  NULL, NULL, NULL);
   2285  1.298    rillig     if (cmd == NULL) {
   2286  1.298    rillig 	st->missing_delim = delim;
   2287  1.236    rillig 	return FALSE;
   2288  1.298    rillig     }
   2289  1.274    rillig 
   2290  1.274    rillig     const char *emsg = NULL;
   2291  1.268    rillig     if (st->eflags & VARE_WANTRES)
   2292  1.274    rillig 	st->newStr = Cmd_Exec(cmd, &emsg);
   2293  1.236    rillig     else
   2294  1.236    rillig 	st->newStr = varNoError;
   2295  1.274    rillig     free(cmd);
   2296  1.274    rillig 
   2297  1.236    rillig     if (emsg)
   2298  1.236    rillig 	Error(emsg, st->nstr);
   2299  1.274    rillig 
   2300  1.236    rillig     st->termc = *st->cp;
   2301  1.236    rillig     if (st->v->flags & VAR_JUNK)
   2302  1.236    rillig 	st->v->flags |= VAR_KEEP;
   2303  1.236    rillig     return TRUE;
   2304  1.236    rillig }
   2305  1.236    rillig 
   2306  1.236    rillig /* :range */
   2307  1.236    rillig static Boolean
   2308  1.299    rillig ApplyModifier_Range(const char *mod, ApplyModifiersState *st)
   2309  1.236    rillig {
   2310  1.236    rillig     int n;
   2311  1.236    rillig     char *ep;
   2312  1.236    rillig 
   2313  1.299    rillig     st->cp = mod + 1;	/* make sure it is set */
   2314  1.299    rillig     if (!STRMOD_MATCHX(mod, "range", 5))
   2315  1.236    rillig 	return FALSE;
   2316  1.236    rillig 
   2317  1.299    rillig     if (mod[5] == '=') {
   2318  1.299    rillig 	n = strtoul(mod + 6, &ep, 10);
   2319  1.236    rillig 	st->cp = ep;
   2320  1.236    rillig     } else {
   2321  1.236    rillig 	n = 0;
   2322  1.299    rillig 	st->cp = mod + 5;
   2323  1.236    rillig     }
   2324  1.236    rillig     st->newStr = VarRange(st->nstr, n);
   2325  1.236    rillig     st->termc = *st->cp;
   2326  1.236    rillig     return TRUE;
   2327  1.236    rillig }
   2328  1.236    rillig 
   2329  1.236    rillig /* :Mpattern or :Npattern */
   2330  1.236    rillig static void
   2331  1.299    rillig ApplyModifier_Match(const char *mod, ApplyModifiersState *st)
   2332  1.236    rillig {
   2333  1.288    rillig     Boolean copy = FALSE;	/* pattern should be, or has been, copied */
   2334  1.288    rillig     Boolean needSubst = FALSE;
   2335  1.236    rillig     /*
   2336  1.288    rillig      * In the loop below, ignore ':' unless we are at (or back to) the
   2337  1.288    rillig      * original brace level.
   2338  1.288    rillig      * XXX This will likely not work right if $() and ${} are intermixed.
   2339  1.236    rillig      */
   2340  1.288    rillig     int nest = 1;
   2341  1.299    rillig     for (st->cp = mod + 1;
   2342  1.236    rillig 	 *st->cp != '\0' && !(*st->cp == ':' && nest == 1);
   2343  1.236    rillig 	 st->cp++) {
   2344  1.236    rillig 	if (*st->cp == '\\' &&
   2345  1.236    rillig 	    (st->cp[1] == ':' || st->cp[1] == st->endc ||
   2346  1.236    rillig 	     st->cp[1] == st->startc)) {
   2347  1.236    rillig 	    if (!needSubst)
   2348  1.236    rillig 		copy = TRUE;
   2349  1.236    rillig 	    st->cp++;
   2350  1.236    rillig 	    continue;
   2351  1.236    rillig 	}
   2352  1.236    rillig 	if (*st->cp == '$')
   2353  1.236    rillig 	    needSubst = TRUE;
   2354  1.236    rillig 	if (*st->cp == '(' || *st->cp == '{')
   2355  1.236    rillig 	    ++nest;
   2356  1.236    rillig 	if (*st->cp == ')' || *st->cp == '}') {
   2357  1.236    rillig 	    --nest;
   2358  1.236    rillig 	    if (nest == 0)
   2359  1.236    rillig 		break;
   2360  1.236    rillig 	}
   2361  1.236    rillig     }
   2362  1.236    rillig     st->termc = *st->cp;
   2363  1.288    rillig     const char *endpat = st->cp;
   2364  1.288    rillig 
   2365  1.288    rillig     char *pattern = NULL;
   2366  1.236    rillig     if (copy) {
   2367  1.236    rillig 	/*
   2368  1.236    rillig 	 * Need to compress the \:'s out of the pattern, so
   2369  1.236    rillig 	 * allocate enough room to hold the uncompressed
   2370  1.299    rillig 	 * pattern (note that st->cp started at mod+1, so
   2371  1.299    rillig 	 * st->cp - mod takes the null byte into account) and
   2372  1.236    rillig 	 * compress the pattern into the space.
   2373  1.236    rillig 	 */
   2374  1.299    rillig 	pattern = bmake_malloc(st->cp - mod);
   2375  1.288    rillig 	char *cp2;
   2376  1.299    rillig 	for (cp2 = pattern, st->cp = mod + 1;
   2377  1.236    rillig 	     st->cp < endpat;
   2378  1.236    rillig 	     st->cp++, cp2++) {
   2379  1.236    rillig 	    if ((*st->cp == '\\') && (st->cp+1 < endpat) &&
   2380  1.236    rillig 		(st->cp[1] == ':' || st->cp[1] == st->endc))
   2381  1.236    rillig 		st->cp++;
   2382  1.236    rillig 	    *cp2 = *st->cp;
   2383  1.236    rillig 	}
   2384  1.236    rillig 	*cp2 = '\0';
   2385  1.236    rillig 	endpat = cp2;
   2386  1.236    rillig     } else {
   2387  1.236    rillig 	/*
   2388  1.292    rillig 	 * Either Var_Subst or ModifyWords will need a
   2389  1.236    rillig 	 * nul-terminated string soon, so construct one now.
   2390  1.236    rillig 	 */
   2391  1.299    rillig 	pattern = bmake_strndup(mod + 1, endpat - (mod + 1));
   2392  1.236    rillig     }
   2393  1.236    rillig     if (needSubst) {
   2394  1.236    rillig 	/* pattern contains embedded '$', so use Var_Subst to expand it. */
   2395  1.288    rillig 	char *old_pattern = pattern;
   2396  1.288    rillig 	pattern = Var_Subst(NULL, pattern, st->ctxt, st->eflags);
   2397  1.288    rillig 	free(old_pattern);
   2398  1.236    rillig     }
   2399  1.236    rillig     if (DEBUG(VAR))
   2400  1.236    rillig 	fprintf(debug_file, "Pattern[%s] for [%s] is [%s]\n",
   2401  1.236    rillig 	    st->v->name, st->nstr, pattern);
   2402  1.299    rillig     ModifyWordsCallback callback = mod[0] == 'M'
   2403  1.291    rillig 	? ModifyWord_Match : ModifyWord_NoMatch;
   2404  1.301    rillig     st->newStr = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->nstr,
   2405  1.291    rillig 			     callback, pattern);
   2406  1.236    rillig     free(pattern);
   2407  1.236    rillig }
   2408  1.236    rillig 
   2409  1.236    rillig /* :S,from,to, */
   2410  1.236    rillig static Boolean
   2411  1.299    rillig ApplyModifier_Subst(const char * const mod, ApplyModifiersState *st)
   2412  1.236    rillig {
   2413  1.291    rillig     ModifyWord_SubstArgs args;
   2414  1.301    rillig     Boolean oneBigWord = st->oneBigWord;
   2415  1.299    rillig     char delim = mod[1];
   2416  1.299    rillig 
   2417  1.299    rillig     st->cp = mod + 2;
   2418  1.236    rillig 
   2419  1.236    rillig     /*
   2420  1.236    rillig      * If pattern begins with '^', it is anchored to the
   2421  1.236    rillig      * start of the word -- skip over it and flag pattern.
   2422  1.236    rillig      */
   2423  1.281    rillig     args.pflags = 0;
   2424  1.299    rillig     if (*st->cp == '^') {
   2425  1.288    rillig 	args.pflags |= VARP_ANCHOR_START;
   2426  1.299    rillig 	st->cp++;
   2427  1.236    rillig     }
   2428  1.236    rillig 
   2429  1.298    rillig     char *lhs = ParseModifierPart(st->ctxt, &st->cp, delim, st->eflags,
   2430  1.281    rillig 				  &args.pflags, &args.lhsLen, NULL);
   2431  1.298    rillig     if (lhs == NULL) {
   2432  1.298    rillig 	st->missing_delim = delim;
   2433  1.236    rillig 	return FALSE;
   2434  1.298    rillig     }
   2435  1.281    rillig     args.lhs = lhs;
   2436  1.236    rillig 
   2437  1.298    rillig     char *rhs = ParseModifierPart(st->ctxt, &st->cp, delim, st->eflags,
   2438  1.281    rillig 				  NULL, &args.rhsLen, &args);
   2439  1.298    rillig     if (rhs == NULL) {
   2440  1.298    rillig 	st->missing_delim = delim;
   2441  1.236    rillig 	return FALSE;
   2442  1.298    rillig     }
   2443  1.281    rillig     args.rhs = rhs;
   2444  1.236    rillig 
   2445  1.236    rillig     /*
   2446  1.236    rillig      * Check for global substitution. If 'g' after the final
   2447  1.236    rillig      * delimiter, substitution is global and is marked that
   2448  1.236    rillig      * way.
   2449  1.236    rillig      */
   2450  1.236    rillig     for (;; st->cp++) {
   2451  1.236    rillig 	switch (*st->cp) {
   2452  1.236    rillig 	case 'g':
   2453  1.281    rillig 	    args.pflags |= VARP_SUB_GLOBAL;
   2454  1.236    rillig 	    continue;
   2455  1.236    rillig 	case '1':
   2456  1.281    rillig 	    args.pflags |= VARP_SUB_ONE;
   2457  1.236    rillig 	    continue;
   2458  1.236    rillig 	case 'W':
   2459  1.301    rillig 	    oneBigWord = TRUE;
   2460  1.236    rillig 	    continue;
   2461  1.236    rillig 	}
   2462  1.236    rillig 	break;
   2463  1.236    rillig     }
   2464  1.236    rillig 
   2465  1.236    rillig     st->termc = *st->cp;
   2466  1.301    rillig     st->newStr = ModifyWords(st->ctxt, st->sep, oneBigWord, st->nstr,
   2467  1.291    rillig 			     ModifyWord_Subst, &args);
   2468  1.236    rillig 
   2469  1.281    rillig     free(lhs);
   2470  1.281    rillig     free(rhs);
   2471  1.236    rillig     return TRUE;
   2472  1.236    rillig }
   2473  1.236    rillig 
   2474  1.236    rillig #ifndef NO_REGEX
   2475  1.291    rillig 
   2476  1.236    rillig /* :C,from,to, */
   2477  1.236    rillig static Boolean
   2478  1.299    rillig ApplyModifier_Regex(const char *mod, ApplyModifiersState *st)
   2479  1.236    rillig {
   2480  1.291    rillig     ModifyWord_SubstRegexArgs args;
   2481  1.236    rillig 
   2482  1.291    rillig     args.pflags = 0;
   2483  1.301    rillig     Boolean oneBigWord = st->oneBigWord;
   2484  1.299    rillig     char delim = mod[1];
   2485  1.236    rillig 
   2486  1.299    rillig     st->cp = mod + 2;
   2487  1.236    rillig 
   2488  1.297    rillig     char *re = ParseModifierPart(st->ctxt, &st->cp, delim,
   2489  1.291    rillig 				 st->eflags, NULL, NULL, NULL);
   2490  1.297    rillig     if (re == NULL) {
   2491  1.298    rillig 	st->missing_delim = delim;
   2492  1.236    rillig 	return FALSE;
   2493  1.297    rillig     }
   2494  1.236    rillig 
   2495  1.297    rillig     args.replace = ParseModifierPart(st->ctxt, &st->cp, delim,
   2496  1.291    rillig 				     st->eflags, NULL, NULL, NULL);
   2497  1.291    rillig     if (args.replace == NULL) {
   2498  1.236    rillig 	free(re);
   2499  1.298    rillig 	st->missing_delim = delim;
   2500  1.236    rillig 	return FALSE;
   2501  1.236    rillig     }
   2502  1.236    rillig 
   2503  1.236    rillig     for (;; st->cp++) {
   2504  1.236    rillig 	switch (*st->cp) {
   2505  1.236    rillig 	case 'g':
   2506  1.291    rillig 	    args.pflags |= VARP_SUB_GLOBAL;
   2507  1.236    rillig 	    continue;
   2508  1.236    rillig 	case '1':
   2509  1.291    rillig 	    args.pflags |= VARP_SUB_ONE;
   2510  1.236    rillig 	    continue;
   2511  1.236    rillig 	case 'W':
   2512  1.301    rillig 	    oneBigWord = TRUE;
   2513  1.236    rillig 	    continue;
   2514  1.236    rillig 	}
   2515  1.236    rillig 	break;
   2516  1.236    rillig     }
   2517  1.236    rillig 
   2518  1.236    rillig     st->termc = *st->cp;
   2519  1.236    rillig 
   2520  1.291    rillig     int error = regcomp(&args.re, re, REG_EXTENDED);
   2521  1.236    rillig     free(re);
   2522  1.242    rillig     if (error) {
   2523  1.236    rillig 	*st->lengthPtr = st->cp - st->start + 1;
   2524  1.291    rillig 	VarREError(error, &args.re, "RE substitution error");
   2525  1.291    rillig 	free(args.replace);
   2526  1.236    rillig 	return FALSE;
   2527  1.236    rillig     }
   2528  1.236    rillig 
   2529  1.291    rillig     args.nsub = args.re.re_nsub + 1;
   2530  1.291    rillig     if (args.nsub < 1)
   2531  1.291    rillig 	args.nsub = 1;
   2532  1.291    rillig     if (args.nsub > 10)
   2533  1.291    rillig 	args.nsub = 10;
   2534  1.301    rillig     st->newStr = ModifyWords(st->ctxt, st->sep, oneBigWord, st->nstr,
   2535  1.291    rillig 			     ModifyWord_SubstRegex, &args);
   2536  1.291    rillig     regfree(&args.re);
   2537  1.291    rillig     free(args.replace);
   2538  1.236    rillig     return TRUE;
   2539  1.236    rillig }
   2540  1.236    rillig #endif
   2541  1.236    rillig 
   2542  1.278    rillig static void
   2543  1.295    rillig ModifyWord_Copy(const char *word, SepBuf *buf, void *data MAKE_ATTR_UNUSED)
   2544  1.278    rillig {
   2545  1.278    rillig     SepBuf_AddBytes(buf, word, strlen(word));
   2546  1.275    rillig }
   2547  1.275    rillig 
   2548  1.289    rillig /* :ts<separator> */
   2549  1.289    rillig static Boolean
   2550  1.299    rillig ApplyModifier_ToSep(const char *sep, ApplyModifiersState *st)
   2551  1.289    rillig {
   2552  1.289    rillig     if (sep[0] != st->endc && (sep[1] == st->endc || sep[1] == ':')) {
   2553  1.289    rillig 	/* ":ts<unrecognised><endc>" or ":ts<unrecognised>:" */
   2554  1.301    rillig 	st->sep = sep[0];
   2555  1.289    rillig 	st->cp = sep + 1;
   2556  1.289    rillig     } else if (sep[0] == st->endc || sep[0] == ':') {
   2557  1.289    rillig 	/* ":ts<endc>" or ":ts:" */
   2558  1.301    rillig 	st->sep = '\0';		/* no separator */
   2559  1.289    rillig 	st->cp = sep;
   2560  1.289    rillig     } else if (sep[0] == '\\') {
   2561  1.289    rillig 	const char *xp = sep + 1;
   2562  1.289    rillig 	int base = 8;		/* assume octal */
   2563  1.289    rillig 
   2564  1.289    rillig 	switch (sep[1]) {
   2565  1.289    rillig 	case 'n':
   2566  1.301    rillig 	    st->sep = '\n';
   2567  1.289    rillig 	    st->cp = sep + 2;
   2568  1.289    rillig 	    break;
   2569  1.289    rillig 	case 't':
   2570  1.301    rillig 	    st->sep = '\t';
   2571  1.289    rillig 	    st->cp = sep + 2;
   2572  1.289    rillig 	    break;
   2573  1.289    rillig 	case 'x':
   2574  1.289    rillig 	    base = 16;
   2575  1.289    rillig 	    xp++;
   2576  1.289    rillig 	    goto get_numeric;
   2577  1.289    rillig 	case '0':
   2578  1.289    rillig 	    base = 0;
   2579  1.289    rillig 	    goto get_numeric;
   2580  1.289    rillig 	default:
   2581  1.289    rillig 	    if (!isdigit((unsigned char)sep[1]))
   2582  1.289    rillig 		return FALSE;	/* ":ts<backslash><unrecognised>". */
   2583  1.289    rillig 
   2584  1.289    rillig 	    char *end;
   2585  1.289    rillig 	get_numeric:
   2586  1.301    rillig 	    st->sep = strtoul(sep + 1 + (sep[1] == 'x'), &end, base);
   2587  1.289    rillig 	    if (*end != ':' && *end != st->endc)
   2588  1.289    rillig 	        return FALSE;
   2589  1.289    rillig 	    st->cp = end;
   2590  1.289    rillig 	    break;
   2591  1.289    rillig 	}
   2592  1.289    rillig     } else {
   2593  1.289    rillig 	return FALSE;		/* Found ":ts<unrecognised><unrecognised>". */
   2594  1.289    rillig     }
   2595  1.289    rillig 
   2596  1.289    rillig     st->termc = *st->cp;
   2597  1.301    rillig     st->newStr = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->nstr,
   2598  1.292    rillig 			     ModifyWord_Copy, NULL);
   2599  1.289    rillig     return TRUE;
   2600  1.289    rillig }
   2601  1.289    rillig 
   2602  1.289    rillig /* :tA, :tu, :tl, :ts<separator>, etc. */
   2603  1.236    rillig static Boolean
   2604  1.299    rillig ApplyModifier_To(const char *mod, ApplyModifiersState *st)
   2605  1.236    rillig {
   2606  1.299    rillig     st->cp = mod + 1;	/* make sure it is set */
   2607  1.299    rillig     if (mod[1] == st->endc || mod[1] == ':')
   2608  1.289    rillig 	return FALSE;		/* Found ":t<endc>" or ":t:". */
   2609  1.289    rillig 
   2610  1.299    rillig     if (mod[1] == 's')
   2611  1.299    rillig 	return ApplyModifier_ToSep(mod + 2, st);
   2612  1.289    rillig 
   2613  1.299    rillig     if (mod[2] != st->endc && mod[2] != ':')
   2614  1.289    rillig 	return FALSE;		/* Found ":t<unrecognised><unrecognised>". */
   2615  1.236    rillig 
   2616  1.289    rillig     /* Check for two-character options: ":tu", ":tl" */
   2617  1.299    rillig     if (mod[1] == 'A') {	/* absolute path */
   2618  1.301    rillig 	st->newStr = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->nstr,
   2619  1.291    rillig 				 ModifyWord_Realpath, NULL);
   2620  1.299    rillig 	st->cp = mod + 2;
   2621  1.289    rillig 	st->termc = *st->cp;
   2622  1.299    rillig     } else if (mod[1] == 'u') {
   2623  1.289    rillig 	char *dp = bmake_strdup(st->nstr);
   2624  1.289    rillig 	for (st->newStr = dp; *dp; dp++)
   2625  1.289    rillig 	    *dp = toupper((unsigned char)*dp);
   2626  1.299    rillig 	st->cp = mod + 2;
   2627  1.289    rillig 	st->termc = *st->cp;
   2628  1.299    rillig     } else if (mod[1] == 'l') {
   2629  1.289    rillig 	char *dp = bmake_strdup(st->nstr);
   2630  1.289    rillig 	for (st->newStr = dp; *dp; dp++)
   2631  1.289    rillig 	    *dp = tolower((unsigned char)*dp);
   2632  1.299    rillig 	st->cp = mod + 2;
   2633  1.289    rillig 	st->termc = *st->cp;
   2634  1.299    rillig     } else if (mod[1] == 'W' || mod[1] == 'w') {
   2635  1.301    rillig 	st->oneBigWord = mod[1] == 'W';
   2636  1.289    rillig 	st->newStr = st->nstr;
   2637  1.299    rillig 	st->cp = mod + 2;
   2638  1.289    rillig 	st->termc = *st->cp;
   2639  1.236    rillig     } else {
   2640  1.289    rillig 	/* Found ":t<unrecognised>:" or ":t<unrecognised><endc>". */
   2641  1.236    rillig 	return FALSE;
   2642  1.236    rillig     }
   2643  1.236    rillig     return TRUE;
   2644  1.236    rillig }
   2645  1.236    rillig 
   2646  1.236    rillig /* :[#], :[1], etc. */
   2647  1.236    rillig static int
   2648  1.299    rillig ApplyModifier_Words(const char *mod, ApplyModifiersState *st)
   2649  1.236    rillig {
   2650  1.299    rillig     st->cp = mod + 1;	/* point to char after '[' */
   2651  1.298    rillig     char delim = ']';		/* look for closing ']' */
   2652  1.298    rillig     char *estr = ParseModifierPart(st->ctxt, &st->cp, delim, st->eflags,
   2653  1.266    rillig 				   NULL, NULL, NULL);
   2654  1.298    rillig     if (estr == NULL) {
   2655  1.298    rillig 	st->missing_delim = delim;
   2656  1.298    rillig 	return 'c';
   2657  1.298    rillig     }
   2658  1.288    rillig 
   2659  1.236    rillig     /* now st->cp points just after the closing ']' */
   2660  1.288    rillig     if (st->cp[0] != ':' && st->cp[0] != st->endc)
   2661  1.288    rillig 	goto bad_modifier;	/* Found junk after ']' */
   2662  1.288    rillig 
   2663  1.288    rillig     if (estr[0] == '\0')
   2664  1.288    rillig 	goto bad_modifier;	/* empty square brackets in ":[]". */
   2665  1.236    rillig 
   2666  1.288    rillig     if (estr[0] == '#' && estr[1] == '\0') { /* Found ":[#]" */
   2667  1.236    rillig 	/*
   2668  1.288    rillig 	 * We will need enough space for the decimal representation of an int.
   2669  1.288    rillig 	 * We calculate the space needed for the octal representation, and add
   2670  1.288    rillig 	 * enough slop to cope with a '-' sign (which should never be needed)
   2671  1.288    rillig 	 * and a '\0' string terminator.
   2672  1.236    rillig 	 */
   2673  1.236    rillig 	int newStrSize = (sizeof(int) * CHAR_BIT + 2) / 3 + 2;
   2674  1.236    rillig 
   2675  1.236    rillig 	st->newStr = bmake_malloc(newStrSize);
   2676  1.301    rillig 	if (st->oneBigWord) {
   2677  1.236    rillig 	    strncpy(st->newStr, "1", newStrSize);
   2678  1.236    rillig 	} else {
   2679  1.236    rillig 	    /* XXX: brk_string() is a rather expensive
   2680  1.236    rillig 	     * way of counting words. */
   2681  1.236    rillig 	    char **av;
   2682  1.236    rillig 	    char *as;
   2683  1.236    rillig 	    int ac;
   2684  1.236    rillig 
   2685  1.236    rillig 	    av = brk_string(st->nstr, &ac, FALSE, &as);
   2686  1.242    rillig 	    snprintf(st->newStr, newStrSize, "%d", ac);
   2687  1.236    rillig 	    free(as);
   2688  1.236    rillig 	    free(av);
   2689  1.236    rillig 	}
   2690  1.288    rillig 	goto ok;
   2691  1.288    rillig     }
   2692  1.288    rillig 
   2693  1.288    rillig     if (estr[0] == '*' && estr[1] == '\0') {
   2694  1.236    rillig 	/* Found ":[*]" */
   2695  1.301    rillig 	st->oneBigWord = TRUE;
   2696  1.236    rillig 	st->newStr = st->nstr;
   2697  1.288    rillig 	goto ok;
   2698  1.288    rillig     }
   2699  1.288    rillig 
   2700  1.288    rillig     if (estr[0] == '@' && estr[1] == '\0') {
   2701  1.236    rillig 	/* Found ":[@]" */
   2702  1.301    rillig 	st->oneBigWord = FALSE;
   2703  1.236    rillig 	st->newStr = st->nstr;
   2704  1.288    rillig 	goto ok;
   2705  1.288    rillig     }
   2706  1.288    rillig 
   2707  1.288    rillig     /*
   2708  1.288    rillig      * We expect estr to contain a single integer for :[N], or two integers
   2709  1.288    rillig      * separated by ".." for :[start..end].
   2710  1.288    rillig      */
   2711  1.288    rillig     char *ep;
   2712  1.290    rillig     int first = strtol(estr, &ep, 0);
   2713  1.290    rillig     int last;
   2714  1.288    rillig     if (ep == estr)		/* Found junk instead of a number */
   2715  1.288    rillig 	goto bad_modifier;
   2716  1.288    rillig 
   2717  1.288    rillig     if (ep[0] == '\0') {	/* Found only one integer in :[N] */
   2718  1.290    rillig 	last = first;
   2719  1.288    rillig     } else if (ep[0] == '.' && ep[1] == '.' && ep[2] != '\0') {
   2720  1.288    rillig 	/* Expecting another integer after ".." */
   2721  1.288    rillig 	ep += 2;
   2722  1.290    rillig 	last = strtol(ep, &ep, 0);
   2723  1.288    rillig 	if (ep[0] != '\0')	/* Found junk after ".." */
   2724  1.288    rillig 	    goto bad_modifier;
   2725  1.288    rillig     } else
   2726  1.288    rillig 	goto bad_modifier;	/* Found junk instead of ".." */
   2727  1.236    rillig 
   2728  1.288    rillig     /*
   2729  1.288    rillig      * Now seldata is properly filled in, but we still have to check for 0 as
   2730  1.288    rillig      * a special case.
   2731  1.288    rillig      */
   2732  1.290    rillig     if (first == 0 && last == 0) {
   2733  1.288    rillig 	/* ":[0]" or perhaps ":[0..0]" */
   2734  1.301    rillig 	st->oneBigWord = TRUE;
   2735  1.288    rillig 	st->newStr = st->nstr;
   2736  1.288    rillig 	goto ok;
   2737  1.236    rillig     }
   2738  1.288    rillig 
   2739  1.288    rillig     /* ":[0..N]" or ":[N..0]" */
   2740  1.290    rillig     if (first == 0 || last == 0)
   2741  1.288    rillig 	goto bad_modifier;
   2742  1.288    rillig 
   2743  1.288    rillig     /* Normal case: select the words described by seldata. */
   2744  1.301    rillig     st->newStr = VarSelectWords(st->sep, st->oneBigWord, st->nstr, first, last);
   2745  1.288    rillig 
   2746  1.288    rillig ok:
   2747  1.288    rillig     st->termc = *st->cp;
   2748  1.288    rillig     free(estr);
   2749  1.288    rillig     return 0;
   2750  1.288    rillig 
   2751  1.288    rillig bad_modifier:
   2752  1.288    rillig     free(estr);
   2753  1.288    rillig     return 'b';
   2754  1.236    rillig }
   2755  1.236    rillig 
   2756  1.236    rillig /* :O or :Ox */
   2757  1.236    rillig static Boolean
   2758  1.299    rillig ApplyModifier_Order(const char *mod, ApplyModifiersState *st)
   2759  1.236    rillig {
   2760  1.236    rillig     char otype;
   2761  1.236    rillig 
   2762  1.299    rillig     st->cp = mod + 1;	/* skip to the rest in any case */
   2763  1.299    rillig     if (mod[1] == st->endc || mod[1] == ':') {
   2764  1.236    rillig 	otype = 's';
   2765  1.236    rillig 	st->termc = *st->cp;
   2766  1.299    rillig     } else if ((mod[1] == 'r' || mod[1] == 'x') &&
   2767  1.299    rillig 	       (mod[2] == st->endc || mod[2] == ':')) {
   2768  1.299    rillig 	otype = mod[1];
   2769  1.299    rillig 	st->cp = mod + 2;
   2770  1.236    rillig 	st->termc = *st->cp;
   2771  1.236    rillig     } else {
   2772  1.236    rillig 	return FALSE;
   2773  1.236    rillig     }
   2774  1.236    rillig     st->newStr = VarOrder(st->nstr, otype);
   2775  1.236    rillig     return TRUE;
   2776  1.236    rillig }
   2777  1.236    rillig 
   2778  1.236    rillig /* :? then : else */
   2779  1.236    rillig static Boolean
   2780  1.299    rillig ApplyModifier_IfElse(const char *mod, ApplyModifiersState *st)
   2781  1.236    rillig {
   2782  1.285    rillig     Boolean value = FALSE;
   2783  1.285    rillig     int cond_rc = 0;
   2784  1.285    rillig     VarEvalFlags then_eflags = st->eflags & ~VARE_WANTRES;
   2785  1.285    rillig     VarEvalFlags else_eflags = st->eflags & ~VARE_WANTRES;
   2786  1.236    rillig 
   2787  1.268    rillig     if (st->eflags & VARE_WANTRES) {
   2788  1.236    rillig 	cond_rc = Cond_EvalExpression(NULL, st->v->name, &value, 0, FALSE);
   2789  1.285    rillig 	if (cond_rc != COND_INVALID && value)
   2790  1.285    rillig 	    then_eflags |= VARE_WANTRES;
   2791  1.285    rillig 	if (cond_rc != COND_INVALID && !value)
   2792  1.285    rillig 	    else_eflags |= VARE_WANTRES;
   2793  1.236    rillig     }
   2794  1.236    rillig 
   2795  1.299    rillig     st->cp = mod + 1;
   2796  1.298    rillig     char delim = ':';
   2797  1.265    rillig     char *then_expr = ParseModifierPart(
   2798  1.298    rillig 	st->ctxt, &st->cp, delim, then_eflags, NULL, NULL, NULL);
   2799  1.298    rillig     if (then_expr == NULL) {
   2800  1.298    rillig 	st->missing_delim = delim;
   2801  1.236    rillig 	return FALSE;
   2802  1.298    rillig     }
   2803  1.236    rillig 
   2804  1.298    rillig     delim = st->endc;		/* BRCLOSE or PRCLOSE */
   2805  1.265    rillig     char *else_expr = ParseModifierPart(
   2806  1.298    rillig 	st->ctxt, &st->cp, delim, else_eflags, NULL, NULL, NULL);
   2807  1.298    rillig     if (else_expr == NULL) {
   2808  1.298    rillig 	st->missing_delim = delim;
   2809  1.236    rillig 	return FALSE;
   2810  1.298    rillig     }
   2811  1.236    rillig 
   2812  1.236    rillig     st->termc = *--st->cp;
   2813  1.236    rillig     if (cond_rc == COND_INVALID) {
   2814  1.236    rillig 	Error("Bad conditional expression `%s' in %s?%s:%s",
   2815  1.258    rillig 	    st->v->name, st->v->name, then_expr, else_expr);
   2816  1.236    rillig 	return FALSE;
   2817  1.236    rillig     }
   2818  1.236    rillig 
   2819  1.236    rillig     if (value) {
   2820  1.258    rillig 	st->newStr = then_expr;
   2821  1.258    rillig 	free(else_expr);
   2822  1.236    rillig     } else {
   2823  1.258    rillig 	st->newStr = else_expr;
   2824  1.270    rillig 	free(then_expr);
   2825  1.236    rillig     }
   2826  1.236    rillig     if (st->v->flags & VAR_JUNK)
   2827  1.236    rillig 	st->v->flags |= VAR_KEEP;
   2828  1.236    rillig     return TRUE;
   2829  1.236    rillig }
   2830  1.236    rillig 
   2831  1.283    rillig /*
   2832  1.283    rillig  * The ::= modifiers actually assign a value to the variable.
   2833  1.283    rillig  * Their main purpose is in supporting modifiers of .for loop
   2834  1.283    rillig  * iterators and other obscure uses.  They always expand to
   2835  1.283    rillig  * nothing.  In a target rule that would otherwise expand to an
   2836  1.283    rillig  * empty line they can be preceded with @: to keep make happy.
   2837  1.283    rillig  * Eg.
   2838  1.283    rillig  *
   2839  1.283    rillig  * foo:	.USE
   2840  1.283    rillig  * .for i in ${.TARGET} ${.TARGET:R}.gz
   2841  1.283    rillig  * 	@: ${t::=$i}
   2842  1.283    rillig  *	@echo blah ${t:T}
   2843  1.283    rillig  * .endfor
   2844  1.283    rillig  *
   2845  1.283    rillig  *	  ::=<str>	Assigns <str> as the new value of variable.
   2846  1.283    rillig  *	  ::?=<str>	Assigns <str> as value of variable if
   2847  1.283    rillig  *			it was not already set.
   2848  1.283    rillig  *	  ::+=<str>	Appends <str> to variable.
   2849  1.283    rillig  *	  ::!=<cmd>	Assigns output of <cmd> as the new value of
   2850  1.283    rillig  *			variable.
   2851  1.283    rillig  */
   2852  1.236    rillig static int
   2853  1.299    rillig ApplyModifier_Assign(const char *mod, ApplyModifiersState *st)
   2854  1.236    rillig {
   2855  1.299    rillig     const char *op = mod + 1;
   2856  1.272    rillig     if (!(op[0] == '=' ||
   2857  1.272    rillig 	(op[1] == '=' &&
   2858  1.272    rillig 	 (op[0] == '!' || op[0] == '+' || op[0] == '?'))))
   2859  1.272    rillig 	return 'd';		/* "::<unrecognised>" */
   2860  1.236    rillig 
   2861  1.272    rillig     GNode *v_ctxt;		/* context where v belongs */
   2862  1.272    rillig 
   2863  1.272    rillig     if (st->v->name[0] == 0)
   2864  1.272    rillig 	return 'b';
   2865  1.272    rillig 
   2866  1.272    rillig     v_ctxt = st->ctxt;
   2867  1.273    rillig     char *sv_name = NULL;
   2868  1.272    rillig     if (st->v->flags & VAR_JUNK) {
   2869  1.272    rillig 	/*
   2870  1.272    rillig 	 * We need to bmake_strdup() it incase ParseModifierPart() recurses.
   2871  1.272    rillig 	 */
   2872  1.272    rillig 	sv_name = st->v->name;
   2873  1.272    rillig 	st->v->name = bmake_strdup(st->v->name);
   2874  1.272    rillig     } else if (st->ctxt != VAR_GLOBAL) {
   2875  1.272    rillig 	Var *gv = VarFind(st->v->name, st->ctxt, 0);
   2876  1.272    rillig 	if (gv == NULL)
   2877  1.272    rillig 	    v_ctxt = VAR_GLOBAL;
   2878  1.272    rillig 	else
   2879  1.272    rillig 	    VarFreeEnv(gv, TRUE);
   2880  1.272    rillig     }
   2881  1.272    rillig 
   2882  1.273    rillig     switch (op[0]) {
   2883  1.272    rillig     case '+':
   2884  1.272    rillig     case '?':
   2885  1.272    rillig     case '!':
   2886  1.299    rillig 	st->cp = mod + 3;
   2887  1.272    rillig 	break;
   2888  1.272    rillig     default:
   2889  1.299    rillig 	st->cp = mod + 2;
   2890  1.272    rillig 	break;
   2891  1.272    rillig     }
   2892  1.272    rillig 
   2893  1.298    rillig     char delim = st->startc == PROPEN ? PRCLOSE : BRCLOSE;
   2894  1.287    rillig     VarEvalFlags eflags = (st->eflags & VARE_WANTRES) ? 0 : VARE_NOSUBST;
   2895  1.298    rillig     char *val = ParseModifierPart(st->ctxt, &st->cp, delim,
   2896  1.287    rillig 				  st->eflags | eflags, NULL, NULL, NULL);
   2897  1.272    rillig     if (st->v->flags & VAR_JUNK) {
   2898  1.272    rillig 	/* restore original name */
   2899  1.272    rillig 	free(st->v->name);
   2900  1.272    rillig 	st->v->name = sv_name;
   2901  1.272    rillig     }
   2902  1.298    rillig     if (val == NULL) {
   2903  1.298    rillig 	st->missing_delim = delim;
   2904  1.272    rillig 	return 'c';
   2905  1.298    rillig     }
   2906  1.236    rillig 
   2907  1.272    rillig     st->termc = *--st->cp;
   2908  1.236    rillig 
   2909  1.272    rillig     if (st->eflags & VARE_WANTRES) {
   2910  1.273    rillig 	switch (op[0]) {
   2911  1.236    rillig 	case '+':
   2912  1.273    rillig 	    Var_Append(st->v->name, val, v_ctxt);
   2913  1.272    rillig 	    break;
   2914  1.273    rillig 	case '!': {
   2915  1.273    rillig 	    const char *emsg;
   2916  1.273    rillig 	    st->newStr = Cmd_Exec(val, &emsg);
   2917  1.272    rillig 	    if (emsg)
   2918  1.272    rillig 		Error(emsg, st->nstr);
   2919  1.272    rillig 	    else
   2920  1.272    rillig 		Var_Set(st->v->name, st->newStr, v_ctxt);
   2921  1.272    rillig 	    free(st->newStr);
   2922  1.236    rillig 	    break;
   2923  1.273    rillig 	}
   2924  1.272    rillig 	case '?':
   2925  1.272    rillig 	    if ((st->v->flags & VAR_JUNK) == 0)
   2926  1.272    rillig 		break;
   2927  1.272    rillig 	    /* FALLTHROUGH */
   2928  1.236    rillig 	default:
   2929  1.273    rillig 	    Var_Set(st->v->name, val, v_ctxt);
   2930  1.236    rillig 	    break;
   2931  1.236    rillig 	}
   2932  1.236    rillig     }
   2933  1.273    rillig     free(val);
   2934  1.272    rillig     st->newStr = varNoError;
   2935  1.272    rillig     return 0;
   2936  1.236    rillig }
   2937  1.236    rillig 
   2938  1.236    rillig /* remember current value */
   2939  1.236    rillig static Boolean
   2940  1.299    rillig ApplyModifier_Remember(const char *mod, ApplyModifiersState *st)
   2941  1.236    rillig {
   2942  1.299    rillig     st->cp = mod + 1;	/* make sure it is set */
   2943  1.299    rillig     if (!STRMOD_MATCHX(mod, "_", 1))
   2944  1.236    rillig 	return FALSE;
   2945  1.236    rillig 
   2946  1.299    rillig     if (mod[1] == '=') {
   2947  1.236    rillig 	char *np;
   2948  1.236    rillig 	int n;
   2949  1.236    rillig 
   2950  1.236    rillig 	st->cp++;
   2951  1.236    rillig 	n = strcspn(st->cp, ":)}");
   2952  1.249    rillig 	np = bmake_strndup(st->cp, n + 1);
   2953  1.236    rillig 	np[n] = '\0';
   2954  1.299    rillig 	st->cp = mod + 2 + n;
   2955  1.236    rillig 	Var_Set(np, st->nstr, st->ctxt);
   2956  1.236    rillig 	free(np);
   2957  1.236    rillig     } else {
   2958  1.236    rillig 	Var_Set("_", st->nstr, st->ctxt);
   2959  1.236    rillig     }
   2960  1.236    rillig     st->newStr = st->nstr;
   2961  1.236    rillig     st->termc = *st->cp;
   2962  1.236    rillig     return TRUE;
   2963  1.236    rillig }
   2964  1.236    rillig 
   2965  1.236    rillig #ifdef SYSVVARSUB
   2966  1.236    rillig /* :from=to */
   2967  1.236    rillig static int
   2968  1.299    rillig ApplyModifier_SysV(const char *mod, ApplyModifiersState *st)
   2969  1.236    rillig {
   2970  1.276    rillig     Boolean eqFound = FALSE;
   2971  1.245    rillig 
   2972  1.236    rillig     /*
   2973  1.236    rillig      * First we make a pass through the string trying
   2974  1.236    rillig      * to verify it is a SYSV-make-style translation:
   2975  1.236    rillig      * it must be: <string1>=<string2>)
   2976  1.236    rillig      */
   2977  1.299    rillig     st->cp = mod;
   2978  1.262    rillig     int nest = 1;
   2979  1.262    rillig     while (*st->cp != '\0' && nest > 0) {
   2980  1.236    rillig 	if (*st->cp == '=') {
   2981  1.236    rillig 	    eqFound = TRUE;
   2982  1.236    rillig 	    /* continue looking for st->endc */
   2983  1.242    rillig 	} else if (*st->cp == st->endc)
   2984  1.262    rillig 	    nest--;
   2985  1.236    rillig 	else if (*st->cp == st->startc)
   2986  1.262    rillig 	    nest++;
   2987  1.262    rillig 	if (nest > 0)
   2988  1.236    rillig 	    st->cp++;
   2989  1.236    rillig     }
   2990  1.245    rillig     if (*st->cp != st->endc || !eqFound)
   2991  1.245    rillig 	return 0;
   2992  1.236    rillig 
   2993  1.298    rillig     char delim = '=';
   2994  1.299    rillig     st->cp = mod;
   2995  1.298    rillig     char *lhs = ParseModifierPart(st->ctxt, &st->cp, delim, st->eflags,
   2996  1.284    rillig 				  NULL, NULL, NULL);
   2997  1.298    rillig     if (lhs == NULL) {
   2998  1.298    rillig 	st->missing_delim = delim;
   2999  1.245    rillig 	return 'c';
   3000  1.298    rillig     }
   3001  1.245    rillig 
   3002  1.298    rillig     delim = st->endc;
   3003  1.298    rillig     char *rhs = ParseModifierPart(st->ctxt, &st->cp, delim, st->eflags,
   3004  1.276    rillig 				  NULL, NULL, NULL);
   3005  1.298    rillig     if (rhs == NULL) {
   3006  1.298    rillig 	st->missing_delim = delim;
   3007  1.245    rillig 	return 'c';
   3008  1.298    rillig     }
   3009  1.236    rillig 
   3010  1.245    rillig     /*
   3011  1.245    rillig      * SYSV modifications happen through the whole
   3012  1.245    rillig      * string. Note the pattern is anchored at the end.
   3013  1.245    rillig      */
   3014  1.245    rillig     st->termc = *--st->cp;
   3015  1.276    rillig     if (lhs[0] == '\0' && *st->nstr == '\0') {
   3016  1.245    rillig 	st->newStr = st->nstr;	/* special case */
   3017  1.245    rillig     } else {
   3018  1.295    rillig 	ModifyWord_SYSVSubstArgs args = { st->ctxt, lhs, rhs };
   3019  1.301    rillig 	st->newStr = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->nstr,
   3020  1.291    rillig 				 ModifyWord_SYSVSubst, &args);
   3021  1.245    rillig     }
   3022  1.276    rillig     free(lhs);
   3023  1.276    rillig     free(rhs);
   3024  1.245    rillig     return '=';
   3025  1.236    rillig }
   3026  1.236    rillig #endif
   3027  1.236    rillig 
   3028  1.108       sjg /*
   3029  1.108       sjg  * Now we need to apply any modifiers the user wants applied.
   3030  1.108       sjg  * These are:
   3031  1.108       sjg  *  	  :M<pattern>	words which match the given <pattern>.
   3032  1.138       dsl  *  			<pattern> is of the standard file
   3033  1.138       dsl  *  			wildcarding form.
   3034  1.108       sjg  *  	  :N<pattern>	words which do not match the given <pattern>.
   3035  1.108       sjg  *  	  :S<d><pat1><d><pat2><d>[1gW]
   3036  1.138       dsl  *  			Substitute <pat2> for <pat1> in the value
   3037  1.108       sjg  *  	  :C<d><pat1><d><pat2><d>[1gW]
   3038  1.138       dsl  *  			Substitute <pat2> for regex <pat1> in the value
   3039  1.138       dsl  *  	  :H		Substitute the head of each word
   3040  1.138       dsl  *  	  :T		Substitute the tail of each word
   3041  1.138       dsl  *  	  :E		Substitute the extension (minus '.') of
   3042  1.138       dsl  *  			each word
   3043  1.138       dsl  *  	  :R		Substitute the root of each word
   3044  1.138       dsl  *  			(pathname minus the suffix).
   3045  1.138       dsl  *	  :O		("Order") Alphabeticaly sort words in variable.
   3046  1.138       dsl  *	  :Ox		("intermiX") Randomize words in variable.
   3047  1.138       dsl  *	  :u		("uniq") Remove adjacent duplicate words.
   3048  1.138       dsl  *	  :tu		Converts the variable contents to uppercase.
   3049  1.138       dsl  *	  :tl		Converts the variable contents to lowercase.
   3050  1.138       dsl  *	  :ts[c]	Sets varSpace - the char used to
   3051  1.138       dsl  *			separate words to 'c'. If 'c' is
   3052  1.138       dsl  *			omitted then no separation is used.
   3053  1.138       dsl  *	  :tW		Treat the variable contents as a single
   3054  1.138       dsl  *			word, even if it contains spaces.
   3055  1.138       dsl  *			(Mnemonic: one big 'W'ord.)
   3056  1.138       dsl  *	  :tw		Treat the variable contents as multiple
   3057  1.138       dsl  *			space-separated words.
   3058  1.138       dsl  *			(Mnemonic: many small 'w'ords.)
   3059  1.138       dsl  *	  :[index]	Select a single word from the value.
   3060  1.138       dsl  *	  :[start..end]	Select multiple words from the value.
   3061  1.138       dsl  *	  :[*] or :[0]	Select the entire value, as a single
   3062  1.138       dsl  *			word.  Equivalent to :tW.
   3063  1.138       dsl  *	  :[@]		Select the entire value, as multiple
   3064  1.138       dsl  *			words.	Undoes the effect of :[*].
   3065  1.138       dsl  *			Equivalent to :tw.
   3066  1.138       dsl  *	  :[#]		Returns the number of words in the value.
   3067  1.138       dsl  *
   3068  1.138       dsl  *	  :?<true-value>:<false-value>
   3069  1.138       dsl  *			If the variable evaluates to true, return
   3070  1.138       dsl  *			true value, else return the second value.
   3071  1.138       dsl  *    	  :lhs=rhs  	Like :S, but the rhs goes to the end of
   3072  1.138       dsl  *    			the invocation.
   3073  1.138       dsl  *	  :sh		Treat the current value as a command
   3074  1.138       dsl  *			to be run, new value is its output.
   3075  1.108       sjg  * The following added so we can handle ODE makefiles.
   3076  1.138       dsl  *	  :@<tmpvar>@<newval>@
   3077  1.138       dsl  *			Assign a temporary local variable <tmpvar>
   3078  1.138       dsl  *			to the current value of each word in turn
   3079  1.138       dsl  *			and replace each word with the result of
   3080  1.138       dsl  *			evaluating <newval>
   3081  1.138       dsl  *	  :D<newval>	Use <newval> as value if variable defined
   3082  1.138       dsl  *	  :U<newval>	Use <newval> as value if variable undefined
   3083  1.138       dsl  *	  :L		Use the name of the variable as the value.
   3084  1.138       dsl  *	  :P		Use the path of the node that has the same
   3085  1.138       dsl  *			name as the variable as the value.  This
   3086  1.138       dsl  *			basically includes an implied :L so that
   3087  1.138       dsl  *			the common method of refering to the path
   3088  1.138       dsl  *			of your dependent 'x' in a rule is to use
   3089  1.138       dsl  *			the form '${x:P}'.
   3090  1.138       dsl  *	  :!<cmd>!	Run cmd much the same as :sh run's the
   3091  1.138       dsl  *			current value of the variable.
   3092  1.283    rillig  * Assignment operators (see ApplyModifier_Assign).
   3093    1.1       cgd  */
   3094  1.108       sjg static char *
   3095  1.108       sjg ApplyModifiers(char *nstr, const char *tstr,
   3096  1.236    rillig 	       int const startc, int const endc,
   3097  1.268    rillig 	       Var * const v, GNode * const ctxt, VarEvalFlags const eflags,
   3098  1.236    rillig 	       int * const lengthPtr, void ** const freePtr)
   3099  1.236    rillig {
   3100  1.236    rillig     ApplyModifiersState st = {
   3101  1.268    rillig 	startc, endc, v, ctxt, eflags, lengthPtr, freePtr,
   3102  1.299    rillig 	nstr, tstr, tstr,
   3103  1.301    rillig 	'\0', '\0', 0, ' ', FALSE, NULL
   3104  1.236    rillig     };
   3105   1.15  christos 
   3106  1.299    rillig     const char *p = tstr;
   3107  1.299    rillig     while (*p != '\0' && *p != endc) {
   3108  1.142       dsl 
   3109  1.299    rillig 	if (*p == '$') {
   3110  1.142       dsl 	    /*
   3111  1.167       sjg 	     * We may have some complex modifiers in a variable.
   3112    1.1       cgd 	     */
   3113  1.108       sjg 	    void *freeIt;
   3114  1.108       sjg 	    char *rval;
   3115  1.127  christos 	    int rlen;
   3116  1.167       sjg 	    int c;
   3117   1.22  christos 
   3118  1.299    rillig 	    rval = Var_Parse(p, st.ctxt, st.eflags, &rlen, &freeIt);
   3119    1.1       cgd 
   3120  1.167       sjg 	    /*
   3121  1.236    rillig 	     * If we have not parsed up to st.endc or ':',
   3122  1.167       sjg 	     * we are not interested.
   3123  1.167       sjg 	     */
   3124  1.167       sjg 	    if (rval != NULL && *rval &&
   3125  1.299    rillig 		(c = p[rlen]) != '\0' &&
   3126  1.167       sjg 		c != ':' &&
   3127  1.236    rillig 		c != st.endc) {
   3128  1.196  christos 		free(freeIt);
   3129  1.167       sjg 		goto apply_mods;
   3130  1.167       sjg 	    }
   3131  1.167       sjg 
   3132  1.108       sjg 	    if (DEBUG(VAR)) {
   3133  1.114       dsl 		fprintf(debug_file, "Got '%s' from '%.*s'%.*s\n",
   3134  1.299    rillig 		       rval, rlen, p, rlen, p + rlen);
   3135   1.22  christos 	    }
   3136    1.1       cgd 
   3137  1.299    rillig 	    p += rlen;
   3138   1.15  christos 
   3139  1.108       sjg 	    if (rval != NULL && *rval) {
   3140  1.127  christos 		int used;
   3141   1.15  christos 
   3142  1.236    rillig 		st.nstr = ApplyModifiers(st.nstr, rval, 0, 0, st.v,
   3143  1.268    rillig 				      st.ctxt, st.eflags, &used, st.freePtr);
   3144  1.236    rillig 		if (st.nstr == var_Error
   3145  1.268    rillig 		    || (st.nstr == varNoError && (st.eflags & VARE_UNDEFERR) == 0)
   3146  1.111    rillig 		    || strlen(rval) != (size_t) used) {
   3147  1.196  christos 		    free(freeIt);
   3148  1.240    rillig 		    goto out;	/* error already reported */
   3149    1.1       cgd 		}
   3150    1.1       cgd 	    }
   3151  1.196  christos 	    free(freeIt);
   3152  1.299    rillig 	    if (*p == ':')
   3153  1.299    rillig 		p++;
   3154  1.299    rillig 	    else if (*p == '\0' && endc != '\0') {
   3155  1.246    rillig 		Error("Unclosed variable specification after complex "
   3156  1.246    rillig 		    "modifier (expecting '%c') for %s", st.endc, st.v->name);
   3157  1.119       sjg 		goto out;
   3158  1.119       sjg 	    }
   3159  1.108       sjg 	    continue;
   3160  1.108       sjg 	}
   3161  1.167       sjg     apply_mods:
   3162  1.108       sjg 	if (DEBUG(VAR)) {
   3163  1.236    rillig 	    fprintf(debug_file, "Applying[%s] :%c to \"%s\"\n", st.v->name,
   3164  1.299    rillig 		*p, st.nstr);
   3165    1.1       cgd 	}
   3166  1.236    rillig 	st.newStr = var_Error;
   3167  1.299    rillig 	switch ((st.modifier = *p)) {
   3168  1.108       sjg 	case ':':
   3169    1.1       cgd 	    {
   3170  1.299    rillig 		int res = ApplyModifier_Assign(p, &st);
   3171  1.236    rillig 		if (res == 'b')
   3172  1.236    rillig 		    goto bad_modifier;
   3173  1.236    rillig 		if (res == 'c')
   3174  1.108       sjg 		    goto cleanup;
   3175  1.236    rillig 		if (res == 'd')
   3176  1.236    rillig 		    goto default_case;
   3177  1.108       sjg 		break;
   3178  1.108       sjg 	    }
   3179  1.236    rillig 	case '@':
   3180  1.299    rillig 	    ApplyModifier_Loop(p, &st);
   3181  1.236    rillig 	    break;
   3182  1.236    rillig 	case '_':
   3183  1.299    rillig 	    if (!ApplyModifier_Remember(p, &st))
   3184  1.236    rillig 		goto default_case;
   3185  1.236    rillig 	    break;
   3186  1.108       sjg 	case 'D':
   3187  1.108       sjg 	case 'U':
   3188  1.299    rillig 	    ApplyModifier_Defined(p, &st);
   3189  1.236    rillig 	    break;
   3190  1.108       sjg 	case 'L':
   3191  1.108       sjg 	    {
   3192  1.236    rillig 		if ((st.v->flags & VAR_JUNK) != 0)
   3193  1.236    rillig 		    st.v->flags |= VAR_KEEP;
   3194  1.236    rillig 		st.newStr = bmake_strdup(st.v->name);
   3195  1.299    rillig 		st.cp = p + 1;
   3196  1.299    rillig 		st.termc = *st.cp;
   3197  1.108       sjg 		break;
   3198  1.108       sjg 	    }
   3199  1.108       sjg 	case 'P':
   3200  1.299    rillig 	    ApplyModifier_Path(p, &st);
   3201  1.236    rillig 	    break;
   3202  1.108       sjg 	case '!':
   3203  1.299    rillig 	    if (!ApplyModifier_Exclam(p, &st))
   3204  1.236    rillig 		goto cleanup;
   3205  1.236    rillig 	    break;
   3206  1.236    rillig 	case '[':
   3207  1.108       sjg 	    {
   3208  1.299    rillig 		int res = ApplyModifier_Words(p, &st);
   3209  1.236    rillig 		if (res == 'b')
   3210  1.236    rillig 		    goto bad_modifier;
   3211  1.236    rillig 		if (res == 'c')
   3212  1.108       sjg 		    goto cleanup;
   3213  1.108       sjg 		break;
   3214  1.108       sjg 	    }
   3215  1.164       sjg 	case 'g':
   3216  1.299    rillig 	    if (!ApplyModifier_Gmtime(p, &st))
   3217  1.165       sjg 		goto default_case;
   3218  1.164       sjg 	    break;
   3219  1.163     joerg 	case 'h':
   3220  1.299    rillig 	    if (!ApplyModifier_Hash(p, &st))
   3221  1.165       sjg 		goto default_case;
   3222  1.163     joerg 	    break;
   3223  1.164       sjg 	case 'l':
   3224  1.299    rillig 	    if (!ApplyModifier_Localtime(p, &st))
   3225  1.165       sjg 		goto default_case;
   3226  1.164       sjg 	    break;
   3227  1.108       sjg 	case 't':
   3228  1.299    rillig 	    if (!ApplyModifier_To(p, &st))
   3229  1.236    rillig 		goto bad_modifier;
   3230  1.236    rillig 	    break;
   3231  1.108       sjg 	case 'N':
   3232  1.108       sjg 	case 'M':
   3233  1.299    rillig 	    ApplyModifier_Match(p, &st);
   3234  1.236    rillig 	    break;
   3235  1.108       sjg 	case 'S':
   3236  1.299    rillig 	    if (!ApplyModifier_Subst(p, &st))
   3237  1.236    rillig 		goto cleanup;
   3238  1.236    rillig 	    break;
   3239  1.108       sjg 	case '?':
   3240  1.299    rillig 	    if (!ApplyModifier_IfElse(p, &st))
   3241  1.236    rillig 		goto cleanup;
   3242  1.236    rillig 	    break;
   3243  1.108       sjg #ifndef NO_REGEX
   3244  1.108       sjg 	case 'C':
   3245  1.299    rillig 	    if (!ApplyModifier_Regex(p, &st))
   3246  1.236    rillig 		goto cleanup;
   3247  1.236    rillig 	    break;
   3248  1.108       sjg #endif
   3249  1.220  christos 	case 'q':
   3250  1.108       sjg 	case 'Q':
   3251  1.299    rillig 	    if (p[1] == st.endc || p[1] == ':') {
   3252  1.236    rillig 		st.newStr = VarQuote(st.nstr, st.modifier == 'q');
   3253  1.299    rillig 		st.cp = p + 1;
   3254  1.236    rillig 		st.termc = *st.cp;
   3255  1.108       sjg 		break;
   3256  1.108       sjg 	    }
   3257  1.108       sjg 	    goto default_case;
   3258  1.108       sjg 	case 'T':
   3259  1.299    rillig 	    if (p[1] == st.endc || p[1] == ':') {
   3260  1.301    rillig 		st.newStr = ModifyWords(st.ctxt, st.sep, st.oneBigWord,
   3261  1.301    rillig 					st.nstr, ModifyWord_Tail, NULL);
   3262  1.299    rillig 		st.cp = p + 1;
   3263  1.236    rillig 		st.termc = *st.cp;
   3264  1.108       sjg 		break;
   3265  1.108       sjg 	    }
   3266  1.108       sjg 	    goto default_case;
   3267  1.108       sjg 	case 'H':
   3268  1.299    rillig 	    if (p[1] == st.endc || p[1] == ':') {
   3269  1.301    rillig 		st.newStr = ModifyWords(st.ctxt, st.sep, st.oneBigWord,
   3270  1.301    rillig 					st.nstr, ModifyWord_Head, NULL);
   3271  1.299    rillig 		st.cp = p + 1;
   3272  1.236    rillig 		st.termc = *st.cp;
   3273  1.108       sjg 		break;
   3274  1.108       sjg 	    }
   3275  1.108       sjg 	    goto default_case;
   3276  1.108       sjg 	case 'E':
   3277  1.299    rillig 	    if (p[1] == st.endc || p[1] == ':') {
   3278  1.301    rillig 		st.newStr = ModifyWords(st.ctxt, st.sep, st.oneBigWord,
   3279  1.301    rillig 					st.nstr, ModifyWord_Suffix, NULL);
   3280  1.299    rillig 		st.cp = p + 1;
   3281  1.236    rillig 		st.termc = *st.cp;
   3282  1.108       sjg 		break;
   3283  1.108       sjg 	    }
   3284  1.108       sjg 	    goto default_case;
   3285  1.108       sjg 	case 'R':
   3286  1.299    rillig 	    if (p[1] == st.endc || p[1] == ':') {
   3287  1.301    rillig 		st.newStr = ModifyWords(st.ctxt, st.sep, st.oneBigWord,
   3288  1.301    rillig 					st.nstr, ModifyWord_Root, NULL);
   3289  1.299    rillig 		st.cp = p + 1;
   3290  1.236    rillig 		st.termc = *st.cp;
   3291  1.108       sjg 		break;
   3292  1.108       sjg 	    }
   3293  1.108       sjg 	    goto default_case;
   3294  1.210       sjg 	case 'r':
   3295  1.299    rillig 	    if (!ApplyModifier_Range(p, &st))
   3296  1.236    rillig 		goto default_case;
   3297  1.236    rillig 	    break;
   3298  1.108       sjg 	case 'O':
   3299  1.299    rillig 	    if (!ApplyModifier_Order(p, &st))
   3300  1.236    rillig 		goto bad_modifier;
   3301  1.236    rillig 	    break;
   3302  1.108       sjg 	case 'u':
   3303  1.299    rillig 	    if (p[1] == st.endc || p[1] == ':') {
   3304  1.236    rillig 		st.newStr = VarUniq(st.nstr);
   3305  1.299    rillig 		st.cp = p + 1;
   3306  1.236    rillig 		st.termc = *st.cp;
   3307  1.108       sjg 		break;
   3308  1.108       sjg 	    }
   3309  1.108       sjg 	    goto default_case;
   3310  1.108       sjg #ifdef SUNSHCMD
   3311  1.108       sjg 	case 's':
   3312  1.299    rillig 	    if (p[1] == 'h' && (p[2] == st.endc || p[2] == ':')) {
   3313  1.108       sjg 		const char *emsg;
   3314  1.268    rillig 		if (st.eflags & VARE_WANTRES) {
   3315  1.236    rillig 		    st.newStr = Cmd_Exec(st.nstr, &emsg);
   3316  1.197       sjg 		    if (emsg)
   3317  1.236    rillig 			Error(emsg, st.nstr);
   3318  1.197       sjg 		} else
   3319  1.236    rillig 		    st.newStr = varNoError;
   3320  1.299    rillig 		st.cp = p + 2;
   3321  1.236    rillig 		st.termc = *st.cp;
   3322  1.108       sjg 		break;
   3323  1.108       sjg 	    }
   3324  1.108       sjg 	    goto default_case;
   3325  1.108       sjg #endif
   3326  1.108       sjg 	default:
   3327  1.142       dsl 	default_case:
   3328  1.236    rillig 	    {
   3329  1.108       sjg #ifdef SYSVVARSUB
   3330  1.299    rillig 		int res = ApplyModifier_SysV(p, &st);
   3331  1.236    rillig 		if (res == 'c')
   3332  1.108       sjg 		    goto cleanup;
   3333  1.236    rillig 		if (res != '=')
   3334  1.108       sjg #endif
   3335  1.108       sjg 		{
   3336  1.299    rillig 		    Error("Unknown modifier '%c'", *p);
   3337  1.299    rillig 		    for (st.cp = p + 1;
   3338  1.236    rillig 			 *st.cp != ':' && *st.cp != st.endc && *st.cp != '\0';
   3339  1.236    rillig 			 st.cp++)
   3340  1.108       sjg 			continue;
   3341  1.236    rillig 		    st.termc = *st.cp;
   3342  1.236    rillig 		    st.newStr = var_Error;
   3343  1.108       sjg 		}
   3344  1.108       sjg 	    }
   3345  1.108       sjg 	}
   3346  1.108       sjg 	if (DEBUG(VAR)) {
   3347  1.172  christos 	    fprintf(debug_file, "Result[%s] of :%c is \"%s\"\n",
   3348  1.236    rillig 		st.v->name, st.modifier, st.newStr);
   3349  1.108       sjg 	}
   3350   1.25  christos 
   3351  1.236    rillig 	if (st.newStr != st.nstr) {
   3352  1.236    rillig 	    if (*st.freePtr) {
   3353  1.236    rillig 		free(st.nstr);
   3354  1.236    rillig 		*st.freePtr = NULL;
   3355  1.108       sjg 	    }
   3356  1.236    rillig 	    st.nstr = st.newStr;
   3357  1.236    rillig 	    if (st.nstr != var_Error && st.nstr != varNoError) {
   3358  1.236    rillig 		*st.freePtr = st.nstr;
   3359  1.108       sjg 	    }
   3360  1.108       sjg 	}
   3361  1.236    rillig 	if (st.termc == '\0' && st.endc != '\0') {
   3362  1.246    rillig 	    Error("Unclosed variable specification (expecting '%c') "
   3363  1.246    rillig 		"for \"%s\" (value \"%s\") modifier %c",
   3364  1.246    rillig 		st.endc, st.v->name, st.nstr, st.modifier);
   3365  1.236    rillig 	} else if (st.termc == ':') {
   3366  1.236    rillig 	    st.cp++;
   3367  1.108       sjg 	}
   3368  1.299    rillig 	p = st.cp;
   3369  1.108       sjg     }
   3370  1.240    rillig out:
   3371  1.299    rillig     *st.lengthPtr = p - st.start;
   3372  1.236    rillig     return st.nstr;
   3373   1.25  christos 
   3374  1.240    rillig bad_modifier:
   3375  1.299    rillig     Error("Bad modifier `:%.*s' for %s",
   3376  1.299    rillig 	  (int)strcspn(p, ":)}"), p, st.v->name);
   3377   1.25  christos 
   3378  1.240    rillig cleanup:
   3379  1.236    rillig     *st.lengthPtr = st.cp - st.start;
   3380  1.298    rillig     if (st.missing_delim != '\0')
   3381  1.108       sjg 	Error("Unclosed substitution for %s (%c missing)",
   3382  1.298    rillig 	      st.v->name, st.missing_delim);
   3383  1.236    rillig     free(*st.freePtr);
   3384  1.236    rillig     *st.freePtr = NULL;
   3385  1.231    rillig     return var_Error;
   3386  1.108       sjg }
   3387   1.25  christos 
   3388  1.108       sjg /*-
   3389  1.108       sjg  *-----------------------------------------------------------------------
   3390  1.108       sjg  * Var_Parse --
   3391  1.108       sjg  *	Given the start of a variable invocation, extract the variable
   3392  1.108       sjg  *	name and find its value, then modify it according to the
   3393  1.108       sjg  *	specification.
   3394  1.108       sjg  *
   3395  1.108       sjg  * Input:
   3396  1.108       sjg  *	str		The string to parse
   3397  1.108       sjg  *	ctxt		The context for the variable
   3398  1.259    rillig  *	flags		VARE_UNDEFERR	if undefineds are an error
   3399  1.259    rillig  *			VARE_WANTRES	if we actually want the result
   3400  1.259    rillig  *			VARE_ASSIGN	if we are in a := assignment
   3401  1.108       sjg  *	lengthPtr	OUT: The length of the specification
   3402  1.121       apb  *	freePtr		OUT: Non-NULL if caller should free *freePtr
   3403  1.108       sjg  *
   3404  1.108       sjg  * Results:
   3405  1.108       sjg  *	The (possibly-modified) value of the variable or var_Error if the
   3406  1.108       sjg  *	specification is invalid. The length of the specification is
   3407  1.108       sjg  *	placed in *lengthPtr (for invalid specifications, this is just
   3408  1.108       sjg  *	2...?).
   3409  1.121       apb  *	If *freePtr is non-NULL then it's a pointer that the caller
   3410  1.121       apb  *	should pass to free() to free memory used by the result.
   3411  1.108       sjg  *
   3412  1.108       sjg  * Side Effects:
   3413  1.108       sjg  *	None.
   3414  1.108       sjg  *
   3415  1.108       sjg  *-----------------------------------------------------------------------
   3416  1.108       sjg  */
   3417  1.108       sjg /* coverity[+alloc : arg-*4] */
   3418  1.108       sjg char *
   3419  1.259    rillig Var_Parse(const char *str, GNode *ctxt, VarEvalFlags flags,
   3420  1.202  christos 	  int *lengthPtr, void **freePtr)
   3421  1.108       sjg {
   3422  1.240    rillig     const char	*tstr;		/* Pointer into str */
   3423  1.240    rillig     Var		*v;		/* Variable in invocation */
   3424  1.240    rillig     Boolean 	 haveModifier;	/* TRUE if have modifiers for the variable */
   3425  1.240    rillig     char	 endc;		/* Ending character when variable in parens
   3426  1.108       sjg 				 * or braces */
   3427  1.240    rillig     char	 startc;	/* Starting character when variable in parens
   3428  1.108       sjg 				 * or braces */
   3429  1.240    rillig     int		 vlen;		/* Length of variable name */
   3430  1.240    rillig     const char 	*start;		/* Points to original start of str */
   3431  1.240    rillig     char	*nstr;		/* New string, used during expansion */
   3432  1.240    rillig     Boolean	 dynamic;	/* TRUE if the variable is local and we're
   3433  1.108       sjg 				 * expanding it in a non-local context. This
   3434  1.108       sjg 				 * is done to support dynamic sources. The
   3435  1.108       sjg 				 * result is just the invocation, unaltered */
   3436  1.240    rillig     const char	*extramodifiers; /* extra modifiers to apply first */
   3437  1.240    rillig     char	 name[2];
   3438    1.1       cgd 
   3439  1.108       sjg     *freePtr = NULL;
   3440  1.191  dholland     extramodifiers = NULL;
   3441  1.108       sjg     dynamic = FALSE;
   3442  1.108       sjg     start = str;
   3443    1.1       cgd 
   3444  1.141       dsl     startc = str[1];
   3445  1.141       dsl     if (startc != PROPEN && startc != BROPEN) {
   3446  1.108       sjg 	/*
   3447  1.108       sjg 	 * If it's not bounded by braces of some sort, life is much simpler.
   3448  1.108       sjg 	 * We just need to check for the first character and return the
   3449  1.108       sjg 	 * value if it exists.
   3450  1.108       sjg 	 */
   3451   1.15  christos 
   3452  1.141       dsl 	/* Error out some really stupid names */
   3453  1.141       dsl 	if (startc == '\0' || strchr(")}:$", startc)) {
   3454  1.141       dsl 	    *lengthPtr = 1;
   3455  1.141       dsl 	    return var_Error;
   3456  1.141       dsl 	}
   3457  1.141       dsl 	name[0] = startc;
   3458  1.108       sjg 	name[1] = '\0';
   3459   1.16  christos 
   3460  1.108       sjg 	v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
   3461  1.136       dsl 	if (v == NULL) {
   3462  1.108       sjg 	    *lengthPtr = 2;
   3463    1.1       cgd 
   3464  1.108       sjg 	    if ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)) {
   3465  1.108       sjg 		/*
   3466  1.108       sjg 		 * If substituting a local variable in a non-local context,
   3467  1.108       sjg 		 * assume it's for dynamic source stuff. We have to handle
   3468  1.108       sjg 		 * this specially and return the longhand for the variable
   3469  1.108       sjg 		 * with the dollar sign escaped so it makes it back to the
   3470  1.108       sjg 		 * caller. Only four of the local variables are treated
   3471  1.108       sjg 		 * specially as they are the only four that will be set
   3472  1.108       sjg 		 * when dynamic sources are expanded.
   3473  1.108       sjg 		 */
   3474  1.108       sjg 		switch (str[1]) {
   3475  1.242    rillig 		case '@':
   3476  1.242    rillig 		    return UNCONST("$(.TARGET)");
   3477  1.242    rillig 		case '%':
   3478  1.242    rillig 		    return UNCONST("$(.MEMBER)");
   3479  1.242    rillig 		case '*':
   3480  1.242    rillig 		    return UNCONST("$(.PREFIX)");
   3481  1.242    rillig 		case '!':
   3482  1.242    rillig 		    return UNCONST("$(.ARCHIVE)");
   3483  1.108       sjg 		}
   3484  1.108       sjg 	    }
   3485  1.259    rillig 	    return (flags & VARE_UNDEFERR) ? var_Error : varNoError;
   3486  1.108       sjg 	} else {
   3487  1.108       sjg 	    haveModifier = FALSE;
   3488  1.108       sjg 	    tstr = &str[1];
   3489  1.108       sjg 	    endc = str[1];
   3490  1.108       sjg 	}
   3491  1.123       apb     } else {
   3492  1.240    rillig 	Buffer buf;		/* Holds the variable name */
   3493  1.185       sjg 	int depth = 1;
   3494    1.1       cgd 
   3495  1.108       sjg 	endc = startc == PROPEN ? PRCLOSE : BRCLOSE;
   3496  1.146       dsl 	Buf_Init(&buf, 0);
   3497    1.1       cgd 
   3498  1.108       sjg 	/*
   3499  1.108       sjg 	 * Skip to the end character or a colon, whichever comes first.
   3500  1.108       sjg 	 */
   3501  1.249    rillig 	for (tstr = str + 2; *tstr != '\0'; tstr++) {
   3502  1.240    rillig 	    /* Track depth so we can spot parse errors. */
   3503  1.240    rillig 	    if (*tstr == startc)
   3504  1.185       sjg 		depth++;
   3505  1.185       sjg 	    if (*tstr == endc) {
   3506  1.185       sjg 		if (--depth == 0)
   3507  1.185       sjg 		    break;
   3508  1.185       sjg 	    }
   3509  1.240    rillig 	    if (depth == 1 && *tstr == ':')
   3510  1.185       sjg 		break;
   3511  1.240    rillig 	    /* A variable inside a variable, expand. */
   3512  1.108       sjg 	    if (*tstr == '$') {
   3513  1.127  christos 		int rlen;
   3514  1.108       sjg 		void *freeIt;
   3515  1.226    rillig 		char *rval = Var_Parse(tstr, ctxt, flags, &rlen, &freeIt);
   3516  1.240    rillig 		if (rval != NULL)
   3517  1.146       dsl 		    Buf_AddBytes(&buf, strlen(rval), rval);
   3518  1.196  christos 		free(freeIt);
   3519  1.108       sjg 		tstr += rlen - 1;
   3520  1.242    rillig 	    } else
   3521  1.146       dsl 		Buf_AddByte(&buf, *tstr);
   3522  1.108       sjg 	}
   3523  1.108       sjg 	if (*tstr == ':') {
   3524  1.108       sjg 	    haveModifier = TRUE;
   3525  1.185       sjg 	} else if (*tstr == endc) {
   3526  1.108       sjg 	    haveModifier = FALSE;
   3527  1.108       sjg 	} else {
   3528  1.108       sjg 	    /*
   3529  1.108       sjg 	     * If we never did find the end character, return NULL
   3530  1.108       sjg 	     * right now, setting the length to be the distance to
   3531  1.108       sjg 	     * the end of the string, since that's what make does.
   3532  1.108       sjg 	     */
   3533  1.108       sjg 	    *lengthPtr = tstr - str;
   3534  1.146       dsl 	    Buf_Destroy(&buf, TRUE);
   3535  1.231    rillig 	    return var_Error;
   3536  1.108       sjg 	}
   3537  1.146       dsl 	str = Buf_GetAll(&buf, &vlen);
   3538   1.93       sjg 
   3539  1.123       apb 	/*
   3540  1.123       apb 	 * At this point, str points into newly allocated memory from
   3541  1.123       apb 	 * buf, containing only the name of the variable.
   3542  1.123       apb 	 *
   3543  1.123       apb 	 * start and tstr point into the const string that was pointed
   3544  1.123       apb 	 * to by the original value of the str parameter.  start points
   3545  1.123       apb 	 * to the '$' at the beginning of the string, while tstr points
   3546  1.123       apb 	 * to the char just after the end of the variable name -- this
   3547  1.123       apb 	 * will be '\0', ':', PRCLOSE, or BRCLOSE.
   3548  1.123       apb 	 */
   3549  1.123       apb 
   3550  1.108       sjg 	v = VarFind(str, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
   3551  1.141       dsl 	/*
   3552  1.141       dsl 	 * Check also for bogus D and F forms of local variables since we're
   3553  1.141       dsl 	 * in a local context and the name is the right length.
   3554  1.141       dsl 	 */
   3555  1.136       dsl 	if ((v == NULL) && (ctxt != VAR_CMD) && (ctxt != VAR_GLOBAL) &&
   3556  1.141       dsl 		(vlen == 2) && (str[1] == 'F' || str[1] == 'D') &&
   3557  1.190  dholland 		strchr("@%?*!<>", str[0]) != NULL) {
   3558  1.108       sjg 	    /*
   3559  1.141       dsl 	     * Well, it's local -- go look for it.
   3560  1.108       sjg 	     */
   3561  1.141       dsl 	    name[0] = *str;
   3562  1.141       dsl 	    name[1] = '\0';
   3563  1.141       dsl 	    v = VarFind(name, ctxt, 0);
   3564   1.15  christos 
   3565  1.141       dsl 	    if (v != NULL) {
   3566  1.141       dsl 		if (str[1] == 'D') {
   3567  1.240    rillig 		    extramodifiers = "H:";
   3568  1.242    rillig 		} else { /* F */
   3569  1.240    rillig 		    extramodifiers = "T:";
   3570    1.1       cgd 		}
   3571    1.1       cgd 	    }
   3572  1.108       sjg 	}
   3573  1.108       sjg 
   3574  1.136       dsl 	if (v == NULL) {
   3575  1.108       sjg 	    if (((vlen == 1) ||
   3576  1.141       dsl 		 (((vlen == 2) && (str[1] == 'F' || str[1] == 'D')))) &&
   3577  1.108       sjg 		((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)))
   3578  1.108       sjg 	    {
   3579  1.108       sjg 		/*
   3580  1.108       sjg 		 * If substituting a local variable in a non-local context,
   3581  1.108       sjg 		 * assume it's for dynamic source stuff. We have to handle
   3582  1.108       sjg 		 * this specially and return the longhand for the variable
   3583  1.108       sjg 		 * with the dollar sign escaped so it makes it back to the
   3584  1.108       sjg 		 * caller. Only four of the local variables are treated
   3585  1.108       sjg 		 * specially as they are the only four that will be set
   3586  1.108       sjg 		 * when dynamic sources are expanded.
   3587  1.108       sjg 		 */
   3588  1.108       sjg 		switch (*str) {
   3589  1.242    rillig 		case '@':
   3590  1.242    rillig 		case '%':
   3591  1.242    rillig 		case '*':
   3592  1.242    rillig 		case '!':
   3593  1.242    rillig 		    dynamic = TRUE;
   3594  1.242    rillig 		    break;
   3595  1.108       sjg 		}
   3596  1.240    rillig 	    } else if (vlen > 2 && *str == '.' &&
   3597  1.108       sjg 		       isupper((unsigned char) str[1]) &&
   3598  1.240    rillig 		       (ctxt == VAR_CMD || ctxt == VAR_GLOBAL))
   3599  1.108       sjg 	    {
   3600  1.240    rillig 		int len = vlen - 1;
   3601  1.108       sjg 		if ((strncmp(str, ".TARGET", len) == 0) ||
   3602  1.108       sjg 		    (strncmp(str, ".ARCHIVE", len) == 0) ||
   3603  1.108       sjg 		    (strncmp(str, ".PREFIX", len) == 0) ||
   3604  1.108       sjg 		    (strncmp(str, ".MEMBER", len) == 0))
   3605  1.108       sjg 		{
   3606  1.108       sjg 		    dynamic = TRUE;
   3607  1.108       sjg 		}
   3608    1.1       cgd 	    }
   3609   1.15  christos 
   3610  1.108       sjg 	    if (!haveModifier) {
   3611  1.108       sjg 		/*
   3612  1.108       sjg 		 * No modifiers -- have specification length so we can return
   3613  1.108       sjg 		 * now.
   3614  1.108       sjg 		 */
   3615  1.108       sjg 		*lengthPtr = tstr - start + 1;
   3616  1.108       sjg 		if (dynamic) {
   3617  1.134     joerg 		    char *pstr = bmake_strndup(start, *lengthPtr);
   3618  1.108       sjg 		    *freePtr = pstr;
   3619  1.146       dsl 		    Buf_Destroy(&buf, TRUE);
   3620  1.231    rillig 		    return pstr;
   3621   1.40       sjg 		} else {
   3622  1.146       dsl 		    Buf_Destroy(&buf, TRUE);
   3623  1.259    rillig 		    return (flags & VARE_UNDEFERR) ? var_Error : varNoError;
   3624   1.40       sjg 		}
   3625    1.1       cgd 	    } else {
   3626  1.108       sjg 		/*
   3627  1.108       sjg 		 * Still need to get to the end of the variable specification,
   3628  1.108       sjg 		 * so kludge up a Var structure for the modifications
   3629  1.108       sjg 		 */
   3630  1.134     joerg 		v = bmake_malloc(sizeof(Var));
   3631  1.108       sjg 		v->name = UNCONST(str);
   3632  1.146       dsl 		Buf_Init(&v->val, 1);
   3633  1.108       sjg 		v->flags = VAR_JUNK;
   3634  1.146       dsl 		Buf_Destroy(&buf, FALSE);
   3635    1.1       cgd 	    }
   3636  1.108       sjg 	} else
   3637  1.146       dsl 	    Buf_Destroy(&buf, TRUE);
   3638  1.108       sjg     }
   3639  1.108       sjg 
   3640  1.188     joerg     if (v->flags & VAR_IN_USE) {
   3641  1.188     joerg 	Fatal("Variable %s is recursive.", v->name);
   3642  1.188     joerg 	/*NOTREACHED*/
   3643  1.188     joerg     } else {
   3644  1.188     joerg 	v->flags |= VAR_IN_USE;
   3645  1.188     joerg     }
   3646  1.188     joerg     /*
   3647  1.188     joerg      * Before doing any modification, we have to make sure the value
   3648  1.188     joerg      * has been fully expanded. If it looks like recursion might be
   3649  1.188     joerg      * necessary (there's a dollar sign somewhere in the variable's value)
   3650  1.188     joerg      * we just call Var_Subst to do any other substitutions that are
   3651  1.188     joerg      * necessary. Note that the value returned by Var_Subst will have
   3652  1.188     joerg      * been dynamically-allocated, so it will need freeing when we
   3653  1.188     joerg      * return.
   3654  1.188     joerg      */
   3655  1.188     joerg     nstr = Buf_GetAll(&v->val, NULL);
   3656  1.259    rillig     if (strchr(nstr, '$') != NULL && (flags & VARE_WANTRES) != 0) {
   3657  1.202  christos 	nstr = Var_Subst(NULL, nstr, ctxt, flags);
   3658  1.188     joerg 	*freePtr = nstr;
   3659  1.188     joerg     }
   3660  1.187  christos 
   3661  1.188     joerg     v->flags &= ~VAR_IN_USE;
   3662  1.108       sjg 
   3663  1.240    rillig     if (nstr != NULL && (haveModifier || extramodifiers != NULL)) {
   3664  1.191  dholland 	void *extraFree;
   3665  1.127  christos 	int used;
   3666  1.108       sjg 
   3667  1.191  dholland 	extraFree = NULL;
   3668  1.191  dholland 	if (extramodifiers != NULL) {
   3669  1.240    rillig 	    nstr = ApplyModifiers(nstr, extramodifiers, '(', ')',
   3670  1.240    rillig 				  v, ctxt, flags, &used, &extraFree);
   3671  1.191  dholland 	}
   3672  1.191  dholland 
   3673  1.191  dholland 	if (haveModifier) {
   3674  1.240    rillig 	    /* Skip initial colon. */
   3675  1.240    rillig 	    tstr++;
   3676  1.191  dholland 
   3677  1.240    rillig 	    nstr = ApplyModifiers(nstr, tstr, startc, endc,
   3678  1.240    rillig 				  v, ctxt, flags, &used, freePtr);
   3679  1.240    rillig 	    tstr += used;
   3680  1.240    rillig 	    free(extraFree);
   3681  1.191  dholland 	} else {
   3682  1.240    rillig 	    *freePtr = extraFree;
   3683  1.191  dholland 	}
   3684  1.119       sjg     }
   3685  1.240    rillig     *lengthPtr = tstr - start + (*tstr ? 1 : 0);
   3686   1.15  christos 
   3687    1.1       cgd     if (v->flags & VAR_FROM_ENV) {
   3688  1.249    rillig 	Boolean destroy = FALSE;
   3689   1.15  christos 
   3690  1.146       dsl 	if (nstr != Buf_GetAll(&v->val, NULL)) {
   3691    1.1       cgd 	    destroy = TRUE;
   3692    1.1       cgd 	} else {
   3693    1.1       cgd 	    /*
   3694    1.1       cgd 	     * Returning the value unmodified, so tell the caller to free
   3695    1.1       cgd 	     * the thing.
   3696    1.1       cgd 	     */
   3697  1.104  christos 	    *freePtr = nstr;
   3698    1.1       cgd 	}
   3699  1.105  christos 	VarFreeEnv(v, destroy);
   3700    1.1       cgd     } else if (v->flags & VAR_JUNK) {
   3701    1.1       cgd 	/*
   3702  1.121       apb 	 * Perform any free'ing needed and set *freePtr to NULL so the caller
   3703    1.1       cgd 	 * doesn't try to free a static pointer.
   3704   1.40       sjg 	 * If VAR_KEEP is also set then we want to keep str as is.
   3705    1.1       cgd 	 */
   3706   1.58    itojun 	if (!(v->flags & VAR_KEEP)) {
   3707   1.40       sjg 	    if (*freePtr) {
   3708   1.73  christos 		free(nstr);
   3709  1.108       sjg 		*freePtr = NULL;
   3710   1.40       sjg 	    }
   3711   1.40       sjg 	    if (dynamic) {
   3712  1.134     joerg 		nstr = bmake_strndup(start, *lengthPtr);
   3713  1.104  christos 		*freePtr = nstr;
   3714   1.40       sjg 	    } else {
   3715  1.259    rillig 		nstr = (flags & VARE_UNDEFERR) ? var_Error : varNoError;
   3716   1.40       sjg 	    }
   3717   1.34  christos 	}
   3718  1.146       dsl 	if (nstr != Buf_GetAll(&v->val, NULL))
   3719  1.146       dsl 	    Buf_Destroy(&v->val, TRUE);
   3720   1.98  christos 	free(v->name);
   3721   1.98  christos 	free(v);
   3722    1.1       cgd     }
   3723  1.231    rillig     return nstr;
   3724    1.1       cgd }
   3725    1.1       cgd 
   3726    1.1       cgd /*-
   3727    1.1       cgd  *-----------------------------------------------------------------------
   3728    1.1       cgd  * Var_Subst  --
   3729  1.250    rillig  *	Substitute for all variables in the given string in the given context.
   3730  1.259    rillig  *	If flags & VARE_UNDEFERR, Parse_Error will be called when an undefined
   3731    1.1       cgd  *	variable is encountered.
   3732    1.1       cgd  *
   3733   1.70       wiz  * Input:
   3734   1.70       wiz  *	var		Named variable || NULL for all
   3735   1.70       wiz  *	str		the string which to substitute
   3736   1.70       wiz  *	ctxt		the context wherein to find variables
   3737  1.259    rillig  *	flags		VARE_UNDEFERR	if undefineds are an error
   3738  1.259    rillig  *			VARE_WANTRES	if we actually want the result
   3739  1.259    rillig  *			VARE_ASSIGN	if we are in a := assignment
   3740   1.70       wiz  *
   3741    1.1       cgd  * Results:
   3742    1.1       cgd  *	The resulting string.
   3743    1.1       cgd  *
   3744    1.1       cgd  * Side Effects:
   3745  1.250    rillig  *	None.
   3746    1.1       cgd  *-----------------------------------------------------------------------
   3747    1.1       cgd  */
   3748    1.1       cgd char *
   3749  1.259    rillig Var_Subst(const char *var, const char *str, GNode *ctxt, VarEvalFlags flags)
   3750    1.1       cgd {
   3751  1.240    rillig     Buffer	buf;		/* Buffer for forming things */
   3752  1.240    rillig     char	*val;		/* Value to substitute for a variable */
   3753  1.240    rillig     int		length;		/* Length of the variable invocation */
   3754  1.240    rillig     Boolean	trailingBslash;	/* variable ends in \ */
   3755  1.240    rillig     void	*freeIt = NULL;	/* Set if it should be freed */
   3756  1.240    rillig     static Boolean errorReported; /* Set true if an error has already
   3757  1.240    rillig 				 * been reported to prevent a plethora
   3758  1.240    rillig 				 * of messages when recursing */
   3759    1.1       cgd 
   3760  1.146       dsl     Buf_Init(&buf, 0);
   3761    1.1       cgd     errorReported = FALSE;
   3762   1.96  christos     trailingBslash = FALSE;
   3763    1.1       cgd 
   3764    1.1       cgd     while (*str) {
   3765   1.96  christos 	if (*str == '\n' && trailingBslash)
   3766  1.146       dsl 	    Buf_AddByte(&buf, ' ');
   3767   1.48   mycroft 	if (var == NULL && (*str == '$') && (str[1] == '$')) {
   3768    1.1       cgd 	    /*
   3769    1.1       cgd 	     * A dollar sign may be escaped either with another dollar sign.
   3770    1.1       cgd 	     * In such a case, we skip over the escape character and store the
   3771    1.1       cgd 	     * dollar sign into the buffer directly.
   3772    1.1       cgd 	     */
   3773  1.259    rillig 	    if (save_dollars && (flags & VARE_ASSIGN))
   3774  1.201  christos 		Buf_AddByte(&buf, *str);
   3775    1.1       cgd 	    str++;
   3776  1.146       dsl 	    Buf_AddByte(&buf, *str);
   3777    1.1       cgd 	    str++;
   3778    1.1       cgd 	} else if (*str != '$') {
   3779    1.1       cgd 	    /*
   3780    1.1       cgd 	     * Skip as many characters as possible -- either to the end of
   3781    1.1       cgd 	     * the string or to the next dollar sign (variable invocation).
   3782    1.1       cgd 	     */
   3783  1.249    rillig 	    const char *cp;
   3784    1.1       cgd 
   3785    1.5       cgd 	    for (cp = str++; *str != '$' && *str != '\0'; str++)
   3786    1.5       cgd 		continue;
   3787  1.146       dsl 	    Buf_AddBytes(&buf, str - cp, cp);
   3788    1.1       cgd 	} else {
   3789   1.48   mycroft 	    if (var != NULL) {
   3790   1.48   mycroft 		int expand;
   3791   1.48   mycroft 		for (;;) {
   3792  1.100  christos 		    if (str[1] == '\0') {
   3793  1.100  christos 			/* A trailing $ is kind of a special case */
   3794  1.146       dsl 			Buf_AddByte(&buf, str[0]);
   3795  1.100  christos 			str++;
   3796  1.100  christos 			expand = FALSE;
   3797  1.100  christos 		    } else if (str[1] != PROPEN && str[1] != BROPEN) {
   3798   1.48   mycroft 			if (str[1] != *var || strlen(var) > 1) {
   3799  1.146       dsl 			    Buf_AddBytes(&buf, 2, str);
   3800   1.48   mycroft 			    str += 2;
   3801   1.48   mycroft 			    expand = FALSE;
   3802  1.242    rillig 			} else
   3803   1.48   mycroft 			    expand = TRUE;
   3804   1.48   mycroft 			break;
   3805  1.240    rillig 		    } else {
   3806   1.73  christos 			const char *p;
   3807   1.48   mycroft 
   3808  1.242    rillig 			/* Scan up to the end of the variable name. */
   3809   1.48   mycroft 			for (p = &str[2]; *p &&
   3810  1.100  christos 			     *p != ':' && *p != PRCLOSE && *p != BRCLOSE; p++)
   3811   1.48   mycroft 			    if (*p == '$')
   3812   1.48   mycroft 				break;
   3813   1.48   mycroft 			/*
   3814   1.48   mycroft 			 * A variable inside the variable. We cannot expand
   3815   1.48   mycroft 			 * the external variable yet, so we try again with
   3816   1.48   mycroft 			 * the nested one
   3817   1.48   mycroft 			 */
   3818   1.48   mycroft 			if (*p == '$') {
   3819  1.146       dsl 			    Buf_AddBytes(&buf, p - str, str);
   3820   1.48   mycroft 			    str = p;
   3821   1.48   mycroft 			    continue;
   3822   1.48   mycroft 			}
   3823   1.48   mycroft 
   3824  1.127  christos 			if (strncmp(var, str + 2, p - str - 2) != 0 ||
   3825   1.48   mycroft 			    var[p - str - 2] != '\0') {
   3826   1.48   mycroft 			    /*
   3827   1.48   mycroft 			     * Not the variable we want to expand, scan
   3828   1.48   mycroft 			     * until the next variable
   3829   1.48   mycroft 			     */
   3830  1.249    rillig 			    for (; *p != '$' && *p != '\0'; p++)
   3831   1.48   mycroft 				continue;
   3832  1.146       dsl 			    Buf_AddBytes(&buf, p - str, str);
   3833   1.48   mycroft 			    str = p;
   3834   1.48   mycroft 			    expand = FALSE;
   3835  1.240    rillig 			} else
   3836   1.48   mycroft 			    expand = TRUE;
   3837   1.48   mycroft 			break;
   3838   1.48   mycroft 		    }
   3839   1.48   mycroft 		}
   3840   1.48   mycroft 		if (!expand)
   3841   1.48   mycroft 		    continue;
   3842   1.48   mycroft 	    }
   3843   1.48   mycroft 
   3844  1.202  christos 	    val = Var_Parse(str, ctxt, flags, &length, &freeIt);
   3845    1.1       cgd 
   3846    1.1       cgd 	    /*
   3847    1.1       cgd 	     * When we come down here, val should either point to the
   3848    1.1       cgd 	     * value of this variable, suitably modified, or be NULL.
   3849    1.1       cgd 	     * Length should be the total length of the potential
   3850    1.1       cgd 	     * variable invocation (from $ to end character...)
   3851    1.1       cgd 	     */
   3852    1.1       cgd 	    if (val == var_Error || val == varNoError) {
   3853    1.1       cgd 		/*
   3854    1.1       cgd 		 * If performing old-time variable substitution, skip over
   3855    1.1       cgd 		 * the variable and continue with the substitution. Otherwise,
   3856    1.1       cgd 		 * store the dollar sign and advance str so we continue with
   3857    1.1       cgd 		 * the string...
   3858    1.1       cgd 		 */
   3859    1.1       cgd 		if (oldVars) {
   3860    1.1       cgd 		    str += length;
   3861  1.259    rillig 		} else if ((flags & VARE_UNDEFERR) || val == var_Error) {
   3862    1.1       cgd 		    /*
   3863    1.1       cgd 		     * If variable is undefined, complain and skip the
   3864    1.1       cgd 		     * variable. The complaint will stop us from doing anything
   3865    1.1       cgd 		     * when the file is parsed.
   3866    1.1       cgd 		     */
   3867    1.1       cgd 		    if (!errorReported) {
   3868  1.231    rillig 			Parse_Error(PARSE_FATAL, "Undefined variable \"%.*s\"",
   3869  1.231    rillig 				    length, str);
   3870    1.1       cgd 		    }
   3871    1.1       cgd 		    str += length;
   3872    1.1       cgd 		    errorReported = TRUE;
   3873    1.1       cgd 		} else {
   3874  1.146       dsl 		    Buf_AddByte(&buf, *str);
   3875    1.1       cgd 		    str += 1;
   3876    1.1       cgd 		}
   3877    1.1       cgd 	    } else {
   3878    1.1       cgd 		/*
   3879    1.1       cgd 		 * We've now got a variable structure to store in. But first,
   3880    1.1       cgd 		 * advance the string pointer.
   3881    1.1       cgd 		 */
   3882    1.1       cgd 		str += length;
   3883   1.15  christos 
   3884    1.1       cgd 		/*
   3885    1.1       cgd 		 * Copy all the characters from the variable value straight
   3886    1.1       cgd 		 * into the new string.
   3887    1.1       cgd 		 */
   3888   1.96  christos 		length = strlen(val);
   3889  1.146       dsl 		Buf_AddBytes(&buf, length, val);
   3890   1.96  christos 		trailingBslash = length > 0 && val[length - 1] == '\\';
   3891  1.104  christos 	    }
   3892  1.196  christos 	    free(freeIt);
   3893  1.196  christos 	    freeIt = NULL;
   3894    1.1       cgd 	}
   3895    1.1       cgd     }
   3896   1.15  christos 
   3897  1.168       sjg     return Buf_DestroyCompact(&buf);
   3898    1.1       cgd }
   3899    1.1       cgd 
   3900  1.250    rillig /* Initialize the module. */
   3901    1.1       cgd void
   3902   1.70       wiz Var_Init(void)
   3903    1.1       cgd {
   3904  1.184       sjg     VAR_INTERNAL = Targ_NewGN("Internal");
   3905   1.92  christos     VAR_GLOBAL = Targ_NewGN("Global");
   3906   1.92  christos     VAR_CMD = Targ_NewGN("Command");
   3907    1.6       jtc }
   3908    1.6       jtc 
   3909    1.1       cgd 
   3910    1.6       jtc void
   3911   1.70       wiz Var_End(void)
   3912    1.6       jtc {
   3913  1.286       sjg     Var_Stats();
   3914  1.286       sjg }
   3915  1.286       sjg 
   3916  1.286       sjg void
   3917  1.286       sjg Var_Stats(void)
   3918  1.286       sjg {
   3919  1.286       sjg     Hash_DebugStats(&VAR_GLOBAL->context, "VAR_GLOBAL");
   3920    1.1       cgd }
   3921   1.15  christos 
   3922    1.1       cgd 
   3923    1.1       cgd /****************** PRINT DEBUGGING INFO *****************/
   3924   1.36   mycroft static void
   3925  1.241    rillig VarPrintVar(void *vp, void *data MAKE_ATTR_UNUSED)
   3926    1.1       cgd {
   3927  1.242    rillig     Var *v = (Var *)vp;
   3928  1.146       dsl     fprintf(debug_file, "%-16s = %s\n", v->name, Buf_GetAll(&v->val, NULL));
   3929    1.1       cgd }
   3930    1.1       cgd 
   3931    1.1       cgd /*-
   3932    1.1       cgd  *-----------------------------------------------------------------------
   3933    1.1       cgd  * Var_Dump --
   3934    1.1       cgd  *	print all variables in a context
   3935    1.1       cgd  *-----------------------------------------------------------------------
   3936    1.1       cgd  */
   3937    1.5       cgd void
   3938   1.70       wiz Var_Dump(GNode *ctxt)
   3939    1.1       cgd {
   3940  1.241    rillig     Hash_ForEach(&ctxt->context, VarPrintVar, NULL);
   3941    1.1       cgd }
   3942