Update.
[glibc.git] / io / fts.c
blob4c0eb7d8af8b9365b26f76cfcd7981d3f3aa4654
1 /*-
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
7 * are met:
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
27 * SUCH DAMAGE.
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>
36 #include <fcntl.h>
37 #include <dirent.h>
38 #include <errno.h>
39 #include <fts.h>
40 #include <stdlib.h>
41 #include <string.h>
42 #include <unistd.h>
45 /* Largest alignment size needed, minus one.
46 Usually long double is the worst case. */
47 #ifndef ALIGNBYTES
48 #define ALIGNBYTES (__alignof__ (long double) - 1)
49 #endif
50 /* Align P to that size. */
51 #ifndef ALIGN
52 #define ALIGN(p) (((unsigned long int) (p) + ALIGNBYTES) & ~ALIGNBYTES)
53 #endif
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))
65 internal_function;
67 #ifndef MAX
68 #define MAX(a, b) ({ __typeof__ (a) _a = (a); \
69 __typeof__ (b) _b = (b); \
70 _a > _b ? _a : _b; })
71 #endif
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))
81 /* fts_build flags */
82 #define BCHILD 1 /* fts_children */
83 #define BNAMES 2 /* fts_children, names only */
84 #define BREAD 3 /* fts_read */
86 FTS *
87 fts_open(argv, options, compar)
88 char * const *argv;
89 register int options;
90 int (*compar) __P((const FTSENT **, const FTSENT **));
92 register FTS *sp;
93 register FTSENT *p, *root;
94 register int nitems;
95 FTSENT *parent, *tmp;
96 int len;
98 /* Options check. */
99 if (options & ~FTS_OPTIONMASK) {
100 __set_errno (EINVAL);
101 return (NULL);
104 /* Allocate/initialize the stream */
105 if ((sp = malloc((u_int)sizeof(FTS))) == NULL)
106 return (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))
113 SET(FTS_NOCHDIR);
116 * Start out with 1K of path space, and enough, in any case,
117 * to hold the user's paths.
119 #ifndef MAXPATHLEN
120 #define MAXPATHLEN 1024
121 #endif
122 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
123 goto mem1;
125 /* Allocate/initialize root's parent. */
126 if ((parent = fts_alloc(sp, "", 0)) == NULL)
127 goto mem2;
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);
135 goto mem3;
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)
146 p->fts_info = FTS_D;
149 * If comparison routine supplied, traverse in sorted
150 * order; otherwise traverse in the order specified.
152 if (compar) {
153 p->fts_link = root;
154 root = p;
155 } else {
156 p->fts_link = NULL;
157 if (root == NULL)
158 tmp = root = p;
159 else {
160 tmp->fts_link = p;
161 tmp = p;
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)
174 goto mem3;
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)
187 SET(FTS_NOCHDIR);
189 return (sp);
191 mem3: fts_lfree(root);
192 free(parent);
193 mem2: free(sp->fts_path);
194 mem1: free(sp);
195 return (NULL);
198 static void
199 fts_load(sp, p)
200 FTS *sp;
201 register FTSENT *p;
203 register int len;
204 register char *cp;
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])) {
216 len = strlen(++cp);
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;
225 fts_close(sp)
226 FTS *sp;
228 register FTSENT *freep, *p;
229 int saved_errno;
230 int retval = 0;
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.
237 if (sp->fts_cur) {
238 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
239 freep = p;
240 p = p->fts_link ? p->fts_link : p->fts_parent;
241 free(freep);
243 free(p);
246 /* Free up child linked list, sort array, path buffer. */
247 if (sp->fts_child)
248 fts_lfree(sp->fts_child);
249 if (sp->fts_array)
250 free(sp->fts_array);
251 free(sp->fts_path);
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);
262 retval = -1;
265 /* Free up the stream pointer. */
266 free (sp);
268 return retval;
272 * Special case a root of "/" so that slashes aren't appended which would
273 * cause paths to be written as "//foo".
275 #define NAPPEND(p) \
276 (p->fts_level == FTS_ROOTLEVEL && p->fts_pathlen == 1 && \
277 p->fts_path[0] == '/' ? 0 : p->fts_pathlen)
279 FTSENT *
280 fts_read(sp)
281 register FTS *sp;
283 register FTSENT *p, *tmp;
284 register int instr;
285 register char *t;
286 int saved_errno;
288 /* If finished or unrecoverable error, return NULL. */
289 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
290 return (NULL);
292 /* Set current node pointer. */
293 p = sp->fts_cur;
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);
302 return (p);
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;
318 } else
319 p->fts_flags |= FTS_SYMFOLLOW;
321 return (p);
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);
331 if (sp->fts_child) {
332 fts_lfree(sp->fts_child);
333 sp->fts_child = NULL;
335 p->fts_info = FTS_DP;
336 return (p);
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.
358 if (sp->fts_child) {
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)
363 p->fts_accpath =
364 p->fts_parent->fts_accpath;
366 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
367 if (ISSET(FTS_STOP))
368 return (NULL);
369 return (p);
371 p = sp->fts_child;
372 sp->fts_child = NULL;
373 goto name;
376 /* Move to the next node on this level. */
377 next: tmp = p;
378 if ((p = p->fts_link)) {
379 free(tmp);
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)) {
387 SET(FTS_STOP);
388 return (NULL);
390 fts_load(sp, p);
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)
400 goto next;
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)) {
404 if ((p->fts_symfd =
405 __open(".", O_RDONLY, 0)) < 0) {
406 p->fts_errno = errno;
407 p->fts_info = FTS_ERR;
408 } else
409 p->fts_flags |= FTS_SYMFOLLOW;
411 p->fts_instr = FTS_NOINSTR;
414 name: t = sp->fts_path + NAPPEND(p->fts_parent);
415 *t++ = '/';
416 bcopy(p->fts_name, t, p->fts_namelen + 1);
417 return (sp->fts_cur = p);
420 /* Move up to the parent node. */
421 p = tmp->fts_parent;
422 free(tmp);
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.
429 free(p);
430 __set_errno (0);
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
440 * one directory.
442 if (p->fts_level == FTS_ROOTLEVEL) {
443 if (!ISSET(FTS_NOCHDIR) && FCHDIR(sp, sp->fts_rfd)) {
444 SET(FTS_STOP);
445 return (NULL);
447 } else if (p->fts_flags & FTS_SYMFOLLOW) {
448 if (FCHDIR(sp, p->fts_symfd)) {
449 saved_errno = errno;
450 (void)__close(p->fts_symfd);
451 __set_errno (saved_errno);
452 SET(FTS_STOP);
453 return (NULL);
455 (void)__close(p->fts_symfd);
456 } else if (!(p->fts_flags & FTS_DONTCHDIR)) {
457 if (CHDIR(sp, "..")) {
458 SET(FTS_STOP);
459 return (NULL);
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
470 * reasons.
472 /* ARGSUSED */
474 fts_set(sp, p, instr)
475 FTS *sp;
476 FTSENT *p;
477 int instr;
479 if (instr && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
480 instr != FTS_NOINSTR && instr != FTS_SKIP) {
481 __set_errno (EINVAL);
482 return (1);
484 p->fts_instr = instr;
485 return (0);
488 FTSENT *
489 fts_children(sp, instr)
490 register FTS *sp;
491 int instr;
493 register FTSENT *p;
494 int fd;
496 if (instr && instr != FTS_NAMEONLY) {
497 __set_errno (EINVAL);
498 return (NULL);
501 /* Set current node pointer. */
502 p = sp->fts_cur;
505 * Errno set to 0 so user can distinguish empty directory from
506 * an error.
508 __set_errno (0);
510 /* Fatal errors stop here. */
511 if (ISSET(FTS_STOP))
512 return (NULL);
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 */)
524 return (NULL);
526 /* Free up any previous child list. */
527 if (sp->fts_child)
528 fts_lfree(sp->fts_child);
530 if (instr == FTS_NAMEONLY) {
531 sp->fts_options |= FTS_NAMEONLY;
532 instr = BNAMES;
533 } else
534 instr = BCHILD;
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] == '/' ||
544 ISSET(FTS_NOCHDIR))
545 return (sp->fts_child = fts_build(sp, instr));
547 if ((fd = __open(".", O_RDONLY, 0)) < 0)
548 return (NULL);
549 sp->fts_child = fts_build(sp, instr);
550 if (__fchdir(fd))
551 return (NULL);
552 (void)__close(fd);
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.
570 static FTSENT *
571 internal_function
572 fts_build(sp, type)
573 register FTS *sp;
574 int type;
576 struct dirent *dp;
577 register FTSENT *p, *head;
578 register int nitems;
579 FTSENT *cur, *tail;
580 DIR *dirp;
581 void *adjaddr;
582 int cderrno, descend, len, level, maxlen, nlinks, saved_errno;
583 char *cp;
584 #ifdef DTF_HIDEW
585 int oflag;
586 #endif
588 /* Set current node pointer. */
589 cur = sp->fts_cur;
592 * Open the directory for reading. If this fails, we're done.
593 * If being called from fts_read, set the fts_info field.
595 #ifdef DTF_HIDEW
596 if (ISSET (FTS_WHITEOUT))
597 oflag = DTF_NODUP|DTF_REWIND;
598 else
599 oflag = DTF_HIDEW|DTF_NODUP|DTF_REWIND;
600 #else
601 # define __opendir2(path, flag) __opendir(path)
602 #endif
603 if ((dirp = __opendir2 (cur->fts_accpath, oflag)) == NULL) {
604 if (type == BREAD) {
605 cur->fts_info = FTS_DNR;
606 cur->fts_errno = errno;
608 return (NULL);
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.
616 if (type == BNAMES)
617 nlinks = 0;
618 else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL))
619 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
620 else
621 nlinks = -1;
623 #ifdef notdef
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));
627 #endif
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.
643 cderrno = 0;
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;
649 descend = 0;
650 cderrno = errno;
651 } else
652 descend = 1;
653 } else
654 descend = 0;
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;
667 len = NAPPEND(cur);
668 if (ISSET(FTS_NOCHDIR)) {
669 cp = sp->fts_path + len;
670 *cp++ = '/';
673 level = cur->fts_level + 1;
675 /* Read the directory, attaching each entry to the `link' pointer. */
676 adjaddr = NULL;
677 head = tail = NULL;
678 nitems = 0;
679 while((dp = __readdir(dirp))) {
680 int namlen;
682 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
683 continue;
685 namlen = _D_EXACT_NAMLEN (dp);
686 if ((p = fts_alloc(sp, dp->d_name, namlen)) == NULL)
687 goto mem1;
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;
696 if (p)
697 free(p);
698 fts_lfree(head);
699 (void)__closedir(dirp);
700 __set_errno (saved_errno);
701 cur->fts_info = FTS_ERR;
702 SET(FTS_STOP);
703 return (NULL);
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;
713 if (cderrno) {
714 if (nlinks) {
715 p->fts_info = FTS_NS;
716 p->fts_errno = cderrno;
717 } else
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
722 || (nlinks > 0 &&
723 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
724 #endif
726 p->fts_accpath =
727 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
728 p->fts_info = FTS_NSOK;
729 } else {
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);
734 } else
735 p->fts_accpath = p->fts_name;
736 /* Stat it. */
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))
742 --nlinks;
745 /* We walk in directory order so "ls -f" doesn't get upset. */
746 p->fts_link = NULL;
747 if (head == NULL)
748 head = tail = p;
749 else {
750 tail->fts_link = p;
751 tail = p;
753 ++nitems;
755 (void)__closedir(dirp);
758 * If had to realloc the path, adjust the addresses for the rest
759 * of the tree.
761 if (adjaddr)
762 fts_padjust(sp, adjaddr);
765 * If not changing directories, reset the path back to original
766 * state.
768 if (ISSET(FTS_NOCHDIR)) {
769 if (cp - 1 > sp->fts_path)
770 --cp;
771 *cp = '\0';
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;
785 SET(FTS_STOP);
786 return (NULL);
789 /* If didn't find anything, return NULL. */
790 if (!nitems) {
791 if (type == BREAD)
792 cur->fts_info = FTS_DP;
793 return (NULL);
796 /* Sort the entries. */
797 if (sp->fts_compar && nitems > 1)
798 head = fts_sort(sp, head, nitems);
799 return (head);
802 static u_short
803 internal_function
804 fts_stat(sp, dp, p, follow)
805 FTS *sp;
806 register FTSENT *p;
807 struct dirent *dp;
808 int follow;
810 register FTSENT *t;
811 register dev_t dev;
812 register ino_t ino;
813 struct stat *sbp, sb;
814 int saved_errno;
816 /* If user needs stat info, stat buffer already allocated. */
817 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
819 #ifdef DT_WHT
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;
828 return (FTS_W);
830 #endif
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)) {
839 saved_errno = errno;
840 if (!lstat(p->fts_accpath, sbp)) {
841 __set_errno (0);
842 return (FTS_SLNONE);
844 p->fts_errno = saved_errno;
845 goto err;
847 } else if (lstat(p->fts_accpath, sbp)) {
848 p->fts_errno = errno;
849 err: __bzero(sbp, sizeof(struct stat));
850 return (FTS_NS);
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
859 * is set to FTS_D.
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))
866 return (FTS_DOT);
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) {
877 p->fts_cycle = t;
878 return (FTS_DC);
880 return (FTS_D);
882 if (S_ISLNK(sbp->st_mode))
883 return (FTS_SL);
884 if (S_ISREG(sbp->st_mode))
885 return (FTS_F);
886 return (FTS_DEFAULT);
889 static FTSENT *
890 internal_function
891 fts_sort(sp, head, nitems)
892 FTS *sp;
893 FTSENT *head;
894 register int 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) {
909 sp->fts_nitems = 0;
910 return (head);
913 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
914 *ap++ = p;
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;
919 return (head);
922 static FTSENT *
923 internal_function
924 fts_alloc(sp, name, namelen)
925 FTS *sp;
926 const char *name;
927 register int namelen;
929 register FTSENT *p;
930 size_t len;
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)
944 return (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;
953 p->fts_errno = 0;
954 p->fts_flags = 0;
955 p->fts_instr = FTS_NOINSTR;
956 p->fts_number = 0;
957 p->fts_pointer = NULL;
958 return (p);
961 static void
962 internal_function
963 fts_lfree(head)
964 register FTSENT *head;
966 register FTSENT *p;
968 /* Free a linked list of structures. */
969 while ((p = head)) {
970 head = head->fts_link;
971 free(p);
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.
981 static int
982 internal_function
983 fts_palloc(sp, more)
984 FTS *sp;
985 size_t more;
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
994 * already returned.
996 static void
997 internal_function
998 fts_padjust(sp, addr)
999 FTS *sp;
1000 void *addr;
1002 FTSENT *p;
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)
1011 ADJUST(p);
1013 /* Adjust the rest of the tree. */
1014 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
1015 ADJUST(p);
1016 p = p->fts_link ? p->fts_link : p->fts_parent;
1020 static size_t
1021 internal_function
1022 fts_maxarglen(argv)
1023 char * const *argv;
1025 size_t len, max;
1027 for (max = 0; *argv; ++argv)
1028 if ((len = strlen(*argv)) > max)
1029 max = len;
1030 return (max);