Home | History | Annotate | Line # | Download | only in gen
scandir.c revision 1.6.4.1 
      1 /*	$NetBSD: scandir.c,v 1.6.4.1 1996/09/16 18:40:34 jtc Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1983, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by the University of
     18  *	California, Berkeley and its contributors.
     19  * 4. Neither the name of the University nor the names of its contributors
     20  *    may be used to endorse or promote products derived from this software
     21  *    without specific prior written permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  * SUCH DAMAGE.
     34  */
     35 
     36 #if defined(LIBC_SCCS) && !defined(lint)
     37 #if 0
     38 static char sccsid[] = "@(#)scandir.c	8.3 (Berkeley) 1/2/94";
     39 #else
     40 static char rcsid[] = "$NetBSD: scandir.c,v 1.6.4.1 1996/09/16 18:40:34 jtc Exp $";
     41 #endif
     42 #endif /* LIBC_SCCS and not lint */
     43 
     44 /*
     45  * Scan the directory dirname calling select to make a list of selected
     46  * directory entries then sort using qsort and compare routine dcomp.
     47  * Returns the number of entries and a pointer to a list of pointers to
     48  * struct dirent (through namelist). Returns -1 if there were any errors.
     49  */
     50 
     51 #include "namespace.h"
     52 #include <sys/types.h>
     53 #include <sys/stat.h>
     54 #include <dirent.h>
     55 #include <stdlib.h>
     56 #include <string.h>
     57 
     58 #ifdef __weak_alias
     59 __weak_alias(scandir,_scandir);
     60 __weak_alias(alphasort,_alphasort);
     61 #endif
     62 
     63 /*
     64  * The DIRSIZ macro is the minimum record length which will hold the directory
     65  * entry.  This requires the amount of space in struct dirent without the
     66  * d_name field, plus enough space for the name and a terminating nul byte
     67  * (dp->d_namlen + 1), rounded up to a 4 byte boundary.
     68  */
     69 #undef DIRSIZ
     70 #define DIRSIZ(dp)							\
     71 	((sizeof(struct dirent) - sizeof(dp)->d_name) +			\
     72 	    (((dp)->d_namlen + 1 + 3) &~ 3))
     73 
     74 int
     75 scandir(dirname, namelist, select, dcomp)
     76 	const char *dirname;
     77 	struct dirent ***namelist;
     78 	int (*select) __P((struct dirent *));
     79 	int (*dcomp) __P((const void *, const void *));
     80 {
     81 	register struct dirent *d, *p, **names;
     82 	register size_t nitems;
     83 	struct stat stb;
     84 	long arraysz;
     85 	DIR *dirp;
     86 
     87 	if ((dirp = opendir(dirname)) == NULL)
     88 		return(-1);
     89 	if (fstat(dirp->dd_fd, &stb) < 0)
     90 		return(-1);
     91 
     92 	/*
     93 	 * estimate the array size by taking the size of the directory file
     94 	 * and dividing it by a multiple of the minimum size entry.
     95 	 */
     96 	arraysz = (stb.st_size / 24);
     97 	names = (struct dirent **)malloc(arraysz * sizeof(struct dirent *));
     98 	if (names == NULL)
     99 		return(-1);
    100 
    101 	nitems = 0;
    102 	while ((d = readdir(dirp)) != NULL) {
    103 		if (select != NULL && !(*select)(d))
    104 			continue;	/* just selected names */
    105 		/*
    106 		 * Make a minimum size copy of the data
    107 		 */
    108 		p = (struct dirent *)malloc(DIRSIZ(d));
    109 		if (p == NULL)
    110 			return(-1);
    111 		p->d_ino = d->d_ino;
    112 		p->d_reclen = d->d_reclen;
    113 		p->d_namlen = d->d_namlen;
    114 		bcopy(d->d_name, p->d_name, p->d_namlen + 1);
    115 		/*
    116 		 * Check to make sure the array has space left and
    117 		 * realloc the maximum size.
    118 		 */
    119 		if (++nitems >= arraysz) {
    120 			if (fstat(dirp->dd_fd, &stb) < 0)
    121 				return(-1);	/* just might have grown */
    122 			arraysz = stb.st_size / 12;
    123 			names = (struct dirent **)realloc((char *)names,
    124 				arraysz * sizeof(struct dirent *));
    125 			if (names == NULL)
    126 				return(-1);
    127 		}
    128 		names[nitems-1] = p;
    129 	}
    130 	closedir(dirp);
    131 	if (nitems && dcomp != NULL)
    132 		qsort(names, nitems, sizeof(struct dirent *), dcomp);
    133 	*namelist = names;
    134 	return(nitems);
    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