usr.bin/find/find.c

   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. Neither the name of the University nor the names of its contributors
  17  *    may be used to endorse or promote products derived from this software
  18  *    without specific prior written permission.
  19  *
  20  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  21  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  22  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  23  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  24  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  25  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  26  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  27  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  28  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  29  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  30  * SUCH DAMAGE.
  31  *
  32  * @(#)find.c   8.5 (Berkeley) 8/5/94
  33  * $FreeBSD: head/usr.bin/find/find.c 238780 2012-07-25 21:59:10Z jilles $
  34  */
  35
  36 #include <sys/types.h>
  37 #include <sys/stat.h>
  38
  39 #include <err.h>
  40 #include <errno.h>
  41 #include <fts.h>
  42 #include <regex.h>
  43 #include <stdio.h>
  44 #include <stdlib.h>
  45 #include <string.h>
  46
  47 #include "find.h"
  48
  49 #if defined(__FreeBSD__) || defined(__DragonFly__)
  50 #define FTS_CONST const
  51 #else
  52 #define FTS_CONST
  53 #endif
  54
  55 /*
  56  * find_compare --
  57  *      tell fts_open() how to order the traversal of the hierarchy.
  58  *      This variant gives lexicographical order, i.e., alphabetical
  59  *      order within each directory.
  60  */
  61 static int
  62 find_compare(const FTSENT *FTS_CONST *s1, const FTSENT *FTS_CONST *s2)
  63 {
  64
  65         return (strcoll((*s1)->fts_name, (*s2)->fts_name));
  66 }
  67
  68 /*
  69  * find_formplan --
  70  *      process the command line and create a "plan" corresponding to the
  71  *      command arguments.
  72  */
  73 PLAN *
  74 find_formplan(char *argv[])
  75 {
  76         PLAN *plan, *tail, *new;
  77
  78         /*
  79          * for each argument in the command line, determine what kind of node
  80          * it is, create the appropriate node type and add the new plan node
  81          * to the end of the existing plan.  The resulting plan is a linked
  82          * list of plan nodes.  For example, the string:
  83          *
  84          *      % find . -name foo -newer bar -print
  85          *
  86          * results in the plan:
  87          *
  88          *      [-name foo]--> [-newer bar]--> [-print]
  89          *
  90          * in this diagram, `[-name foo]' represents the plan node generated
  91          * by c_name() with an argument of foo and `-->' represents the
  92          * plan->next pointer.
  93          */
  94         for (plan = tail = NULL; *argv;) {
  95                 if (!(new = find_create(&argv)))
  96                         continue;
  97                 if (plan == NULL)
  98                         tail = plan = new;
  99                 else {
 100                         tail->next = new;
 101                         tail = new;
 102                 }
 103         }
 104
 105         /*
 106          * if the user didn't specify one of -print, -ok or -exec, then -print
 107          * is assumed so we bracket the current expression with parens, if
 108          * necessary, and add a -print node on the end.
 109          */
 110         if (!isoutput) {
 111                 OPTION *p;
 112                 char **argv1 = NULL;
 113
 114                 if (plan == NULL) {
 115                         p = lookup_option("-print");
 116                         new = (p->create)(p, &argv1);
 117                         tail = plan = new;
 118                 } else {
 119                         p = lookup_option("(");
 120                         new = (p->create)(p, &argv1);
 121                         new->next = plan;
 122                         plan = new;
 123                         p = lookup_option(")");
 124                         new = (p->create)(p, &argv1);
 125                         tail->next = new;
 126                         tail = new;
 127                         p = lookup_option("-print");
 128                         new = (p->create)(p, &argv1);
 129                         tail->next = new;
 130                         tail = new;
 131                 }
 132         }
 133
 134         /*
 135          * the command line has been completely processed into a search plan
 136          * except for the (, ), !, and -o operators.  Rearrange the plan so
 137          * that the portions of the plan which are affected by the operators
 138          * are moved into operator nodes themselves.  For example:
 139          *
 140          *      [!]--> [-name foo]--> [-print]
 141          *
 142          * becomes
 143          *
 144          *      [! [-name foo] ]--> [-print]
 145          *
 146          * and
 147          *
 148          *      [(]--> [-depth]--> [-name foo]--> [)]--> [-print]
 149          *
 150          * becomes
 151          *
 152          *      [expr [-depth]-->[-name foo] ]--> [-print]
 153          *
 154          * operators are handled in order of precedence.
 155          */
 156
 157         plan = paren_squish(plan);              /* ()'s */
 158         plan = not_squish(plan);                /* !'s */
 159         plan = or_squish(plan);                 /* -o's */
 160         return (plan);
 161 }
 162
 163 FTS *tree;                      /* pointer to top of FTS hierarchy */
 164
 165 /*
 166  * find_execute --
 167  *      take a search plan and an array of search paths and executes the plan
 168  *      over all FTSENT's returned for the given search paths.
 169  */
 170 int
 171 find_execute(PLAN *plan, char *paths[])
 172 {
 173         FTSENT *entry;
 174         PLAN *p;
 175         int rval;
 176
 177         tree = fts_open(paths, ftsoptions, (issort ? find_compare : NULL));
 178         if (tree == NULL)
 179                 err(1, "ftsopen");
 180
 181         for (rval = 0; (entry = fts_read(tree)) != NULL;) {
 182                 if (maxdepth != -1 && entry->fts_level >= maxdepth) {
 183                         if (fts_set(tree, entry, FTS_SKIP))
 184                                 err(1, "%s", entry->fts_path);
 185                 }
 186
 187                 switch (entry->fts_info) {
 188                 case FTS_D:
 189                         if (isdepth)
 190                                 continue;
 191                         break;
 192                 case FTS_DP:
 193                         if (!isdepth)
 194                                 continue;
 195                         break;
 196                 case FTS_DNR:
 197                 case FTS_NS:
 198                         if (ignore_readdir_race &&
 199                             entry->fts_errno == ENOENT && entry->fts_level > 0)
 200                                 continue;
 201                         /* FALLTHROUGH */
 202                 case FTS_ERR:
 203                         (void)fflush(stdout);
 204                         warnx("%s: %s",
 205                             entry->fts_path, strerror(entry->fts_errno));
 206                         rval = 1;
 207                         continue;
 208 #ifdef FTS_W
 209                 case FTS_W:
 210                         continue;
 211 #endif /* FTS_W */
 212                 }
 213 #define BADCH   " \t\n\\'\""
 214                 if (isxargs && strpbrk(entry->fts_path, BADCH)) {
 215                         (void)fflush(stdout);
 216                         warnx("%s: illegal path", entry->fts_path);
 217                         rval = 1;
 218                         continue;
 219                 }
 220
 221                 if (mindepth != -1 && entry->fts_level < mindepth)
 222                         continue;
 223
 224                 /*
 225                  * Call all the functions in the execution plan until one is
 226                  * false or all have been executed.  This is where we do all
 227                  * the work specified by the user on the command line.
 228                  */
 229                 for (p = plan; p && (p->execute)(p, entry); p = p->next);
 230         }
 231         finish_execplus();
 232         if (errno && (!ignore_readdir_race || errno != ENOENT))
 233                 err(1, "fts_read");
 234         return (rval);
 235 }