]>
sourceware.org Git - glibc.git/blob - io/fts.c
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
34 #if defined(LIBC_SCCS) && !defined(lint)
35 static char sccsid
[] = "@(#)fts.c 8.6 (Berkeley) 8/14/94";
36 #endif /* LIBC_SCCS and not lint */
38 #include <sys/param.h>
39 #include <include/sys/stat.h>
49 /* Largest alignment size needed, minus one.
50 Usually long double is the worst case. */
52 #define ALIGNBYTES (__alignof__ (long double) - 1)
54 /* Align P to that size. */
56 #define ALIGN(p) (((unsigned long int) (p) + ALIGNBYTES) & ~ALIGNBYTES)
60 static FTSENT
*fts_alloc
__P((FTS
*, const char *, int)) internal_function
;
61 static FTSENT
*fts_build
__P((FTS
*, int)) internal_function
;
62 static void fts_lfree
__P((FTSENT
*)) internal_function
;
63 static void fts_load
__P((FTS
*, FTSENT
*));
64 static size_t fts_maxarglen
__P((char * const *)) internal_function
;
65 static void fts_padjust
__P((FTS
*, void *)) internal_function
;
66 static int fts_palloc
__P((FTS
*, size_t)) internal_function
;
67 static FTSENT
*fts_sort
__P((FTS
*, FTSENT
*, int)) internal_function
;
68 static u_short fts_stat
__P((FTS
*, struct dirent
*, FTSENT
*, int))
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 ISSET(opt) (sp->fts_options & opt)
80 #define SET(opt) (sp->fts_options |= opt)
82 #define CHDIR(sp, path) (!ISSET(FTS_NOCHDIR) && __chdir(path))
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(argv
, options
, compar
)
94 int (*compar
) __P((const FTSENT
**, const FTSENT
**));
97 register FTSENT
*p
, *root
;
103 if (options
& ~FTS_OPTIONMASK
) {
104 __set_errno (EINVAL
);
108 /* Allocate/initialize the stream */
109 if ((sp
= malloc((u_int
)sizeof(FTS
))) == NULL
)
111 __bzero(sp
, sizeof(FTS
));
112 sp
->fts_compar
= (int (*) __P((const void *, const void *))) compar
;
113 sp
->fts_options
= options
;
115 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
116 if (ISSET(FTS_LOGICAL
))
120 * Start out with 1K of path space, and enough, in any case,
121 * to hold the user's paths.
124 #define MAXPATHLEN 1024
126 if (fts_palloc(sp
, MAX(fts_maxarglen(argv
), MAXPATHLEN
)))
129 /* Allocate/initialize root's parent. */
130 if ((parent
= fts_alloc(sp
, "", 0)) == NULL
)
132 parent
->fts_level
= FTS_ROOTPARENTLEVEL
;
134 /* Allocate/initialize root(s). */
135 for (root
= NULL
, nitems
= 0; *argv
; ++argv
, ++nitems
) {
136 /* Don't allow zero-length paths. */
137 if ((len
= strlen(*argv
)) == 0) {
138 __set_errno (ENOENT
);
142 p
= fts_alloc(sp
, *argv
, len
);
143 p
->fts_level
= FTS_ROOTLEVEL
;
144 p
->fts_parent
= parent
;
145 p
->fts_accpath
= p
->fts_name
;
146 p
->fts_info
= fts_stat(sp
, NULL
, p
, ISSET(FTS_COMFOLLOW
));
148 /* Command-line "." and ".." are real directories. */
149 if (p
->fts_info
== FTS_DOT
)
153 * If comparison routine supplied, traverse in sorted
154 * order; otherwise traverse in the order specified.
169 if (compar
&& nitems
> 1)
170 root
= fts_sort(sp
, root
, nitems
);
173 * Allocate a dummy pointer and make fts_read think that we've just
174 * finished the node before the root(s); set p->fts_info to FTS_INIT
175 * so that everything about the "current" node is ignored.
177 if ((sp
->fts_cur
= fts_alloc(sp
, "", 0)) == NULL
)
179 sp
->fts_cur
->fts_link
= root
;
180 sp
->fts_cur
->fts_info
= FTS_INIT
;
183 * If using chdir(2), grab a file descriptor pointing to dot to insure
184 * that we can get back here; this could be avoided for some paths,
185 * but almost certainly not worth the effort. Slashes, symbolic links,
186 * and ".." are all fairly nasty problems. Note, if we can't get the
187 * descriptor we run anyway, just more slowly.
189 if (!ISSET(FTS_NOCHDIR
)
190 && (sp
->fts_rfd
= __open(".", O_RDONLY
, 0)) < 0)
195 mem3
: fts_lfree(root
);
197 mem2
: free(sp
->fts_path
);
211 * Load the stream structure for the next traversal. Since we don't
212 * actually enter the directory until after the preorder visit, set
213 * the fts_accpath field specially so the chdir gets done to the right
214 * place and the user can access the first node. From fts_open it's
215 * known that the path will fit.
217 len
= p
->fts_pathlen
= p
->fts_namelen
;
218 bcopy(p
->fts_name
, sp
->fts_path
, len
+ 1);
219 if ((cp
= rindex(p
->fts_name
, '/')) && (cp
!= p
->fts_name
|| cp
[1])) {
221 bcopy(cp
, p
->fts_name
, len
+ 1);
222 p
->fts_namelen
= len
;
224 p
->fts_accpath
= p
->fts_path
= sp
->fts_path
;
225 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
? p
->fts_link
: p
->fts_parent
;
249 /* Free up child linked list, sort array, path buffer. */
251 fts_lfree(sp
->fts_child
);
256 /* Return to original directory, save errno if necessary. */
257 if (!ISSET(FTS_NOCHDIR
)) {
258 saved_errno
= __fchdir(sp
->fts_rfd
) ? errno
: 0;
259 (void)__close(sp
->fts_rfd
);
262 /* Free up the stream pointer. */
265 /* Set errno and return. */
266 if (!ISSET(FTS_NOCHDIR
) && saved_errno
) {
267 __set_errno (saved_errno
);
274 * Special case a root of "/" so that slashes aren't appended which would
275 * cause paths to be written as "//foo".
278 (p->fts_level == FTS_ROOTLEVEL && p->fts_pathlen == 1 && \
279 p->fts_path[0] == '/' ? 0 : p->fts_pathlen)
285 register FTSENT
*p
, *tmp
;
290 /* If finished or unrecoverable error, return NULL. */
291 if (sp
->fts_cur
== NULL
|| ISSET(FTS_STOP
))
294 /* Set current node pointer. */
297 /* Save and zero out user instructions. */
298 instr
= p
->fts_instr
;
299 p
->fts_instr
= FTS_NOINSTR
;
301 /* Any type of file may be re-visited; re-stat and re-turn. */
302 if (instr
== FTS_AGAIN
) {
303 p
->fts_info
= fts_stat(sp
, NULL
, 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
, NULL
, 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
;
325 /* Directory in pre-order. */
326 if (p
->fts_info
== FTS_D
) {
327 /* If skipped or crossed mount point, do post-order visit. */
328 if (instr
== FTS_SKIP
||
329 ISSET(FTS_XDEV
) && p
->fts_dev
!= sp
->fts_dev
) {
330 if (p
->fts_flags
& FTS_SYMFOLLOW
)
331 (void)__close(p
->fts_symfd
);
333 fts_lfree(sp
->fts_child
);
334 sp
->fts_child
= NULL
;
336 p
->fts_info
= FTS_DP
;
340 /* Rebuild if only read the names and now traversing. */
341 if (sp
->fts_child
&& sp
->fts_options
& FTS_NAMEONLY
) {
342 sp
->fts_options
&= ~FTS_NAMEONLY
;
343 fts_lfree(sp
->fts_child
);
344 sp
->fts_child
= NULL
;
348 * Cd to the subdirectory.
350 * If have already read and now fail to chdir, whack the list
351 * to make the names come out right, and set the parent errno
352 * so the application will eventually get an error condition.
353 * Set the FTS_DONTCHDIR flag so that when we logically change
354 * directories back to the parent we don't do a chdir.
356 * If haven't read do so. If the read fails, fts_build sets
357 * FTS_STOP or the fts_info field of the node.
360 if (CHDIR(sp
, p
->fts_accpath
)) {
361 p
->fts_errno
= errno
;
362 p
->fts_flags
|= FTS_DONTCHDIR
;
363 for (p
= sp
->fts_child
; p
; p
= p
->fts_link
)
365 p
->fts_parent
->fts_accpath
;
367 } else if ((sp
->fts_child
= fts_build(sp
, BREAD
)) == NULL
) {
373 sp
->fts_child
= NULL
;
377 /* Move to the next node on this level. */
379 if (p
= p
->fts_link
) {
383 * If reached the top, return to the original directory, and
384 * load the paths for the next root.
386 if (p
->fts_level
== FTS_ROOTLEVEL
) {
387 if (!ISSET(FTS_NOCHDIR
) && FCHDIR(sp
, sp
->fts_rfd
)) {
392 return (sp
->fts_cur
= p
);
396 * User may have called fts_set on the node. If skipped,
397 * ignore. If followed, get a file descriptor so we can
398 * get back if necessary.
400 if (p
->fts_instr
== FTS_SKIP
)
402 if (p
->fts_instr
== FTS_FOLLOW
) {
403 p
->fts_info
= fts_stat(sp
, NULL
, p
, 1);
404 if (p
->fts_info
== FTS_D
&& !ISSET(FTS_NOCHDIR
))
406 __open(".", O_RDONLY
, 0)) < 0) {
407 p
->fts_errno
= errno
;
408 p
->fts_info
= FTS_ERR
;
410 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. */
677 for (head
= tail
= NULL
, nitems
= 0; dp
= __readdir(dirp
);) {
680 if (!ISSET(FTS_SEEDOT
) && ISDOT(dp
->d_name
))
683 namlen
= _D_EXACT_NAMLEN (dp
);
684 if ((p
= fts_alloc(sp
, dp
->d_name
, namlen
)) == NULL
)
686 if (namlen
> maxlen
) {
687 if (fts_palloc(sp
, (size_t)namlen
)) {
689 * No more memory for path or structures. Save
690 * errno, free up the current structure and the
691 * structures already allocated.
693 mem1
: saved_errno
= errno
;
697 (void)__closedir(dirp
);
698 __set_errno (saved_errno
);
699 cur
->fts_info
= FTS_ERR
;
703 adjaddr
= sp
->fts_path
;
704 maxlen
= sp
->fts_pathlen
- sp
->fts_cur
->fts_pathlen
- 1;
707 p
->fts_pathlen
= len
+ namlen
+ 1;
708 p
->fts_parent
= sp
->fts_cur
;
709 p
->fts_level
= level
;
713 p
->fts_info
= FTS_NS
;
714 p
->fts_errno
= cderrno
;
716 p
->fts_info
= FTS_NSOK
;
717 p
->fts_accpath
= cur
->fts_accpath
;
718 } else if (nlinks
== 0
719 #if defined DT_DIR && defined _DIRENT_HAVE_D_TYPE
721 dp
->d_type
!= DT_DIR
&& dp
->d_type
!= DT_UNKNOWN
725 ISSET(FTS_NOCHDIR
) ? p
->fts_path
: p
->fts_name
;
726 p
->fts_info
= FTS_NSOK
;
728 /* Build a file name for fts_stat to stat. */
729 if (ISSET(FTS_NOCHDIR
)) {
730 p
->fts_accpath
= p
->fts_path
;
731 bcopy(p
->fts_name
, cp
, p
->fts_namelen
+ 1);
733 p
->fts_accpath
= p
->fts_name
;
735 p
->fts_info
= fts_stat(sp
, dp
, p
, 0);
737 /* Decrement link count if applicable. */
738 if (nlinks
> 0 && (p
->fts_info
== FTS_D
||
739 p
->fts_info
== FTS_DC
|| p
->fts_info
== FTS_DOT
))
743 /* We walk in directory order so "ls -f" doesn't get upset. */
753 (void)__closedir(dirp
);
756 * If had to realloc the path, adjust the addresses for the rest
760 fts_padjust(sp
, adjaddr
);
763 * If not changing directories, reset the path back to original
766 if (ISSET(FTS_NOCHDIR
)) {
767 if (cp
- 1 > sp
->fts_path
)
773 * If descended after called from fts_children or after called from
774 * fts_read and nothing found, get back. At the root level we use
775 * the saved fd; if one of fts_open()'s arguments is a relative path
776 * to an empty directory, we wind up here with no other way back. If
777 * can't get back, we're done.
779 if (descend
&& (type
== BCHILD
|| !nitems
) &&
780 (cur
->fts_level
== FTS_ROOTLEVEL
?
781 FCHDIR (sp
, sp
->fts_rfd
) : CHDIR (sp
, ".."))) {
782 cur
->fts_info
= FTS_ERR
;
787 /* If didn't find anything, return NULL. */
790 cur
->fts_info
= FTS_DP
;
794 /* Sort the entries. */
795 if (sp
->fts_compar
&& nitems
> 1)
796 head
= fts_sort(sp
, head
, nitems
);
802 fts_stat(sp
, dp
, p
, follow
)
811 struct stat
*sbp
, sb
;
814 /* If user needs stat info, stat buffer already allocated. */
815 sbp
= ISSET(FTS_NOSTAT
) ? &sb
: p
->fts_statp
;
819 * Whited-out files don't really exist. However, there's stat(2) file
820 * mask for them, so we set it so that programs (i.e., find) don't have
821 * to test FTS_W separately from other file types.
823 if (dp
!= NULL
&& dp
->d_type
== DT_WHT
) {
824 memset(sbp
, 0, sizeof(struct stat
));
825 sbp
->st_mode
= S_IFWHT
;
831 * If doing a logical walk, or application requested FTS_FOLLOW, do
832 * a stat(2). If that fails, check for a non-existent symlink. If
833 * fail, set the errno from the stat call.
835 if (ISSET(FTS_LOGICAL
) || follow
) {
836 if (stat(p
->fts_accpath
, sbp
)) {
838 if (!lstat(p
->fts_accpath
, sbp
)) {
842 p
->fts_errno
= saved_errno
;
845 } else if (lstat(p
->fts_accpath
, sbp
)) {
846 p
->fts_errno
= errno
;
847 err
: __bzero(sbp
, sizeof(struct stat
));
851 if (S_ISDIR(sbp
->st_mode
)) {
853 * Set the device/inode. Used to find cycles and check for
854 * crossing mount points. Also remember the link count, used
855 * in fts_build to limit the number of stat calls. It is
856 * understood that these fields are only referenced if fts_info
859 dev
= p
->fts_dev
= sbp
->st_dev
;
860 ino
= p
->fts_ino
= sbp
->st_ino
;
861 p
->fts_nlink
= sbp
->st_nlink
;
863 if (ISDOT(p
->fts_name
))
867 * Cycle detection is done by brute force when the directory
868 * is first encountered. If the tree gets deep enough or the
869 * number of symbolic links to directories is high enough,
870 * something faster might be worthwhile.
872 for (t
= p
->fts_parent
;
873 t
->fts_level
>= FTS_ROOTLEVEL
; t
= t
->fts_parent
)
874 if (ino
== t
->fts_ino
&& dev
== t
->fts_dev
) {
880 if (S_ISLNK(sbp
->st_mode
))
882 if (S_ISREG(sbp
->st_mode
))
884 return (FTS_DEFAULT
);
889 fts_sort(sp
, head
, nitems
)
894 register FTSENT
**ap
, *p
;
897 * Construct an array of pointers to the structures and call qsort(3).
898 * Reassemble the array in the order returned by qsort. If unable to
899 * sort for memory reasons, return the directory entries in their
900 * current order. Allocate enough space for the current needs plus
901 * 40 so don't realloc one entry at a time.
903 if (nitems
> sp
->fts_nitems
) {
904 sp
->fts_nitems
= nitems
+ 40;
905 if ((sp
->fts_array
= realloc(sp
->fts_array
,
906 (size_t)(sp
->fts_nitems
* sizeof(FTSENT
*)))) == NULL
) {
911 for (ap
= sp
->fts_array
, p
= head
; p
; p
= p
->fts_link
)
913 qsort((void *)sp
->fts_array
, nitems
, sizeof(FTSENT
*), sp
->fts_compar
);
914 for (head
= *(ap
= sp
->fts_array
); --nitems
; ++ap
)
915 ap
[0]->fts_link
= ap
[1];
916 ap
[0]->fts_link
= NULL
;
922 fts_alloc(sp
, name
, namelen
)
925 register int namelen
;
931 * The file name is a variable length array and no stat structure is
932 * necessary if the user has set the nostat bit. Allocate the FTSENT
933 * structure, the file name and the stat structure in one chunk, but
934 * be careful that the stat structure is reasonably aligned. Since the
935 * fts_name field is declared to be of size 1, the fts_name pointer is
936 * namelen + 2 before the first possible address of the stat structure.
938 len
= sizeof(FTSENT
) + namelen
;
939 if (!ISSET(FTS_NOSTAT
))
940 len
+= sizeof(struct stat
) + ALIGNBYTES
;
941 if ((p
= malloc(len
)) == NULL
)
944 /* Copy the name plus the trailing NULL. */
945 bcopy(name
, p
->fts_name
, namelen
+ 1);
947 if (!ISSET(FTS_NOSTAT
))
948 p
->fts_statp
= (struct stat
*)ALIGN(p
->fts_name
+ namelen
+ 2);
949 p
->fts_namelen
= namelen
;
950 p
->fts_path
= sp
->fts_path
;
953 p
->fts_instr
= FTS_NOINSTR
;
955 p
->fts_pointer
= NULL
;
962 register FTSENT
*head
;
966 /* Free a linked list of structures. */
968 head
= head
->fts_link
;
974 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
975 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
976 * though the kernel won't resolve them. Add the size (not just what's needed)
977 * plus 256 bytes so don't realloc the path 2 bytes at a time.
985 sp
->fts_pathlen
+= more
+ 256;
986 sp
->fts_path
= realloc(sp
->fts_path
, (size_t)sp
->fts_pathlen
);
987 return (sp
->fts_path
== NULL
);
991 * When the path is realloc'd, have to fix all of the pointers in structures
996 fts_padjust(sp
, addr
)
1002 #define ADJUST(p) { \
1003 (p)->fts_accpath = \
1004 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1005 (p)->fts_path = addr; \
1007 /* Adjust the current set of children. */
1008 for (p
= sp
->fts_child
; p
; p
= p
->fts_link
)
1011 /* Adjust the rest of the tree. */
1012 for (p
= sp
->fts_cur
; p
->fts_level
>= FTS_ROOTLEVEL
;) {
1014 p
= p
->fts_link
? p
->fts_link
: p
->fts_parent
;
1025 for (max
= 0; *argv
; ++argv
)
1026 if ((len
= strlen(*argv
)) > max
)
This page took 0.10911 seconds and 5 git commands to generate.