139
140 /* Shush, GCC. */
141 tmp = NULL;
142
143 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
144 if (ISSET(FTS_LOGICAL))
145 SET(FTS_NOCHDIR);
146
147 /*
148 * Start out with 1K of path space, and enough, in any case,
149 * to hold the user's paths.
150 */
151 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
152 goto mem1;
153
154 /* Allocate/initialize root's parent. */
155 if ((parent = fts_alloc(sp, "", 0)) == NULL)
156 goto mem2;
157 parent->fts_level = FTS_ROOTPARENTLEVEL;
158
159 /* Allocate/initialize root(s). */
160 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
161 /* Don't allow zero-length paths. */
162 if ((len = strlen(*argv)) == 0) {
163 errno = ENOENT;
164 goto mem3;
165 }
166
167 p = fts_alloc(sp, *argv, len);
168 p->fts_level = FTS_ROOTLEVEL;
169 p->fts_parent = parent;
170 p->fts_accpath = p->fts_name;
171 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
172
173 /* Command-line "." and ".." are real directories. */
174 if (p->fts_info == FTS_DOT)
175 p->fts_info = FTS_D;
176
177 /*
178 * If comparison routine supplied, traverse in sorted
179 * order; otherwise traverse in the order specified.
180 */
181 if (compar) {
182 p->fts_link = root;
183 root = p;
184 } else {
185 p->fts_link = NULL;
186 if (root == NULL)
187 tmp = root = p;
188 else {
189 tmp->fts_link = p;
190 tmp = p;
191 }
192 }
193 }
194 if (compar && nitems > 1)
195 root = fts_sort(sp, root, nitems);
196
197 /*
198 * Allocate a dummy pointer and make fts_read think that we've just
199 * finished the node before the root(s); set p->fts_info to FTS_INIT
200 * so that everything about the "current" node is ignored.
201 */
202 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
203 goto mem3;
204 sp->fts_cur->fts_link = root;
205 sp->fts_cur->fts_info = FTS_INIT;
206
207 /*
208 * If using chdir(2), grab a file descriptor pointing to dot to ensure
209 * that we can get back here; this could be avoided for some paths,
210 * but almost certainly not worth the effort. Slashes, symbolic links,
211 * and ".." are all fairly nasty problems. Note, if we can't get the
212 * descriptor we run anyway, just more slowly.
213 */
214 if (!ISSET(FTS_NOCHDIR) && (sp->fts_rfd = _open(".", O_RDONLY, 0)) < 0)
215 SET(FTS_NOCHDIR);
216
217 return (sp);
218
219mem3: fts_lfree(root);
220 free(parent);
221mem2: free(sp->fts_path);
222mem1: free(sp);
223 return (NULL);
224}
225
226static void
227fts_load(sp, p)
228 FTS *sp;
229 FTSENT *p;
230{
231 int len;
232 char *cp;
233
234 /*
235 * Load the stream structure for the next traversal. Since we don't
236 * actually enter the directory until after the preorder visit, set
237 * the fts_accpath field specially so the chdir gets done to the right
238 * place and the user can access the first node. From fts_open it's
239 * known that the path will fit.
240 */
241 len = p->fts_pathlen = p->fts_namelen;
242 memmove(sp->fts_path, p->fts_name, len + 1);
243 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
244 len = strlen(++cp);
245 memmove(p->fts_name, cp, len + 1);
246 p->fts_namelen = len;
247 }
248 p->fts_accpath = p->fts_path = sp->fts_path;
249 sp->fts_dev = p->fts_dev;
250}
251
252int
253fts_close(sp)
254 FTS *sp;
255{
256 FTSENT *freep, *p;
257 int saved_errno;
258
259 /*
260 * This still works if we haven't read anything -- the dummy structure
261 * points to the root list, so we step through to the end of the root
262 * list which has a valid parent pointer.
263 */
264 if (sp->fts_cur) {
265 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
266 freep = p;
267 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
268 free(freep);
269 }
270 free(p);
271 }
272
273 /* Free up child linked list, sort array, path buffer. */
274 if (sp->fts_child)
275 fts_lfree(sp->fts_child);
276 if (sp->fts_array)
277 free(sp->fts_array);
278 free(sp->fts_path);
279
280 /* Return to original directory, save errno if necessary. */
281 if (!ISSET(FTS_NOCHDIR)) {
282 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
283 (void)_close(sp->fts_rfd);
284
285 /* Set errno and return. */
286 if (saved_errno != 0) {
287 /* Free up the stream pointer. */
288 free(sp);
289 errno = saved_errno;
290 return (-1);
291 }
292 }
293
294 /* Free up the stream pointer. */
295 free(sp);
296 return (0);
297}
298
299/*
300 * Special case of "/" at the end of the path so that slashes aren't
301 * appended which would cause paths to be written as "....//foo".
302 */
303#define NAPPEND(p) \
304 (p->fts_path[p->fts_pathlen - 1] == '/' \
305 ? p->fts_pathlen - 1 : p->fts_pathlen)
306
307FTSENT *
308fts_read(sp)
309 FTS *sp;
310{
311 FTSENT *p, *tmp;
312 int instr;
313 char *t;
314 int saved_errno;
315
316 /* If finished or unrecoverable error, return NULL. */
317 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
318 return (NULL);
319
320 /* Set current node pointer. */
321 p = sp->fts_cur;
322
323 /* Save and zero out user instructions. */
324 instr = p->fts_instr;
325 p->fts_instr = FTS_NOINSTR;
326
327 /* Any type of file may be re-visited; re-stat and re-turn. */
328 if (instr == FTS_AGAIN) {
329 p->fts_info = fts_stat(sp, p, 0);
330 return (p);
331 }
332
333 /*
334 * Following a symlink -- SLNONE test allows application to see
335 * SLNONE and recover. If indirecting through a symlink, have
336 * keep a pointer to current location. If unable to get that
337 * pointer, follow fails.
338 */
339 if (instr == FTS_FOLLOW &&
340 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
341 p->fts_info = fts_stat(sp, p, 1);
342 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
343 if ((p->fts_symfd = _open(".", O_RDONLY, 0)) < 0) {
344 p->fts_errno = errno;
345 p->fts_info = FTS_ERR;
346 } else
347 p->fts_flags |= FTS_SYMFOLLOW;
348 }
349 return (p);
350 }
351
352 /* Directory in pre-order. */
353 if (p->fts_info == FTS_D) {
354 /* If skipped or crossed mount point, do post-order visit. */
355 if (instr == FTS_SKIP ||
356 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
357 if (p->fts_flags & FTS_SYMFOLLOW)
358 (void)_close(p->fts_symfd);
359 if (sp->fts_child) {
360 fts_lfree(sp->fts_child);
361 sp->fts_child = NULL;
362 }
363 p->fts_info = FTS_DP;
364 return (p);
365 }
366
367 /* Rebuild if only read the names and now traversing. */
368 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
369 CLR(FTS_NAMEONLY);
370 fts_lfree(sp->fts_child);
371 sp->fts_child = NULL;
372 }
373
374 /*
375 * Cd to the subdirectory.
376 *
377 * If have already read and now fail to chdir, whack the list
378 * to make the names come out right, and set the parent errno
379 * so the application will eventually get an error condition.
380 * Set the FTS_DONTCHDIR flag so that when we logically change
381 * directories back to the parent we don't do a chdir.
382 *
383 * If haven't read do so. If the read fails, fts_build sets
384 * FTS_STOP or the fts_info field of the node.
385 */
386 if (sp->fts_child != NULL) {
387 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
388 p->fts_errno = errno;
389 p->fts_flags |= FTS_DONTCHDIR;
390 for (p = sp->fts_child; p != NULL;
391 p = p->fts_link)
392 p->fts_accpath =
393 p->fts_parent->fts_accpath;
394 }
395 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
396 if (ISSET(FTS_STOP))
397 return (NULL);
398 return (p);
399 }
400 p = sp->fts_child;
401 sp->fts_child = NULL;
402 goto name;
403 }
404
405 /* Move to the next node on this level. */
406next: tmp = p;
407 if ((p = p->fts_link) != NULL) {
408 free(tmp);
409
410 /*
411 * If reached the top, return to the original directory (or
412 * the root of the tree), and load the paths for the next root.
413 */
414 if (p->fts_level == FTS_ROOTLEVEL) {
415 if (FCHDIR(sp, sp->fts_rfd)) {
416 SET(FTS_STOP);
417 return (NULL);
418 }
419 fts_load(sp, p);
420 return (sp->fts_cur = p);
421 }
422
423 /*
424 * User may have called fts_set on the node. If skipped,
425 * ignore. If followed, get a file descriptor so we can
426 * get back if necessary.
427 */
428 if (p->fts_instr == FTS_SKIP)
429 goto next;
430 if (p->fts_instr == FTS_FOLLOW) {
431 p->fts_info = fts_stat(sp, p, 1);
432 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
433 if ((p->fts_symfd =
434 _open(".", O_RDONLY, 0)) < 0) {
435 p->fts_errno = errno;
436 p->fts_info = FTS_ERR;
437 } else
438 p->fts_flags |= FTS_SYMFOLLOW;
439 }
440 p->fts_instr = FTS_NOINSTR;
441 }
442
443name: t = sp->fts_path + NAPPEND(p->fts_parent);
444 *t++ = '/';
445 memmove(t, p->fts_name, p->fts_namelen + 1);
446 return (sp->fts_cur = p);
447 }
448
449 /* Move up to the parent node. */
450 p = tmp->fts_parent;
451 free(tmp);
452
453 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
454 /*
455 * Done; free everything up and set errno to 0 so the user
456 * can distinguish between error and EOF.
457 */
458 free(p);
459 errno = 0;
460 return (sp->fts_cur = NULL);
461 }
462
463 /* NUL terminate the pathname. */
464 sp->fts_path[p->fts_pathlen] = '\0';
465
466 /*
467 * Return to the parent directory. If at a root node or came through
468 * a symlink, go back through the file descriptor. Otherwise, cd up
469 * one directory.
470 */
471 if (p->fts_level == FTS_ROOTLEVEL) {
472 if (FCHDIR(sp, sp->fts_rfd)) {
473 SET(FTS_STOP);
474 return (NULL);
475 }
476 } else if (p->fts_flags & FTS_SYMFOLLOW) {
477 if (FCHDIR(sp, p->fts_symfd)) {
478 saved_errno = errno;
479 (void)_close(p->fts_symfd);
480 errno = saved_errno;
481 SET(FTS_STOP);
482 return (NULL);
483 }
484 (void)_close(p->fts_symfd);
485 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
486 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
487 SET(FTS_STOP);
488 return (NULL);
489 }
490 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
491 return (sp->fts_cur = p);
492}
493
494/*
495 * Fts_set takes the stream as an argument although it's not used in this
496 * implementation; it would be necessary if anyone wanted to add global
497 * semantics to fts using fts_set. An error return is allowed for similar
498 * reasons.
499 */
500/* ARGSUSED */
501int
502fts_set(sp, p, instr)
503 FTS *sp;
504 FTSENT *p;
505 int instr;
506{
507 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
508 instr != FTS_NOINSTR && instr != FTS_SKIP) {
509 errno = EINVAL;
510 return (1);
511 }
512 p->fts_instr = instr;
513 return (0);
514}
515
516FTSENT *
517fts_children(sp, instr)
518 FTS *sp;
519 int instr;
520{
521 FTSENT *p;
522 int fd;
523
524 if (instr != 0 && instr != FTS_NAMEONLY) {
525 errno = EINVAL;
526 return (NULL);
527 }
528
529 /* Set current node pointer. */
530 p = sp->fts_cur;
531
532 /*
533 * Errno set to 0 so user can distinguish empty directory from
534 * an error.
535 */
536 errno = 0;
537
538 /* Fatal errors stop here. */
539 if (ISSET(FTS_STOP))
540 return (NULL);
541
542 /* Return logical hierarchy of user's arguments. */
543 if (p->fts_info == FTS_INIT)
544 return (p->fts_link);
545
546 /*
547 * If not a directory being visited in pre-order, stop here. Could
548 * allow FTS_DNR, assuming the user has fixed the problem, but the
549 * same effect is available with FTS_AGAIN.
550 */
551 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
552 return (NULL);
553
554 /* Free up any previous child list. */
555 if (sp->fts_child != NULL)
556 fts_lfree(sp->fts_child);
557
558 if (instr == FTS_NAMEONLY) {
559 SET(FTS_NAMEONLY);
560 instr = BNAMES;
561 } else
562 instr = BCHILD;
563
564 /*
565 * If using chdir on a relative path and called BEFORE fts_read does
566 * its chdir to the root of a traversal, we can lose -- we need to
567 * chdir into the subdirectory, and we don't know where the current
568 * directory is, so we can't get back so that the upcoming chdir by
569 * fts_read will work.
570 */
571 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
572 ISSET(FTS_NOCHDIR))
573 return (sp->fts_child = fts_build(sp, instr));
574
575 if ((fd = _open(".", O_RDONLY, 0)) < 0)
576 return (NULL);
577 sp->fts_child = fts_build(sp, instr);
578 if (fchdir(fd))
579 return (NULL);
580 (void)_close(fd);
581 return (sp->fts_child);
582}
583
584#ifndef fts_get_clientptr
585#error "fts_get_clientptr not defined"
586#endif
587
588void *
589(fts_get_clientptr)(FTS *sp)
590{
591
592 return (fts_get_clientptr(sp));
593}
594
595#ifndef fts_get_stream
596#error "fts_get_stream not defined"
597#endif
598
599FTS *
600(fts_get_stream)(FTSENT *p)
601{
602 return (fts_get_stream(p));
603}
604
605void
606fts_set_clientptr(FTS *sp, void *clientptr)
607{
608
609 sp->fts_clientptr = clientptr;
610}
611
612/*
613 * This is the tricky part -- do not casually change *anything* in here. The
614 * idea is to build the linked list of entries that are used by fts_children
615 * and fts_read. There are lots of special cases.
616 *
617 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
618 * set and it's a physical walk (so that symbolic links can't be directories),
619 * we can do things quickly. First, if it's a 4.4BSD file system, the type
620 * of the file is in the directory entry. Otherwise, we assume that the number
621 * of subdirectories in a node is equal to the number of links to the parent.
622 * The former skips all stat calls. The latter skips stat calls in any leaf
623 * directories and for any files after the subdirectories in the directory have
624 * been found, cutting the stat calls by about 2/3.
625 */
626static FTSENT *
627fts_build(sp, type)
628 FTS *sp;
629 int type;
630{
631 struct dirent *dp;
632 FTSENT *p, *head;
633 int nitems;
634 FTSENT *cur, *tail;
635 DIR *dirp;
636 void *oldaddr;
637 size_t dnamlen;
638 int cderrno, descend, len, level, maxlen, nlinks, oflag, saved_errno,
639 nostat, doadjust;
640 char *cp;
641
642 /* Set current node pointer. */
643 cur = sp->fts_cur;
644
645 /*
646 * Open the directory for reading. If this fails, we're done.
647 * If being called from fts_read, set the fts_info field.
648 */
649#ifdef FTS_WHITEOUT
650 if (ISSET(FTS_WHITEOUT))
651 oflag = DTF_NODUP|DTF_REWIND;
652 else
653 oflag = DTF_HIDEW|DTF_NODUP|DTF_REWIND;
654#else
655#define __opendir2(path, flag) opendir(path)
656#endif
657 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
658 if (type == BREAD) {
659 cur->fts_info = FTS_DNR;
660 cur->fts_errno = errno;
661 }
662 return (NULL);
663 }
664
665 /*
666 * Nlinks is the number of possible entries of type directory in the
667 * directory if we're cheating on stat calls, 0 if we're not doing
668 * any stat calls at all, -1 if we're doing stats on everything.
669 */
670 if (type == BNAMES) {
671 nlinks = 0;
672 /* Be quiet about nostat, GCC. */
673 nostat = 0;
674 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
675 if (fts_ufslinks(sp, cur))
676 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
677 else
678 nlinks = -1;
679 nostat = 1;
680 } else {
681 nlinks = -1;
682 nostat = 0;
683 }
684
685#ifdef notdef
686 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
687 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
688 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
689#endif
690 /*
691 * If we're going to need to stat anything or we want to descend
692 * and stay in the directory, chdir. If this fails we keep going,
693 * but set a flag so we don't chdir after the post-order visit.
694 * We won't be able to stat anything, but we can still return the
695 * names themselves. Note, that since fts_read won't be able to
696 * chdir into the directory, it will have to return different path
697 * names than before, i.e. "a/b" instead of "b". Since the node
698 * has already been visited in pre-order, have to wait until the
699 * post-order visit to return the error. There is a special case
700 * here, if there was nothing to stat then it's not an error to
701 * not be able to stat. This is all fairly nasty. If a program
702 * needed sorted entries or stat information, they had better be
703 * checking FTS_NS on the returned nodes.
704 */
705 cderrno = 0;
706 if (nlinks || type == BREAD) {
707 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
708 if (nlinks && type == BREAD)
709 cur->fts_errno = errno;
710 cur->fts_flags |= FTS_DONTCHDIR;
711 descend = 0;
712 cderrno = errno;
713 (void)closedir(dirp);
714 dirp = NULL;
715 } else
716 descend = 1;
717 } else
718 descend = 0;
719
720 /*
721 * Figure out the max file name length that can be stored in the
722 * current path -- the inner loop allocates more path as necessary.
723 * We really wouldn't have to do the maxlen calculations here, we
724 * could do them in fts_read before returning the path, but it's a
725 * lot easier here since the length is part of the dirent structure.
726 *
727 * If not changing directories set a pointer so that can just append
728 * each new name into the path.
729 */
730 len = NAPPEND(cur);
731 if (ISSET(FTS_NOCHDIR)) {
732 cp = sp->fts_path + len;
733 *cp++ = '/';
734 } else {
735 /* GCC, you're too verbose. */
736 cp = NULL;
737 }
738 len++;
739 maxlen = sp->fts_pathlen - len;
740
741 level = cur->fts_level + 1;
742
743 /* Read the directory, attaching each entry to the `link' pointer. */
744 doadjust = 0;
745 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
746 dnamlen = dp->d_namlen;
747 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
748 continue;
749
750 if ((p = fts_alloc(sp, dp->d_name, (int)dnamlen)) == NULL)
751 goto mem1;
752 if (dnamlen >= maxlen) { /* include space for NUL */
753 oldaddr = sp->fts_path;
754 if (fts_palloc(sp, dnamlen + len + 1)) {
755 /*
756 * No more memory for path or structures. Save
757 * errno, free up the current structure and the
758 * structures already allocated.
759 */
760mem1: saved_errno = errno;
761 if (p)
762 free(p);
763 fts_lfree(head);
764 (void)closedir(dirp);
765 cur->fts_info = FTS_ERR;
766 SET(FTS_STOP);
767 errno = saved_errno;
768 return (NULL);
769 }
770 /* Did realloc() change the pointer? */
771 if (oldaddr != sp->fts_path) {
772 doadjust = 1;
773 if (ISSET(FTS_NOCHDIR))
774 cp = sp->fts_path + len;
775 }
776 maxlen = sp->fts_pathlen - len;
777 }
778
779 if (len + dnamlen >= USHRT_MAX) {
780 /*
781 * In an FTSENT, fts_pathlen is a u_short so it is
782 * possible to wraparound here. If we do, free up
783 * the current structure and the structures already
784 * allocated, then error out with ENAMETOOLONG.
785 */
786 free(p);
787 fts_lfree(head);
788 (void)closedir(dirp);
789 cur->fts_info = FTS_ERR;
790 SET(FTS_STOP);
791 errno = ENAMETOOLONG;
792 return (NULL);
793 }
794 p->fts_level = level;
795 p->fts_parent = sp->fts_cur;
796 p->fts_pathlen = len + dnamlen;
797
798#ifdef FTS_WHITEOUT
799 if (dp->d_type == DT_WHT)
800 p->fts_flags |= FTS_ISW;
801#endif
802
803 if (cderrno) {
804 if (nlinks) {
805 p->fts_info = FTS_NS;
806 p->fts_errno = cderrno;
807 } else
808 p->fts_info = FTS_NSOK;
809 p->fts_accpath = cur->fts_accpath;
810 } else if (nlinks == 0
811#ifdef DT_DIR
812 || (nostat &&
813 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
814#endif
815 ) {
816 p->fts_accpath =
817 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
818 p->fts_info = FTS_NSOK;
819 } else {
820 /* Build a file name for fts_stat to stat. */
821 if (ISSET(FTS_NOCHDIR)) {
822 p->fts_accpath = p->fts_path;
823 memmove(cp, p->fts_name, p->fts_namelen + 1);
824 } else
825 p->fts_accpath = p->fts_name;
826 /* Stat it. */
827 p->fts_info = fts_stat(sp, p, 0);
828
829 /* Decrement link count if applicable. */
830 if (nlinks > 0 && (p->fts_info == FTS_D ||
831 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
832 --nlinks;
833 }
834
835 /* We walk in directory order so "ls -f" doesn't get upset. */
836 p->fts_link = NULL;
837 if (head == NULL)
838 head = tail = p;
839 else {
840 tail->fts_link = p;
841 tail = p;
842 }
843 ++nitems;
844 }
845 if (dirp)
846 (void)closedir(dirp);
847
848 /*
849 * If realloc() changed the address of the path, adjust the
850 * addresses for the rest of the tree and the dir list.
851 */
852 if (doadjust)
853 fts_padjust(sp, head);
854
855 /*
856 * If not changing directories, reset the path back to original
857 * state.
858 */
859 if (ISSET(FTS_NOCHDIR)) {
860 if (len == sp->fts_pathlen || nitems == 0)
861 --cp;
862 *cp = '\0';
863 }
864
865 /*
866 * If descended after called from fts_children or after called from
867 * fts_read and nothing found, get back. At the root level we use
868 * the saved fd; if one of fts_open()'s arguments is a relative path
869 * to an empty directory, we wind up here with no other way back. If
870 * can't get back, we're done.
871 */
872 if (descend && (type == BCHILD || !nitems) &&
873 (cur->fts_level == FTS_ROOTLEVEL ?
874 FCHDIR(sp, sp->fts_rfd) :
875 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
876 cur->fts_info = FTS_ERR;
877 SET(FTS_STOP);
878 return (NULL);
879 }
880
881 /* If didn't find anything, return NULL. */
882 if (!nitems) {
883 if (type == BREAD)
884 cur->fts_info = FTS_DP;
885 return (NULL);
886 }
887
888 /* Sort the entries. */
889 if (sp->fts_compar && nitems > 1)
890 head = fts_sort(sp, head, nitems);
891 return (head);
892}
893
894static u_short
895fts_stat(sp, p, follow)
896 FTS *sp;
897 FTSENT *p;
898 int follow;
899{
900 FTSENT *t;
901 dev_t dev;
902 ino_t ino;
903 struct stat *sbp, sb;
904 int saved_errno;
905
906 /* If user needs stat info, stat buffer already allocated. */
907 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
908
909#ifdef FTS_WHITEOUT
910 /* check for whiteout */
911 if (p->fts_flags & FTS_ISW) {
912 if (sbp != &sb) {
913 memset(sbp, '\0', sizeof (*sbp));
914 sbp->st_mode = S_IFWHT;
915 }
916 return (FTS_W);
917 }
918#endif
919
920 /*
921 * If doing a logical walk, or application requested FTS_FOLLOW, do
922 * a stat(2). If that fails, check for a non-existent symlink. If
923 * fail, set the errno from the stat call.
924 */
925 if (ISSET(FTS_LOGICAL) || follow) {
926 if (stat(p->fts_accpath, sbp)) {
927 saved_errno = errno;
928 if (!lstat(p->fts_accpath, sbp)) {
929 errno = 0;
930 return (FTS_SLNONE);
931 }
932 p->fts_errno = saved_errno;
933 goto err;
934 }
935 } else if (lstat(p->fts_accpath, sbp)) {
936 p->fts_errno = errno;
937err: memset(sbp, 0, sizeof(struct stat));
938 return (FTS_NS);
939 }
940
941 if (S_ISDIR(sbp->st_mode)) {
942 /*
943 * Set the device/inode. Used to find cycles and check for
944 * crossing mount points. Also remember the link count, used
945 * in fts_build to limit the number of stat calls. It is
946 * understood that these fields are only referenced if fts_info
947 * is set to FTS_D.
948 */
949 dev = p->fts_dev = sbp->st_dev;
950 ino = p->fts_ino = sbp->st_ino;
951 p->fts_nlink = sbp->st_nlink;
952
953 if (ISDOT(p->fts_name))
954 return (FTS_DOT);
955
956 /*
957 * Cycle detection is done by brute force when the directory
958 * is first encountered. If the tree gets deep enough or the
959 * number of symbolic links to directories is high enough,
960 * something faster might be worthwhile.
961 */
962 for (t = p->fts_parent;
963 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
964 if (ino == t->fts_ino && dev == t->fts_dev) {
965 p->fts_cycle = t;
966 return (FTS_DC);
967 }
968 return (FTS_D);
969 }
970 if (S_ISLNK(sbp->st_mode))
971 return (FTS_SL);
972 if (S_ISREG(sbp->st_mode))
973 return (FTS_F);
974 return (FTS_DEFAULT);
975}
976
977/*
978 * The comparison function takes pointers to pointers to FTSENT structures.
979 * Qsort wants a comparison function that takes pointers to void.
980 * (Both with appropriate levels of const-poisoning, of course!)
981 * Use a trampoline function to deal with the difference.
982 */
983static int
984fts_compar(const void *a, const void *b)
985{
986 FTS *parent;
987
988 parent = (*(const FTSENT * const *)a)->fts_fts;
989 return (*parent->fts_compar)(a, b);
990}
991
992static FTSENT *
993fts_sort(sp, head, nitems)
994 FTS *sp;
995 FTSENT *head;
996 int nitems;
997{
998 FTSENT **ap, *p;
999
1000 /*
1001 * Construct an array of pointers to the structures and call qsort(3).
1002 * Reassemble the array in the order returned by qsort. If unable to
1003 * sort for memory reasons, return the directory entries in their
1004 * current order. Allocate enough space for the current needs plus
1005 * 40 so don't realloc one entry at a time.
1006 */
1007 if (nitems > sp->fts_nitems) {
1008 sp->fts_nitems = nitems + 40;
1009 if ((sp->fts_array = reallocf(sp->fts_array,
1010 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
1011 sp->fts_nitems = 0;
1012 return (head);
1013 }
1014 }
1015 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
1016 *ap++ = p;
1017 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
1018 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1019 ap[0]->fts_link = ap[1];
1020 ap[0]->fts_link = NULL;
1021 return (head);
1022}
1023
1024static FTSENT *
1025fts_alloc(sp, name, namelen)
1026 FTS *sp;
1027 char *name;
1028 int namelen;
1029{
1030 FTSENT *p;
1031 size_t len;
1032
1033 struct ftsent_withstat {
1034 FTSENT ent;
1035 struct stat statbuf;
1036 };
1037
1038 /*
1039 * The file name is a variable length array and no stat structure is
1040 * necessary if the user has set the nostat bit. Allocate the FTSENT
1041 * structure, the file name and the stat structure in one chunk, but
1042 * be careful that the stat structure is reasonably aligned.
1043 */
1044 if (ISSET(FTS_NOSTAT))
1045 len = sizeof(FTSENT) + namelen + 1;
1046 else
1047 len = sizeof(struct ftsent_withstat) + namelen + 1;
1048
1049 if ((p = malloc(len)) == NULL)
1050 return (NULL);
1051
1052 if (ISSET(FTS_NOSTAT)) {
1053 p->fts_name = (char *)(p + 1);
1054 p->fts_statp = NULL;
1055 } else {
1056 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1057 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1058 }
1059
1060 /* Copy the name and guarantee NUL termination. */
1061 memcpy(p->fts_name, name, namelen);
1062 p->fts_name[namelen] = '\0';
1063 p->fts_namelen = namelen;
1064 p->fts_path = sp->fts_path;
1065 p->fts_errno = 0;
1066 p->fts_flags = 0;
1067 p->fts_instr = FTS_NOINSTR;
1068 p->fts_number = 0;
1069 p->fts_pointer = NULL;
1070 p->fts_fts = sp;
1071 return (p);
1072}
1073
1074static void
1075fts_lfree(head)
1076 FTSENT *head;
1077{
1078 FTSENT *p;
1079
1080 /* Free a linked list of structures. */
1081 while ((p = head)) {
1082 head = head->fts_link;
1083 free(p);
1084 }
1085}
1086
1087/*
1088 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1089 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1090 * though the kernel won't resolve them. Add the size (not just what's needed)
1091 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1092 */
1093static int
1094fts_palloc(sp, more)
1095 FTS *sp;
1096 size_t more;
1097{
1098
1099 sp->fts_pathlen += more + 256;
1100 /*
1101 * Check for possible wraparound. In an FTS, fts_pathlen is
1102 * a signed int but in an FTSENT it is an unsigned short.
1103 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1104 */
1105 if (sp->fts_pathlen < 0 || sp->fts_pathlen >= USHRT_MAX) {
1106 if (sp->fts_path)
1107 free(sp->fts_path);
1108 sp->fts_path = NULL;
1109 errno = ENAMETOOLONG;
1110 return (1);
1111 }
1112 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1113 return (sp->fts_path == NULL);
1114}
1115
1116/*
1117 * When the path is realloc'd, have to fix all of the pointers in structures
1118 * already returned.
1119 */
1120static void
1121fts_padjust(sp, head)
1122 FTS *sp;
1123 FTSENT *head;
1124{
1125 FTSENT *p;
1126 char *addr = sp->fts_path;
1127
1128#define ADJUST(p) do { \
1129 if ((p)->fts_accpath != (p)->fts_name) { \
1130 (p)->fts_accpath = \
1131 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1132 } \
1133 (p)->fts_path = addr; \
1134} while (0)
1135 /* Adjust the current set of children. */
1136 for (p = sp->fts_child; p; p = p->fts_link)
1137 ADJUST(p);
1138
1139 /* Adjust the rest of the tree, including the current level. */
1140 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1141 ADJUST(p);
1142 p = p->fts_link ? p->fts_link : p->fts_parent;
1143 }
1144}
1145
1146static size_t
1147fts_maxarglen(argv)
1148 char * const *argv;
1149{
1150 size_t len, max;
1151
1152 for (max = 0; *argv; ++argv)
1153 if ((len = strlen(*argv)) > max)
1154 max = len;
1155 return (max + 1);
1156}
1157
1158/*
1159 * Change to dir specified by fd or p->fts_accpath without getting
1160 * tricked by someone changing the world out from underneath us.
1161 * Assumes p->fts_dev and p->fts_ino are filled in.
1162 */
1163static int
1164fts_safe_changedir(sp, p, fd, path)
1165 FTS *sp;
1166 FTSENT *p;
1167 int fd;
1168 char *path;
1169{
1170 int ret, oerrno, newfd;
1171 struct stat sb;
1172
1173 newfd = fd;
1174 if (ISSET(FTS_NOCHDIR))
1175 return (0);
1176 if (fd < 0 && (newfd = _open(path, O_RDONLY, 0)) < 0)
1177 return (-1);
1178 if (_fstat(newfd, &sb)) {
1179 ret = -1;
1180 goto bail;
1181 }
1182 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1183 errno = ENOENT; /* disinformation */
1184 ret = -1;
1185 goto bail;
1186 }
1187 ret = fchdir(newfd);
1188bail:
1189 oerrno = errno;
1190 if (fd < 0)
1191 (void)_close(newfd);
1192 errno = oerrno;
1193 return (ret);
1194}
1195
1196/*
1197 * Check if the filesystem for "ent" has UFS-style links.
1198 */
1199static int
1200fts_ufslinks(FTS *sp, const FTSENT *ent)
1201{
1202 struct _fts_private *priv;
1203 const char **cpp;
1204
| 136
137 /* Shush, GCC. */
138 tmp = NULL;
139
140 /* Logical walks turn on NOCHDIR; symbolic links are too hard. */
141 if (ISSET(FTS_LOGICAL))
142 SET(FTS_NOCHDIR);
143
144 /*
145 * Start out with 1K of path space, and enough, in any case,
146 * to hold the user's paths.
147 */
148 if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))
149 goto mem1;
150
151 /* Allocate/initialize root's parent. */
152 if ((parent = fts_alloc(sp, "", 0)) == NULL)
153 goto mem2;
154 parent->fts_level = FTS_ROOTPARENTLEVEL;
155
156 /* Allocate/initialize root(s). */
157 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {
158 /* Don't allow zero-length paths. */
159 if ((len = strlen(*argv)) == 0) {
160 errno = ENOENT;
161 goto mem3;
162 }
163
164 p = fts_alloc(sp, *argv, len);
165 p->fts_level = FTS_ROOTLEVEL;
166 p->fts_parent = parent;
167 p->fts_accpath = p->fts_name;
168 p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));
169
170 /* Command-line "." and ".." are real directories. */
171 if (p->fts_info == FTS_DOT)
172 p->fts_info = FTS_D;
173
174 /*
175 * If comparison routine supplied, traverse in sorted
176 * order; otherwise traverse in the order specified.
177 */
178 if (compar) {
179 p->fts_link = root;
180 root = p;
181 } else {
182 p->fts_link = NULL;
183 if (root == NULL)
184 tmp = root = p;
185 else {
186 tmp->fts_link = p;
187 tmp = p;
188 }
189 }
190 }
191 if (compar && nitems > 1)
192 root = fts_sort(sp, root, nitems);
193
194 /*
195 * Allocate a dummy pointer and make fts_read think that we've just
196 * finished the node before the root(s); set p->fts_info to FTS_INIT
197 * so that everything about the "current" node is ignored.
198 */
199 if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)
200 goto mem3;
201 sp->fts_cur->fts_link = root;
202 sp->fts_cur->fts_info = FTS_INIT;
203
204 /*
205 * If using chdir(2), grab a file descriptor pointing to dot to ensure
206 * that we can get back here; this could be avoided for some paths,
207 * but almost certainly not worth the effort. Slashes, symbolic links,
208 * and ".." are all fairly nasty problems. Note, if we can't get the
209 * descriptor we run anyway, just more slowly.
210 */
211 if (!ISSET(FTS_NOCHDIR) && (sp->fts_rfd = _open(".", O_RDONLY, 0)) < 0)
212 SET(FTS_NOCHDIR);
213
214 return (sp);
215
216mem3: fts_lfree(root);
217 free(parent);
218mem2: free(sp->fts_path);
219mem1: free(sp);
220 return (NULL);
221}
222
223static void
224fts_load(sp, p)
225 FTS *sp;
226 FTSENT *p;
227{
228 int len;
229 char *cp;
230
231 /*
232 * Load the stream structure for the next traversal. Since we don't
233 * actually enter the directory until after the preorder visit, set
234 * the fts_accpath field specially so the chdir gets done to the right
235 * place and the user can access the first node. From fts_open it's
236 * known that the path will fit.
237 */
238 len = p->fts_pathlen = p->fts_namelen;
239 memmove(sp->fts_path, p->fts_name, len + 1);
240 if ((cp = strrchr(p->fts_name, '/')) && (cp != p->fts_name || cp[1])) {
241 len = strlen(++cp);
242 memmove(p->fts_name, cp, len + 1);
243 p->fts_namelen = len;
244 }
245 p->fts_accpath = p->fts_path = sp->fts_path;
246 sp->fts_dev = p->fts_dev;
247}
248
249int
250fts_close(sp)
251 FTS *sp;
252{
253 FTSENT *freep, *p;
254 int saved_errno;
255
256 /*
257 * This still works if we haven't read anything -- the dummy structure
258 * points to the root list, so we step through to the end of the root
259 * list which has a valid parent pointer.
260 */
261 if (sp->fts_cur) {
262 for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {
263 freep = p;
264 p = p->fts_link != NULL ? p->fts_link : p->fts_parent;
265 free(freep);
266 }
267 free(p);
268 }
269
270 /* Free up child linked list, sort array, path buffer. */
271 if (sp->fts_child)
272 fts_lfree(sp->fts_child);
273 if (sp->fts_array)
274 free(sp->fts_array);
275 free(sp->fts_path);
276
277 /* Return to original directory, save errno if necessary. */
278 if (!ISSET(FTS_NOCHDIR)) {
279 saved_errno = fchdir(sp->fts_rfd) ? errno : 0;
280 (void)_close(sp->fts_rfd);
281
282 /* Set errno and return. */
283 if (saved_errno != 0) {
284 /* Free up the stream pointer. */
285 free(sp);
286 errno = saved_errno;
287 return (-1);
288 }
289 }
290
291 /* Free up the stream pointer. */
292 free(sp);
293 return (0);
294}
295
296/*
297 * Special case of "/" at the end of the path so that slashes aren't
298 * appended which would cause paths to be written as "....//foo".
299 */
300#define NAPPEND(p) \
301 (p->fts_path[p->fts_pathlen - 1] == '/' \
302 ? p->fts_pathlen - 1 : p->fts_pathlen)
303
304FTSENT *
305fts_read(sp)
306 FTS *sp;
307{
308 FTSENT *p, *tmp;
309 int instr;
310 char *t;
311 int saved_errno;
312
313 /* If finished or unrecoverable error, return NULL. */
314 if (sp->fts_cur == NULL || ISSET(FTS_STOP))
315 return (NULL);
316
317 /* Set current node pointer. */
318 p = sp->fts_cur;
319
320 /* Save and zero out user instructions. */
321 instr = p->fts_instr;
322 p->fts_instr = FTS_NOINSTR;
323
324 /* Any type of file may be re-visited; re-stat and re-turn. */
325 if (instr == FTS_AGAIN) {
326 p->fts_info = fts_stat(sp, p, 0);
327 return (p);
328 }
329
330 /*
331 * Following a symlink -- SLNONE test allows application to see
332 * SLNONE and recover. If indirecting through a symlink, have
333 * keep a pointer to current location. If unable to get that
334 * pointer, follow fails.
335 */
336 if (instr == FTS_FOLLOW &&
337 (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {
338 p->fts_info = fts_stat(sp, p, 1);
339 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
340 if ((p->fts_symfd = _open(".", O_RDONLY, 0)) < 0) {
341 p->fts_errno = errno;
342 p->fts_info = FTS_ERR;
343 } else
344 p->fts_flags |= FTS_SYMFOLLOW;
345 }
346 return (p);
347 }
348
349 /* Directory in pre-order. */
350 if (p->fts_info == FTS_D) {
351 /* If skipped or crossed mount point, do post-order visit. */
352 if (instr == FTS_SKIP ||
353 (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {
354 if (p->fts_flags & FTS_SYMFOLLOW)
355 (void)_close(p->fts_symfd);
356 if (sp->fts_child) {
357 fts_lfree(sp->fts_child);
358 sp->fts_child = NULL;
359 }
360 p->fts_info = FTS_DP;
361 return (p);
362 }
363
364 /* Rebuild if only read the names and now traversing. */
365 if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {
366 CLR(FTS_NAMEONLY);
367 fts_lfree(sp->fts_child);
368 sp->fts_child = NULL;
369 }
370
371 /*
372 * Cd to the subdirectory.
373 *
374 * If have already read and now fail to chdir, whack the list
375 * to make the names come out right, and set the parent errno
376 * so the application will eventually get an error condition.
377 * Set the FTS_DONTCHDIR flag so that when we logically change
378 * directories back to the parent we don't do a chdir.
379 *
380 * If haven't read do so. If the read fails, fts_build sets
381 * FTS_STOP or the fts_info field of the node.
382 */
383 if (sp->fts_child != NULL) {
384 if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {
385 p->fts_errno = errno;
386 p->fts_flags |= FTS_DONTCHDIR;
387 for (p = sp->fts_child; p != NULL;
388 p = p->fts_link)
389 p->fts_accpath =
390 p->fts_parent->fts_accpath;
391 }
392 } else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {
393 if (ISSET(FTS_STOP))
394 return (NULL);
395 return (p);
396 }
397 p = sp->fts_child;
398 sp->fts_child = NULL;
399 goto name;
400 }
401
402 /* Move to the next node on this level. */
403next: tmp = p;
404 if ((p = p->fts_link) != NULL) {
405 free(tmp);
406
407 /*
408 * If reached the top, return to the original directory (or
409 * the root of the tree), and load the paths for the next root.
410 */
411 if (p->fts_level == FTS_ROOTLEVEL) {
412 if (FCHDIR(sp, sp->fts_rfd)) {
413 SET(FTS_STOP);
414 return (NULL);
415 }
416 fts_load(sp, p);
417 return (sp->fts_cur = p);
418 }
419
420 /*
421 * User may have called fts_set on the node. If skipped,
422 * ignore. If followed, get a file descriptor so we can
423 * get back if necessary.
424 */
425 if (p->fts_instr == FTS_SKIP)
426 goto next;
427 if (p->fts_instr == FTS_FOLLOW) {
428 p->fts_info = fts_stat(sp, p, 1);
429 if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {
430 if ((p->fts_symfd =
431 _open(".", O_RDONLY, 0)) < 0) {
432 p->fts_errno = errno;
433 p->fts_info = FTS_ERR;
434 } else
435 p->fts_flags |= FTS_SYMFOLLOW;
436 }
437 p->fts_instr = FTS_NOINSTR;
438 }
439
440name: t = sp->fts_path + NAPPEND(p->fts_parent);
441 *t++ = '/';
442 memmove(t, p->fts_name, p->fts_namelen + 1);
443 return (sp->fts_cur = p);
444 }
445
446 /* Move up to the parent node. */
447 p = tmp->fts_parent;
448 free(tmp);
449
450 if (p->fts_level == FTS_ROOTPARENTLEVEL) {
451 /*
452 * Done; free everything up and set errno to 0 so the user
453 * can distinguish between error and EOF.
454 */
455 free(p);
456 errno = 0;
457 return (sp->fts_cur = NULL);
458 }
459
460 /* NUL terminate the pathname. */
461 sp->fts_path[p->fts_pathlen] = '\0';
462
463 /*
464 * Return to the parent directory. If at a root node or came through
465 * a symlink, go back through the file descriptor. Otherwise, cd up
466 * one directory.
467 */
468 if (p->fts_level == FTS_ROOTLEVEL) {
469 if (FCHDIR(sp, sp->fts_rfd)) {
470 SET(FTS_STOP);
471 return (NULL);
472 }
473 } else if (p->fts_flags & FTS_SYMFOLLOW) {
474 if (FCHDIR(sp, p->fts_symfd)) {
475 saved_errno = errno;
476 (void)_close(p->fts_symfd);
477 errno = saved_errno;
478 SET(FTS_STOP);
479 return (NULL);
480 }
481 (void)_close(p->fts_symfd);
482 } else if (!(p->fts_flags & FTS_DONTCHDIR) &&
483 fts_safe_changedir(sp, p->fts_parent, -1, "..")) {
484 SET(FTS_STOP);
485 return (NULL);
486 }
487 p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;
488 return (sp->fts_cur = p);
489}
490
491/*
492 * Fts_set takes the stream as an argument although it's not used in this
493 * implementation; it would be necessary if anyone wanted to add global
494 * semantics to fts using fts_set. An error return is allowed for similar
495 * reasons.
496 */
497/* ARGSUSED */
498int
499fts_set(sp, p, instr)
500 FTS *sp;
501 FTSENT *p;
502 int instr;
503{
504 if (instr != 0 && instr != FTS_AGAIN && instr != FTS_FOLLOW &&
505 instr != FTS_NOINSTR && instr != FTS_SKIP) {
506 errno = EINVAL;
507 return (1);
508 }
509 p->fts_instr = instr;
510 return (0);
511}
512
513FTSENT *
514fts_children(sp, instr)
515 FTS *sp;
516 int instr;
517{
518 FTSENT *p;
519 int fd;
520
521 if (instr != 0 && instr != FTS_NAMEONLY) {
522 errno = EINVAL;
523 return (NULL);
524 }
525
526 /* Set current node pointer. */
527 p = sp->fts_cur;
528
529 /*
530 * Errno set to 0 so user can distinguish empty directory from
531 * an error.
532 */
533 errno = 0;
534
535 /* Fatal errors stop here. */
536 if (ISSET(FTS_STOP))
537 return (NULL);
538
539 /* Return logical hierarchy of user's arguments. */
540 if (p->fts_info == FTS_INIT)
541 return (p->fts_link);
542
543 /*
544 * If not a directory being visited in pre-order, stop here. Could
545 * allow FTS_DNR, assuming the user has fixed the problem, but the
546 * same effect is available with FTS_AGAIN.
547 */
548 if (p->fts_info != FTS_D /* && p->fts_info != FTS_DNR */)
549 return (NULL);
550
551 /* Free up any previous child list. */
552 if (sp->fts_child != NULL)
553 fts_lfree(sp->fts_child);
554
555 if (instr == FTS_NAMEONLY) {
556 SET(FTS_NAMEONLY);
557 instr = BNAMES;
558 } else
559 instr = BCHILD;
560
561 /*
562 * If using chdir on a relative path and called BEFORE fts_read does
563 * its chdir to the root of a traversal, we can lose -- we need to
564 * chdir into the subdirectory, and we don't know where the current
565 * directory is, so we can't get back so that the upcoming chdir by
566 * fts_read will work.
567 */
568 if (p->fts_level != FTS_ROOTLEVEL || p->fts_accpath[0] == '/' ||
569 ISSET(FTS_NOCHDIR))
570 return (sp->fts_child = fts_build(sp, instr));
571
572 if ((fd = _open(".", O_RDONLY, 0)) < 0)
573 return (NULL);
574 sp->fts_child = fts_build(sp, instr);
575 if (fchdir(fd))
576 return (NULL);
577 (void)_close(fd);
578 return (sp->fts_child);
579}
580
581#ifndef fts_get_clientptr
582#error "fts_get_clientptr not defined"
583#endif
584
585void *
586(fts_get_clientptr)(FTS *sp)
587{
588
589 return (fts_get_clientptr(sp));
590}
591
592#ifndef fts_get_stream
593#error "fts_get_stream not defined"
594#endif
595
596FTS *
597(fts_get_stream)(FTSENT *p)
598{
599 return (fts_get_stream(p));
600}
601
602void
603fts_set_clientptr(FTS *sp, void *clientptr)
604{
605
606 sp->fts_clientptr = clientptr;
607}
608
609/*
610 * This is the tricky part -- do not casually change *anything* in here. The
611 * idea is to build the linked list of entries that are used by fts_children
612 * and fts_read. There are lots of special cases.
613 *
614 * The real slowdown in walking the tree is the stat calls. If FTS_NOSTAT is
615 * set and it's a physical walk (so that symbolic links can't be directories),
616 * we can do things quickly. First, if it's a 4.4BSD file system, the type
617 * of the file is in the directory entry. Otherwise, we assume that the number
618 * of subdirectories in a node is equal to the number of links to the parent.
619 * The former skips all stat calls. The latter skips stat calls in any leaf
620 * directories and for any files after the subdirectories in the directory have
621 * been found, cutting the stat calls by about 2/3.
622 */
623static FTSENT *
624fts_build(sp, type)
625 FTS *sp;
626 int type;
627{
628 struct dirent *dp;
629 FTSENT *p, *head;
630 int nitems;
631 FTSENT *cur, *tail;
632 DIR *dirp;
633 void *oldaddr;
634 size_t dnamlen;
635 int cderrno, descend, len, level, maxlen, nlinks, oflag, saved_errno,
636 nostat, doadjust;
637 char *cp;
638
639 /* Set current node pointer. */
640 cur = sp->fts_cur;
641
642 /*
643 * Open the directory for reading. If this fails, we're done.
644 * If being called from fts_read, set the fts_info field.
645 */
646#ifdef FTS_WHITEOUT
647 if (ISSET(FTS_WHITEOUT))
648 oflag = DTF_NODUP|DTF_REWIND;
649 else
650 oflag = DTF_HIDEW|DTF_NODUP|DTF_REWIND;
651#else
652#define __opendir2(path, flag) opendir(path)
653#endif
654 if ((dirp = __opendir2(cur->fts_accpath, oflag)) == NULL) {
655 if (type == BREAD) {
656 cur->fts_info = FTS_DNR;
657 cur->fts_errno = errno;
658 }
659 return (NULL);
660 }
661
662 /*
663 * Nlinks is the number of possible entries of type directory in the
664 * directory if we're cheating on stat calls, 0 if we're not doing
665 * any stat calls at all, -1 if we're doing stats on everything.
666 */
667 if (type == BNAMES) {
668 nlinks = 0;
669 /* Be quiet about nostat, GCC. */
670 nostat = 0;
671 } else if (ISSET(FTS_NOSTAT) && ISSET(FTS_PHYSICAL)) {
672 if (fts_ufslinks(sp, cur))
673 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2);
674 else
675 nlinks = -1;
676 nostat = 1;
677 } else {
678 nlinks = -1;
679 nostat = 0;
680 }
681
682#ifdef notdef
683 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink);
684 (void)printf("NOSTAT %d PHYSICAL %d SEEDOT %d\n",
685 ISSET(FTS_NOSTAT), ISSET(FTS_PHYSICAL), ISSET(FTS_SEEDOT));
686#endif
687 /*
688 * If we're going to need to stat anything or we want to descend
689 * and stay in the directory, chdir. If this fails we keep going,
690 * but set a flag so we don't chdir after the post-order visit.
691 * We won't be able to stat anything, but we can still return the
692 * names themselves. Note, that since fts_read won't be able to
693 * chdir into the directory, it will have to return different path
694 * names than before, i.e. "a/b" instead of "b". Since the node
695 * has already been visited in pre-order, have to wait until the
696 * post-order visit to return the error. There is a special case
697 * here, if there was nothing to stat then it's not an error to
698 * not be able to stat. This is all fairly nasty. If a program
699 * needed sorted entries or stat information, they had better be
700 * checking FTS_NS on the returned nodes.
701 */
702 cderrno = 0;
703 if (nlinks || type == BREAD) {
704 if (fts_safe_changedir(sp, cur, dirfd(dirp), NULL)) {
705 if (nlinks && type == BREAD)
706 cur->fts_errno = errno;
707 cur->fts_flags |= FTS_DONTCHDIR;
708 descend = 0;
709 cderrno = errno;
710 (void)closedir(dirp);
711 dirp = NULL;
712 } else
713 descend = 1;
714 } else
715 descend = 0;
716
717 /*
718 * Figure out the max file name length that can be stored in the
719 * current path -- the inner loop allocates more path as necessary.
720 * We really wouldn't have to do the maxlen calculations here, we
721 * could do them in fts_read before returning the path, but it's a
722 * lot easier here since the length is part of the dirent structure.
723 *
724 * If not changing directories set a pointer so that can just append
725 * each new name into the path.
726 */
727 len = NAPPEND(cur);
728 if (ISSET(FTS_NOCHDIR)) {
729 cp = sp->fts_path + len;
730 *cp++ = '/';
731 } else {
732 /* GCC, you're too verbose. */
733 cp = NULL;
734 }
735 len++;
736 maxlen = sp->fts_pathlen - len;
737
738 level = cur->fts_level + 1;
739
740 /* Read the directory, attaching each entry to the `link' pointer. */
741 doadjust = 0;
742 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
743 dnamlen = dp->d_namlen;
744 if (!ISSET(FTS_SEEDOT) && ISDOT(dp->d_name))
745 continue;
746
747 if ((p = fts_alloc(sp, dp->d_name, (int)dnamlen)) == NULL)
748 goto mem1;
749 if (dnamlen >= maxlen) { /* include space for NUL */
750 oldaddr = sp->fts_path;
751 if (fts_palloc(sp, dnamlen + len + 1)) {
752 /*
753 * No more memory for path or structures. Save
754 * errno, free up the current structure and the
755 * structures already allocated.
756 */
757mem1: saved_errno = errno;
758 if (p)
759 free(p);
760 fts_lfree(head);
761 (void)closedir(dirp);
762 cur->fts_info = FTS_ERR;
763 SET(FTS_STOP);
764 errno = saved_errno;
765 return (NULL);
766 }
767 /* Did realloc() change the pointer? */
768 if (oldaddr != sp->fts_path) {
769 doadjust = 1;
770 if (ISSET(FTS_NOCHDIR))
771 cp = sp->fts_path + len;
772 }
773 maxlen = sp->fts_pathlen - len;
774 }
775
776 if (len + dnamlen >= USHRT_MAX) {
777 /*
778 * In an FTSENT, fts_pathlen is a u_short so it is
779 * possible to wraparound here. If we do, free up
780 * the current structure and the structures already
781 * allocated, then error out with ENAMETOOLONG.
782 */
783 free(p);
784 fts_lfree(head);
785 (void)closedir(dirp);
786 cur->fts_info = FTS_ERR;
787 SET(FTS_STOP);
788 errno = ENAMETOOLONG;
789 return (NULL);
790 }
791 p->fts_level = level;
792 p->fts_parent = sp->fts_cur;
793 p->fts_pathlen = len + dnamlen;
794
795#ifdef FTS_WHITEOUT
796 if (dp->d_type == DT_WHT)
797 p->fts_flags |= FTS_ISW;
798#endif
799
800 if (cderrno) {
801 if (nlinks) {
802 p->fts_info = FTS_NS;
803 p->fts_errno = cderrno;
804 } else
805 p->fts_info = FTS_NSOK;
806 p->fts_accpath = cur->fts_accpath;
807 } else if (nlinks == 0
808#ifdef DT_DIR
809 || (nostat &&
810 dp->d_type != DT_DIR && dp->d_type != DT_UNKNOWN)
811#endif
812 ) {
813 p->fts_accpath =
814 ISSET(FTS_NOCHDIR) ? p->fts_path : p->fts_name;
815 p->fts_info = FTS_NSOK;
816 } else {
817 /* Build a file name for fts_stat to stat. */
818 if (ISSET(FTS_NOCHDIR)) {
819 p->fts_accpath = p->fts_path;
820 memmove(cp, p->fts_name, p->fts_namelen + 1);
821 } else
822 p->fts_accpath = p->fts_name;
823 /* Stat it. */
824 p->fts_info = fts_stat(sp, p, 0);
825
826 /* Decrement link count if applicable. */
827 if (nlinks > 0 && (p->fts_info == FTS_D ||
828 p->fts_info == FTS_DC || p->fts_info == FTS_DOT))
829 --nlinks;
830 }
831
832 /* We walk in directory order so "ls -f" doesn't get upset. */
833 p->fts_link = NULL;
834 if (head == NULL)
835 head = tail = p;
836 else {
837 tail->fts_link = p;
838 tail = p;
839 }
840 ++nitems;
841 }
842 if (dirp)
843 (void)closedir(dirp);
844
845 /*
846 * If realloc() changed the address of the path, adjust the
847 * addresses for the rest of the tree and the dir list.
848 */
849 if (doadjust)
850 fts_padjust(sp, head);
851
852 /*
853 * If not changing directories, reset the path back to original
854 * state.
855 */
856 if (ISSET(FTS_NOCHDIR)) {
857 if (len == sp->fts_pathlen || nitems == 0)
858 --cp;
859 *cp = '\0';
860 }
861
862 /*
863 * If descended after called from fts_children or after called from
864 * fts_read and nothing found, get back. At the root level we use
865 * the saved fd; if one of fts_open()'s arguments is a relative path
866 * to an empty directory, we wind up here with no other way back. If
867 * can't get back, we're done.
868 */
869 if (descend && (type == BCHILD || !nitems) &&
870 (cur->fts_level == FTS_ROOTLEVEL ?
871 FCHDIR(sp, sp->fts_rfd) :
872 fts_safe_changedir(sp, cur->fts_parent, -1, ".."))) {
873 cur->fts_info = FTS_ERR;
874 SET(FTS_STOP);
875 return (NULL);
876 }
877
878 /* If didn't find anything, return NULL. */
879 if (!nitems) {
880 if (type == BREAD)
881 cur->fts_info = FTS_DP;
882 return (NULL);
883 }
884
885 /* Sort the entries. */
886 if (sp->fts_compar && nitems > 1)
887 head = fts_sort(sp, head, nitems);
888 return (head);
889}
890
891static u_short
892fts_stat(sp, p, follow)
893 FTS *sp;
894 FTSENT *p;
895 int follow;
896{
897 FTSENT *t;
898 dev_t dev;
899 ino_t ino;
900 struct stat *sbp, sb;
901 int saved_errno;
902
903 /* If user needs stat info, stat buffer already allocated. */
904 sbp = ISSET(FTS_NOSTAT) ? &sb : p->fts_statp;
905
906#ifdef FTS_WHITEOUT
907 /* check for whiteout */
908 if (p->fts_flags & FTS_ISW) {
909 if (sbp != &sb) {
910 memset(sbp, '\0', sizeof (*sbp));
911 sbp->st_mode = S_IFWHT;
912 }
913 return (FTS_W);
914 }
915#endif
916
917 /*
918 * If doing a logical walk, or application requested FTS_FOLLOW, do
919 * a stat(2). If that fails, check for a non-existent symlink. If
920 * fail, set the errno from the stat call.
921 */
922 if (ISSET(FTS_LOGICAL) || follow) {
923 if (stat(p->fts_accpath, sbp)) {
924 saved_errno = errno;
925 if (!lstat(p->fts_accpath, sbp)) {
926 errno = 0;
927 return (FTS_SLNONE);
928 }
929 p->fts_errno = saved_errno;
930 goto err;
931 }
932 } else if (lstat(p->fts_accpath, sbp)) {
933 p->fts_errno = errno;
934err: memset(sbp, 0, sizeof(struct stat));
935 return (FTS_NS);
936 }
937
938 if (S_ISDIR(sbp->st_mode)) {
939 /*
940 * Set the device/inode. Used to find cycles and check for
941 * crossing mount points. Also remember the link count, used
942 * in fts_build to limit the number of stat calls. It is
943 * understood that these fields are only referenced if fts_info
944 * is set to FTS_D.
945 */
946 dev = p->fts_dev = sbp->st_dev;
947 ino = p->fts_ino = sbp->st_ino;
948 p->fts_nlink = sbp->st_nlink;
949
950 if (ISDOT(p->fts_name))
951 return (FTS_DOT);
952
953 /*
954 * Cycle detection is done by brute force when the directory
955 * is first encountered. If the tree gets deep enough or the
956 * number of symbolic links to directories is high enough,
957 * something faster might be worthwhile.
958 */
959 for (t = p->fts_parent;
960 t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent)
961 if (ino == t->fts_ino && dev == t->fts_dev) {
962 p->fts_cycle = t;
963 return (FTS_DC);
964 }
965 return (FTS_D);
966 }
967 if (S_ISLNK(sbp->st_mode))
968 return (FTS_SL);
969 if (S_ISREG(sbp->st_mode))
970 return (FTS_F);
971 return (FTS_DEFAULT);
972}
973
974/*
975 * The comparison function takes pointers to pointers to FTSENT structures.
976 * Qsort wants a comparison function that takes pointers to void.
977 * (Both with appropriate levels of const-poisoning, of course!)
978 * Use a trampoline function to deal with the difference.
979 */
980static int
981fts_compar(const void *a, const void *b)
982{
983 FTS *parent;
984
985 parent = (*(const FTSENT * const *)a)->fts_fts;
986 return (*parent->fts_compar)(a, b);
987}
988
989static FTSENT *
990fts_sort(sp, head, nitems)
991 FTS *sp;
992 FTSENT *head;
993 int nitems;
994{
995 FTSENT **ap, *p;
996
997 /*
998 * Construct an array of pointers to the structures and call qsort(3).
999 * Reassemble the array in the order returned by qsort. If unable to
1000 * sort for memory reasons, return the directory entries in their
1001 * current order. Allocate enough space for the current needs plus
1002 * 40 so don't realloc one entry at a time.
1003 */
1004 if (nitems > sp->fts_nitems) {
1005 sp->fts_nitems = nitems + 40;
1006 if ((sp->fts_array = reallocf(sp->fts_array,
1007 sp->fts_nitems * sizeof(FTSENT *))) == NULL) {
1008 sp->fts_nitems = 0;
1009 return (head);
1010 }
1011 }
1012 for (ap = sp->fts_array, p = head; p; p = p->fts_link)
1013 *ap++ = p;
1014 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);
1015 for (head = *(ap = sp->fts_array); --nitems; ++ap)
1016 ap[0]->fts_link = ap[1];
1017 ap[0]->fts_link = NULL;
1018 return (head);
1019}
1020
1021static FTSENT *
1022fts_alloc(sp, name, namelen)
1023 FTS *sp;
1024 char *name;
1025 int namelen;
1026{
1027 FTSENT *p;
1028 size_t len;
1029
1030 struct ftsent_withstat {
1031 FTSENT ent;
1032 struct stat statbuf;
1033 };
1034
1035 /*
1036 * The file name is a variable length array and no stat structure is
1037 * necessary if the user has set the nostat bit. Allocate the FTSENT
1038 * structure, the file name and the stat structure in one chunk, but
1039 * be careful that the stat structure is reasonably aligned.
1040 */
1041 if (ISSET(FTS_NOSTAT))
1042 len = sizeof(FTSENT) + namelen + 1;
1043 else
1044 len = sizeof(struct ftsent_withstat) + namelen + 1;
1045
1046 if ((p = malloc(len)) == NULL)
1047 return (NULL);
1048
1049 if (ISSET(FTS_NOSTAT)) {
1050 p->fts_name = (char *)(p + 1);
1051 p->fts_statp = NULL;
1052 } else {
1053 p->fts_name = (char *)((struct ftsent_withstat *)p + 1);
1054 p->fts_statp = &((struct ftsent_withstat *)p)->statbuf;
1055 }
1056
1057 /* Copy the name and guarantee NUL termination. */
1058 memcpy(p->fts_name, name, namelen);
1059 p->fts_name[namelen] = '\0';
1060 p->fts_namelen = namelen;
1061 p->fts_path = sp->fts_path;
1062 p->fts_errno = 0;
1063 p->fts_flags = 0;
1064 p->fts_instr = FTS_NOINSTR;
1065 p->fts_number = 0;
1066 p->fts_pointer = NULL;
1067 p->fts_fts = sp;
1068 return (p);
1069}
1070
1071static void
1072fts_lfree(head)
1073 FTSENT *head;
1074{
1075 FTSENT *p;
1076
1077 /* Free a linked list of structures. */
1078 while ((p = head)) {
1079 head = head->fts_link;
1080 free(p);
1081 }
1082}
1083
1084/*
1085 * Allow essentially unlimited paths; find, rm, ls should all work on any tree.
1086 * Most systems will allow creation of paths much longer than MAXPATHLEN, even
1087 * though the kernel won't resolve them. Add the size (not just what's needed)
1088 * plus 256 bytes so don't realloc the path 2 bytes at a time.
1089 */
1090static int
1091fts_palloc(sp, more)
1092 FTS *sp;
1093 size_t more;
1094{
1095
1096 sp->fts_pathlen += more + 256;
1097 /*
1098 * Check for possible wraparound. In an FTS, fts_pathlen is
1099 * a signed int but in an FTSENT it is an unsigned short.
1100 * We limit fts_pathlen to USHRT_MAX to be safe in both cases.
1101 */
1102 if (sp->fts_pathlen < 0 || sp->fts_pathlen >= USHRT_MAX) {
1103 if (sp->fts_path)
1104 free(sp->fts_path);
1105 sp->fts_path = NULL;
1106 errno = ENAMETOOLONG;
1107 return (1);
1108 }
1109 sp->fts_path = reallocf(sp->fts_path, sp->fts_pathlen);
1110 return (sp->fts_path == NULL);
1111}
1112
1113/*
1114 * When the path is realloc'd, have to fix all of the pointers in structures
1115 * already returned.
1116 */
1117static void
1118fts_padjust(sp, head)
1119 FTS *sp;
1120 FTSENT *head;
1121{
1122 FTSENT *p;
1123 char *addr = sp->fts_path;
1124
1125#define ADJUST(p) do { \
1126 if ((p)->fts_accpath != (p)->fts_name) { \
1127 (p)->fts_accpath = \
1128 (char *)addr + ((p)->fts_accpath - (p)->fts_path); \
1129 } \
1130 (p)->fts_path = addr; \
1131} while (0)
1132 /* Adjust the current set of children. */
1133 for (p = sp->fts_child; p; p = p->fts_link)
1134 ADJUST(p);
1135
1136 /* Adjust the rest of the tree, including the current level. */
1137 for (p = head; p->fts_level >= FTS_ROOTLEVEL;) {
1138 ADJUST(p);
1139 p = p->fts_link ? p->fts_link : p->fts_parent;
1140 }
1141}
1142
1143static size_t
1144fts_maxarglen(argv)
1145 char * const *argv;
1146{
1147 size_t len, max;
1148
1149 for (max = 0; *argv; ++argv)
1150 if ((len = strlen(*argv)) > max)
1151 max = len;
1152 return (max + 1);
1153}
1154
1155/*
1156 * Change to dir specified by fd or p->fts_accpath without getting
1157 * tricked by someone changing the world out from underneath us.
1158 * Assumes p->fts_dev and p->fts_ino are filled in.
1159 */
1160static int
1161fts_safe_changedir(sp, p, fd, path)
1162 FTS *sp;
1163 FTSENT *p;
1164 int fd;
1165 char *path;
1166{
1167 int ret, oerrno, newfd;
1168 struct stat sb;
1169
1170 newfd = fd;
1171 if (ISSET(FTS_NOCHDIR))
1172 return (0);
1173 if (fd < 0 && (newfd = _open(path, O_RDONLY, 0)) < 0)
1174 return (-1);
1175 if (_fstat(newfd, &sb)) {
1176 ret = -1;
1177 goto bail;
1178 }
1179 if (p->fts_dev != sb.st_dev || p->fts_ino != sb.st_ino) {
1180 errno = ENOENT; /* disinformation */
1181 ret = -1;
1182 goto bail;
1183 }
1184 ret = fchdir(newfd);
1185bail:
1186 oerrno = errno;
1187 if (fd < 0)
1188 (void)_close(newfd);
1189 errno = oerrno;
1190 return (ret);
1191}
1192
1193/*
1194 * Check if the filesystem for "ent" has UFS-style links.
1195 */
1196static int
1197fts_ufslinks(FTS *sp, const FTSENT *ent)
1198{
1199 struct _fts_private *priv;
1200 const char **cpp;
1201
|