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 * 3. 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 * From: @(#)fts.c 8.6 (Berkeley) 8/14/94
30 * From: $OpenBSD: fts.c,v 1.22 1999/10/03 19:22:22 millert Exp $
33 #include <sys/cdefs.h>
34 __FBSDID("$FreeBSD$");
36 #include "namespace.h"
37 #include <sys/param.h>
38 #define _WANT_FREEBSD11_STATFS
39 #include <sys/mount.h>
40 #define _WANT_FREEBSD11_STAT
43 #define _WANT_FREEBSD11_DIRENT
51 #include "gen-compat.h"
52 #include "fts-compat11.h"
53 #include "un-namespace.h"
55 #include "gen-private.h"
57 static FTSENT11 *fts_alloc(FTS11 *, char *, size_t);
58 static FTSENT11 *fts_build(FTS11 *, int);
59 static void fts_lfree(FTSENT11 *);
60 static void fts_load(FTS11 *, FTSENT11 *);
61 static size_t fts_maxarglen(char * const *);
62 static void fts_padjust(FTS11 *, FTSENT11 *);
63 static int fts_palloc(FTS11 *, size_t);
64 static FTSENT11 *fts_sort(FTS11 *, FTSENT11 *, size_t);
65 static int fts_stat(FTS11 *, FTSENT11 *, int, int);
66 static int fts_safe_changedir(FTS11 *, FTSENT11 *, int, char *);
67 static int fts_ufslinks(FTS11 *, const FTSENT11 *);
69 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
71 #define CLR(opt) (sp->fts_options &= ~(opt))
72 #define ISSET(opt) (sp->fts_options & (opt))
73 #define SET(opt) (sp->fts_options |= (opt))
75 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
78 #define BCHILD 1 /* fts_children */
79 #define BNAMES 2 /* fts_children, names only */
80 #define BREAD 3 /* fts_read */
83 * Internal representation of an FTS, including extra implementation
84 * details. The FTS returned from fts_open points to this structure's
85 * ftsp_fts member (and can be cast to an _fts_private as required)
87 struct _fts_private11 {
89 struct freebsd11_statfs ftsp_statfs;
91 int ftsp_linksreliable;
95 * The "FTS_NOSTAT" option can avoid a lot of calls to stat(2) if it
96 * knows that a directory could not possibly have subdirectories. This
97 * is decided by looking at the link count: a subdirectory would
98 * increment its parent's link count by virtue of its own ".." entry.
99 * This assumption only holds for UFS-like filesystems that implement
100 * links and directories this way, so we must punt for others.
103 static const char *ufslike_filesystems[] = {
112 freebsd11_fts_open(char * const *argv, int options,
113 int (*compar)(const FTSENT11 * const *, const FTSENT11 * const *))
115 struct _fts_private11 *priv;
118 FTSENT11 *parent, *tmp;
122 if (options & ~FTS_OPTIONMASK) {
127 /* fts_open() requires at least one path */
133 /* Allocate/initialize the stream. */
134 if ((priv = calloc(1, sizeof(*priv))) == NULL)
136 sp = &priv->ftsp_fts;
137 sp->fts_compar = compar;
138 sp->fts_options = options;
140 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
141 if (ISSET(FTS_LOGICAL))
145 * Start out with 1K of path space, and enough, in any case,
146 * to hold the user's paths.
148 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
151 /* Allocate/initialize root's parent. */
152 if ((parent = fts_alloc(sp, "", 0)) == NULL)
154 parent->fts_level = FTS_ROOTPARENTLEVEL;
159 /* Allocate/initialize root(s). */
160 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
163 p = fts_alloc(sp, *argv, len);
164 p->fts_level = FTS_ROOTLEVEL;
165 p->fts_parent = parent;
166 p->fts_accpath = p->fts_name;
167 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW), -1);
169 /* Command-line "." and ".." are real directories. */
170 if (p->fts_info == FTS_DOT)
174 * If comparison routine supplied, traverse in sorted
175 * order; otherwise traverse in the order specified.
190 if (compar && nitems > 1)
191 root = fts_sort(sp, root, nitems);
194 * Allocate a dummy pointer and make fts_read think that we've just
195 * finished the node before the root(s); set p->fts_info to FTS_INIT
196 * so that everything about the "current" node is ignored.
198 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
200 sp->fts_cur->fts_link = root;
201 sp->fts_cur->fts_info = FTS_INIT;
204 * If using chdir(2), grab a file descriptor pointing to dot to ensure
205 * that we can get back here; this could be avoided for some paths,
206 * but almost certainly not worth the effort. Slashes, symbolic links,
207 * and ".." are all fairly nasty problems. Note, if we can't get the
208 * descriptor we run anyway, just more slowly.
210 if (!ISSET(FTS_NOCHDIR) &&
211 (sp->fts_rfd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
216 mem3: fts_lfree(root);
218 mem2: free(sp->fts_path);
224 fts_load(FTS11 *sp, FTSENT11 *p)
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;
248 freebsd11_fts_close(FTS11 *sp)
254 * This still works if we haven't read anything -- the dummy structure
255 * points to the root list, so we step through to the end of the root
256 * list which has a valid parent pointer.
259 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
261 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
267 /* Free up child linked list, sort array, path buffer. */
269 fts_lfree(sp->fts_child);
274 /* Return to original directory, save errno if necessary. */
275 if (!ISSET(FTS_NOCHDIR)) {
276 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
277 (void)_close(sp->fts_rfd);
279 /* Set errno and return. */
280 if (saved_errno != 0) {
281 /* Free up the stream pointer. */
288 /* Free up the stream pointer. */
294 * Special case of "/" at the end of the path so that slashes aren't
295 * appended which would cause paths to be written as "....//foo".
298 (p->fts_path[p->fts_pathlen - 1] == '/' \
299 ? p->fts_pathlen - 1 : p->fts_pathlen)
302 freebsd11_fts_read(FTS11 *sp)
309 /* If finished or unrecoverable error, return NULL. */
310 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
313 /* Set current node pointer. */
316 /* Save and zero out user instructions. */
317 instr = p->fts_instr;
318 p->fts_instr = FTS_NOINSTR;
320 /* Any type of file may be re-visited; re-stat and re-turn. */
321 if (instr == FTS_AGAIN) {
322 p->fts_info = fts_stat(sp, p, 0, -1);
327 * Following a symlink -- SLNONE test allows application to see
328 * SLNONE and recover. If indirecting through a symlink, have
329 * keep a pointer to current location. If unable to get that
330 * pointer, follow fails.
332 if (instr == FTS_FOLLOW &&
333 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
334 p->fts_info = fts_stat(sp, p, 1, -1);
335 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
336 if ((p->fts_symfd = _open(".", O_RDONLY | O_CLOEXEC,
338 p->fts_errno = errno;
339 p->fts_info = FTS_ERR;
341 p->fts_flags |= FTS_SYMFOLLOW;
346 /* Directory in pre-order. */
347 if (p->fts_info == FTS_D) {
348 /* If skipped or crossed mount point, do post-order visit. */
349 if (instr == FTS_SKIP ||
350 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
351 if (p->fts_flags & FTS_SYMFOLLOW)
352 (void)_close(p->fts_symfd);
354 fts_lfree(sp->fts_child);
355 sp->fts_child = NULL;
357 p->fts_info = FTS_DP;
361 /* Rebuild if only read the names and now traversing. */
362 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
364 fts_lfree(sp->fts_child);
365 sp->fts_child = NULL;
369 * Cd to the subdirectory.
371 * If have already read and now fail to chdir, whack the list
372 * to make the names come out right, and set the parent errno
373 * so the application will eventually get an error condition.
374 * Set the FTS_DONTCHDIR flag so that when we logically change
375 * directories back to the parent we don't do a chdir.
377 * If haven't read do so. If the read fails, fts_build sets
378 * FTS_STOP or the fts_info field of the node.
380 if (sp->fts_child != NULL) {
381 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
382 p->fts_errno = errno;
383 p->fts_flags |= FTS_DONTCHDIR;
384 for (p = sp->fts_child; p != NULL;
387 p->fts_parent->fts_accpath;
389 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
395 sp->fts_child = NULL;
399 /* Move to the next node on this level. */
401 if ((p = p->fts_link) != NULL) {
403 * If reached the top, return to the original directory (or
404 * the root of the tree), and load the paths for the next root.
406 if (p->fts_level == FTS_ROOTLEVEL) {
407 if (FCHDIR(sp, sp->fts_rfd)) {
413 return (sp->fts_cur = p);
417 * User may have called fts_set on the node. If skipped,
418 * ignore. If followed, get a file descriptor so we can
419 * get back if necessary.
421 if (p->fts_instr == FTS_SKIP) {
425 if (p->fts_instr == FTS_FOLLOW) {
426 p->fts_info = fts_stat(sp, p, 1, -1);
427 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
429 _open(".", O_RDONLY | O_CLOEXEC, 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;
440 name: t = sp->fts_path + NAPPEND(p->fts_parent);
442 memmove(t, p->fts_name, p->fts_namelen + 1);
443 return (sp->fts_cur = p);
446 /* Move up to the parent node. */
449 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
451 * Done; free everything up and set errno to 0 so the user
452 * can distinguish between error and EOF.
457 return (sp->fts_cur = NULL);
460 /* NUL terminate the pathname. */
461 sp->fts_path[p->fts_pathlen] = '\0';
464 * Return to the parent directory. If at a root node or came through
465 * a symlink, go back through the file descriptor. Otherwise, cd up
468 if (p->fts_level == FTS_ROOTLEVEL) {
469 if (FCHDIR(sp, sp->fts_rfd)) {
473 } else if (p->fts_flags & FTS_SYMFOLLOW) {
474 if (FCHDIR(sp, p->fts_symfd)) {
476 (void)_close(p->fts_symfd);
481 (void)_close(p->fts_symfd);
482 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
483 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
488 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
489 return (sp->fts_cur = p);
493 * Fts_set takes the stream as an argument although it's not used in this
494 * implementation; it would be necessary if anyone wanted to add global
495 * semantics to fts using fts_set. An error return is allowed for similar
500 freebsd11_fts_set(FTS11 *sp, FTSENT11 *p, int instr)
502 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
503 instr != FTS_NOINSTR && instr != FTS_SKIP) {
507 p->fts_instr = instr;
512 freebsd11_fts_children(FTS11 *sp, int instr)
517 if (instr != 0 && instr != FTS_NAMEONLY) {
522 /* Set current node pointer. */
526 * Errno set to 0 so user can distinguish empty directory from
531 /* Fatal errors stop here. */
535 /* Return logical hierarchy of user's arguments. */
536 if (p->fts_info == FTS_INIT)
537 return (p->fts_link);
540 * If not a directory being visited in pre-order, stop here. Could
541 * allow FTS_DNR, assuming the user has fixed the problem, but the
542 * same effect is available with FTS_AGAIN.
544 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
547 /* Free up any previous child list. */
548 if (sp->fts_child != NULL)
549 fts_lfree(sp->fts_child);
551 if (instr == FTS_NAMEONLY) {
558 * If using chdir on a relative path and called BEFORE fts_read does
559 * its chdir to the root of a traversal, we can lose -- we need to
560 * chdir into the subdirectory, and we don't know where the current
561 * directory is, so we can't get back so that the upcoming chdir by
562 * fts_read will work.
564 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
566 return (sp->fts_child = fts_build(sp, instr));
568 if ((fd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
570 sp->fts_child = fts_build(sp, instr);
571 serrno = (sp->fts_child == NULL) ? errno : 0;
573 if (rc < 0 && serrno == 0)
579 return (sp->fts_child);
582 #ifndef freebsd11_fts_get_clientptr
583 #error "freebsd11_fts_get_clientptr not defined"
587 (freebsd11_fts_get_clientptr)(FTS11 *sp)
590 return (freebsd11_fts_get_clientptr(sp));
593 #ifndef freebsd11_fts_get_stream
594 #error "freebsd11_fts_get_stream not defined"
598 (freebsd11_fts_get_stream)(FTSENT11 *p)
600 return (freebsd11_fts_get_stream(p));
604 freebsd11_fts_set_clientptr(FTS11 *sp, void *clientptr)
607 sp->fts_clientptr = clientptr;
611 * This is the tricky part -- do not casually change *anything* in here. The
612 * idea is to build the linked list of entries that are used by fts_children
613 * and fts_read. There are lots of special cases.
615 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
616 * set and it's a physical walk (so that symbolic links can't be directories),
617 * we can do things quickly. First, if it's a 4.4BSD file system, the type
618 * of the file is in the directory entry. Otherwise, we assume that the number
619 * of subdirectories in a node is equal to the number of links to the parent.
620 * The former skips all stat calls. The latter skips stat calls in any leaf
621 * directories and for any files after the subdirectories in the directory have
622 * been found, cutting the stat calls by about 2/3.
625 fts_build(FTS11 *sp, int type)
627 struct freebsd11_dirent *dp;
629 FTSENT11 *cur, *tail;
633 int cderrno, descend, oflag, saved_errno, nostat, doadjust;
635 long nlinks; /* has to be signed because -1 is a magic value */
636 size_t dnamlen, len, maxlen, nitems;
638 /* Set current node pointer. */
642 * Open the directory for reading. If this fails, we're done.
643 * If being called from fts_read, set the fts_info field.
646 if (ISSET(FTS_WHITEOUT))
649 oflag = DTF_HIDEW | DTF_NODUP;
651 #define __opendir2(path, flag) opendir(path)
653 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
655 cur->fts_info = FTS_DNR;
656 cur->fts_errno = errno;
662 * Nlinks is the number of possible entries of type directory in the
663 * directory if we're cheating on stat calls, 0 if we're not doing
664 * any stat calls at all, -1 if we're doing stats on everything.
666 if (type == BNAMES) {
668 /* Be quiet about nostat, GCC. */
670 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
671 if (fts_ufslinks(sp, cur))
672 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
682 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
683 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
684 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
687 * If we're going to need to stat anything or we want to descend
688 * and stay in the directory, chdir. If this fails we keep going,
689 * but set a flag so we don't chdir after the post-order visit.
690 * We won't be able to stat anything, but we can still return the
691 * names themselves. Note, that since fts_read won't be able to
692 * chdir into the directory, it will have to return different path
693 * names than before, i.e. "a/b" instead of "b". Since the node
694 * has already been visited in pre-order, have to wait until the
695 * post-order visit to return the error. There is a special case
696 * here, if there was nothing to stat then it's not an error to
697 * not be able to stat. This is all fairly nasty. If a program
698 * needed sorted entries or stat information, they had better be
699 * checking FTS_NS on the returned nodes.
702 if (nlinks || type == BREAD) {
703 if (fts_safe_changedir(sp, cur, _dirfd(dirp), NULL)) {
704 if (nlinks && type == BREAD)
705 cur->fts_errno = errno;
706 cur->fts_flags |= FTS_DONTCHDIR;
715 * Figure out the max file name length that can be stored in the
716 * current path -- the inner loop allocates more path as necessary.
717 * We really wouldn't have to do the maxlen calculations here, we
718 * could do them in fts_read before returning the path, but it's a
719 * lot easier here since the length is part of the dirent structure.
721 * If not changing directories set a pointer so that can just append
722 * each new name into the path.
725 if (ISSET(FTS_NOCHDIR)) {
726 cp = sp->fts_path + len;
729 /* GCC, you're too verbose. */
733 maxlen = sp->fts_pathlen - len;
735 level = cur->fts_level + 1;
737 /* Read the directory, attaching each entry to the `link' pointer. */
739 for (head = tail = NULL, nitems = 0;
740 dirp && (dp = freebsd11_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);
804 p->fts_info = fts_stat(sp, p, 0, _dirfd(dirp));
806 p->fts_accpath = p->fts_name;
807 p->fts_info = fts_stat(sp, p, 0, -1);
810 /* Decrement link count if applicable. */
811 if (nlinks > 0 && (p->fts_info == FTS_D ||
812 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
816 /* We walk in directory order so "ls -f" doesn't get upset. */
827 (void)closedir(dirp);
830 * If realloc() changed the address of the path, adjust the
831 * addresses for the rest of the tree and the dir list.
834 fts_padjust(sp, head);
837 * If not changing directories, reset the path back to original
840 if (ISSET(FTS_NOCHDIR))
841 sp->fts_path[cur->fts_pathlen] = '\0';
844 * If descended after called from fts_children or after called from
845 * fts_read and nothing found, get back. At the root level we use
846 * the saved fd; if one of fts_open()'s arguments is a relative path
847 * to an empty directory, we wind up here with no other way back. If
848 * can't get back, we're done.
850 if (descend && (type == BCHILD || !nitems) &&
851 (cur->fts_level == FTS_ROOTLEVEL ?
852 FCHDIR(sp, sp->fts_rfd) :
853 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
855 cur->fts_info = FTS_ERR;
860 /* If didn't find anything, return NULL. */
863 cur->fts_info = FTS_DP;
867 /* Sort the entries. */
868 if (sp->fts_compar && nitems > 1)
869 head = fts_sort(sp, head, nitems);
874 fts_stat(FTS11 *sp, FTSENT11 *p, int follow, int dfd)
879 struct freebsd11_stat *sbp, sb;
884 path = p->fts_accpath, dfd = AT_FDCWD;
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 (freebsd11_fstatat(dfd, path, sbp, 0)) {
910 if (freebsd11_fstatat(dfd, path, sbp,
911 AT_SYMLINK_NOFOLLOW)) {
912 p->fts_errno = saved_errno;
916 if (S_ISLNK(sbp->st_mode))
919 } else if (freebsd11_fstatat(dfd, path, sbp, AT_SYMLINK_NOFOLLOW)) {
920 p->fts_errno = errno;
921 err: memset(sbp, 0, sizeof(*sbp));
925 if (S_ISDIR(sbp->st_mode)) {
927 * Set the device/inode. Used to find cycles and check for
928 * crossing mount points. Also remember the link count, used
929 * in fts_build to limit the number of stat calls. It is
930 * understood that these fields are only referenced if fts_info
933 dev = p->fts_dev = sbp->st_dev;
934 ino = p->fts_ino = sbp->st_ino;
935 p->fts_nlink = sbp->st_nlink;
937 if (ISDOT(p->fts_name))
941 * Cycle detection is done by brute force when the directory
942 * is first encountered. If the tree gets deep enough or the
943 * number of symbolic links to directories is high enough,
944 * something faster might be worthwhile.
946 for (t = p->fts_parent;
947 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
948 if (ino == t->fts_ino && dev == t->fts_dev) {
954 if (S_ISLNK(sbp->st_mode))
956 if (S_ISREG(sbp->st_mode))
958 return (FTS_DEFAULT);
962 * The comparison function takes pointers to pointers to FTSENT structures.
963 * Qsort wants a comparison function that takes pointers to void.
964 * (Both with appropriate levels of const-poisoning, of course!)
965 * Use a trampoline function to deal with the difference.
968 fts_compar(const void *a, const void *b)
972 parent = (*(const FTSENT11 * const *)a)->fts_fts;
973 return (*parent->fts_compar)(a, b);
977 fts_sort(FTS11 *sp, FTSENT11 *head, size_t nitems)
982 * Construct an array of pointers to the structures and call qsort(3).
983 * Reassemble the array in the order returned by qsort. If unable to
984 * sort for memory reasons, return the directory entries in their
985 * current order. Allocate enough space for the current needs plus
986 * 40 so don't realloc one entry at a time.
988 if (nitems > sp->fts_nitems) {
989 sp->fts_nitems = nitems + 40;
990 if ((sp->fts_array = reallocf(sp->fts_array,
991 sp->fts_nitems * sizeof(FTSENT11 *))) == NULL) {
996 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
998 qsort(sp->fts_array, nitems, sizeof(FTSENT11 *), fts_compar);
999 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1000 ap[0]->fts_link = ap[1];
1001 ap[0]->fts_link = NULL;
1006 fts_alloc(FTS11 *sp, char *name, size_t namelen)
1011 struct ftsent11_withstat {
1013 struct freebsd11_stat statbuf;
1017 * The file name is a variable length array and no stat structure is
1018 * necessary if the user has set the nostat bit. Allocate the FTSENT
1019 * structure, the file name and the stat structure in one chunk, but
1020 * be careful that the stat structure is reasonably aligned.
1022 if (ISSET(FTS_NOSTAT))
1023 len = sizeof(FTSENT11) + namelen + 1;
1025 len = sizeof(struct ftsent11_withstat) + namelen + 1;
1027 if ((p = malloc(len)) == NULL)
1030 if (ISSET(FTS_NOSTAT)) {
1031 p->fts_name = (char *)(p + 1);
1032 p->fts_statp = NULL;
1034 p->fts_name = (char *)((struct ftsent11_withstat *)p + 1);
1035 p->fts_statp = &((struct ftsent11_withstat *)p)->statbuf;
1038 /* Copy the name and guarantee NUL termination. */
1039 memcpy(p->fts_name, name, namelen);
1040 p->fts_name[namelen] = '\0';
1041 p->fts_namelen = namelen;
1042 p->fts_path = sp->fts_path;
1045 p->fts_instr = FTS_NOINSTR;
1047 p->fts_pointer = NULL;
1053 fts_lfree(FTSENT11 *head)
1057 /* Free a linked list of structures. */
1058 while ((p = head)) {
1059 head = head->fts_link;
1065 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1066 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1067 * though the kernel won't resolve them. Add the size (not just what's needed)
1068 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1071 fts_palloc(FTS11 *sp, size_t more)
1074 sp->fts_pathlen += more + 256;
1075 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1076 return (sp->fts_path == NULL);
1080 * When the path is realloc'd, have to fix all of the pointers in structures
1084 fts_padjust(FTS11 *sp, FTSENT11 *head)
1087 char *addr = sp->fts_path;
1089 #define ADJUST(p) do { \
1090 if ((p)->fts_accpath != (p)->fts_name) { \
1091 (p)->fts_accpath = \
1092 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1094 (p)->fts_path = addr; \
1096 /* Adjust the current set of children. */
1097 for (p = sp->fts_child; p; p = p->fts_link)
1100 /* Adjust the rest of the tree, including the current level. */
1101 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1103 p = p->fts_link ? p->fts_link : p->fts_parent;
1108 fts_maxarglen(char * const *argv)
1112 for (max = 0; *argv; ++argv)
1113 if ((len = strlen(*argv)) > max)
1119 * Change to dir specified by fd or p->fts_accpath without getting
1120 * tricked by someone changing the world out from underneath us.
1121 * Assumes p->fts_dev and p->fts_ino are filled in.
1124 fts_safe_changedir(FTS11 *sp, FTSENT11 *p, int fd, char *path)
1126 int ret, oerrno, newfd;
1127 struct freebsd11_stat sb;
1130 if (ISSET(FTS_NOCHDIR))
1132 if (fd < 0 && (newfd = _open(path, O_RDONLY | O_DIRECTORY |
1135 if (freebsd11_fstat(newfd, &sb)) {
1139 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1140 errno = ENOENT; /* disinformation */
1144 ret = fchdir(newfd);
1148 (void)_close(newfd);
1154 * Check if the filesystem for "ent" has UFS-style links.
1157 fts_ufslinks(FTS11 *sp, const FTSENT11 *ent)
1159 struct _fts_private11 *priv;
1162 priv = (struct _fts_private11 *)sp;
1164 * If this node's device is different from the previous, grab
1165 * the filesystem information, and decide on the reliability
1166 * of the link information from this filesystem for stat(2)
1169 if (priv->ftsp_dev != ent->fts_dev) {
1170 if (freebsd11_statfs(ent->fts_path, &priv->ftsp_statfs) != -1) {
1171 priv->ftsp_dev = ent->fts_dev;
1172 priv->ftsp_linksreliable = 0;
1173 for (cpp = ufslike_filesystems; *cpp; cpp++) {
1174 if (strcmp(priv->ftsp_statfs.f_fstypename,
1176 priv->ftsp_linksreliable = 1;
1181 priv->ftsp_linksreliable = 0;
1184 return (priv->ftsp_linksreliable);
1187 __sym_compat(fts_open, freebsd11_fts_open, FBSD_1.1);
1188 __sym_compat(fts_close, freebsd11_fts_close, FBSD_1.1);
1189 __sym_compat(fts_read, freebsd11_fts_read, FBSD_1.1);
1190 __sym_compat(fts_set, freebsd11_fts_set, FBSD_1.1);
1191 __sym_compat(fts_children, freebsd11_fts_children, FBSD_1.1);
1192 __sym_compat(fts_get_clientptr, freebsd11_fts_get_clientptr, FBSD_1.1);
1193 __sym_compat(fts_get_stream, freebsd11_fts_get_stream, FBSD_1.1);
1194 __sym_compat(fts_set_clientptr, freebsd11_fts_set_clientptr, FBSD_1.1);