option.c revision 157555 
1/*-
2 * Copyright (c) 1990, 1993, 1994
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/*
39static char sccsid[] = "@(#)option.c	8.2 (Berkeley) 4/16/94";
40*/
41#endif /* not lint */
42
43#include <sys/cdefs.h>
44__FBSDID("$FreeBSD: head/usr.bin/find/option.c 157555 2006-04-05 23:06:11Z ceri $");
45
46#include <sys/types.h>
47#include <sys/stat.h>
48
49#include <err.h>
50#include <fts.h>
51#include <regex.h>
52#include <stdio.h>
53#include <stdlib.h>
54#include <string.h>
55
56#include "find.h"
57
58int typecompare(const void *, const void *);
59
60/* NB: the following table must be sorted lexically. */
61static OPTION const options[] = {
62	{ "!",		c_simple,	f_not,		0 },
63	{ "(",		c_simple,	f_openparen,	0 },
64	{ ")",		c_simple,	f_closeparen,	0 },
65	{ "-Bmin",	c_Xmin,		f_Xmin,		F_TIME_B },
66	{ "-Bnewer",	c_newer,	f_newer,	F_TIME_B },
67	{ "-Btime",	c_Xtime,	f_Xtime,	F_TIME_B },
68	{ "-a",		c_and,		NULL,		0 },
69	{ "-acl",	c_acl,		f_acl,		0 },
70	{ "-amin",	c_Xmin,		f_Xmin,		F_TIME_A },
71	{ "-and",	c_and,		NULL,		0 },
72	{ "-anewer",	c_newer,	f_newer,	F_TIME_A },
73	{ "-atime",	c_Xtime,	f_Xtime,	F_TIME_A },
74	{ "-cmin",	c_Xmin,		f_Xmin,		F_TIME_C },
75	{ "-cnewer",	c_newer,	f_newer,	F_TIME_C },
76	{ "-ctime",	c_Xtime,	f_Xtime,	F_TIME_C },
77	{ "-delete",	c_delete,	f_delete,	0 },
78	{ "-depth",	c_depth,	f_depth,	0 },
79	{ "-empty",	c_empty,	f_empty,	0 },
80	{ "-exec",	c_exec,		f_exec,		0 },
81	{ "-execdir",	c_exec,		f_exec,		F_EXECDIR },
82	{ "-false",	c_simple,	f_not,		0 },
83	{ "-flags",	c_flags,	f_flags,	0 },
84	{ "-follow",	c_follow,	f_always_true,	0 },
85	{ "-fstype",	c_fstype,	f_fstype,	0 },
86	{ "-group",	c_group,	f_group,	0 },
87	{ "-iname",	c_name,		f_name,		F_IGNCASE },
88	{ "-inum",	c_inum,		f_inum,		0 },
89	{ "-ipath",	c_name,		f_path,		F_IGNCASE },
90	{ "-iregex",	c_regex,	f_regex,	F_IGNCASE },
91	{ "-links",	c_links,	f_links,	0 },
92	{ "-ls",	c_ls,		f_ls,		0 },
93	{ "-maxdepth",	c_mXXdepth,	f_always_true,	F_MAXDEPTH },
94	{ "-mindepth",	c_mXXdepth,	f_always_true,	0 },
95	{ "-mmin",	c_Xmin,		f_Xmin,		0 },
96	{ "-mnewer",	c_newer,	f_newer,	0 },
97	{ "-mtime",	c_Xtime,	f_Xtime,	0 },
98	{ "-name",	c_name,		f_name,		0 },
99	{ "-newer",	c_newer,	f_newer,	0 },
100	{ "-newerBB",	c_newer,	f_newer,	F_TIME_B | F_TIME2_B },
101	{ "-newerBa",	c_newer,	f_newer,	F_TIME_B | F_TIME2_A },
102	{ "-newerBc",	c_newer,	f_newer,	F_TIME_B | F_TIME2_C },
103	{ "-newerBm",	c_newer,	f_newer,	F_TIME_B },
104	{ "-newerBt",	c_newer,	f_newer,	F_TIME_B | F_TIME2_T },
105	{ "-neweraB",	c_newer,	f_newer,	F_TIME_A | F_TIME2_B },
106	{ "-neweraa",	c_newer,	f_newer,	F_TIME_A | F_TIME2_A },
107	{ "-newerac",	c_newer,	f_newer,	F_TIME_A | F_TIME2_C },
108	{ "-neweram",	c_newer,	f_newer,	F_TIME_A },
109	{ "-newerat",	c_newer,	f_newer,	F_TIME_A | F_TIME2_T },
110	{ "-newercB",	c_newer,	f_newer,	F_TIME_C | F_TIME2_B },
111	{ "-newerca",	c_newer,	f_newer,	F_TIME_C | F_TIME2_A },
112	{ "-newercc",	c_newer,	f_newer,	F_TIME_C | F_TIME2_C },
113	{ "-newercm",	c_newer,	f_newer,	F_TIME_C },
114	{ "-newerct",	c_newer,	f_newer,	F_TIME_C | F_TIME2_T },
115	{ "-newermB",	c_newer,	f_newer,	F_TIME2_B },
116	{ "-newerma",	c_newer,	f_newer,	F_TIME2_A },
117	{ "-newermc",	c_newer,	f_newer,	F_TIME2_C },
118	{ "-newermm",	c_newer,	f_newer,	0 },
119	{ "-newermt",	c_newer,	f_newer,	F_TIME2_T },
120	{ "-nogroup",	c_nogroup,	f_nogroup,	0 },
121	{ "-not",	c_simple,	f_not,		0 },
122	{ "-nouser",	c_nouser,	f_nouser,	0 },
123	{ "-o",		c_simple,	f_or,		0 },
124	{ "-ok",	c_exec,		f_exec,		F_NEEDOK },
125	{ "-okdir",	c_exec,		f_exec,		F_NEEDOK | F_EXECDIR },
126	{ "-or",	c_simple,	f_or,		0 },
127	{ "-path", 	c_name,		f_path,		0 },
128	{ "-perm",	c_perm,		f_perm,		0 },
129	{ "-print",	c_print,	f_print,	0 },
130	{ "-print0",	c_print,	f_print0,	0 },
131	{ "-prune",	c_simple,	f_prune,	0 },
132	{ "-regex",	c_regex,	f_regex,	0 },
133	{ "-size",	c_size,		f_size,		0 },
134	{ "-type",	c_type,		f_type,		0 },
135	{ "-user",	c_user,		f_user,		0 },
136	{ "-xdev",	c_xdev,		f_always_true,	0 },
137};
138
139/*
140 * find_create --
141 *	create a node corresponding to a command line argument.
142 *
143 * TODO:
144 *	add create/process function pointers to node, so we can skip
145 *	this switch stuff.
146 */
147PLAN *
148find_create(char ***argvp)
149{
150	OPTION *p;
151	PLAN *new;
152	char **argv;
153
154	argv = *argvp;
155
156	if ((p = lookup_option(*argv)) == NULL)
157		errx(1, "%s: unknown option", *argv);
158	++argv;
159
160	new = (p->create)(p, &argv);
161	*argvp = argv;
162	return (new);
163}
164
165OPTION *
166lookup_option(const char *name)
167{
168	OPTION tmp;
169
170	tmp.name = name;
171	return ((OPTION *)bsearch(&tmp, options,
172	    sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare));
173}
174
175int
176typecompare(const void *a, const void *b)
177{
178	return (strcmp(((const OPTION *)a)->name, ((const OPTION *)b)->name));
179}
180