1 /* Traverse a file hierarchy.
3 Copyright (C) 2004, 2005, 2006 Free Software Foundation, Inc.
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2, or (at your option)
10 This program 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
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software Foundation,
17 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
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
50 #if defined(LIBC_SCCS) && !defined(lint)
51 static char sccsid[] = "@(#)fts.c 8.6 (Berkeley) 8/14/94";
52 #endif /* LIBC_SCCS and not lint */
56 #if HAVE_SYS_PARAM_H || defined _LIBC
57 # include <sys/param.h>
60 # include <include/sys/stat.h>
62 # include <sys/stat.h>
76 # include "unistd--.h"
80 #ifndef _D_EXACT_NAMLEN
81 # define _D_EXACT_NAMLEN(dirent) strlen ((dirent)->d_name)
86 # define close __close
88 # define closedir __closedir
90 # define fchdir __fchdir
94 # define opendir __opendir
96 # define readdir __readdir
98 # undef internal_function
99 # define internal_function /* empty */
103 # define __set_errno(Val) errno = (Val)
106 #ifndef __attribute__
107 # if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 8) || __STRICT_ANSI__
108 # define __attribute__(x) /* empty */
112 #ifndef ATTRIBUTE_UNUSED
113 # define ATTRIBUTE_UNUSED __attribute__ ((__unused__))
116 /* If this host provides the openat function, then we can avoid
117 attempting to open "." in some initialization code below. */
119 # define HAVE_OPENAT_SUPPORT 1
121 # define HAVE_OPENAT_SUPPORT 0
124 static FTSENT *fts_alloc (FTS *, const char *, size_t) internal_function;
125 static FTSENT *fts_build (FTS *, int) internal_function;
126 static void fts_lfree (FTSENT *) internal_function;
127 static void fts_load (FTS *, FTSENT *) internal_function;
128 static size_t fts_maxarglen (char * const *) internal_function;
129 static void fts_padjust (FTS *, FTSENT *) internal_function;
130 static bool fts_palloc (FTS *, size_t) internal_function;
131 static FTSENT *fts_sort (FTS *, FTSENT *, size_t) internal_function;
132 static unsigned short int fts_stat (FTS *, FTSENT *, bool) internal_function;
133 static int fts_safe_changedir (FTS *, FTSENT *, int, const char *)
137 static bool enter_dir (FTS *fts, FTSENT *ent) { return true; }
138 static void leave_dir (FTS *fts, FTSENT *ent) {}
139 static bool setup_dir (FTS *fts) { return true; }
140 static void free_dir (FTS *fts) {}
142 # include "fcntl--.h"
143 # include "fts-cycle.c"
147 # define MAX(a,b) ((a) > (b) ? (a) : (b))
151 # define SIZE_MAX ((size_t) -1)
155 # define O_DIRECTORY 0
158 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
159 #define STREQ(a, b) (strcmp ((a), (b)) == 0)
161 #define CLR(opt) (sp->fts_options &= ~(opt))
162 #define ISSET(opt) (sp->fts_options & (opt))
163 #define SET(opt) (sp->fts_options |= (opt))
165 #define RESTORE_INITIAL_CWD(sp) FCHDIR (sp, (ISSET (FTS_CWDFD) \
169 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) \
170 && (ISSET(FTS_CWDFD) \
171 ? (cwd_advance_fd (sp, fd), 0) \
175 /* fts_build flags */
176 #define BCHILD 1 /* fts_children */
177 #define BNAMES 2 /* fts_children, names only */
178 #define BREAD 3 /* fts_read */
181 # include <inttypes.h>
184 bool fts_debug = false;
185 # define Dprintf(x) do { if (fts_debug) printf x; } while (0)
190 #define LEAVE_DIR(Fts, Ent, Tag) \
193 Dprintf ((" %s-leaving: %s\n", Tag, (Ent)->fts_path)); \
194 leave_dir (Fts, Ent); \
198 /* file-descriptor-relative opendir. */
199 /* FIXME: if others need this function, move it into lib/openat.c */
202 opendirat (int fd, char const *dir)
204 int new_fd = openat (fd, dir, O_RDONLY);
209 dirp = fdopendir (new_fd);
212 int saved_errno = errno;
219 /* Virtual fchdir. Advance SP's working directory
220 file descriptor, SP->fts_cwd_fd, to FD, and close
221 the previous one, ignoring any error. */
224 cwd_advance_fd (FTS *sp, int fd)
226 int old = sp->fts_cwd_fd;
227 if (old == fd && old != AT_FDCWD)
231 close (old); /* ignore any close failure */
234 /* Open the directory DIR if possible, and return a file
235 descriptor. Return -1 and set errno on failure. It doesn't matter
236 whether the file descriptor has read or write access. */
240 diropen (FTS const *sp, char const *dir)
242 int open_flags = (O_RDONLY | O_DIRECTORY | O_NOCTTY | O_NONBLOCK
243 | (ISSET (FTS_PHYSICAL) ? O_NOFOLLOW : 0));
245 return (ISSET (FTS_CWDFD)
246 ? openat (sp->fts_cwd_fd, dir, open_flags)
247 : open (dir, open_flags));
251 fts_open (char * const *argv,
252 register int options,
253 int (*compar) (FTSENT const **, FTSENT const **))
256 register FTSENT *p, *root;
257 register size_t nitems;
258 FTSENT *parent = NULL;
259 FTSENT *tmp = NULL; /* pacify gcc */
263 if (options & ~FTS_OPTIONMASK) {
264 __set_errno (EINVAL);
267 if ((options & FTS_NOCHDIR) && (options & FTS_CWDFD)) {
268 __set_errno (EINVAL);
271 if ( ! (options & (FTS_LOGICAL | FTS_PHYSICAL))) {
272 __set_errno (EINVAL);
276 /* Allocate/initialize the stream */
277 if ((sp = malloc(sizeof(FTS))) == NULL)
279 memset(sp, 0, sizeof(FTS));
280 sp->fts_compar = compar;
281 sp->fts_options = options;
283 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
284 if (ISSET(FTS_LOGICAL)) {
289 /* Initialize fts_cwd_fd. */
290 sp->fts_cwd_fd = AT_FDCWD;
291 if ( ISSET(FTS_CWDFD) && ! HAVE_OPENAT_SUPPORT)
293 /* While it isn't technically necessary to open "." this
294 early, doing it here saves us the trouble of ensuring
295 later (where it'd be messier) that "." can in fact
296 be opened. If not, revert to FTS_NOCHDIR mode. */
297 int fd = open (".", O_RDONLY);
300 /* Even if `.' is unreadable, don't revert to FTS_NOCHDIR mode
301 on systems like Linux+PROC_FS, where our openat emulation
302 is good enough. Note: on a system that emulates
303 openat via /proc, this technique can still fail, but
304 only in extreme conditions, e.g., when the working
305 directory cannot be saved (i.e. save_cwd fails) --
306 and that happens only on Linux only when "." is unreadable
307 and the CWD would be longer than PATH_MAX.
308 FIXME: once Linux kernel openat support is well established,
309 replace the above open call and this entire if/else block
310 with the body of the if-block below. */
311 if ( openat_needs_fchdir ())
324 * Start out with 1K of file name space, and enough, in any case,
325 * to hold the user's file names.
328 # define MAXPATHLEN 1024
331 size_t maxarglen = fts_maxarglen(argv);
332 if (! fts_palloc(sp, MAX(maxarglen, MAXPATHLEN)))
336 /* Allocate/initialize root's parent. */
338 if ((parent = fts_alloc(sp, "", 0)) == NULL)
340 parent->fts_level = FTS_ROOTPARENTLEVEL;
343 /* Allocate/initialize root(s). */
344 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
345 /* Don't allow zero-length file names. */
346 if ((len = strlen(*argv)) == 0) {
347 __set_errno (ENOENT);
351 if ((p = fts_alloc(sp, *argv, len)) == NULL)
353 p->fts_level = FTS_ROOTLEVEL;
354 p->fts_parent = parent;
355 p->fts_accpath = p->fts_name;
356 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW) != 0);
358 /* Command-line "." and ".." are real directories. */
359 if (p->fts_info == FTS_DOT)
363 * If comparison routine supplied, traverse in sorted
364 * order; otherwise traverse in the order specified.
379 if (compar && nitems > 1)
380 root = fts_sort(sp, root, nitems);
383 * Allocate a dummy pointer and make fts_read think that we've just
384 * finished the node before the root(s); set p->fts_info to FTS_INIT
385 * so that everything about the "current" node is ignored.
387 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
389 sp->fts_cur->fts_link = root;
390 sp->fts_cur->fts_info = FTS_INIT;
391 if (! setup_dir (sp))
395 * If using chdir(2), grab a file descriptor pointing to dot to ensure
396 * that we can get back here; this could be avoided for some file names,
397 * but almost certainly not worth the effort. Slashes, symbolic links,
398 * and ".." are all fairly nasty problems. Note, if we can't get the
399 * descriptor we run anyway, just more slowly.
401 if (!ISSET(FTS_NOCHDIR) && !ISSET(FTS_CWDFD)
402 && (sp->fts_rfd = diropen (sp, ".")) < 0)
407 mem3: fts_lfree(root);
409 mem2: free(sp->fts_path);
416 fts_load (FTS *sp, register FTSENT *p)
422 * Load the stream structure for the next traversal. Since we don't
423 * actually enter the directory until after the preorder visit, set
424 * the fts_accpath field specially so the chdir gets done to the right
425 * place and the user can access the first node. From fts_open it's
426 * known that the file name will fit.
428 len = p->fts_pathlen = p->fts_namelen;
429 memmove(sp->fts_path, p->fts_name, len + 1);
430 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
432 memmove(p->fts_name, cp, len + 1);
433 p->fts_namelen = len;
435 p->fts_accpath = p->fts_path = sp->fts_path;
436 sp->fts_dev = p->fts_statp->st_dev;
442 register FTSENT *freep, *p;
446 * This still works if we haven't read anything -- the dummy structure
447 * points to the root list, so we step through to the end of the root
448 * list which has a valid parent pointer.
451 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
453 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
459 /* Free up child linked list, sort array, file name buffer. */
461 fts_lfree(sp->fts_child);
466 if (ISSET(FTS_CWDFD))
468 if (0 <= sp->fts_cwd_fd)
469 close (sp->fts_cwd_fd);
471 else if (!ISSET(FTS_NOCHDIR))
473 /* Return to original directory, save errno if necessary. */
474 if (fchdir(sp->fts_rfd))
481 /* Free up the stream pointer. */
484 /* Set errno and return. */
486 __set_errno (saved_errno);
494 * Special case of "/" at the end of the file name so that slashes aren't
495 * appended which would cause file names to be written as "....//foo".
498 (p->fts_path[p->fts_pathlen - 1] == '/' \
499 ? p->fts_pathlen - 1 : p->fts_pathlen)
502 fts_read (register FTS *sp)
504 register FTSENT *p, *tmp;
505 register unsigned short int instr;
508 /* If finished or unrecoverable error, return NULL. */
509 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
512 /* Set current node pointer. */
515 /* Save and zero out user instructions. */
516 instr = p->fts_instr;
517 p->fts_instr = FTS_NOINSTR;
519 /* Any type of file may be re-visited; re-stat and re-turn. */
520 if (instr == FTS_AGAIN) {
521 p->fts_info = fts_stat(sp, p, false);
524 Dprintf (("fts_read: p=%s\n",
525 p->fts_info == FTS_INIT ? "" : p->fts_path));
528 * Following a symlink -- SLNONE test allows application to see
529 * SLNONE and recover. If indirecting through a symlink, have
530 * keep a pointer to current location. If unable to get that
531 * pointer, follow fails.
533 if (instr == FTS_FOLLOW &&
534 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
535 p->fts_info = fts_stat(sp, p, true);
536 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
537 if ((p->fts_symfd = diropen (sp, ".")) < 0) {
538 p->fts_errno = errno;
539 p->fts_info = FTS_ERR;
541 p->fts_flags |= FTS_SYMFOLLOW;
546 /* Directory in pre-order. */
547 if (p->fts_info == FTS_D) {
548 /* If skipped or crossed mount point, do post-order visit. */
549 if (instr == FTS_SKIP ||
550 (ISSET(FTS_XDEV) && p->fts_statp->st_dev != sp->fts_dev)) {
551 if (p->fts_flags & FTS_SYMFOLLOW)
552 (void)close(p->fts_symfd);
554 fts_lfree(sp->fts_child);
555 sp->fts_child = NULL;
557 p->fts_info = FTS_DP;
558 LEAVE_DIR (sp, p, "1");
562 /* Rebuild if only read the names and now traversing. */
563 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
565 fts_lfree(sp->fts_child);
566 sp->fts_child = NULL;
570 * Cd to the subdirectory.
572 * If have already read and now fail to chdir, whack the list
573 * to make the names come out right, and set the parent errno
574 * so the application will eventually get an error condition.
575 * Set the FTS_DONTCHDIR flag so that when we logically change
576 * directories back to the parent we don't do a chdir.
578 * If haven't read do so. If the read fails, fts_build sets
579 * FTS_STOP or the fts_info field of the node.
581 if (sp->fts_child != NULL) {
582 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
583 p->fts_errno = errno;
584 p->fts_flags |= FTS_DONTCHDIR;
585 for (p = sp->fts_child; p != NULL;
588 p->fts_parent->fts_accpath;
590 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
593 /* If fts_build's call to fts_safe_changedir failed
594 because it was not able to fchdir into a
595 subdirectory, tell the caller. */
597 p->fts_info = FTS_ERR;
598 LEAVE_DIR (sp, p, "2");
602 sp->fts_child = NULL;
606 /* Move to the next node on this level. */
608 if ((p = p->fts_link) != NULL) {
612 * If reached the top, return to the original directory (or
613 * the root of the tree), and load the file names for the next
616 if (p->fts_level == FTS_ROOTLEVEL) {
617 if (RESTORE_INITIAL_CWD(sp)) {
627 * User may have called fts_set on the node. If skipped,
628 * ignore. If followed, get a file descriptor so we can
629 * get back if necessary.
631 if (p->fts_instr == FTS_SKIP)
633 if (p->fts_instr == FTS_FOLLOW) {
634 p->fts_info = fts_stat(sp, p, true);
635 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
636 if ((p->fts_symfd = diropen (sp, ".")) < 0) {
637 p->fts_errno = errno;
638 p->fts_info = FTS_ERR;
640 p->fts_flags |= FTS_SYMFOLLOW;
642 p->fts_instr = FTS_NOINSTR;
645 name: t = sp->fts_path + NAPPEND(p->fts_parent);
647 memmove(t, p->fts_name, p->fts_namelen + 1);
650 if (p->fts_info == FTS_D)
652 Dprintf ((" %s-entering: %s\n", sp, p->fts_path));
653 if (! enter_dir (sp, p))
655 __set_errno (ENOMEM);
662 /* Move up to the parent node. */
666 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
668 * Done; free everything up and set errno to 0 so the user
669 * can distinguish between error and EOF.
673 return (sp->fts_cur = NULL);
676 /* NUL terminate the file name. */
677 sp->fts_path[p->fts_pathlen] = '\0';
680 * Return to the parent directory. If at a root node, restore
681 * the initial working directory. If we came through a symlink,
682 * go back through the file descriptor. Otherwise, move up
683 * one level, via "..".
685 if (p->fts_level == FTS_ROOTLEVEL) {
686 if (RESTORE_INITIAL_CWD(sp)) {
687 p->fts_errno = errno;
690 } else if (p->fts_flags & FTS_SYMFOLLOW) {
691 if (FCHDIR(sp, p->fts_symfd)) {
692 int saved_errno = errno;
693 (void)close(p->fts_symfd);
694 __set_errno (saved_errno);
695 p->fts_errno = errno;
698 (void)close(p->fts_symfd);
699 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
700 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
701 p->fts_errno = errno;
704 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
705 if (p->fts_errno == 0)
706 LEAVE_DIR (sp, p, "3");
708 return ISSET(FTS_STOP) ? NULL : p;
712 * Fts_set takes the stream as an argument although it's not used in this
713 * implementation; it would be necessary if anyone wanted to add global
714 * semantics to fts using fts_set. An error return is allowed for similar
719 fts_set(FTS *sp ATTRIBUTE_UNUSED, FTSENT *p, int instr)
721 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
722 instr != FTS_NOINSTR && instr != FTS_SKIP) {
723 __set_errno (EINVAL);
726 p->fts_instr = instr;
731 fts_children (register FTS *sp, int instr)
736 if (instr != 0 && instr != FTS_NAMEONLY) {
737 __set_errno (EINVAL);
741 /* Set current node pointer. */
745 * Errno set to 0 so user can distinguish empty directory from
750 /* Fatal errors stop here. */
754 /* Return logical hierarchy of user's arguments. */
755 if (p->fts_info == FTS_INIT)
756 return (p->fts_link);
759 * If not a directory being visited in pre-order, stop here. Could
760 * allow FTS_DNR, assuming the user has fixed the problem, but the
761 * same effect is available with FTS_AGAIN.
763 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
766 /* Free up any previous child list. */
767 if (sp->fts_child != NULL)
768 fts_lfree(sp->fts_child);
770 if (instr == FTS_NAMEONLY) {
777 * If using chdir on a relative file name and called BEFORE fts_read
778 * does its chdir to the root of a traversal, we can lose -- we need to
779 * chdir into the subdirectory, and we don't know where the current
780 * directory is, so we can't get back so that the upcoming chdir by
781 * fts_read will work.
783 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
785 return (sp->fts_child = fts_build(sp, instr));
787 if ((fd = diropen (sp, ".")) < 0)
788 return (sp->fts_child = NULL);
789 sp->fts_child = fts_build(sp, instr);
790 if (ISSET(FTS_CWDFD))
792 cwd_advance_fd (sp, fd);
798 int saved_errno = errno;
800 __set_errno (saved_errno);
805 return (sp->fts_child);
809 * This is the tricky part -- do not casually change *anything* in here. The
810 * idea is to build the linked list of entries that are used by fts_children
811 * and fts_read. There are lots of special cases.
813 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
814 * set and it's a physical walk (so that symbolic links can't be directories),
815 * we can do things quickly. First, if it's a 4.4BSD file system, the type
816 * of the file is in the directory entry. Otherwise, we assume that the number
817 * of subdirectories in a node is equal to the number of links to the parent.
818 * The former skips all stat calls. The latter skips stat calls in any leaf
819 * directories and for any files after the subdirectories in the directory have
820 * been found, cutting the stat calls by about 2/3.
824 fts_build (register FTS *sp, int type)
826 register struct dirent *dp;
827 register FTSENT *p, *head;
828 register size_t nitems;
838 size_t len, maxlen, new_len;
841 /* Set current node pointer. */
845 * Open the directory for reading. If this fails, we're done.
846 * If being called from fts_read, set the fts_info field.
848 #if defined FTS_WHITEOUT && 0
849 if (ISSET(FTS_WHITEOUT))
850 oflag = DTF_NODUP|DTF_REWIND;
852 oflag = DTF_HIDEW|DTF_NODUP|DTF_REWIND;
854 # define __opendir2(file, flag) \
855 ( ! ISSET(FTS_NOCHDIR) && ISSET(FTS_CWDFD) \
856 ? opendirat(sp->fts_cwd_fd, file) \
859 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
861 cur->fts_info = FTS_DNR;
862 cur->fts_errno = errno;
868 * Nlinks is the number of possible entries of type directory in the
869 * directory if we're cheating on stat calls, 0 if we're not doing
870 * any stat calls at all, (nlink_t) -1 if we're statting everything.
872 if (type == BNAMES) {
874 /* Be quiet about nostat, GCC. */
876 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
877 nlinks = (cur->fts_statp->st_nlink
878 - (ISSET(FTS_SEEDOT) ? 0 : 2));
886 * If we're going to need to stat anything or we want to descend
887 * and stay in the directory, chdir. If this fails we keep going,
888 * but set a flag so we don't chdir after the post-order visit.
889 * We won't be able to stat anything, but we can still return the
890 * names themselves. Note, that since fts_read won't be able to
891 * chdir into the directory, it will have to return different file
892 * names than before, i.e. "a/b" instead of "b". Since the node
893 * has already been visited in pre-order, have to wait until the
894 * post-order visit to return the error. There is a special case
895 * here, if there was nothing to stat then it's not an error to
896 * not be able to stat. This is all fairly nasty. If a program
897 * needed sorted entries or stat information, they had better be
898 * checking FTS_NS on the returned nodes.
900 if (nlinks || type == BREAD) {
901 int dir_fd = dirfd(dirp);
902 if (ISSET(FTS_CWDFD) && 0 <= dir_fd)
903 dir_fd = dup (dir_fd);
904 if (dir_fd < 0 || fts_safe_changedir(sp, cur, dir_fd, NULL)) {
905 if (nlinks && type == BREAD)
906 cur->fts_errno = errno;
907 cur->fts_flags |= FTS_DONTCHDIR;
910 if (ISSET(FTS_CWDFD) && 0 <= dir_fd)
919 * Figure out the max file name length that can be stored in the
920 * current buffer -- the inner loop allocates more space as necessary.
921 * We really wouldn't have to do the maxlen calculations here, we
922 * could do them in fts_read before returning the name, but it's a
923 * lot easier here since the length is part of the dirent structure.
925 * If not changing directories set a pointer so that can just append
926 * each new component into the file name.
929 if (ISSET(FTS_NOCHDIR)) {
930 cp = sp->fts_path + len;
933 /* GCC, you're too verbose. */
937 maxlen = sp->fts_pathlen - len;
939 level = cur->fts_level + 1;
941 /* Read the directory, attaching each entry to the `link' pointer. */
943 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
944 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
947 if ((p = fts_alloc (sp, dp->d_name,
948 _D_EXACT_NAMLEN (dp))) == NULL)
950 if (_D_EXACT_NAMLEN (dp) >= maxlen) {
951 /* include space for NUL */
952 oldaddr = sp->fts_path;
953 if (! fts_palloc(sp, _D_EXACT_NAMLEN (dp) + len + 1)) {
955 * No more memory. Save
956 * errno, free up the current structure and the
957 * structures already allocated.
959 mem1: saved_errno = errno;
964 cur->fts_info = FTS_ERR;
966 __set_errno (saved_errno);
969 /* Did realloc() change the pointer? */
970 if (oldaddr != sp->fts_path) {
972 if (ISSET(FTS_NOCHDIR))
973 cp = sp->fts_path + len;
975 maxlen = sp->fts_pathlen - len;
978 new_len = len + _D_EXACT_NAMLEN (dp);
981 * In the unlikely even that we would end up
982 * with a file name longer than SIZE_MAX, free up
983 * the current structure and the structures already
984 * allocated, then error out with ENAMETOOLONG.
989 cur->fts_info = FTS_ERR;
991 __set_errno (ENAMETOOLONG);
994 p->fts_level = level;
995 p->fts_parent = sp->fts_cur;
996 p->fts_pathlen = new_len;
998 #if defined FTS_WHITEOUT && 0
999 if (dp->d_type == DT_WHT)
1000 p->fts_flags |= FTS_ISW;
1003 /* Build a file name for fts_stat to stat. */
1004 if (ISSET(FTS_NOCHDIR)) {
1005 p->fts_accpath = p->fts_path;
1006 memmove(cp, p->fts_name, p->fts_namelen + 1);
1008 p->fts_accpath = p->fts_name;
1010 p->fts_info = fts_stat(sp, p, false);
1012 /* Decrement link count if applicable. */
1013 if (nlinks > 0 && (p->fts_info == FTS_D ||
1014 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
1017 /* We walk in directory order so "ls -f" doesn't get upset. */
1031 * If realloc() changed the address of the file name, adjust the
1032 * addresses for the rest of the tree and the dir list.
1035 fts_padjust(sp, head);
1038 * If not changing directories, reset the file name back to original
1041 if (ISSET(FTS_NOCHDIR)) {
1042 if (len == sp->fts_pathlen || nitems == 0)
1048 * If descended after called from fts_children or after called from
1049 * fts_read and nothing found, get back. At the root level we use
1050 * the saved fd; if one of fts_open()'s arguments is a relative name
1051 * to an empty directory, we wind up here with no other way back. If
1052 * can't get back, we're done.
1054 if (descend && (type == BCHILD || !nitems) &&
1055 (cur->fts_level == FTS_ROOTLEVEL
1056 ? RESTORE_INITIAL_CWD(sp)
1057 : fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
1058 cur->fts_info = FTS_ERR;
1064 /* If didn't find anything, return NULL. */
1067 cur->fts_info = FTS_DP;
1072 /* Sort the entries. */
1073 if (sp->fts_compar && nitems > 1)
1074 head = fts_sort(sp, head, nitems);
1080 /* Walk ->fts_parent links starting at E_CURR, until the root of the
1081 current hierarchy. There should be a directory with dev/inode
1082 matching those of AD. If not, print a lot of diagnostics. */
1084 find_matching_ancestor (FTSENT const *e_curr, struct Active_dir const *ad)
1087 for (ent = e_curr; ent->fts_level >= FTS_ROOTLEVEL; ent = ent->fts_parent)
1089 if (ad->ino == ent->fts_statp->st_ino
1090 && ad->dev == ent->fts_statp->st_dev)
1093 printf ("ERROR: tree dir, %s, not active\n", ad->fts_ent->fts_accpath);
1094 printf ("active dirs:\n");
1096 ent->fts_level >= FTS_ROOTLEVEL; ent = ent->fts_parent)
1097 printf (" %s(%"PRIuMAX"/%"PRIuMAX") to %s(%"PRIuMAX"/%"PRIuMAX")...\n",
1098 ad->fts_ent->fts_accpath,
1099 (uintmax_t) ad->dev,
1100 (uintmax_t) ad->ino,
1102 (uintmax_t) ent->fts_statp->st_dev,
1103 (uintmax_t) ent->fts_statp->st_ino);
1107 fts_cross_check (FTS const *sp)
1109 FTSENT const *ent = sp->fts_cur;
1111 if ( ! ISSET (FTS_TIGHT_CYCLE_CHECK))
1114 Dprintf (("fts-cross-check cur=%s\n", ent->fts_path));
1115 /* Make sure every parent dir is in the tree. */
1116 for (t = ent->fts_parent; t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
1118 struct Active_dir ad;
1119 ad.ino = t->fts_statp->st_ino;
1120 ad.dev = t->fts_statp->st_dev;
1121 if ( ! hash_lookup (sp->fts_cycle.ht, &ad))
1122 printf ("ERROR: active dir, %s, not in tree\n", t->fts_path);
1125 /* Make sure every dir in the tree is an active dir.
1126 But ENT is not necessarily a directory. If so, just skip this part. */
1127 if (ent->fts_parent->fts_level >= FTS_ROOTLEVEL
1128 && (ent->fts_info == FTS_DP
1129 || ent->fts_info == FTS_D))
1131 struct Active_dir *ad;
1132 for (ad = hash_get_first (sp->fts_cycle.ht); ad != NULL;
1133 ad = hash_get_next (sp->fts_cycle.ht, ad))
1135 find_matching_ancestor (ent, ad);
1141 static unsigned short int
1143 fts_stat(FTS *sp, register FTSENT *p, bool follow)
1145 struct stat *sbp = p->fts_statp;
1148 #if defined FTS_WHITEOUT && 0
1149 /* check for whiteout */
1150 if (p->fts_flags & FTS_ISW) {
1151 memset(sbp, '\0', sizeof (*sbp));
1152 sbp->st_mode = S_IFWHT;
1158 * If doing a logical walk, or application requested FTS_FOLLOW, do
1159 * a stat(2). If that fails, check for a non-existent symlink. If
1160 * fail, set the errno from the stat call.
1162 if (ISSET(FTS_LOGICAL) || follow) {
1163 if (stat(p->fts_accpath, sbp)) {
1164 saved_errno = errno;
1166 && lstat(p->fts_accpath, sbp) == 0) {
1168 return (FTS_SLNONE);
1170 p->fts_errno = saved_errno;
1173 } else if (fstatat(sp->fts_cwd_fd, p->fts_accpath, sbp,
1174 AT_SYMLINK_NOFOLLOW)) {
1175 p->fts_errno = errno;
1176 err: memset(sbp, 0, sizeof(struct stat));
1180 if (S_ISDIR(sbp->st_mode)) {
1181 if (ISDOT(p->fts_name))
1187 * Cycle detection is done by brute force when the directory
1188 * is first encountered. If the tree gets deep enough or the
1189 * number of symbolic links to directories is high enough,
1190 * something faster might be worthwhile.
1194 for (t = p->fts_parent;
1195 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
1196 if (sbp->st_ino == t->fts_statp->st_ino
1197 && sbp->st_dev == t->fts_statp->st_dev)
1207 if (S_ISLNK(sbp->st_mode))
1209 if (S_ISREG(sbp->st_mode))
1211 return (FTS_DEFAULT);
1215 fts_compar (void const *a, void const *b)
1217 /* Convert A and B to the correct types, to pacify the compiler, and
1218 for portability to bizarre hosts where "void const *" and "FTSENT
1219 const **" differ in runtime representation. The comparison
1220 function cannot modify *a and *b, but there is no compile-time
1222 FTSENT const **pa = (FTSENT const **) a;
1223 FTSENT const **pb = (FTSENT const **) b;
1224 return pa[0]->fts_fts->fts_compar (pa, pb);
1229 fts_sort (FTS *sp, FTSENT *head, register size_t nitems)
1231 register FTSENT **ap, *p;
1233 /* On most modern hosts, void * and FTSENT ** have the same
1234 run-time representation, and one can convert sp->fts_compar to
1235 the type qsort expects without problem. Use the heuristic that
1236 this is OK if the two pointer types are the same size, and if
1237 converting FTSENT ** to long int is the same as converting
1238 FTSENT ** to void * and then to long int. This heuristic isn't
1239 valid in general but we don't know of any counterexamples. */
1241 int (*compare) (void const *, void const *) =
1242 ((sizeof &dummy == sizeof (void *)
1243 && (long int) &dummy == (long int) (void *) &dummy)
1244 ? (int (*) (void const *, void const *)) sp->fts_compar
1248 * Construct an array of pointers to the structures and call qsort(3).
1249 * Reassemble the array in the order returned by qsort. If unable to
1250 * sort for memory reasons, return the directory entries in their
1251 * current order. Allocate enough space for the current needs plus
1252 * 40 so don't realloc one entry at a time.
1254 if (nitems > sp->fts_nitems) {
1257 sp->fts_nitems = nitems + 40;
1258 if (SIZE_MAX / sizeof *a < sp->fts_nitems
1259 || ! (a = realloc (sp->fts_array,
1260 sp->fts_nitems * sizeof *a))) {
1261 free(sp->fts_array);
1262 sp->fts_array = NULL;
1268 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
1270 qsort((void *)sp->fts_array, nitems, sizeof(FTSENT *), compare);
1271 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1272 ap[0]->fts_link = ap[1];
1273 ap[0]->fts_link = NULL;
1279 fts_alloc (FTS *sp, const char *name, register size_t namelen)
1285 * The file name is a variable length array. Allocate the FTSENT
1286 * structure and the file name in one chunk.
1288 len = sizeof(FTSENT) + namelen;
1289 if ((p = malloc(len)) == NULL)
1292 /* Copy the name and guarantee NUL termination. */
1293 memmove(p->fts_name, name, namelen);
1294 p->fts_name[namelen] = '\0';
1296 p->fts_namelen = namelen;
1298 p->fts_path = sp->fts_path;
1301 p->fts_instr = FTS_NOINSTR;
1303 p->fts_pointer = NULL;
1309 fts_lfree (register FTSENT *head)
1313 /* Free a linked list of structures. */
1314 while ((p = head)) {
1315 head = head->fts_link;
1321 * Allow essentially unlimited file name lengths; find, rm, ls should
1322 * all work on any tree. Most systems will allow creation of file
1323 * names much longer than MAXPATHLEN, even though the kernel won't
1324 * resolve them. Add the size (not just what's needed) plus 256 bytes
1325 * so don't realloc the file name 2 bytes at a time.
1329 fts_palloc (FTS *sp, size_t more)
1332 size_t new_len = sp->fts_pathlen + more + 256;
1335 * See if fts_pathlen would overflow.
1337 if (new_len < sp->fts_pathlen) {
1340 sp->fts_path = NULL;
1342 sp->fts_path = NULL;
1343 __set_errno (ENAMETOOLONG);
1346 sp->fts_pathlen = new_len;
1347 p = realloc(sp->fts_path, sp->fts_pathlen);
1350 sp->fts_path = NULL;
1358 * When the file name is realloc'd, have to fix all of the pointers in
1359 * structures already returned.
1363 fts_padjust (FTS *sp, FTSENT *head)
1366 char *addr = sp->fts_path;
1368 #define ADJUST(p) do { \
1369 if ((p)->fts_accpath != (p)->fts_name) { \
1370 (p)->fts_accpath = \
1371 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1373 (p)->fts_path = addr; \
1375 /* Adjust the current set of children. */
1376 for (p = sp->fts_child; p; p = p->fts_link)
1379 /* Adjust the rest of the tree, including the current level. */
1380 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1382 p = p->fts_link ? p->fts_link : p->fts_parent;
1388 fts_maxarglen (char * const *argv)
1392 for (max = 0; *argv; ++argv)
1393 if ((len = strlen(*argv)) > max)
1399 * Change to dir specified by fd or file name without getting
1400 * tricked by someone changing the world out from underneath us.
1401 * Assumes p->fts_statp->st_dev and p->fts_statp->st_ino are filled in.
1402 * If FD is non-negative, expect it to be used after this function returns,
1403 * and to be closed eventually. So don't pass e.g., `dirfd(dirp)' and then
1404 * do closedir(dirp), because that would invalidate the saved FD.
1405 * Upon failure, close FD immediately and return nonzero.
1409 fts_safe_changedir (FTS *sp, FTSENT *p, int fd, char const *dir)
1414 if (ISSET(FTS_NOCHDIR)) {
1415 if (ISSET(FTS_CWDFD) && 0 <= fd)
1419 if (fd < 0 && (newfd = diropen (sp, dir)) < 0)
1422 /* The following dev/inode check is necessary if we're doing
1423 a `logical' traversal (through symlinks, a la chown -L),
1424 if the system lacks O_NOFOLLOW support, or if we're changing
1425 to "..". In the latter case, O_NOFOLLOW can't help. In
1426 general (when the target is not ".."), diropen's use of
1427 O_NOFOLLOW ensures we don't mistakenly follow a symlink,
1428 so we can avoid the expense of this fstat. */
1429 if (ISSET(FTS_LOGICAL) || O_NOFOLLOW == 0
1430 || (dir && STREQ (dir, "..")))
1433 if (fstat(newfd, &sb))
1438 if (p->fts_statp->st_dev != sb.st_dev
1439 || p->fts_statp->st_ino != sb.st_ino)
1441 __set_errno (ENOENT); /* disinformation */
1447 if (ISSET(FTS_CWDFD))
1449 cwd_advance_fd (sp, newfd);
1453 ret = fchdir(newfd);
1459 __set_errno (oerrno);