2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1990, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * $OpenBSD: fts.c,v 1.22 1999/10/03 19:22:22 millert Exp $
34 #include "namespace.h"
35 #include <sys/param.h>
36 #include <sys/mount.h>
46 #include "un-namespace.h"
48 #include "gen-private.h"
50 static FTSENT *fts_alloc(FTS *, char *, size_t);
51 static FTSENT *fts_build(FTS *, int);
52 static void fts_lfree(FTSENT *);
53 static void fts_load(FTS *, FTSENT *);
54 static size_t fts_maxarglen(char * const *);
55 static void fts_padjust(FTS *, FTSENT *);
56 static int fts_palloc(FTS *, size_t);
57 static FTSENT *fts_sort(FTS *, FTSENT *, size_t);
58 static int fts_stat(FTS *, FTSENT *, int, int);
59 static int fts_safe_changedir(FTS *, FTSENT *, int, char *);
60 static int fts_ufslinks(FTS *, const FTSENT *);
62 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
64 #define CLR(opt) (sp->fts_options &= ~(opt))
65 #define ISSET(opt) (sp->fts_options & (opt))
66 #define SET(opt) (sp->fts_options |= (opt))
68 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
71 #define BCHILD 1 /* fts_children */
72 #define BNAMES 2 /* fts_children, names only */
73 #define BREAD 3 /* fts_read */
76 * Internal representation of an FTS, including extra implementation
77 * details. The FTS returned from fts_open points to this structure's
78 * ftsp_fts member (and can be cast to an _fts_private as required)
82 struct statfs ftsp_statfs;
84 int ftsp_linksreliable;
88 * The "FTS_NOSTAT" option can avoid a lot of calls to stat(2) if it
89 * knows that a directory could not possibly have subdirectories. This
90 * is decided by looking at the link count: a subdirectory would
91 * increment its parent's link count by virtue of its own ".." entry.
92 * This assumption only holds for UFS-like filesystems that implement
93 * links and directories this way, so we must punt for others.
96 static const char *ufslike_filesystems[] = {
105 fts_open(char * const *argv, int options,
106 int (*compar)(const FTSENT * const *, const FTSENT * const *))
108 struct _fts_private *priv;
111 FTSENT *parent, *tmp;
115 if (options & ~FTS_OPTIONMASK) {
120 /* fts_open() requires at least one path */
126 /* Allocate/initialize the stream. */
127 if ((priv = calloc(1, sizeof(*priv))) == NULL)
129 sp = &priv->ftsp_fts;
130 sp->fts_compar = compar;
131 sp->fts_options = options;
133 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
134 if (ISSET(FTS_LOGICAL))
138 * Start out with 1K of path space, and enough, in any case,
139 * to hold the user's paths.
141 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
144 /* Allocate/initialize root's parent. */
145 if ((parent = fts_alloc(sp, "", 0)) == NULL)
147 parent->fts_level = FTS_ROOTPARENTLEVEL;
152 /* Allocate/initialize root(s). */
153 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
156 p = fts_alloc(sp, *argv, len);
157 p->fts_level = FTS_ROOTLEVEL;
158 p->fts_parent = parent;
159 p->fts_accpath = p->fts_name;
160 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW), -1);
162 /* Command-line "." and ".." are real directories. */
163 if (p->fts_info == FTS_DOT)
167 * If comparison routine supplied, traverse in sorted
168 * order; otherwise traverse in the order specified.
183 if (compar && nitems > 1)
184 root = fts_sort(sp, root, nitems);
187 * Allocate a dummy pointer and make fts_read think that we've just
188 * finished the node before the root(s); set p->fts_info to FTS_INIT
189 * so that everything about the "current" node is ignored.
191 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
193 sp->fts_cur->fts_link = root;
194 sp->fts_cur->fts_info = FTS_INIT;
197 * If using chdir(2), grab a file descriptor pointing to dot to ensure
198 * that we can get back here; this could be avoided for some paths,
199 * but almost certainly not worth the effort. Slashes, symbolic links,
200 * and ".." are all fairly nasty problems. Note, if we can't get the
201 * descriptor we run anyway, just more slowly.
203 if (!ISSET(FTS_NOCHDIR) &&
204 (sp->fts_rfd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
209 mem3: fts_lfree(root);
211 mem2: free(sp->fts_path);
217 fts_load(FTS *sp, FTSENT *p)
223 * Load the stream structure for the next traversal. Since we don't
224 * actually enter the directory until after the preorder visit, set
225 * the fts_accpath field specially so the chdir gets done to the right
226 * place and the user can access the first node. From fts_open it's
227 * known that the path will fit.
229 len = p->fts_pathlen = p->fts_namelen;
230 memmove(sp->fts_path, p->fts_name, len + 1);
231 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
233 memmove(p->fts_name, cp, len + 1);
234 p->fts_namelen = len;
236 p->fts_accpath = p->fts_path = sp->fts_path;
237 sp->fts_dev = p->fts_dev;
247 * This still works if we haven't read anything -- the dummy structure
248 * points to the root list, so we step through to the end of the root
249 * list which has a valid parent pointer.
252 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
254 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
260 /* Free up child linked list, sort array, path buffer. */
262 fts_lfree(sp->fts_child);
267 /* Return to original directory, save errno if necessary. */
268 if (!ISSET(FTS_NOCHDIR)) {
269 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
270 (void)_close(sp->fts_rfd);
272 /* Set errno and return. */
273 if (saved_errno != 0) {
274 /* Free up the stream pointer. */
281 /* Free up the stream pointer. */
287 * Special case of "/" at the end of the path so that slashes aren't
288 * appended which would cause paths to be written as "....//foo".
291 (p->fts_path[p->fts_pathlen - 1] == '/' \
292 ? p->fts_pathlen - 1 : p->fts_pathlen)
302 /* If finished or unrecoverable error, return NULL. */
303 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
306 /* Set current node pointer. */
309 /* Save and zero out user instructions. */
310 instr = p->fts_instr;
311 p->fts_instr = FTS_NOINSTR;
313 /* Any type of file may be re-visited; re-stat and re-turn. */
314 if (instr == FTS_AGAIN) {
315 p->fts_info = fts_stat(sp, p, 0, -1);
320 * Following a symlink -- SLNONE test allows application to see
321 * SLNONE and recover. If indirecting through a symlink, have
322 * keep a pointer to current location. If unable to get that
323 * pointer, follow fails.
325 if (instr == FTS_FOLLOW &&
326 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
327 p->fts_info = fts_stat(sp, p, 1, -1);
328 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
329 if ((p->fts_symfd = _open(".", O_RDONLY | O_CLOEXEC,
331 p->fts_errno = errno;
332 p->fts_info = FTS_ERR;
334 p->fts_flags |= FTS_SYMFOLLOW;
339 /* Directory in pre-order. */
340 if (p->fts_info == FTS_D) {
341 /* If skipped or crossed mount point, do post-order visit. */
342 if (instr == FTS_SKIP ||
343 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
344 if (p->fts_flags & FTS_SYMFOLLOW)
345 (void)_close(p->fts_symfd);
347 fts_lfree(sp->fts_child);
348 sp->fts_child = NULL;
350 p->fts_info = FTS_DP;
354 /* Rebuild if only read the names and now traversing. */
355 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
357 fts_lfree(sp->fts_child);
358 sp->fts_child = NULL;
362 * Cd to the subdirectory.
364 * If have already read and now fail to chdir, whack the list
365 * to make the names come out right, and set the parent errno
366 * so the application will eventually get an error condition.
367 * Set the FTS_DONTCHDIR flag so that when we logically change
368 * directories back to the parent we don't do a chdir.
370 * If haven't read do so. If the read fails, fts_build sets
371 * FTS_STOP or the fts_info field of the node.
373 if (sp->fts_child != NULL) {
374 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
375 p->fts_errno = errno;
376 p->fts_flags |= FTS_DONTCHDIR;
377 for (p = sp->fts_child; p != NULL;
380 p->fts_parent->fts_accpath;
382 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
388 sp->fts_child = NULL;
392 /* Move to the next node on this level. */
394 if ((p = p->fts_link) != NULL) {
396 * If reached the top, return to the original directory (or
397 * the root of the tree), and load the paths for the next root.
399 if (p->fts_level == FTS_ROOTLEVEL) {
400 if (FCHDIR(sp, sp->fts_rfd)) {
406 return (sp->fts_cur = p);
410 * User may have called fts_set on the node. If skipped,
411 * ignore. If followed, get a file descriptor so we can
412 * get back if necessary.
414 if (p->fts_instr == FTS_SKIP) {
418 if (p->fts_instr == FTS_FOLLOW) {
419 p->fts_info = fts_stat(sp, p, 1, -1);
420 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
422 _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0) {
423 p->fts_errno = errno;
424 p->fts_info = FTS_ERR;
426 p->fts_flags |= FTS_SYMFOLLOW;
428 p->fts_instr = FTS_NOINSTR;
433 name: t = sp->fts_path + NAPPEND(p->fts_parent);
435 memmove(t, p->fts_name, p->fts_namelen + 1);
436 return (sp->fts_cur = p);
439 /* Move up to the parent node. */
442 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
444 * Done; free everything up and set errno to 0 so the user
445 * can distinguish between error and EOF.
450 return (sp->fts_cur = NULL);
453 /* NUL terminate the pathname. */
454 sp->fts_path[p->fts_pathlen] = '\0';
457 * Return to the parent directory. If at a root node or came through
458 * a symlink, go back through the file descriptor. Otherwise, cd up
461 if (p->fts_level == FTS_ROOTLEVEL) {
462 if (FCHDIR(sp, sp->fts_rfd)) {
466 } else if (p->fts_flags & FTS_SYMFOLLOW) {
467 if (FCHDIR(sp, p->fts_symfd)) {
469 (void)_close(p->fts_symfd);
474 (void)_close(p->fts_symfd);
475 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
476 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
481 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
482 return (sp->fts_cur = p);
486 * Fts_set takes the stream as an argument although it's not used in this
487 * implementation; it would be necessary if anyone wanted to add global
488 * semantics to fts using fts_set. An error return is allowed for similar
493 fts_set(FTS *sp, FTSENT *p, int instr)
495 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
496 instr != FTS_NOINSTR && instr != FTS_SKIP) {
500 p->fts_instr = instr;
505 fts_children(FTS *sp, int instr)
510 if (instr != 0 && instr != FTS_NAMEONLY) {
515 /* Set current node pointer. */
519 * Errno set to 0 so user can distinguish empty directory from
524 /* Fatal errors stop here. */
528 /* Return logical hierarchy of user's arguments. */
529 if (p->fts_info == FTS_INIT)
530 return (p->fts_link);
533 * If not a directory being visited in pre-order, stop here. Could
534 * allow FTS_DNR, assuming the user has fixed the problem, but the
535 * same effect is available with FTS_AGAIN.
537 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
540 /* Free up any previous child list. */
541 if (sp->fts_child != NULL)
542 fts_lfree(sp->fts_child);
544 if (instr == FTS_NAMEONLY) {
551 * If using chdir on a relative path and called BEFORE fts_read does
552 * its chdir to the root of a traversal, we can lose -- we need to
553 * chdir into the subdirectory, and we don't know where the current
554 * directory is, so we can't get back so that the upcoming chdir by
555 * fts_read will work.
557 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
559 return (sp->fts_child = fts_build(sp, instr));
561 if ((fd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
563 sp->fts_child = fts_build(sp, instr);
564 serrno = (sp->fts_child == NULL) ? errno : 0;
566 if (rc < 0 && serrno == 0)
572 return (sp->fts_child);
575 #ifndef fts_get_clientptr
576 #error "fts_get_clientptr not defined"
580 (fts_get_clientptr)(FTS *sp)
583 return (fts_get_clientptr(sp));
586 #ifndef fts_get_stream
587 #error "fts_get_stream not defined"
591 (fts_get_stream)(FTSENT *p)
593 return (fts_get_stream(p));
597 fts_set_clientptr(FTS *sp, void *clientptr)
600 sp->fts_clientptr = clientptr;
603 static struct dirent *
604 fts_safe_readdir(DIR *dirp, int *readdir_errno)
612 *readdir_errno = errno;
617 * This is the tricky part -- do not casually change *anything* in here. The
618 * idea is to build the linked list of entries that are used by fts_children
619 * and fts_read. There are lots of special cases.
621 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
622 * set and it's a physical walk (so that symbolic links can't be directories),
623 * we can do things quickly. First, if it's a 4.4BSD file system, the type
624 * of the file is in the directory entry. Otherwise, we assume that the number
625 * of subdirectories in a node is equal to the number of links to the parent.
626 * The former skips all stat calls. The latter skips stat calls in any leaf
627 * directories and for any files after the subdirectories in the directory have
628 * been found, cutting the stat calls by about 2/3.
631 fts_build(FTS *sp, int type)
639 int cderrno, descend, oflag, saved_errno, nostat, doadjust,
642 long nlinks; /* has to be signed because -1 is a magic value */
643 size_t dnamlen, len, maxlen, nitems;
645 /* Set current node pointer. */
649 * Open the directory for reading. If this fails, we're done.
650 * If being called from fts_read, set the fts_info field.
653 if (ISSET(FTS_WHITEOUT))
656 oflag = DTF_HIDEW | DTF_NODUP;
658 #define __opendir2(path, flag) opendir(path)
660 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
662 cur->fts_info = FTS_DNR;
663 cur->fts_errno = errno;
669 * Nlinks is the number of possible entries of type directory in the
670 * directory if we're cheating on stat calls, 0 if we're not doing
671 * any stat calls at all, -1 if we're doing stats on everything.
673 if (type == BNAMES) {
675 /* Be quiet about nostat, GCC. */
677 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
678 if (fts_ufslinks(sp, cur))
679 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
689 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
690 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
691 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
694 * If we're going to need to stat anything or we want to descend
695 * and stay in the directory, chdir. If this fails we keep going,
696 * but set a flag so we don't chdir after the post-order visit.
697 * We won't be able to stat anything, but we can still return the
698 * names themselves. Note, that since fts_read won't be able to
699 * chdir into the directory, it will have to return different path
700 * names than before, i.e. "a/b" instead of "b". Since the node
701 * has already been visited in pre-order, have to wait until the
702 * post-order visit to return the error. There is a special case
703 * here, if there was nothing to stat then it's not an error to
704 * not be able to stat. This is all fairly nasty. If a program
705 * needed sorted entries or stat information, they had better be
706 * checking FTS_NS on the returned nodes.
709 if (nlinks || type == BREAD) {
710 if (fts_safe_changedir(sp, cur, _dirfd(dirp), NULL)) {
711 if (nlinks && type == BREAD)
712 cur->fts_errno = errno;
713 cur->fts_flags |= FTS_DONTCHDIR;
722 * Figure out the max file name length that can be stored in the
723 * current path -- the inner loop allocates more path as necessary.
724 * We really wouldn't have to do the maxlen calculations here, we
725 * could do them in fts_read before returning the path, but it's a
726 * lot easier here since the length is part of the dirent structure.
728 * If not changing directories set a pointer so that can just append
729 * each new name into the path.
732 if (ISSET(FTS_NOCHDIR)) {
733 cp = sp->fts_path + len;
736 /* GCC, you're too verbose. */
740 maxlen = sp->fts_pathlen - len;
742 level = cur->fts_level + 1;
744 /* Read the directory, attaching each entry to the `link' pointer. */
747 for (head = tail = NULL, nitems = 0;
748 (dp = fts_safe_readdir(dirp, &readdir_errno));) {
749 dnamlen = dp->d_namlen;
750 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
753 if ((p = fts_alloc(sp, dp->d_name, dnamlen)) == NULL)
755 if (dnamlen >= maxlen) { /* include space for NUL */
756 oldaddr = sp->fts_path;
757 if (fts_palloc(sp, dnamlen + len + 1)) {
759 * No more memory for path or structures. Save
760 * errno, free up the current structure and the
761 * structures already allocated.
763 mem1: saved_errno = errno;
767 (void)closedir(dirp);
768 cur->fts_info = FTS_ERR;
773 /* Did realloc() change the pointer? */
774 if (oldaddr != sp->fts_path) {
776 if (ISSET(FTS_NOCHDIR))
777 cp = sp->fts_path + len;
779 maxlen = sp->fts_pathlen - len;
782 p->fts_level = level;
783 p->fts_parent = sp->fts_cur;
784 p->fts_pathlen = len + dnamlen;
787 if (dp->d_type == DT_WHT)
788 p->fts_flags |= FTS_ISW;
793 p->fts_info = FTS_NS;
794 p->fts_errno = cderrno;
796 p->fts_info = FTS_NSOK;
797 p->fts_accpath = cur->fts_accpath;
798 } else if (nlinks == 0
801 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
805 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
806 p->fts_info = FTS_NSOK;
808 /* Build a file name for fts_stat to stat. */
809 if (ISSET(FTS_NOCHDIR)) {
810 p->fts_accpath = p->fts_path;
811 memmove(cp, p->fts_name, p->fts_namelen + 1);
812 p->fts_info = fts_stat(sp, p, 0, _dirfd(dirp));
814 p->fts_accpath = p->fts_name;
815 p->fts_info = fts_stat(sp, p, 0, -1);
818 /* Decrement link count if applicable. */
819 if (nlinks > 0 && (p->fts_info == FTS_D ||
820 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
824 /* We walk in directory order so "ls -f" doesn't get upset. */
836 cur->fts_errno = readdir_errno;
838 * If we've not read any items yet, treat
839 * the error as if we can't access the dir.
841 cur->fts_info = nitems ? FTS_ERR : FTS_DNR;
845 (void)closedir(dirp);
848 * If realloc() changed the address of the path, adjust the
849 * addresses for the rest of the tree and the dir list.
852 fts_padjust(sp, head);
855 * If not changing directories, reset the path back to original
858 if (ISSET(FTS_NOCHDIR))
859 sp->fts_path[cur->fts_pathlen] = '\0';
862 * If descended after called from fts_children or after called from
863 * fts_read and nothing found, get back. At the root level we use
864 * the saved fd; if one of fts_open()'s arguments is a relative path
865 * to an empty directory, we wind up here with no other way back. If
866 * can't get back, we're done.
868 if (descend && (type == BCHILD || !nitems) &&
869 (cur->fts_level == FTS_ROOTLEVEL ?
870 FCHDIR(sp, sp->fts_rfd) :
871 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
873 cur->fts_info = FTS_ERR;
878 /* If didn't find anything, return NULL. */
881 cur->fts_info != FTS_DNR && cur->fts_info != FTS_ERR)
882 cur->fts_info = FTS_DP;
886 /* Sort the entries. */
887 if (sp->fts_compar && nitems > 1)
888 head = fts_sort(sp, head, nitems);
893 fts_stat(FTS *sp, FTSENT *p, int follow, int dfd)
898 struct stat *sbp, sb;
903 path = p->fts_accpath, dfd = AT_FDCWD;
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 (fstatat(dfd, path, sbp, 0)) {
929 if (fstatat(dfd, path, sbp, AT_SYMLINK_NOFOLLOW)) {
930 p->fts_errno = saved_errno;
934 if (S_ISLNK(sbp->st_mode))
937 } else if (fstatat(dfd, path, sbp, AT_SYMLINK_NOFOLLOW)) {
938 p->fts_errno = errno;
939 err: memset(sbp, 0, sizeof(struct stat));
943 if (S_ISDIR(sbp->st_mode)) {
945 * Set the device/inode. Used to find cycles and check for
946 * crossing mount points. Also remember the link count, used
947 * in fts_build to limit the number of stat calls. It is
948 * understood that these fields are only referenced if fts_info
951 dev = p->fts_dev = sbp->st_dev;
952 ino = p->fts_ino = sbp->st_ino;
953 p->fts_nlink = sbp->st_nlink;
955 if (ISDOT(p->fts_name))
959 * Cycle detection is done by brute force when the directory
960 * is first encountered. If the tree gets deep enough or the
961 * number of symbolic links to directories is high enough,
962 * something faster might be worthwhile.
964 for (t = p->fts_parent;
965 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
966 if (ino == t->fts_ino && dev == t->fts_dev) {
972 if (S_ISLNK(sbp->st_mode))
974 if (S_ISREG(sbp->st_mode))
976 return (FTS_DEFAULT);
980 * The comparison function takes pointers to pointers to FTSENT structures.
981 * Qsort wants a comparison function that takes pointers to void.
982 * (Both with appropriate levels of const-poisoning, of course!)
983 * Use a trampoline function to deal with the difference.
986 fts_compar(const void *a, const void *b)
990 parent = (*(const FTSENT * const *)a)->fts_fts;
991 return (*parent->fts_compar)(a, b);
995 fts_sort(FTS *sp, FTSENT *head, size_t nitems)
1000 * Construct an array of pointers to the structures and call qsort(3).
1001 * Reassemble the array in the order returned by qsort. If unable to
1002 * sort for memory reasons, return the directory entries in their
1003 * current order. Allocate enough space for the current needs plus
1004 * 40 so don't realloc one entry at a time.
1006 if (nitems > sp->fts_nitems) {
1007 sp->fts_nitems = nitems + 40;
1008 if ((sp->fts_array = reallocf(sp->fts_array,
1009 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
1014 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
1016 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
1017 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1018 ap[0]->fts_link = ap[1];
1019 ap[0]->fts_link = NULL;
1024 fts_alloc(FTS *sp, char *name, size_t namelen)
1029 struct ftsent_withstat {
1031 struct stat statbuf;
1035 * The file name is a variable length array and no stat structure is
1036 * necessary if the user has set the nostat bit. Allocate the FTSENT
1037 * structure, the file name and the stat structure in one chunk, but
1038 * be careful that the stat structure is reasonably aligned.
1040 if (ISSET(FTS_NOSTAT))
1041 len = sizeof(FTSENT) + namelen + 1;
1043 len = sizeof(struct ftsent_withstat) + namelen + 1;
1045 if ((p = malloc(len)) == NULL)
1048 if (ISSET(FTS_NOSTAT)) {
1049 p->fts_name = (char *)(p + 1);
1050 p->fts_statp = NULL;
1052 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1053 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1056 /* Copy the name and guarantee NUL termination. */
1057 memcpy(p->fts_name, name, namelen);
1058 p->fts_name[namelen] = '\0';
1059 p->fts_namelen = namelen;
1060 p->fts_path = sp->fts_path;
1063 p->fts_instr = FTS_NOINSTR;
1065 p->fts_pointer = NULL;
1071 fts_lfree(FTSENT *head)
1075 /* Free a linked list of structures. */
1076 while ((p = head)) {
1077 head = head->fts_link;
1083 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1084 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1085 * though the kernel won't resolve them. Add the size (not just what's needed)
1086 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1089 fts_palloc(FTS *sp, size_t more)
1092 sp->fts_pathlen += more + 256;
1093 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1094 return (sp->fts_path == NULL);
1098 * When the path is realloc'd, have to fix all of the pointers in structures
1102 fts_padjust(FTS *sp, FTSENT *head)
1105 char *addr = sp->fts_path;
1107 #define ADJUST(p) do { \
1108 if ((p)->fts_accpath != (p)->fts_name) { \
1109 (p)->fts_accpath = \
1110 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1112 (p)->fts_path = addr; \
1114 /* Adjust the current set of children. */
1115 for (p = sp->fts_child; p; p = p->fts_link)
1118 /* Adjust the rest of the tree, including the current level. */
1119 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1121 p = p->fts_link ? p->fts_link : p->fts_parent;
1126 fts_maxarglen(char * const *argv)
1130 for (max = 0; *argv; ++argv)
1131 if ((len = strlen(*argv)) > max)
1137 * Change to dir specified by fd or p->fts_accpath without getting
1138 * tricked by someone changing the world out from underneath us.
1139 * Assumes p->fts_dev and p->fts_ino are filled in.
1142 fts_safe_changedir(FTS *sp, FTSENT *p, int fd, char *path)
1144 int ret, oerrno, newfd;
1148 if (ISSET(FTS_NOCHDIR))
1150 if (fd < 0 && (newfd = _open(path, O_RDONLY | O_DIRECTORY |
1153 if (_fstat(newfd, &sb)) {
1157 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1158 errno = ENOENT; /* disinformation */
1162 ret = fchdir(newfd);
1166 (void)_close(newfd);
1172 * Check if the filesystem for "ent" has UFS-style links.
1175 fts_ufslinks(FTS *sp, const FTSENT *ent)
1177 struct _fts_private *priv;
1180 priv = (struct _fts_private *)sp;
1182 * If this node's device is different from the previous, grab
1183 * the filesystem information, and decide on the reliability
1184 * of the link information from this filesystem for stat(2)
1187 if (priv->ftsp_dev != ent->fts_dev) {
1188 if (statfs(ent->fts_path, &priv->ftsp_statfs) != -1) {
1189 priv->ftsp_dev = ent->fts_dev;
1190 priv->ftsp_linksreliable = 0;
1191 for (cpp = ufslike_filesystems; *cpp; cpp++) {
1192 if (strcmp(priv->ftsp_statfs.f_fstypename,
1194 priv->ftsp_linksreliable = 1;
1199 priv->ftsp_linksreliable = 0;
1202 return (priv->ftsp_linksreliable);