1 /* File tree traversal functions.
2 Copyright (C) 1994-2016 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
10 The GNU C Library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with the GNU C Library; if not, see
17 <http://www.gnu.org/licenses/>. */
20 * Copyright (c) 1990, 1993, 1994
21 * The Regents of the University of California. All rights reserved.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
26 * 1. Redistributions of source code must retain the above copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 4. Neither the name of the University nor the names of its contributors
32 * may be used to endorse or promote products derived from this software
33 * without specific prior written permission.
35 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
36 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
37 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
38 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
39 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
40 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
41 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
42 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
43 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
44 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
48 #if defined(LIBC_SCCS) && !defined(lint)
49 static char sccsid
[] = "@(#)fts.c 8.6 (Berkeley) 8/14/94";
50 #endif /* LIBC_SCCS and not lint */
52 #include <sys/param.h>
53 #include <include/sys/stat.h>
63 /* Largest alignment size needed, minus one.
64 Usually long double is the worst case. */
66 #define ALIGNBYTES (__alignof__ (long double) - 1)
68 /* Align P to that size. */
70 #define ALIGN(p) (((unsigned long int) (p) + ALIGNBYTES) & ~ALIGNBYTES)
74 /* Support for the LFS API version. */
76 #define FTS_OPEN fts_open
77 #define FTS_CLOSE fts_close
78 #define FTS_READ fts_read
79 #define FTS_SET fts_set
80 #define FTS_CHILDREN fts_children
82 # define FTSENTRY FTSENT
88 static FTSENTRY
*fts_alloc (FTSOBJ
*, const char *, size_t) internal_function
;
89 static FTSENTRY
*fts_build (FTSOBJ
*, int) internal_function
;
90 static void fts_lfree (FTSENTRY
*) internal_function
;
91 static void fts_load (FTSOBJ
*, FTSENTRY
*) internal_function
;
92 static size_t fts_maxarglen (char * const *) internal_function
;
93 static void fts_padjust (FTSOBJ
*, FTSENTRY
*) internal_function
;
94 static int fts_palloc (FTSOBJ
*, size_t) internal_function
;
95 static FTSENTRY
*fts_sort (FTSOBJ
*, FTSENTRY
*, int) internal_function
;
96 static u_short
fts_stat (FTSOBJ
*, FTSENTRY
*, int) internal_function
;
97 static int fts_safe_changedir (FTSOBJ
*, FTSENTRY
*, int, const char *)
101 #define MAX(a, b) ({ __typeof__ (a) _a = (a); \
102 __typeof__ (b) _b = (b); \
103 _a > _b ? _a : _b; })
106 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
108 #define CLR(opt) (sp->fts_options &= ~(opt))
109 #define ISSET(opt) (sp->fts_options & (opt))
110 #define SET(opt) (sp->fts_options |= (opt))
112 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && __fchdir(fd))
114 /* fts_build flags */
115 #define BCHILD 1 /* fts_children */
116 #define BNAMES 2 /* fts_children, names only */
117 #define BREAD 3 /* fts_read */
120 FTS_OPEN (char * const *argv
, int options
,
121 int (*compar
) (const FTSENTRY
**, const FTSENTRY
**))
126 FTSENTRY
*parent
= NULL
;
130 if (options
& ~FTS_OPTIONMASK
) {
131 __set_errno (EINVAL
);
135 /* Allocate/initialize the stream */
136 if ((sp
= malloc((u_int
)sizeof(FTSOBJ
))) == NULL
)
138 memset(sp
, 0, sizeof(FTSOBJ
));
139 sp
->fts_compar
= (int (*) (const void *, const void *)) compar
;
140 sp
->fts_options
= options
;
142 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
143 if (ISSET(FTS_LOGICAL
))
147 * Start out with 1K of path space, and enough, in any case,
148 * to hold the user's paths.
151 #define MAXPATHLEN 1024
153 size_t maxarglen
= fts_maxarglen(argv
);
154 if (fts_palloc(sp
, MAX(maxarglen
, MAXPATHLEN
)))
157 /* Allocate/initialize root's parent. */
159 if ((parent
= fts_alloc(sp
, "", 0)) == NULL
)
161 parent
->fts_level
= FTS_ROOTPARENTLEVEL
;
164 /* Allocate/initialize root(s). */
165 for (root
= NULL
, nitems
= 0; *argv
!= NULL
; ++argv
, ++nitems
) {
166 /* Don't allow zero-length paths. */
167 size_t len
= strlen(*argv
);
169 __set_errno (ENOENT
);
173 p
= fts_alloc(sp
, *argv
, len
);
174 p
->fts_level
= FTS_ROOTLEVEL
;
175 p
->fts_parent
= parent
;
176 p
->fts_accpath
= p
->fts_name
;
177 p
->fts_info
= fts_stat(sp
, p
, ISSET(FTS_COMFOLLOW
));
179 /* Command-line "." and ".." are real directories. */
180 if (p
->fts_info
== FTS_DOT
)
184 * If comparison routine supplied, traverse in sorted
185 * order; otherwise traverse in the order specified.
200 if (compar
&& nitems
> 1)
201 root
= fts_sort(sp
, root
, nitems
);
204 * Allocate a dummy pointer and make fts_read think that we've just
205 * finished the node before the root(s); set p->fts_info to FTS_INIT
206 * so that everything about the "current" node is ignored.
208 if ((sp
->fts_cur
= fts_alloc(sp
, "", 0)) == NULL
)
210 sp
->fts_cur
->fts_link
= root
;
211 sp
->fts_cur
->fts_info
= FTS_INIT
;
214 * If using chdir(2), grab a file descriptor pointing to dot to ensure
215 * that we can get back here; this could be avoided for some paths,
216 * but almost certainly not worth the effort. Slashes, symbolic links,
217 * and ".." are all fairly nasty problems. Note, if we can't get the
218 * descriptor we run anyway, just more slowly.
220 if (!ISSET(FTS_NOCHDIR
)
221 && (sp
->fts_rfd
= __open(".", O_RDONLY
, 0)) < 0)
226 mem3
: fts_lfree(root
);
228 mem2
: free(sp
->fts_path
);
235 fts_load (FTSOBJ
*sp
, FTSENTRY
*p
)
241 * Load the stream structure for the next traversal. Since we don't
242 * actually enter the directory until after the preorder visit, set
243 * the fts_accpath field specially so the chdir gets done to the right
244 * place and the user can access the first node. From fts_open it's
245 * known that the path will fit.
247 len
= p
->fts_pathlen
= p
->fts_namelen
;
248 memmove(sp
->fts_path
, p
->fts_name
, len
+ 1);
249 if ((cp
= strrchr(p
->fts_name
, '/')) && (cp
!= p
->fts_name
|| cp
[1])) {
251 memmove(p
->fts_name
, cp
, len
+ 1);
252 p
->fts_namelen
= len
;
254 p
->fts_accpath
= p
->fts_path
= sp
->fts_path
;
255 sp
->fts_dev
= p
->fts_dev
;
259 FTS_CLOSE (FTSOBJ
*sp
)
265 * This still works if we haven't read anything -- the dummy structure
266 * points to the root list, so we step through to the end of the root
267 * list which has a valid parent pointer.
270 for (p
= sp
->fts_cur
; p
->fts_level
>= FTS_ROOTLEVEL
;) {
272 p
= p
->fts_link
!= NULL
? p
->fts_link
: p
->fts_parent
;
278 /* Free up child linked list, sort array, path buffer. */
280 fts_lfree(sp
->fts_child
);
284 /* Return to original directory, save errno if necessary. */
285 if (!ISSET(FTS_NOCHDIR
)) {
286 saved_errno
= __fchdir(sp
->fts_rfd
) ? errno
: 0;
287 (void)__close(sp
->fts_rfd
);
289 /* Set errno and return. */
290 if (saved_errno
!= 0) {
291 /* Free up the stream pointer. */
293 __set_errno (saved_errno
);
298 /* Free up the stream pointer. */
304 * Special case of "/" at the end of the path so that slashes aren't
305 * appended which would cause paths to be written as "....//foo".
308 (p->fts_path[p->fts_pathlen - 1] == '/' \
309 ? p->fts_pathlen - 1 : p->fts_pathlen)
312 FTS_READ (FTSOBJ
*sp
)
319 /* If finished or unrecoverable error, return NULL. */
320 if (sp
->fts_cur
== NULL
|| ISSET(FTS_STOP
))
323 /* Set current node pointer. */
326 /* Save and zero out user instructions. */
327 instr
= p
->fts_instr
;
328 p
->fts_instr
= FTS_NOINSTR
;
330 /* Any type of file may be re-visited; re-stat and re-turn. */
331 if (instr
== FTS_AGAIN
) {
332 p
->fts_info
= fts_stat(sp
, p
, 0);
337 * Following a symlink -- SLNONE test allows application to see
338 * SLNONE and recover. If indirecting through a symlink, have
339 * keep a pointer to current location. If unable to get that
340 * pointer, follow fails.
342 if (instr
== FTS_FOLLOW
&&
343 (p
->fts_info
== FTS_SL
|| p
->fts_info
== FTS_SLNONE
)) {
344 p
->fts_info
= fts_stat(sp
, p
, 1);
345 if (p
->fts_info
== FTS_D
&& !ISSET(FTS_NOCHDIR
)) {
346 if ((p
->fts_symfd
= __open(".", O_RDONLY
, 0)) < 0) {
347 p
->fts_errno
= errno
;
348 p
->fts_info
= FTS_ERR
;
350 p
->fts_flags
|= FTS_SYMFOLLOW
;
355 /* Directory in pre-order. */
356 if (p
->fts_info
== FTS_D
) {
357 /* If skipped or crossed mount point, do post-order visit. */
358 if (instr
== FTS_SKIP
||
359 (ISSET(FTS_XDEV
) && p
->fts_dev
!= sp
->fts_dev
)) {
360 if (p
->fts_flags
& FTS_SYMFOLLOW
)
361 (void)__close(p
->fts_symfd
);
363 fts_lfree(sp
->fts_child
);
364 sp
->fts_child
= NULL
;
366 p
->fts_info
= FTS_DP
;
370 /* Rebuild if only read the names and now traversing. */
371 if (sp
->fts_child
!= NULL
&& ISSET(FTS_NAMEONLY
)) {
373 fts_lfree(sp
->fts_child
);
374 sp
->fts_child
= NULL
;
378 * Cd to the subdirectory.
380 * If have already read and now fail to chdir, whack the list
381 * to make the names come out right, and set the parent errno
382 * so the application will eventually get an error condition.
383 * Set the FTS_DONTCHDIR flag so that when we logically change
384 * directories back to the parent we don't do a chdir.
386 * If haven't read do so. If the read fails, fts_build sets
387 * FTS_STOP or the fts_info field of the node.
389 if (sp
->fts_child
!= NULL
) {
390 if (fts_safe_changedir(sp
, p
, -1, p
->fts_accpath
)) {
391 p
->fts_errno
= errno
;
392 p
->fts_flags
|= FTS_DONTCHDIR
;
393 for (p
= sp
->fts_child
; p
!= NULL
;
396 p
->fts_parent
->fts_accpath
;
398 } else if ((sp
->fts_child
= fts_build(sp
, BREAD
)) == NULL
) {
404 sp
->fts_child
= NULL
;
409 /* Move to the next node on this level. */
411 if ((p
= p
->fts_link
) != NULL
) {
416 * If reached the top, return to the original directory (or
417 * the root of the tree), and load the paths for the next root.
419 if (p
->fts_level
== FTS_ROOTLEVEL
) {
420 if (FCHDIR(sp
, sp
->fts_rfd
)) {
429 * User may have called fts_set on the node. If skipped,
430 * ignore. If followed, get a file descriptor so we can
431 * get back if necessary.
433 if (p
->fts_instr
== FTS_SKIP
)
435 if (p
->fts_instr
== FTS_FOLLOW
) {
436 p
->fts_info
= fts_stat(sp
, p
, 1);
437 if (p
->fts_info
== FTS_D
&& !ISSET(FTS_NOCHDIR
)) {
439 __open(".", O_RDONLY
, 0)) < 0) {
440 p
->fts_errno
= errno
;
441 p
->fts_info
= FTS_ERR
;
443 p
->fts_flags
|= FTS_SYMFOLLOW
;
445 p
->fts_instr
= FTS_NOINSTR
;
448 name
: t
= sp
->fts_path
+ NAPPEND(p
->fts_parent
);
450 memmove(t
, p
->fts_name
, p
->fts_namelen
+ 1);
454 /* Move up to the parent node. */
459 if (p
->fts_level
== FTS_ROOTPARENTLEVEL
) {
461 * Done; free everything up and set errno to 0 so the user
462 * can distinguish between error and EOF.
466 return (sp
->fts_cur
= NULL
);
469 /* NUL terminate the pathname. */
470 sp
->fts_path
[p
->fts_pathlen
] = '\0';
473 * Return to the parent directory. If at a root node or came through
474 * a symlink, go back through the file descriptor. Otherwise, cd up
477 if (p
->fts_level
== FTS_ROOTLEVEL
) {
478 if (FCHDIR(sp
, sp
->fts_rfd
)) {
482 } else if (p
->fts_flags
& FTS_SYMFOLLOW
) {
483 if (FCHDIR(sp
, p
->fts_symfd
)) {
485 (void)__close(p
->fts_symfd
);
486 __set_errno (saved_errno
);
490 (void)__close(p
->fts_symfd
);
491 } else if (!(p
->fts_flags
& FTS_DONTCHDIR
) &&
492 fts_safe_changedir(sp
, p
->fts_parent
, -1, "..")) {
496 p
->fts_info
= p
->fts_errno
? FTS_ERR
: FTS_DP
;
501 * Fts_set takes the stream as an argument although it's not used in this
502 * implementation; it would be necessary if anyone wanted to add global
503 * semantics to fts using fts_set. An error return is allowed for similar
508 FTS_SET (FTSOBJ
*sp
, FTSENTRY
*p
, int instr
)
510 if (instr
!= 0 && instr
!= FTS_AGAIN
&& instr
!= FTS_FOLLOW
&&
511 instr
!= FTS_NOINSTR
&& instr
!= FTS_SKIP
) {
512 __set_errno (EINVAL
);
515 p
->fts_instr
= instr
;
520 FTS_CHILDREN(FTSOBJ
*sp
, int instr
)
525 if (instr
!= 0 && instr
!= FTS_NAMEONLY
) {
526 __set_errno (EINVAL
);
530 /* Set current node pointer. */
534 * Errno set to 0 so user can distinguish empty directory from
539 /* Fatal errors stop here. */
543 /* Return logical hierarchy of user's arguments. */
544 if (p
->fts_info
== FTS_INIT
)
545 return (p
->fts_link
);
548 * If not a directory being visited in pre-order, stop here. Could
549 * allow FTS_DNR, assuming the user has fixed the problem, but the
550 * same effect is available with FTS_AGAIN.
552 if (p
->fts_info
!= FTS_D
/* && p->fts_info != FTS_DNR */)
555 /* Free up any previous child list. */
556 if (sp
->fts_child
!= NULL
)
557 fts_lfree(sp
->fts_child
);
559 if (instr
== FTS_NAMEONLY
) {
566 * If using chdir on a relative path and called BEFORE fts_read does
567 * its chdir to the root of a traversal, we can lose -- we need to
568 * chdir into the subdirectory, and we don't know where the current
569 * directory is, so we can't get back so that the upcoming chdir by
570 * fts_read will work.
572 if (p
->fts_level
!= FTS_ROOTLEVEL
|| p
->fts_accpath
[0] == '/' ||
574 return (sp
->fts_child
= fts_build(sp
, instr
));
576 if ((fd
= __open(".", O_RDONLY
, 0)) < 0)
578 sp
->fts_child
= fts_build(sp
, instr
);
582 return (sp
->fts_child
);
586 dirent_not_directory(const struct dirent
*dp
)
588 #if defined DT_DIR && defined _DIRENT_HAVE_D_TYPE
589 return dp
->d_type
!= DT_DIR
&& dp
->d_type
!= DT_UNKNOWN
;
596 * This is the tricky part -- do not casually change *anything* in here. The
597 * idea is to build the linked list of entries that are used by fts_children
598 * and fts_read. There are lots of special cases.
600 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
601 * set and it's a physical walk (so that symbolic links can't be directories),
602 * we can do things quickly. First, if it's a 4.4BSD file system, the type
603 * of the file is in the directory entry. Otherwise, we assume that the number
604 * of subdirectories in a node is equal to the number of links to the parent.
605 * The former skips all stat calls. The latter skips stat calls in any leaf
606 * directories and for any files after the subdirectories in the directory have
607 * been found, cutting the stat calls by about 2/3.
611 fts_build (FTSOBJ
*sp
, int type
)
616 FTSENTRY
*cur
, *tail
;
619 int cderrno
, descend
, len
, level
, nlinks
, saved_errno
,
624 /* Set current node pointer. */
628 * Open the directory for reading. If this fails, we're done.
629 * If being called from fts_read, set the fts_info field.
631 #if defined FTS_WHITEOUT && 0
632 if (ISSET(FTS_WHITEOUT
))
633 oflag
= DTF_NODUP
|DTF_REWIND
;
635 oflag
= DTF_HIDEW
|DTF_NODUP
|DTF_REWIND
;
637 # define __opendir2(path, flag) __opendir(path)
639 if ((dirp
= __opendir2(cur
->fts_accpath
, oflag
)) == NULL
) {
641 cur
->fts_info
= FTS_DNR
;
642 cur
->fts_errno
= errno
;
648 * Nlinks is the number of possible entries of type directory in the
649 * directory if we're cheating on stat calls, 0 if we're not doing
650 * any stat calls at all, -1 if we're doing stats on everything.
652 if (type
== BNAMES
) {
654 /* Be quiet about nostat, GCC. */
656 } else if (ISSET(FTS_NOSTAT
) && ISSET(FTS_PHYSICAL
)) {
657 nlinks
= cur
->fts_nlink
- (ISSET(FTS_SEEDOT
) ? 0 : 2);
665 (void)printf("nlinks == %d (cur: %d)\n", nlinks
, cur
->fts_nlink
);
666 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
667 ISSET(FTS_NOSTAT
), ISSET(FTS_PHYSICAL
), ISSET(FTS_SEEDOT
));
670 * If we're going to need to stat anything or we want to descend
671 * and stay in the directory, chdir. If this fails we keep going,
672 * but set a flag so we don't chdir after the post-order visit.
673 * We won't be able to stat anything, but we can still return the
674 * names themselves. Note, that since fts_read won't be able to
675 * chdir into the directory, it will have to return different path
676 * names than before, i.e. "a/b" instead of "b". Since the node
677 * has already been visited in pre-order, have to wait until the
678 * post-order visit to return the error. There is a special case
679 * here, if there was nothing to stat then it's not an error to
680 * not be able to stat. This is all fairly nasty. If a program
681 * needed sorted entries or stat information, they had better be
682 * checking FTS_NS on the returned nodes.
685 if (nlinks
|| type
== BREAD
) {
686 if (fts_safe_changedir(sp
, cur
, dirfd(dirp
), NULL
)) {
687 if (nlinks
&& type
== BREAD
)
688 cur
->fts_errno
= errno
;
689 cur
->fts_flags
|= FTS_DONTCHDIR
;
692 (void)__closedir(dirp
);
700 * Figure out the max file name length that can be stored in the
701 * current path -- the inner loop allocates more path as necessary.
702 * We really wouldn't have to do the maxlen calculations here, we
703 * could do them in fts_read before returning the path, but it's a
704 * lot easier here since the length is part of the dirent structure.
706 * If not changing directories set a pointer so that can just append
707 * each new name into the path.
710 if (ISSET(FTS_NOCHDIR
)) {
711 cp
= sp
->fts_path
+ len
;
714 /* GCC, you're too verbose. */
718 maxlen
= sp
->fts_pathlen
- len
;
720 level
= cur
->fts_level
+ 1;
722 /* Read the directory, attaching each entry to the `link' pointer. */
724 for (head
= tail
= NULL
, nitems
= 0; dirp
&& (dp
= __readdir(dirp
));) {
725 if (!ISSET(FTS_SEEDOT
) && ISDOT(dp
->d_name
))
728 if ((p
= fts_alloc(sp
, dp
->d_name
, _D_EXACT_NAMLEN (dp
))) == NULL
)
730 if (_D_EXACT_NAMLEN (dp
) >= maxlen
) {/* include space for NUL */
731 oldaddr
= sp
->fts_path
;
732 if (fts_palloc(sp
, _D_EXACT_NAMLEN (dp
) + len
+ 1)) {
734 * No more memory for path or structures. Save
735 * errno, free up the current structure and the
736 * structures already allocated.
738 mem1
: saved_errno
= errno
;
741 (void)__closedir(dirp
);
742 cur
->fts_info
= FTS_ERR
;
744 __set_errno (saved_errno
);
747 /* Did realloc() change the pointer? */
748 if (oldaddr
!= sp
->fts_path
) {
750 if (ISSET(FTS_NOCHDIR
))
751 cp
= sp
->fts_path
+ len
;
753 maxlen
= sp
->fts_pathlen
- len
;
756 if (len
+ _D_EXACT_NAMLEN (dp
) >= USHRT_MAX
) {
758 * In an FTSENT, fts_pathlen is a u_short so it is
759 * possible to wraparound here. If we do, free up
760 * the current structure and the structures already
761 * allocated, then error out with ENAMETOOLONG.
765 (void)__closedir(dirp
);
766 cur
->fts_info
= FTS_ERR
;
768 __set_errno (ENAMETOOLONG
);
771 p
->fts_level
= level
;
772 p
->fts_parent
= sp
->fts_cur
;
773 p
->fts_pathlen
= len
+ _D_EXACT_NAMLEN (dp
);
775 #if defined FTS_WHITEOUT && 0
776 if (dp
->d_type
== DT_WHT
)
777 p
->fts_flags
|= FTS_ISW
;
780 /* Unreachable code. cderrno is only ever set to a nonnull
781 value if dirp is closed at the same time. But then we
782 cannot enter this loop. */
785 p
->fts_info
= FTS_NS
;
786 p
->fts_errno
= cderrno
;
788 p
->fts_info
= FTS_NSOK
;
789 p
->fts_accpath
= cur
->fts_accpath
;
790 } else if (nlinks
== 0
791 || (nostat
&& dirent_not_directory(dp
))) {
793 ISSET(FTS_NOCHDIR
) ? p
->fts_path
: p
->fts_name
;
794 p
->fts_info
= FTS_NSOK
;
796 /* Build a file name for fts_stat to stat. */
797 if (ISSET(FTS_NOCHDIR
)) {
798 p
->fts_accpath
= p
->fts_path
;
799 memmove(cp
, p
->fts_name
, p
->fts_namelen
+ 1);
801 p
->fts_accpath
= p
->fts_name
;
803 p
->fts_info
= fts_stat(sp
, p
, 0);
805 /* Decrement link count if applicable. */
806 if (nlinks
> 0 && (p
->fts_info
== FTS_D
||
807 p
->fts_info
== FTS_DC
|| p
->fts_info
== FTS_DOT
))
811 /* We walk in directory order so "ls -f" doesn't get upset. */
822 (void)__closedir(dirp
);
825 * If realloc() changed the address of the path, adjust the
826 * addresses for the rest of the tree and the dir list.
829 fts_padjust(sp
, head
);
832 * If not changing directories, reset the path back to original
835 if (ISSET(FTS_NOCHDIR
)) {
836 if (len
== sp
->fts_pathlen
|| nitems
== 0)
842 * If descended after called from fts_children or after called from
843 * fts_read and nothing found, get back. At the root level we use
844 * the saved fd; if one of fts_open()'s arguments is a relative path
845 * to an empty directory, we wind up here with no other way back. If
846 * can't get back, we're done.
848 if (descend
&& (type
== BCHILD
|| !nitems
) &&
849 (cur
->fts_level
== FTS_ROOTLEVEL
?
850 FCHDIR(sp
, sp
->fts_rfd
) :
851 fts_safe_changedir(sp
, cur
->fts_parent
, -1, ".."))) {
852 cur
->fts_info
= FTS_ERR
;
858 /* If didn't find anything, return NULL. */
861 cur
->fts_info
= FTS_DP
;
866 /* Sort the entries. */
867 if (sp
->fts_compar
&& nitems
> 1)
868 head
= fts_sort(sp
, head
, nitems
);
874 fts_stat (FTSOBJ
*sp
, FTSENTRY
*p
, int follow
)
879 struct STAT
*sbp
, sb
;
882 /* If user needs stat info, stat buffer already allocated. */
883 sbp
= ISSET(FTS_NOSTAT
) ? &sb
: p
->fts_statp
;
885 #if defined FTS_WHITEOUT && 0
886 /* check for whiteout */
887 if (p
->fts_flags
& FTS_ISW
) {
889 memset(sbp
, '\0', sizeof (*sbp
));
890 sbp
->st_mode
= S_IFWHT
;
897 * If doing a logical walk, or application requested FTS_FOLLOW, do
898 * a stat(2). If that fails, check for a non-existent symlink. If
899 * fail, set the errno from the stat call.
901 if (ISSET(FTS_LOGICAL
) || follow
) {
902 if (STAT(p
->fts_accpath
, sbp
)) {
904 if (!LSTAT(p
->fts_accpath
, sbp
)) {
908 p
->fts_errno
= saved_errno
;
911 } else if (LSTAT(p
->fts_accpath
, sbp
)) {
912 p
->fts_errno
= errno
;
913 err
: memset(sbp
, 0, sizeof(struct STAT
));
917 if (S_ISDIR(sbp
->st_mode
)) {
919 * Set the device/inode. Used to find cycles and check for
920 * crossing mount points. Also remember the link count, used
921 * in fts_build to limit the number of stat calls. It is
922 * understood that these fields are only referenced if fts_info
925 dev
= p
->fts_dev
= sbp
->st_dev
;
926 ino
= p
->fts_ino
= sbp
->st_ino
;
927 p
->fts_nlink
= sbp
->st_nlink
;
929 if (ISDOT(p
->fts_name
))
933 * Cycle detection is done by brute force when the directory
934 * is first encountered. If the tree gets deep enough or the
935 * number of symbolic links to directories is high enough,
936 * something faster might be worthwhile.
938 for (t
= p
->fts_parent
;
939 t
->fts_level
>= FTS_ROOTLEVEL
; t
= t
->fts_parent
)
940 if (ino
== t
->fts_ino
&& dev
== t
->fts_dev
) {
946 if (S_ISLNK(sbp
->st_mode
))
948 if (S_ISREG(sbp
->st_mode
))
950 return (FTS_DEFAULT
);
955 fts_sort (FTSOBJ
*sp
, FTSENTRY
*head
, int nitems
)
960 * Construct an array of pointers to the structures and call qsort(3).
961 * Reassemble the array in the order returned by qsort. If unable to
962 * sort for memory reasons, return the directory entries in their
963 * current order. Allocate enough space for the current needs plus
964 * 40 so don't realloc one entry at a time.
966 if (nitems
> sp
->fts_nitems
) {
969 sp
->fts_nitems
= nitems
+ 40;
970 if ((a
= realloc(sp
->fts_array
,
971 (size_t)(sp
->fts_nitems
* sizeof(FTSENTRY
*)))) == NULL
) {
973 sp
->fts_array
= NULL
;
979 for (ap
= sp
->fts_array
, p
= head
; p
; p
= p
->fts_link
)
981 qsort((void *)sp
->fts_array
, nitems
, sizeof(FTSENTRY
*), sp
->fts_compar
);
982 for (head
= *(ap
= sp
->fts_array
); --nitems
; ++ap
)
983 ap
[0]->fts_link
= ap
[1];
984 ap
[0]->fts_link
= NULL
;
990 fts_alloc (FTSOBJ
*sp
, const char *name
, size_t namelen
)
996 * The file name is a variable length array and no stat structure is
997 * necessary if the user has set the nostat bit. Allocate the FTSENT
998 * structure, the file name and the stat structure in one chunk, but
999 * be careful that the stat structure is reasonably aligned. Since the
1000 * fts_name field is declared to be of size 1, the fts_name pointer is
1001 * namelen + 2 before the first possible address of the stat structure.
1003 len
= sizeof(FTSENTRY
) + namelen
;
1004 if (!ISSET(FTS_NOSTAT
))
1005 len
+= sizeof(struct STAT
) + ALIGNBYTES
;
1006 if ((p
= malloc(len
)) == NULL
)
1009 /* Copy the name and guarantee NUL termination. */
1010 memmove(p
->fts_name
, name
, namelen
);
1011 p
->fts_name
[namelen
] = '\0';
1013 if (!ISSET(FTS_NOSTAT
))
1014 p
->fts_statp
= (struct STAT
*)ALIGN(p
->fts_name
+ namelen
+ 2);
1015 p
->fts_namelen
= namelen
;
1016 p
->fts_path
= sp
->fts_path
;
1019 p
->fts_instr
= FTS_NOINSTR
;
1021 p
->fts_pointer
= NULL
;
1027 fts_lfree (FTSENTRY
*head
)
1031 /* Free a linked list of structures. */
1032 while ((p
= head
)) {
1033 head
= head
->fts_link
;
1039 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1040 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1041 * though the kernel won't resolve them. Add the size (not just what's needed)
1042 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1046 fts_palloc (FTSOBJ
*sp
, size_t more
)
1050 sp
->fts_pathlen
+= more
+ 256;
1052 * Check for possible wraparound. In an FTS, fts_pathlen is
1053 * a signed int but in an FTSENT it is an unsigned short.
1054 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1056 if (sp
->fts_pathlen
< 0 || sp
->fts_pathlen
>= USHRT_MAX
) {
1058 sp
->fts_path
= NULL
;
1059 __set_errno (ENAMETOOLONG
);
1062 p
= realloc(sp
->fts_path
, sp
->fts_pathlen
);
1065 sp
->fts_path
= NULL
;
1073 * When the path is realloc'd, have to fix all of the pointers in structures
1078 fts_padjust (FTSOBJ
*sp
, FTSENTRY
*head
)
1081 char *addr
= sp
->fts_path
;
1083 #define ADJUST(p) do { \
1084 if ((p)->fts_accpath != (p)->fts_name) { \
1085 (p)->fts_accpath = \
1086 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1088 (p)->fts_path = addr; \
1090 /* Adjust the current set of children. */
1091 for (p
= sp
->fts_child
; p
; p
= p
->fts_link
)
1094 /* Adjust the rest of the tree, including the current level. */
1095 for (p
= head
; p
->fts_level
>= FTS_ROOTLEVEL
;) {
1097 p
= p
->fts_link
? p
->fts_link
: p
->fts_parent
;
1103 fts_maxarglen (char * const *argv
)
1107 for (max
= 0; *argv
; ++argv
)
1108 if ((len
= strlen(*argv
)) > max
)
1114 * Change to dir specified by fd or p->fts_accpath without getting
1115 * tricked by someone changing the world out from underneath us.
1116 * Assumes p->fts_dev and p->fts_ino are filled in.
1120 fts_safe_changedir (FTSOBJ
*sp
, FTSENTRY
*p
, int fd
, const char *path
)
1122 int ret
, oerrno
, newfd
;
1126 if (ISSET(FTS_NOCHDIR
))
1128 if (fd
< 0 && (newfd
= __open(path
, O_RDONLY
, 0)) < 0)
1130 if (__fxstat64(_STAT_VER
, newfd
, &sb
)) {
1134 if (p
->fts_dev
!= sb
.st_dev
|| p
->fts_ino
!= sb
.st_ino
) {
1135 __set_errno (ENOENT
); /* disinformation */
1139 ret
= __fchdir(newfd
);
1143 (void)__close(newfd
);
1144 __set_errno (oerrno
);