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