find.c revision 129812
11590Srgrimes/*- 21590Srgrimes * Copyright (c) 1991, 1993, 1994 31590Srgrimes * The Regents of the University of California. All rights reserved. 41590Srgrimes * 51590Srgrimes * This code is derived from software contributed to Berkeley by 61590Srgrimes * Cimarron D. Taylor of the University of California, Berkeley. 71590Srgrimes * 81590Srgrimes * Redistribution and use in source and binary forms, with or without 91590Srgrimes * modification, are permitted provided that the following conditions 101590Srgrimes * are met: 111590Srgrimes * 1. Redistributions of source code must retain the above copyright 121590Srgrimes * notice, this list of conditions and the following disclaimer. 131590Srgrimes * 2. Redistributions in binary form must reproduce the above copyright 141590Srgrimes * notice, this list of conditions and the following disclaimer in the 151590Srgrimes * documentation and/or other materials provided with the distribution. 161590Srgrimes * 3. All advertising materials mentioning features or use of this software 171590Srgrimes * must display the following acknowledgement: 181590Srgrimes * This product includes software developed by the University of 191590Srgrimes * California, Berkeley and its contributors. 201590Srgrimes * 4. Neither the name of the University nor the names of its contributors 211590Srgrimes * may be used to endorse or promote products derived from this software 221590Srgrimes * without specific prior written permission. 231590Srgrimes * 241590Srgrimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 251590Srgrimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 261590Srgrimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 271590Srgrimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 281590Srgrimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 291590Srgrimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 301590Srgrimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 311590Srgrimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 321590Srgrimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 331590Srgrimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 341590Srgrimes * SUCH DAMAGE. 351590Srgrimes */ 361590Srgrimes 371590Srgrimes#ifndef lint 3861575Sroberto#if 0 3923695Speterstatic char sccsid[] = "@(#)find.c 8.5 (Berkeley) 8/5/94"; 4061575Sroberto#else 4161575Sroberto#endif 421590Srgrimes#endif /* not lint */ 43116333Smarkm 4493604Sobrien#include <sys/cdefs.h> 4593604Sobrien__FBSDID("$FreeBSD: head/usr.bin/find/find.c 129812 2004-05-28 17:17:15Z eik $"); 461590Srgrimes 471590Srgrimes#include <sys/types.h> 481590Srgrimes#include <sys/stat.h> 491590Srgrimes 501590Srgrimes#include <err.h> 511590Srgrimes#include <errno.h> 521590Srgrimes#include <fts.h> 5372945Sknu#include <regex.h> 541590Srgrimes#include <stdio.h> 55116333Smarkm#include <stdlib.h> 561590Srgrimes#include <string.h> 571590Srgrimes 581590Srgrimes#include "find.h" 591590Srgrimes 60103726Swollmanstatic int find_compare(const FTSENT * const *s1, const FTSENT * const *s2); 6141391Swosch 621590Srgrimes/* 6341398Sbde * find_compare -- 6441398Sbde * tell fts_open() how to order the traversal of the hierarchy. 6541399Sbde * This variant gives lexicographical order, i.e., alphabetical 6641399Sbde * order within each directory. 6741398Sbde */ 6841398Sbdestatic int 69116333Smarkmfind_compare(const FTSENT * const *s1, const FTSENT * const *s2) 7041398Sbde{ 7141398Sbde 7241398Sbde return (strcoll((*s1)->fts_name, (*s2)->fts_name)); 7341398Sbde} 7441398Sbde 7541398Sbde/* 761590Srgrimes * find_formplan -- 771590Srgrimes * process the command line and create a "plan" corresponding to the 781590Srgrimes * command arguments. 791590Srgrimes */ 801590SrgrimesPLAN * 81116333Smarkmfind_formplan(char *argv[]) 821590Srgrimes{ 831590Srgrimes PLAN *plan, *tail, *new; 841590Srgrimes 851590Srgrimes /* 861590Srgrimes * for each argument in the command line, determine what kind of node 871590Srgrimes * it is, create the appropriate node type and add the new plan node 881590Srgrimes * to the end of the existing plan. The resulting plan is a linked 891590Srgrimes * list of plan nodes. For example, the string: 901590Srgrimes * 911590Srgrimes * % find . -name foo -newer bar -print 921590Srgrimes * 931590Srgrimes * results in the plan: 941590Srgrimes * 951590Srgrimes * [-name foo]--> [-newer bar]--> [-print] 961590Srgrimes * 971590Srgrimes * in this diagram, `[-name foo]' represents the plan node generated 981590Srgrimes * by c_name() with an argument of foo and `-->' represents the 991590Srgrimes * plan->next pointer. 1001590Srgrimes */ 1011590Srgrimes for (plan = tail = NULL; *argv;) { 1021590Srgrimes if (!(new = find_create(&argv))) 1031590Srgrimes continue; 1041590Srgrimes if (plan == NULL) 1051590Srgrimes tail = plan = new; 1061590Srgrimes else { 1071590Srgrimes tail->next = new; 1081590Srgrimes tail = new; 1091590Srgrimes } 1101590Srgrimes } 1118874Srgrimes 1121590Srgrimes /* 1131590Srgrimes * if the user didn't specify one of -print, -ok or -exec, then -print 11423695Speter * is assumed so we bracket the current expression with parens, if 11523695Speter * necessary, and add a -print node on the end. 1161590Srgrimes */ 1171590Srgrimes if (!isoutput) { 11876250Sphk OPTION *p; 11991400Sdwmalone char **argv1 = 0; 12076250Sphk 12123695Speter if (plan == NULL) { 12291400Sdwmalone p = lookup_option("-print"); 12391400Sdwmalone new = (p->create)(p, &argv1); 1241590Srgrimes tail = plan = new; 12523695Speter } else { 12691400Sdwmalone p = lookup_option("("); 12791400Sdwmalone new = (p->create)(p, &argv1); 1286776Sguido new->next = plan; 1296776Sguido plan = new; 13091400Sdwmalone p = lookup_option(")"); 13191400Sdwmalone new = (p->create)(p, &argv1); 1321590Srgrimes tail->next = new; 1331590Srgrimes tail = new; 13491400Sdwmalone p = lookup_option("-print"); 13591400Sdwmalone new = (p->create)(p, &argv1); 1366776Sguido tail->next = new; 1376776Sguido tail = new; 1381590Srgrimes } 1391590Srgrimes } 1408874Srgrimes 1411590Srgrimes /* 1421590Srgrimes * the command line has been completely processed into a search plan 1431590Srgrimes * except for the (, ), !, and -o operators. Rearrange the plan so 1441590Srgrimes * that the portions of the plan which are affected by the operators 1451590Srgrimes * are moved into operator nodes themselves. For example: 1461590Srgrimes * 1471590Srgrimes * [!]--> [-name foo]--> [-print] 1481590Srgrimes * 1491590Srgrimes * becomes 1501590Srgrimes * 1511590Srgrimes * [! [-name foo] ]--> [-print] 1521590Srgrimes * 1531590Srgrimes * and 1541590Srgrimes * 1551590Srgrimes * [(]--> [-depth]--> [-name foo]--> [)]--> [-print] 1561590Srgrimes * 1571590Srgrimes * becomes 1581590Srgrimes * 1591590Srgrimes * [expr [-depth]-->[-name foo] ]--> [-print] 1601590Srgrimes * 1611590Srgrimes * operators are handled in order of precedence. 1621590Srgrimes */ 1631590Srgrimes 1641590Srgrimes plan = paren_squish(plan); /* ()'s */ 1651590Srgrimes plan = not_squish(plan); /* !'s */ 1661590Srgrimes plan = or_squish(plan); /* -o's */ 1671590Srgrimes return (plan); 1681590Srgrimes} 1698874Srgrimes 1701590SrgrimesFTS *tree; /* pointer to top of FTS hierarchy */ 1711590Srgrimes 1721590Srgrimes/* 1731590Srgrimes * find_execute -- 1741590Srgrimes * take a search plan and an array of search paths and executes the plan 1751590Srgrimes * over all FTSENT's returned for the given search paths. 1761590Srgrimes */ 1771590Srgrimesint 178116333Smarkmfind_execute(PLAN *plan, char *paths[]) 1791590Srgrimes{ 18091400Sdwmalone FTSENT *entry; 1811590Srgrimes PLAN *p; 1821590Srgrimes int rval; 1838874Srgrimes 18441398Sbde tree = fts_open(paths, ftsoptions, (issort ? find_compare : NULL)); 18541398Sbde if (tree == NULL) 1861590Srgrimes err(1, "ftsopen"); 1871590Srgrimes 1881590Srgrimes for (rval = 0; (entry = fts_read(tree)) != NULL;) { 189129812Seik if (maxdepth != -1 && entry->fts_level >= maxdepth) { 190129812Seik if (fts_set(tree, entry, FTS_SKIP)) 191129812Seik err(1, "%s", entry->fts_path); 192129812Seik } 193129812Seik 1941590Srgrimes switch (entry->fts_info) { 1951590Srgrimes case FTS_D: 1961590Srgrimes if (isdepth) 1971590Srgrimes continue; 1981590Srgrimes break; 1991590Srgrimes case FTS_DP: 2001590Srgrimes if (!isdepth) 2011590Srgrimes continue; 2021590Srgrimes break; 2031590Srgrimes case FTS_DNR: 2041590Srgrimes case FTS_ERR: 2051590Srgrimes case FTS_NS: 2061590Srgrimes (void)fflush(stdout); 2071590Srgrimes warnx("%s: %s", 2081590Srgrimes entry->fts_path, strerror(entry->fts_errno)); 2091590Srgrimes rval = 1; 2101590Srgrimes continue; 21123695Speter#ifdef FTS_W 21223695Speter case FTS_W: 21323695Speter continue; 21423695Speter#endif /* FTS_W */ 2151590Srgrimes } 2161590Srgrimes#define BADCH " \t\n\\'\"" 2171590Srgrimes if (isxargs && strpbrk(entry->fts_path, BADCH)) { 2181590Srgrimes (void)fflush(stdout); 2191590Srgrimes warnx("%s: illegal path", entry->fts_path); 2201590Srgrimes rval = 1; 2211590Srgrimes continue; 2221590Srgrimes } 2238874Srgrimes 22461575Sroberto if (mindepth != -1 && entry->fts_level < mindepth) 22561575Sroberto continue; 22661575Sroberto 2271590Srgrimes /* 2281590Srgrimes * Call all the functions in the execution plan until one is 2291590Srgrimes * false or all have been executed. This is where we do all 2301590Srgrimes * the work specified by the user on the command line. 2311590Srgrimes */ 23276250Sphk for (p = plan; p && (p->execute)(p, entry); p = p->next); 2331590Srgrimes } 23497736Stjr /* Finish any pending -exec ... {} + functions. */ 23597736Stjr for (p = plan; p != NULL; p = p->next) 23697736Stjr if (p->execute == f_exec && p->flags & F_EXECPLUS) 23797736Stjr (p->execute)(p, NULL); 2381590Srgrimes if (errno) 2391590Srgrimes err(1, "fts_read"); 2401590Srgrimes return (rval); 2411590Srgrimes} 242