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 struct t_op const *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 = strrchr(argv[0], '/');
188 if (!arg0++) arg0 = argv[0];
189 if (arg0[0] == '[') {
191 if (!arg0[1]) { /* "[" ? */
192 if (NOT_LONE_CHAR(argv[argc], ']')) {
193 bb_error_msg("missing ]");
196 } else { /* assuming "[[" */
197 if (strcmp(argv[argc], "]]") != 0) {
198 bb_error_msg("missing ]]");
205 res = setjmp(leaving);
209 /* resetting ngroups is probably unnecessary. it will
210 * force a new call to getgroups(), which prevents using
211 * group data fetched during a previous call. but the
212 * only way the group data could be stale is if there's
213 * been an intervening call to setgroups(), and this
214 * isn't likely in the case of a shell. paranoia
219 /* Implement special cases from POSIX.2, section 4.62.4 */
223 return *argv[1] == '\0';
225 /* remember if we saw argc==4 which wants *no* '!' test */
228 (LONE_CHAR(argv[1], '!'))
229 : (argv[1][0] != '!' || argv[1][1] != '\0'))
232 return *argv[2] != '\0';
234 t_lex(argv[2 + _off]);
235 if (t_wp_op && t_wp_op->op_type == BINOP) {
236 t_wp = &argv[1 + _off];
237 return binop() == _off;
241 res = !oexpr(t_lex(*t_wp));
243 if (*t_wp != NULL && *++t_wp != NULL) {
244 bb_error_msg("%s: unknown operand", *t_wp);
250 static void syntax(const char *op, const char *msg) ATTRIBUTE_NORETURN;
251 static void syntax(const char *op, const char *msg)
254 bb_error_msg("%s: %s", op, msg);
256 bb_error_msg("%s: %s"+4, msg);
261 static arith_t oexpr(enum token n)
266 if (t_lex(*++t_wp) == BOR) {
267 return oexpr(t_lex(*++t_wp)) || res;
273 static arith_t aexpr(enum token n)
278 if (t_lex(*++t_wp) == BAND)
279 return aexpr(t_lex(*++t_wp)) && res;
284 static arith_t nexpr(enum token n)
287 return !nexpr(t_lex(*++t_wp));
291 static arith_t primary(enum token n)
296 syntax(NULL, "argument expected");
299 res = oexpr(t_lex(*++t_wp));
300 if (t_lex(*++t_wp) != RPAREN)
301 syntax(NULL, "closing paren expected");
304 if (t_wp_op && t_wp_op->op_type == UNOP) {
305 /* unary expression */
307 syntax(t_wp_op->op_text, "argument expected");
309 return t_wp[0][0] == '\0';
311 return t_wp[0][0] != '\0';
313 return isatty(getn(*t_wp));
314 return filstat(*t_wp, n);
318 if (t_wp_op && t_wp_op->op_type == BINOP) {
322 return t_wp[0][0] != '\0';
325 static int binop(void)
327 const char *opnd1, *opnd2;
328 struct t_op const *op;
332 (void) t_lex(*++t_wp);
337 syntax(op->op_text, "argument expected");
339 if (is_int_op(op->op_num)) {
342 if (op->op_num == INTEQ)
344 if (op->op_num == INTNE)
346 if (op->op_num == INTGE)
348 if (op->op_num == INTGT)
350 if (op->op_num == INTLE)
352 if (op->op_num == INTLT)
355 if (is_str_op(op->op_num)) {
356 val1 = strcmp(opnd1, opnd2);
357 if (op->op_num == STREQ)
359 if (op->op_num == STRNE)
361 if (op->op_num == STRLT)
363 if (op->op_num == STRGT)
366 /* We are sure that these three are by now the only binops we didn't check
367 * yet, so we do not check if the class is correct:
369 /* if (is_file_op(op->op_num)) */
373 if (stat(opnd1, &b1) || stat(opnd2, &b2))
374 return 0; /* false, since at least one stat failed */
375 if (op->op_num == FILNT)
376 return b1.st_mtime > b2.st_mtime;
377 if (op->op_num == FILOT)
378 return b1.st_mtime < b2.st_mtime;
379 if (op->op_num == FILEQ)
380 return b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino;
382 return 1; /* NOTREACHED */
385 static int filstat(char *nm, enum token mode)
388 int i = i; /* gcc 3.x thinks it can be used uninitialized */
390 if (mode == FILSYM) {
392 if (lstat(nm, &s) == 0) {
400 if (stat(nm, &s) != 0)
402 if (mode == FILEXIST)
404 if (is_file_access(mode)) {
411 return test_eaccess(nm, i) == 0;
413 if (is_file_type(mode)) {
422 if (mode == FILFIFO) {
429 if (mode == FILSOCK) {
437 return ((s.st_mode & S_IFMT) == i);
439 if (is_file_bit(mode)) {
446 return ((s.st_mode & i) != 0);
449 return s.st_size > 0L;
451 return s.st_uid == geteuid();
453 return s.st_gid == getegid();
454 return 1; /* NOTREACHED */
457 static enum token t_lex(char *s)
459 const struct t_op *op;
468 if (strcmp(s, op->op_text) == 0) {
473 } while (op < ops + ARRAY_SIZE(ops));
478 /* atoi with error detection */
479 //XXX: FIXME: duplicate of existing libbb function?
480 static arith_t getn(const char *s)
483 #if ENABLE_FEATURE_TEST_64
490 #if ENABLE_FEATURE_TEST_64
491 r = strtoll(s, &p, 10);
493 r = strtol(s, &p, 10);
497 syntax(s, "out of range");
499 if (*(skip_whitespace(p)))
500 syntax(s, "bad number");
506 static int newerf(const char *f1, const char *f2)
510 return (stat(f1, &b1) == 0 &&
511 stat(f2, &b2) == 0 && b1.st_mtime > b2.st_mtime);
514 static int olderf(const char *f1, const char *f2)
518 return (stat(f1, &b1) == 0 &&
519 stat(f2, &b2) == 0 && b1.st_mtime < b2.st_mtime);
522 static int equalf(const char *f1, const char *f2)
526 return (stat(f1, &b1) == 0 &&
527 stat(f2, &b2) == 0 &&
528 b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino);
532 /* Do the same thing access(2) does, but use the effective uid and gid,
533 and don't make the mistake of telling root that any file is
535 static int test_eaccess(char *path, int mode)
538 unsigned int euid = geteuid();
540 if (stat(path, &st) < 0)
544 /* Root can read or write any file. */
548 /* Root can execute any file that has any one of the execute
550 if (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))
554 if (st.st_uid == euid) /* owner */
556 else if (is_a_group_member(st.st_gid))
559 if (st.st_mode & mode)
565 static void initialize_group_array(void)
567 ngroups = getgroups(0, NULL);
569 /* FIXME: ash tries so hard to not die on OOM,
570 * and we spoil it with just one xrealloc here */
571 /* We realloc, because test_main can be entered repeatedly by shell.
572 * Testcase (ash): 'while true; do test -x some_file; done'
573 * and watch top. (some_file must have owner != you) */
574 group_array = xrealloc(group_array, ngroups * sizeof(gid_t));
575 getgroups(ngroups, group_array);
579 /* Return non-zero if GID is one that we have in our groups list. */
580 //XXX: FIXME: duplicate of existing libbb function?
581 // see toplevel TODO file:
582 // possible code duplication ingroup() and is_a_group_member()
583 static int is_a_group_member(gid_t gid)
587 /* Short-circuit if possible, maybe saving a call to getgroups(). */
588 if (gid == getgid() || gid == getegid())
592 initialize_group_array();
594 /* Search through the list looking for GID. */
595 for (i = 0; i < ngroups; i++)
596 if (gid == group_array[i])