2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #if defined(LIBC_SCCS) && !defined(lint)
31 static char sccsid
[] = "@(#)fts.c 8.6 (Berkeley) 8/14/94";
32 #endif /* LIBC_SCCS and not lint */
34 #include <sys/param.h>
35 #include <include/sys/stat.h>
45 /* Largest alignment size needed, minus one.
46 Usually long double is the worst case. */
48 #define ALIGNBYTES (__alignof__ (long double) - 1)
50 /* Align P to that size. */
52 #define ALIGN(p) (((unsigned long int) (p) + ALIGNBYTES) & ~ALIGNBYTES)
56 static FTSENT
*fts_alloc (FTS
*, const char *, size_t) internal_function
;
57 static FTSENT
*fts_build (FTS
*, int) internal_function
;
58 static void fts_lfree (FTSENT
*) internal_function
;
59 static void fts_load (FTS
*, FTSENT
*) internal_function
;
60 static size_t fts_maxarglen (char * const *) internal_function
;
61 static void fts_padjust (FTS
*, FTSENT
*) internal_function
;
62 static int fts_palloc (FTS
*, size_t) internal_function
;
63 static FTSENT
*fts_sort (FTS
*, FTSENT
*, int) internal_function
;
64 static u_short
fts_stat (FTS
*, FTSENT
*, int) internal_function
;
65 static int fts_safe_changedir (FTS
*, FTSENT
*, int, const char *)
69 #define MAX(a, b) ({ __typeof__ (a) _a = (a); \
70 __typeof__ (b) _b = (b); \
74 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
76 #define CLR(opt) (sp->fts_options &= ~(opt))
77 #define ISSET(opt) (sp->fts_options & (opt))
78 #define SET(opt) (sp->fts_options |= (opt))
80 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && __fchdir(fd))
83 #define BCHILD 1 /* fts_children */
84 #define BNAMES 2 /* fts_children, names only */
85 #define BREAD 3 /* fts_read */
88 fts_open (char * const *argv
, int options
,
89 int (*compar
) (const FTSENT
**, const FTSENT
**))
94 FTSENT
*parent
= NULL
;
98 if (options
& ~FTS_OPTIONMASK
) {
103 /* Allocate/initialize the stream */
104 if ((sp
= malloc((u_int
)sizeof(FTS
))) == NULL
)
106 memset(sp
, 0, sizeof(FTS
));
107 sp
->fts_compar
= (int (*) (const void *, const void *)) compar
;
108 sp
->fts_options
= options
;
110 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
111 if (ISSET(FTS_LOGICAL
))
115 * Start out with 1K of path space, and enough, in any case,
116 * to hold the user's paths.
119 #define MAXPATHLEN 1024
121 size_t maxarglen
= fts_maxarglen(argv
);
122 if (fts_palloc(sp
, MAX(maxarglen
, MAXPATHLEN
)))
125 /* Allocate/initialize root's parent. */
127 if ((parent
= fts_alloc(sp
, "", 0)) == NULL
)
129 parent
->fts_level
= FTS_ROOTPARENTLEVEL
;
132 /* Allocate/initialize root(s). */
133 for (root
= NULL
, nitems
= 0; *argv
!= NULL
; ++argv
, ++nitems
) {
134 /* Don't allow zero-length paths. */
135 size_t len
= strlen(*argv
);
137 __set_errno (ENOENT
);
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
));
147 /* Command-line "." and ".." are real directories. */
148 if (p
->fts_info
== FTS_DOT
)
152 * If comparison routine supplied, traverse in sorted
153 * order; otherwise traverse in the order specified.
168 if (compar
&& nitems
> 1)
169 root
= fts_sort(sp
, root
, nitems
);
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.
176 if ((sp
->fts_cur
= fts_alloc(sp
, "", 0)) == NULL
)
178 sp
->fts_cur
->fts_link
= root
;
179 sp
->fts_cur
->fts_info
= FTS_INIT
;
182 * If using chdir(2), grab a file descriptor pointing to dot to ensure
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.
188 if (!ISSET(FTS_NOCHDIR
)
189 && (sp
->fts_rfd
= __open(".", O_RDONLY
, 0)) < 0)
194 mem3
: fts_lfree(root
);
196 mem2
: free(sp
->fts_path
);
203 fts_load (FTS
*sp
, FTSENT
*p
)
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.
215 len
= p
->fts_pathlen
= p
->fts_namelen
;
216 memmove(sp
->fts_path
, p
->fts_name
, len
+ 1);
217 if ((cp
= strrchr(p
->fts_name
, '/')) && (cp
!= p
->fts_name
|| cp
[1])) {
219 memmove(p
->fts_name
, cp
, len
+ 1);
220 p
->fts_namelen
= len
;
222 p
->fts_accpath
= p
->fts_path
= sp
->fts_path
;
223 sp
->fts_dev
= p
->fts_dev
;
233 * This still works if we haven't read anything -- the dummy structure
234 * points to the root list, so we step through to the end of the root
235 * list which has a valid parent pointer.
238 for (p
= sp
->fts_cur
; p
->fts_level
>= FTS_ROOTLEVEL
;) {
240 p
= p
->fts_link
!= NULL
? p
->fts_link
: p
->fts_parent
;
246 /* Free up child linked list, sort array, path buffer. */
248 fts_lfree(sp
->fts_child
);
252 /* Return to original directory, save errno if necessary. */
253 if (!ISSET(FTS_NOCHDIR
)) {
254 saved_errno
= __fchdir(sp
->fts_rfd
) ? errno
: 0;
255 (void)__close(sp
->fts_rfd
);
257 /* Set errno and return. */
258 if (saved_errno
!= 0) {
259 /* Free up the stream pointer. */
261 __set_errno (saved_errno
);
266 /* Free up the stream pointer. */
272 * Special case of "/" at the end of the path so that slashes aren't
273 * appended which would cause paths to be written as "....//foo".
276 (p->fts_path[p->fts_pathlen - 1] == '/' \
277 ? p->fts_pathlen - 1 : p->fts_pathlen)
287 /* If finished or unrecoverable error, return NULL. */
288 if (sp
->fts_cur
== NULL
|| ISSET(FTS_STOP
))
291 /* Set current node pointer. */
294 /* Save and zero out user instructions. */
295 instr
= p
->fts_instr
;
296 p
->fts_instr
= FTS_NOINSTR
;
298 /* Any type of file may be re-visited; re-stat and re-turn. */
299 if (instr
== FTS_AGAIN
) {
300 p
->fts_info
= fts_stat(sp
, p
, 0);
305 * Following a symlink -- SLNONE test allows application to see
306 * SLNONE and recover. If indirecting through a symlink, have
307 * keep a pointer to current location. If unable to get that
308 * pointer, follow fails.
310 if (instr
== FTS_FOLLOW
&&
311 (p
->fts_info
== FTS_SL
|| p
->fts_info
== FTS_SLNONE
)) {
312 p
->fts_info
= fts_stat(sp
, p
, 1);
313 if (p
->fts_info
== FTS_D
&& !ISSET(FTS_NOCHDIR
)) {
314 if ((p
->fts_symfd
= __open(".", O_RDONLY
, 0)) < 0) {
315 p
->fts_errno
= errno
;
316 p
->fts_info
= FTS_ERR
;
318 p
->fts_flags
|= FTS_SYMFOLLOW
;
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
);
331 fts_lfree(sp
->fts_child
);
332 sp
->fts_child
= NULL
;
334 p
->fts_info
= FTS_DP
;
338 /* Rebuild if only read the names and now traversing. */
339 if (sp
->fts_child
!= NULL
&& ISSET(FTS_NAMEONLY
)) {
341 fts_lfree(sp
->fts_child
);
342 sp
->fts_child
= NULL
;
346 * Cd to the subdirectory.
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.
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.
357 if (sp
->fts_child
!= NULL
) {
358 if (fts_safe_changedir(sp
, p
, -1, p
->fts_accpath
)) {
359 p
->fts_errno
= errno
;
360 p
->fts_flags
|= FTS_DONTCHDIR
;
361 for (p
= sp
->fts_child
; p
!= NULL
;
364 p
->fts_parent
->fts_accpath
;
366 } else if ((sp
->fts_child
= fts_build(sp
, BREAD
)) == NULL
) {
372 sp
->fts_child
= NULL
;
377 /* Move to the next node on this level. */
379 if ((p
= p
->fts_link
) != NULL
) {
384 * If reached the top, return to the original directory (or
385 * the root of the tree), and load the paths for the next root.
387 if (p
->fts_level
== FTS_ROOTLEVEL
) {
388 if (FCHDIR(sp
, sp
->fts_rfd
)) {
397 * User may have called fts_set on the node. If skipped,
398 * ignore. If followed, get a file descriptor so we can
399 * get back if necessary.
401 if (p
->fts_instr
== FTS_SKIP
)
403 if (p
->fts_instr
== FTS_FOLLOW
) {
404 p
->fts_info
= fts_stat(sp
, p
, 1);
405 if (p
->fts_info
== FTS_D
&& !ISSET(FTS_NOCHDIR
)) {
407 __open(".", O_RDONLY
, 0)) < 0) {
408 p
->fts_errno
= errno
;
409 p
->fts_info
= FTS_ERR
;
411 p
->fts_flags
|= FTS_SYMFOLLOW
;
413 p
->fts_instr
= FTS_NOINSTR
;
416 name
: t
= sp
->fts_path
+ NAPPEND(p
->fts_parent
);
418 memmove(t
, p
->fts_name
, p
->fts_namelen
+ 1);
422 /* Move up to the parent node. */
427 if (p
->fts_level
== FTS_ROOTPARENTLEVEL
) {
429 * Done; free everything up and set errno to 0 so the user
430 * can distinguish between error and EOF.
434 return (sp
->fts_cur
= NULL
);
437 /* NUL terminate the pathname. */
438 sp
->fts_path
[p
->fts_pathlen
] = '\0';
441 * Return to the parent directory. If at a root node or came through
442 * a symlink, go back through the file descriptor. Otherwise, cd up
445 if (p
->fts_level
== FTS_ROOTLEVEL
) {
446 if (FCHDIR(sp
, sp
->fts_rfd
)) {
450 } else if (p
->fts_flags
& FTS_SYMFOLLOW
) {
451 if (FCHDIR(sp
, p
->fts_symfd
)) {
453 (void)__close(p
->fts_symfd
);
454 __set_errno (saved_errno
);
458 (void)__close(p
->fts_symfd
);
459 } else if (!(p
->fts_flags
& FTS_DONTCHDIR
) &&
460 fts_safe_changedir(sp
, p
->fts_parent
, -1, "..")) {
464 p
->fts_info
= p
->fts_errno
? FTS_ERR
: FTS_DP
;
469 * Fts_set takes the stream as an argument although it's not used in this
470 * implementation; it would be necessary if anyone wanted to add global
471 * semantics to fts using fts_set. An error return is allowed for similar
476 fts_set (FTS
*sp
, FTSENT
*p
, int instr
)
478 if (instr
!= 0 && instr
!= FTS_AGAIN
&& instr
!= FTS_FOLLOW
&&
479 instr
!= FTS_NOINSTR
&& instr
!= FTS_SKIP
) {
480 __set_errno (EINVAL
);
483 p
->fts_instr
= instr
;
488 fts_children (FTS
*sp
, int instr
)
493 if (instr
!= 0 && instr
!= FTS_NAMEONLY
) {
494 __set_errno (EINVAL
);
498 /* Set current node pointer. */
502 * Errno set to 0 so user can distinguish empty directory from
507 /* Fatal errors stop here. */
511 /* Return logical hierarchy of user's arguments. */
512 if (p
->fts_info
== FTS_INIT
)
513 return (p
->fts_link
);
516 * If not a directory being visited in pre-order, stop here. Could
517 * allow FTS_DNR, assuming the user has fixed the problem, but the
518 * same effect is available with FTS_AGAIN.
520 if (p
->fts_info
!= FTS_D
/* && p->fts_info != FTS_DNR */)
523 /* Free up any previous child list. */
524 if (sp
->fts_child
!= NULL
)
525 fts_lfree(sp
->fts_child
);
527 if (instr
== FTS_NAMEONLY
) {
534 * If using chdir on a relative path and called BEFORE fts_read does
535 * its chdir to the root of a traversal, we can lose -- we need to
536 * chdir into the subdirectory, and we don't know where the current
537 * directory is, so we can't get back so that the upcoming chdir by
538 * fts_read will work.
540 if (p
->fts_level
!= FTS_ROOTLEVEL
|| p
->fts_accpath
[0] == '/' ||
542 return (sp
->fts_child
= fts_build(sp
, instr
));
544 if ((fd
= __open(".", O_RDONLY
, 0)) < 0)
546 sp
->fts_child
= fts_build(sp
, instr
);
550 return (sp
->fts_child
);
554 dirent_not_directory(const struct dirent
*dp
)
556 #if defined DT_DIR && defined _DIRENT_HAVE_D_TYPE
557 return dp
->d_type
!= DT_DIR
&& dp
->d_type
!= DT_UNKNOWN
;
564 * This is the tricky part -- do not casually change *anything* in here. The
565 * idea is to build the linked list of entries that are used by fts_children
566 * and fts_read. There are lots of special cases.
568 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
569 * set and it's a physical walk (so that symbolic links can't be directories),
570 * we can do things quickly. First, if it's a 4.4BSD file system, the type
571 * of the file is in the directory entry. Otherwise, we assume that the number
572 * of subdirectories in a node is equal to the number of links to the parent.
573 * The former skips all stat calls. The latter skips stat calls in any leaf
574 * directories and for any files after the subdirectories in the directory have
575 * been found, cutting the stat calls by about 2/3.
579 fts_build (FTS
*sp
, int type
)
587 int cderrno
, descend
, len
, level
, nlinks
, saved_errno
,
592 /* Set current node pointer. */
596 * Open the directory for reading. If this fails, we're done.
597 * If being called from fts_read, set the fts_info field.
599 #if defined FTS_WHITEOUT && 0
600 if (ISSET(FTS_WHITEOUT
))
601 oflag
= DTF_NODUP
|DTF_REWIND
;
603 oflag
= DTF_HIDEW
|DTF_NODUP
|DTF_REWIND
;
605 # define __opendir2(path, flag) __opendir(path)
607 if ((dirp
= __opendir2(cur
->fts_accpath
, oflag
)) == NULL
) {
609 cur
->fts_info
= FTS_DNR
;
610 cur
->fts_errno
= errno
;
616 * Nlinks is the number of possible entries of type directory in the
617 * directory if we're cheating on stat calls, 0 if we're not doing
618 * any stat calls at all, -1 if we're doing stats on everything.
620 if (type
== BNAMES
) {
622 /* Be quiet about nostat, GCC. */
624 } else if (ISSET(FTS_NOSTAT
) && ISSET(FTS_PHYSICAL
)) {
625 nlinks
= cur
->fts_nlink
- (ISSET(FTS_SEEDOT
) ? 0 : 2);
633 (void)printf("nlinks == %d (cur: %d)\n", nlinks
, cur
->fts_nlink
);
634 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
635 ISSET(FTS_NOSTAT
), ISSET(FTS_PHYSICAL
), ISSET(FTS_SEEDOT
));
638 * If we're going to need to stat anything or we want to descend
639 * and stay in the directory, chdir. If this fails we keep going,
640 * but set a flag so we don't chdir after the post-order visit.
641 * We won't be able to stat anything, but we can still return the
642 * names themselves. Note, that since fts_read won't be able to
643 * chdir into the directory, it will have to return different path
644 * names than before, i.e. "a/b" instead of "b". Since the node
645 * has already been visited in pre-order, have to wait until the
646 * post-order visit to return the error. There is a special case
647 * here, if there was nothing to stat then it's not an error to
648 * not be able to stat. This is all fairly nasty. If a program
649 * needed sorted entries or stat information, they had better be
650 * checking FTS_NS on the returned nodes.
653 if (nlinks
|| type
== BREAD
) {
654 if (fts_safe_changedir(sp
, cur
, dirfd(dirp
), NULL
)) {
655 if (nlinks
&& type
== BREAD
)
656 cur
->fts_errno
= errno
;
657 cur
->fts_flags
|= FTS_DONTCHDIR
;
660 (void)__closedir(dirp
);
668 * Figure out the max file name length that can be stored in the
669 * current path -- the inner loop allocates more path as necessary.
670 * We really wouldn't have to do the maxlen calculations here, we
671 * could do them in fts_read before returning the path, but it's a
672 * lot easier here since the length is part of the dirent structure.
674 * If not changing directories set a pointer so that can just append
675 * each new name into the path.
678 if (ISSET(FTS_NOCHDIR
)) {
679 cp
= sp
->fts_path
+ len
;
682 /* GCC, you're too verbose. */
686 maxlen
= sp
->fts_pathlen
- len
;
688 level
= cur
->fts_level
+ 1;
690 /* Read the directory, attaching each entry to the `link' pointer. */
692 for (head
= tail
= NULL
, nitems
= 0; dirp
&& (dp
= __readdir(dirp
));) {
693 if (!ISSET(FTS_SEEDOT
) && ISDOT(dp
->d_name
))
696 if ((p
= fts_alloc(sp
, dp
->d_name
, _D_EXACT_NAMLEN (dp
))) == NULL
)
698 if (_D_EXACT_NAMLEN (dp
) >= maxlen
) {/* include space for NUL */
699 oldaddr
= sp
->fts_path
;
700 if (fts_palloc(sp
, _D_EXACT_NAMLEN (dp
) + len
+ 1)) {
702 * No more memory for path or structures. Save
703 * errno, free up the current structure and the
704 * structures already allocated.
706 mem1
: saved_errno
= errno
;
709 (void)__closedir(dirp
);
710 cur
->fts_info
= FTS_ERR
;
712 __set_errno (saved_errno
);
715 /* Did realloc() change the pointer? */
716 if (oldaddr
!= sp
->fts_path
) {
718 if (ISSET(FTS_NOCHDIR
))
719 cp
= sp
->fts_path
+ len
;
721 maxlen
= sp
->fts_pathlen
- len
;
724 if (len
+ _D_EXACT_NAMLEN (dp
) >= USHRT_MAX
) {
726 * In an FTSENT, fts_pathlen is a u_short so it is
727 * possible to wraparound here. If we do, free up
728 * the current structure and the structures already
729 * allocated, then error out with ENAMETOOLONG.
733 (void)__closedir(dirp
);
734 cur
->fts_info
= FTS_ERR
;
736 __set_errno (ENAMETOOLONG
);
739 p
->fts_level
= level
;
740 p
->fts_parent
= sp
->fts_cur
;
741 p
->fts_pathlen
= len
+ _D_EXACT_NAMLEN (dp
);
743 #if defined FTS_WHITEOUT && 0
744 if (dp
->d_type
== DT_WHT
)
745 p
->fts_flags
|= FTS_ISW
;
748 /* Unreachable code. cderrno is only ever set to a nonnull
749 value if dirp is closed at the same time. But then we
750 cannot enter this loop. */
753 p
->fts_info
= FTS_NS
;
754 p
->fts_errno
= cderrno
;
756 p
->fts_info
= FTS_NSOK
;
757 p
->fts_accpath
= cur
->fts_accpath
;
758 } else if (nlinks
== 0
759 || (nostat
&& dirent_not_directory(dp
))) {
761 ISSET(FTS_NOCHDIR
) ? p
->fts_path
: p
->fts_name
;
762 p
->fts_info
= FTS_NSOK
;
764 /* Build a file name for fts_stat to stat. */
765 if (ISSET(FTS_NOCHDIR
)) {
766 p
->fts_accpath
= p
->fts_path
;
767 memmove(cp
, p
->fts_name
, p
->fts_namelen
+ 1);
769 p
->fts_accpath
= p
->fts_name
;
771 p
->fts_info
= fts_stat(sp
, p
, 0);
773 /* Decrement link count if applicable. */
774 if (nlinks
> 0 && (p
->fts_info
== FTS_D
||
775 p
->fts_info
== FTS_DC
|| p
->fts_info
== FTS_DOT
))
779 /* We walk in directory order so "ls -f" doesn't get upset. */
790 (void)__closedir(dirp
);
793 * If realloc() changed the address of the path, adjust the
794 * addresses for the rest of the tree and the dir list.
797 fts_padjust(sp
, head
);
800 * If not changing directories, reset the path back to original
803 if (ISSET(FTS_NOCHDIR
)) {
804 if (len
== sp
->fts_pathlen
|| nitems
== 0)
810 * If descended after called from fts_children or after called from
811 * fts_read and nothing found, get back. At the root level we use
812 * the saved fd; if one of fts_open()'s arguments is a relative path
813 * to an empty directory, we wind up here with no other way back. If
814 * can't get back, we're done.
816 if (descend
&& (type
== BCHILD
|| !nitems
) &&
817 (cur
->fts_level
== FTS_ROOTLEVEL
?
818 FCHDIR(sp
, sp
->fts_rfd
) :
819 fts_safe_changedir(sp
, cur
->fts_parent
, -1, ".."))) {
820 cur
->fts_info
= FTS_ERR
;
826 /* If didn't find anything, return NULL. */
829 cur
->fts_info
= FTS_DP
;
834 /* Sort the entries. */
835 if (sp
->fts_compar
&& nitems
> 1)
836 head
= fts_sort(sp
, head
, nitems
);
842 fts_stat (FTS
*sp
, FTSENT
*p
, int follow
)
847 struct stat
*sbp
, sb
;
850 /* If user needs stat info, stat buffer already allocated. */
851 sbp
= ISSET(FTS_NOSTAT
) ? &sb
: p
->fts_statp
;
853 #if defined FTS_WHITEOUT && 0
854 /* check for whiteout */
855 if (p
->fts_flags
& FTS_ISW
) {
857 memset(sbp
, '\0', sizeof (*sbp
));
858 sbp
->st_mode
= S_IFWHT
;
865 * If doing a logical walk, or application requested FTS_FOLLOW, do
866 * a stat(2). If that fails, check for a non-existent symlink. If
867 * fail, set the errno from the stat call.
869 if (ISSET(FTS_LOGICAL
) || follow
) {
870 if (stat(p
->fts_accpath
, sbp
)) {
872 if (!lstat(p
->fts_accpath
, sbp
)) {
876 p
->fts_errno
= saved_errno
;
879 } else if (lstat(p
->fts_accpath
, sbp
)) {
880 p
->fts_errno
= errno
;
881 err
: memset(sbp
, 0, sizeof(struct stat
));
885 if (S_ISDIR(sbp
->st_mode
)) {
887 * Set the device/inode. Used to find cycles and check for
888 * crossing mount points. Also remember the link count, used
889 * in fts_build to limit the number of stat calls. It is
890 * understood that these fields are only referenced if fts_info
893 dev
= p
->fts_dev
= sbp
->st_dev
;
894 ino
= p
->fts_ino
= sbp
->st_ino
;
895 p
->fts_nlink
= sbp
->st_nlink
;
897 if (ISDOT(p
->fts_name
))
901 * Cycle detection is done by brute force when the directory
902 * is first encountered. If the tree gets deep enough or the
903 * number of symbolic links to directories is high enough,
904 * something faster might be worthwhile.
906 for (t
= p
->fts_parent
;
907 t
->fts_level
>= FTS_ROOTLEVEL
; t
= t
->fts_parent
)
908 if (ino
== t
->fts_ino
&& dev
== t
->fts_dev
) {
914 if (S_ISLNK(sbp
->st_mode
))
916 if (S_ISREG(sbp
->st_mode
))
918 return (FTS_DEFAULT
);
923 fts_sort (FTS
*sp
, FTSENT
*head
, int nitems
)
928 * Construct an array of pointers to the structures and call qsort(3).
929 * Reassemble the array in the order returned by qsort. If unable to
930 * sort for memory reasons, return the directory entries in their
931 * current order. Allocate enough space for the current needs plus
932 * 40 so don't realloc one entry at a time.
934 if (nitems
> sp
->fts_nitems
) {
937 sp
->fts_nitems
= nitems
+ 40;
938 if ((a
= realloc(sp
->fts_array
,
939 (size_t)(sp
->fts_nitems
* sizeof(FTSENT
*)))) == NULL
) {
941 sp
->fts_array
= NULL
;
947 for (ap
= sp
->fts_array
, p
= head
; p
; p
= p
->fts_link
)
949 qsort((void *)sp
->fts_array
, nitems
, sizeof(FTSENT
*), sp
->fts_compar
);
950 for (head
= *(ap
= sp
->fts_array
); --nitems
; ++ap
)
951 ap
[0]->fts_link
= ap
[1];
952 ap
[0]->fts_link
= NULL
;
958 fts_alloc (FTS
*sp
, const char *name
, size_t namelen
)
964 * The file name is a variable length array and no stat structure is
965 * necessary if the user has set the nostat bit. Allocate the FTSENT
966 * structure, the file name and the stat structure in one chunk, but
967 * be careful that the stat structure is reasonably aligned. Since the
968 * fts_name field is declared to be of size 1, the fts_name pointer is
969 * namelen + 2 before the first possible address of the stat structure.
971 len
= sizeof(FTSENT
) + namelen
;
972 if (!ISSET(FTS_NOSTAT
))
973 len
+= sizeof(struct stat
) + ALIGNBYTES
;
974 if ((p
= malloc(len
)) == NULL
)
977 /* Copy the name and guarantee NUL termination. */
978 memmove(p
->fts_name
, name
, namelen
);
979 p
->fts_name
[namelen
] = '\0';
981 if (!ISSET(FTS_NOSTAT
))
982 p
->fts_statp
= (struct stat
*)ALIGN(p
->fts_name
+ namelen
+ 2);
983 p
->fts_namelen
= namelen
;
984 p
->fts_path
= sp
->fts_path
;
987 p
->fts_instr
= FTS_NOINSTR
;
989 p
->fts_pointer
= NULL
;
995 fts_lfree (FTSENT
*head
)
999 /* Free a linked list of structures. */
1000 while ((p
= head
)) {
1001 head
= head
->fts_link
;
1007 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1008 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1009 * though the kernel won't resolve them. Add the size (not just what's needed)
1010 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1014 fts_palloc (FTS
*sp
, size_t more
)
1018 sp
->fts_pathlen
+= more
+ 256;
1020 * Check for possible wraparound. In an FTS, fts_pathlen is
1021 * a signed int but in an FTSENT it is an unsigned short.
1022 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1024 if (sp
->fts_pathlen
< 0 || sp
->fts_pathlen
>= USHRT_MAX
) {
1026 sp
->fts_path
= NULL
;
1027 __set_errno (ENAMETOOLONG
);
1030 p
= realloc(sp
->fts_path
, sp
->fts_pathlen
);
1033 sp
->fts_path
= NULL
;
1041 * When the path is realloc'd, have to fix all of the pointers in structures
1046 fts_padjust (FTS
*sp
, FTSENT
*head
)
1049 char *addr
= sp
->fts_path
;
1051 #define ADJUST(p) do { \
1052 if ((p)->fts_accpath != (p)->fts_name) { \
1053 (p)->fts_accpath = \
1054 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1056 (p)->fts_path = addr; \
1058 /* Adjust the current set of children. */
1059 for (p
= sp
->fts_child
; p
; p
= p
->fts_link
)
1062 /* Adjust the rest of the tree, including the current level. */
1063 for (p
= head
; p
->fts_level
>= FTS_ROOTLEVEL
;) {
1065 p
= p
->fts_link
? p
->fts_link
: p
->fts_parent
;
1071 fts_maxarglen (char * const *argv
)
1075 for (max
= 0; *argv
; ++argv
)
1076 if ((len
= strlen(*argv
)) > max
)
1082 * Change to dir specified by fd or p->fts_accpath without getting
1083 * tricked by someone changing the world out from underneath us.
1084 * Assumes p->fts_dev and p->fts_ino are filled in.
1088 fts_safe_changedir (FTS
*sp
, FTSENT
*p
, int fd
, const char *path
)
1090 int ret
, oerrno
, newfd
;
1094 if (ISSET(FTS_NOCHDIR
))
1096 if (fd
< 0 && (newfd
= __open(path
, O_RDONLY
, 0)) < 0)
1098 if (__fxstat64(_STAT_VER
, newfd
, &sb
)) {
1102 if (p
->fts_dev
!= sb
.st_dev
|| p
->fts_ino
!= sb
.st_ino
) {
1103 __set_errno (ENOENT
); /* disinformation */
1107 ret
= __fchdir(newfd
);
1111 (void)__close(newfd
);
1112 __set_errno (oerrno
);