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