2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1990, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * $OpenBSD: fts.c,v 1.22 1999/10/03 19:22:22 millert Exp $
35 #if defined(LIBC_SCCS) && !defined(lint)
36 static char sccsid[] = "@(#)fts.c 8.6 (Berkeley) 8/14/94";
37 #endif /* LIBC_SCCS and not lint */
40 #include <sys/cdefs.h>
41 __FBSDID("$FreeBSD$");
43 #include "namespace.h"
44 #include <sys/param.h>
45 #define _WANT_FREEBSD11_STATFS
46 #include <sys/mount.h>
47 #define _WANT_FREEBSD11_STAT
50 #define _WANT_FREEBSD11_DIRENT
57 #include "gen-compat.h"
58 #include "fts-compat.h"
59 #include "un-namespace.h"
61 #include "gen-private.h"
63 FTSENT *__fts_children_44bsd(FTS *, int);
64 int __fts_close_44bsd(FTS *);
65 void *__fts_get_clientptr_44bsd(FTS *);
66 FTS *__fts_get_stream_44bsd(FTSENT *);
67 FTS *__fts_open_44bsd(char * const *, int,
68 int (*)(const FTSENT * const *, const FTSENT * const *));
69 FTSENT *__fts_read_44bsd(FTS *);
70 int __fts_set_44bsd(FTS *, FTSENT *, int);
71 void __fts_set_clientptr_44bsd(FTS *, void *);
73 static FTSENT *fts_alloc(FTS *, char *, int);
74 static FTSENT *fts_build(FTS *, int);
75 static void fts_lfree(FTSENT *);
76 static void fts_load(FTS *, FTSENT *);
77 static size_t fts_maxarglen(char * const *);
78 static void fts_padjust(FTS *, FTSENT *);
79 static int fts_palloc(FTS *, size_t);
80 static FTSENT *fts_sort(FTS *, FTSENT *, int);
81 static u_short fts_stat(FTS *, FTSENT *, int);
82 static int fts_safe_changedir(FTS *, FTSENT *, int, char *);
83 static int fts_ufslinks(FTS *, const FTSENT *);
85 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
87 #define CLR(opt) (sp->fts_options &= ~(opt))
88 #define ISSET(opt) (sp->fts_options & (opt))
89 #define SET(opt) (sp->fts_options |= (opt))
91 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
94 #define BCHILD 1 /* fts_children */
95 #define BNAMES 2 /* fts_children, names only */
96 #define BREAD 3 /* fts_read */
99 * Internal representation of an FTS, including extra implementation
100 * details. The FTS returned from fts_open points to this structure's
101 * ftsp_fts member (and can be cast to an _fts_private as required)
103 struct _fts_private {
105 struct freebsd11_statfs ftsp_statfs;
107 int ftsp_linksreliable;
111 * The "FTS_NOSTAT" option can avoid a lot of calls to stat(2) if it
112 * knows that a directory could not possibly have subdirectories. This
113 * is decided by looking at the link count: a subdirectory would
114 * increment its parent's link count by virtue of its own ".." entry.
115 * This assumption only holds for UFS-like filesystems that implement
116 * links and directories this way, so we must punt for others.
119 static const char *ufslike_filesystems[] = {
128 __fts_open_44bsd(char * const *argv, int options,
129 int (*compar)(const FTSENT * const *, const FTSENT * const *))
131 struct _fts_private *priv;
135 FTSENT *parent, *tmp;
139 if (options & ~FTS_OPTIONMASK) {
144 /* Allocate/initialize the stream. */
145 if ((priv = calloc(1, sizeof(*priv))) == NULL)
147 sp = &priv->ftsp_fts;
148 sp->fts_compar = compar;
149 sp->fts_options = options;
151 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
152 if (ISSET(FTS_LOGICAL))
156 * Start out with 1K of path space, and enough, in any case,
157 * to hold the user's paths.
159 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
162 /* Allocate/initialize root's parent. */
163 if ((parent = fts_alloc(sp, "", 0)) == NULL)
165 parent->fts_level = FTS_ROOTPARENTLEVEL;
170 /* Allocate/initialize root(s). */
171 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
172 /* Don't allow zero-length paths. */
173 if ((len = strlen(*argv)) == 0) {
178 p = fts_alloc(sp, *argv, len);
179 p->fts_level = FTS_ROOTLEVEL;
180 p->fts_parent = parent;
181 p->fts_accpath = p->fts_name;
182 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
184 /* Command-line "." and ".." are real directories. */
185 if (p->fts_info == FTS_DOT)
189 * If comparison routine supplied, traverse in sorted
190 * order; otherwise traverse in the order specified.
205 if (compar && nitems > 1)
206 root = fts_sort(sp, root, nitems);
209 * Allocate a dummy pointer and make fts_read think that we've just
210 * finished the node before the root(s); set p->fts_info to FTS_INIT
211 * so that everything about the "current" node is ignored.
213 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
215 sp->fts_cur->fts_link = root;
216 sp->fts_cur->fts_info = FTS_INIT;
219 * If using chdir(2), grab a file descriptor pointing to dot to ensure
220 * that we can get back here; this could be avoided for some paths,
221 * but almost certainly not worth the effort. Slashes, symbolic links,
222 * and ".." are all fairly nasty problems. Note, if we can't get the
223 * descriptor we run anyway, just more slowly.
225 if (!ISSET(FTS_NOCHDIR) &&
226 (sp->fts_rfd = _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0)
231 mem3: fts_lfree(root);
233 mem2: free(sp->fts_path);
239 fts_load(FTS *sp, FTSENT *p)
245 * Load the stream structure for the next traversal. Since we don't
246 * actually enter the directory until after the preorder visit, set
247 * the fts_accpath field specially so the chdir gets done to the right
248 * place and the user can access the first node. From fts_open it's
249 * known that the path will fit.
251 len = p->fts_pathlen = p->fts_namelen;
252 memmove(sp->fts_path, p->fts_name, len + 1);
253 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
255 memmove(p->fts_name, cp, len + 1);
256 p->fts_namelen = len;
258 p->fts_accpath = p->fts_path = sp->fts_path;
259 sp->fts_dev = p->fts_dev;
263 __fts_close_44bsd(FTS *sp)
269 * This still works if we haven't read anything -- the dummy structure
270 * points to the root list, so we step through to the end of the root
271 * list which has a valid parent pointer.
274 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
276 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
282 /* Free up child linked list, sort array, path buffer. */
284 fts_lfree(sp->fts_child);
289 /* Return to original directory, save errno if necessary. */
290 if (!ISSET(FTS_NOCHDIR)) {
291 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
292 (void)_close(sp->fts_rfd);
294 /* Set errno and return. */
295 if (saved_errno != 0) {
296 /* Free up the stream pointer. */
303 /* Free up the stream pointer. */
309 * Special case of "/" at the end of the path so that slashes aren't
310 * appended which would cause paths to be written as "....//foo".
313 (p->fts_path[p->fts_pathlen - 1] == '/' \
314 ? p->fts_pathlen - 1 : p->fts_pathlen)
317 __fts_read_44bsd(FTS *sp)
324 /* If finished or unrecoverable error, return NULL. */
325 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
328 /* Set current node pointer. */
331 /* Save and zero out user instructions. */
332 instr = p->fts_instr;
333 p->fts_instr = FTS_NOINSTR;
335 /* Any type of file may be re-visited; re-stat and re-turn. */
336 if (instr == FTS_AGAIN) {
337 p->fts_info = fts_stat(sp, p, 0);
342 * Following a symlink -- SLNONE test allows application to see
343 * SLNONE and recover. If indirecting through a symlink, have
344 * keep a pointer to current location. If unable to get that
345 * pointer, follow fails.
347 if (instr == FTS_FOLLOW &&
348 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
349 p->fts_info = fts_stat(sp, p, 1);
350 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
351 if ((p->fts_symfd = _open(".", O_RDONLY | O_CLOEXEC,
353 p->fts_errno = errno;
354 p->fts_info = FTS_ERR;
356 p->fts_flags |= FTS_SYMFOLLOW;
361 /* Directory in pre-order. */
362 if (p->fts_info == FTS_D) {
363 /* If skipped or crossed mount point, do post-order visit. */
364 if (instr == FTS_SKIP ||
365 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
366 if (p->fts_flags & FTS_SYMFOLLOW)
367 (void)_close(p->fts_symfd);
369 fts_lfree(sp->fts_child);
370 sp->fts_child = NULL;
372 p->fts_info = FTS_DP;
376 /* Rebuild if only read the names and now traversing. */
377 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
379 fts_lfree(sp->fts_child);
380 sp->fts_child = NULL;
384 * Cd to the subdirectory.
386 * If have already read and now fail to chdir, whack the list
387 * to make the names come out right, and set the parent errno
388 * so the application will eventually get an error condition.
389 * Set the FTS_DONTCHDIR flag so that when we logically change
390 * directories back to the parent we don't do a chdir.
392 * If haven't read do so. If the read fails, fts_build sets
393 * FTS_STOP or the fts_info field of the node.
395 if (sp->fts_child != NULL) {
396 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
397 p->fts_errno = errno;
398 p->fts_flags |= FTS_DONTCHDIR;
399 for (p = sp->fts_child; p != NULL;
402 p->fts_parent->fts_accpath;
404 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
410 sp->fts_child = NULL;
414 /* Move to the next node on this level. */
416 if ((p = p->fts_link) != NULL) {
420 * If reached the top, return to the original directory (or
421 * the root of the tree), and load the paths for the next root.
423 if (p->fts_level == FTS_ROOTLEVEL) {
424 if (FCHDIR(sp, sp->fts_rfd)) {
429 return (sp->fts_cur = p);
433 * User may have called fts_set on the node. If skipped,
434 * ignore. If followed, get a file descriptor so we can
435 * get back if necessary.
437 if (p->fts_instr == FTS_SKIP)
439 if (p->fts_instr == FTS_FOLLOW) {
440 p->fts_info = fts_stat(sp, p, 1);
441 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
443 _open(".", O_RDONLY | O_CLOEXEC, 0)) < 0) {
444 p->fts_errno = errno;
445 p->fts_info = FTS_ERR;
447 p->fts_flags |= FTS_SYMFOLLOW;
449 p->fts_instr = FTS_NOINSTR;
452 name: t = sp->fts_path + NAPPEND(p->fts_parent);
454 memmove(t, p->fts_name, p->fts_namelen + 1);
455 return (sp->fts_cur = p);
458 /* Move up to the parent node. */
462 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
464 * Done; free everything up and set errno to 0 so the user
465 * can distinguish between error and EOF.
469 return (sp->fts_cur = NULL);
472 /* NUL terminate the pathname. */
473 sp->fts_path[p->fts_pathlen] = '\0';
476 * Return to the parent directory. If at a root node or came through
477 * a symlink, go back through the file descriptor. Otherwise, cd up
480 if (p->fts_level == FTS_ROOTLEVEL) {
481 if (FCHDIR(sp, sp->fts_rfd)) {
485 } else if (p->fts_flags & FTS_SYMFOLLOW) {
486 if (FCHDIR(sp, p->fts_symfd)) {
488 (void)_close(p->fts_symfd);
493 (void)_close(p->fts_symfd);
494 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
495 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
499 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
500 return (sp->fts_cur = p);
504 * Fts_set takes the stream as an argument although it's not used in this
505 * implementation; it would be necessary if anyone wanted to add global
506 * semantics to fts using fts_set. An error return is allowed for similar
511 __fts_set_44bsd(FTS *sp, FTSENT *p, int instr)
513 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
514 instr != FTS_NOINSTR && instr != FTS_SKIP) {
518 p->fts_instr = instr;
523 __fts_children_44bsd(FTS *sp, int 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_44bsd)(FTS *sp)
598 return (fts_get_clientptr(sp));
601 #ifndef fts_get_stream
602 #error "fts_get_stream not defined"
606 (__fts_get_stream_44bsd)(FTSENT *p)
608 return (fts_get_stream(p));
612 __fts_set_clientptr_44bsd(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.
633 fts_build(FTS *sp, int type)
635 struct freebsd11_dirent *dp;
642 int cderrno, descend, len, level, maxlen, nlinks, oflag, saved_errno,
646 /* Set current node pointer. */
650 * Open the directory for reading. If this fails, we're done.
651 * If being called from fts_read, set the fts_info field.
654 if (ISSET(FTS_WHITEOUT))
655 oflag = DTF_NODUP | DTF_REWIND;
657 oflag = DTF_HIDEW | DTF_NODUP | DTF_REWIND;
659 #define __opendir2(path, flag) opendir(path)
661 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
663 cur->fts_info = FTS_DNR;
664 cur->fts_errno = errno;
670 * Nlinks is the number of possible entries of type directory in the
671 * directory if we're cheating on stat calls, 0 if we're not doing
672 * any stat calls at all, -1 if we're doing stats on everything.
674 if (type == BNAMES) {
676 /* Be quiet about nostat, GCC. */
678 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
679 if (fts_ufslinks(sp, cur))
680 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
690 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
691 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
692 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
695 * If we're going to need to stat anything or we want to descend
696 * and stay in the directory, chdir. If this fails we keep going,
697 * but set a flag so we don't chdir after the post-order visit.
698 * We won't be able to stat anything, but we can still return the
699 * names themselves. Note, that since fts_read won't be able to
700 * chdir into the directory, it will have to return different path
701 * names than before, i.e. "a/b" instead of "b". Since the node
702 * has already been visited in pre-order, have to wait until the
703 * post-order visit to return the error. There is a special case
704 * here, if there was nothing to stat then it's not an error to
705 * not be able to stat. This is all fairly nasty. If a program
706 * needed sorted entries or stat information, they had better be
707 * checking FTS_NS on the returned nodes.
710 if (nlinks || type == BREAD) {
711 if (fts_safe_changedir(sp, cur, _dirfd(dirp), NULL)) {
712 if (nlinks && type == BREAD)
713 cur->fts_errno = errno;
714 cur->fts_flags |= FTS_DONTCHDIR;
723 * Figure out the max file name length that can be stored in the
724 * current path -- the inner loop allocates more path as necessary.
725 * We really wouldn't have to do the maxlen calculations here, we
726 * could do them in fts_read before returning the path, but it's a
727 * lot easier here since the length is part of the dirent structure.
729 * If not changing directories set a pointer so that can just append
730 * each new name into the path.
733 if (ISSET(FTS_NOCHDIR)) {
734 cp = sp->fts_path + len;
737 /* GCC, you're too verbose. */
741 maxlen = sp->fts_pathlen - len;
743 level = cur->fts_level + 1;
745 /* Read the directory, attaching each entry to the `link' pointer. */
747 for (head = tail = NULL, nitems = 0;
748 dirp && (dp = freebsd11_readdir(dirp));) {
749 dnamlen = dp->d_namlen;
750 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
753 if ((p = fts_alloc(sp, dp->d_name, (int)dnamlen)) == NULL)
755 if (dnamlen >= maxlen) { /* include space for NUL */
756 oldaddr = sp->fts_path;
757 if (fts_palloc(sp, dnamlen + len + 1)) {
759 * No more memory for path or structures. Save
760 * errno, free up the current structure and the
761 * structures already allocated.
763 mem1: saved_errno = errno;
767 (void)closedir(dirp);
768 cur->fts_info = FTS_ERR;
773 /* Did realloc() change the pointer? */
774 if (oldaddr != sp->fts_path) {
776 if (ISSET(FTS_NOCHDIR))
777 cp = sp->fts_path + len;
779 maxlen = sp->fts_pathlen - len;
782 if (len + dnamlen >= USHRT_MAX) {
784 * In an FTSENT, fts_pathlen is a u_short so it is
785 * possible to wraparound here. If we do, free up
786 * the current structure and the structures already
787 * allocated, then error out with ENAMETOOLONG.
791 (void)closedir(dirp);
792 cur->fts_info = FTS_ERR;
794 errno = ENAMETOOLONG;
797 p->fts_level = level;
798 p->fts_parent = sp->fts_cur;
799 p->fts_pathlen = len + dnamlen;
802 if (dp->d_type == DT_WHT)
803 p->fts_flags |= FTS_ISW;
808 p->fts_info = FTS_NS;
809 p->fts_errno = cderrno;
811 p->fts_info = FTS_NSOK;
812 p->fts_accpath = cur->fts_accpath;
813 } else if (nlinks == 0
816 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
820 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
821 p->fts_info = FTS_NSOK;
823 /* Build a file name for fts_stat to stat. */
824 if (ISSET(FTS_NOCHDIR)) {
825 p->fts_accpath = p->fts_path;
826 memmove(cp, p->fts_name, p->fts_namelen + 1);
828 p->fts_accpath = p->fts_name;
830 p->fts_info = fts_stat(sp, p, 0);
832 /* Decrement link count if applicable. */
833 if (nlinks > 0 && (p->fts_info == FTS_D ||
834 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
838 /* We walk in directory order so "ls -f" doesn't get upset. */
849 (void)closedir(dirp);
852 * If realloc() changed the address of the path, adjust the
853 * addresses for the rest of the tree and the dir list.
856 fts_padjust(sp, head);
859 * If not changing directories, reset the path back to original
862 if (ISSET(FTS_NOCHDIR)) {
863 if (len == sp->fts_pathlen || nitems == 0)
869 * If descended after called from fts_children or after called from
870 * fts_read and nothing found, get back. At the root level we use
871 * the saved fd; if one of fts_open()'s arguments is a relative path
872 * to an empty directory, we wind up here with no other way back. If
873 * can't get back, we're done.
875 if (descend && (type == BCHILD || !nitems) &&
876 (cur->fts_level == FTS_ROOTLEVEL ?
877 FCHDIR(sp, sp->fts_rfd) :
878 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
879 cur->fts_info = FTS_ERR;
884 /* If didn't find anything, return NULL. */
887 cur->fts_info = FTS_DP;
891 /* Sort the entries. */
892 if (sp->fts_compar && nitems > 1)
893 head = fts_sort(sp, head, nitems);
898 fts_stat(FTS *sp, FTSENT *p, int follow)
903 struct freebsd11_stat *sbp, sb;
906 /* If user needs stat info, stat buffer already allocated. */
907 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
910 /* Check for whiteout. */
911 if (p->fts_flags & FTS_ISW) {
913 memset(sbp, '\0', sizeof(*sbp));
914 sbp->st_mode = S_IFWHT;
921 * If doing a logical walk, or application requested FTS_FOLLOW, do
922 * a stat(2). If that fails, check for a non-existent symlink. If
923 * fail, set the errno from the stat call.
925 if (ISSET(FTS_LOGICAL) || follow) {
926 if (freebsd11_stat(p->fts_accpath, sbp)) {
928 if (!freebsd11_lstat(p->fts_accpath, sbp)) {
932 p->fts_errno = saved_errno;
935 } else if (freebsd11_lstat(p->fts_accpath, sbp)) {
936 p->fts_errno = errno;
937 err: memset(sbp, 0, sizeof(*sbp));
941 if (S_ISDIR(sbp->st_mode)) {
943 * Set the device/inode. Used to find cycles and check for
944 * crossing mount points. Also remember the link count, used
945 * in fts_build to limit the number of stat calls. It is
946 * understood that these fields are only referenced if fts_info
949 dev = p->fts_dev = sbp->st_dev;
950 ino = p->fts_ino = sbp->st_ino;
951 p->fts_nlink = sbp->st_nlink;
953 if (ISDOT(p->fts_name))
957 * Cycle detection is done by brute force when the directory
958 * is first encountered. If the tree gets deep enough or the
959 * number of symbolic links to directories is high enough,
960 * something faster might be worthwhile.
962 for (t = p->fts_parent;
963 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
964 if (ino == t->fts_ino && dev == t->fts_dev) {
970 if (S_ISLNK(sbp->st_mode))
972 if (S_ISREG(sbp->st_mode))
974 return (FTS_DEFAULT);
978 * The comparison function takes pointers to pointers to FTSENT structures.
979 * Qsort wants a comparison function that takes pointers to void.
980 * (Both with appropriate levels of const-poisoning, of course!)
981 * Use a trampoline function to deal with the difference.
984 fts_compar(const void *a, const void *b)
988 parent = (*(const FTSENT * const *)a)->fts_fts;
989 return (*parent->fts_compar)(a, b);
993 fts_sort(FTS *sp, FTSENT *head, int nitems)
998 * Construct an array of pointers to the structures and call qsort(3).
999 * Reassemble the array in the order returned by qsort. If unable to
1000 * sort for memory reasons, return the directory entries in their
1001 * current order. Allocate enough space for the current needs plus
1002 * 40 so don't realloc one entry at a time.
1004 if (nitems > sp->fts_nitems) {
1005 sp->fts_nitems = nitems + 40;
1006 if ((sp->fts_array = reallocf(sp->fts_array,
1007 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
1012 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
1014 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
1015 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1016 ap[0]->fts_link = ap[1];
1017 ap[0]->fts_link = NULL;
1022 fts_alloc(FTS *sp, char *name, int namelen)
1027 struct ftsent_withstat {
1029 struct freebsd11_stat statbuf;
1033 * The file name is a variable length array and no stat structure is
1034 * necessary if the user has set the nostat bit. Allocate the FTSENT
1035 * structure, the file name and the stat structure in one chunk, but
1036 * be careful that the stat structure is reasonably aligned.
1038 if (ISSET(FTS_NOSTAT))
1039 len = sizeof(FTSENT) + namelen + 1;
1041 len = sizeof(struct ftsent_withstat) + namelen + 1;
1043 if ((p = malloc(len)) == NULL)
1046 if (ISSET(FTS_NOSTAT)) {
1047 p->fts_name = (char *)(p + 1);
1048 p->fts_statp = NULL;
1050 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1051 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1054 /* Copy the name and guarantee NUL termination. */
1055 memcpy(p->fts_name, name, namelen);
1056 p->fts_name[namelen] = '\0';
1057 p->fts_namelen = namelen;
1058 p->fts_path = sp->fts_path;
1061 p->fts_instr = FTS_NOINSTR;
1063 p->fts_pointer = NULL;
1069 fts_lfree(FTSENT *head)
1073 /* Free a linked list of structures. */
1074 while ((p = head)) {
1075 head = head->fts_link;
1081 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1082 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1083 * though the kernel won't resolve them. Add the size (not just what's needed)
1084 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1087 fts_palloc(FTS *sp, size_t more)
1090 sp->fts_pathlen += more + 256;
1092 * Check for possible wraparound. In an FTS, fts_pathlen is
1093 * a signed int but in an FTSENT it is an unsigned short.
1094 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1096 if (sp->fts_pathlen < 0 || sp->fts_pathlen >= USHRT_MAX) {
1099 sp->fts_path = NULL;
1100 errno = ENAMETOOLONG;
1103 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1104 return (sp->fts_path == NULL);
1108 * When the path is realloc'd, have to fix all of the pointers in structures
1112 fts_padjust(FTS *sp, FTSENT *head)
1115 char *addr = sp->fts_path;
1117 #define ADJUST(p) do { \
1118 if ((p)->fts_accpath != (p)->fts_name) { \
1119 (p)->fts_accpath = \
1120 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1122 (p)->fts_path = addr; \
1124 /* Adjust the current set of children. */
1125 for (p = sp->fts_child; p; p = p->fts_link)
1128 /* Adjust the rest of the tree, including the current level. */
1129 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1131 p = p->fts_link ? p->fts_link : p->fts_parent;
1136 fts_maxarglen(char * const *argv)
1140 for (max = 0; *argv; ++argv)
1141 if ((len = strlen(*argv)) > max)
1147 * Change to dir specified by fd or p->fts_accpath without getting
1148 * tricked by someone changing the world out from underneath us.
1149 * Assumes p->fts_dev and p->fts_ino are filled in.
1152 fts_safe_changedir(FTS *sp, FTSENT *p, int fd, char *path)
1154 int ret, oerrno, newfd;
1155 struct freebsd11_stat sb;
1158 if (ISSET(FTS_NOCHDIR))
1160 if (fd < 0 && (newfd = _open(path, O_RDONLY | O_CLOEXEC, 0)) < 0)
1162 if (freebsd11_fstat(newfd, &sb)) {
1166 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1167 errno = ENOENT; /* disinformation */
1171 ret = fchdir(newfd);
1175 (void)_close(newfd);
1181 * Check if the filesystem for "ent" has UFS-style links.
1184 fts_ufslinks(FTS *sp, const FTSENT *ent)
1186 struct _fts_private *priv;
1189 priv = (struct _fts_private *)sp;
1191 * If this node's device is different from the previous, grab
1192 * the filesystem information, and decide on the reliability
1193 * of the link information from this filesystem for stat(2)
1196 if (priv->ftsp_dev != ent->fts_dev) {
1197 if (freebsd11_statfs(ent->fts_path, &priv->ftsp_statfs) != -1) {
1198 priv->ftsp_dev = ent->fts_dev;
1199 priv->ftsp_linksreliable = 0;
1200 for (cpp = ufslike_filesystems; *cpp; cpp++) {
1201 if (strcmp(priv->ftsp_statfs.f_fstypename,
1203 priv->ftsp_linksreliable = 1;
1208 priv->ftsp_linksreliable = 0;
1211 return (priv->ftsp_linksreliable);
1214 __sym_compat(fts_open, __fts_open_44bsd, FBSD_1.0);
1215 __sym_compat(fts_close, __fts_close_44bsd, FBSD_1.0);
1216 __sym_compat(fts_read, __fts_read_44bsd, FBSD_1.0);
1217 __sym_compat(fts_set, __fts_set_44bsd, FBSD_1.0);
1218 __sym_compat(fts_children, __fts_children_44bsd, FBSD_1.0);
1219 __sym_compat(fts_get_clientptr, __fts_get_clientptr_44bsd, FBSD_1.0);
1220 __sym_compat(fts_get_stream, __fts_get_stream_44bsd, FBSD_1.0);
1221 __sym_compat(fts_set_clientptr, __fts_set_clientptr_44bsd, FBSD_1.0);