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 Fischer to be useable (i.e. a bit less bloaty).
17 * Licensed under GPLv2 or later, see file LICENSE in this tarball for details.
19 * Original copyright notice states:
20 * "This program is in the Public Domain."
26 /* This is a NOEXEC applet. Be very careful! */
29 /* test(1) accepts the following grammar:
30 oexpr ::= aexpr | aexpr "-o" oexpr ;
31 aexpr ::= nexpr | nexpr "-a" aexpr ;
32 nexpr ::= primary | "!" primary
33 primary ::= unary-operator operand
34 | operand binary-operator operand
38 unary-operator ::= "-r"|"-w"|"-x"|"-f"|"-d"|"-c"|"-b"|"-p"|
39 "-u"|"-g"|"-k"|"-s"|"-t"|"-z"|"-n"|"-o"|"-O"|"-G"|"-L"|"-S";
41 binary-operator ::= "="|"=="|"!="|"-eq"|"-ne"|"-ge"|"-gt"|"-le"|"-lt"|
43 operand ::= <any legal UNIX file name>
88 #define is_int_op(a) (((unsigned char)((a) - INTEQ)) <= 5)
89 #define is_str_op(a) (((unsigned char)((a) - STREZ)) <= 5)
90 #define is_file_op(a) (((unsigned char)((a) - FILNT)) <= 2)
91 #define is_file_access(a) (((unsigned char)((a) - FILRD)) <= 2)
92 #define is_file_type(a) (((unsigned char)((a) - FILREG)) <= 5)
93 #define is_file_bit(a) (((unsigned char)((a) - FILSUID)) <= 2)
102 static const struct t_op {
104 unsigned char op_num, op_type;
106 { "-r", FILRD , UNOP },
107 { "-w", FILWR , UNOP },
108 { "-x", FILEX , UNOP },
109 { "-e", FILEXIST, UNOP },
110 { "-f", FILREG , UNOP },
111 { "-d", FILDIR , UNOP },
112 { "-c", FILCDEV , UNOP },
113 { "-b", FILBDEV , UNOP },
114 { "-p", FILFIFO , UNOP },
115 { "-u", FILSUID , UNOP },
116 { "-g", FILSGID , UNOP },
117 { "-k", FILSTCK , UNOP },
118 { "-s", FILGZ , UNOP },
119 { "-t", FILTT , UNOP },
120 { "-z", STREZ , UNOP },
121 { "-n", STRNZ , UNOP },
122 { "-h", FILSYM , UNOP }, /* for backwards compat */
124 { "-O" , FILUID , UNOP },
125 { "-G" , FILGID , UNOP },
126 { "-L" , FILSYM , UNOP },
127 { "-S" , FILSOCK, UNOP },
128 { "=" , STREQ , BINOP },
129 { "==" , STREQ , BINOP },
130 { "!=" , STRNE , BINOP },
131 { "<" , STRLT , BINOP },
132 { ">" , STRGT , BINOP },
133 { "-eq", INTEQ , BINOP },
134 { "-ne", INTNE , BINOP },
135 { "-ge", INTGE , BINOP },
136 { "-gt", INTGT , BINOP },
137 { "-le", INTLE , BINOP },
138 { "-lt", INTLT , BINOP },
139 { "-nt", FILNT , BINOP },
140 { "-ot", FILOT , BINOP },
141 { "-ef", FILEQ , BINOP },
142 { "!" , UNOT , BUNOP },
143 { "-a" , BAND , BBINOP },
144 { "-o" , BOR , BBINOP },
145 { "(" , LPAREN , PAREN },
146 { ")" , RPAREN , PAREN },
149 enum { NUM_OPS = sizeof(ops) / sizeof(ops[0]) };
151 #if ENABLE_FEATURE_TEST_64
152 typedef int64_t arith_t;
157 /* Cannot eliminate these static data (do the G trick)
158 * because of bb_test usage from other applets */
160 static struct t_op const *t_wp_op;
161 static gid_t *group_array;
163 static jmp_buf leaving;
165 static enum token t_lex(char *s);
166 static arith_t oexpr(enum token n);
167 static arith_t aexpr(enum token n);
168 static arith_t nexpr(enum token n);
169 static int binop(void);
170 static arith_t primary(enum token n);
171 static int filstat(char *nm, enum token mode);
172 static arith_t getn(const char *s);
174 static int newerf(const char *f1, const char *f2);
175 static int olderf(const char *f1, const char *f2);
176 static int equalf(const char *f1, const char *f2);
178 static int test_eaccess(char *path, int mode);
179 static int is_a_group_member(gid_t gid);
180 static void initialize_group_array(void);
182 int bb_test(int argc, char **argv)
186 if (LONE_CHAR(argv[0], '[')) {
188 if (NOT_LONE_CHAR(argv[argc], ']')) {
189 bb_error_msg("missing ]");
193 } else if (strcmp(argv[0], "[[") == 0) {
195 if (strcmp(argv[argc], "]]")) {
196 bb_error_msg("missing ]]");
202 res = setjmp(leaving);
206 /* resetting ngroups is probably unnecessary. it will
207 * force a new call to getgroups(), which prevents using
208 * group data fetched during a previous call. but the
209 * only way the group data could be stale is if there's
210 * been an intervening call to setgroups(), and this
211 * isn't likely in the case of a shell. paranoia
216 /* Implement special cases from POSIX.2, section 4.62.4 */
220 return *argv[1] == '\0';
222 if (LONE_CHAR(argv[1], '!')) {
225 return *argv[2] != '\0';
227 t_lex(argv[2 + _off]);
228 if (t_wp_op && t_wp_op->op_type == BINOP) {
229 t_wp = &argv[1 + _off];
234 res = !oexpr(t_lex(*t_wp));
236 if (*t_wp != NULL && *++t_wp != NULL) {
237 bb_error_msg("%s: unknown operand", *t_wp);
243 static void syntax(const char *op, const char *msg) ATTRIBUTE_NORETURN;
244 static void syntax(const char *op, const char *msg)
247 bb_error_msg("%s: %s", op, msg);
249 bb_error_msg("%s: %s"+4, msg);
254 static arith_t oexpr(enum token n)
259 if (t_lex(*++t_wp) == BOR) {
260 return oexpr(t_lex(*++t_wp)) || res;
266 static arith_t aexpr(enum token n)
271 if (t_lex(*++t_wp) == BAND)
272 return aexpr(t_lex(*++t_wp)) && res;
277 static arith_t nexpr(enum token n)
280 return !nexpr(t_lex(*++t_wp));
284 static arith_t primary(enum token n)
289 syntax(NULL, "argument expected");
292 res = oexpr(t_lex(*++t_wp));
293 if (t_lex(*++t_wp) != RPAREN)
294 syntax(NULL, "closing paren expected");
297 if (t_wp_op && t_wp_op->op_type == UNOP) {
298 /* unary expression */
300 syntax(t_wp_op->op_text, "argument expected");
302 return t_wp[0][0] == '\0';
304 return t_wp[0][0] != '\0';
306 return isatty(getn(*t_wp));
307 return filstat(*t_wp, n);
311 if (t_wp_op && t_wp_op->op_type == BINOP) {
315 return t_wp[0][0] != '\0';
318 static int binop(void)
320 const char *opnd1, *opnd2;
321 struct t_op const *op;
325 (void) t_lex(*++t_wp);
330 syntax(op->op_text, "argument expected");
332 if (is_int_op(op->op_num)) {
335 if (op->op_num == INTEQ)
337 if (op->op_num == INTNE)
339 if (op->op_num == INTGE)
341 if (op->op_num == INTGT)
343 if (op->op_num == INTLE)
345 if (op->op_num == INTLT)
348 if (is_str_op(op->op_num)) {
349 val1 = strcmp(opnd1, opnd2);
350 if (op->op_num == STREQ)
352 if (op->op_num == STRNE)
354 if (op->op_num == STRLT)
356 if (op->op_num == STRGT)
359 /* We are sure that these three are by now the only binops we didn't check
360 * yet, so we do not check if the class is correct:
362 /* if (is_file_op(op->op_num)) */
366 if (stat(opnd1, &b1) || stat(opnd2, &b2))
367 return 0; /* false, since at least one stat failed */
368 if (op->op_num == FILNT)
369 return b1.st_mtime > b2.st_mtime;
370 if (op->op_num == FILOT)
371 return b1.st_mtime < b2.st_mtime;
372 if (op->op_num == FILEQ)
373 return b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino;
375 return 1; /* NOTREACHED */
378 static int filstat(char *nm, enum token mode)
383 if (mode == FILSYM) {
385 if (lstat(nm, &s) == 0) {
393 if (stat(nm, &s) != 0)
395 if (mode == FILEXIST)
397 if (is_file_access(mode)) {
404 return test_eaccess(nm, i) == 0;
406 if (is_file_type(mode)) {
415 if (mode == FILFIFO) {
422 if (mode == FILSOCK) {
430 return ((s.st_mode & S_IFMT) == i);
432 if (is_file_bit(mode)) {
439 return ((s.st_mode & i) != 0);
442 return s.st_size > 0L;
444 return s.st_uid == geteuid();
446 return s.st_gid == getegid();
447 return 1; /* NOTREACHED */
450 static enum token t_lex(char *s)
452 const struct t_op *op;
461 if (strcmp(s, op->op_text) == 0) {
466 } while (op < ops + NUM_OPS);
471 /* atoi with error detection */
472 //XXX: FIXME: duplicate of existing libbb function?
473 static arith_t getn(const char *s)
476 #if ENABLE_FEATURE_TEST_64
483 #if ENABLE_FEATURE_TEST_64
484 r = strtoll(s, &p, 10);
486 r = strtol(s, &p, 10);
490 syntax(s, "out of range");
492 if (*(skip_whitespace(p)))
493 syntax(s, "bad number");
499 static int newerf(const char *f1, const char *f2)
503 return (stat(f1, &b1) == 0 &&
504 stat(f2, &b2) == 0 && b1.st_mtime > b2.st_mtime);
507 static int olderf(const char *f1, const char *f2)
511 return (stat(f1, &b1) == 0 &&
512 stat(f2, &b2) == 0 && b1.st_mtime < b2.st_mtime);
515 static int equalf(const char *f1, const char *f2)
519 return (stat(f1, &b1) == 0 &&
520 stat(f2, &b2) == 0 &&
521 b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino);
525 /* Do the same thing access(2) does, but use the effective uid and gid,
526 and don't make the mistake of telling root that any file is
528 static int test_eaccess(char *path, int mode)
531 unsigned int euid = geteuid();
533 if (stat(path, &st) < 0)
537 /* Root can read or write any file. */
541 /* Root can execute any file that has any one of the execute
543 if (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))
547 if (st.st_uid == euid) /* owner */
549 else if (is_a_group_member(st.st_gid))
552 if (st.st_mode & mode)
558 static void initialize_group_array(void)
560 ngroups = getgroups(0, NULL);
562 /* FIXME: ash tries so hard to not die on OOM,
563 * and we spoil it with just one xrealloc here */
564 /* We realloc, because bb_test can be entered repeatedly by shell.
565 * Testcase (ash): 'while true; do test -x some_file; done'
566 * and watch top. (some_file must have owner != you) */
567 group_array = xrealloc(group_array, ngroups * sizeof(gid_t));
568 getgroups(ngroups, group_array);
572 /* Return non-zero if GID is one that we have in our groups list. */
573 //XXX: FIXME: duplicate of existing libbb function?
574 // see toplevel TODO file:
575 // possible code duplication ingroup() and is_a_group_member()
576 static int is_a_group_member(gid_t gid)
580 /* Short-circuit if possible, maybe saving a call to getgroups(). */
581 if (gid == getgid() || gid == getegid())
585 initialize_group_array();
587 /* Search through the list looking for GID. */
588 for (i = 0; i < ngroups; i++)
589 if (gid == group_array[i])
596 /* applet entry point */
598 int test_main(int argc, char **argv);
599 int test_main(int argc, char **argv)
601 return bb_test(argc, argv);