find.h revision 1.24
1 /* $NetBSD: find.h,v 1.24 2007/02/06 13:25:01 elad Exp $ */ 2 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 * from: @(#)find.h 8.1 (Berkeley) 6/6/93 35 */ 36 37 #include <regex.h> 38 39 /* node type */ 40 enum ntype { 41 N_AND = 1, /* must start > 0 */ 42 N_AMIN, N_ANEWER, N_ATIME, N_CLOSEPAREN, N_CMIN, N_CNEWER, N_CTIME, 43 N_DEPTH, N_EMPTY, N_EXEC, N_EXECDIR, N_EXIT, N_EXPR, N_FALSE, N_FLAGS, 44 N_FOLLOW, N_FPRINT, N_FSTYPE, N_GROUP, 45 N_INAME, N_INUM, N_IREGEX, N_LINKS, N_LS, N_MINDEPTH, N_MAXDEPTH, 46 N_MMIN, N_MTIME, N_NAME, N_NEWER, N_NOGROUP, N_NOT, N_NOUSER, N_OK, 47 N_OPENPAREN, N_OR, N_PATH, N_PERM, N_PRINT, N_PRINT0, N_PRINTX, 48 N_PRUNE, N_REGEX, N_SIZE, N_TYPE, N_USER, N_XDEV, N_DELETE 49 }; 50 51 /* node definition */ 52 typedef struct _plandata { 53 struct _plandata *next; /* next node */ 54 int (*eval)(struct _plandata *, FTSENT *); 55 /* node evaluation function */ 56 #define F_EQUAL 1 /* [acm]time inum links size */ 57 #define F_LESSTHAN 2 58 #define F_GREATER 3 59 #define F_NEEDOK 1 /* exec ok */ 60 #define F_PLUSSET 2 /* -exec ... {} + */ 61 #define F_MTFLAG 1 /* fstype */ 62 #define F_MTTYPE 2 63 #define F_ATLEAST 1 /* perm */ 64 int flags; /* private flags */ 65 enum ntype type; /* plan node type */ 66 union { 67 u_int32_t _f_data; /* flags */ 68 gid_t _g_data; /* gid */ 69 ino_t _i_data; /* inode */ 70 mode_t _m_data; /* mode mask */ 71 nlink_t _l_data; /* link count */ 72 off_t _o_data; /* file size */ 73 time_t _t_data; /* time value */ 74 uid_t _u_data; /* uid */ 75 short _mt_data; /* mount flags */ 76 struct _plandata *_p_data[2]; /* PLAN trees */ 77 struct _ex { 78 char **_e_argv; /* argv array */ 79 char **_e_orig; /* original strings */ 80 int *_e_len; /* allocated length */ 81 char **_ep_bxp; /* ptr to 1st addt'l arg */ 82 char *_ep_p; /* current buffer pointer */ 83 char *_ep_bbp; /* begin buffer pointer */ 84 char *_ep_ebp; /* end buffer pointer */ 85 int _ep_maxargs; /* max #args */ 86 int _ep_narg; /* # addt'l args */ 87 int _ep_rval; /* return value */ 88 } ex; 89 char *_a_data[2]; /* array of char pointers */ 90 char *_c_data; /* char pointer */ 91 int _exit_val; /* exit value */ 92 int _max_data; /* tree depth */ 93 int _min_data; /* tree depth */ 94 regex_t _regexp_data; /* compiled regexp */ 95 FILE *_fprint_file; /* file stream for -fprint */ 96 } p_un; 97 } PLAN; 98 #define a_data p_un._a_data 99 #define c_data p_un._c_data 100 #define i_data p_un._i_data 101 #define f_data p_un._f_data 102 #define g_data p_un._g_data 103 #define l_data p_un._l_data 104 #define m_data p_un._m_data 105 #define mt_data p_un._mt_data 106 #define o_data p_un._o_data 107 #define p_data p_un._p_data 108 #define t_data p_un._t_data 109 #define u_data p_un._u_data 110 #define e_argv p_un.ex._e_argv 111 #define e_orig p_un.ex._e_orig 112 #define e_len p_un.ex._e_len 113 #define ep_p p_un.ex._ep_p 114 #define ep_bbp p_un.ex._ep_bbp 115 #define ep_ebp p_un.ex._ep_ebp 116 #define ep_bxp p_un.ex._ep_bxp 117 #define ep_cnt p_un.ex._ep_cnt 118 #define ep_maxargs p_un.ex._ep_maxargs 119 #define ep_nline p_un.ex._ep_nline 120 #define ep_narg p_un.ex._ep_narg 121 #define ep_rval p_un.ex._ep_rval 122 #define exit_val p_un._exit_val 123 #define max_data p_un._max_data 124 #define min_data p_un._min_data 125 #define regexp_data p_un._regexp_data 126 #define fprint_file p_un._fprint_file 127 128 typedef struct _option { 129 const char *name; /* option name */ 130 enum ntype token; /* token type */ 131 PLAN *(*create)(char ***, int); /* create function */ 132 int arg; /* function needs arg */ 133 } OPTION; 134 135 #include "extern.h" 136
Indexes created Wed Oct 22 13:09:56 GMT 2025