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>
52 #include "fts-compat.h"
53 #include "un-namespace.h"
55 FTSENT *__fts_children_44bsd(FTS *, int);
56 int __fts_close_44bsd(FTS *);
57 void *__fts_get_clientptr_44bsd(FTS *);
58 FTS *__fts_get_stream_44bsd(FTSENT *);
59 FTS *__fts_open_44bsd(char * const *, int,
60 int (*)(const FTSENT * const *, const FTSENT * const *));
61 FTSENT *__fts_read_44bsd(FTS *);
62 int __fts_set_44bsd(FTS *, FTSENT *, int);
63 void __fts_set_clientptr_44bsd(FTS *, void *);
65 static FTSENT *fts_alloc(FTS *, char *, int);
66 static FTSENT *fts_build(FTS *, int);
67 static void fts_lfree(FTSENT *);
68 static void fts_load(FTS *, FTSENT *);
69 static size_t fts_maxarglen(char * const *);
70 static void fts_padjust(FTS *, FTSENT *);
71 static int fts_palloc(FTS *, size_t);
72 static FTSENT *fts_sort(FTS *, FTSENT *, int);
73 static u_short fts_stat(FTS *, FTSENT *, int);
74 static int fts_safe_changedir(FTS *, FTSENT *, int, char *);
75 static int fts_ufslinks(FTS *, const FTSENT *);
77 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
79 #define CLR(opt) (sp->fts_options &= ~(opt))
80 #define ISSET(opt) (sp->fts_options & (opt))
81 #define SET(opt) (sp->fts_options |= (opt))
83 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
86 #define BCHILD 1 /* fts_children */
87 #define BNAMES 2 /* fts_children, names only */
88 #define BREAD 3 /* fts_read */
91 * Internal representation of an FTS, including extra implementation
92 * details. The FTS returned from fts_open points to this structure's
93 * ftsp_fts member (and can be cast to an _fts_private as required)
97 struct statfs ftsp_statfs;
99 int ftsp_linksreliable;
103 * The "FTS_NOSTAT" option can avoid a lot of calls to stat(2) if it
104 * knows that a directory could not possibly have subdirectories. This
105 * is decided by looking at the link count: a subdirectory would
106 * increment its parent's link count by virtue of its own ".." entry.
107 * This assumption only holds for UFS-like filesystems that implement
108 * links and directories this way, so we must punt for others.
111 static const char *ufslike_filesystems[] = {
121 __fts_open_44bsd(argv, options, compar)
124 int (*compar)(const FTSENT * const *, const FTSENT * const *);
126 struct _fts_private *priv;
130 FTSENT *parent, *tmp;
134 if (options & ~FTS_OPTIONMASK) {
139 /* Allocate/initialize the stream. */
140 if ((priv = malloc(sizeof(*priv))) == NULL)
142 memset(priv, 0, sizeof(*priv));
143 sp = &priv->ftsp_fts;
144 sp->fts_compar = compar;
145 sp->fts_options = options;
150 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
151 if (ISSET(FTS_LOGICAL))
155 * Start out with 1K of path space, and enough, in any case,
156 * to hold the user's paths.
158 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
161 /* Allocate/initialize root's parent. */
162 if ((parent = fts_alloc(sp, "", 0)) == NULL)
164 parent->fts_level = FTS_ROOTPARENTLEVEL;
166 /* Allocate/initialize root(s). */
167 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
168 /* Don't allow zero-length paths. */
169 if ((len = strlen(*argv)) == 0) {
174 p = fts_alloc(sp, *argv, len);
175 p->fts_level = FTS_ROOTLEVEL;
176 p->fts_parent = parent;
177 p->fts_accpath = p->fts_name;
178 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
180 /* Command-line "." and ".." are real directories. */
181 if (p->fts_info == FTS_DOT)
185 * If comparison routine supplied, traverse in sorted
186 * order; otherwise traverse in the order specified.
201 if (compar && nitems > 1)
202 root = fts_sort(sp, root, nitems);
205 * Allocate a dummy pointer and make fts_read think that we've just
206 * finished the node before the root(s); set p->fts_info to FTS_INIT
207 * so that everything about the "current" node is ignored.
209 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
211 sp->fts_cur->fts_link = root;
212 sp->fts_cur->fts_info = FTS_INIT;
215 * If using chdir(2), grab a file descriptor pointing to dot to ensure
216 * that we can get back here; this could be avoided for some paths,
217 * but almost certainly not worth the effort. Slashes, symbolic links,
218 * and ".." are all fairly nasty problems. Note, if we can't get the
219 * descriptor we run anyway, just more slowly.
221 if (!ISSET(FTS_NOCHDIR) && (sp->fts_rfd = _open(".", O_RDONLY, 0)) < 0)
226 mem3: fts_lfree(root);
228 mem2: free(sp->fts_path);
242 * Load the stream structure for the next traversal. Since we don't
243 * actually enter the directory until after the preorder visit, set
244 * the fts_accpath field specially so the chdir gets done to the right
245 * place and the user can access the first node. From fts_open it's
246 * known that the path will fit.
248 len = p->fts_pathlen = p->fts_namelen;
249 memmove(sp->fts_path, p->fts_name, len + 1);
250 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
252 memmove(p->fts_name, cp, len + 1);
253 p->fts_namelen = len;
255 p->fts_accpath = p->fts_path = sp->fts_path;
256 sp->fts_dev = p->fts_dev;
260 __fts_close_44bsd(sp)
267 * This still works if we haven't read anything -- the dummy structure
268 * points to the root list, so we step through to the end of the root
269 * list which has a valid parent pointer.
272 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
274 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
280 /* Free up child linked list, sort array, path buffer. */
282 fts_lfree(sp->fts_child);
287 /* Return to original directory, save errno if necessary. */
288 if (!ISSET(FTS_NOCHDIR)) {
289 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
290 (void)_close(sp->fts_rfd);
292 /* Set errno and return. */
293 if (saved_errno != 0) {
294 /* Free up the stream pointer. */
301 /* Free up the stream pointer. */
307 * Special case of "/" at the end of the path so that slashes aren't
308 * appended which would cause paths to be written as "....//foo".
311 (p->fts_path[p->fts_pathlen - 1] == '/' \
312 ? p->fts_pathlen - 1 : p->fts_pathlen)
323 /* If finished or unrecoverable error, return NULL. */
324 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
327 /* Set current node pointer. */
330 /* Save and zero out user instructions. */
331 instr = p->fts_instr;
332 p->fts_instr = FTS_NOINSTR;
334 /* Any type of file may be re-visited; re-stat and re-turn. */
335 if (instr == FTS_AGAIN) {
336 p->fts_info = fts_stat(sp, p, 0);
341 * Following a symlink -- SLNONE test allows application to see
342 * SLNONE and recover. If indirecting through a symlink, have
343 * keep a pointer to current location. If unable to get that
344 * pointer, follow fails.
346 if (instr == FTS_FOLLOW &&
347 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
348 p->fts_info = fts_stat(sp, p, 1);
349 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
350 if ((p->fts_symfd = _open(".", O_RDONLY, 0)) < 0) {
351 p->fts_errno = errno;
352 p->fts_info = FTS_ERR;
354 p->fts_flags |= FTS_SYMFOLLOW;
359 /* Directory in pre-order. */
360 if (p->fts_info == FTS_D) {
361 /* If skipped or crossed mount point, do post-order visit. */
362 if (instr == FTS_SKIP ||
363 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
364 if (p->fts_flags & FTS_SYMFOLLOW)
365 (void)_close(p->fts_symfd);
367 fts_lfree(sp->fts_child);
368 sp->fts_child = NULL;
370 p->fts_info = FTS_DP;
374 /* Rebuild if only read the names and now traversing. */
375 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
377 fts_lfree(sp->fts_child);
378 sp->fts_child = NULL;
382 * Cd to the subdirectory.
384 * If have already read and now fail to chdir, whack the list
385 * to make the names come out right, and set the parent errno
386 * so the application will eventually get an error condition.
387 * Set the FTS_DONTCHDIR flag so that when we logically change
388 * directories back to the parent we don't do a chdir.
390 * If haven't read do so. If the read fails, fts_build sets
391 * FTS_STOP or the fts_info field of the node.
393 if (sp->fts_child != NULL) {
394 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
395 p->fts_errno = errno;
396 p->fts_flags |= FTS_DONTCHDIR;
397 for (p = sp->fts_child; p != NULL;
400 p->fts_parent->fts_accpath;
402 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
408 sp->fts_child = NULL;
412 /* Move to the next node on this level. */
414 if ((p = p->fts_link) != NULL) {
418 * If reached the top, return to the original directory (or
419 * the root of the tree), and load the paths for the next root.
421 if (p->fts_level == FTS_ROOTLEVEL) {
422 if (FCHDIR(sp, sp->fts_rfd)) {
427 return (sp->fts_cur = p);
431 * User may have called fts_set on the node. If skipped,
432 * ignore. If followed, get a file descriptor so we can
433 * get back if necessary.
435 if (p->fts_instr == FTS_SKIP)
437 if (p->fts_instr == FTS_FOLLOW) {
438 p->fts_info = fts_stat(sp, p, 1);
439 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
441 _open(".", O_RDONLY, 0)) < 0) {
442 p->fts_errno = errno;
443 p->fts_info = FTS_ERR;
445 p->fts_flags |= FTS_SYMFOLLOW;
447 p->fts_instr = FTS_NOINSTR;
450 name: t = sp->fts_path + NAPPEND(p->fts_parent);
452 memmove(t, p->fts_name, p->fts_namelen + 1);
453 return (sp->fts_cur = p);
456 /* Move up to the parent node. */
460 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
462 * Done; free everything up and set errno to 0 so the user
463 * can distinguish between error and EOF.
467 return (sp->fts_cur = NULL);
470 /* NUL terminate the pathname. */
471 sp->fts_path[p->fts_pathlen] = '\0';
474 * Return to the parent directory. If at a root node or came through
475 * a symlink, go back through the file descriptor. Otherwise, cd up
478 if (p->fts_level == FTS_ROOTLEVEL) {
479 if (FCHDIR(sp, sp->fts_rfd)) {
483 } else if (p->fts_flags & FTS_SYMFOLLOW) {
484 if (FCHDIR(sp, p->fts_symfd)) {
486 (void)_close(p->fts_symfd);
491 (void)_close(p->fts_symfd);
492 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
493 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
497 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
498 return (sp->fts_cur = p);
502 * Fts_set takes the stream as an argument although it's not used in this
503 * implementation; it would be necessary if anyone wanted to add global
504 * semantics to fts using fts_set. An error return is allowed for similar
509 __fts_set_44bsd(sp, p, instr)
514 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
515 instr != FTS_NOINSTR && instr != FTS_SKIP) {
519 p->fts_instr = instr;
524 __fts_children_44bsd(sp, instr)
531 if (instr != 0 && instr != FTS_NAMEONLY) {
536 /* Set current node pointer. */
540 * Errno set to 0 so user can distinguish empty directory from
545 /* Fatal errors stop here. */
549 /* Return logical hierarchy of user's arguments. */
550 if (p->fts_info == FTS_INIT)
551 return (p->fts_link);
554 * If not a directory being visited in pre-order, stop here. Could
555 * allow FTS_DNR, assuming the user has fixed the problem, but the
556 * same effect is available with FTS_AGAIN.
558 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
561 /* Free up any previous child list. */
562 if (sp->fts_child != NULL)
563 fts_lfree(sp->fts_child);
565 if (instr == FTS_NAMEONLY) {
572 * If using chdir on a relative path and called BEFORE fts_read does
573 * its chdir to the root of a traversal, we can lose -- we need to
574 * chdir into the subdirectory, and we don't know where the current
575 * directory is, so we can't get back so that the upcoming chdir by
576 * fts_read will work.
578 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
580 return (sp->fts_child = fts_build(sp, instr));
582 if ((fd = _open(".", O_RDONLY, 0)) < 0)
584 sp->fts_child = fts_build(sp, instr);
588 return (sp->fts_child);
591 #ifndef fts_get_clientptr
592 #error "fts_get_clientptr not defined"
596 (__fts_get_clientptr_44bsd)(FTS *sp)
599 return (fts_get_clientptr(sp));
602 #ifndef fts_get_stream
603 #error "fts_get_stream not defined"
607 (__fts_get_stream_44bsd)(FTSENT *p)
609 return (fts_get_stream(p));
613 __fts_set_clientptr_44bsd(FTS *sp, void *clientptr)
616 sp->fts_clientptr = clientptr;
620 * This is the tricky part -- do not casually change *anything* in here. The
621 * idea is to build the linked list of entries that are used by fts_children
622 * and fts_read. There are lots of special cases.
624 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
625 * set and it's a physical walk (so that symbolic links can't be directories),
626 * we can do things quickly. First, if it's a 4.4BSD file system, the type
627 * of the file is in the directory entry. Otherwise, we assume that the number
628 * of subdirectories in a node is equal to the number of links to the parent.
629 * The former skips all stat calls. The latter skips stat calls in any leaf
630 * directories and for any files after the subdirectories in the directory have
631 * been found, cutting the stat calls by about 2/3.
645 int cderrno, descend, len, level, maxlen, nlinks, oflag, saved_errno,
649 /* Set current node pointer. */
653 * Open the directory for reading. If this fails, we're done.
654 * If being called from fts_read, set the fts_info field.
657 if (ISSET(FTS_WHITEOUT))
658 oflag = DTF_NODUP | DTF_REWIND;
660 oflag = DTF_HIDEW | DTF_NODUP | DTF_REWIND;
662 #define __opendir2(path, flag) opendir(path)
664 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
666 cur->fts_info = FTS_DNR;
667 cur->fts_errno = errno;
673 * Nlinks is the number of possible entries of type directory in the
674 * directory if we're cheating on stat calls, 0 if we're not doing
675 * any stat calls at all, -1 if we're doing stats on everything.
677 if (type == BNAMES) {
679 /* Be quiet about nostat, GCC. */
681 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
682 if (fts_ufslinks(sp, cur))
683 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
693 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
694 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
695 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
698 * If we're going to need to stat anything or we want to descend
699 * and stay in the directory, chdir. If this fails we keep going,
700 * but set a flag so we don't chdir after the post-order visit.
701 * We won't be able to stat anything, but we can still return the
702 * names themselves. Note, that since fts_read won't be able to
703 * chdir into the directory, it will have to return different path
704 * names than before, i.e. "a/b" instead of "b". Since the node
705 * has already been visited in pre-order, have to wait until the
706 * post-order visit to return the error. There is a special case
707 * here, if there was nothing to stat then it's not an error to
708 * not be able to stat. This is all fairly nasty. If a program
709 * needed sorted entries or stat information, they had better be
710 * checking FTS_NS on the returned nodes.
713 if (nlinks || type == BREAD) {
714 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
715 if (nlinks && type == BREAD)
716 cur->fts_errno = errno;
717 cur->fts_flags |= FTS_DONTCHDIR;
726 * Figure out the max file name length that can be stored in the
727 * current path -- the inner loop allocates more path as necessary.
728 * We really wouldn't have to do the maxlen calculations here, we
729 * could do them in fts_read before returning the path, but it's a
730 * lot easier here since the length is part of the dirent structure.
732 * If not changing directories set a pointer so that can just append
733 * each new name into the path.
736 if (ISSET(FTS_NOCHDIR)) {
737 cp = sp->fts_path + len;
740 /* GCC, you're too verbose. */
744 maxlen = sp->fts_pathlen - len;
746 level = cur->fts_level + 1;
748 /* Read the directory, attaching each entry to the `link' pointer. */
750 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
751 dnamlen = dp->d_namlen;
752 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
755 if ((p = fts_alloc(sp, dp->d_name, (int)dnamlen)) == NULL)
757 if (dnamlen >= maxlen) { /* include space for NUL */
758 oldaddr = sp->fts_path;
759 if (fts_palloc(sp, dnamlen + len + 1)) {
761 * No more memory for path or structures. Save
762 * errno, free up the current structure and the
763 * structures already allocated.
765 mem1: saved_errno = errno;
769 (void)closedir(dirp);
770 cur->fts_info = FTS_ERR;
775 /* Did realloc() change the pointer? */
776 if (oldaddr != sp->fts_path) {
778 if (ISSET(FTS_NOCHDIR))
779 cp = sp->fts_path + len;
781 maxlen = sp->fts_pathlen - len;
784 if (len + dnamlen >= USHRT_MAX) {
786 * In an FTSENT, fts_pathlen is a u_short so it is
787 * possible to wraparound here. If we do, free up
788 * the current structure and the structures already
789 * allocated, then error out with ENAMETOOLONG.
793 (void)closedir(dirp);
794 cur->fts_info = FTS_ERR;
796 errno = ENAMETOOLONG;
799 p->fts_level = level;
800 p->fts_parent = sp->fts_cur;
801 p->fts_pathlen = len + dnamlen;
804 if (dp->d_type == DT_WHT)
805 p->fts_flags |= FTS_ISW;
810 p->fts_info = FTS_NS;
811 p->fts_errno = cderrno;
813 p->fts_info = FTS_NSOK;
814 p->fts_accpath = cur->fts_accpath;
815 } else if (nlinks == 0
818 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
822 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
823 p->fts_info = FTS_NSOK;
825 /* Build a file name for fts_stat to stat. */
826 if (ISSET(FTS_NOCHDIR)) {
827 p->fts_accpath = p->fts_path;
828 memmove(cp, p->fts_name, p->fts_namelen + 1);
830 p->fts_accpath = p->fts_name;
832 p->fts_info = fts_stat(sp, p, 0);
834 /* Decrement link count if applicable. */
835 if (nlinks > 0 && (p->fts_info == FTS_D ||
836 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
840 /* We walk in directory order so "ls -f" doesn't get upset. */
851 (void)closedir(dirp);
854 * If realloc() changed the address of the path, adjust the
855 * addresses for the rest of the tree and the dir list.
858 fts_padjust(sp, head);
861 * If not changing directories, reset the path back to original
864 if (ISSET(FTS_NOCHDIR)) {
865 if (len == sp->fts_pathlen || nitems == 0)
871 * If descended after called from fts_children or after called from
872 * fts_read and nothing found, get back. At the root level we use
873 * the saved fd; if one of fts_open()'s arguments is a relative path
874 * to an empty directory, we wind up here with no other way back. If
875 * can't get back, we're done.
877 if (descend && (type == BCHILD || !nitems) &&
878 (cur->fts_level == FTS_ROOTLEVEL ?
879 FCHDIR(sp, sp->fts_rfd) :
880 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
881 cur->fts_info = FTS_ERR;
886 /* If didn't find anything, return NULL. */
889 cur->fts_info = FTS_DP;
893 /* Sort the entries. */
894 if (sp->fts_compar && nitems > 1)
895 head = fts_sort(sp, head, nitems);
900 fts_stat(sp, p, follow)
908 struct stat *sbp, sb;
911 /* If user needs stat info, stat buffer already allocated. */
912 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
915 /* Check for whiteout. */
916 if (p->fts_flags & FTS_ISW) {
918 memset(sbp, '\0', sizeof(*sbp));
919 sbp->st_mode = S_IFWHT;
926 * If doing a logical walk, or application requested FTS_FOLLOW, do
927 * a stat(2). If that fails, check for a non-existent symlink. If
928 * fail, set the errno from the stat call.
930 if (ISSET(FTS_LOGICAL) || follow) {
931 if (stat(p->fts_accpath, sbp)) {
933 if (!lstat(p->fts_accpath, sbp)) {
937 p->fts_errno = saved_errno;
940 } else if (lstat(p->fts_accpath, sbp)) {
941 p->fts_errno = errno;
942 err: memset(sbp, 0, sizeof(struct stat));
946 if (S_ISDIR(sbp->st_mode)) {
948 * Set the device/inode. Used to find cycles and check for
949 * crossing mount points. Also remember the link count, used
950 * in fts_build to limit the number of stat calls. It is
951 * understood that these fields are only referenced if fts_info
954 dev = p->fts_dev = sbp->st_dev;
955 ino = p->fts_ino = sbp->st_ino;
956 p->fts_nlink = sbp->st_nlink;
958 if (ISDOT(p->fts_name))
962 * Cycle detection is done by brute force when the directory
963 * is first encountered. If the tree gets deep enough or the
964 * number of symbolic links to directories is high enough,
965 * something faster might be worthwhile.
967 for (t = p->fts_parent;
968 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
969 if (ino == t->fts_ino && dev == t->fts_dev) {
975 if (S_ISLNK(sbp->st_mode))
977 if (S_ISREG(sbp->st_mode))
979 return (FTS_DEFAULT);
983 * The comparison function takes pointers to pointers to FTSENT structures.
984 * Qsort wants a comparison function that takes pointers to void.
985 * (Both with appropriate levels of const-poisoning, of course!)
986 * Use a trampoline function to deal with the difference.
989 fts_compar(const void *a, const void *b)
993 parent = (*(const FTSENT * const *)a)->fts_fts;
994 return (*parent->fts_compar)(a, b);
998 fts_sort(sp, head, nitems)
1006 * Construct an array of pointers to the structures and call qsort(3).
1007 * Reassemble the array in the order returned by qsort. If unable to
1008 * sort for memory reasons, return the directory entries in their
1009 * current order. Allocate enough space for the current needs plus
1010 * 40 so don't realloc one entry at a time.
1012 if (nitems > sp->fts_nitems) {
1013 sp->fts_nitems = nitems + 40;
1014 if ((sp->fts_array = reallocf(sp->fts_array,
1015 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
1020 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
1022 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
1023 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1024 ap[0]->fts_link = ap[1];
1025 ap[0]->fts_link = NULL;
1030 fts_alloc(sp, name, namelen)
1038 struct ftsent_withstat {
1040 struct stat statbuf;
1044 * The file name is a variable length array and no stat structure is
1045 * necessary if the user has set the nostat bit. Allocate the FTSENT
1046 * structure, the file name and the stat structure in one chunk, but
1047 * be careful that the stat structure is reasonably aligned.
1049 if (ISSET(FTS_NOSTAT))
1050 len = sizeof(FTSENT) + namelen + 1;
1052 len = sizeof(struct ftsent_withstat) + namelen + 1;
1054 if ((p = malloc(len)) == NULL)
1057 if (ISSET(FTS_NOSTAT)) {
1058 p->fts_name = (char *)(p + 1);
1059 p->fts_statp = NULL;
1061 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1062 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1065 /* Copy the name and guarantee NUL termination. */
1066 memcpy(p->fts_name, name, namelen);
1067 p->fts_name[namelen] = '\0';
1068 p->fts_namelen = namelen;
1069 p->fts_path = sp->fts_path;
1072 p->fts_instr = FTS_NOINSTR;
1074 p->fts_pointer = NULL;
1085 /* Free a linked list of structures. */
1086 while ((p = head)) {
1087 head = head->fts_link;
1093 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1094 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1095 * though the kernel won't resolve them. Add the size (not just what's needed)
1096 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1099 fts_palloc(sp, more)
1104 sp->fts_pathlen += more + 256;
1106 * Check for possible wraparound. In an FTS, fts_pathlen is
1107 * a signed int but in an FTSENT it is an unsigned short.
1108 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1110 if (sp->fts_pathlen < 0 || sp->fts_pathlen >= USHRT_MAX) {
1113 sp->fts_path = NULL;
1114 errno = ENAMETOOLONG;
1117 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1118 return (sp->fts_path == NULL);
1122 * When the path is realloc'd, have to fix all of the pointers in structures
1126 fts_padjust(sp, head)
1131 char *addr = sp->fts_path;
1133 #define ADJUST(p) do { \
1134 if ((p)->fts_accpath != (p)->fts_name) { \
1135 (p)->fts_accpath = \
1136 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1138 (p)->fts_path = addr; \
1140 /* Adjust the current set of children. */
1141 for (p = sp->fts_child; p; p = p->fts_link)
1144 /* Adjust the rest of the tree, including the current level. */
1145 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1147 p = p->fts_link ? p->fts_link : p->fts_parent;
1157 for (max = 0; *argv; ++argv)
1158 if ((len = strlen(*argv)) > max)
1164 * Change to dir specified by fd or p->fts_accpath without getting
1165 * tricked by someone changing the world out from underneath us.
1166 * Assumes p->fts_dev and p->fts_ino are filled in.
1169 fts_safe_changedir(sp, p, fd, path)
1175 int ret, oerrno, newfd;
1179 if (ISSET(FTS_NOCHDIR))
1181 if (fd < 0 && (newfd = _open(path, O_RDONLY, 0)) < 0)
1183 if (_fstat(newfd, &sb)) {
1187 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1188 errno = ENOENT; /* disinformation */
1192 ret = fchdir(newfd);
1196 (void)_close(newfd);
1202 * Check if the filesystem for "ent" has UFS-style links.
1205 fts_ufslinks(FTS *sp, const FTSENT *ent)
1207 struct _fts_private *priv;
1210 priv = (struct _fts_private *)sp;
1212 * If this node's device is different from the previous, grab
1213 * the filesystem information, and decide on the reliability
1214 * of the link information from this filesystem for stat(2)
1217 if (priv->ftsp_dev != ent->fts_dev) {
1218 if (statfs(ent->fts_path, &priv->ftsp_statfs) != -1) {
1219 priv->ftsp_dev = ent->fts_dev;
1220 priv->ftsp_linksreliable = 0;
1221 for (cpp = ufslike_filesystems; *cpp; cpp++) {
1222 if (strcmp(priv->ftsp_statfs.f_fstypename,
1224 priv->ftsp_linksreliable = 1;
1229 priv->ftsp_linksreliable = 0;
1232 return (priv->ftsp_linksreliable);
1235 __sym_compat(fts_open, __fts_open_44bsd, FBSD_1.0);
1236 __sym_compat(fts_close, __fts_close_44bsd, FBSD_1.0);
1237 __sym_compat(fts_read, __fts_read_44bsd, FBSD_1.0);
1238 __sym_compat(fts_set, __fts_set_44bsd, FBSD_1.0);
1239 __sym_compat(fts_children, __fts_children_44bsd, FBSD_1.0);
1240 __sym_compat(fts_get_clientptr, __fts_get_clientptr_44bsd, FBSD_1.0);
1241 __sym_compat(fts_get_stream, __fts_get_stream_44bsd, FBSD_1.0);
1242 __sym_compat(fts_set_clientptr, __fts_set_clientptr_44bsd, FBSD_1.0);