386BSD 0.1 development
[unix-history] / usr / src / usr.bin / find / find.h
CommitLineData
b2555f2d
WJ
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 * @(#)find.h 5.8 (Berkeley) 5/24/91
37 */
38
39/* node type */
40enum ntype {
41 N_AND = 1, /* must start > 0 */
42 N_ATIME, N_CLOSEPAREN, N_CTIME, N_DEPTH, N_EXEC, N_EXPR, N_FOLLOW,
43 N_FSTYPE, N_GROUP, N_INUM, N_LINKS, N_LS, N_MTIME, N_NAME, N_NEWER,
44 N_NOGROUP, N_NOT, N_NOUSER, N_OK, N_OPENPAREN, N_OR, N_PERM, N_PRINT,
45 N_PRUNE, N_SIZE, N_TYPE, N_USER, N_XDEV,
46};
47
48/* node definition */
49typedef struct _plandata {
50 struct _plandata *next; /* next node */
51 int (*eval)(); /* node evaluation function */
52 int flags; /* private flags */
53 enum ntype type; /* plan node type */
54 union {
55 gid_t _g_data; /* gid */
56 ino_t _i_data; /* inode */
57 mode_t _m_data; /* mode mask */
58 nlink_t _l_data; /* link count */
59 off_t _o_data; /* file size */
60 time_t _t_data; /* time value */
61 uid_t _u_data; /* uid */
62 struct _plandata *_p_data[2]; /* PLAN trees */
63 struct _ex {
64 char **_e_argv; /* argv array */
65 char **_e_orig; /* original strings */
66 int *_e_len; /* allocated length */
67 } ex;
68 char *_a_data[2]; /* array of char pointers */
69 char *_c_data; /* char pointer */
70 } p_un;
71#define a_data p_un._a_data
72#define c_data p_un._c_data
73#define i_data p_un._i_data
74#define g_data p_un._g_data
75#define l_data p_un._l_data
76#define m_data p_un._m_data
77#define o_data p_un._o_data
78#define p_data p_un._p_data
79#define t_data p_un._t_data
80#define u_data p_un._u_data
81#define e_argv p_un.ex._e_argv
82#define e_orig p_un.ex._e_orig
83#define e_len p_un.ex._e_len
84} PLAN;
85
86#include "extern.h"