2 * arithmetic code ripped out of ash shell for code sharing
4 * This code is derived from software contributed to Berkeley by
7 * Original BSD copyright notice is retained at the end of this file.
9 * Copyright (c) 1989, 1991, 1993, 1994
10 * The Regents of the University of California. All rights reserved.
12 * Copyright (c) 1997-2005 Herbert Xu <herbert@gondor.apana.org.au>
13 * was re-ported from NetBSD and debianized.
15 * rewrite arith.y to micro stack based cryptic algorithm by
16 * Copyright (c) 2001 Aaron Lehmann <aaronl@vitelus.com>
18 * Modified by Paul Mundt <lethal@linux-sh.org> (c) 2004 to support
21 * Modified by Vladimir Oleynik <dzo@simtreas.ru> (c) 2001-2005 to be
22 * used in busybox and size optimizations,
23 * rewrote arith (see notes to this), added locale support,
24 * rewrote dynamic variables.
26 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
28 /* Copyright (c) 2001 Aaron Lehmann <aaronl@vitelus.com>
30 Permission is hereby granted, free of charge, to any person obtaining
31 a copy of this software and associated documentation files (the
32 "Software"), to deal in the Software without restriction, including
33 without limitation the rights to use, copy, modify, merge, publish,
34 distribute, sublicense, and/or sell copies of the Software, and to
35 permit persons to whom the Software is furnished to do so, subject to
36 the following conditions:
38 The above copyright notice and this permission notice shall be
39 included in all copies or substantial portions of the Software.
41 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
42 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
43 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
44 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
45 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
46 TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
47 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
50 /* This is my infix parser/evaluator. It is optimized for size, intended
51 * as a replacement for yacc-based parsers. However, it may well be faster
52 * than a comparable parser written in yacc. The supported operators are
53 * listed in #defines below. Parens, order of operations, and error handling
54 * are supported. This code is thread safe. The exact expression format should
55 * be that which POSIX specifies for shells. */
57 /* The code uses a simple two-stack algorithm. See
58 * http://www.onthenet.com.au/~grahamis/int2008/week02/lect02.html
59 * for a detailed explanation of the infix-to-postfix algorithm on which
60 * this is based (this code differs in that it applies operators immediately
61 * to the stack instead of adding them to a queue to end up with an
64 /* To use the routine, call it with an expression string and error return
68 * Aug 24, 2001 Manuel Novoa III
70 * Reduced the generated code size by about 30% (i386) and fixed several bugs.
72 * 1) In arith_apply():
73 * a) Cached values of *numptr and &(numptr[-1]).
74 * b) Removed redundant test for zero denominator.
77 * a) Eliminated redundant code for processing operator tokens by moving
78 * to a table-based implementation. Also folded handling of parens
80 * b) Combined all 3 loops which called arith_apply to reduce generated
81 * code size at the cost of speed.
83 * 3) The following expressions were treated as valid by the original code:
84 * 1() , 0! , 1 ( *3 ) .
85 * These bugs have been fixed by internally enclosing the expression in
86 * parens and then checking that all binary ops and right parens are
87 * preceded by a valid expression (NUM_TOKEN).
89 * Note: It may be desirable to replace Aaron's test for whitespace with
90 * ctype's isspace() if it is used by another busybox applet or if additional
91 * whitespace chars should be considered. Look below the "#include"s for a
95 * Aug 26, 2001 Manuel Novoa III
97 * Return 0 for null expressions. Pointed out by Vladimir Oleynik.
99 * Merge in Aaron's comments previously posted to the busybox list,
100 * modified slightly to take account of my changes to the code.
104 * (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
106 * - allow access to variable,
107 * used recursive find value indirection (c=2*2; a="c"; $((a+=2)) produce 6)
108 * - realize assign syntax (VAR=expr, +=, *= etc)
109 * - realize exponentiation (** operator)
110 * - realize comma separated - expr, expr
111 * - realise ++expr --expr expr++ expr--
112 * - realise expr ? expr : expr (but, second expr calculate always)
113 * - allow hexadecimal and octal numbers
114 * - was restored loses XOR operator
115 * - remove one goto label, added three ;-)
116 * - protect $((num num)) as true zero expr (Manuel`s error)
117 * - always use special isspace(), see comment from bash ;-)
122 #define a_e_h_t arith_eval_hooks_t
123 #define lookupvar (math_hooks->lookupvar)
124 #define setvar (math_hooks->setvar )
125 //#define endofname (math_hooks->endofname)
127 #define arith_isspace(arithval) \
128 (arithval == ' ' || arithval == '\n' || arithval == '\t')
130 typedef unsigned char operator;
132 /* An operator's token id is a bit of a bitfield. The lower 5 bits are the
133 * precedence, and 3 high bits are an ID unique across operators of that
134 * precedence. The ID portion is so that multiple operators can have the
135 * same precedence, ensuring that the leftmost one is evaluated first.
136 * Consider * and /. */
138 #define tok_decl(prec,id) (((id)<<5)|(prec))
139 #define PREC(op) ((op) & 0x1F)
141 #define TOK_LPAREN tok_decl(0,0)
143 #define TOK_COMMA tok_decl(1,0)
145 #define TOK_ASSIGN tok_decl(2,0)
146 #define TOK_AND_ASSIGN tok_decl(2,1)
147 #define TOK_OR_ASSIGN tok_decl(2,2)
148 #define TOK_XOR_ASSIGN tok_decl(2,3)
149 #define TOK_PLUS_ASSIGN tok_decl(2,4)
150 #define TOK_MINUS_ASSIGN tok_decl(2,5)
151 #define TOK_LSHIFT_ASSIGN tok_decl(2,6)
152 #define TOK_RSHIFT_ASSIGN tok_decl(2,7)
154 #define TOK_MUL_ASSIGN tok_decl(3,0)
155 #define TOK_DIV_ASSIGN tok_decl(3,1)
156 #define TOK_REM_ASSIGN tok_decl(3,2)
158 /* all assign is right associativity and precedence eq, but (7+3)<<5 > 256 */
159 #define convert_prec_is_assing(prec) do { if (prec == 3) prec = 2; } while (0)
161 /* conditional is right associativity too */
162 #define TOK_CONDITIONAL tok_decl(4,0)
163 #define TOK_CONDITIONAL_SEP tok_decl(4,1)
165 #define TOK_OR tok_decl(5,0)
167 #define TOK_AND tok_decl(6,0)
169 #define TOK_BOR tok_decl(7,0)
171 #define TOK_BXOR tok_decl(8,0)
173 #define TOK_BAND tok_decl(9,0)
175 #define TOK_EQ tok_decl(10,0)
176 #define TOK_NE tok_decl(10,1)
178 #define TOK_LT tok_decl(11,0)
179 #define TOK_GT tok_decl(11,1)
180 #define TOK_GE tok_decl(11,2)
181 #define TOK_LE tok_decl(11,3)
183 #define TOK_LSHIFT tok_decl(12,0)
184 #define TOK_RSHIFT tok_decl(12,1)
186 #define TOK_ADD tok_decl(13,0)
187 #define TOK_SUB tok_decl(13,1)
189 #define TOK_MUL tok_decl(14,0)
190 #define TOK_DIV tok_decl(14,1)
191 #define TOK_REM tok_decl(14,2)
193 /* exponent is right associativity */
194 #define TOK_EXPONENT tok_decl(15,1)
196 /* For now unary operators. */
198 #define TOK_BNOT tok_decl(UNARYPREC,0)
199 #define TOK_NOT tok_decl(UNARYPREC,1)
201 #define TOK_UMINUS tok_decl(UNARYPREC+1,0)
202 #define TOK_UPLUS tok_decl(UNARYPREC+1,1)
204 #define PREC_PRE (UNARYPREC+2)
206 #define TOK_PRE_INC tok_decl(PREC_PRE, 0)
207 #define TOK_PRE_DEC tok_decl(PREC_PRE, 1)
209 #define PREC_POST (UNARYPREC+3)
211 #define TOK_POST_INC tok_decl(PREC_POST, 0)
212 #define TOK_POST_DEC tok_decl(PREC_POST, 1)
214 #define SPEC_PREC (UNARYPREC+4)
216 #define TOK_NUM tok_decl(SPEC_PREC, 0)
217 #define TOK_RPAREN tok_decl(SPEC_PREC, 1)
219 #define NUMPTR (*numstackptr)
222 tok_have_assign(operator op)
224 operator prec = PREC(op);
226 convert_prec_is_assing(prec);
227 return (prec == PREC(TOK_ASSIGN) ||
228 prec == PREC_PRE || prec == PREC_POST);
232 is_right_associativity(operator prec)
234 return (prec == PREC(TOK_ASSIGN) || prec == PREC(TOK_EXPONENT)
235 || prec == PREC(TOK_CONDITIONAL));
240 arith_t contidional_second_val;
241 char contidional_second_val_initialized;
242 char *var; /* if NULL then is regular number,
243 else is variable name */
246 typedef struct chk_var_recursive_looped_t {
248 struct chk_var_recursive_looped_t *next;
249 } chk_var_recursive_looped_t;
251 static chk_var_recursive_looped_t *prev_chk_var_recursive;
254 arith_lookup_val(v_n_t *t, a_e_h_t *math_hooks)
257 const char *p = lookupvar(t->var);
262 /* recursive try as expression */
263 chk_var_recursive_looped_t *cur;
264 chk_var_recursive_looped_t cur_save;
266 for (cur = prev_chk_var_recursive; cur; cur = cur->next) {
267 if (strcmp(cur->var, t->var) == 0) {
268 /* expression recursion loop detected */
272 /* save current lookuped var name */
273 cur = prev_chk_var_recursive;
274 cur_save.var = t->var;
276 prev_chk_var_recursive = &cur_save;
278 t->val = arith (p, &errcode, math_hooks);
279 /* restore previous ptr after recursiving */
280 prev_chk_var_recursive = cur;
283 /* allow undefined var as 0 */
289 /* "applying" a token means performing it on the top elements on the integer
290 * stack. For a unary operator it will only change the top element, but a
291 * binary operator will pop two arguments and push a result */
293 arith_apply(operator op, v_n_t *numstack, v_n_t **numstackptr, a_e_h_t *math_hooks)
296 arith_t numptr_val, rez;
297 int ret_arith_lookup_val;
299 /* There is no operator that can work without arguments */
300 if (NUMPTR == numstack) goto err;
301 numptr_m1 = NUMPTR - 1;
303 /* check operand is var with noninteger value */
304 ret_arith_lookup_val = arith_lookup_val(numptr_m1, math_hooks);
305 if (ret_arith_lookup_val)
306 return ret_arith_lookup_val;
308 rez = numptr_m1->val;
309 if (op == TOK_UMINUS)
311 else if (op == TOK_NOT)
313 else if (op == TOK_BNOT)
315 else if (op == TOK_POST_INC || op == TOK_PRE_INC)
317 else if (op == TOK_POST_DEC || op == TOK_PRE_DEC)
319 else if (op != TOK_UPLUS) {
320 /* Binary operators */
322 /* check and binary operators need two arguments */
323 if (numptr_m1 == numstack) goto err;
325 /* ... and they pop one */
328 if (op == TOK_CONDITIONAL) {
329 if (!numptr_m1->contidional_second_val_initialized) {
330 /* protect $((expr1 ? expr2)) without ": expr" */
333 rez = numptr_m1->contidional_second_val;
334 } else if (numptr_m1->contidional_second_val_initialized) {
335 /* protect $((expr1 : expr2)) without "expr ? " */
338 numptr_m1 = NUMPTR - 1;
339 if (op != TOK_ASSIGN) {
340 /* check operand is var with noninteger value for not '=' */
341 ret_arith_lookup_val = arith_lookup_val(numptr_m1, math_hooks);
342 if (ret_arith_lookup_val)
343 return ret_arith_lookup_val;
345 if (op == TOK_CONDITIONAL) {
346 numptr_m1->contidional_second_val = rez;
348 rez = numptr_m1->val;
349 if (op == TOK_BOR || op == TOK_OR_ASSIGN)
351 else if (op == TOK_OR)
352 rez = numptr_val || rez;
353 else if (op == TOK_BAND || op == TOK_AND_ASSIGN)
355 else if (op == TOK_BXOR || op == TOK_XOR_ASSIGN)
357 else if (op == TOK_AND)
358 rez = rez && numptr_val;
359 else if (op == TOK_EQ)
360 rez = (rez == numptr_val);
361 else if (op == TOK_NE)
362 rez = (rez != numptr_val);
363 else if (op == TOK_GE)
364 rez = (rez >= numptr_val);
365 else if (op == TOK_RSHIFT || op == TOK_RSHIFT_ASSIGN)
367 else if (op == TOK_LSHIFT || op == TOK_LSHIFT_ASSIGN)
369 else if (op == TOK_GT)
370 rez = (rez > numptr_val);
371 else if (op == TOK_LT)
372 rez = (rez < numptr_val);
373 else if (op == TOK_LE)
374 rez = (rez <= numptr_val);
375 else if (op == TOK_MUL || op == TOK_MUL_ASSIGN)
377 else if (op == TOK_ADD || op == TOK_PLUS_ASSIGN)
379 else if (op == TOK_SUB || op == TOK_MINUS_ASSIGN)
381 else if (op == TOK_ASSIGN || op == TOK_COMMA)
383 else if (op == TOK_CONDITIONAL_SEP) {
384 if (numptr_m1 == numstack) {
385 /* protect $((expr : expr)) without "expr ? " */
388 numptr_m1->contidional_second_val_initialized = op;
389 numptr_m1->contidional_second_val = numptr_val;
390 } else if (op == TOK_CONDITIONAL) {
392 numptr_val : numptr_m1->contidional_second_val;
393 } else if (op == TOK_EXPONENT) {
395 return -3; /* exponent less than 0 */
404 } else if (numptr_val==0) /* zero divisor check */
406 else if (op == TOK_DIV || op == TOK_DIV_ASSIGN)
408 else if (op == TOK_REM || op == TOK_REM_ASSIGN)
411 if (tok_have_assign(op)) {
412 char buf[sizeof(arith_t)*3 + 2];
414 if (numptr_m1->var == NULL) {
418 /* save to shell variable */
419 sprintf(buf, arith_t_fmt, rez);
420 setvar(numptr_m1->var, buf);
421 /* after saving, make previous value for v++ or v-- */
422 if (op == TOK_POST_INC)
424 else if (op == TOK_POST_DEC)
427 numptr_m1->val = rez;
428 /* protect geting var value, is number now */
429 numptr_m1->var = NULL;
435 /* longest must be first */
436 static const char op_tokens[] ALIGN1 = {
437 '<','<','=',0, TOK_LSHIFT_ASSIGN,
438 '>','>','=',0, TOK_RSHIFT_ASSIGN,
439 '<','<', 0, TOK_LSHIFT,
440 '>','>', 0, TOK_RSHIFT,
447 '|','=', 0, TOK_OR_ASSIGN,
448 '&','=', 0, TOK_AND_ASSIGN,
449 '*','=', 0, TOK_MUL_ASSIGN,
450 '/','=', 0, TOK_DIV_ASSIGN,
451 '%','=', 0, TOK_REM_ASSIGN,
452 '+','=', 0, TOK_PLUS_ASSIGN,
453 '-','=', 0, TOK_MINUS_ASSIGN,
454 '-','-', 0, TOK_POST_DEC,
455 '^','=', 0, TOK_XOR_ASSIGN,
456 '+','+', 0, TOK_POST_INC,
457 '*','*', 0, TOK_EXPONENT,
473 '?', 0, TOK_CONDITIONAL,
474 ':', 0, TOK_CONDITIONAL_SEP,
480 #define endexpression (&op_tokens[sizeof(op_tokens)-7])
482 const char* FAST_FUNC
483 endofname(const char *name)
488 if (!is_in_name(*name))
495 arith(const char *expr, int *perrcode, a_e_h_t *math_hooks)
497 char arithval; /* Current character under analysis */
498 operator lasttok, op;
500 operator *stack, *stackptr;
501 const char *p = endexpression;
503 v_n_t *numstack, *numstackptr;
504 unsigned datasizes = strlen(expr) + 2;
506 /* Stack of integers */
507 /* The proof that there can be no more than strlen(startbuf)/2+1 integers
508 * in any given correct or incorrect expression is left as an exercise to
510 numstackptr = numstack = alloca((datasizes / 2) * sizeof(numstack[0]));
511 /* Stack of operator tokens */
512 stackptr = stack = alloca(datasizes * sizeof(stack[0]));
514 *stackptr++ = lasttok = TOK_LPAREN; /* start off with a left paren */
515 *perrcode = errcode = 0;
520 if (p == endexpression) {
521 /* Null expression. */
525 /* This is only reached after all tokens have been extracted from the
526 * input stream. If there are still tokens on the operator stack, they
527 * are to be applied in order. At the end, there should be a final
528 * result on the integer stack */
530 if (expr != endexpression + 1) {
531 /* If we haven't done so already, */
532 /* append a closing right paren */
533 expr = endexpression;
534 /* and let the loop process it. */
537 /* At this point, we're done with the expression. */
538 if (numstackptr != numstack+1) {
539 /* ... but if there isn't, it's bad */
545 /* expression is $((var)) only, lookup now */
546 errcode = arith_lookup_val(numstack, math_hooks);
550 return numstack->val;
553 /* Continue processing the expression. */
554 if (arith_isspace(arithval)) {
555 /* Skip whitespace */
560 size_t var_name_size = (p-expr) + 1; /* trailing zero */
562 numstackptr->var = alloca(var_name_size);
563 safe_strncpy(numstackptr->var, expr, var_name_size);
566 numstackptr->contidional_second_val_initialized = 0;
571 if (isdigit(arithval)) {
572 numstackptr->var = NULL;
574 /* call strtoul[l]: */
575 numstackptr->val = strto_arith_t(expr, (char **) &expr, 0);
577 numstackptr->val = 0; /* bash compat */
580 for (p = op_tokens; ; p++) {
584 /* strange operator not found */
587 for (o = expr; *p && *o == *p; p++)
594 /* skip tail uncompared token */
597 /* skip zero delim */
602 /* post grammar: a++ reduce to num */
603 if (lasttok == TOK_POST_INC || lasttok == TOK_POST_DEC)
606 /* Plus and minus are binary (not unary) _only_ if the last
607 * token was a number, or a right paren (which pretends to be
608 * a number, since it evaluates to one). Think about it.
610 if (lasttok != TOK_NUM) {
626 /* We don't want an unary operator to cause recursive descent on the
627 * stack, because there can be many in a row and it could cause an
628 * operator to be evaluated before its argument is pushed onto the
630 /* But for binary operators, "apply" everything on the operator
631 * stack until we find an operator with a lesser priority than the
632 * one we have just extracted. */
633 /* Left paren is given the lowest priority so it will never be
634 * "applied" in this way.
635 * if associativity is right and priority eq, applied also skip
638 if ((prec > 0 && prec < UNARYPREC) || prec == SPEC_PREC) {
639 /* not left paren or unary */
640 if (lasttok != TOK_NUM) {
641 /* binary op must be preceded by a num */
644 while (stackptr != stack) {
645 if (op == TOK_RPAREN) {
646 /* The algorithm employed here is simple: while we don't
647 * hit an open paren nor the bottom of the stack, pop
648 * tokens and apply them */
649 if (stackptr[-1] == TOK_LPAREN) {
651 /* Any operator directly after a */
653 /* close paren should consider itself binary */
657 operator prev_prec = PREC(stackptr[-1]);
659 convert_prec_is_assing(prec);
660 convert_prec_is_assing(prev_prec);
661 if (prev_prec < prec)
663 /* check right assoc */
664 if (prev_prec == prec && is_right_associativity(prec))
667 errcode = arith_apply(*--stackptr, numstack, &numstackptr, math_hooks);
668 if (errcode) goto ret;
670 if (op == TOK_RPAREN) {
675 /* Push this operator to the stack and remember it. */
676 *stackptr++ = lasttok = op;
683 * Copyright (c) 1989, 1991, 1993, 1994
684 * The Regents of the University of California. All rights reserved.
686 * This code is derived from software contributed to Berkeley by
689 * Redistribution and use in source and binary forms, with or without
690 * modification, are permitted provided that the following conditions
692 * 1. Redistributions of source code must retain the above copyright
693 * notice, this list of conditions and the following disclaimer.
694 * 2. Redistributions in binary form must reproduce the above copyright
695 * notice, this list of conditions and the following disclaimer in the
696 * documentation and/or other materials provided with the distribution.
697 * 3. Neither the name of the University nor the names of its contributors
698 * may be used to endorse or promote products derived from this software
699 * without specific prior written permission.
701 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
702 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
703 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
704 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
705 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
706 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
707 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
708 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
709 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
710 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF