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