mirror of
https://github.com/systemd/systemd.git
synced 2026-08-05 23:50:42 +00:00
recuse-dir: rework to use getdents64() instead of readdir()
Let's use the underlying Linux API directly, instead of opendir()/readdir(). This makes it possible for us to do a single memory allocation for all directory entries in common cases, instead of one for each entry.
This commit is contained in:
@@ -4,6 +4,7 @@
|
||||
#include "dirent-util.h"
|
||||
#include "fd-util.h"
|
||||
#include "fileio.h"
|
||||
#include "missing_syscall.h"
|
||||
#include "mountpoint-util.h"
|
||||
#include "recurse-dir.h"
|
||||
#include "sort-util.h"
|
||||
@@ -14,76 +15,130 @@ static int sort_func(struct dirent * const *a, struct dirent * const *b) {
|
||||
return strcmp((*a)->d_name, (*b)->d_name);
|
||||
}
|
||||
|
||||
struct dirent** readdir_all_free(struct dirent **array) {
|
||||
static bool ignore_dirent(const struct dirent *de, RecurseDirFlags flags) {
|
||||
assert(de);
|
||||
|
||||
/* Destructor that relies on the fact that the array of dirent structure pointers is NULL
|
||||
* terminated */
|
||||
/* Depending on flag either ignore everything starting with ".", or just "." itself and ".." */
|
||||
|
||||
if (!array)
|
||||
return NULL;
|
||||
|
||||
for (struct dirent **i = array; *i; i++)
|
||||
free(*i);
|
||||
|
||||
return mfree(array);
|
||||
return FLAGS_SET(flags, RECURSE_DIR_IGNORE_DOT) ?
|
||||
de->d_name[0] == '.' :
|
||||
dot_or_dot_dot(de->d_name);
|
||||
}
|
||||
|
||||
int readdir_all(DIR *d,
|
||||
/* Maximum space one direent structure might require at most */
|
||||
#define DIRENT_SIZE_MAX MAX(sizeof(struct dirent), offsetof(struct dirent, d_name) + NAME_MAX + 1)
|
||||
|
||||
int readdir_all(int dir_fd,
|
||||
RecurseDirFlags flags,
|
||||
struct dirent ***ret) {
|
||||
DirectoryEntries **ret) {
|
||||
|
||||
_cleanup_(readdir_all_freep) struct dirent **de_array = NULL;
|
||||
size_t n_de = 0;
|
||||
_cleanup_free_ DirectoryEntries *de = NULL;
|
||||
DirectoryEntries *nde;
|
||||
size_t add, sz, j;
|
||||
|
||||
assert(d);
|
||||
assert(dir_fd >= 0);
|
||||
|
||||
/* Returns an array with pointers to "struct dirent" directory entries, optionally sorted. Free the
|
||||
* array with readdir_all_freep(). */
|
||||
|
||||
/* Only if 64bit off_t is enabled struct dirent + struct dirent64 are actually the same. We require
|
||||
* this, and we want them to be interchangable, hence verify that. */
|
||||
assert_cc(_FILE_OFFSET_BITS == 64);
|
||||
assert_cc(sizeof(struct dirent) == sizeof(struct dirent64));
|
||||
assert_cc(offsetof(struct dirent, d_ino) == offsetof(struct dirent64, d_ino));
|
||||
assert_cc(sizeof(((struct dirent*) NULL)->d_ino) == sizeof(((struct dirent64*) NULL)->d_ino));
|
||||
assert_cc(offsetof(struct dirent, d_off) == offsetof(struct dirent64, d_off));
|
||||
assert_cc(sizeof(((struct dirent*) NULL)->d_off) == sizeof(((struct dirent64*) NULL)->d_off));
|
||||
assert_cc(offsetof(struct dirent, d_reclen) == offsetof(struct dirent64, d_reclen));
|
||||
assert_cc(sizeof(((struct dirent*) NULL)->d_reclen) == sizeof(((struct dirent64*) NULL)->d_reclen));
|
||||
assert_cc(offsetof(struct dirent, d_type) == offsetof(struct dirent64, d_type));
|
||||
assert_cc(sizeof(((struct dirent*) NULL)->d_type) == sizeof(((struct dirent64*) NULL)->d_type));
|
||||
assert_cc(offsetof(struct dirent, d_name) == offsetof(struct dirent64, d_name));
|
||||
assert_cc(sizeof(((struct dirent*) NULL)->d_name) == sizeof(((struct dirent64*) NULL)->d_name));
|
||||
|
||||
/* Start with space for up to 8 directory entries. We expect at least 2 ("." + ".."), hence hopefully
|
||||
* 8 will cover most cases comprehensively. (Note that most likely a lot more entries will actually
|
||||
* fit in the buffer, given we calculate maximum file name length here.) */
|
||||
de = malloc(offsetof(DirectoryEntries, buffer) + DIRENT_SIZE_MAX * 8);
|
||||
if (!de)
|
||||
return -ENOMEM;
|
||||
|
||||
de->buffer_size = 0;
|
||||
for (;;) {
|
||||
_cleanup_free_ struct dirent *copy = NULL;
|
||||
struct dirent *de;
|
||||
size_t bs;
|
||||
ssize_t n;
|
||||
|
||||
errno = 0;
|
||||
de = readdir(d);
|
||||
if (!de) {
|
||||
if (errno == 0)
|
||||
break;
|
||||
bs = MIN(MALLOC_SIZEOF_SAFE(de) - offsetof(DirectoryEntries, buffer), (size_t) SSIZE_MAX);
|
||||
assert(bs > de->buffer_size);
|
||||
|
||||
n = getdents64(dir_fd, de->buffer + de->buffer_size, bs - de->buffer_size);
|
||||
if (n < 0)
|
||||
return -errno;
|
||||
}
|
||||
if (n == 0)
|
||||
break;
|
||||
|
||||
/* Depending on flag either ignore everything starting with ".", or just "." itself and ".." */
|
||||
if (FLAGS_SET(flags, RECURSE_DIR_IGNORE_DOT) ?
|
||||
de->d_name[0] == '.' :
|
||||
dot_or_dot_dot(de->d_name))
|
||||
de->buffer_size += n;
|
||||
|
||||
if (de->buffer_size < bs - DIRENT_SIZE_MAX) /* Still room for one more entry, then try to
|
||||
* fill it up without growing the structure. */
|
||||
continue;
|
||||
|
||||
if (n_de >= INT_MAX) /* Make sure we can return the number as 'int' return value */
|
||||
return -ERANGE;
|
||||
if (bs >= SSIZE_MAX - offsetof(DirectoryEntries, buffer))
|
||||
return -EFBIG;
|
||||
bs = bs >= (SSIZE_MAX - offsetof(DirectoryEntries, buffer))/2 ? SSIZE_MAX - offsetof(DirectoryEntries, buffer) : bs * 2;
|
||||
|
||||
if (!GREEDY_REALLOC(de_array, n_de+2))
|
||||
nde = realloc(de, bs);
|
||||
if (!nde)
|
||||
return -ENOMEM;
|
||||
|
||||
copy = memdup(de, de->d_reclen);
|
||||
if (!copy)
|
||||
return -ENOMEM;
|
||||
de = nde;
|
||||
}
|
||||
|
||||
de_array[n_de++] = TAKE_PTR(copy);
|
||||
de_array[n_de] = NULL; /* guarantee array remains NUL terminated */
|
||||
de->n_entries = 0;
|
||||
for (struct dirent *entry = (struct dirent*) de->buffer;
|
||||
(uint8_t*) entry < de->buffer + de->buffer_size;
|
||||
entry = (struct dirent*) ((uint8_t*) entry + entry->d_reclen)) {
|
||||
|
||||
if (ignore_dirent(entry, flags))
|
||||
continue;
|
||||
|
||||
de->n_entries++;
|
||||
}
|
||||
|
||||
sz = ALIGN(offsetof(DirectoryEntries, buffer) + de->buffer_size);
|
||||
add = sizeof(struct dirent*) * de->n_entries;
|
||||
if (add > SIZE_MAX - add)
|
||||
return -ENOMEM;
|
||||
|
||||
nde = realloc(de, sz + add);
|
||||
if (!nde)
|
||||
return -ENOMEM;
|
||||
|
||||
de = nde;
|
||||
de->entries = (struct dirent**) ((uint8_t*) de + ALIGN(offsetof(DirectoryEntries, buffer) + de->buffer_size));
|
||||
|
||||
j = 0;
|
||||
for (struct dirent *entry = (struct dirent*) de->buffer;
|
||||
(uint8_t*) entry < de->buffer + de->buffer_size;
|
||||
entry = (struct dirent*) ((uint8_t*) entry + entry->d_reclen)) {
|
||||
|
||||
if (ignore_dirent(entry, flags))
|
||||
continue;
|
||||
|
||||
de->entries[j++] = entry;
|
||||
}
|
||||
|
||||
if (FLAGS_SET(flags, RECURSE_DIR_SORT))
|
||||
typesafe_qsort(de_array, n_de, sort_func);
|
||||
typesafe_qsort(de->entries, de->n_entries, sort_func);
|
||||
|
||||
if (ret)
|
||||
*ret = TAKE_PTR(de_array);
|
||||
*ret = TAKE_PTR(de);
|
||||
|
||||
return (int) n_de;
|
||||
return 0;
|
||||
}
|
||||
|
||||
int recurse_dir(
|
||||
DIR *d,
|
||||
int dir_fd,
|
||||
const char *path,
|
||||
unsigned statx_mask,
|
||||
unsigned n_depth_max,
|
||||
@@ -91,51 +146,50 @@ int recurse_dir(
|
||||
recurse_dir_func_t func,
|
||||
void *userdata) {
|
||||
|
||||
_cleanup_(readdir_all_freep) struct dirent **de = NULL;
|
||||
int r, n;
|
||||
_cleanup_free_ DirectoryEntries *de = NULL;
|
||||
int r;
|
||||
|
||||
assert(d);
|
||||
assert(dir_fd >= 0);
|
||||
assert(func);
|
||||
|
||||
/* This is a lot like ftw()/nftw(), but a lot more modern, i.e. built around openat()/statx(), and
|
||||
* under the assumption that fds are not as 'expensive' as they used to be. */
|
||||
/* This is a lot like ftw()/nftw(), but a lot more modern, i.e. built around openat()/statx()/O_PATH,
|
||||
* and under the assumption that fds are not as 'expensive' as they used to be. */
|
||||
|
||||
if (n_depth_max == 0)
|
||||
return -EOVERFLOW;
|
||||
if (n_depth_max == UINT_MAX) /* special marker for "default" */
|
||||
n_depth_max = DEFAULT_RECURSION_MAX;
|
||||
|
||||
n = readdir_all(d, flags, &de);
|
||||
if (n < 0)
|
||||
return n;
|
||||
r = readdir_all(dir_fd, flags, &de);
|
||||
if (r < 0)
|
||||
return r;
|
||||
|
||||
for (int i = 0; i < n; i++) {
|
||||
for (size_t i = 0; i < de->n_entries; i++) {
|
||||
_cleanup_close_ int inode_fd = -1, subdir_fd = -1;
|
||||
_cleanup_free_ char *joined = NULL;
|
||||
_cleanup_closedir_ DIR *subdir = NULL;
|
||||
_cleanup_close_ int inode_fd = -1;
|
||||
STRUCT_STATX_DEFINE(sx);
|
||||
bool sx_valid = false;
|
||||
const char *p;
|
||||
|
||||
/* For each directory entry we'll do one of the following:
|
||||
*
|
||||
* 1) If the entry refers to a directory, we'll open it as O_DIRECTORY 'subdir' and then statx() the opened directory if requested
|
||||
* 2) Otherwise and RECURSE_DIR_INODE_FD is set we'll open O_PATH 'inode_fd' and then statx() the opened inode
|
||||
* 3) Otherwise we'll statx() the directory entry via the directory we are currently looking at
|
||||
* 1) If the entry refers to a directory, we'll open it as O_DIRECTORY 'subdir_fd' and then statx() the opened directory via that new fd (if requested)
|
||||
* 2) Otherwise, if RECURSE_DIR_INODE_FD is set we'll open it as O_PATH 'inode_fd' and then statx() the opened inode via that new fd (if requested)
|
||||
* 3) Otherwise, we'll statx() the directory entry via the directory fd we are currently looking at (if requested)
|
||||
*/
|
||||
|
||||
if (path) {
|
||||
joined = path_join(path, de[i]->d_name);
|
||||
joined = path_join(path, de->entries[i]->d_name);
|
||||
if (!joined)
|
||||
return -ENOMEM;
|
||||
|
||||
p = joined;
|
||||
} else
|
||||
p = de[i]->d_name;
|
||||
p = de->entries[i]->d_name;
|
||||
|
||||
if (IN_SET(de[i]->d_type, DT_UNKNOWN, DT_DIR)) {
|
||||
subdir = xopendirat(dirfd(d), de[i]->d_name, O_NOFOLLOW);
|
||||
if (!subdir) {
|
||||
if (IN_SET(de->entries[i]->d_type, DT_UNKNOWN, DT_DIR)) {
|
||||
subdir_fd = openat(dir_fd, de->entries[i]->d_name, O_DIRECTORY|O_NOFOLLOW|O_CLOEXEC);
|
||||
if (subdir_fd < 0) {
|
||||
if (errno == ENOENT) /* Vanished by now, go for next file immediately */
|
||||
continue;
|
||||
|
||||
@@ -147,9 +201,9 @@ int recurse_dir(
|
||||
|
||||
r = func(RECURSE_DIR_SKIP_OPEN_DIR_ERROR_BASE + errno,
|
||||
p,
|
||||
dirfd(d),
|
||||
dir_fd,
|
||||
-1,
|
||||
de[i],
|
||||
de->entries[i],
|
||||
NULL,
|
||||
userdata);
|
||||
if (r == RECURSE_DIR_LEAVE_DIRECTORY)
|
||||
@@ -164,10 +218,10 @@ int recurse_dir(
|
||||
|
||||
} else {
|
||||
/* If we managed to get a DIR* off the inode, it's definitely a directory. */
|
||||
de[i]->d_type = DT_DIR;
|
||||
de->entries[i]->d_type = DT_DIR;
|
||||
|
||||
if (statx_mask != 0 || (flags & RECURSE_DIR_SAME_MOUNT)) {
|
||||
r = statx_fallback(dirfd(subdir), "", AT_EMPTY_PATH, statx_mask, &sx);
|
||||
r = statx_fallback(subdir_fd, "", AT_EMPTY_PATH, statx_mask, &sx);
|
||||
if (r < 0)
|
||||
return r;
|
||||
|
||||
@@ -176,12 +230,12 @@ int recurse_dir(
|
||||
}
|
||||
}
|
||||
|
||||
if (!subdir) {
|
||||
if (subdir_fd < 0) {
|
||||
/* It's not a subdirectory. */
|
||||
|
||||
if (flags & RECURSE_DIR_INODE_FD) {
|
||||
|
||||
inode_fd = openat(dirfd(d), de[i]->d_name, O_PATH|O_NOFOLLOW|O_CLOEXEC);
|
||||
inode_fd = openat(dir_fd, de->entries[i]->d_name, O_PATH|O_NOFOLLOW|O_CLOEXEC);
|
||||
if (inode_fd < 0) {
|
||||
if (errno == ENOENT) /* Vanished by now, go for next file immediately */
|
||||
continue;
|
||||
@@ -192,9 +246,9 @@ int recurse_dir(
|
||||
|
||||
r = func(RECURSE_DIR_SKIP_OPEN_INODE_ERROR_BASE + errno,
|
||||
p,
|
||||
dirfd(d),
|
||||
dir_fd,
|
||||
-1,
|
||||
de[i],
|
||||
de->entries[i],
|
||||
NULL,
|
||||
userdata);
|
||||
if (r == RECURSE_DIR_LEAVE_DIRECTORY)
|
||||
@@ -222,16 +276,16 @@ int recurse_dir(
|
||||
* directory fd — which sould be riskless now that we pinned the
|
||||
* inode. */
|
||||
|
||||
subdir = xopendirat(AT_FDCWD, FORMAT_PROC_FD_PATH(inode_fd), 0);
|
||||
if (!subdir)
|
||||
subdir_fd = openat(AT_FDCWD, FORMAT_PROC_FD_PATH(inode_fd), O_DIRECTORY|O_CLOEXEC);
|
||||
if (subdir_fd < 0)
|
||||
return -errno;
|
||||
|
||||
inode_fd = safe_close(inode_fd);
|
||||
}
|
||||
|
||||
} else if (statx_mask != 0 || (de[i]->d_type == DT_UNKNOWN && (flags & RECURSE_DIR_ENSURE_TYPE))) {
|
||||
} else if (statx_mask != 0 || (de->entries[i]->d_type == DT_UNKNOWN && (flags & RECURSE_DIR_ENSURE_TYPE))) {
|
||||
|
||||
r = statx_fallback(dirfd(d), de[i]->d_name, AT_SYMLINK_NOFOLLOW, statx_mask | STATX_TYPE, &sx);
|
||||
r = statx_fallback(dir_fd, de->entries[i]->d_name, AT_SYMLINK_NOFOLLOW, statx_mask | STATX_TYPE, &sx);
|
||||
if (r == -ENOENT) /* Vanished by now? Go for next file immediately */
|
||||
continue;
|
||||
if (r < 0) {
|
||||
@@ -241,9 +295,9 @@ int recurse_dir(
|
||||
|
||||
r = func(RECURSE_DIR_SKIP_STAT_INODE_ERROR_BASE + -r,
|
||||
p,
|
||||
dirfd(d),
|
||||
dir_fd,
|
||||
-1,
|
||||
de[i],
|
||||
de->entries[i],
|
||||
NULL,
|
||||
userdata);
|
||||
if (r == RECURSE_DIR_LEAVE_DIRECTORY)
|
||||
@@ -271,9 +325,9 @@ int recurse_dir(
|
||||
|
||||
r = func(RECURSE_DIR_SKIP_STAT_INODE_ERROR_BASE + EISDIR,
|
||||
p,
|
||||
dirfd(d),
|
||||
dir_fd,
|
||||
-1,
|
||||
de[i],
|
||||
de->entries[i],
|
||||
NULL,
|
||||
userdata);
|
||||
if (r == RECURSE_DIR_LEAVE_DIRECTORY)
|
||||
@@ -289,22 +343,22 @@ int recurse_dir(
|
||||
if (sx_valid) {
|
||||
/* Copy over the data we acquired through statx() if we acquired any */
|
||||
if (sx.stx_mask & STATX_TYPE) {
|
||||
assert(!!subdir == !!S_ISDIR(sx.stx_mode));
|
||||
de[i]->d_type = IFTODT(sx.stx_mode);
|
||||
assert((subdir_fd < 0) == !S_ISDIR(sx.stx_mode));
|
||||
de->entries[i]->d_type = IFTODT(sx.stx_mode);
|
||||
}
|
||||
|
||||
if (sx.stx_mask & STATX_INO)
|
||||
de[i]->d_ino = sx.stx_ino;
|
||||
de->entries[i]->d_ino = sx.stx_ino;
|
||||
}
|
||||
|
||||
if (subdir) {
|
||||
if (subdir_fd >= 0) {
|
||||
if (FLAGS_SET(flags, RECURSE_DIR_SAME_MOUNT)) {
|
||||
bool is_mount;
|
||||
|
||||
if (sx_valid && FLAGS_SET(sx.stx_attributes_mask, STATX_ATTR_MOUNT_ROOT))
|
||||
is_mount = FLAGS_SET(sx.stx_attributes, STATX_ATTR_MOUNT_ROOT);
|
||||
else {
|
||||
r = fd_is_mount_point(dirfd(d), de[i]->d_name, 0);
|
||||
r = fd_is_mount_point(dir_fd, de->entries[i]->d_name, 0);
|
||||
if (r < 0)
|
||||
log_debug_errno(r, "Failed to determine whether %s is a submount, assuming not: %m", p);
|
||||
|
||||
@@ -314,9 +368,9 @@ int recurse_dir(
|
||||
if (is_mount) {
|
||||
r = func(RECURSE_DIR_SKIP_MOUNT,
|
||||
p,
|
||||
dirfd(d),
|
||||
dirfd(subdir),
|
||||
de[i],
|
||||
dir_fd,
|
||||
subdir_fd,
|
||||
de->entries[i],
|
||||
statx_mask != 0 ? &sx : NULL, /* only pass sx if user asked for it */
|
||||
userdata);
|
||||
if (r == RECURSE_DIR_LEAVE_DIRECTORY)
|
||||
@@ -333,9 +387,9 @@ int recurse_dir(
|
||||
|
||||
r = func(RECURSE_DIR_SKIP_DEPTH,
|
||||
p,
|
||||
dirfd(d),
|
||||
dirfd(subdir),
|
||||
de[i],
|
||||
dir_fd,
|
||||
subdir_fd,
|
||||
de->entries[i],
|
||||
statx_mask != 0 ? &sx : NULL, /* only pass sx if user asked for it */
|
||||
userdata);
|
||||
if (r == RECURSE_DIR_LEAVE_DIRECTORY)
|
||||
@@ -348,9 +402,9 @@ int recurse_dir(
|
||||
|
||||
r = func(RECURSE_DIR_ENTER,
|
||||
p,
|
||||
dirfd(d),
|
||||
dirfd(subdir),
|
||||
de[i],
|
||||
dir_fd,
|
||||
subdir_fd,
|
||||
de->entries[i],
|
||||
statx_mask != 0 ? &sx : NULL, /* only pass sx if user asked for it */
|
||||
userdata);
|
||||
if (r == RECURSE_DIR_LEAVE_DIRECTORY)
|
||||
@@ -360,7 +414,7 @@ int recurse_dir(
|
||||
if (r != RECURSE_DIR_CONTINUE)
|
||||
return r;
|
||||
|
||||
r = recurse_dir(subdir,
|
||||
r = recurse_dir(subdir_fd,
|
||||
p,
|
||||
statx_mask,
|
||||
n_depth_max - 1,
|
||||
@@ -372,18 +426,18 @@ int recurse_dir(
|
||||
|
||||
r = func(RECURSE_DIR_LEAVE,
|
||||
p,
|
||||
dirfd(d),
|
||||
dirfd(subdir),
|
||||
de[i],
|
||||
dir_fd,
|
||||
subdir_fd,
|
||||
de->entries[i],
|
||||
statx_mask != 0 ? &sx : NULL, /* only pass sx if user asked for it */
|
||||
userdata);
|
||||
} else
|
||||
/* Non-directory inode */
|
||||
r = func(RECURSE_DIR_ENTRY,
|
||||
p,
|
||||
dirfd(d),
|
||||
dir_fd,
|
||||
inode_fd,
|
||||
de[i],
|
||||
de->entries[i],
|
||||
statx_mask != 0 ? &sx : NULL, /* only pass sx if user asked for it */
|
||||
userdata);
|
||||
|
||||
@@ -406,11 +460,17 @@ int recurse_dir_at(
|
||||
recurse_dir_func_t func,
|
||||
void *userdata) {
|
||||
|
||||
_cleanup_closedir_ DIR *d = NULL;
|
||||
_cleanup_close_ int fd = -1;
|
||||
|
||||
d = xopendirat(atfd, path, 0);
|
||||
if (!d)
|
||||
assert(atfd >= 0 || atfd == AT_FDCWD);
|
||||
assert(func);
|
||||
|
||||
if (!path)
|
||||
path = ".";
|
||||
|
||||
fd = openat(atfd, path, O_DIRECTORY|O_CLOEXEC);
|
||||
if (fd < 0)
|
||||
return -errno;
|
||||
|
||||
return recurse_dir(d, path, statx_mask, n_depth_max, flags, func, userdata);
|
||||
return recurse_dir(fd, path, statx_mask, n_depth_max, flags, func, userdata);
|
||||
}
|
||||
|
||||
@@ -67,9 +67,14 @@ typedef enum RecurseDirFlags {
|
||||
RECURSE_DIR_INODE_FD = 1 << 4, /* passes an opened inode fd (O_DIRECTORY fd in case of dirs, O_PATH otherwise) */
|
||||
} RecurseDirFlags;
|
||||
|
||||
struct dirent** readdir_all_free(struct dirent **array);
|
||||
DEFINE_TRIVIAL_CLEANUP_FUNC(struct dirent **, readdir_all_free);
|
||||
int readdir_all(DIR *d, RecurseDirFlags flags, struct dirent ***ret);
|
||||
typedef struct DirectoryEntries {
|
||||
size_t n_entries;
|
||||
struct dirent** entries;
|
||||
size_t buffer_size;
|
||||
uint8_t buffer[] _alignas_(struct dirent);
|
||||
} DirectoryEntries;
|
||||
|
||||
int recurse_dir(DIR *d, const char *path, unsigned statx_mask, unsigned n_depth_max, RecurseDirFlags flags, recurse_dir_func_t func, void *userdata);
|
||||
int readdir_all(int dir_fd, RecurseDirFlags flags, DirectoryEntries **ret);
|
||||
|
||||
int recurse_dir(int dir_fd, const char *path, unsigned statx_mask, unsigned n_depth_max, RecurseDirFlags flags, recurse_dir_func_t func, void *userdata);
|
||||
int recurse_dir_at(int atfd, const char *path, unsigned statx_mask, unsigned n_depth_max, RecurseDirFlags flags, recurse_dir_func_t func, void *userdata);
|
||||
|
||||
Reference in New Issue
Block a user