expr.y revision 1.52 1 1.52 rillig /* $NetBSD: expr.y,v 1.52 2025/03/15 14:33:39 rillig Exp $ */
2 1.17 jdolecek
3 1.49 rillig /*-
4 1.49 rillig * Copyright (c) 2000, 2025 The NetBSD Foundation, Inc.
5 1.17 jdolecek * All rights reserved.
6 1.2 cgd *
7 1.17 jdolecek * This code is derived from software contributed to The NetBSD Foundation
8 1.49 rillig * by Jaromir Dolecek <jdolecek (at) NetBSD.org>, J.T. Conklin <jtc (at) NetBSD.org>
9 1.49 rillig * and Roland Illig <rillig (at) NetBSD.org>.
10 1.11 jtc *
11 1.17 jdolecek * Redistribution and use in source and binary forms, with or without
12 1.17 jdolecek * modification, are permitted provided that the following conditions
13 1.17 jdolecek * are met:
14 1.17 jdolecek * 1. Redistributions of source code must retain the above copyright
15 1.17 jdolecek * notice, this list of conditions and the following disclaimer.
16 1.17 jdolecek * 2. Redistributions in binary form must reproduce the above copyright
17 1.17 jdolecek * notice, this list of conditions and the following disclaimer in the
18 1.17 jdolecek * documentation and/or other materials provided with the distribution.
19 1.34 martin *
20 1.34 martin * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
21 1.34 martin * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22 1.34 martin * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23 1.34 martin * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
24 1.34 martin * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 1.34 martin * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 1.34 martin * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 1.34 martin * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 1.34 martin * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 1.34 martin * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 1.34 martin * POSSIBILITY OF SUCH DAMAGE.
31 1.1 cgd */
32 1.12 jtc
33 1.17 jdolecek %{
34 1.17 jdolecek #include <sys/cdefs.h>
35 1.52 rillig __RCSID("$NetBSD: expr.y,v 1.52 2025/03/15 14:33:39 rillig Exp $");
36 1.17 jdolecek
37 1.17 jdolecek #include <sys/types.h>
38 1.28 wiz
39 1.17 jdolecek #include <err.h>
40 1.17 jdolecek #include <errno.h>
41 1.17 jdolecek #include <limits.h>
42 1.17 jdolecek #include <locale.h>
43 1.17 jdolecek #include <regex.h>
44 1.17 jdolecek #include <stdarg.h>
45 1.1 cgd #include <stdio.h>
46 1.4 cgd #include <stdlib.h>
47 1.4 cgd #include <string.h>
48 1.1 cgd
49 1.23 jdolecek static const char * const *av;
50 1.50 rillig static unsigned skip_level;
51 1.1 cgd
52 1.37 joerg static void yyerror(const char *, ...) __dead;
53 1.17 jdolecek static int yylex(void);
54 1.49 rillig static int is_empty_or_zero(const char *);
55 1.17 jdolecek static int is_integer(const char *);
56 1.48 rillig static const char *eval_arith(const char *, const char *, const char *);
57 1.48 rillig static int eval_compare(const char *, const char *, const char *);
58 1.48 rillig static const char *eval_match(const char *, const char *);
59 1.26 jmc
60 1.17 jdolecek #define YYSTYPE const char *
61 1.1 cgd
62 1.17 jdolecek %}
63 1.51 rillig
64 1.51 rillig %expect 0
65 1.51 rillig
66 1.51 rillig %token STRING LPAREN RPAREN
67 1.22 thorpej %left SPEC_OR
68 1.22 thorpej %left SPEC_AND
69 1.49 rillig %left COMPARE
70 1.26 jmc %left ADD_SUB_OPERATOR
71 1.26 jmc %left MUL_DIV_MOD_OPERATOR
72 1.26 jmc %left SPEC_REG
73 1.31 jdolecek %left LENGTH
74 1.1 cgd
75 1.1 cgd %%
76 1.1 cgd
77 1.48 rillig exp: expr {
78 1.49 rillig (void)printf("%s\n", $1);
79 1.49 rillig return is_empty_or_zero($1);
80 1.49 rillig }
81 1.49 rillig ;
82 1.1 cgd
83 1.49 rillig expr: item
84 1.50 rillig | expr SPEC_OR {
85 1.50 rillig $$ = is_empty_or_zero($1) ? NULL : "1";
86 1.50 rillig if ($$)
87 1.50 rillig skip_level++;
88 1.50 rillig } expr {
89 1.51 rillig $$ = $3 ? $1 : $4;
90 1.50 rillig if ($3)
91 1.50 rillig skip_level--;
92 1.50 rillig }
93 1.50 rillig | expr SPEC_AND {
94 1.50 rillig $$ = is_empty_or_zero($1) ? NULL : "1";
95 1.50 rillig if (!$$)
96 1.50 rillig skip_level++;
97 1.50 rillig } expr {
98 1.51 rillig $$ = $3 && !is_empty_or_zero($4) ? $1 : "0";
99 1.50 rillig if (!$3)
100 1.50 rillig skip_level--;
101 1.49 rillig }
102 1.49 rillig | expr SPEC_REG expr {
103 1.50 rillig $$ = skip_level == 0 ? eval_match($1, $3) : "";
104 1.49 rillig }
105 1.49 rillig | expr ADD_SUB_OPERATOR expr {
106 1.50 rillig $$ = skip_level == 0 ? eval_arith($1, $2, $3) : "";
107 1.49 rillig }
108 1.49 rillig | expr MUL_DIV_MOD_OPERATOR expr {
109 1.50 rillig $$ = skip_level == 0 ? eval_arith($1, $2, $3) : "";
110 1.49 rillig }
111 1.49 rillig | expr COMPARE expr {
112 1.50 rillig $$ = skip_level == 0 && eval_compare($1, $2, $3) ? "1" : "0";
113 1.49 rillig }
114 1.51 rillig | LPAREN expr RPAREN {
115 1.49 rillig $$ = $2;
116 1.49 rillig }
117 1.49 rillig | LENGTH expr {
118 1.31 jdolecek char *ln;
119 1.31 jdolecek
120 1.51 rillig asprintf(&ln, "%ld", (long)strlen($2));
121 1.33 rumble if (ln == NULL)
122 1.33 rumble err(1, NULL);
123 1.31 jdolecek $$ = ln;
124 1.49 rillig }
125 1.49 rillig ;
126 1.4 cgd
127 1.17 jdolecek item: STRING
128 1.51 rillig | ADD_SUB_OPERATOR
129 1.51 rillig | MUL_DIV_MOD_OPERATOR
130 1.51 rillig | COMPARE
131 1.51 rillig | SPEC_OR
132 1.51 rillig | SPEC_AND
133 1.51 rillig | SPEC_REG
134 1.51 rillig | LENGTH
135 1.51 rillig ;
136 1.51 rillig
137 1.17 jdolecek %%
138 1.1 cgd
139 1.17 jdolecek static int
140 1.49 rillig is_empty_or_zero(const char *str)
141 1.1 cgd {
142 1.17 jdolecek char *endptr;
143 1.4 cgd
144 1.17 jdolecek return str[0] == '\0'
145 1.49 rillig || (strtoll(str, &endptr, 10) == 0 && endptr[0] == '\0');
146 1.1 cgd }
147 1.1 cgd
148 1.17 jdolecek static int
149 1.17 jdolecek is_integer(const char *str)
150 1.1 cgd {
151 1.17 jdolecek char *endptr;
152 1.4 cgd
153 1.49 rillig (void)strtoll(str, &endptr, 10);
154 1.17 jdolecek /* note we treat empty string as valid number */
155 1.49 rillig return endptr[0] == '\0';
156 1.49 rillig }
157 1.49 rillig
158 1.49 rillig static int64_t
159 1.49 rillig to_integer(const char *str)
160 1.49 rillig {
161 1.49 rillig errno = 0;
162 1.49 rillig int64_t num = strtoll(str, NULL, 10);
163 1.49 rillig if (errno == ERANGE) {
164 1.49 rillig yyerror("value '%s' is too %s is %lld", str,
165 1.49 rillig num > 0 ? "big, maximum" : "small, minimum",
166 1.49 rillig num > 0 ? LLONG_MAX : LLONG_MIN);
167 1.49 rillig }
168 1.49 rillig return num;
169 1.1 cgd }
170 1.1 cgd
171 1.48 rillig static const char *
172 1.48 rillig eval_arith(const char *left, const char *op, const char *right)
173 1.26 jmc {
174 1.40 kamil int64_t res, l, r;
175 1.26 jmc
176 1.32 lukem res = 0;
177 1.32 lukem
178 1.49 rillig if (!is_integer(left))
179 1.26 jmc yyerror("non-integer argument '%s'", left);
180 1.49 rillig if (!is_integer(right))
181 1.26 jmc yyerror("non-integer argument '%s'", right);
182 1.26 jmc
183 1.49 rillig l = to_integer(left);
184 1.49 rillig r = to_integer(right);
185 1.26 jmc
186 1.49 rillig switch (op[0]) {
187 1.26 jmc case '+':
188 1.49 rillig if ((r > 0 && l > INT64_MAX - r) ||
189 1.49 rillig (r < 0 && l < INT64_MIN - r))
190 1.49 rillig goto integer_overflow;
191 1.49 rillig res = l + r;
192 1.26 jmc break;
193 1.26 jmc case '-':
194 1.40 kamil if ((r > 0 && l < INT64_MIN + r) ||
195 1.49 rillig (r < 0 && l > INT64_MAX + r))
196 1.49 rillig goto integer_overflow;
197 1.49 rillig res = l - r;
198 1.26 jmc break;
199 1.26 jmc case '/':
200 1.40 kamil if (r == 0)
201 1.49 rillig goto invalid_zero;
202 1.40 kamil if (l == INT64_MIN && r == -1)
203 1.49 rillig goto integer_overflow;
204 1.26 jmc res = l / r;
205 1.26 jmc break;
206 1.26 jmc case '%':
207 1.27 jmc if (r == 0)
208 1.49 rillig goto invalid_zero;
209 1.40 kamil if (l == INT64_MIN && r == -1)
210 1.49 rillig goto integer_overflow;
211 1.26 jmc res = l % r;
212 1.26 jmc break;
213 1.26 jmc case '*':
214 1.40 kamil if (l < 0 && r < 0 && l != INT64_MIN && r != INT64_MIN) {
215 1.40 kamil l = -l;
216 1.40 kamil r = -r;
217 1.26 jmc }
218 1.26 jmc
219 1.44 kamil if (l < 0 && r >= 0) {
220 1.49 rillig int64_t tmp = l;
221 1.44 kamil l = r;
222 1.49 rillig r = tmp;
223 1.44 kamil }
224 1.44 kamil
225 1.40 kamil if ((l < 0 && r < 0) ||
226 1.44 kamil (r > 0 && l > INT64_MAX / r) ||
227 1.49 rillig (r <= 0 && l != 0 && r < INT64_MIN / l))
228 1.49 rillig goto integer_overflow;
229 1.49 rillig res = l * r;
230 1.26 jmc break;
231 1.26 jmc }
232 1.48 rillig
233 1.48 rillig char *val;
234 1.48 rillig (void)asprintf(&val, "%lld", (long long int)res);
235 1.48 rillig if (val == NULL)
236 1.48 rillig err(1, NULL);
237 1.48 rillig return val;
238 1.49 rillig
239 1.49 rillig integer_overflow:
240 1.49 rillig yyerror("integer overflow or underflow occurred for "
241 1.49 rillig "operation '%s %s %s'", left, op, right);
242 1.49 rillig
243 1.49 rillig invalid_zero:
244 1.49 rillig yyerror("second argument to '%s' must not be zero", op);
245 1.48 rillig }
246 1.48 rillig
247 1.48 rillig static int
248 1.48 rillig eval_compare(const char *left, const char *op, const char *right)
249 1.48 rillig {
250 1.48 rillig int64_t l, r;
251 1.48 rillig
252 1.48 rillig if (is_integer(left) && is_integer(right)) {
253 1.48 rillig l = strtoll(left, NULL, 10);
254 1.48 rillig r = strtoll(right, NULL, 10);
255 1.48 rillig } else {
256 1.48 rillig l = strcoll(left, right);
257 1.48 rillig r = 0;
258 1.48 rillig }
259 1.48 rillig
260 1.48 rillig switch (op[0]) {
261 1.48 rillig case '=':
262 1.48 rillig return l == r;
263 1.48 rillig case '>':
264 1.48 rillig if (op[1] == '=')
265 1.48 rillig return l >= r;
266 1.48 rillig else
267 1.48 rillig return l > r;
268 1.48 rillig case '<':
269 1.48 rillig if (op[1] == '=')
270 1.48 rillig return l <= r;
271 1.48 rillig else
272 1.48 rillig return l < r;
273 1.48 rillig default:
274 1.48 rillig return l != r;
275 1.48 rillig }
276 1.48 rillig }
277 1.48 rillig
278 1.48 rillig static const char *
279 1.48 rillig eval_match(const char *str, const char *re)
280 1.48 rillig {
281 1.48 rillig regex_t rp;
282 1.48 rillig regmatch_t rm[2];
283 1.49 rillig int rc;
284 1.48 rillig
285 1.49 rillig if ((rc = regcomp(&rp, re, REG_BASIC)) != 0) {
286 1.48 rillig char errbuf[256];
287 1.49 rillig (void)regerror(rc, &rp, errbuf, sizeof(errbuf));
288 1.48 rillig yyerror("%s", errbuf);
289 1.48 rillig }
290 1.48 rillig
291 1.48 rillig if (regexec(&rp, str, 2, rm, 0) == 0 && rm[0].rm_so == 0) {
292 1.48 rillig char *val;
293 1.48 rillig if (rm[1].rm_so >= 0) {
294 1.48 rillig (void)asprintf(&val, "%.*s",
295 1.48 rillig (int)(rm[1].rm_eo - rm[1].rm_so),
296 1.48 rillig str + rm[1].rm_so);
297 1.48 rillig } else {
298 1.48 rillig (void)asprintf(&val, "%d",
299 1.48 rillig (int)(rm[0].rm_eo - rm[0].rm_so));
300 1.48 rillig }
301 1.48 rillig if (val == NULL)
302 1.48 rillig err(1, NULL);
303 1.48 rillig return val;
304 1.48 rillig }
305 1.48 rillig
306 1.48 rillig if (rp.re_nsub == 0)
307 1.48 rillig return "0";
308 1.48 rillig else
309 1.48 rillig return "";
310 1.26 jmc }
311 1.4 cgd
312 1.51 rillig static const char x[] = "|&=<>+-*/%:()";
313 1.23 jdolecek static const int x_token[] = {
314 1.26 jmc SPEC_OR, SPEC_AND, COMPARE, COMPARE, COMPARE, ADD_SUB_OPERATOR,
315 1.26 jmc ADD_SUB_OPERATOR, MUL_DIV_MOD_OPERATOR, MUL_DIV_MOD_OPERATOR,
316 1.51 rillig MUL_DIV_MOD_OPERATOR, SPEC_REG, LPAREN, RPAREN
317 1.17 jdolecek };
318 1.1 cgd
319 1.23 jdolecek static int handle_ddash = 1;
320 1.23 jdolecek
321 1.17 jdolecek int
322 1.17 jdolecek yylex(void)
323 1.1 cgd {
324 1.17 jdolecek const char *p = *av++;
325 1.23 jdolecek int retval;
326 1.4 cgd
327 1.51 rillig if (p == NULL)
328 1.23 jdolecek retval = 0;
329 1.47 rillig else if (p[0] == '\0')
330 1.47 rillig retval = STRING;
331 1.23 jdolecek else if (p[1] == '\0') {
332 1.17 jdolecek const char *w = strchr(x, p[0]);
333 1.51 rillig retval = w != NULL ? x_token[w - x] : STRING;
334 1.17 jdolecek } else if (p[1] == '=' && p[2] == '\0'
335 1.51 rillig && (p[0] == '>' || p[0] == '<' || p[0] == '!'))
336 1.17 jdolecek retval = COMPARE;
337 1.51 rillig else if (handle_ddash && strcmp(p, "--") == 0) {
338 1.52 rillig handle_ddash = 0;
339 1.23 jdolecek retval = yylex();
340 1.51 rillig if (retval != STRING && retval != LPAREN && retval != RPAREN) {
341 1.23 jdolecek retval = STRING;
342 1.23 jdolecek av--; /* was increased in call to yylex() above */
343 1.23 jdolecek p = "--";
344 1.51 rillig } else
345 1.23 jdolecek p = yylval;
346 1.31 jdolecek } else if (strcmp(p, "length") == 0)
347 1.31 jdolecek retval = LENGTH;
348 1.31 jdolecek else
349 1.17 jdolecek retval = STRING;
350 1.1 cgd
351 1.23 jdolecek handle_ddash = 0;
352 1.17 jdolecek yylval = p;
353 1.4 cgd
354 1.17 jdolecek return retval;
355 1.1 cgd }
356 1.4 cgd
357 1.17 jdolecek /*
358 1.17 jdolecek * Print error message and exit with error 2 (syntax error).
359 1.17 jdolecek */
360 1.38 joerg static __printflike(1, 2) void
361 1.17 jdolecek yyerror(const char *fmt, ...)
362 1.1 cgd {
363 1.17 jdolecek va_list arg;
364 1.4 cgd
365 1.17 jdolecek va_start(arg, fmt);
366 1.17 jdolecek verrx(2, fmt, arg);
367 1.17 jdolecek va_end(arg);
368 1.1 cgd }
369 1.1 cgd
370 1.17 jdolecek int
371 1.23 jdolecek main(int argc, const char * const *argv)
372 1.1 cgd {
373 1.28 wiz setprogname(argv[0]);
374 1.28 wiz (void)setlocale(LC_ALL, "");
375 1.6 jtc
376 1.36 joerg if (argc == 1) {
377 1.36 joerg (void)fprintf(stderr, "usage: %s expression\n",
378 1.36 joerg getprogname());
379 1.36 joerg exit(2);
380 1.36 joerg }
381 1.36 joerg
382 1.36 joerg av = argv + 1;
383 1.5 cgd
384 1.42 christos return yyparse();
385 1.1 cgd }
386