⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 test.c

📁 klibc精简化的c程序库
💻 C
字号:
/* * 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. * * This program is in the Public Domain. */#include <sys/stat.h>#include <sys/types.h>#include <ctype.h>#include <errno.h>#include <stdlib.h>#include <string.h>#include <unistd.h>#include <stdarg.h>#include "bltin.h"/* 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"|			"-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 struct t_op {	const char *op_text;	short op_num, op_type;} const 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},	{"!=",	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}};static char **t_wp;static struct t_op const *t_wp_op;static void syntax(const char *, const char *);static int oexpr(enum token);static int aexpr(enum token);static int nexpr(enum token);static int primary(enum token);static int binop(void);static int filstat(char *, enum token);static enum token t_lex(char *);static int isoperand(void);static int getn(const char *);static int newerf(const char *, const char *);static int olderf(const char *, const char *);static int equalf(const char *, const char *);static int test_st_mode(const struct stat64 *, int);static int bash_group_member(gid_t);inttestcmd(int argc, char **argv){	int res;	if (strcmp(argv[0], "[") == 0) {		if (strcmp(argv[--argc], "]"))			error("missing ]");		argv[argc] = NULL;	}	if (argc < 2)		return 1;	t_wp = &argv[1];	res = !oexpr(t_lex(*t_wp));	if (*t_wp != NULL && *++t_wp != NULL)		syntax(*t_wp, "unexpected operator");	return res;}static voidsyntax(const char *op, const char *msg){	if (op && *op)		error("%s: %s", op, msg);	else		error("%s", msg);}static intoexpr(enum token n){	int res;	res = aexpr(n);	if (t_lex(*++t_wp) == BOR)		return oexpr(t_lex(*++t_wp)) || res;	t_wp--;	return res;}static intaexpr(enum token n){	int res;	res = nexpr(n);	if (t_lex(*++t_wp) == BAND)		return aexpr(t_lex(*++t_wp)) && res;	t_wp--;	return res;}static intnexpr(enum token n){	if (n == UNOT)		return !nexpr(t_lex(*++t_wp));	return primary(n);}static intprimary(enum token n){	enum token nn;	int res;	if (n == EOI)		return 0;		/* missing expression */	if (n == LPAREN) {		if ((nn = t_lex(*++t_wp)) == RPAREN)			return 0;	/* missing expression */		res = oexpr(nn);		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();	}	return strlen(*t_wp) > 0;}static intbinop(void){	const char *opnd1, *opnd2;	struct t_op const *op;	opnd1 = *t_wp;	(void) t_lex(*++t_wp);	op = t_wp_op;	if ((opnd2 = *++t_wp) == (char *)0)		syntax(op->op_text, "argument expected");	switch (op->op_num) {	default:#ifdef DEBUG		abort();		/* NOTREACHED */#endif	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:		return newerf (opnd1, opnd2);	case FILOT:		return olderf (opnd1, opnd2);	case FILEQ:		return equalf (opnd1, opnd2);	}}static intfilstat(char *nm, enum token mode){	struct stat64 s;	if (mode == FILSYM ? lstat64(nm, &s) : stat64(nm, &s))		return 0;	switch (mode) {	case FILRD:		return test_st_mode(&s, R_OK);	case FILWR:		return test_st_mode(&s, W_OK);	case FILEX:		return test_st_mode(&s, X_OK);	case FILEXIST:		return 1;	case FILREG:		return S_ISREG(s.st_mode);	case FILDIR:		return S_ISDIR(s.st_mode);	case FILCDEV:		return S_ISCHR(s.st_mode);	case FILBDEV:		return S_ISBLK(s.st_mode);	case FILFIFO:		return S_ISFIFO(s.st_mode);	case FILSOCK:		return S_ISSOCK(s.st_mode);	case FILSYM:		return S_ISLNK(s.st_mode);	case FILSUID:		return (s.st_mode & S_ISUID) != 0;	case FILSGID:		return (s.st_mode & S_ISGID) != 0;	case FILSTCK:		return (s.st_mode & S_ISVTX) != 0;	case FILGZ:		return !!s.st_size;	case FILUID:		return s.st_uid == geteuid();	case FILGID:		return s.st_gid == getegid();	default:		return 1;	}}static enum tokent_lex(char *s){	struct t_op const *op;	op = ops;	if (s == 0) {		t_wp_op = (struct t_op *)0;		return EOI;	}	while (op->op_text) {		if (strcmp(s, op->op_text) == 0) {			if ((op->op_type == UNOP && isoperand()) ||			    (op->op_num == LPAREN && *(t_wp+1) == 0))				break;			t_wp_op = op;			return op->op_num;		}		op++;	}	t_wp_op = (struct t_op *)0;	return OPERAND;}static intisoperand(void){	struct t_op const *op;	char *s, *t;	op = ops;	if ((s  = *(t_wp+1)) == 0)		return 1;	if ((t = *(t_wp+2)) == 0)		return 0;	while (op->op_text) {		if (strcmp(s, op->op_text) == 0)	    		return op->op_type == BINOP &&	    		    (t[0] != ')' || t[1] != '\0');		op++;	}	return 0;}/* atoi with error detection */static intgetn(const char *s){	char *p;	long r;	errno = 0;	r = strtol(s, &p, 10);	if (errno != 0)	      error("%s: out of range", s);	while (isspace((unsigned char)*p))	      p++;	if (*p)	      error("%s: bad number", s);	return (int) r;}static intnewerf (const char *f1, const char *f2){	struct stat b1, b2;	return (stat (f1, &b1) == 0 &&		stat (f2, &b2) == 0 &&		b1.st_mtime > b2.st_mtime);}static intolderf (const char *f1, const char *f2){	struct stat b1, b2;	return (stat (f1, &b1) == 0 &&		stat (f2, &b2) == 0 &&		b1.st_mtime < b2.st_mtime);}static intequalf (const char *f1, const char *f2){	struct stat b1, b2;	return (stat (f1, &b1) == 0 &&		stat (f2, &b2) == 0 &&		b1.st_dev == b2.st_dev &&		b1.st_ino == b2.st_ino);}/* * Similar to what access(2) does, but uses the effective uid and gid. * Doesn't make the mistake of telling root that any file is executable. * Returns non-zero if the file is accessible. */static inttest_st_mode(const struct stat64 *st, int mode){	int euid = geteuid();	if (euid == 0) {		/* Root can read or write any file. */		if (mode != X_OK)			return 1;		/* Root can execute any file that has any one of the execute		   bits set. */		mode = S_IXUSR | S_IXGRP | S_IXOTH;	} else if (st->st_uid == euid)		mode <<= 6;	else if (bash_group_member(st->st_gid))		mode <<= 3;	return st->st_mode & mode;}/* Return non-zero if GID is one that we have in our groups list. */static intbash_group_member(gid_t gid){	register int i;	gid_t *group_array;	int ngroups;	/* Short-circuit if possible, maybe saving a call to getgroups(). */	if (gid == getgid() || gid == getegid())		return (1);	ngroups = getgroups(0, NULL);	group_array = stalloc(ngroups * sizeof(gid_t));	getgroups(ngroups, group_array);	/* Search through the list looking for GID. */	for (i = 0; i < ngroups; i++)		if (gid == group_array[i])			return (1);	return (0);}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -