2 * Copyright (c) 2002 Juli Mallett.
3 * Copyright (c) 1988, 1989, 1990, 1993
4 * The Regents of the University of California. All rights reserved.
5 * Copyright (c) 1989 by Berkeley Softworks
8 * This code is derived from software contributed to Berkeley by
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * @(#)var.c 8.3 (Berkeley) 3/19/94
42 #include <sys/cdefs.h>
43 __FBSDID("$FreeBSD$");
47 * Variable-handling functions
50 * Var_Set Set the value of a variable in the given
51 * context. The variable is created if it doesn't
52 * yet exist. The value and variable name need not
55 * Var_Append Append more characters to an existing variable
56 * in the given context. The variable needn't
57 * exist already -- it will be created if it doesn't.
58 * A space is placed between the old value and the
61 * Var_Exists See if a variable exists.
63 * Var_Value Return the value of a variable in a context or
64 * NULL if the variable is undefined.
66 * Var_Subst Substitute named variable, or all variables if
67 * NULL in a string using
68 * the given context as the top-most one. If the
69 * third argument is non-zero, Parse_Error is
70 * called if any variables are undefined.
72 * Var_Parse Parse a variable expansion from a string and
73 * return the result and the number of characters
76 * Var_Delete Delete a variable in a context.
78 * Var_Init Initialize this module.
81 * Var_Dump Print out all variables defined in the given
84 * XXX: There's a lot of duplication in these functions.
91 #include <sys/types.h>
110 typedef struct VarParser {
111 const char *const input; /* pointer to input string */
112 const char *ptr; /* current parser pos in input str */
119 char *name; /* the variable's name */
120 struct Buffer *val; /* its value */
121 int flags; /* miscellaneous status flags */
123 #define VAR_IN_USE 1 /* Variable's value currently being used.
124 * Used to avoid recursion */
126 #define VAR_JUNK 4 /* Variable is a junk variable that
127 * should be destroyed when done with
128 * it. Used by Var_Parse for undefined,
129 * modified variables */
131 #define VAR_TO_ENV 8 /* Place variable in environment */
135 struct Buffer *lhs; /* String to match */
136 struct Buffer *rhs; /* Replacement string (w/ &'s removed) */
143 #define VAR_SUB_GLOBAL 0x01 /* Apply substitution globally */
144 #define VAR_SUB_ONE 0x02 /* Apply substitution to one word */
145 #define VAR_SUB_MATCHED 0x04 /* There was a match */
146 #define VAR_MATCH_START 0x08 /* Match at start of word */
147 #define VAR_MATCH_END 0x10 /* Match at end of word */
150 typedef Boolean VarModifyProc(const char *, Boolean, struct Buffer *, void *);
152 static char *VarParse(VarParser *, Boolean *);
155 * This is a harmless return value for Var_Parse that can be used by Var_Subst
156 * to determine if there was an error in parsing -- easier than returning
157 * a flag, as things outside this module don't give a hoot.
159 char var_Error[] = "";
162 * Similar to var_Error, but returned when the 'err' flag for Var_Parse is
163 * set false. Why not just use a constant? Well, gcc likes to condense
164 * identical string instances...
166 static char varNoError[] = "";
169 * Internally, variables are contained in four different contexts.
170 * 1) the environment. They may not be changed. If an environment
171 * variable is appended-to, the result is placed in the global
173 * 2) the global context. Variables set in the Makefile are located in
174 * the global context. It is the penultimate context searched when
176 * 3) the command-line context. All variables set on the command line
177 * are placed in this context. They are UNALTERABLE once placed here.
178 * 4) the local context. Each target has associated with it a context
179 * list. On this list are located the structures describing such
180 * local variables as $(@) and $(*)
181 * The four contexts are searched in the reverse order from which they are
184 static GNode *VAR_ENV; /* variables from the environment */
185 GNode *VAR_GLOBAL; /* variables from the makefile */
186 GNode *VAR_CMD; /* variables defined on the command-line */
188 Boolean oldVars; /* variable substitution style */
189 Boolean checkEnvFirst; /* -e flag */
191 #define OPEN_PAREN '('
192 #define CLOSE_PAREN ')'
193 #define OPEN_BRACE '{'
194 #define CLOSE_BRACE '}'
197 * Create a Var object.
200 * name Name of variable (copied).
201 * value Value of variable (copied) or NULL.
202 * flags Flags set on variable.
208 VarCreate(const char name[], const char value[], int flags)
212 v = emalloc(sizeof(Var));
213 v->name = estrdup(name);
214 v->val = Buf_Init(0);
218 Buf_Append(v->val, value);
224 * Destroy a Var object.
227 * v Object to destroy.
228 * f True if internal buffer in Buffer object is to be removed.
231 VarDestroy(Var *v, Boolean f)
234 Buf_Destroy(v->val, f);
240 * Remove the tail of the given word and place the result in the given
244 * TRUE if characters were added to the buffer (a space needs to be
245 * added to the buffer before the next word).
248 * The trimmed word is added to the buffer.
251 VarHead(const char *word, Boolean addSpace, Buffer *buf, void *dummy __unused)
255 slash = strrchr(word, '/');
258 Buf_AddByte(buf, (Byte)' ');
260 Buf_AppendRange(buf, word, slash);
263 * If no directory part, give . (q.v. the POSIX standard)
266 Buf_Append(buf, " .");
268 Buf_AddByte(buf, (Byte)'.');
275 * Remove the head of the given word and place the result in the given
279 * TRUE if characters were added to the buffer (a space needs to be
280 * added to the buffer before the next word).
283 * The trimmed word is added to the buffer.
286 VarTail(const char *word, Boolean addSpace, Buffer *buf, void *dummy __unused)
291 Buf_AddByte (buf, (Byte)' ');
294 slash = strrchr(word, '/');
297 Buf_Append(buf, slash);
299 Buf_Append(buf, word);
305 * Place the suffix of the given word in the given buffer.
308 * TRUE if characters were added to the buffer (a space needs to be
309 * added to the buffer before the next word).
312 * The suffix from the word is placed in the buffer.
315 VarSuffix(const char *word, Boolean addSpace, Buffer *buf, void *dummy __unused)
319 dot = strrchr(word, '.');
322 Buf_AddByte(buf, (Byte)' ');
325 Buf_Append(buf, dot);
332 * Remove the suffix of the given word and place the result in the
336 * TRUE if characters were added to the buffer (a space needs to be
337 * added to the buffer before the next word).
340 * The trimmed word is added to the buffer.
343 VarRoot(const char *word, Boolean addSpace, Buffer *buf, void *dummy __unused)
348 Buf_AddByte(buf, (Byte)' ');
351 dot = strrchr(word, '.');
353 Buf_AppendRange(buf, word, dot);
355 Buf_Append(buf, word);
361 * Place the word in the buffer if it matches the given pattern.
362 * Callback function for VarModify to implement the :M modifier.
363 * A space will be added if requested. A pattern is supplied
364 * which the word must match.
367 * TRUE if a space should be placed in the buffer before the next
371 * The word may be copied to the buffer.
374 VarMatch(const char *word, Boolean addSpace, Buffer *buf, void *pattern)
377 if (Str_Match(word, pattern)) {
379 Buf_AddByte(buf, (Byte)' ');
382 Buf_Append(buf, word);
389 * Place the word in the buffer if it matches the given pattern.
390 * Callback function for VarModify to implement the System V %
391 * modifiers. A space is added if requested.
394 * TRUE if a space should be placed in the buffer before the next
398 * The word may be copied to the buffer.
401 VarSYSVMatch(const char *word, Boolean addSpace, Buffer *buf, void *patp)
405 VarPattern *pat = (VarPattern *)patp;
408 Buf_AddByte(buf, (Byte)' ');
412 if ((ptr = Str_SYSVMatch(word, Buf_Data(pat->lhs), &len)) != NULL)
413 Str_SYSVSubst(buf, Buf_Data(pat->rhs), ptr, len);
415 Buf_Append(buf, word);
422 * Place the word in the buffer if it doesn't match the given pattern.
423 * Callback function for VarModify to implement the :N modifier. A
424 * space is added if requested.
427 * TRUE if a space should be placed in the buffer before the next
431 * The word may be copied to the buffer.
434 VarNoMatch(const char *word, Boolean addSpace, Buffer *buf, void *pattern)
437 if (!Str_Match(word, pattern)) {
439 Buf_AddByte(buf, (Byte)' ');
442 Buf_Append(buf, word);
448 * Perform a string-substitution on the given word, placing the
449 * result in the passed buffer. A space is added if requested.
452 * TRUE if a space is needed before more characters are added.
455 VarSubstitute(const char *word, Boolean addSpace, Buffer *buf, void *patternp)
457 size_t wordLen; /* Length of word */
458 const char *cp; /* General pointer */
459 VarPattern *pattern = patternp;
461 wordLen = strlen(word);
462 if (1) { /* substitute in each word of the variable */
464 * Break substitution down into simple anchored cases
465 * and if none of them fits, perform the general substitution
468 if ((pattern->flags & VAR_MATCH_START) &&
469 (strncmp(word, Buf_Data(pattern->lhs),
470 Buf_Size(pattern->lhs)) == 0)) {
472 * Anchored at start and beginning of word matches
475 if ((pattern->flags & VAR_MATCH_END) &&
476 (wordLen == Buf_Size(pattern->lhs))) {
478 * Also anchored at end and matches to the end
479 * (word is same length as pattern) add space
480 * and rhs only if rhs is non-null.
482 if (Buf_Size(pattern->rhs) != 0) {
484 Buf_AddByte(buf, (Byte)' ');
487 Buf_AppendBuf(buf, pattern->rhs);
490 } else if (pattern->flags & VAR_MATCH_END) {
492 * Doesn't match to end -- copy word wholesale
498 * Matches at start but need to copy in
499 * trailing characters.
501 if ((Buf_Size(pattern->rhs) + wordLen -
502 Buf_Size(pattern->lhs)) != 0) {
504 Buf_AddByte(buf, (Byte)' ');
508 Buf_AppendBuf(buf, pattern->rhs);
509 Buf_AddBytes(buf, wordLen -
510 Buf_Size(pattern->lhs),
511 (word + Buf_Size(pattern->lhs)));
514 } else if (pattern->flags & VAR_MATCH_START) {
516 * Had to match at start of word and didn't -- copy
521 } else if (pattern->flags & VAR_MATCH_END) {
523 * Anchored at end, Find only place match could occur
524 * (leftLen characters from the end of the word) and
525 * see if it does. Note that because the $ will be
526 * left at the end of the lhs, we have to use strncmp.
528 cp = word + (wordLen - Buf_Size(pattern->lhs));
529 if ((cp >= word) && (strncmp(cp, Buf_Data(pattern->lhs),
530 Buf_Size(pattern->lhs)) == 0)) {
532 * Match found. If we will place characters in
533 * the buffer, add a space before hand as
534 * indicated by addSpace, then stuff in the
535 * initial, unmatched part of the word followed
536 * by the right-hand-side.
538 if ((cp - word) + Buf_Size(pattern->rhs) != 0) {
540 Buf_AddByte(buf, (Byte)' ');
544 Buf_AppendRange(buf, word, cp);
545 Buf_AppendBuf(buf, pattern->rhs);
549 * Had to match at end and didn't. Copy entire
556 * Pattern is unanchored: search for the pattern in the
557 * word using strstr(3), copying unmatched portions and
558 * the right-hand-side for each match found, handling
559 * non-global substitutions correctly, etc. When the
560 * loop is done, any remaining part of the word (word
561 * and wordLen are adjusted accordingly through the
562 * loop) is copied straight into the buffer.
563 * addSpace is set FALSE as soon as a space is added
570 origSize = Buf_Size(buf);
572 cp = strstr(word, Buf_Data(pattern->lhs));
574 if (addSpace && (((cp - word) +
575 Buf_Size(pattern->rhs)) != 0)) {
576 Buf_AddByte(buf, (Byte)' ');
579 Buf_AppendRange(buf, word, cp);
580 Buf_AppendBuf(buf, pattern->rhs);
581 wordLen -= (cp - word) +
582 Buf_Size(pattern->lhs);
583 word = cp + Buf_Size(pattern->lhs);
584 if (wordLen == 0 || (pattern->flags &
585 VAR_SUB_GLOBAL) == 0) {
594 Buf_AddByte(buf, (Byte)' ');
596 Buf_AddBytes(buf, wordLen, (const Byte *)word);
600 * If added characters to the buffer, need to add a
601 * space before we add any more. If we didn't add any,
602 * just return the previous value of addSpace.
604 return ((Buf_Size(buf) != origSize) || addSpace);
607 * Common code for anchored substitutions:
608 * addSpace was set TRUE if characters were added to the buffer.
614 Buf_AddByte(buf, (Byte)' ');
616 Buf_AddBytes(buf, wordLen, (const Byte *)word);
621 * Print the error caused by a regcomp or regexec call.
624 * An error gets printed.
627 VarREError(int err, regex_t *pat, const char *str)
632 errlen = regerror(err, pat, 0, 0);
633 errbuf = emalloc(errlen);
634 regerror(err, pat, errbuf, errlen);
635 Error("%s: %s", str, errbuf);
641 * Perform a regex substitution on the given word, placing the
642 * result in the passed buffer. A space is added if requested.
645 * TRUE if a space is needed before more characters are added.
648 VarRESubstitute(const char *word, Boolean addSpace, Buffer *buf, void *patternp)
657 #define MAYBE_ADD_SPACE() \
658 if (addSpace && !added) \
659 Buf_AddByte(buf, (Byte)' '); \
666 if ((pat->flags & (VAR_SUB_ONE | VAR_SUB_MATCHED)) ==
667 (VAR_SUB_ONE | VAR_SUB_MATCHED)) {
671 xrv = regexec(&pat->re, wp, pat->nsub, pat->matches, flags);
676 pat->flags |= VAR_SUB_MATCHED;
677 if (pat->matches[0].rm_so > 0) {
679 Buf_AddBytes(buf, pat->matches[0].rm_so,
683 for (rp = Buf_Data(pat->rhs); *rp; rp++) {
684 if ((*rp == '\\') && ((rp[1] == '&') || (rp[1] == '\\'))) {
686 Buf_AddByte(buf, (Byte)rp[1]);
689 } else if ((*rp == '&') ||
690 ((*rp == '\\') && isdigit((unsigned char)rp[1]))) {
709 Error("No subexpression %s",
714 } else if ((pat->matches[n].rm_so == -1) &&
715 (pat->matches[n].rm_eo == -1)) {
716 Error("No match for subexpression %s",
722 subbuf = wp + pat->matches[n].rm_so;
723 sublen = pat->matches[n].rm_eo -
724 pat->matches[n].rm_so;
729 Buf_AddBytes(buf, sublen,
730 (const Byte *)subbuf);
734 Buf_AddByte(buf, (Byte)*rp);
737 wp += pat->matches[0].rm_eo;
738 if (pat->flags & VAR_SUB_GLOBAL) {
740 if (pat->matches[0].rm_so == 0 &&
741 pat->matches[0].rm_eo == 0) {
743 Buf_AddByte(buf, (Byte)*wp);
756 VarREError(xrv, &pat->re, "Unexpected regex error");
766 return (addSpace || added);
770 * Find a variable in a variable list.
773 VarLookup(Lst *vlist, const char *name)
777 LST_FOREACH(ln, vlist)
778 if (strcmp(((const Var *)Lst_Datum(ln))->name, name) == 0)
779 return (Lst_Datum(ln));
784 * Expand a variable name's embedded variables in the given context.
787 * The contents of name, possibly expanded.
790 VarPossiblyExpand(const char *name, GNode *ctxt)
794 if (strchr(name, '$') != NULL) {
795 buf = Var_Subst(name, ctxt, 0);
796 return (Buf_Peel(buf));
798 return estrdup(name);
803 * If the variable name begins with a '.', it could very well be
804 * one of the local ones. We check the name against all the local
805 * variables and substitute the short version in for 'name' if it
806 * matches one of them.
809 VarLocal(const char name[])
811 if (name[0] == '.') {
814 if (!strcmp(name, ".ALLSRC"))
816 if (!strcmp(name, ".ARCHIVE"))
820 if (!strcmp(name, ".IMPSRC"))
824 if (!strcmp(name, ".MEMBER"))
828 if (!strcmp(name, ".OODATE"))
832 if (!strcmp(name, ".PREFIX"))
836 if (!strcmp(name, ".TARGET"))
847 * Find the given variable in the given context and the enviornment.
850 * A pointer to the structure describing the desired variable or
851 * NULL if the variable does not exist.
854 VarFindEnv(const char name[], GNode *ctxt)
858 name = VarLocal(name);
860 if ((var = VarLookup(&ctxt->context, name)) != NULL)
863 if ((var = VarLookup(&VAR_ENV->context, name)) != NULL)
870 * Look for the variable in the given context.
873 VarFindOnly(const char name[], GNode *ctxt)
877 name = VarLocal(name);
879 if ((var = VarLookup(&ctxt->context, name)) != NULL)
886 * Look for the variable in all contexts.
889 VarFindAny(const char name[], GNode *ctxt)
891 Boolean localCheckEnvFirst;
895 name = VarLocal(name);
898 * Note whether this is one of the specific variables we were told
899 * through the -E flag to use environment-variable-override for.
901 localCheckEnvFirst = FALSE;
902 LST_FOREACH(ln, &envFirstVars) {
903 if (strcmp(Lst_Datum(ln), name) == 0) {
904 localCheckEnvFirst = TRUE;
910 * First look for the variable in the given context. If it's not there,
911 * look for it in VAR_CMD, VAR_GLOBAL and the environment,
912 * in that order, depending on the FIND_* flags in 'flags'
914 if ((var = VarLookup(&ctxt->context, name)) != NULL)
917 /* not there - try command line context */
918 if (ctxt != VAR_CMD) {
919 if ((var = VarLookup(&VAR_CMD->context, name)) != NULL)
923 /* not there - try global context, but only if not -e/-E */
924 if (ctxt != VAR_GLOBAL && (!checkEnvFirst && !localCheckEnvFirst)) {
925 if ((var = VarLookup(&VAR_GLOBAL->context, name)) != NULL)
929 if ((var = VarLookup(&VAR_ENV->context, name)) != NULL)
932 /* deferred check for the environment (in case of -e/-E) */
933 if ((ctxt != VAR_GLOBAL) && (checkEnvFirst || localCheckEnvFirst)) {
934 if ((var = VarLookup(&VAR_GLOBAL->context, name)) != NULL)
942 * Add a new variable of name name and value val to the given context.
945 * The new variable is placed at the front of the given context
946 * The name and val arguments are duplicated so they may
950 VarAdd(const char *name, const char *val, GNode *ctxt)
953 Lst_AtFront(&ctxt->context, VarCreate(name, val, 0));
954 DEBUGF(VAR, ("%s:%s = %s\n", ctxt->name, name, val));
958 * Remove a variable from a context.
961 * The Var structure is removed and freed.
964 Var_Delete(const char *name, GNode *ctxt)
968 DEBUGF(VAR, ("%s:delete %s\n", ctxt->name, name));
969 LST_FOREACH(ln, &ctxt->context) {
970 if (strcmp(((const Var *)Lst_Datum(ln))->name, name) == 0) {
971 VarDestroy(Lst_Datum(ln), TRUE);
972 Lst_Remove(&ctxt->context, ln);
979 * Set the variable name to the value val in the given context.
982 * If the variable doesn't yet exist, a new record is created for it.
983 * Else the old value is freed and the new one stuck in its place
986 * The variable is searched for only in its context before being
987 * created in that context. I.e. if the context is VAR_GLOBAL,
988 * only VAR_GLOBAL->context is searched. Likewise if it is VAR_CMD, only
989 * VAR_CMD->context is searched. This is done to avoid the literally
990 * thousands of unnecessary strcmp's that used to be done to
991 * set, say, $(@) or $(<).
994 Var_Set(const char *name, const char *val, GNode *ctxt)
1000 * We only look for a variable in the given context since anything
1001 * set here will override anything in a lower context, so there's not
1002 * much point in searching them all just to save a bit of memory...
1004 n = VarPossiblyExpand(name, ctxt);
1005 v = VarFindOnly(n, ctxt);
1007 VarAdd(n, val, ctxt);
1008 if (ctxt == VAR_CMD) {
1010 * Any variables given on the command line
1011 * are automatically exported to the
1012 * environment (as per POSIX standard)
1018 Buf_Append(v->val, val);
1020 if (ctxt == VAR_CMD || (v->flags & VAR_TO_ENV)) {
1022 * Any variables given on the command line
1023 * are automatically exported to the
1024 * environment (as per POSIX standard)
1028 DEBUGF(VAR, ("%s:%s = %s\n", ctxt->name, n, val));
1035 * Set the a global name variable to the value.
1038 Var_SetGlobal(const char name[], const char value[])
1041 Var_Set(name, value, VAR_GLOBAL);
1046 * Set the VAR_TO_ENV flag on a variable
1049 Var_SetEnv(const char *name, GNode *ctxt)
1053 v = VarFindOnly(name, VAR_CMD);
1056 * Do not allow .EXPORT: to be set on variables
1057 * from the comand line or MAKEFLAGS.
1060 "Warning: Did not set .EXPORTVAR: on %s because it "
1061 "is from the comand line or MAKEFLAGS", name);
1065 v = VarFindAny(name, ctxt);
1067 Lst_AtFront(&VAR_ENV->context,
1068 VarCreate(name, NULL, VAR_TO_ENV));
1069 setenv(name, "", 1);
1070 Error("Warning: .EXPORTVAR: set on undefined variable %s", name);
1072 if ((v->flags & VAR_TO_ENV) == 0) {
1073 v->flags |= VAR_TO_ENV;
1074 setenv(v->name, Buf_Data(v->val), 1);
1080 * The variable of the given name has the given value appended to it in
1081 * the given context.
1084 * If the variable doesn't exist, it is created. Else the strings
1085 * are concatenated (with a space in between).
1088 * Only if the variable is being sought in the global context is the
1089 * environment searched.
1090 * XXX: Knows its calling circumstances in that if called with ctxt
1091 * an actual target, it will only search that context since only
1092 * a local variable could be being appended to. This is actually
1093 * a big win and must be tolerated.
1096 Var_Append(const char *name, const char *val, GNode *ctxt)
1101 n = VarPossiblyExpand(name, ctxt);
1102 if (ctxt == VAR_GLOBAL) {
1103 v = VarFindEnv(n, ctxt);
1105 v = VarFindOnly(n, ctxt);
1108 VarAdd(n, val, ctxt);
1110 Buf_AddByte(v->val, (Byte)' ');
1111 Buf_Append(v->val, val);
1112 DEBUGF(VAR, ("%s:%s = %s\n", ctxt->name, n, Buf_Data(v->val)));
1118 * See if the given variable exists.
1121 * TRUE if it does, FALSE if it doesn't
1124 Var_Exists(const char *name, GNode *ctxt)
1129 n = VarPossiblyExpand(name, ctxt);
1130 v = VarFindAny(n, ctxt);
1141 * Return the value of the named variable in the given context
1144 * The value if the variable exists, NULL if it doesn't.
1147 Var_Value(const char name[], GNode *ctxt)
1152 n = VarPossiblyExpand(name, ctxt);
1153 v = VarFindAny(n, ctxt);
1158 return (Buf_Data(v->val));
1163 * Modify each of the words of the passed string using the given
1164 * function. Used to implement all modifiers.
1167 * A string of all the words modified appropriately.
1170 * Uses brk_string() so it invalidates any previous call to
1174 VarModify(const char *str, VarModifyProc *modProc, void *datum)
1177 Buffer *buf; /* Buffer for the new string */
1179 Boolean addSpace; /*
1180 * TRUE if need to add a space to
1181 * the buffer before adding the
1185 brk_string(&aa, str, FALSE);
1189 for (i = 1; i < aa.argc; i++)
1190 addSpace = (*modProc)(aa.argv[i], addSpace, buf, datum);
1193 return (Buf_Peel(buf));
1197 * Sort the words in the string.
1200 * str String whose words should be sorted
1201 * cmp A comparison function to control the ordering
1204 * A string containing the words sorted
1207 VarSortWords(const char *str, int (*cmp)(const void *, const void *))
1213 brk_string(&aa, str, FALSE);
1214 qsort(aa.argv + 1, aa.argc - 1, sizeof(char *), cmp);
1217 for (i = 1; i < aa.argc; i++) {
1218 Buf_Append(buf, aa.argv[i]);
1219 Buf_AddByte(buf, (Byte)((i < aa.argc - 1) ? ' ' : '\0'));
1223 return (Buf_Peel(buf));
1227 SortIncreasing(const void *l, const void *r)
1230 return (strcmp(*(const char* const*)l, *(const char* const*)r));
1234 * Remove adjacent duplicate words.
1237 * A string containing the resulting words.
1240 VarUniq(const char *str)
1243 Buffer *buf; /* Buffer for new string */
1247 brk_string(&aa, str, FALSE);
1250 for (j = 1, i = 2; i < aa.argc; i++) {
1251 if (strcmp(aa.argv[i], aa.argv[j]) != 0 && (++j != i))
1252 aa.argv[j] = aa.argv[i];
1257 for (i = 1; i < aa.argc; i++) {
1258 Buf_AddBytes(buf, strlen(aa.argv[i]), (Byte *)aa.argv[i]);
1259 if (i != aa.argc - 1)
1260 Buf_AddByte(buf, ' ');
1262 Buf_AddByte(buf, '\0');
1265 return (Buf_Peel(buf));
1269 * Pass through the tstr looking for 1) escaped delimiters,
1270 * '$'s and backslashes (place the escaped character in
1271 * uninterpreted) and 2) unescaped $'s that aren't before
1272 * the delimiter (expand the variable substitution).
1273 * Return the expanded string or NULL if the delimiter was missing
1274 * If pattern is specified, handle escaped ampersands, and replace
1275 * unescaped ampersands with the lhs of the pattern.
1278 * A string of all the words modified appropriately.
1279 * If length is specified, return the string length of the buffer
1280 * If flags is specified and the last character of the pattern is a
1281 * $ set the VAR_MATCH_END bit of flags.
1284 VarGetPattern(VarParser *vp, int delim, int *flags, VarPattern *patt)
1291 * Skim through until the matching delimiter is found; pick up
1292 * variable substitutions on the way. Also allow backslashes to quote
1293 * the delimiter, $, and \, but don't touch other backslashes.
1295 while (*vp->ptr != '\0') {
1296 if (*vp->ptr == delim) {
1299 } else if ((vp->ptr[0] == '\\') &&
1300 ((vp->ptr[1] == delim) ||
1301 (vp->ptr[1] == '\\') ||
1302 (vp->ptr[1] == '$') ||
1303 (vp->ptr[1] == '&' && patt != NULL))) {
1304 vp->ptr++; /* consume backslash */
1305 Buf_AddByte(buf, (Byte)vp->ptr[0]);
1308 } else if (vp->ptr[0] == '$') {
1309 if (vp->ptr[1] == delim) {
1310 if (flags == NULL) {
1311 Buf_AddByte(buf, (Byte)vp->ptr[0]);
1315 * Unescaped $ at end of patt =>
1316 * anchor patt at end.
1318 *flags |= VAR_MATCH_END;
1333 * If unescaped dollar sign not
1334 * before the delimiter, assume it's
1335 * a variable substitution and
1338 rval = VarParse(&subvp, &rfree);
1339 Buf_Append(buf, rval);
1342 vp->ptr = subvp.ptr;
1344 } else if (vp->ptr[0] == '&' && patt != NULL) {
1345 Buf_AppendBuf(buf, patt->lhs);
1348 Buf_AddByte(buf, (Byte)vp->ptr[0]);
1353 Buf_Destroy(buf, TRUE);
1358 * Make sure this variable is fully expanded.
1361 VarExpand(Var *v, VarParser *vp)
1366 if (v->flags & VAR_IN_USE) {
1367 Fatal("Variable %s is recursive.", v->name);
1371 v->flags |= VAR_IN_USE;
1374 * Before doing any modification, we have to make sure the
1375 * value has been fully expanded. If it looks like recursion
1376 * might be necessary (there's a dollar sign somewhere in the
1377 * variable's value) we just call Var_Subst to do any other
1378 * substitutions that are necessary. Note that the value
1379 * returned by Var_Subst will have been
1380 * dynamically-allocated, so it will need freeing when we
1383 value = Buf_Data(v->val);
1384 if (strchr(value, '$') == NULL) {
1385 result = strdup(value);
1389 buf = Var_Subst(value, vp->ctxt, vp->err);
1390 result = Buf_Peel(buf);
1393 v->flags &= ~VAR_IN_USE;
1399 * Select only those words in value that match the modifier.
1402 modifier_M(VarParser *vp, const char value[], char endc)
1409 modifier = vp->ptr[0];
1410 vp->ptr++; /* consume 'M' or 'N' */
1413 * Compress the \:'s out of the pattern, so allocate enough
1414 * room to hold the uncompressed pattern and compress the
1415 * pattern into that space.
1417 patt = estrdup(vp->ptr);
1419 while (vp->ptr[0] != '\0') {
1420 if (vp->ptr[0] == endc || vp->ptr[0] == ':') {
1423 if (vp->ptr[0] == '\\' &&
1424 (vp->ptr[1] == endc || vp->ptr[1] == ':')) {
1425 vp->ptr++; /* consume backslash */
1433 if (modifier == 'M') {
1434 newValue = VarModify(value, VarMatch, patt);
1436 newValue = VarModify(value, VarNoMatch, patt);
1444 * Substitute the replacement string for the pattern. The substitution
1445 * is applied to each word in value.
1448 modifier_S(VarParser *vp, const char value[], Var *v)
1456 vp->ptr++; /* consume 'S' */
1458 delim = *vp->ptr; /* used to find end of pattern */
1459 vp->ptr++; /* consume 1st delim */
1462 * If pattern begins with '^', it is anchored to the start of the
1463 * word -- skip over it and flag pattern.
1465 if (*vp->ptr == '^') {
1466 patt.flags |= VAR_MATCH_START;
1470 patt.lhs = VarGetPattern(vp, delim, &patt.flags, NULL);
1471 if (patt.lhs == NULL) {
1473 * LHS didn't end with the delim, complain and exit.
1475 Fatal("Unclosed substitution for %s (%c missing)",
1479 vp->ptr++; /* consume 2nd delim */
1481 patt.rhs = VarGetPattern(vp, delim, NULL, &patt);
1482 if (patt.rhs == NULL) {
1484 * RHS didn't end with the delim, complain and exit.
1486 Fatal("Unclosed substitution for %s (%c missing)",
1490 vp->ptr++; /* consume last delim */
1493 * Check for global substitution. If 'g' after the final delimiter,
1494 * substitution is global and is marked that way.
1496 if (vp->ptr[0] == 'g') {
1497 patt.flags |= VAR_SUB_GLOBAL;
1502 * Global substitution of the empty string causes an infinite number
1503 * of matches, unless anchored by '^' (start of string) or '$' (end
1504 * of string). Catch the infinite substitution here. Note that flags
1505 * can only contain the 3 bits we're interested in so we don't have
1506 * to mask unrelated bits. We can test for equality.
1508 if (Buf_Size(patt.lhs) == 0 && patt.flags == VAR_SUB_GLOBAL)
1509 Fatal("Global substitution of the empty string");
1511 newValue = VarModify(value, VarSubstitute, &patt);
1514 * Free the two strings.
1523 modifier_C(VarParser *vp, char value[], Var *v)
1532 vp->ptr++; /* consume 'C' */
1534 delim = *vp->ptr; /* delimiter between sections */
1536 vp->ptr++; /* consume 1st delim */
1538 patt.lhs = VarGetPattern(vp, delim, NULL, NULL);
1539 if (patt.lhs == NULL) {
1540 Fatal("Unclosed substitution for %s (%c missing)",
1544 vp->ptr++; /* consume 2st delim */
1546 patt.rhs = VarGetPattern(vp, delim, NULL, NULL);
1547 if (patt.rhs == NULL) {
1548 Fatal("Unclosed substitution for %s (%c missing)",
1552 vp->ptr++; /* consume last delim */
1556 patt.flags |= VAR_SUB_GLOBAL;
1557 vp->ptr++; /* consume 'g' */
1560 patt.flags |= VAR_SUB_ONE;
1561 vp->ptr++; /* consume '1' */
1567 error = regcomp(&patt.re, Buf_Data(patt.lhs), REG_EXTENDED);
1569 VarREError(error, &patt.re, "RE substitution error");
1575 patt.nsub = patt.re.re_nsub + 1;
1580 patt.matches = emalloc(patt.nsub * sizeof(regmatch_t));
1582 newValue = VarModify(value, VarRESubstitute, &patt);
1593 sysVvarsub(VarParser *vp, char startc, Var *v, const char value[])
1597 * This can either be a bogus modifier or a System-V substitution
1607 endc = (startc == OPEN_PAREN) ? CLOSE_PAREN : CLOSE_BRACE;
1612 * First we make a pass through the string trying to verify it is a
1613 * SYSV-make-style translation: it must be: <string1>=<string2>)
1618 while (*cp != '\0' && cnt) {
1621 /* continue looking for endc */
1622 } else if (*cp == endc)
1624 else if (*cp == startc)
1630 if (*cp == endc && eqFound) {
1632 * Now we break this sucker into the lhs and rhs.
1634 patt.lhs = VarGetPattern(vp, '=', &patt.flags, NULL);
1635 if (patt.lhs == NULL) {
1636 Fatal("Unclosed substitution for %s (%c missing)",
1639 vp->ptr++; /* consume '=' */
1641 patt.rhs = VarGetPattern(vp, endc, NULL, &patt);
1642 if (patt.rhs == NULL) {
1643 Fatal("Unclosed substitution for %s (%c missing)",
1648 * SYSV modifications happen through the whole string. Note
1649 * the pattern is anchored at the end.
1651 newStr = VarModify(value, VarSYSVMatch, &patt);
1658 Error("Unknown modifier '%c'\n", *vp->ptr);
1660 while (*vp->ptr != '\0') {
1661 if (*vp->ptr == endc && *vp->ptr == ':') {
1673 * Quote shell meta-characters in the string
1679 Var_Quote(const char *str)
1682 /* This should cover most shells :-( */
1683 static char meta[] = "\n \t'`\";&<>()|*?{}[]\\$!#^~";
1685 buf = Buf_Init(MAKE_BSIZE);
1686 for (; *str; str++) {
1687 if (strchr(meta, *str) != NULL)
1688 Buf_AddByte(buf, (Byte)'\\');
1689 Buf_AddByte(buf, (Byte)*str);
1692 return (Buf_Peel(buf));
1697 * Now we need to apply any modifiers the user wants applied.
1700 * words which match the given <pattern>.
1701 * <pattern> is of the standard file
1704 * words which do not match the given <pattern>
1705 * <pattern> is of the standard file
1707 * :S<d><pat1><d><pat2><d>[g]
1708 * Substitute <pat2> for <pat1> in the value
1709 * :C<d><pat1><d><pat2><d>[g]
1710 * Substitute <pat2> for regex <pat1> in the value
1711 * :H Substitute the head of each word
1712 * :T Substitute the tail of each word
1713 * :E Substitute the extension (minus '.') of
1715 * :R Substitute the root of each word
1716 * (pathname minus the suffix).
1718 * Like :S, but the rhs goes to the end of
1720 * :U Converts variable to upper-case.
1721 * :L Converts variable to lower-case.
1722 * :O ("Order") Alphabeticaly sort words in variable.
1723 * :u ("uniq") Remove adjacent duplicate words.
1726 ParseModifier(VarParser *vp, char startc, Var *v, Boolean *freeResult)
1731 value = VarExpand(v, vp);
1734 endc = (startc == OPEN_PAREN) ? CLOSE_PAREN : CLOSE_BRACE;
1736 vp->ptr++; /* consume first colon */
1738 while (*vp->ptr != '\0') {
1739 char *newStr; /* New value to return */
1741 if (*vp->ptr == endc) {
1745 DEBUGF(VAR, ("Applying :%c to \"%s\"\n", *vp->ptr, value));
1749 newStr = modifier_M(vp, value, endc);
1752 newStr = modifier_S(vp, value, v);
1755 newStr = modifier_C(vp, value, v);
1758 if (vp->ptr[1] != endc && vp->ptr[1] != ':') {
1760 if ((vp->ptr[0] == 's') &&
1761 (vp->ptr[1] == 'h') &&
1762 (vp->ptr[2] == endc || vp->ptr[2] == ':')) {
1767 Cmd_Exec(value, &error));
1769 newStr = estrdup("");
1773 Error(error, value);
1778 newStr = sysVvarsub(vp, startc, v, value);
1783 switch (vp->ptr[0]) {
1788 buf = Buf_Init(MAKE_BSIZE);
1789 for (cp = value; *cp; cp++)
1790 Buf_AddByte(buf, (Byte)tolower(*cp));
1792 newStr = Buf_Peel(buf);
1798 newStr = VarSortWords(value, SortIncreasing);
1802 newStr = Var_Quote(value);
1806 newStr = VarModify(value, VarTail, NULL);
1813 buf = Buf_Init(MAKE_BSIZE);
1814 for (cp = value; *cp; cp++)
1815 Buf_AddByte(buf, (Byte)toupper(*cp));
1817 newStr = Buf_Peel(buf);
1823 newStr = VarModify(value, VarHead, NULL);
1827 newStr = VarModify(value, VarSuffix, NULL);
1831 newStr = VarModify(value, VarRoot, NULL);
1835 newStr = VarUniq(value);
1839 newStr = sysVvarsub(vp, startc, v, value);
1845 DEBUGF(VAR, ("Result is \"%s\"\n", newStr));
1851 *freeResult = (value == var_Error) ? FALSE : TRUE;
1853 if (vp->ptr[0] == ':') {
1854 vp->ptr++; /* consume colon */
1862 ParseRestModifier(VarParser *vp, char startc, Buffer *buf, Boolean *freeResult)
1869 vname = Buf_GetAll(buf, &vlen);
1871 v = VarFindAny(vname, vp->ctxt);
1873 value = ParseModifier(vp, startc, v, freeResult);
1877 if ((vp->ctxt == VAR_CMD) || (vp->ctxt == VAR_GLOBAL)) {
1880 * Still need to get to the end of the variable
1881 * specification, so kludge up a Var structure for the
1884 v = VarCreate(vname, NULL, VAR_JUNK);
1885 value = ParseModifier(vp, startc, v, freeResult);
1889 VarDestroy(v, TRUE);
1891 consumed = vp->ptr - vp->input + 1;
1893 * If substituting a local variable in a non-local context,
1894 * assume it's for dynamic source stuff. We have to handle
1895 * this specially and return the longhand for the variable
1896 * with the dollar sign escaped so it makes it back to the
1897 * caller. Only four of the local variables are treated
1898 * specially as they are the only four that will be set when
1899 * dynamic sources are expanded.
1902 (vlen == 2 && (vname[1] == 'F' || vname[1] == 'D'))) {
1903 if (strchr("!%*@", vname[0]) != NULL) {
1904 value = emalloc(consumed + 1);
1905 strncpy(value, vp->input, consumed);
1906 value[consumed] = '\0';
1914 isupper((unsigned char)vname[1])) {
1915 if ((strncmp(vname, ".TARGET", vlen - 1) == 0) ||
1916 (strncmp(vname, ".ARCHIVE", vlen - 1) == 0) ||
1917 (strncmp(vname, ".PREFIX", vlen - 1) == 0) ||
1918 (strncmp(vname, ".MEMBER", vlen - 1) == 0)) {
1919 value = emalloc(consumed + 1);
1920 strncpy(value, vp->input, consumed);
1921 value[consumed] = '\0';
1928 *freeResult = FALSE;
1929 return (vp->err ? var_Error : varNoError);
1932 * Check for D and F forms of local variables since we're in
1933 * a local context and the name is the right length.
1936 (vname[1] == 'F' || vname[1] == 'D') &&
1937 (strchr("!%*<>@", vname[0]) != NULL)) {
1943 v = VarFindOnly(name, vp->ctxt);
1945 value = ParseModifier(vp, startc, v, freeResult);
1951 * Still need to get to the end of the variable
1952 * specification, so kludge up a Var structure for the
1955 v = VarCreate(vname, NULL, VAR_JUNK);
1956 value = ParseModifier(vp, startc, v, freeResult);
1960 VarDestroy(v, TRUE);
1962 *freeResult = FALSE;
1963 return (vp->err ? var_Error : varNoError);
1968 ParseRestEnd(VarParser *vp, Buffer *buf, Boolean *freeResult)
1975 vname = Buf_GetAll(buf, &vlen);
1977 v = VarFindAny(vname, vp->ctxt);
1979 value = VarExpand(v, vp);
1984 if ((vp->ctxt == VAR_CMD) || (vp->ctxt == VAR_GLOBAL)) {
1985 size_t consumed = vp->ptr - vp->input + 1;
1988 * If substituting a local variable in a non-local context,
1989 * assume it's for dynamic source stuff. We have to handle
1990 * this specially and return the longhand for the variable
1991 * with the dollar sign escaped so it makes it back to the
1992 * caller. Only four of the local variables are treated
1993 * specially as they are the only four that will be set when
1994 * dynamic sources are expanded.
1997 (vlen == 2 && (vname[1] == 'F' || vname[1] == 'D'))) {
1998 if (strchr("!%*@", vname[0]) != NULL) {
1999 value = emalloc(consumed + 1);
2000 strncpy(value, vp->input, consumed);
2001 value[consumed] = '\0';
2009 isupper((unsigned char)vname[1])) {
2010 if ((strncmp(vname, ".TARGET", vlen - 1) == 0) ||
2011 (strncmp(vname, ".ARCHIVE", vlen - 1) == 0) ||
2012 (strncmp(vname, ".PREFIX", vlen - 1) == 0) ||
2013 (strncmp(vname, ".MEMBER", vlen - 1) == 0)) {
2014 value = emalloc(consumed + 1);
2015 strncpy(value, vp->input, consumed);
2016 value[consumed] = '\0';
2024 * Check for D and F forms of local variables since we're in
2025 * a local context and the name is the right length.
2028 (vname[1] == 'F' || vname[1] == 'D') &&
2029 (strchr("!%*<>@", vname[0]) != NULL)) {
2035 v = VarFindOnly(name, vp->ctxt);
2039 * No need for nested expansion or anything,
2040 * as we're the only one who sets these
2041 * things and we sure don't put nested
2042 * invocations in them...
2044 val = Buf_Data(v->val);
2046 if (vname[1] == 'D') {
2047 val = VarModify(val, VarHead, NULL);
2049 val = VarModify(val, VarTail, NULL);
2058 *freeResult = FALSE;
2059 return (vp->err ? var_Error : varNoError);
2063 * Parse a multi letter variable name, and return it's value.
2066 VarParseLong(VarParser *vp, Boolean *freeResult)
2073 buf = Buf_Init(MAKE_BSIZE);
2075 startc = vp->ptr[0];
2076 vp->ptr++; /* consume opening paren or brace */
2078 endc = (startc == OPEN_PAREN) ? CLOSE_PAREN : CLOSE_BRACE;
2081 * Process characters until we reach an end character or a colon,
2082 * replacing embedded variables as we go.
2084 while (*vp->ptr != '\0') {
2085 if (*vp->ptr == endc) {
2086 value = ParseRestEnd(vp, buf, freeResult);
2087 vp->ptr++; /* consume closing paren or brace */
2088 Buf_Destroy(buf, TRUE);
2091 } else if (*vp->ptr == ':') {
2092 value = ParseRestModifier(vp, startc, buf, freeResult);
2093 vp->ptr++; /* consume closing paren or brace */
2094 Buf_Destroy(buf, TRUE);
2097 } else if (*vp->ptr == '$') {
2108 rval = VarParse(&subvp, &rfree);
2109 if (rval == var_Error) {
2110 Fatal("Error expanding embedded variable.");
2112 Buf_Append(buf, rval);
2115 vp->ptr = subvp.ptr;
2117 Buf_AddByte(buf, (Byte)*vp->ptr);
2122 /* If we did not find the end character, return var_Error */
2123 Buf_Destroy(buf, TRUE);
2124 *freeResult = FALSE;
2129 * Parse a single letter variable name, and return it's value.
2132 VarParseShort(VarParser *vp, Boolean *freeResult)
2138 vname[0] = vp->ptr[0];
2141 vp->ptr++; /* consume single letter */
2143 v = VarFindAny(vname, vp->ctxt);
2145 value = VarExpand(v, vp);
2151 * If substituting a local variable in a non-local context, assume
2152 * it's for dynamic source stuff. We have to handle this specially
2153 * and return the longhand for the variable with the dollar sign
2154 * escaped so it makes it back to the caller. Only four of the local
2155 * variables are treated specially as they are the only four that
2156 * will be set when dynamic sources are expanded.
2158 if ((vp->ctxt == VAR_CMD) || (vp->ctxt == VAR_GLOBAL)) {
2160 /* XXX: It looks like $% and $! are reversed here */
2164 return (estrdup("$(.TARGET)"));
2167 return (estrdup("$(.ARCHIVE)"));
2170 return (estrdup("$(.PREFIX)"));
2173 return (estrdup("$(.MEMBER)"));
2175 *freeResult = FALSE;
2176 return (vp->err ? var_Error : varNoError);
2180 /* Variable name was not found. */
2181 *freeResult = FALSE;
2182 return (vp->err ? var_Error : varNoError);
2186 VarParse(VarParser *vp, Boolean *freeResult)
2189 vp->ptr++; /* consume '$' or last letter of conditional */
2191 if (vp->ptr[0] == '\0') {
2192 /* Error, there is only a dollar sign in the input string. */
2193 *freeResult = FALSE;
2194 return (vp->err ? var_Error : varNoError);
2196 } else if (vp->ptr[0] == OPEN_PAREN || vp->ptr[0] == OPEN_BRACE) {
2197 /* multi letter variable name */
2198 return (VarParseLong(vp, freeResult));
2201 /* single letter variable name */
2202 return (VarParseShort(vp, freeResult));
2207 * Given the start of a variable invocation, extract the variable
2208 * name and find its value, then modify it according to the
2212 * The value of the variable or var_Error if the specification
2213 * is invalid. The number of characters in the specification
2214 * is placed in the variable pointed to by consumed. (for
2215 * invalid specifications, this is just 2 to skip the '$' and
2216 * the following letter, or 1 if '$' was the last character
2217 * in the string). A Boolean in *freeResult telling whether the
2218 * returned string should be freed by the caller.
2221 Var_Parse(const char input[], GNode *ctxt, Boolean err,
2222 size_t *consumed, Boolean *freeResult)
2233 value = VarParse(&vp, freeResult);
2234 *consumed += vp.ptr - vp.input;
2239 * Given the start of a variable invocation, determine the length
2240 * of the specification.
2243 * The number of characters in the specification. For invalid
2244 * specifications, this is just 2 to skip the '$' and the
2245 * following letter, or 1 if '$' was the last character in the
2249 Var_Match(const char input[], GNode *ctxt)
2261 value = VarParse(&vp, &freeResult);
2265 return (vp.ptr - vp.input);
2269 match_var(const char str[], const char var[])
2271 const char *start = str;
2274 str++; /* consume '$' */
2276 if (str[0] == OPEN_PAREN || str[0] == OPEN_BRACE) {
2277 str++; /* consume opening paren or brace */
2279 while (str[0] != '\0') {
2280 if (str[0] == '$') {
2282 * A variable inside the variable. We cannot
2283 * expand the external variable yet.
2285 return (str - start);
2286 } else if (str[0] == ':' ||
2287 str[0] == CLOSE_PAREN ||
2288 str[0] == CLOSE_BRACE) {
2289 len = str - (start + 2);
2291 if (strncmp(var, start + 2, len) == 0 && var[len] == '\0') {
2292 return (0); /* match */
2295 * Not the variable we want to
2298 return (str - start);
2304 return (str - start);
2306 /* Single letter variable name */
2307 if (var[1] == '\0' && var[0] == str[0]) {
2308 return (0); /* match */
2310 str++; /* consume variable name */
2311 return (str - start);
2317 * Substitute for all variables in the given string in the given
2318 * context If err is TRUE, Parse_Error will be called when an
2319 * undefined variable is encountered.
2322 * The resulting string.
2325 * None. The old string must be freed by the caller
2328 Var_Subst(const char *str, GNode *ctxt, Boolean err)
2330 Boolean errorReported;
2331 Buffer *buf; /* Buffer for forming things */
2334 * Set TRUE if an error has already been reported to prevent a
2335 * plethora of messages when recursing. XXXHB this comment sounds
2338 errorReported = FALSE;
2341 while (str[0] != '\0') {
2342 if ((str[0] == '$') && (str[1] == '$')) {
2344 * A dollar sign may be escaped with another dollar
2345 * sign. In such a case, we skip over the escape
2346 * character and store the dollar sign into the
2350 Buf_AddByte(buf, (Byte)str[0]);
2353 } else if (str[0] == '$') {
2354 /* Variable invocation. */
2365 rval = VarParse(&subvp, &rfree);
2368 * When we come down here, val should either point to
2369 * the value of this variable, suitably modified, or
2370 * be NULL. Length should be the total length of the
2371 * potential variable invocation (from $ to end
2374 if (rval == var_Error || rval == varNoError) {
2376 * If performing old-time variable
2377 * substitution, skip over the variable and
2378 * continue with the substitution. Otherwise,
2379 * store the dollar sign and advance str so
2380 * we continue with the string...
2386 * If variable is undefined, complain
2387 * and skip the variable. The
2388 * complaint will stop us from doing
2389 * anything when the file is parsed.
2391 if (!errorReported) {
2392 Parse_Error(PARSE_FATAL,
2393 "Undefined variable \"%.*s\"", subvp.ptr - subvp.input, str);
2395 errorReported = TRUE;
2398 Buf_AddByte(buf, (Byte)str[0]);
2403 * Copy all the characters from the variable
2404 * value straight into the new string.
2406 Buf_Append(buf, rval);
2413 Buf_AddByte(buf, (Byte)str[0]);
2422 * Substitute for all variables except if it is the same as 'var',
2423 * in the given string in the given context. If err is TRUE,
2424 * Parse_Error will be called when an undefined variable is
2428 * The resulting string.
2431 * None. The old string must be freed by the caller
2434 Var_SubstOnly(const char *var, const char *str, Boolean err)
2436 GNode *ctxt = VAR_GLOBAL;
2437 Boolean errorReported;
2438 Buffer *buf; /* Buffer for forming things */
2441 * Set TRUE if an error has already been reported to prevent a
2442 * plethora of messages when recursing. XXXHB this comment sounds
2445 errorReported = FALSE;
2448 while (str[0] != '\0') {
2449 if (str[0] == '$') {
2452 skip = match_var(str, var);
2454 Buf_AddBytes(buf, skip, str);
2457 /* Variable invocation. */
2468 rval = VarParse(&subvp, &rfree);
2471 * When we get down here, rval should either
2472 * point to the value of this variable, or be
2475 if (rval == var_Error || rval == varNoError) {
2477 * If performing old-time variable
2478 * substitution, skip over the
2479 * variable and continue with the
2480 * substitution. Otherwise, store the
2481 * dollar sign and advance str so we
2482 * continue with the string...
2488 * If variable is undefined,
2489 * complain and skip the
2490 * variable. The complaint
2491 * will stop us from doing
2492 * anything when the file is
2495 if (!errorReported) {
2496 Parse_Error(PARSE_FATAL,
2497 "Undefined variable \"%.*s\"", subvp.ptr - subvp.input, str);
2499 errorReported = TRUE;
2502 Buf_AddByte(buf, (Byte)str[0]);
2507 * Copy all the characters from the
2508 * variable value straight into the
2511 Buf_Append(buf, rval);
2519 Buf_AddByte(buf, (Byte)str[0]);
2528 * Initialize the module
2531 * The VAR_CMD and VAR_GLOBAL contexts are created
2534 Var_Init(char **env)
2538 VAR_CMD = Targ_NewGN("Command");
2539 VAR_ENV = Targ_NewGN("Environment");
2540 VAR_GLOBAL = Targ_NewGN("Global");
2543 * Copy user environment variables into ENV context.
2545 for (ptr = env; *ptr != NULL; ++ptr) {
2546 char *tmp = estrdup(*ptr);
2547 const char *name = tmp;
2548 char *sep = strchr(name, '=');
2549 const char *value = sep + 1;
2553 VarAdd(name, value, VAR_ENV);
2560 * Print all variables in global and command line contexts.
2568 printf("#*** Global Variables:\n");
2569 LST_FOREACH(ln, &VAR_GLOBAL->context) {
2571 printf("%-16s = %s\n", v->name, Buf_Data(v->val));
2574 printf("#*** Command-line Variables:\n");
2575 LST_FOREACH(ln, &VAR_CMD->context) {
2577 printf("%-16s = %s\n", v->name, Buf_Data(v->val));
2582 * Print the values of any variables requested by
2586 Var_Print(Lst *vlist, Boolean expandVars)
2591 LST_FOREACH(n, vlist) {
2592 name = Lst_Datum(n);
2597 v = emalloc(strlen(name) + 1 + 3);
2598 sprintf(v, "${%s}", name);
2600 value = Buf_Peel(Var_Subst(v, VAR_GLOBAL, FALSE));
2601 printf("%s\n", value);
2606 const char *value = Var_Value(name, VAR_GLOBAL);
2607 printf("%s\n", value != NULL ? value : "");