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