find.c revision 41399
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 3823695Speterstatic char sccsid[] = "@(#)find.c 8.5 (Berkeley) 8/5/94"; 391590Srgrimes#endif /* not lint */ 401590Srgrimes 411590Srgrimes#include <sys/types.h> 421590Srgrimes#include <sys/stat.h> 431590Srgrimes 441590Srgrimes#include <err.h> 451590Srgrimes#include <errno.h> 461590Srgrimes#include <fts.h> 471590Srgrimes#include <stdio.h> 481590Srgrimes#include <string.h> 491590Srgrimes#include <stdlib.h> 501590Srgrimes 511590Srgrimes#include "find.h" 521590Srgrimes 5341398Sbdestatic int find_compare __P((const FTSENT **s1, const FTSENT **s2)); 5441391Swosch 551590Srgrimes/* 5641398Sbde * find_compare -- 5741398Sbde * tell fts_open() how to order the traversal of the hierarchy. 5841399Sbde * This variant gives lexicographical order, i.e., alphabetical 5941399Sbde * order within each directory. 6041398Sbde */ 6141398Sbdestatic int 6241398Sbdefind_compare(s1, s2) 6341398Sbde const FTSENT **s1, **s2; 6441398Sbde{ 6541398Sbde 6641398Sbde return (strcoll((*s1)->fts_name, (*s2)->fts_name)); 6741398Sbde} 6841398Sbde 6941398Sbde/* 701590Srgrimes * find_formplan -- 711590Srgrimes * process the command line and create a "plan" corresponding to the 721590Srgrimes * command arguments. 731590Srgrimes */ 741590SrgrimesPLAN * 751590Srgrimesfind_formplan(argv) 761590Srgrimes char **argv; 771590Srgrimes{ 781590Srgrimes PLAN *plan, *tail, *new; 791590Srgrimes 801590Srgrimes /* 811590Srgrimes * for each argument in the command line, determine what kind of node 821590Srgrimes * it is, create the appropriate node type and add the new plan node 831590Srgrimes * to the end of the existing plan. The resulting plan is a linked 841590Srgrimes * list of plan nodes. For example, the string: 851590Srgrimes * 861590Srgrimes * % find . -name foo -newer bar -print 871590Srgrimes * 881590Srgrimes * results in the plan: 891590Srgrimes * 901590Srgrimes * [-name foo]--> [-newer bar]--> [-print] 911590Srgrimes * 921590Srgrimes * in this diagram, `[-name foo]' represents the plan node generated 931590Srgrimes * by c_name() with an argument of foo and `-->' represents the 941590Srgrimes * plan->next pointer. 951590Srgrimes */ 961590Srgrimes for (plan = tail = NULL; *argv;) { 971590Srgrimes if (!(new = find_create(&argv))) 981590Srgrimes continue; 991590Srgrimes if (plan == NULL) 1001590Srgrimes tail = plan = new; 1011590Srgrimes else { 1021590Srgrimes tail->next = new; 1031590Srgrimes tail = new; 1041590Srgrimes } 1051590Srgrimes } 1068874Srgrimes 1071590Srgrimes /* 1081590Srgrimes * if the user didn't specify one of -print, -ok or -exec, then -print 10923695Speter * is assumed so we bracket the current expression with parens, if 11023695Speter * necessary, and add a -print node on the end. 1111590Srgrimes */ 1121590Srgrimes if (!isoutput) { 11323695Speter if (plan == NULL) { 11423695Speter new = c_print(); 1151590Srgrimes tail = plan = new; 11623695Speter } else { 1176776Sguido new = c_openparen(); 1186776Sguido new->next = plan; 1196776Sguido plan = new; 1206776Sguido new = c_closeparen(); 1211590Srgrimes tail->next = new; 1221590Srgrimes tail = new; 1236776Sguido new = c_print(); 1246776Sguido tail->next = new; 1256776Sguido tail = new; 1261590Srgrimes } 1271590Srgrimes } 1288874Srgrimes 1291590Srgrimes /* 1301590Srgrimes * the command line has been completely processed into a search plan 1311590Srgrimes * except for the (, ), !, and -o operators. Rearrange the plan so 1321590Srgrimes * that the portions of the plan which are affected by the operators 1331590Srgrimes * are moved into operator nodes themselves. For example: 1341590Srgrimes * 1351590Srgrimes * [!]--> [-name foo]--> [-print] 1361590Srgrimes * 1371590Srgrimes * becomes 1381590Srgrimes * 1391590Srgrimes * [! [-name foo] ]--> [-print] 1401590Srgrimes * 1411590Srgrimes * and 1421590Srgrimes * 1431590Srgrimes * [(]--> [-depth]--> [-name foo]--> [)]--> [-print] 1441590Srgrimes * 1451590Srgrimes * becomes 1461590Srgrimes * 1471590Srgrimes * [expr [-depth]-->[-name foo] ]--> [-print] 1481590Srgrimes * 1491590Srgrimes * operators are handled in order of precedence. 1501590Srgrimes */ 1511590Srgrimes 1521590Srgrimes plan = paren_squish(plan); /* ()'s */ 1531590Srgrimes plan = not_squish(plan); /* !'s */ 1541590Srgrimes plan = or_squish(plan); /* -o's */ 1551590Srgrimes return (plan); 1561590Srgrimes} 1578874Srgrimes 1581590SrgrimesFTS *tree; /* pointer to top of FTS hierarchy */ 1591590Srgrimes 1601590Srgrimes/* 1611590Srgrimes * find_execute -- 1621590Srgrimes * take a search plan and an array of search paths and executes the plan 1631590Srgrimes * over all FTSENT's returned for the given search paths. 1641590Srgrimes */ 1651590Srgrimesint 1661590Srgrimesfind_execute(plan, paths) 1671590Srgrimes PLAN *plan; /* search plan */ 1681590Srgrimes char **paths; /* array of pathnames to traverse */ 1691590Srgrimes{ 1701590Srgrimes register FTSENT *entry; 1711590Srgrimes PLAN *p; 1721590Srgrimes int rval; 1738874Srgrimes 17441398Sbde tree = fts_open(paths, ftsoptions, (issort ? find_compare : NULL)); 17541398Sbde if (tree == NULL) 1761590Srgrimes err(1, "ftsopen"); 1771590Srgrimes 1781590Srgrimes for (rval = 0; (entry = fts_read(tree)) != NULL;) { 1791590Srgrimes switch (entry->fts_info) { 1801590Srgrimes case FTS_D: 1811590Srgrimes if (isdepth) 1821590Srgrimes continue; 1831590Srgrimes break; 1841590Srgrimes case FTS_DP: 1851590Srgrimes if (!isdepth) 1861590Srgrimes continue; 1871590Srgrimes break; 1881590Srgrimes case FTS_DNR: 1891590Srgrimes case FTS_ERR: 1901590Srgrimes case FTS_NS: 1911590Srgrimes (void)fflush(stdout); 1921590Srgrimes warnx("%s: %s", 1931590Srgrimes entry->fts_path, strerror(entry->fts_errno)); 1941590Srgrimes rval = 1; 1951590Srgrimes continue; 19623695Speter#ifdef FTS_W 19723695Speter case FTS_W: 19823695Speter continue; 19923695Speter#endif /* FTS_W */ 2001590Srgrimes } 2011590Srgrimes#define BADCH " \t\n\\'\"" 2021590Srgrimes if (isxargs && strpbrk(entry->fts_path, BADCH)) { 2031590Srgrimes (void)fflush(stdout); 2041590Srgrimes warnx("%s: illegal path", entry->fts_path); 2051590Srgrimes rval = 1; 2061590Srgrimes continue; 2071590Srgrimes } 2088874Srgrimes 2091590Srgrimes /* 2101590Srgrimes * Call all the functions in the execution plan until one is 2111590Srgrimes * false or all have been executed. This is where we do all 2121590Srgrimes * the work specified by the user on the command line. 2131590Srgrimes */ 2141590Srgrimes for (p = plan; p && (p->eval)(p, entry); p = p->next); 2151590Srgrimes } 2161590Srgrimes if (errno) 2171590Srgrimes err(1, "fts_read"); 2181590Srgrimes return (rval); 2191590Srgrimes} 220