2 * This file is not used on BSD systems, because the libc version
3 * works. On Linux, the fts in libc is compiled for a 32-bit
4 * off_t, which doesn't match the 64-bit off_t used by the rest
7 * bsdtar_platform.h defines _FILE_OFFSET_BITS=64 so this will
8 * be compiled for 64-bit off_t.
10 * This file is mostly unchanged from:
11 * FreeBSD: src/lib/libc/gen/fts.c,v 1.22 2003/01/03 23:25:25 tjr Exp
12 * except for a few minor Linux-isms which are commented with "bsdtar:"
17 * Copyright (c) 1990, 1993, 1994
18 * The Regents of the University of California. All rights reserved.
20 * Redistribution and use in source and binary forms, with or without
21 * modification, are permitted provided that the following conditions
23 * 1. Redistributions of source code must retain the above copyright
24 * notice, this list of conditions and the following disclaimer.
25 * 2. Redistributions in binary form must reproduce the above copyright
26 * notice, this list of conditions and the following disclaimer in the
27 * documentation and/or other materials provided with the distribution.
28 * 3. All advertising materials mentioning features or use of this software
29 * must display the following acknowledgement:
30 * This product includes software developed by the University of
31 * California, Berkeley and its contributors.
32 * 4. Neither the name of the University nor the names of its contributors
33 * may be used to endorse or promote products derived from this software
34 * without specific prior written permission.
36 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
37 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
38 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
39 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
40 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
41 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
42 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
43 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
44 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
45 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
48 * From: $OpenBSD: fts.c,v 1.22 1999/10/03 19:22:22 millert Exp $
52 #if defined(LIBC_SCCS) && !defined(lint)
53 static char sccsid[] = "@(#)fts.c 8.6 (Berkeley) 8/14/94";
54 #endif /* LIBC_SCCS and not lint */
55 #include "bsdtar_platform.h" /* bsdtar: need platform-specific definitions. */
56 __FBSDID("$FreeBSD: src/usr.bin/tar/fts.c,v 1.2 2004/07/24 22:13:44 kientzle Exp $");
58 #ifdef linux /* bsdtar: translate certain system calls to Linux names. */
64 /* #include "namespace.h" */ /* bsdtar: Don't use namespace.h. */
65 #include <sys/types.h>
66 #include <sys/param.h>
73 #undef FTS_WHITEOUT /* bsdtar: Not all platforms support this. */
77 /* #include "un-namespace.h" */ /* bsdtar: Don't use namespace.h. */
79 static FTSENT *fts_alloc(FTS *, char *, int);
80 static FTSENT *fts_build(FTS *, int);
81 static void fts_lfree(FTSENT *);
82 static void fts_load(FTS *, FTSENT *);
83 static size_t fts_maxarglen(char * const *);
84 static void fts_padjust(FTS *, FTSENT *);
85 static int fts_palloc(FTS *, size_t);
86 static FTSENT *fts_sort(FTS *, FTSENT *, int);
87 static u_short fts_stat(FTS *, FTSENT *, int);
88 static int fts_safe_changedir(FTS *, FTSENT *, int, char *);
90 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
92 #define CLR(opt) (sp->fts_options &= ~(opt))
93 #define ISSET(opt) (sp->fts_options & (opt))
94 #define SET(opt) (sp->fts_options |= (opt))
96 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
99 #define BCHILD 1 /* fts_children */
100 #define BNAMES 2 /* fts_children, names only */
101 #define BREAD 3 /* fts_read */
103 #ifndef HAVE_REALLOCF /* bsdtar: Define reallocf for non-BSD platforms. */
109 void *ret = realloc(ptr, size);
117 fts_open(argv, options, compar)
120 int (*compar)(const FTSENT * const *, const FTSENT * const *);
125 FTSENT *parent, *tmp;
129 if (options & ~FTS_OPTIONMASK) {
134 /* Allocate/initialize the stream */
135 if ((sp = malloc(sizeof(FTS))) == NULL)
137 memset(sp, 0, sizeof(FTS));
138 sp->fts_compar = compar;
139 sp->fts_options = options;
144 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
145 if (ISSET(FTS_LOGICAL))
149 * Start out with 1K of path space, and enough, in any case,
150 * to hold the user's paths.
152 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
155 /* Allocate/initialize root's parent. */
156 if ((parent = fts_alloc(sp, "", 0)) == NULL)
158 parent->fts_level = FTS_ROOTPARENTLEVEL;
160 /* Allocate/initialize root(s). */
161 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
162 /* Don't allow zero-length paths. */
163 if ((len = strlen(*argv)) == 0) {
168 p = fts_alloc(sp, *argv, len);
169 p->fts_level = FTS_ROOTLEVEL;
170 p->fts_parent = parent;
171 p->fts_accpath = p->fts_name;
172 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
174 /* Command-line "." and ".." are real directories. */
175 if (p->fts_info == FTS_DOT)
179 * If comparison routine supplied, traverse in sorted
180 * order; otherwise traverse in the order specified.
195 if (compar && nitems > 1)
196 root = fts_sort(sp, root, nitems);
199 * Allocate a dummy pointer and make fts_read think that we've just
200 * finished the node before the root(s); set p->fts_info to FTS_INIT
201 * so that everything about the "current" node is ignored.
203 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
205 sp->fts_cur->fts_link = root;
206 sp->fts_cur->fts_info = FTS_INIT;
209 * If using chdir(2), grab a file descriptor pointing to dot to ensure
210 * that we can get back here; this could be avoided for some paths,
211 * but almost certainly not worth the effort. Slashes, symbolic links,
212 * and ".." are all fairly nasty problems. Note, if we can't get the
213 * descriptor we run anyway, just more slowly.
215 if (!ISSET(FTS_NOCHDIR) && (sp->fts_rfd = _open(".", O_RDONLY, 0)) < 0)
220 mem3: fts_lfree(root);
222 mem2: free(sp->fts_path);
236 * Load the stream structure for the next traversal. Since we don't
237 * actually enter the directory until after the preorder visit, set
238 * the fts_accpath field specially so the chdir gets done to the right
239 * place and the user can access the first node. From fts_open it's
240 * known that the path will fit.
242 len = p->fts_pathlen = p->fts_namelen;
243 memmove(sp->fts_path, p->fts_name, len + 1);
244 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
246 memmove(p->fts_name, cp, len + 1);
247 p->fts_namelen = len;
249 p->fts_accpath = p->fts_path = sp->fts_path;
250 sp->fts_dev = p->fts_dev;
261 * This still works if we haven't read anything -- the dummy structure
262 * points to the root list, so we step through to the end of the root
263 * list which has a valid parent pointer.
266 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
268 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
274 /* Free up child linked list, sort array, path buffer. */
276 fts_lfree(sp->fts_child);
281 /* Return to original directory, save errno if necessary. */
282 if (!ISSET(FTS_NOCHDIR)) {
283 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
284 (void)_close(sp->fts_rfd);
286 /* Set errno and return. */
287 if (saved_errno != 0) {
288 /* Free up the stream pointer. */
295 /* Free up the stream pointer. */
301 * Special case of "/" at the end of the path so that slashes aren't
302 * appended which would cause paths to be written as "....//foo".
305 (p->fts_path[p->fts_pathlen - 1] == '/' \
306 ? p->fts_pathlen - 1 : p->fts_pathlen)
317 /* If finished or unrecoverable error, return NULL. */
318 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
321 /* Set current node pointer. */
324 /* Save and zero out user instructions. */
325 instr = p->fts_instr;
326 p->fts_instr = FTS_NOINSTR;
328 /* Any type of file may be re-visited; re-stat and re-turn. */
329 if (instr == FTS_AGAIN) {
330 p->fts_info = fts_stat(sp, p, 0);
335 * Following a symlink -- SLNONE test allows application to see
336 * SLNONE and recover. If indirecting through a symlink, have
337 * keep a pointer to current location. If unable to get that
338 * pointer, follow fails.
340 if (instr == FTS_FOLLOW &&
341 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
342 p->fts_info = fts_stat(sp, p, 1);
343 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
344 if ((p->fts_symfd = _open(".", O_RDONLY, 0)) < 0) {
345 p->fts_errno = errno;
346 p->fts_info = FTS_ERR;
348 p->fts_flags |= FTS_SYMFOLLOW;
353 /* Directory in pre-order. */
354 if (p->fts_info == FTS_D) {
355 /* If skipped or crossed mount point, do post-order visit. */
356 if (instr == FTS_SKIP ||
357 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
358 if (p->fts_flags & FTS_SYMFOLLOW)
359 (void)_close(p->fts_symfd);
361 fts_lfree(sp->fts_child);
362 sp->fts_child = NULL;
364 p->fts_info = FTS_DP;
368 /* Rebuild if only read the names and now traversing. */
369 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
371 fts_lfree(sp->fts_child);
372 sp->fts_child = NULL;
376 * Cd to the subdirectory.
378 * If have already read and now fail to chdir, whack the list
379 * to make the names come out right, and set the parent errno
380 * so the application will eventually get an error condition.
381 * Set the FTS_DONTCHDIR flag so that when we logically change
382 * directories back to the parent we don't do a chdir.
384 * If haven't read do so. If the read fails, fts_build sets
385 * FTS_STOP or the fts_info field of the node.
387 if (sp->fts_child != NULL) {
388 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
389 p->fts_errno = errno;
390 p->fts_flags |= FTS_DONTCHDIR;
391 for (p = sp->fts_child; p != NULL;
394 p->fts_parent->fts_accpath;
396 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
402 sp->fts_child = NULL;
406 /* Move to the next node on this level. */
408 if ((p = p->fts_link) != NULL) {
412 * If reached the top, return to the original directory (or
413 * the root of the tree), and load the paths for the next root.
415 if (p->fts_level == FTS_ROOTLEVEL) {
416 if (FCHDIR(sp, sp->fts_rfd)) {
421 return (sp->fts_cur = p);
425 * User may have called fts_set on the node. If skipped,
426 * ignore. If followed, get a file descriptor so we can
427 * get back if necessary.
429 if (p->fts_instr == FTS_SKIP)
431 if (p->fts_instr == FTS_FOLLOW) {
432 p->fts_info = fts_stat(sp, p, 1);
433 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
435 _open(".", O_RDONLY, 0)) < 0) {
436 p->fts_errno = errno;
437 p->fts_info = FTS_ERR;
439 p->fts_flags |= FTS_SYMFOLLOW;
441 p->fts_instr = FTS_NOINSTR;
444 name: t = sp->fts_path + NAPPEND(p->fts_parent);
446 memmove(t, p->fts_name, p->fts_namelen + 1);
447 return (sp->fts_cur = p);
450 /* Move up to the parent node. */
454 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
456 * Done; free everything up and set errno to 0 so the user
457 * can distinguish between error and EOF.
461 return (sp->fts_cur = NULL);
464 /* NUL terminate the pathname. */
465 sp->fts_path[p->fts_pathlen] = '\0';
468 * Return to the parent directory. If at a root node or came through
469 * a symlink, go back through the file descriptor. Otherwise, cd up
472 if (p->fts_level == FTS_ROOTLEVEL) {
473 if (FCHDIR(sp, sp->fts_rfd)) {
477 } else if (p->fts_flags & FTS_SYMFOLLOW) {
478 if (FCHDIR(sp, p->fts_symfd)) {
480 (void)_close(p->fts_symfd);
485 (void)_close(p->fts_symfd);
486 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
487 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
491 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
492 return (sp->fts_cur = p);
496 * Fts_set takes the stream as an argument although it's not used in this
497 * implementation; it would be necessary if anyone wanted to add global
498 * semantics to fts using fts_set. An error return is allowed for similar
503 fts_set(sp, p, instr)
508 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
509 instr != FTS_NOINSTR && instr != FTS_SKIP) {
513 p->fts_instr = instr;
518 fts_children(sp, instr)
525 if (instr != 0 && instr != FTS_NAMEONLY) {
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);
585 #ifndef fts_get_clientptr
586 #error "fts_get_clientptr not defined"
590 (fts_get_clientptr)(FTS *sp)
593 return (fts_get_clientptr(sp));
596 #ifndef fts_get_stream
597 #error "fts_get_stream not defined"
601 (fts_get_stream)(FTSENT *p)
603 return (fts_get_stream(p));
607 fts_set_clientptr(FTS *sp, void *clientptr)
610 sp->fts_clientptr = clientptr;
614 * This is the tricky part -- do not casually change *anything* in here. The
615 * idea is to build the linked list of entries that are used by fts_children
616 * and fts_read. There are lots of special cases.
618 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
619 * set and it's a physical walk (so that symbolic links can't be directories),
620 * we can do things quickly. First, if it's a 4.4BSD file system, the type
621 * of the file is in the directory entry. Otherwise, we assume that the number
622 * of subdirectories in a node is equal to the number of links to the parent.
623 * The former skips all stat calls. The latter skips stat calls in any leaf
624 * directories and for any files after the subdirectories in the directory have
625 * been found, cutting the stat calls by about 2/3.
638 int cderrno, descend, len, level, maxlen, nlinks, oflag, saved_errno,
642 /* Set current node pointer. */
646 * Open the directory for reading. If this fails, we're done.
647 * If being called from fts_read, set the fts_info field.
650 if (ISSET(FTS_WHITEOUT))
651 oflag = DTF_NODUP|DTF_REWIND;
653 oflag = DTF_HIDEW|DTF_NODUP|DTF_REWIND;
655 #define __opendir2(path, flag) opendir(path)
657 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
659 cur->fts_info = FTS_DNR;
660 cur->fts_errno = errno;
666 * Nlinks is the number of possible entries of type directory in the
667 * directory if we're cheating on stat calls, 0 if we're not doing
668 * any stat calls at all, -1 if we're doing stats on everything.
670 if (type == BNAMES) {
672 /* Be quiet about nostat, GCC. */
674 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
675 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
683 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
684 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
685 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
688 * If we're going to need to stat anything or we want to descend
689 * and stay in the directory, chdir. If this fails we keep going,
690 * but set a flag so we don't chdir after the post-order visit.
691 * We won't be able to stat anything, but we can still return the
692 * names themselves. Note, that since fts_read won't be able to
693 * chdir into the directory, it will have to return different path
694 * names than before, i.e. "a/b" instead of "b". Since the node
695 * has already been visited in pre-order, have to wait until the
696 * post-order visit to return the error. There is a special case
697 * here, if there was nothing to stat then it's not an error to
698 * not be able to stat. This is all fairly nasty. If a program
699 * needed sorted entries or stat information, they had better be
700 * checking FTS_NS on the returned nodes.
703 if (nlinks || type == BREAD) {
704 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
705 if (nlinks && type == BREAD)
706 cur->fts_errno = errno;
707 cur->fts_flags |= FTS_DONTCHDIR;
710 (void)closedir(dirp);
718 * Figure out the max file name length that can be stored in the
719 * current path -- the inner loop allocates more path as necessary.
720 * We really wouldn't have to do the maxlen calculations here, we
721 * could do them in fts_read before returning the path, but it's a
722 * lot easier here since the length is part of the dirent structure.
724 * If not changing directories set a pointer so that can just append
725 * each new name into the path.
728 if (ISSET(FTS_NOCHDIR)) {
729 cp = sp->fts_path + len;
732 /* GCC, you're too verbose. */
736 maxlen = sp->fts_pathlen - len;
738 level = cur->fts_level + 1;
740 /* Read the directory, attaching each entry to the `link' pointer. */
742 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
743 #ifdef HAVE_STRUCT_DIRENT_D_NAMLEN /* bsdtar: Not everyone has d_namlen. */
744 #define dnamlen dp->d_namlen
746 int dnamlen = strlen(dp->d_name);
748 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
751 if ((p = fts_alloc(sp, dp->d_name, dnamlen)) == NULL)
753 if (dnamlen >= maxlen) { /* include space for NUL */
754 oldaddr = sp->fts_path;
755 if (fts_palloc(sp, dnamlen + len + 1)) {
757 * No more memory for path or structures. Save
758 * errno, free up the current structure and the
759 * structures already allocated.
761 mem1: saved_errno = errno;
765 (void)closedir(dirp);
766 cur->fts_info = FTS_ERR;
771 /* Did realloc() change the pointer? */
772 if (oldaddr != sp->fts_path) {
774 if (ISSET(FTS_NOCHDIR))
775 cp = sp->fts_path + len;
777 maxlen = sp->fts_pathlen - len;
780 if (len + dnamlen >= USHRT_MAX) {
782 * In an FTSENT, fts_pathlen is a u_short so it is
783 * possible to wraparound here. If we do, free up
784 * the current structure and the structures already
785 * allocated, then error out with ENAMETOOLONG.
789 (void)closedir(dirp);
790 cur->fts_info = FTS_ERR;
792 errno = ENAMETOOLONG;
795 p->fts_level = level;
796 p->fts_parent = sp->fts_cur;
797 p->fts_pathlen = len + dnamlen;
800 if (dp->d_type == DT_WHT)
801 p->fts_flags |= FTS_ISW;
806 p->fts_info = FTS_NS;
807 p->fts_errno = cderrno;
809 p->fts_info = FTS_NSOK;
810 p->fts_accpath = cur->fts_accpath;
811 } else if (nlinks == 0
814 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
818 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
819 p->fts_info = FTS_NSOK;
821 /* Build a file name for fts_stat to stat. */
822 if (ISSET(FTS_NOCHDIR)) {
823 p->fts_accpath = p->fts_path;
824 memmove(cp, p->fts_name, p->fts_namelen + 1);
826 p->fts_accpath = p->fts_name;
828 p->fts_info = fts_stat(sp, p, 0);
830 /* Decrement link count if applicable. */
831 if (nlinks > 0 && (p->fts_info == FTS_D ||
832 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
836 /* We walk in directory order so "ls -f" doesn't get upset. */
847 (void)closedir(dirp);
850 * If realloc() changed the address of the path, adjust the
851 * addresses for the rest of the tree and the dir list.
854 fts_padjust(sp, head);
857 * If not changing directories, reset the path back to original
860 if (ISSET(FTS_NOCHDIR)) {
861 if (len == sp->fts_pathlen || nitems == 0)
867 * If descended after called from fts_children or after called from
868 * fts_read and nothing found, get back. At the root level we use
869 * the saved fd; if one of fts_open()'s arguments is a relative path
870 * to an empty directory, we wind up here with no other way back. If
871 * can't get back, we're done.
873 if (descend && (type == BCHILD || !nitems) &&
874 (cur->fts_level == FTS_ROOTLEVEL ?
875 FCHDIR(sp, sp->fts_rfd) :
876 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
877 cur->fts_info = FTS_ERR;
882 /* If didn't find anything, return NULL. */
885 cur->fts_info = FTS_DP;
889 /* Sort the entries. */
890 if (sp->fts_compar && nitems > 1)
891 head = fts_sort(sp, head, nitems);
896 fts_stat(sp, p, follow)
904 struct stat *sbp, sb;
907 /* If user needs stat info, stat buffer already allocated. */
908 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
911 /* check for whiteout */
912 if (p->fts_flags & FTS_ISW) {
914 memset(sbp, '\0', sizeof (*sbp));
915 sbp->st_mode = S_IFWHT;
922 * If doing a logical walk, or application requested FTS_FOLLOW, do
923 * a stat(2). If that fails, check for a non-existent symlink. If
924 * fail, set the errno from the stat call.
926 if (ISSET(FTS_LOGICAL) || follow) {
927 if (stat(p->fts_accpath, sbp)) {
929 if (!lstat(p->fts_accpath, sbp)) {
933 p->fts_errno = saved_errno;
936 } else if (lstat(p->fts_accpath, sbp)) {
937 p->fts_errno = errno;
938 err: memset(sbp, 0, sizeof(struct stat));
942 if (S_ISDIR(sbp->st_mode)) {
944 * Set the device/inode. Used to find cycles and check for
945 * crossing mount points. Also remember the link count, used
946 * in fts_build to limit the number of stat calls. It is
947 * understood that these fields are only referenced if fts_info
950 dev = p->fts_dev = sbp->st_dev;
951 ino = p->fts_ino = sbp->st_ino;
952 p->fts_nlink = sbp->st_nlink;
954 if (ISDOT(p->fts_name))
958 * Cycle detection is done by brute force when the directory
959 * is first encountered. If the tree gets deep enough or the
960 * number of symbolic links to directories is high enough,
961 * something faster might be worthwhile.
963 for (t = p->fts_parent;
964 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
965 if (ino == t->fts_ino && dev == t->fts_dev) {
971 if (S_ISLNK(sbp->st_mode))
973 if (S_ISREG(sbp->st_mode))
975 return (FTS_DEFAULT);
979 * The comparison function takes pointers to pointers to FTSENT structures.
980 * Qsort wants a comparison function that takes pointers to void.
981 * (Both with appropriate levels of const-poisoning, of course!)
982 * Use a trampoline function to deal with the difference.
985 fts_compar(const void *a, const void *b)
989 parent = (*(const FTSENT * const *)a)->fts_fts;
990 return (*parent->fts_compar)(a, b);
994 fts_sort(sp, head, nitems)
1002 * Construct an array of pointers to the structures and call qsort(3).
1003 * Reassemble the array in the order returned by qsort. If unable to
1004 * sort for memory reasons, return the directory entries in their
1005 * current order. Allocate enough space for the current needs plus
1006 * 40 so don't realloc one entry at a time.
1008 if (nitems > sp->fts_nitems) {
1009 sp->fts_nitems = nitems + 40;
1010 if ((sp->fts_array = reallocf(sp->fts_array,
1011 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
1016 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
1018 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
1019 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1020 ap[0]->fts_link = ap[1];
1021 ap[0]->fts_link = NULL;
1026 fts_alloc(sp, name, namelen)
1034 struct ftsent_withstat {
1036 struct stat statbuf;
1040 * The file name is a variable length array and no stat structure is
1041 * necessary if the user has set the nostat bit. Allocate the FTSENT
1042 * structure, the file name and the stat structure in one chunk, but
1043 * be careful that the stat structure is reasonably aligned.
1045 if (ISSET(FTS_NOSTAT))
1046 len = sizeof(FTSENT) + namelen + 1;
1048 len = sizeof(struct ftsent_withstat) + namelen + 1;
1050 if ((p = malloc(len)) == NULL)
1053 if (ISSET(FTS_NOSTAT)) {
1054 p->fts_name = (char *)(p + 1);
1055 p->fts_statp = NULL;
1057 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1058 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1061 /* Copy the name and guarantee NUL termination. */
1062 memcpy(p->fts_name, name, namelen);
1063 p->fts_name[namelen] = '\0';
1064 p->fts_namelen = namelen;
1065 p->fts_path = sp->fts_path;
1068 p->fts_instr = FTS_NOINSTR;
1070 p->fts_pointer = NULL;
1081 /* Free a linked list of structures. */
1082 while ((p = head)) {
1083 head = head->fts_link;
1089 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1090 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1091 * though the kernel won't resolve them. Add the size (not just what's needed)
1092 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1095 fts_palloc(sp, more)
1100 sp->fts_pathlen += more + 256;
1102 * Check for possible wraparound. In an FTS, fts_pathlen is
1103 * a signed int but in an FTSENT it is an unsigned short.
1104 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1106 if (sp->fts_pathlen < 0 || sp->fts_pathlen >= USHRT_MAX) {
1109 sp->fts_path = NULL;
1110 errno = ENAMETOOLONG;
1113 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1114 return (sp->fts_path == NULL);
1118 * When the path is realloc'd, have to fix all of the pointers in structures
1122 fts_padjust(sp, head)
1127 char *addr = sp->fts_path;
1129 #define ADJUST(p) do { \
1130 if ((p)->fts_accpath != (p)->fts_name) { \
1131 (p)->fts_accpath = \
1132 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1134 (p)->fts_path = addr; \
1136 /* Adjust the current set of children. */
1137 for (p = sp->fts_child; p; p = p->fts_link)
1140 /* Adjust the rest of the tree, including the current level. */
1141 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1143 p = p->fts_link ? p->fts_link : p->fts_parent;
1153 for (max = 0; *argv; ++argv)
1154 if ((len = strlen(*argv)) > max)
1160 * Change to dir specified by fd or p->fts_accpath without getting
1161 * tricked by someone changing the world out from underneath us.
1162 * Assumes p->fts_dev and p->fts_ino are filled in.
1165 fts_safe_changedir(sp, p, fd, path)
1171 int ret, oerrno, newfd;
1175 if (ISSET(FTS_NOCHDIR))
1177 if (fd < 0 && (newfd = _open(path, O_RDONLY, 0)) < 0)
1179 if (_fstat(newfd, &sb)) {
1183 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1184 errno = ENOENT; /* disinformation */
1188 ret = fchdir(newfd);
1192 (void)_close(newfd);