]> git.saurik.com Git - apple/shell_cmds.git/blame - find/option.c
shell_cmds-116.tar.gz
[apple/shell_cmds.git] / find / option.c
CommitLineData
44bd5ea7
A
1/*-
2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Cimarron D. Taylor of the University of California, Berkeley.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
44bd5ea7 37#ifndef lint
c0fcf4e1
A
38/*
39static char sccsid[] = "@(#)option.c 8.2 (Berkeley) 4/16/94";
40*/
44bd5ea7
A
41#endif /* not lint */
42
e1a085ba
A
43#include <sys/cdefs.h>
44__FBSDID("$FreeBSD: src/usr.bin/find/option.c,v 1.25 2006/04/05 23:06:11 ceri Exp $");
45
44bd5ea7
A
46#include <sys/types.h>
47#include <sys/stat.h>
48
49#include <err.h>
50#include <fts.h>
c0fcf4e1 51#include <regex.h>
44bd5ea7
A
52#include <stdio.h>
53#include <stdlib.h>
54#include <string.h>
55
56#include "find.h"
57
e1a085ba
A
58int typecompare(const void *, const void *);
59
44bd5ea7
A
60/* NB: the following table must be sorted lexically. */
61static OPTION const options[] = {
c0fcf4e1
A
62 { "!", c_simple, f_not, 0 },
63 { "(", c_simple, f_openparen, 0 },
64 { ")", c_simple, f_closeparen, 0 },
e1a085ba
A
65 { "-Bmin", c_Xmin, f_Xmin, F_TIME_B },
66 { "-Bnewer", c_newer, f_newer, F_TIME_B },
67 { "-Btime", c_Xtime, f_Xtime, F_TIME_B },
c0fcf4e1 68 { "-a", c_and, NULL, 0 },
e1a085ba
A
69#ifndef __APPLE__
70 { "-acl", c_acl, f_acl, 0 },
71#endif /* !__APPLE__ */
c0fcf4e1
A
72 { "-amin", c_Xmin, f_Xmin, F_TIME_A },
73 { "-and", c_and, NULL, 0 },
74 { "-anewer", c_newer, f_newer, F_TIME_A },
75 { "-atime", c_Xtime, f_Xtime, F_TIME_A },
76 { "-cmin", c_Xmin, f_Xmin, F_TIME_C },
77 { "-cnewer", c_newer, f_newer, F_TIME_C },
78 { "-ctime", c_Xtime, f_Xtime, F_TIME_C },
79 { "-delete", c_delete, f_delete, 0 },
e1a085ba 80 { "-depth", c_depth, f_depth, 0 },
c0fcf4e1
A
81 { "-empty", c_empty, f_empty, 0 },
82 { "-exec", c_exec, f_exec, 0 },
83 { "-execdir", c_exec, f_exec, F_EXECDIR },
9bafe280 84 { "-false", c_simple, f_not, 0 },
c0fcf4e1
A
85 { "-flags", c_flags, f_flags, 0 },
86 { "-follow", c_follow, f_always_true, 0 },
c0fcf4e1 87 { "-fstype", c_fstype, f_fstype, 0 },
c0fcf4e1
A
88 { "-group", c_group, f_group, 0 },
89 { "-iname", c_name, f_name, F_IGNCASE },
90 { "-inum", c_inum, f_inum, 0 },
91 { "-ipath", c_name, f_path, F_IGNCASE },
92 { "-iregex", c_regex, f_regex, F_IGNCASE },
93 { "-links", c_links, f_links, 0 },
94 { "-ls", c_ls, f_ls, 0 },
95 { "-maxdepth", c_mXXdepth, f_always_true, F_MAXDEPTH },
96 { "-mindepth", c_mXXdepth, f_always_true, 0 },
97 { "-mmin", c_Xmin, f_Xmin, 0 },
98 { "-mnewer", c_newer, f_newer, 0 },
99 { "-mtime", c_Xtime, f_Xtime, 0 },
100 { "-name", c_name, f_name, 0 },
101 { "-newer", c_newer, f_newer, 0 },
e1a085ba
A
102 { "-newerBB", c_newer, f_newer, F_TIME_B | F_TIME2_B },
103 { "-newerBa", c_newer, f_newer, F_TIME_B | F_TIME2_A },
104 { "-newerBc", c_newer, f_newer, F_TIME_B | F_TIME2_C },
105 { "-newerBm", c_newer, f_newer, F_TIME_B },
106 { "-newerBt", c_newer, f_newer, F_TIME_B | F_TIME2_T },
107 { "-neweraB", c_newer, f_newer, F_TIME_A | F_TIME2_B },
c0fcf4e1
A
108 { "-neweraa", c_newer, f_newer, F_TIME_A | F_TIME2_A },
109 { "-newerac", c_newer, f_newer, F_TIME_A | F_TIME2_C },
110 { "-neweram", c_newer, f_newer, F_TIME_A },
111 { "-newerat", c_newer, f_newer, F_TIME_A | F_TIME2_T },
e1a085ba 112 { "-newercB", c_newer, f_newer, F_TIME_C | F_TIME2_B },
c0fcf4e1
A
113 { "-newerca", c_newer, f_newer, F_TIME_C | F_TIME2_A },
114 { "-newercc", c_newer, f_newer, F_TIME_C | F_TIME2_C },
115 { "-newercm", c_newer, f_newer, F_TIME_C },
116 { "-newerct", c_newer, f_newer, F_TIME_C | F_TIME2_T },
e1a085ba 117 { "-newermB", c_newer, f_newer, F_TIME2_B },
c0fcf4e1
A
118 { "-newerma", c_newer, f_newer, F_TIME2_A },
119 { "-newermc", c_newer, f_newer, F_TIME2_C },
120 { "-newermm", c_newer, f_newer, 0 },
121 { "-newermt", c_newer, f_newer, F_TIME2_T },
122 { "-nogroup", c_nogroup, f_nogroup, 0 },
9bafe280 123 { "-not", c_simple, f_not, 0 },
c0fcf4e1
A
124 { "-nouser", c_nouser, f_nouser, 0 },
125 { "-o", c_simple, f_or, 0 },
126 { "-ok", c_exec, f_exec, F_NEEDOK },
127 { "-okdir", c_exec, f_exec, F_NEEDOK | F_EXECDIR },
128 { "-or", c_simple, f_or, 0 },
129 { "-path", c_name, f_path, 0 },
130 { "-perm", c_perm, f_perm, 0 },
131 { "-print", c_print, f_print, 0 },
132 { "-print0", c_print, f_print0, 0 },
133 { "-prune", c_simple, f_prune, 0 },
134 { "-regex", c_regex, f_regex, 0 },
135 { "-size", c_size, f_size, 0 },
136 { "-type", c_type, f_type, 0 },
137 { "-user", c_user, f_user, 0 },
138 { "-xdev", c_xdev, f_always_true, 0 },
44bd5ea7
A
139};
140
141/*
142 * find_create --
143 * create a node corresponding to a command line argument.
144 *
145 * TODO:
146 * add create/process function pointers to node, so we can skip
147 * this switch stuff.
148 */
149PLAN *
e1a085ba 150find_create(char ***argvp)
44bd5ea7 151{
e1a085ba 152 OPTION *p;
44bd5ea7
A
153 PLAN *new;
154 char **argv;
155
156 argv = *argvp;
157
e1a085ba
A
158 if ((p = lookup_option(*argv)) == NULL)
159 errx(1, "%s: unknown option", *argv);
44bd5ea7 160 ++argv;
44bd5ea7 161
c0fcf4e1 162 new = (p->create)(p, &argv);
44bd5ea7
A
163 *argvp = argv;
164 return (new);
165}
166
c0fcf4e1 167OPTION *
e1a085ba 168lookup_option(const char *name)
44bd5ea7
A
169{
170 OPTION tmp;
171
172 tmp.name = name;
173 return ((OPTION *)bsearch(&tmp, options,
174 sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare));
175}
176
177int
e1a085ba 178typecompare(const void *a, const void *b)
44bd5ea7 179{
e1a085ba 180 return (strcmp(((const OPTION *)a)->name, ((const OPTION *)b)->name));
44bd5ea7 181}