1 /* $NetBSD: option.c,v 1.17 2001/12/02 12:46:39 kleink Exp $ */ 2 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. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 #ifndef lint 41 #if 0 42 static char sccsid[] = "from: @(#)option.c 8.2 (Berkeley) 4/16/94"; 43 #else 44 __RCSID("$NetBSD: option.c,v 1.17 2001/12/02 12:46:39 kleink Exp $"); 45 #endif 46 #endif /* not lint */ 47 48 #include <sys/types.h> 49 #include <sys/stat.h> 50 51 #include <err.h> 52 #include <fts.h> 53 #include <stdio.h> 54 #include <stdlib.h> 55 #include <string.h> 56 57 #include "find.h" 58 59 int typecompare __P((const void *, const void *)); 60 static OPTION *option __P((char *)); 61 62 /* NB: the following table must be sorted lexically. */ 63 static OPTION const options[] = { 64 { "!", N_NOT, c_not, 0 }, 65 { "(", N_OPENPAREN, c_openparen, 0 }, 66 { ")", N_CLOSEPAREN, c_closeparen, 0 }, 67 { "-a", N_AND, c_null, 0 }, 68 { "-amin", N_AMIN, c_amin, 1 }, 69 { "-and", N_AND, c_null, 0 }, 70 { "-anewer", N_ANEWER, c_anewer, 1 }, 71 { "-atime", N_ATIME, c_atime, 1 }, 72 { "-cmin", N_CMIN, c_cmin, 1 }, 73 { "-cnewer", N_CNEWER, c_cnewer, 1 }, 74 { "-ctime", N_CTIME, c_ctime, 1 }, 75 { "-depth", N_DEPTH, c_depth, 0 }, 76 { "-exec", N_EXEC, c_exec, 1 }, 77 { "-flags", N_FLAGS, c_flags, 1 }, 78 { "-follow", N_FOLLOW, c_follow, 0 }, 79 { "-fstype", N_FSTYPE, c_fstype, 1 }, 80 { "-group", N_GROUP, c_group, 1 }, 81 { "-inum", N_INUM, c_inum, 1 }, 82 { "-iregex", N_IREGEX, c_iregex, 1 }, 83 { "-links", N_LINKS, c_links, 1 }, 84 { "-ls", N_LS, c_ls, 0 }, 85 { "-mmin", N_MMIN, c_mmin, 1 }, 86 { "-mtime", N_MTIME, c_mtime, 1 }, 87 { "-name", N_NAME, c_name, 1 }, 88 { "-newer", N_NEWER, c_newer, 1 }, 89 { "-nogroup", N_NOGROUP, c_nogroup, 0 }, 90 { "-nouser", N_NOUSER, c_nouser, 0 }, 91 { "-o", N_OR, c_or, 0 }, 92 { "-ok", N_OK, c_exec, 1 }, 93 { "-or", N_OR, c_or, 0 }, 94 { "-path", N_PATH, c_path, 1 }, 95 { "-perm", N_PERM, c_perm, 1 }, 96 { "-print", N_PRINT, c_print, 0 }, 97 { "-print0", N_PRINT0, c_print0, 0 }, 98 { "-printx", N_PRINTX, c_printx, 0 }, 99 { "-prune", N_PRUNE, c_prune, 0 }, 100 { "-regex", N_REGEX, c_regex, 1 }, 101 { "-size", N_SIZE, c_size, 1 }, 102 { "-type", N_TYPE, c_type, 1 }, 103 { "-user", N_USER, c_user, 1 }, 104 { "-xdev", N_XDEV, c_xdev, 0 } 105 }; 106 107 /* 108 * find_create -- 109 * create a node corresponding to a command line argument. 110 * 111 * TODO: 112 * add create/process function pointers to node, so we can skip 113 * this switch stuff. 114 */ 115 PLAN * 116 find_create(argvp) 117 char ***argvp; 118 { 119 OPTION *p; 120 PLAN *new; 121 char **argv; 122 123 argv = *argvp; 124 125 if ((p = option(*argv)) == NULL) 126 errx(1, "%s: unknown option", *argv); 127 ++argv; 128 if (p->arg && !*argv) 129 errx(1, "%s: requires additional arguments", *--argv); 130 131 new = (p->create)(&argv, p->token == N_OK); 132 133 *argvp = argv; 134 return (new); 135 } 136 137 static OPTION * 138 option(name) 139 char *name; 140 { 141 OPTION tmp; 142 143 tmp.name = name; 144 return ((OPTION *)bsearch(&tmp, options, 145 sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare)); 146 } 147 148 int 149 typecompare(a, b) 150 const void *a, *b; 151 { 152 153 return (strcmp(((OPTION *)a)->name, ((OPTION *)b)->name)); 154 } 155