find.c revision 23695
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 531590Srgrimes/* 541590Srgrimes * find_formplan -- 551590Srgrimes * process the command line and create a "plan" corresponding to the 561590Srgrimes * command arguments. 571590Srgrimes */ 581590SrgrimesPLAN * 591590Srgrimesfind_formplan(argv) 601590Srgrimes char **argv; 611590Srgrimes{ 621590Srgrimes PLAN *plan, *tail, *new; 631590Srgrimes 641590Srgrimes /* 651590Srgrimes * for each argument in the command line, determine what kind of node 661590Srgrimes * it is, create the appropriate node type and add the new plan node 671590Srgrimes * to the end of the existing plan. The resulting plan is a linked 681590Srgrimes * list of plan nodes. For example, the string: 691590Srgrimes * 701590Srgrimes * % find . -name foo -newer bar -print 711590Srgrimes * 721590Srgrimes * results in the plan: 731590Srgrimes * 741590Srgrimes * [-name foo]--> [-newer bar]--> [-print] 751590Srgrimes * 761590Srgrimes * in this diagram, `[-name foo]' represents the plan node generated 771590Srgrimes * by c_name() with an argument of foo and `-->' represents the 781590Srgrimes * plan->next pointer. 791590Srgrimes */ 801590Srgrimes for (plan = tail = NULL; *argv;) { 811590Srgrimes if (!(new = find_create(&argv))) 821590Srgrimes continue; 831590Srgrimes if (plan == NULL) 841590Srgrimes tail = plan = new; 851590Srgrimes else { 861590Srgrimes tail->next = new; 871590Srgrimes tail = new; 881590Srgrimes } 891590Srgrimes } 908874Srgrimes 911590Srgrimes /* 921590Srgrimes * if the user didn't specify one of -print, -ok or -exec, then -print 9323695Speter * is assumed so we bracket the current expression with parens, if 9423695Speter * necessary, and add a -print node on the end. 951590Srgrimes */ 961590Srgrimes if (!isoutput) { 9723695Speter if (plan == NULL) { 9823695Speter new = c_print(); 991590Srgrimes tail = plan = new; 10023695Speter } else { 1016776Sguido new = c_openparen(); 1026776Sguido new->next = plan; 1036776Sguido plan = new; 1046776Sguido new = c_closeparen(); 1051590Srgrimes tail->next = new; 1061590Srgrimes tail = new; 1076776Sguido new = c_print(); 1086776Sguido tail->next = new; 1096776Sguido tail = new; 1101590Srgrimes } 1111590Srgrimes } 1128874Srgrimes 1131590Srgrimes /* 1141590Srgrimes * the command line has been completely processed into a search plan 1151590Srgrimes * except for the (, ), !, and -o operators. Rearrange the plan so 1161590Srgrimes * that the portions of the plan which are affected by the operators 1171590Srgrimes * are moved into operator nodes themselves. For example: 1181590Srgrimes * 1191590Srgrimes * [!]--> [-name foo]--> [-print] 1201590Srgrimes * 1211590Srgrimes * becomes 1221590Srgrimes * 1231590Srgrimes * [! [-name foo] ]--> [-print] 1241590Srgrimes * 1251590Srgrimes * and 1261590Srgrimes * 1271590Srgrimes * [(]--> [-depth]--> [-name foo]--> [)]--> [-print] 1281590Srgrimes * 1291590Srgrimes * becomes 1301590Srgrimes * 1311590Srgrimes * [expr [-depth]-->[-name foo] ]--> [-print] 1321590Srgrimes * 1331590Srgrimes * operators are handled in order of precedence. 1341590Srgrimes */ 1351590Srgrimes 1361590Srgrimes plan = paren_squish(plan); /* ()'s */ 1371590Srgrimes plan = not_squish(plan); /* !'s */ 1381590Srgrimes plan = or_squish(plan); /* -o's */ 1391590Srgrimes return (plan); 1401590Srgrimes} 1418874Srgrimes 1421590SrgrimesFTS *tree; /* pointer to top of FTS hierarchy */ 1431590Srgrimes 1441590Srgrimes/* 1451590Srgrimes * find_execute -- 1461590Srgrimes * take a search plan and an array of search paths and executes the plan 1471590Srgrimes * over all FTSENT's returned for the given search paths. 1481590Srgrimes */ 1491590Srgrimesint 1501590Srgrimesfind_execute(plan, paths) 1511590Srgrimes PLAN *plan; /* search plan */ 1521590Srgrimes char **paths; /* array of pathnames to traverse */ 1531590Srgrimes{ 1541590Srgrimes register FTSENT *entry; 1551590Srgrimes PLAN *p; 1561590Srgrimes int rval; 1578874Srgrimes 1581590Srgrimes if ((tree = fts_open(paths, ftsoptions, (int (*)())NULL)) == NULL) 1591590Srgrimes err(1, "ftsopen"); 1601590Srgrimes 1611590Srgrimes for (rval = 0; (entry = fts_read(tree)) != NULL;) { 1621590Srgrimes switch (entry->fts_info) { 1631590Srgrimes case FTS_D: 1641590Srgrimes if (isdepth) 1651590Srgrimes continue; 1661590Srgrimes break; 1671590Srgrimes case FTS_DP: 1681590Srgrimes if (!isdepth) 1691590Srgrimes continue; 1701590Srgrimes break; 1711590Srgrimes case FTS_DNR: 1721590Srgrimes case FTS_ERR: 1731590Srgrimes case FTS_NS: 1741590Srgrimes (void)fflush(stdout); 1751590Srgrimes warnx("%s: %s", 1761590Srgrimes entry->fts_path, strerror(entry->fts_errno)); 1771590Srgrimes rval = 1; 1781590Srgrimes continue; 17923695Speter#ifdef FTS_W 18023695Speter case FTS_W: 18123695Speter continue; 18223695Speter#endif /* FTS_W */ 1831590Srgrimes } 1841590Srgrimes#define BADCH " \t\n\\'\"" 1851590Srgrimes if (isxargs && strpbrk(entry->fts_path, BADCH)) { 1861590Srgrimes (void)fflush(stdout); 1871590Srgrimes warnx("%s: illegal path", entry->fts_path); 1881590Srgrimes rval = 1; 1891590Srgrimes continue; 1901590Srgrimes } 1918874Srgrimes 1921590Srgrimes /* 1931590Srgrimes * Call all the functions in the execution plan until one is 1941590Srgrimes * false or all have been executed. This is where we do all 1951590Srgrimes * the work specified by the user on the command line. 1961590Srgrimes */ 1971590Srgrimes for (p = plan; p && (p->eval)(p, entry); p = p->next); 1981590Srgrimes } 1991590Srgrimes if (errno) 2001590Srgrimes err(1, "fts_read"); 2011590Srgrimes return (rval); 2021590Srgrimes} 203