8a16b7a18f
Mainly focus on files that use BSD 3-Clause license. The Software Package Data Exchange (SPDX) group provides a specification to make it easier for automated tools to detect and summarize well known opensource licenses. We are gradually adopting the specification, noting that the tags are considered only advisory and do not, in any way, superceed or replace the license texts. Special thanks to Wind River for providing access to "The Duke of Highlander" tool: an older (2014) run over FreeBSD tree was useful as a starting point.
158 lines
4.8 KiB
C
158 lines
4.8 KiB
C
/*-
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
*
|
|
* 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.
|
|
* 3. 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$");
|
|
|
|
/*
|
|
* 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"
|
|
|
|
#ifdef I_AM_SCANDIR_B
|
|
#include "block_abi.h"
|
|
#define SELECT(x) CALL_BLOCK(select, x)
|
|
#ifndef __BLOCKS__
|
|
void
|
|
qsort_b(void *, size_t, size_t, void*);
|
|
#endif
|
|
#else
|
|
#define SELECT(x) select(x)
|
|
#endif
|
|
|
|
static int alphasort_thunk(void *thunk, const void *p1, const void *p2);
|
|
|
|
int
|
|
#ifdef I_AM_SCANDIR_B
|
|
scandir_b(const char *dirname, struct dirent ***namelist,
|
|
DECLARE_BLOCK(int, select, const struct dirent *),
|
|
DECLARE_BLOCK(int, dcomp, const struct dirent **, const struct dirent **))
|
|
#else
|
|
scandir(const char *dirname, struct dirent ***namelist,
|
|
int (*select)(const struct dirent *), int (*dcomp)(const struct dirent **,
|
|
const struct dirent **))
|
|
#endif
|
|
{
|
|
struct dirent *d, *p, **names = NULL;
|
|
size_t arraysz, numitems;
|
|
DIR *dirp;
|
|
|
|
if ((dirp = opendir(dirname)) == NULL)
|
|
return(-1);
|
|
|
|
numitems = 0;
|
|
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(_GENERIC_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 (numitems >= arraysz) {
|
|
struct dirent **names2;
|
|
|
|
names2 = reallocarray(names, arraysz,
|
|
2 * sizeof(struct dirent *));
|
|
if (names2 == NULL) {
|
|
free(p);
|
|
goto fail;
|
|
}
|
|
names = names2;
|
|
arraysz *= 2;
|
|
}
|
|
names[numitems++] = p;
|
|
}
|
|
closedir(dirp);
|
|
if (numitems && dcomp != NULL)
|
|
#ifdef I_AM_SCANDIR_B
|
|
qsort_b(names, numitems, sizeof(struct dirent *), (void*)dcomp);
|
|
#else
|
|
qsort_r(names, numitems, sizeof(struct dirent *),
|
|
&dcomp, alphasort_thunk);
|
|
#endif
|
|
*namelist = names;
|
|
return (numitems);
|
|
|
|
fail:
|
|
while (numitems > 0)
|
|
free(names[--numitems]);
|
|
free(names);
|
|
closedir(dirp);
|
|
return (-1);
|
|
}
|
|
|
|
/*
|
|
* Alphabetic order comparison routine for those who want it.
|
|
* POSIX 2008 requires that alphasort() uses strcoll().
|
|
*/
|
|
int
|
|
alphasort(const struct dirent **d1, const struct dirent **d2)
|
|
{
|
|
|
|
return (strcoll((*d1)->d_name, (*d2)->d_name));
|
|
}
|
|
|
|
static int
|
|
alphasort_thunk(void *thunk, const void *p1, const void *p2)
|
|
{
|
|
int (*dc)(const struct dirent **, const struct dirent **);
|
|
|
|
dc = *(int (**)(const struct dirent **, const struct dirent **))thunk;
|
|
return (dc((const struct dirent **)p1, (const struct dirent **)p2));
|
|
}
|