hush/coreutils/test.c

566 lines
11 KiB
C
Raw Normal View History

2000-03-16 08:09:57 +00:00
/* vi: set sw=4 ts=4: */
/*
* test implementation for busybox
2000-03-16 08:09:57 +00:00
*
* Copyright (c) by a whole pile of folks:
2000-03-16 08:09:57 +00:00
*
* test(1); version 7-like -- author Erik Baalbergen
* modified by Eric Gisin to be used as built-in.
* modified by Arnold Robbins to add SVR3 compatibility
* (-x -c -b -p -u -g -k) plus Korn's -L -nt -ot -ef and new -S (socket).
* modified by J.T. Conklin for NetBSD.
* modified by Herbert Xu to be used as built-in in ash.
* modified by Erik Andersen <andersen@codepoet.org> to be used
2000-03-16 08:09:57 +00:00
* in busybox.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Original copyright notice states:
* "This program is in the Public Domain."
*/
#include <sys/types.h>
#include <unistd.h>
#include <ctype.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include "busybox.h"
2000-03-16 08:09:57 +00:00
/* test(1) accepts the following grammar:
oexpr ::= aexpr | aexpr "-o" oexpr ;
aexpr ::= nexpr | nexpr "-a" aexpr ;
nexpr ::= primary | "!" primary
primary ::= unary-operator operand
| operand binary-operator operand
| operand
| "(" oexpr ")"
;
unary-operator ::= "-r"|"-w"|"-x"|"-f"|"-d"|"-c"|"-b"|"-p"|
"-u"|"-g"|"-k"|"-s"|"-t"|"-z"|"-n"|"-o"|"-O"|"-G"|"-L"|"-S";
binary-operator ::= "="|"=="|"!="|"-eq"|"-ne"|"-ge"|"-gt"|"-le"|"-lt"|
2000-03-16 08:09:57 +00:00
"-nt"|"-ot"|"-ef";
operand ::= <any legal UNIX file name>
*/
enum token {
EOI,
FILRD,
FILWR,
FILEX,
FILEXIST,
FILREG,
FILDIR,
FILCDEV,
FILBDEV,
FILFIFO,
FILSOCK,
FILSYM,
FILGZ,
FILTT,
FILSUID,
FILSGID,
FILSTCK,
FILNT,
FILOT,
FILEQ,
FILUID,
FILGID,
STREZ,
STRNZ,
STREQ,
STRNE,
STRLT,
STRGT,
INTEQ,
INTNE,
INTGE,
INTGT,
INTLE,
INTLT,
UNOT,
BAND,
BOR,
LPAREN,
RPAREN,
OPERAND
};
enum token_types {
UNOP,
BINOP,
BUNOP,
BBINOP,
PAREN
};
static const struct t_op {
2000-03-16 08:09:57 +00:00
const char *op_text;
short op_num, op_type;
2002-08-23 06:05:11 +00:00
} ops[] = {
{
"-r", FILRD, UNOP}, {
"-w", FILWR, UNOP}, {
"-x", FILEX, UNOP}, {
"-e", FILEXIST, UNOP}, {
"-f", FILREG, UNOP}, {
"-d", FILDIR, UNOP}, {
"-c", FILCDEV, UNOP}, {
"-b", FILBDEV, UNOP}, {
"-p", FILFIFO, UNOP}, {
"-u", FILSUID, UNOP}, {
"-g", FILSGID, UNOP}, {
"-k", FILSTCK, UNOP}, {
"-s", FILGZ, UNOP}, {
"-t", FILTT, UNOP}, {
"-z", STREZ, UNOP}, {
"-n", STRNZ, UNOP}, {
"-h", FILSYM, UNOP}, /* for backwards compat */
{
"-O", FILUID, UNOP}, {
"-G", FILGID, UNOP}, {
"-L", FILSYM, UNOP}, {
"-S", FILSOCK, UNOP}, {
"=", STREQ, BINOP}, {
"==", STREQ, BINOP}, {
2002-08-23 06:05:11 +00:00
"!=", STRNE, BINOP}, {
"<", STRLT, BINOP}, {
">", STRGT, BINOP}, {
"-eq", INTEQ, BINOP}, {
"-ne", INTNE, BINOP}, {
"-ge", INTGE, BINOP}, {
"-gt", INTGT, BINOP}, {
"-le", INTLE, BINOP}, {
"-lt", INTLT, BINOP}, {
"-nt", FILNT, BINOP}, {
"-ot", FILOT, BINOP}, {
"-ef", FILEQ, BINOP}, {
"!", UNOT, BUNOP}, {
"-a", BAND, BBINOP}, {
"-o", BOR, BBINOP}, {
"(", LPAREN, PAREN}, {
")", RPAREN, PAREN}, {
0, 0, 0}
2000-03-16 08:09:57 +00:00
};
#ifdef CONFIG_FEATURE_TEST_64
typedef int64_t arith_t;
#else
typedef int arith_t;
#endif
2000-12-30 07:46:23 +00:00
static char **t_wp;
static struct t_op const *t_wp_op;
2000-03-16 08:09:57 +00:00
static gid_t *group_array = NULL;
static int ngroups;
2002-08-23 06:05:11 +00:00
static enum token t_lex(char *s);
static arith_t oexpr(enum token n);
static arith_t aexpr(enum token n);
static arith_t nexpr(enum token n);
static int binop(void);
static arith_t primary(enum token n);
static int filstat(char *nm, enum token mode);
static arith_t getn(const char *s);
static int newerf(const char *f1, const char *f2);
static int olderf(const char *f1, const char *f2);
static int equalf(const char *f1, const char *f2);
static void syntax(const char *op, const char *msg);
static int test_eaccess(char *path, int mode);
static int is_a_group_member(gid_t gid);
static void initialize_group_array(void);
2000-03-16 08:09:57 +00:00
2002-08-23 06:05:11 +00:00
extern int test_main(int argc, char **argv)
2000-03-16 08:09:57 +00:00
{
2002-08-23 06:05:11 +00:00
int res;
2000-03-16 08:09:57 +00:00
2003-03-19 09:13:01 +00:00
if (strcmp(bb_applet_name, "[") == 0) {
2000-03-16 08:09:57 +00:00
if (strcmp(argv[--argc], "]"))
2003-03-19 09:13:01 +00:00
bb_error_msg_and_die("missing ]");
2000-03-16 08:09:57 +00:00
argv[argc] = NULL;
}
if (strcmp(bb_applet_name, "[[") == 0) {
if (strcmp(argv[--argc], "]]"))
bb_error_msg_and_die("missing ]]");
argv[argc] = NULL;
}
2000-03-16 08:09:57 +00:00
/* Implement special cases from POSIX.2, section 4.62.4 */
switch (argc) {
case 1:
2002-08-23 06:05:11 +00:00
exit(1);
2000-03-16 08:09:57 +00:00
case 2:
2002-08-23 06:05:11 +00:00
exit(*argv[1] == '\0');
2000-03-16 08:09:57 +00:00
case 3:
if (argv[1][0] == '!' && argv[1][1] == '\0') {
2002-08-23 06:05:11 +00:00
exit(!(*argv[2] == '\0'));
2000-03-16 08:09:57 +00:00
}
break;
case 4:
if (argv[1][0] != '!' || argv[1][1] != '\0') {
2002-08-23 06:05:11 +00:00
if (t_lex(argv[2]), t_wp_op && t_wp_op->op_type == BINOP) {
2000-03-16 08:09:57 +00:00
t_wp = &argv[1];
2002-08-23 06:05:11 +00:00
exit(binop() == 0);
2000-03-16 08:09:57 +00:00
}
}
break;
case 5:
if (argv[1][0] == '!' && argv[1][1] == '\0') {
2002-08-23 06:05:11 +00:00
if (t_lex(argv[3]), t_wp_op && t_wp_op->op_type == BINOP) {
2000-03-16 08:09:57 +00:00
t_wp = &argv[2];
2002-08-23 06:05:11 +00:00
exit(!(binop() == 0));
2000-03-16 08:09:57 +00:00
}
}
break;
}
t_wp = &argv[1];
res = !oexpr(t_lex(*t_wp));
if (*t_wp != NULL && *++t_wp != NULL)
syntax(*t_wp, "unknown operand");
2002-08-23 06:05:11 +00:00
return (res);
2000-03-16 08:09:57 +00:00
}
2002-08-23 06:05:11 +00:00
static void syntax(const char *op, const char *msg)
2000-03-16 08:09:57 +00:00
{
2002-08-23 06:05:11 +00:00
if (op && *op) {
2003-03-19 09:13:01 +00:00
bb_error_msg_and_die("%s: %s", op, msg);
2002-08-23 06:05:11 +00:00
} else {
2003-03-19 09:13:01 +00:00
bb_error_msg_and_die("%s", msg);
2002-08-23 06:05:11 +00:00
}
2000-03-16 08:09:57 +00:00
}
static arith_t oexpr(enum token n)
2000-03-16 08:09:57 +00:00
{
arith_t res;
2000-03-16 08:09:57 +00:00
res = aexpr(n);
2002-08-23 06:05:11 +00:00
if (t_lex(*++t_wp) == BOR) {
2000-03-16 08:09:57 +00:00
return oexpr(t_lex(*++t_wp)) || res;
2002-08-23 06:05:11 +00:00
}
2000-03-16 08:09:57 +00:00
t_wp--;
return res;
}
static arith_t aexpr(enum token n)
2000-03-16 08:09:57 +00:00
{
arith_t res;
2000-03-16 08:09:57 +00:00
res = nexpr(n);
if (t_lex(*++t_wp) == BAND)
return aexpr(t_lex(*++t_wp)) && res;
t_wp--;
return res;
}
static arith_t nexpr(enum token n)
2000-03-16 08:09:57 +00:00
{
if (n == UNOT)
return !nexpr(t_lex(*++t_wp));
return primary(n);
}
static arith_t primary(enum token n)
2000-03-16 08:09:57 +00:00
{
arith_t res;
2000-03-16 08:09:57 +00:00
2002-08-23 06:05:11 +00:00
if (n == EOI) {
2000-03-16 08:09:57 +00:00
syntax(NULL, "argument expected");
2002-08-23 06:05:11 +00:00
}
2000-03-16 08:09:57 +00:00
if (n == LPAREN) {
res = oexpr(t_lex(*++t_wp));
if (t_lex(*++t_wp) != RPAREN)
syntax(NULL, "closing paren expected");
return res;
}
if (t_wp_op && t_wp_op->op_type == UNOP) {
/* unary expression */
if (*++t_wp == NULL)
syntax(t_wp_op->op_text, "argument expected");
switch (n) {
case STREZ:
return strlen(*t_wp) == 0;
case STRNZ:
return strlen(*t_wp) != 0;
case FILTT:
return isatty(getn(*t_wp));
default:
return filstat(*t_wp, n);
}
}
if (t_lex(t_wp[1]), t_wp_op && t_wp_op->op_type == BINOP) {
return binop();
2002-08-23 06:05:11 +00:00
}
2000-03-16 08:09:57 +00:00
return strlen(*t_wp) > 0;
}
static int binop(void)
2000-03-16 08:09:57 +00:00
{
const char *opnd1, *opnd2;
struct t_op const *op;
opnd1 = *t_wp;
(void) t_lex(*++t_wp);
op = t_wp_op;
2002-08-23 06:05:11 +00:00
if ((opnd2 = *++t_wp) == (char *) 0)
2000-03-16 08:09:57 +00:00
syntax(op->op_text, "argument expected");
2002-08-23 06:05:11 +00:00
2000-03-16 08:09:57 +00:00
switch (op->op_num) {
case STREQ:
return strcmp(opnd1, opnd2) == 0;
case STRNE:
return strcmp(opnd1, opnd2) != 0;
case STRLT:
return strcmp(opnd1, opnd2) < 0;
case STRGT:
return strcmp(opnd1, opnd2) > 0;
case INTEQ:
return getn(opnd1) == getn(opnd2);
case INTNE:
return getn(opnd1) != getn(opnd2);
case INTGE:
return getn(opnd1) >= getn(opnd2);
case INTGT:
return getn(opnd1) > getn(opnd2);
case INTLE:
return getn(opnd1) <= getn(opnd2);
case INTLT:
return getn(opnd1) < getn(opnd2);
case FILNT:
2002-08-23 06:05:11 +00:00
return newerf(opnd1, opnd2);
2000-03-16 08:09:57 +00:00
case FILOT:
2002-08-23 06:05:11 +00:00
return olderf(opnd1, opnd2);
2000-03-16 08:09:57 +00:00
case FILEQ:
2002-08-23 06:05:11 +00:00
return equalf(opnd1, opnd2);
2000-03-16 08:09:57 +00:00
}
/* NOTREACHED */
return 1;
}
2002-08-23 06:05:11 +00:00
static int filstat(char *nm, enum token mode)
2000-03-16 08:09:57 +00:00
{
struct stat s;
2000-07-14 06:49:52 +00:00
unsigned int i;
2000-03-16 08:09:57 +00:00
if (mode == FILSYM) {
#ifdef S_IFLNK
if (lstat(nm, &s) == 0) {
i = S_IFLNK;
goto filetype;
}
#endif
return 0;
}
2002-08-23 06:05:11 +00:00
if (stat(nm, &s) != 0)
2000-03-16 08:09:57 +00:00
return 0;
switch (mode) {
case FILRD:
return test_eaccess(nm, R_OK) == 0;
case FILWR:
return test_eaccess(nm, W_OK) == 0;
case FILEX:
return test_eaccess(nm, X_OK) == 0;
case FILEXIST:
return 1;
case FILREG:
i = S_IFREG;
goto filetype;
case FILDIR:
i = S_IFDIR;
goto filetype;
case FILCDEV:
i = S_IFCHR;
goto filetype;
case FILBDEV:
i = S_IFBLK;
goto filetype;
case FILFIFO:
#ifdef S_IFIFO
i = S_IFIFO;
goto filetype;
#else
return 0;
#endif
case FILSOCK:
#ifdef S_IFSOCK
i = S_IFSOCK;
goto filetype;
#else
return 0;
#endif
case FILSUID:
i = S_ISUID;
goto filebit;
case FILSGID:
i = S_ISGID;
goto filebit;
case FILSTCK:
i = S_ISVTX;
goto filebit;
case FILGZ:
return s.st_size > 0L;
case FILUID:
return s.st_uid == geteuid();
case FILGID:
return s.st_gid == getegid();
default:
return 1;
}
2002-08-23 06:05:11 +00:00
filetype:
2000-03-16 08:09:57 +00:00
return ((s.st_mode & S_IFMT) == i);
2002-08-23 06:05:11 +00:00
filebit:
2000-03-16 08:09:57 +00:00
return ((s.st_mode & i) != 0);
}
2002-08-23 06:05:11 +00:00
static enum token t_lex(char *s)
2000-03-16 08:09:57 +00:00
{
struct t_op const *op = ops;
if (s == 0) {
2002-08-23 06:05:11 +00:00
t_wp_op = (struct t_op *) 0;
2000-03-16 08:09:57 +00:00
return EOI;
}
while (op->op_text) {
if (strcmp(s, op->op_text) == 0) {
t_wp_op = op;
return op->op_num;
}
op++;
}
2002-08-23 06:05:11 +00:00
t_wp_op = (struct t_op *) 0;
2000-03-16 08:09:57 +00:00
return OPERAND;
}
/* atoi with error detection */
static arith_t getn(const char *s)
2000-03-16 08:09:57 +00:00
{
char *p;
#ifdef CONFIG_FEATURE_TEST_64
long long r;
#else
2000-03-16 08:09:57 +00:00
long r;
#endif
2000-03-16 08:09:57 +00:00
errno = 0;
#ifdef CONFIG_FEATURE_TEST_64
r = strtoll(s, &p, 10);
#else
2000-03-16 08:09:57 +00:00
r = strtol(s, &p, 10);
#endif
2000-03-16 08:09:57 +00:00
if (errno != 0)
2003-03-19 09:13:01 +00:00
bb_error_msg_and_die("%s: out of range", s);
2000-03-16 08:09:57 +00:00
/* p = bb_skip_whitespace(p); avoid const warning */
if (*(bb_skip_whitespace(p)))
2003-03-19 09:13:01 +00:00
bb_error_msg_and_die("%s: bad number", s);
2000-03-16 08:09:57 +00:00
return r;
2000-03-16 08:09:57 +00:00
}
2002-08-23 06:05:11 +00:00
static int newerf(const char *f1, const char *f2)
2000-03-16 08:09:57 +00:00
{
struct stat b1, b2;
2002-08-23 06:05:11 +00:00
return (stat(f1, &b1) == 0 &&
stat(f2, &b2) == 0 && b1.st_mtime > b2.st_mtime);
2000-03-16 08:09:57 +00:00
}
2002-08-23 06:05:11 +00:00
static int olderf(const char *f1, const char *f2)
2000-03-16 08:09:57 +00:00
{
struct stat b1, b2;
2002-08-23 06:05:11 +00:00
return (stat(f1, &b1) == 0 &&
stat(f2, &b2) == 0 && b1.st_mtime < b2.st_mtime);
2000-03-16 08:09:57 +00:00
}
2002-08-23 06:05:11 +00:00
static int equalf(const char *f1, const char *f2)
2000-03-16 08:09:57 +00:00
{
struct stat b1, b2;
2002-08-23 06:05:11 +00:00
return (stat(f1, &b1) == 0 &&
stat(f2, &b2) == 0 &&
b1.st_dev == b2.st_dev && b1.st_ino == b2.st_ino);
2000-03-16 08:09:57 +00:00
}
/* Do the same thing access(2) does, but use the effective uid and gid,
and don't make the mistake of telling root that any file is
executable. */
2002-08-23 06:05:11 +00:00
static int test_eaccess(char *path, int mode)
2000-03-16 08:09:57 +00:00
{
struct stat st;
2000-07-14 06:49:52 +00:00
unsigned int euid = geteuid();
2000-03-16 08:09:57 +00:00
2002-08-23 06:05:11 +00:00
if (stat(path, &st) < 0)
2000-03-16 08:09:57 +00:00
return (-1);
if (euid == 0) {
/* Root can read or write any file. */
if (mode != X_OK)
2002-08-23 06:05:11 +00:00
return (0);
2000-03-16 08:09:57 +00:00
/* Root can execute any file that has any one of the execute
bits set. */
if (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))
return (0);
}
2002-08-23 06:05:11 +00:00
if (st.st_uid == euid) /* owner */
2000-03-16 08:09:57 +00:00
mode <<= 6;
2002-08-23 06:05:11 +00:00
else if (is_a_group_member(st.st_gid))
2000-03-16 08:09:57 +00:00
mode <<= 3;
if (st.st_mode & mode)
return (0);
return (-1);
}
static void initialize_group_array(void)
2000-03-16 08:09:57 +00:00
{
ngroups = getgroups(0, NULL);
group_array = xrealloc(group_array, ngroups * sizeof(gid_t));
2000-03-16 08:09:57 +00:00
getgroups(ngroups, group_array);
}
/* Return non-zero if GID is one that we have in our groups list. */
2002-08-23 06:05:11 +00:00
static int is_a_group_member(gid_t gid)
2000-03-16 08:09:57 +00:00
{
register int i;
/* Short-circuit if possible, maybe saving a call to getgroups(). */
if (gid == getgid() || gid == getegid())
return (1);
if (ngroups == 0)
2002-08-23 06:05:11 +00:00
initialize_group_array();
2000-03-16 08:09:57 +00:00
/* Search through the list looking for GID. */
for (i = 0; i < ngroups; i++)
if (gid == group_array[i])
return (1);
return (0);
}