function.c revision 192381
1/*-
2 * Copyright (c) 1990, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Cimarron D. Taylor of the University of California, Berkeley.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 *    must display the following acknowledgement:
18 *	This product includes software developed by the University of
19 *	California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 *    may be used to endorse or promote products derived from this software
22 *    without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
37#ifndef lint
38#if 0
39static const char sccsid[] = "@(#)function.c	8.10 (Berkeley) 5/4/95";
40#endif
41#endif /* not lint */
42
43#include <sys/cdefs.h>
44__FBSDID("$FreeBSD: head/usr.bin/find/function.c 192381 2009-05-19 14:23:54Z avg $");
45
46#include <sys/param.h>
47#include <sys/ucred.h>
48#include <sys/stat.h>
49#include <sys/types.h>
50#include <sys/acl.h>
51#include <sys/wait.h>
52#include <sys/mount.h>
53#include <sys/timeb.h>
54
55#include <dirent.h>
56#include <err.h>
57#include <errno.h>
58#include <fnmatch.h>
59#include <fts.h>
60#include <grp.h>
61#include <limits.h>
62#include <pwd.h>
63#include <regex.h>
64#include <stdio.h>
65#include <stdlib.h>
66#include <string.h>
67#include <unistd.h>
68#include <ctype.h>
69
70#include "find.h"
71
72static PLAN *palloc(OPTION *);
73static long long find_parsenum(PLAN *, const char *, char *, char *);
74static long long find_parsetime(PLAN *, const char *, char *);
75static char *nextarg(OPTION *, char ***);
76
77extern char **environ;
78
79static PLAN *lastexecplus = NULL;
80
81#define	COMPARE(a, b) do {						\
82	switch (plan->flags & F_ELG_MASK) {				\
83	case F_EQUAL:							\
84		return (a == b);					\
85	case F_LESSTHAN:						\
86		return (a < b);						\
87	case F_GREATER:							\
88		return (a > b);						\
89	default:							\
90		abort();						\
91	}								\
92} while(0)
93
94static PLAN *
95palloc(OPTION *option)
96{
97	PLAN *new;
98
99	if ((new = malloc(sizeof(PLAN))) == NULL)
100		err(1, NULL);
101	new->execute = option->execute;
102	new->flags = option->flags;
103	new->next = NULL;
104	return new;
105}
106
107/*
108 * find_parsenum --
109 *	Parse a string of the form [+-]# and return the value.
110 */
111static long long
112find_parsenum(PLAN *plan, const char *option, char *vp, char *endch)
113{
114	long long value;
115	char *endchar, *str;	/* Pointer to character ending conversion. */
116
117	/* Determine comparison from leading + or -. */
118	str = vp;
119	switch (*str) {
120	case '+':
121		++str;
122		plan->flags |= F_GREATER;
123		break;
124	case '-':
125		++str;
126		plan->flags |= F_LESSTHAN;
127		break;
128	default:
129		plan->flags |= F_EQUAL;
130		break;
131	}
132
133	/*
134	 * Convert the string with strtoq().  Note, if strtoq() returns zero
135	 * and endchar points to the beginning of the string we know we have
136	 * a syntax error.
137	 */
138	value = strtoq(str, &endchar, 10);
139	if (value == 0 && endchar == str)
140		errx(1, "%s: %s: illegal numeric value", option, vp);
141	if (endchar[0] && endch == NULL)
142		errx(1, "%s: %s: illegal trailing character", option, vp);
143	if (endch)
144		*endch = endchar[0];
145	return value;
146}
147
148/*
149 * find_parsetime --
150 *	Parse a string of the form [+-]([0-9]+[smhdw]?)+ and return the value.
151 */
152static long long
153find_parsetime(PLAN *plan, const char *option, char *vp)
154{
155	long long secs, value;
156	char *str, *unit;	/* Pointer to character ending conversion. */
157
158	/* Determine comparison from leading + or -. */
159	str = vp;
160	switch (*str) {
161	case '+':
162		++str;
163		plan->flags |= F_GREATER;
164		break;
165	case '-':
166		++str;
167		plan->flags |= F_LESSTHAN;
168		break;
169	default:
170		plan->flags |= F_EQUAL;
171		break;
172	}
173
174	value = strtoq(str, &unit, 10);
175	if (value == 0 && unit == str) {
176		errx(1, "%s: %s: illegal time value", option, vp);
177		/* NOTREACHED */
178	}
179	if (*unit == '\0')
180		return value;
181
182	/* Units syntax. */
183	secs = 0;
184	for (;;) {
185		switch(*unit) {
186		case 's':	/* seconds */
187			secs += value;
188			break;
189		case 'm':	/* minutes */
190			secs += value * 60;
191			break;
192		case 'h':	/* hours */
193			secs += value * 3600;
194			break;
195		case 'd':	/* days */
196			secs += value * 86400;
197			break;
198		case 'w':	/* weeks */
199			secs += value * 604800;
200			break;
201		default:
202			errx(1, "%s: %s: bad unit '%c'", option, vp, *unit);
203			/* NOTREACHED */
204		}
205		str = unit + 1;
206		if (*str == '\0')	/* EOS */
207			break;
208		value = strtoq(str, &unit, 10);
209		if (value == 0 && unit == str) {
210			errx(1, "%s: %s: illegal time value", option, vp);
211			/* NOTREACHED */
212		}
213		if (*unit == '\0') {
214			errx(1, "%s: %s: missing trailing unit", option, vp);
215			/* NOTREACHED */
216		}
217	}
218	plan->flags |= F_EXACTTIME;
219	return secs;
220}
221
222/*
223 * nextarg --
224 *	Check that another argument still exists, return a pointer to it,
225 *	and increment the argument vector pointer.
226 */
227static char *
228nextarg(OPTION *option, char ***argvp)
229{
230	char *arg;
231
232	if ((arg = **argvp) == 0)
233		errx(1, "%s: requires additional arguments", option->name);
234	(*argvp)++;
235	return arg;
236} /* nextarg() */
237
238/*
239 * The value of n for the inode times (atime, birthtime, ctime, mtime) is a
240 * range, i.e. n matches from (n - 1) to n 24 hour periods.  This interacts
241 * with -n, such that "-mtime -1" would be less than 0 days, which isn't what
242 * the user wanted.  Correct so that -1 is "less than 1".
243 */
244#define	TIME_CORRECT(p) \
245	if (((p)->flags & F_ELG_MASK) == F_LESSTHAN) \
246		++((p)->t_data);
247
248/*
249 * -[acm]min n functions --
250 *
251 *    True if the difference between the
252 *		file access time (-amin)
253 *		file birth time (-Bmin)
254 *		last change of file status information (-cmin)
255 *		file modification time (-mmin)
256 *    and the current time is n min periods.
257 */
258int
259f_Xmin(PLAN *plan, FTSENT *entry)
260{
261	if (plan->flags & F_TIME_C) {
262		COMPARE((now - entry->fts_statp->st_ctime +
263		    60 - 1) / 60, plan->t_data);
264	} else if (plan->flags & F_TIME_A) {
265		COMPARE((now - entry->fts_statp->st_atime +
266		    60 - 1) / 60, plan->t_data);
267	} else if (plan->flags & F_TIME_B) {
268		COMPARE((now - entry->fts_statp->st_birthtime +
269		    60 - 1) / 60, plan->t_data);
270	} else {
271		COMPARE((now - entry->fts_statp->st_mtime +
272		    60 - 1) / 60, plan->t_data);
273	}
274}
275
276PLAN *
277c_Xmin(OPTION *option, char ***argvp)
278{
279	char *nmins;
280	PLAN *new;
281
282	nmins = nextarg(option, argvp);
283	ftsoptions &= ~FTS_NOSTAT;
284
285	new = palloc(option);
286	new->t_data = find_parsenum(new, option->name, nmins, NULL);
287	TIME_CORRECT(new);
288	return new;
289}
290
291/*
292 * -[acm]time n functions --
293 *
294 *	True if the difference between the
295 *		file access time (-atime)
296 *		file birth time (-Btime)
297 *		last change of file status information (-ctime)
298 *		file modification time (-mtime)
299 *	and the current time is n 24 hour periods.
300 */
301
302int
303f_Xtime(PLAN *plan, FTSENT *entry)
304{
305	time_t xtime;
306
307	if (plan->flags & F_TIME_A)
308		xtime = entry->fts_statp->st_atime;
309	else if (plan->flags & F_TIME_B)
310		xtime = entry->fts_statp->st_birthtime;
311	else if (plan->flags & F_TIME_C)
312		xtime = entry->fts_statp->st_ctime;
313	else
314		xtime = entry->fts_statp->st_mtime;
315
316	if (plan->flags & F_EXACTTIME)
317		COMPARE(now - xtime, plan->t_data);
318	else
319		COMPARE((now - xtime + 86400 - 1) / 86400, plan->t_data);
320}
321
322PLAN *
323c_Xtime(OPTION *option, char ***argvp)
324{
325	char *value;
326	PLAN *new;
327
328	value = nextarg(option, argvp);
329	ftsoptions &= ~FTS_NOSTAT;
330
331	new = palloc(option);
332	new->t_data = find_parsetime(new, option->name, value);
333	if (!(new->flags & F_EXACTTIME))
334		TIME_CORRECT(new);
335	return new;
336}
337
338/*
339 * -maxdepth/-mindepth n functions --
340 *
341 *        Does the same as -prune if the level of the current file is
342 *        greater/less than the specified maximum/minimum depth.
343 *
344 *        Note that -maxdepth and -mindepth are handled specially in
345 *        find_execute() so their f_* functions are set to f_always_true().
346 */
347PLAN *
348c_mXXdepth(OPTION *option, char ***argvp)
349{
350	char *dstr;
351	PLAN *new;
352
353	dstr = nextarg(option, argvp);
354	if (dstr[0] == '-')
355		/* all other errors handled by find_parsenum() */
356		errx(1, "%s: %s: value must be positive", option->name, dstr);
357
358	new = palloc(option);
359	if (option->flags & F_MAXDEPTH)
360		maxdepth = find_parsenum(new, option->name, dstr, NULL);
361	else
362		mindepth = find_parsenum(new, option->name, dstr, NULL);
363	return new;
364}
365
366/*
367 * -acl function --
368 *
369 *	Show files with EXTENDED ACL attributes.
370 */
371int
372f_acl(PLAN *plan __unused, FTSENT *entry)
373{
374	int match, entries;
375	acl_entry_t ae;
376	acl_t facl;
377
378	if (S_ISLNK(entry->fts_statp->st_mode))
379		return 0;
380	if ((match = pathconf(entry->fts_accpath, _PC_ACL_EXTENDED)) <= 0) {
381		if (match < 0 && errno != EINVAL)
382			warn("%s", entry->fts_accpath);
383	else
384		return 0;
385	}
386	match = 0;
387	if ((facl = acl_get_file(entry->fts_accpath,ACL_TYPE_ACCESS)) != NULL) {
388		if (acl_get_entry(facl, ACL_FIRST_ENTRY, &ae) == 1) {
389			/*
390			 * POSIX.1e requires that ACLs of type ACL_TYPE_ACCESS
391			 * must have at least three entries (owner, group,
392			 * other).
393			 */
394			entries = 1;
395			while (acl_get_entry(facl, ACL_NEXT_ENTRY, &ae) == 1) {
396				if (++entries > 3) {
397					match = 1;
398					break;
399				}
400			}
401		}
402		acl_free(facl);
403	} else
404		warn("%s", entry->fts_accpath);
405	return match;
406}
407
408PLAN *
409c_acl(OPTION *option, char ***argvp __unused)
410{
411	ftsoptions &= ~FTS_NOSTAT;
412	return (palloc(option));
413}
414
415/*
416 * -delete functions --
417 *
418 *	True always.  Makes its best shot and continues on regardless.
419 */
420int
421f_delete(PLAN *plan __unused, FTSENT *entry)
422{
423	/* ignore these from fts */
424	if (strcmp(entry->fts_accpath, ".") == 0 ||
425	    strcmp(entry->fts_accpath, "..") == 0)
426		return 1;
427
428	/* sanity check */
429	if (isdepth == 0 ||			/* depth off */
430	    (ftsoptions & FTS_NOSTAT))		/* not stat()ing */
431		errx(1, "-delete: insecure options got turned on");
432
433	if (!(ftsoptions & FTS_PHYSICAL) ||	/* physical off */
434	    (ftsoptions & FTS_LOGICAL))		/* or finally, logical on */
435		errx(1, "-delete: forbidden when symlinks are followed");
436
437	/* Potentially unsafe - do not accept relative paths whatsoever */
438	if (strchr(entry->fts_accpath, '/') != NULL)
439		errx(1, "-delete: %s: relative path potentially not safe",
440			entry->fts_accpath);
441
442	/* Turn off user immutable bits if running as root */
443	if ((entry->fts_statp->st_flags & (UF_APPEND|UF_IMMUTABLE)) &&
444	    !(entry->fts_statp->st_flags & (SF_APPEND|SF_IMMUTABLE)) &&
445	    geteuid() == 0)
446		chflags(entry->fts_accpath,
447		       entry->fts_statp->st_flags &= ~(UF_APPEND|UF_IMMUTABLE));
448
449	/* rmdir directories, unlink everything else */
450	if (S_ISDIR(entry->fts_statp->st_mode)) {
451		if (rmdir(entry->fts_accpath) < 0 && errno != ENOTEMPTY)
452			warn("-delete: rmdir(%s)", entry->fts_path);
453	} else {
454		if (unlink(entry->fts_accpath) < 0)
455			warn("-delete: unlink(%s)", entry->fts_path);
456	}
457
458	/* "succeed" */
459	return 1;
460}
461
462PLAN *
463c_delete(OPTION *option, char ***argvp __unused)
464{
465
466	ftsoptions &= ~FTS_NOSTAT;	/* no optimise */
467	isoutput = 1;			/* possible output */
468	isdepth = 1;			/* -depth implied */
469
470	return palloc(option);
471}
472
473
474/*
475 * always_true --
476 *
477 *	Always true, used for -maxdepth, -mindepth, -xdev, -follow, and -true
478 */
479int
480f_always_true(PLAN *plan __unused, FTSENT *entry __unused)
481{
482	return 1;
483}
484
485/*
486 * -depth functions --
487 *
488 *	With argument: True if the file is at level n.
489 *	Without argument: Always true, causes descent of the directory hierarchy
490 *	to be done so that all entries in a directory are acted on before the
491 *	directory itself.
492 */
493int
494f_depth(PLAN *plan, FTSENT *entry)
495{
496	if (plan->flags & F_DEPTH)
497		COMPARE(entry->fts_level, plan->d_data);
498	else
499		return 1;
500}
501
502PLAN *
503c_depth(OPTION *option, char ***argvp)
504{
505	PLAN *new;
506	char *str;
507
508	new = palloc(option);
509
510	str = **argvp;
511	if (str && !(new->flags & F_DEPTH)) {
512		/* skip leading + or - */
513		if (*str == '+' || *str == '-')
514			str++;
515		/* skip sign */
516		if (*str == '+' || *str == '-')
517			str++;
518		if (isdigit(*str))
519			new->flags |= F_DEPTH;
520	}
521
522	if (new->flags & F_DEPTH) {	/* -depth n */
523		char *ndepth;
524
525		ndepth = nextarg(option, argvp);
526		new->d_data = find_parsenum(new, option->name, ndepth, NULL);
527	} else {			/* -d */
528		isdepth = 1;
529	}
530
531	return new;
532}
533
534/*
535 * -empty functions --
536 *
537 *	True if the file or directory is empty
538 */
539int
540f_empty(PLAN *plan __unused, FTSENT *entry)
541{
542	if (S_ISREG(entry->fts_statp->st_mode) &&
543	    entry->fts_statp->st_size == 0)
544		return 1;
545	if (S_ISDIR(entry->fts_statp->st_mode)) {
546		struct dirent *dp;
547		int empty;
548		DIR *dir;
549
550		empty = 1;
551		dir = opendir(entry->fts_accpath);
552		if (dir == NULL)
553			err(1, "%s", entry->fts_accpath);
554		for (dp = readdir(dir); dp; dp = readdir(dir))
555			if (dp->d_name[0] != '.' ||
556			    (dp->d_name[1] != '\0' &&
557			     (dp->d_name[1] != '.' || dp->d_name[2] != '\0'))) {
558				empty = 0;
559				break;
560			}
561		closedir(dir);
562		return empty;
563	}
564	return 0;
565}
566
567PLAN *
568c_empty(OPTION *option, char ***argvp __unused)
569{
570	ftsoptions &= ~FTS_NOSTAT;
571
572	return palloc(option);
573}
574
575/*
576 * [-exec | -execdir | -ok] utility [arg ... ] ; functions --
577 *
578 *	True if the executed utility returns a zero value as exit status.
579 *	The end of the primary expression is delimited by a semicolon.  If
580 *	"{}" occurs anywhere, it gets replaced by the current pathname,
581 *	or, in the case of -execdir, the current basename (filename
582 *	without leading directory prefix). For -exec and -ok,
583 *	the current directory for the execution of utility is the same as
584 *	the current directory when the find utility was started, whereas
585 *	for -execdir, it is the directory the file resides in.
586 *
587 *	The primary -ok differs from -exec in that it requests affirmation
588 *	of the user before executing the utility.
589 */
590int
591f_exec(PLAN *plan, FTSENT *entry)
592{
593	int cnt;
594	pid_t pid;
595	int status;
596	char *file;
597
598	if (entry == NULL && plan->flags & F_EXECPLUS) {
599		if (plan->e_ppos == plan->e_pbnum)
600			return (1);
601		plan->e_argv[plan->e_ppos] = NULL;
602		goto doexec;
603	}
604
605	/* XXX - if file/dir ends in '/' this will not work -- can it? */
606	if ((plan->flags & F_EXECDIR) && \
607	    (file = strrchr(entry->fts_path, '/')))
608		file++;
609	else
610		file = entry->fts_path;
611
612	if (plan->flags & F_EXECPLUS) {
613		if ((plan->e_argv[plan->e_ppos] = strdup(file)) == NULL)
614			err(1, NULL);
615		plan->e_len[plan->e_ppos] = strlen(file);
616		plan->e_psize += plan->e_len[plan->e_ppos];
617		if (++plan->e_ppos < plan->e_pnummax &&
618		    plan->e_psize < plan->e_psizemax)
619			return (1);
620		plan->e_argv[plan->e_ppos] = NULL;
621	} else {
622		for (cnt = 0; plan->e_argv[cnt]; ++cnt)
623			if (plan->e_len[cnt])
624				brace_subst(plan->e_orig[cnt],
625				    &plan->e_argv[cnt], file,
626				    plan->e_len[cnt]);
627	}
628
629doexec:	if ((plan->flags & F_NEEDOK) && !queryuser(plan->e_argv))
630		return 0;
631
632	/* make sure find output is interspersed correctly with subprocesses */
633	fflush(stdout);
634	fflush(stderr);
635
636	switch (pid = fork()) {
637	case -1:
638		err(1, "fork");
639		/* NOTREACHED */
640	case 0:
641		/* change dir back from where we started */
642		if (!(plan->flags & F_EXECDIR) && fchdir(dotfd)) {
643			warn("chdir");
644			_exit(1);
645		}
646		execvp(plan->e_argv[0], plan->e_argv);
647		warn("%s", plan->e_argv[0]);
648		_exit(1);
649	}
650	if (plan->flags & F_EXECPLUS) {
651		while (--plan->e_ppos >= plan->e_pbnum)
652			free(plan->e_argv[plan->e_ppos]);
653		plan->e_ppos = plan->e_pbnum;
654		plan->e_psize = plan->e_pbsize;
655	}
656	pid = waitpid(pid, &status, 0);
657	return (pid != -1 && WIFEXITED(status) && !WEXITSTATUS(status));
658}
659
660/*
661 * c_exec, c_execdir, c_ok --
662 *	build three parallel arrays, one with pointers to the strings passed
663 *	on the command line, one with (possibly duplicated) pointers to the
664 *	argv array, and one with integer values that are lengths of the
665 *	strings, but also flags meaning that the string has to be massaged.
666 */
667PLAN *
668c_exec(OPTION *option, char ***argvp)
669{
670	PLAN *new;			/* node returned */
671	long argmax;
672	int cnt, i;
673	char **argv, **ap, **ep, *p;
674
675	/* XXX - was in c_execdir, but seems unnecessary!?
676	ftsoptions &= ~FTS_NOSTAT;
677	*/
678	isoutput = 1;
679
680	/* XXX - this is a change from the previous coding */
681	new = palloc(option);
682
683	for (ap = argv = *argvp;; ++ap) {
684		if (!*ap)
685			errx(1,
686			    "%s: no terminating \";\" or \"+\"", option->name);
687		if (**ap == ';')
688			break;
689		if (**ap == '+' && ap != argv && strcmp(*(ap - 1), "{}") == 0) {
690			new->flags |= F_EXECPLUS;
691			break;
692		}
693	}
694
695	if (ap == argv)
696		errx(1, "%s: no command specified", option->name);
697
698	cnt = ap - *argvp + 1;
699	if (new->flags & F_EXECPLUS) {
700		new->e_ppos = new->e_pbnum = cnt - 2;
701		if ((argmax = sysconf(_SC_ARG_MAX)) == -1) {
702			warn("sysconf(_SC_ARG_MAX)");
703			argmax = _POSIX_ARG_MAX;
704		}
705		argmax -= 1024;
706		for (ep = environ; *ep != NULL; ep++)
707			argmax -= strlen(*ep) + 1 + sizeof(*ep);
708		argmax -= 1 + sizeof(*ep);
709		new->e_pnummax = argmax / 16;
710		argmax -= sizeof(char *) * new->e_pnummax;
711		if (argmax <= 0)
712			errx(1, "no space for arguments");
713		new->e_psizemax = argmax;
714		new->e_pbsize = 0;
715		cnt += new->e_pnummax + 1;
716		new->e_next = lastexecplus;
717		lastexecplus = new;
718	}
719	if ((new->e_argv = malloc(cnt * sizeof(char *))) == NULL)
720		err(1, NULL);
721	if ((new->e_orig = malloc(cnt * sizeof(char *))) == NULL)
722		err(1, NULL);
723	if ((new->e_len = malloc(cnt * sizeof(int))) == NULL)
724		err(1, NULL);
725
726	for (argv = *argvp, cnt = 0; argv < ap; ++argv, ++cnt) {
727		new->e_orig[cnt] = *argv;
728		if (new->flags & F_EXECPLUS)
729			new->e_pbsize += strlen(*argv) + 1;
730		for (p = *argv; *p; ++p)
731			if (!(new->flags & F_EXECPLUS) && p[0] == '{' &&
732			    p[1] == '}') {
733				if ((new->e_argv[cnt] =
734				    malloc(MAXPATHLEN)) == NULL)
735					err(1, NULL);
736				new->e_len[cnt] = MAXPATHLEN;
737				break;
738			}
739		if (!*p) {
740			new->e_argv[cnt] = *argv;
741			new->e_len[cnt] = 0;
742		}
743	}
744	if (new->flags & F_EXECPLUS) {
745		new->e_psize = new->e_pbsize;
746		cnt--;
747		for (i = 0; i < new->e_pnummax; i++) {
748			new->e_argv[cnt] = NULL;
749			new->e_len[cnt] = 0;
750			cnt++;
751		}
752		argv = ap;
753		goto done;
754	}
755	new->e_argv[cnt] = new->e_orig[cnt] = NULL;
756
757done:	*argvp = argv + 1;
758	return new;
759}
760
761/* Finish any pending -exec ... {} + functions. */
762void
763finish_execplus()
764{
765	PLAN *p;
766
767	p = lastexecplus;
768	while (p != NULL) {
769		(p->execute)(p, NULL);
770		p = p->e_next;
771	}
772}
773
774int
775f_flags(PLAN *plan, FTSENT *entry)
776{
777	u_long flags;
778
779	flags = entry->fts_statp->st_flags;
780	if (plan->flags & F_ATLEAST)
781		return (flags | plan->fl_flags) == flags &&
782		    !(flags & plan->fl_notflags);
783	else if (plan->flags & F_ANY)
784		return (flags & plan->fl_flags) ||
785		    (flags | plan->fl_notflags) != flags;
786	else
787		return flags == plan->fl_flags &&
788		    !(plan->fl_flags & plan->fl_notflags);
789}
790
791PLAN *
792c_flags(OPTION *option, char ***argvp)
793{
794	char *flags_str;
795	PLAN *new;
796	u_long flags, notflags;
797
798	flags_str = nextarg(option, argvp);
799	ftsoptions &= ~FTS_NOSTAT;
800
801	new = palloc(option);
802
803	if (*flags_str == '-') {
804		new->flags |= F_ATLEAST;
805		flags_str++;
806	} else if (*flags_str == '+') {
807		new->flags |= F_ANY;
808		flags_str++;
809	}
810	if (strtofflags(&flags_str, &flags, &notflags) == 1)
811		errx(1, "%s: %s: illegal flags string", option->name, flags_str);
812
813	new->fl_flags = flags;
814	new->fl_notflags = notflags;
815	return new;
816}
817
818/*
819 * -follow functions --
820 *
821 *	Always true, causes symbolic links to be followed on a global
822 *	basis.
823 */
824PLAN *
825c_follow(OPTION *option, char ***argvp __unused)
826{
827	ftsoptions &= ~FTS_PHYSICAL;
828	ftsoptions |= FTS_LOGICAL;
829
830	return palloc(option);
831}
832
833/*
834 * -fstype functions --
835 *
836 *	True if the file is of a certain type.
837 */
838int
839f_fstype(PLAN *plan, FTSENT *entry)
840{
841	static dev_t curdev;	/* need a guaranteed illegal dev value */
842	static int first = 1;
843	struct statfs sb;
844	static int val_type, val_flags;
845	char *p, save[2] = {0,0};
846
847	if ((plan->flags & F_MTMASK) == F_MTUNKNOWN)
848		return 0;
849
850	/* Only check when we cross mount point. */
851	if (first || curdev != entry->fts_statp->st_dev) {
852		curdev = entry->fts_statp->st_dev;
853
854		/*
855		 * Statfs follows symlinks; find wants the link's filesystem,
856		 * not where it points.
857		 */
858		if (entry->fts_info == FTS_SL ||
859		    entry->fts_info == FTS_SLNONE) {
860			if ((p = strrchr(entry->fts_accpath, '/')) != NULL)
861				++p;
862			else
863				p = entry->fts_accpath;
864			save[0] = p[0];
865			p[0] = '.';
866			save[1] = p[1];
867			p[1] = '\0';
868		} else
869			p = NULL;
870
871		if (statfs(entry->fts_accpath, &sb))
872			err(1, "%s", entry->fts_accpath);
873
874		if (p) {
875			p[0] = save[0];
876			p[1] = save[1];
877		}
878
879		first = 0;
880
881		/*
882		 * Further tests may need both of these values, so
883		 * always copy both of them.
884		 */
885		val_flags = sb.f_flags;
886		val_type = sb.f_type;
887	}
888	switch (plan->flags & F_MTMASK) {
889	case F_MTFLAG:
890		return val_flags & plan->mt_data;
891	case F_MTTYPE:
892		return val_type == plan->mt_data;
893	default:
894		abort();
895	}
896}
897
898PLAN *
899c_fstype(OPTION *option, char ***argvp)
900{
901	char *fsname;
902	PLAN *new;
903	struct xvfsconf vfc;
904
905	fsname = nextarg(option, argvp);
906	ftsoptions &= ~FTS_NOSTAT;
907
908	new = palloc(option);
909
910	/*
911	 * Check first for a filesystem name.
912	 */
913	if (getvfsbyname(fsname, &vfc) == 0) {
914		new->flags |= F_MTTYPE;
915		new->mt_data = vfc.vfc_typenum;
916		return new;
917	}
918
919	switch (*fsname) {
920	case 'l':
921		if (!strcmp(fsname, "local")) {
922			new->flags |= F_MTFLAG;
923			new->mt_data = MNT_LOCAL;
924			return new;
925		}
926		break;
927	case 'r':
928		if (!strcmp(fsname, "rdonly")) {
929			new->flags |= F_MTFLAG;
930			new->mt_data = MNT_RDONLY;
931			return new;
932		}
933		break;
934	}
935
936	/*
937	 * We need to make filesystem checks for filesystems
938	 * that exists but aren't in the kernel work.
939	 */
940	fprintf(stderr, "Warning: Unknown filesystem type %s\n", fsname);
941	new->flags |= F_MTUNKNOWN;
942	return new;
943}
944
945/*
946 * -group gname functions --
947 *
948 *	True if the file belongs to the group gname.  If gname is numeric and
949 *	an equivalent of the getgrnam() function does not return a valid group
950 *	name, gname is taken as a group ID.
951 */
952int
953f_group(PLAN *plan, FTSENT *entry)
954{
955	COMPARE(entry->fts_statp->st_gid, plan->g_data);
956}
957
958PLAN *
959c_group(OPTION *option, char ***argvp)
960{
961	char *gname;
962	PLAN *new;
963	struct group *g;
964	gid_t gid;
965
966	gname = nextarg(option, argvp);
967	ftsoptions &= ~FTS_NOSTAT;
968
969	new = palloc(option);
970	g = getgrnam(gname);
971	if (g == NULL) {
972		char* cp = gname;
973		if (gname[0] == '-' || gname[0] == '+')
974			gname++;
975		gid = atoi(gname);
976		if (gid == 0 && gname[0] != '0')
977			errx(1, "%s: %s: no such group", option->name, gname);
978		gid = find_parsenum(new, option->name, cp, NULL);
979	} else
980		gid = g->gr_gid;
981
982	new->g_data = gid;
983	return new;
984}
985
986/*
987 * -inum n functions --
988 *
989 *	True if the file has inode # n.
990 */
991int
992f_inum(PLAN *plan, FTSENT *entry)
993{
994	COMPARE(entry->fts_statp->st_ino, plan->i_data);
995}
996
997PLAN *
998c_inum(OPTION *option, char ***argvp)
999{
1000	char *inum_str;
1001	PLAN *new;
1002
1003	inum_str = nextarg(option, argvp);
1004	ftsoptions &= ~FTS_NOSTAT;
1005
1006	new = palloc(option);
1007	new->i_data = find_parsenum(new, option->name, inum_str, NULL);
1008	return new;
1009}
1010
1011/*
1012 * -samefile FN
1013 *
1014 *	True if the file has the same inode (eg hard link) FN
1015 */
1016
1017/* f_samefile is just f_inum */
1018PLAN *
1019c_samefile(OPTION *option, char ***argvp)
1020{
1021	char *fn;
1022	PLAN *new;
1023	struct stat sb;
1024
1025	fn = nextarg(option, argvp);
1026	ftsoptions &= ~FTS_NOSTAT;
1027
1028	new = palloc(option);
1029	if (stat(fn, &sb))
1030		err(1, "%s", fn);
1031	new->i_data = sb.st_ino;
1032	return new;
1033}
1034
1035/*
1036 * -links n functions --
1037 *
1038 *	True if the file has n links.
1039 */
1040int
1041f_links(PLAN *plan, FTSENT *entry)
1042{
1043	COMPARE(entry->fts_statp->st_nlink, plan->l_data);
1044}
1045
1046PLAN *
1047c_links(OPTION *option, char ***argvp)
1048{
1049	char *nlinks;
1050	PLAN *new;
1051
1052	nlinks = nextarg(option, argvp);
1053	ftsoptions &= ~FTS_NOSTAT;
1054
1055	new = palloc(option);
1056	new->l_data = (nlink_t)find_parsenum(new, option->name, nlinks, NULL);
1057	return new;
1058}
1059
1060/*
1061 * -ls functions --
1062 *
1063 *	Always true - prints the current entry to stdout in "ls" format.
1064 */
1065int
1066f_ls(PLAN *plan __unused, FTSENT *entry)
1067{
1068	printlong(entry->fts_path, entry->fts_accpath, entry->fts_statp);
1069	return 1;
1070}
1071
1072PLAN *
1073c_ls(OPTION *option, char ***argvp __unused)
1074{
1075	ftsoptions &= ~FTS_NOSTAT;
1076	isoutput = 1;
1077
1078	return palloc(option);
1079}
1080
1081/*
1082 * -name functions --
1083 *
1084 *	True if the basename of the filename being examined
1085 *	matches pattern using Pattern Matching Notation S3.14
1086 */
1087int
1088f_name(PLAN *plan, FTSENT *entry)
1089{
1090	char fn[PATH_MAX];
1091	const char *name;
1092
1093	if (plan->flags & F_LINK) {
1094		name = fn;
1095		if (readlink(entry->fts_path, fn, sizeof(fn)) == -1)
1096			return 0;
1097	} else
1098		name = entry->fts_name;
1099	return !fnmatch(plan->c_data, name,
1100	    plan->flags & F_IGNCASE ? FNM_CASEFOLD : 0);
1101}
1102
1103PLAN *
1104c_name(OPTION *option, char ***argvp)
1105{
1106	char *pattern;
1107	PLAN *new;
1108
1109	pattern = nextarg(option, argvp);
1110	new = palloc(option);
1111	new->c_data = pattern;
1112	return new;
1113}
1114
1115/*
1116 * -newer file functions --
1117 *
1118 *	True if the current file has been modified more recently
1119 *	then the modification time of the file named by the pathname
1120 *	file.
1121 */
1122int
1123f_newer(PLAN *plan, FTSENT *entry)
1124{
1125	if (plan->flags & F_TIME_C)
1126		return entry->fts_statp->st_ctime > plan->t_data;
1127	else if (plan->flags & F_TIME_A)
1128		return entry->fts_statp->st_atime > plan->t_data;
1129	else if (plan->flags & F_TIME_B)
1130		return entry->fts_statp->st_birthtime > plan->t_data;
1131	else
1132		return entry->fts_statp->st_mtime > plan->t_data;
1133}
1134
1135PLAN *
1136c_newer(OPTION *option, char ***argvp)
1137{
1138	char *fn_or_tspec;
1139	PLAN *new;
1140	struct stat sb;
1141
1142	fn_or_tspec = nextarg(option, argvp);
1143	ftsoptions &= ~FTS_NOSTAT;
1144
1145	new = palloc(option);
1146	/* compare against what */
1147	if (option->flags & F_TIME2_T) {
1148		new->t_data = get_date(fn_or_tspec, (struct timeb *) 0);
1149		if (new->t_data == (time_t) -1)
1150			errx(1, "Can't parse date/time: %s", fn_or_tspec);
1151	} else {
1152		if (stat(fn_or_tspec, &sb))
1153			err(1, "%s", fn_or_tspec);
1154		if (option->flags & F_TIME2_C)
1155			new->t_data = sb.st_ctime;
1156		else if (option->flags & F_TIME2_A)
1157			new->t_data = sb.st_atime;
1158		else
1159			new->t_data = sb.st_mtime;
1160	}
1161	return new;
1162}
1163
1164/*
1165 * -nogroup functions --
1166 *
1167 *	True if file belongs to a user ID for which the equivalent
1168 *	of the getgrnam() 9.2.1 [POSIX.1] function returns NULL.
1169 */
1170int
1171f_nogroup(PLAN *plan __unused, FTSENT *entry)
1172{
1173	return group_from_gid(entry->fts_statp->st_gid, 1) == NULL;
1174}
1175
1176PLAN *
1177c_nogroup(OPTION *option, char ***argvp __unused)
1178{
1179	ftsoptions &= ~FTS_NOSTAT;
1180
1181	return palloc(option);
1182}
1183
1184/*
1185 * -nouser functions --
1186 *
1187 *	True if file belongs to a user ID for which the equivalent
1188 *	of the getpwuid() 9.2.2 [POSIX.1] function returns NULL.
1189 */
1190int
1191f_nouser(PLAN *plan __unused, FTSENT *entry)
1192{
1193	return user_from_uid(entry->fts_statp->st_uid, 1) == NULL;
1194}
1195
1196PLAN *
1197c_nouser(OPTION *option, char ***argvp __unused)
1198{
1199	ftsoptions &= ~FTS_NOSTAT;
1200
1201	return palloc(option);
1202}
1203
1204/*
1205 * -path functions --
1206 *
1207 *	True if the path of the filename being examined
1208 *	matches pattern using Pattern Matching Notation S3.14
1209 */
1210int
1211f_path(PLAN *plan, FTSENT *entry)
1212{
1213	return !fnmatch(plan->c_data, entry->fts_path,
1214	    plan->flags & F_IGNCASE ? FNM_CASEFOLD : 0);
1215}
1216
1217/* c_path is the same as c_name */
1218
1219/*
1220 * -perm functions --
1221 *
1222 *	The mode argument is used to represent file mode bits.  If it starts
1223 *	with a leading digit, it's treated as an octal mode, otherwise as a
1224 *	symbolic mode.
1225 */
1226int
1227f_perm(PLAN *plan, FTSENT *entry)
1228{
1229	mode_t mode;
1230
1231	mode = entry->fts_statp->st_mode &
1232	    (S_ISUID|S_ISGID|S_ISTXT|S_IRWXU|S_IRWXG|S_IRWXO);
1233	if (plan->flags & F_ATLEAST)
1234		return (plan->m_data | mode) == mode;
1235	else if (plan->flags & F_ANY)
1236		return (mode & plan->m_data);
1237	else
1238		return mode == plan->m_data;
1239	/* NOTREACHED */
1240}
1241
1242PLAN *
1243c_perm(OPTION *option, char ***argvp)
1244{
1245	char *perm;
1246	PLAN *new;
1247	mode_t *set;
1248
1249	perm = nextarg(option, argvp);
1250	ftsoptions &= ~FTS_NOSTAT;
1251
1252	new = palloc(option);
1253
1254	if (*perm == '-') {
1255		new->flags |= F_ATLEAST;
1256		++perm;
1257	} else if (*perm == '+') {
1258		new->flags |= F_ANY;
1259		++perm;
1260	}
1261
1262	if ((set = setmode(perm)) == NULL)
1263		errx(1, "%s: %s: illegal mode string", option->name, perm);
1264
1265	new->m_data = getmode(set, 0);
1266	free(set);
1267	return new;
1268}
1269
1270/*
1271 * -print functions --
1272 *
1273 *	Always true, causes the current pathname to be written to
1274 *	standard output.
1275 */
1276int
1277f_print(PLAN *plan __unused, FTSENT *entry)
1278{
1279	(void)puts(entry->fts_path);
1280	return 1;
1281}
1282
1283PLAN *
1284c_print(OPTION *option, char ***argvp __unused)
1285{
1286	isoutput = 1;
1287
1288	return palloc(option);
1289}
1290
1291/*
1292 * -print0 functions --
1293 *
1294 *	Always true, causes the current pathname to be written to
1295 *	standard output followed by a NUL character
1296 */
1297int
1298f_print0(PLAN *plan __unused, FTSENT *entry)
1299{
1300	fputs(entry->fts_path, stdout);
1301	fputc('\0', stdout);
1302	return 1;
1303}
1304
1305/* c_print0 is the same as c_print */
1306
1307/*
1308 * -prune functions --
1309 *
1310 *	Prune a portion of the hierarchy.
1311 */
1312int
1313f_prune(PLAN *plan __unused, FTSENT *entry)
1314{
1315	if (fts_set(tree, entry, FTS_SKIP))
1316		err(1, "%s", entry->fts_path);
1317	return 1;
1318}
1319
1320/* c_prune == c_simple */
1321
1322/*
1323 * -regex functions --
1324 *
1325 *	True if the whole path of the file matches pattern using
1326 *	regular expression.
1327 */
1328int
1329f_regex(PLAN *plan, FTSENT *entry)
1330{
1331	char *str;
1332	int len;
1333	regex_t *pre;
1334	regmatch_t pmatch;
1335	int errcode;
1336	char errbuf[LINE_MAX];
1337	int matched;
1338
1339	pre = plan->re_data;
1340	str = entry->fts_path;
1341	len = strlen(str);
1342	matched = 0;
1343
1344	pmatch.rm_so = 0;
1345	pmatch.rm_eo = len;
1346
1347	errcode = regexec(pre, str, 1, &pmatch, REG_STARTEND);
1348
1349	if (errcode != 0 && errcode != REG_NOMATCH) {
1350		regerror(errcode, pre, errbuf, sizeof errbuf);
1351		errx(1, "%s: %s",
1352		     plan->flags & F_IGNCASE ? "-iregex" : "-regex", errbuf);
1353	}
1354
1355	if (errcode == 0 && pmatch.rm_so == 0 && pmatch.rm_eo == len)
1356		matched = 1;
1357
1358	return matched;
1359}
1360
1361PLAN *
1362c_regex(OPTION *option, char ***argvp)
1363{
1364	PLAN *new;
1365	char *pattern;
1366	regex_t *pre;
1367	int errcode;
1368	char errbuf[LINE_MAX];
1369
1370	if ((pre = malloc(sizeof(regex_t))) == NULL)
1371		err(1, NULL);
1372
1373	pattern = nextarg(option, argvp);
1374
1375	if ((errcode = regcomp(pre, pattern,
1376	    regexp_flags | (option->flags & F_IGNCASE ? REG_ICASE : 0))) != 0) {
1377		regerror(errcode, pre, errbuf, sizeof errbuf);
1378		errx(1, "%s: %s: %s",
1379		     option->flags & F_IGNCASE ? "-iregex" : "-regex",
1380		     pattern, errbuf);
1381	}
1382
1383	new = palloc(option);
1384	new->re_data = pre;
1385
1386	return new;
1387}
1388
1389/* c_simple covers c_prune, c_openparen, c_closeparen, c_not, c_or, c_true, c_false */
1390
1391PLAN *
1392c_simple(OPTION *option, char ***argvp __unused)
1393{
1394	return palloc(option);
1395}
1396
1397/*
1398 * -size n[c] functions --
1399 *
1400 *	True if the file size in bytes, divided by an implementation defined
1401 *	value and rounded up to the next integer, is n.  If n is followed by
1402 *      one of c k M G T P, the size is in bytes, kilobytes,
1403 *      megabytes, gigabytes, terabytes or petabytes respectively.
1404 */
1405#define	FIND_SIZE	512
1406static int divsize = 1;
1407
1408int
1409f_size(PLAN *plan, FTSENT *entry)
1410{
1411	off_t size;
1412
1413	size = divsize ? (entry->fts_statp->st_size + FIND_SIZE - 1) /
1414	    FIND_SIZE : entry->fts_statp->st_size;
1415	COMPARE(size, plan->o_data);
1416}
1417
1418PLAN *
1419c_size(OPTION *option, char ***argvp)
1420{
1421	char *size_str;
1422	PLAN *new;
1423	char endch;
1424	off_t scale;
1425
1426	size_str = nextarg(option, argvp);
1427	ftsoptions &= ~FTS_NOSTAT;
1428
1429	new = palloc(option);
1430	endch = 'c';
1431	new->o_data = find_parsenum(new, option->name, size_str, &endch);
1432	if (endch != '\0') {
1433		divsize = 0;
1434
1435		switch (endch) {
1436		case 'c':                       /* characters */
1437			scale = 0x1LL;
1438			break;
1439		case 'k':                       /* kilobytes 1<<10 */
1440			scale = 0x400LL;
1441			break;
1442		case 'M':                       /* megabytes 1<<20 */
1443			scale = 0x100000LL;
1444			break;
1445		case 'G':                       /* gigabytes 1<<30 */
1446			scale = 0x40000000LL;
1447			break;
1448		case 'T':                       /* terabytes 1<<40 */
1449			scale = 0x1000000000LL;
1450			break;
1451		case 'P':                       /* petabytes 1<<50 */
1452			scale = 0x4000000000000LL;
1453			break;
1454		default:
1455			errx(1, "%s: %s: illegal trailing character",
1456				option->name, size_str);
1457			break;
1458		}
1459		if (new->o_data > QUAD_MAX / scale)
1460			errx(1, "%s: %s: value too large",
1461				option->name, size_str);
1462		new->o_data *= scale;
1463	}
1464	return new;
1465}
1466
1467/*
1468 * -type c functions --
1469 *
1470 *	True if the type of the file is c, where c is b, c, d, p, f or w
1471 *	for block special file, character special file, directory, FIFO,
1472 *	regular file or whiteout respectively.
1473 */
1474int
1475f_type(PLAN *plan, FTSENT *entry)
1476{
1477	return (entry->fts_statp->st_mode & S_IFMT) == plan->m_data;
1478}
1479
1480PLAN *
1481c_type(OPTION *option, char ***argvp)
1482{
1483	char *typestring;
1484	PLAN *new;
1485	mode_t  mask;
1486
1487	typestring = nextarg(option, argvp);
1488	ftsoptions &= ~FTS_NOSTAT;
1489
1490	switch (typestring[0]) {
1491	case 'b':
1492		mask = S_IFBLK;
1493		break;
1494	case 'c':
1495		mask = S_IFCHR;
1496		break;
1497	case 'd':
1498		mask = S_IFDIR;
1499		break;
1500	case 'f':
1501		mask = S_IFREG;
1502		break;
1503	case 'l':
1504		mask = S_IFLNK;
1505		break;
1506	case 'p':
1507		mask = S_IFIFO;
1508		break;
1509	case 's':
1510		mask = S_IFSOCK;
1511		break;
1512#ifdef FTS_WHITEOUT
1513	case 'w':
1514		mask = S_IFWHT;
1515		ftsoptions |= FTS_WHITEOUT;
1516		break;
1517#endif /* FTS_WHITEOUT */
1518	default:
1519		errx(1, "%s: %s: unknown type", option->name, typestring);
1520	}
1521
1522	new = palloc(option);
1523	new->m_data = mask;
1524	return new;
1525}
1526
1527/*
1528 * -user uname functions --
1529 *
1530 *	True if the file belongs to the user uname.  If uname is numeric and
1531 *	an equivalent of the getpwnam() S9.2.2 [POSIX.1] function does not
1532 *	return a valid user name, uname is taken as a user ID.
1533 */
1534int
1535f_user(PLAN *plan, FTSENT *entry)
1536{
1537	COMPARE(entry->fts_statp->st_uid, plan->u_data);
1538}
1539
1540PLAN *
1541c_user(OPTION *option, char ***argvp)
1542{
1543	char *username;
1544	PLAN *new;
1545	struct passwd *p;
1546	uid_t uid;
1547
1548	username = nextarg(option, argvp);
1549	ftsoptions &= ~FTS_NOSTAT;
1550
1551	new = palloc(option);
1552	p = getpwnam(username);
1553	if (p == NULL) {
1554		char* cp = username;
1555		if( username[0] == '-' || username[0] == '+' )
1556			username++;
1557		uid = atoi(username);
1558		if (uid == 0 && username[0] != '0')
1559			errx(1, "%s: %s: no such user", option->name, username);
1560		uid = find_parsenum(new, option->name, cp, NULL);
1561	} else
1562		uid = p->pw_uid;
1563
1564	new->u_data = uid;
1565	return new;
1566}
1567
1568/*
1569 * -xdev functions --
1570 *
1571 *	Always true, causes find not to descend past directories that have a
1572 *	different device ID (st_dev, see stat() S5.6.2 [POSIX.1])
1573 */
1574PLAN *
1575c_xdev(OPTION *option, char ***argvp __unused)
1576{
1577	ftsoptions |= FTS_XDEV;
1578
1579	return palloc(option);
1580}
1581
1582/*
1583 * ( expression ) functions --
1584 *
1585 *	True if expression is true.
1586 */
1587int
1588f_expr(PLAN *plan, FTSENT *entry)
1589{
1590	PLAN *p;
1591	int state = 0;
1592
1593	for (p = plan->p_data[0];
1594	    p && (state = (p->execute)(p, entry)); p = p->next);
1595	return state;
1596}
1597
1598/*
1599 * f_openparen and f_closeparen nodes are temporary place markers.  They are
1600 * eliminated during phase 2 of find_formplan() --- the '(' node is converted
1601 * to a f_expr node containing the expression and the ')' node is discarded.
1602 * The functions themselves are only used as constants.
1603 */
1604
1605int
1606f_openparen(PLAN *plan __unused, FTSENT *entry __unused)
1607{
1608	abort();
1609}
1610
1611int
1612f_closeparen(PLAN *plan __unused, FTSENT *entry __unused)
1613{
1614	abort();
1615}
1616
1617/* c_openparen == c_simple */
1618/* c_closeparen == c_simple */
1619
1620/*
1621 * AND operator. Since AND is implicit, no node is allocated.
1622 */
1623PLAN *
1624c_and(OPTION *option __unused, char ***argvp __unused)
1625{
1626	return NULL;
1627}
1628
1629/*
1630 * ! expression functions --
1631 *
1632 *	Negation of a primary; the unary NOT operator.
1633 */
1634int
1635f_not(PLAN *plan, FTSENT *entry)
1636{
1637	PLAN *p;
1638	int state = 0;
1639
1640	for (p = plan->p_data[0];
1641	    p && (state = (p->execute)(p, entry)); p = p->next);
1642	return !state;
1643}
1644
1645/* c_not == c_simple */
1646
1647/*
1648 * expression -o expression functions --
1649 *
1650 *	Alternation of primaries; the OR operator.  The second expression is
1651 * not evaluated if the first expression is true.
1652 */
1653int
1654f_or(PLAN *plan, FTSENT *entry)
1655{
1656	PLAN *p;
1657	int state = 0;
1658
1659	for (p = plan->p_data[0];
1660	    p && (state = (p->execute)(p, entry)); p = p->next);
1661
1662	if (state)
1663		return 1;
1664
1665	for (p = plan->p_data[1];
1666	    p && (state = (p->execute)(p, entry)); p = p->next);
1667	return state;
1668}
1669
1670/* c_or == c_simple */
1671
1672/*
1673 * -false
1674 *
1675 *	Always false.
1676 */
1677int
1678f_false(PLAN *plan __unused, FTSENT *entry __unused)
1679{
1680	return 0;
1681}
1682
1683/* c_false == c_simple */
1684
1685/*
1686 * -quit
1687 *
1688 *	Exits the program
1689 */
1690int
1691f_quit(PLAN *plan __unused, FTSENT *entry __unused)
1692{
1693	exit(0);
1694}
1695
1696/* c_quit == c_simple */
1697