1 /* 2 * Copyright (c) 1983, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 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. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * From: @(#)scandir.c 8.3 (Berkeley) 1/2/94 30 * From: FreeBSD: head/lib/libc/gen/scandir.c 317372 2017-04-24 14:56:41Z pfg 31 */ 32 33 #include <sys/cdefs.h> 34 /* 35 * Scan the directory dirname calling select to make a list of selected 36 * directory entries then sort using qsort and compare routine dcomp. 37 * Returns the number of entries and a pointer to a list of pointers to 38 * struct dirent (through namelist). Returns -1 if there were any errors. 39 */ 40 41 #include "namespace.h" 42 #define _WANT_FREEBSD11_DIRENT 43 #include <dirent.h> 44 #include <stdlib.h> 45 #include <string.h> 46 #include "un-namespace.h" 47 48 #include "gen-compat.h" 49 50 /* 51 * scandir_b@FBSD_1.4 was never exported from libc.so.7 due to a 52 * mistake, so there is no use of exporting it now with some earlier 53 * symbol version. As result, we do not need to implement compat 54 * function freebsd11_scandir_b(). 55 */ 56 57 #define SELECT(x) select(x) 58 59 static int freebsd11_scandir_thunk_cmp(const void *p1, const void *p2, 60 void *thunk); 61 62 int 63 freebsd11_scandir(const char *dirname, struct freebsd11_dirent ***namelist, 64 int (*select)(const struct freebsd11_dirent *), 65 int (*dcomp)(const struct freebsd11_dirent **, 66 const struct freebsd11_dirent **)) 67 { 68 struct freebsd11_dirent *d, *p, **names = NULL; 69 size_t arraysz, numitems; 70 DIR *dirp; 71 72 if ((dirp = opendir(dirname)) == NULL) 73 return(-1); 74 75 numitems = 0; 76 arraysz = 32; /* initial estimate of the array size */ 77 names = (struct freebsd11_dirent **)malloc( 78 arraysz * sizeof(struct freebsd11_dirent *)); 79 if (names == NULL) 80 goto fail; 81 82 while ((d = freebsd11_readdir(dirp)) != NULL) { 83 if (select != NULL && !SELECT(d)) 84 continue; /* just selected names */ 85 /* 86 * Make a minimum size copy of the data 87 */ 88 p = (struct freebsd11_dirent *)malloc(FREEBSD11_DIRSIZ(d)); 89 if (p == NULL) 90 goto fail; 91 p->d_fileno = d->d_fileno; 92 p->d_type = d->d_type; 93 p->d_reclen = d->d_reclen; 94 p->d_namlen = d->d_namlen; 95 bcopy(d->d_name, p->d_name, p->d_namlen + 1); 96 /* 97 * Check to make sure the array has space left and 98 * realloc the maximum size. 99 */ 100 if (numitems >= arraysz) { 101 struct freebsd11_dirent **names2; 102 103 names2 = reallocarray(names, arraysz, 104 2 * sizeof(struct freebsd11_dirent *)); 105 if (names2 == NULL) { 106 free(p); 107 goto fail; 108 } 109 names = names2; 110 arraysz *= 2; 111 } 112 names[numitems++] = p; 113 } 114 closedir(dirp); 115 if (numitems && dcomp != NULL) 116 qsort_r(names, numitems, sizeof(struct freebsd11_dirent *), 117 freebsd11_scandir_thunk_cmp, &dcomp); 118 *namelist = names; 119 return (numitems); 120 121 fail: 122 while (numitems > 0) 123 free(names[--numitems]); 124 free(names); 125 closedir(dirp); 126 return (-1); 127 } 128 129 /* 130 * Alphabetic order comparison routine for those who want it. 131 * POSIX 2008 requires that alphasort() uses strcoll(). 132 */ 133 int 134 freebsd11_alphasort(const struct freebsd11_dirent **d1, 135 const struct freebsd11_dirent **d2) 136 { 137 138 return (strcoll((*d1)->d_name, (*d2)->d_name)); 139 } 140 141 static int 142 freebsd11_scandir_thunk_cmp(const void *p1, const void *p2, void *thunk) 143 { 144 int (*dc)(const struct freebsd11_dirent **, const struct 145 freebsd11_dirent **); 146 147 dc = *(int (**)(const struct freebsd11_dirent **, 148 const struct freebsd11_dirent **))thunk; 149 return (dc((const struct freebsd11_dirent **)p1, 150 (const struct freebsd11_dirent **)p2)); 151 } 152 153 __sym_compat(alphasort, freebsd11_alphasort, FBSD_1.0); 154 __sym_compat(scandir, freebsd11_scandir, FBSD_1.0); 155