2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 #if defined(LIBC_SCCS) && !defined(lint)
34 static char sccsid[] = "@(#)scandir.c 8.3 (Berkeley) 1/2/94";
35 #endif /* LIBC_SCCS and not lint */
36 #include <sys/cdefs.h>
37 __FBSDID("$FreeBSD$");
40 * Scan the directory dirname calling select to make a list of selected
41 * directory entries then sort using qsort and compare routine dcomp.
42 * Returns the number of entries and a pointer to a list of pointers to
43 * struct dirent (through namelist). Returns -1 if there were any errors.
46 #include "namespace.h"
47 #define _WANT_FREEBSD11_DIRENT
51 #include "un-namespace.h"
53 #include "gen-compat.h"
56 #include "block_abi.h"
57 #define SELECT(x) CALL_BLOCK(select, x)
60 qsort_b(void *, size_t, size_t, void*);
63 #define SELECT(x) select(x)
66 static int freebsd11_alphasort_thunk(void *thunk, const void *p1,
71 freebsd11_scandir_b(const char *dirname, struct freebsd11_dirent ***namelist,
72 DECLARE_BLOCK(int, select, const struct freebsd11_dirent *),
73 DECLARE_BLOCK(int, dcomp, const struct freebsd11_dirent **,
74 const struct freebsd11_dirent **))
76 freebsd11_scandir(const char *dirname, struct freebsd11_dirent ***namelist,
77 int (*select)(const struct freebsd11_dirent *),
78 int (*dcomp)(const struct freebsd11_dirent **,
79 const struct freebsd11_dirent **))
82 struct freebsd11_dirent *d, *p, **names = NULL;
83 size_t arraysz, numitems;
86 if ((dirp = opendir(dirname)) == NULL)
90 arraysz = 32; /* initial estimate of the array size */
91 names = (struct freebsd11_dirent **)malloc(
92 arraysz * sizeof(struct freebsd11_dirent *));
96 while ((d = freebsd11_readdir(dirp)) != NULL) {
97 if (select != NULL && !SELECT(d))
98 continue; /* just selected names */
100 * Make a minimum size copy of the data
102 p = (struct freebsd11_dirent *)malloc(FREEBSD11_DIRSIZ(d));
105 p->d_fileno = d->d_fileno;
106 p->d_type = d->d_type;
107 p->d_reclen = d->d_reclen;
108 p->d_namlen = d->d_namlen;
109 bcopy(d->d_name, p->d_name, p->d_namlen + 1);
111 * Check to make sure the array has space left and
112 * realloc the maximum size.
114 if (numitems >= arraysz) {
115 struct freebsd11_dirent **names2;
117 names2 = reallocarray(names, arraysz,
118 2 * sizeof(struct freebsd11_dirent *));
119 if (names2 == NULL) {
126 names[numitems++] = p;
129 if (numitems && dcomp != NULL)
130 #ifdef I_AM_SCANDIR_B
131 qsort_b(names, numitems, sizeof(struct freebsd11_dirent *),
134 qsort_r(names, numitems, sizeof(struct freebsd11_dirent *),
135 &dcomp, freebsd11_alphasort_thunk);
142 free(names[--numitems]);
149 * Alphabetic order comparison routine for those who want it.
150 * POSIX 2008 requires that alphasort() uses strcoll().
153 freebsd11_alphasort(const struct freebsd11_dirent **d1,
154 const struct freebsd11_dirent **d2)
157 return (strcoll((*d1)->d_name, (*d2)->d_name));
161 freebsd11_alphasort_thunk(void *thunk, const void *p1, const void *p2)
163 int (*dc)(const struct freebsd11_dirent **, const struct
164 freebsd11_dirent **);
166 dc = *(int (**)(const struct freebsd11_dirent **,
167 const struct freebsd11_dirent **))thunk;
168 return (dc((const struct freebsd11_dirent **)p1,
169 (const struct freebsd11_dirent **)p2));
172 __sym_compat(alphasort, freebsd11_alphasort, FBSD_1.0);
173 __sym_compat(scandir, freebsd11_scandir, FBSD_1.0);
174 __sym_compat(scandir_b, freebsd11_scandir_b, FBSD_1.4);