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