1 /* $NetBSD: var.c,v 1.199 2015/10/20 21:30:57 sjg 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.199 2015/10/20 21:30:57 sjg 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.199 2015/10/20 21:30:57 sjg 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>
132 #include <inttypes.h>
141 #include "metachar.h"
143 extern int makelevel;
145 * This lets us tell if we have replaced the original environ
146 * (which we cannot free).
148 char **savedEnv = NULL;
151 * This is a harmless return value for Var_Parse that can be used by Var_Subst
152 * to determine if there was an error in parsing -- easier than returning
153 * a flag, as things outside this module don't give a hoot.
155 char var_Error[] = "";
158 * Similar to var_Error, but returned when the 'errnum' flag for Var_Parse is
159 * set false. Why not just use a constant? Well, gcc likes to condense
160 * identical string instances...
162 static char varNoError[] = "";
165 * Internally, variables are contained in four different contexts.
166 * 1) the environment. They may not be changed. If an environment
167 * variable is appended-to, the result is placed in the global
169 * 2) the global context. Variables set in the Makefile are located in
170 * the global context. It is the penultimate context searched when
172 * 3) the command-line context. All variables set on the command line
173 * are placed in this context. They are UNALTERABLE once placed here.
174 * 4) the local context. Each target has associated with it a context
175 * list. On this list are located the structures describing such
176 * local variables as $(@) and $(*)
177 * The four contexts are searched in the reverse order from which they are
180 GNode *VAR_INTERNAL; /* variables from make itself */
181 GNode *VAR_GLOBAL; /* variables from the makefile */
182 GNode *VAR_CMD; /* variables defined on the command-line */
184 #define FIND_CMD 0x1 /* look in VAR_CMD when searching */
185 #define FIND_GLOBAL 0x2 /* look in VAR_GLOBAL as well */
186 #define FIND_ENV 0x4 /* look in the environment also */
189 char *name; /* the variable's name */
190 Buffer val; /* its value */
191 int flags; /* miscellaneous status flags */
192 #define VAR_IN_USE 1 /* Variable's value currently being used.
193 * Used to avoid recursion */
194 #define VAR_FROM_ENV 2 /* Variable comes from the environment */
195 #define VAR_JUNK 4 /* Variable is a junk variable that
196 * should be destroyed when done with
197 * it. Used by Var_Parse for undefined,
198 * modified variables */
199 #define VAR_KEEP 8 /* Variable is VAR_JUNK, but we found
200 * a use for it in some modifier and
201 * the value is therefore valid */
202 #define VAR_EXPORTED 16 /* Variable is exported */
203 #define VAR_REEXPORT 32 /* Indicate if var needs re-export.
204 * This would be true if it contains $'s
206 #define VAR_FROM_CMD 64 /* Variable came from command line */
210 * Exporting vars is expensive so skip it if we can
212 #define VAR_EXPORTED_NONE 0
213 #define VAR_EXPORTED_YES 1
214 #define VAR_EXPORTED_ALL 2
215 static int var_exportedVars = VAR_EXPORTED_NONE;
217 * We pass this to Var_Export when doing the initial export
218 * or after updating an exported var.
220 #define VAR_EXPORT_PARENT 1
222 /* Var*Pattern flags */
223 #define VAR_SUB_GLOBAL 0x01 /* Apply substitution globally */
224 #define VAR_SUB_ONE 0x02 /* Apply substitution to one word */
225 #define VAR_SUB_MATCHED 0x04 /* There was a match */
226 #define VAR_MATCH_START 0x08 /* Match at start of word */
227 #define VAR_MATCH_END 0x10 /* Match at end of word */
228 #define VAR_NOSUBST 0x20 /* don't expand vars in VarGetPattern */
231 #define VAR_NO_EXPORT 0x01 /* do not export */
235 * The following fields are set by Var_Parse() when it
236 * encounters modifiers that need to keep state for use by
237 * subsequent modifiers within the same variable expansion.
239 Byte varSpace; /* Word separator in expansions */
240 Boolean oneBigWord; /* TRUE if we will treat the variable as a
241 * single big word, even if it contains
242 * embedded spaces (as opposed to the
243 * usual behaviour of treating it as
244 * several space-separated words). */
247 /* struct passed as 'void *' to VarSubstitute() for ":S/lhs/rhs/",
248 * to VarSYSVMatch() for ":lhs=rhs". */
250 const char *lhs; /* String to match */
251 int leftLen; /* Length of string */
252 const char *rhs; /* Replacement string (w/ &'s removed) */
253 int rightLen; /* Length of replacement */
257 /* struct passed as 'void *' to VarLoopExpand() for ":@tvar@str@" */
259 GNode *ctxt; /* variable context */
260 char *tvar; /* name of temp var */
262 char *str; /* string to expand */
264 int errnum; /* errnum for not defined */
268 /* struct passed as 'void *' to VarRESubstitute() for ":C///" */
278 /* struct passed to VarSelectWords() for ":[start..end]" */
280 int start; /* first word to select */
281 int end; /* last word to select */
284 static Var *VarFind(const char *, GNode *, int);
285 static void VarAdd(const char *, const char *, GNode *);
286 static Boolean VarHead(GNode *, Var_Parse_State *,
287 char *, Boolean, Buffer *, void *);
288 static Boolean VarTail(GNode *, Var_Parse_State *,
289 char *, Boolean, Buffer *, void *);
290 static Boolean VarSuffix(GNode *, Var_Parse_State *,
291 char *, Boolean, Buffer *, void *);
292 static Boolean VarRoot(GNode *, Var_Parse_State *,
293 char *, Boolean, Buffer *, void *);
294 static Boolean VarMatch(GNode *, Var_Parse_State *,
295 char *, Boolean, Buffer *, void *);
297 static Boolean VarSYSVMatch(GNode *, Var_Parse_State *,
298 char *, Boolean, Buffer *, void *);
300 static Boolean VarNoMatch(GNode *, Var_Parse_State *,
301 char *, Boolean, Buffer *, void *);
303 static void VarREError(int, regex_t *, const char *);
304 static Boolean VarRESubstitute(GNode *, Var_Parse_State *,
305 char *, Boolean, Buffer *, void *);
307 static Boolean VarSubstitute(GNode *, Var_Parse_State *,
308 char *, Boolean, Buffer *, void *);
309 static Boolean VarLoopExpand(GNode *, Var_Parse_State *,
310 char *, Boolean, Buffer *, void *);
311 static char *VarGetPattern(GNode *, Var_Parse_State *,
312 int, const char **, int, int *, int *,
314 static char *VarQuote(char *);
315 static char *VarHash(char *);
316 static char *VarModify(GNode *, Var_Parse_State *,
318 Boolean (*)(GNode *, Var_Parse_State *, char *, Boolean, Buffer *, void *),
320 static char *VarOrder(const char *, const char);
321 static char *VarUniq(const char *);
322 static int VarWordCompare(const void *, const void *);
323 static void VarPrintVar(void *);
331 *-----------------------------------------------------------------------
333 * Find the given variable in the given context and any other contexts
338 * ctxt context in which to find it
339 * flags FIND_GLOBAL set means to look in the
340 * VAR_GLOBAL context as well. FIND_CMD set means
341 * to look in the VAR_CMD context also. FIND_ENV
342 * set means to look in the environment
345 * A pointer to the structure describing the desired variable or
346 * NULL if the variable does not exist.
350 *-----------------------------------------------------------------------
353 VarFind(const char *name, GNode *ctxt, int flags)
359 * If the variable name begins with a '.', it could very well be one of
360 * the local ones. We check the name against all the local variables
361 * and substitute the short version in for 'name' if it matches one of
364 if (*name == '.' && isupper((unsigned char) name[1]))
367 if (!strcmp(name, ".ALLSRC"))
369 if (!strcmp(name, ".ARCHIVE"))
373 if (!strcmp(name, ".IMPSRC"))
377 if (!strcmp(name, ".MEMBER"))
381 if (!strcmp(name, ".OODATE"))
385 if (!strcmp(name, ".PREFIX"))
389 if (!strcmp(name, ".TARGET"))
394 /* for compatibility with gmake */
395 if (name[0] == '^' && name[1] == '\0')
400 * First look for the variable in the given context. If it's not there,
401 * look for it in VAR_CMD, VAR_GLOBAL and the environment, in that order,
402 * depending on the FIND_* flags in 'flags'
404 var = Hash_FindEntry(&ctxt->context, name);
406 if ((var == NULL) && (flags & FIND_CMD) && (ctxt != VAR_CMD)) {
407 var = Hash_FindEntry(&VAR_CMD->context, name);
409 if (!checkEnvFirst && (var == NULL) && (flags & FIND_GLOBAL) &&
410 (ctxt != VAR_GLOBAL))
412 var = Hash_FindEntry(&VAR_GLOBAL->context, name);
413 if ((var == NULL) && (ctxt != VAR_INTERNAL)) {
414 /* VAR_INTERNAL is subordinate to VAR_GLOBAL */
415 var = Hash_FindEntry(&VAR_INTERNAL->context, name);
418 if ((var == NULL) && (flags & FIND_ENV)) {
421 if ((env = getenv(name)) != NULL) {
424 v = bmake_malloc(sizeof(Var));
425 v->name = bmake_strdup(name);
429 Buf_Init(&v->val, len + 1);
430 Buf_AddBytes(&v->val, len, env);
432 v->flags = VAR_FROM_ENV;
434 } else if (checkEnvFirst && (flags & FIND_GLOBAL) &&
435 (ctxt != VAR_GLOBAL))
437 var = Hash_FindEntry(&VAR_GLOBAL->context, name);
438 if ((var == NULL) && (ctxt != VAR_INTERNAL)) {
439 var = Hash_FindEntry(&VAR_INTERNAL->context, name);
444 return ((Var *)Hash_GetValue(var));
449 } else if (var == NULL) {
452 return ((Var *)Hash_GetValue(var));
457 *-----------------------------------------------------------------------
459 * If the variable is an environment variable, free it
463 * destroy true if the value buffer should be destroyed.
466 * 1 if it is an environment variable 0 ow.
469 * The variable is free'ed if it is an environent variable.
470 *-----------------------------------------------------------------------
473 VarFreeEnv(Var *v, Boolean destroy)
475 if ((v->flags & VAR_FROM_ENV) == 0)
478 Buf_Destroy(&v->val, destroy);
484 *-----------------------------------------------------------------------
486 * Add a new variable of name name and value val to the given context
489 * name name of variable to add
490 * val value to set it to
491 * ctxt context in which to set it
497 * The new variable is placed at the front of the given context
498 * The name and val arguments are duplicated so they may
500 *-----------------------------------------------------------------------
503 VarAdd(const char *name, const char *val, GNode *ctxt)
509 v = bmake_malloc(sizeof(Var));
511 len = val ? strlen(val) : 0;
512 Buf_Init(&v->val, len+1);
513 Buf_AddBytes(&v->val, len, val);
517 h = Hash_CreateEntry(&ctxt->context, name, NULL);
521 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
526 *-----------------------------------------------------------------------
528 * Remove a variable from a context.
534 * The Var structure is removed and freed.
536 *-----------------------------------------------------------------------
539 Var_Delete(const char *name, GNode *ctxt)
544 if (strchr(name, '$')) {
545 cp = Var_Subst(NULL, name, VAR_GLOBAL, FALSE, TRUE);
549 ln = Hash_FindEntry(&ctxt->context, cp);
551 fprintf(debug_file, "%s:delete %s%s\n",
552 ctxt->name, cp, ln ? "" : " (not found)");
560 v = (Var *)Hash_GetValue(ln);
561 if ((v->flags & VAR_EXPORTED)) {
564 if (strcmp(MAKE_EXPORTED, v->name) == 0) {
565 var_exportedVars = VAR_EXPORTED_NONE;
567 if (v->name != ln->name)
569 Hash_DeleteEntry(&ctxt->context, ln);
570 Buf_Destroy(&v->val, TRUE);
578 * We ignore make internal variables (those which start with '.')
579 * Also we jump through some hoops to avoid calling setenv
580 * more than necessary since it can leak.
581 * We only manipulate flags of vars if 'parent' is set.
584 Var_Export1(const char *name, int parent)
592 return 0; /* skip internals */
596 * If it is one of the vars that should only appear in
597 * local context, skip it, else we can get Var_Subst
608 v = VarFind(name, VAR_GLOBAL, 0);
613 (v->flags & (VAR_EXPORTED|VAR_REEXPORT)) == VAR_EXPORTED) {
614 return 0; /* nothing to do */
616 val = Buf_GetAll(&v->val, NULL);
617 if (strchr(val, '$')) {
620 * Flag this as something we need to re-export.
621 * No point actually exporting it now though,
622 * the child can do it at the last minute.
624 v->flags |= (VAR_EXPORTED|VAR_REEXPORT);
627 if (v->flags & VAR_IN_USE) {
629 * We recursed while exporting in a child.
630 * This isn't going to end well, just skip it.
634 n = snprintf(tmp, sizeof(tmp), "${%s}", name);
635 if (n < (int)sizeof(tmp)) {
636 val = Var_Subst(NULL, tmp, VAR_GLOBAL, FALSE, TRUE);
637 setenv(name, val, 1);
642 v->flags &= ~VAR_REEXPORT; /* once will do */
644 if (parent || !(v->flags & VAR_EXPORTED)) {
645 setenv(name, val, 1);
649 * This is so Var_Set knows to call Var_Export again...
652 v->flags |= VAR_EXPORTED;
658 * This gets called from our children.
671 * Several make's support this sort of mechanism for tracking
672 * recursion - but each uses a different name.
673 * We allow the makefiles to update MAKELEVEL and ensure
674 * children see a correctly incremented value.
676 snprintf(tmp, sizeof(tmp), "%d", makelevel + 1);
677 setenv(MAKE_LEVEL_ENV, tmp, 1);
679 if (VAR_EXPORTED_NONE == var_exportedVars)
682 if (VAR_EXPORTED_ALL == var_exportedVars) {
684 * Ouch! This is crazy...
686 for (var = Hash_EnumFirst(&VAR_GLOBAL->context, &state);
688 var = Hash_EnumNext(&state)) {
689 v = (Var *)Hash_GetValue(var);
690 Var_Export1(v->name, 0);
695 * We have a number of exported vars,
697 n = snprintf(tmp, sizeof(tmp), "${" MAKE_EXPORTED ":O:u}");
698 if (n < (int)sizeof(tmp)) {
704 val = Var_Subst(NULL, tmp, VAR_GLOBAL, FALSE, TRUE);
705 av = brk_string(val, &ac, FALSE, &as);
706 for (i = 0; i < ac; i++) {
707 Var_Export1(av[i], 0);
716 * This is called when .export is seen or
717 * .MAKE.EXPORTED is modified.
718 * It is also called when any exported var is modified.
721 Var_Export(char *str, int isExport)
731 if (isExport && (!str || !str[0])) {
732 var_exportedVars = VAR_EXPORTED_ALL; /* use with caution! */
736 if (strncmp(str, "-env", 4) == 0) {
740 track = VAR_EXPORT_PARENT;
742 val = Var_Subst(NULL, str, VAR_GLOBAL, FALSE, TRUE);
743 av = brk_string(val, &ac, FALSE, &as);
744 for (i = 0; i < ac; i++) {
749 * If it is one of the vars that should only appear in
750 * local context, skip it, else we can get Var_Subst
761 if (Var_Export1(name, track)) {
762 if (VAR_EXPORTED_ALL != var_exportedVars)
763 var_exportedVars = VAR_EXPORTED_YES;
764 if (isExport && track) {
765 Var_Append(MAKE_EXPORTED, name, VAR_GLOBAL);
776 * This is called when .unexport[-env] is seen.
778 extern char **environ;
781 Var_UnExport(char *str)
786 Boolean unexport_env;
789 if (!str || !str[0]) {
790 return; /* assert? */
796 unexport_env = (strncmp(str, "-env", 4) == 0);
800 cp = getenv(MAKE_LEVEL_ENV); /* we should preserve this */
801 if (environ == savedEnv) {
802 /* we have been here before! */
803 newenv = bmake_realloc(environ, 2 * sizeof(char *));
809 newenv = bmake_malloc(2 * sizeof(char *));
813 /* Note: we cannot safely free() the original environ. */
814 environ = savedEnv = newenv;
817 setenv(MAKE_LEVEL_ENV, cp, 1);
819 for (; *str != '\n' && isspace((unsigned char) *str); str++)
821 if (str[0] && str[0] != '\n') {
827 /* Using .MAKE.EXPORTED */
828 n = snprintf(tmp, sizeof(tmp), "${" MAKE_EXPORTED ":O:u}");
829 if (n < (int)sizeof(tmp)) {
830 vlist = Var_Subst(NULL, tmp, VAR_GLOBAL, FALSE, TRUE);
840 av = brk_string(vlist, &ac, FALSE, &as);
841 for (i = 0; i < ac; i++) {
842 v = VarFind(av[i], VAR_GLOBAL, 0);
846 (v->flags & (VAR_EXPORTED|VAR_REEXPORT)) == VAR_EXPORTED) {
849 v->flags &= ~(VAR_EXPORTED|VAR_REEXPORT);
851 * If we are unexporting a list,
852 * remove each one from .MAKE.EXPORTED.
853 * If we are removing them all,
854 * just delete .MAKE.EXPORTED below.
857 n = snprintf(tmp, sizeof(tmp),
858 "${" MAKE_EXPORTED ":N%s}", v->name);
859 if (n < (int)sizeof(tmp)) {
860 cp = Var_Subst(NULL, tmp, VAR_GLOBAL, FALSE, TRUE);
861 Var_Set(MAKE_EXPORTED, cp, VAR_GLOBAL, 0);
869 Var_Delete(MAKE_EXPORTED, VAR_GLOBAL);
876 *-----------------------------------------------------------------------
878 * Set the variable name to the value val in the given context.
881 * name name of variable to set
882 * val value to give to the variable
883 * ctxt context in which to set it
889 * If the variable doesn't yet exist, a new record is created for it.
890 * Else the old value is freed and the new one stuck in its place
893 * The variable is searched for only in its context before being
894 * created in that context. I.e. if the context is VAR_GLOBAL,
895 * only VAR_GLOBAL->context is searched. Likewise if it is VAR_CMD, only
896 * VAR_CMD->context is searched. This is done to avoid the literally
897 * thousands of unnecessary strcmp's that used to be done to
898 * set, say, $(@) or $(<).
899 * If the context is VAR_GLOBAL though, we check if the variable
900 * was set in VAR_CMD from the command line and skip it if so.
901 *-----------------------------------------------------------------------
904 Var_Set(const char *name, const char *val, GNode *ctxt, int flags)
907 char *expanded_name = NULL;
910 * We only look for a variable in the given context since anything set
911 * here will override anything in a lower context, so there's not much
912 * point in searching them all just to save a bit of memory...
914 if (strchr(name, '$') != NULL) {
915 expanded_name = Var_Subst(NULL, name, ctxt, FALSE, TRUE);
916 if (expanded_name[0] == 0) {
918 fprintf(debug_file, "Var_Set(\"%s\", \"%s\", ...) "
919 "name expands to empty string - ignored\n",
925 name = expanded_name;
927 if (ctxt == VAR_GLOBAL) {
928 v = VarFind(name, VAR_CMD, 0);
930 if ((v->flags & VAR_FROM_CMD)) {
932 fprintf(debug_file, "%s:%s = %s ignored!\n", ctxt->name, name, val);
939 v = VarFind(name, ctxt, 0);
941 if (ctxt == VAR_CMD && (flags & VAR_NO_EXPORT) == 0) {
943 * This var would normally prevent the same name being added
944 * to VAR_GLOBAL, so delete it from there if needed.
945 * Otherwise -V name may show the wrong value.
947 Var_Delete(name, VAR_GLOBAL);
949 VarAdd(name, val, ctxt);
952 Buf_AddBytes(&v->val, strlen(val), val);
955 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
957 if ((v->flags & VAR_EXPORTED)) {
958 Var_Export1(name, VAR_EXPORT_PARENT);
962 * Any variables given on the command line are automatically exported
963 * to the environment (as per POSIX standard)
965 if (ctxt == VAR_CMD && (flags & VAR_NO_EXPORT) == 0) {
967 /* we just added it */
968 v = VarFind(name, ctxt, 0);
971 v->flags |= VAR_FROM_CMD;
973 * If requested, don't export these in the environment
974 * individually. We still put them in MAKEOVERRIDES so
975 * that the command-line settings continue to override
978 if (varNoExportEnv != TRUE)
979 setenv(name, val, 1);
981 Var_Append(MAKEOVERRIDES, name, VAR_GLOBAL);
992 *-----------------------------------------------------------------------
994 * The variable of the given name has the given value appended to it in
998 * name name of variable to modify
999 * val String to append to it
1000 * ctxt Context in which this should occur
1006 * If the variable doesn't exist, it is created. Else the strings
1007 * are concatenated (with a space in between).
1010 * Only if the variable is being sought in the global context is the
1011 * environment searched.
1012 * XXX: Knows its calling circumstances in that if called with ctxt
1013 * an actual target, it will only search that context since only
1014 * a local variable could be being appended to. This is actually
1015 * a big win and must be tolerated.
1016 *-----------------------------------------------------------------------
1019 Var_Append(const char *name, const char *val, GNode *ctxt)
1023 char *expanded_name = NULL;
1025 if (strchr(name, '$') != NULL) {
1026 expanded_name = Var_Subst(NULL, name, ctxt, FALSE, TRUE);
1027 if (expanded_name[0] == 0) {
1029 fprintf(debug_file, "Var_Append(\"%s\", \"%s\", ...) "
1030 "name expands to empty string - ignored\n",
1033 free(expanded_name);
1036 name = expanded_name;
1039 v = VarFind(name, ctxt, (ctxt == VAR_GLOBAL) ? FIND_ENV : 0);
1042 VarAdd(name, val, ctxt);
1044 Buf_AddByte(&v->val, ' ');
1045 Buf_AddBytes(&v->val, strlen(val), val);
1048 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name,
1049 Buf_GetAll(&v->val, NULL));
1052 if (v->flags & VAR_FROM_ENV) {
1054 * If the original variable came from the environment, we
1055 * have to install it in the global context (we could place
1056 * it in the environment, but then we should provide a way to
1057 * export other variables...)
1059 v->flags &= ~VAR_FROM_ENV;
1060 h = Hash_CreateEntry(&ctxt->context, name, NULL);
1061 Hash_SetValue(h, v);
1064 free(expanded_name);
1068 *-----------------------------------------------------------------------
1070 * See if the given variable exists.
1073 * name Variable to find
1074 * ctxt Context in which to start search
1077 * TRUE if it does, FALSE if it doesn't
1082 *-----------------------------------------------------------------------
1085 Var_Exists(const char *name, GNode *ctxt)
1090 if ((cp = strchr(name, '$')) != NULL) {
1091 cp = Var_Subst(NULL, name, ctxt, FALSE, TRUE);
1093 v = VarFind(cp ? cp : name, ctxt, FIND_CMD|FIND_GLOBAL|FIND_ENV);
1098 (void)VarFreeEnv(v, TRUE);
1104 *-----------------------------------------------------------------------
1106 * Return the value of the named variable in the given context
1110 * ctxt context in which to search for it
1113 * The value if the variable exists, NULL if it doesn't
1117 *-----------------------------------------------------------------------
1120 Var_Value(const char *name, GNode *ctxt, char **frp)
1124 v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
1127 char *p = (Buf_GetAll(&v->val, NULL));
1128 if (VarFreeEnv(v, FALSE))
1137 *-----------------------------------------------------------------------
1139 * Remove the tail of the given word and place the result in the given
1144 * addSpace True if need to add a space to the buffer
1145 * before sticking in the head
1146 * buf Buffer in which to store it
1149 * TRUE if characters were added to the buffer (a space needs to be
1150 * added to the buffer before the next word).
1153 * The trimmed word is added to the buffer.
1155 *-----------------------------------------------------------------------
1158 VarHead(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1159 char *word, Boolean addSpace, Buffer *buf,
1164 slash = strrchr(word, '/');
1165 if (slash != NULL) {
1166 if (addSpace && vpstate->varSpace) {
1167 Buf_AddByte(buf, vpstate->varSpace);
1170 Buf_AddBytes(buf, strlen(word), word);
1175 * If no directory part, give . (q.v. the POSIX standard)
1177 if (addSpace && vpstate->varSpace)
1178 Buf_AddByte(buf, vpstate->varSpace);
1179 Buf_AddByte(buf, '.');
1181 return(dummy ? TRUE : TRUE);
1185 *-----------------------------------------------------------------------
1187 * Remove the head of the given word and place the result in the given
1192 * addSpace True if need to add a space to the buffer
1193 * before adding the tail
1194 * buf Buffer in which to store it
1197 * TRUE if characters were added to the buffer (a space needs to be
1198 * added to the buffer before the next word).
1201 * The trimmed word is added to the buffer.
1203 *-----------------------------------------------------------------------
1206 VarTail(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1207 char *word, Boolean addSpace, Buffer *buf,
1212 if (addSpace && vpstate->varSpace) {
1213 Buf_AddByte(buf, vpstate->varSpace);
1216 slash = strrchr(word, '/');
1217 if (slash != NULL) {
1219 Buf_AddBytes(buf, strlen(slash), slash);
1222 Buf_AddBytes(buf, strlen(word), word);
1224 return (dummy ? TRUE : TRUE);
1228 *-----------------------------------------------------------------------
1230 * Place the suffix of the given word in the given buffer.
1234 * addSpace TRUE if need to add a space before placing the
1235 * suffix in the buffer
1236 * buf Buffer in which to store it
1239 * TRUE if characters were added to the buffer (a space needs to be
1240 * added to the buffer before the next word).
1243 * The suffix from the word is placed in the buffer.
1245 *-----------------------------------------------------------------------
1248 VarSuffix(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1249 char *word, Boolean addSpace, Buffer *buf,
1254 dot = strrchr(word, '.');
1256 if (addSpace && vpstate->varSpace) {
1257 Buf_AddByte(buf, vpstate->varSpace);
1260 Buf_AddBytes(buf, strlen(dot), dot);
1264 return (dummy ? addSpace : addSpace);
1268 *-----------------------------------------------------------------------
1270 * Remove the suffix of the given word and place the result in the
1275 * addSpace TRUE if need to add a space to the buffer
1276 * before placing the root in it
1277 * buf Buffer in which to store it
1280 * TRUE if characters were added to the buffer (a space needs to be
1281 * added to the buffer before the next word).
1284 * The trimmed word is added to the buffer.
1286 *-----------------------------------------------------------------------
1289 VarRoot(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1290 char *word, Boolean addSpace, Buffer *buf,
1295 if (addSpace && vpstate->varSpace) {
1296 Buf_AddByte(buf, vpstate->varSpace);
1299 dot = strrchr(word, '.');
1302 Buf_AddBytes(buf, strlen(word), word);
1305 Buf_AddBytes(buf, strlen(word), word);
1307 return (dummy ? TRUE : TRUE);
1311 *-----------------------------------------------------------------------
1313 * Place the word in the buffer if it matches the given pattern.
1314 * Callback function for VarModify to implement the :M modifier.
1317 * word Word to examine
1318 * addSpace TRUE if need to add a space to the buffer
1319 * before adding the word, if it matches
1320 * buf Buffer in which to store it
1321 * pattern Pattern the word must match
1324 * TRUE if a space should be placed in the buffer before the next
1328 * The word may be copied to the buffer.
1330 *-----------------------------------------------------------------------
1333 VarMatch(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1334 char *word, Boolean addSpace, Buffer *buf,
1338 fprintf(debug_file, "VarMatch [%s] [%s]\n", word, (char *)pattern);
1339 if (Str_Match(word, (char *)pattern)) {
1340 if (addSpace && vpstate->varSpace) {
1341 Buf_AddByte(buf, vpstate->varSpace);
1344 Buf_AddBytes(buf, strlen(word), word);
1351 *-----------------------------------------------------------------------
1353 * Place the word in the buffer if it matches the given pattern.
1354 * Callback function for VarModify to implement the System V %
1358 * word Word to examine
1359 * addSpace TRUE if need to add a space to the buffer
1360 * before adding the word, if it matches
1361 * buf Buffer in which to store it
1362 * patp Pattern the word must match
1365 * TRUE if a space should be placed in the buffer before the next
1369 * The word may be copied to the buffer.
1371 *-----------------------------------------------------------------------
1374 VarSYSVMatch(GNode *ctx, Var_Parse_State *vpstate,
1375 char *word, Boolean addSpace, Buffer *buf,
1380 VarPattern *pat = (VarPattern *)patp;
1383 if (addSpace && vpstate->varSpace)
1384 Buf_AddByte(buf, vpstate->varSpace);
1388 if ((ptr = Str_SYSVMatch(word, pat->lhs, &len)) != NULL) {
1389 varexp = Var_Subst(NULL, pat->rhs, ctx, FALSE, TRUE);
1390 Str_SYSVSubst(buf, varexp, ptr, len);
1393 Buf_AddBytes(buf, strlen(word), word);
1402 *-----------------------------------------------------------------------
1404 * Place the word in the buffer if it doesn't match the given pattern.
1405 * Callback function for VarModify to implement the :N modifier.
1408 * word Word to examine
1409 * addSpace TRUE if need to add a space to the buffer
1410 * before adding the word, if it matches
1411 * buf Buffer in which to store it
1412 * pattern Pattern the word must match
1415 * TRUE if a space should be placed in the buffer before the next
1419 * The word may be copied to the buffer.
1421 *-----------------------------------------------------------------------
1424 VarNoMatch(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1425 char *word, Boolean addSpace, Buffer *buf,
1428 if (!Str_Match(word, (char *)pattern)) {
1429 if (addSpace && vpstate->varSpace) {
1430 Buf_AddByte(buf, vpstate->varSpace);
1433 Buf_AddBytes(buf, strlen(word), word);
1440 *-----------------------------------------------------------------------
1442 * Perform a string-substitution on the given word, placing the
1443 * result in the passed buffer.
1446 * word Word to modify
1447 * addSpace True if space should be added before
1449 * buf Buffer for result
1450 * patternp Pattern for substitution
1453 * TRUE if a space is needed before more characters are added.
1458 *-----------------------------------------------------------------------
1461 VarSubstitute(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1462 char *word, Boolean addSpace, Buffer *buf,
1465 int wordLen; /* Length of word */
1466 char *cp; /* General pointer */
1467 VarPattern *pattern = (VarPattern *)patternp;
1469 wordLen = strlen(word);
1470 if ((pattern->flags & (VAR_SUB_ONE|VAR_SUB_MATCHED)) !=
1471 (VAR_SUB_ONE|VAR_SUB_MATCHED)) {
1473 * Still substituting -- break it down into simple anchored cases
1474 * and if none of them fits, perform the general substitution case.
1476 if ((pattern->flags & VAR_MATCH_START) &&
1477 (strncmp(word, pattern->lhs, pattern->leftLen) == 0)) {
1479 * Anchored at start and beginning of word matches pattern
1481 if ((pattern->flags & VAR_MATCH_END) &&
1482 (wordLen == pattern->leftLen)) {
1484 * Also anchored at end and matches to the end (word
1485 * is same length as pattern) add space and rhs only
1486 * if rhs is non-null.
1488 if (pattern->rightLen != 0) {
1489 if (addSpace && vpstate->varSpace) {
1490 Buf_AddByte(buf, vpstate->varSpace);
1493 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1495 pattern->flags |= VAR_SUB_MATCHED;
1496 } else if (pattern->flags & VAR_MATCH_END) {
1498 * Doesn't match to end -- copy word wholesale
1503 * Matches at start but need to copy in trailing characters
1505 if ((pattern->rightLen + wordLen - pattern->leftLen) != 0){
1506 if (addSpace && vpstate->varSpace) {
1507 Buf_AddByte(buf, vpstate->varSpace);
1511 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1512 Buf_AddBytes(buf, wordLen - pattern->leftLen,
1513 (word + pattern->leftLen));
1514 pattern->flags |= VAR_SUB_MATCHED;
1516 } else if (pattern->flags & VAR_MATCH_START) {
1518 * Had to match at start of word and didn't -- copy whole word.
1521 } else if (pattern->flags & VAR_MATCH_END) {
1523 * Anchored at end, Find only place match could occur (leftLen
1524 * characters from the end of the word) and see if it does. Note
1525 * that because the $ will be left at the end of the lhs, we have
1528 cp = word + (wordLen - pattern->leftLen);
1530 (strncmp(cp, pattern->lhs, pattern->leftLen) == 0)) {
1532 * Match found. If we will place characters in the buffer,
1533 * add a space before hand as indicated by addSpace, then
1534 * stuff in the initial, unmatched part of the word followed
1535 * by the right-hand-side.
1537 if (((cp - word) + pattern->rightLen) != 0) {
1538 if (addSpace && vpstate->varSpace) {
1539 Buf_AddByte(buf, vpstate->varSpace);
1543 Buf_AddBytes(buf, cp - word, word);
1544 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1545 pattern->flags |= VAR_SUB_MATCHED;
1548 * Had to match at end and didn't. Copy entire word.
1554 * Pattern is unanchored: search for the pattern in the word using
1555 * String_FindSubstring, copying unmatched portions and the
1556 * right-hand-side for each match found, handling non-global
1557 * substitutions correctly, etc. When the loop is done, any
1558 * remaining part of the word (word and wordLen are adjusted
1559 * accordingly through the loop) is copied straight into the
1561 * addSpace is set FALSE as soon as a space is added to the
1568 origSize = Buf_Size(buf);
1570 cp = Str_FindSubstring(word, pattern->lhs);
1572 if (addSpace && (((cp - word) + pattern->rightLen) != 0)){
1573 Buf_AddByte(buf, vpstate->varSpace);
1576 Buf_AddBytes(buf, cp-word, word);
1577 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1578 wordLen -= (cp - word) + pattern->leftLen;
1579 word = cp + pattern->leftLen;
1583 if ((pattern->flags & VAR_SUB_GLOBAL) == 0) {
1586 pattern->flags |= VAR_SUB_MATCHED;
1592 if (addSpace && vpstate->varSpace) {
1593 Buf_AddByte(buf, vpstate->varSpace);
1595 Buf_AddBytes(buf, wordLen, word);
1598 * If added characters to the buffer, need to add a space
1599 * before we add any more. If we didn't add any, just return
1600 * the previous value of addSpace.
1602 return ((Buf_Size(buf) != origSize) || addSpace);
1607 if (addSpace && vpstate->varSpace) {
1608 Buf_AddByte(buf, vpstate->varSpace);
1610 Buf_AddBytes(buf, wordLen, word);
1616 *-----------------------------------------------------------------------
1618 * Print the error caused by a regcomp or regexec call.
1624 * An error gets printed.
1626 *-----------------------------------------------------------------------
1629 VarREError(int errnum, regex_t *pat, const char *str)
1634 errlen = regerror(errnum, pat, 0, 0);
1635 errbuf = bmake_malloc(errlen);
1636 regerror(errnum, pat, errbuf, errlen);
1637 Error("%s: %s", str, errbuf);
1643 *-----------------------------------------------------------------------
1644 * VarRESubstitute --
1645 * Perform a regex substitution on the given word, placing the
1646 * result in the passed buffer.
1649 * TRUE if a space is needed before more characters are added.
1654 *-----------------------------------------------------------------------
1657 VarRESubstitute(GNode *ctx MAKE_ATTR_UNUSED,
1658 Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
1659 char *word, Boolean addSpace, Buffer *buf,
1669 #define MAYBE_ADD_SPACE() \
1670 if (addSpace && !added) \
1671 Buf_AddByte(buf, ' '); \
1678 if ((pat->flags & (VAR_SUB_ONE|VAR_SUB_MATCHED)) ==
1679 (VAR_SUB_ONE|VAR_SUB_MATCHED))
1683 xrv = regexec(&pat->re, wp, pat->nsub, pat->matches, flags);
1688 pat->flags |= VAR_SUB_MATCHED;
1689 if (pat->matches[0].rm_so > 0) {
1691 Buf_AddBytes(buf, pat->matches[0].rm_so, wp);
1694 for (rp = pat->replace; *rp; rp++) {
1695 if ((*rp == '\\') && ((rp[1] == '&') || (rp[1] == '\\'))) {
1697 Buf_AddByte(buf,rp[1]);
1700 else if ((*rp == '&') ||
1701 ((*rp == '\\') && isdigit((unsigned char)rp[1]))) {
1719 if (n > pat->nsub) {
1720 Error("No subexpression %s", &errstr[0]);
1723 } else if ((pat->matches[n].rm_so == -1) &&
1724 (pat->matches[n].rm_eo == -1)) {
1725 Error("No match for subexpression %s", &errstr[0]);
1729 subbuf = wp + pat->matches[n].rm_so;
1730 sublen = pat->matches[n].rm_eo - pat->matches[n].rm_so;
1735 Buf_AddBytes(buf, sublen, subbuf);
1739 Buf_AddByte(buf, *rp);
1742 wp += pat->matches[0].rm_eo;
1743 if (pat->flags & VAR_SUB_GLOBAL) {
1744 flags |= REG_NOTBOL;
1745 if (pat->matches[0].rm_so == 0 && pat->matches[0].rm_eo == 0) {
1747 Buf_AddByte(buf, *wp);
1756 Buf_AddBytes(buf, strlen(wp), wp);
1760 VarREError(xrv, &pat->re, "Unexpected regex error");
1765 Buf_AddBytes(buf,strlen(wp),wp);
1769 return(addSpace||added);
1776 *-----------------------------------------------------------------------
1778 * Implements the :@<temp>@<string>@ modifier of ODE make.
1779 * We set the temp variable named in pattern.lhs to word and expand
1780 * pattern.rhs storing the result in the passed buffer.
1783 * word Word to modify
1784 * addSpace True if space should be added before
1786 * buf Buffer for result
1787 * pattern Datafor substitution
1790 * TRUE if a space is needed before more characters are added.
1795 *-----------------------------------------------------------------------
1798 VarLoopExpand(GNode *ctx MAKE_ATTR_UNUSED,
1799 Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
1800 char *word, Boolean addSpace, Buffer *buf,
1803 VarLoop_t *loop = (VarLoop_t *)loopp;
1807 if (word && *word) {
1808 Var_Set(loop->tvar, word, loop->ctxt, VAR_NO_EXPORT);
1809 s = Var_Subst(NULL, loop->str, loop->ctxt, loop->errnum, TRUE);
1810 if (s != NULL && *s != '\0') {
1811 if (addSpace && *s != '\n')
1812 Buf_AddByte(buf, ' ');
1813 Buf_AddBytes(buf, (slen = strlen(s)), s);
1814 addSpace = (slen > 0 && s[slen - 1] != '\n');
1823 *-----------------------------------------------------------------------
1825 * Implements the :[start..end] modifier.
1826 * This is a special case of VarModify since we want to be able
1827 * to scan the list backwards if start > end.
1830 * str String whose words should be trimmed
1831 * seldata words to select
1834 * A string of all the words selected.
1839 *-----------------------------------------------------------------------
1842 VarSelectWords(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1843 const char *str, VarSelectWords_t *seldata)
1845 Buffer buf; /* Buffer for the new string */
1846 Boolean addSpace; /* TRUE if need to add a space to the
1847 * buffer before adding the trimmed
1849 char **av; /* word list */
1850 char *as; /* word list memory */
1852 int start, end, step;
1857 if (vpstate->oneBigWord) {
1858 /* fake what brk_string() would do if there were only one word */
1860 av = bmake_malloc((ac + 1) * sizeof(char *));
1861 as = bmake_strdup(str);
1865 av = brk_string(str, &ac, FALSE, &as);
1869 * Now sanitize seldata.
1870 * If seldata->start or seldata->end are negative, convert them to
1871 * the positive equivalents (-1 gets converted to argc, -2 gets
1872 * converted to (argc-1), etc.).
1874 if (seldata->start < 0)
1875 seldata->start = ac + seldata->start + 1;
1876 if (seldata->end < 0)
1877 seldata->end = ac + seldata->end + 1;
1880 * We avoid scanning more of the list than we need to.
1882 if (seldata->start > seldata->end) {
1883 start = MIN(ac, seldata->start) - 1;
1884 end = MAX(0, seldata->end - 1);
1887 start = MAX(0, seldata->start - 1);
1888 end = MIN(ac, seldata->end);
1893 (step < 0 && i >= end) || (step > 0 && i < end);
1895 if (av[i] && *av[i]) {
1896 if (addSpace && vpstate->varSpace) {
1897 Buf_AddByte(&buf, vpstate->varSpace);
1899 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
1907 return Buf_Destroy(&buf, FALSE);
1913 * Replace each word with the result of realpath()
1917 VarRealpath(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1918 char *word, Boolean addSpace, Buffer *buf,
1919 void *patternp MAKE_ATTR_UNUSED)
1922 char rbuf[MAXPATHLEN];
1925 if (addSpace && vpstate->varSpace) {
1926 Buf_AddByte(buf, vpstate->varSpace);
1929 rp = realpath(word, rbuf);
1930 if (rp && *rp == '/' && stat(rp, &st) == 0)
1933 Buf_AddBytes(buf, strlen(word), word);
1938 *-----------------------------------------------------------------------
1940 * Modify each of the words of the passed string using the given
1941 * function. Used to implement all modifiers.
1944 * str String whose words should be trimmed
1945 * modProc Function to use to modify them
1946 * datum Datum to pass it
1949 * A string of all the words modified appropriately.
1954 *-----------------------------------------------------------------------
1957 VarModify(GNode *ctx, Var_Parse_State *vpstate,
1959 Boolean (*modProc)(GNode *, Var_Parse_State *, char *,
1960 Boolean, Buffer *, void *),
1963 Buffer buf; /* Buffer for the new string */
1964 Boolean addSpace; /* TRUE if need to add a space to the
1965 * buffer before adding the trimmed
1967 char **av; /* word list */
1968 char *as; /* word list memory */
1974 if (vpstate->oneBigWord) {
1975 /* fake what brk_string() would do if there were only one word */
1977 av = bmake_malloc((ac + 1) * sizeof(char *));
1978 as = bmake_strdup(str);
1982 av = brk_string(str, &ac, FALSE, &as);
1985 for (i = 0; i < ac; i++) {
1986 addSpace = (*modProc)(ctx, vpstate, av[i], addSpace, &buf, datum);
1992 return Buf_Destroy(&buf, FALSE);
1997 VarWordCompare(const void *a, const void *b)
1999 int r = strcmp(*(const char * const *)a, *(const char * const *)b);
2004 *-----------------------------------------------------------------------
2006 * Order the words in the string.
2009 * str String whose words should be sorted.
2010 * otype How to order: s - sort, x - random.
2013 * A string containing the words ordered.
2018 *-----------------------------------------------------------------------
2021 VarOrder(const char *str, const char otype)
2023 Buffer buf; /* Buffer for the new string */
2024 char **av; /* word list [first word does not count] */
2025 char *as; /* word list memory */
2030 av = brk_string(str, &ac, FALSE, &as);
2034 case 's': /* sort alphabetically */
2035 qsort(av, ac, sizeof(char *), VarWordCompare);
2037 case 'x': /* randomize */
2043 * We will use [ac..2] range for mod factors. This will produce
2044 * random numbers in [(ac-1)..0] interval, and minimal
2045 * reasonable value for mod factor is 2 (the mod 1 will produce
2046 * 0 with probability 1).
2048 for (i = ac-1; i > 0; i--) {
2049 rndidx = random() % (i + 1);
2057 } /* end of switch */
2059 for (i = 0; i < ac; i++) {
2060 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
2062 Buf_AddByte(&buf, ' ');
2068 return Buf_Destroy(&buf, FALSE);
2073 *-----------------------------------------------------------------------
2075 * Remove adjacent duplicate words.
2078 * str String whose words should be sorted
2081 * A string containing the resulting words.
2086 *-----------------------------------------------------------------------
2089 VarUniq(const char *str)
2091 Buffer buf; /* Buffer for new string */
2092 char **av; /* List of words to affect */
2093 char *as; /* Word list memory */
2097 av = brk_string(str, &ac, FALSE, &as);
2100 for (j = 0, i = 1; i < ac; i++)
2101 if (strcmp(av[i], av[j]) != 0 && (++j != i))
2106 for (i = 0; i < ac; i++) {
2107 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
2109 Buf_AddByte(&buf, ' ');
2115 return Buf_Destroy(&buf, FALSE);
2120 *-----------------------------------------------------------------------
2122 * Pass through the tstr looking for 1) escaped delimiters,
2123 * '$'s and backslashes (place the escaped character in
2124 * uninterpreted) and 2) unescaped $'s that aren't before
2125 * the delimiter (expand the variable substitution unless flags
2126 * has VAR_NOSUBST set).
2127 * Return the expanded string or NULL if the delimiter was missing
2128 * If pattern is specified, handle escaped ampersands, and replace
2129 * unescaped ampersands with the lhs of the pattern.
2132 * A string of all the words modified appropriately.
2133 * If length is specified, return the string length of the buffer
2134 * If flags is specified and the last character of the pattern is a
2135 * $ set the VAR_MATCH_END bit of flags.
2139 *-----------------------------------------------------------------------
2142 VarGetPattern(GNode *ctxt, Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
2143 int errnum, const char **tstr, int delim, int *flags,
2144 int *length, VarPattern *pattern)
2155 #define IS_A_MATCH(cp, delim) \
2156 ((cp[0] == '\\') && ((cp[1] == delim) || \
2157 (cp[1] == '\\') || (cp[1] == '$') || (pattern && (cp[1] == '&'))))
2160 * Skim through until the matching delimiter is found;
2161 * pick up variable substitutions on the way. Also allow
2162 * backslashes to quote the delimiter, $, and \, but don't
2163 * touch other backslashes.
2165 for (cp = *tstr; *cp && (*cp != delim); cp++) {
2166 if (IS_A_MATCH(cp, delim)) {
2167 Buf_AddByte(&buf, cp[1]);
2169 } else if (*cp == '$') {
2170 if (cp[1] == delim) {
2172 Buf_AddByte(&buf, *cp);
2175 * Unescaped $ at end of pattern => anchor
2178 *flags |= VAR_MATCH_END;
2180 if (flags == NULL || (*flags & VAR_NOSUBST) == 0) {
2186 * If unescaped dollar sign not before the
2187 * delimiter, assume it's a variable
2188 * substitution and recurse.
2190 cp2 = Var_Parse(cp, ctxt, errnum, TRUE, &len, &freeIt);
2191 Buf_AddBytes(&buf, strlen(cp2), cp2);
2195 const char *cp2 = &cp[1];
2197 if (*cp2 == PROPEN || *cp2 == BROPEN) {
2199 * Find the end of this variable reference
2200 * and suck it in without further ado.
2201 * It will be interperated later.
2204 int want = (*cp2 == PROPEN) ? PRCLOSE : BRCLOSE;
2207 for (++cp2; *cp2 != '\0' && depth > 0; ++cp2) {
2208 if (cp2[-1] != '\\') {
2215 Buf_AddBytes(&buf, cp2 - cp, cp);
2218 Buf_AddByte(&buf, *cp);
2222 else if (pattern && *cp == '&')
2223 Buf_AddBytes(&buf, pattern->leftLen, pattern->lhs);
2225 Buf_AddByte(&buf, *cp);
2235 *length = Buf_Size(&buf);
2236 rstr = Buf_Destroy(&buf, FALSE);
2238 fprintf(debug_file, "Modifier pattern: \"%s\"\n", rstr);
2243 *-----------------------------------------------------------------------
2245 * Quote shell meta-characters and space characters in the string
2253 *-----------------------------------------------------------------------
2260 const char *newline;
2263 if ((newline = Shell_GetNewline()) == NULL)
2265 nlen = strlen(newline);
2269 for (; *str != '\0'; str++) {
2271 Buf_AddBytes(&buf, nlen, newline);
2274 if (isspace((unsigned char)*str) || ismeta((unsigned char)*str))
2275 Buf_AddByte(&buf, '\\');
2276 Buf_AddByte(&buf, *str);
2279 str = Buf_Destroy(&buf, FALSE);
2281 fprintf(debug_file, "QuoteMeta: [%s]\n", str);
2286 *-----------------------------------------------------------------------
2288 * Hash the string using the MurmurHash3 algorithm.
2289 * Output is computed using 32bit Little Endian arithmetic.
2292 * str String to modify
2295 * Hash value of str, encoded as 8 hex digits.
2300 *-----------------------------------------------------------------------
2305 static const char hexdigits[16] = "0123456789abcdef";
2308 unsigned char *ustr = (unsigned char *)str;
2309 uint32_t h, k, c1, c2;
2316 for (len = len2; len; ) {
2320 k = (ustr[3] << 24) | (ustr[2] << 16) | (ustr[1] << 8) | ustr[0];
2325 k |= (ustr[2] << 16);
2327 k |= (ustr[1] << 8);
2332 c1 = c1 * 5 + 0x7b7d159cU;
2333 c2 = c2 * 5 + 0x6bce6396U;
2335 k = (k << 11) ^ (k >> 21);
2337 h = (h << 13) ^ (h >> 19);
2338 h = h * 5 + 0x52dce729U;
2348 for (len = 0; len < 8; ++len) {
2349 Buf_AddByte(&buf, hexdigits[h & 15]);
2353 return Buf_Destroy(&buf, FALSE);
2357 VarStrftime(const char *fmt, int zulu)
2365 strftime(buf, sizeof(buf), fmt, zulu ? gmtime(&utc) : localtime(&utc));
2367 buf[sizeof(buf) - 1] = '\0';
2368 return bmake_strdup(buf);
2372 * Now we need to apply any modifiers the user wants applied.
2374 * :M<pattern> words which match the given <pattern>.
2375 * <pattern> is of the standard file
2377 * :N<pattern> words which do not match the given <pattern>.
2378 * :S<d><pat1><d><pat2><d>[1gW]
2379 * Substitute <pat2> for <pat1> in the value
2380 * :C<d><pat1><d><pat2><d>[1gW]
2381 * Substitute <pat2> for regex <pat1> in the value
2382 * :H Substitute the head of each word
2383 * :T Substitute the tail of each word
2384 * :E Substitute the extension (minus '.') of
2386 * :R Substitute the root of each word
2387 * (pathname minus the suffix).
2388 * :O ("Order") Alphabeticaly sort words in variable.
2389 * :Ox ("intermiX") Randomize words in variable.
2390 * :u ("uniq") Remove adjacent duplicate words.
2391 * :tu Converts the variable contents to uppercase.
2392 * :tl Converts the variable contents to lowercase.
2393 * :ts[c] Sets varSpace - the char used to
2394 * separate words to 'c'. If 'c' is
2395 * omitted then no separation is used.
2396 * :tW Treat the variable contents as a single
2397 * word, even if it contains spaces.
2398 * (Mnemonic: one big 'W'ord.)
2399 * :tw Treat the variable contents as multiple
2400 * space-separated words.
2401 * (Mnemonic: many small 'w'ords.)
2402 * :[index] Select a single word from the value.
2403 * :[start..end] Select multiple words from the value.
2404 * :[*] or :[0] Select the entire value, as a single
2405 * word. Equivalent to :tW.
2406 * :[@] Select the entire value, as multiple
2407 * words. Undoes the effect of :[*].
2408 * Equivalent to :tw.
2409 * :[#] Returns the number of words in the value.
2411 * :?<true-value>:<false-value>
2412 * If the variable evaluates to true, return
2413 * true value, else return the second value.
2414 * :lhs=rhs Like :S, but the rhs goes to the end of
2416 * :sh Treat the current value as a command
2417 * to be run, new value is its output.
2418 * The following added so we can handle ODE makefiles.
2419 * :@<tmpvar>@<newval>@
2420 * Assign a temporary local variable <tmpvar>
2421 * to the current value of each word in turn
2422 * and replace each word with the result of
2423 * evaluating <newval>
2424 * :D<newval> Use <newval> as value if variable defined
2425 * :U<newval> Use <newval> as value if variable undefined
2426 * :L Use the name of the variable as the value.
2427 * :P Use the path of the node that has the same
2428 * name as the variable as the value. This
2429 * basically includes an implied :L so that
2430 * the common method of refering to the path
2431 * of your dependent 'x' in a rule is to use
2432 * the form '${x:P}'.
2433 * :!<cmd>! Run cmd much the same as :sh run's the
2434 * current value of the variable.
2435 * The ::= modifiers, actually assign a value to the variable.
2436 * Their main purpose is in supporting modifiers of .for loop
2437 * iterators and other obscure uses. They always expand to
2438 * nothing. In a target rule that would otherwise expand to an
2439 * empty line they can be preceded with @: to keep make happy.
2443 * .for i in ${.TARGET} ${.TARGET:R}.gz
2448 * ::=<str> Assigns <str> as the new value of variable.
2449 * ::?=<str> Assigns <str> as value of variable if
2450 * it was not already set.
2451 * ::+=<str> Appends <str> to variable.
2452 * ::!=<cmd> Assigns output of <cmd> as the new value of
2456 /* we now have some modifiers with long names */
2457 #define STRMOD_MATCH(s, want, n) \
2458 (strncmp(s, want, n) == 0 && (s[n] == endc || s[n] == ':'))
2461 ApplyModifiers(char *nstr, const char *tstr,
2462 int startc, int endc,
2463 Var *v, GNode *ctxt, Boolean errnum, Boolean wantit,
2464 int *lengthPtr, void **freePtr)
2467 const char *cp; /* Secondary pointer into str (place marker
2469 char *newStr; /* New value to return */
2470 char termc; /* Character which terminated scan */
2471 int cnt; /* Used to count brace pairs when variable in
2472 * in parens or braces */
2474 int modifier; /* that we are processing */
2475 Var_Parse_State parsestate; /* Flags passed to helper functions */
2478 parsestate.oneBigWord = FALSE;
2479 parsestate.varSpace = ' '; /* word separator */
2483 while (*tstr && *tstr != endc) {
2487 * We may have some complex modifiers in a variable.
2494 rval = Var_Parse(tstr, ctxt, errnum, wantit, &rlen, &freeIt);
2497 * If we have not parsed up to endc or ':',
2498 * we are not interested.
2500 if (rval != NULL && *rval &&
2501 (c = tstr[rlen]) != '\0' &&
2509 fprintf(debug_file, "Got '%s' from '%.*s'%.*s\n",
2510 rval, rlen, tstr, rlen, tstr + rlen);
2515 if (rval != NULL && *rval) {
2518 nstr = ApplyModifiers(nstr, rval,
2520 v, ctxt, errnum, wantit, &used, freePtr);
2521 if (nstr == var_Error
2522 || (nstr == varNoError && errnum == 0)
2523 || strlen(rval) != (size_t) used) {
2525 goto out; /* error already reported */
2531 else if (!*tstr && endc) {
2532 Error("Unclosed variable specification after complex modifier (expecting '%c') for %s", endc, v->name);
2539 fprintf(debug_file, "Applying[%s] :%c to \"%s\"\n", v->name,
2543 switch ((modifier = *tstr)) {
2546 if (tstr[1] == '=' ||
2548 (tstr[1] == '!' || tstr[1] == '+' || tstr[1] == '?'))) {
2550 * "::=", "::!=", "::+=", or "::?="
2552 GNode *v_ctxt; /* context where v belongs */
2559 if (v->name[0] == 0)
2565 if (v->flags & VAR_JUNK) {
2567 * We need to bmake_strdup() it incase
2568 * VarGetPattern() recurses.
2571 v->name = bmake_strdup(v->name);
2572 } else if (ctxt != VAR_GLOBAL) {
2573 Var *gv = VarFind(v->name, ctxt, 0);
2575 v_ctxt = VAR_GLOBAL;
2577 VarFreeEnv(gv, TRUE);
2580 switch ((how = *tstr)) {
2590 delim = startc == PROPEN ? PRCLOSE : BRCLOSE;
2593 flags = (wantit) ? 0 : VAR_NOSUBST;
2594 pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
2598 if (v->flags & VAR_JUNK) {
2599 /* restore original name */
2603 if (pattern.rhs == NULL)
2612 Var_Append(v->name, pattern.rhs, v_ctxt);
2615 newStr = Cmd_Exec(pattern.rhs, &emsg);
2619 Var_Set(v->name, newStr, v_ctxt, 0);
2623 if ((v->flags & VAR_JUNK) == 0)
2627 Var_Set(v->name, pattern.rhs, v_ctxt, 0);
2631 free(UNCONST(pattern.rhs));
2632 newStr = varNoError;
2635 goto default_case; /* "::<unrecognised>" */
2640 int flags = VAR_NOSUBST;
2644 if ((loop.tvar = VarGetPattern(ctxt, &parsestate, errnum,
2646 &flags, &loop.tvarLen,
2650 if ((loop.str = VarGetPattern(ctxt, &parsestate, errnum,
2652 &flags, &loop.strLen,
2659 loop.errnum = errnum;
2661 newStr = VarModify(ctxt, &parsestate, nstr, VarLoopExpand,
2670 Buffer buf; /* Buffer for patterns */
2671 int wantit_; /* want data in buffer */
2675 wantit_ = ((v->flags & VAR_JUNK) != 0);
2677 wantit_ = ((v->flags & VAR_JUNK) == 0);
2681 * Pass through tstr looking for 1) escaped delimiters,
2682 * '$'s and backslashes (place the escaped character in
2683 * uninterpreted) and 2) unescaped $'s that aren't before
2684 * the delimiter (expand the variable substitution).
2685 * The result is left in the Buffer buf.
2689 *cp != endc && *cp != ':' && *cp != '\0';
2691 if ((*cp == '\\') &&
2697 Buf_AddByte(&buf, cp[1]);
2699 } else if (*cp == '$') {
2701 * If unescaped dollar sign, assume it's a
2702 * variable substitution and recurse.
2708 cp2 = Var_Parse(cp, ctxt, errnum, wantit_, &len, &freeIt);
2709 Buf_AddBytes(&buf, strlen(cp2), cp2);
2713 Buf_AddByte(&buf, *cp);
2719 if ((v->flags & VAR_JUNK) != 0)
2720 v->flags |= VAR_KEEP;
2722 newStr = Buf_Destroy(&buf, FALSE);
2725 Buf_Destroy(&buf, TRUE);
2731 if ((v->flags & VAR_JUNK) != 0)
2732 v->flags |= VAR_KEEP;
2733 newStr = bmake_strdup(v->name);
2742 if ((v->flags & VAR_JUNK) != 0)
2743 v->flags |= VAR_KEEP;
2744 gn = Targ_FindNode(v->name, TARG_NOCREATE);
2745 if (gn == NULL || gn->type & OP_NOPATH) {
2747 } else if (gn->path) {
2748 newStr = bmake_strdup(gn->path);
2750 newStr = Dir_FindFile(v->name, Suff_FindPath(gn));
2753 newStr = bmake_strdup(v->name);
2768 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
2770 NULL, &pattern.rightLen,
2774 newStr = Cmd_Exec(pattern.rhs, &emsg);
2776 newStr = varNoError;
2777 free(UNCONST(pattern.rhs));
2782 if (v->flags & VAR_JUNK) {
2783 v->flags |= VAR_KEEP;
2790 * Look for the closing ']', recursively
2791 * expanding any embedded variables.
2793 * estr is a pointer to the expanded result,
2794 * which we must free().
2798 cp = tstr+1; /* point to char after '[' */
2799 delim = ']'; /* look for closing ']' */
2800 estr = VarGetPattern(ctxt, &parsestate,
2804 goto cleanup; /* report missing ']' */
2805 /* now cp points just after the closing ']' */
2807 if (cp[0] != ':' && cp[0] != endc) {
2808 /* Found junk after ']' */
2812 if (estr[0] == '\0') {
2813 /* Found empty square brackets in ":[]". */
2816 } else if (estr[0] == '#' && estr[1] == '\0') {
2820 * We will need enough space for the decimal
2821 * representation of an int. We calculate the
2822 * space needed for the octal representation,
2823 * and add enough slop to cope with a '-' sign
2824 * (which should never be needed) and a '\0'
2825 * string terminator.
2828 (sizeof(int) * CHAR_BIT + 2) / 3 + 2;
2830 newStr = bmake_malloc(newStrSize);
2831 if (parsestate.oneBigWord) {
2832 strncpy(newStr, "1", newStrSize);
2834 /* XXX: brk_string() is a rather expensive
2835 * way of counting words. */
2840 av = brk_string(nstr, &ac, FALSE, &as);
2841 snprintf(newStr, newStrSize, "%d", ac);
2848 } else if (estr[0] == '*' && estr[1] == '\0') {
2850 parsestate.oneBigWord = TRUE;
2855 } else if (estr[0] == '@' && estr[1] == '\0') {
2857 parsestate.oneBigWord = FALSE;
2864 * We expect estr to contain a single
2865 * integer for :[N], or two integers
2866 * separated by ".." for :[start..end].
2870 VarSelectWords_t seldata = { 0, 0 };
2872 seldata.start = strtol(estr, &ep, 0);
2874 /* Found junk instead of a number */
2877 } else if (ep[0] == '\0') {
2878 /* Found only one integer in :[N] */
2879 seldata.end = seldata.start;
2880 } else if (ep[0] == '.' && ep[1] == '.' &&
2882 /* Expecting another integer after ".." */
2884 seldata.end = strtol(ep, &ep, 0);
2885 if (ep[0] != '\0') {
2886 /* Found junk after ".." */
2891 /* Found junk instead of ".." */
2896 * Now seldata is properly filled in,
2897 * but we still have to check for 0 as
2900 if (seldata.start == 0 && seldata.end == 0) {
2901 /* ":[0]" or perhaps ":[0..0]" */
2902 parsestate.oneBigWord = TRUE;
2907 } else if (seldata.start == 0 ||
2909 /* ":[0..N]" or ":[N..0]" */
2914 * Normal case: select the words
2915 * described by seldata.
2917 newStr = VarSelectWords(ctxt, &parsestate,
2927 cp = tstr + 1; /* make sure it is set */
2928 if (STRMOD_MATCH(tstr, "gmtime", 6)) {
2929 newStr = VarStrftime(nstr, 1);
2937 cp = tstr + 1; /* make sure it is set */
2938 if (STRMOD_MATCH(tstr, "hash", 4)) {
2939 newStr = VarHash(nstr);
2947 cp = tstr + 1; /* make sure it is set */
2948 if (STRMOD_MATCH(tstr, "localtime", 9)) {
2949 newStr = VarStrftime(nstr, 0);
2958 cp = tstr + 1; /* make sure it is set */
2959 if (tstr[1] != endc && tstr[1] != ':') {
2960 if (tstr[1] == 's') {
2962 * Use the char (if any) at tstr[2]
2963 * as the word separator.
2967 if (tstr[2] != endc &&
2968 (tstr[3] == endc || tstr[3] == ':')) {
2969 /* ":ts<unrecognised><endc>" or
2970 * ":ts<unrecognised>:" */
2971 parsestate.varSpace = tstr[2];
2973 } else if (tstr[2] == endc || tstr[2] == ':') {
2974 /* ":ts<endc>" or ":ts:" */
2975 parsestate.varSpace = 0; /* no separator */
2977 } else if (tstr[2] == '\\') {
2980 parsestate.varSpace = '\n';
2984 parsestate.varSpace = '\t';
2988 if (isdigit((unsigned char)tstr[3])) {
2991 parsestate.varSpace =
2992 strtoul(&tstr[3], &ep, 0);
2993 if (*ep != ':' && *ep != endc)
2998 * ":ts<backslash><unrecognised>".
3006 * Found ":ts<unrecognised><unrecognised>".
3014 * We cannot be certain that VarModify
3015 * will be used - even if there is a
3016 * subsequent modifier, so do a no-op
3017 * VarSubstitute now to for str to be
3018 * re-expanded without the spaces.
3020 pattern.flags = VAR_SUB_ONE;
3021 pattern.lhs = pattern.rhs = "\032";
3022 pattern.leftLen = pattern.rightLen = 1;
3024 newStr = VarModify(ctxt, &parsestate, nstr,
3027 } else if (tstr[2] == endc || tstr[2] == ':') {
3029 * Check for two-character options:
3032 if (tstr[1] == 'A') { /* absolute path */
3033 newStr = VarModify(ctxt, &parsestate, nstr,
3037 } else if (tstr[1] == 'u') {
3038 char *dp = bmake_strdup(nstr);
3039 for (newStr = dp; *dp; dp++)
3040 *dp = toupper((unsigned char)*dp);
3043 } else if (tstr[1] == 'l') {
3044 char *dp = bmake_strdup(nstr);
3045 for (newStr = dp; *dp; dp++)
3046 *dp = tolower((unsigned char)*dp);
3049 } else if (tstr[1] == 'W' || tstr[1] == 'w') {
3050 parsestate.oneBigWord = (tstr[1] == 'W');
3055 /* Found ":t<unrecognised>:" or
3056 * ":t<unrecognised><endc>". */
3061 * Found ":t<unrecognised><unrecognised>".
3067 * Found ":t<endc>" or ":t:".
3077 const char *endpat; /* points just after end of pattern */
3079 Boolean copy; /* pattern should be, or has been, copied */
3087 * In the loop below, ignore ':' unless we are at
3088 * (or back to) the original brace level.
3089 * XXX This will likely not work right if $() and ${}
3093 *cp != '\0' && !(*cp == ':' && nest == 1);
3098 cp[1] == endc || cp[1] == startc)) {
3108 if (*cp == '(' || *cp == '{')
3110 if (*cp == ')' || *cp == '}') {
3120 * Need to compress the \:'s out of the pattern, so
3121 * allocate enough room to hold the uncompressed
3122 * pattern (note that cp started at tstr+1, so
3123 * cp - tstr takes the null byte into account) and
3124 * compress the pattern into the space.
3126 pattern = bmake_malloc(cp - tstr);
3127 for (cp2 = pattern, cp = tstr + 1;
3131 if ((*cp == '\\') && (cp+1 < endpat) &&
3132 (cp[1] == ':' || cp[1] == endc)) {
3141 * Either Var_Subst or VarModify will need a
3142 * nul-terminated string soon, so construct one now.
3144 pattern = bmake_strndup(tstr+1, endpat - (tstr + 1));
3148 * pattern contains embedded '$', so use Var_Subst to
3152 pattern = Var_Subst(NULL, cp2, ctxt, errnum, TRUE);
3156 fprintf(debug_file, "Pattern[%s] for [%s] is [%s]\n",
3157 v->name, nstr, pattern);
3159 newStr = VarModify(ctxt, &parsestate, nstr, VarMatch,
3162 newStr = VarModify(ctxt, &parsestate, nstr, VarNoMatch,
3171 Var_Parse_State tmpparsestate;
3174 tmpparsestate = parsestate;
3179 * If pattern begins with '^', it is anchored to the
3180 * start of the word -- skip over it and flag pattern.
3183 pattern.flags |= VAR_MATCH_START;
3188 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate, errnum,
3195 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
3202 * Check for global substitution. If 'g' after the final
3203 * delimiter, substitution is global and is marked that
3209 pattern.flags |= VAR_SUB_GLOBAL;
3212 pattern.flags |= VAR_SUB_ONE;
3215 tmpparsestate.oneBigWord = TRUE;
3222 newStr = VarModify(ctxt, &tmpparsestate, nstr,
3227 * Free the two strings.
3229 free(UNCONST(pattern.lhs));
3230 free(UNCONST(pattern.rhs));
3239 int lhs_flags, rhs_flags;
3241 /* find ':', and then substitute accordingly */
3243 cond_rc = Cond_EvalExpression(NULL, v->name, &value, 0, FALSE);
3244 if (cond_rc == COND_INVALID) {
3245 lhs_flags = rhs_flags = VAR_NOSUBST;
3248 rhs_flags = VAR_NOSUBST;
3250 lhs_flags = VAR_NOSUBST;
3254 /* we are just consuming and discarding */
3255 cond_rc = value = 0;
3256 lhs_flags = rhs_flags = VAR_NOSUBST;
3262 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate, errnum,
3263 &cp, delim, &lhs_flags,
3268 /* BROPEN or PROPEN */
3270 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
3271 &cp, delim, &rhs_flags,
3278 if (cond_rc == COND_INVALID) {
3279 Error("Bad conditional expression `%s' in %s?%s:%s",
3280 v->name, v->name, pattern.lhs, pattern.rhs);
3285 newStr = UNCONST(pattern.lhs);
3286 free(UNCONST(pattern.rhs));
3288 newStr = UNCONST(pattern.rhs);
3289 free(UNCONST(pattern.lhs));
3291 if (v->flags & VAR_JUNK) {
3292 v->flags |= VAR_KEEP;
3299 VarREPattern pattern;
3302 Var_Parse_State tmpparsestate;
3305 tmpparsestate = parsestate;
3311 if ((re = VarGetPattern(ctxt, &parsestate, errnum, &cp, delim,
3312 NULL, NULL, NULL)) == NULL)
3315 if ((pattern.replace = VarGetPattern(ctxt, &parsestate,
3316 errnum, &cp, delim, NULL,
3317 NULL, NULL)) == NULL){
3325 pattern.flags |= VAR_SUB_GLOBAL;
3328 pattern.flags |= VAR_SUB_ONE;
3331 tmpparsestate.oneBigWord = TRUE;
3339 error = regcomp(&pattern.re, re, REG_EXTENDED);
3342 *lengthPtr = cp - start + 1;
3343 VarREError(error, &pattern.re, "RE substitution error");
3344 free(pattern.replace);
3348 pattern.nsub = pattern.re.re_nsub + 1;
3349 if (pattern.nsub < 1)
3351 if (pattern.nsub > 10)
3353 pattern.matches = bmake_malloc(pattern.nsub *
3354 sizeof(regmatch_t));
3355 newStr = VarModify(ctxt, &tmpparsestate, nstr,
3358 regfree(&pattern.re);
3359 free(pattern.replace);
3360 free(pattern.matches);
3366 if (tstr[1] == endc || tstr[1] == ':') {
3367 newStr = VarQuote(nstr);
3374 if (tstr[1] == endc || tstr[1] == ':') {
3375 newStr = VarModify(ctxt, &parsestate, nstr, VarTail,
3383 if (tstr[1] == endc || tstr[1] == ':') {
3384 newStr = VarModify(ctxt, &parsestate, nstr, VarHead,
3392 if (tstr[1] == endc || tstr[1] == ':') {
3393 newStr = VarModify(ctxt, &parsestate, nstr, VarSuffix,
3401 if (tstr[1] == endc || tstr[1] == ':') {
3402 newStr = VarModify(ctxt, &parsestate, nstr, VarRoot,
3413 cp = tstr + 1; /* skip to the rest in any case */
3414 if (tstr[1] == endc || tstr[1] == ':') {
3417 } else if ( (tstr[1] == 'x') &&
3418 (tstr[2] == endc || tstr[2] == ':') ) {
3425 newStr = VarOrder(nstr, otype);
3429 if (tstr[1] == endc || tstr[1] == ':') {
3430 newStr = VarUniq(nstr);
3438 if (tstr[1] == 'h' && (tstr[2] == endc || tstr[2] == ':')) {
3441 newStr = Cmd_Exec(nstr, &emsg);
3445 newStr = varNoError;
3457 * This can either be a bogus modifier or a System-V
3458 * substitution command.
3466 * First we make a pass through the string trying
3467 * to verify it is a SYSV-make-style translation:
3468 * it must be: <string1>=<string2>)
3472 while (*cp != '\0' && cnt) {
3475 /* continue looking for endc */
3477 else if (*cp == endc)
3479 else if (*cp == startc)
3484 if (*cp == endc && eqFound) {
3487 * Now we break this sucker into the lhs and
3488 * rhs. We must null terminate them of course.
3492 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate,
3493 errnum, &cp, delim, &pattern.flags,
3494 &pattern.leftLen, NULL)) == NULL)
3497 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate,
3498 errnum, &cp, delim, NULL, &pattern.rightLen,
3503 * SYSV modifications happen through the whole
3504 * string. Note the pattern is anchored at the end.
3508 if (pattern.leftLen == 0 && *nstr == '\0') {
3509 newStr = nstr; /* special case */
3511 newStr = VarModify(ctxt, &parsestate, nstr,
3515 free(UNCONST(pattern.lhs));
3516 free(UNCONST(pattern.rhs));
3520 Error("Unknown modifier '%c'", *tstr);
3522 *cp != ':' && *cp != endc && *cp != '\0';
3531 fprintf(debug_file, "Result[%s] of :%c is \"%s\"\n",
3532 v->name, modifier, newStr);
3535 if (newStr != nstr) {
3541 if (nstr != var_Error && nstr != varNoError) {
3545 if (termc == '\0' && endc != '\0') {
3546 Error("Unclosed variable specification (expecting '%c') for \"%s\" (value \"%s\") modifier %c", endc, v->name, nstr, modifier);
3547 } else if (termc == ':') {
3553 *lengthPtr = tstr - start;
3558 Error("Bad modifier `:%.*s' for %s", (int)strcspn(tstr, ":)}"), tstr,
3562 *lengthPtr = cp - start;
3564 Error("Unclosed substitution for %s (%c missing)",
3572 *-----------------------------------------------------------------------
3574 * Given the start of a variable invocation, extract the variable
3575 * name and find its value, then modify it according to the
3579 * str The string to parse
3580 * ctxt The context for the variable
3581 * errnum TRUE if undefined variables are an error
3582 * wantit TRUE if we actually want the result
3583 * lengthPtr OUT: The length of the specification
3584 * freePtr OUT: Non-NULL if caller should free *freePtr
3587 * The (possibly-modified) value of the variable or var_Error if the
3588 * specification is invalid. The length of the specification is
3589 * placed in *lengthPtr (for invalid specifications, this is just
3591 * If *freePtr is non-NULL then it's a pointer that the caller
3592 * should pass to free() to free memory used by the result.
3597 *-----------------------------------------------------------------------
3599 /* coverity[+alloc : arg-*4] */
3601 Var_Parse(const char *str, GNode *ctxt,
3602 Boolean errnum, Boolean wantit,
3603 int *lengthPtr, void **freePtr)
3605 const char *tstr; /* Pointer into str */
3606 Var *v; /* Variable in invocation */
3607 Boolean haveModifier;/* TRUE if have modifiers for the variable */
3608 char endc; /* Ending character when variable in parens
3610 char startc; /* Starting character when variable in parens
3612 int vlen; /* Length of variable name */
3613 const char *start; /* Points to original start of str */
3614 char *nstr; /* New string, used during expansion */
3615 Boolean dynamic; /* TRUE if the variable is local and we're
3616 * expanding it in a non-local context. This
3617 * is done to support dynamic sources. The
3618 * result is just the invocation, unaltered */
3619 const char *extramodifiers; /* extra modifiers to apply first */
3623 extramodifiers = NULL;
3628 if (startc != PROPEN && startc != BROPEN) {
3630 * If it's not bounded by braces of some sort, life is much simpler.
3631 * We just need to check for the first character and return the
3632 * value if it exists.
3635 /* Error out some really stupid names */
3636 if (startc == '\0' || strchr(")}:$", startc)) {
3643 v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
3647 if ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)) {
3649 * If substituting a local variable in a non-local context,
3650 * assume it's for dynamic source stuff. We have to handle
3651 * this specially and return the longhand for the variable
3652 * with the dollar sign escaped so it makes it back to the
3653 * caller. Only four of the local variables are treated
3654 * specially as they are the only four that will be set
3655 * when dynamic sources are expanded.
3659 return UNCONST("$(.TARGET)");
3661 return UNCONST("$(.ARCHIVE)");
3663 return UNCONST("$(.PREFIX)");
3665 return UNCONST("$(.MEMBER)");
3671 return (errnum ? var_Error : varNoError);
3673 haveModifier = FALSE;
3678 Buffer buf; /* Holds the variable name */
3681 endc = startc == PROPEN ? PRCLOSE : BRCLOSE;
3685 * Skip to the end character or a colon, whichever comes first.
3687 for (tstr = str + 2; *tstr != '\0'; tstr++)
3690 * Track depth so we can spot parse errors.
3692 if (*tstr == startc) {
3695 if (*tstr == endc) {
3699 if (depth == 1 && *tstr == ':') {
3703 * A variable inside a variable, expand
3708 char *rval = Var_Parse(tstr, ctxt, errnum, wantit, &rlen, &freeIt);
3710 Buf_AddBytes(&buf, strlen(rval), rval);
3716 Buf_AddByte(&buf, *tstr);
3719 haveModifier = TRUE;
3720 } else if (*tstr == endc) {
3721 haveModifier = FALSE;
3724 * If we never did find the end character, return NULL
3725 * right now, setting the length to be the distance to
3726 * the end of the string, since that's what make does.
3728 *lengthPtr = tstr - str;
3729 Buf_Destroy(&buf, TRUE);
3732 str = Buf_GetAll(&buf, &vlen);
3735 * At this point, str points into newly allocated memory from
3736 * buf, containing only the name of the variable.
3738 * start and tstr point into the const string that was pointed
3739 * to by the original value of the str parameter. start points
3740 * to the '$' at the beginning of the string, while tstr points
3741 * to the char just after the end of the variable name -- this
3742 * will be '\0', ':', PRCLOSE, or BRCLOSE.
3745 v = VarFind(str, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
3747 * Check also for bogus D and F forms of local variables since we're
3748 * in a local context and the name is the right length.
3750 if ((v == NULL) && (ctxt != VAR_CMD) && (ctxt != VAR_GLOBAL) &&
3751 (vlen == 2) && (str[1] == 'F' || str[1] == 'D') &&
3752 strchr("@%?*!<>", str[0]) != NULL) {
3754 * Well, it's local -- go look for it.
3758 v = VarFind(name, ctxt, 0);
3761 if (str[1] == 'D') {
3762 extramodifiers = "H:";
3765 extramodifiers = "T:";
3772 (((vlen == 2) && (str[1] == 'F' || str[1] == 'D')))) &&
3773 ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)))
3776 * If substituting a local variable in a non-local context,
3777 * assume it's for dynamic source stuff. We have to handle
3778 * this specially and return the longhand for the variable
3779 * with the dollar sign escaped so it makes it back to the
3780 * caller. Only four of the local variables are treated
3781 * specially as they are the only four that will be set
3782 * when dynamic sources are expanded.
3792 } else if ((vlen > 2) && (*str == '.') &&
3793 isupper((unsigned char) str[1]) &&
3794 ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)))
3799 if ((strncmp(str, ".TARGET", len) == 0) ||
3800 (strncmp(str, ".ARCHIVE", len) == 0) ||
3801 (strncmp(str, ".PREFIX", len) == 0) ||
3802 (strncmp(str, ".MEMBER", len) == 0))
3808 if (!haveModifier) {
3810 * No modifiers -- have specification length so we can return
3813 *lengthPtr = tstr - start + 1;
3815 char *pstr = bmake_strndup(start, *lengthPtr);
3817 Buf_Destroy(&buf, TRUE);
3820 Buf_Destroy(&buf, TRUE);
3821 return (errnum ? var_Error : varNoError);
3825 * Still need to get to the end of the variable specification,
3826 * so kludge up a Var structure for the modifications
3828 v = bmake_malloc(sizeof(Var));
3829 v->name = UNCONST(str);
3830 Buf_Init(&v->val, 1);
3831 v->flags = VAR_JUNK;
3832 Buf_Destroy(&buf, FALSE);
3835 Buf_Destroy(&buf, TRUE);
3838 if (v->flags & VAR_IN_USE) {
3839 Fatal("Variable %s is recursive.", v->name);
3842 v->flags |= VAR_IN_USE;
3845 * Before doing any modification, we have to make sure the value
3846 * has been fully expanded. If it looks like recursion might be
3847 * necessary (there's a dollar sign somewhere in the variable's value)
3848 * we just call Var_Subst to do any other substitutions that are
3849 * necessary. Note that the value returned by Var_Subst will have
3850 * been dynamically-allocated, so it will need freeing when we
3853 nstr = Buf_GetAll(&v->val, NULL);
3854 if (strchr(nstr, '$') != NULL) {
3855 nstr = Var_Subst(NULL, nstr, ctxt, errnum, wantit);
3859 v->flags &= ~VAR_IN_USE;
3861 if ((nstr != NULL) && (haveModifier || extramodifiers != NULL)) {
3866 if (extramodifiers != NULL) {
3867 nstr = ApplyModifiers(nstr, extramodifiers, '(', ')',
3868 v, ctxt, errnum, wantit, &used, &extraFree);
3872 /* Skip initial colon. */
3875 nstr = ApplyModifiers(nstr, tstr, startc, endc,
3876 v, ctxt, errnum, wantit, &used, freePtr);
3880 *freePtr = extraFree;
3884 *lengthPtr = tstr - start + 1;
3886 *lengthPtr = tstr - start;
3889 if (v->flags & VAR_FROM_ENV) {
3890 Boolean destroy = FALSE;
3892 if (nstr != Buf_GetAll(&v->val, NULL)) {
3896 * Returning the value unmodified, so tell the caller to free
3901 VarFreeEnv(v, destroy);
3902 } else if (v->flags & VAR_JUNK) {
3904 * Perform any free'ing needed and set *freePtr to NULL so the caller
3905 * doesn't try to free a static pointer.
3906 * If VAR_KEEP is also set then we want to keep str as is.
3908 if (!(v->flags & VAR_KEEP)) {
3914 nstr = bmake_strndup(start, *lengthPtr);
3917 nstr = errnum ? var_Error : varNoError;
3920 if (nstr != Buf_GetAll(&v->val, NULL))
3921 Buf_Destroy(&v->val, TRUE);
3929 *-----------------------------------------------------------------------
3931 * Substitute for all variables in the given string in the given context
3932 * If undefErr is TRUE, Parse_Error will be called when an undefined
3933 * variable is encountered.
3936 * var Named variable || NULL for all
3937 * str the string which to substitute
3938 * ctxt the context wherein to find variables
3939 * undefErr TRUE if undefineds are an error
3940 * wantit TRUE if we actually want the result
3943 * The resulting string.
3946 * None. The old string must be freed by the caller
3947 *-----------------------------------------------------------------------
3950 Var_Subst(const char *var, const char *str, GNode *ctxt,
3951 Boolean undefErr, Boolean wantit)
3953 Buffer buf; /* Buffer for forming things */
3954 char *val; /* Value to substitute for a variable */
3955 int length; /* Length of the variable invocation */
3956 Boolean trailingBslash; /* variable ends in \ */
3957 void *freeIt = NULL; /* Set if it should be freed */
3958 static Boolean errorReported; /* Set true if an error has already
3959 * been reported to prevent a plethora
3960 * of messages when recursing */
3963 errorReported = FALSE;
3964 trailingBslash = FALSE;
3967 if (*str == '\n' && trailingBslash)
3968 Buf_AddByte(&buf, ' ');
3969 if (var == NULL && (*str == '$') && (str[1] == '$')) {
3971 * A dollar sign may be escaped either with another dollar sign.
3972 * In such a case, we skip over the escape character and store the
3973 * dollar sign into the buffer directly.
3976 Buf_AddByte(&buf, *str);
3978 } else if (*str != '$') {
3980 * Skip as many characters as possible -- either to the end of
3981 * the string or to the next dollar sign (variable invocation).
3985 for (cp = str++; *str != '$' && *str != '\0'; str++)
3987 Buf_AddBytes(&buf, str - cp, cp);
3992 if (str[1] == '\0') {
3993 /* A trailing $ is kind of a special case */
3994 Buf_AddByte(&buf, str[0]);
3997 } else if (str[1] != PROPEN && str[1] != BROPEN) {
3998 if (str[1] != *var || strlen(var) > 1) {
3999 Buf_AddBytes(&buf, 2, str);
4011 * Scan up to the end of the variable name.
4013 for (p = &str[2]; *p &&
4014 *p != ':' && *p != PRCLOSE && *p != BRCLOSE; p++)
4018 * A variable inside the variable. We cannot expand
4019 * the external variable yet, so we try again with
4023 Buf_AddBytes(&buf, p - str, str);
4028 if (strncmp(var, str + 2, p - str - 2) != 0 ||
4029 var[p - str - 2] != '\0') {
4031 * Not the variable we want to expand, scan
4032 * until the next variable
4034 for (;*p != '$' && *p != '\0'; p++)
4036 Buf_AddBytes(&buf, p - str, str);
4049 val = Var_Parse(str, ctxt, undefErr, wantit, &length, &freeIt);
4052 * When we come down here, val should either point to the
4053 * value of this variable, suitably modified, or be NULL.
4054 * Length should be the total length of the potential
4055 * variable invocation (from $ to end character...)
4057 if (val == var_Error || val == varNoError) {
4059 * If performing old-time variable substitution, skip over
4060 * the variable and continue with the substitution. Otherwise,
4061 * store the dollar sign and advance str so we continue with
4066 } else if (undefErr || val == var_Error) {
4068 * If variable is undefined, complain and skip the
4069 * variable. The complaint will stop us from doing anything
4070 * when the file is parsed.
4072 if (!errorReported) {
4073 Parse_Error(PARSE_FATAL,
4074 "Undefined variable \"%.*s\"",length,str);
4077 errorReported = TRUE;
4079 Buf_AddByte(&buf, *str);
4084 * We've now got a variable structure to store in. But first,
4085 * advance the string pointer.
4090 * Copy all the characters from the variable value straight
4091 * into the new string.
4093 length = strlen(val);
4094 Buf_AddBytes(&buf, length, val);
4095 trailingBslash = length > 0 && val[length - 1] == '\\';
4102 return Buf_DestroyCompact(&buf);
4106 *-----------------------------------------------------------------------
4108 * Return the tail from each of a list of words. Used to set the
4109 * System V local variables.
4112 * file Filename to modify
4115 * The resulting string.
4120 *-----------------------------------------------------------------------
4124 Var_GetTail(char *file)
4126 return(VarModify(file, VarTail, NULL));
4130 *-----------------------------------------------------------------------
4132 * Find the leading components of a (list of) filename(s).
4133 * XXX: VarHead does not replace foo by ., as (sun) System V make
4137 * file Filename to manipulate
4140 * The leading components.
4145 *-----------------------------------------------------------------------
4148 Var_GetHead(char *file)
4150 return(VarModify(file, VarHead, NULL));
4155 *-----------------------------------------------------------------------
4157 * Initialize the module
4163 * The VAR_CMD and VAR_GLOBAL contexts are created
4164 *-----------------------------------------------------------------------
4169 VAR_INTERNAL = Targ_NewGN("Internal");
4170 VAR_GLOBAL = Targ_NewGN("Global");
4171 VAR_CMD = Targ_NewGN("Command");
4182 /****************** PRINT DEBUGGING INFO *****************/
4184 VarPrintVar(void *vp)
4187 fprintf(debug_file, "%-16s = %s\n", v->name, Buf_GetAll(&v->val, NULL));
4191 *-----------------------------------------------------------------------
4193 * print all variables in a context
4194 *-----------------------------------------------------------------------
4197 Var_Dump(GNode *ctxt)
4202 for (h = Hash_EnumFirst(&ctxt->context, &search);
4204 h = Hash_EnumNext(&search)) {
4205 VarPrintVar(Hash_GetValue(h));