]>
Commit | Line | Data |
---|---|---|
28f540f4 RM |
1 | /*- |
2 | * Copyright (c) 1990, 1993 | |
3 | * The Regents of the University of California. All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
8 | * 1. Redistributions of source code must retain the above copyright | |
9 | * notice, this list of conditions and the following disclaimer. | |
10 | * 2. Redistributions in binary form must reproduce the above copyright | |
11 | * notice, this list of conditions and the following disclaimer in the | |
12 | * documentation and/or other materials provided with the distribution. | |
13 | * 3. All advertising materials mentioning features or use of this software | |
14 | * must display the following acknowledgement: | |
15 | * This product includes software developed by the University of | |
16 | * California, Berkeley and its contributors. | |
17 | * 4. Neither the name of the University nor the names of its contributors | |
18 | * may be used to endorse or promote products derived from this software | |
19 | * without specific prior written permission. | |
20 | * | |
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
31 | * SUCH DAMAGE. | |
32 | */ | |
33 | ||
34 | #if defined(LIBC_SCCS) && !defined(lint) | |
35 | static char sccsid[] = "@(#)fts.c 8.2 (Berkeley) 1/2/94"; | |
36 | #endif /* LIBC_SCCS and not lint */ | |
37 | ||
38 | #include <sys/param.h> | |
cc3fa755 | 39 | #include <include/sys/stat.h> |
28f540f4 RM |
40 | #include <fcntl.h> |
41 | #include <dirent.h> | |
42 | #include <errno.h> | |
43 | #include <fts.h> | |
44 | #include <stdlib.h> | |
45 | #include <string.h> | |
46 | #include <unistd.h> | |
47 | ||
48 | ||
49 | /* Largest alignment size needed, minus one. | |
50 | Usually long double is the worst case. */ | |
51 | #ifndef ALIGNBYTES | |
52 | #define ALIGNBYTES (__alignof__ (long double) - 1) | |
53 | #endif | |
54 | /* Align P to that size. */ | |
55 | #ifndef ALIGN | |
56 | #define ALIGN(p) (((unsigned long int) (p) + ALIGNBYTES) & ~ALIGNBYTES) | |
57 | #endif | |
58 | ||
59 | ||
dfd2257a UD |
60 | static FTSENT *fts_alloc __P((FTS *, const char *, int)) internal_function; |
61 | static FTSENT *fts_build __P((FTS *, int)) internal_function; | |
62 | static void fts_lfree __P((FTSENT *)) internal_function; | |
28f540f4 | 63 | static void fts_load __P((FTS *, FTSENT *)); |
dfd2257a UD |
64 | static size_t fts_maxarglen __P((char * const *)) internal_function; |
65 | static void fts_padjust __P((FTS *, void *)) internal_function; | |
66 | static int fts_palloc __P((FTS *, size_t)) internal_function; | |
67 | static FTSENT *fts_sort __P((FTS *, FTSENT *, int)) internal_function; | |
68 | static u_short fts_stat __P((FTS *, FTSENT *, int)) internal_function; | |
28f540f4 | 69 | |
a36e4c9f UD |
70 | #ifndef MAX |
71 | #define MAX(a, b) ({ __typeof__ (a) _a = (a); \ | |
72 | __typeof__ (b) _b = (b); \ | |
73 | _a > _b ? _a : _b; }) | |
74 | #endif | |
75 | ||
28f540f4 RM |
76 | #define ISDOT(a) (a[0] == '.' && (!a[1] || a[1] == '.' && !a[2])) |
77 | ||
78 | #define ISSET(opt) (sp->fts_options & opt) | |
79 | #define SET(opt) (sp->fts_options |= opt) | |
80 | ||
81 | #define CHDIR(sp, path) (!ISSET(FTS_NOCHDIR) && chdir(path)) | |
82 | #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd)) | |
83 | ||
84 | /* fts_build flags */ | |
85 | #define BCHILD 1 /* fts_children */ | |
86 | #define BNAMES 2 /* fts_children, names only */ | |
87 | #define BREAD 3 /* fts_read */ | |
88 | ||
89 | FTS * | |
90 | fts_open(argv, options, compar) | |
91 | char * const *argv; | |
92 | register int options; | |
8ebd0a71 | 93 | int (*compar) __P((const FTSENT **, const FTSENT **)); |
28f540f4 RM |
94 | { |
95 | register FTS *sp; | |
96 | register FTSENT *p, *root; | |
97 | register int nitems; | |
98 | FTSENT *parent, *tmp; | |
99 | int len; | |
100 | ||
101 | /* Options check. */ | |
102 | if (options & ~FTS_OPTIONMASK) { | |
c4029823 | 103 | __set_errno (EINVAL); |
28f540f4 RM |
104 | return (NULL); |
105 | } | |
106 | ||
107 | /* Allocate/initialize the stream */ | |
108 | if ((sp = malloc((u_int)sizeof(FTS))) == NULL) | |
109 | return (NULL); | |
110 | bzero(sp, sizeof(FTS)); | |
8ebd0a71 | 111 | sp->fts_compar = (int (*) __P((const void *, const void *))) compar; |
28f540f4 RM |
112 | sp->fts_options = options; |
113 | ||
114 | /* Logical walks turn on NOCHDIR; symbolic links are too hard. */ | |
115 | if (ISSET(FTS_LOGICAL)) | |
116 | SET(FTS_NOCHDIR); | |
117 | ||
118 | /* | |
119 | * Start out with 1K of path space, and enough, in any case, | |
120 | * to hold the user's paths. | |
121 | */ | |
122 | #ifndef MAXPATHLEN | |
123 | #define MAXPATHLEN 1024 | |
124 | #endif | |
125 | if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN))) | |
126 | goto mem1; | |
127 | ||
128 | /* Allocate/initialize root's parent. */ | |
129 | if ((parent = fts_alloc(sp, "", 0)) == NULL) | |
130 | goto mem2; | |
131 | parent->fts_level = FTS_ROOTPARENTLEVEL; | |
132 | ||
133 | /* Allocate/initialize root(s). */ | |
134 | for (root = NULL, nitems = 0; *argv; ++argv, ++nitems) { | |
135 | /* Don't allow zero-length paths. */ | |
136 | if ((len = strlen(*argv)) == 0) { | |
c4029823 | 137 | __set_errno (ENOENT); |
28f540f4 RM |
138 | goto mem3; |
139 | } | |
140 | ||
141 | p = fts_alloc(sp, *argv, len); | |
142 | p->fts_level = FTS_ROOTLEVEL; | |
143 | p->fts_parent = parent; | |
144 | p->fts_accpath = p->fts_name; | |
145 | p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW)); | |
146 | ||
147 | /* Command-line "." and ".." are real directories. */ | |
148 | if (p->fts_info == FTS_DOT) | |
149 | p->fts_info = FTS_D; | |
150 | ||
151 | /* | |
152 | * If comparison routine supplied, traverse in sorted | |
153 | * order; otherwise traverse in the order specified. | |
154 | */ | |
155 | if (compar) { | |
156 | p->fts_link = root; | |
157 | root = p; | |
158 | } else { | |
159 | p->fts_link = NULL; | |
160 | if (root == NULL) | |
161 | tmp = root = p; | |
162 | else { | |
163 | tmp->fts_link = p; | |
164 | tmp = p; | |
165 | } | |
166 | } | |
167 | } | |
168 | if (compar && nitems > 1) | |
169 | root = fts_sort(sp, root, nitems); | |
170 | ||
171 | /* | |
172 | * Allocate a dummy pointer and make fts_read think that we've just | |
173 | * finished the node before the root(s); set p->fts_info to FTS_INIT | |
174 | * so that everything about the "current" node is ignored. | |
175 | */ | |
176 | if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL) | |
177 | goto mem3; | |
178 | sp->fts_cur->fts_link = root; | |
179 | sp->fts_cur->fts_info = FTS_INIT; | |
180 | ||
181 | /* | |
182 | * If using chdir(2), grab a file descriptor pointing to dot to insure | |
183 | * that we can get back here; this could be avoided for some paths, | |
184 | * but almost certainly not worth the effort. Slashes, symbolic links, | |
185 | * and ".." are all fairly nasty problems. Note, if we can't get the | |
186 | * descriptor we run anyway, just more slowly. | |
187 | */ | |
188 | if (!ISSET(FTS_NOCHDIR) && (sp->fts_rfd = open(".", O_RDONLY, 0)) < 0) | |
189 | SET(FTS_NOCHDIR); | |
190 | ||
191 | return (sp); | |
192 | ||
193 | mem3: fts_lfree(root); | |
194 | free(parent); | |
195 | mem2: free(sp->fts_path); | |
196 | mem1: free(sp); | |
197 | return (NULL); | |
198 | } | |
199 | ||
200 | static void | |
201 | fts_load(sp, p) | |
202 | FTS *sp; | |
203 | register FTSENT *p; | |
204 | { | |
205 | register int len; | |
206 | register char *cp; | |
207 | ||
208 | /* | |
209 | * Load the stream structure for the next traversal. Since we don't | |
210 | * actually enter the directory until after the preorder visit, set | |
211 | * the fts_accpath field specially so the chdir gets done to the right | |
212 | * place and the user can access the first node. From fts_open it's | |
213 | * known that the path will fit. | |
214 | */ | |
215 | len = p->fts_pathlen = p->fts_namelen; | |
216 | bcopy(p->fts_name, sp->fts_path, len + 1); | |
217 | if ((cp = rindex(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) { | |
218 | len = strlen(++cp); | |
219 | bcopy(cp, p->fts_name, len + 1); | |
220 | p->fts_namelen = len; | |
221 | } | |
222 | p->fts_accpath = p->fts_path = sp->fts_path; | |
223 | sp->fts_dev = p->fts_dev; | |
224 | } | |
225 | ||
226 | int | |
227 | fts_close(sp) | |
228 | FTS *sp; | |
229 | { | |
230 | register FTSENT *freep, *p; | |
231 | int saved_errno; | |
232 | ||
233 | /* | |
234 | * This still works if we haven't read anything -- the dummy structure | |
235 | * points to the root list, so we step through to the end of the root | |
236 | * list which has a valid parent pointer. | |
237 | */ | |
238 | if (sp->fts_cur) { | |
239 | for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) { | |
240 | freep = p; | |
241 | p = p->fts_link ? p->fts_link : p->fts_parent; | |
242 | free(freep); | |
243 | } | |
244 | free(p); | |
245 | } | |
246 | ||
247 | /* Free up child linked list, sort array, path buffer. */ | |
248 | if (sp->fts_child) | |
249 | fts_lfree(sp->fts_child); | |
250 | if (sp->fts_array) | |
251 | free(sp->fts_array); | |
252 | free(sp->fts_path); | |
253 | ||
254 | /* Return to original directory, save errno if necessary. */ | |
255 | if (!ISSET(FTS_NOCHDIR)) { | |
256 | saved_errno = fchdir(sp->fts_rfd) ? errno : 0; | |
257 | (void)close(sp->fts_rfd); | |
258 | } | |
259 | ||
260 | /* Free up the stream pointer. */ | |
261 | free(sp); | |
262 | ||
263 | /* Set errno and return. */ | |
264 | if (!ISSET(FTS_NOCHDIR) && saved_errno) { | |
c4029823 | 265 | __set_errno (saved_errno); |
28f540f4 RM |
266 | return (-1); |
267 | } | |
268 | return (0); | |
269 | } | |
270 | ||
271 | /* | |
272 | * Special case a root of "/" so that slashes aren't appended which would | |
273 | * cause paths to be written as "//foo". | |
274 | */ | |
275 | #define NAPPEND(p) \ | |
276 | (p->fts_level == FTS_ROOTLEVEL && p->fts_pathlen == 1 && \ | |
277 | p->fts_path[0] == '/' ? 0 : p->fts_pathlen) | |
278 | ||
279 | FTSENT * | |
280 | fts_read(sp) | |
281 | register FTS *sp; | |
282 | { | |
283 | register FTSENT *p, *tmp; | |
284 | register int instr; | |
285 | register char *t; | |
286 | int saved_errno; | |
287 | ||
288 | /* If finished or unrecoverable error, return NULL. */ | |
289 | if (sp->fts_cur == NULL || ISSET(FTS_STOP)) | |
290 | return (NULL); | |
291 | ||
292 | /* Set current node pointer. */ | |
293 | p = sp->fts_cur; | |
294 | ||
295 | /* Save and zero out user instructions. */ | |
296 | instr = p->fts_instr; | |
297 | p->fts_instr = FTS_NOINSTR; | |
298 | ||
299 | /* Any type of file may be re-visited; re-stat and re-turn. */ | |
300 | if (instr == FTS_AGAIN) { | |
301 | p->fts_info = fts_stat(sp, p, 0); | |
302 | return (p); | |
303 | } | |
304 | ||
305 | /* | |
306 | * Following a symlink -- SLNONE test allows application to see | |
307 | * SLNONE and recover. If indirecting through a symlink, have | |
308 | * keep a pointer to current location. If unable to get that | |
309 | * pointer, follow fails. | |
310 | */ | |
311 | if (instr == FTS_FOLLOW && | |
312 | (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) { | |
313 | p->fts_info = fts_stat(sp, p, 1); | |
314 | if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) | |
315 | if ((p->fts_symfd = open(".", O_RDONLY, 0)) < 0) { | |
316 | p->fts_errno = errno; | |
317 | p->fts_info = FTS_ERR; | |
318 | } else | |
319 | p->fts_flags |= FTS_SYMFOLLOW; | |
320 | return (p); | |
321 | } | |
322 | ||
323 | /* Directory in pre-order. */ | |
324 | if (p->fts_info == FTS_D) { | |
325 | /* If skipped or crossed mount point, do post-order visit. */ | |
326 | if (instr == FTS_SKIP || | |
327 | ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev) { | |
328 | if (p->fts_flags & FTS_SYMFOLLOW) | |
329 | (void)close(p->fts_symfd); | |
330 | if (sp->fts_child) { | |
331 | fts_lfree(sp->fts_child); | |
332 | sp->fts_child = NULL; | |
333 | } | |
334 | p->fts_info = FTS_DP; | |
335 | return (p); | |
8ebd0a71 | 336 | } |
28f540f4 RM |
337 | |
338 | /* Rebuild if only read the names and now traversing. */ | |
339 | if (sp->fts_child && sp->fts_options & FTS_NAMEONLY) { | |
340 | sp->fts_options &= ~FTS_NAMEONLY; | |
341 | fts_lfree(sp->fts_child); | |
342 | sp->fts_child = NULL; | |
343 | } | |
344 | ||
345 | /* | |
346 | * Cd to the subdirectory. | |
347 | * | |
348 | * If have already read and now fail to chdir, whack the list | |
349 | * to make the names come out right, and set the parent errno | |
350 | * so the application will eventually get an error condition. | |
351 | * Set the FTS_DONTCHDIR flag so that when we logically change | |
352 | * directories back to the parent we don't do a chdir. | |
353 | * | |
354 | * If haven't read do so. If the read fails, fts_build sets | |
355 | * FTS_STOP or the fts_info field of the node. | |
356 | */ | |
357 | if (sp->fts_child) { | |
358 | if (CHDIR(sp, p->fts_accpath)) { | |
359 | p->fts_errno = errno; | |
360 | p->fts_flags |= FTS_DONTCHDIR; | |
361 | for (p = sp->fts_child; p; p = p->fts_link) | |
362 | p->fts_accpath = | |
363 | p->fts_parent->fts_accpath; | |
364 | } | |
365 | } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) { | |
366 | if (ISSET(FTS_STOP)) | |
367 | return (NULL); | |
368 | return (p); | |
369 | } | |
370 | p = sp->fts_child; | |
371 | sp->fts_child = NULL; | |
372 | goto name; | |
373 | } | |
374 | ||
375 | /* Move to the next node on this level. */ | |
376 | next: tmp = p; | |
377 | if (p = p->fts_link) { | |
378 | free(tmp); | |
379 | ||
380 | /* | |
381 | * If reached the top, return to the original directory, and | |
382 | * load the paths for the next root. | |
383 | */ | |
384 | if (p->fts_level == FTS_ROOTLEVEL) { | |
385 | if (!ISSET(FTS_NOCHDIR) && FCHDIR(sp, sp->fts_rfd)) { | |
386 | SET(FTS_STOP); | |
387 | return (NULL); | |
388 | } | |
389 | fts_load(sp, p); | |
390 | return (sp->fts_cur = p); | |
391 | } | |
392 | ||
393 | /* | |
394 | * User may have called fts_set on the node. If skipped, | |
395 | * ignore. If followed, get a file descriptor so we can | |
396 | * get back if necessary. | |
397 | */ | |
398 | if (p->fts_instr == FTS_SKIP) | |
399 | goto next; | |
400 | if (p->fts_instr == FTS_FOLLOW) { | |
401 | p->fts_info = fts_stat(sp, p, 1); | |
402 | if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) | |
403 | if ((p->fts_symfd = | |
404 | open(".", O_RDONLY, 0)) < 0) { | |
405 | p->fts_errno = errno; | |
406 | p->fts_info = FTS_ERR; | |
407 | } else | |
408 | p->fts_flags |= FTS_SYMFOLLOW; | |
409 | p->fts_instr = FTS_NOINSTR; | |
410 | } | |
411 | ||
412 | name: t = sp->fts_path + NAPPEND(p->fts_parent); | |
413 | *t++ = '/'; | |
414 | bcopy(p->fts_name, t, p->fts_namelen + 1); | |
415 | return (sp->fts_cur = p); | |
416 | } | |
417 | ||
418 | /* Move up to the parent node. */ | |
419 | p = tmp->fts_parent; | |
420 | free(tmp); | |
421 | ||
422 | if (p->fts_level == FTS_ROOTPARENTLEVEL) { | |
423 | /* | |
424 | * Done; free everything up and set errno to 0 so the user | |
425 | * can distinguish between error and EOF. | |
426 | */ | |
427 | free(p); | |
c4029823 | 428 | __set_errno (0); |
28f540f4 RM |
429 | return (sp->fts_cur = NULL); |
430 | } | |
431 | ||
432 | /* Nul terminate the pathname. */ | |
433 | sp->fts_path[p->fts_pathlen] = '\0'; | |
434 | ||
435 | /* | |
436 | * Return to the parent directory. If at a root node or came through | |
437 | * a symlink, go back through the file descriptor. Otherwise, cd up | |
438 | * one directory. | |
439 | */ | |
440 | if (p->fts_level == FTS_ROOTLEVEL) { | |
441 | if (!ISSET(FTS_NOCHDIR) && FCHDIR(sp, sp->fts_rfd)) { | |
442 | SET(FTS_STOP); | |
443 | return (NULL); | |
444 | } | |
445 | } else if (p->fts_flags & FTS_SYMFOLLOW) { | |
446 | if (FCHDIR(sp, p->fts_symfd)) { | |
447 | saved_errno = errno; | |
448 | (void)close(p->fts_symfd); | |
c4029823 | 449 | __set_errno (saved_errno); |
28f540f4 RM |
450 | SET(FTS_STOP); |
451 | return (NULL); | |
452 | } | |
453 | (void)close(p->fts_symfd); | |
454 | } else if (!(p->fts_flags & FTS_DONTCHDIR)) { | |
455 | if (CHDIR(sp, "..")) { | |
456 | SET(FTS_STOP); | |
457 | return (NULL); | |
458 | } | |
459 | } | |
460 | p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP; | |
461 | return (sp->fts_cur = p); | |
462 | } | |
463 | ||
464 | /* | |
465 | * Fts_set takes the stream as an argument although it's not used in this | |
466 | * implementation; it would be necessary if anyone wanted to add global | |
467 | * semantics to fts using fts_set. An error return is allowed for similar | |
468 | * reasons. | |
469 | */ | |
470 | /* ARGSUSED */ | |
471 | int | |
472 | fts_set(sp, p, instr) | |
473 | FTS *sp; | |
474 | FTSENT *p; | |
475 | int instr; | |
476 | { | |
477 | if (instr && instr != FTS_AGAIN && instr != FTS_FOLLOW && | |
478 | instr != FTS_NOINSTR && instr != FTS_SKIP) { | |
c4029823 | 479 | __set_errno (EINVAL); |
28f540f4 RM |
480 | return (1); |
481 | } | |
482 | p->fts_instr = instr; | |
483 | return (0); | |
484 | } | |
485 | ||
486 | FTSENT * | |
487 | fts_children(sp, instr) | |
488 | register FTS *sp; | |
489 | int instr; | |
490 | { | |
491 | register FTSENT *p; | |
492 | int fd; | |
493 | ||
494 | if (instr && instr != FTS_NAMEONLY) { | |
c4029823 | 495 | __set_errno (EINVAL); |
28f540f4 RM |
496 | return (NULL); |
497 | } | |
498 | ||
499 | /* Set current node pointer. */ | |
500 | p = sp->fts_cur; | |
501 | ||
502 | /* | |
503 | * Errno set to 0 so user can distinguish empty directory from | |
504 | * an error. | |
505 | */ | |
c4029823 | 506 | __set_errno (0); |
28f540f4 RM |
507 | |
508 | /* Fatal errors stop here. */ | |
509 | if (ISSET(FTS_STOP)) | |
510 | return (NULL); | |
511 | ||
512 | /* Return logical hierarchy of user's arguments. */ | |
513 | if (p->fts_info == FTS_INIT) | |
514 | return (p->fts_link); | |
515 | ||
516 | /* | |
517 | * If not a directory being visited in pre-order, stop here. Could | |
518 | * allow FTS_DNR, assuming the user has fixed the problem, but the | |
519 | * same effect is available with FTS_AGAIN. | |
520 | */ | |
521 | if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */) | |
522 | return (NULL); | |
523 | ||
524 | /* Free up any previous child list. */ | |
525 | if (sp->fts_child) | |
526 | fts_lfree(sp->fts_child); | |
527 | ||
528 | if (instr == FTS_NAMEONLY) { | |
529 | sp->fts_options |= FTS_NAMEONLY; | |
530 | instr = BNAMES; | |
8ebd0a71 | 531 | } else |
28f540f4 RM |
532 | instr = BCHILD; |
533 | ||
534 | /* | |
535 | * If using chdir on a relative path and called BEFORE fts_read does | |
536 | * its chdir to the root of a traversal, we can lose -- we need to | |
537 | * chdir into the subdirectory, and we don't know where the current | |
538 | * directory is, so we can't get back so that the upcoming chdir by | |
539 | * fts_read will work. | |
540 | */ | |
541 | if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' || | |
542 | ISSET(FTS_NOCHDIR)) | |
543 | return (sp->fts_child = fts_build(sp, instr)); | |
544 | ||
545 | if ((fd = open(".", O_RDONLY, 0)) < 0) | |
546 | return (NULL); | |
547 | sp->fts_child = fts_build(sp, instr); | |
548 | if (fchdir(fd)) | |
549 | return (NULL); | |
550 | (void)close(fd); | |
551 | return (sp->fts_child); | |
552 | } | |
553 | ||
554 | /* | |
555 | * This is the tricky part -- do not casually change *anything* in here. The | |
556 | * idea is to build the linked list of entries that are used by fts_children | |
557 | * and fts_read. There are lots of special cases. | |
558 | * | |
559 | * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is | |
560 | * set and it's a physical walk (so that symbolic links can't be directories), | |
561 | * we can do things quickly. First, if it's a 4.4BSD file system, the type | |
562 | * of the file is in the directory entry. Otherwise, we assume that the number | |
563 | * of subdirectories in a node is equal to the number of links to the parent. | |
564 | * The former skips all stat calls. The latter skips stat calls in any leaf | |
565 | * directories and for any files after the subdirectories in the directory have | |
566 | * been found, cutting the stat calls by about 2/3. | |
567 | */ | |
568 | static FTSENT * | |
dfd2257a | 569 | internal_function |
28f540f4 RM |
570 | fts_build(sp, type) |
571 | register FTS *sp; | |
572 | int type; | |
573 | { | |
10dc2a90 | 574 | struct dirent *dp; |
28f540f4 RM |
575 | register FTSENT *p, *head; |
576 | register int nitems; | |
577 | FTSENT *cur, *tail; | |
578 | DIR *dirp; | |
579 | void *adjaddr; | |
580 | int cderrno, descend, len, level, maxlen, nlinks, saved_errno; | |
581 | char *cp; | |
582 | ||
583 | /* Set current node pointer. */ | |
584 | cur = sp->fts_cur; | |
585 | ||
586 | /* | |
587 | * Open the directory for reading. If this fails, we're done. | |
588 | * If being called from fts_read, set the fts_info field. | |
589 | */ | |
590 | if ((dirp = opendir(cur->fts_accpath)) == NULL) { | |
591 | if (type == BREAD) { | |
592 | cur->fts_info = FTS_DNR; | |
593 | cur->fts_errno = errno; | |
594 | } | |
595 | return (NULL); | |
596 | } | |
597 | ||
598 | /* | |
599 | * Nlinks is the number of possible entries of type directory in the | |
600 | * directory if we're cheating on stat calls, 0 if we're not doing | |
601 | * any stat calls at all, -1 if we're doing stats on everything. | |
602 | */ | |
603 | if (type == BNAMES) | |
604 | nlinks = 0; | |
605 | else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) | |
606 | nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2); | |
607 | else | |
608 | nlinks = -1; | |
609 | ||
610 | #ifdef notdef | |
611 | (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink); | |
612 | (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n", | |
613 | ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT)); | |
614 | #endif | |
615 | /* | |
616 | * If we're going to need to stat anything or we want to descend | |
617 | * and stay in the directory, chdir. If this fails we keep going, | |
618 | * but set a flag so we don't chdir after the post-order visit. | |
619 | * We won't be able to stat anything, but we can still return the | |
620 | * names themselves. Note, that since fts_read won't be able to | |
621 | * chdir into the directory, it will have to return different path | |
622 | * names than before, i.e. "a/b" instead of "b". Since the node | |
623 | * has already been visited in pre-order, have to wait until the | |
624 | * post-order visit to return the error. There is a special case | |
625 | * here, if there was nothing to stat then it's not an error to | |
626 | * not be able to stat. This is all fairly nasty. If a program | |
627 | * needed sorted entries or stat information, they had better be | |
628 | * checking FTS_NS on the returned nodes. | |
629 | */ | |
630 | cderrno = 0; | |
631 | if (nlinks || type == BREAD) | |
632 | if (FCHDIR(sp, dirfd(dirp))) { | |
633 | if (nlinks && type == BREAD) | |
634 | cur->fts_errno = errno; | |
635 | cur->fts_flags |= FTS_DONTCHDIR; | |
636 | descend = 0; | |
637 | cderrno = errno; | |
638 | } else | |
639 | descend = 1; | |
640 | else | |
641 | descend = 0; | |
642 | ||
643 | /* | |
644 | * Figure out the max file name length that can be stored in the | |
645 | * current path -- the inner loop allocates more path as necessary. | |
646 | * We really wouldn't have to do the maxlen calculations here, we | |
647 | * could do them in fts_read before returning the path, but it's a | |
648 | * lot easier here since the length is part of the dirent structure. | |
649 | * | |
650 | * If not changing directories set a pointer so that can just append | |
651 | * each new name into the path. | |
652 | */ | |
653 | maxlen = sp->fts_pathlen - cur->fts_pathlen - 1; | |
654 | len = NAPPEND(cur); | |
655 | if (ISSET(FTS_NOCHDIR)) { | |
656 | cp = sp->fts_path + len; | |
657 | *cp++ = '/'; | |
658 | } | |
659 | ||
660 | level = cur->fts_level + 1; | |
661 | ||
662 | /* Read the directory, attaching each entry to the `link' pointer. */ | |
663 | adjaddr = NULL; | |
10dc2a90 | 664 | for (head = tail = NULL, nitems = 0; dp = readdir(dirp);) { |
92777700 RM |
665 | int namlen; |
666 | ||
28f540f4 RM |
667 | if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name)) |
668 | continue; | |
669 | ||
92777700 RM |
670 | namlen = _D_EXACT_NAMLEN (dp); |
671 | if ((p = fts_alloc(sp, dp->d_name, namlen)) == NULL) | |
28f540f4 | 672 | goto mem1; |
92777700 RM |
673 | if (namlen > maxlen) { |
674 | if (fts_palloc(sp, (size_t)namlen)) { | |
28f540f4 RM |
675 | /* |
676 | * No more memory for path or structures. Save | |
677 | * errno, free up the current structure and the | |
678 | * structures already allocated. | |
679 | */ | |
680 | mem1: saved_errno = errno; | |
681 | if (p) | |
682 | free(p); | |
683 | fts_lfree(head); | |
684 | (void)closedir(dirp); | |
c4029823 | 685 | __set_errno (saved_errno); |
28f540f4 RM |
686 | cur->fts_info = FTS_ERR; |
687 | SET(FTS_STOP); | |
688 | return (NULL); | |
689 | } | |
690 | adjaddr = sp->fts_path; | |
691 | maxlen = sp->fts_pathlen - sp->fts_cur->fts_pathlen - 1; | |
692 | } | |
693 | ||
92777700 | 694 | p->fts_pathlen = len + namlen + 1; |
28f540f4 RM |
695 | p->fts_parent = sp->fts_cur; |
696 | p->fts_level = level; | |
697 | ||
698 | if (cderrno) { | |
699 | if (nlinks) { | |
700 | p->fts_info = FTS_NS; | |
701 | p->fts_errno = cderrno; | |
702 | } else | |
703 | p->fts_info = FTS_NSOK; | |
704 | p->fts_accpath = cur->fts_accpath; | |
705 | } else if (nlinks == 0 | |
da2d1bc5 | 706 | #if defined DT_DIR && defined _DIRENT_HAVE_D_TYPE |
8ebd0a71 | 707 | || nlinks > 0 && |
28f540f4 RM |
708 | dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN |
709 | #endif | |
710 | ) { | |
711 | p->fts_accpath = | |
712 | ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name; | |
713 | p->fts_info = FTS_NSOK; | |
714 | } else { | |
715 | /* Build a file name for fts_stat to stat. */ | |
716 | if (ISSET(FTS_NOCHDIR)) { | |
717 | p->fts_accpath = p->fts_path; | |
718 | bcopy(p->fts_name, cp, p->fts_namelen + 1); | |
719 | } else | |
720 | p->fts_accpath = p->fts_name; | |
721 | /* Stat it. */ | |
722 | p->fts_info = fts_stat(sp, p, 0); | |
723 | ||
724 | /* Decrement link count if applicable. */ | |
725 | if (nlinks > 0 && (p->fts_info == FTS_D || | |
726 | p->fts_info == FTS_DC || p->fts_info == FTS_DOT)) | |
727 | --nlinks; | |
728 | } | |
729 | ||
730 | /* We walk in directory order so "ls -f" doesn't get upset. */ | |
731 | p->fts_link = NULL; | |
732 | if (head == NULL) | |
733 | head = tail = p; | |
734 | else { | |
735 | tail->fts_link = p; | |
736 | tail = p; | |
737 | } | |
738 | ++nitems; | |
739 | } | |
740 | (void)closedir(dirp); | |
741 | ||
742 | /* | |
743 | * If had to realloc the path, adjust the addresses for the rest | |
744 | * of the tree. | |
745 | */ | |
746 | if (adjaddr) | |
747 | fts_padjust(sp, adjaddr); | |
748 | ||
749 | /* | |
750 | * If not changing directories, reset the path back to original | |
751 | * state. | |
752 | */ | |
753 | if (ISSET(FTS_NOCHDIR)) { | |
754 | if (cp - 1 > sp->fts_path) | |
755 | --cp; | |
756 | *cp = '\0'; | |
757 | } | |
758 | ||
759 | /* | |
760 | * If descended after called from fts_children or called from | |
761 | * fts_read and didn't find anything, get back. If can't get | |
762 | * back, done. | |
763 | */ | |
764 | if (descend && (!nitems || type == BCHILD) && CHDIR(sp, "..")) { | |
765 | cur->fts_info = FTS_ERR; | |
766 | SET(FTS_STOP); | |
767 | return (NULL); | |
768 | } | |
769 | ||
770 | /* If didn't find anything, return NULL. */ | |
771 | if (!nitems) { | |
772 | if (type == BREAD) | |
773 | cur->fts_info = FTS_DP; | |
774 | return (NULL); | |
775 | } | |
776 | ||
777 | /* Sort the entries. */ | |
778 | if (sp->fts_compar && nitems > 1) | |
779 | head = fts_sort(sp, head, nitems); | |
780 | return (head); | |
781 | } | |
782 | ||
783 | static u_short | |
dfd2257a | 784 | internal_function |
28f540f4 RM |
785 | fts_stat(sp, p, follow) |
786 | FTS *sp; | |
787 | register FTSENT *p; | |
788 | int follow; | |
789 | { | |
790 | register FTSENT *t; | |
791 | register dev_t dev; | |
792 | register ino_t ino; | |
793 | struct stat *sbp, sb; | |
794 | int saved_errno; | |
795 | ||
796 | /* If user needs stat info, stat buffer already allocated. */ | |
797 | sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp; | |
8ebd0a71 | 798 | |
28f540f4 RM |
799 | /* |
800 | * If doing a logical walk, or application requested FTS_FOLLOW, do | |
801 | * a stat(2). If that fails, check for a non-existent symlink. If | |
802 | * fail, set the errno from the stat call. | |
803 | */ | |
804 | if (ISSET(FTS_LOGICAL) || follow) { | |
805 | if (stat(p->fts_accpath, sbp)) { | |
806 | saved_errno = errno; | |
807 | if (!lstat(p->fts_accpath, sbp)) { | |
c4029823 | 808 | __set_errno (0); |
28f540f4 | 809 | return (FTS_SLNONE); |
8ebd0a71 | 810 | } |
28f540f4 RM |
811 | p->fts_errno = saved_errno; |
812 | goto err; | |
813 | } | |
814 | } else if (lstat(p->fts_accpath, sbp)) { | |
815 | p->fts_errno = errno; | |
816 | err: bzero(sbp, sizeof(struct stat)); | |
817 | return (FTS_NS); | |
818 | } | |
819 | ||
820 | if (S_ISDIR(sbp->st_mode)) { | |
821 | /* | |
822 | * Set the device/inode. Used to find cycles and check for | |
823 | * crossing mount points. Also remember the link count, used | |
824 | * in fts_build to limit the number of stat calls. It is | |
825 | * understood that these fields are only referenced if fts_info | |
826 | * is set to FTS_D. | |
827 | */ | |
828 | dev = p->fts_dev = sbp->st_dev; | |
829 | ino = p->fts_ino = sbp->st_ino; | |
830 | p->fts_nlink = sbp->st_nlink; | |
831 | ||
832 | if (ISDOT(p->fts_name)) | |
833 | return (FTS_DOT); | |
834 | ||
835 | /* | |
836 | * Cycle detection is done by brute force when the directory | |
837 | * is first encountered. If the tree gets deep enough or the | |
838 | * number of symbolic links to directories is high enough, | |
839 | * something faster might be worthwhile. | |
840 | */ | |
841 | for (t = p->fts_parent; | |
842 | t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent) | |
843 | if (ino == t->fts_ino && dev == t->fts_dev) { | |
844 | p->fts_cycle = t; | |
845 | return (FTS_DC); | |
846 | } | |
847 | return (FTS_D); | |
848 | } | |
849 | if (S_ISLNK(sbp->st_mode)) | |
850 | return (FTS_SL); | |
851 | if (S_ISREG(sbp->st_mode)) | |
852 | return (FTS_F); | |
853 | return (FTS_DEFAULT); | |
854 | } | |
855 | ||
856 | static FTSENT * | |
dfd2257a | 857 | internal_function |
28f540f4 RM |
858 | fts_sort(sp, head, nitems) |
859 | FTS *sp; | |
860 | FTSENT *head; | |
861 | register int nitems; | |
862 | { | |
863 | register FTSENT **ap, *p; | |
864 | ||
865 | /* | |
866 | * Construct an array of pointers to the structures and call qsort(3). | |
867 | * Reassemble the array in the order returned by qsort. If unable to | |
868 | * sort for memory reasons, return the directory entries in their | |
869 | * current order. Allocate enough space for the current needs plus | |
870 | * 40 so don't realloc one entry at a time. | |
871 | */ | |
872 | if (nitems > sp->fts_nitems) { | |
873 | sp->fts_nitems = nitems + 40; | |
874 | if ((sp->fts_array = realloc(sp->fts_array, | |
875 | (size_t)(sp->fts_nitems * sizeof(FTSENT *)))) == NULL) { | |
876 | sp->fts_nitems = 0; | |
877 | return (head); | |
878 | } | |
879 | } | |
880 | for (ap = sp->fts_array, p = head; p; p = p->fts_link) | |
881 | *ap++ = p; | |
882 | qsort((void *)sp->fts_array, nitems, sizeof(FTSENT *), sp->fts_compar); | |
883 | for (head = *(ap = sp->fts_array); --nitems; ++ap) | |
884 | ap[0]->fts_link = ap[1]; | |
885 | ap[0]->fts_link = NULL; | |
886 | return (head); | |
887 | } | |
888 | ||
889 | static FTSENT * | |
dfd2257a | 890 | internal_function |
28f540f4 RM |
891 | fts_alloc(sp, name, namelen) |
892 | FTS *sp; | |
61c162b5 | 893 | const char *name; |
28f540f4 RM |
894 | register int namelen; |
895 | { | |
896 | register FTSENT *p; | |
897 | size_t len; | |
898 | ||
899 | /* | |
900 | * The file name is a variable length array and no stat structure is | |
901 | * necessary if the user has set the nostat bit. Allocate the FTSENT | |
902 | * structure, the file name and the stat structure in one chunk, but | |
903 | * be careful that the stat structure is reasonably aligned. Since the | |
904 | * fts_name field is declared to be of size 1, the fts_name pointer is | |
905 | * namelen + 2 before the first possible address of the stat structure. | |
906 | */ | |
907 | len = sizeof(FTSENT) + namelen; | |
908 | if (!ISSET(FTS_NOSTAT)) | |
909 | len += sizeof(struct stat) + ALIGNBYTES; | |
910 | if ((p = malloc(len)) == NULL) | |
911 | return (NULL); | |
912 | ||
913 | /* Copy the name plus the trailing NULL. */ | |
914 | bcopy(name, p->fts_name, namelen + 1); | |
915 | ||
916 | if (!ISSET(FTS_NOSTAT)) | |
917 | p->fts_statp = (struct stat *)ALIGN(p->fts_name + namelen + 2); | |
918 | p->fts_namelen = namelen; | |
919 | p->fts_path = sp->fts_path; | |
920 | p->fts_errno = 0; | |
921 | p->fts_flags = 0; | |
922 | p->fts_instr = FTS_NOINSTR; | |
923 | p->fts_number = 0; | |
924 | p->fts_pointer = NULL; | |
925 | return (p); | |
926 | } | |
927 | ||
928 | static void | |
dfd2257a | 929 | internal_function |
28f540f4 RM |
930 | fts_lfree(head) |
931 | register FTSENT *head; | |
932 | { | |
933 | register FTSENT *p; | |
934 | ||
935 | /* Free a linked list of structures. */ | |
936 | while (p = head) { | |
937 | head = head->fts_link; | |
938 | free(p); | |
939 | } | |
940 | } | |
941 | ||
942 | /* | |
943 | * Allow essentially unlimited paths; find, rm, ls should all work on any tree. | |
944 | * Most systems will allow creation of paths much longer than MAXPATHLEN, even | |
945 | * though the kernel won't resolve them. Add the size (not just what's needed) | |
8ebd0a71 | 946 | * plus 256 bytes so don't realloc the path 2 bytes at a time. |
28f540f4 RM |
947 | */ |
948 | static int | |
dfd2257a | 949 | internal_function |
28f540f4 RM |
950 | fts_palloc(sp, more) |
951 | FTS *sp; | |
952 | size_t more; | |
953 | { | |
954 | sp->fts_pathlen += more + 256; | |
955 | sp->fts_path = realloc(sp->fts_path, (size_t)sp->fts_pathlen); | |
956 | return (sp->fts_path == NULL); | |
957 | } | |
958 | ||
959 | /* | |
960 | * When the path is realloc'd, have to fix all of the pointers in structures | |
961 | * already returned. | |
962 | */ | |
963 | static void | |
dfd2257a | 964 | internal_function |
28f540f4 RM |
965 | fts_padjust(sp, addr) |
966 | FTS *sp; | |
967 | void *addr; | |
968 | { | |
969 | FTSENT *p; | |
970 | ||
971 | #define ADJUST(p) { \ | |
972 | (p)->fts_accpath = \ | |
973 | (char *)addr + ((p)->fts_accpath - (p)->fts_path); \ | |
974 | (p)->fts_path = addr; \ | |
975 | } | |
976 | /* Adjust the current set of children. */ | |
977 | for (p = sp->fts_child; p; p = p->fts_link) | |
978 | ADJUST(p); | |
979 | ||
980 | /* Adjust the rest of the tree. */ | |
981 | for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) { | |
982 | ADJUST(p); | |
983 | p = p->fts_link ? p->fts_link : p->fts_parent; | |
984 | } | |
985 | } | |
986 | ||
987 | static size_t | |
dfd2257a | 988 | internal_function |
28f540f4 RM |
989 | fts_maxarglen(argv) |
990 | char * const *argv; | |
991 | { | |
992 | size_t len, max; | |
993 | ||
994 | for (max = 0; *argv; ++argv) | |
995 | if ((len = strlen(*argv)) > max) | |
996 | max = len; | |
997 | return (max); | |
998 | } |