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 #endif /* not lint */
  42
  43 #include <sys/cdefs.h>
  44 __FBSDID("$FreeBSD: src/usr.bin/find/option.c,v 1.28 2009/12/13 03:14:06 delphij Exp $");
  45
  46 #include <sys/types.h>
  47 #include <sys/stat.h>
  48
  49 #include <err.h>
  50 #include <fts.h>
  51 #include <regex.h>
  52 #include <stdio.h>
  53 #include <stdlib.h>
  54 #include <string.h>
  55
  56 #include "find.h"
  57
  58 int typecompare(const void *, const void *);
  59
  60 /* NB: the following table must be sorted lexically. */
  61 /* Options listed with C++ comments are in gnu find, but not our find */
  62 static OPTION const options[] = {
  63         { "!",          c_simple,       f_not,          0 },
  64         { "(",          c_simple,       f_openparen,    0 },
  65         { ")",          c_simple,       f_closeparen,   0 },
  66         { "-Bmin",      c_Xmin,         f_Xmin,         F_TIME_B },
  67         { "-Bnewer",    c_newer,        f_newer,        F_TIME_B },
  68         { "-Btime",     c_Xtime,        f_Xtime,        F_TIME_B },
  69         { "-a",         c_and,          NULL,           0 },
  70         { "-acl",       c_acl,          f_acl,          0 },
  71         { "-amin",      c_Xmin,         f_Xmin,         F_TIME_A },
  72         { "-and",       c_and,          NULL,           0 },
  73         { "-anewer",    c_newer,        f_newer,        F_TIME_A },
  74         { "-atime",     c_Xtime,        f_Xtime,        F_TIME_A },
  75         { "-cmin",      c_Xmin,         f_Xmin,         F_TIME_C },
  76         { "-cnewer",    c_newer,        f_newer,        F_TIME_C },
  77         { "-ctime",     c_Xtime,        f_Xtime,        F_TIME_C },
  78         { "-d",         c_depth,        f_depth,        0 },
  79 // -daystart
  80         { "-delete",    c_delete,       f_delete,       0 },
  81         { "-depth",     c_depth,        f_depth,        0 },
  82         { "-empty",     c_empty,        f_empty,        0 },
  83         { "-exec",      c_exec,         f_exec,         0 },
  84         { "-execdir",   c_exec,         f_exec,         F_EXECDIR },
  85         { "-false",     c_simple,       f_false,        0 },
  86         { "-flags",     c_flags,        f_flags,        0 },
  87 // -fls
  88         { "-follow",    c_follow,       f_always_true,  0 },
  89 // -fprint
  90 // -fprint0
  91 // -fprintf
  92         { "-fstype",    c_fstype,       f_fstype,       0 },
  93         { "-gid",       c_group,        f_group,        0 },
  94         { "-group",     c_group,        f_group,        0 },
  95         { "-ignore_readdir_race",c_simple, f_always_true,0 },
  96         { "-ilname",    c_name,         f_name,         F_LINK | F_IGNCASE },
  97         { "-iname",     c_name,         f_name,         F_IGNCASE },
  98         { "-inum",      c_inum,         f_inum,         0 },
  99         { "-ipath",     c_name,         f_path,         F_IGNCASE },
 100         { "-iregex",    c_regex,        f_regex,        F_IGNCASE },
 101         { "-iwholename",c_name,         f_path,         F_IGNCASE },
 102         { "-links",     c_links,        f_links,        0 },
 103         { "-lname",     c_name,         f_name,         F_LINK },
 104         { "-ls",        c_ls,           f_ls,           0 },
 105         { "-maxdepth",  c_mXXdepth,     f_always_true,  F_MAXDEPTH },
 106         { "-mindepth",  c_mXXdepth,     f_always_true,  0 },
 107         { "-mmin",      c_Xmin,         f_Xmin,         0 },
 108         { "-mnewer",    c_newer,        f_newer,        0 },
 109         { "-mount",     c_xdev,         f_always_true,  0 },
 110         { "-mtime",     c_Xtime,        f_Xtime,        0 },
 111         { "-name",      c_name,         f_name,         0 },
 112         { "-newer",     c_newer,        f_newer,        0 },
 113         { "-newerBB",   c_newer,        f_newer,        F_TIME_B | F_TIME2_B },
 114         { "-newerBa",   c_newer,        f_newer,        F_TIME_B | F_TIME2_A },
 115         { "-newerBc",   c_newer,        f_newer,        F_TIME_B | F_TIME2_C },
 116         { "-newerBm",   c_newer,        f_newer,        F_TIME_B },
 117         { "-newerBt",   c_newer,        f_newer,        F_TIME_B | F_TIME2_T },
 118         { "-neweraB",   c_newer,        f_newer,        F_TIME_A | F_TIME2_B },
 119         { "-neweraa",   c_newer,        f_newer,        F_TIME_A | F_TIME2_A },
 120         { "-newerac",   c_newer,        f_newer,        F_TIME_A | F_TIME2_C },
 121         { "-neweram",   c_newer,        f_newer,        F_TIME_A },
 122         { "-newerat",   c_newer,        f_newer,        F_TIME_A | F_TIME2_T },
 123         { "-newercB",   c_newer,        f_newer,        F_TIME_C | F_TIME2_B },
 124         { "-newerca",   c_newer,        f_newer,        F_TIME_C | F_TIME2_A },
 125         { "-newercc",   c_newer,        f_newer,        F_TIME_C | F_TIME2_C },
 126         { "-newercm",   c_newer,        f_newer,        F_TIME_C },
 127         { "-newerct",   c_newer,        f_newer,        F_TIME_C | F_TIME2_T },
 128         { "-newermB",   c_newer,        f_newer,        F_TIME2_B },
 129         { "-newerma",   c_newer,        f_newer,        F_TIME2_A },
 130         { "-newermc",   c_newer,        f_newer,        F_TIME2_C },
 131         { "-newermm",   c_newer,        f_newer,        0 },
 132         { "-newermt",   c_newer,        f_newer,        F_TIME2_T },
 133         { "-nogroup",   c_nogroup,      f_nogroup,      0 },
 134         { "-noignore_readdir_race",c_simple, f_always_true,0 },
 135         { "-noleaf",    c_simple,       f_always_true,  0 },
 136         { "-not",       c_simple,       f_not,          0 },
 137         { "-nouser",    c_nouser,       f_nouser,       0 },
 138         { "-o",         c_simple,       f_or,           0 },
 139         { "-ok",        c_exec,         f_exec,         F_NEEDOK },
 140         { "-okdir",     c_exec,         f_exec,         F_NEEDOK | F_EXECDIR },
 141         { "-or",        c_simple,       f_or,           0 },
 142         { "-path",      c_name,         f_path,         0 },
 143         { "-perm",      c_perm,         f_perm,         0 },
 144         { "-print",     c_print,        f_print,        0 },
 145         { "-print0",    c_print,        f_print0,       0 },
 146 // -printf
 147         { "-prune",     c_simple,       f_prune,        0 },
 148         { "-quit",      c_simple,       f_quit,         0 },
 149         { "-regex",     c_regex,        f_regex,        0 },
 150         { "-samefile",  c_samefile,     f_inum,         0 },
 151         { "-size",      c_size,         f_size,         0 },
 152         { "-true",      c_simple,       f_always_true,  0 },
 153         { "-type",      c_type,         f_type,         0 },
 154         { "-uid",       c_user,         f_user,         0 },
 155         { "-user",      c_user,         f_user,         0 },
 156         { "-wholename", c_name,         f_path,         0 },
 157 #ifdef __APPLE__
 158         { "-xattr",     c_simple,       f_xattr,        0 },
 159         { "-xattrname", c_name,         f_xattrname,    0 },
 160 #endif /* __APPLE__ */
 161         { "-xdev",      c_xdev,         f_always_true,  0 },
 162 // -xtype
 163 };
 164
 165 /*
 166  * find_create --
 167  *      create a node corresponding to a command line argument.
 168  *
 169  * TODO:
 170  *      add create/process function pointers to node, so we can skip
 171  *      this switch stuff.
 172  */
 173 PLAN *
 174 find_create(char ***argvp)
 175 {
 176         OPTION *p;
 177         PLAN *new;
 178         char **argv;
 179
 180         argv = *argvp;
 181
 182         if ((p = lookup_option(*argv)) == NULL)
 183                 errx(1, "%s: unknown option", *argv);
 184         ++argv;
 185
 186         new = (p->create)(p, &argv);
 187         *argvp = argv;
 188         return (new);
 189 }
 190
 191 OPTION *
 192 lookup_option(const char *name)
 193 {
 194         OPTION tmp;
 195
 196         tmp.name = name;
 197         return ((OPTION *)bsearch(&tmp, options,
 198             sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare));
 199 }
 200
 201 int
 202 typecompare(const void *a, const void *b)
 203 {
 204         return (strcmp(((const OPTION *)a)->name, ((const OPTION *)b)->name));
 205 }