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 },
150 #if ENABLE_FEATURE_TEST_64
151 typedef int64_t arith_t;
156 /* Cannot eliminate these static data (do the G trick)
157 * because of test_main usage from other applets */
159 static const struct t_op *t_wp_op;
160 static gid_t *group_array;
162 static jmp_buf leaving;
164 static enum token t_lex(char *s);
165 static arith_t oexpr(enum token n);
166 static arith_t aexpr(enum token n);
167 static arith_t nexpr(enum token n);
168 static int binop(void);
169 static arith_t primary(enum token n);
170 static int filstat(char *nm, enum token mode);
171 static arith_t getn(const char *s);
173 static int newerf(const char *f1, const char *f2);
174 static int olderf(const char *f1, const char *f2);
175 static int equalf(const char *f1, const char *f2);
177 static int test_eaccess(char *path, int mode);
178 static int is_a_group_member(gid_t gid);
179 static void initialize_group_array(void);
181 int test_main(int argc, char **argv)
187 arg0 = bb_basename(argv[0]);
188 if (arg0[0] == '[') {
190 if (!arg0[1]) { /* "[" ? */
191 if (NOT_LONE_CHAR(argv[argc], ']')) {
192 bb_error_msg("missing ]");
195 } else { /* assuming "[[" */
196 if (strcmp(argv[argc], "]]") != 0) {
197 bb_error_msg("missing ]]");
204 res = setjmp(leaving);
208 /* resetting ngroups is probably unnecessary. it will
209 * force a new call to getgroups(), which prevents using
210 * group data fetched during a previous call. but the
211 * only way the group data could be stale is if there's
212 * been an intervening call to setgroups(), and this
213 * isn't likely in the case of a shell. paranoia
218 /* Implement special cases from POSIX.2, section 4.62.4 */
222 return *argv[1] == '\0';
224 /* remember if we saw argc==4 which wants *no* '!' test */
227 (LONE_CHAR(argv[1], '!'))
228 : (argv[1][0] != '!' || argv[1][1] != '\0'))
231 return *argv[2] != '\0';
233 t_lex(argv[2 + _off]);
234 if (t_wp_op && t_wp_op->op_type == BINOP) {
235 t_wp = &argv[1 + _off];
236 return binop() == _off;
240 res = !oexpr(t_lex(*t_wp));
242 if (*t_wp != NULL && *++t_wp != NULL) {
243 bb_error_msg("%s: unknown operand", *t_wp);
249 static void syntax(const char *op, const char *msg) ATTRIBUTE_NORETURN;
250 static void syntax(const char *op, const char *msg)
253 bb_error_msg("%s: %s", op, msg);
255 bb_error_msg("%s: %s"+4, msg);
260 static arith_t oexpr(enum token n)
265 if (t_lex(*++t_wp) == BOR) {
266 return oexpr(t_lex(*++t_wp)) || res;
272 static arith_t aexpr(enum token n)
277 if (t_lex(*++t_wp) == BAND)
278 return aexpr(t_lex(*++t_wp)) && res;
283 static arith_t nexpr(enum token n)
286 return !nexpr(t_lex(*++t_wp));
290 static arith_t primary(enum token n)
295 syntax(NULL, "argument expected");
298 res = oexpr(t_lex(*++t_wp));
299 if (t_lex(*++t_wp) != RPAREN)
300 syntax(NULL, "closing paren expected");
303 if (t_wp_op && t_wp_op->op_type == UNOP) {
304 /* unary expression */
306 syntax(t_wp_op->op_text, "argument expected");
308 return t_wp[0][0] == '\0';
310 return t_wp[0][0] != '\0';
312 return isatty(getn(*t_wp));
313 return filstat(*t_wp, n);
317 if (t_wp_op && t_wp_op->op_type == BINOP) {
321 return t_wp[0][0] != '\0';
324 static int binop(void)
326 const char *opnd1, *opnd2;
327 struct t_op const *op;
331 (void) t_lex(*++t_wp);
336 syntax(op->op_text, "argument expected");
338 if (is_int_op(op->op_num)) {
341 if (op->op_num == INTEQ)
343 if (op->op_num == INTNE)
345 if (op->op_num == INTGE)
347 if (op->op_num == INTGT)
349 if (op->op_num == INTLE)
351 if (op->op_num == INTLT)
354 if (is_str_op(op->op_num)) {
355 val1 = strcmp(opnd1, opnd2);
356 if (op->op_num == STREQ)
358 if (op->op_num == STRNE)
360 if (op->op_num == STRLT)
362 if (op->op_num == STRGT)
365 /* We are sure that these three are by now the only binops we didn't check
366 * yet, so we do not check if the class is correct:
368 /* if (is_file_op(op->op_num)) */
372 if (stat(opnd1, &b1) || stat(opnd2, &b2))
373 return 0; /* false, since at least one stat failed */
374 if (op->op_num == FILNT)
375 return b1.st_mtime > b2.st_mtime;
376 if (op->op_num == FILOT)
377 return b1.st_mtime < b2.st_mtime;
378 if (op->op_num == FILEQ)
379 return b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino;
381 return 1; /* NOTREACHED */
384 static int filstat(char *nm, enum token mode)
387 int i = i; /* gcc 3.x thinks it can be used uninitialized */
389 if (mode == FILSYM) {
391 if (lstat(nm, &s) == 0) {
399 if (stat(nm, &s) != 0)
401 if (mode == FILEXIST)
403 if (is_file_access(mode)) {
410 return test_eaccess(nm, i) == 0;
412 if (is_file_type(mode)) {
421 if (mode == FILFIFO) {
428 if (mode == FILSOCK) {
436 return ((s.st_mode & S_IFMT) == i);
438 if (is_file_bit(mode)) {
445 return ((s.st_mode & i) != 0);
448 return s.st_size > 0L;
450 return s.st_uid == geteuid();
452 return s.st_gid == getegid();
453 return 1; /* NOTREACHED */
456 static enum token t_lex(char *s)
458 const struct t_op *op;
467 if (strcmp(s, op->op_text) == 0) {
472 } while (op < ops + ARRAY_SIZE(ops));
477 /* atoi with error detection */
478 //XXX: FIXME: duplicate of existing libbb function?
479 static arith_t getn(const char *s)
482 #if ENABLE_FEATURE_TEST_64
489 #if ENABLE_FEATURE_TEST_64
490 r = strtoll(s, &p, 10);
492 r = strtol(s, &p, 10);
496 syntax(s, "out of range");
498 if (*(skip_whitespace(p)))
499 syntax(s, "bad number");
505 static int newerf(const char *f1, const char *f2)
509 return (stat(f1, &b1) == 0 &&
510 stat(f2, &b2) == 0 && b1.st_mtime > b2.st_mtime);
513 static int olderf(const char *f1, const char *f2)
517 return (stat(f1, &b1) == 0 &&
518 stat(f2, &b2) == 0 && b1.st_mtime < b2.st_mtime);
521 static int equalf(const char *f1, const char *f2)
525 return (stat(f1, &b1) == 0 &&
526 stat(f2, &b2) == 0 &&
527 b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino);
531 /* Do the same thing access(2) does, but use the effective uid and gid,
532 and don't make the mistake of telling root that any file is
534 static int test_eaccess(char *path, int mode)
537 unsigned int euid = geteuid();
539 if (stat(path, &st) < 0)
543 /* Root can read or write any file. */
547 /* Root can execute any file that has any one of the execute
549 if (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))
553 if (st.st_uid == euid) /* owner */
555 else if (is_a_group_member(st.st_gid))
558 if (st.st_mode & mode)
564 static void initialize_group_array(void)
566 ngroups = getgroups(0, NULL);
568 /* FIXME: ash tries so hard to not die on OOM,
569 * and we spoil it with just one xrealloc here */
570 /* We realloc, because test_main can be entered repeatedly by shell.
571 * Testcase (ash): 'while true; do test -x some_file; done'
572 * and watch top. (some_file must have owner != you) */
573 group_array = xrealloc(group_array, ngroups * sizeof(gid_t));
574 getgroups(ngroups, group_array);
578 /* Return non-zero if GID is one that we have in our groups list. */
579 //XXX: FIXME: duplicate of existing libbb function?
580 // see toplevel TODO file:
581 // possible code duplication ingroup() and is_a_group_member()
582 static int is_a_group_member(gid_t gid)
586 /* Short-circuit if possible, maybe saving a call to getgroups(). */
587 if (gid == getgid() || gid == getegid())
591 initialize_group_array();
593 /* Search through the list looking for GID. */
594 for (i = 0; i < ngroups; i++)
595 if (gid == group_array[i])