find.h revision 30395 
1/*-
2 * Copyright (c) 1990, 1993
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 *	@(#)find.h	8.1 (Berkeley) 6/6/93
37 */
38
39/* node type */
40enum ntype {
41	N_AND = 1, 				/* must start > 0 */
42	N_AMIN, N_ATIME, N_CLOSEPAREN, N_CMIN, N_CTIME, N_DEPTH,
43	N_EXEC, N_EXECDIR, N_EXPR,
44	N_FOLLOW, N_FSTYPE, N_GROUP, N_INUM, N_LINKS, N_LS, N_MMIN,
45        N_MTIME, N_NAME,
46	N_NEWER, N_NOGROUP, N_NOT, N_NOUSER, N_OK, N_OPENPAREN, N_OR, N_PATH,
47	N_PERM, N_PRINT, N_PRUNE, N_SIZE, N_TYPE, N_USER, N_XDEV,
48	N_PRINT0, N_DELETE
49};
50
51/* node definition */
52typedef struct _plandata {
53	struct _plandata *next;			/* next node */
54	int (*eval)				/* node evaluation function */
55	    __P((struct _plandata *, FTSENT *));
56#define	F_EQUAL		1			/* [acm]time inum links size */
57#define	F_LESSTHAN	2
58#define	F_GREATER	3
59#define	F_NEEDOK	1			/* exec ok */
60#define	F_MTFLAG	1			/* fstype */
61#define	F_MTTYPE	2
62#define	F_ATLEAST	1			/* perm */
63	int flags;				/* private flags */
64	enum ntype type;			/* plan node type */
65	union {
66		gid_t _g_data;			/* gid */
67		ino_t _i_data;			/* inode */
68		mode_t _m_data;			/* mode mask */
69		nlink_t _l_data;		/* link count */
70		off_t _o_data;			/* file size */
71		time_t _t_data;			/* time value */
72		uid_t _u_data;			/* uid */
73		short _mt_data;			/* mount flags */
74		struct _plandata *_p_data[2];	/* PLAN trees */
75		struct _ex {
76			char **_e_argv;		/* argv array */
77			char **_e_orig;		/* original strings */
78			int *_e_len;		/* allocated length */
79		} ex;
80		char *_a_data[2];		/* array of char pointers */
81		char *_c_data;			/* char pointer */
82	} p_un;
83} PLAN;
84#define	a_data	p_un._a_data
85#define	c_data	p_un._c_data
86#define	i_data	p_un._i_data
87#define	g_data	p_un._g_data
88#define	l_data	p_un._l_data
89#define	m_data	p_un._m_data
90#define	mt_data	p_un._mt_data
91#define	o_data	p_un._o_data
92#define	p_data	p_un._p_data
93#define	t_data	p_un._t_data
94#define	u_data	p_un._u_data
95#define	e_argv	p_un.ex._e_argv
96#define	e_orig	p_un.ex._e_orig
97#define	e_len	p_un.ex._e_len
98
99typedef struct _option {
100	char *name;			/* option name */
101	enum ntype token;		/* token type */
102	PLAN *(*create)();		/* create function: DON'T PROTOTYPE! */
103#define	O_NONE		0x01		/* no call required */
104#define	O_ZERO		0x02		/* pass: nothing */
105#define	O_ARGV		0x04		/* pass: argv, increment argv */
106#define	O_ARGVP		0x08		/* pass: *argv, N_OK || N_EXEC || N_EXECDIR */
107	int flags;
108} OPTION;
109
110#include "extern.h"
111