Annotation of src/usr.bin/find/find.c, Revision 1.9
1.9 ! millert 1: /* $OpenBSD: find.c,v 1.8 2001/11/17 19:50:53 millert Exp $ */
1.2 deraadt 2:
1.1 deraadt 3: /*-
4: * Copyright (c) 1991, 1993
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.
1.9 ! millert 18: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 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: #ifndef lint
36: /*static char sccsid[] = "from: @(#)find.c 8.1 (Berkeley) 6/6/93";*/
1.9 ! millert 37: static char rcsid[] = "$OpenBSD: find.c,v 1.8 2001/11/17 19:50:53 millert Exp $";
1.1 deraadt 38: #endif /* not lint */
39:
40: #include <sys/types.h>
41: #include <sys/stat.h>
42:
43: #include <err.h>
44: #include <errno.h>
45: #include <fts.h>
1.8 millert 46: #include <signal.h>
1.1 deraadt 47: #include <stdio.h>
48: #include <string.h>
49: #include <stdlib.h>
50:
51: #include "find.h"
52:
53: /*
54: * find_formplan --
55: * process the command line and create a "plan" corresponding to the
56: * command arguments.
57: */
58: PLAN *
59: find_formplan(argv)
60: char **argv;
61: {
62: PLAN *plan, *tail, *new;
63:
64: /*
65: * for each argument in the command line, determine what kind of node
66: * it is, create the appropriate node type and add the new plan node
67: * to the end of the existing plan. The resulting plan is a linked
68: * list of plan nodes. For example, the string:
69: *
70: * % find . -name foo -newer bar -print
71: *
72: * results in the plan:
73: *
74: * [-name foo]--> [-newer bar]--> [-print]
75: *
76: * in this diagram, `[-name foo]' represents the plan node generated
77: * by c_name() with an argument of foo and `-->' represents the
78: * plan->next pointer.
79: */
80: for (plan = tail = NULL; *argv;) {
81: if (!(new = find_create(&argv)))
82: continue;
83: if (plan == NULL)
84: tail = plan = new;
85: else {
86: tail->next = new;
87: tail = new;
88: }
89: }
90:
91: /*
92: * if the user didn't specify one of -print, -ok or -exec, then -print
93: * is assumed so we bracket the current expression with parens, if
94: * necessary, and add a -print node on the end.
95: */
96: if (!isoutput) {
97: if (plan == NULL) {
98: new = c_print();
99: tail = plan = new;
100: } else {
101: new = c_openparen();
102: new->next = plan;
103: plan = new;
104: new = c_closeparen();
105: tail->next = new;
106: tail = new;
107: new = c_print();
108: tail->next = new;
109: tail = new;
110: }
111: }
112:
113: /*
114: * the command line has been completely processed into a search plan
115: * except for the (, ), !, and -o operators. Rearrange the plan so
116: * that the portions of the plan which are affected by the operators
117: * are moved into operator nodes themselves. For example:
118: *
119: * [!]--> [-name foo]--> [-print]
120: *
121: * becomes
122: *
123: * [! [-name foo] ]--> [-print]
124: *
125: * and
126: *
127: * [(]--> [-depth]--> [-name foo]--> [)]--> [-print]
128: *
129: * becomes
130: *
131: * [expr [-depth]-->[-name foo] ]--> [-print]
132: *
133: * operators are handled in order of precedence.
134: */
135:
136: plan = paren_squish(plan); /* ()'s */
137: plan = not_squish(plan); /* !'s */
138: plan = or_squish(plan); /* -o's */
139: return (plan);
140: }
141:
142: FTS *tree; /* pointer to top of FTS hierarchy */
143:
144: /*
145: * find_execute --
146: * take a search plan and an array of search paths and executes the plan
147: * over all FTSENT's returned for the given search paths.
148: */
1.3 tholo 149:
150: FTSENT *entry; /* shared with SIGINFO handler */
151:
1.1 deraadt 152: void
153: find_execute(plan, paths)
154: PLAN *plan; /* search plan */
155: char **paths; /* array of pathnames to traverse */
156: {
1.8 millert 157: sigset_t fullset, oset;
1.1 deraadt 158: PLAN *p;
159:
1.4 kstailey 160: if (!(tree = fts_open(paths, ftsoptions, NULL)))
1.1 deraadt 161: err(1, "ftsopen");
162:
1.8 millert 163: sigfillset(&fullset);
164: for (;;) {
165: (void)sigprocmask(SIG_BLOCK, &fullset, &oset);
166: entry = fts_read(tree);
167: (void)sigprocmask(SIG_SETMASK, &oset, NULL);
168: if (entry == NULL)
169: break;
170:
1.6 millert 171: switch (entry->fts_info) {
1.1 deraadt 172: case FTS_D:
173: if (isdepth)
174: continue;
175: break;
176: case FTS_DP:
177: if (!isdepth)
178: continue;
179: break;
180: case FTS_DNR:
181: case FTS_ERR:
182: case FTS_NS:
183: (void)fflush(stdout);
184: warn("%s", entry->fts_path);
185: continue;
186: }
187: #define BADCH " \t\n\\'\""
188: if (isxargs && strpbrk(entry->fts_path, BADCH)) {
189: (void)fflush(stdout);
190: warnx("%s: illegal path", entry->fts_path);
191: continue;
192: }
1.6 millert 193:
194: /*
195: * Call all the functions in the execution plan until one is
1.1 deraadt 196: * false or all have been executed. This is where we do all
197: * the work specified by the user on the command line.
198: */
1.6 millert 199: for (p = plan; p && (p->eval)(p, entry); p = p->next)
200: ;
1.1 deraadt 201: }
202: (void)fts_close(tree);
203: }
![[BACK]](/icons/back.gif){kind=icon}
Return to find.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / find