option.c revision 30395 
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
37#ifndef lint
38static char sccsid[] = "@(#)option.c	8.2 (Berkeley) 4/16/94";
39#endif /* not lint */
40
41#include <sys/types.h>
42#include <sys/stat.h>
43
44#include <err.h>
45#include <fts.h>
46#include <stdio.h>
47#include <stdlib.h>
48#include <string.h>
49
50#include "find.h"
51
52static OPTION *option __P((char *));
53
54/* NB: the following table must be sorted lexically. */
55static OPTION const options[] = {
56	{ "!",		N_NOT,		c_not,		O_ZERO },
57	{ "(",		N_OPENPAREN,	c_openparen,	O_ZERO },
58	{ ")",		N_CLOSEPAREN,	c_closeparen,	O_ZERO },
59	{ "-a",		N_AND,		NULL,		O_NONE },
60	{ "-and",	N_AND,		NULL,		O_NONE },
61	{ "-amin",	N_AMIN,	        c_amin,	        O_ARGV },
62	{ "-atime",	N_ATIME,	c_atime,	O_ARGV },
63	{ "-cmin",	N_CMIN,	        c_cmin,	        O_ARGV },
64	{ "-ctime",	N_CTIME,	c_ctime,	O_ARGV },
65	{ "-delete",	N_DELETE,	c_delete,	O_ZERO },
66	{ "-depth",	N_DEPTH,	c_depth,	O_ZERO },
67	{ "-exec",	N_EXEC,		c_exec,		O_ARGVP },
68	{ "-execdir",	N_EXECDIR,	c_execdir,	O_ARGVP },
69	{ "-follow",	N_FOLLOW,	c_follow,	O_ZERO },
70	{ "-fstype",	N_FSTYPE,	c_fstype,	O_ARGV },
71	{ "-group",	N_GROUP,	c_group,	O_ARGV },
72	{ "-inum",	N_INUM,		c_inum,		O_ARGV },
73	{ "-links",	N_LINKS,	c_links,	O_ARGV },
74	{ "-ls",	N_LS,		c_ls,		O_ZERO },
75	{ "-mmin",	N_MMIN,	        c_mmin,	        O_ARGV },
76	{ "-mtime",	N_MTIME,	c_mtime,	O_ARGV },
77	{ "-name",	N_NAME,		c_name,		O_ARGV },
78	{ "-newer",	N_NEWER,	c_newer,	O_ARGV },
79	{ "-nogroup",	N_NOGROUP,	c_nogroup,	O_ZERO },
80	{ "-nouser",	N_NOUSER,	c_nouser,	O_ZERO },
81	{ "-o",		N_OR,		c_or,		O_ZERO },
82	{ "-ok",	N_OK,		c_exec,		O_ARGVP },
83	{ "-or",	N_OR,		c_or,		O_ZERO },
84	{ "-path", 	N_PATH,		c_path,		O_ARGV },
85	{ "-perm",	N_PERM,		c_perm,		O_ARGV },
86	{ "-print",	N_PRINT,	c_print,	O_ZERO },
87	{ "-print0",	N_PRINT0,	c_print0,	O_ZERO },
88	{ "-prune",	N_PRUNE,	c_prune,	O_ZERO },
89	{ "-size",	N_SIZE,		c_size,		O_ARGV },
90	{ "-type",	N_TYPE,		c_type,		O_ARGV },
91	{ "-user",	N_USER,		c_user,		O_ARGV },
92	{ "-xdev",	N_XDEV,		c_xdev,		O_ZERO },
93};
94
95/*
96 * find_create --
97 *	create a node corresponding to a command line argument.
98 *
99 * TODO:
100 *	add create/process function pointers to node, so we can skip
101 *	this switch stuff.
102 */
103PLAN *
104find_create(argvp)
105	char ***argvp;
106{
107	register OPTION *p;
108	PLAN *new;
109	char **argv;
110
111	argv = *argvp;
112
113	if ((p = option(*argv)) == NULL)
114		errx(1, "%s: unknown option", *argv);
115	++argv;
116	if (p->flags & (O_ARGV|O_ARGVP) && !*argv)
117		errx(1, "%s: requires additional arguments", *--argv);
118
119	switch(p->flags) {
120	case O_NONE:
121		new = NULL;
122		break;
123	case O_ZERO:
124		new = (p->create)();
125		break;
126	case O_ARGV:
127		new = (p->create)(*argv++);
128		break;
129	case O_ARGVP:
130		new = (p->create)(&argv, p->token == N_OK);
131		break;
132	default:
133		abort();
134	}
135	*argvp = argv;
136	return (new);
137}
138
139static OPTION *
140option(name)
141	char *name;
142{
143	OPTION tmp;
144	int typecompare __P((const void *, const void *));
145
146	tmp.name = name;
147	return ((OPTION *)bsearch(&tmp, options,
148	    sizeof(options)/sizeof(OPTION), sizeof(OPTION), typecompare));
149}
150
151int
152typecompare(a, b)
153	const void *a, *b;
154{
155	return (strcmp(((OPTION *)a)->name, ((OPTION *)b)->name));
156}
157