1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
|
/* $OpenPackages$ */
/* $OpenBSD: parsevar.c,v 1.1 2001/05/23 12:34:48 espie Exp $ */
/* $NetBSD: parse.c,v 1.29 1997/03/10 21:20:04 christos Exp $ */
/*
* Copyright (c) 2001 Marc Espie.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBSD
* PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <ctype.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include "config.h"
#include "defines.h"
#include "var.h"
#include "varname.h"
#include "error.h"
#include "cmd_exec.h"
#include "parsevar.h"
static const char *find_op1(const char *);
static const char *find_op2(const char *);
static const char *
find_op1(p)
const char *p;
{
for(;; p++) {
if (isspace(*p) || *p == '$' || *p == '\0')
break;
if (p[strspn(p, "?:!+")] == '=')
break;
if (p[0] == ':' && p[1] == 's' && p[2] == 'h')
break;
}
return p;
}
static const char *
find_op2(p)
const char *p;
{
for(;; p++) {
if (isspace(*p) || *p == '$' || *p == '\0')
break;
if (p[strspn(p, "?:!+")] == '=')
break;
}
return p;
}
bool
Parse_DoVar(line, ctxt)
const char *line;
GSymT *ctxt; /* Context in which to do the assignment */
{
const char *arg;
char *res1 = NULL, *res2 = NULL;
#define VAR_NORMAL 0
#define VAR_SUBST 1
#define VAR_APPEND 2
#define VAR_SHELL 4
#define VAR_OPT 8
int type; /* Type of assignment */
struct Name name;
arg = VarName_Get(line, &name, (SymTable *)ctxt, true,
FEATURES(FEATURE_SUNSHCMD) ? find_op1 : find_op2);
while (isspace(*arg))
arg++;
type = VAR_NORMAL;
while (*arg != '=' && !isspace(*arg)) {
/* Check operator type. */
switch (*arg++) {
case '+':
if (type & (VAR_OPT|VAR_APPEND)) {
VarName_Free(&name);
return false;
}
type |= VAR_APPEND;
break;
case '?':
if (type & (VAR_OPT|VAR_APPEND)) {
VarName_Free(&name);
return false;
}
type |= VAR_OPT;
break;
case ':':
if (FEATURES(FEATURE_SUNSHCMD) && strncmp(arg, "sh", 2) == 0) {
type = VAR_SHELL;
arg += 2;
while (*arg != '=' && *arg != '\0')
arg++;
} else {
if (type & VAR_SUBST) {
VarName_Free(&name);
return false;
}
type |= VAR_SUBST;
}
break;
case '!':
if (type & VAR_SHELL) {
VarName_Free(&name);
return false;
}
type |= VAR_SHELL;
break;
default:
VarName_Free(&name);
return false;
}
}
/* Check validity of operator */
if (*arg++ != '=') {
VarName_Free(&name);
return false;
}
while (isspace(*arg))
arg++;
/* If the variable already has a value, we don't do anything. */
if ((type & VAR_OPT) && Var_Valuei(name.s, name.e) != NULL) {
VarName_Free(&name);
return true;
}
if (type & VAR_SHELL) {
char *err;
if (strchr(arg, '$') != NULL) {
char *sub;
/* There's a dollar sign in the command, so perform variable
* expansion on the whole thing. */
sub = Var_Subst(arg, NULL, true);
res1 = Cmd_Exec(sub, &err);
free(sub);
} else
res1 = Cmd_Exec(arg, &err);
if (err)
Parse_Error(PARSE_WARNING, err, arg);
arg = res1;
}
if (type & VAR_SUBST) {
/*
* Allow variables in the old value to be undefined, but leave their
* invocation alone -- this is done by forcing oldVars to be false.
* XXX: This can cause recursive variables, but that's not hard to do,
* and this allows someone to do something like
*
* CFLAGS = $(.INCLUDES)
* CFLAGS := -I.. $(CFLAGS)
*
* And not get an error.
*/
bool oldOldVars = oldVars;
oldVars = false;
/* ensure the variable is set to something to avoid `variable
* is recursive' errors. */
if (Var_Valuei(name.s, name.e) == NULL)
Var_Seti(name.s, name.e, "", ctxt);
res2 = Var_Subst(arg, (SymTable *)ctxt, false);
oldVars = oldOldVars;
arg = res2;
}
if (type & VAR_APPEND)
Var_Appendi(name.s, name.e, arg, ctxt);
else
Var_Seti(name.s, name.e, arg, ctxt);
VarName_Free(&name);
free(res2);
free(res1);
return true;
}
|
