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 #include <sys/param.h>
40 #ifdef __UCLIBC_HAS_LFS__
41 /* this is wrong, either you include this header as first, or not at all */
45 # define fstat64 fstat
48 /* Largest alignment size needed, minus one.
49 Usually long double is the worst case. */
51 #define ALIGNBYTES (__alignof__ (long double) - 1)
53 /* Align P to that size. */
55 #define ALIGN(p) (((unsigned long int) (p) + ALIGNBYTES) & ~ALIGNBYTES)
59 static FTSENT *fts_alloc (FTS *, const char *, size_t) internal_function;
60 static FTSENT *fts_build (FTS *, int) internal_function;
61 static void fts_lfree (FTSENT *) internal_function;
62 static void fts_load (FTS *, FTSENT *) internal_function;
63 static size_t fts_maxarglen (char * const *) internal_function;
64 static void fts_padjust (FTS *, FTSENT *) internal_function;
65 static int fts_palloc (FTS *, size_t) internal_function;
66 static FTSENT *fts_sort (FTS *, FTSENT *, int) internal_function;
67 static u_short fts_stat (FTS *, FTSENT *, int) internal_function;
68 static int fts_safe_changedir (FTS *, FTSENT *, int, const char *)
72 #define MAX(a, b) ({ __typeof__ (a) _a = (a); \
73 __typeof__ (b) _b = (b); \
77 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
79 #define CLR(opt) (sp->fts_options &= ~(opt))
80 #define ISSET(opt) (sp->fts_options & (opt))
81 #define SET(opt) (sp->fts_options |= (opt))
83 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
86 #define BCHILD 1 /* fts_children */
87 #define BNAMES 2 /* fts_children, names only */
88 #define BREAD 3 /* fts_read */
91 fts_open( char * const *argv, register int options,
92 int (*compar) (const FTSENT **, const FTSENT **))
95 register FTSENT *p, *root;
97 FTSENT *parent = NULL;
101 if (options & ~FTS_OPTIONMASK) {
102 __set_errno (EINVAL);
106 /* Allocate/initialize the stream */
107 if ((sp = malloc((u_int)sizeof(FTS))) == NULL)
109 memset(sp, 0, sizeof(FTS));
110 sp->fts_compar = (int (*) (const void *, const void *)) compar;
111 sp->fts_options = options;
113 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
114 if (ISSET(FTS_LOGICAL))
118 * Start out with 1K of path space, and enough, in any case,
119 * to hold the user's paths.
122 #define MAXPATHLEN 1024
124 size_t maxarglen = fts_maxarglen(argv);
125 if (fts_palloc(sp, MAX(maxarglen, MAXPATHLEN)))
128 /* Allocate/initialize root's parent. */
130 if ((parent = fts_alloc(sp, "", 0)) == NULL)
132 parent->fts_level = FTS_ROOTPARENTLEVEL;
135 /* Allocate/initialize root(s). */
136 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
137 /* Don't allow zero-length paths. */
138 size_t len = strlen(*argv);
140 __set_errno (ENOENT);
144 p = fts_alloc(sp, *argv, len);
145 p->fts_level = FTS_ROOTLEVEL;
146 p->fts_parent = parent;
147 p->fts_accpath = p->fts_name;
148 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
150 /* Command-line "." and ".." are real directories. */
151 if (p->fts_info == FTS_DOT)
155 * If comparison routine supplied, traverse in sorted
156 * order; otherwise traverse in the order specified.
171 if (compar && nitems > 1)
172 root = fts_sort(sp, root, nitems);
175 * Allocate a dummy pointer and make fts_read think that we've just
176 * finished the node before the root(s); set p->fts_info to FTS_INIT
177 * so that everything about the "current" node is ignored.
179 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
181 sp->fts_cur->fts_link = root;
182 sp->fts_cur->fts_info = FTS_INIT;
185 * If using chdir(2), grab a file descriptor pointing to dot to ensure
186 * that we can get back here; this could be avoided for some paths,
187 * but almost certainly not worth the effort. Slashes, symbolic links,
188 * and ".." are all fairly nasty problems. Note, if we can't get the
189 * descriptor we run anyway, just more slowly.
191 if (!ISSET(FTS_NOCHDIR)
192 && (sp->fts_rfd = open(".", O_RDONLY, 0)) < 0)
197 mem3: fts_lfree(root);
199 mem2: free(sp->fts_path);
206 fts_load(FTS *sp, register FTSENT *p)
212 * Load the stream structure for the next traversal. Since we don't
213 * actually enter the directory until after the preorder visit, set
214 * the fts_accpath field specially so the chdir gets done to the right
215 * place and the user can access the first node. From fts_open it's
216 * known that the path will fit.
218 len = p->fts_pathlen = p->fts_namelen;
219 memmove(sp->fts_path, p->fts_name, len + 1);
220 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
222 memmove(p->fts_name, cp, len + 1);
223 p->fts_namelen = len;
225 p->fts_accpath = p->fts_path = sp->fts_path;
226 sp->fts_dev = p->fts_dev;
232 register FTSENT *freep, *p;
236 * This still works if we haven't read anything -- the dummy structure
237 * points to the root list, so we step through to the end of the root
238 * list which has a valid parent pointer.
241 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
243 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
249 /* Free up child linked list, sort array, path buffer. */
251 fts_lfree(sp->fts_child);
255 /* Return to original directory, save errno if necessary. */
256 if (!ISSET(FTS_NOCHDIR)) {
257 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
258 (void)close(sp->fts_rfd);
260 /* Set errno and return. */
261 if (saved_errno != 0) {
262 /* Free up the stream pointer. */
264 __set_errno (saved_errno);
269 /* Free up the stream pointer. */
275 * Special case of "/" at the end of the path so that slashes aren't
276 * appended which would cause paths to be written as "....//foo".
279 (p->fts_path[p->fts_pathlen - 1] == '/' \
280 ? p->fts_pathlen - 1 : p->fts_pathlen)
283 fts_read(register FTS *sp)
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;
380 /* Move to the next node on this level. */
382 if ((p = p->fts_link) != NULL) {
387 * If reached the top, return to the original directory (or
388 * the root of the tree), and load the paths for the next root.
390 if (p->fts_level == FTS_ROOTLEVEL) {
391 if (FCHDIR(sp, sp->fts_rfd)) {
400 * User may have called fts_set on the node. If skipped,
401 * ignore. If followed, get a file descriptor so we can
402 * get back if necessary.
404 if (p->fts_instr == FTS_SKIP)
406 if (p->fts_instr == FTS_FOLLOW) {
407 p->fts_info = fts_stat(sp, p, 1);
408 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
410 open(".", O_RDONLY, 0)) < 0) {
411 p->fts_errno = errno;
412 p->fts_info = FTS_ERR;
414 p->fts_flags |= FTS_SYMFOLLOW;
416 p->fts_instr = FTS_NOINSTR;
419 name: t = sp->fts_path + NAPPEND(p->fts_parent);
421 memmove(t, p->fts_name, p->fts_namelen + 1);
425 /* Move up to the parent node. */
430 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
432 * Done; free everything up and set errno to 0 so the user
433 * can distinguish between error and EOF.
437 return (sp->fts_cur = NULL);
440 /* NUL terminate the pathname. */
441 sp->fts_path[p->fts_pathlen] = '\0';
444 * Return to the parent directory. If at a root node or came through
445 * a symlink, go back through the file descriptor. Otherwise, cd up
448 if (p->fts_level == FTS_ROOTLEVEL) {
449 if (FCHDIR(sp, sp->fts_rfd)) {
453 } else if (p->fts_flags & FTS_SYMFOLLOW) {
454 if (FCHDIR(sp, p->fts_symfd)) {
456 (void)close(p->fts_symfd);
457 __set_errno (saved_errno);
461 (void)close(p->fts_symfd);
462 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
463 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
467 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
472 * Fts_set takes the stream as an argument although it's not used in this
473 * implementation; it would be necessary if anyone wanted to add global
474 * semantics to fts using fts_set. An error return is allowed for similar
479 fts_set(FTS *sp, FTSENT *p, int 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(register FTS *sp, int instr)
496 if (instr != 0 && instr != FTS_NAMEONLY) {
497 __set_errno (EINVAL);
501 /* Set current node pointer. */
505 * Errno set to 0 so user can distinguish empty directory from
510 /* Fatal errors stop here. */
514 /* Return logical hierarchy of user's arguments. */
515 if (p->fts_info == FTS_INIT)
516 return (p->fts_link);
519 * If not a directory being visited in pre-order, stop here. Could
520 * allow FTS_DNR, assuming the user has fixed the problem, but the
521 * same effect is available with FTS_AGAIN.
523 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
526 /* Free up any previous child list. */
527 if (sp->fts_child != NULL)
528 fts_lfree(sp->fts_child);
530 if (instr == FTS_NAMEONLY) {
537 * If using chdir on a relative path and called BEFORE fts_read does
538 * its chdir to the root of a traversal, we can lose -- we need to
539 * chdir into the subdirectory, and we don't know where the current
540 * directory is, so we can't get back so that the upcoming chdir by
541 * fts_read will work.
543 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
545 return (sp->fts_child = fts_build(sp, instr));
547 if ((fd = open(".", O_RDONLY, 0)) < 0)
549 sp->fts_child = fts_build(sp, instr);
553 return (sp->fts_child);
557 * This is the tricky part -- do not casually change *anything* in here. The
558 * idea is to build the linked list of entries that are used by fts_children
559 * and fts_read. There are lots of special cases.
561 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
562 * set and it's a physical walk (so that symbolic links can't be directories),
563 * we can do things quickly. First, if it's a 4.4BSD file system, the type
564 * of the file is in the directory entry. Otherwise, we assume that the number
565 * of subdirectories in a node is equal to the number of links to the parent.
566 * The former skips all stat calls. The latter skips stat calls in any leaf
567 * directories and for any files after the subdirectories in the directory have
568 * been found, cutting the stat calls by about 2/3.
572 fts_build(register FTS *sp, int type)
574 register struct dirent *dp;
575 register FTSENT *p, *head;
580 int /*cderrno,*/ descend, len, level, nlinks, saved_errno,
585 /* Set current node pointer. */
589 * Open the directory for reading. If this fails, we're done.
590 * If being called from fts_read, set the fts_info field.
592 #if defined FTS_WHITEOUT && 0
593 if (ISSET(FTS_WHITEOUT))
594 oflag = DTF_NODUP|DTF_REWIND;
596 oflag = DTF_HIDEW|DTF_NODUP|DTF_REWIND;
598 # define opendir2(path, flag) opendir(path)
600 if ((dirp = opendir2(cur->fts_accpath, oflag)) == NULL) {
602 cur->fts_info = FTS_DNR;
603 cur->fts_errno = errno;
609 * Nlinks is the number of possible entries of type directory in the
610 * directory if we're cheating on stat calls, 0 if we're not doing
611 * any stat calls at all, -1 if we're doing stats on everything.
613 if (type == BNAMES) {
615 /* Be quiet about nostat, GCC. */
617 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
618 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
626 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
627 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
628 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
631 * If we're going to need to stat anything or we want to descend
632 * and stay in the directory, chdir. If this fails we keep going,
633 * but set a flag so we don't chdir after the post-order visit.
634 * We won't be able to stat anything, but we can still return the
635 * names themselves. Note, that since fts_read won't be able to
636 * chdir into the directory, it will have to return different path
637 * names than before, i.e. "a/b" instead of "b". Since the node
638 * has already been visited in pre-order, have to wait until the
639 * post-order visit to return the error. There is a special case
640 * here, if there was nothing to stat then it's not an error to
641 * not be able to stat. This is all fairly nasty. If a program
642 * needed sorted entries or stat information, they had better be
643 * checking FTS_NS on the returned nodes.
646 if (nlinks || type == BREAD) {
647 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
648 if (nlinks && type == BREAD)
649 cur->fts_errno = errno;
650 cur->fts_flags |= FTS_DONTCHDIR;
652 /* cderrno = errno; */
653 (void)closedir(dirp);
661 * Figure out the max file name length that can be stored in the
662 * current path -- the inner loop allocates more path as necessary.
663 * We really wouldn't have to do the maxlen calculations here, we
664 * could do them in fts_read before returning the path, but it's a
665 * lot easier here since the length is part of the dirent structure.
667 * If not changing directories set a pointer so that can just append
668 * each new name into the path.
671 if (ISSET(FTS_NOCHDIR)) {
672 cp = sp->fts_path + len;
675 /* GCC, you're too verbose. */
679 maxlen = sp->fts_pathlen - len;
681 level = cur->fts_level + 1;
683 /* Read the directory, attaching each entry to the `link' pointer. */
685 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
686 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
689 if ((p = fts_alloc(sp, dp->d_name, _D_EXACT_NAMLEN (dp))) == NULL)
691 if (_D_EXACT_NAMLEN (dp) >= maxlen) {/* include space for NUL */
692 oldaddr = sp->fts_path;
693 if (fts_palloc(sp, _D_EXACT_NAMLEN (dp) + len + 1)) {
695 * No more memory for path or structures. Save
696 * errno, free up the current structure and the
697 * structures already allocated.
699 mem1: saved_errno = errno;
702 (void)closedir(dirp);
703 cur->fts_info = FTS_ERR;
705 __set_errno (saved_errno);
708 /* Did realloc() change the pointer? */
709 if (oldaddr != sp->fts_path) {
711 if (ISSET(FTS_NOCHDIR))
712 cp = sp->fts_path + len;
714 maxlen = sp->fts_pathlen - len;
717 if (len + _D_EXACT_NAMLEN (dp) >= USHRT_MAX) {
719 * In an FTSENT, fts_pathlen is a u_short so it is
720 * possible to wraparound here. If we do, free up
721 * the current structure and the structures already
722 * allocated, then error out with ENAMETOOLONG.
726 (void)closedir(dirp);
727 cur->fts_info = FTS_ERR;
729 __set_errno (ENAMETOOLONG);
732 p->fts_level = level;
733 p->fts_parent = sp->fts_cur;
734 p->fts_pathlen = len + _D_EXACT_NAMLEN (dp);
736 #if defined FTS_WHITEOUT && 0
737 if (dp->d_type == DT_WHT)
738 p->fts_flags |= FTS_ISW;
742 /* Unreachable code. cderrno is only ever set to a nonnull
743 value if dirp is closed at the same time. But then we
744 cannot enter this loop. */
747 p->fts_info = FTS_NS;
748 p->fts_errno = cderrno;
750 p->fts_info = FTS_NSOK;
751 p->fts_accpath = cur->fts_accpath;
755 #if defined DT_DIR && defined _DIRENT_HAVE_D_TYPE
757 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
761 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
762 p->fts_info = FTS_NSOK;
764 /* Build a file name for fts_stat to stat. */
765 if (ISSET(FTS_NOCHDIR)) {
766 p->fts_accpath = p->fts_path;
767 memmove(cp, p->fts_name, p->fts_namelen + 1);
769 p->fts_accpath = p->fts_name;
771 p->fts_info = fts_stat(sp, p, 0);
773 /* Decrement link count if applicable. */
774 if (nlinks > 0 && (p->fts_info == FTS_D ||
775 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
779 /* We walk in directory order so "ls -f" doesn't get upset. */
790 (void)closedir(dirp);
793 * If realloc() changed the address of the path, adjust the
794 * addresses for the rest of the tree and the dir list.
797 fts_padjust(sp, head);
800 * If not changing directories, reset the path back to original
803 if (ISSET(FTS_NOCHDIR)) {
804 if (len == sp->fts_pathlen || nitems == 0)
810 * If descended after called from fts_children or after called from
811 * fts_read and nothing found, get back. At the root level we use
812 * the saved fd; if one of fts_open()'s arguments is a relative path
813 * to an empty directory, we wind up here with no other way back. If
814 * can't get back, we're done.
816 if (descend && (type == BCHILD || !nitems) &&
817 (cur->fts_level == FTS_ROOTLEVEL ?
818 FCHDIR(sp, sp->fts_rfd) :
819 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
820 cur->fts_info = FTS_ERR;
826 /* If didn't find anything, return NULL. */
829 cur->fts_info = FTS_DP;
834 /* Sort the entries. */
835 if (sp->fts_compar && nitems > 1)
836 head = fts_sort(sp, head, nitems);
842 fts_stat(FTS *sp, register FTSENT *p, int follow)
847 struct stat *sbp, sb;
850 /* If user needs stat info, stat buffer already allocated. */
851 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
853 #if defined FTS_WHITEOUT && 0
854 /* check for whiteout */
855 if (p->fts_flags & FTS_ISW) {
857 memset(sbp, '\0', sizeof (*sbp));
858 sbp->st_mode = S_IFWHT;
865 * If doing a logical walk, or application requested FTS_FOLLOW, do
866 * a stat(2). If that fails, check for a non-existent symlink. If
867 * fail, set the errno from the stat call.
869 if (ISSET(FTS_LOGICAL) || follow) {
870 if (stat(p->fts_accpath, sbp)) {
872 if (!lstat(p->fts_accpath, sbp)) {
876 p->fts_errno = saved_errno;
879 } else if (lstat(p->fts_accpath, sbp)) {
880 p->fts_errno = errno;
881 err: memset(sbp, 0, sizeof(struct stat));
885 if (S_ISDIR(sbp->st_mode)) {
887 * Set the device/inode. Used to find cycles and check for
888 * crossing mount points. Also remember the link count, used
889 * in fts_build to limit the number of stat calls. It is
890 * understood that these fields are only referenced if fts_info
893 dev = p->fts_dev = sbp->st_dev;
894 ino = p->fts_ino = sbp->st_ino;
895 p->fts_nlink = sbp->st_nlink;
897 if (ISDOT(p->fts_name))
901 * Cycle detection is done by brute force when the directory
902 * is first encountered. If the tree gets deep enough or the
903 * number of symbolic links to directories is high enough,
904 * something faster might be worthwhile.
906 for (t = p->fts_parent;
907 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
908 if (ino == t->fts_ino && dev == t->fts_dev) {
914 if (S_ISLNK(sbp->st_mode))
916 if (S_ISREG(sbp->st_mode))
918 return (FTS_DEFAULT);
923 fts_sort(FTS *sp, FTSENT *head, register int nitems)
925 register FTSENT **ap, *p;
928 * Construct an array of pointers to the structures and call qsort(3).
929 * Reassemble the array in the order returned by qsort. If unable to
930 * sort for memory reasons, return the directory entries in their
931 * current order. Allocate enough space for the current needs plus
932 * 40 so don't realloc one entry at a time.
934 if (nitems > sp->fts_nitems) {
937 sp->fts_nitems = nitems + 40;
938 if ((a = realloc(sp->fts_array,
939 (size_t)(sp->fts_nitems * sizeof(FTSENT *)))) == NULL) {
941 sp->fts_array = NULL;
947 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
949 qsort((void *)sp->fts_array, nitems, sizeof(FTSENT *), sp->fts_compar);
950 for (head = *(ap = sp->fts_array); --nitems; ++ap)
951 ap[0]->fts_link = ap[1];
952 ap[0]->fts_link = NULL;
958 fts_alloc(FTS *sp, const char *name, size_t 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;
995 fts_lfree(register FTSENT *head)
999 /* Free a linked list of structures. */
1000 while ((p = head)) {
1001 head = head->fts_link;
1007 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1008 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1009 * though the kernel won't resolve them. Add the size (not just what's needed)
1010 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1014 fts_palloc(FTS *sp, size_t more)
1018 sp->fts_pathlen += more + 256;
1020 * Check for possible wraparound. In an FTS, fts_pathlen is
1021 * a signed int but in an FTSENT it is an unsigned short.
1022 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1024 if (sp->fts_pathlen < 0 || sp->fts_pathlen >= USHRT_MAX) {
1026 sp->fts_path = NULL;
1027 __set_errno (ENAMETOOLONG);
1030 p = realloc(sp->fts_path, sp->fts_pathlen);
1033 sp->fts_path = NULL;
1041 * When the path is realloc'd, have to fix all of the pointers in structures
1046 fts_padjust(FTS *sp, FTSENT *head)
1049 char *addr = sp->fts_path;
1051 #define ADJUST(p) do { \
1052 if ((p)->fts_accpath != (p)->fts_name) { \
1053 (p)->fts_accpath = \
1054 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1056 (p)->fts_path = addr; \
1058 /* Adjust the current set of children. */
1059 for (p = sp->fts_child; p; p = p->fts_link)
1062 /* Adjust the rest of the tree, including the current level. */
1063 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1065 p = p->fts_link ? p->fts_link : p->fts_parent;
1071 fts_maxarglen(char * const *argv)
1075 for (max = 0; *argv; ++argv)
1076 if ((len = strlen(*argv)) > max)
1082 * Change to dir specified by fd or p->fts_accpath without getting
1083 * tricked by someone changing the world out from underneath us.
1084 * Assumes p->fts_dev and p->fts_ino are filled in.
1088 fts_safe_changedir(FTS *sp, FTSENT *p, int fd, const char *path)
1090 int ret, oerrno, newfd;
1094 if (ISSET(FTS_NOCHDIR))
1096 if (fd < 0 && (newfd = open(path, O_RDONLY, 0)) < 0)
1098 if (fstat64(newfd, &sb)) {
1102 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1103 __set_errno (ENOENT); /* disinformation */
1107 ret = fchdir(newfd);
1112 __set_errno (oerrno);