commands/find/find.h

   1 /*      $NetBSD: find.h,v 1.24 2007/02/06 13:25:01 elad 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, N_EXEC, N_EXECDIR, N_EXIT, N_EXPR, N_FALSE,
  44         N_FOLLOW, N_FPRINT,
  45 #ifndef _MINIX
  46         N_FSTYPE,
  47         N_FLAGS,
  48 #endif
  49         N_GROUP,
  50         N_INAME, N_INUM, N_IREGEX, N_LINKS, N_LS, N_MINDEPTH, N_MAXDEPTH,
  51         N_MMIN, N_MTIME, N_NAME, N_NEWER, N_NOGROUP, N_NOT, N_NOUSER, N_OK,
  52         N_OPENPAREN, N_OR, N_PATH, N_PERM, N_PRINT, N_PRINT0, N_PRINTX,
  53         N_PRUNE, N_REGEX, N_SIZE, N_TYPE, N_USER, N_XDEV, N_DELETE
  54 };
  55
  56 #ifndef __NBSD_LIBC
  57 typedef unsigned int u_int32_t;
  58 #endif
  59
  60 /* node definition */
  61 typedef struct _plandata {
  62         struct _plandata *next;                 /* next node */
  63         int (*eval)(struct _plandata *, FTSENT *);
  64                                                 /* node evaluation function */
  65 #define F_EQUAL         1                       /* [acm]time inum links size */
  66 #define F_LESSTHAN      2
  67 #define F_GREATER       3
  68 #define F_NEEDOK        1                       /* exec ok */
  69 #define F_PLUSSET       2                       /* -exec ... {} + */
  70 #define F_MTFLAG        1                       /* fstype */
  71 #define F_MTTYPE        2
  72 #define F_ATLEAST       1                       /* perm */
  73 #define F_ANY           2                       /* perm */
  74         int flags;                              /* private flags */
  75         enum ntype type;                        /* plan node type */
  76         union {
  77                 u_int32_t _f_data;              /* flags */
  78                 gid_t _g_data;                  /* gid */
  79                 ino_t _i_data;                  /* inode */
  80                 mode_t _m_data;                 /* mode mask */
  81                 nlink_t _l_data;                /* link count */
  82                 off_t _o_data;                  /* file size */
  83                 time_t _t_data;                 /* time value */
  84                 uid_t _u_data;                  /* uid */
  85                 short _mt_data;                 /* mount flags */
  86                 struct _plandata *_p_data[2];   /* PLAN trees */
  87                 struct _ex {
  88                         char **_e_argv;         /* argv array */
  89                         char **_e_orig;         /* original strings */
  90                         int *_e_len;            /* allocated length */
  91                         char **_ep_bxp;         /* ptr to 1st addt'l arg */
  92                         char *_ep_p;            /* current buffer pointer */
  93                         char *_ep_bbp;          /* begin buffer pointer */
  94                         char *_ep_ebp;          /* end buffer pointer */
  95                         int _ep_maxargs;        /* max #args */
  96                         int _ep_narg;           /* # addt'l args */
  97                         int _ep_rval;           /* return value */
  98                 } ex;
  99                 char *_a_data[2];               /* array of char pointers */
 100                 char *_c_data;                  /* char pointer */
 101                 int _exit_val;                  /* exit value */
 102                 int _max_data;                  /* tree depth */
 103                 int _min_data;                  /* tree depth */
 104                 regex_t _regexp_data;           /* compiled regexp */
 105                 FILE *_fprint_file;             /* file stream for -fprint */
 106         } p_un;
 107 } PLAN;
 108 #define a_data          p_un._a_data
 109 #define c_data          p_un._c_data
 110 #define i_data          p_un._i_data
 111 #define f_data          p_un._f_data
 112 #define g_data          p_un._g_data
 113 #define l_data          p_un._l_data
 114 #define m_data          p_un._m_data
 115 #define mt_data         p_un._mt_data
 116 #define o_data          p_un._o_data
 117 #define p_data          p_un._p_data
 118 #define t_data          p_un._t_data
 119 #define u_data          p_un._u_data
 120 #define e_argv          p_un.ex._e_argv
 121 #define e_orig          p_un.ex._e_orig
 122 #define e_len           p_un.ex._e_len
 123 #define ep_p            p_un.ex._ep_p
 124 #define ep_bbp          p_un.ex._ep_bbp
 125 #define ep_ebp          p_un.ex._ep_ebp
 126 #define ep_bxp          p_un.ex._ep_bxp
 127 #define ep_cnt          p_un.ex._ep_cnt
 128 #define ep_maxargs      p_un.ex._ep_maxargs
 129 #define ep_nline        p_un.ex._ep_nline
 130 #define ep_narg         p_un.ex._ep_narg
 131 #define ep_rval         p_un.ex._ep_rval
 132 #define exit_val        p_un._exit_val
 133 #define max_data        p_un._max_data
 134 #define min_data        p_un._min_data
 135 #define regexp_data     p_un._regexp_data
 136 #define fprint_file     p_un._fprint_file
 137
 138 typedef struct _option {
 139         const char *name;               /* option name */
 140         enum ntype token;               /* token type */
 141         PLAN *(*create)(char ***, int); /* create function */
 142         int arg;                        /* function needs arg */
 143 } OPTION;
 144
 145 #include "extern.h"