Home | History | Annotate | Line # | Download | only in find
find.h revision 1.18.4.1 
      1 /*	$NetBSD: find.h,v 1.18.4.1 2005/10/11 22:56:27 reed Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1990, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * This code is derived from software contributed to Berkeley by
      8  * Cimarron D. Taylor of the University of California, Berkeley.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. Neither the name of the University nor the names of its contributors
     19  *    may be used to endorse or promote products derived from this software
     20  *    without specific prior written permission.
     21  *
     22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32  * SUCH DAMAGE.
     33  *
     34  *	from: @(#)find.h	8.1 (Berkeley) 6/6/93
     35  */
     36 
     37 #include <regex.h>
     38 
     39 /* node type */
     40 enum ntype {
     41 	N_AND = 1, 				/* must start > 0 */
     42 	N_AMIN, N_ANEWER, N_ATIME, N_CLOSEPAREN, N_CMIN, N_CNEWER, N_CTIME,
     43 	N_DEPTH, N_EMPTY,
     44 	N_EXEC, N_EXECDIR, N_EXPR, N_FLAGS, N_FOLLOW, N_FPRINT, N_FSTYPE, N_GROUP,
     45 	N_INAME, N_INUM, N_IREGEX, N_LINKS, N_LS, N_MINDEPTH, N_MAXDEPTH,
     46 	N_MMIN, N_MTIME, N_NAME, N_NEWER, N_NOGROUP, N_NOT, N_NOUSER, N_OK,
     47 	N_OPENPAREN, N_OR, N_PATH, N_PERM, N_PRINT, N_PRINT0, N_PRINTX,
     48 	N_PRUNE, N_REGEX, N_SIZE, N_TYPE, N_USER, N_XDEV
     49 };
     50 
     51 /* node definition */
     52 typedef struct _plandata {
     53 	struct _plandata *next;			/* next node */
     54 	int (*eval)				/* node evaluation function */
     55 	    __P((struct _plandata *, FTSENT *));
     56 #define	F_EQUAL		1			/* [acm]time inum links size */
     57 #define	F_LESSTHAN	2
     58 #define	F_GREATER	3
     59 #define	F_NEEDOK	1			/* exec ok */
     60 #define	F_MTFLAG	1			/* fstype */
     61 #define	F_MTTYPE	2
     62 #define	F_ATLEAST	1			/* perm */
     63 	int flags;				/* private flags */
     64 	enum ntype type;			/* plan node type */
     65 	union {
     66 		u_int32_t _f_data;		/* flags */
     67 		gid_t _g_data;			/* gid */
     68 		ino_t _i_data;			/* inode */
     69 		mode_t _m_data;			/* mode mask */
     70 		nlink_t _l_data;		/* link count */
     71 		off_t _o_data;			/* file size */
     72 		time_t _t_data;			/* time value */
     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 */
     83 		int _max_data;			/* tree depth */
     84 		int _min_data;			/* tree depth */
     85 		regex_t _regexp_data;		/* compiled regexp */
     86 		FILE *_fprint_file;		/* file stream for -fprint */
     87 	} p_un;
     88 } PLAN;
     89 #define	a_data		p_un._a_data
     90 #define	c_data		p_un._c_data
     91 #define	i_data		p_un._i_data
     92 #define	f_data		p_un._f_data
     93 #define	g_data		p_un._g_data
     94 #define	l_data		p_un._l_data
     95 #define	m_data		p_un._m_data
     96 #define	mt_data		p_un._mt_data
     97 #define	o_data		p_un._o_data
     98 #define	p_data		p_un._p_data
     99 #define	t_data		p_un._t_data
    100 #define	u_data		p_un._u_data
    101 #define	e_argv		p_un.ex._e_argv
    102 #define	e_orig		p_un.ex._e_orig
    103 #define	e_len		p_un.ex._e_len
    104 #define	max_data	p_un._max_data
    105 #define	min_data	p_un._min_data
    106 #define	regexp_data	p_un._regexp_data
    107 #define	fprint_file	p_un._fprint_file
    108 
    109 typedef struct _option {
    110 	char *name;			/* option name */
    111 	enum ntype token;		/* token type */
    112 	PLAN *(*create)			/* create function */
    113 		__P((char ***, int));
    114 	int arg;			/* function needs arg */
    115 } OPTION;
    116 
    117 #include "extern.h"
    118