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
29 * $OpenBSD: fts.c,v 1.22 1999/10/03 19:22:22 millert Exp $
33 #if defined(LIBC_SCCS) && !defined(lint)
34 static char sccsid[] = "@(#)fts.c 8.6 (Berkeley) 8/14/94";
35 #endif /* LIBC_SCCS and not lint */
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
41 #include "namespace.h"
42 #include <sys/param.h>
43 #include <sys/mount.h>
53 #include "un-namespace.h"
55 #include "gen-private.h"
57 static FTSENT *fts_alloc(FTS *, char *, size_t);
58 static FTSENT *fts_build(FTS *, int);
59 static void fts_lfree(FTSENT *);
60 static void fts_load(FTS *, FTSENT *);
61 static size_t fts_maxarglen(char * const *);
62 static void fts_padjust(FTS *, FTSENT *);
63 static int fts_palloc(FTS *, size_t);
64 static FTSENT *fts_sort(FTS *, FTSENT *, size_t);
65 static int fts_stat(FTS *, FTSENT *, int, int);
66 static int fts_safe_changedir(FTS *, FTSENT *, int, char *);
67 static int fts_ufslinks(FTS *, const FTSENT *);
69 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
71 #define CLR(opt) (sp->fts_options &= ~(opt))
72 #define ISSET(opt) (sp->fts_options & (opt))
73 #define SET(opt) (sp->fts_options |= (opt))
75 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
78 #define BCHILD 1 /* fts_children */
79 #define BNAMES 2 /* fts_children, names only */
80 #define BREAD 3 /* fts_read */
83 * Internal representation of an FTS, including extra implementation
84 * details. The FTS returned from fts_open points to this structure's
85 * ftsp_fts member (and can be cast to an _fts_private as required)
89 struct statfs ftsp_statfs;
91 int ftsp_linksreliable;
95 * The "FTS_NOSTAT" option can avoid a lot of calls to stat(2) if it
96 * knows that a directory could not possibly have subdirectories. This
97 * is decided by looking at the link count: a subdirectory would
98 * increment its parent's link count by virtue of its own ".." entry.
99 * This assumption only holds for UFS-like filesystems that implement
100 * links and directories this way, so we must punt for others.
103 static const char *ufslike_filesystems[] = {
113 fts_open(argv, options, compar)
116 int (*compar)(const FTSENT * const *, const FTSENT * const *);
118 struct _fts_private *priv;
121 FTSENT *parent, *tmp;
125 if (options & ~FTS_OPTIONMASK) {
130 /* fts_open() requires at least one path */
136 /* Allocate/initialize the stream. */
137 if ((priv = calloc(1, sizeof(*priv))) == NULL)
139 sp = &priv->ftsp_fts;
140 sp->fts_compar = compar;
141 sp->fts_options = options;
146 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
147 if (ISSET(FTS_LOGICAL))
151 * Start out with 1K of path space, and enough, in any case,
152 * to hold the user's paths.
154 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
157 /* Allocate/initialize root's parent. */
158 if ((parent = fts_alloc(sp, "", 0)) == NULL)
160 parent->fts_level = FTS_ROOTPARENTLEVEL;
162 /* Allocate/initialize root(s). */
163 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
166 p = fts_alloc(sp, *argv, len);
167 p->fts_level = FTS_ROOTLEVEL;
168 p->fts_parent = parent;
169 p->fts_accpath = p->fts_name;
170 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW), -1);
172 /* Command-line "." and ".." are real directories. */
173 if (p->fts_info == FTS_DOT)
177 * If comparison routine supplied, traverse in sorted
178 * order; otherwise traverse in the order specified.
193 if (compar && nitems > 1)
194 root = fts_sort(sp, root, nitems);
197 * Allocate a dummy pointer and make fts_read think that we've just
198 * finished the node before the root(s); set p->fts_info to FTS_INIT
199 * so that everything about the "current" node is ignored.
201 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
203 sp->fts_cur->fts_link = root;
204 sp->fts_cur->fts_info = FTS_INIT;
207 * If using chdir(2), grab a file descriptor pointing to dot to ensure
208 * that we can get back here; this could be avoided for some paths,
209 * but almost certainly not worth the effort. Slashes, symbolic links,
210 * and ".." are all fairly nasty problems. Note, if we can't get the
211 * descriptor we run anyway, just more slowly.
213 if (!ISSET(FTS_NOCHDIR) &&
214 (sp->fts_rfd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
219 mem3: fts_lfree(root);
221 mem2: free(sp->fts_path);
227 fts_load(FTS *sp, FTSENT *p)
233 * Load the stream structure for the next traversal. Since we don't
234 * actually enter the directory until after the preorder visit, set
235 * the fts_accpath field specially so the chdir gets done to the right
236 * place and the user can access the first node. From fts_open it's
237 * known that the path will fit.
239 len = p->fts_pathlen = p->fts_namelen;
240 memmove(sp->fts_path, p->fts_name, len + 1);
241 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
243 memmove(p->fts_name, cp, len + 1);
244 p->fts_namelen = len;
246 p->fts_accpath = p->fts_path = sp->fts_path;
247 sp->fts_dev = p->fts_dev;
257 * This still works if we haven't read anything -- the dummy structure
258 * points to the root list, so we step through to the end of the root
259 * list which has a valid parent pointer.
262 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
264 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
270 /* Free up child linked list, sort array, path buffer. */
272 fts_lfree(sp->fts_child);
277 /* Return to original directory, save errno if necessary. */
278 if (!ISSET(FTS_NOCHDIR)) {
279 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
280 (void)_close(sp->fts_rfd);
282 /* Set errno and return. */
283 if (saved_errno != 0) {
284 /* Free up the stream pointer. */
291 /* Free up the stream pointer. */
297 * Special case of "/" at the end of the path so that slashes aren't
298 * appended which would cause paths to be written as "....//foo".
301 (p->fts_path[p->fts_pathlen - 1] == '/' \
302 ? p->fts_pathlen - 1 : p->fts_pathlen)
312 /* If finished or unrecoverable error, return NULL. */
313 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
316 /* Set current node pointer. */
319 /* Save and zero out user instructions. */
320 instr = p->fts_instr;
321 p->fts_instr = FTS_NOINSTR;
323 /* Any type of file may be re-visited; re-stat and re-turn. */
324 if (instr == FTS_AGAIN) {
325 p->fts_info = fts_stat(sp, p, 0, -1);
330 * Following a symlink -- SLNONE test allows application to see
331 * SLNONE and recover. If indirecting through a symlink, have
332 * keep a pointer to current location. If unable to get that
333 * pointer, follow fails.
335 if (instr == FTS_FOLLOW &&
336 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
337 p->fts_info = fts_stat(sp, p, 1, -1);
338 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
339 if ((p->fts_symfd = _open(".", O_RDONLY | O_CLOEXEC,
341 p->fts_errno = errno;
342 p->fts_info = FTS_ERR;
344 p->fts_flags |= FTS_SYMFOLLOW;
349 /* Directory in pre-order. */
350 if (p->fts_info == FTS_D) {
351 /* If skipped or crossed mount point, do post-order visit. */
352 if (instr == FTS_SKIP ||
353 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
354 if (p->fts_flags & FTS_SYMFOLLOW)
355 (void)_close(p->fts_symfd);
357 fts_lfree(sp->fts_child);
358 sp->fts_child = NULL;
360 p->fts_info = FTS_DP;
364 /* Rebuild if only read the names and now traversing. */
365 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
367 fts_lfree(sp->fts_child);
368 sp->fts_child = NULL;
372 * Cd to the subdirectory.
374 * If have already read and now fail to chdir, whack the list
375 * to make the names come out right, and set the parent errno
376 * so the application will eventually get an error condition.
377 * Set the FTS_DONTCHDIR flag so that when we logically change
378 * directories back to the parent we don't do a chdir.
380 * If haven't read do so. If the read fails, fts_build sets
381 * FTS_STOP or the fts_info field of the node.
383 if (sp->fts_child != NULL) {
384 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
385 p->fts_errno = errno;
386 p->fts_flags |= FTS_DONTCHDIR;
387 for (p = sp->fts_child; p != NULL;
390 p->fts_parent->fts_accpath;
392 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
398 sp->fts_child = NULL;
402 /* Move to the next node on this level. */
404 if ((p = p->fts_link) != NULL) {
406 * If reached the top, return to the original directory (or
407 * the root of the tree), and load the paths for the next root.
409 if (p->fts_level == FTS_ROOTLEVEL) {
410 if (FCHDIR(sp, sp->fts_rfd)) {
416 return (sp->fts_cur = p);
420 * User may have called fts_set on the node. If skipped,
421 * ignore. If followed, get a file descriptor so we can
422 * get back if necessary.
424 if (p->fts_instr == FTS_SKIP) {
428 if (p->fts_instr == FTS_FOLLOW) {
429 p->fts_info = fts_stat(sp, p, 1, -1);
430 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
432 _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0) {
433 p->fts_errno = errno;
434 p->fts_info = FTS_ERR;
436 p->fts_flags |= FTS_SYMFOLLOW;
438 p->fts_instr = FTS_NOINSTR;
443 name: t = sp->fts_path + NAPPEND(p->fts_parent);
445 memmove(t, p->fts_name, p->fts_namelen + 1);
446 return (sp->fts_cur = p);
449 /* Move up to the parent node. */
452 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
454 * Done; free everything up and set errno to 0 so the user
455 * can distinguish between error and EOF.
460 return (sp->fts_cur = NULL);
463 /* NUL terminate the pathname. */
464 sp->fts_path[p->fts_pathlen] = '\0';
467 * Return to the parent directory. If at a root node or came through
468 * a symlink, go back through the file descriptor. Otherwise, cd up
471 if (p->fts_level == FTS_ROOTLEVEL) {
472 if (FCHDIR(sp, sp->fts_rfd)) {
476 } else if (p->fts_flags & FTS_SYMFOLLOW) {
477 if (FCHDIR(sp, p->fts_symfd)) {
479 (void)_close(p->fts_symfd);
484 (void)_close(p->fts_symfd);
485 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
486 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(FTS *sp, FTSENT *p, int instr)
505 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
506 instr != FTS_NOINSTR && instr != FTS_SKIP) {
510 p->fts_instr = instr;
515 fts_children(FTS *sp, int instr)
520 if (instr != 0 && instr != FTS_NAMEONLY) {
525 /* Set current node pointer. */
529 * Errno set to 0 so user can distinguish empty directory from
534 /* Fatal errors stop here. */
538 /* Return logical hierarchy of user's arguments. */
539 if (p->fts_info == FTS_INIT)
540 return (p->fts_link);
543 * If not a directory being visited in pre-order, stop here. Could
544 * allow FTS_DNR, assuming the user has fixed the problem, but the
545 * same effect is available with FTS_AGAIN.
547 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
550 /* Free up any previous child list. */
551 if (sp->fts_child != NULL)
552 fts_lfree(sp->fts_child);
554 if (instr == FTS_NAMEONLY) {
561 * If using chdir on a relative path and called BEFORE fts_read does
562 * its chdir to the root of a traversal, we can lose -- we need to
563 * chdir into the subdirectory, and we don't know where the current
564 * directory is, so we can't get back so that the upcoming chdir by
565 * fts_read will work.
567 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
569 return (sp->fts_child = fts_build(sp, instr));
571 if ((fd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
573 sp->fts_child = fts_build(sp, instr);
574 serrno = (sp->fts_child == NULL) ? errno : 0;
576 if (rc < 0 && serrno == 0)
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.
628 fts_build(FTS *sp, int type)
636 int cderrno, descend, oflag, saved_errno, nostat, doadjust;
638 long nlinks; /* has to be signed because -1 is a magic value */
639 size_t dnamlen, len, maxlen, nitems;
641 /* Set current node pointer. */
645 * Open the directory for reading. If this fails, we're done.
646 * If being called from fts_read, set the fts_info field.
649 if (ISSET(FTS_WHITEOUT))
650 oflag = DTF_NODUP | DTF_REWIND;
652 oflag = DTF_HIDEW | DTF_NODUP | DTF_REWIND;
654 #define __opendir2(path, flag) opendir(path)
656 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
658 cur->fts_info = FTS_DNR;
659 cur->fts_errno = errno;
665 * Nlinks is the number of possible entries of type directory in the
666 * directory if we're cheating on stat calls, 0 if we're not doing
667 * any stat calls at all, -1 if we're doing stats on everything.
669 if (type == BNAMES) {
671 /* Be quiet about nostat, GCC. */
673 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
674 if (fts_ufslinks(sp, cur))
675 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
685 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
686 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
687 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
690 * If we're going to need to stat anything or we want to descend
691 * and stay in the directory, chdir. If this fails we keep going,
692 * but set a flag so we don't chdir after the post-order visit.
693 * We won't be able to stat anything, but we can still return the
694 * names themselves. Note, that since fts_read won't be able to
695 * chdir into the directory, it will have to return different path
696 * names than before, i.e. "a/b" instead of "b". Since the node
697 * has already been visited in pre-order, have to wait until the
698 * post-order visit to return the error. There is a special case
699 * here, if there was nothing to stat then it's not an error to
700 * not be able to stat. This is all fairly nasty. If a program
701 * needed sorted entries or stat information, they had better be
702 * checking FTS_NS on the returned nodes.
705 if (nlinks || type == BREAD) {
706 if (fts_safe_changedir(sp, cur, _dirfd(dirp), NULL)) {
707 if (nlinks && type == BREAD)
708 cur->fts_errno = errno;
709 cur->fts_flags |= FTS_DONTCHDIR;
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 dnamlen = dp->d_namlen;
744 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
747 if ((p = fts_alloc(sp, dp->d_name, dnamlen)) == NULL)
749 if (dnamlen >= maxlen) { /* include space for NUL */
750 oldaddr = sp->fts_path;
751 if (fts_palloc(sp, dnamlen + len + 1)) {
753 * No more memory for path or structures. Save
754 * errno, free up the current structure and the
755 * structures already allocated.
757 mem1: saved_errno = errno;
761 (void)closedir(dirp);
762 cur->fts_info = FTS_ERR;
767 /* Did realloc() change the pointer? */
768 if (oldaddr != sp->fts_path) {
770 if (ISSET(FTS_NOCHDIR))
771 cp = sp->fts_path + len;
773 maxlen = sp->fts_pathlen - len;
776 p->fts_level = level;
777 p->fts_parent = sp->fts_cur;
778 p->fts_pathlen = len + dnamlen;
781 if (dp->d_type == DT_WHT)
782 p->fts_flags |= FTS_ISW;
787 p->fts_info = FTS_NS;
788 p->fts_errno = cderrno;
790 p->fts_info = FTS_NSOK;
791 p->fts_accpath = cur->fts_accpath;
792 } else if (nlinks == 0
795 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
799 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
800 p->fts_info = FTS_NSOK;
802 /* Build a file name for fts_stat to stat. */
803 if (ISSET(FTS_NOCHDIR)) {
804 p->fts_accpath = p->fts_path;
805 memmove(cp, p->fts_name, p->fts_namelen + 1);
806 p->fts_info = fts_stat(sp, p, 0, _dirfd(dirp));
808 p->fts_accpath = p->fts_name;
809 p->fts_info = fts_stat(sp, p, 0, -1);
812 /* Decrement link count if applicable. */
813 if (nlinks > 0 && (p->fts_info == FTS_D ||
814 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
818 /* We walk in directory order so "ls -f" doesn't get upset. */
829 (void)closedir(dirp);
832 * If realloc() changed the address of the path, adjust the
833 * addresses for the rest of the tree and the dir list.
836 fts_padjust(sp, head);
839 * If not changing directories, reset the path back to original
842 if (ISSET(FTS_NOCHDIR))
843 sp->fts_path[cur->fts_pathlen] = '\0';
846 * If descended after called from fts_children or after called from
847 * fts_read and nothing found, get back. At the root level we use
848 * the saved fd; if one of fts_open()'s arguments is a relative path
849 * to an empty directory, we wind up here with no other way back. If
850 * can't get back, we're done.
852 if (descend && (type == BCHILD || !nitems) &&
853 (cur->fts_level == FTS_ROOTLEVEL ?
854 FCHDIR(sp, sp->fts_rfd) :
855 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
856 cur->fts_info = FTS_ERR;
861 /* If didn't find anything, return NULL. */
864 cur->fts_info = FTS_DP;
868 /* Sort the entries. */
869 if (sp->fts_compar && nitems > 1)
870 head = fts_sort(sp, head, nitems);
875 fts_stat(FTS *sp, FTSENT *p, int follow, int dfd)
880 struct stat *sbp, sb;
885 path = p->fts_accpath, dfd = AT_FDCWD;
889 /* If user needs stat info, stat buffer already allocated. */
890 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
893 /* Check for whiteout. */
894 if (p->fts_flags & FTS_ISW) {
896 memset(sbp, '\0', sizeof(*sbp));
897 sbp->st_mode = S_IFWHT;
904 * If doing a logical walk, or application requested FTS_FOLLOW, do
905 * a stat(2). If that fails, check for a non-existent symlink. If
906 * fail, set the errno from the stat call.
908 if (ISSET(FTS_LOGICAL) || follow) {
909 if (fstatat(dfd, path, sbp, 0)) {
911 if (fstatat(dfd, path, sbp, AT_SYMLINK_NOFOLLOW)) {
912 p->fts_errno = saved_errno;
916 if (S_ISLNK(sbp->st_mode))
919 } else if (fstatat(dfd, path, sbp, AT_SYMLINK_NOFOLLOW)) {
920 p->fts_errno = errno;
921 err: memset(sbp, 0, sizeof(struct stat));
925 if (S_ISDIR(sbp->st_mode)) {
927 * Set the device/inode. Used to find cycles and check for
928 * crossing mount points. Also remember the link count, used
929 * in fts_build to limit the number of stat calls. It is
930 * understood that these fields are only referenced if fts_info
933 dev = p->fts_dev = sbp->st_dev;
934 ino = p->fts_ino = sbp->st_ino;
935 p->fts_nlink = sbp->st_nlink;
937 if (ISDOT(p->fts_name))
941 * Cycle detection is done by brute force when the directory
942 * is first encountered. If the tree gets deep enough or the
943 * number of symbolic links to directories is high enough,
944 * something faster might be worthwhile.
946 for (t = p->fts_parent;
947 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
948 if (ino == t->fts_ino && dev == t->fts_dev) {
954 if (S_ISLNK(sbp->st_mode))
956 if (S_ISREG(sbp->st_mode))
958 return (FTS_DEFAULT);
962 * The comparison function takes pointers to pointers to FTSENT structures.
963 * Qsort wants a comparison function that takes pointers to void.
964 * (Both with appropriate levels of const-poisoning, of course!)
965 * Use a trampoline function to deal with the difference.
968 fts_compar(const void *a, const void *b)
972 parent = (*(const FTSENT * const *)a)->fts_fts;
973 return (*parent->fts_compar)(a, b);
977 fts_sort(FTS *sp, FTSENT *head, size_t nitems)
982 * Construct an array of pointers to the structures and call qsort(3).
983 * Reassemble the array in the order returned by qsort. If unable to
984 * sort for memory reasons, return the directory entries in their
985 * current order. Allocate enough space for the current needs plus
986 * 40 so don't realloc one entry at a time.
988 if (nitems > sp->fts_nitems) {
989 sp->fts_nitems = nitems + 40;
990 if ((sp->fts_array = reallocf(sp->fts_array,
991 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
996 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
998 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
999 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1000 ap[0]->fts_link = ap[1];
1001 ap[0]->fts_link = NULL;
1006 fts_alloc(FTS *sp, char *name, size_t namelen)
1011 struct ftsent_withstat {
1013 struct stat statbuf;
1017 * The file name is a variable length array and no stat structure is
1018 * necessary if the user has set the nostat bit. Allocate the FTSENT
1019 * structure, the file name and the stat structure in one chunk, but
1020 * be careful that the stat structure is reasonably aligned.
1022 if (ISSET(FTS_NOSTAT))
1023 len = sizeof(FTSENT) + namelen + 1;
1025 len = sizeof(struct ftsent_withstat) + namelen + 1;
1027 if ((p = malloc(len)) == NULL)
1030 if (ISSET(FTS_NOSTAT)) {
1031 p->fts_name = (char *)(p + 1);
1032 p->fts_statp = NULL;
1034 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1035 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1038 /* Copy the name and guarantee NUL termination. */
1039 memcpy(p->fts_name, name, namelen);
1040 p->fts_name[namelen] = '\0';
1041 p->fts_namelen = namelen;
1042 p->fts_path = sp->fts_path;
1045 p->fts_instr = FTS_NOINSTR;
1047 p->fts_pointer = NULL;
1053 fts_lfree(FTSENT *head)
1057 /* Free a linked list of structures. */
1058 while ((p = head)) {
1059 head = head->fts_link;
1065 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1066 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1067 * though the kernel won't resolve them. Add the size (not just what's needed)
1068 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1071 fts_palloc(FTS *sp, size_t more)
1074 sp->fts_pathlen += more + 256;
1075 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1076 return (sp->fts_path == NULL);
1080 * When the path is realloc'd, have to fix all of the pointers in structures
1084 fts_padjust(FTS *sp, FTSENT *head)
1087 char *addr = sp->fts_path;
1089 #define ADJUST(p) do { \
1090 if ((p)->fts_accpath != (p)->fts_name) { \
1091 (p)->fts_accpath = \
1092 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1094 (p)->fts_path = addr; \
1096 /* Adjust the current set of children. */
1097 for (p = sp->fts_child; p; p = p->fts_link)
1100 /* Adjust the rest of the tree, including the current level. */
1101 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1103 p = p->fts_link ? p->fts_link : p->fts_parent;
1113 for (max = 0; *argv; ++argv)
1114 if ((len = strlen(*argv)) > max)
1120 * Change to dir specified by fd or p->fts_accpath without getting
1121 * tricked by someone changing the world out from underneath us.
1122 * Assumes p->fts_dev and p->fts_ino are filled in.
1125 fts_safe_changedir(FTS *sp, FTSENT *p, int fd, char *path)
1127 int ret, oerrno, newfd;
1131 if (ISSET(FTS_NOCHDIR))
1133 if (fd < 0 && (newfd = _open(path, O_RDONLY | O_DIRECTORY |
1136 if (_fstat(newfd, &sb)) {
1140 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1141 errno = ENOENT; /* disinformation */
1145 ret = fchdir(newfd);
1149 (void)_close(newfd);
1155 * Check if the filesystem for "ent" has UFS-style links.
1158 fts_ufslinks(FTS *sp, const FTSENT *ent)
1160 struct _fts_private *priv;
1163 priv = (struct _fts_private *)sp;
1165 * If this node's device is different from the previous, grab
1166 * the filesystem information, and decide on the reliability
1167 * of the link information from this filesystem for stat(2)
1170 if (priv->ftsp_dev != ent->fts_dev) {
1171 if (statfs(ent->fts_path, &priv->ftsp_statfs) != -1) {
1172 priv->ftsp_dev = ent->fts_dev;
1173 priv->ftsp_linksreliable = 0;
1174 for (cpp = ufslike_filesystems; *cpp; cpp++) {
1175 if (strcmp(priv->ftsp_statfs.f_fstypename,
1177 priv->ftsp_linksreliable = 1;
1182 priv->ftsp_linksreliable = 0;
1185 return (priv->ftsp_linksreliable);