[unix-history] / usr.bin / find / find.h

/*-
 * Copyright (c) 1990, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Cimarron D. Taylor of the University of California, Berkeley.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)find.h	8.1 (Berkeley) 6/6/93
 */

/* node type */
enum ntype {
	N_AND = 1, 				/* must start > 0 */
	N_ATIME, N_CLOSEPAREN, N_CTIME, N_DEPTH, N_EXEC, N_EXPR, N_FOLLOW,
	N_FSTYPE, N_GROUP, N_INUM, N_LINKS, N_LS, N_MTIME, N_NAME, N_NEWER,
	N_NOGROUP, N_NOT, N_NOUSER, N_OK, N_OPENPAREN, N_OR, N_PATH,
	N_PERM, N_PRINT, N_PRUNE, N_SIZE, N_TYPE, N_USER, N_XDEV,
};

/* node definition */
typedef struct _plandata {
	struct _plandata *next;			/* next node */
	int (*eval)				/* node evaluation function */
	    __P((struct _plandata *, FTSENT *));
#define	F_EQUAL		1			/* [acm]time inum links size */
#define	F_LESSTHAN	2
#define	F_GREATER	3
#define	F_NEEDOK	1			/* exec ok */
#define	F_MTFLAG	1			/* fstype */
#define	F_MTTYPE	2
#define	F_ATLEAST	1			/* perm */
#define F_PRINT0	1
#define F_PRINTF	2
	int flags;				/* private flags */
	enum ntype type;			/* plan node type */
	union {
		gid_t _g_data;			/* gid */
		ino_t _i_data;			/* inode */
		mode_t _m_data;			/* mode mask */
		nlink_t _l_data;		/* link count */
		off_t _o_data;			/* file size */
		time_t _t_data;			/* time value */
		uid_t _u_data;			/* uid */
		short _mt_data;			/* mount flags */
		struct _plandata *_p_data[2];	/* PLAN trees */
		struct _ex {
			char **_e_argv;		/* argv array */
			char **_e_orig;		/* original strings */
			int *_e_len;		/* allocated length */
		} ex;
		char *_a_data[2];		/* array of char pointers */
		char *_c_data;			/* char pointer */
	} p_un;
} PLAN;
#define	a_data	p_un._a_data
#define	c_data	p_un._c_data
#define	i_data	p_un._i_data
#define	g_data	p_un._g_data
#define	l_data	p_un._l_data
#define	m_data	p_un._m_data
#define	mt_data	p_un._mt_data
#define	o_data	p_un._o_data
#define	p_data	p_un._p_data
#define	t_data	p_un._t_data
#define	u_data	p_un._u_data
#define	e_argv	p_un.ex._e_argv
#define	e_orig	p_un.ex._e_orig
#define	e_len	p_un.ex._e_len

typedef struct _option {
	char *name;			/* option name */
	enum ntype token;		/* token type */
	PLAN *(*create)();		/* create function: DON'T PROTOTYPE! */
#define	O_NONE		0x01		/* no call required */
#define	O_ZERO		0x02		/* pass: nothing */
#define	O_ARGV		0x04		/* pass: argv, increment argv */
#define	O_ARGVP		0x08		/* pass: *argv, N_OK || N_EXEC */
	int flags;
} OPTION;

#include "extern.h"
Commit	Line	Data
15637ed4	1	/*-
6b479535 NW	2	* Copyright (c) 1990, 1993
6b479535 NW	3	* The Regents of the University of California. All rights reserved.
15637ed4 RG	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	*
6b479535	36	* @(#)find.h 8.1 (Berkeley) 6/6/93
15637ed4 RG	37	*/
	38
	39	/* node type */
	40	enum 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,
4e97a0eb NW	44	N_NOGROUP, N_NOT, N_NOUSER, N_OK, N_OPENPAREN, N_OR, N_PATH,
4e97a0eb NW	45	N_PERM, N_PRINT, N_PRUNE, N_SIZE, N_TYPE, N_USER, N_XDEV,
15637ed4 RG	46	};
	47
	48	/* node definition */
	49	typedef struct _plandata {
	50	struct _plandata next; / next node */
6b479535 NW	51	int (eval) / node evaluation function */
6b479535 NW	52	__P((struct _plandata , FTSENT ));
4e97a0eb NW	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 */
a558e4ae GW	60	#define F_PRINT0 1
a558e4ae GW	61	#define F_PRINTF 2
15637ed4 RG	62	int flags; /* private flags */
	63	enum ntype type; /* plan node type */
	64	union {
	65	gid_t _g_data; /* gid */
	66	ino_t _i_data; /* inode */
	67	mode_t _m_data; /* mode mask */
	68	nlink_t _l_data; /* link count */
	69	off_t _o_data; /* file size */
	70	time_t _t_data; /* time value */
	71	uid_t _u_data; /* uid */
4e97a0eb	72	short _mt_data; /* mount flags */
15637ed4 RG	73	struct _plandata _p_data[2]; / PLAN trees */
	74	struct _ex {
	75	char *_e_argv; / argv array */
	76	char *_e_orig; / original strings */
	77	int _e_len; / allocated length */
	78	} ex;
	79	char _a_data[2]; / array of char pointers */
	80	char _c_data; / char pointer */
	81	} p_un;
4e97a0eb	82	} PLAN;
15637ed4 RG	83	#define a_data p_un._a_data
	84	#define c_data p_un._c_data
	85	#define i_data p_un._i_data
	86	#define g_data p_un._g_data
	87	#define l_data p_un._l_data
	88	#define m_data p_un._m_data
4e97a0eb	89	#define mt_data p_un._mt_data
15637ed4 RG	90	#define o_data p_un._o_data
	91	#define p_data p_un._p_data
	92	#define t_data p_un._t_data
	93	#define u_data p_un._u_data
	94	#define e_argv p_un.ex._e_argv
	95	#define e_orig p_un.ex._e_orig
	96	#define e_len p_un.ex._e_len
15637ed4	97
6b479535 NW	98	typedef struct _option {
	99	char name; / option name */
	100	enum ntype token; /* token type */
	101	PLAN (create)(); /* create function: DON'T PROTOTYPE! */
	102	#define O_NONE 0x01 /* no call required */
	103	#define O_ZERO 0x02 /* pass: nothing */
	104	#define O_ARGV 0x04 /* pass: argv, increment argv */
	105	#define O_ARGVP 0x08 /* pass: argv, N_OK \|\| N_EXEC /
	106	int flags;
	107	} OPTION;
	108
15637ed4	109	#include "extern.h"