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 static FTSENT *fts_alloc(FTS *, char *, size_t);
56 static FTSENT *fts_build(FTS *, int);
57 static void fts_lfree(FTSENT *);
58 static void fts_load(FTS *, FTSENT *);
59 static size_t fts_maxarglen(char * const *);
60 static void fts_padjust(FTS *, FTSENT *);
61 static int fts_palloc(FTS *, size_t);
62 static FTSENT *fts_sort(FTS *, FTSENT *, size_t);
63 static int fts_stat(FTS *, FTSENT *, int);
64 static int fts_safe_changedir(FTS *, FTSENT *, int, char *);
65 static int fts_ufslinks(FTS *, const FTSENT *);
67 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
69 #define CLR(opt) (sp->fts_options &= ~(opt))
70 #define ISSET(opt) (sp->fts_options & (opt))
71 #define SET(opt) (sp->fts_options |= (opt))
73 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
76 #define BCHILD 1 /* fts_children */
77 #define BNAMES 2 /* fts_children, names only */
78 #define BREAD 3 /* fts_read */
81 * Internal representation of an FTS, including extra implementation
82 * details. The FTS returned from fts_open points to this structure's
83 * ftsp_fts member (and can be cast to an _fts_private as required)
87 struct statfs ftsp_statfs;
89 int ftsp_linksreliable;
93 * The "FTS_NOSTAT" option can avoid a lot of calls to stat(2) if it
94 * knows that a directory could not possibly have subdirectories. This
95 * is decided by looking at the link count: a subdirectory would
96 * increment its parent's link count by virtue of its own ".." entry.
97 * This assumption only holds for UFS-like filesystems that implement
98 * links and directories this way, so we must punt for others.
101 static const char *ufslike_filesystems[] = {
111 fts_open(argv, options, compar)
114 int (*compar)(const FTSENT * const *, const FTSENT * const *);
116 struct _fts_private *priv;
119 FTSENT *parent, *tmp;
123 if (options & ~FTS_OPTIONMASK) {
128 /* fts_open() requires at least one path */
134 /* Allocate/initialize the stream. */
135 if ((priv = malloc(sizeof(*priv))) == NULL)
137 memset(priv, 0, sizeof(*priv));
138 sp = &priv->ftsp_fts;
139 sp->fts_compar = compar;
140 sp->fts_options = options;
145 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
146 if (ISSET(FTS_LOGICAL))
150 * Start out with 1K of path space, and enough, in any case,
151 * to hold the user's paths.
153 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
156 /* Allocate/initialize root's parent. */
157 if ((parent = fts_alloc(sp, "", 0)) == NULL)
159 parent->fts_level = FTS_ROOTPARENTLEVEL;
161 /* Allocate/initialize root(s). */
162 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
165 p = fts_alloc(sp, *argv, len);
166 p->fts_level = FTS_ROOTLEVEL;
167 p->fts_parent = parent;
168 p->fts_accpath = p->fts_name;
169 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
171 /* Command-line "." and ".." are real directories. */
172 if (p->fts_info == FTS_DOT)
176 * If comparison routine supplied, traverse in sorted
177 * order; otherwise traverse in the order specified.
192 if (compar && nitems > 1)
193 root = fts_sort(sp, root, nitems);
196 * Allocate a dummy pointer and make fts_read think that we've just
197 * finished the node before the root(s); set p->fts_info to FTS_INIT
198 * so that everything about the "current" node is ignored.
200 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
202 sp->fts_cur->fts_link = root;
203 sp->fts_cur->fts_info = FTS_INIT;
206 * If using chdir(2), grab a file descriptor pointing to dot to ensure
207 * that we can get back here; this could be avoided for some paths,
208 * but almost certainly not worth the effort. Slashes, symbolic links,
209 * and ".." are all fairly nasty problems. Note, if we can't get the
210 * descriptor we run anyway, just more slowly.
212 if (!ISSET(FTS_NOCHDIR) &&
213 (sp->fts_rfd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
218 mem3: fts_lfree(root);
220 mem2: free(sp->fts_path);
234 * Load the stream structure for the next traversal. Since we don't
235 * actually enter the directory until after the preorder visit, set
236 * the fts_accpath field specially so the chdir gets done to the right
237 * place and the user can access the first node. From fts_open it's
238 * known that the path will fit.
240 len = p->fts_pathlen = p->fts_namelen;
241 memmove(sp->fts_path, p->fts_name, len + 1);
242 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
244 memmove(p->fts_name, cp, len + 1);
245 p->fts_namelen = len;
247 p->fts_accpath = p->fts_path = sp->fts_path;
248 sp->fts_dev = p->fts_dev;
259 * This still works if we haven't read anything -- the dummy structure
260 * points to the root list, so we step through to the end of the root
261 * list which has a valid parent pointer.
264 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
266 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
272 /* Free up child linked list, sort array, path buffer. */
274 fts_lfree(sp->fts_child);
279 /* Return to original directory, save errno if necessary. */
280 if (!ISSET(FTS_NOCHDIR)) {
281 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
282 (void)_close(sp->fts_rfd);
284 /* Set errno and return. */
285 if (saved_errno != 0) {
286 /* Free up the stream pointer. */
293 /* Free up the stream pointer. */
299 * Special case of "/" at the end of the path so that slashes aren't
300 * appended which would cause paths to be written as "....//foo".
303 (p->fts_path[p->fts_pathlen - 1] == '/' \
304 ? p->fts_pathlen - 1 : p->fts_pathlen)
315 /* If finished or unrecoverable error, return NULL. */
316 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
319 /* Set current node pointer. */
322 /* Save and zero out user instructions. */
323 instr = p->fts_instr;
324 p->fts_instr = FTS_NOINSTR;
326 /* Any type of file may be re-visited; re-stat and re-turn. */
327 if (instr == FTS_AGAIN) {
328 p->fts_info = fts_stat(sp, p, 0);
333 * Following a symlink -- SLNONE test allows application to see
334 * SLNONE and recover. If indirecting through a symlink, have
335 * keep a pointer to current location. If unable to get that
336 * pointer, follow fails.
338 if (instr == FTS_FOLLOW &&
339 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
340 p->fts_info = fts_stat(sp, p, 1);
341 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
342 if ((p->fts_symfd = _open(".", O_RDONLY | O_CLOEXEC,
344 p->fts_errno = errno;
345 p->fts_info = FTS_ERR;
347 p->fts_flags |= FTS_SYMFOLLOW;
352 /* Directory in pre-order. */
353 if (p->fts_info == FTS_D) {
354 /* If skipped or crossed mount point, do post-order visit. */
355 if (instr == FTS_SKIP ||
356 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
357 if (p->fts_flags & FTS_SYMFOLLOW)
358 (void)_close(p->fts_symfd);
360 fts_lfree(sp->fts_child);
361 sp->fts_child = NULL;
363 p->fts_info = FTS_DP;
367 /* Rebuild if only read the names and now traversing. */
368 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
370 fts_lfree(sp->fts_child);
371 sp->fts_child = NULL;
375 * Cd to the subdirectory.
377 * If have already read and now fail to chdir, whack the list
378 * to make the names come out right, and set the parent errno
379 * so the application will eventually get an error condition.
380 * Set the FTS_DONTCHDIR flag so that when we logically change
381 * directories back to the parent we don't do a chdir.
383 * If haven't read do so. If the read fails, fts_build sets
384 * FTS_STOP or the fts_info field of the node.
386 if (sp->fts_child != NULL) {
387 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
388 p->fts_errno = errno;
389 p->fts_flags |= FTS_DONTCHDIR;
390 for (p = sp->fts_child; p != NULL;
393 p->fts_parent->fts_accpath;
395 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
401 sp->fts_child = NULL;
405 /* Move to the next node on this level. */
407 if ((p = p->fts_link) != NULL) {
411 * If reached the top, return to the original directory (or
412 * the root of the tree), and load the paths for the next root.
414 if (p->fts_level == FTS_ROOTLEVEL) {
415 if (FCHDIR(sp, sp->fts_rfd)) {
420 return (sp->fts_cur = p);
424 * User may have called fts_set on the node. If skipped,
425 * ignore. If followed, get a file descriptor so we can
426 * get back if necessary.
428 if (p->fts_instr == FTS_SKIP)
430 if (p->fts_instr == FTS_FOLLOW) {
431 p->fts_info = fts_stat(sp, p, 1);
432 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
434 _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0) {
435 p->fts_errno = errno;
436 p->fts_info = FTS_ERR;
438 p->fts_flags |= FTS_SYMFOLLOW;
440 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. */
453 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
455 * Done; free everything up and set errno to 0 so the user
456 * 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, "..")) {
490 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
491 return (sp->fts_cur = p);
495 * Fts_set takes the stream as an argument although it's not used in this
496 * implementation; it would be necessary if anyone wanted to add global
497 * semantics to fts using fts_set. An error return is allowed for similar
502 fts_set(sp, p, instr)
507 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
508 instr != FTS_NOINSTR && instr != FTS_SKIP) {
512 p->fts_instr = instr;
517 fts_children(sp, instr)
524 if (instr != 0 && instr != FTS_NAMEONLY) {
529 /* Set current node pointer. */
533 * Errno set to 0 so user can distinguish empty directory from
538 /* Fatal errors stop here. */
542 /* Return logical hierarchy of user's arguments. */
543 if (p->fts_info == FTS_INIT)
544 return (p->fts_link);
547 * If not a directory being visited in pre-order, stop here. Could
548 * allow FTS_DNR, assuming the user has fixed the problem, but the
549 * same effect is available with FTS_AGAIN.
551 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
554 /* Free up any previous child list. */
555 if (sp->fts_child != NULL)
556 fts_lfree(sp->fts_child);
558 if (instr == FTS_NAMEONLY) {
565 * If using chdir on a relative path and called BEFORE fts_read does
566 * its chdir to the root of a traversal, we can lose -- we need to
567 * chdir into the subdirectory, and we don't know where the current
568 * directory is, so we can't get back so that the upcoming chdir by
569 * fts_read will work.
571 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
573 return (sp->fts_child = fts_build(sp, instr));
575 if ((fd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
577 sp->fts_child = fts_build(sp, instr);
583 return (sp->fts_child);
586 #ifndef fts_get_clientptr
587 #error "fts_get_clientptr not defined"
591 (fts_get_clientptr)(FTS *sp)
594 return (fts_get_clientptr(sp));
597 #ifndef fts_get_stream
598 #error "fts_get_stream not defined"
602 (fts_get_stream)(FTSENT *p)
604 return (fts_get_stream(p));
608 fts_set_clientptr(FTS *sp, void *clientptr)
611 sp->fts_clientptr = clientptr;
615 * This is the tricky part -- do not casually change *anything* in here. The
616 * idea is to build the linked list of entries that are used by fts_children
617 * and fts_read. There are lots of special cases.
619 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
620 * set and it's a physical walk (so that symbolic links can't be directories),
621 * we can do things quickly. First, if it's a 4.4BSD file system, the type
622 * of the file is in the directory entry. Otherwise, we assume that the number
623 * of subdirectories in a node is equal to the number of links to the parent.
624 * The former skips all stat calls. The latter skips stat calls in any leaf
625 * directories and for any files after the subdirectories in the directory have
626 * been found, cutting the stat calls by about 2/3.
639 int cderrno, descend, oflag, saved_errno, nostat, doadjust;
641 long nlinks; /* has to be signed because -1 is a magic value */
642 size_t dnamlen, len, maxlen, nitems;
644 /* Set current node pointer. */
648 * Open the directory for reading. If this fails, we're done.
649 * If being called from fts_read, set the fts_info field.
652 if (ISSET(FTS_WHITEOUT))
653 oflag = DTF_NODUP | DTF_REWIND;
655 oflag = DTF_HIDEW | DTF_NODUP | DTF_REWIND;
657 #define __opendir2(path, flag) opendir(path)
659 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
661 cur->fts_info = FTS_DNR;
662 cur->fts_errno = errno;
668 * Nlinks is the number of possible entries of type directory in the
669 * directory if we're cheating on stat calls, 0 if we're not doing
670 * any stat calls at all, -1 if we're doing stats on everything.
672 if (type == BNAMES) {
674 /* Be quiet about nostat, GCC. */
676 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
677 if (fts_ufslinks(sp, cur))
678 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
688 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
689 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
690 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
693 * If we're going to need to stat anything or we want to descend
694 * and stay in the directory, chdir. If this fails we keep going,
695 * but set a flag so we don't chdir after the post-order visit.
696 * We won't be able to stat anything, but we can still return the
697 * names themselves. Note, that since fts_read won't be able to
698 * chdir into the directory, it will have to return different path
699 * names than before, i.e. "a/b" instead of "b". Since the node
700 * has already been visited in pre-order, have to wait until the
701 * post-order visit to return the error. There is a special case
702 * here, if there was nothing to stat then it's not an error to
703 * not be able to stat. This is all fairly nasty. If a program
704 * needed sorted entries or stat information, they had better be
705 * checking FTS_NS on the returned nodes.
708 if (nlinks || type == BREAD) {
709 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
710 if (nlinks && type == BREAD)
711 cur->fts_errno = errno;
712 cur->fts_flags |= FTS_DONTCHDIR;
721 * Figure out the max file name length that can be stored in the
722 * current path -- the inner loop allocates more path as necessary.
723 * We really wouldn't have to do the maxlen calculations here, we
724 * could do them in fts_read before returning the path, but it's a
725 * lot easier here since the length is part of the dirent structure.
727 * If not changing directories set a pointer so that can just append
728 * each new name into the path.
731 if (ISSET(FTS_NOCHDIR)) {
732 cp = sp->fts_path + len;
735 /* GCC, you're too verbose. */
739 maxlen = sp->fts_pathlen - len;
741 level = cur->fts_level + 1;
743 /* Read the directory, attaching each entry to the `link' pointer. */
745 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
746 dnamlen = dp->d_namlen;
747 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
750 if ((p = fts_alloc(sp, dp->d_name, dnamlen)) == NULL)
752 if (dnamlen >= maxlen) { /* include space for NUL */
753 oldaddr = sp->fts_path;
754 if (fts_palloc(sp, dnamlen + len + 1)) {
756 * No more memory for path or structures. Save
757 * errno, free up the current structure and the
758 * structures already allocated.
760 mem1: saved_errno = errno;
764 (void)closedir(dirp);
765 cur->fts_info = FTS_ERR;
770 /* Did realloc() change the pointer? */
771 if (oldaddr != sp->fts_path) {
773 if (ISSET(FTS_NOCHDIR))
774 cp = sp->fts_path + len;
776 maxlen = sp->fts_pathlen - len;
779 p->fts_level = level;
780 p->fts_parent = sp->fts_cur;
781 p->fts_pathlen = len + dnamlen;
784 if (dp->d_type == DT_WHT)
785 p->fts_flags |= FTS_ISW;
790 p->fts_info = FTS_NS;
791 p->fts_errno = cderrno;
793 p->fts_info = FTS_NSOK;
794 p->fts_accpath = cur->fts_accpath;
795 } else if (nlinks == 0
798 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
802 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
803 p->fts_info = FTS_NSOK;
805 /* Build a file name for fts_stat to stat. */
806 if (ISSET(FTS_NOCHDIR)) {
807 p->fts_accpath = p->fts_path;
808 memmove(cp, p->fts_name, p->fts_namelen + 1);
810 p->fts_accpath = p->fts_name;
812 p->fts_info = fts_stat(sp, p, 0);
814 /* Decrement link count if applicable. */
815 if (nlinks > 0 && (p->fts_info == FTS_D ||
816 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
820 /* We walk in directory order so "ls -f" doesn't get upset. */
831 (void)closedir(dirp);
834 * If realloc() changed the address of the path, adjust the
835 * addresses for the rest of the tree and the dir list.
838 fts_padjust(sp, head);
841 * If not changing directories, reset the path back to original
844 if (ISSET(FTS_NOCHDIR))
845 sp->fts_path[cur->fts_pathlen] = '\0';
848 * If descended after called from fts_children or after called from
849 * fts_read and nothing found, get back. At the root level we use
850 * the saved fd; if one of fts_open()'s arguments is a relative path
851 * to an empty directory, we wind up here with no other way back. If
852 * can't get back, we're done.
854 if (descend && (type == BCHILD || !nitems) &&
855 (cur->fts_level == FTS_ROOTLEVEL ?
856 FCHDIR(sp, sp->fts_rfd) :
857 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
858 cur->fts_info = FTS_ERR;
863 /* If didn't find anything, return NULL. */
866 cur->fts_info = FTS_DP;
870 /* Sort the entries. */
871 if (sp->fts_compar && nitems > 1)
872 head = fts_sort(sp, head, nitems);
877 fts_stat(sp, p, follow)
885 struct stat *sbp, sb;
888 /* If user needs stat info, stat buffer already allocated. */
889 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
892 /* Check for whiteout. */
893 if (p->fts_flags & FTS_ISW) {
895 memset(sbp, '\0', sizeof(*sbp));
896 sbp->st_mode = S_IFWHT;
903 * If doing a logical walk, or application requested FTS_FOLLOW, do
904 * a stat(2). If that fails, check for a non-existent symlink. If
905 * fail, set the errno from the stat call.
907 if (ISSET(FTS_LOGICAL) || follow) {
908 if (stat(p->fts_accpath, sbp)) {
910 if (!lstat(p->fts_accpath, sbp)) {
914 p->fts_errno = saved_errno;
917 } else if (lstat(p->fts_accpath, sbp)) {
918 p->fts_errno = errno;
919 err: memset(sbp, 0, sizeof(struct stat));
923 if (S_ISDIR(sbp->st_mode)) {
925 * Set the device/inode. Used to find cycles and check for
926 * crossing mount points. Also remember the link count, used
927 * in fts_build to limit the number of stat calls. It is
928 * understood that these fields are only referenced if fts_info
931 dev = p->fts_dev = sbp->st_dev;
932 ino = p->fts_ino = sbp->st_ino;
933 p->fts_nlink = sbp->st_nlink;
935 if (ISDOT(p->fts_name))
939 * Cycle detection is done by brute force when the directory
940 * is first encountered. If the tree gets deep enough or the
941 * number of symbolic links to directories is high enough,
942 * something faster might be worthwhile.
944 for (t = p->fts_parent;
945 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
946 if (ino == t->fts_ino && dev == t->fts_dev) {
952 if (S_ISLNK(sbp->st_mode))
954 if (S_ISREG(sbp->st_mode))
956 return (FTS_DEFAULT);
960 * The comparison function takes pointers to pointers to FTSENT structures.
961 * Qsort wants a comparison function that takes pointers to void.
962 * (Both with appropriate levels of const-poisoning, of course!)
963 * Use a trampoline function to deal with the difference.
966 fts_compar(const void *a, const void *b)
970 parent = (*(const FTSENT * const *)a)->fts_fts;
971 return (*parent->fts_compar)(a, b);
975 fts_sort(sp, head, nitems)
983 * Construct an array of pointers to the structures and call qsort(3).
984 * Reassemble the array in the order returned by qsort. If unable to
985 * sort for memory reasons, return the directory entries in their
986 * current order. Allocate enough space for the current needs plus
987 * 40 so don't realloc one entry at a time.
989 if (nitems > sp->fts_nitems) {
990 sp->fts_nitems = nitems + 40;
991 if ((sp->fts_array = reallocf(sp->fts_array,
992 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
997 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
999 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
1000 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1001 ap[0]->fts_link = ap[1];
1002 ap[0]->fts_link = NULL;
1007 fts_alloc(sp, name, namelen)
1015 struct ftsent_withstat {
1017 struct stat statbuf;
1021 * The file name is a variable length array and no stat structure is
1022 * necessary if the user has set the nostat bit. Allocate the FTSENT
1023 * structure, the file name and the stat structure in one chunk, but
1024 * be careful that the stat structure is reasonably aligned.
1026 if (ISSET(FTS_NOSTAT))
1027 len = sizeof(FTSENT) + namelen + 1;
1029 len = sizeof(struct ftsent_withstat) + namelen + 1;
1031 if ((p = malloc(len)) == NULL)
1034 if (ISSET(FTS_NOSTAT)) {
1035 p->fts_name = (char *)(p + 1);
1036 p->fts_statp = NULL;
1038 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1039 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1042 /* Copy the name and guarantee NUL termination. */
1043 memcpy(p->fts_name, name, namelen);
1044 p->fts_name[namelen] = '\0';
1045 p->fts_namelen = namelen;
1046 p->fts_path = sp->fts_path;
1049 p->fts_instr = FTS_NOINSTR;
1051 p->fts_pointer = NULL;
1062 /* Free a linked list of structures. */
1063 while ((p = head)) {
1064 head = head->fts_link;
1070 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1071 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1072 * though the kernel won't resolve them. Add the size (not just what's needed)
1073 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1076 fts_palloc(sp, more)
1081 sp->fts_pathlen += more + 256;
1082 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1083 return (sp->fts_path == NULL);
1087 * When the path is realloc'd, have to fix all of the pointers in structures
1091 fts_padjust(sp, head)
1096 char *addr = sp->fts_path;
1098 #define ADJUST(p) do { \
1099 if ((p)->fts_accpath != (p)->fts_name) { \
1100 (p)->fts_accpath = \
1101 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1103 (p)->fts_path = addr; \
1105 /* Adjust the current set of children. */
1106 for (p = sp->fts_child; p; p = p->fts_link)
1109 /* Adjust the rest of the tree, including the current level. */
1110 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1112 p = p->fts_link ? p->fts_link : p->fts_parent;
1122 for (max = 0; *argv; ++argv)
1123 if ((len = strlen(*argv)) > max)
1129 * Change to dir specified by fd or p->fts_accpath without getting
1130 * tricked by someone changing the world out from underneath us.
1131 * Assumes p->fts_dev and p->fts_ino are filled in.
1134 fts_safe_changedir(sp, p, fd, path)
1140 int ret, oerrno, newfd;
1144 if (ISSET(FTS_NOCHDIR))
1146 if (fd < 0 && (newfd = _open(path, O_RDONLY | O_DIRECTORY |
1149 if (_fstat(newfd, &sb)) {
1153 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1154 errno = ENOENT; /* disinformation */
1158 ret = fchdir(newfd);
1162 (void)_close(newfd);
1168 * Check if the filesystem for "ent" has UFS-style links.
1171 fts_ufslinks(FTS *sp, const FTSENT *ent)
1173 struct _fts_private *priv;
1176 priv = (struct _fts_private *)sp;
1178 * If this node's device is different from the previous, grab
1179 * the filesystem information, and decide on the reliability
1180 * of the link information from this filesystem for stat(2)
1183 if (priv->ftsp_dev != ent->fts_dev) {
1184 if (statfs(ent->fts_path, &priv->ftsp_statfs) != -1) {
1185 priv->ftsp_dev = ent->fts_dev;
1186 priv->ftsp_linksreliable = 0;
1187 for (cpp = ufslike_filesystems; *cpp; cpp++) {
1188 if (strcmp(priv->ftsp_statfs.f_fstypename,
1190 priv->ftsp_linksreliable = 1;
1195 priv->ftsp_linksreliable = 0;
1198 return (priv->ftsp_linksreliable);