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