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. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * $OpenBSD: fts.c,v 1.22 1999/10/03 19:22:22 millert Exp $
35 * $FreeBSD: src/lib/libc/gen/fts.c,v 1.14.2.4 2001/06/01 22:00:34 kris Exp $
38 #if defined(LIBC_SCCS) && !defined(lint)
40 static char sccsid[] = "@(#)fts.c 8.6 (Berkeley) 8/14/94";
42 static char rcsid[] = "$FreeBSD: src/lib/libc/gen/fts.c,v 1.14.2.4 2001/06/01 22:00:34 kris Exp $";
44 #endif /* LIBC_SCCS and not lint */
46 #include <sys/param.h>
57 static FTSENT *fts_alloc __P((FTS *, char *, int));
58 static FTSENT *fts_build __P((FTS *, int));
59 static void fts_lfree __P((FTSENT *));
60 static void fts_load __P((FTS *, FTSENT *));
61 static size_t fts_maxarglen __P((char * const *));
62 static void fts_padjust __P((FTS *, FTSENT *));
63 static int fts_palloc __P((FTS *, size_t));
64 static FTSENT *fts_sort __P((FTS *, FTSENT *, int));
65 static u_short fts_stat __P((FTS *, FTSENT *, int));
66 static int fts_safe_changedir __P((FTS *, FTSENT *, int, char *));
68 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
70 #define CLR(opt) (sp->fts_options &= ~(opt))
71 #define ISSET(opt) (sp->fts_options & (opt))
72 #define SET(opt) (sp->fts_options |= (opt))
74 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
77 #define BCHILD 1 /* fts_children */
78 #define BNAMES 2 /* fts_children, names only */
79 #define BREAD 3 /* fts_read */
82 fts_open(argv, options, compar)
85 int (*compar) __P((const FTSENT **, const FTSENT **));
88 register FTSENT *p, *root;
94 if (options & ~FTS_OPTIONMASK) {
99 /* Allocate/initialize the stream */
100 if ((sp = malloc((u_int)sizeof(FTS))) == NULL)
102 memset(sp, 0, sizeof(FTS));
103 sp->fts_compar = compar;
104 sp->fts_options = options;
109 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
110 if (ISSET(FTS_LOGICAL))
114 * Start out with 1K of path space, and enough, in any case,
115 * to hold the user's paths.
117 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
120 /* Allocate/initialize root's parent. */
121 if ((parent = fts_alloc(sp, "", 0)) == NULL)
123 parent->fts_level = FTS_ROOTPARENTLEVEL;
125 /* Allocate/initialize root(s). */
126 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
127 /* Don't allow zero-length paths. */
128 if ((len = strlen(*argv)) == 0) {
133 p = fts_alloc(sp, *argv, len);
134 p->fts_level = FTS_ROOTLEVEL;
135 p->fts_parent = parent;
136 p->fts_accpath = p->fts_name;
137 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
139 /* Command-line "." and ".." are real directories. */
140 if (p->fts_info == FTS_DOT)
144 * If comparison routine supplied, traverse in sorted
145 * order; otherwise traverse in the order specified.
160 if (compar && nitems > 1)
161 root = fts_sort(sp, root, nitems);
164 * Allocate a dummy pointer and make fts_read think that we've just
165 * finished the node before the root(s); set p->fts_info to FTS_INIT
166 * so that everything about the "current" node is ignored.
168 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
170 sp->fts_cur->fts_link = root;
171 sp->fts_cur->fts_info = FTS_INIT;
174 * If using chdir(2), grab a file descriptor pointing to dot to ensure
175 * that we can get back here; this could be avoided for some paths,
176 * but almost certainly not worth the effort. Slashes, symbolic links,
177 * and ".." are all fairly nasty problems. Note, if we can't get the
178 * descriptor we run anyway, just more slowly.
180 if (!ISSET(FTS_NOCHDIR) && (sp->fts_rfd = _open(".", O_RDONLY, 0)) < 0)
185 mem3: fts_lfree(root);
187 mem2: free(sp->fts_path);
201 * Load the stream structure for the next traversal. Since we don't
202 * actually enter the directory until after the preorder visit, set
203 * the fts_accpath field specially so the chdir gets done to the right
204 * place and the user can access the first node. From fts_open it's
205 * known that the path will fit.
207 len = p->fts_pathlen = p->fts_namelen;
208 memmove(sp->fts_path, p->fts_name, len + 1);
209 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
211 memmove(p->fts_name, cp, len + 1);
212 p->fts_namelen = len;
214 p->fts_accpath = p->fts_path = sp->fts_path;
215 sp->fts_dev = p->fts_dev;
222 register FTSENT *freep, *p;
226 * This still works if we haven't read anything -- the dummy structure
227 * points to the root list, so we step through to the end of the root
228 * list which has a valid parent pointer.
231 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
233 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
239 /* Free up child linked list, sort array, path buffer. */
241 fts_lfree(sp->fts_child);
246 /* Return to original directory, save errno if necessary. */
247 if (!ISSET(FTS_NOCHDIR)) {
248 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
249 (void)_close(sp->fts_rfd);
251 /* Set errno and return. */
252 if (saved_errno != 0) {
253 /* Free up the stream pointer. */
260 /* Free up the stream pointer. */
266 * Special case of "/" at the end of the path so that slashes aren't
267 * appended which would cause paths to be written as "....//foo".
270 (p->fts_path[p->fts_pathlen - 1] == '/' \
271 ? p->fts_pathlen - 1 : p->fts_pathlen)
278 register FTSENT *p, *tmp;
283 /* If finished or unrecoverable error, return NULL. */
284 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
287 /* Set current node pointer. */
290 /* Save and zero out user instructions. */
291 instr = p->fts_instr;
292 p->fts_instr = FTS_NOINSTR;
294 /* Any type of file may be re-visited; re-stat and re-turn. */
295 if (instr == FTS_AGAIN) {
296 p->fts_info = fts_stat(sp, p, 0);
301 * Following a symlink -- SLNONE test allows application to see
302 * SLNONE and recover. If indirecting through a symlink, have
303 * keep a pointer to current location. If unable to get that
304 * pointer, follow fails.
306 if (instr == FTS_FOLLOW &&
307 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
308 p->fts_info = fts_stat(sp, p, 1);
309 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
310 if ((p->fts_symfd = _open(".", O_RDONLY, 0)) < 0) {
311 p->fts_errno = errno;
312 p->fts_info = FTS_ERR;
314 p->fts_flags |= FTS_SYMFOLLOW;
319 /* Directory in pre-order. */
320 if (p->fts_info == FTS_D) {
321 /* If skipped or crossed mount point, do post-order visit. */
322 if (instr == FTS_SKIP ||
323 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
324 if (p->fts_flags & FTS_SYMFOLLOW)
325 (void)_close(p->fts_symfd);
327 fts_lfree(sp->fts_child);
328 sp->fts_child = NULL;
330 p->fts_info = FTS_DP;
334 /* Rebuild if only read the names and now traversing. */
335 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
337 fts_lfree(sp->fts_child);
338 sp->fts_child = NULL;
342 * Cd to the subdirectory.
344 * If have already read and now fail to chdir, whack the list
345 * to make the names come out right, and set the parent errno
346 * so the application will eventually get an error condition.
347 * Set the FTS_DONTCHDIR flag so that when we logically change
348 * directories back to the parent we don't do a chdir.
350 * If haven't read do so. If the read fails, fts_build sets
351 * FTS_STOP or the fts_info field of the node.
353 if (sp->fts_child != NULL) {
354 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
355 p->fts_errno = errno;
356 p->fts_flags |= FTS_DONTCHDIR;
357 for (p = sp->fts_child; p != NULL;
360 p->fts_parent->fts_accpath;
362 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
368 sp->fts_child = NULL;
372 /* Move to the next node on this level. */
374 if ((p = p->fts_link) != NULL) {
378 * If reached the top, return to the original directory (or
379 * the root of the tree), and load the paths for the next root.
381 if (p->fts_level == FTS_ROOTLEVEL) {
382 if (FCHDIR(sp, sp->fts_rfd)) {
387 return (sp->fts_cur = p);
391 * User may have called fts_set on the node. If skipped,
392 * ignore. If followed, get a file descriptor so we can
393 * get back if necessary.
395 if (p->fts_instr == FTS_SKIP)
397 if (p->fts_instr == FTS_FOLLOW) {
398 p->fts_info = fts_stat(sp, p, 1);
399 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
401 _open(".", O_RDONLY, 0)) < 0) {
402 p->fts_errno = errno;
403 p->fts_info = FTS_ERR;
405 p->fts_flags |= FTS_SYMFOLLOW;
407 p->fts_instr = FTS_NOINSTR;
410 name: t = sp->fts_path + NAPPEND(p->fts_parent);
412 memmove(t, p->fts_name, p->fts_namelen + 1);
413 return (sp->fts_cur = p);
416 /* Move up to the parent node. */
420 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
422 * Done; free everything up and set errno to 0 so the user
423 * can distinguish between error and EOF.
427 return (sp->fts_cur = NULL);
430 /* NUL terminate the pathname. */
431 sp->fts_path[p->fts_pathlen] = '\0';
434 * Return to the parent directory. If at a root node or came through
435 * a symlink, go back through the file descriptor. Otherwise, cd up
438 if (p->fts_level == FTS_ROOTLEVEL) {
439 if (FCHDIR(sp, sp->fts_rfd)) {
443 } else if (p->fts_flags & FTS_SYMFOLLOW) {
444 if (FCHDIR(sp, p->fts_symfd)) {
446 (void)_close(p->fts_symfd);
451 (void)_close(p->fts_symfd);
452 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
453 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
457 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
458 return (sp->fts_cur = p);
462 * Fts_set takes the stream as an argument although it's not used in this
463 * implementation; it would be necessary if anyone wanted to add global
464 * semantics to fts using fts_set. An error return is allowed for similar
469 fts_set(sp, p, instr)
474 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
475 instr != FTS_NOINSTR && instr != FTS_SKIP) {
479 p->fts_instr = instr;
484 fts_children(sp, instr)
491 if (instr != 0 && instr != FTS_NAMEONLY) {
496 /* Set current node pointer. */
500 * Errno set to 0 so user can distinguish empty directory from
505 /* Fatal errors stop here. */
509 /* Return logical hierarchy of user's arguments. */
510 if (p->fts_info == FTS_INIT)
511 return (p->fts_link);
514 * If not a directory being visited in pre-order, stop here. Could
515 * allow FTS_DNR, assuming the user has fixed the problem, but the
516 * same effect is available with FTS_AGAIN.
518 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
521 /* Free up any previous child list. */
522 if (sp->fts_child != NULL)
523 fts_lfree(sp->fts_child);
525 if (instr == FTS_NAMEONLY) {
532 * If using chdir on a relative path and called BEFORE fts_read does
533 * its chdir to the root of a traversal, we can lose -- we need to
534 * chdir into the subdirectory, and we don't know where the current
535 * directory is, so we can't get back so that the upcoming chdir by
536 * fts_read will work.
538 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
540 return (sp->fts_child = fts_build(sp, instr));
542 if ((fd = _open(".", O_RDONLY, 0)) < 0)
544 sp->fts_child = fts_build(sp, instr);
548 return (sp->fts_child);
552 * This is the tricky part -- do not casually change *anything* in here. The
553 * idea is to build the linked list of entries that are used by fts_children
554 * and fts_read. There are lots of special cases.
556 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
557 * set and it's a physical walk (so that symbolic links can't be directories),
558 * we can do things quickly. First, if it's a 4.4BSD file system, the type
559 * of the file is in the directory entry. Otherwise, we assume that the number
560 * of subdirectories in a node is equal to the number of links to the parent.
561 * The former skips all stat calls. The latter skips stat calls in any leaf
562 * directories and for any files after the subdirectories in the directory have
563 * been found, cutting the stat calls by about 2/3.
570 register struct dirent *dp;
571 register FTSENT *p, *head;
576 int cderrno, descend, len, level, maxlen, nlinks, oflag, saved_errno,
580 /* Set current node pointer. */
584 * Open the directory for reading. If this fails, we're done.
585 * If being called from fts_read, set the fts_info field.
588 if (ISSET(FTS_WHITEOUT))
589 oflag = DTF_NODUP|DTF_REWIND;
591 oflag = DTF_HIDEW|DTF_NODUP|DTF_REWIND;
593 #define __opendir2(path, flag) opendir(path)
595 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
597 cur->fts_info = FTS_DNR;
598 cur->fts_errno = errno;
604 * Nlinks is the number of possible entries of type directory in the
605 * directory if we're cheating on stat calls, 0 if we're not doing
606 * any stat calls at all, -1 if we're doing stats on everything.
608 if (type == BNAMES) {
610 /* Be quiet about nostat, GCC. */
612 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
613 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
621 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
622 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
623 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
626 * If we're going to need to stat anything or we want to descend
627 * and stay in the directory, chdir. If this fails we keep going,
628 * but set a flag so we don't chdir after the post-order visit.
629 * We won't be able to stat anything, but we can still return the
630 * names themselves. Note, that since fts_read won't be able to
631 * chdir into the directory, it will have to return different path
632 * names than before, i.e. "a/b" instead of "b". Since the node
633 * has already been visited in pre-order, have to wait until the
634 * post-order visit to return the error. There is a special case
635 * here, if there was nothing to stat then it's not an error to
636 * not be able to stat. This is all fairly nasty. If a program
637 * needed sorted entries or stat information, they had better be
638 * checking FTS_NS on the returned nodes.
641 if (nlinks || type == BREAD) {
642 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
643 if (nlinks && type == BREAD)
644 cur->fts_errno = errno;
645 cur->fts_flags |= FTS_DONTCHDIR;
648 (void)closedir(dirp);
656 * Figure out the max file name length that can be stored in the
657 * current path -- the inner loop allocates more path as necessary.
658 * We really wouldn't have to do the maxlen calculations here, we
659 * could do them in fts_read before returning the path, but it's a
660 * lot easier here since the length is part of the dirent structure.
662 * If not changing directories set a pointer so that can just append
663 * each new name into the path.
666 if (ISSET(FTS_NOCHDIR)) {
667 cp = sp->fts_path + len;
670 /* GCC, you're too verbose. */
674 maxlen = sp->fts_pathlen - len;
676 level = cur->fts_level + 1;
678 /* Read the directory, attaching each entry to the `link' pointer. */
680 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
681 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
684 if ((p = fts_alloc(sp, dp->d_name, (int)dp->d_namlen)) == NULL)
686 if (dp->d_namlen >= maxlen) { /* include space for NUL */
687 oldaddr = sp->fts_path;
688 if (fts_palloc(sp, dp->d_namlen + len + 1)) {
690 * No more memory for path or structures. Save
691 * errno, free up the current structure and the
692 * structures already allocated.
694 mem1: saved_errno = errno;
698 (void)closedir(dirp);
699 cur->fts_info = FTS_ERR;
704 /* Did realloc() change the pointer? */
705 if (oldaddr != sp->fts_path) {
707 if (ISSET(FTS_NOCHDIR))
708 cp = sp->fts_path + len;
710 maxlen = sp->fts_pathlen - len;
713 if (len + dp->d_namlen >= USHRT_MAX) {
715 * In an FTSENT, fts_pathlen is a u_short so it is
716 * possible to wraparound here. If we do, free up
717 * the current structure and the structures already
718 * allocated, then error out with ENAMETOOLONG.
722 (void)closedir(dirp);
723 cur->fts_info = FTS_ERR;
725 errno = ENAMETOOLONG;
728 p->fts_level = level;
729 p->fts_parent = sp->fts_cur;
730 p->fts_pathlen = len + dp->d_namlen;
733 if (dp->d_type == DT_WHT)
734 p->fts_flags |= FTS_ISW;
739 p->fts_info = FTS_NS;
740 p->fts_errno = cderrno;
742 p->fts_info = FTS_NSOK;
743 p->fts_accpath = cur->fts_accpath;
744 } else if (nlinks == 0
747 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
751 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
752 p->fts_info = FTS_NSOK;
754 /* Build a file name for fts_stat to stat. */
755 if (ISSET(FTS_NOCHDIR)) {
756 p->fts_accpath = p->fts_path;
757 memmove(cp, p->fts_name, p->fts_namelen + 1);
759 p->fts_accpath = p->fts_name;
761 p->fts_info = fts_stat(sp, p, 0);
763 /* Decrement link count if applicable. */
764 if (nlinks > 0 && (p->fts_info == FTS_D ||
765 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
769 /* We walk in directory order so "ls -f" doesn't get upset. */
780 (void)closedir(dirp);
783 * If realloc() changed the address of the path, adjust the
784 * addresses for the rest of the tree and the dir list.
787 fts_padjust(sp, head);
790 * If not changing directories, reset the path back to original
793 if (ISSET(FTS_NOCHDIR)) {
794 if (len == sp->fts_pathlen || nitems == 0)
800 * If descended after called from fts_children or after called from
801 * fts_read and nothing found, get back. At the root level we use
802 * the saved fd; if one of fts_open()'s arguments is a relative path
803 * to an empty directory, we wind up here with no other way back. If
804 * can't get back, we're done.
806 if (descend && (type == BCHILD || !nitems) &&
807 (cur->fts_level == FTS_ROOTLEVEL ?
808 FCHDIR(sp, sp->fts_rfd) :
809 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
810 cur->fts_info = FTS_ERR;
815 /* If didn't find anything, return NULL. */
818 cur->fts_info = FTS_DP;
822 /* Sort the entries. */
823 if (sp->fts_compar && nitems > 1)
824 head = fts_sort(sp, head, nitems);
829 fts_stat(sp, p, follow)
837 struct stat *sbp, sb;
840 /* If user needs stat info, stat buffer already allocated. */
841 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
844 /* check for whiteout */
845 if (p->fts_flags & FTS_ISW) {
847 memset(sbp, '\0', sizeof (*sbp));
848 sbp->st_mode = S_IFWHT;
855 * If doing a logical walk, or application requested FTS_FOLLOW, do
856 * a stat(2). If that fails, check for a non-existent symlink. If
857 * fail, set the errno from the stat call.
859 if (ISSET(FTS_LOGICAL) || follow) {
860 if (stat(p->fts_accpath, sbp)) {
862 if (!lstat(p->fts_accpath, sbp)) {
866 p->fts_errno = saved_errno;
869 } else if (lstat(p->fts_accpath, sbp)) {
870 p->fts_errno = errno;
871 err: memset(sbp, 0, sizeof(struct stat));
875 if (S_ISDIR(sbp->st_mode)) {
877 * Set the device/inode. Used to find cycles and check for
878 * crossing mount points. Also remember the link count, used
879 * in fts_build to limit the number of stat calls. It is
880 * understood that these fields are only referenced if fts_info
883 dev = p->fts_dev = sbp->st_dev;
884 ino = p->fts_ino = sbp->st_ino;
885 p->fts_nlink = sbp->st_nlink;
887 if (ISDOT(p->fts_name))
891 * Cycle detection is done by brute force when the directory
892 * is first encountered. If the tree gets deep enough or the
893 * number of symbolic links to directories is high enough,
894 * something faster might be worthwhile.
896 for (t = p->fts_parent;
897 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
898 if (ino == t->fts_ino && dev == t->fts_dev) {
904 if (S_ISLNK(sbp->st_mode))
906 if (S_ISREG(sbp->st_mode))
908 return (FTS_DEFAULT);
912 fts_sort(sp, head, nitems)
917 register FTSENT **ap, *p;
920 * Construct an array of pointers to the structures and call qsort(3).
921 * Reassemble the array in the order returned by qsort. If unable to
922 * sort for memory reasons, return the directory entries in their
923 * current order. Allocate enough space for the current needs plus
924 * 40 so don't realloc one entry at a time.
926 if (nitems > sp->fts_nitems) {
927 sp->fts_nitems = nitems + 40;
928 if ((sp->fts_array = reallocf(sp->fts_array,
929 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
934 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
936 qsort((void *)sp->fts_array, nitems, sizeof(FTSENT *), sp->fts_compar);
937 for (head = *(ap = sp->fts_array); --nitems; ++ap)
938 ap[0]->fts_link = ap[1];
939 ap[0]->fts_link = NULL;
944 fts_alloc(sp, name, namelen)
947 register int namelen;
953 * The file name is a variable length array and no stat structure is
954 * necessary if the user has set the nostat bit. Allocate the FTSENT
955 * structure, the file name and the stat structure in one chunk, but
956 * be careful that the stat structure is reasonably aligned. Since the
957 * fts_name field is declared to be of size 1, the fts_name pointer is
958 * namelen + 2 before the first possible address of the stat structure.
960 len = sizeof(FTSENT) + namelen;
961 if (!ISSET(FTS_NOSTAT))
962 len += sizeof(struct stat) + ALIGNBYTES;
963 if ((p = malloc(len)) == NULL)
966 /* Copy the name and guarantee NUL termination. */
967 memmove(p->fts_name, name, namelen);
968 p->fts_name[namelen] = '\0';
970 if (!ISSET(FTS_NOSTAT))
971 p->fts_statp = (struct stat *)ALIGN(p->fts_name + namelen + 2);
972 p->fts_namelen = namelen;
973 p->fts_path = sp->fts_path;
976 p->fts_instr = FTS_NOINSTR;
978 p->fts_pointer = NULL;
984 register FTSENT *head;
988 /* Free a linked list of structures. */
990 head = head->fts_link;
996 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
997 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
998 * though the kernel won't resolve them. Add the size (not just what's needed)
999 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1002 fts_palloc(sp, more)
1007 sp->fts_pathlen += more + 256;
1009 * Check for possible wraparound. In an FTS, fts_pathlen is
1010 * a signed int but in an FTSENT it is an unsigned short.
1011 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1013 if (sp->fts_pathlen < 0 || sp->fts_pathlen >= USHRT_MAX) {
1016 sp->fts_path = NULL;
1017 errno = ENAMETOOLONG;
1020 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1021 return (sp->fts_path == NULL);
1025 * When the path is realloc'd, have to fix all of the pointers in structures
1029 fts_padjust(sp, head)
1034 char *addr = sp->fts_path;
1036 #define ADJUST(p) do { \
1037 if ((p)->fts_accpath != (p)->fts_name) { \
1038 (p)->fts_accpath = \
1039 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1041 (p)->fts_path = addr; \
1043 /* Adjust the current set of children. */
1044 for (p = sp->fts_child; p; p = p->fts_link)
1047 /* Adjust the rest of the tree, including the current level. */
1048 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1050 p = p->fts_link ? p->fts_link : p->fts_parent;
1060 for (max = 0; *argv; ++argv)
1061 if ((len = strlen(*argv)) > max)
1067 * Change to dir specified by fd or p->fts_accpath without getting
1068 * tricked by someone changing the world out from underneath us.
1069 * Assumes p->fts_dev and p->fts_ino are filled in.
1072 fts_safe_changedir(sp, p, fd, path)
1078 int ret, oerrno, newfd;
1082 if (ISSET(FTS_NOCHDIR))
1084 if (fd < 0 && (newfd = _open(path, O_RDONLY, 0)) < 0)
1086 if (fstat(newfd, &sb)) {
1090 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1091 errno = ENOENT; /* disinformation */
1095 ret = fchdir(newfd);
1099 (void)_close(newfd);