[apple/libc.git] / gen / FreeBSD / scandir.c

/*
 * Copyright (c) 1983, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)scandir.c	8.3 (Berkeley) 1/2/94";
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
__FBSDID("$FreeBSD: src/lib/libc/gen/scandir.c,v 1.9 2008/03/16 19:08:53 das Exp $");

/*
 * Scan the directory dirname calling select to make a list of selected
 * directory entries then sort using qsort and compare routine dcomp.
 * Returns the number of entries and a pointer to a list of pointers to
 * struct dirent (through namelist). Returns -1 if there were any errors.
 */

#include "namespace.h"
#include <dirent.h>
#include <stdlib.h>
#include <string.h>
#include "un-namespace.h"

/*
 * The DIRSIZ macro is the minimum record length which will hold the directory
 * entry.  This requires the amount of space in struct dirent without the
 * d_name field, plus enough space for the name and a terminating nul byte
 * (dp->d_namlen + 1), rounded up to a 4 byte boundary.
 */
#undef DIRSIZ
#define DIRSIZ(dp)							\
	((sizeof(struct dirent) - sizeof(dp)->d_name) +			\
	    (((dp)->d_namlen + 1 + 3) &~ 3))

int
scandir(dirname, namelist, select, dcomp)
	const char *dirname;
	struct dirent ***namelist;
	int (*select)(struct dirent *);
	int (*dcomp)(const void *, const void *);
{
	struct dirent *d, *p, **names = NULL;
	size_t nitems = 0;
	long arraysz;
	DIR *dirp;

	if ((dirp = opendir(dirname)) == NULL)
		return(-1);

	arraysz = 32;	/* initial estimate of the array size */
	names = (struct dirent **)malloc(arraysz * sizeof(struct dirent *));
	if (names == NULL)
		goto fail;

	while ((d = readdir(dirp)) != NULL) {
		if (select != NULL && !(*select)(d))
			continue;	/* just selected names */
		/*
		 * Make a minimum size copy of the data
		 */
		p = (struct dirent *)malloc(DIRSIZ(d));
		if (p == NULL)
			goto fail;
		p->d_fileno = d->d_fileno;
		p->d_type = d->d_type;
		p->d_reclen = d->d_reclen;
		p->d_namlen = d->d_namlen;
		bcopy(d->d_name, p->d_name, p->d_namlen + 1);
		/*
		 * Check to make sure the array has space left and
		 * realloc the maximum size.
		 */
		if (nitems >= arraysz) {
			struct dirent **names2;

			names2 = (struct dirent **)realloc((char *)names,
				(arraysz * 2) * sizeof(struct dirent *));
			if (names2 == NULL) {
				free(p);
				goto fail;
			}
			names = names2;
			arraysz *= 2;
		}
		names[nitems++] = p;
	}
	closedir(dirp);
	if (nitems && dcomp != NULL)
		qsort(names, nitems, sizeof(struct dirent *), dcomp);
	*namelist = names;
	return(nitems);

fail:
	while (nitems > 0)
		free(names[--nitems]);
	free(names);
	closedir(dirp);
	return -1;
}

/*
 * Alphabetic order comparison routine for those who want it.
 */
int
alphasort(d1, d2)
	const void *d1;
	const void *d2;
{
	return(strcmp((*(struct dirent **)d1)->d_name,
	    (*(struct dirent **)d2)->d_name));
}
Commit	Line	Data
e9ce8d39 A	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.
e9ce8d39 A	13	* 4. 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
9385eb3d A	30	#if defined(LIBC_SCCS) && !defined(lint)
	31	static char sccsid[] = "@(#)scandir.c 8.3 (Berkeley) 1/2/94";
	32	#endif /* LIBC_SCCS and not lint */
	33	#include <sys/cdefs.h>
1f2f436a	34	__FBSDID("$FreeBSD: src/lib/libc/gen/scandir.c,v 1.9 2008/03/16 19:08:53 das Exp $");
e9ce8d39 A	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
9385eb3d	43	#include "namespace.h"
e9ce8d39 A	44	#include <dirent.h>
	45	#include <stdlib.h>
	46	#include <string.h>
9385eb3d	47	#include "un-namespace.h"
e9ce8d39 A	48
	49	/*
	50	* The DIRSIZ macro is the minimum record length which will hold the directory
	51	* entry. This requires the amount of space in struct dirent without the
	52	* d_name field, plus enough space for the name and a terminating nul byte
	53	* (dp->d_namlen + 1), rounded up to a 4 byte boundary.
	54	*/
	55	#undef DIRSIZ
	56	#define DIRSIZ(dp) \
	57	((sizeof(struct dirent) - sizeof(dp)->d_name) + \
	58	(((dp)->d_namlen + 1 + 3) &~ 3))
	59
	60	int
	61	scandir(dirname, namelist, select, dcomp)
	62	const char *dirname;
	63	struct dirent ***namelist;
9385eb3d A	64	int (select)(struct dirent );
9385eb3d A	65	int (dcomp)(const void , const void *);
e9ce8d39	66	{
9385eb3d A	67	struct dirent d, p, **names = NULL;
9385eb3d A	68	size_t nitems = 0;
e9ce8d39 A	69	long arraysz;
	70	DIR *dirp;
	71
	72	if ((dirp = opendir(dirname)) == NULL)
	73	return(-1);
e9ce8d39	74
1f2f436a	75	arraysz = 32; /* initial estimate of the array size */
e9ce8d39 A	76	names = (struct dirent *)malloc(arraysz sizeof(struct dirent *));
e9ce8d39 A	77	if (names == NULL)
9385eb3d	78	goto fail;
e9ce8d39	79
e9ce8d39 A	80	while ((d = readdir(dirp)) != NULL) {
	81	if (select != NULL && !(*select)(d))
	82	continue; /* just selected names */
	83	/*
	84	* Make a minimum size copy of the data
	85	*/
	86	p = (struct dirent *)malloc(DIRSIZ(d));
	87	if (p == NULL)
9385eb3d A	88	goto fail;
	89	p->d_fileno = d->d_fileno;
	90	p->d_type = d->d_type;
e9ce8d39 A	91	p->d_reclen = d->d_reclen;
	92	p->d_namlen = d->d_namlen;
	93	bcopy(d->d_name, p->d_name, p->d_namlen + 1);
	94	/*
	95	* Check to make sure the array has space left and
	96	* realloc the maximum size.
	97	*/
9385eb3d	98	if (nitems >= arraysz) {
9385eb3d A	99	struct dirent **names2;
	100
	101	names2 = (struct dirent *)realloc((char )names,
1f2f436a	102	(arraysz * 2) * sizeof(struct dirent *));
9385eb3d A	103	if (names2 == NULL) {
	104	free(p);
	105	goto fail;
	106	}
	107	names = names2;
1f2f436a	108	arraysz *= 2;
e9ce8d39	109	}
9385eb3d	110	names[nitems++] = p;
e9ce8d39 A	111	}
	112	closedir(dirp);
	113	if (nitems && dcomp != NULL)
	114	qsort(names, nitems, sizeof(struct dirent *), dcomp);
	115	*namelist = names;
	116	return(nitems);
9385eb3d A	117
	118	fail:
	119	while (nitems > 0)
	120	free(names[--nitems]);
	121	free(names);
	122	closedir(dirp);
	123	return -1;
e9ce8d39 A	124	}
	125
	126	/*
	127	* Alphabetic order comparison routine for those who want it.
	128	*/
	129	int
	130	alphasort(d1, d2)
	131	const void *d1;
	132	const void *d2;
	133	{
	134	return(strcmp(((struct dirent *)d1)->d_name,
	135	((struct dirent *)d2)->d_name));
	136	}