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 * @(#)option.c 8.2 (Berkeley) 4/16/94 37 * $FreeBSD: src/usr.bin/find/option.c,v 1.23 2004/07/29 03:29:44 tjr Exp $ 38 * $DragonFly: src/usr.bin/find/option.c,v 1.5 2005/02/13 23:49:53 cpressey Exp $ 39 */ 40 41 #include <sys/types.h> 42 #include <sys/stat.h> 43 44 #include <err.h> 45 #include <fts.h> 46 #include <regex.h> 47 #include <stdio.h> 48 #include <stdlib.h> 49 #include <string.h> 50 51 #include "find.h" 52 53 int typecompare(const void *, const void *); 54 55 /* NB: the following table must be sorted lexically. */ 56 static OPTION const options[] = { 57 { "!", c_simple, f_not, 0 }, 58 { "(", c_simple, f_openparen, 0 }, 59 { ")", c_simple, f_closeparen, 0 }, 60 { "-a", c_and, NULL, 0 }, 61 { "-amin", c_Xmin, f_Xmin, F_TIME_A }, 62 { "-and", c_and, NULL, 0 }, 63 { "-anewer", c_newer, f_newer, F_TIME_A }, 64 { "-atime", c_Xtime, f_Xtime, F_TIME_A }, 65 { "-cmin", c_Xmin, f_Xmin, F_TIME_C }, 66 { "-cnewer", c_newer, f_newer, F_TIME_C }, 67 { "-ctime", c_Xtime, f_Xtime, F_TIME_C }, 68 { "-delete", c_delete, f_delete, 0 }, 69 { "-depth", c_depth, f_depth, 0 }, 70 { "-empty", c_empty, f_empty, 0 }, 71 { "-exec", c_exec, f_exec, 0 }, 72 { "-execdir", c_exec, f_exec, F_EXECDIR }, 73 { "-false", c_simple, f_not, 0 }, 74 { "-flags", c_flags, f_flags, 0 }, 75 { "-follow", c_follow, f_always_true, 0 }, 76 { "-fstype", c_fstype, f_fstype, 0 }, 77 { "-group", c_group, f_group, 0 }, 78 { "-iname", c_name, f_name, F_IGNCASE }, 79 { "-inum", c_inum, f_inum, 0 }, 80 { "-ipath", c_name, f_path, F_IGNCASE }, 81 { "-iregex", c_regex, f_regex, F_IGNCASE }, 82 { "-links", c_links, f_links, 0 }, 83 { "-ls", c_ls, f_ls, 0 }, 84 { "-maxdepth", c_mXXdepth, f_always_true, F_MAXDEPTH }, 85 { "-mindepth", c_mXXdepth, f_always_true, 0 }, 86 { "-mmin", c_Xmin, f_Xmin, 0 }, 87 { "-mnewer", c_newer, f_newer, 0 }, 88 { "-mtime", c_Xtime, f_Xtime, 0 }, 89 { "-name", c_name, f_name, 0 }, 90 { "-newer", c_newer, f_newer, 0 }, 91 { "-neweraa", c_newer, f_newer, F_TIME_A | F_TIME2_A }, 92 { "-newerac", c_newer, f_newer, F_TIME_A | F_TIME2_C }, 93 { "-neweram", c_newer, f_newer, F_TIME_A }, 94 { "-newerat", c_newer, f_newer, F_TIME_A | F_TIME2_T }, 95 { "-newerca", c_newer, f_newer, F_TIME_C | F_TIME2_A }, 96 { "-newercc", c_newer, f_newer, F_TIME_C | F_TIME2_C }, 97 { "-newercm", c_newer, f_newer, F_TIME_C }, 98 { "-newerct", c_newer, f_newer, F_TIME_C | F_TIME2_T }, 99 { "-newerma", c_newer, f_newer, F_TIME2_A }, 100 { "-newermc", c_newer, f_newer, F_TIME2_C }, 101 { "-newermm", c_newer, f_newer, 0 }, 102 { "-newermt", c_newer, f_newer, F_TIME2_T }, 103 { "-nogroup", c_nogroup, f_nogroup, 0 }, 104 { "-not", c_simple, f_not, 0 }, 105 { "-nouser", c_nouser, f_nouser, 0 }, 106 { "-o", c_simple, f_or, 0 }, 107 { "-ok", c_exec, f_exec, F_NEEDOK }, 108 { "-okdir", c_exec, f_exec, F_NEEDOK | F_EXECDIR }, 109 { "-or", c_simple, f_or, 0 }, 110 { "-path", c_name, f_path, 0 }, 111 { "-perm", c_perm, f_perm, 0 }, 112 { "-print", c_print, f_print, 0 }, 113 { "-print0", c_print, f_print0, 0 }, 114 { "-prune", c_simple, f_prune, 0 }, 115 { "-regex", c_regex, f_regex, 0 }, 116 { "-size", c_size, f_size, 0 }, 117 { "-type", c_type, f_type, 0 }, 118 { "-user", c_user, f_user, 0 }, 119 { "-xdev", c_xdev, f_always_true, 0 }, 120 }; 121 122 /* 123 * find_create -- 124 * create a node corresponding to a command line argument. 125 * 126 * TODO: 127 * add create/process function pointers to node, so we can skip 128 * this switch stuff. 129 */ 130 PLAN * 131 find_create(char ***argvp) 132 { 133 OPTION *p; 134 PLAN *new; 135 char **argv; 136 137 argv = *argvp; 138 139 if ((p = lookup_option(*argv)) == NULL) 140 errx(1, "%s: unknown option", *argv); 141 ++argv; 142 143 new = (p->create)(p, &argv); 144 *argvp = argv; 145 return (new); 146 } 147 148 OPTION * 149 lookup_option(const char *name) 150 { 151 OPTION tmp; 152 153 tmp.name = name; 154 return ((OPTION *)bsearch(&tmp, options, 155 sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare)); 156 } 157 158 int 159 typecompare(const void *a, const void *b) 160 { 161 return (strcmp(((const OPTION *)a)->name, ((const OPTION *)b)->name)); 162 } 163