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