2 * Copyright (c) 1991, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Cimarron D. Taylor of the University of California, Berkeley.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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.
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
39 static char sccsid[] = "@(#)find.c 8.5 (Berkeley) 8/5/94";
41 static const char rcsid[] =
46 #include <sys/types.h>
58 static int find_compare __P((const FTSENT **s1, const FTSENT **s2));
62 * tell fts_open() how to order the traversal of the hierarchy.
63 * This variant gives lexicographical order, i.e., alphabetical
64 * order within each directory.
68 const FTSENT **s1, **s2;
71 return (strcoll((*s1)->fts_name, (*s2)->fts_name));
76 * process the command line and create a "plan" corresponding to the
83 PLAN *plan, *tail, *new;
86 * for each argument in the command line, determine what kind of node
87 * it is, create the appropriate node type and add the new plan node
88 * to the end of the existing plan. The resulting plan is a linked
89 * list of plan nodes. For example, the string:
91 * % find . -name foo -newer bar -print
93 * results in the plan:
95 * [-name foo]--> [-newer bar]--> [-print]
97 * in this diagram, `[-name foo]' represents the plan node generated
98 * by c_name() with an argument of foo and `-->' represents the
101 for (plan = tail = NULL; *argv;) {
102 if (!(new = find_create(&argv)))
113 * if the user didn't specify one of -print, -ok or -exec, then -print
114 * is assumed so we bracket the current expression with parens, if
115 * necessary, and add a -print node on the end.
125 new = c_closeparen();
135 * the command line has been completely processed into a search plan
136 * except for the (, ), !, and -o operators. Rearrange the plan so
137 * that the portions of the plan which are affected by the operators
138 * are moved into operator nodes themselves. For example:
140 * [!]--> [-name foo]--> [-print]
144 * [! [-name foo] ]--> [-print]
148 * [(]--> [-depth]--> [-name foo]--> [)]--> [-print]
152 * [expr [-depth]-->[-name foo] ]--> [-print]
154 * operators are handled in order of precedence.
157 plan = paren_squish(plan); /* ()'s */
158 plan = not_squish(plan); /* !'s */
159 plan = or_squish(plan); /* -o's */
163 FTS *tree; /* pointer to top of FTS hierarchy */
167 * take a search plan and an array of search paths and executes the plan
168 * over all FTSENT's returned for the given search paths.
171 find_execute(plan, paths)
172 PLAN *plan; /* search plan */
173 char **paths; /* array of pathnames to traverse */
175 register FTSENT *entry;
179 tree = fts_open(paths, ftsoptions, (issort ? find_compare : NULL));
183 for (rval = 0; (entry = fts_read(tree)) != NULL;) {
184 switch (entry->fts_info) {
196 (void)fflush(stdout);
198 entry->fts_path, strerror(entry->fts_errno));
206 #define BADCH " \t\n\\'\""
207 if (isxargs && strpbrk(entry->fts_path, BADCH)) {
208 (void)fflush(stdout);
209 warnx("%s: illegal path", entry->fts_path);
214 if (mindepth != -1 && entry->fts_level < mindepth)
218 * Call all the functions in the execution plan until one is
219 * false or all have been executed. This is where we do all
220 * the work specified by the user on the command line.
222 for (p = plan; p && (p->eval)(p, entry); p = p->next);
224 if (maxdepth != -1 && entry->fts_level >= maxdepth) {
225 if (fts_set(tree, entry, FTS_SKIP))
226 err(1, "%s", entry->fts_path);