1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1990, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Cimarron D. Taylor of the University of California, Berkeley.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 */
34
35 #include <sys/types.h>
36 #include <sys/acl.h>
37 #include <sys/stat.h>
38
39 #include <err.h>
40 #include <fts.h>
41 #include <regex.h>
42 #include <stdio.h>
43 #include <stdlib.h>
44 #include <string.h>
45
46 #include "find.h"
47
48 static int typecompare(const void *, const void *);
49
50 /* NB: the following table must be sorted lexically. */
51 /* Options listed with C++ comments are in gnu find, but not our find */
52 static OPTION const options[] = {
53 { "!", c_simple, f_not, 0 },
54 { "(", c_simple, f_openparen, 0 },
55 { ")", c_simple, f_closeparen, 0 },
56 #if HAVE_STRUCT_STAT_ST_BIRTHTIME
57 { "-Bmin", c_Xmin, f_Xmin, F_TIME_B },
58 { "-Bnewer", c_newer, f_newer, F_TIME_B },
59 { "-Btime", c_Xtime, f_Xtime, F_TIME_B },
60 #endif
61 { "-a", c_and, NULL, 0 },
62 #ifdef ACL_TYPE_NFS4
63 { "-acl", c_acl, f_acl, 0 },
64 #endif
65 { "-amin", c_Xmin, f_Xmin, F_TIME_A },
66 { "-and", c_and, NULL, 0 },
67 { "-anewer", c_newer, f_newer, F_TIME_A },
68 { "-atime", c_Xtime, f_Xtime, F_TIME_A },
69 { "-cmin", c_Xmin, f_Xmin, F_TIME_C },
70 { "-cnewer", c_newer, f_newer, F_TIME_C },
71 { "-ctime", c_Xtime, f_Xtime, F_TIME_C },
72 { "-d", c_depth, f_depth, 0 },
73 // -daystart
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 { "-executable", c_simple, f_executable, 0 },
80 { "-false", c_simple, f_false, 0 },
81 #if HAVE_STRUCT_STAT_ST_FLAGS
82 { "-flags", c_flags, f_flags, 0 },
83 #endif
84 // -fls
85 { "-follow", c_follow, f_always_true, 0 },
86 // -fprint
87 // -fprint0
88 // -fprintf
89 #if HAVE_STRUCT_STATFS_F_FSTYPENAME
90 { "-fstype", c_fstype, f_fstype, 0 },
91 #endif
92 { "-gid", c_group, f_group, 0 },
93 { "-group", c_group, f_group, 0 },
94 { "-ignore_readdir_race",c_ignore_readdir_race, f_always_true,0 },
95 { "-ilname", c_name, f_name, F_LINK | F_IGNCASE },
96 { "-iname", c_name, f_name, F_IGNCASE },
97 { "-inum", c_inum, f_inum, 0 },
98 { "-ipath", c_name, f_path, F_IGNCASE },
99 { "-iregex", c_regex, f_regex, F_IGNCASE },
100 { "-iwholename",c_name, f_path, F_IGNCASE },
101 { "-links", c_links, f_links, 0 },
102 { "-lname", c_name, f_name, F_LINK },
103 { "-ls", c_ls, f_ls, 0 },
104 { "-maxdepth", c_mXXdepth, f_always_true, F_MAXDEPTH },
105 { "-mindepth", c_mXXdepth, f_always_true, 0 },
106 { "-mmin", c_Xmin, f_Xmin, 0 },
107 { "-mnewer", c_newer, f_newer, 0 },
108 { "-mount", c_xdev, f_always_true, 0 },
109 { "-mtime", c_Xtime, f_Xtime, 0 },
110 { "-name", c_name, f_name, 0 },
111 { "-newer", c_newer, f_newer, 0 },
112 #if HAVE_STRUCT_STAT_ST_BIRTHTIME
113 { "-newerBB", c_newer, f_newer, F_TIME_B | F_TIME2_B },
114 { "-newerBa", c_newer, f_newer, F_TIME_B | F_TIME2_A },
115 { "-newerBc", c_newer, f_newer, F_TIME_B | F_TIME2_C },
116 { "-newerBm", c_newer, f_newer, F_TIME_B },
117 { "-newerBt", c_newer, f_newer, F_TIME_B | F_TIME2_T },
118 { "-neweraB", c_newer, f_newer, F_TIME_A | F_TIME2_B },
119 #endif
120 { "-neweraa", c_newer, f_newer, F_TIME_A | F_TIME2_A },
121 { "-newerac", c_newer, f_newer, F_TIME_A | F_TIME2_C },
122 { "-neweram", c_newer, f_newer, F_TIME_A },
123 { "-newerat", c_newer, f_newer, F_TIME_A | F_TIME2_T },
124 #if HAVE_STRUCT_STAT_ST_BIRTHTIME
125 { "-newercB", c_newer, f_newer, F_TIME_C | F_TIME2_B },
126 #endif
127 { "-newerca", c_newer, f_newer, F_TIME_C | F_TIME2_A },
128 { "-newercc", c_newer, f_newer, F_TIME_C | F_TIME2_C },
129 { "-newercm", c_newer, f_newer, F_TIME_C },
130 { "-newerct", c_newer, f_newer, F_TIME_C | F_TIME2_T },
131 #if HAVE_STRUCT_STAT_ST_BIRTHTIME
132 { "-newermB", c_newer, f_newer, F_TIME2_B },
133 #endif
134 { "-newerma", c_newer, f_newer, F_TIME2_A },
135 { "-newermc", c_newer, f_newer, F_TIME2_C },
136 { "-newermm", c_newer, f_newer, 0 },
137 { "-newermt", c_newer, f_newer, F_TIME2_T },
138 { "-nogroup", c_nogroup, f_nogroup, 0 },
139 { "-noignore_readdir_race",c_ignore_readdir_race, f_always_true,0 },
140 { "-noleaf", c_simple, f_always_true, 0 },
141 { "-not", c_simple, f_not, 0 },
142 { "-nouser", c_nouser, f_nouser, 0 },
143 { "-o", c_simple, f_or, 0 },
144 { "-ok", c_exec, f_exec, F_NEEDOK },
145 { "-okdir", c_exec, f_exec, F_NEEDOK | F_EXECDIR },
146 { "-or", c_simple, f_or, 0 },
147 { "-path", c_name, f_path, 0 },
148 { "-perm", c_perm, f_perm, 0 },
149 { "-print", c_print, f_print, 0 },
150 { "-print0", c_print, f_print0, 0 },
151 // -printf
152 { "-prune", c_simple, f_prune, 0 },
153 { "-quit", c_simple, f_quit, 0 },
154 { "-readable", c_simple, f_readable, 0 },
155 { "-regex", c_regex, f_regex, 0 },
156 { "-samefile", c_samefile, f_inum, 0 },
157 { "-size", c_size, f_size, 0 },
158 { "-sparse", c_sparse, f_sparse, 0 },
159 { "-true", c_simple, f_always_true, 0 },
160 { "-type", c_type, f_type, 0 },
161 { "-uid", c_user, f_user, 0 },
162 { "-user", c_user, f_user, 0 },
163 { "-wholename", c_name, f_path, 0 },
164 { "-writable", c_simple, f_writable, 0 },
165 { "-xdev", c_xdev, f_always_true, 0 },
166 // -xtype
167 };
168
169 /*
170 * find_create --
171 * create a node corresponding to a command line argument.
172 *
173 * TODO:
174 * add create/process function pointers to node, so we can skip
175 * this switch stuff.
176 */
177 PLAN *
find_create(char *** argvp)178 find_create(char ***argvp)
179 {
180 OPTION *p;
181 PLAN *new;
182 char **argv;
183
184 argv = *argvp;
185
186 if ((p = lookup_option(*argv)) == NULL)
187 errx(1, "%s: unknown primary or operator", *argv);
188 ++argv;
189
190 new = (p->create)(p, &argv);
191 *argvp = argv;
192 return (new);
193 }
194
195 OPTION *
lookup_option(const char * name)196 lookup_option(const char *name)
197 {
198 OPTION tmp;
199
200 tmp.name = name;
201 return ((OPTION *)bsearch(&tmp, options,
202 sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare));
203 }
204
205 static int
typecompare(const void * a,const void * b)206 typecompare(const void *a, const void *b)
207 {
208 return (strcmp(((const OPTION *)a)->name, ((const OPTION *)b)->name));
209 }
210