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 * 4. Neither the name of the University nor the names of its contributors
17 *    may be used to endorse or promote products derived from this software
18 *    without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 *
32 *	@(#)find.h	8.1 (Berkeley) 6/6/93
33 *	$FreeBSD$
34 */
35
36#include <regex.h>
37
38/* forward declarations */
39struct _plandata;
40struct _option;
41
42/* execute function */
43typedef int exec_f(struct _plandata *, FTSENT *);
44/* create function */
45typedef	struct _plandata *creat_f(struct _option *, char ***);
46
47/* function modifiers */
48#define	F_NEEDOK	0x00000001	/* -ok vs. -exec */
49#define	F_EXECDIR	0x00000002	/* -execdir vs. -exec */
50#define F_TIME_A	0x00000004	/* one of -atime, -anewer, -newera* */
51#define F_TIME_C	0x00000008	/* one of -ctime, -cnewer, -newerc* */
52#define	F_TIME2_A	0x00000010	/* one of -newer?a */
53#define	F_TIME2_C	0x00000020	/* one of -newer?c */
54#define	F_TIME2_T	0x00000040	/* one of -newer?t */
55#define F_MAXDEPTH	F_TIME_A	/* maxdepth vs. mindepth */
56#define F_DEPTH		F_TIME_A	/* -depth n vs. -d */
57/* command line function modifiers */
58#define	F_EQUAL		0x00000000	/* [acm]min [acm]time inum links size */
59#define	F_LESSTHAN	0x00000100
60#define	F_GREATER	0x00000200
61#define F_ELG_MASK	0x00000300
62#define	F_ATLEAST	0x00000400	/* flags perm */
63#define F_ANY		0x00000800	/* perm */
64#define	F_MTMASK	0x00003000
65#define	F_MTFLAG	0x00000000	/* fstype */
66#define	F_MTTYPE	0x00001000
67#define	F_MTUNKNOWN	0x00002000
68#define	F_IGNCASE	0x00010000	/* iname ipath iregex */
69#define	F_EXACTTIME	F_IGNCASE	/* -[acm]time units syntax */
70#define F_EXECPLUS	0x00020000	/* -exec ... {} + */
71#define	F_TIME_B	0x00040000	/* one of -Btime, -Bnewer, -newerB* */
72#define	F_TIME2_B	0x00080000	/* one of -newer?B */
73#define F_LINK		0x00100000	/* lname or ilname */
74
75/* node definition */
76typedef struct _plandata {
77	struct _plandata *next;		/* next node */
78	exec_f	*execute;		/* node evaluation function */
79	int flags;			/* private flags */
80	union {
81		gid_t _g_data;		/* gid */
82		ino_t _i_data;		/* inode */
83		mode_t _m_data;		/* mode mask */
84		struct {
85			u_long _f_flags;
86			u_long _f_notflags;
87		} fl;
88		nlink_t _l_data;		/* link count */
89		short _d_data;			/* level depth (-1 to N) */
90		off_t _o_data;			/* file size */
91		struct timespec _t_data;	/* time value */
92		uid_t _u_data;			/* uid */
93		short _mt_data;			/* mount flags */
94		struct _plandata *_p_data[2];	/* PLAN trees */
95		struct _ex {
96			char **_e_argv;		/* argv array */
97			char **_e_orig;		/* original strings */
98			int *_e_len;		/* allocated length */
99			int _e_pbnum;		/* base num. of args. used */
100			int _e_ppos;		/* number of arguments used */
101			int _e_pnummax;		/* max. number of arguments */
102			int _e_psize;		/* number of bytes of args. */
103			int _e_pbsize;		/* base num. of bytes of args */
104			int _e_psizemax;	/* max num. of bytes of args */
105			struct _plandata *_e_next;/* next F_EXECPLUS in tree */
106		} ex;
107		char *_a_data[2];		/* array of char pointers */
108		char *_c_data;			/* char pointer */
109		regex_t *_re_data;		/* regex */
110	} p_un;
111} PLAN;
112#define	a_data	p_un._a_data
113#define	c_data	p_un._c_data
114#define	d_data	p_un._d_data
115#define fl_flags	p_un.fl._f_flags
116#define fl_notflags	p_un.fl._f_notflags
117#define	g_data	p_un._g_data
118#define	i_data	p_un._i_data
119#define	l_data	p_un._l_data
120#define	m_data	p_un._m_data
121#define	mt_data	p_un._mt_data
122#define	o_data	p_un._o_data
123#define	p_data	p_un._p_data
124#define	t_data	p_un._t_data
125#define	u_data	p_un._u_data
126#define	re_data	p_un._re_data
127#define	e_argv	p_un.ex._e_argv
128#define	e_orig	p_un.ex._e_orig
129#define	e_len	p_un.ex._e_len
130#define e_pbnum	p_un.ex._e_pbnum
131#define e_ppos	p_un.ex._e_ppos
132#define e_pnummax p_un.ex._e_pnummax
133#define e_psize p_un.ex._e_psize
134#define e_pbsize p_un.ex._e_pbsize
135#define e_psizemax p_un.ex._e_psizemax
136#define e_next p_un.ex._e_next
137
138typedef struct _option {
139	const char *name;		/* option name */
140	creat_f *create;		/* create function */
141	exec_f *execute;		/* execute function */
142	int flags;
143} OPTION;
144
145#include "extern.h"
146