coverity appeasement - redundant check
[minix.git] / commands / find / extern.h
blob7c8c4addf7d2b811e1c2c0014e1f067b4a9b2413
1 /* $NetBSD: extern.h,v 1.28 2007/07/19 07:49:30 daniel Exp $ */
3 /*-
4 * Copyright (c) 1991, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
31 * from: @(#)extern.h 8.3 (Berkeley) 4/16/94
34 #include <sys/cdefs.h>
36 void brace_subst(char *, char **, char *, int *);
37 PLAN *find_create(char ***);
38 int find_execute(PLAN *, char **);
39 PLAN *find_formplan(char **);
40 int find_traverse(PLAN *, int (*)(PLAN *, void *), void *);
41 int f_expr(PLAN *, FTSENT *);
42 PLAN *not_squish(PLAN *);
43 PLAN *or_squish(PLAN *);
44 PLAN *paren_squish(PLAN *);
45 int plan_cleanup(PLAN *, void *);
46 void printlong(char *, char *, struct stat *);
47 int queryuser(char **);
48 void show_path(int);
50 PLAN *c_amin(char ***, int);
51 PLAN *c_anewer(char ***, int);
52 PLAN *c_atime(char ***, int);
53 PLAN *c_cmin(char ***, int);
54 PLAN *c_cnewer(char ***, int);
55 PLAN *c_ctime(char ***, int);
56 PLAN *c_delete(char ***, int);
57 PLAN *c_depth(char ***, int);
58 PLAN *c_empty(char ***, int);
59 PLAN *c_exec(char ***, int);
60 PLAN *c_execdir(char ***, int);
61 PLAN *c_exit(char ***, int);
62 PLAN *c_false(char ***, int);
63 PLAN *c_flags(char ***, int);
64 PLAN *c_follow(char ***, int);
65 PLAN *c_fprint(char ***, int);
66 PLAN *c_fstype(char ***, int);
67 PLAN *c_group(char ***, int);
68 PLAN *c_iname(char ***, int);
69 PLAN *c_inum(char ***, int);
70 PLAN *c_iregex(char ***, int);
71 PLAN *c_links(char ***, int);
72 PLAN *c_ls(char ***, int);
73 PLAN *c_maxdepth(char ***, int);
74 PLAN *c_mindepth(char ***, int);
75 PLAN *c_mmin(char ***, int);
76 PLAN *c_mtime(char ***, int);
77 PLAN *c_name(char ***, int);
78 PLAN *c_newer(char ***, int);
79 PLAN *c_nogroup(char ***, int);
80 PLAN *c_nouser(char ***, int);
81 PLAN *c_path(char ***, int);
82 PLAN *c_perm(char ***, int);
83 PLAN *c_print(char ***, int);
84 PLAN *c_print0(char ***, int);
85 PLAN *c_printx(char ***, int);
86 PLAN *c_prune(char ***, int);
87 PLAN *c_regex(char ***, int);
88 PLAN *c_size(char ***, int);
89 PLAN *c_type(char ***, int);
90 PLAN *c_user(char ***, int);
91 PLAN *c_xdev(char ***, int);
92 PLAN *c_openparen(char ***, int);
93 PLAN *c_closeparen(char ***, int);
94 PLAN *c_not(char ***, int);
95 PLAN *c_or(char ***, int);
96 PLAN *c_null(char ***, int);
98 extern int ftsoptions, isdeprecated, isdepth, isoutput, issort, isxargs,
99 regcomp_flags;