xref: /csrg-svn/usr.bin/find/function.c (revision 45616)

/*-
 * Copyright (c) 1990 The Regents of the University of California.
 * All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Cimarron D. Taylor of the University of California, Berkeley.
 *
 * %sccs.include.redist.c%
 */

#ifndef lint
static char sccsid[] = "@(#)function.c	5.11 (Berkeley) 11/15/90";
#endif /* not lint */

#include <sys/types.h>
#include <sys/stat.h>
#include <sys/wait.h>
#include <sys/mount.h>
#include <sys/errno.h>
#include <grp.h>
#include <pwd.h>
#include <fts.h>
#include <unistd.h>
#include <tzfile.h>
#include <stdio.h>
#include <string.h>
#include "find.h"

#define	FIND_EQUAL	0
#define	FIND_LESSTHAN	1
#define	FIND_GREATER	2

#define	COMPARE(a, b) { \
	switch(plan->flags) { \
	case FIND_EQUAL: \
		return(a == b); \
	case FIND_LESSTHAN: \
		return(a < b); \
	case FIND_GREATER: \
		return(a > b); \
	} \
	return(0); \
}

#define NEW(t, f) { \
	new = (PLAN *)emalloc(sizeof(PLAN)); \
	new->type = t; \
	new->eval = f; \
	new->flags = 0; \
	new->next = NULL; \
}

/*
 * find_parsenum --
 *	Parse a string of the form [+-]# and return the value.
 */
long
find_parsenum(plan, option, str, endch)
	PLAN *plan;
	char *option, *str, *endch;
{
	long value;
	char *endchar;		/* pointer to character ending conversion */
	void bad_arg();

	/* determine comparison from leading + or - */
	switch(*str) {
	case '+':
		++str;
		plan->flags = FIND_GREATER;
		break;
	case '-':
		++str;
		plan->flags = FIND_LESSTHAN;
		break;
	default:
		plan->flags = FIND_EQUAL;
		break;
	}

	/*
	 * convert the string with strtol().  Note, if strtol() returns zero
	 * and endchar points to the beginning of the string we know we have
	 * a syntax error.
	 */
	value = strtol(str, &endchar, 10);
	if (!value && endchar == str ||
	    endchar[0] && (!endch || endchar[0] != *endch))
		bad_arg(option, "illegal numeric value");
	if (endch)
		*endch = endchar[0];
	return(value);
}

/*
 * -atime n functions --
 *
 *	True if the difference between the file access time and the
 *	current time is n 24 hour periods.
 *
 */
f_atime(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	extern time_t now;

	COMPARE((now - entry->fts_statb.st_atime +
	    SECSPERDAY - 1) / SECSPERDAY, plan->t_data);
}

PLAN *
c_atime(arg)
	char *arg;
{
	PLAN *new;

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_ATIME, f_atime);
	new->t_data = find_parsenum(new, "-atime", arg, (char *)NULL);
	return(new);
}
/*
 * -ctime n functions --
 *
 *	True if the difference between the last change of file
 *	status information and the current time is n 24 hour periods.
 */
f_ctime(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	extern time_t now;

	COMPARE((now - entry->fts_statb.st_ctime +
	    SECSPERDAY - 1) / SECSPERDAY, plan->t_data);
}

PLAN *
c_ctime(arg)
	char *arg;
{
	PLAN *new;

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_CTIME, f_ctime);
	new->t_data = find_parsenum(new, "-ctime", arg, (char *)NULL);
	return(new);
}

/*
 * -depth functions --
 *
 *	Always true, causes descent of the directory hierarchy to be done
 *	so that all entries in a directory are acted on before the directory
 *	itself.
 */
/* ARGSUSED */
f_always_true(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	return(1);
}

PLAN *
c_depth()
{
	PLAN *new;

	isdepth = 1;

	NEW(T_DEPTH, f_always_true);
	return(new);
}

/*
 * [-exec | -ok] utility [arg ... ] ; functions --
 *
 *	True if the executed utility returns a zero value as exit status.
 *	The end of the primary expression is delimited by a semicolon.  If
 *	"{}" occurs anywhere, it gets replaced by the current pathname.
 *	The current directory for the execution of utility is the same as
 *	the current directory when the find utility was started.
 *
 *	The primary -ok is different in that it requests affirmation of the
 *	user before executing the utility.
 */
