find.h revision 1.4
1 /*- 2 * Copyright (c) 1990 The Regents of the University of California. 3 * 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 * from: @(#)find.h 5.8 (Berkeley) 5/24/91 37 * $Id: find.h,v 1.4 1993/10/27 17:52:39 jtc Exp $ 38 */ 39 40 /* node type */ 41 enum ntype { 42 N_AND = 1, /* must start > 0 */ 43 N_ATIME, N_CLOSEPAREN, N_CTIME, N_DEPTH, N_EXEC, N_EXPR, N_FOLLOW, 44 N_FSTYPE, N_GROUP, N_INUM, N_LINKS, N_LS, N_MTIME, N_NAME, N_NEWER, 45 N_NOGROUP, N_NOT, N_NOUSER, N_OK, N_OPENPAREN, N_OR, N_PERM, N_PRINT, 46 N_PRINT0, N_PRUNE, N_SIZE, N_TYPE, N_USER, N_XDEV, 47 }; 48 49 /* node definition */ 50 typedef struct _plandata { 51 struct _plandata *next; /* next node */ 52 int (*eval)(); /* node evaluation function */ 53 int flags; /* private flags */ 54 enum ntype type; /* plan node type */ 55 union { 56 gid_t _g_data; /* gid */ 57 ino_t _i_data; /* inode */ 58 mode_t _m_data; /* mode mask */ 59 nlink_t _l_data; /* link count */ 60 off_t _o_data; /* file size */ 61 time_t _t_data; /* time value */ 62 uid_t _u_data; /* uid */ 63 struct _plandata *_p_data[2]; /* PLAN trees */ 64 struct _ex { 65 char **_e_argv; /* argv array */ 66 char **_e_orig; /* original strings */ 67 int *_e_len; /* allocated length */ 68 } ex; 69 char *_a_data[2]; /* array of char pointers */ 70 char *_c_data; /* char pointer */ 71 int _m_flags; /* mount flage for fstype */ 72 } p_un; 73 #define a_data p_un._a_data 74 #define c_data p_un._c_data 75 #define i_data p_un._i_data 76 #define g_data p_un._g_data 77 #define l_data p_un._l_data 78 #define m_data p_un._m_data 79 #define o_data p_un._o_data 80 #define p_data p_un._p_data 81 #define t_data p_un._t_data 82 #define u_data p_un._u_data 83 #define e_argv p_un.ex._e_argv 84 #define e_orig p_un.ex._e_orig 85 #define e_len p_un.ex._e_len 86 #define m_flags p_un._m_flags 87 } PLAN; 88 89 #include "extern.h" 90
Indexes created Wed Oct 22 13:09:56 GMT 2025