Annotation of src/usr.bin/find/find.h, Revision 1.14
1.14 ! deraadt 1: /* * $OpenBSD: find.h,v 1.13 2003/06/26 07:27:29 deraadt Exp $*/
1.1 deraadt 2: /*-
3: * Copyright (c) 1990, 1993
4: * The Regents of the University of California. All rights reserved.
5: *
6: * This code is derived from software contributed to Berkeley by
7: * Cimarron D. Taylor of the University of California, Berkeley.
8: *
9: * Redistribution and use in source and binary forms, with or without
10: * modification, are permitted provided that the following conditions
11: * are met:
12: * 1. Redistributions of source code must retain the above copyright
13: * notice, this list of conditions and the following disclaimer.
14: * 2. Redistributions in binary form must reproduce the above copyright
15: * notice, this list of conditions and the following disclaimer in the
16: * documentation and/or other materials provided with the distribution.
1.12 millert 17: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 18: * may be used to endorse or promote products derived from this software
19: * without specific prior written permission.
20: *
21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31: * SUCH DAMAGE.
32: *
33: * from: @(#)find.h 8.1 (Berkeley) 6/6/93
34: */
35:
36: /* node type */
37: enum ntype {
38: N_AND = 1, /* must start > 0 */
1.8 millert 39: N_AMIN, N_ANEWER, N_ATIME, N_CLOSEPAREN, N_CMIN, N_CNEWER, N_CTIME,
1.10 millert 40: N_DEPTH, N_EMPTY, N_EXEC, N_EXECDIR, N_EXPR,
41: N_FLAGS, N_FOLLOW, N_FSTYPE, N_GROUP, N_INAME, N_INUM, N_LINKS, N_LS,
1.7 deraadt 42: N_MMIN, N_MAXDEPTH,
1.5 tholo 43: N_MINDEPTH, N_MTIME, N_NAME, N_NEWER, N_NOGROUP, N_NOT, N_NOUSER,
44: N_OK, N_OPENPAREN, N_OR, N_PATH, N_PERM, N_PRINT, N_PRINT0, N_PRUNE,
1.14 ! deraadt 45: N_SIZE, N_TYPE, N_USER, N_XDEV
1.1 deraadt 46: };
47:
48: /* node definition */
49: typedef struct _plandata {
50: struct _plandata *next; /* next node */
51: int (*eval) /* node evaluation function */
1.11 millert 52: (struct _plandata *, FTSENT *);
1.1 deraadt 53: #define F_EQUAL 1 /* [acm]time inum links size */
54: #define F_LESSTHAN 2
55: #define F_GREATER 3
56: #define F_NEEDOK 1 /* exec ok */
57: #define F_MTFLAG 1 /* fstype */
58: #define F_MTTYPE 2
59: #define F_ATLEAST 1 /* perm */
60: int flags; /* private flags */
61: enum ntype type; /* plan node type */
62: union {
63: gid_t _g_data; /* gid */
64: ino_t _i_data; /* inode */
65: mode_t _m_data; /* mode mask */
1.10 millert 66: struct {
67: u_int _f_flags;
68: u_int _f_mask;
69: } fl;
1.1 deraadt 70: nlink_t _l_data; /* link count */
71: off_t _o_data; /* file size */
1.8 millert 72: struct timespec _t_data; /* time value */
1.1 deraadt 73: uid_t _u_data; /* uid */
74: short _mt_data; /* mount flags */
75: struct _plandata *_p_data[2]; /* PLAN trees */
76: struct _ex {
77: char **_e_argv; /* argv array */
78: char **_e_orig; /* original strings */
79: int *_e_len; /* allocated length */
80: } ex;
81: char *_a_data[2]; /* array of char pointers */
82: char *_c_data; /* char pointer */
1.4 tholo 83: int _max_data; /* tree depth */
84: int _min_data; /* tree depth */
1.1 deraadt 85: } p_un;
86: } PLAN;
1.4 tholo 87: #define a_data p_un._a_data
88: #define c_data p_un._c_data
89: #define i_data p_un._i_data
1.10 millert 90: #define fl_flags p_un.fl._f_flags
91: #define fl_mask p_un.fl._f_mask
1.4 tholo 92: #define g_data p_un._g_data
93: #define l_data p_un._l_data
94: #define m_data p_un._m_data
95: #define max_data p_un._max_data
96: #define min_data p_un._min_data
97: #define mt_data p_un._mt_data
98: #define o_data p_un._o_data
99: #define p_data p_un._p_data
100: #define t_data p_un._t_data
1.8 millert 101: #define sec_data p_un._t_data.tv_sec
102: #define nsec_data p_un._t_data.tv_nsec
1.4 tholo 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
1.1 deraadt 107:
108: typedef struct _option {
1.13 deraadt 109: char *name; /* option name */
110: enum ntype token; /* token type */
111: PLAN *(*create)(char *, char ***, int); /* create function */
112: #define O_NONE 0x01 /* no call required */
113: #define O_ZERO 0x02 /* pass: nothing */
114: #define O_ARGV 0x04 /* pass: argv, increment argv */
1.6 millert 115: #define O_ARGVP 0x08 /* pass: *argv, N_OK || N_EXEC || N_EXECDIR */
1.1 deraadt 116: int flags;
117: } OPTION;
118:
119: #include "extern.h"
![[BACK]](/icons/back.gif){kind=icon}
Return to find.h CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / find