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. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * $FreeBSD: src/lib/libc/gen/scandir.c,v 1.5.6.1 2001/03/05 09:52:13 obrien Exp $ 34 * $DragonFly: src/lib/libc/gen/scandir.c,v 1.3 2003/11/12 20:21:23 eirikn Exp $ 35 * 36 * @(#)scandir.c 8.3 (Berkeley) 1/2/94 37 */ 38 39 /* 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. 44 */ 45 46 #include <sys/types.h> 47 #include <sys/stat.h> 48 #include <dirent.h> 49 #include <stdlib.h> 50 #include <string.h> 51 52 /* 53 * The DIRSIZ macro is the minimum record length which will hold the directory 54 * entry. This requires the amount of space in struct dirent without the 55 * d_name field, plus enough space for the name and a terminating nul byte 56 * (dp->d_namlen + 1), rounded up to a 4 byte boundary. 57 */ 58 #undef DIRSIZ 59 #define DIRSIZ(dp) \ 60 ((sizeof(struct dirent) - sizeof(dp)->d_name) + \ 61 (((dp)->d_namlen + 1 + 3) &~ 3)) 62 63 int 64 scandir(dirname, namelist, select, dcomp) 65 const char *dirname; 66 struct dirent ***namelist; 67 int (*select) (struct dirent *); 68 int (*dcomp) (const void *, const void *); 69 { 70 register struct dirent *d, *p, **names = NULL; 71 register size_t nitems = 0; 72 struct stat stb; 73 long arraysz; 74 DIR *dirp; 75 76 if ((dirp = opendir(dirname)) == NULL) 77 return(-1); 78 if (fstat(dirp->dd_fd, &stb) < 0) 79 goto fail; 80 81 /* 82 * estimate the array size by taking the size of the directory file 83 * and dividing it by a multiple of the minimum size entry. 84 */ 85 arraysz = (stb.st_size / 24); 86 names = (struct dirent **)malloc(arraysz * sizeof(struct dirent *)); 87 if (names == NULL) 88 goto fail; 89 90 while ((d = readdir(dirp)) != NULL) { 91 if (select != NULL && !(*select)(d)) 92 continue; /* just selected names */ 93 /* 94 * Make a minimum size copy of the data 95 */ 96 p = (struct dirent *)malloc(DIRSIZ(d)); 97 if (p == NULL) 98 goto fail; 99 p->d_fileno = d->d_fileno; 100 p->d_type = d->d_type; 101 p->d_reclen = d->d_reclen; 102 p->d_namlen = d->d_namlen; 103 bcopy(d->d_name, p->d_name, p->d_namlen + 1); 104 /* 105 * Check to make sure the array has space left and 106 * realloc the maximum size. 107 */ 108 if (nitems >= arraysz) { 109 const int inc = 10; /* increase by this much */ 110 struct dirent **names2; 111 112 names2 = (struct dirent **)realloc((char *)names, 113 (arraysz + inc) * sizeof(struct dirent *)); 114 if (names2 == NULL) { 115 free(p); 116 goto fail; 117 } 118 names = names2; 119 arraysz += inc; 120 } 121 names[nitems++] = p; 122 } 123 closedir(dirp); 124 if (nitems && dcomp != NULL) 125 qsort(names, nitems, sizeof(struct dirent *), dcomp); 126 *namelist = names; 127 return(nitems); 128 129 fail: 130 while (nitems > 0) 131 free(names[--nitems]); 132 free(names); 133 closedir(dirp); 134 return -1; 135 } 136 137 /* 138 * Alphabetic order comparison routine for those who want it. 139 */ 140 int 141 alphasort(d1, d2) 142 const void *d1; 143 const void *d2; 144 { 145 return(strcmp((*(struct dirent **)d1)->d_name, 146 (*(struct dirent **)d2)->d_name)); 147 } 148