1 /* $NetBSD: var.c,v 1.191 2014/09/14 02:32:51 dholland 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.191 2014/09/14 02:32:51 dholland 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.191 2014/09/14 02:32:51 dholland 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>
142 extern int makelevel;
144 * This lets us tell if we have replaced the original environ
145 * (which we cannot free).
147 char **savedEnv = NULL;
150 * This is a harmless return value for Var_Parse that can be used by Var_Subst
151 * to determine if there was an error in parsing -- easier than returning
152 * a flag, as things outside this module don't give a hoot.
154 char var_Error[] = "";
157 * Similar to var_Error, but returned when the 'errnum' flag for Var_Parse is
158 * set false. Why not just use a constant? Well, gcc likes to condense
159 * identical string instances...
161 static char varNoError[] = "";
164 * Internally, variables are contained in four different contexts.
165 * 1) the environment. They may not be changed. If an environment
166 * variable is appended-to, the result is placed in the global
168 * 2) the global context. Variables set in the Makefile are located in
169 * the global context. It is the penultimate context searched when
171 * 3) the command-line context. All variables set on the command line
172 * are placed in this context. They are UNALTERABLE once placed here.
173 * 4) the local context. Each target has associated with it a context
174 * list. On this list are located the structures describing such
175 * local variables as $(@) and $(*)
176 * The four contexts are searched in the reverse order from which they are
179 GNode *VAR_INTERNAL; /* variables from make itself */
180 GNode *VAR_GLOBAL; /* variables from the makefile */
181 GNode *VAR_CMD; /* variables defined on the command-line */
183 #define FIND_CMD 0x1 /* look in VAR_CMD when searching */
184 #define FIND_GLOBAL 0x2 /* look in VAR_GLOBAL as well */
185 #define FIND_ENV 0x4 /* look in the environment also */
188 char *name; /* the variable's name */
189 Buffer val; /* its value */
190 int flags; /* miscellaneous status flags */
191 #define VAR_IN_USE 1 /* Variable's value currently being used.
192 * Used to avoid recursion */
193 #define VAR_FROM_ENV 2 /* Variable comes from the environment */
194 #define VAR_JUNK 4 /* Variable is a junk variable that
195 * should be destroyed when done with
196 * it. Used by Var_Parse for undefined,
197 * modified variables */
198 #define VAR_KEEP 8 /* Variable is VAR_JUNK, but we found
199 * a use for it in some modifier and
200 * the value is therefore valid */
201 #define VAR_EXPORTED 16 /* Variable is exported */
202 #define VAR_REEXPORT 32 /* Indicate if var needs re-export.
203 * This would be true if it contains $'s
205 #define VAR_FROM_CMD 64 /* Variable came from command line */
209 * Exporting vars is expensive so skip it if we can
211 #define VAR_EXPORTED_NONE 0
212 #define VAR_EXPORTED_YES 1
213 #define VAR_EXPORTED_ALL 2
214 static int var_exportedVars = VAR_EXPORTED_NONE;
216 * We pass this to Var_Export when doing the initial export
217 * or after updating an exported var.
219 #define VAR_EXPORT_PARENT 1
221 /* Var*Pattern flags */
222 #define VAR_SUB_GLOBAL 0x01 /* Apply substitution globally */
223 #define VAR_SUB_ONE 0x02 /* Apply substitution to one word */
224 #define VAR_SUB_MATCHED 0x04 /* There was a match */
225 #define VAR_MATCH_START 0x08 /* Match at start of word */
226 #define VAR_MATCH_END 0x10 /* Match at end of word */
227 #define VAR_NOSUBST 0x20 /* don't expand vars in VarGetPattern */
230 #define VAR_NO_EXPORT 0x01 /* do not export */
234 * The following fields are set by Var_Parse() when it
235 * encounters modifiers that need to keep state for use by
236 * subsequent modifiers within the same variable expansion.
238 Byte varSpace; /* Word separator in expansions */
239 Boolean oneBigWord; /* TRUE if we will treat the variable as a
240 * single big word, even if it contains
241 * embedded spaces (as opposed to the
242 * usual behaviour of treating it as
243 * several space-separated words). */
246 /* struct passed as 'void *' to VarSubstitute() for ":S/lhs/rhs/",
247 * to VarSYSVMatch() for ":lhs=rhs". */
249 const char *lhs; /* String to match */
250 int leftLen; /* Length of string */
251 const char *rhs; /* Replacement string (w/ &'s removed) */
252 int rightLen; /* Length of replacement */
256 /* struct passed as 'void *' to VarLoopExpand() for ":@tvar@str@" */
258 GNode *ctxt; /* variable context */
259 char *tvar; /* name of temp var */
261 char *str; /* string to expand */
263 int errnum; /* errnum for not defined */
267 /* struct passed as 'void *' to VarRESubstitute() for ":C///" */
277 /* struct passed to VarSelectWords() for ":[start..end]" */
279 int start; /* first word to select */
280 int end; /* last word to select */
283 static Var *VarFind(const char *, GNode *, int);
284 static void VarAdd(const char *, const char *, GNode *);
285 static Boolean VarHead(GNode *, Var_Parse_State *,
286 char *, Boolean, Buffer *, void *);
287 static Boolean VarTail(GNode *, Var_Parse_State *,
288 char *, Boolean, Buffer *, void *);
289 static Boolean VarSuffix(GNode *, Var_Parse_State *,
290 char *, Boolean, Buffer *, void *);
291 static Boolean VarRoot(GNode *, Var_Parse_State *,
292 char *, Boolean, Buffer *, void *);
293 static Boolean VarMatch(GNode *, Var_Parse_State *,
294 char *, Boolean, Buffer *, void *);
296 static Boolean VarSYSVMatch(GNode *, Var_Parse_State *,
297 char *, Boolean, Buffer *, void *);
299 static Boolean VarNoMatch(GNode *, Var_Parse_State *,
300 char *, Boolean, Buffer *, void *);
302 static void VarREError(int, regex_t *, const char *);
303 static Boolean VarRESubstitute(GNode *, Var_Parse_State *,
304 char *, Boolean, Buffer *, void *);
306 static Boolean VarSubstitute(GNode *, Var_Parse_State *,
307 char *, Boolean, Buffer *, void *);
308 static Boolean VarLoopExpand(GNode *, Var_Parse_State *,
309 char *, Boolean, Buffer *, void *);
310 static char *VarGetPattern(GNode *, Var_Parse_State *,
311 int, const char **, int, int *, int *,
313 static char *VarQuote(char *);
314 static char *VarHash(char *);
315 static char *VarModify(GNode *, Var_Parse_State *,
317 Boolean (*)(GNode *, Var_Parse_State *, char *, Boolean, Buffer *, void *),
319 static char *VarOrder(const char *, const char);
320 static char *VarUniq(const char *);
321 static int VarWordCompare(const void *, const void *);
322 static void VarPrintVar(void *);
330 *-----------------------------------------------------------------------
332 * Find the given variable in the given context and any other contexts
337 * ctxt context in which to find it
338 * flags FIND_GLOBAL set means to look in the
339 * VAR_GLOBAL context as well. FIND_CMD set means
340 * to look in the VAR_CMD context also. FIND_ENV
341 * set means to look in the environment
344 * A pointer to the structure describing the desired variable or
345 * NULL if the variable does not exist.
349 *-----------------------------------------------------------------------
352 VarFind(const char *name, GNode *ctxt, int flags)
358 * If the variable name begins with a '.', it could very well be one of
359 * the local ones. We check the name against all the local variables
360 * and substitute the short version in for 'name' if it matches one of
363 if (*name == '.' && isupper((unsigned char) name[1]))
366 if (!strcmp(name, ".ALLSRC"))
368 if (!strcmp(name, ".ARCHIVE"))
372 if (!strcmp(name, ".IMPSRC"))
376 if (!strcmp(name, ".MEMBER"))
380 if (!strcmp(name, ".OODATE"))
384 if (!strcmp(name, ".PREFIX"))
388 if (!strcmp(name, ".TARGET"))
393 /* for compatibility with gmake */
394 if (name[0] == '^' && name[1] == '\0')
399 * First look for the variable in the given context. If it's not there,
400 * look for it in VAR_CMD, VAR_GLOBAL and the environment, in that order,
401 * depending on the FIND_* flags in 'flags'
403 var = Hash_FindEntry(&ctxt->context, name);
405 if ((var == NULL) && (flags & FIND_CMD) && (ctxt != VAR_CMD)) {
406 var = Hash_FindEntry(&VAR_CMD->context, name);
408 if (!checkEnvFirst && (var == NULL) && (flags & FIND_GLOBAL) &&
409 (ctxt != VAR_GLOBAL))
411 var = Hash_FindEntry(&VAR_GLOBAL->context, name);
412 if ((var == NULL) && (ctxt != VAR_INTERNAL)) {
413 /* VAR_INTERNAL is subordinate to VAR_GLOBAL */
414 var = Hash_FindEntry(&VAR_INTERNAL->context, name);
417 if ((var == NULL) && (flags & FIND_ENV)) {
420 if ((env = getenv(name)) != NULL) {
423 v = bmake_malloc(sizeof(Var));
424 v->name = bmake_strdup(name);
428 Buf_Init(&v->val, len + 1);
429 Buf_AddBytes(&v->val, len, env);
431 v->flags = VAR_FROM_ENV;
433 } else if (checkEnvFirst && (flags & FIND_GLOBAL) &&
434 (ctxt != VAR_GLOBAL))
436 var = Hash_FindEntry(&VAR_GLOBAL->context, name);
437 if ((var == NULL) && (ctxt != VAR_INTERNAL)) {
438 var = Hash_FindEntry(&VAR_INTERNAL->context, name);
443 return ((Var *)Hash_GetValue(var));
448 } else if (var == NULL) {
451 return ((Var *)Hash_GetValue(var));
456 *-----------------------------------------------------------------------
458 * If the variable is an environment variable, free it
462 * destroy true if the value buffer should be destroyed.
465 * 1 if it is an environment variable 0 ow.
468 * The variable is free'ed if it is an environent variable.
469 *-----------------------------------------------------------------------
472 VarFreeEnv(Var *v, Boolean destroy)
474 if ((v->flags & VAR_FROM_ENV) == 0)
477 Buf_Destroy(&v->val, destroy);
483 *-----------------------------------------------------------------------
485 * Add a new variable of name name and value val to the given context
488 * name name of variable to add
489 * val value to set it to
490 * ctxt context in which to set it
496 * The new variable is placed at the front of the given context
497 * The name and val arguments are duplicated so they may
499 *-----------------------------------------------------------------------
502 VarAdd(const char *name, const char *val, GNode *ctxt)
508 v = bmake_malloc(sizeof(Var));
510 len = val ? strlen(val) : 0;
511 Buf_Init(&v->val, len+1);
512 Buf_AddBytes(&v->val, len, val);
516 h = Hash_CreateEntry(&ctxt->context, name, NULL);
520 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
525 *-----------------------------------------------------------------------
527 * Remove a variable from a context.
533 * The Var structure is removed and freed.
535 *-----------------------------------------------------------------------
538 Var_Delete(const char *name, GNode *ctxt)
543 if (strchr(name, '$')) {
544 cp = Var_Subst(NULL, name, VAR_GLOBAL, 0);
548 ln = Hash_FindEntry(&ctxt->context, cp);
550 fprintf(debug_file, "%s:delete %s%s\n",
551 ctxt->name, cp, ln ? "" : " (not found)");
559 v = (Var *)Hash_GetValue(ln);
560 if ((v->flags & VAR_EXPORTED)) {
563 if (strcmp(MAKE_EXPORTED, v->name) == 0) {
564 var_exportedVars = VAR_EXPORTED_NONE;
566 if (v->name != ln->name)
568 Hash_DeleteEntry(&ctxt->context, ln);
569 Buf_Destroy(&v->val, TRUE);
577 * We ignore make internal variables (those which start with '.')
578 * Also we jump through some hoops to avoid calling setenv
579 * more than necessary since it can leak.
580 * We only manipulate flags of vars if 'parent' is set.
583 Var_Export1(const char *name, int parent)
591 return 0; /* skip internals */
595 * If it is one of the vars that should only appear in
596 * local context, skip it, else we can get Var_Subst
607 v = VarFind(name, VAR_GLOBAL, 0);
612 (v->flags & (VAR_EXPORTED|VAR_REEXPORT)) == VAR_EXPORTED) {
613 return 0; /* nothing to do */
615 val = Buf_GetAll(&v->val, NULL);
616 if (strchr(val, '$')) {
619 * Flag this as something we need to re-export.
620 * No point actually exporting it now though,
621 * the child can do it at the last minute.
623 v->flags |= (VAR_EXPORTED|VAR_REEXPORT);
626 if (v->flags & VAR_IN_USE) {
628 * We recursed while exporting in a child.
629 * This isn't going to end well, just skip it.
633 n = snprintf(tmp, sizeof(tmp), "${%s}", name);
634 if (n < (int)sizeof(tmp)) {
635 val = Var_Subst(NULL, tmp, VAR_GLOBAL, 0);
636 setenv(name, val, 1);
641 v->flags &= ~VAR_REEXPORT; /* once will do */
643 if (parent || !(v->flags & VAR_EXPORTED)) {
644 setenv(name, val, 1);
648 * This is so Var_Set knows to call Var_Export again...
651 v->flags |= VAR_EXPORTED;
657 * This gets called from our children.
670 * Several make's support this sort of mechanism for tracking
671 * recursion - but each uses a different name.
672 * We allow the makefiles to update MAKELEVEL and ensure
673 * children see a correctly incremented value.
675 snprintf(tmp, sizeof(tmp), "%d", makelevel + 1);
676 setenv(MAKE_LEVEL_ENV, tmp, 1);
678 if (VAR_EXPORTED_NONE == var_exportedVars)
681 if (VAR_EXPORTED_ALL == var_exportedVars) {
683 * Ouch! This is crazy...
685 for (var = Hash_EnumFirst(&VAR_GLOBAL->context, &state);
687 var = Hash_EnumNext(&state)) {
688 v = (Var *)Hash_GetValue(var);
689 Var_Export1(v->name, 0);
694 * We have a number of exported vars,
696 n = snprintf(tmp, sizeof(tmp), "${" MAKE_EXPORTED ":O:u}");
697 if (n < (int)sizeof(tmp)) {
703 val = Var_Subst(NULL, tmp, VAR_GLOBAL, 0);
704 av = brk_string(val, &ac, FALSE, &as);
705 for (i = 0; i < ac; i++) {
706 Var_Export1(av[i], 0);
715 * This is called when .export is seen or
716 * .MAKE.EXPORTED is modified.
717 * It is also called when any exported var is modified.
720 Var_Export(char *str, int isExport)
730 if (isExport && (!str || !str[0])) {
731 var_exportedVars = VAR_EXPORTED_ALL; /* use with caution! */
735 if (strncmp(str, "-env", 4) == 0) {
739 track = VAR_EXPORT_PARENT;
741 val = Var_Subst(NULL, str, VAR_GLOBAL, 0);
742 av = brk_string(val, &ac, FALSE, &as);
743 for (i = 0; i < ac; i++) {
748 * If it is one of the vars that should only appear in
749 * local context, skip it, else we can get Var_Subst
760 if (Var_Export1(name, track)) {
761 if (VAR_EXPORTED_ALL != var_exportedVars)
762 var_exportedVars = VAR_EXPORTED_YES;
763 if (isExport && track) {
764 Var_Append(MAKE_EXPORTED, name, VAR_GLOBAL);
775 * This is called when .unexport[-env] is seen.
777 extern char **environ;
780 Var_UnExport(char *str)
785 Boolean unexport_env;
788 if (!str || !str[0]) {
789 return; /* assert? */
795 unexport_env = (strncmp(str, "-env", 4) == 0);
799 cp = getenv(MAKE_LEVEL_ENV); /* we should preserve this */
800 if (environ == savedEnv) {
801 /* we have been here before! */
802 newenv = bmake_realloc(environ, 2 * sizeof(char *));
808 newenv = bmake_malloc(2 * sizeof(char *));
812 /* Note: we cannot safely free() the original environ. */
813 environ = savedEnv = newenv;
816 setenv(MAKE_LEVEL_ENV, cp, 1);
818 for (; *str != '\n' && isspace((unsigned char) *str); str++)
820 if (str[0] && str[0] != '\n') {
826 /* Using .MAKE.EXPORTED */
827 n = snprintf(tmp, sizeof(tmp), "${" MAKE_EXPORTED ":O:u}");
828 if (n < (int)sizeof(tmp)) {
829 vlist = Var_Subst(NULL, tmp, VAR_GLOBAL, 0);
839 av = brk_string(vlist, &ac, FALSE, &as);
840 for (i = 0; i < ac; i++) {
841 v = VarFind(av[i], VAR_GLOBAL, 0);
845 (v->flags & (VAR_EXPORTED|VAR_REEXPORT)) == VAR_EXPORTED) {
848 v->flags &= ~(VAR_EXPORTED|VAR_REEXPORT);
850 * If we are unexporting a list,
851 * remove each one from .MAKE.EXPORTED.
852 * If we are removing them all,
853 * just delete .MAKE.EXPORTED below.
856 n = snprintf(tmp, sizeof(tmp),
857 "${" MAKE_EXPORTED ":N%s}", v->name);
858 if (n < (int)sizeof(tmp)) {
859 cp = Var_Subst(NULL, tmp, VAR_GLOBAL, 0);
860 Var_Set(MAKE_EXPORTED, cp, VAR_GLOBAL, 0);
868 Var_Delete(MAKE_EXPORTED, VAR_GLOBAL);
875 *-----------------------------------------------------------------------
877 * Set the variable name to the value val in the given context.
880 * name name of variable to set
881 * val value to give to the variable
882 * ctxt context in which to set it
888 * If the variable doesn't yet exist, a new record is created for it.
889 * Else the old value is freed and the new one stuck in its place
892 * The variable is searched for only in its context before being
893 * created in that context. I.e. if the context is VAR_GLOBAL,
894 * only VAR_GLOBAL->context is searched. Likewise if it is VAR_CMD, only
895 * VAR_CMD->context is searched. This is done to avoid the literally
896 * thousands of unnecessary strcmp's that used to be done to
897 * set, say, $(@) or $(<).
898 * If the context is VAR_GLOBAL though, we check if the variable
899 * was set in VAR_CMD from the command line and skip it if so.
900 *-----------------------------------------------------------------------
903 Var_Set(const char *name, const char *val, GNode *ctxt, int flags)
906 char *expanded_name = NULL;
909 * We only look for a variable in the given context since anything set
910 * here will override anything in a lower context, so there's not much
911 * point in searching them all just to save a bit of memory...
913 if (strchr(name, '$') != NULL) {
914 expanded_name = Var_Subst(NULL, name, ctxt, 0);
915 if (expanded_name[0] == 0) {
917 fprintf(debug_file, "Var_Set(\"%s\", \"%s\", ...) "
918 "name expands to empty string - ignored\n",
924 name = expanded_name;
926 if (ctxt == VAR_GLOBAL) {
927 v = VarFind(name, VAR_CMD, 0);
929 if ((v->flags & VAR_FROM_CMD)) {
931 fprintf(debug_file, "%s:%s = %s ignored!\n", ctxt->name, name, val);
938 v = VarFind(name, ctxt, 0);
940 if (ctxt == VAR_CMD && (flags & VAR_NO_EXPORT) == 0) {
942 * This var would normally prevent the same name being added
943 * to VAR_GLOBAL, so delete it from there if needed.
944 * Otherwise -V name may show the wrong value.
946 Var_Delete(name, VAR_GLOBAL);
948 VarAdd(name, val, ctxt);
951 Buf_AddBytes(&v->val, strlen(val), val);
954 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val);
956 if ((v->flags & VAR_EXPORTED)) {
957 Var_Export1(name, VAR_EXPORT_PARENT);
961 * Any variables given on the command line are automatically exported
962 * to the environment (as per POSIX standard)
964 if (ctxt == VAR_CMD && (flags & VAR_NO_EXPORT) == 0) {
966 /* we just added it */
967 v = VarFind(name, ctxt, 0);
970 v->flags |= VAR_FROM_CMD;
972 * If requested, don't export these in the environment
973 * individually. We still put them in MAKEOVERRIDES so
974 * that the command-line settings continue to override
977 if (varNoExportEnv != TRUE)
978 setenv(name, val, 1);
980 Var_Append(MAKEOVERRIDES, name, VAR_GLOBAL);
985 if (expanded_name != NULL)
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, 0);
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 if (expanded_name != NULL)
1065 free(expanded_name);
1069 *-----------------------------------------------------------------------
1071 * See if the given variable exists.
1074 * name Variable to find
1075 * ctxt Context in which to start search
1078 * TRUE if it does, FALSE if it doesn't
1083 *-----------------------------------------------------------------------
1086 Var_Exists(const char *name, GNode *ctxt)
1091 if ((cp = strchr(name, '$')) != NULL) {
1092 cp = Var_Subst(NULL, name, ctxt, FALSE);
1094 v = VarFind(cp ? cp : name, ctxt, FIND_CMD|FIND_GLOBAL|FIND_ENV);
1101 (void)VarFreeEnv(v, TRUE);
1107 *-----------------------------------------------------------------------
1109 * Return the value of the named variable in the given context
1113 * ctxt context in which to search for it
1116 * The value if the variable exists, NULL if it doesn't
1120 *-----------------------------------------------------------------------
1123 Var_Value(const char *name, GNode *ctxt, char **frp)
1127 v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
1130 char *p = (Buf_GetAll(&v->val, NULL));
1131 if (VarFreeEnv(v, FALSE))
1140 *-----------------------------------------------------------------------
1142 * Remove the tail of the given word and place the result in the given
1147 * addSpace True if need to add a space to the buffer
1148 * before sticking in the head
1149 * buf Buffer in which to store it
1152 * TRUE if characters were added to the buffer (a space needs to be
1153 * added to the buffer before the next word).
1156 * The trimmed word is added to the buffer.
1158 *-----------------------------------------------------------------------
1161 VarHead(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1162 char *word, Boolean addSpace, Buffer *buf,
1167 slash = strrchr(word, '/');
1168 if (slash != NULL) {
1169 if (addSpace && vpstate->varSpace) {
1170 Buf_AddByte(buf, vpstate->varSpace);
1173 Buf_AddBytes(buf, strlen(word), word);
1178 * If no directory part, give . (q.v. the POSIX standard)
1180 if (addSpace && vpstate->varSpace)
1181 Buf_AddByte(buf, vpstate->varSpace);
1182 Buf_AddByte(buf, '.');
1184 return(dummy ? TRUE : TRUE);
1188 *-----------------------------------------------------------------------
1190 * Remove the head of the given word and place the result in the given
1195 * addSpace True if need to add a space to the buffer
1196 * before adding the tail
1197 * buf Buffer in which to store it
1200 * TRUE if characters were added to the buffer (a space needs to be
1201 * added to the buffer before the next word).
1204 * The trimmed word is added to the buffer.
1206 *-----------------------------------------------------------------------
1209 VarTail(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1210 char *word, Boolean addSpace, Buffer *buf,
1215 if (addSpace && vpstate->varSpace) {
1216 Buf_AddByte(buf, vpstate->varSpace);
1219 slash = strrchr(word, '/');
1220 if (slash != NULL) {
1222 Buf_AddBytes(buf, strlen(slash), slash);
1225 Buf_AddBytes(buf, strlen(word), word);
1227 return (dummy ? TRUE : TRUE);
1231 *-----------------------------------------------------------------------
1233 * Place the suffix of the given word in the given buffer.
1237 * addSpace TRUE if need to add a space before placing the
1238 * suffix in the buffer
1239 * buf Buffer in which to store it
1242 * TRUE if characters were added to the buffer (a space needs to be
1243 * added to the buffer before the next word).
1246 * The suffix from the word is placed in the buffer.
1248 *-----------------------------------------------------------------------
1251 VarSuffix(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1252 char *word, Boolean addSpace, Buffer *buf,
1257 dot = strrchr(word, '.');
1259 if (addSpace && vpstate->varSpace) {
1260 Buf_AddByte(buf, vpstate->varSpace);
1263 Buf_AddBytes(buf, strlen(dot), dot);
1267 return (dummy ? addSpace : addSpace);
1271 *-----------------------------------------------------------------------
1273 * Remove the suffix of the given word and place the result in the
1278 * addSpace TRUE if need to add a space to the buffer
1279 * before placing the root in it
1280 * buf Buffer in which to store it
1283 * TRUE if characters were added to the buffer (a space needs to be
1284 * added to the buffer before the next word).
1287 * The trimmed word is added to the buffer.
1289 *-----------------------------------------------------------------------
1292 VarRoot(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1293 char *word, Boolean addSpace, Buffer *buf,
1298 if (addSpace && vpstate->varSpace) {
1299 Buf_AddByte(buf, vpstate->varSpace);
1302 dot = strrchr(word, '.');
1305 Buf_AddBytes(buf, strlen(word), word);
1308 Buf_AddBytes(buf, strlen(word), word);
1310 return (dummy ? TRUE : TRUE);
1314 *-----------------------------------------------------------------------
1316 * Place the word in the buffer if it matches the given pattern.
1317 * Callback function for VarModify to implement the :M modifier.
1320 * word Word to examine
1321 * addSpace TRUE if need to add a space to the buffer
1322 * before adding the word, if it matches
1323 * buf Buffer in which to store it
1324 * pattern Pattern the word must match
1327 * TRUE if a space should be placed in the buffer before the next
1331 * The word may be copied to the buffer.
1333 *-----------------------------------------------------------------------
1336 VarMatch(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1337 char *word, Boolean addSpace, Buffer *buf,
1341 fprintf(debug_file, "VarMatch [%s] [%s]\n", word, (char *)pattern);
1342 if (Str_Match(word, (char *)pattern)) {
1343 if (addSpace && vpstate->varSpace) {
1344 Buf_AddByte(buf, vpstate->varSpace);
1347 Buf_AddBytes(buf, strlen(word), word);
1354 *-----------------------------------------------------------------------
1356 * Place the word in the buffer if it matches the given pattern.
1357 * Callback function for VarModify to implement the System V %
1361 * word Word to examine
1362 * addSpace TRUE if need to add a space to the buffer
1363 * before adding the word, if it matches
1364 * buf Buffer in which to store it
1365 * patp Pattern the word must match
1368 * TRUE if a space should be placed in the buffer before the next
1372 * The word may be copied to the buffer.
1374 *-----------------------------------------------------------------------
1377 VarSYSVMatch(GNode *ctx, Var_Parse_State *vpstate,
1378 char *word, Boolean addSpace, Buffer *buf,
1383 VarPattern *pat = (VarPattern *)patp;
1386 if (addSpace && vpstate->varSpace)
1387 Buf_AddByte(buf, vpstate->varSpace);
1391 if ((ptr = Str_SYSVMatch(word, pat->lhs, &len)) != NULL) {
1392 varexp = Var_Subst(NULL, pat->rhs, ctx, 0);
1393 Str_SYSVSubst(buf, varexp, ptr, len);
1396 Buf_AddBytes(buf, strlen(word), word);
1405 *-----------------------------------------------------------------------
1407 * Place the word in the buffer if it doesn't match the given pattern.
1408 * Callback function for VarModify to implement the :N modifier.
1411 * word Word to examine
1412 * addSpace TRUE if need to add a space to the buffer
1413 * before adding the word, if it matches
1414 * buf Buffer in which to store it
1415 * pattern Pattern the word must match
1418 * TRUE if a space should be placed in the buffer before the next
1422 * The word may be copied to the buffer.
1424 *-----------------------------------------------------------------------
1427 VarNoMatch(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1428 char *word, Boolean addSpace, Buffer *buf,
1431 if (!Str_Match(word, (char *)pattern)) {
1432 if (addSpace && vpstate->varSpace) {
1433 Buf_AddByte(buf, vpstate->varSpace);
1436 Buf_AddBytes(buf, strlen(word), word);
1443 *-----------------------------------------------------------------------
1445 * Perform a string-substitution on the given word, placing the
1446 * result in the passed buffer.
1449 * word Word to modify
1450 * addSpace True if space should be added before
1452 * buf Buffer for result
1453 * patternp Pattern for substitution
1456 * TRUE if a space is needed before more characters are added.
1461 *-----------------------------------------------------------------------
1464 VarSubstitute(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1465 char *word, Boolean addSpace, Buffer *buf,
1468 int wordLen; /* Length of word */
1469 char *cp; /* General pointer */
1470 VarPattern *pattern = (VarPattern *)patternp;
1472 wordLen = strlen(word);
1473 if ((pattern->flags & (VAR_SUB_ONE|VAR_SUB_MATCHED)) !=
1474 (VAR_SUB_ONE|VAR_SUB_MATCHED)) {
1476 * Still substituting -- break it down into simple anchored cases
1477 * and if none of them fits, perform the general substitution case.
1479 if ((pattern->flags & VAR_MATCH_START) &&
1480 (strncmp(word, pattern->lhs, pattern->leftLen) == 0)) {
1482 * Anchored at start and beginning of word matches pattern
1484 if ((pattern->flags & VAR_MATCH_END) &&
1485 (wordLen == pattern->leftLen)) {
1487 * Also anchored at end and matches to the end (word
1488 * is same length as pattern) add space and rhs only
1489 * if rhs is non-null.
1491 if (pattern->rightLen != 0) {
1492 if (addSpace && vpstate->varSpace) {
1493 Buf_AddByte(buf, vpstate->varSpace);
1496 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1498 pattern->flags |= VAR_SUB_MATCHED;
1499 } else if (pattern->flags & VAR_MATCH_END) {
1501 * Doesn't match to end -- copy word wholesale
1506 * Matches at start but need to copy in trailing characters
1508 if ((pattern->rightLen + wordLen - pattern->leftLen) != 0){
1509 if (addSpace && vpstate->varSpace) {
1510 Buf_AddByte(buf, vpstate->varSpace);
1514 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1515 Buf_AddBytes(buf, wordLen - pattern->leftLen,
1516 (word + pattern->leftLen));
1517 pattern->flags |= VAR_SUB_MATCHED;
1519 } else if (pattern->flags & VAR_MATCH_START) {
1521 * Had to match at start of word and didn't -- copy whole word.
1524 } else if (pattern->flags & VAR_MATCH_END) {
1526 * Anchored at end, Find only place match could occur (leftLen
1527 * characters from the end of the word) and see if it does. Note
1528 * that because the $ will be left at the end of the lhs, we have
1531 cp = word + (wordLen - pattern->leftLen);
1533 (strncmp(cp, pattern->lhs, pattern->leftLen) == 0)) {
1535 * Match found. If we will place characters in the buffer,
1536 * add a space before hand as indicated by addSpace, then
1537 * stuff in the initial, unmatched part of the word followed
1538 * by the right-hand-side.
1540 if (((cp - word) + pattern->rightLen) != 0) {
1541 if (addSpace && vpstate->varSpace) {
1542 Buf_AddByte(buf, vpstate->varSpace);
1546 Buf_AddBytes(buf, cp - word, word);
1547 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1548 pattern->flags |= VAR_SUB_MATCHED;
1551 * Had to match at end and didn't. Copy entire word.
1557 * Pattern is unanchored: search for the pattern in the word using
1558 * String_FindSubstring, copying unmatched portions and the
1559 * right-hand-side for each match found, handling non-global
1560 * substitutions correctly, etc. When the loop is done, any
1561 * remaining part of the word (word and wordLen are adjusted
1562 * accordingly through the loop) is copied straight into the
1564 * addSpace is set FALSE as soon as a space is added to the
1571 origSize = Buf_Size(buf);
1573 cp = Str_FindSubstring(word, pattern->lhs);
1575 if (addSpace && (((cp - word) + pattern->rightLen) != 0)){
1576 Buf_AddByte(buf, vpstate->varSpace);
1579 Buf_AddBytes(buf, cp-word, word);
1580 Buf_AddBytes(buf, pattern->rightLen, pattern->rhs);
1581 wordLen -= (cp - word) + pattern->leftLen;
1582 word = cp + pattern->leftLen;
1586 if ((pattern->flags & VAR_SUB_GLOBAL) == 0) {
1589 pattern->flags |= VAR_SUB_MATCHED;
1595 if (addSpace && vpstate->varSpace) {
1596 Buf_AddByte(buf, vpstate->varSpace);
1598 Buf_AddBytes(buf, wordLen, word);
1601 * If added characters to the buffer, need to add a space
1602 * before we add any more. If we didn't add any, just return
1603 * the previous value of addSpace.
1605 return ((Buf_Size(buf) != origSize) || addSpace);
1610 if (addSpace && vpstate->varSpace) {
1611 Buf_AddByte(buf, vpstate->varSpace);
1613 Buf_AddBytes(buf, wordLen, word);
1619 *-----------------------------------------------------------------------
1621 * Print the error caused by a regcomp or regexec call.
1627 * An error gets printed.
1629 *-----------------------------------------------------------------------
1632 VarREError(int errnum, regex_t *pat, const char *str)
1637 errlen = regerror(errnum, pat, 0, 0);
1638 errbuf = bmake_malloc(errlen);
1639 regerror(errnum, pat, errbuf, errlen);
1640 Error("%s: %s", str, errbuf);
1646 *-----------------------------------------------------------------------
1647 * VarRESubstitute --
1648 * Perform a regex substitution on the given word, placing the
1649 * result in the passed buffer.
1652 * TRUE if a space is needed before more characters are added.
1657 *-----------------------------------------------------------------------
1660 VarRESubstitute(GNode *ctx MAKE_ATTR_UNUSED,
1661 Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
1662 char *word, Boolean addSpace, Buffer *buf,
1672 #define MAYBE_ADD_SPACE() \
1673 if (addSpace && !added) \
1674 Buf_AddByte(buf, ' '); \
1681 if ((pat->flags & (VAR_SUB_ONE|VAR_SUB_MATCHED)) ==
1682 (VAR_SUB_ONE|VAR_SUB_MATCHED))
1686 xrv = regexec(&pat->re, wp, pat->nsub, pat->matches, flags);
1691 pat->flags |= VAR_SUB_MATCHED;
1692 if (pat->matches[0].rm_so > 0) {
1694 Buf_AddBytes(buf, pat->matches[0].rm_so, wp);
1697 for (rp = pat->replace; *rp; rp++) {
1698 if ((*rp == '\\') && ((rp[1] == '&') || (rp[1] == '\\'))) {
1700 Buf_AddByte(buf,rp[1]);
1703 else if ((*rp == '&') ||
1704 ((*rp == '\\') && isdigit((unsigned char)rp[1]))) {
1722 if (n > pat->nsub) {
1723 Error("No subexpression %s", &errstr[0]);
1726 } else if ((pat->matches[n].rm_so == -1) &&
1727 (pat->matches[n].rm_eo == -1)) {
1728 Error("No match for subexpression %s", &errstr[0]);
1732 subbuf = wp + pat->matches[n].rm_so;
1733 sublen = pat->matches[n].rm_eo - pat->matches[n].rm_so;
1738 Buf_AddBytes(buf, sublen, subbuf);
1742 Buf_AddByte(buf, *rp);
1745 wp += pat->matches[0].rm_eo;
1746 if (pat->flags & VAR_SUB_GLOBAL) {
1747 flags |= REG_NOTBOL;
1748 if (pat->matches[0].rm_so == 0 && pat->matches[0].rm_eo == 0) {
1750 Buf_AddByte(buf, *wp);
1759 Buf_AddBytes(buf, strlen(wp), wp);
1763 VarREError(xrv, &pat->re, "Unexpected regex error");
1768 Buf_AddBytes(buf,strlen(wp),wp);
1772 return(addSpace||added);
1779 *-----------------------------------------------------------------------
1781 * Implements the :@<temp>@<string>@ modifier of ODE make.
1782 * We set the temp variable named in pattern.lhs to word and expand
1783 * pattern.rhs storing the result in the passed buffer.
1786 * word Word to modify
1787 * addSpace True if space should be added before
1789 * buf Buffer for result
1790 * pattern Datafor substitution
1793 * TRUE if a space is needed before more characters are added.
1798 *-----------------------------------------------------------------------
1801 VarLoopExpand(GNode *ctx MAKE_ATTR_UNUSED,
1802 Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
1803 char *word, Boolean addSpace, Buffer *buf,
1806 VarLoop_t *loop = (VarLoop_t *)loopp;
1810 if (word && *word) {
1811 Var_Set(loop->tvar, word, loop->ctxt, VAR_NO_EXPORT);
1812 s = Var_Subst(NULL, loop->str, loop->ctxt, loop->errnum);
1813 if (s != NULL && *s != '\0') {
1814 if (addSpace && *s != '\n')
1815 Buf_AddByte(buf, ' ');
1816 Buf_AddBytes(buf, (slen = strlen(s)), s);
1817 addSpace = (slen > 0 && s[slen - 1] != '\n');
1826 *-----------------------------------------------------------------------
1828 * Implements the :[start..end] modifier.
1829 * This is a special case of VarModify since we want to be able
1830 * to scan the list backwards if start > end.
1833 * str String whose words should be trimmed
1834 * seldata words to select
1837 * A string of all the words selected.
1842 *-----------------------------------------------------------------------
1845 VarSelectWords(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1846 const char *str, VarSelectWords_t *seldata)
1848 Buffer buf; /* Buffer for the new string */
1849 Boolean addSpace; /* TRUE if need to add a space to the
1850 * buffer before adding the trimmed
1852 char **av; /* word list */
1853 char *as; /* word list memory */
1855 int start, end, step;
1860 if (vpstate->oneBigWord) {
1861 /* fake what brk_string() would do if there were only one word */
1863 av = bmake_malloc((ac + 1) * sizeof(char *));
1864 as = bmake_strdup(str);
1868 av = brk_string(str, &ac, FALSE, &as);
1872 * Now sanitize seldata.
1873 * If seldata->start or seldata->end are negative, convert them to
1874 * the positive equivalents (-1 gets converted to argc, -2 gets
1875 * converted to (argc-1), etc.).
1877 if (seldata->start < 0)
1878 seldata->start = ac + seldata->start + 1;
1879 if (seldata->end < 0)
1880 seldata->end = ac + seldata->end + 1;
1883 * We avoid scanning more of the list than we need to.
1885 if (seldata->start > seldata->end) {
1886 start = MIN(ac, seldata->start) - 1;
1887 end = MAX(0, seldata->end - 1);
1890 start = MAX(0, seldata->start - 1);
1891 end = MIN(ac, seldata->end);
1896 (step < 0 && i >= end) || (step > 0 && i < end);
1898 if (av[i] && *av[i]) {
1899 if (addSpace && vpstate->varSpace) {
1900 Buf_AddByte(&buf, vpstate->varSpace);
1902 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
1910 return Buf_Destroy(&buf, FALSE);
1916 * Replace each word with the result of realpath()
1920 VarRealpath(GNode *ctx MAKE_ATTR_UNUSED, Var_Parse_State *vpstate,
1921 char *word, Boolean addSpace, Buffer *buf,
1922 void *patternp MAKE_ATTR_UNUSED)
1925 char rbuf[MAXPATHLEN];
1928 if (addSpace && vpstate->varSpace) {
1929 Buf_AddByte(buf, vpstate->varSpace);
1932 rp = realpath(word, rbuf);
1933 if (rp && *rp == '/' && stat(rp, &st) == 0)
1936 Buf_AddBytes(buf, strlen(word), word);
1941 *-----------------------------------------------------------------------
1943 * Modify each of the words of the passed string using the given
1944 * function. Used to implement all modifiers.
1947 * str String whose words should be trimmed
1948 * modProc Function to use to modify them
1949 * datum Datum to pass it
1952 * A string of all the words modified appropriately.
1957 *-----------------------------------------------------------------------
1960 VarModify(GNode *ctx, Var_Parse_State *vpstate,
1962 Boolean (*modProc)(GNode *, Var_Parse_State *, char *,
1963 Boolean, Buffer *, void *),
1966 Buffer buf; /* Buffer for the new string */
1967 Boolean addSpace; /* TRUE if need to add a space to the
1968 * buffer before adding the trimmed
1970 char **av; /* word list */
1971 char *as; /* word list memory */
1977 if (vpstate->oneBigWord) {
1978 /* fake what brk_string() would do if there were only one word */
1980 av = bmake_malloc((ac + 1) * sizeof(char *));
1981 as = bmake_strdup(str);
1985 av = brk_string(str, &ac, FALSE, &as);
1988 for (i = 0; i < ac; i++) {
1989 addSpace = (*modProc)(ctx, vpstate, av[i], addSpace, &buf, datum);
1995 return Buf_Destroy(&buf, FALSE);
2000 VarWordCompare(const void *a, const void *b)
2002 int r = strcmp(*(const char * const *)a, *(const char * const *)b);
2007 *-----------------------------------------------------------------------
2009 * Order the words in the string.
2012 * str String whose words should be sorted.
2013 * otype How to order: s - sort, x - random.
2016 * A string containing the words ordered.
2021 *-----------------------------------------------------------------------
2024 VarOrder(const char *str, const char otype)
2026 Buffer buf; /* Buffer for the new string */
2027 char **av; /* word list [first word does not count] */
2028 char *as; /* word list memory */
2033 av = brk_string(str, &ac, FALSE, &as);
2037 case 's': /* sort alphabetically */
2038 qsort(av, ac, sizeof(char *), VarWordCompare);
2040 case 'x': /* randomize */
2046 * We will use [ac..2] range for mod factors. This will produce
2047 * random numbers in [(ac-1)..0] interval, and minimal
2048 * reasonable value for mod factor is 2 (the mod 1 will produce
2049 * 0 with probability 1).
2051 for (i = ac-1; i > 0; i--) {
2052 rndidx = random() % (i + 1);
2060 } /* end of switch */
2062 for (i = 0; i < ac; i++) {
2063 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
2065 Buf_AddByte(&buf, ' ');
2071 return Buf_Destroy(&buf, FALSE);
2076 *-----------------------------------------------------------------------
2078 * Remove adjacent duplicate words.
2081 * str String whose words should be sorted
2084 * A string containing the resulting words.
2089 *-----------------------------------------------------------------------
2092 VarUniq(const char *str)
2094 Buffer buf; /* Buffer for new string */
2095 char **av; /* List of words to affect */
2096 char *as; /* Word list memory */
2100 av = brk_string(str, &ac, FALSE, &as);
2103 for (j = 0, i = 1; i < ac; i++)
2104 if (strcmp(av[i], av[j]) != 0 && (++j != i))
2109 for (i = 0; i < ac; i++) {
2110 Buf_AddBytes(&buf, strlen(av[i]), av[i]);
2112 Buf_AddByte(&buf, ' ');
2118 return Buf_Destroy(&buf, FALSE);
2123 *-----------------------------------------------------------------------
2125 * Pass through the tstr looking for 1) escaped delimiters,
2126 * '$'s and backslashes (place the escaped character in
2127 * uninterpreted) and 2) unescaped $'s that aren't before
2128 * the delimiter (expand the variable substitution unless flags
2129 * has VAR_NOSUBST set).
2130 * Return the expanded string or NULL if the delimiter was missing
2131 * If pattern is specified, handle escaped ampersands, and replace
2132 * unescaped ampersands with the lhs of the pattern.
2135 * A string of all the words modified appropriately.
2136 * If length is specified, return the string length of the buffer
2137 * If flags is specified and the last character of the pattern is a
2138 * $ set the VAR_MATCH_END bit of flags.
2142 *-----------------------------------------------------------------------
2145 VarGetPattern(GNode *ctxt, Var_Parse_State *vpstate MAKE_ATTR_UNUSED,
2146 int errnum, const char **tstr, int delim, int *flags,
2147 int *length, VarPattern *pattern)
2158 #define IS_A_MATCH(cp, delim) \
2159 ((cp[0] == '\\') && ((cp[1] == delim) || \
2160 (cp[1] == '\\') || (cp[1] == '$') || (pattern && (cp[1] == '&'))))
2163 * Skim through until the matching delimiter is found;
2164 * pick up variable substitutions on the way. Also allow
2165 * backslashes to quote the delimiter, $, and \, but don't
2166 * touch other backslashes.
2168 for (cp = *tstr; *cp && (*cp != delim); cp++) {
2169 if (IS_A_MATCH(cp, delim)) {
2170 Buf_AddByte(&buf, cp[1]);
2172 } else if (*cp == '$') {
2173 if (cp[1] == delim) {
2175 Buf_AddByte(&buf, *cp);
2178 * Unescaped $ at end of pattern => anchor
2181 *flags |= VAR_MATCH_END;
2183 if (flags == NULL || (*flags & VAR_NOSUBST) == 0) {
2189 * If unescaped dollar sign not before the
2190 * delimiter, assume it's a variable
2191 * substitution and recurse.
2193 cp2 = Var_Parse(cp, ctxt, errnum, &len, &freeIt);
2194 Buf_AddBytes(&buf, strlen(cp2), cp2);
2199 const char *cp2 = &cp[1];
2201 if (*cp2 == PROPEN || *cp2 == BROPEN) {
2203 * Find the end of this variable reference
2204 * and suck it in without further ado.
2205 * It will be interperated later.
2208 int want = (*cp2 == PROPEN) ? PRCLOSE : BRCLOSE;
2211 for (++cp2; *cp2 != '\0' && depth > 0; ++cp2) {
2212 if (cp2[-1] != '\\') {
2219 Buf_AddBytes(&buf, cp2 - cp, cp);
2222 Buf_AddByte(&buf, *cp);
2226 else if (pattern && *cp == '&')
2227 Buf_AddBytes(&buf, pattern->leftLen, pattern->lhs);
2229 Buf_AddByte(&buf, *cp);
2239 *length = Buf_Size(&buf);
2240 rstr = Buf_Destroy(&buf, FALSE);
2242 fprintf(debug_file, "Modifier pattern: \"%s\"\n", rstr);
2247 *-----------------------------------------------------------------------
2249 * Quote shell meta-characters in the string
2257 *-----------------------------------------------------------------------
2264 /* This should cover most shells :-( */
2265 static const char meta[] = "\n \t'`\";&<>()|*?{}[]\\$!#^~";
2266 const char *newline;
2269 if ((newline = Shell_GetNewline()) == NULL)
2271 nlen = strlen(newline);
2274 while (*str != '\0') {
2275 if ((len = strcspn(str, meta)) != 0) {
2276 Buf_AddBytes(&buf, len, str);
2278 } else if (*str == '\n') {
2279 Buf_AddBytes(&buf, nlen, newline);
2282 Buf_AddByte(&buf, '\\');
2283 Buf_AddByte(&buf, *str);
2287 str = Buf_Destroy(&buf, FALSE);
2289 fprintf(debug_file, "QuoteMeta: [%s]\n", str);
2294 *-----------------------------------------------------------------------
2296 * Hash the string using the MurmurHash3 algorithm.
2297 * Output is computed using 32bit Little Endian arithmetic.
2300 * str String to modify
2303 * Hash value of str, encoded as 8 hex digits.
2308 *-----------------------------------------------------------------------
2313 static const char hexdigits[16] = "0123456789abcdef";
2316 unsigned char *ustr = (unsigned char *)str;
2317 uint32_t h, k, c1, c2;
2324 for (len = len2; len; ) {
2328 k = (ustr[3] << 24) | (ustr[2] << 16) | (ustr[1] << 8) | ustr[0];
2333 k |= (ustr[2] << 16);
2335 k |= (ustr[1] << 8);
2340 c1 = c1 * 5 + 0x7b7d159cU;
2341 c2 = c2 * 5 + 0x6bce6396U;
2343 k = (k << 11) ^ (k >> 21);
2345 h = (h << 13) ^ (h >> 19);
2346 h = h * 5 + 0x52dce729U;
2356 for (len = 0; len < 8; ++len) {
2357 Buf_AddByte(&buf, hexdigits[h & 15]);
2361 return Buf_Destroy(&buf, FALSE);
2365 VarStrftime(const char *fmt, int zulu)
2373 strftime(buf, sizeof(buf), fmt, zulu ? gmtime(&utc) : localtime(&utc));
2375 buf[sizeof(buf) - 1] = '\0';
2376 return bmake_strdup(buf);
2380 * Now we need to apply any modifiers the user wants applied.
2382 * :M<pattern> words which match the given <pattern>.
2383 * <pattern> is of the standard file
2385 * :N<pattern> words which do not match the given <pattern>.
2386 * :S<d><pat1><d><pat2><d>[1gW]
2387 * Substitute <pat2> for <pat1> in the value
2388 * :C<d><pat1><d><pat2><d>[1gW]
2389 * Substitute <pat2> for regex <pat1> in the value
2390 * :H Substitute the head of each word
2391 * :T Substitute the tail of each word
2392 * :E Substitute the extension (minus '.') of
2394 * :R Substitute the root of each word
2395 * (pathname minus the suffix).
2396 * :O ("Order") Alphabeticaly sort words in variable.
2397 * :Ox ("intermiX") Randomize words in variable.
2398 * :u ("uniq") Remove adjacent duplicate words.
2399 * :tu Converts the variable contents to uppercase.
2400 * :tl Converts the variable contents to lowercase.
2401 * :ts[c] Sets varSpace - the char used to
2402 * separate words to 'c'. If 'c' is
2403 * omitted then no separation is used.
2404 * :tW Treat the variable contents as a single
2405 * word, even if it contains spaces.
2406 * (Mnemonic: one big 'W'ord.)
2407 * :tw Treat the variable contents as multiple
2408 * space-separated words.
2409 * (Mnemonic: many small 'w'ords.)
2410 * :[index] Select a single word from the value.
2411 * :[start..end] Select multiple words from the value.
2412 * :[*] or :[0] Select the entire value, as a single
2413 * word. Equivalent to :tW.
2414 * :[@] Select the entire value, as multiple
2415 * words. Undoes the effect of :[*].
2416 * Equivalent to :tw.
2417 * :[#] Returns the number of words in the value.
2419 * :?<true-value>:<false-value>
2420 * If the variable evaluates to true, return
2421 * true value, else return the second value.
2422 * :lhs=rhs Like :S, but the rhs goes to the end of
2424 * :sh Treat the current value as a command
2425 * to be run, new value is its output.
2426 * The following added so we can handle ODE makefiles.
2427 * :@<tmpvar>@<newval>@
2428 * Assign a temporary local variable <tmpvar>
2429 * to the current value of each word in turn
2430 * and replace each word with the result of
2431 * evaluating <newval>
2432 * :D<newval> Use <newval> as value if variable defined
2433 * :U<newval> Use <newval> as value if variable undefined
2434 * :L Use the name of the variable as the value.
2435 * :P Use the path of the node that has the same
2436 * name as the variable as the value. This
2437 * basically includes an implied :L so that
2438 * the common method of refering to the path
2439 * of your dependent 'x' in a rule is to use
2440 * the form '${x:P}'.
2441 * :!<cmd>! Run cmd much the same as :sh run's the
2442 * current value of the variable.
2443 * The ::= modifiers, actually assign a value to the variable.
2444 * Their main purpose is in supporting modifiers of .for loop
2445 * iterators and other obscure uses. They always expand to
2446 * nothing. In a target rule that would otherwise expand to an
2447 * empty line they can be preceded with @: to keep make happy.
2451 * .for i in ${.TARGET} ${.TARGET:R}.gz
2456 * ::=<str> Assigns <str> as the new value of variable.
2457 * ::?=<str> Assigns <str> as value of variable if
2458 * it was not already set.
2459 * ::+=<str> Appends <str> to variable.
2460 * ::!=<cmd> Assigns output of <cmd> as the new value of
2464 /* we now have some modifiers with long names */
2465 #define STRMOD_MATCH(s, want, n) \
2466 (strncmp(s, want, n) == 0 && (s[n] == endc || s[n] == ':'))
2469 ApplyModifiers(char *nstr, const char *tstr,
2470 int startc, int endc,
2471 Var *v, GNode *ctxt, Boolean errnum,
2472 int *lengthPtr, void **freePtr)
2475 const char *cp; /* Secondary pointer into str (place marker
2477 char *newStr; /* New value to return */
2478 char termc; /* Character which terminated scan */
2479 int cnt; /* Used to count brace pairs when variable in
2480 * in parens or braces */
2482 int modifier; /* that we are processing */
2483 Var_Parse_State parsestate; /* Flags passed to helper functions */
2486 parsestate.oneBigWord = FALSE;
2487 parsestate.varSpace = ' '; /* word separator */
2491 while (*tstr && *tstr != endc) {
2495 * We may have some complex modifiers in a variable.
2502 rval = Var_Parse(tstr, ctxt, errnum, &rlen, &freeIt);
2505 * If we have not parsed up to endc or ':',
2506 * we are not interested.
2508 if (rval != NULL && *rval &&
2509 (c = tstr[rlen]) != '\0' &&
2518 fprintf(debug_file, "Got '%s' from '%.*s'%.*s\n",
2519 rval, rlen, tstr, rlen, tstr + rlen);
2524 if (rval != NULL && *rval) {
2527 nstr = ApplyModifiers(nstr, rval,
2529 v, ctxt, errnum, &used, freePtr);
2530 if (nstr == var_Error
2531 || (nstr == varNoError && errnum == 0)
2532 || strlen(rval) != (size_t) used) {
2535 goto out; /* error already reported */
2542 else if (!*tstr && endc) {
2543 Error("Unclosed variable specification after complex modifier (expecting '%c') for %s", endc, v->name);
2550 fprintf(debug_file, "Applying[%s] :%c to \"%s\"\n", v->name,
2554 switch ((modifier = *tstr)) {
2557 if (tstr[1] == '=' ||
2559 (tstr[1] == '!' || tstr[1] == '+' || tstr[1] == '?'))) {
2561 * "::=", "::!=", "::+=", or "::?="
2563 GNode *v_ctxt; /* context where v belongs */
2569 if (v->name[0] == 0)
2575 if (v->flags & VAR_JUNK) {
2577 * We need to bmake_strdup() it incase
2578 * VarGetPattern() recurses.
2581 v->name = bmake_strdup(v->name);
2582 } else if (ctxt != VAR_GLOBAL) {
2583 Var *gv = VarFind(v->name, ctxt, 0);
2585 v_ctxt = VAR_GLOBAL;
2587 VarFreeEnv(gv, TRUE);
2590 switch ((how = *tstr)) {
2600 delim = startc == PROPEN ? PRCLOSE : BRCLOSE;
2603 pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
2607 if (v->flags & VAR_JUNK) {
2608 /* restore original name */
2612 if (pattern.rhs == NULL)
2620 Var_Append(v->name, pattern.rhs, v_ctxt);
2623 newStr = Cmd_Exec(pattern.rhs, &emsg);
2627 Var_Set(v->name, newStr, v_ctxt, 0);
2632 if ((v->flags & VAR_JUNK) == 0)
2636 Var_Set(v->name, pattern.rhs, v_ctxt, 0);
2639 free(UNCONST(pattern.rhs));
2640 newStr = varNoError;
2643 goto default_case; /* "::<unrecognised>" */
2648 int flags = VAR_NOSUBST;
2652 if ((loop.tvar = VarGetPattern(ctxt, &parsestate, errnum,
2654 &flags, &loop.tvarLen,
2658 if ((loop.str = VarGetPattern(ctxt, &parsestate, errnum,
2660 &flags, &loop.strLen,
2667 loop.errnum = errnum;
2669 newStr = VarModify(ctxt, &parsestate, nstr, VarLoopExpand,
2678 Buffer buf; /* Buffer for patterns */
2679 int wantit; /* want data in buffer */
2682 * Pass through tstr looking for 1) escaped delimiters,
2683 * '$'s and backslashes (place the escaped character in
2684 * uninterpreted) and 2) unescaped $'s that aren't before
2685 * the delimiter (expand the variable substitution).
2686 * The result is left in the Buffer buf.
2690 *cp != endc && *cp != ':' && *cp != '\0';
2692 if ((*cp == '\\') &&
2698 Buf_AddByte(&buf, cp[1]);
2700 } else if (*cp == '$') {
2702 * If unescaped dollar sign, assume it's a
2703 * variable substitution and recurse.
2709 cp2 = Var_Parse(cp, ctxt, errnum, &len, &freeIt);
2710 Buf_AddBytes(&buf, strlen(cp2), cp2);
2715 Buf_AddByte(&buf, *cp);
2722 wantit = ((v->flags & VAR_JUNK) != 0);
2724 wantit = ((v->flags & VAR_JUNK) == 0);
2725 if ((v->flags & VAR_JUNK) != 0)
2726 v->flags |= VAR_KEEP;
2728 newStr = Buf_Destroy(&buf, FALSE);
2731 Buf_Destroy(&buf, TRUE);
2737 if ((v->flags & VAR_JUNK) != 0)
2738 v->flags |= VAR_KEEP;
2739 newStr = bmake_strdup(v->name);
2748 if ((v->flags & VAR_JUNK) != 0)
2749 v->flags |= VAR_KEEP;
2750 gn = Targ_FindNode(v->name, TARG_NOCREATE);
2751 if (gn == NULL || gn->type & OP_NOPATH) {
2753 } else if (gn->path) {
2754 newStr = bmake_strdup(gn->path);
2756 newStr = Dir_FindFile(v->name, Suff_FindPath(gn));
2759 newStr = bmake_strdup(v->name);
2774 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
2776 NULL, &pattern.rightLen,
2779 newStr = Cmd_Exec(pattern.rhs, &emsg);
2780 free(UNCONST(pattern.rhs));
2785 if (v->flags & VAR_JUNK) {
2786 v->flags |= VAR_KEEP;
2793 * Look for the closing ']', recursively
2794 * expanding any embedded variables.
2796 * estr is a pointer to the expanded result,
2797 * which we must free().
2801 cp = tstr+1; /* point to char after '[' */
2802 delim = ']'; /* look for closing ']' */
2803 estr = VarGetPattern(ctxt, &parsestate,
2807 goto cleanup; /* report missing ']' */
2808 /* now cp points just after the closing ']' */
2810 if (cp[0] != ':' && cp[0] != endc) {
2811 /* Found junk after ']' */
2815 if (estr[0] == '\0') {
2816 /* Found empty square brackets in ":[]". */
2819 } else if (estr[0] == '#' && estr[1] == '\0') {
2823 * We will need enough space for the decimal
2824 * representation of an int. We calculate the
2825 * space needed for the octal representation,
2826 * and add enough slop to cope with a '-' sign
2827 * (which should never be needed) and a '\0'
2828 * string terminator.
2831 (sizeof(int) * CHAR_BIT + 2) / 3 + 2;
2833 newStr = bmake_malloc(newStrSize);
2834 if (parsestate.oneBigWord) {
2835 strncpy(newStr, "1", newStrSize);
2837 /* XXX: brk_string() is a rather expensive
2838 * way of counting words. */
2843 av = brk_string(nstr, &ac, FALSE, &as);
2844 snprintf(newStr, newStrSize, "%d", ac);
2851 } else if (estr[0] == '*' && estr[1] == '\0') {
2853 parsestate.oneBigWord = TRUE;
2858 } else if (estr[0] == '@' && estr[1] == '\0') {
2860 parsestate.oneBigWord = FALSE;
2867 * We expect estr to contain a single
2868 * integer for :[N], or two integers
2869 * separated by ".." for :[start..end].
2873 VarSelectWords_t seldata = { 0, 0 };
2875 seldata.start = strtol(estr, &ep, 0);
2877 /* Found junk instead of a number */
2880 } else if (ep[0] == '\0') {
2881 /* Found only one integer in :[N] */
2882 seldata.end = seldata.start;
2883 } else if (ep[0] == '.' && ep[1] == '.' &&
2885 /* Expecting another integer after ".." */
2887 seldata.end = strtol(ep, &ep, 0);
2888 if (ep[0] != '\0') {
2889 /* Found junk after ".." */
2894 /* Found junk instead of ".." */
2899 * Now seldata is properly filled in,
2900 * but we still have to check for 0 as
2903 if (seldata.start == 0 && seldata.end == 0) {
2904 /* ":[0]" or perhaps ":[0..0]" */
2905 parsestate.oneBigWord = TRUE;
2910 } else if (seldata.start == 0 ||
2912 /* ":[0..N]" or ":[N..0]" */
2917 * Normal case: select the words
2918 * described by seldata.
2920 newStr = VarSelectWords(ctxt, &parsestate,
2930 cp = tstr + 1; /* make sure it is set */
2931 if (STRMOD_MATCH(tstr, "gmtime", 6)) {
2932 newStr = VarStrftime(nstr, 1);
2940 cp = tstr + 1; /* make sure it is set */
2941 if (STRMOD_MATCH(tstr, "hash", 4)) {
2942 newStr = VarHash(nstr);
2950 cp = tstr + 1; /* make sure it is set */
2951 if (STRMOD_MATCH(tstr, "localtime", 9)) {
2952 newStr = VarStrftime(nstr, 0);
2961 cp = tstr + 1; /* make sure it is set */
2962 if (tstr[1] != endc && tstr[1] != ':') {
2963 if (tstr[1] == 's') {
2965 * Use the char (if any) at tstr[2]
2966 * as the word separator.
2970 if (tstr[2] != endc &&
2971 (tstr[3] == endc || tstr[3] == ':')) {
2972 /* ":ts<unrecognised><endc>" or
2973 * ":ts<unrecognised>:" */
2974 parsestate.varSpace = tstr[2];
2976 } else if (tstr[2] == endc || tstr[2] == ':') {
2977 /* ":ts<endc>" or ":ts:" */
2978 parsestate.varSpace = 0; /* no separator */
2980 } else if (tstr[2] == '\\') {
2983 parsestate.varSpace = '\n';
2987 parsestate.varSpace = '\t';
2991 if (isdigit((unsigned char)tstr[3])) {
2994 parsestate.varSpace =
2995 strtoul(&tstr[3], &ep, 0);
2996 if (*ep != ':' && *ep != endc)
3001 * ":ts<backslash><unrecognised>".
3009 * Found ":ts<unrecognised><unrecognised>".
3017 * We cannot be certain that VarModify
3018 * will be used - even if there is a
3019 * subsequent modifier, so do a no-op
3020 * VarSubstitute now to for str to be
3021 * re-expanded without the spaces.
3023 pattern.flags = VAR_SUB_ONE;
3024 pattern.lhs = pattern.rhs = "\032";
3025 pattern.leftLen = pattern.rightLen = 1;
3027 newStr = VarModify(ctxt, &parsestate, nstr,
3030 } else if (tstr[2] == endc || tstr[2] == ':') {
3032 * Check for two-character options:
3035 if (tstr[1] == 'A') { /* absolute path */
3036 newStr = VarModify(ctxt, &parsestate, nstr,
3040 } else if (tstr[1] == 'u') {
3041 char *dp = bmake_strdup(nstr);
3042 for (newStr = dp; *dp; dp++)
3043 *dp = toupper((unsigned char)*dp);
3046 } else if (tstr[1] == 'l') {
3047 char *dp = bmake_strdup(nstr);
3048 for (newStr = dp; *dp; dp++)
3049 *dp = tolower((unsigned char)*dp);
3052 } else if (tstr[1] == 'W' || tstr[1] == 'w') {
3053 parsestate.oneBigWord = (tstr[1] == 'W');
3058 /* Found ":t<unrecognised>:" or
3059 * ":t<unrecognised><endc>". */
3064 * Found ":t<unrecognised><unrecognised>".
3070 * Found ":t<endc>" or ":t:".
3080 const char *endpat; /* points just after end of pattern */
3082 Boolean copy; /* pattern should be, or has been, copied */
3090 * In the loop below, ignore ':' unless we are at
3091 * (or back to) the original brace level.
3092 * XXX This will likely not work right if $() and ${}
3096 *cp != '\0' && !(*cp == ':' && nest == 1);
3101 cp[1] == endc || cp[1] == startc)) {
3111 if (*cp == '(' || *cp == '{')
3113 if (*cp == ')' || *cp == '}') {
3123 * Need to compress the \:'s out of the pattern, so
3124 * allocate enough room to hold the uncompressed
3125 * pattern (note that cp started at tstr+1, so
3126 * cp - tstr takes the null byte into account) and
3127 * compress the pattern into the space.
3129 pattern = bmake_malloc(cp - tstr);
3130 for (cp2 = pattern, cp = tstr + 1;
3134 if ((*cp == '\\') && (cp+1 < endpat) &&
3135 (cp[1] == ':' || cp[1] == endc)) {
3144 * Either Var_Subst or VarModify will need a
3145 * nul-terminated string soon, so construct one now.
3147 pattern = bmake_strndup(tstr+1, endpat - (tstr + 1));
3151 * pattern contains embedded '$', so use Var_Subst to
3155 pattern = Var_Subst(NULL, cp2, ctxt, errnum);
3159 fprintf(debug_file, "Pattern[%s] for [%s] is [%s]\n",
3160 v->name, nstr, pattern);
3162 newStr = VarModify(ctxt, &parsestate, nstr, VarMatch,
3165 newStr = VarModify(ctxt, &parsestate, nstr, VarNoMatch,
3174 Var_Parse_State tmpparsestate;
3177 tmpparsestate = parsestate;
3182 * If pattern begins with '^', it is anchored to the
3183 * start of the word -- skip over it and flag pattern.
3186 pattern.flags |= VAR_MATCH_START;
3191 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate, errnum,
3198 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
3205 * Check for global substitution. If 'g' after the final
3206 * delimiter, substitution is global and is marked that
3212 pattern.flags |= VAR_SUB_GLOBAL;
3215 pattern.flags |= VAR_SUB_ONE;
3218 tmpparsestate.oneBigWord = TRUE;
3225 newStr = VarModify(ctxt, &tmpparsestate, nstr,
3230 * Free the two strings.
3232 free(UNCONST(pattern.lhs));
3233 free(UNCONST(pattern.rhs));
3242 /* find ':', and then substitute accordingly */
3248 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate, errnum,
3254 /* BROPEN or PROPEN */
3256 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate, errnum,
3264 if (Cond_EvalExpression(NULL, v->name, &value, 0)
3266 Error("Bad conditional expression `%s' in %s?%s:%s",
3267 v->name, v->name, pattern.lhs, pattern.rhs);
3272 newStr = UNCONST(pattern.lhs);
3273 free(UNCONST(pattern.rhs));
3275 newStr = UNCONST(pattern.rhs);
3276 free(UNCONST(pattern.lhs));
3278 if (v->flags & VAR_JUNK) {
3279 v->flags |= VAR_KEEP;
3286 VarREPattern pattern;
3289 Var_Parse_State tmpparsestate;
3292 tmpparsestate = parsestate;
3298 if ((re = VarGetPattern(ctxt, &parsestate, errnum, &cp, delim,
3299 NULL, NULL, NULL)) == NULL)
3302 if ((pattern.replace = VarGetPattern(ctxt, &parsestate,
3303 errnum, &cp, delim, NULL,
3304 NULL, NULL)) == NULL){
3312 pattern.flags |= VAR_SUB_GLOBAL;
3315 pattern.flags |= VAR_SUB_ONE;
3318 tmpparsestate.oneBigWord = TRUE;
3326 error = regcomp(&pattern.re, re, REG_EXTENDED);
3329 *lengthPtr = cp - start + 1;
3330 VarREError(error, &pattern.re, "RE substitution error");
3331 free(pattern.replace);
3335 pattern.nsub = pattern.re.re_nsub + 1;
3336 if (pattern.nsub < 1)
3338 if (pattern.nsub > 10)
3340 pattern.matches = bmake_malloc(pattern.nsub *
3341 sizeof(regmatch_t));
3342 newStr = VarModify(ctxt, &tmpparsestate, nstr,
3345 regfree(&pattern.re);
3346 free(pattern.replace);
3347 free(pattern.matches);
3353 if (tstr[1] == endc || tstr[1] == ':') {
3354 newStr = VarQuote(nstr);
3361 if (tstr[1] == endc || tstr[1] == ':') {
3362 newStr = VarModify(ctxt, &parsestate, nstr, VarTail,
3370 if (tstr[1] == endc || tstr[1] == ':') {
3371 newStr = VarModify(ctxt, &parsestate, nstr, VarHead,
3379 if (tstr[1] == endc || tstr[1] == ':') {
3380 newStr = VarModify(ctxt, &parsestate, nstr, VarSuffix,
3388 if (tstr[1] == endc || tstr[1] == ':') {
3389 newStr = VarModify(ctxt, &parsestate, nstr, VarRoot,
3400 cp = tstr + 1; /* skip to the rest in any case */
3401 if (tstr[1] == endc || tstr[1] == ':') {
3404 } else if ( (tstr[1] == 'x') &&
3405 (tstr[2] == endc || tstr[2] == ':') ) {
3412 newStr = VarOrder(nstr, otype);
3416 if (tstr[1] == endc || tstr[1] == ':') {
3417 newStr = VarUniq(nstr);
3425 if (tstr[1] == 'h' && (tstr[2] == endc || tstr[2] == ':')) {
3427 newStr = Cmd_Exec(nstr, &emsg);
3441 * This can either be a bogus modifier or a System-V
3442 * substitution command.
3450 * First we make a pass through the string trying
3451 * to verify it is a SYSV-make-style translation:
3452 * it must be: <string1>=<string2>)
3456 while (*cp != '\0' && cnt) {
3459 /* continue looking for endc */
3461 else if (*cp == endc)
3463 else if (*cp == startc)
3468 if (*cp == endc && eqFound) {
3471 * Now we break this sucker into the lhs and
3472 * rhs. We must null terminate them of course.
3476 if ((pattern.lhs = VarGetPattern(ctxt, &parsestate,
3477 errnum, &cp, delim, &pattern.flags,
3478 &pattern.leftLen, NULL)) == NULL)
3481 if ((pattern.rhs = VarGetPattern(ctxt, &parsestate,
3482 errnum, &cp, delim, NULL, &pattern.rightLen,
3487 * SYSV modifications happen through the whole
3488 * string. Note the pattern is anchored at the end.
3492 if (pattern.leftLen == 0 && *nstr == '\0') {
3493 newStr = nstr; /* special case */
3495 newStr = VarModify(ctxt, &parsestate, nstr,
3499 free(UNCONST(pattern.lhs));
3500 free(UNCONST(pattern.rhs));
3504 Error("Unknown modifier '%c'", *tstr);
3506 *cp != ':' && *cp != endc && *cp != '\0';
3515 fprintf(debug_file, "Result[%s] of :%c is \"%s\"\n",
3516 v->name, modifier, newStr);
3519 if (newStr != nstr) {
3525 if (nstr != var_Error && nstr != varNoError) {
3529 if (termc == '\0' && endc != '\0') {
3530 Error("Unclosed variable specification (expecting '%c') for \"%s\" (value \"%s\") modifier %c", endc, v->name, nstr, modifier);
3531 } else if (termc == ':') {
3537 *lengthPtr = tstr - start;
3542 Error("Bad modifier `:%.*s' for %s", (int)strcspn(tstr, ":)}"), tstr,
3546 *lengthPtr = cp - start;
3548 Error("Unclosed substitution for %s (%c missing)",
3558 *-----------------------------------------------------------------------
3560 * Given the start of a variable invocation, extract the variable
3561 * name and find its value, then modify it according to the
3565 * str The string to parse
3566 * ctxt The context for the variable
3567 * errnum TRUE if undefined variables are an error
3568 * lengthPtr OUT: The length of the specification
3569 * freePtr OUT: Non-NULL if caller should free *freePtr
3572 * The (possibly-modified) value of the variable or var_Error if the
3573 * specification is invalid. The length of the specification is
3574 * placed in *lengthPtr (for invalid specifications, this is just
3576 * If *freePtr is non-NULL then it's a pointer that the caller
3577 * should pass to free() to free memory used by the result.
3582 *-----------------------------------------------------------------------
3584 /* coverity[+alloc : arg-*4] */
3586 Var_Parse(const char *str, GNode *ctxt, Boolean errnum, int *lengthPtr,
3589 const char *tstr; /* Pointer into str */
3590 Var *v; /* Variable in invocation */
3591 Boolean haveModifier;/* TRUE if have modifiers for the variable */
3592 char endc; /* Ending character when variable in parens
3594 char startc; /* Starting character when variable in parens
3596 int vlen; /* Length of variable name */
3597 const char *start; /* Points to original start of str */
3598 char *nstr; /* New string, used during expansion */
3599 Boolean dynamic; /* TRUE if the variable is local and we're
3600 * expanding it in a non-local context. This
3601 * is done to support dynamic sources. The
3602 * result is just the invocation, unaltered */
3603 const char *extramodifiers; /* extra modifiers to apply first */
3607 extramodifiers = NULL;
3612 if (startc != PROPEN && startc != BROPEN) {
3614 * If it's not bounded by braces of some sort, life is much simpler.
3615 * We just need to check for the first character and return the
3616 * value if it exists.
3619 /* Error out some really stupid names */
3620 if (startc == '\0' || strchr(")}:$", startc)) {
3627 v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
3631 if ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)) {
3633 * If substituting a local variable in a non-local context,
3634 * assume it's for dynamic source stuff. We have to handle
3635 * this specially and return the longhand for the variable
3636 * with the dollar sign escaped so it makes it back to the
3637 * caller. Only four of the local variables are treated
3638 * specially as they are the only four that will be set
3639 * when dynamic sources are expanded.
3643 return UNCONST("$(.TARGET)");
3645 return UNCONST("$(.ARCHIVE)");
3647 return UNCONST("$(.PREFIX)");
3649 return UNCONST("$(.MEMBER)");
3655 return (errnum ? var_Error : varNoError);
3657 haveModifier = FALSE;
3662 Buffer buf; /* Holds the variable name */
3665 endc = startc == PROPEN ? PRCLOSE : BRCLOSE;
3669 * Skip to the end character or a colon, whichever comes first.
3671 for (tstr = str + 2; *tstr != '\0'; tstr++)
3674 * Track depth so we can spot parse errors.
3676 if (*tstr == startc) {
3679 if (*tstr == endc) {
3683 if (depth == 1 && *tstr == ':') {
3687 * A variable inside a variable, expand
3692 char *rval = Var_Parse(tstr, ctxt, errnum, &rlen, &freeIt);
3694 Buf_AddBytes(&buf, strlen(rval), rval);
3701 Buf_AddByte(&buf, *tstr);
3704 haveModifier = TRUE;
3705 } else if (*tstr == endc) {
3706 haveModifier = FALSE;
3709 * If we never did find the end character, return NULL
3710 * right now, setting the length to be the distance to
3711 * the end of the string, since that's what make does.
3713 *lengthPtr = tstr - str;
3714 Buf_Destroy(&buf, TRUE);
3717 str = Buf_GetAll(&buf, &vlen);
3720 * At this point, str points into newly allocated memory from
3721 * buf, containing only the name of the variable.
3723 * start and tstr point into the const string that was pointed
3724 * to by the original value of the str parameter. start points
3725 * to the '$' at the beginning of the string, while tstr points
3726 * to the char just after the end of the variable name -- this
3727 * will be '\0', ':', PRCLOSE, or BRCLOSE.
3730 v = VarFind(str, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD);
3732 * Check also for bogus D and F forms of local variables since we're
3733 * in a local context and the name is the right length.
3735 if ((v == NULL) && (ctxt != VAR_CMD) && (ctxt != VAR_GLOBAL) &&
3736 (vlen == 2) && (str[1] == 'F' || str[1] == 'D') &&
3737 strchr("@%?*!<>", str[0]) != NULL) {
3739 * Well, it's local -- go look for it.
3743 v = VarFind(name, ctxt, 0);
3746 if (str[1] == 'D') {
3747 extramodifiers = "H:";
3750 extramodifiers = "T:";
3757 (((vlen == 2) && (str[1] == 'F' || str[1] == 'D')))) &&
3758 ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)))
3761 * If substituting a local variable in a non-local context,
3762 * assume it's for dynamic source stuff. We have to handle
3763 * this specially and return the longhand for the variable
3764 * with the dollar sign escaped so it makes it back to the
3765 * caller. Only four of the local variables are treated
3766 * specially as they are the only four that will be set
3767 * when dynamic sources are expanded.
3777 } else if ((vlen > 2) && (*str == '.') &&
3778 isupper((unsigned char) str[1]) &&
3779 ((ctxt == VAR_CMD) || (ctxt == VAR_GLOBAL)))
3784 if ((strncmp(str, ".TARGET", len) == 0) ||
3785 (strncmp(str, ".ARCHIVE", len) == 0) ||
3786 (strncmp(str, ".PREFIX", len) == 0) ||
3787 (strncmp(str, ".MEMBER", len) == 0))
3793 if (!haveModifier) {
3795 * No modifiers -- have specification length so we can return
3798 *lengthPtr = tstr - start + 1;
3800 char *pstr = bmake_strndup(start, *lengthPtr);
3802 Buf_Destroy(&buf, TRUE);
3805 Buf_Destroy(&buf, TRUE);
3806 return (errnum ? var_Error : varNoError);
3810 * Still need to get to the end of the variable specification,
3811 * so kludge up a Var structure for the modifications
3813 v = bmake_malloc(sizeof(Var));
3814 v->name = UNCONST(str);
3815 Buf_Init(&v->val, 1);
3816 v->flags = VAR_JUNK;
3817 Buf_Destroy(&buf, FALSE);
3820 Buf_Destroy(&buf, TRUE);
3823 if (v->flags & VAR_IN_USE) {
3824 Fatal("Variable %s is recursive.", v->name);
3827 v->flags |= VAR_IN_USE;
3830 * Before doing any modification, we have to make sure the value
3831 * has been fully expanded. If it looks like recursion might be
3832 * necessary (there's a dollar sign somewhere in the variable's value)
3833 * we just call Var_Subst to do any other substitutions that are
3834 * necessary. Note that the value returned by Var_Subst will have
3835 * been dynamically-allocated, so it will need freeing when we
3838 nstr = Buf_GetAll(&v->val, NULL);
3839 if (strchr(nstr, '$') != NULL) {
3840 nstr = Var_Subst(NULL, nstr, ctxt, errnum);
3844 v->flags &= ~VAR_IN_USE;
3846 if ((nstr != NULL) && (haveModifier || extramodifiers != NULL)) {
3851 if (extramodifiers != NULL) {
3852 nstr = ApplyModifiers(nstr, extramodifiers, '(', ')',
3853 v, ctxt, errnum, &used, &extraFree);
3857 /* Skip initial colon. */
3860 nstr = ApplyModifiers(nstr, tstr, startc, endc,
3861 v, ctxt, errnum, &used, freePtr);
3867 *freePtr = extraFree;
3871 *lengthPtr = tstr - start + 1;
3873 *lengthPtr = tstr - start;
3876 if (v->flags & VAR_FROM_ENV) {
3877 Boolean destroy = FALSE;
3879 if (nstr != Buf_GetAll(&v->val, NULL)) {
3883 * Returning the value unmodified, so tell the caller to free
3888 VarFreeEnv(v, destroy);
3889 } else if (v->flags & VAR_JUNK) {
3891 * Perform any free'ing needed and set *freePtr to NULL so the caller
3892 * doesn't try to free a static pointer.
3893 * If VAR_KEEP is also set then we want to keep str as is.
3895 if (!(v->flags & VAR_KEEP)) {
3901 nstr = bmake_strndup(start, *lengthPtr);
3904 nstr = errnum ? var_Error : varNoError;
3907 if (nstr != Buf_GetAll(&v->val, NULL))
3908 Buf_Destroy(&v->val, TRUE);
3916 *-----------------------------------------------------------------------
3918 * Substitute for all variables in the given string in the given context
3919 * If undefErr is TRUE, Parse_Error will be called when an undefined
3920 * variable is encountered.
3923 * var Named variable || NULL for all
3924 * str the string which to substitute
3925 * ctxt the context wherein to find variables
3926 * undefErr TRUE if undefineds are an error
3929 * The resulting string.
3932 * None. The old string must be freed by the caller
3933 *-----------------------------------------------------------------------
3936 Var_Subst(const char *var, const char *str, GNode *ctxt, Boolean undefErr)
3938 Buffer buf; /* Buffer for forming things */
3939 char *val; /* Value to substitute for a variable */
3940 int length; /* Length of the variable invocation */
3941 Boolean trailingBslash; /* variable ends in \ */
3942 void *freeIt = NULL; /* Set if it should be freed */
3943 static Boolean errorReported; /* Set true if an error has already
3944 * been reported to prevent a plethora
3945 * of messages when recursing */
3948 errorReported = FALSE;
3949 trailingBslash = FALSE;
3952 if (*str == '\n' && trailingBslash)
3953 Buf_AddByte(&buf, ' ');
3954 if (var == NULL && (*str == '$') && (str[1] == '$')) {
3956 * A dollar sign may be escaped either with another dollar sign.
3957 * In such a case, we skip over the escape character and store the
3958 * dollar sign into the buffer directly.
3961 Buf_AddByte(&buf, *str);
3963 } else if (*str != '$') {
3965 * Skip as many characters as possible -- either to the end of
3966 * the string or to the next dollar sign (variable invocation).
3970 for (cp = str++; *str != '$' && *str != '\0'; str++)
3972 Buf_AddBytes(&buf, str - cp, cp);
3977 if (str[1] == '\0') {
3978 /* A trailing $ is kind of a special case */
3979 Buf_AddByte(&buf, str[0]);
3982 } else if (str[1] != PROPEN && str[1] != BROPEN) {
3983 if (str[1] != *var || strlen(var) > 1) {
3984 Buf_AddBytes(&buf, 2, str);
3996 * Scan up to the end of the variable name.
3998 for (p = &str[2]; *p &&
3999 *p != ':' && *p != PRCLOSE && *p != BRCLOSE; p++)
4003 * A variable inside the variable. We cannot expand
4004 * the external variable yet, so we try again with
4008 Buf_AddBytes(&buf, p - str, str);
4013 if (strncmp(var, str + 2, p - str - 2) != 0 ||
4014 var[p - str - 2] != '\0') {
4016 * Not the variable we want to expand, scan
4017 * until the next variable
4019 for (;*p != '$' && *p != '\0'; p++)
4021 Buf_AddBytes(&buf, p - str, str);
4034 val = Var_Parse(str, ctxt, undefErr, &length, &freeIt);
4037 * When we come down here, val should either point to the
4038 * value of this variable, suitably modified, or be NULL.
4039 * Length should be the total length of the potential
4040 * variable invocation (from $ to end character...)
4042 if (val == var_Error || val == varNoError) {
4044 * If performing old-time variable substitution, skip over
4045 * the variable and continue with the substitution. Otherwise,
4046 * store the dollar sign and advance str so we continue with
4051 } else if (undefErr || val == var_Error) {
4053 * If variable is undefined, complain and skip the
4054 * variable. The complaint will stop us from doing anything
4055 * when the file is parsed.
4057 if (!errorReported) {
4058 Parse_Error(PARSE_FATAL,
4059 "Undefined variable \"%.*s\"",length,str);
4062 errorReported = TRUE;
4064 Buf_AddByte(&buf, *str);
4069 * We've now got a variable structure to store in. But first,
4070 * advance the string pointer.
4075 * Copy all the characters from the variable value straight
4076 * into the new string.
4078 length = strlen(val);
4079 Buf_AddBytes(&buf, length, val);
4080 trailingBslash = length > 0 && val[length - 1] == '\\';
4089 return Buf_DestroyCompact(&buf);
4093 *-----------------------------------------------------------------------
4095 * Return the tail from each of a list of words. Used to set the
4096 * System V local variables.
4099 * file Filename to modify
4102 * The resulting string.
4107 *-----------------------------------------------------------------------
4111 Var_GetTail(char *file)
4113 return(VarModify(file, VarTail, NULL));
4117 *-----------------------------------------------------------------------
4119 * Find the leading components of a (list of) filename(s).
4120 * XXX: VarHead does not replace foo by ., as (sun) System V make
4124 * file Filename to manipulate
4127 * The leading components.
4132 *-----------------------------------------------------------------------
4135 Var_GetHead(char *file)
4137 return(VarModify(file, VarHead, NULL));
4142 *-----------------------------------------------------------------------
4144 * Initialize the module
4150 * The VAR_CMD and VAR_GLOBAL contexts are created
4151 *-----------------------------------------------------------------------
4156 VAR_INTERNAL = Targ_NewGN("Internal");
4157 VAR_GLOBAL = Targ_NewGN("Global");
4158 VAR_CMD = Targ_NewGN("Command");
4169 /****************** PRINT DEBUGGING INFO *****************/
4171 VarPrintVar(void *vp)
4174 fprintf(debug_file, "%-16s = %s\n", v->name, Buf_GetAll(&v->val, NULL));
4178 *-----------------------------------------------------------------------
4180 * print all variables in a context
4181 *-----------------------------------------------------------------------
4184 Var_Dump(GNode *ctxt)
4189 for (h = Hash_EnumFirst(&ctxt->context, &search);
4191 h = Hash_EnumNext(&search)) {
4192 VarPrintVar(Hash_GetValue(h));