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
16 * This program is free software; you can redistribute it and/or modify
17 * it under the terms of the GNU General Public License as published by
18 * the Free Software Foundation; either version 2 of the License, or
19 * (at your option) any later version.
21 * This program is distributed in the hope that it will be useful,
22 * but WITHOUT ANY WARRANTY; without even the implied warranty of
23 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
24 * General Public License for more details.
26 * You should have received a copy of the GNU General Public License
27 * along with this program; if not, write to the Free Software
28 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
30 * Original copyright notice states:
31 * "This program is in the Public Domain."
34 #include <sys/types.h>
42 /* test(1) accepts the following grammar:
43 oexpr ::= aexpr | aexpr "-o" oexpr ;
44 aexpr ::= nexpr | nexpr "-a" aexpr ;
45 nexpr ::= primary | "!" primary
46 primary ::= unary-operator operand
47 | operand binary-operator operand
51 unary-operator ::= "-r"|"-w"|"-x"|"-f"|"-d"|"-c"|"-b"|"-p"|
52 "-u"|"-g"|"-k"|"-s"|"-t"|"-z"|"-n"|"-o"|"-O"|"-G"|"-L"|"-S";
54 binary-operator ::= "="|"=="|"!="|"-eq"|"-ne"|"-ge"|"-gt"|"-le"|"-lt"|
56 operand ::= <any legal UNIX file name>
110 static const struct t_op {
112 short op_num, op_type;
115 "-r", FILRD, UNOP}, {
116 "-w", FILWR, UNOP}, {
117 "-x", FILEX, UNOP}, {
118 "-e", FILEXIST, UNOP}, {
119 "-f", FILREG, UNOP}, {
120 "-d", FILDIR, UNOP}, {
121 "-c", FILCDEV, UNOP}, {
122 "-b", FILBDEV, UNOP}, {
123 "-p", FILFIFO, UNOP}, {
124 "-u", FILSUID, UNOP}, {
125 "-g", FILSGID, UNOP}, {
126 "-k", FILSTCK, UNOP}, {
127 "-s", FILGZ, UNOP}, {
128 "-t", FILTT, UNOP}, {
129 "-z", STREZ, UNOP}, {
130 "-n", STRNZ, UNOP}, {
131 "-h", FILSYM, UNOP}, /* for backwards compat */
133 "-O", FILUID, UNOP}, {
134 "-G", FILGID, UNOP}, {
135 "-L", FILSYM, UNOP}, {
136 "-S", FILSOCK, UNOP}, {
137 "=", STREQ, BINOP}, {
138 "==", STREQ, BINOP}, {
139 "!=", STRNE, BINOP}, {
140 "<", STRLT, BINOP}, {
141 ">", STRGT, BINOP}, {
142 "-eq", INTEQ, BINOP}, {
143 "-ne", INTNE, BINOP}, {
144 "-ge", INTGE, BINOP}, {
145 "-gt", INTGT, BINOP}, {
146 "-le", INTLE, BINOP}, {
147 "-lt", INTLT, BINOP}, {
148 "-nt", FILNT, BINOP}, {
149 "-ot", FILOT, BINOP}, {
150 "-ef", FILEQ, BINOP}, {
152 "-a", BAND, BBINOP}, {
153 "-o", BOR, BBINOP}, {
154 "(", LPAREN, PAREN}, {
155 ")", RPAREN, PAREN}, {
159 #ifdef CONFIG_FEATURE_TEST_64
160 typedef int64_t arith_t;
166 static struct t_op const *t_wp_op;
167 static gid_t *group_array = NULL;
170 static enum token t_lex(char *s);
171 static arith_t oexpr(enum token n);
172 static arith_t aexpr(enum token n);
173 static arith_t nexpr(enum token n);
174 static int binop(void);
175 static arith_t primary(enum token n);
176 static int filstat(char *nm, enum token mode);
177 static arith_t getn(const char *s);
178 static int newerf(const char *f1, const char *f2);
179 static int olderf(const char *f1, const char *f2);
180 static int equalf(const char *f1, const char *f2);
181 static int test_eaccess(char *path, int mode);
182 static int is_a_group_member(gid_t gid);
183 static void initialize_group_array(void);
185 int test_main(int argc, char **argv)
189 if (strcmp(bb_applet_name, "[") == 0) {
190 if (strcmp(argv[--argc], "]"))
191 bb_error_msg_and_die("missing ]");
194 if (strcmp(bb_applet_name, "[[") == 0) {
195 if (strcmp(argv[--argc], "]]"))
196 bb_error_msg_and_die("missing ]]");
199 /* Implement special cases from POSIX.2, section 4.62.4 */
204 exit(*argv[1] == '\0');
206 if (argv[1][0] == '!' && argv[1][1] == '\0') {
207 exit(!(*argv[2] == '\0'));
211 if (argv[1][0] != '!' || argv[1][1] != '\0') {
212 if (t_lex(argv[2]), t_wp_op && t_wp_op->op_type == BINOP) {
219 if (argv[1][0] == '!' && argv[1][1] == '\0') {
220 if (t_lex(argv[3]), t_wp_op && t_wp_op->op_type == BINOP) {
222 exit(!(binop() == 0));
229 res = !oexpr(t_lex(*t_wp));
231 if (*t_wp != NULL && *++t_wp != NULL)
232 bb_error_msg_and_die("%s: unknown operand", *t_wp);
237 static arith_t oexpr(enum token n)
242 if (t_lex(*++t_wp) == BOR) {
243 return oexpr(t_lex(*++t_wp)) || res;
249 static arith_t aexpr(enum token n)
254 if (t_lex(*++t_wp) == BAND)
255 return aexpr(t_lex(*++t_wp)) && res;
260 static arith_t nexpr(enum token n)
263 return !nexpr(t_lex(*++t_wp));
267 static arith_t primary(enum token n)
272 bb_error_msg_and_die("argument expected");
275 res = oexpr(t_lex(*++t_wp));
276 if (t_lex(*++t_wp) != RPAREN)
277 bb_error_msg_and_die("closing paren expected");
280 if (t_wp_op && t_wp_op->op_type == UNOP) {
281 /* unary expression */
283 bb_error_msg_and_die(bb_msg_requires_arg, t_wp_op->op_text);
286 return strlen(*t_wp) == 0;
288 return strlen(*t_wp) != 0;
290 return isatty(getn(*t_wp));
292 return filstat(*t_wp, n);
296 if (t_lex(t_wp[1]), t_wp_op && t_wp_op->op_type == BINOP) {
300 return strlen(*t_wp) > 0;
303 static int binop(void)
305 const char *opnd1, *opnd2;
306 struct t_op const *op;
309 (void) t_lex(*++t_wp);
312 if ((opnd2 = *++t_wp) == (char *) 0)
313 bb_error_msg_and_die(bb_msg_requires_arg, op->op_text);
315 switch (op->op_num) {
317 return strcmp(opnd1, opnd2) == 0;
319 return strcmp(opnd1, opnd2) != 0;
321 return strcmp(opnd1, opnd2) < 0;
323 return strcmp(opnd1, opnd2) > 0;
325 return getn(opnd1) == getn(opnd2);
327 return getn(opnd1) != getn(opnd2);
329 return getn(opnd1) >= getn(opnd2);
331 return getn(opnd1) > getn(opnd2);
333 return getn(opnd1) <= getn(opnd2);
335 return getn(opnd1) < getn(opnd2);
337 return newerf(opnd1, opnd2);
339 return olderf(opnd1, opnd2);
341 return equalf(opnd1, opnd2);
347 static int filstat(char *nm, enum token mode)
352 if (mode == FILSYM) {
354 if (lstat(nm, &s) == 0) {
362 if (stat(nm, &s) != 0)
367 return test_eaccess(nm, R_OK) == 0;
369 return test_eaccess(nm, W_OK) == 0;
371 return test_eaccess(nm, X_OK) == 0;
410 return s.st_size > 0L;
412 return s.st_uid == geteuid();
414 return s.st_gid == getegid();
420 return ((s.st_mode & S_IFMT) == i);
423 return ((s.st_mode & i) != 0);
426 static enum token t_lex(char *s)
428 struct t_op const *op = ops;
431 t_wp_op = (struct t_op *) 0;
434 while (op->op_text) {
435 if (strcmp(s, op->op_text) == 0) {
441 t_wp_op = (struct t_op *) 0;
445 /* atoi with error detection */
446 static arith_t getn(const char *s)
449 #ifdef CONFIG_FEATURE_TEST_64
456 #ifdef CONFIG_FEATURE_TEST_64
457 r = strtoll(s, &p, 10);
459 r = strtol(s, &p, 10);
463 bb_error_msg_and_die("%s: out of range", s);
465 /* p = bb_skip_whitespace(p); avoid const warning */
466 if (*(bb_skip_whitespace(p)))
467 bb_error_msg_and_die("%s: bad number", s);
472 static int newerf(const char *f1, const char *f2)
476 return (stat(f1, &b1) == 0 &&
477 stat(f2, &b2) == 0 && b1.st_mtime > b2.st_mtime);
480 static int olderf(const char *f1, const char *f2)
484 return (stat(f1, &b1) == 0 &&
485 stat(f2, &b2) == 0 && b1.st_mtime < b2.st_mtime);
488 static int equalf(const char *f1, const char *f2)
492 return (stat(f1, &b1) == 0 &&
493 stat(f2, &b2) == 0 &&
494 b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino);
497 /* Do the same thing access(2) does, but use the effective uid and gid,
498 and don't make the mistake of telling root that any file is
500 static int test_eaccess(char *path, int mode)
503 unsigned int euid = geteuid();
505 if (stat(path, &st) < 0)
509 /* Root can read or write any file. */
513 /* Root can execute any file that has any one of the execute
515 if (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))
519 if (st.st_uid == euid) /* owner */
521 else if (is_a_group_member(st.st_gid))
524 if (st.st_mode & mode)
530 static void initialize_group_array(void)
532 ngroups = getgroups(0, NULL);
533 group_array = xrealloc(group_array, ngroups * sizeof(gid_t));
534 getgroups(ngroups, group_array);
537 /* Return non-zero if GID is one that we have in our groups list. */
538 static int is_a_group_member(gid_t gid)
542 /* Short-circuit if possible, maybe saving a call to getgroups(). */
543 if (gid == getgid() || gid == getegid())
547 initialize_group_array();
549 /* Search through the list looking for GID. */
550 for (i = 0; i < ngroups; i++)
551 if (gid == group_array[i])