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 __FBSDID("$FreeBSD$"); 35 36 /* 37 * Scan the directory dirname calling select to make a list of selected 38 * directory entries then sort using qsort and compare routine dcomp. 39 * Returns the number of entries and a pointer to a list of pointers to 40 * struct dirent (through namelist). Returns -1 if there were any errors. 41 */ 42 43 #include "namespace.h" 44 #define _WANT_FREEBSD11_DIRENT 45 #include <dirent.h> 46 #include <stdlib.h> 47 #include <string.h> 48 #include "un-namespace.h" 49 50 #include "gen-compat.h" 51 52 /* 53 * scandir_b@FBSD_1.4 was never exported from libc.so.7 due to a 54 * mistake, so there is no use of exporting it now with some earlier 55 * symbol version. As result, we do not need to implement compat 56 * function freebsd11_scandir_b(). 57 */ 58 59 #define SELECT(x) select(x) 60 61 static int freebsd11_alphasort_thunk(void *thunk, const void *p1, 62 const void *p2); 63 64 int 65 freebsd11_scandir(const char *dirname, struct freebsd11_dirent ***namelist, 66 int (*select)(const struct freebsd11_dirent *), 67 int (*dcomp)(const struct freebsd11_dirent **, 68 const struct freebsd11_dirent **)) 69 { 70 struct freebsd11_dirent *d, *p, **names = NULL; 71 size_t arraysz, numitems; 72 DIR *dirp; 73 74 if ((dirp = opendir(dirname)) == NULL) 75 return(-1); 76 77 numitems = 0; 78 arraysz = 32; /* initial estimate of the array size */ 79 names = (struct freebsd11_dirent **)malloc( 80 arraysz * sizeof(struct freebsd11_dirent *)); 81 if (names == NULL) 82 goto fail; 83 84 while ((d = freebsd11_readdir(dirp)) != NULL) { 85 if (select != NULL && !SELECT(d)) 86 continue; /* just selected names */ 87 /* 88 * Make a minimum size copy of the data 89 */ 90 p = (struct freebsd11_dirent *)malloc(FREEBSD11_DIRSIZ(d)); 91 if (p == NULL) 92 goto fail; 93 p->d_fileno = d->d_fileno; 94 p->d_type = d->d_type; 95 p->d_reclen = d->d_reclen; 96 p->d_namlen = d->d_namlen; 97 bcopy(d->d_name, p->d_name, p->d_namlen + 1); 98 /* 99 * Check to make sure the array has space left and 100 * realloc the maximum size. 101 */ 102 if (numitems >= arraysz) { 103 struct freebsd11_dirent **names2; 104 105 names2 = reallocarray(names, arraysz, 106 2 * sizeof(struct freebsd11_dirent *)); 107 if (names2 == NULL) { 108 free(p); 109 goto fail; 110 } 111 names = names2; 112 arraysz *= 2; 113 } 114 names[numitems++] = p; 115 } 116 closedir(dirp); 117 if (numitems && dcomp != NULL) 118 qsort_r(names, numitems, sizeof(struct freebsd11_dirent *), 119 &dcomp, freebsd11_alphasort_thunk); 120 *namelist = names; 121 return (numitems); 122 123 fail: 124 while (numitems > 0) 125 free(names[--numitems]); 126 free(names); 127 closedir(dirp); 128 return (-1); 129 } 130 131 /* 132 * Alphabetic order comparison routine for those who want it. 133 * POSIX 2008 requires that alphasort() uses strcoll(). 134 */ 135 int 136 freebsd11_alphasort(const struct freebsd11_dirent **d1, 137 const struct freebsd11_dirent **d2) 138 { 139 140 return (strcoll((*d1)->d_name, (*d2)->d_name)); 141 } 142 143 static int 144 freebsd11_alphasort_thunk(void *thunk, const void *p1, const void *p2) 145 { 146 int (*dc)(const struct freebsd11_dirent **, const struct 147 freebsd11_dirent **); 148 149 dc = *(int (**)(const struct freebsd11_dirent **, 150 const struct freebsd11_dirent **))thunk; 151 return (dc((const struct freebsd11_dirent **)p1, 152 (const struct freebsd11_dirent **)p2)); 153 } 154 155 __sym_compat(alphasort, freebsd11_alphasort, FBSD_1.0); 156 __sym_compat(scandir, freebsd11_scandir, FBSD_1.0); 157