find.h revision 76250
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 76250 2001-05-03 18:05:35Z phk $ 38 */ 39 40#include <regex.h> 41 42/* forward declarations */ 43struct _plandata; 44struct _option; 45 46/* execute function */ 47typedef int exec_f __P((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/* command line function modifiers */ 61#define F_EQUAL 0x00000000 /* [acm]min [acm]time inum links size */ 62#define F_LESSTHAN 0x00000100 63#define F_GREATER 0x00000200 64#define F_ELG_MASK 0x00000300 65#define F_ATLEAST 0x00000400 /* flags perm */ 66#define F_ANY 0x00000800 /* perm */ 67#define F_MTMASK 0x00003000 68#define F_MTFLAG 0x00000000 /* fstype */ 69#define F_MTTYPE 0x00001000 70#define F_MTUNKNOWN 0x00002000 71#define F_IGNCASE 0x00010000 /* iname ipath iregex */ 72 73/* node definition */ 74typedef struct _plandata { 75 struct _plandata *next; /* next node */ 76 exec_f *execute; /* node evaluation function */ 77 int flags; /* private flags */ 78 union { 79 gid_t _g_data; /* gid */ 80 ino_t _i_data; /* inode */ 81 mode_t _m_data; /* mode mask */ 82 struct { 83 u_long _f_flags; 84 u_long _f_mask; 85 } fl; 86 nlink_t _l_data; /* link count */ 87 off_t _o_data; /* file size */ 88 time_t _t_data; /* time value */ 89 uid_t _u_data; /* uid */ 90 short _mt_data; /* mount flags */ 91 struct _plandata *_p_data[2]; /* PLAN trees */ 92 struct _ex { 93 char **_e_argv; /* argv array */ 94 char **_e_orig; /* original strings */ 95 int *_e_len; /* allocated length */ 96 } ex; 97 char *_a_data[2]; /* array of char pointers */ 98 char *_c_data; /* char pointer */ 99 regex_t *_re_data; /* regex */ 100 } p_un; 101} PLAN; 102#define a_data p_un._a_data 103#define c_data p_un._c_data 104#define fl_flags p_un.fl._f_flags 105#define fl_mask p_un.fl._f_mask 106#define g_data p_un._g_data 107#define i_data p_un._i_data 108#define l_data p_un._l_data 109#define m_data p_un._m_data 110#define mt_data p_un._mt_data 111#define o_data p_un._o_data 112#define p_data p_un._p_data 113#define t_data p_un._t_data 114#define u_data p_un._u_data 115#define re_data p_un._re_data 116#define e_argv p_un.ex._e_argv 117#define e_orig p_un.ex._e_orig 118#define e_len p_un.ex._e_len 119 120typedef struct _option { 121 char *name; /* option name */ 122 creat_f *create; /* create function */ 123 exec_f *execute; /* execute function */ 124 int flags; 125} OPTION; 126 127#include "extern.h" 128