1 /*- 2 * Copyright (c) 1991, 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 static char sccsid[] = "@(#)find.c 8.5 (Berkeley) 8/5/94"; 39 #endif /* not lint */ 40 41 #include <sys/types.h> 42 #include <sys/stat.h> 43 44 #include <err.h> 45 #include <errno.h> 46 #include <fts.h> 47 #include <stdio.h> 48 #include <string.h> 49 #include <stdlib.h> 50 51 #include "find.h" 52 53 static int find_compare __P((const FTSENT **s1, const FTSENT **s2)); 54 55 /* 56 * find_compare -- 57 * tell fts_open() how to order the traversal of the hierarchy. 58 * This variant gives lexicographical order, i.e., alphabetical 59 * order within each directory. 60 */ 61 static int 62 find_compare(s1, s2) 63 const FTSENT **s1, **s2; 64 { 65 66 return (strcoll((*s1)->fts_name, (*s2)->fts_name)); 67 } 68 69 /* 70 * find_formplan -- 71 * process the command line and create a "plan" corresponding to the 72 * command arguments. 73 */ 74 PLAN * 75 find_formplan(argv) 76 char **argv; 77 { 78 PLAN *plan, *tail, *new; 79 80 /* 81 * for each argument in the command line, determine what kind of node 82 * it is, create the appropriate node type and add the new plan node 83 * to the end of the existing plan. The resulting plan is a linked 84 * list of plan nodes. For example, the string: 85 * 86 * % find . -name foo -newer bar -print 87 * 88 * results in the plan: 89 * 90 * [-name foo]--> [-newer bar]--> [-print] 91 * 92 * in this diagram, `[-name foo]' represents the plan node generated 93 * by c_name() with an argument of foo and `-->' represents the 94 * plan->next pointer. 95 */ 96 for (plan = tail = NULL; *argv;) { 97 if (!(new = find_create(&argv))) 98 continue; 99 if (plan == NULL) 100 tail = plan = new; 101 else { 102 tail->next = new; 103 tail = new; 104 } 105 } 106 107 /* 108 * if the user didn't specify one of -print, -ok or -exec, then -print 109 * is assumed so we bracket the current expression with parens, if 110 * necessary, and add a -print node on the end. 111 */ 112 if (!isoutput) { 113 if (plan == NULL) { 114 new = c_print(); 115 tail = plan = new; 116 } else { 117 new = c_openparen(); 118 new->next = plan; 119 plan = new; 120 new = c_closeparen(); 121 tail->next = new; 122 tail = new; 123 new = c_print(); 124 tail->next = new; 125 tail = new; 126 } 127 } 128 129 /* 130 * the command line has been completely processed into a search plan 131 * except for the (, ), !, and -o operators. Rearrange the plan so 132 * that the portions of the plan which are affected by the operators 133 * are moved into operator nodes themselves. For example: 134 * 135 * [!]--> [-name foo]--> [-print] 136 * 137 * becomes 138 * 139 * [! [-name foo] ]--> [-print] 140 * 141 * and 142 * 143 * [(]--> [-depth]--> [-name foo]--> [)]--> [-print] 144 * 145 * becomes 146 * 147 * [expr [-depth]-->[-name foo] ]--> [-print] 148 * 149 * operators are handled in order of precedence. 150 */ 151 152 plan = paren_squish(plan); /* ()'s */ 153 plan = not_squish(plan); /* !'s */ 154 plan = or_squish(plan); /* -o's */ 155 return (plan); 156 } 157 158 FTS *tree; /* pointer to top of FTS hierarchy */ 159 160 /* 161 * find_execute -- 162 * take a search plan and an array of search paths and executes the plan 163 * over all FTSENT's returned for the given search paths. 164 */ 165 int 166 find_execute(plan, paths) 167 PLAN *plan; /* search plan */ 168 char **paths; /* array of pathnames to traverse */ 169 { 170 register FTSENT *entry; 171 PLAN *p; 172 int rval; 173 174 tree = fts_open(paths, ftsoptions, (issort ? find_compare : NULL)); 175 if (tree == NULL) 176 err(1, "ftsopen"); 177 178 for (rval = 0; (entry = fts_read(tree)) != NULL;) { 179 switch (entry->fts_info) { 180 case FTS_D: 181 if (isdepth) 182 continue; 183 break; 184 case FTS_DP: 185 if (!isdepth) 186 continue; 187 break; 188 case FTS_DNR: 189 case FTS_ERR: 190 case FTS_NS: 191 (void)fflush(stdout); 192 warnx("%s: %s", 193 entry->fts_path, strerror(entry->fts_errno)); 194 rval = 1; 195 continue; 196 #ifdef FTS_W 197 case FTS_W: 198 continue; 199 #endif /* FTS_W */ 200 } 201 #define BADCH " \t\n\\'\"" 202 if (isxargs && strpbrk(entry->fts_path, BADCH)) { 203 (void)fflush(stdout); 204 warnx("%s: illegal path", entry->fts_path); 205 rval = 1; 206 continue; 207 } 208 209 /* 210 * Call all the functions in the execution plan until one is 211 * false or all have been executed. This is where we do all 212 * the work specified by the user on the command line. 213 */ 214 for (p = plan; p && (p->eval)(p, entry); p = p->next); 215 } 216 if (errno) 217 err(1, "fts_read"); 218 return (rval); 219 } 220