1/*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1990, 1993, 1994 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Cimarron D. Taylor of the University of California, Berkeley. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 */ 34 35#include <sys/types.h> 36#include <sys/stat.h> 37 38#include <err.h> 39#include <fts.h> 40#include <regex.h> 41#include <stdio.h> 42#include <stdlib.h> 43#include <string.h> 44 45#include "find.h" 46 47static int typecompare(const void *, const void *); 48 49/* NB: the following table must be sorted lexically. */ 50/* Options listed with C++ comments are in gnu find, but not our find */ 51static OPTION const options[] = { 52 { "!", c_simple, f_not, 0 }, 53 { "(", c_simple, f_openparen, 0 }, 54 { ")", c_simple, f_closeparen, 0 }, 55#if HAVE_STRUCT_STAT_ST_BIRTHTIME 56 { "-Bmin", c_Xmin, f_Xmin, F_TIME_B }, 57 { "-Bnewer", c_newer, f_newer, F_TIME_B }, 58 { "-Btime", c_Xtime, f_Xtime, F_TIME_B }, 59#endif 60 { "-a", c_and, NULL, 0 }, 61#ifdef ACL_TYPE_NFS4 62 { "-acl", c_acl, f_acl, 0 }, 63#endif 64 { "-amin", c_Xmin, f_Xmin, F_TIME_A }, 65 { "-and", c_and, NULL, 0 }, 66 { "-anewer", c_newer, f_newer, F_TIME_A }, 67 { "-atime", c_Xtime, f_Xtime, F_TIME_A }, 68 { "-cmin", c_Xmin, f_Xmin, F_TIME_C }, 69 { "-cnewer", c_newer, f_newer, F_TIME_C }, 70 { "-ctime", c_Xtime, f_Xtime, F_TIME_C }, 71 { "-d", c_depth, f_depth, 0 }, 72// -daystart 73 { "-delete", c_delete, f_delete, 0 }, 74 { "-depth", c_depth, f_depth, 0 }, 75 { "-empty", c_empty, f_empty, 0 }, 76 { "-exec", c_exec, f_exec, 0 }, 77 { "-execdir", c_exec, f_exec, F_EXECDIR }, 78 { "-executable", c_simple, f_executable, 0 }, 79 { "-false", c_simple, f_false, 0 }, 80#if HAVE_STRUCT_STAT_ST_FLAGS 81 { "-flags", c_flags, f_flags, 0 }, 82#endif 83// -fls 84 { "-follow", c_follow, f_always_true, 0 }, 85// -fprint 86// -fprint0 87// -fprintf 88#if HAVE_STRUCT_STATFS_F_FSTYPENAME 89 { "-fstype", c_fstype, f_fstype, 0 }, 90#endif 91 { "-gid", c_group, f_group, 0 }, 92 { "-group", c_group, f_group, 0 }, 93 { "-ignore_readdir_race",c_ignore_readdir_race, f_always_true,0 }, 94 { "-ilname", c_name, f_name, F_LINK | F_IGNCASE }, 95 { "-iname", c_name, f_name, F_IGNCASE }, 96 { "-inum", c_inum, f_inum, 0 }, 97 { "-ipath", c_name, f_path, F_IGNCASE }, 98 { "-iregex", c_regex, f_regex, F_IGNCASE }, 99 { "-iwholename",c_name, f_path, F_IGNCASE }, 100 { "-links", c_links, f_links, 0 }, 101 { "-lname", c_name, f_name, F_LINK }, 102 { "-ls", c_ls, f_ls, 0 }, 103 { "-maxdepth", c_mXXdepth, f_always_true, F_MAXDEPTH }, 104 { "-mindepth", c_mXXdepth, f_always_true, 0 }, 105 { "-mmin", c_Xmin, f_Xmin, 0 }, 106 { "-mnewer", c_newer, f_newer, 0 }, 107 { "-mount", c_xdev, f_always_true, 0 }, 108 { "-mtime", c_Xtime, f_Xtime, 0 }, 109 { "-name", c_name, f_name, 0 }, 110 { "-newer", c_newer, f_newer, 0 }, 111#if HAVE_STRUCT_STAT_ST_BIRTHTIME 112 { "-newerBB", c_newer, f_newer, F_TIME_B | F_TIME2_B }, 113 { "-newerBa", c_newer, f_newer, F_TIME_B | F_TIME2_A }, 114 { "-newerBc", c_newer, f_newer, F_TIME_B | F_TIME2_C }, 115 { "-newerBm", c_newer, f_newer, F_TIME_B }, 116 { "-newerBt", c_newer, f_newer, F_TIME_B | F_TIME2_T }, 117 { "-neweraB", c_newer, f_newer, F_TIME_A | F_TIME2_B }, 118#endif 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#if HAVE_STRUCT_STAT_ST_BIRTHTIME 124 { "-newercB", c_newer, f_newer, F_TIME_C | F_TIME2_B }, 125#endif 126 { "-newerca", c_newer, f_newer, F_TIME_C | F_TIME2_A }, 127 { "-newercc", c_newer, f_newer, F_TIME_C | F_TIME2_C }, 128 { "-newercm", c_newer, f_newer, F_TIME_C }, 129 { "-newerct", c_newer, f_newer, F_TIME_C | F_TIME2_T }, 130#if HAVE_STRUCT_STAT_ST_BIRTHTIME 131 { "-newermB", c_newer, f_newer, F_TIME2_B }, 132#endif 133 { "-newerma", c_newer, f_newer, F_TIME2_A }, 134 { "-newermc", c_newer, f_newer, F_TIME2_C }, 135 { "-newermm", c_newer, f_newer, 0 }, 136 { "-newermt", c_newer, f_newer, F_TIME2_T }, 137 { "-nogroup", c_nogroup, f_nogroup, 0 }, 138 { "-noignore_readdir_race",c_ignore_readdir_race, f_always_true,0 }, 139 { "-noleaf", c_simple, f_always_true, 0 }, 140 { "-not", c_simple, f_not, 0 }, 141 { "-nouser", c_nouser, f_nouser, 0 }, 142 { "-o", c_simple, f_or, 0 }, 143 { "-ok", c_exec, f_exec, F_NEEDOK }, 144 { "-okdir", c_exec, f_exec, F_NEEDOK | F_EXECDIR }, 145 { "-or", c_simple, f_or, 0 }, 146 { "-path", c_name, f_path, 0 }, 147 { "-perm", c_perm, f_perm, 0 }, 148 { "-print", c_print, f_print, 0 }, 149 { "-print0", c_print, f_print0, 0 }, 150// -printf 151 { "-prune", c_simple, f_prune, 0 }, 152 { "-quit", c_simple, f_quit, 0 }, 153 { "-readable", c_simple, f_readable, 0 }, 154 { "-regex", c_regex, f_regex, 0 }, 155 { "-samefile", c_samefile, f_inum, 0 }, 156 { "-size", c_size, f_size, 0 }, 157 { "-sparse", c_sparse, f_sparse, 0 }, 158 { "-true", c_simple, f_always_true, 0 }, 159 { "-type", c_type, f_type, 0 }, 160 { "-uid", c_user, f_user, 0 }, 161 { "-user", c_user, f_user, 0 }, 162 { "-wholename", c_name, f_path, 0 }, 163 { "-writable", c_simple, f_writable, 0 }, 164 { "-xdev", c_xdev, f_always_true, 0 }, 165// -xtype 166}; 167 168/* 169 * find_create -- 170 * create a node corresponding to a command line argument. 171 * 172 * TODO: 173 * add create/process function pointers to node, so we can skip 174 * this switch stuff. 175 */ 176PLAN * 177find_create(char ***argvp) 178{ 179 OPTION *p; 180 PLAN *new; 181 char **argv; 182 183 argv = *argvp; 184 185 if ((p = lookup_option(*argv)) == NULL) 186 errx(1, "%s: unknown primary or operator", *argv); 187 ++argv; 188 189 new = (p->create)(p, &argv); 190 *argvp = argv; 191 return (new); 192} 193 194OPTION * 195lookup_option(const char *name) 196{ 197 OPTION tmp; 198 199 tmp.name = name; 200 return ((OPTION *)bsearch(&tmp, options, 201 sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare)); 202} 203 204static int 205typecompare(const void *a, const void *b) 206{ 207 return (strcmp(((const OPTION *)a)->name, ((const OPTION *)b)->name)); 208} 209