find.c revision 61575
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 4161575Srobertostatic const char rcsid[] = 4261575Sroberto "$FreeBSD: head/usr.bin/find/find.c 61575 2000-06-12 11:12:41Z roberto $"; 4361575Sroberto#endif 441590Srgrimes#endif /* not lint */ 451590Srgrimes 461590Srgrimes#include <sys/types.h> 471590Srgrimes#include <sys/stat.h> 481590Srgrimes 491590Srgrimes#include <err.h> 501590Srgrimes#include <errno.h> 511590Srgrimes#include <fts.h> 521590Srgrimes#include <stdio.h> 531590Srgrimes#include <string.h> 541590Srgrimes#include <stdlib.h> 551590Srgrimes 561590Srgrimes#include "find.h" 571590Srgrimes 5841398Sbdestatic int find_compare __P((const FTSENT **s1, const FTSENT **s2)); 5941391Swosch 601590Srgrimes/* 6141398Sbde * find_compare -- 6241398Sbde * tell fts_open() how to order the traversal of the hierarchy. 6341399Sbde * This variant gives lexicographical order, i.e., alphabetical 6441399Sbde * order within each directory. 6541398Sbde */ 6641398Sbdestatic int 6741398Sbdefind_compare(s1, s2) 6841398Sbde const FTSENT **s1, **s2; 6941398Sbde{ 7041398Sbde 7141398Sbde return (strcoll((*s1)->fts_name, (*s2)->fts_name)); 7241398Sbde} 7341398Sbde 7441398Sbde/* 751590Srgrimes * find_formplan -- 761590Srgrimes * process the command line and create a "plan" corresponding to the 771590Srgrimes * command arguments. 781590Srgrimes */ 791590SrgrimesPLAN * 801590Srgrimesfind_formplan(argv) 811590Srgrimes 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) { 11823695Speter if (plan == NULL) { 11923695Speter new = c_print(); 1201590Srgrimes tail = plan = new; 12123695Speter } else { 1226776Sguido new = c_openparen(); 1236776Sguido new->next = plan; 1246776Sguido plan = new; 1256776Sguido new = c_closeparen(); 1261590Srgrimes tail->next = new; 1271590Srgrimes tail = new; 1286776Sguido new = c_print(); 1296776Sguido tail->next = new; 1306776Sguido tail = new; 1311590Srgrimes } 1321590Srgrimes } 1338874Srgrimes 1341590Srgrimes /* 1351590Srgrimes * the command line has been completely processed into a search plan 1361590Srgrimes * except for the (, ), !, and -o operators. Rearrange the plan so 1371590Srgrimes * that the portions of the plan which are affected by the operators 1381590Srgrimes * are moved into operator nodes themselves. For example: 1391590Srgrimes * 1401590Srgrimes * [!]--> [-name foo]--> [-print] 1411590Srgrimes * 1421590Srgrimes * becomes 1431590Srgrimes * 1441590Srgrimes * [! [-name foo] ]--> [-print] 1451590Srgrimes * 1461590Srgrimes * and 1471590Srgrimes * 1481590Srgrimes * [(]--> [-depth]--> [-name foo]--> [)]--> [-print] 1491590Srgrimes * 1501590Srgrimes * becomes 1511590Srgrimes * 1521590Srgrimes * [expr [-depth]-->[-name foo] ]--> [-print] 1531590Srgrimes * 1541590Srgrimes * operators are handled in order of precedence. 1551590Srgrimes */ 1561590Srgrimes 1571590Srgrimes plan = paren_squish(plan); /* ()'s */ 1581590Srgrimes plan = not_squish(plan); /* !'s */ 1591590Srgrimes plan = or_squish(plan); /* -o's */ 1601590Srgrimes return (plan); 1611590Srgrimes} 1628874Srgrimes 1631590SrgrimesFTS *tree; /* pointer to top of FTS hierarchy */ 1641590Srgrimes 1651590Srgrimes/* 1661590Srgrimes * find_execute -- 1671590Srgrimes * take a search plan and an array of search paths and executes the plan 1681590Srgrimes * over all FTSENT's returned for the given search paths. 1691590Srgrimes */ 1701590Srgrimesint 1711590Srgrimesfind_execute(plan, paths) 1721590Srgrimes PLAN *plan; /* search plan */ 1731590Srgrimes char **paths; /* array of pathnames to traverse */ 1741590Srgrimes{ 1751590Srgrimes register FTSENT *entry; 1761590Srgrimes PLAN *p; 1771590Srgrimes int rval; 1788874Srgrimes 17941398Sbde tree = fts_open(paths, ftsoptions, (issort ? find_compare : NULL)); 18041398Sbde if (tree == NULL) 1811590Srgrimes err(1, "ftsopen"); 1821590Srgrimes 1831590Srgrimes for (rval = 0; (entry = fts_read(tree)) != NULL;) { 1841590Srgrimes switch (entry->fts_info) { 1851590Srgrimes case FTS_D: 1861590Srgrimes if (isdepth) 1871590Srgrimes continue; 1881590Srgrimes break; 1891590Srgrimes case FTS_DP: 1901590Srgrimes if (!isdepth) 1911590Srgrimes continue; 1921590Srgrimes break; 1931590Srgrimes case FTS_DNR: 1941590Srgrimes case FTS_ERR: 1951590Srgrimes case FTS_NS: 1961590Srgrimes (void)fflush(stdout); 1971590Srgrimes warnx("%s: %s", 1981590Srgrimes entry->fts_path, strerror(entry->fts_errno)); 1991590Srgrimes rval = 1; 2001590Srgrimes continue; 20123695Speter#ifdef FTS_W 20223695Speter case FTS_W: 20323695Speter continue; 20423695Speter#endif /* FTS_W */ 2051590Srgrimes } 2061590Srgrimes#define BADCH " \t\n\\'\"" 2071590Srgrimes if (isxargs && strpbrk(entry->fts_path, BADCH)) { 2081590Srgrimes (void)fflush(stdout); 2091590Srgrimes warnx("%s: illegal path", entry->fts_path); 2101590Srgrimes rval = 1; 2111590Srgrimes continue; 2121590Srgrimes } 2138874Srgrimes 21461575Sroberto if (mindepth != -1 && entry->fts_level < mindepth) 21561575Sroberto continue; 21661575Sroberto 2171590Srgrimes /* 2181590Srgrimes * Call all the functions in the execution plan until one is 2191590Srgrimes * false or all have been executed. This is where we do all 2201590Srgrimes * the work specified by the user on the command line. 2211590Srgrimes */ 2221590Srgrimes for (p = plan; p && (p->eval)(p, entry); p = p->next); 22361575Sroberto 22461575Sroberto if (maxdepth != -1 && entry->fts_level >= maxdepth) { 22561575Sroberto if (fts_set(tree, entry, FTS_SKIP)) 22661575Sroberto err(1, "%s", entry->fts_path); 22761575Sroberto continue; 22861575Sroberto } 2291590Srgrimes } 2301590Srgrimes if (errno) 2311590Srgrimes err(1, "fts_read"); 2321590Srgrimes return (rval); 2331590Srgrimes} 234