f_exec(plan, entry)
	register PLAN *plan;
	FTSENT *entry;
{
	register int cnt;
	union wait pstat;
	pid_t pid, waitpid();
	void brace_subst();

	for (cnt = 0; plan->e_argv[cnt]; ++cnt)
		if (plan->e_len[cnt])
			brace_subst(plan->e_orig[cnt], &plan->e_argv[cnt],
			    entry->fts_accpath, plan->e_len[cnt]);

	if (plan->flags && !queryuser(plan->e_argv))
		return(0);

	switch(pid = vfork()) {
	case -1:
		(void)fprintf(stderr, "find: fork: %s.\n", strerror(errno));
		exit(1);
		/* NOTREACHED */
	case 0:
		execvp(plan->e_argv[0], plan->e_argv);
		(void)fprintf(stderr,
		    "find: %s: %s.\n", plan->e_argv[0], strerror(errno));
		exit(1);
		/* NOTREACHED */
	}
	pid = waitpid(pid, &pstat, 0);
	return(pid != -1 && !pstat.w_status);
}

/*
 * c_exec --
 *	build three parallel arrays, one with pointers to the strings passed
 *	on the command line, one with (possibly duplicated) pointers to the
 *	argv array, and one with integer values that are lengths of the
 *	strings, but also flags meaning that the string has to be massaged.
 */
PLAN *
c_exec(argvp, isok)
	char ***argvp;
	int isok;
{
	PLAN *new;			/* node returned */
	register int cnt;
	register char **argv, **ap, *p;
	void bad_arg();

	if (!isrelative)
		ftsoptions |= FTS_NOCHDIR;
	isoutput = isstopdnx = 1;

	NEW(T_EXEC, f_exec);
	new->flags = isok;

	for (ap = argv = *argvp;; ++ap) {
		if (!*ap)
			bad_arg(isok ? "-ok" : "-exec", "no terminating \";\"");
		if (**ap == ';')
			break;
	}

	cnt = ap - *argvp + 1;
	new->e_argv = (char **)emalloc((u_int)cnt * sizeof(char *));
	new->e_orig = (char **)emalloc((u_int)cnt * sizeof(char *));
	new->e_len = (int *)emalloc((u_int)cnt * sizeof(u_char));

	for (argv = *argvp, cnt = 0; argv < ap; ++argv, ++cnt) {
		new->e_orig[cnt] = *argv;
		for (p = *argv; *p; ++p)
			if (p[0] == '{' && p[1] == '}') {
				new->e_argv[cnt] = emalloc((u_int)1024);
				new->e_len[cnt] = 1024;
				break;
			}
		if (!*p) {
			new->e_argv[cnt] = *argv;
			new->e_len[cnt] = 0;
		}
	}
	new->e_argv[cnt] = new->e_orig[cnt] = NULL;

	*argvp = argv + 1;
	return(new);
}

/*
 * -follow functions --
 *
 *	Always true, causes symbolic links to be followed on a global
 *	basis.
 */
PLAN *
c_follow()
{
	PLAN *new;

	ftsoptions &= ~FTS_PHYSICAL;
	ftsoptions |= FTS_LOGICAL;

	NEW(T_FOLLOW, f_always_true);
	return(new);
}

/*
 * -fstype functions --
 *
 *	True if the file is of a certain type.
 */
f_fstype(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	static dev_t curdev;	/* need a guaranteed illegal dev value */
	static int first = 1;
	struct statfs sb;
	static short val;

	/* only check when we cross mount point */
	if (first || curdev != entry->fts_statb.st_dev) {
		curdev = entry->fts_statb.st_dev;
		if (statfs(entry->fts_accpath, &sb)) {
			(void)fprintf(stderr, "find: %s: %s.\n",
			    entry->fts_accpath, strerror(errno));
			exit(1);
		}
		first = 0;
		val = plan->flags == MOUNT_NONE ? sb.f_flags : sb.f_type;
	}
	return(plan->flags == MOUNT_NONE ?
	    val & MNT_LOCAL : val == plan->flags);
}

