1 /* $NetBSD: var.c,v 1.173 2013/02/24 19:43:37 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.173 2013/02/24 19:43:37 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.173 2013/02/24 19:43:37 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>
132 #include <inttypes.h>
143 * This lets us tell if we have replaced the original environ
144 * (which we cannot free).
146 char **savedEnv = NULL;
149 * This is a harmless return value for Var_Parse that can be used by Var_Subst
150 * to determine if there was an error in parsing -- easier than returning
151 * a flag, as things outside this module don't give a hoot.
153 char var_Error[] = "";
156 * Similar to var_Error, but returned when the 'errnum' flag for Var_Parse is
157 * set false. Why not just use a constant? Well, gcc likes to condense
158 * identical string instances...
160 static char varNoError[] = "";
163 * Internally, variables are contained in four different contexts.
164 * 1) the environment. They may not be changed. If an environment
165 * variable is appended-to, the result is placed in the global
167 * 2) the global context. Variables set in the Makefile are located in
168 * the global context. It is the penultimate context searched when
170 * 3) the command-line context. All variables set on the command line
171 * are placed in this context. They are UNALTERABLE once placed here.
172 * 4) the local context. Each target has associated with it a context
173 * list. On this list are located the structures describing such
174 * local variables as $(@) and $(*)
175 * The four contexts are searched in the reverse order from which they are
178 GNode *VAR_GLOBAL; /* variables from the makefile */
179 GNode *VAR_CMD; /* variables defined on the command-line */
181 #define FIND_CMD 0x1 /* look in VAR_CMD when searching */
182 #define FIND_GLOBAL 0x2 /* look in VAR_GLOBAL as well */
183 #define FIND_ENV 0x4 /* look in the environment also */
186 char *name; /* the variable's name */
187 Buffer val; /* its value */
188 int flags; /* miscellaneous status flags */
189 #define VAR_IN_USE 1 /* Variable's value currently being used.
190 * Used to avoid recursion */
191 #define VAR_FROM_ENV 2 /* Variable comes from the environment */
192 #define VAR_JUNK 4 /* Variable is a junk variable that
193 * should be destroyed when done with
194 * it. Used by Var_Parse for undefined,
195 * modified variables */
196 #define VAR_KEEP 8 /* Variable is VAR_JUNK, but we found
197 * a use for it in some modifier and
198 * the value is therefore valid */
199 #define VAR_EXPORTED 16 /* Variable is exported */
200 #define VAR_REEXPORT 32 /* Indicate if var needs re-export.
201 * This would be true if it contains $'s
203 #define VAR_FROM_CMD 64 /* Variable came from command line */
207 * Exporting vars is expensive so skip it if we can
209 #define VAR_EXPORTED_NONE 0
210 #define VAR_EXPORTED_YES 1
211 #define VAR_EXPORTED_ALL 2
212 static int var_exportedVars = VAR_EXPORTED_NONE;
214 * We pass this to Var_Export when doing the initial export
215 * or after updating an exported var.
217 #define VAR_EXPORT_PARENT 1
219 /* Var*Pattern flags */
220 #define VAR_SUB_GLOBAL 0x01 /* Apply substitution globally */
221 #define VAR_SUB_ONE 0x02 /* Apply substitution to one word */
222 #define VAR_SUB_MATCHED 0x04 /* There was a match */
223 #define VAR_MATCH_START 0x08 /* Match at start of word */
224 #define VAR_MATCH_END 0x10 /* Match at end of word */
225 #define VAR_NOSUBST 0x20 /* don't expand vars in VarGetPattern */
228 #define VAR_NO_EXPORT 0x01 /* do not export */
232 * The following fields are set by Var_Parse() when it
233 * encounters modifiers that need to keep state for use by
234 * subsequent modifiers within the same variable expansion.
236 Byte varSpace; /* Word separator in expansions */
237 Boolean oneBigWord; /* TRUE if we will treat the variable as a
238 * single big word, even if it contains
239 * embedded spaces (as opposed to the
240 * usual behaviour of treating it as
241 * several space-separated words). */
244 /* struct passed as 'void *' to VarSubstitute() for ":S/lhs/rhs/",
245 * to VarSYSVMatch() for ":lhs=rhs". */
247 const char *lhs; /* String to match */
248 int leftLen; /* Length of string */
249 const char *rhs; /* Replacement string (w/ &'s removed) */
250 int rightLen; /* Length of replacement */
254 /* struct passed as 'void *' to VarLoopExpand() for ":@tvar@str@" */
256 GNode *ctxt; /* variable context */
257 char *tvar; /* name of temp var */
259 char *str; /* string to expand */
261 int errnum; /* errnum for not defined */
265 /* struct passed as 'void *' to VarRESubstitute() for ":C///" */
275 /* struct passed to VarSelectWords() for ":[start..end]" */
277 int start; /* first word to select */
278 int end; /* last word to select */
281 static Var *VarFind(const char *, GNode *, int);
282 static void VarAdd(const char *, const char *, GNode *);
283 static Boolean VarHead(GNode *, Var_Parse_State *,
284 char *, Boolean, Buffer *, void *);
285 static Boolean VarTail(GNode *, Var_Parse_State *,
286 char *, Boolean, Buffer *, void *);
287 static Boolean VarSuffix(GNode *, Var_Parse_State *,
288 char *, Boolean, Buffer *, void *);
289 static Boolean VarRoot(GNode *, Var_Parse_State *,
290 char *, Boolean, Buffer *, void *);
291 static Boolean VarMatch(GNode *, Var_Parse_State *,
292 char *, Boolean, Buffer *, void *);
294 static Boolean VarSYSVMatch(GNode *, Var_Parse_State *,
295 char *, Boolean, Buffer *, void *);
297 static Boolean VarNoMatch(GNode *, Var_Parse_State *,
298 char *, Boolean, Buffer *, void *);
300 static void VarREError(int, regex_t *, const char *);
301 static Boolean VarRESubstitute(GNode *, Var_Parse_State *,
302 char *, Boolean, Buffer *, void *);
304 static Boolean VarSubstitute(GNode *, Var_Parse_State *,
305 char *, Boolean, Buffer *, void *);
306 static Boolean VarLoopExpand(GNode *, Var_Parse_State *,
307 char *, Boolean, Buffer *, void *);
308 static char *VarGetPattern(GNode *, Var_Parse_State *,
309 int, const char **, int, int *, int *,
311 static char *VarQuote(char *);
312 static char *VarHash(char *);
313 static char *VarModify(GNode *, Var_Parse_State *,
315 Boolean (*)(GNode *, Var_Parse_State *, char *, Boolean, Buffer *, void *),
317 static char *VarOrder(const char *, const char);
318 static char *VarUniq(const char *);
319 static int VarWordCompare(const void *, const void *);
320 static void VarPrintVar(void *);
328 *-----------------------------------------------------------------------
330 * Find the given variable in the given context and any other contexts
335 * ctxt context in which to find it
336 * flags FIND_GLOBAL set means to look in the
337 * VAR_GLOBAL context as well. FIND_CMD set means
338 * to look in the VAR_CMD context also. FIND_ENV
339 * set means to look in the environment
342 * A pointer to the structure describing the desired variable or
343 * NULL if the variable does not exist.
347 *-----------------------------------------------------------------------
350 VarFind(const char *name, GNode *ctxt, int flags)
356 * If the variable name begins with a '.', it could very well be one of
357 * the local ones. We check the name against all the local variables
358 * and substitute the short version in for 'name' if it matches one of
361 if (*name == '.' && isupper((unsigned char) name[1]))
364 if (!strcmp(name, ".ALLSRC"))
366 if (!strcmp(name, ".ARCHIVE"))
370 if (!strcmp(name, ".IMPSRC"))
374 if (!strcmp(name, ".MEMBER"))
378 if (!strcmp(name, ".OODATE"))
382 if (!strcmp(name, ".PREFIX"))
386 if (!strcmp(name, ".TARGET"))
391 /* for compatibility with gmake */
392 if (name[0] == '^' && name[1] == '\0')
397 * First look for the variable in the given context. If it's not there,
398 * look for it in VAR_CMD, VAR_GLOBAL and the environment, in that order,
399 * depending on the FIND_* flags in 'flags'
401 var = Hash_FindEntry(&ctxt->context, name);
403 if ((var == NULL) && (flags & FIND_CMD) && (ctxt != VAR_CMD)) {
404 var = Hash_FindEntry(&VAR_CMD->context, name);
406 if (!checkEnvFirst && (var == NULL) && (flags & FIND_GLOBAL) &&
407 (ctxt != VAR_GLOBAL))
409 var = Hash_FindEntry(&VAR_GLOBAL->context, name);
411 if ((var == NULL) && (flags & FIND_ENV)) {
414 if ((env = getenv(name)) != NULL) {
417 v = bmake_malloc(sizeof(Var));
418 v->name = bmake_strdup(name);
422 Buf_Init(&v->val, len + 1);
423 Buf_AddBytes(&v->val, len, env);
425 v->flags = VAR_FROM_ENV;
427 } else if (checkEnvFirst && (flags & FIND_GLOBAL) &&
428 (ctxt != VAR_GLOBAL))
430 var = Hash_FindEntry(&VAR_GLOBAL->context, name);
434 return ((Var *)Hash_GetValue(var));
439 } else if (var == NULL) {
442 return ((Var *)Hash_GetValue(var));
447 *-----------------------------------------------------------------------
449 * If the variable is an environment variable, free it
453 * destroy true if the value buffer should be destroyed.
456 * 1 if it is an environment variable 0 ow.
459 * The variable is free'ed if it is an environent variable.
460 *-----------------------------------------------------------------------
463 VarFreeEnv(Var *v, Boolean destroy)
465 if ((v->flags & VAR_FROM_ENV) == 0)
468 Buf_Destroy(&v->val, destroy);
474 *-----------------------------------------------------------------------
476 * Add a new variable of name name and value val to the given context
479 * name name of variable to add
480 * val value to set it to
481 * ctxt context in which to set it
487 * The new variable is placed at the front of the given context
488 * The name and val arguments are duplicated so they may
490 *-----------------------------------------------------------------------
493 VarAdd(const char *name, const char *val, GNode *ctxt)
499 v = bmake_malloc(sizeof(Var));
501 len = val ? strlen(val) : 0;
502 Buf_Init(&v->val, len+1);
503 Buf_AddBytes(&v->val, len, val);
507 h = Hash_CreateEntry(&ctxt->context, name, NULL);
511 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
516 *-----------------------------------------------------------------------
518 * Remove a variable from a context.
524 * The Var structure is removed and freed.
526 *-----------------------------------------------------------------------
529 Var_Delete(const char *name, GNode *ctxt)
533 ln = Hash_FindEntry(&ctxt->context, name);
535 fprintf(debug_file, "%s:delete %s%s\n",
536 ctxt->name, name, ln ? "" : " (not found)");
541 v = (Var *)Hash_GetValue(ln);
542 if ((v->flags & VAR_EXPORTED)) {
545 if (strcmp(MAKE_EXPORTED, v->name) == 0) {
546 var_exportedVars = VAR_EXPORTED_NONE;
548 if (v->name != ln->name)
550 Hash_DeleteEntry(&ctxt->context, ln);
551 Buf_Destroy(&v->val, TRUE);
559 * We ignore make internal variables (those which start with '.')
560 * Also we jump through some hoops to avoid calling setenv
561 * more than necessary since it can leak.
562 * We only manipulate flags of vars if 'parent' is set.
565 Var_Export1(const char *name, int parent)
573 return 0; /* skip internals */
577 * If it is one of the vars that should only appear in
578 * local context, skip it, else we can get Var_Subst
589 v = VarFind(name, VAR_GLOBAL, 0);
594 (v->flags & (VAR_EXPORTED|VAR_REEXPORT)) == VAR_EXPORTED) {
595 return 0; /* nothing to do */
597 val = Buf_GetAll(&v->val, NULL);
598 if (strchr(val, '$')) {
601 * Flag this as something we need to re-export.
602 * No point actually exporting it now though,
603 * the child can do it at the last minute.
605 v->flags |= (VAR_EXPORTED|VAR_REEXPORT);
608 if (v->flags & VAR_IN_USE) {
610 * We recursed while exporting in a child.
611 * This isn't going to end well, just skip it.
615 n = snprintf(tmp, sizeof(tmp), "${%s}", name);
616 if (n < (int)sizeof(tmp)) {
617 val = Var_Subst(NULL, tmp, VAR_GLOBAL, 0);
618 setenv(name, val, 1);
623 v->flags &= ~VAR_REEXPORT; /* once will do */
625 if (parent || !(v->flags & VAR_EXPORTED)) {
626 setenv(name, val, 1);
630 * This is so Var_Set knows to call Var_Export again...
633 v->flags |= VAR_EXPORTED;
639 * This gets called from our children.
651 if (VAR_EXPORTED_NONE == var_exportedVars)
654 if (VAR_EXPORTED_ALL == var_exportedVars) {
656 * Ouch! This is crazy...
658 for (var = Hash_EnumFirst(&VAR_GLOBAL->context, &state);
660 var = Hash_EnumNext(&state)) {
661 v = (Var *)Hash_GetValue(var);
662 Var_Export1(v->name, 0);
667 * We have a number of exported vars,
669 n = snprintf(tmp, sizeof(tmp), "${" MAKE_EXPORTED ":O:u}");
670 if (n < (int)sizeof(tmp)) {
676 val = Var_Subst(NULL, tmp, VAR_GLOBAL, 0);
677 av = brk_string(val, &ac, FALSE, &as);
678 for (i = 0; i < ac; i++) {
679 Var_Export1(av[i], 0);
688 * This is called when .export is seen or
689 * .MAKE.EXPORTED is modified.
690 * It is also called when any exported var is modified.
693 Var_Export(char *str, int isExport)
703 if (isExport && (!str || !str[0])) {
704 var_exportedVars = VAR_EXPORTED_ALL; /* use with caution! */
708 if (strncmp(str, "-env", 4) == 0) {
712 track = VAR_EXPORT_PARENT;
714 val = Var_Subst(NULL, str, VAR_GLOBAL, 0);
715 av = brk_string(val, &ac, FALSE, &as);
716 for (i = 0; i < ac; i++) {
721 * If it is one of the vars that should only appear in
722 * local context, skip it, else we can get Var_Subst
733 if (Var_Export1(name, track)) {
734 if (VAR_EXPORTED_ALL != var_exportedVars)
735 var_exportedVars = VAR_EXPORTED_YES;
736 if (isExport && track) {
737 Var_Append(MAKE_EXPORTED, name, VAR_GLOBAL);
748 * This is called when .unexport[-env] is seen.
750 extern char **environ;
753 Var_UnExport(char *str)
758 Boolean unexport_env;
761 if (!str || !str[0]) {
762 return; /* assert? */
768 unexport_env = (strncmp(str, "-env", 4) == 0);
772 cp = getenv(MAKE_LEVEL); /* we should preserve this */
773 if (environ == savedEnv) {
774 /* we have been here before! */
775 newenv = bmake_realloc(environ, 2 * sizeof(char *));
781 newenv = bmake_malloc(2 * sizeof(char *));
785 /* Note: we cannot safely free() the original environ. */
786 environ = savedEnv = newenv;
789 setenv(MAKE_LEVEL, cp, 1);
790 #ifdef MAKE_LEVEL_SAFE
791 setenv(MAKE_LEVEL_SAFE, cp, 1);
794 for (; *str != '\n' && isspace((unsigned char) *str); str++)
796 if (str[0] && str[0] != '\n') {
802 /* Using .MAKE.EXPORTED */
803 n = snprintf(tmp, sizeof(tmp), "${" MAKE_EXPORTED ":O:u}");
804 if (n < (int)sizeof(tmp)) {
805 vlist = Var_Subst(NULL, tmp, VAR_GLOBAL, 0);
815 av = brk_string(vlist, &ac, FALSE, &as);
816 for (i = 0; i < ac; i++) {
817 v = VarFind(av[i], VAR_GLOBAL, 0);
821 (v->flags & (VAR_EXPORTED|VAR_REEXPORT)) == VAR_EXPORTED) {
824 v->flags &= ~(VAR_EXPORTED|VAR_REEXPORT);
826 * If we are unexporting a list,
827 * remove each one from .MAKE.EXPORTED.
828 * If we are removing them all,
829 * just delete .MAKE.EXPORTED below.
832 n = snprintf(tmp, sizeof(tmp),
833 "${" MAKE_EXPORTED ":N%s}", v->name);
834 if (n < (int)sizeof(tmp)) {
835 cp = Var_Subst(NULL, tmp, VAR_GLOBAL, 0);
836 Var_Set(MAKE_EXPORTED, cp, VAR_GLOBAL, 0);
844 Var_Delete(MAKE_EXPORTED, VAR_GLOBAL);
851 *-----------------------------------------------------------------------
853 * Set the variable name to the value val in the given context.
856 * name name of variable to set
857 * val value to give to the variable
858 * ctxt context in which to set it
864 * If the variable doesn't yet exist, a new record is created for it.
865 * Else the old value is freed and the new one stuck in its place
868 * The variable is searched for only in its context before being
869 * created in that context. I.e. if the context is VAR_GLOBAL,
870 * only VAR_GLOBAL->context is searched. Likewise if it is VAR_CMD, only
871 * VAR_CMD->context is searched. This is done to avoid the literally
872 * thousands of unnecessary strcmp's that used to be done to
873 * set, say, $(@) or $(<).
874 * If the context is VAR_GLOBAL though, we check if the variable
875 * was set in VAR_CMD from the command line and skip it if so.
876 *-----------------------------------------------------------------------
879 Var_Set(const char *name, const char *val, GNode *ctxt, int flags)
882 char *expanded_name = NULL;
885 * We only look for a variable in the given context since anything set
886 * here will override anything in a lower context, so there's not much
887 * point in searching them all just to save a bit of memory...
889 if (strchr(name, '$') != NULL) {
890 expanded_name = Var_Subst(NULL, name, ctxt, 0);
891 if (expanded_name[0] == 0) {
893 fprintf(debug_file, "Var_Set(\"%s\", \"%s\", ...) "
894 "name expands to empty string - ignored\n",
900 name = expanded_name;
902 if (ctxt == VAR_GLOBAL) {
903 v = VarFind(name, VAR_CMD, 0);
905 if ((v->flags & VAR_FROM_CMD)) {
907 fprintf(debug_file, "%s:%s = %s ignored!\n", ctxt->name, name, val);
914 v = VarFind(name, ctxt, 0);
916 VarAdd(name, val, ctxt);
919 Buf_AddBytes(&v->val, strlen(val), val);
922 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
924 if ((v->flags & VAR_EXPORTED)) {
925 Var_Export1(name, VAR_EXPORT_PARENT);
929 * Any variables given on the command line are automatically exported
930 * to the environment (as per POSIX standard)
932 if (ctxt == VAR_CMD && (flags & VAR_NO_EXPORT) == 0) {
934 /* we just added it */
935 v = VarFind(name, ctxt, 0);
938 v->flags |= VAR_FROM_CMD;
940 * If requested, don't export these in the environment
941 * individually. We still put them in MAKEOVERRIDES so
942 * that the command-line settings continue to override
945 if (varNoExportEnv != TRUE)
946 setenv(name, val, 1);
948 Var_Append(MAKEOVERRIDES, name, VAR_GLOBAL);
951 * Another special case.
952 * Several make's support this sort of mechanism for tracking
953 * recursion - but each uses a different name.
954 * We allow the makefiles to update .MAKE.LEVEL and ensure
955 * children see a correctly incremented value.
957 if (ctxt == VAR_GLOBAL && strcmp(MAKE_LEVEL, name) == 0) {
962 snprintf(tmp, sizeof(tmp), "%u", level + 1);
963 setenv(MAKE_LEVEL, tmp, 1);
964 #ifdef MAKE_LEVEL_SAFE
965 setenv(MAKE_LEVEL_SAFE, tmp, 1);
971 if (expanded_name != NULL)
978 *-----------------------------------------------------------------------
980 * The variable of the given name has the given value appended to it in
984 * name name of variable to modify
985 * val String to append to it
986 * ctxt Context in which this should occur
992 * If the variable doesn't exist, it is created. Else the strings
993 * are concatenated (with a space in between).
996 * Only if the variable is being sought in the global context is the
997 * environment searched.
998 * XXX: Knows its calling circumstances in that if called with ctxt
999 * an actual target, it will only search that context since only
1000 * a local variable could be being appended to. This is actually
1001 * a big win and must be tolerated.
1002 *-----------------------------------------------------------------------
1005 Var_Append(const char *name, const char *val, GNode *ctxt)
1009 char *expanded_name = NULL;
1011 if (strchr(name, '$') != NULL) {
1012 expanded_name = Var_Subst(NULL, name, ctxt, 0);
1013 if (expanded_name[0] == 0) {
1015 fprintf(debug_file, "Var_Append(\"%s\", \"%s\", ...) "
1016 "name expands to empty string - ignored\n",
1019 free(expanded_name);
1022 name = expanded_name;
1025 v = VarFind(name, ctxt, (ctxt == VAR_GLOBAL) ? FIND_ENV : 0);
1028 VarAdd(name, val, ctxt);
1030 Buf_AddByte(&v->val, ' ');
1031 Buf_AddBytes(&v->val, strlen(val), val);
1034 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name,
1035 Buf_GetAll(&v->val, NULL));
1038 if (v->flags & VAR_FROM_ENV) {
1040 * If the original variable came from the environment, we
1041 * have to install it in the global context (we could place
1042 * it in the environment, but then we should provide a way to
1043 * export other variables...)
1045 v->flags &= ~VAR_FROM_ENV;
1046 h = Hash_CreateEntry(&ctxt->context, name, NULL);
1047 Hash_SetValue(h, v);
1050 if (expanded_name != NULL)
1051 free(expanded_name);
1055 *-----------------------------------------------------------------------
1057 * See if the given variable exists.
1060 * name Variable to find
1061 * ctxt Context in which to start search
1064 * TRUE if it does, FALSE if it doesn't
1069 *-----------------------------------------------------------------------
1072 Var_Exists(const char *name, GNode *ctxt)
1077 if ((cp = strchr(name, '$')) != NULL) {
1078 cp = Var_Subst(NULL, name, ctxt, FALSE);
1080 v = VarFind(cp ? cp : name, ctxt, FIND_CMD|FIND_GLOBAL|FIND_ENV);
1087 (void)VarFreeEnv(v, TRUE);
1093 *-----------------------------------------------------------------------
1095 * Return the value of the named variable in the given context
1099 * ctxt context in which to search for it
1102 * The value if the variable exists, NULL if it doesn't
1106 *-----------------------------------------------------------------------
1109 Var_Value(const char *name, GNode *ctxt, char **frp)
1113 v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
1116 char *p = (Buf_GetAll(&v->val, NULL));
1117 if (VarFreeEnv(v, FALSE))
1126 *-----------------------------------------------------------------------
1128 * Remove the tail of the given word and place the result in the given
1133 * addSpace True if need to add a space to the buffer
1134 * before sticking in the head
1135 * buf Buffer in which to store it
1138 * TRUE if characters were added to the buffer (a space needs to be
1139 * added to the buffer before the next word).
1142 * The trimmed word is added to the buffer.
1144 *-----------------------------------------------------------------------
1147 VarHead(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1148 char *word, Boolean addSpace, Buffer *buf,
1153 slash = strrchr(word, '/');
1154 if (slash != NULL) {
1155 if (addSpace && vpstate->varSpace) {
1156 Buf_AddByte(buf, vpstate->varSpace);
1159 Buf_AddBytes(buf, strlen(word), word);
1164 * If no directory part, give . (q.v. the POSIX standard)
1166 if (addSpace && vpstate->varSpace)
1167 Buf_AddByte(buf, vpstate->varSpace);
1168 Buf_AddByte(buf, '.');
1170 return(dummy ? TRUE : TRUE);
1174 *-----------------------------------------------------------------------
1176 * Remove the head of the given word and place the result in the given
1181 * addSpace True if need to add a space to the buffer
1182 * before adding the tail
1183 * buf Buffer in which to store it
1186 * TRUE if characters were added to the buffer (a space needs to be
1187 * added to the buffer before the next word).
1190 * The trimmed word is added to the buffer.
1192 *-----------------------------------------------------------------------
1195 VarTail(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1196 char *word, Boolean addSpace, Buffer *buf,
1201 if (addSpace && vpstate->varSpace) {
1202 Buf_AddByte(buf, vpstate->varSpace);
1205 slash = strrchr(word, '/');
1206 if (slash != NULL) {
1208 Buf_AddBytes(buf, strlen(slash), slash);
1211 Buf_AddBytes(buf, strlen(word), word);
1213 return (dummy ? TRUE : TRUE);
1217 *-----------------------------------------------------------------------
1219 * Place the suffix of the given word in the given buffer.
1223 * addSpace TRUE if need to add a space before placing the
1224 * suffix in the buffer
1225 * buf Buffer in which to store it
1228 * TRUE if characters were added to the buffer (a space needs to be
1229 * added to the buffer before the next word).
1232 * The suffix from the word is placed in the buffer.
1234 *-----------------------------------------------------------------------
1237 VarSuffix(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1238 char *word, Boolean addSpace, Buffer *buf,
1243 dot = strrchr(word, '.');
1245 if (addSpace && vpstate->varSpace) {
1246 Buf_AddByte(buf, vpstate->varSpace);
1249 Buf_AddBytes(buf, strlen(dot), dot);
1253 return (dummy ? addSpace : addSpace);
1257 *-----------------------------------------------------------------------
1259 * Remove the suffix of the given word and place the result in the
1264 * addSpace TRUE if need to add a space to the buffer
1265 * before placing the root in it
1266 * buf Buffer in which to store it
1269 * TRUE if characters were added to the buffer (a space needs to be
1270 * added to the buffer before the next word).
1273 * The trimmed word is added to the buffer.
1275 *-----------------------------------------------------------------------
1278 VarRoot(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1279 char *word, Boolean addSpace, Buffer *buf,
1284 if (addSpace && vpstate->varSpace) {
1285 Buf_AddByte(buf, vpstate->varSpace);
1288 dot = strrchr(word, '.');
1291 Buf_AddBytes(buf, strlen(word), word);
1294 Buf_AddBytes(buf, strlen(word), word);
1296 return (dummy ? TRUE : TRUE);
1300 *-----------------------------------------------------------------------
1302 * Place the word in the buffer if it matches the given pattern.
1303 * Callback function for VarModify to implement the :M modifier.
1306 * word Word to examine
1307 * addSpace TRUE if need to add a space to the buffer
1308 * before adding the word, if it matches
1309 * buf Buffer in which to store it
1310 * pattern Pattern the word must match
1313 * TRUE if a space should be placed in the buffer before the next
1317 * The word may be copied to the buffer.
1319 *-----------------------------------------------------------------------
1322 VarMatch(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1323 char *word, Boolean addSpace, Buffer *buf,
1327 fprintf(debug_file, "VarMatch [%s] [%s]\n", word, (char *)pattern);
1328 if (Str_Match(word, (char *)pattern)) {
1329 if (addSpace && vpstate->varSpace) {
1330 Buf_AddByte(buf, vpstate->varSpace);
1333 Buf_AddBytes(buf, strlen(word), word);
1340 *-----------------------------------------------------------------------
1342 * Place the word in the buffer if it matches the given pattern.
1343 * Callback function for VarModify to implement the System V %
1347 * word Word to examine
1348 * addSpace TRUE if need to add a space to the buffer
1349 * before adding the word, if it matches
1350 * buf Buffer in which to store it
1351 * patp Pattern the word must match
1354 * TRUE if a space should be placed in the buffer before the next
1358 * The word may be copied to the buffer.
1360 *-----------------------------------------------------------------------
1363 VarSYSVMatch(GNode *ctx, Var_Parse_State *vpstate,
1364 char *word, Boolean addSpace, Buffer *buf,
1369 VarPattern *pat = (VarPattern *)patp;
1372 if (addSpace && vpstate->varSpace)
1373 Buf_AddByte(buf, vpstate->varSpace);
1377 if ((ptr = Str_SYSVMatch(word, pat->lhs, &len)) != NULL) {
1378 varexp = Var_Subst(NULL, pat->rhs, ctx, 0);
1379 Str_SYSVSubst(buf, varexp, ptr, len);
1382 Buf_AddBytes(buf, strlen(word), word);
1391 *-----------------------------------------------------------------------
1393 * Place the word in the buffer if it doesn't match the given pattern.
1394 * Callback function for VarModify to implement the :N modifier.
1397 * word Word to examine
1398 * addSpace TRUE if need to add a space to the buffer
1399 * before adding the word, if it matches
1400 * buf Buffer in which to store it
1401 * pattern Pattern the word must match
1404 * TRUE if a space should be placed in the buffer before the next
1408 * The word may be copied to the buffer.
1410 *-----------------------------------------------------------------------
1413 VarNoMatch(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1414 char *word, Boolean addSpace, Buffer *buf,
1417 if (!Str_Match(word, (char *)pattern)) {
1418 if (addSpace && vpstate->varSpace) {
1419 Buf_AddByte(buf, vpstate->varSpace);
1422 Buf_AddBytes(buf, strlen(word), word);
1429 *-----------------------------------------------------------------------
1431 * Perform a string-substitution on the given word, placing the
1432 * result in the passed buffer.
1435 * word Word to modify
1436 * addSpace True if space should be added before
1438 * buf Buffer for result
1439 * patternp Pattern for substitution
1442 * TRUE if a space is needed before more characters are added.
1447 *-----------------------------------------------------------------------
1450 VarSubstitute(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1451 char *word, Boolean addSpace, Buffer *buf,
1454 int wordLen; /* Length of word */
1455 char *cp; /* General pointer */
1456 VarPattern *pattern = (VarPattern *)patternp;
1458 wordLen = strlen(word);
1459 if ((pattern->flags & (VAR_SUB_ONE|VAR_SUB_MATCHED)) !=
1460 (VAR_SUB_ONE|VAR_SUB_MATCHED)) {
1462 * Still substituting -- break it down into simple anchored cases
1463 * and if none of them fits, perform the general substitution case.
1465 if ((pattern->flags & VAR_MATCH_START) &&
1466 (strncmp(word, pattern->lhs, pattern->leftLen) == 0)) {
1468 * Anchored at start and beginning of word matches pattern
1470 if ((pattern->flags & VAR_MATCH_END) &&
1471 (wordLen == pattern->leftLen)) {
1473 * Also anchored at end and matches to the end (word
1474 * is same length as pattern) add space and rhs only
1475 * if rhs is non-null.
1477 if (pattern->rightLen != 0) {
1478 if (addSpace && vpstate->varSpace) {
1479 Buf_AddByte(buf, vpstate->varSpace);
1482 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1484 pattern->flags |= VAR_SUB_MATCHED;
1485 } else if (pattern->flags & VAR_MATCH_END) {
1487 * Doesn't match to end -- copy word wholesale
1492 * Matches at start but need to copy in trailing characters
1494 if ((pattern->rightLen + wordLen - pattern->leftLen) != 0){
1495 if (addSpace && vpstate->varSpace) {
1496 Buf_AddByte(buf, vpstate->varSpace);
1500 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1501 Buf_AddBytes(buf, wordLen - pattern->leftLen,
1502 (word + pattern->leftLen));
1503 pattern->flags |= VAR_SUB_MATCHED;
1505 } else if (pattern->flags & VAR_MATCH_START) {
1507 * Had to match at start of word and didn't -- copy whole word.
1510 } else if (pattern->flags & VAR_MATCH_END) {
1512 * Anchored at end, Find only place match could occur (leftLen
1513 * characters from the end of the word) and see if it does. Note
1514 * that because the $ will be left at the end of the lhs, we have
1517 cp = word + (wordLen - pattern->leftLen);
1519 (strncmp(cp, pattern->lhs, pattern->leftLen) == 0)) {
1521 * Match found. If we will place characters in the buffer,
1522 * add a space before hand as indicated by addSpace, then
1523 * stuff in the initial, unmatched part of the word followed
1524 * by the right-hand-side.
1526 if (((cp - word) + pattern->rightLen) != 0) {
1527 if (addSpace && vpstate->varSpace) {
1528 Buf_AddByte(buf, vpstate->varSpace);
1532 Buf_AddBytes(buf, cp - word, word);
1533 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1534 pattern->flags |= VAR_SUB_MATCHED;
1537 * Had to match at end and didn't. Copy entire word.
1543 * Pattern is unanchored: search for the pattern in the word using
1544 * String_FindSubstring, copying unmatched portions and the
1545 * right-hand-side for each match found, handling non-global
1546 * substitutions correctly, etc. When the loop is done, any
1547 * remaining part of the word (word and wordLen are adjusted
1548 * accordingly through the loop) is copied straight into the
1550 * addSpace is set FALSE as soon as a space is added to the
1557 origSize = Buf_Size(buf);
1559 cp = Str_FindSubstring(word, pattern->lhs);
1561 if (addSpace && (((cp - word) + pattern->rightLen) != 0)){
1562 Buf_AddByte(buf, vpstate->varSpace);
1565 Buf_AddBytes(buf, cp-word, word);
1566 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1567 wordLen -= (cp - word) + pattern->leftLen;
1568 word = cp + pattern->leftLen;
1572 if ((pattern->flags & VAR_SUB_GLOBAL) == 0) {
1575 pattern->flags |= VAR_SUB_MATCHED;
1581 if (addSpace && vpstate->varSpace) {
1582 Buf_AddByte(buf, vpstate->varSpace);
1584 Buf_AddBytes(buf, wordLen, word);
1587 * If added characters to the buffer, need to add a space
1588 * before we add any more. If we didn't add any, just return
1589 * the previous value of addSpace.
1591 return ((Buf_Size(buf) != origSize) || addSpace);
1596 if (addSpace && vpstate->varSpace) {
1597 Buf_AddByte(buf, vpstate->varSpace);
1599 Buf_AddBytes(buf, wordLen, word);
1605 *-----------------------------------------------------------------------
1607 * Print the error caused by a regcomp or regexec call.
1613 * An error gets printed.
1615 *-----------------------------------------------------------------------
1618 VarREError(int errnum, regex_t *pat, const char *str)
1623 errlen = regerror(errnum, pat, 0, 0);
1624 errbuf = bmake_malloc(errlen);
1625 regerror(errnum, pat, errbuf, errlen);
1626 Error("%s: %s", str, errbuf);
1632 *-----------------------------------------------------------------------
1633 * VarRESubstitute --
1634 * Perform a regex substitution on the given word, placing the
1635 * result in the passed buffer.
1638 * TRUE if a space is needed before more characters are added.
1643 *-----------------------------------------------------------------------
1646 VarRESubstitute(GNode *ctx MAKE_ATTR_UNUSED,
1647 Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
1648 char *word, Boolean addSpace, Buffer *buf,
1658 #define MAYBE_ADD_SPACE() \
1659 if (addSpace && !added) \
1660 Buf_AddByte(buf, ' '); \
1667 if ((pat->flags & (VAR_SUB_ONE|VAR_SUB_MATCHED)) ==
1668 (VAR_SUB_ONE|VAR_SUB_MATCHED))
1672 xrv = regexec(&pat->re, wp, pat->nsub, pat->matches, flags);
1677 pat->flags |= VAR_SUB_MATCHED;
1678 if (pat->matches[0].rm_so > 0) {
1680 Buf_AddBytes(buf, pat->matches[0].rm_so, wp);
1683 for (rp = pat->replace; *rp; rp++) {
1684 if ((*rp == '\\') && ((rp[1] == '&') || (rp[1] == '\\'))) {
1686 Buf_AddByte(buf,rp[1]);
1689 else if ((*rp == '&') ||
1690 ((*rp == '\\') && isdigit((unsigned char)rp[1]))) {
1708 if (n > pat->nsub) {
1709 Error("No subexpression %s", &errstr[0]);
1712 } else if ((pat->matches[n].rm_so == -1) &&
1713 (pat->matches[n].rm_eo == -1)) {
1714 Error("No match for subexpression %s", &errstr[0]);
1718 subbuf = wp + pat->matches[n].rm_so;
1719 sublen = pat->matches[n].rm_eo - pat->matches[n].rm_so;
1724 Buf_AddBytes(buf, sublen, subbuf);
1728 Buf_AddByte(buf, *rp);
1731 wp += pat->matches[0].rm_eo;
1732 if (pat->flags & VAR_SUB_GLOBAL) {
1733 flags |= REG_NOTBOL;
1734 if (pat->matches[0].rm_so == 0 && pat->matches[0].rm_eo == 0) {
1736 Buf_AddByte(buf, *wp);
1745 Buf_AddBytes(buf, strlen(wp), wp);
1749 VarREError(xrv, &pat->re, "Unexpected regex error");
1754 Buf_AddBytes(buf,strlen(wp),wp);
1758 return(addSpace||added);
1765 *-----------------------------------------------------------------------
1767 * Implements the :@<temp>@<string>@ modifier of ODE make.
1768 * We set the temp variable named in pattern.lhs to word and expand
1769 * pattern.rhs storing the result in the passed buffer.
1772 * word Word to modify
1773 * addSpace True if space should be added before
1775 * buf Buffer for result
1776 * pattern Datafor substitution
1779 * TRUE if a space is needed before more characters are added.
1784 *-----------------------------------------------------------------------
1787 VarLoopExpand(GNode *ctx MAKE_ATTR_UNUSED,
1788 Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
1789 char *word, Boolean addSpace, Buffer *buf,
1792 VarLoop_t *loop = (VarLoop_t *)loopp;
1796 if (word && *word) {
1797 Var_Set(loop->tvar, word, loop->ctxt, VAR_NO_EXPORT);
1798 s = Var_Subst(NULL, loop->str, loop->ctxt, loop->errnum);
1799 if (s != NULL && *s != '\0') {
1800 if (addSpace && *s != '\n')
1801 Buf_AddByte(buf, ' ');
1802 Buf_AddBytes(buf, (slen = strlen(s)), s);
1803 addSpace = (slen > 0 && s[slen - 1] != '\n');
1812 *-----------------------------------------------------------------------
1814 * Implements the :[start..end] modifier.
1815 * This is a special case of VarModify since we want to be able
1816 * to scan the list backwards if start > end.
1819 * str String whose words should be trimmed
1820 * seldata words to select
1823 * A string of all the words selected.
1828 *-----------------------------------------------------------------------
1831 VarSelectWords(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1832 const char *str, VarSelectWords_t *seldata)
1834 Buffer buf; /* Buffer for the new string */
1835 Boolean addSpace; /* TRUE if need to add a space to the
1836 * buffer before adding the trimmed
1838 char **av; /* word list */
1839 char *as; /* word list memory */
1841 int start, end, step;
1846 if (vpstate->oneBigWord) {
1847 /* fake what brk_string() would do if there were only one word */
1849 av = bmake_malloc((ac + 1) * sizeof(char *));
1850 as = bmake_strdup(str);
1854 av = brk_string(str, &ac, FALSE, &as);
1858 * Now sanitize seldata.
1859 * If seldata->start or seldata->end are negative, convert them to
1860 * the positive equivalents (-1 gets converted to argc, -2 gets
1861 * converted to (argc-1), etc.).
1863 if (seldata->start < 0)
1864 seldata->start = ac + seldata->start + 1;
1865 if (seldata->end < 0)
1866 seldata->end = ac + seldata->end + 1;
1869 * We avoid scanning more of the list than we need to.
1871 if (seldata->start > seldata->end) {
1872 start = MIN(ac, seldata->start) - 1;
1873 end = MAX(0, seldata->end - 1);
1876 start = MAX(0, seldata->start - 1);
1877 end = MIN(ac, seldata->end);
1882 (step < 0 && i >= end) || (step > 0 && i < end);
1884 if (av[i] && *av[i]) {
1885 if (addSpace && vpstate->varSpace) {
1886 Buf_AddByte(&buf, vpstate->varSpace);
1888 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
1896 return Buf_Destroy(&buf, FALSE);
1902 * Replace each word with the result of realpath()
1906 VarRealpath(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1907 char *word, Boolean addSpace, Buffer *buf,
1908 void *patternp MAKE_ATTR_UNUSED)
1911 char rbuf[MAXPATHLEN];
1914 if (addSpace && vpstate->varSpace) {
1915 Buf_AddByte(buf, vpstate->varSpace);
1918 rp = realpath(word, rbuf);
1919 if (rp && *rp == '/' && stat(rp, &st) == 0)
1922 Buf_AddBytes(buf, strlen(word), word);
1927 *-----------------------------------------------------------------------
1929 * Modify each of the words of the passed string using the given
1930 * function. Used to implement all modifiers.
1933 * str String whose words should be trimmed
1934 * modProc Function to use to modify them
1935 * datum Datum to pass it
1938 * A string of all the words modified appropriately.
1943 *-----------------------------------------------------------------------
1946 VarModify(GNode *ctx, Var_Parse_State *vpstate,
1948 Boolean (*modProc)(GNode *, Var_Parse_State *, char *,
1949 Boolean, Buffer *, void *),
1952 Buffer buf; /* Buffer for the new string */
1953 Boolean addSpace; /* TRUE if need to add a space to the
1954 * buffer before adding the trimmed
1956 char **av; /* word list */
1957 char *as; /* word list memory */
1963 if (vpstate->oneBigWord) {
1964 /* fake what brk_string() would do if there were only one word */
1966 av = bmake_malloc((ac + 1) * sizeof(char *));
1967 as = bmake_strdup(str);
1971 av = brk_string(str, &ac, FALSE, &as);
1974 for (i = 0; i < ac; i++) {
1975 addSpace = (*modProc)(ctx, vpstate, av[i], addSpace, &buf, datum);
1981 return Buf_Destroy(&buf, FALSE);
1986 VarWordCompare(const void *a, const void *b)
1988 int r = strcmp(*(const char * const *)a, *(const char * const *)b);
1993 *-----------------------------------------------------------------------
1995 * Order the words in the string.
1998 * str String whose words should be sorted.
1999 * otype How to order: s - sort, x - random.
2002 * A string containing the words ordered.
2007 *-----------------------------------------------------------------------
2010 VarOrder(const char *str, const char otype)
2012 Buffer buf; /* Buffer for the new string */
2013 char **av; /* word list [first word does not count] */
2014 char *as; /* word list memory */
2019 av = brk_string(str, &ac, FALSE, &as);
2023 case 's': /* sort alphabetically */
2024 qsort(av, ac, sizeof(char *), VarWordCompare);
2026 case 'x': /* randomize */
2032 * We will use [ac..2] range for mod factors. This will produce
2033 * random numbers in [(ac-1)..0] interval, and minimal
2034 * reasonable value for mod factor is 2 (the mod 1 will produce
2035 * 0 with probability 1).
2037 for (i = ac-1; i > 0; i--) {
2038 rndidx = random() % (i + 1);
2046 } /* end of switch */
2048 for (i = 0; i < ac; i++) {
2049 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
2051 Buf_AddByte(&buf, ' ');
2057 return Buf_Destroy(&buf, FALSE);
2062 *-----------------------------------------------------------------------
2064 * Remove adjacent duplicate words.
2067 * str String whose words should be sorted
2070 * A string containing the resulting words.
2075 *-----------------------------------------------------------------------
2078 VarUniq(const char *str)
2080 Buffer buf; /* Buffer for new string */
2081 char **av; /* List of words to affect */
2082 char *as; /* Word list memory */
2086 av = brk_string(str, &ac, FALSE, &as);
2089 for (j = 0, i = 1; i < ac; i++)
2090 if (strcmp(av[i], av[j]) != 0 && (++j != i))
2095 for (i = 0; i < ac; i++) {
2096 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
2098 Buf_AddByte(&buf, ' ');
2104 return Buf_Destroy(&buf, FALSE);
2109 *-----------------------------------------------------------------------
2111 * Pass through the tstr looking for 1) escaped delimiters,
2112 * '$'s and backslashes (place the escaped character in
2113 * uninterpreted) and 2) unescaped $'s that aren't before
2114 * the delimiter (expand the variable substitution unless flags
2115 * has VAR_NOSUBST set).
2116 * Return the expanded string or NULL if the delimiter was missing
2117 * If pattern is specified, handle escaped ampersands, and replace
2118 * unescaped ampersands with the lhs of the pattern.
2121 * A string of all the words modified appropriately.
2122 * If length is specified, return the string length of the buffer
2123 * If flags is specified and the last character of the pattern is a
2124 * $ set the VAR_MATCH_END bit of flags.
2128 *-----------------------------------------------------------------------
2131 VarGetPattern(GNode *ctxt, Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
2132 int errnum, const char **tstr, int delim, int *flags,
2133 int *length, VarPattern *pattern)
2144 #define IS_A_MATCH(cp, delim) \
2145 ((cp[0] == '\\') && ((cp[1] == delim) || \
2146 (cp[1] == '\\') || (cp[1] == '$') || (pattern && (cp[1] == '&'))))
2149 * Skim through until the matching delimiter is found;
2150 * pick up variable substitutions on the way. Also allow
2151 * backslashes to quote the delimiter, $, and \, but don't
2152 * touch other backslashes.
2154 for (cp = *tstr; *cp && (*cp != delim); cp++) {
2155 if (IS_A_MATCH(cp, delim)) {
2156 Buf_AddByte(&buf, cp[1]);
2158 } else if (*cp == '$') {
2159 if (cp[1] == delim) {
2161 Buf_AddByte(&buf, *cp);
2164 * Unescaped $ at end of pattern => anchor
2167 *flags |= VAR_MATCH_END;
2169 if (flags == NULL || (*flags & VAR_NOSUBST) == 0) {
2175 * If unescaped dollar sign not before the
2176 * delimiter, assume it's a variable
2177 * substitution and recurse.
2179 cp2 = Var_Parse(cp, ctxt, errnum, &len, &freeIt);
2180 Buf_AddBytes(&buf, strlen(cp2), cp2);
2185 const char *cp2 = &cp[1];
2187 if (*cp2 == PROPEN || *cp2 == BROPEN) {
2189 * Find the end of this variable reference
2190 * and suck it in without further ado.
2191 * It will be interperated later.
2194 int want = (*cp2 == PROPEN) ? PRCLOSE : BRCLOSE;
2197 for (++cp2; *cp2 != '\0' && depth > 0; ++cp2) {
2198 if (cp2[-1] != '\\') {
2205 Buf_AddBytes(&buf, cp2 - cp, cp);
2208 Buf_AddByte(&buf, *cp);
2212 else if (pattern && *cp == '&')
2213 Buf_AddBytes(&buf, pattern->leftLen, pattern->lhs);
2215 Buf_AddByte(&buf, *cp);
2225 *length = Buf_Size(&buf);
2226 rstr = Buf_Destroy(&buf, FALSE);
2228 fprintf(debug_file, "Modifier pattern: \"%s\"\n", rstr);
2233 *-----------------------------------------------------------------------
2235 * Quote shell meta-characters in the string
2243 *-----------------------------------------------------------------------
2250 /* This should cover most shells :-( */
2251 static const char meta[] = "\n \t'`\";&<>()|*?{}[]\\$!#^~";
2252 const char *newline;
2255 if ((newline = Shell_GetNewline()) == NULL)
2257 nlen = strlen(newline);
2260 while (*str != '\0') {
2261 if ((len = strcspn(str, meta)) != 0) {
2262 Buf_AddBytes(&buf, len, str);
2264 } else if (*str == '\n') {
2265 Buf_AddBytes(&buf, nlen, newline);
2268 Buf_AddByte(&buf, '\\');
2269 Buf_AddByte(&buf, *str);
2273 str = Buf_Destroy(&buf, FALSE);
2275 fprintf(debug_file, "QuoteMeta: [%s]\n", str);
2280 *-----------------------------------------------------------------------
2282 * Hash the string using the MurmurHash3 algorithm.
2283 * Output is computed using 32bit Little Endian arithmetic.
2286 * str String to modify
2289 * Hash value of str, encoded as 8 hex digits.
2294 *-----------------------------------------------------------------------
2299 static const char hexdigits[16] = "0123456789abcdef";
2302 unsigned char *ustr = (unsigned char *)str;
2303 uint32_t h, k, c1, c2;
2312 for (len = len2; len; ) {
2316 k = (ustr[3] << 24) | (ustr[2] << 16) | (ustr[1] << 8) | ustr[0];
2321 k |= (ustr[2] << 16);
2323 k |= (ustr[1] << 8);
2328 c1 = c1 * 5 + 0x7b7d159cU;
2329 c2 = c2 * 5 + 0x6bce6396U;
2331 k = (k << 11) ^ (k >> 21);
2333 h = (h << 13) ^ (h >> 19);
2334 h = h * 5 + 0x52dce729U;
2344 for (len = 0; len < 8; ++len) {
2345 Buf_AddByte(&buf, hexdigits[h & 15]);
2349 return Buf_Destroy(&buf, FALSE);
2353 VarStrftime(const char *fmt, int zulu)
2361 strftime(buf, sizeof(buf), fmt, zulu ? gmtime(&utc) : localtime(&utc));
2363 buf[sizeof(buf) - 1] = '\0';
2364 return bmake_strdup(buf);
2368 * Now we need to apply any modifiers the user wants applied.
2370 * :M<pattern> words which match the given <pattern>.
2371 * <pattern> is of the standard file
2373 * :N<pattern> words which do not match the given <pattern>.
2374 * :S<d><pat1><d><pat2><d>[1gW]
2375 * Substitute <pat2> for <pat1> in the value
2376 * :C<d><pat1><d><pat2><d>[1gW]
2377 * Substitute <pat2> for regex <pat1> in the value
2378 * :H Substitute the head of each word
2379 * :T Substitute the tail of each word
2380 * :E Substitute the extension (minus '.') of
2382 * :R Substitute the root of each word
2383 * (pathname minus the suffix).
2384 * :O ("Order") Alphabeticaly sort words in variable.
2385 * :Ox ("intermiX") Randomize words in variable.
2386 * :u ("uniq") Remove adjacent duplicate words.
2387 * :tu Converts the variable contents to uppercase.
2388 * :tl Converts the variable contents to lowercase.
2389 * :ts[c] Sets varSpace - the char used to
2390 * separate words to 'c'. If 'c' is
2391 * omitted then no separation is used.
2392 * :tW Treat the variable contents as a single
2393 * word, even if it contains spaces.
2394 * (Mnemonic: one big 'W'ord.)
2395 * :tw Treat the variable contents as multiple
2396 * space-separated words.
2397 * (Mnemonic: many small 'w'ords.)
2398 * :[index] Select a single word from the value.
2399 * :[start..end] Select multiple words from the value.
2400 * :[*] or :[0] Select the entire value, as a single
2401 * word. Equivalent to :tW.
2402 * :[@] Select the entire value, as multiple
2403 * words. Undoes the effect of :[*].
2404 * Equivalent to :tw.
2405 * :[#] Returns the number of words in the value.
2407 * :?<true-value>:<false-value>
2408 * If the variable evaluates to true, return
2409 * true value, else return the second value.
2410 * :lhs=rhs Like :S, but the rhs goes to the end of
2412 * :sh Treat the current value as a command
2413 * to be run, new value is its output.
2414 * The following added so we can handle ODE makefiles.
2415 * :@<tmpvar>@<newval>@
2416 * Assign a temporary local variable <tmpvar>
2417 * to the current value of each word in turn
2418 * and replace each word with the result of
2419 * evaluating <newval>
2420 * :D<newval> Use <newval> as value if variable defined
2421 * :U<newval> Use <newval> as value if variable undefined
2422 * :L Use the name of the variable as the value.
2423 * :P Use the path of the node that has the same
2424 * name as the variable as the value. This
2425 * basically includes an implied :L so that
2426 * the common method of refering to the path
2427 * of your dependent 'x' in a rule is to use
2428 * the form '${x:P}'.
2429 * :!<cmd>! Run cmd much the same as :sh run's the
2430 * current value of the variable.
2431 * The ::= modifiers, actually assign a value to the variable.
2432 * Their main purpose is in supporting modifiers of .for loop
2433 * iterators and other obscure uses. They always expand to
2434 * nothing. In a target rule that would otherwise expand to an
2435 * empty line they can be preceded with @: to keep make happy.
2439 * .for i in ${.TARGET} ${.TARGET:R}.gz
2444 * ::=<str> Assigns <str> as the new value of variable.
2445 * ::?=<str> Assigns <str> as value of variable if
2446 * it was not already set.
2447 * ::+=<str> Appends <str> to variable.
2448 * ::!=<cmd> Assigns output of <cmd> as the new value of
2452 /* we now have some modifiers with long names */
2453 #define STRMOD_MATCH(s, want, n) \
2454 (strncmp(s, want, n) == 0 && (s[n] == endc || s[n] == ':'))
2457 ApplyModifiers(char *nstr, const char *tstr,
2458 int startc, int endc,
2459 Var *v, GNode *ctxt, Boolean errnum,
2460 int *lengthPtr, void **freePtr)
2463 const char *cp; /* Secondary pointer into str (place marker
2465 char *newStr; /* New value to return */
2466 char termc; /* Character which terminated scan */
2467 int cnt; /* Used to count brace pairs when variable in
2468 * in parens or braces */
2470 int modifier; /* that we are processing */
2471 Var_Parse_State parsestate; /* Flags passed to helper functions */
2474 parsestate.oneBigWord = FALSE;
2475 parsestate.varSpace = ' '; /* word separator */
2479 while (*tstr && *tstr != endc) {
2483 * We may have some complex modifiers in a variable.
2490 rval = Var_Parse(tstr, ctxt, errnum, &rlen, &freeIt);
2493 * If we have not parsed up to endc or ':',
2494 * we are not interested.
2496 if (rval != NULL && *rval &&
2497 (c = tstr[rlen]) != '\0' &&
2506 fprintf(debug_file, "Got '%s' from '%.*s'%.*s\n",
2507 rval, rlen, tstr, rlen, tstr + rlen);
2512 if (rval != NULL && *rval) {
2515 nstr = ApplyModifiers(nstr, rval,
2517 v, ctxt, errnum, &used, freePtr);
2518 if (nstr == var_Error
2519 || (nstr == varNoError && errnum == 0)
2520 || strlen(rval) != (size_t) used) {
2523 goto out; /* error already reported */
2530 else if (!*tstr && endc) {
2531 Error("Unclosed variable specification after complex modifier (expecting '%c') for %s", endc, v->name);
2538 fprintf(debug_file, "Applying[%s] :%c to \"%s\"\n", v->name,
2542 switch ((modifier = *tstr)) {
2545 if (tstr[1] == '=' ||
2547 (tstr[1] == '!' || tstr[1] == '+' || tstr[1] == '?'))) {
2549 * "::=", "::!=", "::+=", or "::?="
2551 GNode *v_ctxt; /* context where v belongs */
2557 if (v->name[0] == 0)
2563 if (v->flags & VAR_JUNK) {
2565 * We need to bmake_strdup() it incase
2566 * VarGetPattern() recurses.
2569 v->name = bmake_strdup(v->name);
2570 } else if (ctxt != VAR_GLOBAL) {
2571 Var *gv = VarFind(v->name, ctxt, 0);
2573 v_ctxt = VAR_GLOBAL;
2575 VarFreeEnv(gv, TRUE);
2578 switch ((how = *tstr)) {
2588 delim = startc == PROPEN ? PRCLOSE : BRCLOSE;
2591 pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
2595 if (v->flags & VAR_JUNK) {
2596 /* restore original name */
2600 if (pattern.rhs == NULL)
2608 Var_Append(v->name, pattern.rhs, v_ctxt);
2611 newStr = Cmd_Exec(pattern.rhs, &emsg);
2615 Var_Set(v->name, newStr, v_ctxt, 0);
2620 if ((v->flags & VAR_JUNK) == 0)
2624 Var_Set(v->name, pattern.rhs, v_ctxt, 0);
2627 free(UNCONST(pattern.rhs));
2631 goto default_case; /* "::<unrecognised>" */
2636 int flags = VAR_NOSUBST;
2640 if ((loop.tvar = VarGetPattern(ctxt, &parsestate, errnum,
2642 &flags, &loop.tvarLen,
2646 if ((loop.str = VarGetPattern(ctxt, &parsestate, errnum,
2648 &flags, &loop.strLen,
2655 loop.errnum = errnum;
2657 newStr = VarModify(ctxt, &parsestate, nstr, VarLoopExpand,
2666 Buffer buf; /* Buffer for patterns */
2667 int wantit; /* want data in buffer */
2670 * Pass through tstr looking for 1) escaped delimiters,
2671 * '$'s and backslashes (place the escaped character in
2672 * uninterpreted) and 2) unescaped $'s that aren't before
2673 * the delimiter (expand the variable substitution).
2674 * The result is left in the Buffer buf.
2678 *cp != endc && *cp != ':' && *cp != '\0';
2680 if ((*cp == '\\') &&
2686 Buf_AddByte(&buf, cp[1]);
2688 } else if (*cp == '$') {
2690 * If unescaped dollar sign, assume it's a
2691 * variable substitution and recurse.
2697 cp2 = Var_Parse(cp, ctxt, errnum, &len, &freeIt);
2698 Buf_AddBytes(&buf, strlen(cp2), cp2);
2703 Buf_AddByte(&buf, *cp);
2710 wantit = ((v->flags & VAR_JUNK) != 0);
2712 wantit = ((v->flags & VAR_JUNK) == 0);
2713 if ((v->flags & VAR_JUNK) != 0)
2714 v->flags |= VAR_KEEP;
2716 newStr = Buf_Destroy(&buf, FALSE);
2719 Buf_Destroy(&buf, TRUE);
2725 if ((v->flags & VAR_JUNK) != 0)
2726 v->flags |= VAR_KEEP;
2727 newStr = bmake_strdup(v->name);
2736 if ((v->flags & VAR_JUNK) != 0)
2737 v->flags |= VAR_KEEP;
2738 gn = Targ_FindNode(v->name, TARG_NOCREATE);
2739 if (gn == NULL || gn->type & OP_NOPATH) {
2741 } else if (gn->path) {
2742 newStr = bmake_strdup(gn->path);
2744 newStr = Dir_FindFile(v->name, Suff_FindPath(gn));
2747 newStr = bmake_strdup(v->name);
2762 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
2764 NULL, &pattern.rightLen,
2767 newStr = Cmd_Exec(pattern.rhs, &emsg);
2768 free(UNCONST(pattern.rhs));
2773 if (v->flags & VAR_JUNK) {
2774 v->flags |= VAR_KEEP;
2781 * Look for the closing ']', recursively
2782 * expanding any embedded variables.
2784 * estr is a pointer to the expanded result,
2785 * which we must free().
2789 cp = tstr+1; /* point to char after '[' */
2790 delim = ']'; /* look for closing ']' */
2791 estr = VarGetPattern(ctxt, &parsestate,
2795 goto cleanup; /* report missing ']' */
2796 /* now cp points just after the closing ']' */
2798 if (cp[0] != ':' && cp[0] != endc) {
2799 /* Found junk after ']' */
2803 if (estr[0] == '\0') {
2804 /* Found empty square brackets in ":[]". */
2807 } else if (estr[0] == '#' && estr[1] == '\0') {
2811 * We will need enough space for the decimal
2812 * representation of an int. We calculate the
2813 * space needed for the octal representation,
2814 * and add enough slop to cope with a '-' sign
2815 * (which should never be needed) and a '\0'
2816 * string terminator.
2819 (sizeof(int) * CHAR_BIT + 2) / 3 + 2;
2821 newStr = bmake_malloc(newStrSize);
2822 if (parsestate.oneBigWord) {
2823 strncpy(newStr, "1", newStrSize);
2825 /* XXX: brk_string() is a rather expensive
2826 * way of counting words. */
2831 av = brk_string(nstr, &ac, FALSE, &as);
2832 snprintf(newStr, newStrSize, "%d", ac);
2839 } else if (estr[0] == '*' && estr[1] == '\0') {
2841 parsestate.oneBigWord = TRUE;
2846 } else if (estr[0] == '@' && estr[1] == '\0') {
2848 parsestate.oneBigWord = FALSE;
2855 * We expect estr to contain a single
2856 * integer for :[N], or two integers
2857 * separated by ".." for :[start..end].
2861 VarSelectWords_t seldata = { 0, 0 };
2863 seldata.start = strtol(estr, &ep, 0);
2865 /* Found junk instead of a number */
2868 } else if (ep[0] == '\0') {
2869 /* Found only one integer in :[N] */
2870 seldata.end = seldata.start;
2871 } else if (ep[0] == '.' && ep[1] == '.' &&
2873 /* Expecting another integer after ".." */
2875 seldata.end = strtol(ep, &ep, 0);
2876 if (ep[0] != '\0') {
2877 /* Found junk after ".." */
2882 /* Found junk instead of ".." */
2887 * Now seldata is properly filled in,
2888 * but we still have to check for 0 as
2891 if (seldata.start == 0 && seldata.end == 0) {
2892 /* ":[0]" or perhaps ":[0..0]" */
2893 parsestate.oneBigWord = TRUE;
2898 } else if (seldata.start == 0 ||
2900 /* ":[0..N]" or ":[N..0]" */
2905 * Normal case: select the words
2906 * described by seldata.
2908 newStr = VarSelectWords(ctxt, &parsestate,
2918 cp = tstr + 1; /* make sure it is set */
2919 if (STRMOD_MATCH(tstr, "gmtime", 6)) {
2920 newStr = VarStrftime(nstr, 1);
2928 cp = tstr + 1; /* make sure it is set */
2929 if (STRMOD_MATCH(tstr, "hash", 4)) {
2930 newStr = VarHash(nstr);
2938 cp = tstr + 1; /* make sure it is set */
2939 if (STRMOD_MATCH(tstr, "localtime", 9)) {
2940 newStr = VarStrftime(nstr, 0);
2949 cp = tstr + 1; /* make sure it is set */
2950 if (tstr[1] != endc && tstr[1] != ':') {
2951 if (tstr[1] == 's') {
2953 * Use the char (if any) at tstr[2]
2954 * as the word separator.
2958 if (tstr[2] != endc &&
2959 (tstr[3] == endc || tstr[3] == ':')) {
2960 /* ":ts<unrecognised><endc>" or
2961 * ":ts<unrecognised>:" */
2962 parsestate.varSpace = tstr[2];
2964 } else if (tstr[2] == endc || tstr[2] == ':') {
2965 /* ":ts<endc>" or ":ts:" */
2966 parsestate.varSpace = 0; /* no separator */
2968 } else if (tstr[2] == '\\') {
2971 parsestate.varSpace = '\n';
2975 parsestate.varSpace = '\t';
2979 if (isdigit((unsigned char)tstr[3])) {
2982 parsestate.varSpace =
2983 strtoul(&tstr[3], &ep, 0);
2984 if (*ep != ':' && *ep != endc)
2989 * ":ts<backslash><unrecognised>".
2997 * Found ":ts<unrecognised><unrecognised>".
3005 * We cannot be certain that VarModify
3006 * will be used - even if there is a
3007 * subsequent modifier, so do a no-op
3008 * VarSubstitute now to for str to be
3009 * re-expanded without the spaces.
3011 pattern.flags = VAR_SUB_ONE;
3012 pattern.lhs = pattern.rhs = "\032";
3013 pattern.leftLen = pattern.rightLen = 1;
3015 newStr = VarModify(ctxt, &parsestate, nstr,
3018 } else if (tstr[2] == endc || tstr[2] == ':') {
3020 * Check for two-character options:
3023 if (tstr[1] == 'A') { /* absolute path */
3024 newStr = VarModify(ctxt, &parsestate, nstr,
3028 } else if (tstr[1] == 'u') {
3029 char *dp = bmake_strdup(nstr);
3030 for (newStr = dp; *dp; dp++)
3031 *dp = toupper((unsigned char)*dp);
3034 } else if (tstr[1] == 'l') {
3035 char *dp = bmake_strdup(nstr);
3036 for (newStr = dp; *dp; dp++)
3037 *dp = tolower((unsigned char)*dp);
3040 } else if (tstr[1] == 'W' || tstr[1] == 'w') {
3041 parsestate.oneBigWord = (tstr[1] == 'W');
3046 /* Found ":t<unrecognised>:" or
3047 * ":t<unrecognised><endc>". */
3052 * Found ":t<unrecognised><unrecognised>".
3058 * Found ":t<endc>" or ":t:".
3068 const char *endpat; /* points just after end of pattern */
3070 Boolean copy; /* pattern should be, or has been, copied */
3078 * In the loop below, ignore ':' unless we are at
3079 * (or back to) the original brace level.
3080 * XXX This will likely not work right if $() and ${}
3084 *cp != '\0' && !(*cp == ':' && nest == 1);
3089 cp[1] == endc || cp[1] == startc)) {
3099 if (*cp == '(' || *cp == '{')
3101 if (*cp == ')' || *cp == '}') {
3111 * Need to compress the \:'s out of the pattern, so
3112 * allocate enough room to hold the uncompressed
3113 * pattern (note that cp started at tstr+1, so
3114 * cp - tstr takes the null byte into account) and
3115 * compress the pattern into the space.
3117 pattern = bmake_malloc(cp - tstr);
3118 for (cp2 = pattern, cp = tstr + 1;
3122 if ((*cp == '\\') && (cp+1 < endpat) &&
3123 (cp[1] == ':' || cp[1] == endc)) {
3132 * Either Var_Subst or VarModify will need a
3133 * nul-terminated string soon, so construct one now.
3135 pattern = bmake_strndup(tstr+1, endpat - (tstr + 1));
3139 * pattern contains embedded '$', so use Var_Subst to
3143 pattern = Var_Subst(NULL, cp2, ctxt, errnum);
3147 fprintf(debug_file, "Pattern[%s] for [%s] is [%s]\n",
3148 v->name, nstr, pattern);
3150 newStr = VarModify(ctxt, &parsestate, nstr, VarMatch,
3153 newStr = VarModify(ctxt, &parsestate, nstr, VarNoMatch,
3162 Var_Parse_State tmpparsestate;
3165 tmpparsestate = parsestate;
3170 * If pattern begins with '^', it is anchored to the
3171 * start of the word -- skip over it and flag pattern.
3174 pattern.flags |= VAR_MATCH_START;
3179 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate, errnum,
3186 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
3193 * Check for global substitution. If 'g' after the final
3194 * delimiter, substitution is global and is marked that
3200 pattern.flags |= VAR_SUB_GLOBAL;
3203 pattern.flags |= VAR_SUB_ONE;
3206 tmpparsestate.oneBigWord = TRUE;
3213 newStr = VarModify(ctxt, &tmpparsestate, nstr,
3218 * Free the two strings.
3220 free(UNCONST(pattern.lhs));
3221 free(UNCONST(pattern.rhs));
3230 /* find ':', and then substitute accordingly */
3236 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate, errnum,
3242 /* BROPEN or PROPEN */
3244 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
3252 if (Cond_EvalExpression(NULL, v->name, &value, 0)
3254 Error("Bad conditional expression `%s' in %s?%s:%s",
3255 v->name, v->name, pattern.lhs, pattern.rhs);
3260 newStr = UNCONST(pattern.lhs);
3261 free(UNCONST(pattern.rhs));
3263 newStr = UNCONST(pattern.rhs);
3264 free(UNCONST(pattern.lhs));
3266 if (v->flags & VAR_JUNK) {
3267 v->flags |= VAR_KEEP;
3274 VarREPattern pattern;
3277 Var_Parse_State tmpparsestate;
3280 tmpparsestate = parsestate;
3286 if ((re = VarGetPattern(ctxt, &parsestate, errnum, &cp, delim,
3287 NULL, NULL, NULL)) == NULL)
3290 if ((pattern.replace = VarGetPattern(ctxt, &parsestate,
3291 errnum, &cp, delim, NULL,
3292 NULL, NULL)) == NULL){
3300 pattern.flags |= VAR_SUB_GLOBAL;
3303 pattern.flags |= VAR_SUB_ONE;
3306 tmpparsestate.oneBigWord = TRUE;
3314 error = regcomp(&pattern.re, re, REG_EXTENDED);
3317 *lengthPtr = cp - start + 1;
3318 VarREError(error, &pattern.re, "RE substitution error");
3319 free(pattern.replace);
3323 pattern.nsub = pattern.re.re_nsub + 1;
3324 if (pattern.nsub < 1)
3326 if (pattern.nsub > 10)
3328 pattern.matches = bmake_malloc(pattern.nsub *
3329 sizeof(regmatch_t));
3330 newStr = VarModify(ctxt, &tmpparsestate, nstr,
3333 regfree(&pattern.re);
3334 free(pattern.replace);
3335 free(pattern.matches);
3341 if (tstr[1] == endc || tstr[1] == ':') {
3342 newStr = VarQuote(nstr);
3349 if (tstr[1] == endc || tstr[1] == ':') {
3350 newStr = VarModify(ctxt, &parsestate, nstr, VarTail,
3358 if (tstr[1] == endc || tstr[1] == ':') {
3359 newStr = VarModify(ctxt, &parsestate, nstr, VarHead,
3367 if (tstr[1] == endc || tstr[1] == ':') {
3368 newStr = VarModify(ctxt, &parsestate, nstr, VarSuffix,
3376 if (tstr[1] == endc || tstr[1] == ':') {
3377 newStr = VarModify(ctxt, &parsestate, nstr, VarRoot,
3388 cp = tstr + 1; /* skip to the rest in any case */
3389 if (tstr[1] == endc || tstr[1] == ':') {
3392 } else if ( (tstr[1] == 'x') &&
3393 (tstr[2] == endc || tstr[2] == ':') ) {
3400 newStr = VarOrder(nstr, otype);
3404 if (tstr[1] == endc || tstr[1] == ':') {
3405 newStr = VarUniq(nstr);
3413 if (tstr[1] == 'h' && (tstr[2] == endc || tstr[2] == ':')) {
3415 newStr = Cmd_Exec(nstr, &emsg);
3429 * This can either be a bogus modifier or a System-V
3430 * substitution command.
3438 * First we make a pass through the string trying
3439 * to verify it is a SYSV-make-style translation:
3440 * it must be: <string1>=<string2>)
3444 while (*cp != '\0' && cnt) {
3447 /* continue looking for endc */
3449 else if (*cp == endc)
3451 else if (*cp == startc)
3456 if (*cp == endc && eqFound) {
3459 * Now we break this sucker into the lhs and
3460 * rhs. We must null terminate them of course.
3464 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate,
3465 errnum, &cp, delim, &pattern.flags,
3466 &pattern.leftLen, NULL)) == NULL)
3469 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate,
3470 errnum, &cp, delim, NULL, &pattern.rightLen,
3475 * SYSV modifications happen through the whole
3476 * string. Note the pattern is anchored at the end.
3480 if (pattern.leftLen == 0 && *nstr == '\0') {
3481 newStr = nstr; /* special case */
3483 newStr = VarModify(ctxt, &parsestate, nstr,
3487 free(UNCONST(pattern.lhs));
3488 free(UNCONST(pattern.rhs));
3492 Error("Unknown modifier '%c'", *tstr);
3494 *cp != ':' && *cp != endc && *cp != '\0';
3503 fprintf(debug_file, "Result[%s] of :%c is \"%s\"\n",
3504 v->name, modifier, newStr);
3507 if (newStr != nstr) {
3513 if (nstr != var_Error && nstr != varNoError) {
3517 if (termc == '\0' && endc != '\0') {
3518 Error("Unclosed variable specification (expecting '%c') for \"%s\" (value \"%s\") modifier %c", endc, v->name, nstr, modifier);
3519 } else if (termc == ':') {
3525 *lengthPtr = tstr - start;
3530 Error("Bad modifier `:%.*s' for %s", (int)strcspn(tstr, ":)}"), tstr,
3534 *lengthPtr = cp - start;
3536 Error("Unclosed substitution for %s (%c missing)",
3546 *-----------------------------------------------------------------------
3548 * Given the start of a variable invocation, extract the variable
3549 * name and find its value, then modify it according to the
3553 * str The string to parse
3554 * ctxt The context for the variable
3555 * errnum TRUE if undefined variables are an error
3556 * lengthPtr OUT: The length of the specification
3557 * freePtr OUT: Non-NULL if caller should free *freePtr
3560 * The (possibly-modified) value of the variable or var_Error if the
3561 * specification is invalid. The length of the specification is
3562 * placed in *lengthPtr (for invalid specifications, this is just
3564 * If *freePtr is non-NULL then it's a pointer that the caller
3565 * should pass to free() to free memory used by the result.
3570 *-----------------------------------------------------------------------
3572 /* coverity[+alloc : arg-*4] */
3574 Var_Parse(const char *str, GNode *ctxt, Boolean errnum, int *lengthPtr,
3577 const char *tstr; /* Pointer into str */
3578 Var *v; /* Variable in invocation */
3579 Boolean haveModifier;/* TRUE if have modifiers for the variable */
3580 char endc; /* Ending character when variable in parens
3582 char startc; /* Starting character when variable in parens
3584 int vlen; /* Length of variable name */
3585 const char *start; /* Points to original start of str */
3586 char *nstr; /* New string, used during expansion */
3587 Boolean dynamic; /* TRUE if the variable is local and we're
3588 * expanding it in a non-local context. This
3589 * is done to support dynamic sources. The
3590 * result is just the invocation, unaltered */
3591 Var_Parse_State parsestate; /* Flags passed to helper functions */
3597 parsestate.oneBigWord = FALSE;
3598 parsestate.varSpace = ' '; /* word separator */
3601 if (startc != PROPEN && startc != BROPEN) {
3603 * If it's not bounded by braces of some sort, life is much simpler.
3604 * We just need to check for the first character and return the
3605 * value if it exists.
3608 /* Error out some really stupid names */
3609 if (startc == '\0' || strchr(")}:$", startc)) {
3616 v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
3620 if ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)) {
3622 * If substituting a local variable in a non-local context,
3623 * assume it's for dynamic source stuff. We have to handle
3624 * this specially and return the longhand for the variable
3625 * with the dollar sign escaped so it makes it back to the
3626 * caller. Only four of the local variables are treated
3627 * specially as they are the only four that will be set
3628 * when dynamic sources are expanded.
3632 return UNCONST("$(.TARGET)");
3634 return UNCONST("$(.ARCHIVE)");
3636 return UNCONST("$(.PREFIX)");
3638 return UNCONST("$(.MEMBER)");
3644 return (errnum ? var_Error : varNoError);
3646 haveModifier = FALSE;
3651 Buffer buf; /* Holds the variable name */
3653 endc = startc == PROPEN ? PRCLOSE : BRCLOSE;
3657 * Skip to the end character or a colon, whichever comes first.
3659 for (tstr = str + 2;
3660 *tstr != '\0' && *tstr != endc && *tstr != ':';
3664 * A variable inside a variable, expand
3669 char *rval = Var_Parse(tstr, ctxt, errnum, &rlen, &freeIt);
3671 Buf_AddBytes(&buf, strlen(rval), rval);
3678 Buf_AddByte(&buf, *tstr);
3681 haveModifier = TRUE;
3682 } else if (*tstr != '\0') {
3683 haveModifier = FALSE;
3686 * If we never did find the end character, return NULL
3687 * right now, setting the length to be the distance to
3688 * the end of the string, since that's what make does.
3690 *lengthPtr = tstr - str;
3691 Buf_Destroy(&buf, TRUE);
3694 str = Buf_GetAll(&buf, &vlen);
3697 * At this point, str points into newly allocated memory from
3698 * buf, containing only the name of the variable.
3700 * start and tstr point into the const string that was pointed
3701 * to by the original value of the str parameter. start points
3702 * to the '$' at the beginning of the string, while tstr points
3703 * to the char just after the end of the variable name -- this
3704 * will be '\0', ':', PRCLOSE, or BRCLOSE.
3707 v = VarFind(str, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
3709 * Check also for bogus D and F forms of local variables since we're
3710 * in a local context and the name is the right length.
3712 if ((v == NULL) && (ctxt != VAR_CMD) && (ctxt != VAR_GLOBAL) &&
3713 (vlen == 2) && (str[1] == 'F' || str[1] == 'D') &&
3714 strchr("@%*!<>", str[0]) != NULL) {
3716 * Well, it's local -- go look for it.
3720 v = VarFind(name, ctxt, 0);
3724 * No need for nested expansion or anything, as we're
3725 * the only one who sets these things and we sure don't
3726 * but nested invocations in them...
3728 nstr = Buf_GetAll(&v->val, NULL);
3730 if (str[1] == 'D') {
3731 nstr = VarModify(ctxt, &parsestate, nstr, VarHead,
3734 nstr = VarModify(ctxt, &parsestate, nstr, VarTail,
3738 * Resulting string is dynamically allocated, so
3739 * tell caller to free it.
3742 *lengthPtr = tstr-start+1;
3743 Buf_Destroy(&buf, TRUE);
3744 VarFreeEnv(v, TRUE);
3751 (((vlen == 2) && (str[1] == 'F' || str[1] == 'D')))) &&
3752 ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)))
3755 * If substituting a local variable in a non-local context,
3756 * assume it's for dynamic source stuff. We have to handle
3757 * this specially and return the longhand for the variable
3758 * with the dollar sign escaped so it makes it back to the
3759 * caller. Only four of the local variables are treated
3760 * specially as they are the only four that will be set
3761 * when dynamic sources are expanded.
3771 } else if ((vlen > 2) && (*str == '.') &&
3772 isupper((unsigned char) str[1]) &&
3773 ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)))
3778 if ((strncmp(str, ".TARGET", len) == 0) ||
3779 (strncmp(str, ".ARCHIVE", len) == 0) ||
3780 (strncmp(str, ".PREFIX", len) == 0) ||
3781 (strncmp(str, ".MEMBER", len) == 0))
3787 if (!haveModifier) {
3789 * No modifiers -- have specification length so we can return
3792 *lengthPtr = tstr - start + 1;
3794 char *pstr = bmake_strndup(start, *lengthPtr);
3796 Buf_Destroy(&buf, TRUE);
3799 Buf_Destroy(&buf, TRUE);
3800 return (errnum ? var_Error : varNoError);
3804 * Still need to get to the end of the variable specification,
3805 * so kludge up a Var structure for the modifications
3807 v = bmake_malloc(sizeof(Var));
3808 v->name = UNCONST(str);
3809 Buf_Init(&v->val, 1);
3810 v->flags = VAR_JUNK;
3811 Buf_Destroy(&buf, FALSE);
3814 Buf_Destroy(&buf, TRUE);
3817 if (v->flags & VAR_IN_USE) {
3818 Fatal("Variable %s is recursive.", v->name);
3821 v->flags |= VAR_IN_USE;
3824 * Before doing any modification, we have to make sure the value
3825 * has been fully expanded. If it looks like recursion might be
3826 * necessary (there's a dollar sign somewhere in the variable's value)
3827 * we just call Var_Subst to do any other substitutions that are
3828 * necessary. Note that the value returned by Var_Subst will have
3829 * been dynamically-allocated, so it will need freeing when we
3832 nstr = Buf_GetAll(&v->val, NULL);
3833 if (strchr(nstr, '$') != NULL) {
3834 nstr = Var_Subst(NULL, nstr, ctxt, errnum);
3838 v->flags &= ~VAR_IN_USE;
3840 if ((nstr != NULL) && haveModifier) {
3843 * Skip initial colon.
3847 nstr = ApplyModifiers(nstr, tstr, startc, endc,
3848 v, ctxt, errnum, &used, freePtr);
3852 *lengthPtr = tstr - start + 1;
3854 *lengthPtr = tstr - start;
3857 if (v->flags & VAR_FROM_ENV) {
3858 Boolean destroy = FALSE;
3860 if (nstr != Buf_GetAll(&v->val, NULL)) {
3864 * Returning the value unmodified, so tell the caller to free
3869 VarFreeEnv(v, destroy);
3870 } else if (v->flags & VAR_JUNK) {
3872 * Perform any free'ing needed and set *freePtr to NULL so the caller
3873 * doesn't try to free a static pointer.
3874 * If VAR_KEEP is also set then we want to keep str as is.
3876 if (!(v->flags & VAR_KEEP)) {
3882 nstr = bmake_strndup(start, *lengthPtr);
3885 nstr = errnum ? var_Error : varNoError;
3888 if (nstr != Buf_GetAll(&v->val, NULL))
3889 Buf_Destroy(&v->val, TRUE);
3897 *-----------------------------------------------------------------------
3899 * Substitute for all variables in the given string in the given context
3900 * If undefErr is TRUE, Parse_Error will be called when an undefined
3901 * variable is encountered.
3904 * var Named variable || NULL for all
3905 * str the string which to substitute
3906 * ctxt the context wherein to find variables
3907 * undefErr TRUE if undefineds are an error
3910 * The resulting string.
3913 * None. The old string must be freed by the caller
3914 *-----------------------------------------------------------------------
3917 Var_Subst(const char *var, const char *str, GNode *ctxt, Boolean undefErr)
3919 Buffer buf; /* Buffer for forming things */
3920 char *val; /* Value to substitute for a variable */
3921 int length; /* Length of the variable invocation */
3922 Boolean trailingBslash; /* variable ends in \ */
3923 void *freeIt = NULL; /* Set if it should be freed */
3924 static Boolean errorReported; /* Set true if an error has already
3925 * been reported to prevent a plethora
3926 * of messages when recursing */
3929 errorReported = FALSE;
3930 trailingBslash = FALSE;
3933 if (*str == '\n' && trailingBslash)
3934 Buf_AddByte(&buf, ' ');
3935 if (var == NULL && (*str == '$') && (str[1] == '$')) {
3937 * A dollar sign may be escaped either with another dollar sign.
3938 * In such a case, we skip over the escape character and store the
3939 * dollar sign into the buffer directly.
3942 Buf_AddByte(&buf, *str);
3944 } else if (*str != '$') {
3946 * Skip as many characters as possible -- either to the end of
3947 * the string or to the next dollar sign (variable invocation).
3951 for (cp = str++; *str != '$' && *str != '\0'; str++)
3953 Buf_AddBytes(&buf, str - cp, cp);
3958 if (str[1] == '\0') {
3959 /* A trailing $ is kind of a special case */
3960 Buf_AddByte(&buf, str[0]);
3963 } else if (str[1] != PROPEN && str[1] != BROPEN) {
3964 if (str[1] != *var || strlen(var) > 1) {
3965 Buf_AddBytes(&buf, 2, str);
3977 * Scan up to the end of the variable name.
3979 for (p = &str[2]; *p &&
3980 *p != ':' && *p != PRCLOSE && *p != BRCLOSE; p++)
3984 * A variable inside the variable. We cannot expand
3985 * the external variable yet, so we try again with
3989 Buf_AddBytes(&buf, p - str, str);
3994 if (strncmp(var, str + 2, p - str - 2) != 0 ||
3995 var[p - str - 2] != '\0') {
3997 * Not the variable we want to expand, scan
3998 * until the next variable
4000 for (;*p != '$' && *p != '\0'; p++)
4002 Buf_AddBytes(&buf, p - str, str);
4015 val = Var_Parse(str, ctxt, undefErr, &length, &freeIt);
4018 * When we come down here, val should either point to the
4019 * value of this variable, suitably modified, or be NULL.
4020 * Length should be the total length of the potential
4021 * variable invocation (from $ to end character...)
4023 if (val == var_Error || val == varNoError) {
4025 * If performing old-time variable substitution, skip over
4026 * the variable and continue with the substitution. Otherwise,
4027 * store the dollar sign and advance str so we continue with
4032 } else if (undefErr) {
4034 * If variable is undefined, complain and skip the
4035 * variable. The complaint will stop us from doing anything
4036 * when the file is parsed.
4038 if (!errorReported) {
4039 Parse_Error(PARSE_FATAL,
4040 "Undefined variable \"%.*s\"",length,str);
4043 errorReported = TRUE;
4045 Buf_AddByte(&buf, *str);
4050 * We've now got a variable structure to store in. But first,
4051 * advance the string pointer.
4056 * Copy all the characters from the variable value straight
4057 * into the new string.
4059 length = strlen(val);
4060 Buf_AddBytes(&buf, length, val);
4061 trailingBslash = length > 0 && val[length - 1] == '\\';
4070 return Buf_DestroyCompact(&buf);
4074 *-----------------------------------------------------------------------
4076 * Return the tail from each of a list of words. Used to set the
4077 * System V local variables.
4080 * file Filename to modify
4083 * The resulting string.
4088 *-----------------------------------------------------------------------
4092 Var_GetTail(char *file)
4094 return(VarModify(file, VarTail, NULL));
4098 *-----------------------------------------------------------------------
4100 * Find the leading components of a (list of) filename(s).
4101 * XXX: VarHead does not replace foo by ., as (sun) System V make
4105 * file Filename to manipulate
4108 * The leading components.
4113 *-----------------------------------------------------------------------
4116 Var_GetHead(char *file)
4118 return(VarModify(file, VarHead, NULL));
4123 *-----------------------------------------------------------------------
4125 * Initialize the module
4131 * The VAR_CMD and VAR_GLOBAL contexts are created
4132 *-----------------------------------------------------------------------
4137 VAR_GLOBAL = Targ_NewGN("Global");
4138 VAR_CMD = Targ_NewGN("Command");
4149 /****************** PRINT DEBUGGING INFO *****************/
4151 VarPrintVar(void *vp)
4154 fprintf(debug_file, "%-16s = %s\n", v->name, Buf_GetAll(&v->val, NULL));
4158 *-----------------------------------------------------------------------
4160 * print all variables in a context
4161 *-----------------------------------------------------------------------
4164 Var_Dump(GNode *ctxt)
4169 for (h = Hash_EnumFirst(&ctxt->context, &search);
4171 h = Hash_EnumNext(&search)) {
4172 VarPrintVar(Hash_GetValue(h));