option.c revision 1.8 1 /* $NetBSD: option.c,v 1.8 1998/02/02 14:02:28 mrg 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.8 1998/02/02 14:02:28 mrg 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, O_ZERO },
65 { "(", N_OPENPAREN, c_openparen, O_ZERO },
66 { ")", N_CLOSEPAREN, c_closeparen, O_ZERO },
67 { "-a", N_AND, NULL, O_NONE },
68 { "-and", N_AND, NULL, O_NONE },
69 { "-atime", N_ATIME, c_atime, O_ARGV },
70 { "-ctime", N_CTIME, c_ctime, O_ARGV },
71 { "-depth", N_DEPTH, c_depth, O_ZERO },
72 { "-exec", N_EXEC, c_exec, O_ARGVP },
73 { "-follow", N_FOLLOW, c_follow, O_ZERO },
74 { "-fstype", N_FSTYPE, c_fstype, O_ARGV },
75 { "-group", N_GROUP, c_group, O_ARGV },
76 { "-inum", N_INUM, c_inum, O_ARGV },
77 { "-links", N_LINKS, c_links, O_ARGV },
78 { "-ls", N_LS, c_ls, O_ZERO },
79 { "-mtime", N_MTIME, c_mtime, O_ARGV },
80 { "-name", N_NAME, c_name, O_ARGV },
81 { "-newer", N_NEWER, c_newer, O_ARGV },
82 { "-nogroup", N_NOGROUP, c_nogroup, O_ZERO },
83 { "-nouser", N_NOUSER, c_nouser, O_ZERO },
84 { "-o", N_OR, c_or, O_ZERO },
85 { "-ok", N_OK, c_exec, O_ARGVP },
86 { "-or", N_OR, c_or, O_ZERO },
87 { "-path", N_PATH, c_path, O_ARGV },
88 { "-perm", N_PERM, c_perm, O_ARGV },
89 { "-print", N_PRINT, c_print, O_ZERO },
90 { "-print0", N_PRINT0, c_print0, O_ZERO },
91 { "-prune", N_PRUNE, c_prune, O_ZERO },
92 { "-size", N_SIZE, c_size, O_ARGV },
93 { "-type", N_TYPE, c_type, O_ARGV },
94 { "-user", N_USER, c_user, O_ARGV },
95 { "-xdev", N_XDEV, c_xdev, O_ZERO },
96 };
97
98 /*
99 * find_create --
100 * create a node corresponding to a command line argument.
101 *
102 * TODO:
103 * add create/process function pointers to node, so we can skip
104 * this switch stuff.
105 */
106 PLAN *
107 find_create(argvp)
108 char ***argvp;
109 {
110 OPTION *p;
111 PLAN *new;
112 char **argv;
113
114 argv = *argvp;
115
116 if ((p = option(*argv)) == NULL)
117 errx(1, "%s: unknown option", *argv);
118 ++argv;
119 if (p->flags & (O_ARGV|O_ARGVP) && !*argv)
120 errx(1, "%s: requires additional arguments", *--argv);
121
122 switch(p->flags) {
123 case O_NONE:
124 new = NULL;
125 break;
126 case O_ZERO:
127 new = (p->create)();
128 break;
129 case O_ARGV:
130 new = (p->create)(*argv++);
131 break;
132 case O_ARGVP:
133 new = (p->create)(&argv, p->token == N_OK);
134 break;
135 default:
136 abort();
137 }
138 *argvp = argv;
139 return (new);
140 }
141
142 static OPTION *
143 option(name)
144 char *name;
145 {
146 OPTION tmp;
147
148 tmp.name = name;
149 return ((OPTION *)bsearch(&tmp, options,
150 sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare));
151 }
152
153 int
154 typecompare(a, b)
155 const void *a, *b;
156 {
157 return (strcmp(((OPTION *)a)->name, ((OPTION *)b)->name));
158 }
159