]> git.ipfire.org Git - thirdparty/bash.git/blob - test.c
Bash-5.2 patch 26: fix typo when specifying readline's custom color prefix
[thirdparty/bash.git] / test.c
1 /* test.c - GNU test program (ksb and mjb) */
2
3 /* Modified to run with the GNU shell Apr 25, 1988 by bfox. */
4
5 /* Copyright (C) 1987-2021 Free Software Foundation, Inc.
6
7 This file is part of GNU Bash, the Bourne Again SHell.
8
9 Bash is free software: you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation, either version 3 of the License, or
12 (at your option) any later version.
13
14 Bash is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with Bash. If not, see <http://www.gnu.org/licenses/>.
21 */
22
23 /* Define PATTERN_MATCHING to get the csh-like =~ and !~ pattern-matching
24 binary operators. */
25 /* #define PATTERN_MATCHING */
26
27 #if defined (HAVE_CONFIG_H)
28 # include <config.h>
29 #endif
30
31 #include <stdio.h>
32
33 #include "bashtypes.h"
34
35 #if !defined (HAVE_LIMITS_H) && defined (HAVE_SYS_PARAM_H)
36 # include <sys/param.h>
37 #endif
38
39 #if defined (HAVE_UNISTD_H)
40 # include <unistd.h>
41 #endif
42
43 #include <errno.h>
44 #if !defined (errno)
45 extern int errno;
46 #endif /* !errno */
47
48 #if !defined (_POSIX_VERSION) && defined (HAVE_SYS_FILE_H)
49 # include <sys/file.h>
50 #endif /* !_POSIX_VERSION */
51 #include "posixstat.h"
52 #include "filecntl.h"
53 #include "stat-time.h"
54
55 #include "bashintl.h"
56
57 #include "shell.h"
58 #include "pathexp.h"
59 #include "test.h"
60 #include "builtins/common.h"
61
62 #include <glob/strmatch.h>
63
64 #if !defined (STRLEN)
65 # define STRLEN(s) ((s)[0] ? ((s)[1] ? ((s)[2] ? strlen(s) : 2) : 1) : 0)
66 #endif
67
68 #if !defined (STREQ)
69 # define STREQ(a, b) ((a)[0] == (b)[0] && strcmp ((a), (b)) == 0)
70 #endif /* !STREQ */
71 #define STRCOLLEQ(a, b) ((a)[0] == (b)[0] && strcoll ((a), (b)) == 0)
72
73 #if !defined (R_OK)
74 #define R_OK 4
75 #define W_OK 2
76 #define X_OK 1
77 #define F_OK 0
78 #endif /* R_OK */
79
80 #define EQ 0
81 #define NE 1
82 #define LT 2
83 #define GT 3
84 #define LE 4
85 #define GE 5
86
87 #define NT 0
88 #define OT 1
89 #define EF 2
90
91 /* The following few defines control the truth and false output of each stage.
92 TRUE and FALSE are what we use to compute the final output value.
93 SHELL_BOOLEAN is the form which returns truth or falseness in shell terms.
94 Default is TRUE = 1, FALSE = 0, SHELL_BOOLEAN = (!value). */
95 #define TRUE 1
96 #define FALSE 0
97 #define SHELL_BOOLEAN(value) (!(value))
98
99 #define TEST_ERREXIT_STATUS 2
100
101 static procenv_t test_exit_buf;
102 static int test_error_return;
103 #define test_exit(val) \
104 do { test_error_return = val; sh_longjmp (test_exit_buf, 1); } while (0)
105
106 extern int sh_stat PARAMS((const char *, struct stat *));
107
108 static int pos; /* The offset of the current argument in ARGV. */
109 static int argc; /* The number of arguments present in ARGV. */
110 static char **argv; /* The argument list. */
111 static int noeval;
112
113 static void test_syntax_error PARAMS((char *, char *)) __attribute__((__noreturn__));
114 static void beyond PARAMS((void)) __attribute__((__noreturn__));
115 static void integer_expected_error PARAMS((char *)) __attribute__((__noreturn__));
116
117 static int unary_operator PARAMS((void));
118 static int binary_operator PARAMS((void));
119 static int two_arguments PARAMS((void));
120 static int three_arguments PARAMS((void));
121 static int posixtest PARAMS((void));
122
123 static int expr PARAMS((void));
124 static int term PARAMS((void));
125 static int and PARAMS((void));
126 static int or PARAMS((void));
127
128 static int filecomp PARAMS((char *, char *, int));
129 static int arithcomp PARAMS((char *, char *, int, int));
130 static int patcomp PARAMS((char *, char *, int));
131
132 static void
133 test_syntax_error (format, arg)
134 char *format, *arg;
135 {
136 builtin_error (format, arg);
137 test_exit (TEST_ERREXIT_STATUS);
138 }
139
140 /*
141 * beyond - call when we're beyond the end of the argument list (an
142 * error condition)
143 */
144 static void
145 beyond ()
146 {
147 test_syntax_error (_("argument expected"), (char *)NULL);
148 }
149
150 /* Syntax error for when an integer argument was expected, but
151 something else was found. */
152 static void
153 integer_expected_error (pch)
154 char *pch;
155 {
156 test_syntax_error (_("%s: integer expression expected"), pch);
157 }
158
159 /* Increment our position in the argument list. Check that we're not
160 past the end of the argument list. This check is suppressed if the
161 argument is FALSE. Made a macro for efficiency. */
162 #define advance(f) do { ++pos; if (f && pos >= argc) beyond (); } while (0)
163 #define unary_advance() do { advance (1); ++pos; } while (0)
164
165 /*
166 * expr:
167 * or
168 */
169 static int
170 expr ()
171 {
172 if (pos >= argc)
173 beyond ();
174
175 return (FALSE ^ or ()); /* Same with this. */
176 }
177
178 /*
179 * or:
180 * and
181 * and '-o' or
182 */
183 static int
184 or ()
185 {
186 int value, v2;
187
188 value = and ();
189 if (pos < argc && argv[pos][0] == '-' && argv[pos][1] == 'o' && !argv[pos][2])
190 {
191 advance (0);
192 v2 = or ();
193 return (value || v2);
194 }
195
196 return (value);
197 }
198
199 /*
200 * and:
201 * term
202 * term '-a' and
203 */
204 static int
205 and ()
206 {
207 int value, v2;
208
209 value = term ();
210 if (pos < argc && argv[pos][0] == '-' && argv[pos][1] == 'a' && !argv[pos][2])
211 {
212 advance (0);
213 v2 = and ();
214 return (value && v2);
215 }
216 return (value);
217 }
218
219 /*
220 * term - parse a term and return 1 or 0 depending on whether the term
221 * evaluates to true or false, respectively.
222 *
223 * term ::=
224 * '-'('a'|'b'|'c'|'d'|'e'|'f'|'g'|'h'|'k'|'p'|'r'|'s'|'u'|'w'|'x') filename
225 * '-'('G'|'L'|'O'|'S'|'N') filename
226 * '-t' [int]
227 * '-'('z'|'n') string
228 * '-'('v'|'R') varname
229 * '-o' option
230 * string
231 * string ('!='|'='|'==') string
232 * <int> '-'(eq|ne|le|lt|ge|gt) <int>
233 * file '-'(nt|ot|ef) file
234 * '(' <expr> ')'
235 * int ::=
236 * positive and negative integers
237 */
238 static int
239 term ()
240 {
241 int value;
242
243 if (pos >= argc)
244 beyond ();
245
246 /* Deal with leading `not's. */
247 if (argv[pos][0] == '!' && argv[pos][1] == '\0')
248 {
249 value = 0;
250 while (pos < argc && argv[pos][0] == '!' && argv[pos][1] == '\0')
251 {
252 advance (1);
253 value = 1 - value;
254 }
255
256 return (value ? !term() : term());
257 }
258
259 /* A paren-bracketed argument. */
260 if (argv[pos][0] == '(' && argv[pos][1] == '\0') /* ) */
261 {
262 advance (1);
263 value = expr ();
264 if (argv[pos] == 0) /* ( */
265 test_syntax_error (_("`)' expected"), (char *)NULL);
266 else if (argv[pos][0] != ')' || argv[pos][1]) /* ( */
267 test_syntax_error (_("`)' expected, found %s"), argv[pos]);
268 advance (0);
269 return (value);
270 }
271
272 /* are there enough arguments left that this could be dyadic? */
273 if ((pos + 3 <= argc) && test_binop (argv[pos + 1]))
274 value = binary_operator ();
275
276 /* Might be a switch type argument -- make sure we have enough arguments for
277 the unary operator and argument */
278 else if ((pos + 2) <= argc && test_unop (argv[pos]))
279 value = unary_operator ();
280
281 else
282 {
283 value = argv[pos][0] != '\0';
284 advance (0);
285 }
286
287 return (value);
288 }
289
290 static int
291 stat_mtime (fn, st, ts)
292 char *fn;
293 struct stat *st;
294 struct timespec *ts;
295 {
296 int r;
297
298 r = sh_stat (fn, st);
299 if (r < 0)
300 return r;
301 *ts = get_stat_mtime (st);
302 return 0;
303 }
304
305 static int
306 filecomp (s, t, op)
307 char *s, *t;
308 int op;
309 {
310 struct stat st1, st2;
311 struct timespec ts1, ts2;
312 int r1, r2;
313
314 if ((r1 = stat_mtime (s, &st1, &ts1)) < 0)
315 {
316 if (op == EF)
317 return (FALSE);
318 }
319 if ((r2 = stat_mtime (t, &st2, &ts2)) < 0)
320 {
321 if (op == EF)
322 return (FALSE);
323 }
324
325 switch (op)
326 {
327 case OT: return (r1 < r2 || (r2 == 0 && timespec_cmp (ts1, ts2) < 0));
328 case NT: return (r1 > r2 || (r1 == 0 && timespec_cmp (ts1, ts2) > 0));
329 case EF: return (same_file (s, t, &st1, &st2));
330 }
331 return (FALSE);
332 }
333
334 static int
335 arithcomp (s, t, op, flags)
336 char *s, *t;
337 int op, flags;
338 {
339 intmax_t l, r;
340 int expok;
341
342 if (flags & TEST_ARITHEXP) /* conditional command */
343 {
344 int eflag;
345
346 eflag = (shell_compatibility_level > 51) ? 0 : EXP_EXPANDED;
347 l = evalexp (s, eflag, &expok);
348 if (expok == 0)
349 return (FALSE); /* should probably longjmp here */
350 r = evalexp (t, eflag, &expok);
351 if (expok == 0)
352 return (FALSE); /* ditto */
353 }
354 else
355 {
356 if (legal_number (s, &l) == 0)
357 integer_expected_error (s);
358 if (legal_number (t, &r) == 0)
359 integer_expected_error (t);
360 }
361
362 switch (op)
363 {
364 case EQ: return (l == r);
365 case NE: return (l != r);
366 case LT: return (l < r);
367 case GT: return (l > r);
368 case LE: return (l <= r);
369 case GE: return (l >= r);
370 }
371
372 return (FALSE);
373 }
374
375 static int
376 patcomp (string, pat, op)
377 char *string, *pat;
378 int op;
379 {
380 int m;
381
382 m = strmatch (pat, string, FNMATCH_EXTFLAG|FNMATCH_IGNCASE);
383 return ((op == EQ) ? (m == 0) : (m != 0));
384 }
385
386 int
387 binary_test (op, arg1, arg2, flags)
388 char *op, *arg1, *arg2;
389 int flags;
390 {
391 int patmatch;
392
393 patmatch = (flags & TEST_PATMATCH);
394
395 if (op[0] == '=' && (op[1] == '\0' || (op[1] == '=' && op[2] == '\0')))
396 return (patmatch ? patcomp (arg1, arg2, EQ) : STREQ (arg1, arg2));
397 else if ((op[0] == '>' || op[0] == '<') && op[1] == '\0')
398 {
399 #if defined (HAVE_STRCOLL)
400 if (shell_compatibility_level > 40 && flags & TEST_LOCALE)
401 return ((op[0] == '>') ? (strcoll (arg1, arg2) > 0) : (strcoll (arg1, arg2) < 0));
402 else
403 #endif
404 return ((op[0] == '>') ? (strcmp (arg1, arg2) > 0) : (strcmp (arg1, arg2) < 0));
405 }
406 else if (op[0] == '!' && op[1] == '=' && op[2] == '\0')
407 return (patmatch ? patcomp (arg1, arg2, NE) : (STREQ (arg1, arg2) == 0));
408
409
410 else if (op[2] == 't')
411 {
412 switch (op[1])
413 {
414 case 'n': return (filecomp (arg1, arg2, NT)); /* -nt */
415 case 'o': return (filecomp (arg1, arg2, OT)); /* -ot */
416 case 'l': return (arithcomp (arg1, arg2, LT, flags)); /* -lt */
417 case 'g': return (arithcomp (arg1, arg2, GT, flags)); /* -gt */
418 }
419 }
420 else if (op[1] == 'e')
421 {
422 switch (op[2])
423 {
424 case 'f': return (filecomp (arg1, arg2, EF)); /* -ef */
425 case 'q': return (arithcomp (arg1, arg2, EQ, flags)); /* -eq */
426 }
427 }
428 else if (op[2] == 'e')
429 {
430 switch (op[1])
431 {
432 case 'n': return (arithcomp (arg1, arg2, NE, flags)); /* -ne */
433 case 'g': return (arithcomp (arg1, arg2, GE, flags)); /* -ge */
434 case 'l': return (arithcomp (arg1, arg2, LE, flags)); /* -le */
435 }
436 }
437
438 return (FALSE); /* should never get here */
439 }
440
441
442 static int
443 binary_operator ()
444 {
445 int value;
446 char *w;
447
448 w = argv[pos + 1];
449 if ((w[0] == '=' && (w[1] == '\0' || (w[1] == '=' && w[2] == '\0'))) || /* =, == */
450 ((w[0] == '>' || w[0] == '<') && w[1] == '\0') || /* <, > */
451 (w[0] == '!' && w[1] == '=' && w[2] == '\0')) /* != */
452 {
453 value = binary_test (w, argv[pos], argv[pos + 2], 0);
454 pos += 3;
455 return (value);
456 }
457
458 #if defined (PATTERN_MATCHING)
459 if ((w[0] == '=' || w[0] == '!') && w[1] == '~' && w[2] == '\0')
460 {
461 value = patcomp (argv[pos], argv[pos + 2], w[0] == '=' ? EQ : NE);
462 pos += 3;
463 return (value);
464 }
465 #endif
466
467 if ((w[0] != '-' || w[3] != '\0') || test_binop (w) == 0)
468 {
469 test_syntax_error (_("%s: binary operator expected"), w);
470 /* NOTREACHED */
471 return (FALSE);
472 }
473
474 value = binary_test (w, argv[pos], argv[pos + 2], 0);
475 pos += 3;
476 return value;
477 }
478
479 static int
480 unary_operator ()
481 {
482 char *op;
483 intmax_t r;
484
485 op = argv[pos];
486 if (test_unop (op) == 0)
487 return (FALSE);
488
489 /* the only tricky case is `-t', which may or may not take an argument. */
490 if (op[1] == 't')
491 {
492 advance (0);
493 if (pos < argc)
494 {
495 if (legal_number (argv[pos], &r))
496 {
497 advance (0);
498 return (unary_test (op, argv[pos - 1], 0));
499 }
500 else
501 return (FALSE);
502 }
503 else
504 return (unary_test (op, "1", 0));
505 }
506
507 /* All of the unary operators take an argument, so we first call
508 unary_advance (), which checks to make sure that there is an
509 argument, and then advances pos right past it. This means that
510 pos - 1 is the location of the argument. */
511 unary_advance ();
512 return (unary_test (op, argv[pos - 1], 0));
513 }
514
515 int
516 unary_test (op, arg, flags)
517 char *op, *arg;
518 int flags;
519 {
520 intmax_t r;
521 struct stat stat_buf;
522 struct timespec mtime, atime;
523 SHELL_VAR *v;
524 int aflags;
525
526 switch (op[1])
527 {
528 case 'a': /* file exists in the file system? */
529 case 'e':
530 return (sh_stat (arg, &stat_buf) == 0);
531
532 case 'r': /* file is readable? */
533 return (sh_eaccess (arg, R_OK) == 0);
534
535 case 'w': /* File is writeable? */
536 return (sh_eaccess (arg, W_OK) == 0);
537
538 case 'x': /* File is executable? */
539 return (sh_eaccess (arg, X_OK) == 0);
540
541 case 'O': /* File is owned by you? */
542 return (sh_stat (arg, &stat_buf) == 0 &&
543 (uid_t) current_user.euid == (uid_t) stat_buf.st_uid);
544
545 case 'G': /* File is owned by your group? */
546 return (sh_stat (arg, &stat_buf) == 0 &&
547 (gid_t) current_user.egid == (gid_t) stat_buf.st_gid);
548
549 case 'N':
550 if (sh_stat (arg, &stat_buf) < 0)
551 return (FALSE);
552 atime = get_stat_atime (&stat_buf);
553 mtime = get_stat_mtime (&stat_buf);
554 return (timespec_cmp (mtime, atime) > 0);
555
556 case 'f': /* File is a file? */
557 if (sh_stat (arg, &stat_buf) < 0)
558 return (FALSE);
559
560 /* -f is true if the given file exists and is a regular file. */
561 #if defined (S_IFMT)
562 return (S_ISREG (stat_buf.st_mode) || (stat_buf.st_mode & S_IFMT) == 0);
563 #else
564 return (S_ISREG (stat_buf.st_mode));
565 #endif /* !S_IFMT */
566
567 case 'd': /* File is a directory? */
568 return (sh_stat (arg, &stat_buf) == 0 && (S_ISDIR (stat_buf.st_mode)));
569
570 case 's': /* File has something in it? */
571 return (sh_stat (arg, &stat_buf) == 0 && stat_buf.st_size > (off_t) 0);
572
573 case 'S': /* File is a socket? */
574 #if !defined (S_ISSOCK)
575 return (FALSE);
576 #else
577 return (sh_stat (arg, &stat_buf) == 0 && S_ISSOCK (stat_buf.st_mode));
578 #endif /* S_ISSOCK */
579
580 case 'c': /* File is character special? */
581 return (sh_stat (arg, &stat_buf) == 0 && S_ISCHR (stat_buf.st_mode));
582
583 case 'b': /* File is block special? */
584 return (sh_stat (arg, &stat_buf) == 0 && S_ISBLK (stat_buf.st_mode));
585
586 case 'p': /* File is a named pipe? */
587 #ifndef S_ISFIFO
588 return (FALSE);
589 #else
590 return (sh_stat (arg, &stat_buf) == 0 && S_ISFIFO (stat_buf.st_mode));
591 #endif /* S_ISFIFO */
592
593 case 'L': /* Same as -h */
594 case 'h': /* File is a symbolic link? */
595 #if !defined (S_ISLNK) || !defined (HAVE_LSTAT)
596 return (FALSE);
597 #else
598 return ((arg[0] != '\0') &&
599 (lstat (arg, &stat_buf) == 0) && S_ISLNK (stat_buf.st_mode));
600 #endif /* S_IFLNK && HAVE_LSTAT */
601
602 case 'u': /* File is setuid? */
603 return (sh_stat (arg, &stat_buf) == 0 && (stat_buf.st_mode & S_ISUID) != 0);
604
605 case 'g': /* File is setgid? */
606 return (sh_stat (arg, &stat_buf) == 0 && (stat_buf.st_mode & S_ISGID) != 0);
607
608 case 'k': /* File has sticky bit set? */
609 #if !defined (S_ISVTX)
610 /* This is not Posix, and is not defined on some Posix systems. */
611 return (FALSE);
612 #else
613 return (sh_stat (arg, &stat_buf) == 0 && (stat_buf.st_mode & S_ISVTX) != 0);
614 #endif
615
616 case 't': /* File fd is a terminal? */
617 if (legal_number (arg, &r) == 0)
618 return (FALSE);
619 return ((r == (int)r) && isatty ((int)r));
620
621 case 'n': /* True if arg has some length. */
622 return (arg[0] != '\0');
623
624 case 'z': /* True if arg has no length. */
625 return (arg[0] == '\0');
626
627 case 'o': /* True if option `arg' is set. */
628 return (minus_o_option_value (arg) == 1);
629
630 case 'v':
631 #if defined (ARRAY_VARS)
632 aflags = assoc_expand_once ? AV_NOEXPAND : 0;
633 if (valid_array_reference (arg, aflags))
634 {
635 char *t;
636 int ret;
637 array_eltstate_t es;
638
639 /* Let's assume that this has already been expanded once. */
640 /* XXX - TAG:bash-5.2 fix with corresponding fix to execute_cmd.c:
641 execute_cond_node() that passes TEST_ARRAYEXP in FLAGS */
642
643 if (shell_compatibility_level > 51)
644 /* Allow associative arrays to use `test -v array[@]' to look for
645 a key named `@'. */
646 aflags |= AV_ATSTARKEYS; /* XXX */
647 init_eltstate (&es);
648 t = get_array_value (arg, aflags|AV_ALLOWALL, &es);
649 ret = t ? TRUE : FALSE;
650 if (es.subtype > 0) /* subscript is * or @ */
651 free (t);
652 flush_eltstate (&es);
653 return ret;
654 }
655 else if (legal_number (arg, &r)) /* -v n == is $n set? */
656 return ((r >= 0 && r <= number_of_args()) ? TRUE : FALSE);
657 v = find_variable (arg);
658 if (v && invisible_p (v) == 0 && array_p (v))
659 {
660 char *t;
661 /* [[ -v foo ]] == [[ -v foo[0] ]] */
662 t = array_reference (array_cell (v), 0);
663 return (t ? TRUE : FALSE);
664 }
665 else if (v && invisible_p (v) == 0 && assoc_p (v))
666 {
667 char *t;
668 t = assoc_reference (assoc_cell (v), "0");
669 return (t ? TRUE : FALSE);
670 }
671 #else
672 v = find_variable (arg);
673 #endif
674 return (v && invisible_p (v) == 0 && var_isset (v) ? TRUE : FALSE);
675
676 case 'R':
677 v = find_variable_noref (arg);
678 return ((v && invisible_p (v) == 0 && var_isset (v) && nameref_p (v)) ? TRUE : FALSE);
679 }
680
681 /* We can't actually get here, but this shuts up gcc. */
682 return (FALSE);
683 }
684
685 /* Return TRUE if OP is one of the test command's binary operators. */
686 int
687 test_binop (op)
688 char *op;
689 {
690 if (op[0] == '=' && op[1] == '\0')
691 return (1); /* '=' */
692 else if ((op[0] == '<' || op[0] == '>') && op[1] == '\0') /* string <, > */
693 return (1);
694 else if ((op[0] == '=' || op[0] == '!') && op[1] == '=' && op[2] == '\0')
695 return (1); /* `==' and `!=' */
696 #if defined (PATTERN_MATCHING)
697 else if (op[2] == '\0' && op[1] == '~' && (op[0] == '=' || op[0] == '!'))
698 return (1);
699 #endif
700 else if (op[0] != '-' || op[1] == '\0' || op[2] == '\0' || op[3] != '\0')
701 return (0);
702 else
703 {
704 if (op[2] == 't')
705 switch (op[1])
706 {
707 case 'n': /* -nt */
708 case 'o': /* -ot */
709 case 'l': /* -lt */
710 case 'g': /* -gt */
711 return (1);
712 default:
713 return (0);
714 }
715 else if (op[1] == 'e')
716 switch (op[2])
717 {
718 case 'q': /* -eq */
719 case 'f': /* -ef */
720 return (1);
721 default:
722 return (0);
723 }
724 else if (op[2] == 'e')
725 switch (op[1])
726 {
727 case 'n': /* -ne */
728 case 'g': /* -ge */
729 case 'l': /* -le */
730 return (1);
731 default:
732 return (0);
733 }
734 else
735 return (0);
736 }
737 }
738
739 /* Return non-zero if OP is one of the test command's unary operators. */
740 int
741 test_unop (op)
742 char *op;
743 {
744 if (op[0] != '-' || (op[1] && op[2] != 0))
745 return (0);
746
747 switch (op[1])
748 {
749 case 'a': case 'b': case 'c': case 'd': case 'e':
750 case 'f': case 'g': case 'h': case 'k': case 'n':
751 case 'o': case 'p': case 'r': case 's': case 't':
752 case 'u': case 'v': case 'w': case 'x': case 'z':
753 case 'G': case 'L': case 'O': case 'S': case 'N':
754 case 'R':
755 return (1);
756 }
757
758 return (0);
759 }
760
761 static int
762 two_arguments ()
763 {
764 if (argv[pos][0] == '!' && argv[pos][1] == '\0')
765 return (argv[pos + 1][0] == '\0');
766 else if (argv[pos][0] == '-' && argv[pos][1] && argv[pos][2] == '\0')
767 {
768 if (test_unop (argv[pos]))
769 return (unary_operator ());
770 else
771 test_syntax_error (_("%s: unary operator expected"), argv[pos]);
772 }
773 else
774 test_syntax_error (_("%s: unary operator expected"), argv[pos]);
775
776 return (0);
777 }
778
779 #define ANDOR(s) (s[0] == '-' && (s[1] == 'a' || s[1] == 'o') && s[2] == 0)
780
781 /* This could be augmented to handle `-t' as equivalent to `-t 1', but
782 POSIX requires that `-t' be given an argument. */
783 #define ONE_ARG_TEST(s) ((s)[0] != '\0')
784
785 static int
786 three_arguments ()
787 {
788 int value;
789
790 if (test_binop (argv[pos+1]))
791 {
792 value = binary_operator ();
793 pos = argc;
794 }
795 else if (ANDOR (argv[pos+1]))
796 {
797 if (argv[pos+1][1] == 'a')
798 value = ONE_ARG_TEST(argv[pos]) && ONE_ARG_TEST(argv[pos+2]);
799 else
800 value = ONE_ARG_TEST(argv[pos]) || ONE_ARG_TEST(argv[pos+2]);
801 pos = argc;
802 }
803 else if (argv[pos][0] == '!' && argv[pos][1] == '\0')
804 {
805 advance (1);
806 value = !two_arguments ();
807 pos = argc;
808 }
809 else if (argv[pos][0] == '(' && argv[pos+2][0] == ')')
810 {
811 value = ONE_ARG_TEST(argv[pos+1]);
812 pos = argc;
813 }
814 else
815 test_syntax_error (_("%s: binary operator expected"), argv[pos+1]);
816
817 return (value);
818 }
819
820 /* This is an implementation of a Posix.2 proposal by David Korn. */
821 static int
822 posixtest ()
823 {
824 int value;
825
826 switch (argc - 1) /* one extra passed in */
827 {
828 case 0:
829 value = FALSE;
830 pos = argc;
831 break;
832
833 case 1:
834 value = ONE_ARG_TEST(argv[1]);
835 pos = argc;
836 break;
837
838 case 2:
839 value = two_arguments ();
840 pos = argc;
841 break;
842
843 case 3:
844 value = three_arguments ();
845 break;
846
847 case 4:
848 if (argv[pos][0] == '!' && argv[pos][1] == '\0')
849 {
850 advance (1);
851 value = !three_arguments ();
852 break;
853 }
854 else if (argv[pos][0] == '(' && argv[pos][1] == '\0' && argv[argc-1][0] == ')' && argv[argc-1][1] == '\0')
855 {
856 advance (1);
857 value = two_arguments ();
858 pos = argc;
859 break;
860 }
861 /* FALLTHROUGH */
862 default:
863 value = expr ();
864 }
865
866 return (value);
867 }
868
869 /*
870 * [:
871 * '[' expr ']'
872 * test:
873 * test expr
874 */
875 int
876 test_command (margc, margv)
877 int margc;
878 char **margv;
879 {
880 int value;
881 int code;
882
883 USE_VAR(margc);
884
885 code = setjmp_nosigs (test_exit_buf);
886
887 if (code)
888 return (test_error_return);
889
890 argv = margv;
891
892 if (margv[0] && margv[0][0] == '[' && margv[0][1] == '\0')
893 {
894 --margc;
895
896 if (margv[margc] && (margv[margc][0] != ']' || margv[margc][1]))
897 test_syntax_error (_("missing `]'"), (char *)NULL);
898
899 if (margc < 2)
900 test_exit (SHELL_BOOLEAN (FALSE));
901 }
902
903 argc = margc;
904 pos = 1;
905
906 if (pos >= argc)
907 test_exit (SHELL_BOOLEAN (FALSE));
908
909 noeval = 0;
910 value = posixtest ();
911
912 if (pos != argc)
913 {
914 if (pos < argc && argv[pos][0] == '-')
915 test_syntax_error (_("syntax error: `%s' unexpected"), argv[pos]);
916 else
917 test_syntax_error (_("too many arguments"), (char *)NULL);
918 }
919
920 test_exit (SHELL_BOOLEAN (value));
921 }