1 /* vi: set sw=4 ts=4: */
3 * test implementation for busybox
5 * Copyright (c) by a whole pile of folks:
7 * test(1); version 7-like -- author Erik Baalbergen
8 * modified by Eric Gisin to be used as built-in.
9 * modified by Arnold Robbins to add SVR3 compatibility
10 * (-x -c -b -p -u -g -k) plus Korn's -L -nt -ot -ef and new -S (socket).
11 * modified by J.T. Conklin for NetBSD.
12 * modified by Herbert Xu to be used as built-in in ash.
13 * modified by Erik Andersen <andersen@codepoet.org> to be used
15 * modified by Bernhard Reutner-Fischer to be useable (i.e. a bit less bloaty).
17 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
19 * Original copyright notice states:
20 * "This program is in the Public Domain."
23 //kbuild:lib-$(CONFIG_TEST) += test.o test_ptr_hack.o
24 //kbuild:lib-$(CONFIG_ASH) += test.o test_ptr_hack.o
25 //kbuild:lib-$(CONFIG_HUSH) += test.o test_ptr_hack.o
31 //config: test is used to check file types and compare values,
32 //config: returning an appropriate exit code. The bash shell
33 //config: has test built in, ash can build it in optionally.
35 //config:config FEATURE_TEST_64
36 //config: bool "Extend test to 64 bit"
38 //config: depends on TEST || ASH_BUILTIN_TEST || HUSH
40 //config: Enable 64-bit support in test.
42 /* "test --help" is special-cased to ignore --help */
43 //usage:#define test_trivial_usage NOUSAGE_STR
44 //usage:#define test_full_usage ""
46 //usage:#define test_example_usage
47 //usage: "$ test 1 -eq 2\n"
48 //usage: "$ echo $?\n"
50 //usage: "$ test 1 -eq 1\n"
51 //usage: "$ echo $?\n"
53 //usage: "$ [ -d /etc ]\n"
54 //usage: "$ echo $?\n"
56 //usage: "$ [ -d /junk ]\n"
57 //usage: "$ echo $?\n"
63 /* This is a NOFORK applet. Be very careful! */
65 /* test_main() is called from shells, and we need to be extra careful here.
66 * This is true regardless of PREFER_APPLETS and SH_STANDALONE
69 /* test(1) accepts the following grammar:
70 oexpr ::= aexpr | aexpr "-o" oexpr ;
71 aexpr ::= nexpr | nexpr "-a" aexpr ;
72 nexpr ::= primary | "!" primary
73 primary ::= unary-operator operand
74 | operand binary-operator operand
78 unary-operator ::= "-r"|"-w"|"-x"|"-f"|"-d"|"-c"|"-b"|"-p"|
79 "-u"|"-g"|"-k"|"-s"|"-t"|"-z"|"-n"|"-o"|"-O"|"-G"|"-L"|"-S";
81 binary-operator ::= "="|"=="|"!="|"-eq"|"-ne"|"-ge"|"-gt"|"-le"|"-lt"|
83 operand ::= <any legal UNIX file name>
86 /* TODO: handle [[ expr ]] bashism bash-compatibly.
87 * [[ ]] is meant to be a "better [ ]", with less weird syntax
88 * and without the risk of variables and quoted strings misinterpreted
90 * This will require support from shells - we need to know quote status
91 * of each parameter (see below).
93 * Word splitting and pathname expansion should NOT be performed:
94 * # a="a b"; [[ $a = "a b" ]] && echo YES
96 * # [[ /bin/m* ]] && echo YES
99 * =~ should do regexp match
100 * = and == should do pattern match against right side:
101 * # [[ *a* == bab ]] && echo YES
102 * # [[ bab == *a* ]] && echo YES
104 * != does the negated == (i.e., also with pattern matching).
105 * Pattern matching is quotation-sensitive:
106 * # [[ bab == "b"a* ]] && echo YES
108 * # [[ bab == b"a*" ]] && echo YES
110 * Conditional operators such as -f must be unquoted literals to be recognized:
111 * # [[ -e /bin ]] && echo YES
113 * # [[ '-e' /bin ]] && echo YES
114 * bash: conditional binary operator expected...
115 * # A='-e'; [[ $A /bin ]] && echo YES
116 * bash: conditional binary operator expected...
118 * || and && should work as -o and -a work in [ ]
119 * -a and -o aren't recognized (&& and || are to be used instead)
120 * ( and ) do not need to be quoted unlike in [ ]:
121 * # [[ ( abc ) && '' ]] && echo YES
122 * # [[ ( abc ) || '' ]] && echo YES
124 * # [[ ( abc ) -o '' ]] && echo YES
125 * bash: syntax error in conditional expression...
127 * Apart from the above, [[ expr ]] should work as [ expr ]
135 FILRD, /* file access */
141 FILREG, /* file type */
152 FILSUID, /* file bit */
156 FILNT, /* file ops */
184 #define is_int_op(a) (((unsigned char)((a) - INTEQ)) <= 5)
185 #define is_str_op(a) (((unsigned char)((a) - STREZ)) <= 5)
186 #define is_file_op(a) (((unsigned char)((a) - FILNT)) <= 2)
187 #define is_file_access(a) (((unsigned char)((a) - FILRD)) <= 2)
188 #define is_file_type(a) (((unsigned char)((a) - FILREG)) <= 5)
189 #define is_file_bit(a) (((unsigned char)((a) - FILSUID)) <= 2)
193 #define nest_msg(...) do { \
195 fprintf(stderr, "%*s", depth*2, ""); \
196 fprintf(stderr, __VA_ARGS__); \
198 #define unnest_msg(...) do { \
199 fprintf(stderr, "%*s", depth*2, ""); \
200 fprintf(stderr, __VA_ARGS__); \
203 #define dbg_msg(...) do { \
204 fprintf(stderr, "%*s", depth*2, ""); \
205 fprintf(stderr, __VA_ARGS__); \
207 #define unnest_msg_and_return(expr, ...) do { \
208 number_t __res = (expr); \
209 fprintf(stderr, "%*s", depth*2, ""); \
210 fprintf(stderr, __VA_ARGS__, res); \
214 static const char *const TOKSTR[] = {
257 #define nest_msg(...) ((void)0)
258 #define unnest_msg(...) ((void)0)
259 #define dbg_msg(...) ((void)0)
260 #define unnest_msg_and_return(expr, ...) return expr
272 unsigned char op_num, op_type;
275 static const struct operator_t ops_table[] = {
276 { /* "-r" */ FILRD , UNOP },
277 { /* "-w" */ FILWR , UNOP },
278 { /* "-x" */ FILEX , UNOP },
279 { /* "-e" */ FILEXIST, UNOP },
280 { /* "-f" */ FILREG , UNOP },
281 { /* "-d" */ FILDIR , UNOP },
282 { /* "-c" */ FILCDEV , UNOP },
283 { /* "-b" */ FILBDEV , UNOP },
284 { /* "-p" */ FILFIFO , UNOP },
285 { /* "-u" */ FILSUID , UNOP },
286 { /* "-g" */ FILSGID , UNOP },
287 { /* "-k" */ FILSTCK , UNOP },
288 { /* "-s" */ FILGZ , UNOP },
289 { /* "-t" */ FILTT , UNOP },
290 { /* "-z" */ STREZ , UNOP },
291 { /* "-n" */ STRNZ , UNOP },
292 { /* "-h" */ FILSYM , UNOP }, /* for backwards compat */
294 { /* "-O" */ FILUID , UNOP },
295 { /* "-G" */ FILGID , UNOP },
296 { /* "-L" */ FILSYM , UNOP },
297 { /* "-S" */ FILSOCK , UNOP },
298 { /* "=" */ STREQ , BINOP },
299 { /* "==" */ STREQ , BINOP },
300 { /* "!=" */ STRNE , BINOP },
301 { /* "<" */ STRLT , BINOP },
302 { /* ">" */ STRGT , BINOP },
303 { /* "-eq"*/ INTEQ , BINOP },
304 { /* "-ne"*/ INTNE , BINOP },
305 { /* "-ge"*/ INTGE , BINOP },
306 { /* "-gt"*/ INTGT , BINOP },
307 { /* "-le"*/ INTLE , BINOP },
308 { /* "-lt"*/ INTLT , BINOP },
309 { /* "-nt"*/ FILNT , BINOP },
310 { /* "-ot"*/ FILOT , BINOP },
311 { /* "-ef"*/ FILEQ , BINOP },
312 { /* "!" */ UNOT , BUNOP },
313 { /* "-a" */ BAND , BBINOP },
314 { /* "-o" */ BOR , BBINOP },
315 { /* "(" */ LPAREN , PAREN },
316 { /* ")" */ RPAREN , PAREN },
318 /* Please keep these two tables in sync */
319 static const char ops_texts[] ALIGN1 =
364 #if ENABLE_FEATURE_TEST_64
365 typedef int64_t number_t;
367 typedef int number_t;
371 /* We try to minimize both static and stack usage. */
372 struct test_statics {
374 /* set only by check_operator(), either to bogus struct
375 * or points to matching operator_t struct. Never NULL. */
376 const struct operator_t *last_operator;
382 /* See test_ptr_hack.c */
383 extern struct test_statics *const test_ptr_to_statics;
385 #define S (*test_ptr_to_statics)
386 #define args (S.args )
387 #define last_operator (S.last_operator)
388 #define group_array (S.group_array )
389 #define ngroups (S.ngroups )
390 #define leaving (S.leaving )
392 #define INIT_S() do { \
393 (*(struct test_statics**)&test_ptr_to_statics) = xzalloc(sizeof(S)); \
396 #define DEINIT_S() do { \
398 free(test_ptr_to_statics); \
401 static number_t primary(enum token n);
403 static void syntax(const char *op, const char *msg) NORETURN;
404 static void syntax(const char *op, const char *msg)
407 bb_error_msg("%s: %s", op, msg);
409 bb_error_msg("%s: %s"+4, msg);
414 /* atoi with error detection */
415 //XXX: FIXME: duplicate of existing libbb function?
416 static number_t getn(const char *s)
419 #if ENABLE_FEATURE_TEST_64
426 #if ENABLE_FEATURE_TEST_64
427 r = strtoll(s, &p, 10);
429 r = strtol(s, &p, 10);
433 syntax(s, "out of range");
435 if (p == s || *(skip_whitespace(p)) != '\0')
436 syntax(s, "bad number");
442 static int newerf(const char *f1, const char *f2)
446 return (stat(f1, &b1) == 0 &&
447 stat(f2, &b2) == 0 && b1.st_mtime > b2.st_mtime);
450 static int olderf(const char *f1, const char *f2)
454 return (stat(f1, &b1) == 0 &&
455 stat(f2, &b2) == 0 && b1.st_mtime < b2.st_mtime);
458 static int equalf(const char *f1, const char *f2)
462 return (stat(f1, &b1) == 0 &&
463 stat(f2, &b2) == 0 &&
464 b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino);
469 static enum token check_operator(const char *s)
471 static const struct operator_t no_op = {
477 last_operator = &no_op;
480 n = index_in_strings(ops_texts, s);
483 last_operator = &ops_table[n];
484 return ops_table[n].op_num;
488 static int binop(void)
490 const char *opnd1, *opnd2;
491 const struct operator_t *op;
495 check_operator(*++args);
500 syntax(args[-1], "argument expected");
502 if (is_int_op(op->op_num)) {
505 if (op->op_num == INTEQ)
507 if (op->op_num == INTNE)
509 if (op->op_num == INTGE)
511 if (op->op_num == INTGT)
513 if (op->op_num == INTLE)
515 /*if (op->op_num == INTLT)*/
518 if (is_str_op(op->op_num)) {
519 val1 = strcmp(opnd1, opnd2);
520 if (op->op_num == STREQ)
522 if (op->op_num == STRNE)
524 if (op->op_num == STRLT)
526 /*if (op->op_num == STRGT)*/
529 /* We are sure that these three are by now the only binops we didn't check
530 * yet, so we do not check if the class is correct:
532 /* if (is_file_op(op->op_num)) */
536 if (stat(opnd1, &b1) || stat(opnd2, &b2))
537 return 0; /* false, since at least one stat failed */
538 if (op->op_num == FILNT)
539 return b1.st_mtime > b2.st_mtime;
540 if (op->op_num == FILOT)
541 return b1.st_mtime < b2.st_mtime;
542 /*if (op->op_num == FILEQ)*/
543 return b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino;
545 /*return 1; - NOTREACHED */
549 static void initialize_group_array(void)
553 /* getgroups may be expensive, try to use it only once */
556 /* FIXME: ash tries so hard to not die on OOM,
557 * and we spoil it with just one xrealloc here */
558 /* We realloc, because test_main can be entered repeatedly by shell.
559 * Testcase (ash): 'while true; do test -x some_file; done'
560 * and watch top. (some_file must have owner != you) */
562 group_array = xrealloc(group_array, n * sizeof(gid_t));
563 ngroups = getgroups(n, group_array);
564 } while (ngroups > n);
568 /* Return non-zero if GID is one that we have in our groups list. */
569 //XXX: FIXME: duplicate of existing libbb function?
570 // see toplevel TODO file:
571 // possible code duplication ingroup() and is_a_group_member()
572 static int is_a_group_member(gid_t gid)
576 /* Short-circuit if possible, maybe saving a call to getgroups(). */
577 if (gid == getgid() || gid == getegid())
581 initialize_group_array();
583 /* Search through the list looking for GID. */
584 for (i = 0; i < ngroups; i++)
585 if (gid == group_array[i])
592 /* Do the same thing access(2) does, but use the effective uid and gid,
593 and don't make the mistake of telling root that any file is
595 static int test_eaccess(char *path, int mode)
598 unsigned int euid = geteuid();
600 if (stat(path, &st) < 0)
604 /* Root can read or write any file. */
608 /* Root can execute any file that has any one of the execute
610 if (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))
614 if (st.st_uid == euid) /* owner */
616 else if (is_a_group_member(st.st_gid))
619 if (st.st_mode & mode)
626 static int filstat(char *nm, enum token mode)
629 unsigned i = i; /* gcc 3.x thinks it can be used uninitialized */
631 if (mode == FILSYM) {
633 if (lstat(nm, &s) == 0) {
641 if (stat(nm, &s) != 0)
643 if (mode == FILEXIST)
645 if (is_file_access(mode)) {
652 return test_eaccess(nm, i) == 0;
654 if (is_file_type(mode)) {
663 if (mode == FILFIFO) {
670 if (mode == FILSOCK) {
678 return ((s.st_mode & S_IFMT) == i);
680 if (is_file_bit(mode)) {
687 return ((s.st_mode & i) != 0);
690 return s.st_size > 0L;
692 return s.st_uid == geteuid();
694 return s.st_gid == getegid();
695 return 1; /* NOTREACHED */
699 static number_t nexpr(enum token n)
703 nest_msg(">nexpr(%s)\n", TOKSTR[n]);
705 n = check_operator(*++args);
707 /* special case: [ ! ], [ a -a ! ] are valid */
708 /* IOW, "! ARG" may miss ARG */
710 unnest_msg("<nexpr:1 (!EOI), args:%s(%p)\n", args[0], &args[0]);
714 unnest_msg("<nexpr:%lld\n", res);
718 unnest_msg("<nexpr:%lld\n", res);
723 static number_t aexpr(enum token n)
727 nest_msg(">aexpr(%s)\n", TOKSTR[n]);
729 dbg_msg("aexpr: nexpr:%lld, next args:%s(%p)\n", res, args[1], &args[1]);
730 if (check_operator(*++args) == BAND) {
731 dbg_msg("aexpr: arg is AND, next args:%s(%p)\n", args[1], &args[1]);
732 res = aexpr(check_operator(*++args)) && res;
733 unnest_msg("<aexpr:%lld\n", res);
737 unnest_msg("<aexpr:%lld, args:%s(%p)\n", res, args[0], &args[0]);
742 static number_t oexpr(enum token n)
746 nest_msg(">oexpr(%s)\n", TOKSTR[n]);
748 dbg_msg("oexpr: aexpr:%lld, next args:%s(%p)\n", res, args[1], &args[1]);
749 if (check_operator(*++args) == BOR) {
750 dbg_msg("oexpr: next arg is OR, next args:%s(%p)\n", args[1], &args[1]);
751 res = oexpr(check_operator(*++args)) || res;
752 unnest_msg("<oexpr:%lld\n", res);
756 unnest_msg("<oexpr:%lld, args:%s(%p)\n", res, args[0], &args[0]);
761 static number_t primary(enum token n)
764 number_t res = res; /* for compiler */
768 const struct operator_t *args0_op;
770 nest_msg(">primary(%s)\n", TOKSTR[n]);
772 syntax(NULL, "argument expected");
775 res = oexpr(check_operator(*++args));
776 if (check_operator(*++args) != RPAREN)
777 syntax(NULL, "closing paren expected");
778 unnest_msg("<primary:%lld\n", res);
782 /* coreutils 6.9 checks "is args[1] binop and args[2] exist?" first,
784 args0_op = last_operator;
785 /* last_operator = operator at args[1] */
786 if (check_operator(args[1]) != EOI) { /* if args[1] != NULL */
788 // coreutils also does this:
789 // if (args[3] && args[0]="-l" && args[2] is BINOP)
790 // return binop(1 /* prepended by -l */);
791 if (last_operator->op_type == BINOP)
792 unnest_msg_and_return(binop(), "<primary: binop:%lld\n");
795 /* check "is args[0] unop?" second */
796 if (args0_op->op_type == UNOP) {
797 /* unary expression */
799 // syntax(args0_op->op_text, "argument expected");
800 goto check_emptiness;
803 unnest_msg_and_return(args[0][0] == '\0', "<primary:%lld\n");
805 unnest_msg_and_return(args[0][0] != '\0', "<primary:%lld\n");
807 unnest_msg_and_return(isatty(getn(*args)), "<primary: isatty(%s)%lld\n", *args);
808 unnest_msg_and_return(filstat(*args, n), "<primary: filstat(%s):%lld\n", *args);
811 /*check_operator(args[1]); - already done */
812 if (last_operator->op_type == BINOP) {
813 /* args[2] is known to be NULL, isn't it bound to fail? */
814 unnest_msg_and_return(binop(), "<primary:%lld\n");
817 unnest_msg_and_return(args[0][0] != '\0', "<primary:%lld\n");
821 int test_main(int argc, char **argv)
826 arg0 = bb_basename(argv[0]);
827 if (arg0[0] == '[') {
829 if (!arg0[1]) { /* "[" ? */
830 if (NOT_LONE_CHAR(argv[argc], ']')) {
831 bb_error_msg("missing ]");
834 } else { /* assuming "[[" */
835 if (strcmp(argv[argc], "]]") != 0) {
836 bb_error_msg("missing ]]");
842 /* argc is unused after this point */
844 /* We must do DEINIT_S() prior to returning */
847 res = setjmp(leaving);
851 /* resetting ngroups is probably unnecessary. it will
852 * force a new call to getgroups(), which prevents using
853 * group data fetched during a previous call. but the
854 * only way the group data could be stale is if there's
855 * been an intervening call to setgroups(), and this
856 * isn't likely in the case of a shell. paranoia
859 /*ngroups = 0; - done by INIT_S() */
864 /* Implement special cases from POSIX.2, section 4.62.4.
865 * Testcase: "test '(' = '('"
866 * The general parser would misinterpret '(' as group start.
878 res = (argv[0][0] == '\0');
881 if (argv[2] && !argv[3]) {
882 check_operator(argv[1]);
883 if (last_operator->op_type == BINOP) {
884 /* "test [!] arg1 <binary_op> arg2" */
886 res = (binop() == 0);
888 /* If there was leading "!" op... */
893 if (LONE_CHAR(argv[0], '!')) {
900 res = !oexpr(check_operator(*args));
902 if (*args != NULL && *++args != NULL) {
907 bb_error_msg("%s: unknown operand", *args);