PLAN *
c_fstype(arg)
	char *arg;
{
	register PLAN *new;

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_FSTYPE, f_fstype);
	switch(*arg) {
	case 'l':
		if (!strcmp(arg, "local")) {
			new->flags = MOUNT_NONE;
			return(new);
		}
		break;
	case 'm':
		if (!strcmp(arg, "mfs")) {
			new->flags = MOUNT_MFS;
			return(new);
		}
		break;
	case 'n':
		if (!strcmp(arg, "nfs")) {
			new->flags = MOUNT_NFS;
			return(new);
		}
		break;
	case 'p':
		if (!strcmp(arg, "pc")) {
			new->flags = MOUNT_PC;
			return(new);
		}
		break;
	case 'u':
		if (!strcmp(arg, "ufs")) {
			new->flags = MOUNT_UFS;
			return(new);
		}
		break;
	}
	(void)fprintf(stderr, "find: unknown file type %s.\n", arg);
	exit(1);
	/* NOTREACHED */
}

/*
 * -group gname functions --
 *
 *	True if the file belongs to the group gname.  If gname is numeric and
 *	an equivalent of the getgrnam() function does not return a valid group
 *	name, gname is taken as a group ID.
 */
f_group(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	return(entry->fts_statb.st_gid == plan->g_data);
}

PLAN *
c_group(gname)
	char *gname;
{
	PLAN *new;
	struct group *g;
	gid_t gid;
	void bad_arg();

	ftsoptions &= ~FTS_NOSTAT;

	g = getgrnam(gname);
	if (g == NULL) {
		gid = atoi(gname);
		if (gid == 0 && gname[0] != '0')
			bad_arg("-group", "no such group");
	} else
		gid = g->gr_gid;

	NEW(T_GROUP, f_group);
	new->g_data = gid;
	return(new);
}

/*
 * -inum n functions --
 *
 *	True if the file has inode # n.
 */
f_inum(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	COMPARE(entry->fts_statb.st_ino, plan->i_data);
}

PLAN *
c_inum(arg)
	char *arg;
{
	PLAN *new;

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_INUM, f_inum);
	new->i_data = find_parsenum(new, "-inum", arg, (char *)NULL);
	return(new);
}

/*
 * -links n functions --
 *
 *	True if the file has n links.
 */
f_links(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	COMPARE(entry->fts_statb.st_nlink, plan->l_data);
}

PLAN *
c_links(arg)
	char *arg;
{
	PLAN *new;

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_LINKS, f_links);
	new->l_data = (nlink_t)find_parsenum(new, "-links", arg, (char *)NULL);
	return(new);
}

/*
 * -ls functions --
 *
 *	Always true - prints the current entry to stdout in "ls" format.
 */
/* ARGSUSED */
f_ls(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	void printlong();

	printlong(entry->fts_path, entry->fts_accpath, &entry->fts_statb);
	return(1);
}

PLAN *
c_ls()
{
	PLAN *new;

	ftsoptions &= ~FTS_NOSTAT;
	isoutput = 1;

	NEW(T_LS, f_ls);
	return(new);
}

/*
 * -name functions --
 *
 *	True if the basename of the filename being examined
 *	matches pattern using Pattern Matching Notation S3.14
 */
f_name(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	return(fnmatch(plan->c_data, entry->fts_name, FNM_QUOTE));
}

PLAN *
c_name(pattern)
	char *pattern;
{
	PLAN *new;

	NEW(T_NAME, f_name);
	new->c_data = pattern;
	return(new);
}

/*
 * -newer file functions --
 *
 *	True if the current file has been modified more recently
 *	then the modification time of the file named by the pathname
 *	file.
 */
f_newer(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	return(entry->fts_statb.st_mtime > plan->t_data);
}

PLAN *
c_newer(filename)
	char *filename;
{
	PLAN *new;
	struct stat sb;

	ftsoptions &= ~FTS_NOSTAT;

	if (stat(filename, &sb)) {
		(void)fprintf(stderr, "find: %s: %s.\n",
		    filename, strerror(errno));
		exit(1);
	}
	NEW(T_NEWER, f_newer);
	new->t_data = sb.st_mtime;
	return(new);
}

