Deleted Added
full compact
main.c (200420) main.c (200462)
1/*-
2 * Copyright (c) 1990, 1993, 1994
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
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
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
37#ifndef lint
38char copyright[] =
39"@(#) Copyright (c) 1990, 1993, 1994\n\
40 The Regents of the University of California. All rights reserved.\n";
41#endif /* not lint */
42
43#ifndef lint
44#if 0
45static char sccsid[] = "@(#)main.c 8.4 (Berkeley) 5/4/95";
46#endif
47#endif /* not lint */
48
49#include <sys/cdefs.h>
1/*-
2 * Copyright (c) 1990, 1993, 1994
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
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
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
37#ifndef lint
38char copyright[] =
39"@(#) Copyright (c) 1990, 1993, 1994\n\
40 The Regents of the University of California. All rights reserved.\n";
41#endif /* not lint */
42
43#ifndef lint
44#if 0
45static char sccsid[] = "@(#)main.c 8.4 (Berkeley) 5/4/95";
46#endif
47#endif /* not lint */
48
49#include <sys/cdefs.h>
50__FBSDID("$FreeBSD: head/usr.bin/find/main.c 200420 2009-12-11 23:35:38Z delphij $");
50__FBSDID("$FreeBSD: head/usr.bin/find/main.c 200462 2009-12-13 03:14:06Z delphij $");
51
52#include <sys/types.h>
53#include <sys/stat.h>
54
55#include <err.h>
51
52#include <sys/types.h>
53#include <sys/stat.h>
54
55#include <err.h>
56#include <errno.h>
56#include <fcntl.h>
57#include <fts.h>
58#include <locale.h>
59#include <regex.h>
60#include <stdio.h>
61#include <stdlib.h>
62#include <time.h>
63#include <unistd.h>
64
65#include "find.h"
66
67time_t now; /* time find was run */
68int dotfd; /* starting directory */
69int ftsoptions; /* options for the ftsopen(3) call */
70int isdeprecated; /* using deprecated syntax */
71int isdepth; /* do directories on post-order visit */
72int isoutput; /* user specified output operator */
73int issort; /* do hierarchies in lexicographical order */
74int isxargs; /* don't permit xargs delimiting chars */
75int mindepth = -1, maxdepth = -1; /* minimum and maximum depth */
76int regexp_flags = REG_BASIC; /* use the "basic" regexp by default*/
77
78static void usage(void);
79
80int
81main(int argc, char *argv[])
82{
83 char **p, **start;
84 int Hflag, Lflag, ch;
85
86 (void)setlocale(LC_ALL, "");
87
88 (void)time(&now); /* initialize the time-of-day */
89
90 p = start = argv;
91 Hflag = Lflag = 0;
92 ftsoptions = FTS_NOSTAT | FTS_PHYSICAL;
93 while ((ch = getopt(argc, argv, "EHLPXdf:sx")) != -1)
94 switch (ch) {
95 case 'E':
96 regexp_flags |= REG_EXTENDED;
97 break;
98 case 'H':
99 Hflag = 1;
100 Lflag = 0;
101 break;
102 case 'L':
103 Lflag = 1;
104 Hflag = 0;
105 break;
106 case 'P':
107 Hflag = Lflag = 0;
108 break;
109 case 'X':
110 isxargs = 1;
111 break;
112 case 'd':
113 isdepth = 1;
114 break;
115 case 'f':
116 *p++ = optarg;
117 break;
118 case 's':
119 issort = 1;
120 break;
121 case 'x':
122 ftsoptions |= FTS_XDEV;
123 break;
124 case '?':
125 default:
126 break;
127 }
128
129 argc -= optind;
130 argv += optind;
131
132 if (Hflag)
133 ftsoptions |= FTS_COMFOLLOW;
134 if (Lflag) {
135 ftsoptions &= ~FTS_PHYSICAL;
136 ftsoptions |= FTS_LOGICAL;
137 }
138
139 /*
140 * Find first option to delimit the file list. The first argument
141 * that starts with a -, or is a ! or a ( must be interpreted as a
142 * part of the find expression, according to POSIX .2.
143 */
144 for (; *argv != NULL; *p++ = *argv++) {
145 if (argv[0][0] == '-')
146 break;
147 if ((argv[0][0] == '!' || argv[0][0] == '(') &&
148 argv[0][1] == '\0')
149 break;
150 }
151
152 if (p == start)
153 usage();
154 *p = NULL;
155
156 if ((dotfd = open(".", O_RDONLY, 0)) < 0)
157 err(1, ".");
158
159 exit(find_execute(find_formplan(argv), start));
160}
161
162static void
163usage(void)
164{
165 (void)fprintf(stderr, "%s\n%s\n",
166"usage: find [-H | -L | -P] [-EXdsx] [-f path] path ... [expression]",
167" find [-H | -L | -P] [-EXdsx] -f path [path ...] [expression]");
168 exit(1);
169}
57#include <fcntl.h>
58#include <fts.h>
59#include <locale.h>
60#include <regex.h>
61#include <stdio.h>
62#include <stdlib.h>
63#include <time.h>
64#include <unistd.h>
65
66#include "find.h"
67
68time_t now; /* time find was run */
69int dotfd; /* starting directory */
70int ftsoptions; /* options for the ftsopen(3) call */
71int isdeprecated; /* using deprecated syntax */
72int isdepth; /* do directories on post-order visit */
73int isoutput; /* user specified output operator */
74int issort; /* do hierarchies in lexicographical order */
75int isxargs; /* don't permit xargs delimiting chars */
76int mindepth = -1, maxdepth = -1; /* minimum and maximum depth */
77int regexp_flags = REG_BASIC; /* use the "basic" regexp by default*/
78
79static void usage(void);
80
81int
82main(int argc, char *argv[])
83{
84 char **p, **start;
85 int Hflag, Lflag, ch;
86
87 (void)setlocale(LC_ALL, "");
88
89 (void)time(&now); /* initialize the time-of-day */
90
91 p = start = argv;
92 Hflag = Lflag = 0;
93 ftsoptions = FTS_NOSTAT | FTS_PHYSICAL;
94 while ((ch = getopt(argc, argv, "EHLPXdf:sx")) != -1)
95 switch (ch) {
96 case 'E':
97 regexp_flags |= REG_EXTENDED;
98 break;
99 case 'H':
100 Hflag = 1;
101 Lflag = 0;
102 break;
103 case 'L':
104 Lflag = 1;
105 Hflag = 0;
106 break;
107 case 'P':
108 Hflag = Lflag = 0;
109 break;
110 case 'X':
111 isxargs = 1;
112 break;
113 case 'd':
114 isdepth = 1;
115 break;
116 case 'f':
117 *p++ = optarg;
118 break;
119 case 's':
120 issort = 1;
121 break;
122 case 'x':
123 ftsoptions |= FTS_XDEV;
124 break;
125 case '?':
126 default:
127 break;
128 }
129
130 argc -= optind;
131 argv += optind;
132
133 if (Hflag)
134 ftsoptions |= FTS_COMFOLLOW;
135 if (Lflag) {
136 ftsoptions &= ~FTS_PHYSICAL;
137 ftsoptions |= FTS_LOGICAL;
138 }
139
140 /*
141 * Find first option to delimit the file list. The first argument
142 * that starts with a -, or is a ! or a ( must be interpreted as a
143 * part of the find expression, according to POSIX .2.
144 */
145 for (; *argv != NULL; *p++ = *argv++) {
146 if (argv[0][0] == '-')
147 break;
148 if ((argv[0][0] == '!' || argv[0][0] == '(') &&
149 argv[0][1] == '\0')
150 break;
151 }
152
153 if (p == start)
154 usage();
155 *p = NULL;
156
157 if ((dotfd = open(".", O_RDONLY, 0)) < 0)
158 err(1, ".");
159
160 exit(find_execute(find_formplan(argv), start));
161}
162
163static void
164usage(void)
165{
166 (void)fprintf(stderr, "%s\n%s\n",
167"usage: find [-H | -L | -P] [-EXdsx] [-f path] path ... [expression]",
168" find [-H | -L | -P] [-EXdsx] -f path [path ...] [expression]");
169 exit(1);
170}