1 /* $NetBSD: find.h,v 1.15 2002/09/27 15:56:26 provos 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. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * from: @(#)find.h 8.1 (Berkeley) 6/6/93 39 */ 40 41 #include <regex.h> 42 43 /* node type */ 44 enum ntype { 45 N_AND = 1, /* must start > 0 */ 46 N_AMIN, N_ANEWER, N_ATIME, N_CLOSEPAREN, N_CMIN, N_CNEWER, N_CTIME, 47 N_DEPTH, N_EMPTY, 48 N_EXEC, N_EXECDIR, N_EXPR, N_FLAGS, N_FOLLOW, N_FSTYPE, N_GROUP, 49 N_INUM, N_IREGEX, N_LINKS, N_LS, N_MINDEPTH, N_MAXDEPTH, 50 N_MMIN, N_MTIME, N_NAME, N_NEWER, N_NOGROUP, N_NOT, N_NOUSER, N_OK, 51 N_OPENPAREN, N_OR, N_PATH, N_PERM, N_PRINT, N_PRINT0, N_PRINTX, 52 N_PRUNE, N_REGEX, N_SIZE, N_TYPE, N_USER, N_XDEV, 53 }; 54 55 /* node definition */ 56 typedef struct _plandata { 57 struct _plandata *next; /* next node */ 58 int (*eval) /* node evaluation function */ 59 __P((struct _plandata *, FTSENT *)); 60 #define F_EQUAL 1 /* [acm]time inum links size */ 61 #define F_LESSTHAN 2 62 #define F_GREATER 3 63 #define F_NEEDOK 1 /* exec ok */ 64 #define F_MTFLAG 1 /* fstype */ 65 #define F_MTTYPE 2 66 #define F_ATLEAST 1 /* perm */ 67 int flags; /* private flags */ 68 enum ntype type; /* plan node type */ 69 union { 70 u_int32_t _f_data; /* flags */ 71 gid_t _g_data; /* gid */ 72 ino_t _i_data; /* inode */ 73 mode_t _m_data; /* mode mask */ 74 nlink_t _l_data; /* link count */ 75 off_t _o_data; /* file size */ 76 time_t _t_data; /* time value */ 77 uid_t _u_data; /* uid */ 78 short _mt_data; /* mount flags */ 79 struct _plandata *_p_data[2]; /* PLAN trees */ 80 struct _ex { 81 char **_e_argv; /* argv array */ 82 char **_e_orig; /* original strings */ 83 int *_e_len; /* allocated length */ 84 } ex; 85 char *_a_data[2]; /* array of char pointers */ 86 char *_c_data; /* char pointer */ 87 int _max_data; /* tree depth */ 88 int _min_data; /* tree depth */ 89 regex_t _regexp_data; /* compiled regexp */ 90 } p_un; 91 } PLAN; 92 #define a_data p_un._a_data 93 #define c_data p_un._c_data 94 #define i_data p_un._i_data 95 #define f_data p_un._f_data 96 #define g_data p_un._g_data 97 #define l_data p_un._l_data 98 #define m_data p_un._m_data 99 #define mt_data p_un._mt_data 100 #define o_data p_un._o_data 101 #define p_data p_un._p_data 102 #define t_data p_un._t_data 103 #define u_data p_un._u_data 104 #define e_argv p_un.ex._e_argv 105 #define e_orig p_un.ex._e_orig 106 #define e_len p_un.ex._e_len 107 #define max_data p_un._max_data 108 #define min_data p_un._min_data 109 #define regexp_data p_un._regexp_data 110 111 typedef struct _option { 112 char *name; /* option name */ 113 enum ntype token; /* token type */ 114 PLAN *(*create) /* create function */ 115 __P((char ***, int)); 116 int arg; /* function needs arg */ 117 } OPTION; 118 119 #include "extern.h" 120