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