/*
 * -nogroup functions --
 *
 *	True if file belongs to a user ID for which the equivalent
 *	of the getgrnam() 9.2.1 [POSIX.1] function returns NULL.
 */
/* ARGSUSED */
f_nogroup(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	char *group_from_gid();

	return(group_from_gid(entry->fts_statb.st_gid, 1) ? 1 : 0);
}

PLAN *
c_nogroup()
{
	PLAN *new;

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_NOGROUP, f_nogroup);
	return(new);
}

/*
 * -nouser functions --
 *
 *	True if file belongs to a user ID for which the equivalent
 *	of the getpwuid() 9.2.2 [POSIX.1] function returns NULL.
 */
/* ARGSUSED */
f_nouser(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	char *user_from_uid();

	return(user_from_uid(entry->fts_statb.st_uid, 1) ? 1 : 0);
}

PLAN *
c_nouser()
{
	PLAN *new;

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_NOUSER, f_nouser);
	return(new);
}

/*
 * -perm functions --
 *
 *	The mode argument is used to represent file mode bits.  If it starts
 *	with a leading digit, it's treated as an octal mode, otherwise as a
 *	symbolic mode.
 */
f_perm(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	mode_t mode;

	mode = entry->fts_statb.st_mode &
	    (S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO);
	if (plan->flags)
		return((plan->m_data | mode) == mode);
	else
		return(mode == plan->m_data);
	/* NOTREACHED */
}

PLAN *
c_perm(perm)
	char *perm;
{
	PLAN *new;
	mode_t *set, *setmode();
	void bad_arg();

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_PERM, f_perm);

	if (*perm == '-') {
		new->flags = 1;
		++perm;
	}

	if ((set = setmode(perm)) == NULL)
		bad_arg("-perm", "illegal mode string");

	new->m_data = getmode(set, 0);
	return(new);
}

/*
 * -print functions --
 *
 *	Always true, causes the current pathame to be written to
 *	standard output.
 */
/* ARGSUSED */
f_print(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	(void)printf("%s\n", entry->fts_path);
	return(1);
}

PLAN *
c_print()
{
	PLAN *new;

	isoutput = 1;

	NEW(T_PRINT, f_print);
	return(new);
}

/*
 * -prune functions --
 *
 *	Prune a portion of the hierarchy.
 */
/* ARGSUSED */
f_prune(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	extern FTS *tree;

	if (fts_set(tree, entry, FTS_SKIP)) {
		(void)fprintf(stderr,
		    "find: %s: %s.\n", entry->fts_path, strerror(errno));
		exit(1);
	}
	return(1);
}

PLAN *
c_prune()
{
	PLAN *new;

	NEW(T_PRUNE, f_prune);
	return(new);
}

/*
 * -size n[c] functions --
 *
 *	True if the file size in bytes, divided by an implementation defined
 *	value and rounded up to the next integer, is n.  If n is followed by
 *	a c, the size is in bytes.
 */
#define	FIND_SIZE	512
static int divsize = 1;

f_size(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	off_t size;

	size = divsize ? (entry->fts_statb.st_size + FIND_SIZE - 1) /
	    FIND_SIZE : entry->fts_statb.st_size;
	COMPARE(size, plan->o_data);
}

PLAN *
c_size(arg)
	char *arg;
{
	PLAN *new;
	char endch;

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_SIZE, f_size);
	new->o_data = find_parsenum(new, "-size", arg, &endch);
	if (endch == 'c')
		divsize = 0;
	return(new);
}

/*
 * -type c functions --
 *
 *	True if the type of the file is c, where c is b, c, d, p, or f for
 *	block special file, character special file, directory, FIFO, or
 *	regular file, respectively.
 */
f_type(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	return((entry->fts_statb.st_mode & S_IFMT) == plan->m_data);
}

