xref: /dragonfly/usr.bin/find/find.h (revision c66c7e2f)
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. 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: head/usr.bin/find/find.h 248446 2013-03-17 22:51:58Z jilles $
34  */
35 
36 #include <regex.h>
37 #include <sys/time.h>
38 
39 /* forward declarations */
40 struct _plandata;
41 struct _option;
42 
43 /* execute function */
44 typedef int exec_f(struct _plandata *, FTSENT *);
45 /* create function */
46 typedef	struct _plandata *creat_f(struct _option *, char ***);
47 
48 /* function modifiers */
49 #define	F_NEEDOK	0x00000001	/* -ok vs. -exec */
50 #define	F_EXECDIR	0x00000002	/* -execdir vs. -exec */
51 #define F_TIME_A	0x00000004	/* one of -atime, -anewer, -newera* */
52 #define F_TIME_C	0x00000008	/* one of -ctime, -cnewer, -newerc* */
53 #define	F_TIME2_A	0x00000010	/* one of -newer?a */
54 #define	F_TIME2_C	0x00000020	/* one of -newer?c */
55 #define	F_TIME2_T	0x00000040	/* one of -newer?t */
56 #define F_MAXDEPTH	F_TIME_A	/* maxdepth vs. mindepth */
57 #define F_DEPTH		F_TIME_A	/* -depth n vs. -d */
58 /* command line function modifiers */
59 #define	F_EQUAL		0x00000000	/* [acm]min [acm]time inum links size */
60 #define	F_LESSTHAN	0x00000100
61 #define	F_GREATER	0x00000200
62 #define F_ELG_MASK	0x00000300
63 #define	F_ATLEAST	0x00000400	/* flags perm */
64 #define F_ANY		0x00000800	/* perm */
65 #define	F_MTMASK	0x00003000
66 #define	F_MTFLAG	0x00000000	/* fstype */
67 #define	F_MTTYPE	0x00001000
68 #define	F_MTUNKNOWN	0x00002000
69 #define	F_IGNCASE	0x00010000	/* iname ipath iregex */
70 #define	F_EXACTTIME	F_IGNCASE	/* -[acm]time units syntax */
71 #define F_EXECPLUS	0x00020000	/* -exec ... {} + */
72 #define	F_TIME_B	0x00040000	/* one of -Btime, -Bnewer, -newerB* */
73 #define	F_TIME2_B	0x00080000	/* one of -newer?B */
74 #define F_LINK		0x00100000	/* lname or ilname */
75 
76 /* node definition */
77 typedef struct _plandata {
78 	struct _plandata *next;		/* next node */
79 	exec_f	*execute;		/* node evaluation function */
80 	int flags;			/* private flags */
81 	union {
82 		gid_t _g_data;		/* gid */
83 		ino_t _i_data;		/* inode */
84 		mode_t _m_data;		/* mode mask */
85 		struct {
86 			u_long _f_flags;
87 			u_long _f_notflags;
88 		} fl;
89 		nlink_t _l_data;		/* link count */
90 		short _d_data;			/* level depth (-1 to N) */
91 		off_t _o_data;			/* file size */
92 		struct timespec _t_data;	/* time value */
93 		uid_t _u_data;			/* uid */
94 		short _mt_data;			/* mount flags */
95 		struct _plandata *_p_data[2];	/* PLAN trees */
96 		struct _ex {
97 			char **_e_argv;		/* argv array */
98 			char **_e_orig;		/* original strings */
99 			int *_e_len;		/* allocated length */
100 			int _e_pbnum;		/* base num. of args. used */
101 			int _e_ppos;		/* number of arguments used */
102 			int _e_pnummax;		/* max. number of arguments */
103 			int _e_psize;		/* number of bytes of args. */
104 			int _e_pbsize;		/* base num. of bytes of args */
105 			int _e_psizemax;	/* max num. of bytes of args */
106 			struct _plandata *_e_next;/* next F_EXECPLUS in tree */
107 		} ex;
108 		char *_a_data[2];		/* array of char pointers */
109 		char *_c_data;			/* char pointer */
110 		regex_t *_re_data;		/* regex */
111 	} p_un;
112 } PLAN;
113 #define	a_data	p_un._a_data
114 #define	c_data	p_un._c_data
115 #define	d_data	p_un._d_data
116 #define fl_flags	p_un.fl._f_flags
117 #define fl_notflags	p_un.fl._f_notflags
118 #define	g_data	p_un._g_data
119 #define	i_data	p_un._i_data
120 #define	l_data	p_un._l_data
121 #define	m_data	p_un._m_data
122 #define	mt_data	p_un._mt_data
123 #define	o_data	p_un._o_data
124 #define	p_data	p_un._p_data
125 #define	t_data	p_un._t_data
126 #define	u_data	p_un._u_data
127 #define	re_data	p_un._re_data
128 #define	e_argv	p_un.ex._e_argv
129 #define	e_orig	p_un.ex._e_orig
130 #define	e_len	p_un.ex._e_len
131 #define e_pbnum	p_un.ex._e_pbnum
132 #define e_ppos	p_un.ex._e_ppos
133 #define e_pnummax p_un.ex._e_pnummax
134 #define e_psize p_un.ex._e_psize
135 #define e_pbsize p_un.ex._e_pbsize
136 #define e_psizemax p_un.ex._e_psizemax
137 #define e_next p_un.ex._e_next
138 
139 typedef struct _option {
140 	const char *name;		/* option name */
141 	creat_f *create;		/* create function */
142 	exec_f *execute;		/* execute function */
143 	int flags;
144 } OPTION;
145 
146 #include "extern.h"
147