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) {
163 /* Don't allow zero-length paths. */
164 if ((len = strlen(*argv)) == 0) {
169 p = fts_alloc(sp, *argv, len);
170 p->fts_level = FTS_ROOTLEVEL;
171 p->fts_parent = parent;
172 p->fts_accpath = p->fts_name;
173 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
175 /* Command-line "." and ".." are real directories. */
176 if (p->fts_info == FTS_DOT)
180 * If comparison routine supplied, traverse in sorted
181 * order; otherwise traverse in the order specified.
196 if (compar && nitems > 1)
197 root = fts_sort(sp, root, nitems);
200 * Allocate a dummy pointer and make fts_read think that we've just
201 * finished the node before the root(s); set p->fts_info to FTS_INIT
202 * so that everything about the "current" node is ignored.
204 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
206 sp->fts_cur->fts_link = root;
207 sp->fts_cur->fts_info = FTS_INIT;
210 * If using chdir(2), grab a file descriptor pointing to dot to ensure
211 * that we can get back here; this could be avoided for some paths,
212 * but almost certainly not worth the effort. Slashes, symbolic links,
213 * and ".." are all fairly nasty problems. Note, if we can't get the
214 * descriptor we run anyway, just more slowly.
216 if (!ISSET(FTS_NOCHDIR) &&
217 (sp->fts_rfd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
222 mem3: fts_lfree(root);
224 mem2: free(sp->fts_path);
238 * Load the stream structure for the next traversal. Since we don't
239 * actually enter the directory until after the preorder visit, set
240 * the fts_accpath field specially so the chdir gets done to the right
241 * place and the user can access the first node. From fts_open it's
242 * known that the path will fit.
244 len = p->fts_pathlen = p->fts_namelen;
245 memmove(sp->fts_path, p->fts_name, len + 1);
246 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
248 memmove(p->fts_name, cp, len + 1);
249 p->fts_namelen = len;
251 p->fts_accpath = p->fts_path = sp->fts_path;
252 sp->fts_dev = p->fts_dev;
263 * This still works if we haven't read anything -- the dummy structure
264 * points to the root list, so we step through to the end of the root
265 * list which has a valid parent pointer.
268 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
270 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
276 /* Free up child linked list, sort array, path buffer. */
278 fts_lfree(sp->fts_child);
283 /* Return to original directory, save errno if necessary. */
284 if (!ISSET(FTS_NOCHDIR)) {
285 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
286 (void)_close(sp->fts_rfd);
288 /* Set errno and return. */
289 if (saved_errno != 0) {
290 /* Free up the stream pointer. */
297 /* Free up the stream pointer. */
303 * Special case of "/" at the end of the path so that slashes aren't
304 * appended which would cause paths to be written as "....//foo".
307 (p->fts_path[p->fts_pathlen - 1] == '/' \
308 ? p->fts_pathlen - 1 : p->fts_pathlen)
319 /* If finished or unrecoverable error, return NULL. */
320 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
323 /* Set current node pointer. */
326 /* Save and zero out user instructions. */
327 instr = p->fts_instr;
328 p->fts_instr = FTS_NOINSTR;
330 /* Any type of file may be re-visited; re-stat and re-turn. */
331 if (instr == FTS_AGAIN) {
332 p->fts_info = fts_stat(sp, p, 0);
337 * Following a symlink -- SLNONE test allows application to see
338 * SLNONE and recover. If indirecting through a symlink, have
339 * keep a pointer to current location. If unable to get that
340 * pointer, follow fails.
342 if (instr == FTS_FOLLOW &&
343 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
344 p->fts_info = fts_stat(sp, p, 1);
345 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
346 if ((p->fts_symfd = _open(".", O_RDONLY | O_CLOEXEC,
348 p->fts_errno = errno;
349 p->fts_info = FTS_ERR;
351 p->fts_flags |= FTS_SYMFOLLOW;
356 /* Directory in pre-order. */
357 if (p->fts_info == FTS_D) {
358 /* If skipped or crossed mount point, do post-order visit. */
359 if (instr == FTS_SKIP ||
360 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
361 if (p->fts_flags & FTS_SYMFOLLOW)
362 (void)_close(p->fts_symfd);
364 fts_lfree(sp->fts_child);
365 sp->fts_child = NULL;
367 p->fts_info = FTS_DP;
371 /* Rebuild if only read the names and now traversing. */
372 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
374 fts_lfree(sp->fts_child);
375 sp->fts_child = NULL;
379 * Cd to the subdirectory.
381 * If have already read and now fail to chdir, whack the list
382 * to make the names come out right, and set the parent errno
383 * so the application will eventually get an error condition.
384 * Set the FTS_DONTCHDIR flag so that when we logically change
385 * directories back to the parent we don't do a chdir.
387 * If haven't read do so. If the read fails, fts_build sets
388 * FTS_STOP or the fts_info field of the node.
390 if (sp->fts_child != NULL) {
391 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
392 p->fts_errno = errno;
393 p->fts_flags |= FTS_DONTCHDIR;
394 for (p = sp->fts_child; p != NULL;
397 p->fts_parent->fts_accpath;
399 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
405 sp->fts_child = NULL;
409 /* Move to the next node on this level. */
411 if ((p = p->fts_link) != NULL) {
415 * If reached the top, return to the original directory (or
416 * the root of the tree), and load the paths for the next root.
418 if (p->fts_level == FTS_ROOTLEVEL) {
419 if (FCHDIR(sp, sp->fts_rfd)) {
424 return (sp->fts_cur = p);
428 * User may have called fts_set on the node. If skipped,
429 * ignore. If followed, get a file descriptor so we can
430 * get back if necessary.
432 if (p->fts_instr == FTS_SKIP)
434 if (p->fts_instr == FTS_FOLLOW) {
435 p->fts_info = fts_stat(sp, p, 1);
436 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
438 _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0) {
439 p->fts_errno = errno;
440 p->fts_info = FTS_ERR;
442 p->fts_flags |= FTS_SYMFOLLOW;
444 p->fts_instr = FTS_NOINSTR;
447 name: t = sp->fts_path + NAPPEND(p->fts_parent);
449 memmove(t, p->fts_name, p->fts_namelen + 1);
450 return (sp->fts_cur = p);
453 /* Move up to the parent node. */
457 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
459 * Done; free everything up and set errno to 0 so the user
460 * can distinguish between error and EOF.
464 return (sp->fts_cur = NULL);
467 /* NUL terminate the pathname. */
468 sp->fts_path[p->fts_pathlen] = '\0';
471 * Return to the parent directory. If at a root node or came through
472 * a symlink, go back through the file descriptor. Otherwise, cd up
475 if (p->fts_level == FTS_ROOTLEVEL) {
476 if (FCHDIR(sp, sp->fts_rfd)) {
480 } else if (p->fts_flags & FTS_SYMFOLLOW) {
481 if (FCHDIR(sp, p->fts_symfd)) {
483 (void)_close(p->fts_symfd);
488 (void)_close(p->fts_symfd);
489 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
490 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
494 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
495 return (sp->fts_cur = p);
499 * Fts_set takes the stream as an argument although it's not used in this
500 * implementation; it would be necessary if anyone wanted to add global
501 * semantics to fts using fts_set. An error return is allowed for similar
506 fts_set(sp, p, instr)
511 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
512 instr != FTS_NOINSTR && instr != FTS_SKIP) {
516 p->fts_instr = instr;
521 fts_children(sp, instr)
528 if (instr != 0 && instr != FTS_NAMEONLY) {
533 /* Set current node pointer. */
537 * Errno set to 0 so user can distinguish empty directory from
542 /* Fatal errors stop here. */
546 /* Return logical hierarchy of user's arguments. */
547 if (p->fts_info == FTS_INIT)
548 return (p->fts_link);
551 * If not a directory being visited in pre-order, stop here. Could
552 * allow FTS_DNR, assuming the user has fixed the problem, but the
553 * same effect is available with FTS_AGAIN.
555 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
558 /* Free up any previous child list. */
559 if (sp->fts_child != NULL)
560 fts_lfree(sp->fts_child);
562 if (instr == FTS_NAMEONLY) {
569 * If using chdir on a relative path and called BEFORE fts_read does
570 * its chdir to the root of a traversal, we can lose -- we need to
571 * chdir into the subdirectory, and we don't know where the current
572 * directory is, so we can't get back so that the upcoming chdir by
573 * fts_read will work.
575 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
577 return (sp->fts_child = fts_build(sp, instr));
579 if ((fd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
581 sp->fts_child = fts_build(sp, instr);
587 return (sp->fts_child);
590 #ifndef fts_get_clientptr
591 #error "fts_get_clientptr not defined"
595 (fts_get_clientptr)(FTS *sp)
598 return (fts_get_clientptr(sp));
601 #ifndef fts_get_stream
602 #error "fts_get_stream not defined"
606 (fts_get_stream)(FTSENT *p)
608 return (fts_get_stream(p));
612 fts_set_clientptr(FTS *sp, void *clientptr)
615 sp->fts_clientptr = clientptr;
619 * This is the tricky part -- do not casually change *anything* in here. The
620 * idea is to build the linked list of entries that are used by fts_children
621 * and fts_read. There are lots of special cases.
623 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
624 * set and it's a physical walk (so that symbolic links can't be directories),
625 * we can do things quickly. First, if it's a 4.4BSD file system, the type
626 * of the file is in the directory entry. Otherwise, we assume that the number
627 * of subdirectories in a node is equal to the number of links to the parent.
628 * The former skips all stat calls. The latter skips stat calls in any leaf
629 * directories and for any files after the subdirectories in the directory have
630 * been found, cutting the stat calls by about 2/3.
643 int cderrno, descend, oflag, saved_errno, nostat, doadjust;
645 long nlinks; /* has to be signed because -1 is a magic value */
646 size_t dnamlen, len, maxlen, nitems;
648 /* Set current node pointer. */
652 * Open the directory for reading. If this fails, we're done.
653 * If being called from fts_read, set the fts_info field.
656 if (ISSET(FTS_WHITEOUT))
657 oflag = DTF_NODUP | DTF_REWIND;
659 oflag = DTF_HIDEW | DTF_NODUP | DTF_REWIND;
661 #define __opendir2(path, flag) opendir(path)
663 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
665 cur->fts_info = FTS_DNR;
666 cur->fts_errno = errno;
672 * Nlinks is the number of possible entries of type directory in the
673 * directory if we're cheating on stat calls, 0 if we're not doing
674 * any stat calls at all, -1 if we're doing stats on everything.
676 if (type == BNAMES) {
678 /* Be quiet about nostat, GCC. */
680 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
681 if (fts_ufslinks(sp, cur))
682 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
692 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
693 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
694 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
697 * If we're going to need to stat anything or we want to descend
698 * and stay in the directory, chdir. If this fails we keep going,
699 * but set a flag so we don't chdir after the post-order visit.
700 * We won't be able to stat anything, but we can still return the
701 * names themselves. Note, that since fts_read won't be able to
702 * chdir into the directory, it will have to return different path
703 * names than before, i.e. "a/b" instead of "b". Since the node
704 * has already been visited in pre-order, have to wait until the
705 * post-order visit to return the error. There is a special case
706 * here, if there was nothing to stat then it's not an error to
707 * not be able to stat. This is all fairly nasty. If a program
708 * needed sorted entries or stat information, they had better be
709 * checking FTS_NS on the returned nodes.
712 if (nlinks || type == BREAD) {
713 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
714 if (nlinks && type == BREAD)
715 cur->fts_errno = errno;
716 cur->fts_flags |= FTS_DONTCHDIR;
725 * Figure out the max file name length that can be stored in the
726 * current path -- the inner loop allocates more path as necessary.
727 * We really wouldn't have to do the maxlen calculations here, we
728 * could do them in fts_read before returning the path, but it's a
729 * lot easier here since the length is part of the dirent structure.
731 * If not changing directories set a pointer so that can just append
732 * each new name into the path.
735 if (ISSET(FTS_NOCHDIR)) {
736 cp = sp->fts_path + len;
739 /* GCC, you're too verbose. */
743 maxlen = sp->fts_pathlen - len;
745 level = cur->fts_level + 1;
747 /* Read the directory, attaching each entry to the `link' pointer. */
749 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
750 dnamlen = dp->d_namlen;
751 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
754 if ((p = fts_alloc(sp, dp->d_name, dnamlen)) == NULL)
756 if (dnamlen >= maxlen) { /* include space for NUL */
757 oldaddr = sp->fts_path;
758 if (fts_palloc(sp, dnamlen + len + 1)) {
760 * No more memory for path or structures. Save
761 * errno, free up the current structure and the
762 * structures already allocated.
764 mem1: saved_errno = errno;
768 (void)closedir(dirp);
769 cur->fts_info = FTS_ERR;
774 /* Did realloc() change the pointer? */
775 if (oldaddr != sp->fts_path) {
777 if (ISSET(FTS_NOCHDIR))
778 cp = sp->fts_path + len;
780 maxlen = sp->fts_pathlen - len;
783 p->fts_level = level;
784 p->fts_parent = sp->fts_cur;
785 p->fts_pathlen = len + dnamlen;
788 if (dp->d_type == DT_WHT)
789 p->fts_flags |= FTS_ISW;
794 p->fts_info = FTS_NS;
795 p->fts_errno = cderrno;
797 p->fts_info = FTS_NSOK;
798 p->fts_accpath = cur->fts_accpath;
799 } else if (nlinks == 0
802 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
806 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
807 p->fts_info = FTS_NSOK;
809 /* Build a file name for fts_stat to stat. */
810 if (ISSET(FTS_NOCHDIR)) {
811 p->fts_accpath = p->fts_path;
812 memmove(cp, p->fts_name, p->fts_namelen + 1);
814 p->fts_accpath = p->fts_name;
816 p->fts_info = fts_stat(sp, p, 0);
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. */
835 (void)closedir(dirp);
838 * If realloc() changed the address of the path, adjust the
839 * addresses for the rest of the tree and the dir list.
842 fts_padjust(sp, head);
845 * If not changing directories, reset the path back to original
848 if (ISSET(FTS_NOCHDIR))
849 sp->fts_path[cur->fts_pathlen] = '\0';
852 * If descended after called from fts_children or after called from
853 * fts_read and nothing found, get back. At the root level we use
854 * the saved fd; if one of fts_open()'s arguments is a relative path
855 * to an empty directory, we wind up here with no other way back. If
856 * can't get back, we're done.
858 if (descend && (type == BCHILD || !nitems) &&
859 (cur->fts_level == FTS_ROOTLEVEL ?
860 FCHDIR(sp, sp->fts_rfd) :
861 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
862 cur->fts_info = FTS_ERR;
867 /* If didn't find anything, return NULL. */
870 cur->fts_info = FTS_DP;
874 /* Sort the entries. */
875 if (sp->fts_compar && nitems > 1)
876 head = fts_sort(sp, head, nitems);
881 fts_stat(sp, p, follow)
889 struct stat *sbp, sb;
892 /* If user needs stat info, stat buffer already allocated. */
893 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
896 /* Check for whiteout. */
897 if (p->fts_flags & FTS_ISW) {
899 memset(sbp, '\0', sizeof(*sbp));
900 sbp->st_mode = S_IFWHT;
907 * If doing a logical walk, or application requested FTS_FOLLOW, do
908 * a stat(2). If that fails, check for a non-existent symlink. If
909 * fail, set the errno from the stat call.
911 if (ISSET(FTS_LOGICAL) || follow) {
912 if (stat(p->fts_accpath, sbp)) {
914 if (!lstat(p->fts_accpath, sbp)) {
918 p->fts_errno = saved_errno;
921 } else if (lstat(p->fts_accpath, sbp)) {
922 p->fts_errno = errno;
923 err: memset(sbp, 0, sizeof(struct stat));
927 if (S_ISDIR(sbp->st_mode)) {
929 * Set the device/inode. Used to find cycles and check for
930 * crossing mount points. Also remember the link count, used
931 * in fts_build to limit the number of stat calls. It is
932 * understood that these fields are only referenced if fts_info
935 dev = p->fts_dev = sbp->st_dev;
936 ino = p->fts_ino = sbp->st_ino;
937 p->fts_nlink = sbp->st_nlink;
939 if (ISDOT(p->fts_name))
943 * Cycle detection is done by brute force when the directory
944 * is first encountered. If the tree gets deep enough or the
945 * number of symbolic links to directories is high enough,
946 * something faster might be worthwhile.
948 for (t = p->fts_parent;
949 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
950 if (ino == t->fts_ino && dev == t->fts_dev) {
956 if (S_ISLNK(sbp->st_mode))
958 if (S_ISREG(sbp->st_mode))
960 return (FTS_DEFAULT);
964 * The comparison function takes pointers to pointers to FTSENT structures.
965 * Qsort wants a comparison function that takes pointers to void.
966 * (Both with appropriate levels of const-poisoning, of course!)
967 * Use a trampoline function to deal with the difference.
970 fts_compar(const void *a, const void *b)
974 parent = (*(const FTSENT * const *)a)->fts_fts;
975 return (*parent->fts_compar)(a, b);
979 fts_sort(sp, head, nitems)
987 * Construct an array of pointers to the structures and call qsort(3).
988 * Reassemble the array in the order returned by qsort. If unable to
989 * sort for memory reasons, return the directory entries in their
990 * current order. Allocate enough space for the current needs plus
991 * 40 so don't realloc one entry at a time.
993 if (nitems > sp->fts_nitems) {
994 sp->fts_nitems = nitems + 40;
995 if ((sp->fts_array = reallocf(sp->fts_array,
996 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
1001 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
1003 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
1004 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1005 ap[0]->fts_link = ap[1];
1006 ap[0]->fts_link = NULL;
1011 fts_alloc(sp, name, namelen)
1019 struct ftsent_withstat {
1021 struct stat statbuf;
1025 * The file name is a variable length array and no stat structure is
1026 * necessary if the user has set the nostat bit. Allocate the FTSENT
1027 * structure, the file name and the stat structure in one chunk, but
1028 * be careful that the stat structure is reasonably aligned.
1030 if (ISSET(FTS_NOSTAT))
1031 len = sizeof(FTSENT) + namelen + 1;
1033 len = sizeof(struct ftsent_withstat) + namelen + 1;
1035 if ((p = malloc(len)) == NULL)
1038 if (ISSET(FTS_NOSTAT)) {
1039 p->fts_name = (char *)(p + 1);
1040 p->fts_statp = NULL;
1042 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1043 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1046 /* Copy the name and guarantee NUL termination. */
1047 memcpy(p->fts_name, name, namelen);
1048 p->fts_name[namelen] = '\0';
1049 p->fts_namelen = namelen;
1050 p->fts_path = sp->fts_path;
1053 p->fts_instr = FTS_NOINSTR;
1055 p->fts_pointer = NULL;
1066 /* Free a linked list of structures. */
1067 while ((p = head)) {
1068 head = head->fts_link;
1074 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1075 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1076 * though the kernel won't resolve them. Add the size (not just what's needed)
1077 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1080 fts_palloc(sp, more)
1085 sp->fts_pathlen += more + 256;
1086 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1087 return (sp->fts_path == NULL);
1091 * When the path is realloc'd, have to fix all of the pointers in structures
1095 fts_padjust(sp, head)
1100 char *addr = sp->fts_path;
1102 #define ADJUST(p) do { \
1103 if ((p)->fts_accpath != (p)->fts_name) { \
1104 (p)->fts_accpath = \
1105 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1107 (p)->fts_path = addr; \
1109 /* Adjust the current set of children. */
1110 for (p = sp->fts_child; p; p = p->fts_link)
1113 /* Adjust the rest of the tree, including the current level. */
1114 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1116 p = p->fts_link ? p->fts_link : p->fts_parent;
1126 for (max = 0; *argv; ++argv)
1127 if ((len = strlen(*argv)) > max)
1133 * Change to dir specified by fd or p->fts_accpath without getting
1134 * tricked by someone changing the world out from underneath us.
1135 * Assumes p->fts_dev and p->fts_ino are filled in.
1138 fts_safe_changedir(sp, p, fd, 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);