mirror of
https://gitlab.com/sortix/sortix.git
synced 2023-02-13 20:55:38 -05:00
88 lines
2.6 KiB
C++
88 lines
2.6 KiB
C++
|
/*******************************************************************************
|
||
|
|
|
||
|
|
Copyright(C) Jonas 'Sortie' Termansen 2013.
|
||
|
|
|
||
|
|
This file is part of the Sortix C Library.
|
||
|
|
|
||
|
|
The Sortix C Library is free software: you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU Lesser General Public License as published by
|
||
|
|
the Free Software Foundation, either version 3 of the License, or (at your
|
||
|
|
option) any later version.
|
||
|
|
|
||
|
|
The Sortix C Library is distributed in the hope that it will be useful, but
|
||
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
||
|
|
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
|
||
|
|
License for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU Lesser General Public License
|
||
|
|
along with the Sortix C Library. If not, see <http://www.gnu.org/licenses/>.
|
||
|
|
|
||
|
|
dirent/scandir.cpp
|
||
|
|
Filtered and sorted directory reading.
|
||
|
|
|
||
|
|
*******************************************************************************/
|
||
|
|
|
||
|
|
#include <errno.h>
|
||
|
|
#include <dirent.h>
|
||
|
|
#include <limits.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <string.h>
|
||
|
|
|
||
|
|
extern "C"
|
||
|
|
int scandir(const char* path, struct dirent*** namelist_ptr,
|
||
|
|
int (*filter)(const struct dirent*),
|
||
|
|
int (*compare)(const struct dirent**, const struct dirent**))
|
||
|
|
{
|
||
|
|
DIR* dir = opendir(path);
|
||
|
|
if ( !dir )
|
||
|
|
return -1;
|
||
|
|
|
||
|
|
size_t namelist_used = 0;
|
||
|
|
size_t namelist_length = 0;
|
||
|
|
struct dirent** namelist = NULL;
|
||
|
|
|
||
|
|
if ( false )
|
||
|
|
{
|
||
|
|
out_error:
|
||
|
|
for ( size_t i = 0; i < namelist_used; i++ )
|
||
|
|
free(namelist[i]);
|
||
|
|
free(namelist);
|
||
|
|
closedir(dir);
|
||
|
|
return errno = EOVERFLOW, -1;
|
||
|
|
}
|
||
|
|
|
||
|
|
while ( struct dirent* entry = readdir(dir) )
|
||
|
|
{
|
||
|
|
if ( filter && !filter(entry) )
|
||
|
|
continue;
|
||
|
|
if ( (size_t) INT_MAX <= namelist_used )
|
||
|
|
goto out_error;
|
||
|
|
if ( namelist_used == namelist_length )
|
||
|
|
{
|
||
|
|
size_t new_length = namelist_length ? 2 * namelist_length : 8;
|
||
|
|
size_t new_size = new_length * sizeof(struct dirent*);
|
||
|
|
struct dirent** list = (struct dirent**) realloc(namelist, new_size);
|
||
|
|
if ( !list )
|
||
|
|
goto out_error;
|
||
|
|
namelist = list;
|
||
|
|
namelist_length = new_length;
|
||
|
|
}
|
||
|
|
size_t name_length = strlen(entry->d_name);
|
||
|
|
size_t dirent_size = sizeof(struct dirent) + name_length + 1;
|
||
|
|
struct dirent* dirent = (struct dirent*) malloc(dirent_size);
|
||
|
|
if ( !dirent_size )
|
||
|
|
goto out_error;
|
||
|
|
memcpy(dirent, entry, sizeof(*entry));
|
||
|
|
strcpy(dirent->d_name, entry->d_name);
|
||
|
|
namelist[namelist_used++] = dirent;
|
||
|
|
}
|
||
|
|
|
||
|
|
if ( compare )
|
||
|
|
qsort(namelist, namelist_used, sizeof(struct dirent*),
|
||
|
|
(int (*)(const void*, const void*)) compare);
|
||
|
|
|
||
|
|
closedir(dir);
|
||
|
|
|
||
|
|
return *namelist_ptr = namelist, (int) namelist_used;
|
||
|
|
}
|