PLAN *
c_type(typestring)
	char *typestring;
{
	PLAN *new;
	mode_t  mask;
	void bad_arg();

	ftsoptions &= ~FTS_NOSTAT;

	switch (typestring[0]) {
	case 'b':
		mask = S_IFBLK;
		break;
	case 'c':
		mask = S_IFCHR;
		break;
	case 'd':
		mask = S_IFDIR;
		break;
	case 'f':
		mask = S_IFREG;
		break;
	case 'l':
		mask = S_IFLNK;
		break;
	case 'p':
		mask = S_IFIFO;
		break;
	case 's':
		mask = S_IFSOCK;
		break;
	default:
		bad_arg("-type", "unknown type");
	}

	NEW(T_TYPE, f_type);
	new->m_data = mask;
	return(new);
}

/*
 * -user uname functions --
 *
 *	True if the file belongs to the user uname.  If uname is numeric and
 *	an equivalent of the getpwnam() S9.2.2 [POSIX.1] function does not
 *	return a valid user name, uname is taken as a user ID.
 */
f_user(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	return(entry->fts_statb.st_uid == plan->u_data);
}

PLAN *
c_user(username)
	char *username;
{
	PLAN *new;
	struct passwd *p;
	uid_t uid;
	void bad_arg();

	ftsoptions &= ~FTS_NOSTAT;

	p = getpwnam(username);
	if (p == NULL) {
		uid = atoi(username);
		if (uid == 0 && username[0] != '0')
			bad_arg("-user", "no such user");
	} else
		uid = p->pw_uid;

	NEW(T_USER, f_user);
	new->u_data = uid;
	return(new);
}

/*
 * -xdev functions --
 *
 *	Always true, causes find not to decend past directories that have a
 *	different device ID (st_dev, see stat() S5.6.2 [POSIX.1])
 */
PLAN *
c_xdev()
{
	PLAN *new;

	ftsoptions |= FTS_XDEV;

	NEW(T_XDEV, f_always_true);
	return(new);
}

/*
 * ( expression ) functions --
 *
 *	True if expression is true.
 */
f_expr(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	register PLAN *p;
	register int state;

	for (p = plan->p_data[0];
	    p && (state = (p->eval)(p, entry)); p = p->next);
	return(state);
}

/*
 * T_OPENPAREN and T_CLOSEPAREN nodes are temporary place markers.  They are
 * eliminated during phase 2 of find_formplan() --- the '(' node is converted
 * to a T_EXPR node containing the expression and the ')' node is discarded.
 */
PLAN *
c_openparen()
{
	PLAN *new;

	NEW(T_OPENPAREN, (int (*)())-1);
	return(new);
}

PLAN *
c_closeparen()
{
	PLAN *new;

	NEW(T_CLOSEPAREN, (int (*)())-1);
	return(new);
}

/*
 * -mtime n functions --
 *
 *	True if the difference between the file modification time and the
 *	current time is n 24 hour periods.
 */
f_mtime(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	extern time_t now;

	COMPARE((now - entry->fts_statb.st_mtime + SECSPERDAY - 1) /
	    SECSPERDAY, plan->t_data);
}

PLAN *
c_mtime(arg)
	char *arg;
{
	PLAN *new;

	ftsoptions &= ~FTS_NOSTAT;

	NEW(T_MTIME, f_mtime);
	new->t_data = find_parsenum(new, "-mtime", arg, (char *)NULL);
	return(new);
}

/*
 * ! expression functions --
 *
 *	Negation of a primary; the unary NOT operator.
 */
f_not(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	register PLAN *p;
	register int state;

	for (p = plan->p_data[0];
	    p && (state = (p->eval)(p, entry)); p = p->next);
	return(!state);
}

PLAN *
c_not()
{
	PLAN *new;

	NEW(T_NOT, f_not);
	return(new);
}

/*
 * expression -o expression functions --
 *
 *	Alternation of primaries; the OR operator.  The second expression is
 * not evaluated if the first expression is true.
 */
f_or(plan, entry)
	PLAN *plan;
	FTSENT *entry;
{
	register PLAN *p;
	register int state;

	for (p = plan->p_data[0];
	    p && (state = (p->eval)(p, entry)); p = p->next);

	if (state)
		return(1);

	for (p = plan->p_data[1];
	    p && (state = (p->eval)(p, entry)); p = p->next);
	return(state);
}

PLAN *
c_or()
{
	PLAN *new;

	NEW(T_OR, f_or);
	return(new);
}