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
28 * From: $OpenBSD: fts.c,v 1.22 1999/10/03 19:22:22 millert Exp $
31 #include "namespace.h"
32 #include <sys/param.h>
33 #define _WANT_FREEBSD11_STATFS
34 #include <sys/mount.h>
35 #define _WANT_FREEBSD11_STAT
38 #define _WANT_FREEBSD11_DIRENT
46 #include "gen-compat.h"
47 #include "fts-compat11.h"
48 #include "un-namespace.h"
50 #include "gen-private.h"
52 static FTSENT11 *fts_alloc(FTS11 *, char *, size_t);
53 static FTSENT11 *fts_build(FTS11 *, int);
54 static void fts_lfree(FTSENT11 *);
55 static void fts_load(FTS11 *, FTSENT11 *);
56 static size_t fts_maxarglen(char * const *);
57 static void fts_padjust(FTS11 *, FTSENT11 *);
58 static int fts_palloc(FTS11 *, size_t);
59 static FTSENT11 *fts_sort(FTS11 *, FTSENT11 *, size_t);
60 static int fts_stat(FTS11 *, FTSENT11 *, int, int);
61 static int fts_safe_changedir(FTS11 *, FTSENT11 *, int, char *);
62 static int fts_ufslinks(FTS11 *, const FTSENT11 *);
64 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
66 #define CLR(opt) (sp->fts_options &= ~(opt))
67 #define ISSET(opt) (sp->fts_options & (opt))
68 #define SET(opt) (sp->fts_options |= (opt))
70 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
73 #define BCHILD 1 /* fts_children */
74 #define BNAMES 2 /* fts_children, names only */
75 #define BREAD 3 /* fts_read */
78 * Internal representation of an FTS, including extra implementation
79 * details. The FTS returned from fts_open points to this structure's
80 * ftsp_fts member (and can be cast to an _fts_private as required)
82 struct _fts_private11 {
84 struct freebsd11_statfs ftsp_statfs;
86 int ftsp_linksreliable;
90 * The "FTS_NOSTAT" option can avoid a lot of calls to stat(2) if it
91 * knows that a directory could not possibly have subdirectories. This
92 * is decided by looking at the link count: a subdirectory would
93 * increment its parent's link count by virtue of its own ".." entry.
94 * This assumption only holds for UFS-like filesystems that implement
95 * links and directories this way, so we must punt for others.
98 static const char *ufslike_filesystems[] = {
107 freebsd11_fts_open(char * const *argv, int options,
108 int (*compar)(const FTSENT11 * const *, const FTSENT11 * const *))
110 struct _fts_private11 *priv;
113 FTSENT11 *parent, *tmp;
117 if (options & ~FTS_OPTIONMASK) {
122 /* fts_open() requires at least one path */
128 /* Allocate/initialize the stream. */
129 if ((priv = calloc(1, sizeof(*priv))) == NULL)
131 sp = &priv->ftsp_fts;
132 sp->fts_compar = compar;
133 sp->fts_options = options;
135 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
136 if (ISSET(FTS_LOGICAL))
140 * Start out with 1K of path space, and enough, in any case,
141 * to hold the user's paths.
143 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
146 /* Allocate/initialize root's parent. */
147 if ((parent = fts_alloc(sp, "", 0)) == NULL)
149 parent->fts_level = FTS_ROOTPARENTLEVEL;
154 /* Allocate/initialize root(s). */
155 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
158 p = fts_alloc(sp, *argv, len);
159 p->fts_level = FTS_ROOTLEVEL;
160 p->fts_parent = parent;
161 p->fts_accpath = p->fts_name;
162 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW), -1);
164 /* Command-line "." and ".." are real directories. */
165 if (p->fts_info == FTS_DOT)
169 * If comparison routine supplied, traverse in sorted
170 * order; otherwise traverse in the order specified.
185 if (compar && nitems > 1)
186 root = fts_sort(sp, root, nitems);
189 * Allocate a dummy pointer and make fts_read think that we've just
190 * finished the node before the root(s); set p->fts_info to FTS_INIT
191 * so that everything about the "current" node is ignored.
193 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
195 sp->fts_cur->fts_link = root;
196 sp->fts_cur->fts_info = FTS_INIT;
199 * If using chdir(2), grab a file descriptor pointing to dot to ensure
200 * that we can get back here; this could be avoided for some paths,
201 * but almost certainly not worth the effort. Slashes, symbolic links,
202 * and ".." are all fairly nasty problems. Note, if we can't get the
203 * descriptor we run anyway, just more slowly.
205 if (!ISSET(FTS_NOCHDIR) &&
206 (sp->fts_rfd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
211 mem3: fts_lfree(root);
213 mem2: free(sp->fts_path);
219 fts_load(FTS11 *sp, FTSENT11 *p)
225 * Load the stream structure for the next traversal. Since we don't
226 * actually enter the directory until after the preorder visit, set
227 * the fts_accpath field specially so the chdir gets done to the right
228 * place and the user can access the first node. From fts_open it's
229 * known that the path will fit.
231 len = p->fts_pathlen = p->fts_namelen;
232 memmove(sp->fts_path, p->fts_name, len + 1);
233 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
235 memmove(p->fts_name, cp, len + 1);
236 p->fts_namelen = len;
238 p->fts_accpath = p->fts_path = sp->fts_path;
239 sp->fts_dev = p->fts_dev;
243 freebsd11_fts_close(FTS11 *sp)
249 * This still works if we haven't read anything -- the dummy structure
250 * points to the root list, so we step through to the end of the root
251 * list which has a valid parent pointer.
254 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
256 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
262 /* Free up child linked list, sort array, path buffer. */
264 fts_lfree(sp->fts_child);
269 /* Return to original directory, save errno if necessary. */
270 if (!ISSET(FTS_NOCHDIR)) {
271 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
272 (void)_close(sp->fts_rfd);
274 /* Set errno and return. */
275 if (saved_errno != 0) {
276 /* Free up the stream pointer. */
283 /* Free up the stream pointer. */
289 * Special case of "/" at the end of the path so that slashes aren't
290 * appended which would cause paths to be written as "....//foo".
293 (p->fts_path[p->fts_pathlen - 1] == '/' \
294 ? p->fts_pathlen - 1 : p->fts_pathlen)
297 freebsd11_fts_read(FTS11 *sp)
304 /* If finished or unrecoverable error, return NULL. */
305 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
308 /* Set current node pointer. */
311 /* Save and zero out user instructions. */
312 instr = p->fts_instr;
313 p->fts_instr = FTS_NOINSTR;
315 /* Any type of file may be re-visited; re-stat and re-turn. */
316 if (instr == FTS_AGAIN) {
317 p->fts_info = fts_stat(sp, p, 0, -1);
322 * Following a symlink -- SLNONE test allows application to see
323 * SLNONE and recover. If indirecting through a symlink, have
324 * keep a pointer to current location. If unable to get that
325 * pointer, follow fails.
327 if (instr == FTS_FOLLOW &&
328 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
329 p->fts_info = fts_stat(sp, p, 1, -1);
330 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
331 if ((p->fts_symfd = _open(".", O_RDONLY | O_CLOEXEC,
333 p->fts_errno = errno;
334 p->fts_info = FTS_ERR;
336 p->fts_flags |= FTS_SYMFOLLOW;
341 /* Directory in pre-order. */
342 if (p->fts_info == FTS_D) {
343 /* If skipped or crossed mount point, do post-order visit. */
344 if (instr == FTS_SKIP ||
345 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
346 if (p->fts_flags & FTS_SYMFOLLOW)
347 (void)_close(p->fts_symfd);
349 fts_lfree(sp->fts_child);
350 sp->fts_child = NULL;
352 p->fts_info = FTS_DP;
356 /* Rebuild if only read the names and now traversing. */
357 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
359 fts_lfree(sp->fts_child);
360 sp->fts_child = NULL;
364 * Cd to the subdirectory.
366 * If have already read and now fail to chdir, whack the list
367 * to make the names come out right, and set the parent errno
368 * so the application will eventually get an error condition.
369 * Set the FTS_DONTCHDIR flag so that when we logically change
370 * directories back to the parent we don't do a chdir.
372 * If haven't read do so. If the read fails, fts_build sets
373 * FTS_STOP or the fts_info field of the node.
375 if (sp->fts_child != NULL) {
376 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
377 p->fts_errno = errno;
378 p->fts_flags |= FTS_DONTCHDIR;
379 for (p = sp->fts_child; p != NULL;
382 p->fts_parent->fts_accpath;
384 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
390 sp->fts_child = NULL;
394 /* Move to the next node on this level. */
396 if ((p = p->fts_link) != NULL) {
398 * If reached the top, return to the original directory (or
399 * the root of the tree), and load the paths for the next root.
401 if (p->fts_level == FTS_ROOTLEVEL) {
402 if (FCHDIR(sp, sp->fts_rfd)) {
408 return (sp->fts_cur = p);
412 * User may have called fts_set on the node. If skipped,
413 * ignore. If followed, get a file descriptor so we can
414 * get back if necessary.
416 if (p->fts_instr == FTS_SKIP) {
420 if (p->fts_instr == FTS_FOLLOW) {
421 p->fts_info = fts_stat(sp, p, 1, -1);
422 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
424 _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0) {
425 p->fts_errno = errno;
426 p->fts_info = FTS_ERR;
428 p->fts_flags |= FTS_SYMFOLLOW;
430 p->fts_instr = FTS_NOINSTR;
435 name: t = sp->fts_path + NAPPEND(p->fts_parent);
437 memmove(t, p->fts_name, p->fts_namelen + 1);
438 return (sp->fts_cur = p);
441 /* Move up to the parent node. */
444 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
446 * Done; free everything up and set errno to 0 so the user
447 * can distinguish between error and EOF.
452 return (sp->fts_cur = NULL);
455 /* NUL terminate the pathname. */
456 sp->fts_path[p->fts_pathlen] = '\0';
459 * Return to the parent directory. If at a root node or came through
460 * a symlink, go back through the file descriptor. Otherwise, cd up
463 if (p->fts_level == FTS_ROOTLEVEL) {
464 if (FCHDIR(sp, sp->fts_rfd)) {
468 } else if (p->fts_flags & FTS_SYMFOLLOW) {
469 if (FCHDIR(sp, p->fts_symfd)) {
471 (void)_close(p->fts_symfd);
476 (void)_close(p->fts_symfd);
477 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
478 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
483 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
484 return (sp->fts_cur = p);
488 * Fts_set takes the stream as an argument although it's not used in this
489 * implementation; it would be necessary if anyone wanted to add global
490 * semantics to fts using fts_set. An error return is allowed for similar
495 freebsd11_fts_set(FTS11 *sp, FTSENT11 *p, int instr)
497 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
498 instr != FTS_NOINSTR && instr != FTS_SKIP) {
502 p->fts_instr = instr;
507 freebsd11_fts_children(FTS11 *sp, int instr)
512 if (instr != 0 && instr != FTS_NAMEONLY) {
517 /* Set current node pointer. */
521 * Errno set to 0 so user can distinguish empty directory from
526 /* Fatal errors stop here. */
530 /* Return logical hierarchy of user's arguments. */
531 if (p->fts_info == FTS_INIT)
532 return (p->fts_link);
535 * If not a directory being visited in pre-order, stop here. Could
536 * allow FTS_DNR, assuming the user has fixed the problem, but the
537 * same effect is available with FTS_AGAIN.
539 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
542 /* Free up any previous child list. */
543 if (sp->fts_child != NULL)
544 fts_lfree(sp->fts_child);
546 if (instr == FTS_NAMEONLY) {
553 * If using chdir on a relative path and called BEFORE fts_read does
554 * its chdir to the root of a traversal, we can lose -- we need to
555 * chdir into the subdirectory, and we don't know where the current
556 * directory is, so we can't get back so that the upcoming chdir by
557 * fts_read will work.
559 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
561 return (sp->fts_child = fts_build(sp, instr));
563 if ((fd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
565 sp->fts_child = fts_build(sp, instr);
566 serrno = (sp->fts_child == NULL) ? errno : 0;
568 if (rc < 0 && serrno == 0)
574 return (sp->fts_child);
577 #ifndef freebsd11_fts_get_clientptr
578 #error "freebsd11_fts_get_clientptr not defined"
582 (freebsd11_fts_get_clientptr)(FTS11 *sp)
585 return (freebsd11_fts_get_clientptr(sp));
588 #ifndef freebsd11_fts_get_stream
589 #error "freebsd11_fts_get_stream not defined"
593 (freebsd11_fts_get_stream)(FTSENT11 *p)
595 return (freebsd11_fts_get_stream(p));
599 freebsd11_fts_set_clientptr(FTS11 *sp, void *clientptr)
602 sp->fts_clientptr = clientptr;
605 static struct freebsd11_dirent *
606 fts_safe_readdir(DIR *dirp, int *readdir_errno)
608 struct freebsd11_dirent *ret;
613 ret = freebsd11_readdir(dirp);
614 *readdir_errno = errno;
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.
633 fts_build(FTS11 *sp, int type)
635 struct freebsd11_dirent *dp;
637 FTSENT11 *cur, *tail;
641 int cderrno, descend, oflag, saved_errno, nostat, doadjust,
644 long nlinks; /* has to be signed because -1 is a magic value */
645 size_t dnamlen, len, maxlen, nitems;
647 /* Set current node pointer. */
651 * Open the directory for reading. If this fails, we're done.
652 * If being called from fts_read, set the fts_info field.
655 if (ISSET(FTS_WHITEOUT))
658 oflag = DTF_HIDEW | DTF_NODUP;
660 #define __opendir2(path, flag) opendir(path)
662 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
664 cur->fts_info = FTS_DNR;
665 cur->fts_errno = errno;
671 * Nlinks is the number of possible entries of type directory in the
672 * directory if we're cheating on stat calls, 0 if we're not doing
673 * any stat calls at all, -1 if we're doing stats on everything.
675 if (type == BNAMES) {
677 /* Be quiet about nostat, GCC. */
679 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
680 if (fts_ufslinks(sp, cur))
681 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
691 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
692 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
693 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
696 * If we're going to need to stat anything or we want to descend
697 * and stay in the directory, chdir. If this fails we keep going,
698 * but set a flag so we don't chdir after the post-order visit.
699 * We won't be able to stat anything, but we can still return the
700 * names themselves. Note, that since fts_read won't be able to
701 * chdir into the directory, it will have to return different path
702 * names than before, i.e. "a/b" instead of "b". Since the node
703 * has already been visited in pre-order, have to wait until the
704 * post-order visit to return the error. There is a special case
705 * here, if there was nothing to stat then it's not an error to
706 * not be able to stat. This is all fairly nasty. If a program
707 * needed sorted entries or stat information, they had better be
708 * checking FTS_NS on the returned nodes.
711 if (nlinks || type == BREAD) {
712 if (fts_safe_changedir(sp, cur, _dirfd(dirp), NULL)) {
713 if (nlinks && type == BREAD)
714 cur->fts_errno = errno;
715 cur->fts_flags |= FTS_DONTCHDIR;
724 * Figure out the max file name length that can be stored in the
725 * current path -- the inner loop allocates more path as necessary.
726 * We really wouldn't have to do the maxlen calculations here, we
727 * could do them in fts_read before returning the path, but it's a
728 * lot easier here since the length is part of the dirent structure.
730 * If not changing directories set a pointer so that can just append
731 * each new name into the path.
734 if (ISSET(FTS_NOCHDIR)) {
735 cp = sp->fts_path + len;
738 /* GCC, you're too verbose. */
742 maxlen = sp->fts_pathlen - len;
744 level = cur->fts_level + 1;
746 /* Read the directory, attaching each entry to the `link' pointer. */
749 for (head = tail = NULL, nitems = 0;
750 (dp = fts_safe_readdir(dirp, &readdir_errno));) {
751 dnamlen = dp->d_namlen;
752 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
755 if ((p = fts_alloc(sp, dp->d_name, dnamlen)) == NULL)
757 if (dnamlen >= maxlen) { /* include space for NUL */
758 oldaddr = sp->fts_path;
759 if (fts_palloc(sp, dnamlen + len + 1)) {
761 * No more memory for path or structures. Save
762 * errno, free up the current structure and the
763 * structures already allocated.
765 mem1: saved_errno = errno;
769 (void)closedir(dirp);
770 cur->fts_info = FTS_ERR;
775 /* Did realloc() change the pointer? */
776 if (oldaddr != sp->fts_path) {
778 if (ISSET(FTS_NOCHDIR))
779 cp = sp->fts_path + len;
781 maxlen = sp->fts_pathlen - len;
784 p->fts_level = level;
785 p->fts_parent = sp->fts_cur;
786 p->fts_pathlen = len + dnamlen;
789 if (dp->d_type == DT_WHT)
790 p->fts_flags |= FTS_ISW;
795 p->fts_info = FTS_NS;
796 p->fts_errno = cderrno;
798 p->fts_info = FTS_NSOK;
799 p->fts_accpath = cur->fts_accpath;
800 } else if (nlinks == 0
803 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
807 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
808 p->fts_info = FTS_NSOK;
810 /* Build a file name for fts_stat to stat. */
811 if (ISSET(FTS_NOCHDIR)) {
812 p->fts_accpath = p->fts_path;
813 memmove(cp, p->fts_name, p->fts_namelen + 1);
814 p->fts_info = fts_stat(sp, p, 0, _dirfd(dirp));
816 p->fts_accpath = p->fts_name;
817 p->fts_info = fts_stat(sp, p, 0, -1);
820 /* Decrement link count if applicable. */
821 if (nlinks > 0 && (p->fts_info == FTS_D ||
822 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
826 /* We walk in directory order so "ls -f" doesn't get upset. */
838 cur->fts_errno = readdir_errno;
840 * If we've not read any items yet, treat
841 * the error as if we can't access the dir.
843 cur->fts_info = nitems ? FTS_ERR : FTS_DNR;
847 (void)closedir(dirp);
850 * If realloc() changed the address of the path, adjust the
851 * addresses for the rest of the tree and the dir list.
854 fts_padjust(sp, head);
857 * If not changing directories, reset the path back to original
860 if (ISSET(FTS_NOCHDIR))
861 sp->fts_path[cur->fts_pathlen] = '\0';
864 * If descended after called from fts_children or after called from
865 * fts_read and nothing found, get back. At the root level we use
866 * the saved fd; if one of fts_open()'s arguments is a relative path
867 * to an empty directory, we wind up here with no other way back. If
868 * can't get back, we're done.
870 if (descend && (type == BCHILD || !nitems) &&
871 (cur->fts_level == FTS_ROOTLEVEL ?
872 FCHDIR(sp, sp->fts_rfd) :
873 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
875 cur->fts_info = FTS_ERR;
880 /* If didn't find anything, return NULL. */
883 cur->fts_info != FTS_DNR && cur->fts_info != FTS_ERR)
884 cur->fts_info = FTS_DP;
888 /* Sort the entries. */
889 if (sp->fts_compar && nitems > 1)
890 head = fts_sort(sp, head, nitems);
895 fts_stat(FTS11 *sp, FTSENT11 *p, int follow, int dfd)
900 struct freebsd11_stat *sbp, sb;
905 path = p->fts_accpath, dfd = AT_FDCWD;
909 /* If user needs stat info, stat buffer already allocated. */
910 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
913 /* Check for whiteout. */
914 if (p->fts_flags & FTS_ISW) {
916 memset(sbp, '\0', sizeof(*sbp));
917 sbp->st_mode = S_IFWHT;
924 * If doing a logical walk, or application requested FTS_FOLLOW, do
925 * a stat(2). If that fails, check for a non-existent symlink. If
926 * fail, set the errno from the stat call.
928 if (ISSET(FTS_LOGICAL) || follow) {
929 if (freebsd11_fstatat(dfd, path, sbp, 0)) {
931 if (freebsd11_fstatat(dfd, path, sbp,
932 AT_SYMLINK_NOFOLLOW)) {
933 p->fts_errno = saved_errno;
937 if (S_ISLNK(sbp->st_mode))
940 } else if (freebsd11_fstatat(dfd, path, sbp, AT_SYMLINK_NOFOLLOW)) {
941 p->fts_errno = errno;
942 err: memset(sbp, 0, sizeof(*sbp));
946 if (S_ISDIR(sbp->st_mode)) {
948 * Set the device/inode. Used to find cycles and check for
949 * crossing mount points. Also remember the link count, used
950 * in fts_build to limit the number of stat calls. It is
951 * understood that these fields are only referenced if fts_info
954 dev = p->fts_dev = sbp->st_dev;
955 ino = p->fts_ino = sbp->st_ino;
956 p->fts_nlink = sbp->st_nlink;
958 if (ISDOT(p->fts_name))
962 * Cycle detection is done by brute force when the directory
963 * is first encountered. If the tree gets deep enough or the
964 * number of symbolic links to directories is high enough,
965 * something faster might be worthwhile.
967 for (t = p->fts_parent;
968 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
969 if (ino == t->fts_ino && dev == t->fts_dev) {
975 if (S_ISLNK(sbp->st_mode))
977 if (S_ISREG(sbp->st_mode))
979 return (FTS_DEFAULT);
983 * The comparison function takes pointers to pointers to FTSENT structures.
984 * Qsort wants a comparison function that takes pointers to void.
985 * (Both with appropriate levels of const-poisoning, of course!)
986 * Use a trampoline function to deal with the difference.
989 fts_compar(const void *a, const void *b)
993 parent = (*(const FTSENT11 * const *)a)->fts_fts;
994 return (*parent->fts_compar)(a, b);
998 fts_sort(FTS11 *sp, FTSENT11 *head, size_t nitems)
1003 * Construct an array of pointers to the structures and call qsort(3).
1004 * Reassemble the array in the order returned by qsort. If unable to
1005 * sort for memory reasons, return the directory entries in their
1006 * current order. Allocate enough space for the current needs plus
1007 * 40 so don't realloc one entry at a time.
1009 if (nitems > sp->fts_nitems) {
1010 sp->fts_nitems = nitems + 40;
1011 if ((sp->fts_array = reallocf(sp->fts_array,
1012 sp->fts_nitems * sizeof(FTSENT11 *))) == NULL) {
1017 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
1019 qsort(sp->fts_array, nitems, sizeof(FTSENT11 *), fts_compar);
1020 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1021 ap[0]->fts_link = ap[1];
1022 ap[0]->fts_link = NULL;
1027 fts_alloc(FTS11 *sp, char *name, size_t namelen)
1032 struct ftsent11_withstat {
1034 struct freebsd11_stat statbuf;
1038 * The file name is a variable length array and no stat structure is
1039 * necessary if the user has set the nostat bit. Allocate the FTSENT
1040 * structure, the file name and the stat structure in one chunk, but
1041 * be careful that the stat structure is reasonably aligned.
1043 if (ISSET(FTS_NOSTAT))
1044 len = sizeof(FTSENT11) + namelen + 1;
1046 len = sizeof(struct ftsent11_withstat) + namelen + 1;
1048 if ((p = malloc(len)) == NULL)
1051 if (ISSET(FTS_NOSTAT)) {
1052 p->fts_name = (char *)(p + 1);
1053 p->fts_statp = NULL;
1055 p->fts_name = (char *)((struct ftsent11_withstat *)p + 1);
1056 p->fts_statp = &((struct ftsent11_withstat *)p)->statbuf;
1059 /* Copy the name and guarantee NUL termination. */
1060 memcpy(p->fts_name, name, namelen);
1061 p->fts_name[namelen] = '\0';
1062 p->fts_namelen = namelen;
1063 p->fts_path = sp->fts_path;
1066 p->fts_instr = FTS_NOINSTR;
1068 p->fts_pointer = NULL;
1074 fts_lfree(FTSENT11 *head)
1078 /* Free a linked list of structures. */
1079 while ((p = head)) {
1080 head = head->fts_link;
1086 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1087 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1088 * though the kernel won't resolve them. Add the size (not just what's needed)
1089 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1092 fts_palloc(FTS11 *sp, size_t more)
1095 sp->fts_pathlen += more + 256;
1096 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1097 return (sp->fts_path == NULL);
1101 * When the path is realloc'd, have to fix all of the pointers in structures
1105 fts_padjust(FTS11 *sp, FTSENT11 *head)
1108 char *addr = sp->fts_path;
1110 #define ADJUST(p) do { \
1111 if ((p)->fts_accpath != (p)->fts_name) { \
1112 (p)->fts_accpath = \
1113 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1115 (p)->fts_path = addr; \
1117 /* Adjust the current set of children. */
1118 for (p = sp->fts_child; p; p = p->fts_link)
1121 /* Adjust the rest of the tree, including the current level. */
1122 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1124 p = p->fts_link ? p->fts_link : p->fts_parent;
1129 fts_maxarglen(char * const *argv)
1133 for (max = 0; *argv; ++argv)
1134 if ((len = strlen(*argv)) > max)
1140 * Change to dir specified by fd or p->fts_accpath without getting
1141 * tricked by someone changing the world out from underneath us.
1142 * Assumes p->fts_dev and p->fts_ino are filled in.
1145 fts_safe_changedir(FTS11 *sp, FTSENT11 *p, int fd, char *path)
1147 int ret, oerrno, newfd;
1148 struct freebsd11_stat sb;
1151 if (ISSET(FTS_NOCHDIR))
1153 if (fd < 0 && (newfd = _open(path, O_RDONLY | O_DIRECTORY |
1156 if (freebsd11_fstat(newfd, &sb)) {
1160 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1161 errno = ENOENT; /* disinformation */
1165 ret = fchdir(newfd);
1169 (void)_close(newfd);
1175 * Check if the filesystem for "ent" has UFS-style links.
1178 fts_ufslinks(FTS11 *sp, const FTSENT11 *ent)
1180 struct _fts_private11 *priv;
1183 priv = (struct _fts_private11 *)sp;
1185 * If this node's device is different from the previous, grab
1186 * the filesystem information, and decide on the reliability
1187 * of the link information from this filesystem for stat(2)
1190 if (priv->ftsp_dev != ent->fts_dev) {
1191 if (freebsd11_statfs(ent->fts_path, &priv->ftsp_statfs) != -1) {
1192 priv->ftsp_dev = ent->fts_dev;
1193 priv->ftsp_linksreliable = 0;
1194 for (cpp = ufslike_filesystems; *cpp; cpp++) {
1195 if (strcmp(priv->ftsp_statfs.f_fstypename,
1197 priv->ftsp_linksreliable = 1;
1202 priv->ftsp_linksreliable = 0;
1205 return (priv->ftsp_linksreliable);
1208 __sym_compat(fts_open, freebsd11_fts_open, FBSD_1.1);
1209 __sym_compat(fts_close, freebsd11_fts_close, FBSD_1.1);
1210 __sym_compat(fts_read, freebsd11_fts_read, FBSD_1.1);
1211 __sym_compat(fts_set, freebsd11_fts_set, FBSD_1.1);
1212 __sym_compat(fts_children, freebsd11_fts_children, FBSD_1.1);
1213 __sym_compat(fts_get_clientptr, freebsd11_fts_get_clientptr, FBSD_1.1);
1214 __sym_compat(fts_get_stream, freebsd11_fts_get_stream, FBSD_1.1);
1215 __sym_compat(fts_set_clientptr, freebsd11_fts_set_clientptr, FBSD_1.1);