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[] = {
110 fts_open(argv, options, compar)
113 int (*compar)(const FTSENT * const *, const FTSENT * const *);
115 struct _fts_private *priv;
118 FTSENT *parent, *tmp;
122 if (options & ~FTS_OPTIONMASK) {
127 /* Allocate/initialize the stream. */
128 if ((priv = malloc(sizeof(*priv))) == NULL)
130 memset(priv, 0, sizeof(*priv));
131 sp = &priv->ftsp_fts;
132 sp->fts_compar = compar;
133 sp->fts_options = options;
138 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
139 if (ISSET(FTS_LOGICAL))
143 * Start out with 1K of path space, and enough, in any case,
144 * to hold the user's paths.
146 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
149 /* Allocate/initialize root's parent. */
150 if ((parent = fts_alloc(sp, "", 0)) == NULL)
152 parent->fts_level = FTS_ROOTPARENTLEVEL;
154 /* Allocate/initialize root(s). */
155 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
156 /* Don't allow zero-length paths. */
157 if ((len = strlen(*argv)) == 0) {
162 p = fts_alloc(sp, *argv, len);
163 p->fts_level = FTS_ROOTLEVEL;
164 p->fts_parent = parent;
165 p->fts_accpath = p->fts_name;
166 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
168 /* Command-line "." and ".." are real directories. */
169 if (p->fts_info == FTS_DOT)
173 * If comparison routine supplied, traverse in sorted
174 * order; otherwise traverse in the order specified.
189 if (compar && nitems > 1)
190 root = fts_sort(sp, root, nitems);
193 * Allocate a dummy pointer and make fts_read think that we've just
194 * finished the node before the root(s); set p->fts_info to FTS_INIT
195 * so that everything about the "current" node is ignored.
197 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
199 sp->fts_cur->fts_link = root;
200 sp->fts_cur->fts_info = FTS_INIT;
203 * If using chdir(2), grab a file descriptor pointing to dot to ensure
204 * that we can get back here; this could be avoided for some paths,
205 * but almost certainly not worth the effort. Slashes, symbolic links,
206 * and ".." are all fairly nasty problems. Note, if we can't get the
207 * descriptor we run anyway, just more slowly.
209 if (!ISSET(FTS_NOCHDIR) && (sp->fts_rfd = _open(".", O_RDONLY, 0)) < 0)
214 mem3: fts_lfree(root);
216 mem2: free(sp->fts_path);
230 * Load the stream structure for the next traversal. Since we don't
231 * actually enter the directory until after the preorder visit, set
232 * the fts_accpath field specially so the chdir gets done to the right
233 * place and the user can access the first node. From fts_open it's
234 * known that the path will fit.
236 len = p->fts_pathlen = p->fts_namelen;
237 memmove(sp->fts_path, p->fts_name, len + 1);
238 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
240 memmove(p->fts_name, cp, len + 1);
241 p->fts_namelen = len;
243 p->fts_accpath = p->fts_path = sp->fts_path;
244 sp->fts_dev = p->fts_dev;
255 * This still works if we haven't read anything -- the dummy structure
256 * points to the root list, so we step through to the end of the root
257 * list which has a valid parent pointer.
260 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
262 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
268 /* Free up child linked list, sort array, path buffer. */
270 fts_lfree(sp->fts_child);
275 /* Return to original directory, save errno if necessary. */
276 if (!ISSET(FTS_NOCHDIR)) {
277 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
278 (void)_close(sp->fts_rfd);
280 /* Set errno and return. */
281 if (saved_errno != 0) {
282 /* Free up the stream pointer. */
289 /* Free up the stream pointer. */
295 * Special case of "/" at the end of the path so that slashes aren't
296 * appended which would cause paths to be written as "....//foo".
299 (p->fts_path[p->fts_pathlen - 1] == '/' \
300 ? p->fts_pathlen - 1 : p->fts_pathlen)
311 /* If finished or unrecoverable error, return NULL. */
312 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
315 /* Set current node pointer. */
318 /* Save and zero out user instructions. */
319 instr = p->fts_instr;
320 p->fts_instr = FTS_NOINSTR;
322 /* Any type of file may be re-visited; re-stat and re-turn. */
323 if (instr == FTS_AGAIN) {
324 p->fts_info = fts_stat(sp, p, 0);
329 * Following a symlink -- SLNONE test allows application to see
330 * SLNONE and recover. If indirecting through a symlink, have
331 * keep a pointer to current location. If unable to get that
332 * pointer, follow fails.
334 if (instr == FTS_FOLLOW &&
335 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
336 p->fts_info = fts_stat(sp, p, 1);
337 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
338 if ((p->fts_symfd = _open(".", O_RDONLY, 0)) < 0) {
339 p->fts_errno = errno;
340 p->fts_info = FTS_ERR;
342 p->fts_flags |= FTS_SYMFOLLOW;
347 /* Directory in pre-order. */
348 if (p->fts_info == FTS_D) {
349 /* If skipped or crossed mount point, do post-order visit. */
350 if (instr == FTS_SKIP ||
351 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
352 if (p->fts_flags & FTS_SYMFOLLOW)
353 (void)_close(p->fts_symfd);
355 fts_lfree(sp->fts_child);
356 sp->fts_child = NULL;
358 p->fts_info = FTS_DP;
362 /* Rebuild if only read the names and now traversing. */
363 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
365 fts_lfree(sp->fts_child);
366 sp->fts_child = NULL;
370 * Cd to the subdirectory.
372 * If have already read and now fail to chdir, whack the list
373 * to make the names come out right, and set the parent errno
374 * so the application will eventually get an error condition.
375 * Set the FTS_DONTCHDIR flag so that when we logically change
376 * directories back to the parent we don't do a chdir.
378 * If haven't read do so. If the read fails, fts_build sets
379 * FTS_STOP or the fts_info field of the node.
381 if (sp->fts_child != NULL) {
382 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
383 p->fts_errno = errno;
384 p->fts_flags |= FTS_DONTCHDIR;
385 for (p = sp->fts_child; p != NULL;
388 p->fts_parent->fts_accpath;
390 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
396 sp->fts_child = NULL;
400 /* Move to the next node on this level. */
402 if ((p = p->fts_link) != NULL) {
406 * If reached the top, return to the original directory (or
407 * the root of the tree), and load the paths for the next root.
409 if (p->fts_level == FTS_ROOTLEVEL) {
410 if (FCHDIR(sp, sp->fts_rfd)) {
415 return (sp->fts_cur = p);
419 * User may have called fts_set on the node. If skipped,
420 * ignore. If followed, get a file descriptor so we can
421 * get back if necessary.
423 if (p->fts_instr == FTS_SKIP)
425 if (p->fts_instr == FTS_FOLLOW) {
426 p->fts_info = fts_stat(sp, p, 1);
427 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
429 _open(".", O_RDONLY, 0)) < 0) {
430 p->fts_errno = errno;
431 p->fts_info = FTS_ERR;
433 p->fts_flags |= FTS_SYMFOLLOW;
435 p->fts_instr = FTS_NOINSTR;
438 name: t = sp->fts_path + NAPPEND(p->fts_parent);
440 memmove(t, p->fts_name, p->fts_namelen + 1);
441 return (sp->fts_cur = p);
444 /* Move up to the parent node. */
448 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
450 * Done; free everything up and set errno to 0 so the user
451 * can distinguish between error and EOF.
455 return (sp->fts_cur = NULL);
458 /* NUL terminate the pathname. */
459 sp->fts_path[p->fts_pathlen] = '\0';
462 * Return to the parent directory. If at a root node or came through
463 * a symlink, go back through the file descriptor. Otherwise, cd up
466 if (p->fts_level == FTS_ROOTLEVEL) {
467 if (FCHDIR(sp, sp->fts_rfd)) {
471 } else if (p->fts_flags & FTS_SYMFOLLOW) {
472 if (FCHDIR(sp, p->fts_symfd)) {
474 (void)_close(p->fts_symfd);
479 (void)_close(p->fts_symfd);
480 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
481 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
485 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
486 return (sp->fts_cur = p);
490 * Fts_set takes the stream as an argument although it's not used in this
491 * implementation; it would be necessary if anyone wanted to add global
492 * semantics to fts using fts_set. An error return is allowed for similar
497 fts_set(sp, p, instr)
502 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
503 instr != FTS_NOINSTR && instr != FTS_SKIP) {
507 p->fts_instr = instr;
512 fts_children(sp, instr)
519 if (instr != 0 && instr != FTS_NAMEONLY) {
524 /* Set current node pointer. */
528 * Errno set to 0 so user can distinguish empty directory from
533 /* Fatal errors stop here. */
537 /* Return logical hierarchy of user's arguments. */
538 if (p->fts_info == FTS_INIT)
539 return (p->fts_link);
542 * If not a directory being visited in pre-order, stop here. Could
543 * allow FTS_DNR, assuming the user has fixed the problem, but the
544 * same effect is available with FTS_AGAIN.
546 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
549 /* Free up any previous child list. */
550 if (sp->fts_child != NULL)
551 fts_lfree(sp->fts_child);
553 if (instr == FTS_NAMEONLY) {
560 * If using chdir on a relative path and called BEFORE fts_read does
561 * its chdir to the root of a traversal, we can lose -- we need to
562 * chdir into the subdirectory, and we don't know where the current
563 * directory is, so we can't get back so that the upcoming chdir by
564 * fts_read will work.
566 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
568 return (sp->fts_child = fts_build(sp, instr));
570 if ((fd = _open(".", O_RDONLY, 0)) < 0)
572 sp->fts_child = fts_build(sp, instr);
578 return (sp->fts_child);
581 #ifndef fts_get_clientptr
582 #error "fts_get_clientptr not defined"
586 (fts_get_clientptr)(FTS *sp)
589 return (fts_get_clientptr(sp));
592 #ifndef fts_get_stream
593 #error "fts_get_stream not defined"
597 (fts_get_stream)(FTSENT *p)
599 return (fts_get_stream(p));
603 fts_set_clientptr(FTS *sp, void *clientptr)
606 sp->fts_clientptr = clientptr;
610 * This is the tricky part -- do not casually change *anything* in here. The
611 * idea is to build the linked list of entries that are used by fts_children
612 * and fts_read. There are lots of special cases.
614 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
615 * set and it's a physical walk (so that symbolic links can't be directories),
616 * we can do things quickly. First, if it's a 4.4BSD file system, the type
617 * of the file is in the directory entry. Otherwise, we assume that the number
618 * of subdirectories in a node is equal to the number of links to the parent.
619 * The former skips all stat calls. The latter skips stat calls in any leaf
620 * directories and for any files after the subdirectories in the directory have
621 * been found, cutting the stat calls by about 2/3.
634 int cderrno, descend, oflag, saved_errno, nostat, doadjust;
636 long nlinks; /* has to be signed because -1 is a magic value */
637 size_t dnamlen, len, maxlen, nitems;
639 /* Set current node pointer. */
643 * Open the directory for reading. If this fails, we're done.
644 * If being called from fts_read, set the fts_info field.
647 if (ISSET(FTS_WHITEOUT))
648 oflag = DTF_NODUP | DTF_REWIND;
650 oflag = DTF_HIDEW | DTF_NODUP | DTF_REWIND;
652 #define __opendir2(path, flag) opendir(path)
654 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
656 cur->fts_info = FTS_DNR;
657 cur->fts_errno = errno;
663 * Nlinks is the number of possible entries of type directory in the
664 * directory if we're cheating on stat calls, 0 if we're not doing
665 * any stat calls at all, -1 if we're doing stats on everything.
667 if (type == BNAMES) {
669 /* Be quiet about nostat, GCC. */
671 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
672 if (fts_ufslinks(sp, cur))
673 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
683 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
684 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
685 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
688 * If we're going to need to stat anything or we want to descend
689 * and stay in the directory, chdir. If this fails we keep going,
690 * but set a flag so we don't chdir after the post-order visit.
691 * We won't be able to stat anything, but we can still return the
692 * names themselves. Note, that since fts_read won't be able to
693 * chdir into the directory, it will have to return different path
694 * names than before, i.e. "a/b" instead of "b". Since the node
695 * has already been visited in pre-order, have to wait until the
696 * post-order visit to return the error. There is a special case
697 * here, if there was nothing to stat then it's not an error to
698 * not be able to stat. This is all fairly nasty. If a program
699 * needed sorted entries or stat information, they had better be
700 * checking FTS_NS on the returned nodes.
703 if (nlinks || type == BREAD) {
704 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
705 if (nlinks && type == BREAD)
706 cur->fts_errno = errno;
707 cur->fts_flags |= FTS_DONTCHDIR;
716 * Figure out the max file name length that can be stored in the
717 * current path -- the inner loop allocates more path as necessary.
718 * We really wouldn't have to do the maxlen calculations here, we
719 * could do them in fts_read before returning the path, but it's a
720 * lot easier here since the length is part of the dirent structure.
722 * If not changing directories set a pointer so that can just append
723 * each new name into the path.
726 if (ISSET(FTS_NOCHDIR)) {
727 cp = sp->fts_path + len;
730 /* GCC, you're too verbose. */
734 maxlen = sp->fts_pathlen - len;
736 level = cur->fts_level + 1;
738 /* Read the directory, attaching each entry to the `link' pointer. */
740 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
741 dnamlen = dp->d_namlen;
742 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
745 if ((p = fts_alloc(sp, dp->d_name, dnamlen)) == NULL)
747 if (dnamlen >= maxlen) { /* include space for NUL */
748 oldaddr = sp->fts_path;
749 if (fts_palloc(sp, dnamlen + len + 1)) {
751 * No more memory for path or structures. Save
752 * errno, free up the current structure and the
753 * structures already allocated.
755 mem1: saved_errno = errno;
759 (void)closedir(dirp);
760 cur->fts_info = FTS_ERR;
765 /* Did realloc() change the pointer? */
766 if (oldaddr != sp->fts_path) {
768 if (ISSET(FTS_NOCHDIR))
769 cp = sp->fts_path + len;
771 maxlen = sp->fts_pathlen - len;
774 p->fts_level = level;
775 p->fts_parent = sp->fts_cur;
776 p->fts_pathlen = len + dnamlen;
779 if (dp->d_type == DT_WHT)
780 p->fts_flags |= FTS_ISW;
785 p->fts_info = FTS_NS;
786 p->fts_errno = cderrno;
788 p->fts_info = FTS_NSOK;
789 p->fts_accpath = cur->fts_accpath;
790 } else if (nlinks == 0
793 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
797 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
798 p->fts_info = FTS_NSOK;
800 /* Build a file name for fts_stat to stat. */
801 if (ISSET(FTS_NOCHDIR)) {
802 p->fts_accpath = p->fts_path;
803 memmove(cp, p->fts_name, p->fts_namelen + 1);
805 p->fts_accpath = p->fts_name;
807 p->fts_info = fts_stat(sp, p, 0);
809 /* Decrement link count if applicable. */
810 if (nlinks > 0 && (p->fts_info == FTS_D ||
811 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
815 /* We walk in directory order so "ls -f" doesn't get upset. */
826 (void)closedir(dirp);
829 * If realloc() changed the address of the path, adjust the
830 * addresses for the rest of the tree and the dir list.
833 fts_padjust(sp, head);
836 * If not changing directories, reset the path back to original
839 if (ISSET(FTS_NOCHDIR)) {
840 if (len == sp->fts_pathlen || nitems == 0)
846 * If descended after called from fts_children or after called from
847 * fts_read and nothing found, get back. At the root level we use
848 * the saved fd; if one of fts_open()'s arguments is a relative path
849 * to an empty directory, we wind up here with no other way back. If
850 * can't get back, we're done.
852 if (descend && (type == BCHILD || !nitems) &&
853 (cur->fts_level == FTS_ROOTLEVEL ?
854 FCHDIR(sp, sp->fts_rfd) :
855 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
856 cur->fts_info = FTS_ERR;
861 /* If didn't find anything, return NULL. */
864 cur->fts_info = FTS_DP;
868 /* Sort the entries. */
869 if (sp->fts_compar && nitems > 1)
870 head = fts_sort(sp, head, nitems);
875 fts_stat(sp, p, follow)
883 struct stat *sbp, sb;
886 /* If user needs stat info, stat buffer already allocated. */
887 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
890 /* Check for whiteout. */
891 if (p->fts_flags & FTS_ISW) {
893 memset(sbp, '\0', sizeof(*sbp));
894 sbp->st_mode = S_IFWHT;
901 * If doing a logical walk, or application requested FTS_FOLLOW, do
902 * a stat(2). If that fails, check for a non-existent symlink. If
903 * fail, set the errno from the stat call.
905 if (ISSET(FTS_LOGICAL) || follow) {
906 if (stat(p->fts_accpath, sbp)) {
908 if (!lstat(p->fts_accpath, sbp)) {
912 p->fts_errno = saved_errno;
915 } else if (lstat(p->fts_accpath, sbp)) {
916 p->fts_errno = errno;
917 err: memset(sbp, 0, sizeof(struct stat));
921 if (S_ISDIR(sbp->st_mode)) {
923 * Set the device/inode. Used to find cycles and check for
924 * crossing mount points. Also remember the link count, used
925 * in fts_build to limit the number of stat calls. It is
926 * understood that these fields are only referenced if fts_info
929 dev = p->fts_dev = sbp->st_dev;
930 ino = p->fts_ino = sbp->st_ino;
931 p->fts_nlink = sbp->st_nlink;
933 if (ISDOT(p->fts_name))
937 * Cycle detection is done by brute force when the directory
938 * is first encountered. If the tree gets deep enough or the
939 * number of symbolic links to directories is high enough,
940 * something faster might be worthwhile.
942 for (t = p->fts_parent;
943 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
944 if (ino == t->fts_ino && dev == t->fts_dev) {
950 if (S_ISLNK(sbp->st_mode))
952 if (S_ISREG(sbp->st_mode))
954 return (FTS_DEFAULT);
958 * The comparison function takes pointers to pointers to FTSENT structures.
959 * Qsort wants a comparison function that takes pointers to void.
960 * (Both with appropriate levels of const-poisoning, of course!)
961 * Use a trampoline function to deal with the difference.
964 fts_compar(const void *a, const void *b)
968 parent = (*(const FTSENT * const *)a)->fts_fts;
969 return (*parent->fts_compar)(a, b);
973 fts_sort(sp, head, nitems)
981 * Construct an array of pointers to the structures and call qsort(3).
982 * Reassemble the array in the order returned by qsort. If unable to
983 * sort for memory reasons, return the directory entries in their
984 * current order. Allocate enough space for the current needs plus
985 * 40 so don't realloc one entry at a time.
987 if (nitems > sp->fts_nitems) {
988 sp->fts_nitems = nitems + 40;
989 if ((sp->fts_array = reallocf(sp->fts_array,
990 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
995 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
997 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
998 for (head = *(ap = sp->fts_array); --nitems; ++ap)
999 ap[0]->fts_link = ap[1];
1000 ap[0]->fts_link = NULL;
1005 fts_alloc(sp, name, namelen)
1013 struct ftsent_withstat {
1015 struct stat statbuf;
1019 * The file name is a variable length array and no stat structure is
1020 * necessary if the user has set the nostat bit. Allocate the FTSENT
1021 * structure, the file name and the stat structure in one chunk, but
1022 * be careful that the stat structure is reasonably aligned.
1024 if (ISSET(FTS_NOSTAT))
1025 len = sizeof(FTSENT) + namelen + 1;
1027 len = sizeof(struct ftsent_withstat) + namelen + 1;
1029 if ((p = malloc(len)) == NULL)
1032 if (ISSET(FTS_NOSTAT)) {
1033 p->fts_name = (char *)(p + 1);
1034 p->fts_statp = NULL;
1036 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1037 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1040 /* Copy the name and guarantee NUL termination. */
1041 memcpy(p->fts_name, name, namelen);
1042 p->fts_name[namelen] = '\0';
1043 p->fts_namelen = namelen;
1044 p->fts_path = sp->fts_path;
1047 p->fts_instr = FTS_NOINSTR;
1049 p->fts_pointer = NULL;
1060 /* Free a linked list of structures. */
1061 while ((p = head)) {
1062 head = head->fts_link;
1068 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1069 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1070 * though the kernel won't resolve them. Add the size (not just what's needed)
1071 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1074 fts_palloc(sp, more)
1079 sp->fts_pathlen += more + 256;
1080 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1081 return (sp->fts_path == NULL);
1085 * When the path is realloc'd, have to fix all of the pointers in structures
1089 fts_padjust(sp, head)
1094 char *addr = sp->fts_path;
1096 #define ADJUST(p) do { \
1097 if ((p)->fts_accpath != (p)->fts_name) { \
1098 (p)->fts_accpath = \
1099 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1101 (p)->fts_path = addr; \
1103 /* Adjust the current set of children. */
1104 for (p = sp->fts_child; p; p = p->fts_link)
1107 /* Adjust the rest of the tree, including the current level. */
1108 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1110 p = p->fts_link ? p->fts_link : p->fts_parent;
1120 for (max = 0; *argv; ++argv)
1121 if ((len = strlen(*argv)) > max)
1127 * Change to dir specified by fd or p->fts_accpath without getting
1128 * tricked by someone changing the world out from underneath us.
1129 * Assumes p->fts_dev and p->fts_ino are filled in.
1132 fts_safe_changedir(sp, p, fd, path)
1138 int ret, oerrno, newfd;
1142 if (ISSET(FTS_NOCHDIR))
1144 if (fd < 0 && (newfd = _open(path, O_RDONLY, 0)) < 0)
1146 if (_fstat(newfd, &sb)) {
1150 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1151 errno = ENOENT; /* disinformation */
1155 ret = fchdir(newfd);
1159 (void)_close(newfd);
1165 * Check if the filesystem for "ent" has UFS-style links.
1168 fts_ufslinks(FTS *sp, const FTSENT *ent)
1170 struct _fts_private *priv;
1173 priv = (struct _fts_private *)sp;
1175 * If this node's device is different from the previous, grab
1176 * the filesystem information, and decide on the reliability
1177 * of the link information from this filesystem for stat(2)
1180 if (priv->ftsp_dev != ent->fts_dev) {
1181 if (statfs(ent->fts_path, &priv->ftsp_statfs) != -1) {
1182 priv->ftsp_dev = ent->fts_dev;
1183 priv->ftsp_linksreliable = 0;
1184 for (cpp = ufslike_filesystems; *cpp; cpp++) {
1185 if (strcmp(priv->ftsp_statfs.f_fstypename,
1187 priv->ftsp_linksreliable = 1;
1192 priv->ftsp_linksreliable = 0;
1195 return (priv->ftsp_linksreliable);