1 /* expr -- evaluate expressions.
2 Copyright (C) 86,91,92,93,94,95,96,1997 Free Software Foundation, Inc.
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2, or (at your option)
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software Foundation,
16 Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
18 /* Author: Mike Parker.
20 This program evaluates expressions. Each token (operator, operand,
21 parenthesis) of the expression must be a seperate argument. The
22 parser used is a reasonably general one, though any incarnation of
23 it is language-specific. It is especially nice for expressions.
25 No parse tree is needed; a new node is evaluated immediately.
26 One function can handle multiple operators all of equal precedence,
27 provided they all associate ((x op x) op x).
29 Define EVAL_TRACE to print an evaluation trace. */
33 #include <sys/types.h>
37 #include "long-options.h"
40 #define NEW(type) ((type *) xmalloc (sizeof (type)))
41 #define OLD(x) free ((char *) x)
43 /* The kinds of value we can have. */
49 typedef enum valtype TYPE;
54 TYPE type; /* Which kind. */
56 { /* The value itself. */
61 typedef struct valinfo VALUE;
63 /* Non-zero if the POSIXLY_CORRECT environment variable is set.
64 The unary operator `quote' is disabled when this variable is zero. */
65 static int posixly_correct;
67 /* The arguments given to the program, minus the program name. */
70 /* The name this program was run with. */
76 static VALUE *docolon __P ((VALUE *sv, VALUE *pv));
77 static VALUE *eval __P ((void));
78 static VALUE *int_value __P ((int i));
79 static VALUE *str_value __P ((char *s));
80 static int isstring __P ((VALUE *v));
81 static int nextarg __P ((char *str));
82 static int nomoreargs __P ((void));
83 static int null __P ((VALUE *v));
84 static int toarith __P ((VALUE *v));
85 static void freev __P ((VALUE *v));
86 static void printv __P ((VALUE *v));
87 static void tostring __P ((VALUE *v));
97 fprintf (stderr, _("Try `%s --help' for more information.\n"),
102 Usage: %s EXPRESSION\n\
105 program_name, program_name);
108 --help display this help and exit\n\
109 --version output version information and exit\n\
113 Print the value of EXPRESSION to standard output. A blank line below\n\
114 separates increasing precedence groups. EXPRESSION may be:\n\
116 ARG1 | ARG2 ARG1 if it is neither null nor 0, otherwise ARG2\n\
118 ARG1 & ARG2 ARG1 if neither argument is null or 0, otherwise 0\n\
120 ARG1 < ARG2 ARG1 is less than ARG2\n\
121 ARG1 <= ARG2 ARG1 is less than or equal to ARG2\n\
122 ARG1 = ARG2 ARG1 is equal to ARG2\n\
123 ARG1 != ARG2 ARG1 is unequal to ARG2\n\
124 ARG1 >= ARG2 ARG1 is greater than or equal to ARG2\n\
125 ARG1 > ARG2 ARG1 is greater than ARG2\n\
127 ARG1 + ARG2 arithmetic sum of ARG1 and ARG2\n\
128 ARG1 - ARG2 arithmetic difference of ARG1 and ARG2\n\
130 ARG1 * ARG2 arithmetic product of ARG1 and ARG2\n\
131 ARG1 / ARG2 arithmetic quotient of ARG1 divided by ARG2\n\
132 ARG1 %% ARG2 arithmetic remainder of ARG1 divided by ARG2\n\
134 STRING : REGEXP anchored pattern match of REGEXP in STRING\n\
136 match STRING REGEXP same as STRING : REGEXP\n\
137 substr STRING POS LENGTH substring of STRING, POS counted from 1\n\
138 index STRING CHARS index in STRING where any CHARS is found, or 0\n\
139 length STRING length of STRING\n\
140 quote TOKEN interpret TOKEN as a string, even if it is a\n\
141 keyword like `match' or an operator like `/'\n\
143 ( EXPRESSION ) value of EXPRESSION\n\
147 Beware that many operators need to be escaped or quoted for shells.\n\
148 Comparisons are arithmetic if both ARGs are numbers, else lexicographical.\n\
149 Pattern matches return the string matched between \\( and \\) or null; if\n\
150 \\( and \\) are not used, they return the number of characters matched or 0.\n\
152 puts (_("\nReport bugs to <sh-utils-bugs@gnu.org>."));
158 main (int argc, char **argv)
162 program_name = argv[0];
163 setlocale (LC_ALL, "");
164 bindtextdomain (PACKAGE, LOCALEDIR);
165 textdomain (PACKAGE);
167 posixly_correct = (getenv ("POSIXLY_CORRECT") != NULL);
169 /* Recognize --help or --version only if POSIXLY_CORRECT is not set. */
170 if (!posixly_correct)
171 parse_long_options (argc, argv, "expr", GNU_PACKAGE, VERSION, usage);
175 error (0, 0, _("too few arguments"));
183 error (2, 0, _("syntax error"));
189 /* Return a VALUE for I. */
202 /* Return a VALUE for S. */
211 v->u.s = xstrdup (s);
215 /* Free VALUE V, including structure components. */
220 if (v->type == string)
233 printf ("%d\n", v->u.i);
236 printf ("%s\n", v->u.s);
243 /* Return nonzero if V is a null-string or zero-number. */
253 return v->u.s[0] == '\0' || strcmp (v->u.s, "0") == 0;
259 /* Return nonzero if V is a string value. */
264 return v->type == string;
267 /* Coerce V to a string value (can't fail). */
277 temp = xmalloc (4 * (sizeof (int) / sizeof (char)));
278 sprintf (temp, "%d", v->u.i);
289 /* Coerce V to an integer value. Return 1 on success, 0 on failure. */
305 /* Don't interpret the empty string as an integer. */
314 i = i * 10 + *cp - '0';
319 v->u.i = i * (neg ? -1 : 1);
327 /* Return nonzero if the next token matches STR exactly.
328 STR must not be NULL. */
335 return strcmp (*args, str) == 0;
338 /* Return nonzero if there no more tokens. */
346 /* The comparison operator handling functions. */
348 #define cmpf(name, rel) \
350 int name (l, r) VALUE *l; VALUE *r; \
352 if (isstring (l) || isstring (r)) \
356 return strcmp (l->u.s, r->u.s) rel 0; \
359 return l->u.i rel r->u.i; \
362 cmpf (less_equal, <=)
365 cmpf (greater_equal, >=)
366 cmpf (greater_than, >)
370 /* The arithmetic operator handling functions. */
372 #define arithf(name, op) \
374 int name (l, r) VALUE *l; VALUE *r; \
376 if (!toarith (l) || !toarith (r)) \
377 error (2, 0, _("non-numeric argument")); \
378 return l->u.i op r->u.i; \
381 #define arithdivf(name, op) \
382 int name (l, r) VALUE *l; VALUE *r; \
384 if (!toarith (l) || !toarith (r)) \
385 error (2, 0, _("non-numeric argument")); \
387 error (2, 0, _("division by zero")); \
388 return l->u.i op r->u.i; \
394 arithdivf (divide, /)
401 /* Print evaluation trace and args remaining. */
410 for (a = args; *a; a++)
416 /* Do the : operator.
417 SV is the VALUE for the lhs (the string),
418 PV is the VALUE for the rhs (the pattern). */
421 docolon (VALUE *sv, VALUE *pv)
425 struct re_pattern_buffer re_buffer;
426 struct re_registers re_regs;
432 if (pv->u.s[0] == '^')
435 warning: unportable BRE: `%s': using `^' as the first character\n\
436 of the basic regular expression is not portable; it is being ignored"),
440 len = strlen (pv->u.s);
441 memset (&re_buffer, 0, sizeof (re_buffer));
442 memset (&re_regs, 0, sizeof (re_regs));
443 re_buffer.allocated = 2 * len;
444 re_buffer.buffer = (unsigned char *) xmalloc (re_buffer.allocated);
445 re_buffer.translate = 0;
446 re_syntax_options = RE_SYNTAX_POSIX_BASIC;
447 errmsg = re_compile_pattern (pv->u.s, len, &re_buffer);
449 error (2, 0, "%s", errmsg);
451 len = re_match (&re_buffer, sv->u.s, strlen (sv->u.s), 0, &re_regs);
454 /* Were \(...\) used? */
455 if (re_buffer.re_nsub > 0)/* was (re_regs.start[1] >= 0) */
457 sv->u.s[re_regs.end[1]] = '\0';
458 v = str_value (sv->u.s + re_regs.start[1]);
465 /* Match failed -- return the right kind of null. */
466 if (re_buffer.re_nsub > 0)
471 free (re_buffer.buffer);
475 /* Handle bare operands and ( expr ) syntax. */
486 error (2, 0, _("syntax error"));
493 error (2, 0, _("syntax error"));
499 error (2, 0, _("syntax error"));
501 return str_value (*args++);
504 /* Handle match, substr, index, length, and quote keywords. */
518 if (!posixly_correct && nextarg ("quote"))
522 error (2, 0, _("syntax error"));
523 return str_value (*args++);
525 else if (nextarg ("length"))
530 v = int_value (strlen (r->u.s));
534 else if (nextarg ("match"))
544 else if (nextarg ("index"))
551 v = int_value (strcspn (l->u.s, r->u.s) + 1);
552 if (v->u.i == (int) strlen (l->u.s) + 1)
558 else if (nextarg ("substr"))
565 if (!toarith (i1) || !toarith (i2)
566 || i1->u.i > (int) strlen (l->u.s)
567 || i1->u.i <= 0 || i2->u.i <= 0)
573 v->u.s = strncpy ((char *) xmalloc (i2->u.i + 1),
574 l->u.s + i1->u.i - 1, i2->u.i);
586 /* Handle : operator (pattern matching).
587 Calls docolon to do the real work. */
616 /* Handle *, /, % operators. */
634 else if (nextarg ("/"))
636 else if (nextarg ("%"))
649 /* Handle +, - operators. */
667 else if (nextarg ("-"))
680 /* Handle comparisons. */
698 else if (nextarg ("<="))
700 else if (nextarg ("=") || nextarg ("=="))
702 else if (nextarg ("!="))
704 else if (nextarg (">="))
706 else if (nextarg (">"))
739 if (null (l) || null (r))