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
*));
60 static size_t fts_maxarglen
__P((char * const *)) internal_function
;
61 static void fts_padjust
__P((FTS
*, void *)) 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
*, struct dirent
*, FTSENT
*, int))
68 #define MAX(a, b) ({ __typeof__ (a) _a = (a); \
69 __typeof__ (b) _b = (b); \
73 #define ISDOT(a) (a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))
75 #define ISSET(opt) (sp->fts_options & opt)
76 #define SET(opt) (sp->fts_options |= opt)
78 #define CHDIR(sp, path) (!ISSET(FTS_NOCHDIR) && __chdir(path))
79 #define FCHDIR(sp, fd) (!ISSET(FTS_NOCHDIR) && __fchdir(fd))
82 #define BCHILD 1 /* fts_children */
83 #define BNAMES 2 /* fts_children, names only */
84 #define BREAD 3 /* fts_read */
87 fts_open(argv
, options
, compar
)
90 int (*compar
) __P((const FTSENT
**, const FTSENT
**));
93 register FTSENT
*p
, *root
;
99 if (options
& ~FTS_OPTIONMASK
) {
100 __set_errno (EINVAL
);
104 /* Allocate/initialize the stream */
105 if ((sp
= malloc((u_int
)sizeof(FTS
))) == NULL
)
107 __bzero(sp
, sizeof(FTS
));
108 sp
->fts_compar
= (int (*) __P((const void *, const void *))) compar
;
109 sp
->fts_options
= options
;
111 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
112 if (ISSET(FTS_LOGICAL
))
116 * Start out with 1K of path space, and enough, in any case,
117 * to hold the user's paths.
120 #define MAXPATHLEN 1024
122 if (fts_palloc(sp
, MAX(fts_maxarglen(argv
), MAXPATHLEN
)))
125 /* Allocate/initialize root's parent. */
126 if ((parent
= fts_alloc(sp
, "", 0)) == NULL
)
128 parent
->fts_level
= FTS_ROOTPARENTLEVEL
;
130 /* Allocate/initialize root(s). */
131 for (root
= NULL
, nitems
= 0; *argv
; ++argv
, ++nitems
) {
132 /* Don't allow zero-length paths. */
133 if ((len
= strlen(*argv
)) == 0) {
134 __set_errno (ENOENT
);
138 p
= fts_alloc(sp
, *argv
, len
);
139 p
->fts_level
= FTS_ROOTLEVEL
;
140 p
->fts_parent
= parent
;
141 p
->fts_accpath
= p
->fts_name
;
142 p
->fts_info
= fts_stat(sp
, NULL
, p
, ISSET(FTS_COMFOLLOW
));
144 /* Command-line "." and ".." are real directories. */
145 if (p
->fts_info
== FTS_DOT
)
149 * If comparison routine supplied, traverse in sorted
150 * order; otherwise traverse in the order specified.
165 if (compar
&& nitems
> 1)
166 root
= fts_sort(sp
, root
, nitems
);
169 * Allocate a dummy pointer and make fts_read think that we've just
170 * finished the node before the root(s); set p->fts_info to FTS_INIT
171 * so that everything about the "current" node is ignored.
173 if ((sp
->fts_cur
= fts_alloc(sp
, "", 0)) == NULL
)
175 sp
->fts_cur
->fts_link
= root
;
176 sp
->fts_cur
->fts_info
= FTS_INIT
;
179 * If using chdir(2), grab a file descriptor pointing to dot to insure
180 * that we can get back here; this could be avoided for some paths,
181 * but almost certainly not worth the effort. Slashes, symbolic links,
182 * and ".." are all fairly nasty problems. Note, if we can't get the
183 * descriptor we run anyway, just more slowly.
185 if (!ISSET(FTS_NOCHDIR
)
186 && (sp
->fts_rfd
= __open(".", O_RDONLY
, 0)) < 0)
191 mem3
: fts_lfree(root
);
193 mem2
: free(sp
->fts_path
);
207 * Load the stream structure for the next traversal. Since we don't
208 * actually enter the directory until after the preorder visit, set
209 * the fts_accpath field specially so the chdir gets done to the right
210 * place and the user can access the first node. From fts_open it's
211 * known that the path will fit.
213 len
= p
->fts_pathlen
= p
->fts_namelen
;
214 bcopy(p
->fts_name
, sp
->fts_path
, len
+ 1);
215 if ((cp
= rindex(p
->fts_name
, '/')) && (cp
!= p
->fts_name
|| cp
[1])) {
217 bcopy(cp
, p
->fts_name
, len
+ 1);
218 p
->fts_namelen
= len
;
220 p
->fts_accpath
= p
->fts_path
= sp
->fts_path
;
221 sp
->fts_dev
= p
->fts_dev
;
228 register FTSENT
*freep
, *p
;
233 * This still works if we haven't read anything -- the dummy structure
234 * points to the root list, so we step through to the end of the root
235 * list which has a valid parent pointer.
238 for (p
= sp
->fts_cur
; p
->fts_level
>= FTS_ROOTLEVEL
;) {
240 p
= p
->fts_link
? p
->fts_link
: p
->fts_parent
;
246 /* Free up child linked list, sort array, path buffer. */
248 fts_lfree(sp
->fts_child
);
253 /* Return to original directory, save errno if necessary. */
254 if (!ISSET(FTS_NOCHDIR
)) {
255 saved_errno
= __fchdir(sp
->fts_rfd
) ? errno
: 0;
256 (void)__close(sp
->fts_rfd
);
259 /* Set errno and return. */
260 if (!ISSET(FTS_NOCHDIR
) && saved_errno
) {
261 __set_errno (saved_errno
);
265 /* Free up the stream pointer. */
272 * Special case a root of "/" so that slashes aren't appended which would
273 * cause paths to be written as "//foo".
276 (p->fts_level == FTS_ROOTLEVEL && p->fts_pathlen == 1 && \
277 p->fts_path[0] == '/' ? 0 : p->fts_pathlen)
283 register FTSENT
*p
, *tmp
;
288 /* If finished or unrecoverable error, return NULL. */
289 if (sp
->fts_cur
== NULL
|| ISSET(FTS_STOP
))
292 /* Set current node pointer. */
295 /* Save and zero out user instructions. */
296 instr
= p
->fts_instr
;
297 p
->fts_instr
= FTS_NOINSTR
;
299 /* Any type of file may be re-visited; re-stat and re-turn. */
300 if (instr
== FTS_AGAIN
) {
301 p
->fts_info
= fts_stat(sp
, NULL
, p
, 0);
306 * Following a symlink -- SLNONE test allows application to see
307 * SLNONE and recover. If indirecting through a symlink, have
308 * keep a pointer to current location. If unable to get that
309 * pointer, follow fails.
311 if (instr
== FTS_FOLLOW
&&
312 (p
->fts_info
== FTS_SL
|| p
->fts_info
== FTS_SLNONE
)) {
313 p
->fts_info
= fts_stat(sp
, NULL
, p
, 1);
314 if (p
->fts_info
== FTS_D
&& !ISSET(FTS_NOCHDIR
)) {
315 if ((p
->fts_symfd
= __open(".", O_RDONLY
, 0)) < 0) {
316 p
->fts_errno
= errno
;
317 p
->fts_info
= FTS_ERR
;
319 p
->fts_flags
|= FTS_SYMFOLLOW
;
324 /* Directory in pre-order. */
325 if (p
->fts_info
== FTS_D
) {
326 /* If skipped or crossed mount point, do post-order visit. */
327 if (instr
== FTS_SKIP
||
328 (ISSET(FTS_XDEV
) && p
->fts_dev
!= sp
->fts_dev
)) {
329 if (p
->fts_flags
& FTS_SYMFOLLOW
)
330 (void)__close(p
->fts_symfd
);
332 fts_lfree(sp
->fts_child
);
333 sp
->fts_child
= NULL
;
335 p
->fts_info
= FTS_DP
;
339 /* Rebuild if only read the names and now traversing. */
340 if (sp
->fts_child
&& sp
->fts_options
& FTS_NAMEONLY
) {
341 sp
->fts_options
&= ~FTS_NAMEONLY
;
342 fts_lfree(sp
->fts_child
);
343 sp
->fts_child
= NULL
;
347 * Cd to the subdirectory.
349 * If have already read and now fail to chdir, whack the list
350 * to make the names come out right, and set the parent errno
351 * so the application will eventually get an error condition.
352 * Set the FTS_DONTCHDIR flag so that when we logically change
353 * directories back to the parent we don't do a chdir.
355 * If haven't read do so. If the read fails, fts_build sets
356 * FTS_STOP or the fts_info field of the node.
359 if (CHDIR(sp
, p
->fts_accpath
)) {
360 p
->fts_errno
= errno
;
361 p
->fts_flags
|= FTS_DONTCHDIR
;
362 for (p
= sp
->fts_child
; p
; p
= p
->fts_link
)
364 p
->fts_parent
->fts_accpath
;
366 } else if ((sp
->fts_child
= fts_build(sp
, BREAD
)) == NULL
) {
372 sp
->fts_child
= NULL
;
376 /* Move to the next node on this level. */
378 if ((p
= p
->fts_link
)) {
382 * If reached the top, return to the original directory, and
383 * load the paths for the next root.
385 if (p
->fts_level
== FTS_ROOTLEVEL
) {
386 if (!ISSET(FTS_NOCHDIR
) && FCHDIR(sp
, sp
->fts_rfd
)) {
391 return (sp
->fts_cur
= p
);
395 * User may have called fts_set on the node. If skipped,
396 * ignore. If followed, get a file descriptor so we can
397 * get back if necessary.
399 if (p
->fts_instr
== FTS_SKIP
)
401 if (p
->fts_instr
== FTS_FOLLOW
) {
402 p
->fts_info
= fts_stat(sp
, NULL
, p
, 1);
403 if (p
->fts_info
== FTS_D
&& !ISSET(FTS_NOCHDIR
)) {
405 __open(".", O_RDONLY
, 0)) < 0) {
406 p
->fts_errno
= errno
;
407 p
->fts_info
= FTS_ERR
;
409 p
->fts_flags
|= FTS_SYMFOLLOW
;
411 p
->fts_instr
= FTS_NOINSTR
;
414 name
: t
= sp
->fts_path
+ NAPPEND(p
->fts_parent
);
416 bcopy(p
->fts_name
, t
, p
->fts_namelen
+ 1);
417 return (sp
->fts_cur
= p
);
420 /* Move up to the parent node. */
424 if (p
->fts_level
== FTS_ROOTPARENTLEVEL
) {
426 * Done; free everything up and set errno to 0 so the user
427 * can distinguish between error and EOF.
431 return (sp
->fts_cur
= NULL
);
434 /* Nul terminate the pathname. */
435 sp
->fts_path
[p
->fts_pathlen
] = '\0';
438 * Return to the parent directory. If at a root node or came through
439 * a symlink, go back through the file descriptor. Otherwise, cd up
442 if (p
->fts_level
== FTS_ROOTLEVEL
) {
443 if (!ISSET(FTS_NOCHDIR
) && FCHDIR(sp
, sp
->fts_rfd
)) {
447 } else if (p
->fts_flags
& FTS_SYMFOLLOW
) {
448 if (FCHDIR(sp
, p
->fts_symfd
)) {
450 (void)__close(p
->fts_symfd
);
451 __set_errno (saved_errno
);
455 (void)__close(p
->fts_symfd
);
456 } else if (!(p
->fts_flags
& FTS_DONTCHDIR
)) {
457 if (CHDIR(sp
, "..")) {
462 p
->fts_info
= p
->fts_errno
? FTS_ERR
: FTS_DP
;
463 return (sp
->fts_cur
= p
);
467 * Fts_set takes the stream as an argument although it's not used in this
468 * implementation; it would be necessary if anyone wanted to add global
469 * semantics to fts using fts_set. An error return is allowed for similar
474 fts_set(sp
, p
, instr
)
479 if (instr
&& instr
!= FTS_AGAIN
&& instr
!= FTS_FOLLOW
&&
480 instr
!= FTS_NOINSTR
&& instr
!= FTS_SKIP
) {
481 __set_errno (EINVAL
);
484 p
->fts_instr
= instr
;
489 fts_children(sp
, instr
)
496 if (instr
&& 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. */
528 fts_lfree(sp
->fts_child
);
530 if (instr
== FTS_NAMEONLY
) {
531 sp
->fts_options
|= 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.
577 register FTSENT
*p
, *head
;
582 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.
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.
618 else if (ISSET(FTS_NOSTAT
) && ISSET(FTS_PHYSICAL
))
619 nlinks
= cur
->fts_nlink
- (ISSET(FTS_SEEDOT
) ? 0 : 2);
624 (void)printf("nlinks == %d (cur: %d)\n", nlinks
, cur
->fts_nlink
);
625 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
626 ISSET(FTS_NOSTAT
), ISSET(FTS_PHYSICAL
), ISSET(FTS_SEEDOT
));
629 * If we're going to need to stat anything or we want to descend
630 * and stay in the directory, chdir. If this fails we keep going,
631 * but set a flag so we don't chdir after the post-order visit.
632 * We won't be able to stat anything, but we can still return the
633 * names themselves. Note, that since fts_read won't be able to
634 * chdir into the directory, it will have to return different path
635 * names than before, i.e. "a/b" instead of "b". Since the node
636 * has already been visited in pre-order, have to wait until the
637 * post-order visit to return the error. There is a special case
638 * here, if there was nothing to stat then it's not an error to
639 * not be able to stat. This is all fairly nasty. If a program
640 * needed sorted entries or stat information, they had better be
641 * checking FTS_NS on the returned nodes.
644 if (nlinks
|| type
== BREAD
) {
645 if (FCHDIR(sp
, dirfd(dirp
))) {
646 if (nlinks
&& type
== BREAD
)
647 cur
->fts_errno
= errno
;
648 cur
->fts_flags
|= FTS_DONTCHDIR
;
657 * Figure out the max file name length that can be stored in the
658 * current path -- the inner loop allocates more path as necessary.
659 * We really wouldn't have to do the maxlen calculations here, we
660 * could do them in fts_read before returning the path, but it's a
661 * lot easier here since the length is part of the dirent structure.
663 * If not changing directories set a pointer so that can just append
664 * each new name into the path.
666 maxlen
= sp
->fts_pathlen
- cur
->fts_pathlen
- 1;
668 if (ISSET(FTS_NOCHDIR
)) {
669 cp
= sp
->fts_path
+ len
;
673 level
= cur
->fts_level
+ 1;
675 /* Read the directory, attaching each entry to the `link' pointer. */
679 while((dp
= __readdir(dirp
))) {
682 if (!ISSET(FTS_SEEDOT
) && ISDOT(dp
->d_name
))
685 namlen
= _D_EXACT_NAMLEN (dp
);
686 if ((p
= fts_alloc(sp
, dp
->d_name
, namlen
)) == NULL
)
688 if (namlen
> maxlen
) {
689 if (fts_palloc(sp
, (size_t)namlen
)) {
691 * No more memory for path or structures. Save
692 * errno, free up the current structure and the
693 * structures already allocated.
695 mem1
: saved_errno
= errno
;
699 (void)__closedir(dirp
);
700 __set_errno (saved_errno
);
701 cur
->fts_info
= FTS_ERR
;
705 adjaddr
= sp
->fts_path
;
706 maxlen
= sp
->fts_pathlen
- sp
->fts_cur
->fts_pathlen
- 1;
709 p
->fts_pathlen
= len
+ namlen
+ 1;
710 p
->fts_parent
= sp
->fts_cur
;
711 p
->fts_level
= level
;
715 p
->fts_info
= FTS_NS
;
716 p
->fts_errno
= cderrno
;
718 p
->fts_info
= FTS_NSOK
;
719 p
->fts_accpath
= cur
->fts_accpath
;
720 } else if (nlinks
== 0
721 #if defined DT_DIR && defined _DIRENT_HAVE_D_TYPE
723 dp
->d_type
!= DT_DIR
&& dp
->d_type
!= DT_UNKNOWN
)
727 ISSET(FTS_NOCHDIR
) ? p
->fts_path
: p
->fts_name
;
728 p
->fts_info
= FTS_NSOK
;
730 /* Build a file name for fts_stat to stat. */
731 if (ISSET(FTS_NOCHDIR
)) {
732 p
->fts_accpath
= p
->fts_path
;
733 bcopy(p
->fts_name
, cp
, p
->fts_namelen
+ 1);
735 p
->fts_accpath
= p
->fts_name
;
737 p
->fts_info
= fts_stat(sp
, dp
, p
, 0);
739 /* Decrement link count if applicable. */
740 if (nlinks
> 0 && (p
->fts_info
== FTS_D
||
741 p
->fts_info
== FTS_DC
|| p
->fts_info
== FTS_DOT
))
745 /* We walk in directory order so "ls -f" doesn't get upset. */
755 (void)__closedir(dirp
);
758 * If had to realloc the path, adjust the addresses for the rest
762 fts_padjust(sp
, adjaddr
);
765 * If not changing directories, reset the path back to original
768 if (ISSET(FTS_NOCHDIR
)) {
769 if (cp
- 1 > sp
->fts_path
)
775 * If descended after called from fts_children or after called from
776 * fts_read and nothing found, get back. At the root level we use
777 * the saved fd; if one of fts_open()'s arguments is a relative path
778 * to an empty directory, we wind up here with no other way back. If
779 * can't get back, we're done.
781 if (descend
&& (type
== BCHILD
|| !nitems
) &&
782 (cur
->fts_level
== FTS_ROOTLEVEL
?
783 FCHDIR (sp
, sp
->fts_rfd
) : CHDIR (sp
, ".."))) {
784 cur
->fts_info
= FTS_ERR
;
789 /* If didn't find anything, return NULL. */
792 cur
->fts_info
= FTS_DP
;
796 /* Sort the entries. */
797 if (sp
->fts_compar
&& nitems
> 1)
798 head
= fts_sort(sp
, head
, nitems
);
804 fts_stat(sp
, dp
, p
, follow
)
813 struct stat
*sbp
, sb
;
816 /* If user needs stat info, stat buffer already allocated. */
817 sbp
= ISSET(FTS_NOSTAT
) ? &sb
: p
->fts_statp
;
819 #if defined DT_WHT && defined S_IFWHT
821 * Whited-out files don't really exist. However, there's stat(2) file
822 * mask for them, so we set it so that programs (i.e., find) don't have
823 * to test FTS_W separately from other file types.
825 if (dp
!= NULL
&& dp
->d_type
== DT_WHT
) {
826 memset(sbp
, 0, sizeof(struct stat
));
827 sbp
->st_mode
= S_IFWHT
;
833 * If doing a logical walk, or application requested FTS_FOLLOW, do
834 * a stat(2). If that fails, check for a non-existent symlink. If
835 * fail, set the errno from the stat call.
837 if (ISSET(FTS_LOGICAL
) || follow
) {
838 if (stat(p
->fts_accpath
, sbp
)) {
840 if (!lstat(p
->fts_accpath
, sbp
)) {
844 p
->fts_errno
= saved_errno
;
847 } else if (lstat(p
->fts_accpath
, sbp
)) {
848 p
->fts_errno
= errno
;
849 err
: __bzero(sbp
, sizeof(struct stat
));
853 if (S_ISDIR(sbp
->st_mode
)) {
855 * Set the device/inode. Used to find cycles and check for
856 * crossing mount points. Also remember the link count, used
857 * in fts_build to limit the number of stat calls. It is
858 * understood that these fields are only referenced if fts_info
861 dev
= p
->fts_dev
= sbp
->st_dev
;
862 ino
= p
->fts_ino
= sbp
->st_ino
;
863 p
->fts_nlink
= sbp
->st_nlink
;
865 if (ISDOT(p
->fts_name
))
869 * Cycle detection is done by brute force when the directory
870 * is first encountered. If the tree gets deep enough or the
871 * number of symbolic links to directories is high enough,
872 * something faster might be worthwhile.
874 for (t
= p
->fts_parent
;
875 t
->fts_level
>= FTS_ROOTLEVEL
; t
= t
->fts_parent
)
876 if (ino
== t
->fts_ino
&& dev
== t
->fts_dev
) {
882 if (S_ISLNK(sbp
->st_mode
))
884 if (S_ISREG(sbp
->st_mode
))
886 return (FTS_DEFAULT
);
891 fts_sort(sp
, head
, nitems
)
896 register FTSENT
**ap
, *p
;
899 * Construct an array of pointers to the structures and call qsort(3).
900 * Reassemble the array in the order returned by qsort. If unable to
901 * sort for memory reasons, return the directory entries in their
902 * current order. Allocate enough space for the current needs plus
903 * 40 so don't realloc one entry at a time.
905 if (nitems
> sp
->fts_nitems
) {
906 sp
->fts_nitems
= nitems
+ 40;
907 if ((sp
->fts_array
= realloc(sp
->fts_array
,
908 (size_t)(sp
->fts_nitems
* sizeof(FTSENT
*)))) == NULL
) {
913 for (ap
= sp
->fts_array
, p
= head
; p
; p
= p
->fts_link
)
915 qsort((void *)sp
->fts_array
, nitems
, sizeof(FTSENT
*), sp
->fts_compar
);
916 for (head
= *(ap
= sp
->fts_array
); --nitems
; ++ap
)
917 ap
[0]->fts_link
= ap
[1];
918 ap
[0]->fts_link
= NULL
;
924 fts_alloc(sp
, name
, namelen
)
927 register int namelen
;
933 * The file name is a variable length array and no stat structure is
934 * necessary if the user has set the nostat bit. Allocate the FTSENT
935 * structure, the file name and the stat structure in one chunk, but
936 * be careful that the stat structure is reasonably aligned. Since the
937 * fts_name field is declared to be of size 1, the fts_name pointer is
938 * namelen + 2 before the first possible address of the stat structure.
940 len
= sizeof(FTSENT
) + namelen
;
941 if (!ISSET(FTS_NOSTAT
))
942 len
+= sizeof(struct stat
) + ALIGNBYTES
;
943 if ((p
= malloc(len
)) == NULL
)
946 /* Copy the name plus the trailing NULL. */
947 bcopy(name
, p
->fts_name
, namelen
+ 1);
949 if (!ISSET(FTS_NOSTAT
))
950 p
->fts_statp
= (struct stat
*)ALIGN(p
->fts_name
+ namelen
+ 2);
951 p
->fts_namelen
= namelen
;
952 p
->fts_path
= sp
->fts_path
;
955 p
->fts_instr
= FTS_NOINSTR
;
957 p
->fts_pointer
= NULL
;
964 register FTSENT
*head
;
968 /* Free a linked list of structures. */
970 head
= head
->fts_link
;
976 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
977 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
978 * though the kernel won't resolve them. Add the size (not just what's needed)
979 * plus 256 bytes so don't realloc the path 2 bytes at a time.
987 sp
->fts_pathlen
+= more
+ 256;
988 sp
->fts_path
= realloc(sp
->fts_path
, (size_t)sp
->fts_pathlen
);
989 return (sp
->fts_path
== NULL
);
993 * When the path is realloc'd, have to fix all of the pointers in structures
998 fts_padjust(sp
, addr
)
1004 #define ADJUST(p) { \
1005 (p)->fts_accpath = \
1006 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1007 (p)->fts_path = addr; \
1009 /* Adjust the current set of children. */
1010 for (p
= sp
->fts_child
; p
; p
= p
->fts_link
)
1013 /* Adjust the rest of the tree. */
1014 for (p
= sp
->fts_cur
; p
->fts_level
>= FTS_ROOTLEVEL
;) {
1016 p
= p
->fts_link
? p
->fts_link
: p
->fts_parent
;
1027 for (max
= 0; *argv
; ++argv
)
1028 if ((len
= strlen(*argv
)) > max
)