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

📄 test.c

📁 EPIC IRC客户端。来源于IRCII客户端但做了很多性能和功能的优化。
💻 C
字号:
/*	$NetBSD: test.c,v 1.15 1995/03/21 07:04:06 cgd Exp $	*//* * 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. */#ifndef lintstatic char rcsid[] = "$NetBSD: test.c,v 1.15 1995/03/21 07:04:06 cgd Exp $";#endif#include <sys/types.h>#include <sys/stat.h>#include <unistd.h>#include <ctype.h>#include <errno.h>#include <stdio.h>#include <stdlib.h>#include <string.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};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}};char **t_wp;struct t_op const *t_wp_op;static enum token t_lex();static int oexpr();static int aexpr();static int nexpr();static int binop();static int primary();static int filstat();static int getn();static int newerf();static int olderf();static int equalf();static void syntax();intmain(argc, argv)	int argc;	char **argv;{	int	res;	if (strcmp(argv[0], "[") == 0) 	{		if (strcmp(argv[--argc], "]"))		{			fprintf(stderr, "missing ]");			exit(2);		}		argv[argc] = NULL;	}	/* Implement special cases from POSIX.2, section 4.62.4 */	switch (argc) 	{	case 1:		return 1;	case 2:		return (*argv[1] == '\0');	case 3:		if (argv[1][0] == '!' && argv[1][1] == '\0') 			return !(*argv[2] == '\0');		break;	case 4:		if (argv[1][0] != '!' || argv[1][1] != '\0') 		{			if (t_lex(argv[2]), t_wp_op && t_wp_op->op_type == BINOP) 			{				t_wp = &argv[1];				return (binop() == 0);			}		}		break;	case 5:		if (argv[1][0] == '!' && argv[1][1] == '\0') 		{			if (t_lex(argv[3]), t_wp_op && t_wp_op->op_type == BINOP) 			{				t_wp = &argv[2];				return !(binop() == 0);			}		}		break;	}	t_wp = &argv[1];	res = !oexpr(t_lex(*t_wp));	if (*t_wp != NULL && *++t_wp != NULL)		syntax(*t_wp, "unknown operand");	return res;}static voidsyntax(op, msg)	char	*op;	char	*msg;{	if (op && *op)		fprintf(stderr, "%s: %s", op, msg);	else		fprintf(stderr, "%s", msg);	exit(2);}static intoexpr(n)	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(n)	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(n)	enum token n;			/* token */{	if (n == UNOT)		return !nexpr(t_lex(*++t_wp));	return primary(n);}static intprimary(n)	enum token n;{	int res;	if (n == EOI)		syntax(NULL, "argument expected");	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();	}	  	return strlen(*t_wp) > 0;}static intbinop(){	register 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) {	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);	}	/* NOTREACHED */}static intfilstat(nm, mode)	char *nm;	enum token mode;{	struct stat s;	int i;	if (mode == FILSYM) {#ifdef S_IFLNK		if (lstat(nm, &s) == 0) {			i = S_IFLNK;			goto filetype;		}#endif		return 0;	}	if (stat(nm, &s) != 0) 		return 0;	switch (mode) {	case FILRD:		return access(nm, R_OK) == 0;	case FILWR:		return access(nm, W_OK) == 0;	case FILEX:		return access(nm, X_OK) == 0;	case FILEXIST:		return access(nm, F_OK) == 0;	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;	}filetype:	return ((s.st_mode & S_IFMT) == i);filebit:	return ((s.st_mode & i) != 0);}static enum tokent_lex(s)	register char *s;{	register struct t_op const *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) {			t_wp_op = op;			return op->op_num;		}		op++;	}	t_wp_op = (struct t_op *)0;	return OPERAND;}/* atoi with error detection */static intgetn(s)	char *s;{	char *p;	long r;	errno = 0;	r = strtol(s, &p, 10);	if (errno != 0)	{	  fprintf(stderr, "%s: out of range", s);	  exit(2);	}	while (isspace(*p))	  p++;		if (*p)	{	  fprintf(stderr, "%s: bad number", s);	  exit(2);	}	return (int) r;}static intnewerf (f1, f2)char *f1, *f2;{	struct stat b1, b2;	return (stat (f1, &b1) == 0 &&		stat (f2, &b2) == 0 &&		b1.st_mtime > b2.st_mtime);}static intolderf (f1, f2)char *f1, *f2;{	struct stat b1, b2;	return (stat (f1, &b1) == 0 &&		stat (f2, &b2) == 0 &&		b1.st_mtime < b2.st_mtime);}static intequalf (f1, f2)char *f1, *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);}

⌨️ 快捷键说明

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