git.saurik.com Git - apple/libc.git/blame_incremental

... / ...

Commit	Line	Data
	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	* 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
	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>
	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	#include <dirent.h>
	45	#include <stdlib.h>
	46	#include <string.h>
	47	#include "un-namespace.h"
	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	#ifdef I_AM_SCANDIR_B
	62	scandir_b(const char dirname, struct dirent **namelist,
	63	int (^select)(const struct dirent *),
	64	int (^_dcomp)(const struct dirent , const struct dirent ))
	65	#else
	66	scandir(const char dirname, struct dirent **namelist,
	67	int (select)(const struct dirent ),
	68	int (_dcomp)(const struct dirent , const struct dirent *))
	69	#endif
	70	{
	71	struct dirent d, p, **names = NULL;
	72	size_t nitems = 0;
	73	long arraysz;
	74	DIR *dirp;
	75
	76	/* see <rdar://problem/10293482> */
	77	#ifdef I_AM_SCANDIR_B
	78	int (^dcomp)(const void , const void ) = (void *)_dcomp;
	79	#else
	80	int (dcomp)(const void , const void ) = (void )_dcomp;
	81	#endif
	82
	83	if ((dirp = opendir(dirname)) == NULL)
	84	return(-1);
	85
	86	arraysz = 32; /* initial estimate of the array size */
	87	names = (struct dirent *)malloc(arraysz sizeof(struct dirent *));
	88	if (names == NULL)
	89	goto fail;
	90
	91	while ((d = readdir(dirp)) != NULL) {
	92	if (select != NULL && !select(d))
	93	continue; /* just selected names */
	94	/*
	95	* Make a minimum size copy of the data
	96	*/
	97	p = (struct dirent *)malloc(DIRSIZ(d));
	98	if (p == NULL)
	99	goto fail;
	100	p->d_fileno = d->d_fileno;
	101	p->d_type = d->d_type;
	102	p->d_reclen = d->d_reclen;
	103	p->d_namlen = d->d_namlen;
	104	bcopy(d->d_name, p->d_name, p->d_namlen + 1);
	105	/*
	106	* Check to make sure the array has space left and
	107	* realloc the maximum size.
	108	*/
	109	if (nitems >= arraysz) {
	110	struct dirent **names2;
	111
	112	names2 = (struct dirent *)realloc((char )names,
	113	(arraysz * 2) * sizeof(struct dirent *));
	114	if (names2 == NULL) {
	115	free(p);
	116	goto fail;
	117	}
	118	names = names2;
	119	arraysz *= 2;
	120	}
	121	names[nitems++] = p;
	122	}
	123	closedir(dirp);
	124	if (nitems && dcomp != NULL)
	125	#ifdef I_AM_SCANDIR_B
	126	qsort_b(names, nitems, sizeof(struct dirent *), dcomp);
	127	#else
	128	qsort(names, nitems, sizeof(struct dirent *), dcomp);
	129	#endif
	130	*namelist = names;
	131	return (int) (nitems);
	132
	133	fail:
	134	while (nitems > 0)
	135	free(names[--nitems]);
	136	free(names);
	137	closedir(dirp);
	138	return (-1);
	139	}
	140
	141	#ifndef I_AM_SCANDIR_B
	142	/*
	143	* Alphabetic order comparison routine for those who want it.
	144	* POSIX 2008 requires that alphasort() uses strcoll().
	145	*/
	146	int
	147	alphasort(const struct dirent d1, const struct dirent d2)
	148	{
	149
	150	return (strcoll((d1)->d_name, (d2)->d_name));
	151	}
	152	#endif // I_AM_SCANDIR_B
	153