1 1.29 andvar /* $NetBSD: option.c,v 1.29 2021/08/09 20:49:10 andvar Exp $ */ 2 1.6 tls 3 1.1 cgd /*- 4 1.8 mrg * Copyright (c) 1990, 1993, 1994 5 1.5 jtc * The Regents of the University of California. All rights reserved. 6 1.1 cgd * 7 1.1 cgd * This code is derived from software contributed to Berkeley by 8 1.1 cgd * Cimarron D. Taylor of the University of California, Berkeley. 9 1.1 cgd * 10 1.1 cgd * Redistribution and use in source and binary forms, with or without 11 1.1 cgd * modification, are permitted provided that the following conditions 12 1.1 cgd * are met: 13 1.1 cgd * 1. Redistributions of source code must retain the above copyright 14 1.1 cgd * notice, this list of conditions and the following disclaimer. 15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright 16 1.1 cgd * notice, this list of conditions and the following disclaimer in the 17 1.1 cgd * documentation and/or other materials provided with the distribution. 18 1.20 agc * 3. Neither the name of the University nor the names of its contributors 19 1.1 cgd * may be used to endorse or promote products derived from this software 20 1.1 cgd * without specific prior written permission. 21 1.1 cgd * 22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 1.1 cgd * SUCH DAMAGE. 33 1.1 cgd */ 34 1.1 cgd 35 1.7 lukem #include <sys/cdefs.h> 36 1.1 cgd #ifndef lint 37 1.7 lukem #if 0 38 1.8 mrg static char sccsid[] = "from: @(#)option.c 8.2 (Berkeley) 4/16/94"; 39 1.7 lukem #else 40 1.29 andvar __RCSID("$NetBSD: option.c,v 1.29 2021/08/09 20:49:10 andvar Exp $"); 41 1.7 lukem #endif 42 1.1 cgd #endif /* not lint */ 43 1.1 cgd 44 1.1 cgd #include <sys/types.h> 45 1.1 cgd #include <sys/stat.h> 46 1.5 jtc 47 1.5 jtc #include <err.h> 48 1.1 cgd #include <fts.h> 49 1.1 cgd #include <stdio.h> 50 1.1 cgd #include <stdlib.h> 51 1.1 cgd #include <string.h> 52 1.5 jtc 53 1.1 cgd #include "find.h" 54 1.1 cgd 55 1.24 apb int typecompare(const void *, const void *); 56 1.24 apb static OPTION *option(char *); 57 1.7 lukem 58 1.5 jtc /* NB: the following table must be sorted lexically. */ 59 1.8 mrg static OPTION const options[] = { 60 1.9 christos { "!", N_NOT, c_not, 0 }, 61 1.9 christos { "(", N_OPENPAREN, c_openparen, 0 }, 62 1.9 christos { ")", N_CLOSEPAREN, c_closeparen, 0 }, 63 1.9 christos { "-a", N_AND, c_null, 0 }, 64 1.15 jdolecek { "-amin", N_AMIN, c_amin, 1 }, 65 1.9 christos { "-and", N_AND, c_null, 0 }, 66 1.17 kleink { "-anewer", N_ANEWER, c_anewer, 1 }, 67 1.27 pgoyette { "-asince", N_ASINCE, c_asince, 1 }, 68 1.9 christos { "-atime", N_ATIME, c_atime, 1 }, 69 1.12 simonb { "-cmin", N_CMIN, c_cmin, 1 }, 70 1.16 kleink { "-cnewer", N_CNEWER, c_cnewer, 1 }, 71 1.27 pgoyette { "-csince", N_CSINCE, c_csince, 1 }, 72 1.9 christos { "-ctime", N_CTIME, c_ctime, 1 }, 73 1.25 elad { "-delete", N_DELETE, c_delete, 0 }, 74 1.9 christos { "-depth", N_DEPTH, c_depth, 0 }, 75 1.18 provos { "-empty", N_EMPTY, c_empty, 0 }, 76 1.9 christos { "-exec", N_EXEC, c_exec, 1 }, 77 1.18 provos { "-execdir", N_EXECDIR, c_execdir, 1 }, 78 1.23 jschauma { "-exit", N_EXIT, c_exit, 0 }, 79 1.22 reed { "-false", N_FALSE, c_false, 0 }, 80 1.10 lukem { "-flags", N_FLAGS, c_flags, 1 }, 81 1.9 christos { "-follow", N_FOLLOW, c_follow, 0 }, 82 1.21 reed { "-fprint", N_FPRINT, c_fprint, 1 }, 83 1.9 christos { "-fstype", N_FSTYPE, c_fstype, 1 }, 84 1.9 christos { "-group", N_GROUP, c_group, 1 }, 85 1.19 provos { "-iname", N_INAME, c_iname, 1 }, 86 1.9 christos { "-inum", N_INUM, c_inum, 1 }, 87 1.13 cgd { "-iregex", N_IREGEX, c_iregex, 1 }, 88 1.9 christos { "-links", N_LINKS, c_links, 1 }, 89 1.9 christos { "-ls", N_LS, c_ls, 0 }, 90 1.18 provos { "-maxdepth", N_MAXDEPTH, c_maxdepth, 1 }, 91 1.18 provos { "-mindepth", N_MINDEPTH, c_mindepth, 1 }, 92 1.12 simonb { "-mmin", N_MMIN, c_mmin, 1 }, 93 1.9 christos { "-mtime", N_MTIME, c_mtime, 1 }, 94 1.9 christos { "-name", N_NAME, c_name, 1 }, 95 1.9 christos { "-newer", N_NEWER, c_newer, 1 }, 96 1.27 pgoyette 97 1.29 andvar /* Aliases for compatibility with Gnu findutils */ 98 1.27 pgoyette { "-neweraa", N_ANEWER, c_anewer, 1 }, 99 1.27 pgoyette { "-newerat", N_ASINCE, c_asince, 1 }, 100 1.27 pgoyette { "-newercc", N_CNEWER, c_cnewer, 1 }, 101 1.27 pgoyette { "-newerct", N_CSINCE, c_csince, 1 }, 102 1.27 pgoyette { "-newermm", N_NEWER, c_newer, 1 }, 103 1.27 pgoyette { "-newermt", N_SINCE, c_since, 1 }, 104 1.27 pgoyette 105 1.27 pgoyette /* 106 1.27 pgoyette * Unimplemented Gnu findutils options 107 1.27 pgoyette * 108 1.27 pgoyette * If you implement any of these, be sure to re-sort the table 109 1.27 pgoyette * in ascii(7) order! 110 1.27 pgoyette * 111 1.27 pgoyette { "-newerBB", N_UNIMPL, c_unimpl, 1 }, 112 1.27 pgoyette { "-newerBa", N_UNIMPL, c_unimpl, 1 }, 113 1.27 pgoyette { "-newerBc", N_UNIMPL, c_unimpl, 1 }, 114 1.27 pgoyette { "-newerBm", N_UNIMPL, c_unimpl, 1 }, 115 1.27 pgoyette { "-newerBt", N_UNIMPL, c_unimpl, 1 }, 116 1.27 pgoyette { "-neweraB", N_UNIMPL, c_unimpl, 1 }, 117 1.27 pgoyette { "-newerac", N_UNIMPL, c_unimpl, 1 }, 118 1.27 pgoyette { "-neweram", N_UNIMPL, c_unimpl, 1 }, 119 1.27 pgoyette { "-newerca", N_UNIMPL, c_unimpl, 1 }, 120 1.27 pgoyette { "-newercm", N_UNIMPL, c_unimpl, 1 }, 121 1.27 pgoyette { "-newercB", N_UNIMPL, c_unimpl, 1 }, 122 1.27 pgoyette { "-newermB", N_UNIMPL, c_unimpl, 1 }, 123 1.27 pgoyette { "-newerma", N_UNIMPL, c_unimpl, 1 }, 124 1.27 pgoyette { "-newermc", N_UNIMPL, c_unimpl, 1 }, 125 1.27 pgoyette * 126 1.27 pgoyette */ 127 1.27 pgoyette 128 1.9 christos { "-nogroup", N_NOGROUP, c_nogroup, 0 }, 129 1.29 andvar /* Alias for compatibility with Gnu findutils */ 130 1.28 mrg { "-not", N_NOT, c_not, 0 }, 131 1.9 christos { "-nouser", N_NOUSER, c_nouser, 0 }, 132 1.9 christos { "-o", N_OR, c_or, 0 }, 133 1.9 christos { "-ok", N_OK, c_exec, 1 }, 134 1.9 christos { "-or", N_OR, c_or, 0 }, 135 1.9 christos { "-path", N_PATH, c_path, 1 }, 136 1.9 christos { "-perm", N_PERM, c_perm, 1 }, 137 1.9 christos { "-print", N_PRINT, c_print, 0 }, 138 1.9 christos { "-print0", N_PRINT0, c_print0, 0 }, 139 1.11 lukem { "-printx", N_PRINTX, c_printx, 0 }, 140 1.9 christos { "-prune", N_PRUNE, c_prune, 0 }, 141 1.13 cgd { "-regex", N_REGEX, c_regex, 1 }, 142 1.26 perry { "-rm", N_DELETE, c_delete, 0 }, 143 1.27 pgoyette { "-since", N_SINCE, c_since, 1 }, 144 1.9 christos { "-size", N_SIZE, c_size, 1 }, 145 1.9 christos { "-type", N_TYPE, c_type, 1 }, 146 1.9 christos { "-user", N_USER, c_user, 1 }, 147 1.9 christos { "-xdev", N_XDEV, c_xdev, 0 } 148 1.1 cgd }; 149 1.1 cgd 150 1.1 cgd /* 151 1.1 cgd * find_create -- 152 1.1 cgd * create a node corresponding to a command line argument. 153 1.1 cgd * 154 1.1 cgd * TODO: 155 1.1 cgd * add create/process function pointers to node, so we can skip 156 1.1 cgd * this switch stuff. 157 1.1 cgd */ 158 1.1 cgd PLAN * 159 1.24 apb find_create(char ***argvp) 160 1.1 cgd { 161 1.7 lukem OPTION *p; 162 1.1 cgd PLAN *new; 163 1.1 cgd char **argv; 164 1.27 pgoyette char *opt; 165 1.1 cgd 166 1.1 cgd argv = *argvp; 167 1.27 pgoyette opt = *argv; 168 1.1 cgd 169 1.27 pgoyette if ((p = option(opt)) == NULL) 170 1.27 pgoyette errx(1, "%s: unknown option", opt); 171 1.1 cgd ++argv; 172 1.9 christos if (p->arg && !*argv) 173 1.27 pgoyette errx(1, "%s: requires additional arguments", opt); 174 1.1 cgd 175 1.27 pgoyette new = (p->create)(&argv, p->token == N_OK, opt); 176 1.9 christos 177 1.1 cgd *argvp = argv; 178 1.5 jtc return (new); 179 1.1 cgd } 180 1.1 cgd 181 1.8 mrg static OPTION * 182 1.24 apb option(char *name) 183 1.1 cgd { 184 1.1 cgd OPTION tmp; 185 1.1 cgd 186 1.1 cgd tmp.name = name; 187 1.5 jtc return ((OPTION *)bsearch(&tmp, options, 188 1.1 cgd sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare)); 189 1.1 cgd } 190 1.5 jtc 191 1.5 jtc int 192 1.24 apb typecompare(const void *a, const void *b) 193 1.1 cgd { 194 1.14 enami 195 1.24 apb return (strcmp(((const OPTION *)a)->name, ((const OPTION *)b)->name)); 196 1.1 cgd } 197