| find.h (61573) | find.h (61575) |
|---|---|
| 1/*- 2 * Copyright (c) 1990, 1993 3 * The Regents of the University of California. 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 --- 20 unchanged lines hidden (view full) --- 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 8.1 (Berkeley) 6/6/93 | 1/*- 2 * Copyright (c) 1990, 1993 3 * The Regents of the University of California. 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 --- 20 unchanged lines hidden (view full) --- 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 8.1 (Berkeley) 6/6/93 |
| 37 * $FreeBSD: head/usr.bin/find/find.h 61573 2000-06-12 10:36:52Z roberto $ | 37 * $FreeBSD: head/usr.bin/find/find.h 61575 2000-06-12 11:12:41Z roberto $ |
| 38 */ 39 40/* node type */ 41enum ntype { 42 N_AND = 1, /* must start > 0 */ 43 N_AMIN, N_ATIME, N_CLOSEPAREN, N_CMIN, N_CTIME, N_DEPTH, 44 N_EXEC, N_EXECDIR, N_EXPR, N_FLAGS, 45 N_FOLLOW, N_FSTYPE, N_GROUP, N_INUM, N_LINKS, N_LS, N_MMIN, 46 N_MTIME, N_NAME, 47 N_NEWER, N_NOGROUP, N_NOT, N_NOUSER, N_OK, N_OPENPAREN, N_OR, N_PATH, 48 N_PERM, N_PRINT, N_PRUNE, N_SIZE, N_TYPE, N_USER, N_XDEV, | 38 */ 39 40/* node type */ 41enum ntype { 42 N_AND = 1, /* must start > 0 */ 43 N_AMIN, N_ATIME, N_CLOSEPAREN, N_CMIN, N_CTIME, N_DEPTH, 44 N_EXEC, N_EXECDIR, N_EXPR, N_FLAGS, 45 N_FOLLOW, N_FSTYPE, N_GROUP, N_INUM, N_LINKS, N_LS, N_MMIN, 46 N_MTIME, N_NAME, 47 N_NEWER, N_NOGROUP, N_NOT, N_NOUSER, N_OK, N_OPENPAREN, N_OR, N_PATH, 48 N_PERM, N_PRINT, N_PRUNE, N_SIZE, N_TYPE, N_USER, N_XDEV, |
| 49 N_PRINT0, N_DELETE | 49 N_PRINT0, N_DELETE, N_MAXDEPTH, N_MINDEPTH |
| 50}; 51 52/* node definition */ 53typedef struct _plandata { 54 struct _plandata *next; /* next node */ 55 int (*eval) /* node evaluation function */ 56 __P((struct _plandata *, FTSENT *)); 57#define F_EQUAL 1 /* [acm]time inum links size */ --- 61 unchanged lines hidden --- | 50}; 51 52/* node definition */ 53typedef struct _plandata { 54 struct _plandata *next; /* next node */ 55 int (*eval) /* node evaluation function */ 56 __P((struct _plandata *, FTSENT *)); 57#define F_EQUAL 1 /* [acm]time inum links size */ --- 61 unchanged lines hidden --- |