find/option.c

   1 /*-
   2  * Copyright (c) 1990, 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. All advertising materials mentioning features or use of this software
  17  *    must display the following acknowledgement:
  18  *      This product includes software developed by the University of
  19  *      California, Berkeley and its contributors.
  20  * 4. Neither the name of the University nor the names of its contributors
  21  *    may be used to endorse or promote products derived from this software
  22  *    without specific prior written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34  * SUCH DAMAGE.
  35  */
  36
  37 #ifndef lint
  38 /*
  39 static char sccsid[] = "@(#)option.c    8.2 (Berkeley) 4/16/94";
  40 */
  41 static const char rcsid[] =
  42   "$FreeBSD: src/usr.bin/find/option.c,v 1.9.2.4 2001/05/06 09:53:22 phk Exp $";
  43 #endif /* not lint */
  44
  45 #include <sys/types.h>
  46 #include <sys/stat.h>
  47
  48 #include <err.h>
  49 #include <fts.h>
  50 #include <regex.h>
  51 #include <stdio.h>
  52 #include <stdlib.h>
  53 #include <string.h>
  54
  55 #include "find.h"
  56
  57 /* NB: the following table must be sorted lexically. */
  58 static OPTION const options[] = {
  59         { "!",          c_simple,       f_not,          0 },
  60         { "(",          c_simple,       f_openparen,    0 },
  61         { ")",          c_simple,       f_closeparen,   0 },
  62         { "-a",         c_and,          NULL,           0 },
  63         { "-amin",      c_Xmin,         f_Xmin,         F_TIME_A },
  64         { "-and",       c_and,          NULL,           0 },
  65         { "-anewer",    c_newer,        f_newer,        F_TIME_A },
  66         { "-atime",     c_Xtime,        f_Xtime,        F_TIME_A },
  67         { "-cmin",      c_Xmin,         f_Xmin,         F_TIME_C },
  68         { "-cnewer",    c_newer,        f_newer,        F_TIME_C },
  69         { "-ctime",     c_Xtime,        f_Xtime,        F_TIME_C },
  70         { "-delete",    c_delete,       f_delete,       0 },
  71         { "-depth",     c_depth,        f_always_true,  0 },
  72         { "-empty",     c_empty,        f_empty,        0 },
  73         { "-exec",      c_exec,         f_exec,         0 },
  74         { "-execdir",   c_exec,         f_exec,         F_EXECDIR },
  75         { "-false",     c_simple,       f_not,          0 },
  76         { "-flags",     c_flags,        f_flags,        0 },
  77         { "-follow",    c_follow,       f_always_true,  0 },
  78 /*
  79  * NetBSD doesn't provide a getvfsbyname(), so this option
  80  * is not available if using a NetBSD kernel.
  81  */
  82 #if !defined(__NetBSD__)
  83         { "-fstype",    c_fstype,       f_fstype,       0 },
  84 #endif
  85         { "-group",     c_group,        f_group,        0 },
  86         { "-iname",     c_name,         f_name,         F_IGNCASE },
  87         { "-inum",      c_inum,         f_inum,         0 },
  88         { "-ipath",     c_name,         f_path,         F_IGNCASE },
  89         { "-iregex",    c_regex,        f_regex,        F_IGNCASE },
  90         { "-links",     c_links,        f_links,        0 },
  91         { "-ls",        c_ls,           f_ls,           0 },
  92         { "-maxdepth",  c_mXXdepth,     f_always_true,  F_MAXDEPTH },
  93         { "-mindepth",  c_mXXdepth,     f_always_true,  0 },
  94         { "-mmin",      c_Xmin,         f_Xmin,         0 },
  95         { "-mnewer",    c_newer,        f_newer,        0 },
  96         { "-mtime",     c_Xtime,        f_Xtime,        0 },
  97         { "-name",      c_name,         f_name,         0 },
  98         { "-newer",     c_newer,        f_newer,        0 },
  99         { "-neweraa",   c_newer,        f_newer,        F_TIME_A | F_TIME2_A },
 100         { "-newerac",   c_newer,        f_newer,        F_TIME_A | F_TIME2_C },
 101         { "-neweram",   c_newer,        f_newer,        F_TIME_A },
 102         { "-newerat",   c_newer,        f_newer,        F_TIME_A | F_TIME2_T },
 103         { "-newerca",   c_newer,        f_newer,        F_TIME_C | F_TIME2_A },
 104         { "-newercc",   c_newer,        f_newer,        F_TIME_C | F_TIME2_C },
 105         { "-newercm",   c_newer,        f_newer,        F_TIME_C },
 106         { "-newerct",   c_newer,        f_newer,        F_TIME_C | F_TIME2_T },
 107         { "-newerma",   c_newer,        f_newer,        F_TIME2_A },
 108         { "-newermc",   c_newer,        f_newer,        F_TIME2_C },
 109         { "-newermm",   c_newer,        f_newer,        0 },
 110         { "-newermt",   c_newer,        f_newer,        F_TIME2_T },
 111         { "-nogroup",   c_nogroup,      f_nogroup,      0 },
 112         { "-not",       c_simple,       f_not,          0 },
 113         { "-nouser",    c_nouser,       f_nouser,       0 },
 114         { "-o",         c_simple,       f_or,           0 },
 115         { "-ok",        c_exec,         f_exec,         F_NEEDOK },
 116         { "-okdir",     c_exec,         f_exec,         F_NEEDOK | F_EXECDIR },
 117         { "-or",        c_simple,       f_or,           0 },
 118         { "-path",      c_name,         f_path,         0 },
 119         { "-perm",      c_perm,         f_perm,         0 },
 120         { "-print",     c_print,        f_print,        0 },
 121         { "-print0",    c_print,        f_print0,       0 },
 122         { "-prune",     c_simple,       f_prune,        0 },
 123         { "-regex",     c_regex,        f_regex,        0 },
 124         { "-size",      c_size,         f_size,         0 },
 125         { "-type",      c_type,         f_type,         0 },
 126         { "-user",      c_user,         f_user,         0 },
 127         { "-xdev",      c_xdev,         f_always_true,  0 },
 128 };
 129
 130 /*
 131  * find_create --
 132  *      create a node corresponding to a command line argument.
 133  *
 134  * TODO:
 135  *      add create/process function pointers to node, so we can skip
 136  *      this switch stuff.
 137  */
 138 PLAN *
 139 find_create(argvp)
 140         char ***argvp;
 141 {
 142         register OPTION *p;
 143         PLAN *new;
 144         char **argv;
 145
 146         argv = *argvp;
 147
 148         if ((p = option(*argv)) == NULL)
 149                 errx(1, "%s: unknown expression primary", *argv);
 150         ++argv;
 151
 152         new = (p->create)(p, &argv);
 153         *argvp = argv;
 154         return (new);
 155 }
 156
 157 OPTION *
 158 option(name)
 159         char *name;
 160 {
 161         OPTION tmp;
 162         int typecompare __P((const void *, const void *));
 163
 164         tmp.name = name;
 165         return ((OPTION *)bsearch(&tmp, options,
 166             sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare));
 167 }
 168
 169 int
 170 typecompare(a, b)
 171         const void *a, *b;
 172 {
 173         return (strcmp(((OPTION *)a)->name, ((OPTION *)b)->name));
 174 }