find.h revision 157440
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 * $FreeBSD: head/usr.bin/find/find.h 157440 2006-04-03 20:36:37Z ceri $ 38 */ 39 40#include <regex.h> 41 42/* forward declarations */ 43struct _plandata; 44struct _option; 45 46/* execute function */ 47typedef int exec_f(struct _plandata *, FTSENT *); 48/* create function */ 49typedef struct _plandata *creat_f(struct _option *, char ***); 50 51/* function modifiers */ 52#define F_NEEDOK 0x00000001 /* -ok vs. -exec */ 53#define F_EXECDIR 0x00000002 /* -execdir vs. -exec */ 54#define F_TIME_A 0x00000004 /* one of -atime, -anewer, -newera* */ 55#define F_TIME_C 0x00000008 /* one of -ctime, -cnewer, -newerc* */ 56#define F_TIME2_A 0x00000010 /* one of -newer?a */ 57#define F_TIME2_C 0x00000020 /* one of -newer?c */ 58#define F_TIME2_T 0x00000040 /* one of -newer?t */ 59#define F_MAXDEPTH F_TIME_A /* maxdepth vs. mindepth */ 60#define F_DEPTH F_TIME_A /* -depth n vs. -d */ 61/* command line function modifiers */ 62#define F_EQUAL 0x00000000 /* [acm]min [acm]time inum links size */ 63#define F_LESSTHAN 0x00000100 64#define F_GREATER 0x00000200 65#define F_ELG_MASK 0x00000300 66#define F_ATLEAST 0x00000400 /* flags perm */ 67#define F_ANY 0x00000800 /* perm */ 68#define F_MTMASK 0x00003000 69#define F_MTFLAG 0x00000000 /* fstype */ 70#define F_MTTYPE 0x00001000 71#define F_MTUNKNOWN 0x00002000 72#define F_IGNCASE 0x00010000 /* iname ipath iregex */ 73#define F_EXACTTIME F_IGNCASE /* -[acm]time units syntax */ 74#define F_EXECPLUS 0x00020000 /* -exec ... {} + */ 75#define F_TIME_B 0x00040000 /* one of -Btime, -Bnewer, -newerB* */ 76#define F_TIME2_B 0x00080000 /* one of -newer?B */ 77 78/* node definition */ 79typedef struct _plandata { 80 struct _plandata *next; /* next node */ 81 exec_f *execute; /* node evaluation function */ 82 int flags; /* private flags */ 83 union { 84 gid_t _g_data; /* gid */ 85 ino_t _i_data; /* inode */ 86 mode_t _m_data; /* mode mask */ 87 struct { 88 u_long _f_flags; 89 u_long _f_notflags; 90 } fl; 91 nlink_t _l_data; /* link count */ 92 short _d_data; /* level depth (-1 to N) */ 93 off_t _o_data; /* file size */ 94 time_t _t_data; /* time value */ 95 uid_t _u_data; /* uid */ 96 short _mt_data; /* mount flags */ 97 struct _plandata *_p_data[2]; /* PLAN trees */ 98 struct _ex { 99 char **_e_argv; /* argv array */ 100 char **_e_orig; /* original strings */ 101 int *_e_len; /* allocated length */ 102 int _e_pbnum; /* base num. of args. used */ 103 int _e_ppos; /* number of arguments used */ 104 int _e_pnummax; /* max. number of arguments */ 105 int _e_psize; /* number of bytes of args. */ 106 int _e_pbsize; /* base num. of bytes of args */ 107 int _e_psizemax; /* max num. of bytes of args */ 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 139typedef 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