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 $
36 * $DragonFly: src/lib/libc/gen/fts.c,v 1.2 2003/06/17 04:26:42 dillon Exp $
38 * @(#)fts.c 8.6 (Berkeley) 8/14/94
39 * $FreeBSD: src/lib/libc/gen/fts.c,v 1.14.2.4 2001/06/01 22:00:34 kris Exp $
42 #include <sys/param.h>
53 static FTSENT *fts_alloc __P((FTS *, char *, int));
54 static FTSENT *fts_build __P((FTS *, int));
55 static void fts_lfree __P((FTSENT *));
56 static void fts_load __P((FTS *, FTSENT *));
57 static size_t fts_maxarglen __P((char * const *));
58 static void fts_padjust __P((FTS *, FTSENT *));
59 static int fts_palloc __P((FTS *, size_t));
60 static FTSENT *fts_sort __P((FTS *, FTSENT *, int));
61 static u_short fts_stat __P((FTS *, FTSENT *, int));
62 static int fts_safe_changedir __P((FTS *, FTSENT *, int, char *));
64 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
66 #define CLR(opt) (sp->fts_options &= ~(opt))
67 #define ISSET(opt) (sp->fts_options & (opt))
68 #define SET(opt) (sp->fts_options |= (opt))
70 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && fchdir(fd))
73 #define BCHILD 1 /* fts_children */
74 #define BNAMES 2 /* fts_children, names only */
75 #define BREAD 3 /* fts_read */
78 fts_open(argv, options, compar)
81 int (*compar) __P((const FTSENT **, const FTSENT **));
84 register FTSENT *p, *root;
90 if (options & ~FTS_OPTIONMASK) {
95 /* Allocate/initialize the stream */
96 if ((sp = malloc((u_int)sizeof(FTS))) == NULL)
98 memset(sp, 0, sizeof(FTS));
99 sp->fts_compar = compar;
100 sp->fts_options = options;
105 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
106 if (ISSET(FTS_LOGICAL))
110 * Start out with 1K of path space, and enough, in any case,
111 * to hold the user's paths.
113 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
116 /* Allocate/initialize root's parent. */
117 if ((parent = fts_alloc(sp, "", 0)) == NULL)
119 parent->fts_level = FTS_ROOTPARENTLEVEL;
121 /* Allocate/initialize root(s). */
122 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
123 /* Don't allow zero-length paths. */
124 if ((len = strlen(*argv)) == 0) {
129 p = fts_alloc(sp, *argv, len);
130 p->fts_level = FTS_ROOTLEVEL;
131 p->fts_parent = parent;
132 p->fts_accpath = p->fts_name;
133 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
135 /* Command-line "." and ".." are real directories. */
136 if (p->fts_info == FTS_DOT)
140 * If comparison routine supplied, traverse in sorted
141 * order; otherwise traverse in the order specified.
156 if (compar && nitems > 1)
157 root = fts_sort(sp, root, nitems);
160 * Allocate a dummy pointer and make fts_read think that we've just
161 * finished the node before the root(s); set p->fts_info to FTS_INIT
162 * so that everything about the "current" node is ignored.
164 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
166 sp->fts_cur->fts_link = root;
167 sp->fts_cur->fts_info = FTS_INIT;
170 * If using chdir(2), grab a file descriptor pointing to dot to ensure
171 * that we can get back here; this could be avoided for some paths,
172 * but almost certainly not worth the effort. Slashes, symbolic links,
173 * and ".." are all fairly nasty problems. Note, if we can't get the
174 * descriptor we run anyway, just more slowly.
176 if (!ISSET(FTS_NOCHDIR) && (sp->fts_rfd = _open(".", O_RDONLY, 0)) < 0)
181 mem3: fts_lfree(root);
183 mem2: free(sp->fts_path);
197 * Load the stream structure for the next traversal. Since we don't
198 * actually enter the directory until after the preorder visit, set
199 * the fts_accpath field specially so the chdir gets done to the right
200 * place and the user can access the first node. From fts_open it's
201 * known that the path will fit.
203 len = p->fts_pathlen = p->fts_namelen;
204 memmove(sp->fts_path, p->fts_name, len + 1);
205 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
207 memmove(p->fts_name, cp, len + 1);
208 p->fts_namelen = len;
210 p->fts_accpath = p->fts_path = sp->fts_path;
211 sp->fts_dev = p->fts_dev;
218 register FTSENT *freep, *p;
222 * This still works if we haven't read anything -- the dummy structure
223 * points to the root list, so we step through to the end of the root
224 * list which has a valid parent pointer.
227 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
229 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
235 /* Free up child linked list, sort array, path buffer. */
237 fts_lfree(sp->fts_child);
242 /* Return to original directory, save errno if necessary. */
243 if (!ISSET(FTS_NOCHDIR)) {
244 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
245 (void)_close(sp->fts_rfd);
247 /* Set errno and return. */
248 if (saved_errno != 0) {
249 /* Free up the stream pointer. */
256 /* Free up the stream pointer. */
262 * Special case of "/" at the end of the path so that slashes aren't
263 * appended which would cause paths to be written as "....//foo".
266 (p->fts_path[p->fts_pathlen - 1] == '/' \
267 ? p->fts_pathlen - 1 : p->fts_pathlen)
274 register FTSENT *p, *tmp;
279 /* If finished or unrecoverable error, return NULL. */
280 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
283 /* Set current node pointer. */
286 /* Save and zero out user instructions. */
287 instr = p->fts_instr;
288 p->fts_instr = FTS_NOINSTR;
290 /* Any type of file may be re-visited; re-stat and re-turn. */
291 if (instr == FTS_AGAIN) {
292 p->fts_info = fts_stat(sp, p, 0);
297 * Following a symlink -- SLNONE test allows application to see
298 * SLNONE and recover. If indirecting through a symlink, have
299 * keep a pointer to current location. If unable to get that
300 * pointer, follow fails.
302 if (instr == FTS_FOLLOW &&
303 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
304 p->fts_info = fts_stat(sp, p, 1);
305 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
306 if ((p->fts_symfd = _open(".", O_RDONLY, 0)) < 0) {
307 p->fts_errno = errno;
308 p->fts_info = FTS_ERR;
310 p->fts_flags |= FTS_SYMFOLLOW;
315 /* Directory in pre-order. */
316 if (p->fts_info == FTS_D) {
317 /* If skipped or crossed mount point, do post-order visit. */
318 if (instr == FTS_SKIP ||
319 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
320 if (p->fts_flags & FTS_SYMFOLLOW)
321 (void)_close(p->fts_symfd);
323 fts_lfree(sp->fts_child);
324 sp->fts_child = NULL;
326 p->fts_info = FTS_DP;
330 /* Rebuild if only read the names and now traversing. */
331 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
333 fts_lfree(sp->fts_child);
334 sp->fts_child = NULL;
338 * Cd to the subdirectory.
340 * If have already read and now fail to chdir, whack the list
341 * to make the names come out right, and set the parent errno
342 * so the application will eventually get an error condition.
343 * Set the FTS_DONTCHDIR flag so that when we logically change
344 * directories back to the parent we don't do a chdir.
346 * If haven't read do so. If the read fails, fts_build sets
347 * FTS_STOP or the fts_info field of the node.
349 if (sp->fts_child != NULL) {
350 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
351 p->fts_errno = errno;
352 p->fts_flags |= FTS_DONTCHDIR;
353 for (p = sp->fts_child; p != NULL;
356 p->fts_parent->fts_accpath;
358 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
364 sp->fts_child = NULL;
368 /* Move to the next node on this level. */
370 if ((p = p->fts_link) != NULL) {
374 * If reached the top, return to the original directory (or
375 * the root of the tree), and load the paths for the next root.
377 if (p->fts_level == FTS_ROOTLEVEL) {
378 if (FCHDIR(sp, sp->fts_rfd)) {
383 return (sp->fts_cur = p);
387 * User may have called fts_set on the node. If skipped,
388 * ignore. If followed, get a file descriptor so we can
389 * get back if necessary.
391 if (p->fts_instr == FTS_SKIP)
393 if (p->fts_instr == FTS_FOLLOW) {
394 p->fts_info = fts_stat(sp, p, 1);
395 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
397 _open(".", O_RDONLY, 0)) < 0) {
398 p->fts_errno = errno;
399 p->fts_info = FTS_ERR;
401 p->fts_flags |= FTS_SYMFOLLOW;
403 p->fts_instr = FTS_NOINSTR;
406 name: t = sp->fts_path + NAPPEND(p->fts_parent);
408 memmove(t, p->fts_name, p->fts_namelen + 1);
409 return (sp->fts_cur = p);
412 /* Move up to the parent node. */
416 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
418 * Done; free everything up and set errno to 0 so the user
419 * can distinguish between error and EOF.
423 return (sp->fts_cur = NULL);
426 /* NUL terminate the pathname. */
427 sp->fts_path[p->fts_pathlen] = '\0';
430 * Return to the parent directory. If at a root node or came through
431 * a symlink, go back through the file descriptor. Otherwise, cd up
434 if (p->fts_level == FTS_ROOTLEVEL) {
435 if (FCHDIR(sp, sp->fts_rfd)) {
439 } else if (p->fts_flags & FTS_SYMFOLLOW) {
440 if (FCHDIR(sp, p->fts_symfd)) {
442 (void)_close(p->fts_symfd);
447 (void)_close(p->fts_symfd);
448 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
449 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
453 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
454 return (sp->fts_cur = p);
458 * Fts_set takes the stream as an argument although it's not used in this
459 * implementation; it would be necessary if anyone wanted to add global
460 * semantics to fts using fts_set. An error return is allowed for similar
465 fts_set(sp, p, instr)
470 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
471 instr != FTS_NOINSTR && instr != FTS_SKIP) {
475 p->fts_instr = instr;
480 fts_children(sp, instr)
487 if (instr != 0 && instr != FTS_NAMEONLY) {
492 /* Set current node pointer. */
496 * Errno set to 0 so user can distinguish empty directory from
501 /* Fatal errors stop here. */
505 /* Return logical hierarchy of user's arguments. */
506 if (p->fts_info == FTS_INIT)
507 return (p->fts_link);
510 * If not a directory being visited in pre-order, stop here. Could
511 * allow FTS_DNR, assuming the user has fixed the problem, but the
512 * same effect is available with FTS_AGAIN.
514 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
517 /* Free up any previous child list. */
518 if (sp->fts_child != NULL)
519 fts_lfree(sp->fts_child);
521 if (instr == FTS_NAMEONLY) {
528 * If using chdir on a relative path and called BEFORE fts_read does
529 * its chdir to the root of a traversal, we can lose -- we need to
530 * chdir into the subdirectory, and we don't know where the current
531 * directory is, so we can't get back so that the upcoming chdir by
532 * fts_read will work.
534 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
536 return (sp->fts_child = fts_build(sp, instr));
538 if ((fd = _open(".", O_RDONLY, 0)) < 0)
540 sp->fts_child = fts_build(sp, instr);
544 return (sp->fts_child);
548 * This is the tricky part -- do not casually change *anything* in here. The
549 * idea is to build the linked list of entries that are used by fts_children
550 * and fts_read. There are lots of special cases.
552 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
553 * set and it's a physical walk (so that symbolic links can't be directories),
554 * we can do things quickly. First, if it's a 4.4BSD file system, the type
555 * of the file is in the directory entry. Otherwise, we assume that the number
556 * of subdirectories in a node is equal to the number of links to the parent.
557 * The former skips all stat calls. The latter skips stat calls in any leaf
558 * directories and for any files after the subdirectories in the directory have
559 * been found, cutting the stat calls by about 2/3.
566 register struct dirent *dp;
567 register FTSENT *p, *head;
572 int cderrno, descend, len, level, maxlen, nlinks, oflag, saved_errno,
576 /* Set current node pointer. */
580 * Open the directory for reading. If this fails, we're done.
581 * If being called from fts_read, set the fts_info field.
584 if (ISSET(FTS_WHITEOUT))
585 oflag = DTF_NODUP|DTF_REWIND;
587 oflag = DTF_HIDEW|DTF_NODUP|DTF_REWIND;
589 #define __opendir2(path, flag) opendir(path)
591 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
593 cur->fts_info = FTS_DNR;
594 cur->fts_errno = errno;
600 * Nlinks is the number of possible entries of type directory in the
601 * directory if we're cheating on stat calls, 0 if we're not doing
602 * any stat calls at all, -1 if we're doing stats on everything.
604 if (type == BNAMES) {
606 /* Be quiet about nostat, GCC. */
608 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
609 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
617 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
618 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
619 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
622 * If we're going to need to stat anything or we want to descend
623 * and stay in the directory, chdir. If this fails we keep going,
624 * but set a flag so we don't chdir after the post-order visit.
625 * We won't be able to stat anything, but we can still return the
626 * names themselves. Note, that since fts_read won't be able to
627 * chdir into the directory, it will have to return different path
628 * names than before, i.e. "a/b" instead of "b". Since the node
629 * has already been visited in pre-order, have to wait until the
630 * post-order visit to return the error. There is a special case
631 * here, if there was nothing to stat then it's not an error to
632 * not be able to stat. This is all fairly nasty. If a program
633 * needed sorted entries or stat information, they had better be
634 * checking FTS_NS on the returned nodes.
637 if (nlinks || type == BREAD) {
638 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
639 if (nlinks && type == BREAD)
640 cur->fts_errno = errno;
641 cur->fts_flags |= FTS_DONTCHDIR;
644 (void)closedir(dirp);
652 * Figure out the max file name length that can be stored in the
653 * current path -- the inner loop allocates more path as necessary.
654 * We really wouldn't have to do the maxlen calculations here, we
655 * could do them in fts_read before returning the path, but it's a
656 * lot easier here since the length is part of the dirent structure.
658 * If not changing directories set a pointer so that can just append
659 * each new name into the path.
662 if (ISSET(FTS_NOCHDIR)) {
663 cp = sp->fts_path + len;
666 /* GCC, you're too verbose. */
670 maxlen = sp->fts_pathlen - len;
672 level = cur->fts_level + 1;
674 /* Read the directory, attaching each entry to the `link' pointer. */
676 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
677 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
680 if ((p = fts_alloc(sp, dp->d_name, (int)dp->d_namlen)) == NULL)
682 if (dp->d_namlen >= maxlen) { /* include space for NUL */
683 oldaddr = sp->fts_path;
684 if (fts_palloc(sp, dp->d_namlen + len + 1)) {
686 * No more memory for path or structures. Save
687 * errno, free up the current structure and the
688 * structures already allocated.
690 mem1: saved_errno = errno;
694 (void)closedir(dirp);
695 cur->fts_info = FTS_ERR;
700 /* Did realloc() change the pointer? */
701 if (oldaddr != sp->fts_path) {
703 if (ISSET(FTS_NOCHDIR))
704 cp = sp->fts_path + len;
706 maxlen = sp->fts_pathlen - len;
709 if (len + dp->d_namlen >= USHRT_MAX) {
711 * In an FTSENT, fts_pathlen is a u_short so it is
712 * possible to wraparound here. If we do, free up
713 * the current structure and the structures already
714 * allocated, then error out with ENAMETOOLONG.
718 (void)closedir(dirp);
719 cur->fts_info = FTS_ERR;
721 errno = ENAMETOOLONG;
724 p->fts_level = level;
725 p->fts_parent = sp->fts_cur;
726 p->fts_pathlen = len + dp->d_namlen;
729 if (dp->d_type == DT_WHT)
730 p->fts_flags |= FTS_ISW;
735 p->fts_info = FTS_NS;
736 p->fts_errno = cderrno;
738 p->fts_info = FTS_NSOK;
739 p->fts_accpath = cur->fts_accpath;
740 } else if (nlinks == 0
743 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
747 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
748 p->fts_info = FTS_NSOK;
750 /* Build a file name for fts_stat to stat. */
751 if (ISSET(FTS_NOCHDIR)) {
752 p->fts_accpath = p->fts_path;
753 memmove(cp, p->fts_name, p->fts_namelen + 1);
755 p->fts_accpath = p->fts_name;
757 p->fts_info = fts_stat(sp, p, 0);
759 /* Decrement link count if applicable. */
760 if (nlinks > 0 && (p->fts_info == FTS_D ||
761 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
765 /* We walk in directory order so "ls -f" doesn't get upset. */
776 (void)closedir(dirp);
779 * If realloc() changed the address of the path, adjust the
780 * addresses for the rest of the tree and the dir list.
783 fts_padjust(sp, head);
786 * If not changing directories, reset the path back to original
789 if (ISSET(FTS_NOCHDIR)) {
790 if (len == sp->fts_pathlen || nitems == 0)
796 * If descended after called from fts_children or after called from
797 * fts_read and nothing found, get back. At the root level we use
798 * the saved fd; if one of fts_open()'s arguments is a relative path
799 * to an empty directory, we wind up here with no other way back. If
800 * can't get back, we're done.
802 if (descend && (type == BCHILD || !nitems) &&
803 (cur->fts_level == FTS_ROOTLEVEL ?
804 FCHDIR(sp, sp->fts_rfd) :
805 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
806 cur->fts_info = FTS_ERR;
811 /* If didn't find anything, return NULL. */
814 cur->fts_info = FTS_DP;
818 /* Sort the entries. */
819 if (sp->fts_compar && nitems > 1)
820 head = fts_sort(sp, head, nitems);
825 fts_stat(sp, p, follow)
833 struct stat *sbp, sb;
836 /* If user needs stat info, stat buffer already allocated. */
837 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
840 /* check for whiteout */
841 if (p->fts_flags & FTS_ISW) {
843 memset(sbp, '\0', sizeof (*sbp));
844 sbp->st_mode = S_IFWHT;
851 * If doing a logical walk, or application requested FTS_FOLLOW, do
852 * a stat(2). If that fails, check for a non-existent symlink. If
853 * fail, set the errno from the stat call.
855 if (ISSET(FTS_LOGICAL) || follow) {
856 if (stat(p->fts_accpath, sbp)) {
858 if (!lstat(p->fts_accpath, sbp)) {
862 p->fts_errno = saved_errno;
865 } else if (lstat(p->fts_accpath, sbp)) {
866 p->fts_errno = errno;
867 err: memset(sbp, 0, sizeof(struct stat));
871 if (S_ISDIR(sbp->st_mode)) {
873 * Set the device/inode. Used to find cycles and check for
874 * crossing mount points. Also remember the link count, used
875 * in fts_build to limit the number of stat calls. It is
876 * understood that these fields are only referenced if fts_info
879 dev = p->fts_dev = sbp->st_dev;
880 ino = p->fts_ino = sbp->st_ino;
881 p->fts_nlink = sbp->st_nlink;
883 if (ISDOT(p->fts_name))
887 * Cycle detection is done by brute force when the directory
888 * is first encountered. If the tree gets deep enough or the
889 * number of symbolic links to directories is high enough,
890 * something faster might be worthwhile.
892 for (t = p->fts_parent;
893 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
894 if (ino == t->fts_ino && dev == t->fts_dev) {
900 if (S_ISLNK(sbp->st_mode))
902 if (S_ISREG(sbp->st_mode))
904 return (FTS_DEFAULT);
908 fts_sort(sp, head, nitems)
913 register FTSENT **ap, *p;
916 * Construct an array of pointers to the structures and call qsort(3).
917 * Reassemble the array in the order returned by qsort. If unable to
918 * sort for memory reasons, return the directory entries in their
919 * current order. Allocate enough space for the current needs plus
920 * 40 so don't realloc one entry at a time.
922 if (nitems > sp->fts_nitems) {
923 sp->fts_nitems = nitems + 40;
924 if ((sp->fts_array = reallocf(sp->fts_array,
925 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
930 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
932 qsort((void *)sp->fts_array, nitems, sizeof(FTSENT *), sp->fts_compar);
933 for (head = *(ap = sp->fts_array); --nitems; ++ap)
934 ap[0]->fts_link = ap[1];
935 ap[0]->fts_link = NULL;
940 fts_alloc(sp, name, namelen)
943 register int namelen;
949 * The file name is a variable length array and no stat structure is
950 * necessary if the user has set the nostat bit. Allocate the FTSENT
951 * structure, the file name and the stat structure in one chunk, but
952 * be careful that the stat structure is reasonably aligned. Since the
953 * fts_name field is declared to be of size 1, the fts_name pointer is
954 * namelen + 2 before the first possible address of the stat structure.
956 len = sizeof(FTSENT) + namelen;
957 if (!ISSET(FTS_NOSTAT))
958 len += sizeof(struct stat) + ALIGNBYTES;
959 if ((p = malloc(len)) == NULL)
962 /* Copy the name and guarantee NUL termination. */
963 memmove(p->fts_name, name, namelen);
964 p->fts_name[namelen] = '\0';
966 if (!ISSET(FTS_NOSTAT))
967 p->fts_statp = (struct stat *)ALIGN(p->fts_name + namelen + 2);
968 p->fts_namelen = namelen;
969 p->fts_path = sp->fts_path;
972 p->fts_instr = FTS_NOINSTR;
974 p->fts_pointer = NULL;
980 register FTSENT *head;
984 /* Free a linked list of structures. */
986 head = head->fts_link;
992 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
993 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
994 * though the kernel won't resolve them. Add the size (not just what's needed)
995 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1003 sp->fts_pathlen += more + 256;
1005 * Check for possible wraparound. In an FTS, fts_pathlen is
1006 * a signed int but in an FTSENT it is an unsigned short.
1007 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1009 if (sp->fts_pathlen < 0 || sp->fts_pathlen >= USHRT_MAX) {
1012 sp->fts_path = NULL;
1013 errno = ENAMETOOLONG;
1016 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1017 return (sp->fts_path == NULL);
1021 * When the path is realloc'd, have to fix all of the pointers in structures
1025 fts_padjust(sp, head)
1030 char *addr = sp->fts_path;
1032 #define ADJUST(p) do { \
1033 if ((p)->fts_accpath != (p)->fts_name) { \
1034 (p)->fts_accpath = \
1035 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1037 (p)->fts_path = addr; \
1039 /* Adjust the current set of children. */
1040 for (p = sp->fts_child; p; p = p->fts_link)
1043 /* Adjust the rest of the tree, including the current level. */
1044 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1046 p = p->fts_link ? p->fts_link : p->fts_parent;
1056 for (max = 0; *argv; ++argv)
1057 if ((len = strlen(*argv)) > max)
1063 * Change to dir specified by fd or p->fts_accpath without getting
1064 * tricked by someone changing the world out from underneath us.
1065 * Assumes p->fts_dev and p->fts_ino are filled in.
1068 fts_safe_changedir(sp, p, fd, path)
1074 int ret, oerrno, newfd;
1078 if (ISSET(FTS_NOCHDIR))
1080 if (fd < 0 && (newfd = _open(path, O_RDONLY, 0)) < 0)
1082 if (fstat(newfd, &sb)) {
1086 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1087 errno = ENOENT; /* disinformation */
1091 ret = fchdir(newfd);
1095 (void)_close(newfd);