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