Annotation of src/usr.bin/find/find.h, Revision 1.15
1.15 ! pascal 1: /* * $OpenBSD: find.h,v 1.14 2004/09/15 18:43:25 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 */
1.15 ! pascal 57: #define F_PLUSSET 2 /* -exec ... {} + */
1.1 deraadt 58: #define F_MTFLAG 1 /* fstype */
59: #define F_MTTYPE 2
60: #define F_ATLEAST 1 /* perm */
61: int flags; /* private flags */
62: enum ntype type; /* plan node type */
63: union {
64: gid_t _g_data; /* gid */
65: ino_t _i_data; /* inode */
66: mode_t _m_data; /* mode mask */
1.10 millert 67: struct {
68: u_int _f_flags;
69: u_int _f_mask;
70: } fl;
1.1 deraadt 71: nlink_t _l_data; /* link count */
72: off_t _o_data; /* file size */
1.8 millert 73: struct timespec _t_data; /* time value */
1.1 deraadt 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 */
1.15 ! pascal 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 */
1.1 deraadt 88: } ex;
89: char *_a_data[2]; /* array of char pointers */
90: char *_c_data; /* char pointer */
1.4 tholo 91: int _max_data; /* tree depth */
92: int _min_data; /* tree depth */
1.1 deraadt 93: } p_un;
94: } PLAN;
1.4 tholo 95: #define a_data p_un._a_data
96: #define c_data p_un._c_data
97: #define i_data p_un._i_data
1.10 millert 98: #define fl_flags p_un.fl._f_flags
99: #define fl_mask p_un.fl._f_mask
1.4 tholo 100: #define g_data p_un._g_data
101: #define l_data p_un._l_data
102: #define m_data p_un._m_data
103: #define max_data p_un._max_data
104: #define min_data p_un._min_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
1.8 millert 109: #define sec_data p_un._t_data.tv_sec
110: #define nsec_data p_un._t_data.tv_nsec
1.4 tholo 111: #define u_data p_un._u_data
112: #define e_argv p_un.ex._e_argv
113: #define e_orig p_un.ex._e_orig
114: #define e_len p_un.ex._e_len
1.15 ! pascal 115: #define ep_p p_un.ex._ep_p
! 116: #define ep_bbp p_un.ex._ep_bbp
! 117: #define ep_ebp p_un.ex._ep_ebp
! 118: #define ep_bxp p_un.ex._ep_bxp
! 119: #define ep_cnt p_un.ex._ep_cnt
! 120: #define ep_maxargs p_un.ex._ep_maxargs
! 121: #define ep_nline p_un.ex._ep_nline
! 122: #define ep_narg p_un.ex._ep_narg
! 123: #define ep_rval p_un.ex._ep_rval
1.1 deraadt 124:
125: typedef struct _option {
1.13 deraadt 126: char *name; /* option name */
127: enum ntype token; /* token type */
128: PLAN *(*create)(char *, char ***, int); /* create function */
129: #define O_NONE 0x01 /* no call required */
130: #define O_ZERO 0x02 /* pass: nothing */
131: #define O_ARGV 0x04 /* pass: argv, increment argv */
1.6 millert 132: #define O_ARGVP 0x08 /* pass: *argv, N_OK || N_EXEC || N_EXECDIR */
1.1 deraadt 133: int flags;
134: } OPTION;
135:
136: #include "extern.h"