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