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