1 /* $NetBSD: var.c,v 1.223 2020/04/25 18:20:57 christos Exp $ */
4 * Copyright (c) 1988, 1989, 1990, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * Copyright (c) 1989 by Berkeley Softworks
37 * All rights reserved.
39 * This code is derived from software contributed to Berkeley by
42 * Redistribution and use in source and binary forms, with or without
43 * modification, are permitted provided that the following conditions
45 * 1. Redistributions of source code must retain the above copyright
46 * notice, this list of conditions and the following disclaimer.
47 * 2. Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in the
49 * documentation and/or other materials provided with the distribution.
50 * 3. All advertising materials mentioning features or use of this software
51 * must display the following acknowledgement:
52 * This product includes software developed by the University of
53 * California, Berkeley and its contributors.
54 * 4. Neither the name of the University nor the names of its contributors
55 * may be used to endorse or promote products derived from this software
56 * without specific prior written permission.
58 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
59 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
61 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
62 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
63 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
64 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
65 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
66 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
67 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
72 static char rcsid[] = "$NetBSD: var.c,v 1.223 2020/04/25 18:20:57 christos Exp $";
74 #include <sys/cdefs.h>
77 static char sccsid[] = "@(#)var.c 8.3 (Berkeley) 3/19/94";
79 __RCSID("$NetBSD: var.c,v 1.223 2020/04/25 18:20:57 christos Exp $");
86 * Variable-handling functions
89 * Var_Set Set the value of a variable in the given
90 * context. The variable is created if it doesn't
91 * yet exist. The value and variable name need not
94 * Var_Append Append more characters to an existing variable
95 * in the given context. The variable needn't
96 * exist already -- it will be created if it doesn't.
97 * A space is placed between the old value and the
100 * Var_Exists See if a variable exists.
102 * Var_Value Return the value of a variable in a context or
103 * NULL if the variable is undefined.
105 * Var_Subst Substitute named variable, or all variables if
106 * NULL in a string using
107 * the given context as the top-most one. If the
108 * third argument is non-zero, Parse_Error is
109 * called if any variables are undefined.
111 * Var_Parse Parse a variable expansion from a string and
112 * return the result and the number of characters
115 * Var_Delete Delete a variable in a context.
117 * Var_Init Initialize this module.
120 * Var_Dump Print out all variables defined in the given
123 * XXX: There's a lot of duplication in these functions.
126 #include <sys/stat.h>
128 #include <sys/types.h>
140 #include "metachar.h"
142 extern int makelevel;
144 * This lets us tell if we have replaced the original environ
145 * (which we cannot free).
147 char **savedEnv = NULL;
150 * This is a harmless return value for Var_Parse that can be used by Var_Subst
151 * to determine if there was an error in parsing -- easier than returning
152 * a flag, as things outside this module don't give a hoot.
154 char var_Error[] = "";
157 * Similar to var_Error, but returned when the 'VARF_UNDEFERR' flag for
158 * Var_Parse is not set. Why not just use a constant? Well, gcc likes
159 * to condense identical string instances...
161 static char varNoError[] = "";
164 * Traditionally we consume $$ during := like any other expansion.
165 * Other make's do not.
166 * This knob allows controlling the behavior.
167 * FALSE for old behavior.
168 * TRUE for new compatible.
170 #define SAVE_DOLLARS ".MAKE.SAVE_DOLLARS"
171 static Boolean save_dollars = FALSE;
174 * Internally, variables are contained in four different contexts.
175 * 1) the environment. They may not be changed. If an environment
176 * variable is appended-to, the result is placed in the global
178 * 2) the global context. Variables set in the Makefile are located in
179 * the global context. It is the penultimate context searched when
181 * 3) the command-line context. All variables set on the command line
182 * are placed in this context. They are UNALTERABLE once placed here.
183 * 4) the local context. Each target has associated with it a context
184 * list. On this list are located the structures describing such
185 * local variables as $(@) and $(*)
186 * The four contexts are searched in the reverse order from which they are
189 GNode *VAR_INTERNAL; /* variables from make itself */
190 GNode *VAR_GLOBAL; /* variables from the makefile */
191 GNode *VAR_CMD; /* variables defined on the command-line */
193 #define FIND_CMD 0x1 /* look in VAR_CMD when searching */
194 #define FIND_GLOBAL 0x2 /* look in VAR_GLOBAL as well */
195 #define FIND_ENV 0x4 /* look in the environment also */
198 char *name; /* the variable's name */
199 Buffer val; /* its value */
200 int flags; /* miscellaneous status flags */
201 #define VAR_IN_USE 1 /* Variable's value currently being used.
202 * Used to avoid recursion */
203 #define VAR_FROM_ENV 2 /* Variable comes from the environment */
204 #define VAR_JUNK 4 /* Variable is a junk variable that
205 * should be destroyed when done with
206 * it. Used by Var_Parse for undefined,
207 * modified variables */
208 #define VAR_KEEP 8 /* Variable is VAR_JUNK, but we found
209 * a use for it in some modifier and
210 * the value is therefore valid */
211 #define VAR_EXPORTED 16 /* Variable is exported */
212 #define VAR_REEXPORT 32 /* Indicate if var needs re-export.
213 * This would be true if it contains $'s
215 #define VAR_FROM_CMD 64 /* Variable came from command line */
219 * Exporting vars is expensive so skip it if we can
221 #define VAR_EXPORTED_NONE 0
222 #define VAR_EXPORTED_YES 1
223 #define VAR_EXPORTED_ALL 2
224 static int var_exportedVars = VAR_EXPORTED_NONE;
226 * We pass this to Var_Export when doing the initial export
227 * or after updating an exported var.
229 #define VAR_EXPORT_PARENT 1
231 * We pass this to Var_Export1 to tell it to leave the value alone.
233 #define VAR_EXPORT_LITERAL 2
235 /* Var*Pattern flags */
236 #define VAR_SUB_GLOBAL 0x01 /* Apply substitution globally */
237 #define VAR_SUB_ONE 0x02 /* Apply substitution to one word */
238 #define VAR_SUB_MATCHED 0x04 /* There was a match */
239 #define VAR_MATCH_START 0x08 /* Match at start of word */
240 #define VAR_MATCH_END 0x10 /* Match at end of word */
241 #define VAR_NOSUBST 0x20 /* don't expand vars in VarGetPattern */
244 #define VAR_NO_EXPORT 0x01 /* do not export */
248 * The following fields are set by Var_Parse() when it
249 * encounters modifiers that need to keep state for use by
250 * subsequent modifiers within the same variable expansion.
252 Byte varSpace; /* Word separator in expansions */
253 Boolean oneBigWord; /* TRUE if we will treat the variable as a
254 * single big word, even if it contains
255 * embedded spaces (as opposed to the
256 * usual behaviour of treating it as
257 * several space-separated words). */
260 /* struct passed as 'void *' to VarSubstitute() for ":S/lhs/rhs/",
261 * to VarSYSVMatch() for ":lhs=rhs". */
263 const char *lhs; /* String to match */
264 int leftLen; /* Length of string */
265 const char *rhs; /* Replacement string (w/ &'s removed) */
266 int rightLen; /* Length of replacement */
270 /* struct passed as 'void *' to VarLoopExpand() for ":@tvar@str@" */
272 GNode *ctxt; /* variable context */
273 char *tvar; /* name of temp var */
275 char *str; /* string to expand */
277 int errnum; /* errnum for not defined */
281 /* struct passed as 'void *' to VarRESubstitute() for ":C///" */
291 /* struct passed to VarSelectWords() for ":[start..end]" */
293 int start; /* first word to select */
294 int end; /* last word to select */
297 static Var *VarFind(const char *, GNode *, int);
298 static void VarAdd(const char *, const char *, GNode *);
299 static Boolean VarHead(GNode *, Var_Parse_State *,
300 char *, Boolean, Buffer *, void *);
301 static Boolean VarTail(GNode *, Var_Parse_State *,
302 char *, Boolean, Buffer *, void *);
303 static Boolean VarSuffix(GNode *, Var_Parse_State *,
304 char *, Boolean, Buffer *, void *);
305 static Boolean VarRoot(GNode *, Var_Parse_State *,
306 char *, Boolean, Buffer *, void *);
307 static Boolean VarMatch(GNode *, Var_Parse_State *,
308 char *, Boolean, Buffer *, void *);
310 static Boolean VarSYSVMatch(GNode *, Var_Parse_State *,
311 char *, Boolean, Buffer *, void *);
313 static Boolean VarNoMatch(GNode *, Var_Parse_State *,
314 char *, Boolean, Buffer *, void *);
316 static void VarREError(int, regex_t *, const char *);
317 static Boolean VarRESubstitute(GNode *, Var_Parse_State *,
318 char *, Boolean, Buffer *, void *);
320 static Boolean VarSubstitute(GNode *, Var_Parse_State *,
321 char *, Boolean, Buffer *, void *);
322 static Boolean VarLoopExpand(GNode *, Var_Parse_State *,
323 char *, Boolean, Buffer *, void *);
324 static char *VarGetPattern(GNode *, Var_Parse_State *,
325 int, const char **, int, int *, int *,
327 static char *VarQuote(char *, Boolean);
328 static char *VarHash(char *);
329 static char *VarModify(GNode *, Var_Parse_State *,
331 Boolean (*)(GNode *, Var_Parse_State *, char *, Boolean, Buffer *, void *),
333 static char *VarOrder(const char *, const char);
334 static char *VarUniq(const char *);
335 static int VarWordCompare(const void *, const void *);
336 static void VarPrintVar(void *);
344 *-----------------------------------------------------------------------
346 * Find the given variable in the given context and any other contexts
351 * ctxt context in which to find it
352 * flags FIND_GLOBAL set means to look in the
353 * VAR_GLOBAL context as well. FIND_CMD set means
354 * to look in the VAR_CMD context also. FIND_ENV
355 * set means to look in the environment
358 * A pointer to the structure describing the desired variable or
359 * NULL if the variable does not exist.
363 *-----------------------------------------------------------------------
366 VarFind(const char *name, GNode *ctxt, int flags)
372 * If the variable name begins with a '.', it could very well be one of
373 * the local ones. We check the name against all the local variables
374 * and substitute the short version in for 'name' if it matches one of
377 if (*name == '.' && isupper((unsigned char) name[1]))
380 if (!strcmp(name, ".ALLSRC"))
382 if (!strcmp(name, ".ARCHIVE"))
386 if (!strcmp(name, ".IMPSRC"))
390 if (!strcmp(name, ".MEMBER"))
394 if (!strcmp(name, ".OODATE"))
398 if (!strcmp(name, ".PREFIX"))
402 if (!strcmp(name, ".TARGET"))
407 /* for compatibility with gmake */
408 if (name[0] == '^' && name[1] == '\0')
413 * First look for the variable in the given context. If it's not there,
414 * look for it in VAR_CMD, VAR_GLOBAL and the environment, in that order,
415 * depending on the FIND_* flags in 'flags'
417 var = Hash_FindEntry(&ctxt->context, name);
419 if ((var == NULL) && (flags & FIND_CMD) && (ctxt != VAR_CMD)) {
420 var = Hash_FindEntry(&VAR_CMD->context, name);
422 if (!checkEnvFirst && (var == NULL) && (flags & FIND_GLOBAL) &&
423 (ctxt != VAR_GLOBAL))
425 var = Hash_FindEntry(&VAR_GLOBAL->context, name);
426 if ((var == NULL) && (ctxt != VAR_INTERNAL)) {
427 /* VAR_INTERNAL is subordinate to VAR_GLOBAL */
428 var = Hash_FindEntry(&VAR_INTERNAL->context, name);
431 if ((var == NULL) && (flags & FIND_ENV)) {
434 if ((env = getenv(name)) != NULL) {
437 v = bmake_malloc(sizeof(Var));
438 v->name = bmake_strdup(name);
442 Buf_Init(&v->val, len + 1);
443 Buf_AddBytes(&v->val, len, env);
445 v->flags = VAR_FROM_ENV;
447 } else if (checkEnvFirst && (flags & FIND_GLOBAL) &&
448 (ctxt != VAR_GLOBAL))
450 var = Hash_FindEntry(&VAR_GLOBAL->context, name);
451 if ((var == NULL) && (ctxt != VAR_INTERNAL)) {
452 var = Hash_FindEntry(&VAR_INTERNAL->context, name);
457 return ((Var *)Hash_GetValue(var));
462 } else if (var == NULL) {
465 return ((Var *)Hash_GetValue(var));
470 *-----------------------------------------------------------------------
472 * If the variable is an environment variable, free it
476 * destroy true if the value buffer should be destroyed.
479 * 1 if it is an environment variable 0 ow.
482 * The variable is free'ed if it is an environent variable.
483 *-----------------------------------------------------------------------
486 VarFreeEnv(Var *v, Boolean destroy)
488 if ((v->flags & VAR_FROM_ENV) == 0)
491 Buf_Destroy(&v->val, destroy);
497 *-----------------------------------------------------------------------
499 * Add a new variable of name name and value val to the given context
502 * name name of variable to add
503 * val value to set it to
504 * ctxt context in which to set it
510 * The new variable is placed at the front of the given context
511 * The name and val arguments are duplicated so they may
513 *-----------------------------------------------------------------------
516 VarAdd(const char *name, const char *val, GNode *ctxt)
522 v = bmake_malloc(sizeof(Var));
524 len = val ? strlen(val) : 0;
525 Buf_Init(&v->val, len+1);
526 Buf_AddBytes(&v->val, len, val);
530 h = Hash_CreateEntry(&ctxt->context, name, NULL);
533 if (DEBUG(VAR) && (ctxt->flags & INTERNAL) == 0) {
534 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
539 *-----------------------------------------------------------------------
541 * Remove a variable from a context.
547 * The Var structure is removed and freed.
549 *-----------------------------------------------------------------------
552 Var_Delete(const char *name, GNode *ctxt)
557 if (strchr(name, '$')) {
558 cp = Var_Subst(NULL, name, VAR_GLOBAL, VARF_WANTRES);
562 ln = Hash_FindEntry(&ctxt->context, cp);
564 fprintf(debug_file, "%s:delete %s%s\n",
565 ctxt->name, cp, ln ? "" : " (not found)");
573 v = (Var *)Hash_GetValue(ln);
574 if ((v->flags & VAR_EXPORTED)) {
577 if (strcmp(MAKE_EXPORTED, v->name) == 0) {
578 var_exportedVars = VAR_EXPORTED_NONE;
580 if (v->name != ln->name)
582 Hash_DeleteEntry(&ctxt->context, ln);
583 Buf_Destroy(&v->val, TRUE);
591 * We ignore make internal variables (those which start with '.')
592 * Also we jump through some hoops to avoid calling setenv
593 * more than necessary since it can leak.
594 * We only manipulate flags of vars if 'parent' is set.
597 Var_Export1(const char *name, int flags)
603 int parent = (flags & VAR_EXPORT_PARENT);
606 return 0; /* skip internals */
610 * If it is one of the vars that should only appear in
611 * local context, skip it, else we can get Var_Subst
622 v = VarFind(name, VAR_GLOBAL, 0);
627 (v->flags & (VAR_EXPORTED|VAR_REEXPORT)) == VAR_EXPORTED) {
628 return 0; /* nothing to do */
630 val = Buf_GetAll(&v->val, NULL);
631 if ((flags & VAR_EXPORT_LITERAL) == 0 && strchr(val, '$')) {
634 * Flag this as something we need to re-export.
635 * No point actually exporting it now though,
636 * the child can do it at the last minute.
638 v->flags |= (VAR_EXPORTED|VAR_REEXPORT);
641 if (v->flags & VAR_IN_USE) {
643 * We recursed while exporting in a child.
644 * This isn't going to end well, just skip it.
648 n = snprintf(tmp, sizeof(tmp), "${%s}", name);
649 if (n < (int)sizeof(tmp)) {
650 val = Var_Subst(NULL, tmp, VAR_GLOBAL, VARF_WANTRES);
651 setenv(name, val, 1);
656 v->flags &= ~VAR_REEXPORT; /* once will do */
658 if (parent || !(v->flags & VAR_EXPORTED)) {
659 setenv(name, val, 1);
663 * This is so Var_Set knows to call Var_Export again...
666 v->flags |= VAR_EXPORTED;
672 * This gets called from our children.
685 * Several make's support this sort of mechanism for tracking
686 * recursion - but each uses a different name.
687 * We allow the makefiles to update MAKELEVEL and ensure
688 * children see a correctly incremented value.
690 snprintf(tmp, sizeof(tmp), "%d", makelevel + 1);
691 setenv(MAKE_LEVEL_ENV, tmp, 1);
693 if (VAR_EXPORTED_NONE == var_exportedVars)
696 if (VAR_EXPORTED_ALL == var_exportedVars) {
698 * Ouch! This is crazy...
700 for (var = Hash_EnumFirst(&VAR_GLOBAL->context, &state);
702 var = Hash_EnumNext(&state)) {
703 v = (Var *)Hash_GetValue(var);
704 Var_Export1(v->name, 0);
709 * We have a number of exported vars,
711 n = snprintf(tmp, sizeof(tmp), "${" MAKE_EXPORTED ":O:u}");
712 if (n < (int)sizeof(tmp)) {
718 val = Var_Subst(NULL, tmp, VAR_GLOBAL, VARF_WANTRES);
720 av = brk_string(val, &ac, FALSE, &as);
721 for (i = 0; i < ac; i++) {
722 Var_Export1(av[i], 0);
732 * This is called when .export is seen or
733 * .MAKE.EXPORTED is modified.
734 * It is also called when any exported var is modified.
737 Var_Export(char *str, int isExport)
747 if (isExport && (!str || !str[0])) {
748 var_exportedVars = VAR_EXPORTED_ALL; /* use with caution! */
753 if (strncmp(str, "-env", 4) == 0) {
755 } else if (strncmp(str, "-literal", 8) == 0) {
757 flags |= VAR_EXPORT_LITERAL;
759 flags |= VAR_EXPORT_PARENT;
761 val = Var_Subst(NULL, str, VAR_GLOBAL, VARF_WANTRES);
763 av = brk_string(val, &ac, FALSE, &as);
764 for (i = 0; i < ac; i++) {
769 * If it is one of the vars that should only appear in
770 * local context, skip it, else we can get Var_Subst
781 if (Var_Export1(name, flags)) {
782 if (VAR_EXPORTED_ALL != var_exportedVars)
783 var_exportedVars = VAR_EXPORTED_YES;
784 if (isExport && (flags & VAR_EXPORT_PARENT)) {
785 Var_Append(MAKE_EXPORTED, name, VAR_GLOBAL);
797 * This is called when .unexport[-env] is seen.
799 extern char **environ;
802 Var_UnExport(char *str)
807 Boolean unexport_env;
810 if (!str || !str[0]) {
811 return; /* assert? */
817 unexport_env = (strncmp(str, "-env", 4) == 0);
821 cp = getenv(MAKE_LEVEL_ENV); /* we should preserve this */
822 if (environ == savedEnv) {
823 /* we have been here before! */
824 newenv = bmake_realloc(environ, 2 * sizeof(char *));
830 newenv = bmake_malloc(2 * sizeof(char *));
834 /* Note: we cannot safely free() the original environ. */
835 environ = savedEnv = newenv;
839 setenv(MAKE_LEVEL_ENV, cp, 1);
841 for (; *str != '\n' && isspace((unsigned char) *str); str++)
843 if (str[0] && str[0] != '\n') {
849 /* Using .MAKE.EXPORTED */
850 n = snprintf(tmp, sizeof(tmp), "${" MAKE_EXPORTED ":O:u}");
851 if (n < (int)sizeof(tmp)) {
852 vlist = Var_Subst(NULL, tmp, VAR_GLOBAL, VARF_WANTRES);
862 av = brk_string(vlist, &ac, FALSE, &as);
863 for (i = 0; i < ac; i++) {
864 v = VarFind(av[i], VAR_GLOBAL, 0);
868 (v->flags & (VAR_EXPORTED|VAR_REEXPORT)) == VAR_EXPORTED) {
871 v->flags &= ~(VAR_EXPORTED|VAR_REEXPORT);
873 * If we are unexporting a list,
874 * remove each one from .MAKE.EXPORTED.
875 * If we are removing them all,
876 * just delete .MAKE.EXPORTED below.
879 n = snprintf(tmp, sizeof(tmp),
880 "${" MAKE_EXPORTED ":N%s}", v->name);
881 if (n < (int)sizeof(tmp)) {
882 cp = Var_Subst(NULL, tmp, VAR_GLOBAL, VARF_WANTRES);
883 Var_Set(MAKE_EXPORTED, cp, VAR_GLOBAL, 0);
891 Var_Delete(MAKE_EXPORTED, VAR_GLOBAL);
898 *-----------------------------------------------------------------------
900 * Set the variable name to the value val in the given context.
903 * name name of variable to set
904 * val value to give to the variable
905 * ctxt context in which to set it
911 * If the variable doesn't yet exist, a new record is created for it.
912 * Else the old value is freed and the new one stuck in its place
915 * The variable is searched for only in its context before being
916 * created in that context. I.e. if the context is VAR_GLOBAL,
917 * only VAR_GLOBAL->context is searched. Likewise if it is VAR_CMD, only
918 * VAR_CMD->context is searched. This is done to avoid the literally
919 * thousands of unnecessary strcmp's that used to be done to
920 * set, say, $(@) or $(<).
921 * If the context is VAR_GLOBAL though, we check if the variable
922 * was set in VAR_CMD from the command line and skip it if so.
923 *-----------------------------------------------------------------------
926 Var_Set(const char *name, const char *val, GNode *ctxt, int flags)
929 char *expanded_name = NULL;
932 * We only look for a variable in the given context since anything set
933 * here will override anything in a lower context, so there's not much
934 * point in searching them all just to save a bit of memory...
936 if (strchr(name, '$') != NULL) {
937 expanded_name = Var_Subst(NULL, name, ctxt, VARF_WANTRES);
938 if (expanded_name[0] == 0) {
940 fprintf(debug_file, "Var_Set(\"%s\", \"%s\", ...) "
941 "name expands to empty string - ignored\n",
947 name = expanded_name;
949 if (ctxt == VAR_GLOBAL) {
950 v = VarFind(name, VAR_CMD, 0);
952 if ((v->flags & VAR_FROM_CMD)) {
954 fprintf(debug_file, "%s:%s = %s ignored!\n", ctxt->name, name, val);
961 v = VarFind(name, ctxt, 0);
963 if (ctxt == VAR_CMD && (flags & VAR_NO_EXPORT) == 0) {
965 * This var would normally prevent the same name being added
966 * to VAR_GLOBAL, so delete it from there if needed.
967 * Otherwise -V name may show the wrong value.
969 Var_Delete(name, VAR_GLOBAL);
971 VarAdd(name, val, ctxt);
975 Buf_AddBytes(&v->val, strlen(val), val);
978 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
980 if ((v->flags & VAR_EXPORTED)) {
981 Var_Export1(name, VAR_EXPORT_PARENT);
985 * Any variables given on the command line are automatically exported
986 * to the environment (as per POSIX standard)
988 if (ctxt == VAR_CMD && (flags & VAR_NO_EXPORT) == 0) {
990 /* we just added it */
991 v = VarFind(name, ctxt, 0);
994 v->flags |= VAR_FROM_CMD;
996 * If requested, don't export these in the environment
997 * individually. We still put them in MAKEOVERRIDES so
998 * that the command-line settings continue to override
1001 if (varNoExportEnv != TRUE)
1002 setenv(name, val ? val : "", 1);
1004 Var_Append(MAKEOVERRIDES, name, VAR_GLOBAL);
1007 if (strcmp(name, SAVE_DOLLARS) == 0)
1008 save_dollars = s2Boolean(val, save_dollars);
1012 free(expanded_name);
1014 VarFreeEnv(v, TRUE);
1018 *-----------------------------------------------------------------------
1020 * The variable of the given name has the given value appended to it in
1021 * the given context.
1024 * name name of variable to modify
1025 * val String to append to it
1026 * ctxt Context in which this should occur
1032 * If the variable doesn't exist, it is created. Else the strings
1033 * are concatenated (with a space in between).
1036 * Only if the variable is being sought in the global context is the
1037 * environment searched.
1038 * XXX: Knows its calling circumstances in that if called with ctxt
1039 * an actual target, it will only search that context since only
1040 * a local variable could be being appended to. This is actually
1041 * a big win and must be tolerated.
1042 *-----------------------------------------------------------------------
1045 Var_Append(const char *name, const char *val, GNode *ctxt)
1049 char *expanded_name = NULL;
1051 if (strchr(name, '$') != NULL) {
1052 expanded_name = Var_Subst(NULL, name, ctxt, VARF_WANTRES);
1053 if (expanded_name[0] == 0) {
1055 fprintf(debug_file, "Var_Append(\"%s\", \"%s\", ...) "
1056 "name expands to empty string - ignored\n",
1059 free(expanded_name);
1062 name = expanded_name;
1065 v = VarFind(name, ctxt, (ctxt == VAR_GLOBAL) ? (FIND_CMD|FIND_ENV) : 0);
1068 Var_Set(name, val, ctxt, 0);
1069 } else if (ctxt == VAR_CMD || !(v->flags & VAR_FROM_CMD)) {
1070 Buf_AddByte(&v->val, ' ');
1071 Buf_AddBytes(&v->val, strlen(val), val);
1074 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name,
1075 Buf_GetAll(&v->val, NULL));
1078 if (v->flags & VAR_FROM_ENV) {
1080 * If the original variable came from the environment, we
1081 * have to install it in the global context (we could place
1082 * it in the environment, but then we should provide a way to
1083 * export other variables...)
1085 v->flags &= ~VAR_FROM_ENV;
1086 h = Hash_CreateEntry(&ctxt->context, name, NULL);
1087 Hash_SetValue(h, v);
1090 free(expanded_name);
1094 *-----------------------------------------------------------------------
1096 * See if the given variable exists.
1099 * name Variable to find
1100 * ctxt Context in which to start search
1103 * TRUE if it does, FALSE if it doesn't
1108 *-----------------------------------------------------------------------
1111 Var_Exists(const char *name, GNode *ctxt)
1116 if ((cp = strchr(name, '$')) != NULL) {
1117 cp = Var_Subst(NULL, name, ctxt, VARF_WANTRES);
1119 v = VarFind(cp ? cp : name, ctxt, FIND_CMD|FIND_GLOBAL|FIND_ENV);
1124 (void)VarFreeEnv(v, TRUE);
1130 *-----------------------------------------------------------------------
1132 * Return the value of the named variable in the given context
1136 * ctxt context in which to search for it
1139 * The value if the variable exists, NULL if it doesn't
1143 *-----------------------------------------------------------------------
1146 Var_Value(const char *name, GNode *ctxt, char **frp)
1150 v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
1153 char *p = (Buf_GetAll(&v->val, NULL));
1154 if (VarFreeEnv(v, FALSE))
1163 *-----------------------------------------------------------------------
1165 * Remove the tail of the given word and place the result in the given
1170 * addSpace True if need to add a space to the buffer
1171 * before sticking in the head
1172 * buf Buffer in which to store it
1175 * TRUE if characters were added to the buffer (a space needs to be
1176 * added to the buffer before the next word).
1179 * The trimmed word is added to the buffer.
1181 *-----------------------------------------------------------------------
1184 VarHead(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1185 char *word, Boolean addSpace, Buffer *buf,
1186 void *dummy MAKE_ATTR_UNUSED)
1190 slash = strrchr(word, '/');
1191 if (slash != NULL) {
1192 if (addSpace && vpstate->varSpace) {
1193 Buf_AddByte(buf, vpstate->varSpace);
1196 Buf_AddBytes(buf, strlen(word), word);
1201 * If no directory part, give . (q.v. the POSIX standard)
1203 if (addSpace && vpstate->varSpace)
1204 Buf_AddByte(buf, vpstate->varSpace);
1205 Buf_AddByte(buf, '.');
1211 *-----------------------------------------------------------------------
1213 * Remove the head of the given word and place the result in the given
1218 * addSpace True if need to add a space to the buffer
1219 * before adding the tail
1220 * buf Buffer in which to store it
1223 * TRUE if characters were added to the buffer (a space needs to be
1224 * added to the buffer before the next word).
1227 * The trimmed word is added to the buffer.
1229 *-----------------------------------------------------------------------
1232 VarTail(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1233 char *word, Boolean addSpace, Buffer *buf,
1234 void *dummy MAKE_ATTR_UNUSED)
1238 if (addSpace && vpstate->varSpace) {
1239 Buf_AddByte(buf, vpstate->varSpace);
1242 slash = strrchr(word, '/');
1243 if (slash != NULL) {
1245 Buf_AddBytes(buf, strlen(slash), slash);
1248 Buf_AddBytes(buf, strlen(word), word);
1254 *-----------------------------------------------------------------------
1256 * Place the suffix of the given word in the given buffer.
1260 * addSpace TRUE if need to add a space before placing the
1261 * suffix in the buffer
1262 * buf Buffer in which to store it
1265 * TRUE if characters were added to the buffer (a space needs to be
1266 * added to the buffer before the next word).
1269 * The suffix from the word is placed in the buffer.
1271 *-----------------------------------------------------------------------
1274 VarSuffix(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1275 char *word, Boolean addSpace, Buffer *buf,
1276 void *dummy MAKE_ATTR_UNUSED)
1280 dot = strrchr(word, '.');
1282 if (addSpace && vpstate->varSpace) {
1283 Buf_AddByte(buf, vpstate->varSpace);
1286 Buf_AddBytes(buf, strlen(dot), dot);
1294 *-----------------------------------------------------------------------
1296 * Remove the suffix of the given word and place the result in the
1301 * addSpace TRUE if need to add a space to the buffer
1302 * before placing the root in it
1303 * buf Buffer in which to store it
1306 * TRUE if characters were added to the buffer (a space needs to be
1307 * added to the buffer before the next word).
1310 * The trimmed word is added to the buffer.
1312 *-----------------------------------------------------------------------
1315 VarRoot(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1316 char *word, Boolean addSpace, Buffer *buf,
1317 void *dummy MAKE_ATTR_UNUSED)
1321 if (addSpace && vpstate->varSpace) {
1322 Buf_AddByte(buf, vpstate->varSpace);
1325 dot = strrchr(word, '.');
1328 Buf_AddBytes(buf, strlen(word), word);
1331 Buf_AddBytes(buf, strlen(word), word);
1337 *-----------------------------------------------------------------------
1339 * Place the word in the buffer if it matches the given pattern.
1340 * Callback function for VarModify to implement the :M modifier.
1343 * word Word to examine
1344 * addSpace TRUE if need to add a space to the buffer
1345 * before adding the word, if it matches
1346 * buf Buffer in which to store it
1347 * pattern Pattern the word must match
1350 * TRUE if a space should be placed in the buffer before the next
1354 * The word may be copied to the buffer.
1356 *-----------------------------------------------------------------------
1359 VarMatch(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1360 char *word, Boolean addSpace, Buffer *buf,
1364 fprintf(debug_file, "VarMatch [%s] [%s]\n", word, (char *)pattern);
1365 if (Str_Match(word, (char *)pattern)) {
1366 if (addSpace && vpstate->varSpace) {
1367 Buf_AddByte(buf, vpstate->varSpace);
1370 Buf_AddBytes(buf, strlen(word), word);
1377 *-----------------------------------------------------------------------
1379 * Place the word in the buffer if it matches the given pattern.
1380 * Callback function for VarModify to implement the System V %
1384 * word Word to examine
1385 * addSpace TRUE if need to add a space to the buffer
1386 * before adding the word, if it matches
1387 * buf Buffer in which to store it
1388 * patp Pattern the word must match
1391 * TRUE if a space should be placed in the buffer before the next
1395 * The word may be copied to the buffer.
1397 *-----------------------------------------------------------------------
1400 VarSYSVMatch(GNode *ctx, Var_Parse_State *vpstate,
1401 char *word, Boolean addSpace, Buffer *buf,
1407 VarPattern *pat = (VarPattern *)patp;
1410 if (addSpace && vpstate->varSpace)
1411 Buf_AddByte(buf, vpstate->varSpace);
1415 if ((ptr = Str_SYSVMatch(word, pat->lhs, &len, &hasPercent)) != NULL) {
1416 varexp = Var_Subst(NULL, pat->rhs, ctx, VARF_WANTRES);
1417 Str_SYSVSubst(buf, varexp, ptr, len, hasPercent);
1420 Buf_AddBytes(buf, strlen(word), word);
1429 *-----------------------------------------------------------------------
1431 * Place the word in the buffer if it doesn't match the given pattern.
1432 * Callback function for VarModify to implement the :N modifier.
1435 * word Word to examine
1436 * addSpace TRUE if need to add a space to the buffer
1437 * before adding the word, if it matches
1438 * buf Buffer in which to store it
1439 * pattern Pattern the word must match
1442 * TRUE if a space should be placed in the buffer before the next
1446 * The word may be copied to the buffer.
1448 *-----------------------------------------------------------------------
1451 VarNoMatch(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1452 char *word, Boolean addSpace, Buffer *buf,
1455 if (!Str_Match(word, (char *)pattern)) {
1456 if (addSpace && vpstate->varSpace) {
1457 Buf_AddByte(buf, vpstate->varSpace);
1460 Buf_AddBytes(buf, strlen(word), word);
1467 *-----------------------------------------------------------------------
1469 * Perform a string-substitution on the given word, placing the
1470 * result in the passed buffer.
1473 * word Word to modify
1474 * addSpace True if space should be added before
1476 * buf Buffer for result
1477 * patternp Pattern for substitution
1480 * TRUE if a space is needed before more characters are added.
1485 *-----------------------------------------------------------------------
1488 VarSubstitute(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1489 char *word, Boolean addSpace, Buffer *buf,
1492 int wordLen; /* Length of word */
1493 char *cp; /* General pointer */
1494 VarPattern *pattern = (VarPattern *)patternp;
1496 wordLen = strlen(word);
1497 if ((pattern->flags & (VAR_SUB_ONE|VAR_SUB_MATCHED)) !=
1498 (VAR_SUB_ONE|VAR_SUB_MATCHED)) {
1500 * Still substituting -- break it down into simple anchored cases
1501 * and if none of them fits, perform the general substitution case.
1503 if ((pattern->flags & VAR_MATCH_START) &&
1504 (strncmp(word, pattern->lhs, pattern->leftLen) == 0)) {
1506 * Anchored at start and beginning of word matches pattern
1508 if ((pattern->flags & VAR_MATCH_END) &&
1509 (wordLen == pattern->leftLen)) {
1511 * Also anchored at end and matches to the end (word
1512 * is same length as pattern) add space and rhs only
1513 * if rhs is non-null.
1515 if (pattern->rightLen != 0) {
1516 if (addSpace && vpstate->varSpace) {
1517 Buf_AddByte(buf, vpstate->varSpace);
1520 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1522 pattern->flags |= VAR_SUB_MATCHED;
1523 } else if (pattern->flags & VAR_MATCH_END) {
1525 * Doesn't match to end -- copy word wholesale
1530 * Matches at start but need to copy in trailing characters
1532 if ((pattern->rightLen + wordLen - pattern->leftLen) != 0){
1533 if (addSpace && vpstate->varSpace) {
1534 Buf_AddByte(buf, vpstate->varSpace);
1538 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1539 Buf_AddBytes(buf, wordLen - pattern->leftLen,
1540 (word + pattern->leftLen));
1541 pattern->flags |= VAR_SUB_MATCHED;
1543 } else if (pattern->flags & VAR_MATCH_START) {
1545 * Had to match at start of word and didn't -- copy whole word.
1548 } else if (pattern->flags & VAR_MATCH_END) {
1550 * Anchored at end, Find only place match could occur (leftLen
1551 * characters from the end of the word) and see if it does. Note
1552 * that because the $ will be left at the end of the lhs, we have
1555 cp = word + (wordLen - pattern->leftLen);
1557 (strncmp(cp, pattern->lhs, pattern->leftLen) == 0)) {
1559 * Match found. If we will place characters in the buffer,
1560 * add a space before hand as indicated by addSpace, then
1561 * stuff in the initial, unmatched part of the word followed
1562 * by the right-hand-side.
1564 if (((cp - word) + pattern->rightLen) != 0) {
1565 if (addSpace && vpstate->varSpace) {
1566 Buf_AddByte(buf, vpstate->varSpace);
1570 Buf_AddBytes(buf, cp - word, word);
1571 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1572 pattern->flags |= VAR_SUB_MATCHED;
1575 * Had to match at end and didn't. Copy entire word.
1581 * Pattern is unanchored: search for the pattern in the word using
1582 * String_FindSubstring, copying unmatched portions and the
1583 * right-hand-side for each match found, handling non-global
1584 * substitutions correctly, etc. When the loop is done, any
1585 * remaining part of the word (word and wordLen are adjusted
1586 * accordingly through the loop) is copied straight into the
1588 * addSpace is set FALSE as soon as a space is added to the
1595 origSize = Buf_Size(buf);
1597 cp = Str_FindSubstring(word, pattern->lhs);
1599 if (addSpace && (((cp - word) + pattern->rightLen) != 0)){
1600 Buf_AddByte(buf, vpstate->varSpace);
1603 Buf_AddBytes(buf, cp-word, word);
1604 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1605 wordLen -= (cp - word) + pattern->leftLen;
1606 word = cp + pattern->leftLen;
1610 if ((pattern->flags & VAR_SUB_GLOBAL) == 0) {
1613 pattern->flags |= VAR_SUB_MATCHED;
1619 if (addSpace && vpstate->varSpace) {
1620 Buf_AddByte(buf, vpstate->varSpace);
1622 Buf_AddBytes(buf, wordLen, word);
1625 * If added characters to the buffer, need to add a space
1626 * before we add any more. If we didn't add any, just return
1627 * the previous value of addSpace.
1629 return ((Buf_Size(buf) != origSize) || addSpace);
1634 if (addSpace && vpstate->varSpace) {
1635 Buf_AddByte(buf, vpstate->varSpace);
1637 Buf_AddBytes(buf, wordLen, word);
1643 *-----------------------------------------------------------------------
1645 * Print the error caused by a regcomp or regexec call.
1651 * An error gets printed.
1653 *-----------------------------------------------------------------------
1656 VarREError(int reerr, regex_t *pat, const char *str)
1661 errlen = regerror(reerr, pat, 0, 0);
1662 errbuf = bmake_malloc(errlen);
1663 regerror(reerr, pat, errbuf, errlen);
1664 Error("%s: %s", str, errbuf);
1670 *-----------------------------------------------------------------------
1671 * VarRESubstitute --
1672 * Perform a regex substitution on the given word, placing the
1673 * result in the passed buffer.
1676 * TRUE if a space is needed before more characters are added.
1681 *-----------------------------------------------------------------------
1684 VarRESubstitute(GNode *ctx MAKE_ATTR_UNUSED,
1685 Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
1686 char *word, Boolean addSpace, Buffer *buf,
1696 #define MAYBE_ADD_SPACE() \
1697 if (addSpace && !added) \
1698 Buf_AddByte(buf, ' '); \
1705 if ((pat->flags & (VAR_SUB_ONE|VAR_SUB_MATCHED)) ==
1706 (VAR_SUB_ONE|VAR_SUB_MATCHED))
1710 xrv = regexec(&pat->re, wp, pat->nsub, pat->matches, flags);
1715 pat->flags |= VAR_SUB_MATCHED;
1716 if (pat->matches[0].rm_so > 0) {
1718 Buf_AddBytes(buf, pat->matches[0].rm_so, wp);
1721 for (rp = pat->replace; *rp; rp++) {
1722 if ((*rp == '\\') && ((rp[1] == '&') || (rp[1] == '\\'))) {
1724 Buf_AddByte(buf,rp[1]);
1727 else if ((*rp == '&') ||
1728 ((*rp == '\\') && isdigit((unsigned char)rp[1]))) {
1746 if (n > pat->nsub) {
1747 Error("No subexpression %s", &errstr[0]);
1750 } else if ((pat->matches[n].rm_so == -1) &&
1751 (pat->matches[n].rm_eo == -1)) {
1752 Error("No match for subexpression %s", &errstr[0]);
1756 subbuf = wp + pat->matches[n].rm_so;
1757 sublen = pat->matches[n].rm_eo - pat->matches[n].rm_so;
1762 Buf_AddBytes(buf, sublen, subbuf);
1766 Buf_AddByte(buf, *rp);
1769 wp += pat->matches[0].rm_eo;
1770 if (pat->flags & VAR_SUB_GLOBAL) {
1771 flags |= REG_NOTBOL;
1772 if (pat->matches[0].rm_so == 0 && pat->matches[0].rm_eo == 0) {
1774 Buf_AddByte(buf, *wp);
1783 Buf_AddBytes(buf, strlen(wp), wp);
1787 VarREError(xrv, &pat->re, "Unexpected regex error");
1792 Buf_AddBytes(buf,strlen(wp),wp);
1796 return(addSpace||added);
1803 *-----------------------------------------------------------------------
1805 * Implements the :@<temp>@<string>@ modifier of ODE make.
1806 * We set the temp variable named in pattern.lhs to word and expand
1807 * pattern.rhs storing the result in the passed buffer.
1810 * word Word to modify
1811 * addSpace True if space should be added before
1813 * buf Buffer for result
1814 * pattern Datafor substitution
1817 * TRUE if a space is needed before more characters are added.
1822 *-----------------------------------------------------------------------
1825 VarLoopExpand(GNode *ctx MAKE_ATTR_UNUSED,
1826 Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
1827 char *word, Boolean addSpace, Buffer *buf,
1830 VarLoop_t *loop = (VarLoop_t *)loopp;
1834 if (word && *word) {
1835 Var_Set(loop->tvar, word, loop->ctxt, VAR_NO_EXPORT);
1836 s = Var_Subst(NULL, loop->str, loop->ctxt, loop->errnum | VARF_WANTRES);
1837 if (s != NULL && *s != '\0') {
1838 if (addSpace && *s != '\n')
1839 Buf_AddByte(buf, ' ');
1840 Buf_AddBytes(buf, (slen = strlen(s)), s);
1841 addSpace = (slen > 0 && s[slen - 1] != '\n');
1850 *-----------------------------------------------------------------------
1852 * Implements the :[start..end] modifier.
1853 * This is a special case of VarModify since we want to be able
1854 * to scan the list backwards if start > end.
1857 * str String whose words should be trimmed
1858 * seldata words to select
1861 * A string of all the words selected.
1866 *-----------------------------------------------------------------------
1869 VarSelectWords(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1870 const char *str, VarSelectWords_t *seldata)
1872 Buffer buf; /* Buffer for the new string */
1873 Boolean addSpace; /* TRUE if need to add a space to the
1874 * buffer before adding the trimmed
1876 char **av; /* word list */
1877 char *as; /* word list memory */
1879 int start, end, step;
1884 if (vpstate->oneBigWord) {
1885 /* fake what brk_string() would do if there were only one word */
1887 av = bmake_malloc((ac + 1) * sizeof(char *));
1888 as = bmake_strdup(str);
1892 av = brk_string(str, &ac, FALSE, &as);
1896 * Now sanitize seldata.
1897 * If seldata->start or seldata->end are negative, convert them to
1898 * the positive equivalents (-1 gets converted to argc, -2 gets
1899 * converted to (argc-1), etc.).
1901 if (seldata->start < 0)
1902 seldata->start = ac + seldata->start + 1;
1903 if (seldata->end < 0)
1904 seldata->end = ac + seldata->end + 1;
1907 * We avoid scanning more of the list than we need to.
1909 if (seldata->start > seldata->end) {
1910 start = MIN(ac, seldata->start) - 1;
1911 end = MAX(0, seldata->end - 1);
1914 start = MAX(0, seldata->start - 1);
1915 end = MIN(ac, seldata->end);
1920 (step < 0 && i >= end) || (step > 0 && i < end);
1922 if (av[i] && *av[i]) {
1923 if (addSpace && vpstate->varSpace) {
1924 Buf_AddByte(&buf, vpstate->varSpace);
1926 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
1934 return Buf_Destroy(&buf, FALSE);
1940 * Replace each word with the result of realpath()
1944 VarRealpath(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1945 char *word, Boolean addSpace, Buffer *buf,
1946 void *patternp MAKE_ATTR_UNUSED)
1949 char rbuf[MAXPATHLEN];
1952 if (addSpace && vpstate->varSpace) {
1953 Buf_AddByte(buf, vpstate->varSpace);
1956 rp = cached_realpath(word, rbuf);
1957 if (rp && *rp == '/' && stat(rp, &st) == 0)
1960 Buf_AddBytes(buf, strlen(word), word);
1965 *-----------------------------------------------------------------------
1967 * Modify each of the words of the passed string using the given
1968 * function. Used to implement all modifiers.
1971 * str String whose words should be trimmed
1972 * modProc Function to use to modify them
1973 * datum Datum to pass it
1976 * A string of all the words modified appropriately.
1981 *-----------------------------------------------------------------------
1984 VarModify(GNode *ctx, Var_Parse_State *vpstate,
1986 Boolean (*modProc)(GNode *, Var_Parse_State *, char *,
1987 Boolean, Buffer *, void *),
1990 Buffer buf; /* Buffer for the new string */
1991 Boolean addSpace; /* TRUE if need to add a space to the
1992 * buffer before adding the trimmed
1994 char **av; /* word list */
1995 char *as; /* word list memory */
2001 if (vpstate->oneBigWord) {
2002 /* fake what brk_string() would do if there were only one word */
2004 av = bmake_malloc((ac + 1) * sizeof(char *));
2005 as = bmake_strdup(str);
2009 av = brk_string(str, &ac, FALSE, &as);
2012 for (i = 0; i < ac; i++) {
2013 addSpace = (*modProc)(ctx, vpstate, av[i], addSpace, &buf, datum);
2019 return Buf_Destroy(&buf, FALSE);
2024 VarWordCompare(const void *a, const void *b)
2026 int r = strcmp(*(const char * const *)a, *(const char * const *)b);
2031 *-----------------------------------------------------------------------
2033 * Order the words in the string.
2036 * str String whose words should be sorted.
2037 * otype How to order: s - sort, x - random.
2040 * A string containing the words ordered.
2045 *-----------------------------------------------------------------------
2048 VarOrder(const char *str, const char otype)
2050 Buffer buf; /* Buffer for the new string */
2051 char **av; /* word list [first word does not count] */
2052 char *as; /* word list memory */
2057 av = brk_string(str, &ac, FALSE, &as);
2061 case 's': /* sort alphabetically */
2062 qsort(av, ac, sizeof(char *), VarWordCompare);
2064 case 'x': /* randomize */
2070 * We will use [ac..2] range for mod factors. This will produce
2071 * random numbers in [(ac-1)..0] interval, and minimal
2072 * reasonable value for mod factor is 2 (the mod 1 will produce
2073 * 0 with probability 1).
2075 for (i = ac-1; i > 0; i--) {
2076 rndidx = random() % (i + 1);
2084 } /* end of switch */
2086 for (i = 0; i < ac; i++) {
2087 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
2089 Buf_AddByte(&buf, ' ');
2095 return Buf_Destroy(&buf, FALSE);
2100 *-----------------------------------------------------------------------
2102 * Remove adjacent duplicate words.
2105 * str String whose words should be sorted
2108 * A string containing the resulting words.
2113 *-----------------------------------------------------------------------
2116 VarUniq(const char *str)
2118 Buffer buf; /* Buffer for new string */
2119 char **av; /* List of words to affect */
2120 char *as; /* Word list memory */
2124 av = brk_string(str, &ac, FALSE, &as);
2127 for (j = 0, i = 1; i < ac; i++)
2128 if (strcmp(av[i], av[j]) != 0 && (++j != i))
2133 for (i = 0; i < ac; i++) {
2134 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
2136 Buf_AddByte(&buf, ' ');
2142 return Buf_Destroy(&buf, FALSE);
2146 *-----------------------------------------------------------------------
2148 * Return an integer sequence
2151 * str String whose words provide default range
2152 * ac range length, if 0 use str words
2157 *-----------------------------------------------------------------------
2160 VarRange(const char *str, int ac)
2162 Buffer buf; /* Buffer for new string */
2163 char tmp[32]; /* each element */
2164 char **av; /* List of words to affect */
2165 char *as; /* Word list memory */
2173 av = brk_string(str, &ac, FALSE, &as);
2175 for (i = 0; i < ac; i++) {
2176 n = snprintf(tmp, sizeof(tmp), "%d", 1 + i);
2177 if (n >= (int)sizeof(tmp))
2179 Buf_AddBytes(&buf, n, tmp);
2181 Buf_AddByte(&buf, ' ');
2187 return Buf_Destroy(&buf, FALSE);
2192 *-----------------------------------------------------------------------
2194 * Pass through the tstr looking for 1) escaped delimiters,
2195 * '$'s and backslashes (place the escaped character in
2196 * uninterpreted) and 2) unescaped $'s that aren't before
2197 * the delimiter (expand the variable substitution unless flags
2198 * has VAR_NOSUBST set).
2199 * Return the expanded string or NULL if the delimiter was missing
2200 * If pattern is specified, handle escaped ampersands, and replace
2201 * unescaped ampersands with the lhs of the pattern.
2204 * A string of all the words modified appropriately.
2205 * If length is specified, return the string length of the buffer
2206 * If flags is specified and the last character of the pattern is a
2207 * $ set the VAR_MATCH_END bit of flags.
2211 *-----------------------------------------------------------------------
2214 VarGetPattern(GNode *ctxt, Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
2215 int flags, const char **tstr, int delim, int *vflags,
2216 int *length, VarPattern *pattern)
2222 int errnum = flags & VARF_UNDEFERR;
2228 #define IS_A_MATCH(cp, delim) \
2229 ((cp[0] == '\\') && ((cp[1] == delim) || \
2230 (cp[1] == '\\') || (cp[1] == '$') || (pattern && (cp[1] == '&'))))
2233 * Skim through until the matching delimiter is found;
2234 * pick up variable substitutions on the way. Also allow
2235 * backslashes to quote the delimiter, $, and \, but don't
2236 * touch other backslashes.
2238 for (cp = *tstr; *cp && (*cp != delim); cp++) {
2239 if (IS_A_MATCH(cp, delim)) {
2240 Buf_AddByte(&buf, cp[1]);
2242 } else if (*cp == '$') {
2243 if (cp[1] == delim) {
2245 Buf_AddByte(&buf, *cp);
2248 * Unescaped $ at end of pattern => anchor
2251 *vflags |= VAR_MATCH_END;
2253 if (vflags == NULL || (*vflags & VAR_NOSUBST) == 0) {
2259 * If unescaped dollar sign not before the
2260 * delimiter, assume it's a variable
2261 * substitution and recurse.
2263 cp2 = Var_Parse(cp, ctxt, errnum | VARF_WANTRES, &len,
2265 Buf_AddBytes(&buf, strlen(cp2), cp2);
2269 const char *cp2 = &cp[1];
2271 if (*cp2 == PROPEN || *cp2 == BROPEN) {
2273 * Find the end of this variable reference
2274 * and suck it in without further ado.
2275 * It will be interperated later.
2278 int want = (*cp2 == PROPEN) ? PRCLOSE : BRCLOSE;
2281 for (++cp2; *cp2 != '\0' && depth > 0; ++cp2) {
2282 if (cp2[-1] != '\\') {
2289 Buf_AddBytes(&buf, cp2 - cp, cp);
2292 Buf_AddByte(&buf, *cp);
2296 else if (pattern && *cp == '&')
2297 Buf_AddBytes(&buf, pattern->leftLen, pattern->lhs);
2299 Buf_AddByte(&buf, *cp);
2309 *length = Buf_Size(&buf);
2310 rstr = Buf_Destroy(&buf, FALSE);
2312 fprintf(debug_file, "Modifier pattern: \"%s\"\n", rstr);
2317 *-----------------------------------------------------------------------
2319 * Quote shell meta-characters and space characters in the string
2320 * if quoteDollar is set, also quote and double any '$' characters.
2328 *-----------------------------------------------------------------------
2331 VarQuote(char *str, Boolean quoteDollar)
2335 const char *newline;
2338 if ((newline = Shell_GetNewline()) == NULL)
2340 nlen = strlen(newline);
2344 for (; *str != '\0'; str++) {
2346 Buf_AddBytes(&buf, nlen, newline);
2349 if (isspace((unsigned char)*str) || ismeta((unsigned char)*str))
2350 Buf_AddByte(&buf, '\\');
2351 Buf_AddByte(&buf, *str);
2352 if (quoteDollar && *str == '$')
2353 Buf_AddBytes(&buf, 2, "\\$");
2356 str = Buf_Destroy(&buf, FALSE);
2358 fprintf(debug_file, "QuoteMeta: [%s]\n", str);
2363 *-----------------------------------------------------------------------
2365 * Hash the string using the MurmurHash3 algorithm.
2366 * Output is computed using 32bit Little Endian arithmetic.
2369 * str String to modify
2372 * Hash value of str, encoded as 8 hex digits.
2377 *-----------------------------------------------------------------------
2382 static const char hexdigits[16] = "0123456789abcdef";
2385 unsigned char *ustr = (unsigned char *)str;
2386 unsigned int h, k, c1, c2;
2393 for (len = len2; len; ) {
2397 k = (ustr[3] << 24) | (ustr[2] << 16) | (ustr[1] << 8) | ustr[0];
2402 k |= (ustr[2] << 16);
2405 k |= (ustr[1] << 8);
2411 c1 = c1 * 5 + 0x7b7d159cU;
2412 c2 = c2 * 5 + 0x6bce6396U;
2414 k = (k << 11) ^ (k >> 21);
2416 h = (h << 13) ^ (h >> 19);
2417 h = h * 5 + 0x52dce729U;
2427 for (len = 0; len < 8; ++len) {
2428 Buf_AddByte(&buf, hexdigits[h & 15]);
2432 return Buf_Destroy(&buf, FALSE);
2436 VarStrftime(const char *fmt, int zulu, time_t utc)
2444 strftime(buf, sizeof(buf), fmt, zulu ? gmtime(&utc) : localtime(&utc));
2446 buf[sizeof(buf) - 1] = '\0';
2447 return bmake_strdup(buf);
2451 * Now we need to apply any modifiers the user wants applied.
2453 * :M<pattern> words which match the given <pattern>.
2454 * <pattern> is of the standard file
2456 * :N<pattern> words which do not match the given <pattern>.
2457 * :S<d><pat1><d><pat2><d>[1gW]
2458 * Substitute <pat2> for <pat1> in the value
2459 * :C<d><pat1><d><pat2><d>[1gW]
2460 * Substitute <pat2> for regex <pat1> in the value
2461 * :H Substitute the head of each word
2462 * :T Substitute the tail of each word
2463 * :E Substitute the extension (minus '.') of
2465 * :R Substitute the root of each word
2466 * (pathname minus the suffix).
2467 * :O ("Order") Alphabeticaly sort words in variable.
2468 * :Ox ("intermiX") Randomize words in variable.
2469 * :u ("uniq") Remove adjacent duplicate words.
2470 * :tu Converts the variable contents to uppercase.
2471 * :tl Converts the variable contents to lowercase.
2472 * :ts[c] Sets varSpace - the char used to
2473 * separate words to 'c'. If 'c' is
2474 * omitted then no separation is used.
2475 * :tW Treat the variable contents as a single
2476 * word, even if it contains spaces.
2477 * (Mnemonic: one big 'W'ord.)
2478 * :tw Treat the variable contents as multiple
2479 * space-separated words.
2480 * (Mnemonic: many small 'w'ords.)
2481 * :[index] Select a single word from the value.
2482 * :[start..end] Select multiple words from the value.
2483 * :[*] or :[0] Select the entire value, as a single
2484 * word. Equivalent to :tW.
2485 * :[@] Select the entire value, as multiple
2486 * words. Undoes the effect of :[*].
2487 * Equivalent to :tw.
2488 * :[#] Returns the number of words in the value.
2490 * :?<true-value>:<false-value>
2491 * If the variable evaluates to true, return
2492 * true value, else return the second value.
2493 * :lhs=rhs Like :S, but the rhs goes to the end of
2495 * :sh Treat the current value as a command
2496 * to be run, new value is its output.
2497 * The following added so we can handle ODE makefiles.
2498 * :@<tmpvar>@<newval>@
2499 * Assign a temporary local variable <tmpvar>
2500 * to the current value of each word in turn
2501 * and replace each word with the result of
2502 * evaluating <newval>
2503 * :D<newval> Use <newval> as value if variable defined
2504 * :U<newval> Use <newval> as value if variable undefined
2505 * :L Use the name of the variable as the value.
2506 * :P Use the path of the node that has the same
2507 * name as the variable as the value. This
2508 * basically includes an implied :L so that
2509 * the common method of refering to the path
2510 * of your dependent 'x' in a rule is to use
2511 * the form '${x:P}'.
2512 * :!<cmd>! Run cmd much the same as :sh run's the
2513 * current value of the variable.
2514 * The ::= modifiers, actually assign a value to the variable.
2515 * Their main purpose is in supporting modifiers of .for loop
2516 * iterators and other obscure uses. They always expand to
2517 * nothing. In a target rule that would otherwise expand to an
2518 * empty line they can be preceded with @: to keep make happy.
2522 * .for i in ${.TARGET} ${.TARGET:R}.gz
2527 * ::=<str> Assigns <str> as the new value of variable.
2528 * ::?=<str> Assigns <str> as value of variable if
2529 * it was not already set.
2530 * ::+=<str> Appends <str> to variable.
2531 * ::!=<cmd> Assigns output of <cmd> as the new value of
2535 /* we now have some modifiers with long names */
2536 #define STRMOD_MATCH(s, want, n) \
2537 (strncmp(s, want, n) == 0 && (s[n] == endc || s[n] == ':'))
2538 #define STRMOD_MATCHX(s, want, n) \
2539 (strncmp(s, want, n) == 0 && (s[n] == endc || s[n] == ':' || s[n] == '='))
2540 #define CHARMOD_MATCH(c) (c == endc || c == ':')
2543 ApplyModifiers(char *nstr, const char *tstr,
2544 int startc, int endc,
2545 Var *v, GNode *ctxt, int flags,
2546 int *lengthPtr, void **freePtr)
2549 const char *cp; /* Secondary pointer into str (place marker
2551 char *newStr; /* New value to return */
2553 char termc; /* Character which terminated scan */
2554 int cnt; /* Used to count brace pairs when variable in
2555 * in parens or braces */
2557 int modifier; /* that we are processing */
2558 Var_Parse_State parsestate; /* Flags passed to helper functions */
2559 time_t utc; /* for VarStrftime */
2562 parsestate.oneBigWord = FALSE;
2563 parsestate.varSpace = ' '; /* word separator */
2567 while (*tstr && *tstr != endc) {
2571 * We may have some complex modifiers in a variable.
2578 rval = Var_Parse(tstr, ctxt, flags, &rlen, &freeIt);
2581 * If we have not parsed up to endc or ':',
2582 * we are not interested.
2584 if (rval != NULL && *rval &&
2585 (c = tstr[rlen]) != '\0' &&
2593 fprintf(debug_file, "Got '%s' from '%.*s'%.*s\n",
2594 rval, rlen, tstr, rlen, tstr + rlen);
2599 if (rval != NULL && *rval) {
2602 nstr = ApplyModifiers(nstr, rval,
2603 0, 0, v, ctxt, flags, &used, freePtr);
2604 if (nstr == var_Error
2605 || (nstr == varNoError && (flags & VARF_UNDEFERR) == 0)
2606 || strlen(rval) != (size_t) used) {
2608 goto out; /* error already reported */
2614 else if (!*tstr && endc) {
2615 Error("Unclosed variable specification after complex modifier (expecting '%c') for %s", endc, v->name);
2622 fprintf(debug_file, "Applying[%s] :%c to \"%s\"\n", v->name,
2626 switch ((modifier = *tstr)) {
2629 if (tstr[1] == '=' ||
2631 (tstr[1] == '!' || tstr[1] == '+' || tstr[1] == '?'))) {
2633 * "::=", "::!=", "::+=", or "::?="
2635 GNode *v_ctxt; /* context where v belongs */
2642 if (v->name[0] == 0)
2648 if (v->flags & VAR_JUNK) {
2650 * We need to bmake_strdup() it incase
2651 * VarGetPattern() recurses.
2654 v->name = bmake_strdup(v->name);
2655 } else if (ctxt != VAR_GLOBAL) {
2656 Var *gv = VarFind(v->name, ctxt, 0);
2658 v_ctxt = VAR_GLOBAL;
2660 VarFreeEnv(gv, TRUE);
2663 switch ((how = *tstr)) {
2673 delim = startc == PROPEN ? PRCLOSE : BRCLOSE;
2676 vflags = (flags & VARF_WANTRES) ? 0 : VAR_NOSUBST;
2677 pattern.rhs = VarGetPattern(ctxt, &parsestate, flags,
2678 &cp, delim, &vflags,
2681 if (v->flags & VAR_JUNK) {
2682 /* restore original name */
2686 if (pattern.rhs == NULL)
2692 if (flags & VARF_WANTRES) {
2695 Var_Append(v->name, pattern.rhs, v_ctxt);
2698 newStr = Cmd_Exec(pattern.rhs, &emsg);
2702 Var_Set(v->name, newStr, v_ctxt, 0);
2706 if ((v->flags & VAR_JUNK) == 0)
2710 Var_Set(v->name, pattern.rhs, v_ctxt, 0);
2714 free(UNCONST(pattern.rhs));
2715 newStr = varNoError;
2718 goto default_case; /* "::<unrecognised>" */
2723 int vflags = VAR_NOSUBST;
2727 if ((loop.tvar = VarGetPattern(ctxt, &parsestate, flags,
2729 &vflags, &loop.tvarLen,
2733 if ((loop.str = VarGetPattern(ctxt, &parsestate, flags,
2735 &vflags, &loop.strLen,
2742 loop.errnum = flags & VARF_UNDEFERR;
2744 newStr = VarModify(ctxt, &parsestate, nstr, VarLoopExpand,
2746 Var_Delete(loop.tvar, ctxt);
2751 case '_': /* remember current value */
2752 cp = tstr + 1; /* make sure it is set */
2753 if (STRMOD_MATCHX(tstr, "_", 1)) {
2754 if (tstr[1] == '=') {
2759 n = strcspn(cp, ":)}");
2760 np = bmake_strndup(cp, n+1);
2763 Var_Set(np, nstr, ctxt, 0);
2766 Var_Set("_", nstr, ctxt, 0);
2776 Buffer buf; /* Buffer for patterns */
2779 if (flags & VARF_WANTRES) {
2782 wantres = ((v->flags & VAR_JUNK) != 0);
2784 wantres = ((v->flags & VAR_JUNK) == 0);
2785 nflags = flags & ~VARF_WANTRES;
2787 nflags |= VARF_WANTRES;
2791 * Pass through tstr looking for 1) escaped delimiters,
2792 * '$'s and backslashes (place the escaped character in
2793 * uninterpreted) and 2) unescaped $'s that aren't before
2794 * the delimiter (expand the variable substitution).
2795 * The result is left in the Buffer buf.
2799 *cp != endc && *cp != ':' && *cp != '\0';
2801 if ((*cp == '\\') &&
2807 Buf_AddByte(&buf, cp[1]);
2809 } else if (*cp == '$') {
2811 * If unescaped dollar sign, assume it's a
2812 * variable substitution and recurse.
2818 cp2 = Var_Parse(cp, ctxt, nflags, &len, &freeIt);
2819 Buf_AddBytes(&buf, strlen(cp2), cp2);
2823 Buf_AddByte(&buf, *cp);
2829 if ((v->flags & VAR_JUNK) != 0)
2830 v->flags |= VAR_KEEP;
2831 if (nflags & VARF_WANTRES) {
2832 newStr = Buf_Destroy(&buf, FALSE);
2835 Buf_Destroy(&buf, TRUE);
2841 if ((v->flags & VAR_JUNK) != 0)
2842 v->flags |= VAR_KEEP;
2843 newStr = bmake_strdup(v->name);
2852 if ((v->flags & VAR_JUNK) != 0)
2853 v->flags |= VAR_KEEP;
2854 gn = Targ_FindNode(v->name, TARG_NOCREATE);
2855 if (gn == NULL || gn->type & OP_NOPATH) {
2857 } else if (gn->path) {
2858 newStr = bmake_strdup(gn->path);
2860 newStr = Dir_FindFile(v->name, Suff_FindPath(gn));
2863 newStr = bmake_strdup(v->name);
2878 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, flags,
2880 NULL, &pattern.rightLen,
2883 if (flags & VARF_WANTRES)
2884 newStr = Cmd_Exec(pattern.rhs, &emsg);
2886 newStr = varNoError;
2887 free(UNCONST(pattern.rhs));
2892 if (v->flags & VAR_JUNK) {
2893 v->flags |= VAR_KEEP;
2900 * Look for the closing ']', recursively
2901 * expanding any embedded variables.
2903 * estr is a pointer to the expanded result,
2904 * which we must free().
2908 cp = tstr+1; /* point to char after '[' */
2909 delim = ']'; /* look for closing ']' */
2910 estr = VarGetPattern(ctxt, &parsestate,
2914 goto cleanup; /* report missing ']' */
2915 /* now cp points just after the closing ']' */
2917 if (cp[0] != ':' && cp[0] != endc) {
2918 /* Found junk after ']' */
2922 if (estr[0] == '\0') {
2923 /* Found empty square brackets in ":[]". */
2926 } else if (estr[0] == '#' && estr[1] == '\0') {
2930 * We will need enough space for the decimal
2931 * representation of an int. We calculate the
2932 * space needed for the octal representation,
2933 * and add enough slop to cope with a '-' sign
2934 * (which should never be needed) and a '\0'
2935 * string terminator.
2938 (sizeof(int) * CHAR_BIT + 2) / 3 + 2;
2940 newStr = bmake_malloc(newStrSize);
2941 if (parsestate.oneBigWord) {
2942 strncpy(newStr, "1", newStrSize);
2944 /* XXX: brk_string() is a rather expensive
2945 * way of counting words. */
2950 av = brk_string(nstr, &ac, FALSE, &as);
2951 snprintf(newStr, newStrSize, "%d", ac);
2958 } else if (estr[0] == '*' && estr[1] == '\0') {
2960 parsestate.oneBigWord = TRUE;
2965 } else if (estr[0] == '@' && estr[1] == '\0') {
2967 parsestate.oneBigWord = FALSE;
2974 * We expect estr to contain a single
2975 * integer for :[N], or two integers
2976 * separated by ".." for :[start..end].
2978 VarSelectWords_t seldata = { 0, 0 };
2980 seldata.start = strtol(estr, &ep, 0);
2982 /* Found junk instead of a number */
2985 } else if (ep[0] == '\0') {
2986 /* Found only one integer in :[N] */
2987 seldata.end = seldata.start;
2988 } else if (ep[0] == '.' && ep[1] == '.' &&
2990 /* Expecting another integer after ".." */
2992 seldata.end = strtol(ep, &ep, 0);
2993 if (ep[0] != '\0') {
2994 /* Found junk after ".." */
2999 /* Found junk instead of ".." */
3004 * Now seldata is properly filled in,
3005 * but we still have to check for 0 as
3008 if (seldata.start == 0 && seldata.end == 0) {
3009 /* ":[0]" or perhaps ":[0..0]" */
3010 parsestate.oneBigWord = TRUE;
3015 } else if (seldata.start == 0 ||
3017 /* ":[0..N]" or ":[N..0]" */
3022 * Normal case: select the words
3023 * described by seldata.
3025 newStr = VarSelectWords(ctxt, &parsestate,
3035 cp = tstr + 1; /* make sure it is set */
3036 if (STRMOD_MATCHX(tstr, "gmtime", 6)) {
3037 if (tstr[6] == '=') {
3038 utc = strtoul(&tstr[7], &ep, 10);
3044 newStr = VarStrftime(nstr, 1, utc);
3051 cp = tstr + 1; /* make sure it is set */
3052 if (STRMOD_MATCH(tstr, "hash", 4)) {
3053 newStr = VarHash(nstr);
3061 cp = tstr + 1; /* make sure it is set */
3062 if (STRMOD_MATCHX(tstr, "localtime", 9)) {
3063 if (tstr[9] == '=') {
3064 utc = strtoul(&tstr[10], &ep, 10);
3070 newStr = VarStrftime(nstr, 0, utc);
3078 cp = tstr + 1; /* make sure it is set */
3079 if (tstr[1] != endc && tstr[1] != ':') {
3080 if (tstr[1] == 's') {
3082 * Use the char (if any) at tstr[2]
3083 * as the word separator.
3087 if (tstr[2] != endc &&
3088 (tstr[3] == endc || tstr[3] == ':')) {
3089 /* ":ts<unrecognised><endc>" or
3090 * ":ts<unrecognised>:" */
3091 parsestate.varSpace = tstr[2];
3093 } else if (tstr[2] == endc || tstr[2] == ':') {
3094 /* ":ts<endc>" or ":ts:" */
3095 parsestate.varSpace = 0; /* no separator */
3097 } else if (tstr[2] == '\\') {
3098 const char *xp = &tstr[3];
3099 int base = 8; /* assume octal */
3103 parsestate.varSpace = '\n';
3107 parsestate.varSpace = '\t';
3118 if (isdigit((unsigned char)tstr[3])) {
3121 parsestate.varSpace =
3122 strtoul(xp, &ep, base);
3123 if (*ep != ':' && *ep != endc)
3128 * ":ts<backslash><unrecognised>".
3136 * Found ":ts<unrecognised><unrecognised>".
3144 * We cannot be certain that VarModify
3145 * will be used - even if there is a
3146 * subsequent modifier, so do a no-op
3147 * VarSubstitute now to for str to be
3148 * re-expanded without the spaces.
3150 pattern.flags = VAR_SUB_ONE;
3151 pattern.lhs = pattern.rhs = "\032";
3152 pattern.leftLen = pattern.rightLen = 1;
3154 newStr = VarModify(ctxt, &parsestate, nstr,
3157 } else if (tstr[2] == endc || tstr[2] == ':') {
3159 * Check for two-character options:
3162 if (tstr[1] == 'A') { /* absolute path */
3163 newStr = VarModify(ctxt, &parsestate, nstr,
3167 } else if (tstr[1] == 'u') {
3168 char *dp = bmake_strdup(nstr);
3169 for (newStr = dp; *dp; dp++)
3170 *dp = toupper((unsigned char)*dp);
3173 } else if (tstr[1] == 'l') {
3174 char *dp = bmake_strdup(nstr);
3175 for (newStr = dp; *dp; dp++)
3176 *dp = tolower((unsigned char)*dp);
3179 } else if (tstr[1] == 'W' || tstr[1] == 'w') {
3180 parsestate.oneBigWord = (tstr[1] == 'W');
3185 /* Found ":t<unrecognised>:" or
3186 * ":t<unrecognised><endc>". */
3191 * Found ":t<unrecognised><unrecognised>".
3197 * Found ":t<endc>" or ":t:".
3207 const char *endpat; /* points just after end of pattern */
3209 Boolean copy; /* pattern should be, or has been, copied */
3217 * In the loop below, ignore ':' unless we are at
3218 * (or back to) the original brace level.
3219 * XXX This will likely not work right if $() and ${}
3223 *cp != '\0' && !(*cp == ':' && nest == 1);
3228 cp[1] == endc || cp[1] == startc)) {
3238 if (*cp == '(' || *cp == '{')
3240 if (*cp == ')' || *cp == '}') {
3250 * Need to compress the \:'s out of the pattern, so
3251 * allocate enough room to hold the uncompressed
3252 * pattern (note that cp started at tstr+1, so
3253 * cp - tstr takes the null byte into account) and
3254 * compress the pattern into the space.
3256 pattern = bmake_malloc(cp - tstr);
3257 for (cp2 = pattern, cp = tstr + 1;
3261 if ((*cp == '\\') && (cp+1 < endpat) &&
3262 (cp[1] == ':' || cp[1] == endc)) {
3271 * Either Var_Subst or VarModify will need a
3272 * nul-terminated string soon, so construct one now.
3274 pattern = bmake_strndup(tstr+1, endpat - (tstr + 1));
3278 * pattern contains embedded '$', so use Var_Subst to
3282 pattern = Var_Subst(NULL, cp2, ctxt, flags | VARF_WANTRES);
3286 fprintf(debug_file, "Pattern[%s] for [%s] is [%s]\n",
3287 v->name, nstr, pattern);
3289 newStr = VarModify(ctxt, &parsestate, nstr, VarMatch,
3292 newStr = VarModify(ctxt, &parsestate, nstr, VarNoMatch,
3301 Var_Parse_State tmpparsestate;
3304 tmpparsestate = parsestate;
3309 * If pattern begins with '^', it is anchored to the
3310 * start of the word -- skip over it and flag pattern.
3313 pattern.flags |= VAR_MATCH_START;
3318 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate, flags,
3325 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, flags,
3332 * Check for global substitution. If 'g' after the final
3333 * delimiter, substitution is global and is marked that
3339 pattern.flags |= VAR_SUB_GLOBAL;
3342 pattern.flags |= VAR_SUB_ONE;
3345 tmpparsestate.oneBigWord = TRUE;
3352 newStr = VarModify(ctxt, &tmpparsestate, nstr,
3357 * Free the two strings.
3359 free(UNCONST(pattern.lhs));
3360 free(UNCONST(pattern.rhs));
3369 int lhs_flags, rhs_flags;
3371 /* find ':', and then substitute accordingly */
3372 if (flags & VARF_WANTRES) {
3373 cond_rc = Cond_EvalExpression(NULL, v->name, &value, 0, FALSE);
3374 if (cond_rc == COND_INVALID) {
3375 lhs_flags = rhs_flags = VAR_NOSUBST;
3378 rhs_flags = VAR_NOSUBST;
3380 lhs_flags = VAR_NOSUBST;
3384 /* we are just consuming and discarding */
3385 cond_rc = value = 0;
3386 lhs_flags = rhs_flags = VAR_NOSUBST;
3392 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate, flags,
3393 &cp, delim, &lhs_flags,
3398 /* BROPEN or PROPEN */
3400 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, flags,
3401 &cp, delim, &rhs_flags,
3408 if (cond_rc == COND_INVALID) {
3409 Error("Bad conditional expression `%s' in %s?%s:%s",
3410 v->name, v->name, pattern.lhs, pattern.rhs);
3415 newStr = UNCONST(pattern.lhs);
3416 free(UNCONST(pattern.rhs));
3418 newStr = UNCONST(pattern.rhs);
3419 free(UNCONST(pattern.lhs));
3421 if (v->flags & VAR_JUNK) {
3422 v->flags |= VAR_KEEP;
3429 VarREPattern pattern;
3432 Var_Parse_State tmpparsestate;
3435 tmpparsestate = parsestate;
3441 if ((re = VarGetPattern(ctxt, &parsestate, flags, &cp, delim,
3442 NULL, NULL, NULL)) == NULL)
3445 if ((pattern.replace = VarGetPattern(ctxt, &parsestate,
3446 flags, &cp, delim, NULL,
3447 NULL, NULL)) == NULL){
3455 pattern.flags |= VAR_SUB_GLOBAL;
3458 pattern.flags |= VAR_SUB_ONE;
3461 tmpparsestate.oneBigWord = TRUE;
3469 error = regcomp(&pattern.re, re, REG_EXTENDED);
3472 *lengthPtr = cp - start + 1;
3473 VarREError(error, &pattern.re, "RE substitution error");
3474 free(pattern.replace);
3478 pattern.nsub = pattern.re.re_nsub + 1;
3479 if (pattern.nsub < 1)
3481 if (pattern.nsub > 10)
3483 pattern.matches = bmake_malloc(pattern.nsub *
3484 sizeof(regmatch_t));
3485 newStr = VarModify(ctxt, &tmpparsestate, nstr,
3488 regfree(&pattern.re);
3489 free(pattern.replace);
3490 free(pattern.matches);
3497 if (tstr[1] == endc || tstr[1] == ':') {
3498 newStr = VarQuote(nstr, modifier == 'q');
3505 if (tstr[1] == endc || tstr[1] == ':') {
3506 newStr = VarModify(ctxt, &parsestate, nstr, VarTail,
3514 if (tstr[1] == endc || tstr[1] == ':') {
3515 newStr = VarModify(ctxt, &parsestate, nstr, VarHead,
3523 if (tstr[1] == endc || tstr[1] == ':') {
3524 newStr = VarModify(ctxt, &parsestate, nstr, VarSuffix,
3532 if (tstr[1] == endc || tstr[1] == ':') {
3533 newStr = VarModify(ctxt, &parsestate, nstr, VarRoot,
3541 cp = tstr + 1; /* make sure it is set */
3542 if (STRMOD_MATCHX(tstr, "range", 5)) {
3545 if (tstr[5] == '=') {
3546 n = strtoul(&tstr[6], &ep, 10);
3552 newStr = VarRange(nstr, n);
3561 cp = tstr + 1; /* skip to the rest in any case */
3562 if (tstr[1] == endc || tstr[1] == ':') {
3565 } else if ( (tstr[1] == 'x') &&
3566 (tstr[2] == endc || tstr[2] == ':') ) {
3573 newStr = VarOrder(nstr, otype);
3577 if (tstr[1] == endc || tstr[1] == ':') {
3578 newStr = VarUniq(nstr);
3586 if (tstr[1] == 'h' && (tstr[2] == endc || tstr[2] == ':')) {
3588 if (flags & VARF_WANTRES) {
3589 newStr = Cmd_Exec(nstr, &emsg);
3593 newStr = varNoError;
3605 * This can either be a bogus modifier or a System-V
3606 * substitution command.
3614 * First we make a pass through the string trying
3615 * to verify it is a SYSV-make-style translation:
3616 * it must be: <string1>=<string2>)
3620 while (*cp != '\0' && cnt) {
3623 /* continue looking for endc */
3625 else if (*cp == endc)
3627 else if (*cp == startc)
3632 if (*cp == endc && eqFound) {
3635 * Now we break this sucker into the lhs and
3636 * rhs. We must null terminate them of course.
3640 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate,
3641 flags, &cp, delim, &pattern.flags,
3642 &pattern.leftLen, NULL)) == NULL)
3645 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate,
3646 flags, &cp, delim, NULL, &pattern.rightLen,
3651 * SYSV modifications happen through the whole
3652 * string. Note the pattern is anchored at the end.
3656 if (pattern.leftLen == 0 && *nstr == '\0') {
3657 newStr = nstr; /* special case */
3659 newStr = VarModify(ctxt, &parsestate, nstr,
3663 free(UNCONST(pattern.lhs));
3664 free(UNCONST(pattern.rhs));
3668 Error("Unknown modifier '%c'", *tstr);
3670 *cp != ':' && *cp != endc && *cp != '\0';
3679 fprintf(debug_file, "Result[%s] of :%c is \"%s\"\n",
3680 v->name, modifier, newStr);
3683 if (newStr != nstr) {
3689 if (nstr != var_Error && nstr != varNoError) {
3693 if (termc == '\0' && endc != '\0') {
3694 Error("Unclosed variable specification (expecting '%c') for \"%s\" (value \"%s\") modifier %c", endc, v->name, nstr, modifier);
3695 } else if (termc == ':') {
3701 *lengthPtr = tstr - start;
3706 Error("Bad modifier `:%.*s' for %s", (int)strcspn(tstr, ":)}"), tstr,
3710 *lengthPtr = cp - start;
3712 Error("Unclosed substitution for %s (%c missing)",
3720 *-----------------------------------------------------------------------
3722 * Given the start of a variable invocation, extract the variable
3723 * name and find its value, then modify it according to the
3727 * str The string to parse
3728 * ctxt The context for the variable
3729 * flags VARF_UNDEFERR if undefineds are an error
3730 * VARF_WANTRES if we actually want the result
3731 * VARF_ASSIGN if we are in a := assignment
3732 * lengthPtr OUT: The length of the specification
3733 * freePtr OUT: Non-NULL if caller should free *freePtr
3736 * The (possibly-modified) value of the variable or var_Error if the
3737 * specification is invalid. The length of the specification is
3738 * placed in *lengthPtr (for invalid specifications, this is just
3740 * If *freePtr is non-NULL then it's a pointer that the caller
3741 * should pass to free() to free memory used by the result.
3746 *-----------------------------------------------------------------------
3748 /* coverity[+alloc : arg-*4] */
3750 Var_Parse(const char *str, GNode *ctxt, int flags,
3751 int *lengthPtr, void **freePtr)
3753 const char *tstr; /* Pointer into str */
3754 Var *v; /* Variable in invocation */
3755 Boolean haveModifier;/* TRUE if have modifiers for the variable */
3756 char endc; /* Ending character when variable in parens
3758 char startc; /* Starting character when variable in parens
3760 int vlen; /* Length of variable name */
3761 const char *start; /* Points to original start of str */
3762 char *nstr; /* New string, used during expansion */
3763 Boolean dynamic; /* TRUE if the variable is local and we're
3764 * expanding it in a non-local context. This
3765 * is done to support dynamic sources. The
3766 * result is just the invocation, unaltered */
3767 const char *extramodifiers; /* extra modifiers to apply first */
3771 extramodifiers = NULL;
3776 if (startc != PROPEN && startc != BROPEN) {
3778 * If it's not bounded by braces of some sort, life is much simpler.
3779 * We just need to check for the first character and return the
3780 * value if it exists.
3783 /* Error out some really stupid names */
3784 if (startc == '\0' || strchr(")}:$", startc)) {
3791 v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
3795 if ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)) {
3797 * If substituting a local variable in a non-local context,
3798 * assume it's for dynamic source stuff. We have to handle
3799 * this specially and return the longhand for the variable
3800 * with the dollar sign escaped so it makes it back to the
3801 * caller. Only four of the local variables are treated
3802 * specially as they are the only four that will be set
3803 * when dynamic sources are expanded.
3807 return UNCONST("$(.TARGET)");
3809 return UNCONST("$(.MEMBER)");
3811 return UNCONST("$(.PREFIX)");
3813 return UNCONST("$(.ARCHIVE)");
3819 return (flags & VARF_UNDEFERR) ? var_Error : varNoError;
3821 haveModifier = FALSE;
3826 Buffer buf; /* Holds the variable name */
3829 endc = startc == PROPEN ? PRCLOSE : BRCLOSE;
3833 * Skip to the end character or a colon, whichever comes first.
3835 for (tstr = str + 2; *tstr != '\0'; tstr++)
3838 * Track depth so we can spot parse errors.
3840 if (*tstr == startc) {
3843 if (*tstr == endc) {
3847 if (depth == 1 && *tstr == ':') {
3851 * A variable inside a variable, expand
3856 char *rval = Var_Parse(tstr, ctxt, flags, &rlen, &freeIt);
3858 Buf_AddBytes(&buf, strlen(rval), rval);
3864 Buf_AddByte(&buf, *tstr);
3867 haveModifier = TRUE;
3868 } else if (*tstr == endc) {
3869 haveModifier = FALSE;
3872 * If we never did find the end character, return NULL
3873 * right now, setting the length to be the distance to
3874 * the end of the string, since that's what make does.
3876 *lengthPtr = tstr - str;
3877 Buf_Destroy(&buf, TRUE);
3880 str = Buf_GetAll(&buf, &vlen);
3883 * At this point, str points into newly allocated memory from
3884 * buf, containing only the name of the variable.
3886 * start and tstr point into the const string that was pointed
3887 * to by the original value of the str parameter. start points
3888 * to the '$' at the beginning of the string, while tstr points
3889 * to the char just after the end of the variable name -- this
3890 * will be '\0', ':', PRCLOSE, or BRCLOSE.
3893 v = VarFind(str, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
3895 * Check also for bogus D and F forms of local variables since we're
3896 * in a local context and the name is the right length.
3898 if ((v == NULL) && (ctxt != VAR_CMD) && (ctxt != VAR_GLOBAL) &&
3899 (vlen == 2) && (str[1] == 'F' || str[1] == 'D') &&
3900 strchr("@%?*!<>", str[0]) != NULL) {
3902 * Well, it's local -- go look for it.
3906 v = VarFind(name, ctxt, 0);
3909 if (str[1] == 'D') {
3910 extramodifiers = "H:";
3913 extramodifiers = "T:";
3920 (((vlen == 2) && (str[1] == 'F' || str[1] == 'D')))) &&
3921 ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)))
3924 * If substituting a local variable in a non-local context,
3925 * assume it's for dynamic source stuff. We have to handle
3926 * this specially and return the longhand for the variable
3927 * with the dollar sign escaped so it makes it back to the
3928 * caller. Only four of the local variables are treated
3929 * specially as they are the only four that will be set
3930 * when dynamic sources are expanded.
3940 } else if ((vlen > 2) && (*str == '.') &&
3941 isupper((unsigned char) str[1]) &&
3942 ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)))
3947 if ((strncmp(str, ".TARGET", len) == 0) ||
3948 (strncmp(str, ".ARCHIVE", len) == 0) ||
3949 (strncmp(str, ".PREFIX", len) == 0) ||
3950 (strncmp(str, ".MEMBER", len) == 0))
3956 if (!haveModifier) {
3958 * No modifiers -- have specification length so we can return
3961 *lengthPtr = tstr - start + 1;
3963 char *pstr = bmake_strndup(start, *lengthPtr);
3965 Buf_Destroy(&buf, TRUE);
3968 Buf_Destroy(&buf, TRUE);
3969 return (flags & VARF_UNDEFERR) ? var_Error : varNoError;
3973 * Still need to get to the end of the variable specification,
3974 * so kludge up a Var structure for the modifications
3976 v = bmake_malloc(sizeof(Var));
3977 v->name = UNCONST(str);
3978 Buf_Init(&v->val, 1);
3979 v->flags = VAR_JUNK;
3980 Buf_Destroy(&buf, FALSE);
3983 Buf_Destroy(&buf, TRUE);
3986 if (v->flags & VAR_IN_USE) {
3987 Fatal("Variable %s is recursive.", v->name);
3990 v->flags |= VAR_IN_USE;
3993 * Before doing any modification, we have to make sure the value
3994 * has been fully expanded. If it looks like recursion might be
3995 * necessary (there's a dollar sign somewhere in the variable's value)
3996 * we just call Var_Subst to do any other substitutions that are
3997 * necessary. Note that the value returned by Var_Subst will have
3998 * been dynamically-allocated, so it will need freeing when we
4001 nstr = Buf_GetAll(&v->val, NULL);
4002 if (strchr(nstr, '$') != NULL) {
4003 nstr = Var_Subst(NULL, nstr, ctxt, flags);
4007 v->flags &= ~VAR_IN_USE;
4009 if ((nstr != NULL) && (haveModifier || extramodifiers != NULL)) {
4014 if (extramodifiers != NULL) {
4015 nstr = ApplyModifiers(nstr, extramodifiers, '(', ')',
4016 v, ctxt, flags, &used, &extraFree);
4020 /* Skip initial colon. */
4023 nstr = ApplyModifiers(nstr, tstr, startc, endc,
4024 v, ctxt, flags, &used, freePtr);
4028 *freePtr = extraFree;
4032 *lengthPtr = tstr - start + 1;
4034 *lengthPtr = tstr - start;
4037 if (v->flags & VAR_FROM_ENV) {
4038 Boolean destroy = FALSE;
4040 if (nstr != Buf_GetAll(&v->val, NULL)) {
4044 * Returning the value unmodified, so tell the caller to free
4049 VarFreeEnv(v, destroy);
4050 } else if (v->flags & VAR_JUNK) {
4052 * Perform any free'ing needed and set *freePtr to NULL so the caller
4053 * doesn't try to free a static pointer.
4054 * If VAR_KEEP is also set then we want to keep str as is.
4056 if (!(v->flags & VAR_KEEP)) {
4062 nstr = bmake_strndup(start, *lengthPtr);
4065 nstr = (flags & VARF_UNDEFERR) ? var_Error : varNoError;
4068 if (nstr != Buf_GetAll(&v->val, NULL))
4069 Buf_Destroy(&v->val, TRUE);
4077 *-----------------------------------------------------------------------
4079 * Substitute for all variables in the given string in the given context
4080 * If flags & VARF_UNDEFERR, Parse_Error will be called when an undefined
4081 * variable is encountered.
4084 * var Named variable || NULL for all
4085 * str the string which to substitute
4086 * ctxt the context wherein to find variables
4087 * flags VARF_UNDEFERR if undefineds are an error
4088 * VARF_WANTRES if we actually want the result
4089 * VARF_ASSIGN if we are in a := assignment
4092 * The resulting string.
4095 * None. The old string must be freed by the caller
4096 *-----------------------------------------------------------------------
4099 Var_Subst(const char *var, const char *str, GNode *ctxt, int flags)
4101 Buffer buf; /* Buffer for forming things */
4102 char *val; /* Value to substitute for a variable */
4103 int length; /* Length of the variable invocation */
4104 Boolean trailingBslash; /* variable ends in \ */
4105 void *freeIt = NULL; /* Set if it should be freed */
4106 static Boolean errorReported; /* Set true if an error has already
4107 * been reported to prevent a plethora
4108 * of messages when recursing */
4111 errorReported = FALSE;
4112 trailingBslash = FALSE;
4115 if (*str == '\n' && trailingBslash)
4116 Buf_AddByte(&buf, ' ');
4117 if (var == NULL && (*str == '$') && (str[1] == '$')) {
4119 * A dollar sign may be escaped either with another dollar sign.
4120 * In such a case, we skip over the escape character and store the
4121 * dollar sign into the buffer directly.
4123 if (save_dollars && (flags & VARF_ASSIGN))
4124 Buf_AddByte(&buf, *str);
4126 Buf_AddByte(&buf, *str);
4128 } else if (*str != '$') {
4130 * Skip as many characters as possible -- either to the end of
4131 * the string or to the next dollar sign (variable invocation).
4135 for (cp = str++; *str != '$' && *str != '\0'; str++)
4137 Buf_AddBytes(&buf, str - cp, cp);
4142 if (str[1] == '\0') {
4143 /* A trailing $ is kind of a special case */
4144 Buf_AddByte(&buf, str[0]);
4147 } else if (str[1] != PROPEN && str[1] != BROPEN) {
4148 if (str[1] != *var || strlen(var) > 1) {
4149 Buf_AddBytes(&buf, 2, str);
4161 * Scan up to the end of the variable name.
4163 for (p = &str[2]; *p &&
4164 *p != ':' && *p != PRCLOSE && *p != BRCLOSE; p++)
4168 * A variable inside the variable. We cannot expand
4169 * the external variable yet, so we try again with
4173 Buf_AddBytes(&buf, p - str, str);
4178 if (strncmp(var, str + 2, p - str - 2) != 0 ||
4179 var[p - str - 2] != '\0') {
4181 * Not the variable we want to expand, scan
4182 * until the next variable
4184 for (;*p != '$' && *p != '\0'; p++)
4186 Buf_AddBytes(&buf, p - str, str);
4199 val = Var_Parse(str, ctxt, flags, &length, &freeIt);
4202 * When we come down here, val should either point to the
4203 * value of this variable, suitably modified, or be NULL.
4204 * Length should be the total length of the potential
4205 * variable invocation (from $ to end character...)
4207 if (val == var_Error || val == varNoError) {
4209 * If performing old-time variable substitution, skip over
4210 * the variable and continue with the substitution. Otherwise,
4211 * store the dollar sign and advance str so we continue with
4216 } else if ((flags & VARF_UNDEFERR) || val == var_Error) {
4218 * If variable is undefined, complain and skip the
4219 * variable. The complaint will stop us from doing anything
4220 * when the file is parsed.
4222 if (!errorReported) {
4223 Parse_Error(PARSE_FATAL,
4224 "Undefined variable \"%.*s\"",length,str);
4227 errorReported = TRUE;
4229 Buf_AddByte(&buf, *str);
4234 * We've now got a variable structure to store in. But first,
4235 * advance the string pointer.
4240 * Copy all the characters from the variable value straight
4241 * into the new string.
4243 length = strlen(val);
4244 Buf_AddBytes(&buf, length, val);
4245 trailingBslash = length > 0 && val[length - 1] == '\\';
4252 return Buf_DestroyCompact(&buf);
4256 *-----------------------------------------------------------------------
4258 * Return the tail from each of a list of words. Used to set the
4259 * System V local variables.
4262 * file Filename to modify
4265 * The resulting string.
4270 *-----------------------------------------------------------------------
4274 Var_GetTail(char *file)
4276 return(VarModify(file, VarTail, NULL));
4280 *-----------------------------------------------------------------------
4282 * Find the leading components of a (list of) filename(s).
4283 * XXX: VarHead does not replace foo by ., as (sun) System V make
4287 * file Filename to manipulate
4290 * The leading components.
4295 *-----------------------------------------------------------------------
4298 Var_GetHead(char *file)
4300 return(VarModify(file, VarHead, NULL));
4305 *-----------------------------------------------------------------------
4307 * Initialize the module
4313 * The VAR_CMD and VAR_GLOBAL contexts are created
4314 *-----------------------------------------------------------------------
4319 VAR_INTERNAL = Targ_NewGN("Internal");
4320 VAR_GLOBAL = Targ_NewGN("Global");
4321 VAR_CMD = Targ_NewGN("Command");
4332 /****************** PRINT DEBUGGING INFO *****************/
4334 VarPrintVar(void *vp)
4337 fprintf(debug_file, "%-16s = %s\n", v->name, Buf_GetAll(&v->val, NULL));
4341 *-----------------------------------------------------------------------
4343 * print all variables in a context
4344 *-----------------------------------------------------------------------
4347 Var_Dump(GNode *ctxt)
4352 for (h = Hash_EnumFirst(&ctxt->context, &search);
4354 h = Hash_EnumNext(&search)) {
4355 VarPrintVar(Hash_GetValue(h));