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
30 #if defined(LIBC_SCCS) && !defined(lint)
31 static char sccsid[] = "@(#)fts.c 8.6 (Berkeley) 8/14/94";
32 #endif /* LIBC_SCCS and not lint */
34 #include <sys/param.h>
35 #include <include/sys/stat.h>
45 /* Largest alignment size needed, minus one.
46 Usually long double is the worst case. */
48 #define ALIGNBYTES (__alignof__ (long double) - 1)
50 /* Align P to that size. */
52 #define ALIGN(p) (((unsigned long int) (p) + ALIGNBYTES) & ~ALIGNBYTES)
56 static FTSENT *fts_alloc __P((FTS *, const char *, int)) internal_function;
57 static FTSENT *fts_build __P((FTS *, int)) internal_function;
58 static void fts_lfree __P((FTSENT *)) internal_function;
59 static void fts_load __P((FTS *, FTSENT *)) internal_function;
60 static size_t fts_maxarglen __P((char * const *)) internal_function;
61 static void fts_padjust __P((FTS *, FTSENT *)) internal_function;
62 static int fts_palloc __P((FTS *, size_t)) internal_function;
63 static FTSENT *fts_sort __P((FTS *, FTSENT *, int)) internal_function;
64 static u_short fts_stat __P((FTS *, FTSENT *, int)) internal_function;
65 static int fts_safe_changedir __P((FTS *, FTSENT *, int, const char *))
69 #define MAX(a, b) ({ __typeof__ (a) _a = (a); \
70 __typeof__ (b) _b = (b); \
74 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
76 #define CLR(opt) (sp->fts_options &= ~(opt))
77 #define ISSET(opt) (sp->fts_options & (opt))
78 #define SET(opt) (sp->fts_options |= (opt))
80 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && __fchdir(fd))
83 #define BCHILD 1 /* fts_children */
84 #define BNAMES 2 /* fts_children, names only */
85 #define BREAD 3 /* fts_read */
88 fts_open(argv, options, compar)
91 int (*compar) __P((const FTSENT **, const FTSENT **));
94 register FTSENT *p, *root;
100 if (options & ~FTS_OPTIONMASK) {
101 __set_errno (EINVAL);
105 /* Allocate/initialize the stream */
106 if ((sp = malloc((u_int)sizeof(FTS))) == NULL)
108 memset(sp, 0, sizeof(FTS));
109 sp->fts_compar = (int (*) __P((const void *, const void *))) compar;
110 sp->fts_options = options;
112 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
113 if (ISSET(FTS_LOGICAL))
117 * Start out with 1K of path space, and enough, in any case,
118 * to hold the user's paths.
121 #define MAXPATHLEN 1024
123 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
126 /* Allocate/initialize root's parent. */
127 if ((parent = fts_alloc(sp, "", 0)) == NULL)
129 parent->fts_level = FTS_ROOTPARENTLEVEL;
131 /* Allocate/initialize root(s). */
132 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
133 /* Don't allow zero-length paths. */
134 if ((len = strlen(*argv)) == 0) {
135 __set_errno (ENOENT);
139 p = fts_alloc(sp, *argv, len);
140 p->fts_level = FTS_ROOTLEVEL;
141 p->fts_parent = parent;
142 p->fts_accpath = p->fts_name;
143 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
145 /* Command-line "." and ".." are real directories. */
146 if (p->fts_info == FTS_DOT)
150 * If comparison routine supplied, traverse in sorted
151 * order; otherwise traverse in the order specified.
166 if (compar && nitems > 1)
167 root = fts_sort(sp, root, nitems);
170 * Allocate a dummy pointer and make fts_read think that we've just
171 * finished the node before the root(s); set p->fts_info to FTS_INIT
172 * so that everything about the "current" node is ignored.
174 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
176 sp->fts_cur->fts_link = root;
177 sp->fts_cur->fts_info = FTS_INIT;
180 * If using chdir(2), grab a file descriptor pointing to dot to ensure
181 * that we can get back here; this could be avoided for some paths,
182 * but almost certainly not worth the effort. Slashes, symbolic links,
183 * and ".." are all fairly nasty problems. Note, if we can't get the
184 * descriptor we run anyway, just more slowly.
186 if (!ISSET(FTS_NOCHDIR)
187 && (sp->fts_rfd = __open(".", O_RDONLY, 0)) < 0)
192 mem3: fts_lfree(root);
194 mem2: free(sp->fts_path);
209 * Load the stream structure for the next traversal. Since we don't
210 * actually enter the directory until after the preorder visit, set
211 * the fts_accpath field specially so the chdir gets done to the right
212 * place and the user can access the first node. From fts_open it's
213 * known that the path will fit.
215 len = p->fts_pathlen = p->fts_namelen;
216 memmove(sp->fts_path, p->fts_name, len + 1);
217 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
219 memmove(p->fts_name, cp, len + 1);
220 p->fts_namelen = len;
222 p->fts_accpath = p->fts_path = sp->fts_path;
223 sp->fts_dev = p->fts_dev;
230 register FTSENT *freep, *p;
234 * This still works if we haven't read anything -- the dummy structure
235 * points to the root list, so we step through to the end of the root
236 * list which has a valid parent pointer.
239 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
241 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
247 /* Free up child linked list, sort array, path buffer. */
249 fts_lfree(sp->fts_child);
254 /* Return to original directory, save errno if necessary. */
255 if (!ISSET(FTS_NOCHDIR)) {
256 saved_errno = __fchdir(sp->fts_rfd) ? errno : 0;
257 (void)__close(sp->fts_rfd);
259 /* Set errno and return. */
260 if (saved_errno != 0) {
261 /* Free up the stream pointer. */
263 __set_errno (saved_errno);
268 /* Free up the stream pointer. */
274 * Special case of "/" at the end of the path so that slashes aren't
275 * appended which would cause paths to be written as "....//foo".
278 (p->fts_path[p->fts_pathlen - 1] == '/' \
279 ? p->fts_pathlen - 1 : p->fts_pathlen)
285 register FTSENT *p, *tmp;
290 /* If finished or unrecoverable error, return NULL. */
291 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
294 /* Set current node pointer. */
297 /* Save and zero out user instructions. */
298 instr = p->fts_instr;
299 p->fts_instr = FTS_NOINSTR;
301 /* Any type of file may be re-visited; re-stat and re-turn. */
302 if (instr == FTS_AGAIN) {
303 p->fts_info = fts_stat(sp, p, 0);
308 * Following a symlink -- SLNONE test allows application to see
309 * SLNONE and recover. If indirecting through a symlink, have
310 * keep a pointer to current location. If unable to get that
311 * pointer, follow fails.
313 if (instr == FTS_FOLLOW &&
314 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
315 p->fts_info = fts_stat(sp, p, 1);
316 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
317 if ((p->fts_symfd = __open(".", O_RDONLY, 0)) < 0) {
318 p->fts_errno = errno;
319 p->fts_info = FTS_ERR;
321 p->fts_flags |= FTS_SYMFOLLOW;
326 /* Directory in pre-order. */
327 if (p->fts_info == FTS_D) {
328 /* If skipped or crossed mount point, do post-order visit. */
329 if (instr == FTS_SKIP ||
330 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
331 if (p->fts_flags & FTS_SYMFOLLOW)
332 (void)__close(p->fts_symfd);
334 fts_lfree(sp->fts_child);
335 sp->fts_child = NULL;
337 p->fts_info = FTS_DP;
341 /* Rebuild if only read the names and now traversing. */
342 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
344 fts_lfree(sp->fts_child);
345 sp->fts_child = NULL;
349 * Cd to the subdirectory.
351 * If have already read and now fail to chdir, whack the list
352 * to make the names come out right, and set the parent errno
353 * so the application will eventually get an error condition.
354 * Set the FTS_DONTCHDIR flag so that when we logically change
355 * directories back to the parent we don't do a chdir.
357 * If haven't read do so. If the read fails, fts_build sets
358 * FTS_STOP or the fts_info field of the node.
360 if (sp->fts_child != NULL) {
361 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
362 p->fts_errno = errno;
363 p->fts_flags |= FTS_DONTCHDIR;
364 for (p = sp->fts_child; p != NULL;
367 p->fts_parent->fts_accpath;
369 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
375 sp->fts_child = NULL;
379 /* Move to the next node on this level. */
381 if ((p = p->fts_link) != NULL) {
385 * If reached the top, return to the original directory (or
386 * the root of the tree), and load the paths for the next root.
388 if (p->fts_level == FTS_ROOTLEVEL) {
389 if (FCHDIR(sp, sp->fts_rfd)) {
394 return (sp->fts_cur = p);
398 * User may have called fts_set on the node. If skipped,
399 * ignore. If followed, get a file descriptor so we can
400 * get back if necessary.
402 if (p->fts_instr == FTS_SKIP)
404 if (p->fts_instr == FTS_FOLLOW) {
405 p->fts_info = fts_stat(sp, p, 1);
406 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
408 __open(".", O_RDONLY, 0)) < 0) {
409 p->fts_errno = errno;
410 p->fts_info = FTS_ERR;
412 p->fts_flags |= FTS_SYMFOLLOW;
414 p->fts_instr = FTS_NOINSTR;
417 name: t = sp->fts_path + NAPPEND(p->fts_parent);
419 memmove(t, p->fts_name, p->fts_namelen + 1);
420 return (sp->fts_cur = p);
423 /* Move up to the parent node. */
427 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
429 * Done; free everything up and set errno to 0 so the user
430 * can distinguish between error and EOF.
434 return (sp->fts_cur = NULL);
437 /* NUL terminate the pathname. */
438 sp->fts_path[p->fts_pathlen] = '\0';
441 * Return to the parent directory. If at a root node or came through
442 * a symlink, go back through the file descriptor. Otherwise, cd up
445 if (p->fts_level == FTS_ROOTLEVEL) {
446 if (FCHDIR(sp, sp->fts_rfd)) {
450 } else if (p->fts_flags & FTS_SYMFOLLOW) {
451 if (FCHDIR(sp, p->fts_symfd)) {
453 (void)__close(p->fts_symfd);
454 __set_errno (saved_errno);
458 (void)__close(p->fts_symfd);
459 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
460 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
464 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
465 return (sp->fts_cur = p);
469 * Fts_set takes the stream as an argument although it's not used in this
470 * implementation; it would be necessary if anyone wanted to add global
471 * semantics to fts using fts_set. An error return is allowed for similar
476 fts_set(sp, p, instr)
481 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
482 instr != FTS_NOINSTR && instr != FTS_SKIP) {
483 __set_errno (EINVAL);
486 p->fts_instr = instr;
491 fts_children(sp, instr)
498 if (instr != 0 && instr != FTS_NAMEONLY) {
499 __set_errno (EINVAL);
503 /* Set current node pointer. */
507 * Errno set to 0 so user can distinguish empty directory from
512 /* Fatal errors stop here. */
516 /* Return logical hierarchy of user's arguments. */
517 if (p->fts_info == FTS_INIT)
518 return (p->fts_link);
521 * If not a directory being visited in pre-order, stop here. Could
522 * allow FTS_DNR, assuming the user has fixed the problem, but the
523 * same effect is available with FTS_AGAIN.
525 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
528 /* Free up any previous child list. */
529 if (sp->fts_child != NULL)
530 fts_lfree(sp->fts_child);
532 if (instr == FTS_NAMEONLY) {
539 * If using chdir on a relative path and called BEFORE fts_read does
540 * its chdir to the root of a traversal, we can lose -- we need to
541 * chdir into the subdirectory, and we don't know where the current
542 * directory is, so we can't get back so that the upcoming chdir by
543 * fts_read will work.
545 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
547 return (sp->fts_child = fts_build(sp, instr));
549 if ((fd = __open(".", O_RDONLY, 0)) < 0)
551 sp->fts_child = fts_build(sp, instr);
555 return (sp->fts_child);
559 * This is the tricky part -- do not casually change *anything* in here. The
560 * idea is to build the linked list of entries that are used by fts_children
561 * and fts_read. There are lots of special cases.
563 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
564 * set and it's a physical walk (so that symbolic links can't be directories),
565 * we can do things quickly. First, if it's a 4.4BSD file system, the type
566 * of the file is in the directory entry. Otherwise, we assume that the number
567 * of subdirectories in a node is equal to the number of links to the parent.
568 * The former skips all stat calls. The latter skips stat calls in any leaf
569 * directories and for any files after the subdirectories in the directory have
570 * been found, cutting the stat calls by about 2/3.
578 register struct dirent *dp;
579 register FTSENT *p, *head;
584 int cderrno, descend, len, level, maxlen, nlinks, saved_errno,
588 /* Set current node pointer. */
592 * Open the directory for reading. If this fails, we're done.
593 * If being called from fts_read, set the fts_info field.
595 #if defined FTS_WHITEOUT && 0
596 if (ISSET(FTS_WHITEOUT))
597 oflag = DTF_NODUP|DTF_REWIND;
599 oflag = DTF_HIDEW|DTF_NODUP|DTF_REWIND;
601 # define __opendir2(path, flag) __opendir(path)
603 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
605 cur->fts_info = FTS_DNR;
606 cur->fts_errno = errno;
612 * Nlinks is the number of possible entries of type directory in the
613 * directory if we're cheating on stat calls, 0 if we're not doing
614 * any stat calls at all, -1 if we're doing stats on everything.
616 if (type == BNAMES) {
618 /* Be quiet about nostat, GCC. */
620 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
621 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
629 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
630 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
631 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
634 * If we're going to need to stat anything or we want to descend
635 * and stay in the directory, chdir. If this fails we keep going,
636 * but set a flag so we don't chdir after the post-order visit.
637 * We won't be able to stat anything, but we can still return the
638 * names themselves. Note, that since fts_read won't be able to
639 * chdir into the directory, it will have to return different path
640 * names than before, i.e. "a/b" instead of "b". Since the node
641 * has already been visited in pre-order, have to wait until the
642 * post-order visit to return the error. There is a special case
643 * here, if there was nothing to stat then it's not an error to
644 * not be able to stat. This is all fairly nasty. If a program
645 * needed sorted entries or stat information, they had better be
646 * checking FTS_NS on the returned nodes.
649 if (nlinks || type == BREAD) {
650 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
651 if (nlinks && type == BREAD)
652 cur->fts_errno = errno;
653 cur->fts_flags |= FTS_DONTCHDIR;
656 (void)closedir(dirp);
664 * Figure out the max file name length that can be stored in the
665 * current path -- the inner loop allocates more path as necessary.
666 * We really wouldn't have to do the maxlen calculations here, we
667 * could do them in fts_read before returning the path, but it's a
668 * lot easier here since the length is part of the dirent structure.
670 * If not changing directories set a pointer so that can just append
671 * each new name into the path.
674 if (ISSET(FTS_NOCHDIR)) {
675 cp = sp->fts_path + len;
678 /* GCC, you're too verbose. */
682 maxlen = sp->fts_pathlen - len;
684 level = cur->fts_level + 1;
686 /* Read the directory, attaching each entry to the `link' pointer. */
688 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
689 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
692 if ((p = fts_alloc(sp, dp->d_name, (int)_D_EXACT_NAMLEN (dp))) == NULL)
694 if (_D_EXACT_NAMLEN (dp) >= maxlen) {/* include space for NUL */
695 oldaddr = sp->fts_path;
696 if (fts_palloc(sp, _D_EXACT_NAMLEN (dp) + len + 1)) {
698 * No more memory for path or structures. Save
699 * errno, free up the current structure and the
700 * structures already allocated.
702 mem1: saved_errno = errno;
706 (void)__closedir(dirp);
707 cur->fts_info = FTS_ERR;
709 __set_errno (saved_errno);
712 /* Did realloc() change the pointer? */
713 if (oldaddr != sp->fts_path) {
715 if (ISSET(FTS_NOCHDIR))
716 cp = sp->fts_path + len;
718 maxlen = sp->fts_pathlen - len;
721 if (len + _D_EXACT_NAMLEN (dp) >= USHRT_MAX) {
723 * In an FTSENT, fts_pathlen is a u_short so it is
724 * possible to wraparound here. If we do, free up
725 * the current structure and the structures already
726 * allocated, then error out with ENAMETOOLONG.
730 (void)__closedir(dirp);
731 cur->fts_info = FTS_ERR;
733 __set_errno (ENAMETOOLONG);
736 p->fts_level = level;
737 p->fts_parent = sp->fts_cur;
738 p->fts_pathlen = len + _D_EXACT_NAMLEN (dp);
740 #if defined FTS_WHITEOUT && 0
741 if (dp->d_type == DT_WHT)
742 p->fts_flags |= FTS_ISW;
747 p->fts_info = FTS_NS;
748 p->fts_errno = cderrno;
750 p->fts_info = FTS_NSOK;
751 p->fts_accpath = cur->fts_accpath;
752 } else if (nlinks == 0
753 #if defined DT_DIR && defined _DIRENT_HAVE_D_TYPE
755 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
759 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
760 p->fts_info = FTS_NSOK;
762 /* Build a file name for fts_stat to stat. */
763 if (ISSET(FTS_NOCHDIR)) {
764 p->fts_accpath = p->fts_path;
765 memmove(cp, p->fts_name, p->fts_namelen + 1);
767 p->fts_accpath = p->fts_name;
769 p->fts_info = fts_stat(sp, p, 0);
771 /* Decrement link count if applicable. */
772 if (nlinks > 0 && (p->fts_info == FTS_D ||
773 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
777 /* We walk in directory order so "ls -f" doesn't get upset. */
788 (void)__closedir(dirp);
791 * If realloc() changed the address of the path, adjust the
792 * addresses for the rest of the tree and the dir list.
795 fts_padjust(sp, head);
798 * If not changing directories, reset the path back to original
801 if (ISSET(FTS_NOCHDIR)) {
802 if (len == sp->fts_pathlen || nitems == 0)
808 * If descended after called from fts_children or after called from
809 * fts_read and nothing found, get back. At the root level we use
810 * the saved fd; if one of fts_open()'s arguments is a relative path
811 * to an empty directory, we wind up here with no other way back. If
812 * can't get back, we're done.
814 if (descend && (type == BCHILD || !nitems) &&
815 (cur->fts_level == FTS_ROOTLEVEL ?
816 FCHDIR(sp, sp->fts_rfd) :
817 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
818 cur->fts_info = FTS_ERR;
823 /* If didn't find anything, return NULL. */
826 cur->fts_info = FTS_DP;
830 /* Sort the entries. */
831 if (sp->fts_compar && nitems > 1)
832 head = fts_sort(sp, head, nitems);
838 fts_stat(sp, p, follow)
846 struct stat *sbp, sb;
849 /* If user needs stat info, stat buffer already allocated. */
850 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
852 #if defined FTS_WHITEOUT && 0
853 /* check for whiteout */
854 if (p->fts_flags & FTS_ISW) {
856 memset(sbp, '\0', sizeof (*sbp));
857 sbp->st_mode = S_IFWHT;
864 * If doing a logical walk, or application requested FTS_FOLLOW, do
865 * a stat(2). If that fails, check for a non-existent symlink. If
866 * fail, set the errno from the stat call.
868 if (ISSET(FTS_LOGICAL) || follow) {
869 if (stat(p->fts_accpath, sbp)) {
871 if (!lstat(p->fts_accpath, sbp)) {
875 p->fts_errno = saved_errno;
878 } else if (lstat(p->fts_accpath, sbp)) {
879 p->fts_errno = errno;
880 err: memset(sbp, 0, sizeof(struct stat));
884 if (S_ISDIR(sbp->st_mode)) {
886 * Set the device/inode. Used to find cycles and check for
887 * crossing mount points. Also remember the link count, used
888 * in fts_build to limit the number of stat calls. It is
889 * understood that these fields are only referenced if fts_info
892 dev = p->fts_dev = sbp->st_dev;
893 ino = p->fts_ino = sbp->st_ino;
894 p->fts_nlink = sbp->st_nlink;
896 if (ISDOT(p->fts_name))
900 * Cycle detection is done by brute force when the directory
901 * is first encountered. If the tree gets deep enough or the
902 * number of symbolic links to directories is high enough,
903 * something faster might be worthwhile.
905 for (t = p->fts_parent;
906 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
907 if (ino == t->fts_ino && dev == t->fts_dev) {
913 if (S_ISLNK(sbp->st_mode))
915 if (S_ISREG(sbp->st_mode))
917 return (FTS_DEFAULT);
922 fts_sort(sp, head, nitems)
927 register FTSENT **ap, *p;
930 * Construct an array of pointers to the structures and call qsort(3).
931 * Reassemble the array in the order returned by qsort. If unable to
932 * sort for memory reasons, return the directory entries in their
933 * current order. Allocate enough space for the current needs plus
934 * 40 so don't realloc one entry at a time.
936 if (nitems > sp->fts_nitems) {
937 sp->fts_nitems = nitems + 40;
938 if ((sp->fts_array = realloc(sp->fts_array,
939 (size_t)(sp->fts_nitems * sizeof(FTSENT *)))) == NULL) {
944 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
946 qsort((void *)sp->fts_array, nitems, sizeof(FTSENT *), sp->fts_compar);
947 for (head = *(ap = sp->fts_array); --nitems; ++ap)
948 ap[0]->fts_link = ap[1];
949 ap[0]->fts_link = NULL;
955 fts_alloc(sp, name, namelen)
958 register int namelen;
964 * The file name is a variable length array and no stat structure is
965 * necessary if the user has set the nostat bit. Allocate the FTSENT
966 * structure, the file name and the stat structure in one chunk, but
967 * be careful that the stat structure is reasonably aligned. Since the
968 * fts_name field is declared to be of size 1, the fts_name pointer is
969 * namelen + 2 before the first possible address of the stat structure.
971 len = sizeof(FTSENT) + namelen;
972 if (!ISSET(FTS_NOSTAT))
973 len += sizeof(struct stat) + ALIGNBYTES;
974 if ((p = malloc(len)) == NULL)
977 /* Copy the name and guarantee NUL termination. */
978 memmove(p->fts_name, name, namelen);
979 p->fts_name[namelen] = '\0';
981 if (!ISSET(FTS_NOSTAT))
982 p->fts_statp = (struct stat *)ALIGN(p->fts_name + namelen + 2);
983 p->fts_namelen = namelen;
984 p->fts_path = sp->fts_path;
987 p->fts_instr = FTS_NOINSTR;
989 p->fts_pointer = NULL;
996 register FTSENT *head;
1000 /* Free a linked list of structures. */
1001 while ((p = head)) {
1002 head = head->fts_link;
1008 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1009 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1010 * though the kernel won't resolve them. Add the size (not just what's needed)
1011 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1015 fts_palloc(sp, more)
1019 sp->fts_pathlen += more + 256;
1021 * Check for possible wraparound. In an FTS, fts_pathlen is
1022 * a signed int but in an FTSENT it is an unsigned short.
1023 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1025 if (sp->fts_pathlen < 0 || sp->fts_pathlen >= USHRT_MAX) {
1028 sp->fts_path = NULL;
1029 __set_errno (ENAMETOOLONG);
1032 sp->fts_path = realloc(sp->fts_path, sp->fts_pathlen);
1033 return (sp->fts_path == NULL);
1037 * When the path is realloc'd, have to fix all of the pointers in structures
1042 fts_padjust(sp, head)
1047 char *addr = sp->fts_path;
1049 #define ADJUST(p) do { \
1050 if ((p)->fts_accpath != (p)->fts_name) { \
1051 (p)->fts_accpath = \
1052 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1054 (p)->fts_path = addr; \
1056 /* Adjust the current set of children. */
1057 for (p = sp->fts_child; p; p = p->fts_link)
1060 /* Adjust the rest of the tree, including the current level. */
1061 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1063 p = p->fts_link ? p->fts_link : p->fts_parent;
1074 for (max = 0; *argv; ++argv)
1075 if ((len = strlen(*argv)) > max)
1081 * Change to dir specified by fd or p->fts_accpath without getting
1082 * tricked by someone changing the world out from underneath us.
1083 * Assumes p->fts_dev and p->fts_ino are filled in.
1087 fts_safe_changedir(sp, p, fd, path)
1093 int ret, oerrno, newfd;
1097 if (ISSET(FTS_NOCHDIR))
1099 if (fd < 0 && (newfd = __open(path, O_RDONLY, 0)) < 0)
1101 if (__fstat(newfd, &sb)) {
1105 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1106 __set_errno (ENOENT); /* disinformation */
1110 ret = __fchdir(newfd);
1114 (void)__close(newfd);
1115 __set_errno (oerrno);