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.17 2004/05/28 17:17:15 eik Exp $ 38 */ 39 40 #include <sys/types.h> 41 #include <sys/stat.h> 42 43 #include <err.h> 44 #include <errno.h> 45 #include <fts.h> 46 #include <regex.h> 47 #include <stdio.h> 48 #include <stdlib.h> 49 #include <string.h> 50 51 #include "find.h" 52 53 static int find_compare(const FTSENT * const *s1, const FTSENT * const *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(const FTSENT * const *s1, const FTSENT * const *s2) 63 { 64 65 return (strcoll((*s1)->fts_name, (*s2)->fts_name)); 66 } 67 68 /* 69 * find_formplan -- 70 * process the command line and create a "plan" corresponding to the 71 * command arguments. 72 */ 73 PLAN * 74 find_formplan(char *argv[]) 75 { 76 PLAN *plan, *tail, *new; 77 78 /* 79 * for each argument in the command line, determine what kind of node 80 * it is, create the appropriate node type and add the new plan node 81 * to the end of the existing plan. The resulting plan is a linked 82 * list of plan nodes. For example, the string: 83 * 84 * % find . -name foo -newer bar -print 85 * 86 * results in the plan: 87 * 88 * [-name foo]--> [-newer bar]--> [-print] 89 * 90 * in this diagram, `[-name foo]' represents the plan node generated 91 * by c_name() with an argument of foo and `-->' represents the 92 * plan->next pointer. 93 */ 94 for (plan = tail = NULL; *argv;) { 95 if (!(new = find_create(&argv))) 96 continue; 97 if (plan == NULL) 98 tail = plan = new; 99 else { 100 tail->next = new; 101 tail = new; 102 } 103 } 104 105 /* 106 * if the user didn't specify one of -print, -ok or -exec, then -print 107 * is assumed so we bracket the current expression with parens, if 108 * necessary, and add a -print node on the end. 109 */ 110 if (!isoutput) { 111 OPTION *p; 112 char **argv1 = NULL; 113 114 if (plan == NULL) { 115 p = lookup_option("-print"); 116 new = (p->create)(p, &argv1); 117 tail = plan = new; 118 } else { 119 p = lookup_option("("); 120 new = (p->create)(p, &argv1); 121 new->next = plan; 122 plan = new; 123 p = lookup_option(")"); 124 new = (p->create)(p, &argv1); 125 tail->next = new; 126 tail = new; 127 p = lookup_option("-print"); 128 new = (p->create)(p, &argv1); 129 tail->next = new; 130 tail = new; 131 } 132 } 133 134 /* 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: 139 * 140 * [!]--> [-name foo]--> [-print] 141 * 142 * becomes 143 * 144 * [! [-name foo] ]--> [-print] 145 * 146 * and 147 * 148 * [(]--> [-depth]--> [-name foo]--> [)]--> [-print] 149 * 150 * becomes 151 * 152 * [expr [-depth]-->[-name foo] ]--> [-print] 153 * 154 * operators are handled in order of precedence. 155 */ 156 157 plan = paren_squish(plan); /* ()'s */ 158 plan = not_squish(plan); /* !'s */ 159 plan = or_squish(plan); /* -o's */ 160 return (plan); 161 } 162 163 FTS *tree; /* pointer to top of FTS hierarchy */ 164 165 /* 166 * find_execute -- 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. 169 */ 170 int 171 find_execute(PLAN *plan, char *paths[]) 172 { 173 FTSENT *entry; 174 PLAN *p; 175 int rval; 176 177 tree = fts_open(paths, ftsoptions, issort ? find_compare : NULL); 178 if (tree == NULL) 179 err(1, "ftsopen"); 180 181 for (rval = 0; (entry = fts_read(tree)) != NULL;) { 182 if (maxdepth != -1 && entry->fts_level >= maxdepth) { 183 if (fts_set(tree, entry, FTS_SKIP)) 184 err(1, "%s", entry->fts_path); 185 } 186 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 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 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 /* Finish any pending -exec ... {} + functions. */ 228 for (p = plan; p != NULL; p = p->next) 229 if (p->execute == f_exec && p->flags & F_EXECPLUS) 230 (p->execute)(p, NULL); 231 if (errno) 232 err(1, "fts_read"); 233 return (rval); 234 } 235