2017-06-20 13:21:14 -04:00
|
|
|
// Copyright 2015-2017 Espressif Systems (Shanghai) PTE LTD
|
2016-10-25 09:02:39 -04:00
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <assert.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include "esp_vfs.h"
|
|
|
|
#include "esp_log.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* File descriptors visible by the applications are composed of two parts.
|
|
|
|
* Lower CONFIG_MAX_FD_BITS bits are used for the actual file descriptor.
|
|
|
|
* Next (16 - CONFIG_MAX_FD_BITS - 1) bits are used to identify the VFS this
|
|
|
|
* descriptor corresponds to.
|
|
|
|
* Highest bit is zero.
|
|
|
|
* We can only use 16 bits because newlib stores file descriptor as short int.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef CONFIG_MAX_FD_BITS
|
|
|
|
#define CONFIG_MAX_FD_BITS 12
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define MAX_VFS_ID_BITS (16 - CONFIG_MAX_FD_BITS - 1)
|
|
|
|
// mask of actual file descriptor (e.g. 0x00000fff)
|
|
|
|
#define VFS_FD_MASK ((1 << CONFIG_MAX_FD_BITS) - 1)
|
|
|
|
// max number of VFS entries
|
|
|
|
#define VFS_MAX_COUNT ((1 << MAX_VFS_ID_BITS) - 1)
|
|
|
|
// mask of VFS id (e.g. 0x00007000)
|
|
|
|
#define VFS_INDEX_MASK (VFS_MAX_COUNT << CONFIG_MAX_FD_BITS)
|
|
|
|
#define VFS_INDEX_S CONFIG_MAX_FD_BITS
|
|
|
|
|
2017-10-03 01:56:55 -04:00
|
|
|
#define LEN_PATH_PREFIX_IGNORED SIZE_MAX /* special length value for VFS which is never recognised by open() */
|
|
|
|
|
2016-10-25 09:02:39 -04:00
|
|
|
typedef struct vfs_entry_ {
|
|
|
|
esp_vfs_t vfs; // contains pointers to VFS functions
|
|
|
|
char path_prefix[ESP_VFS_PATH_MAX]; // path prefix mapped to this VFS
|
|
|
|
size_t path_prefix_len; // micro-optimization to avoid doing extra strlen
|
|
|
|
void* ctx; // optional pointer which can be passed to VFS
|
|
|
|
int offset; // index of this structure in s_vfs array
|
|
|
|
} vfs_entry_t;
|
|
|
|
|
|
|
|
static vfs_entry_t* s_vfs[VFS_MAX_COUNT] = { 0 };
|
|
|
|
static size_t s_vfs_count = 0;
|
|
|
|
|
2017-10-03 01:56:55 -04:00
|
|
|
static esp_err_t esp_vfs_register_common(const char* base_path, size_t len, const esp_vfs_t* vfs, void* ctx, unsigned *p_minimum_fd, unsigned *p_maximum_fd)
|
2016-10-25 09:02:39 -04:00
|
|
|
{
|
2017-10-03 01:56:55 -04:00
|
|
|
if (len != LEN_PATH_PREFIX_IGNORED) {
|
|
|
|
if ((len != 0 && len < 2) || (len > ESP_VFS_PATH_MAX)) {
|
|
|
|
return ESP_ERR_INVALID_ARG;
|
|
|
|
}
|
|
|
|
if ((len > 0 && base_path[0] != '/') || base_path[len - 1] == '/') {
|
|
|
|
return ESP_ERR_INVALID_ARG;
|
|
|
|
}
|
2016-10-25 09:02:39 -04:00
|
|
|
}
|
|
|
|
vfs_entry_t *entry = (vfs_entry_t*) malloc(sizeof(vfs_entry_t));
|
|
|
|
if (entry == NULL) {
|
|
|
|
return ESP_ERR_NO_MEM;
|
|
|
|
}
|
2016-12-29 09:21:29 -05:00
|
|
|
size_t index;
|
|
|
|
for (index = 0; index < s_vfs_count; ++index) {
|
|
|
|
if (s_vfs[index] == NULL) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (index == s_vfs_count) {
|
|
|
|
if (s_vfs_count >= VFS_MAX_COUNT) {
|
|
|
|
free(entry);
|
|
|
|
return ESP_ERR_NO_MEM;
|
|
|
|
}
|
|
|
|
++s_vfs_count;
|
|
|
|
}
|
|
|
|
s_vfs[index] = entry;
|
2017-10-03 01:56:55 -04:00
|
|
|
if (len != LEN_PATH_PREFIX_IGNORED) {
|
|
|
|
strcpy(entry->path_prefix, base_path); // we have already verified argument length
|
|
|
|
} else {
|
|
|
|
bzero(entry->path_prefix, sizeof(entry->path_prefix));
|
|
|
|
}
|
2016-10-25 09:02:39 -04:00
|
|
|
memcpy(&entry->vfs, vfs, sizeof(esp_vfs_t));
|
|
|
|
entry->path_prefix_len = len;
|
|
|
|
entry->ctx = ctx;
|
2016-12-29 09:21:29 -05:00
|
|
|
entry->offset = index;
|
2017-10-03 01:56:55 -04:00
|
|
|
|
|
|
|
if (p_minimum_fd != NULL) {
|
|
|
|
*p_minimum_fd = index << VFS_INDEX_S;
|
|
|
|
}
|
|
|
|
if (p_maximum_fd != NULL) {
|
|
|
|
*p_maximum_fd = (index + 1) << VFS_INDEX_S;
|
|
|
|
}
|
|
|
|
|
2016-10-25 09:02:39 -04:00
|
|
|
return ESP_OK;
|
|
|
|
}
|
|
|
|
|
2017-10-03 01:56:55 -04:00
|
|
|
esp_err_t esp_vfs_register(const char* base_path, const esp_vfs_t* vfs, void* ctx)
|
|
|
|
{
|
|
|
|
return esp_vfs_register_common(base_path, strlen(base_path), vfs, ctx, NULL, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
esp_err_t esp_vfs_register_socket_space(const esp_vfs_t *vfs, void *ctx, unsigned *p_min_fd, unsigned *p_max_fd)
|
|
|
|
{
|
|
|
|
return esp_vfs_register_common("", LEN_PATH_PREFIX_IGNORED, vfs, ctx, p_min_fd, p_max_fd);
|
|
|
|
}
|
|
|
|
|
2016-12-29 09:21:29 -05:00
|
|
|
esp_err_t esp_vfs_unregister(const char* base_path)
|
|
|
|
{
|
|
|
|
for (size_t i = 0; i < s_vfs_count; ++i) {
|
|
|
|
vfs_entry_t* vfs = s_vfs[i];
|
2017-06-21 01:54:04 -04:00
|
|
|
if (vfs == NULL) {
|
|
|
|
continue;
|
|
|
|
}
|
2016-12-29 09:21:29 -05:00
|
|
|
if (memcmp(base_path, vfs->path_prefix, vfs->path_prefix_len) == 0) {
|
|
|
|
free(vfs);
|
|
|
|
s_vfs[i] = NULL;
|
|
|
|
return ESP_OK;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ESP_ERR_INVALID_STATE;
|
|
|
|
}
|
|
|
|
|
2016-10-25 09:02:39 -04:00
|
|
|
static const vfs_entry_t* get_vfs_for_fd(int fd)
|
|
|
|
{
|
|
|
|
int index = ((fd & VFS_INDEX_MASK) >> VFS_INDEX_S);
|
|
|
|
if (index >= s_vfs_count) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return s_vfs[index];
|
|
|
|
}
|
|
|
|
|
|
|
|
static int translate_fd(const vfs_entry_t* vfs, int fd)
|
|
|
|
{
|
2017-10-03 01:56:55 -04:00
|
|
|
if (vfs->vfs.flags & ESP_VFS_FLAG_SHARED_FD_SPACE) {
|
2017-10-10 01:11:12 -04:00
|
|
|
return fd;
|
2017-10-03 01:56:55 -04:00
|
|
|
} else {
|
2017-10-10 01:11:12 -04:00
|
|
|
return fd & VFS_FD_MASK;
|
2017-10-03 01:56:55 -04:00
|
|
|
}
|
2016-10-25 09:02:39 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static const char* translate_path(const vfs_entry_t* vfs, const char* src_path)
|
|
|
|
{
|
|
|
|
assert(strncmp(src_path, vfs->path_prefix, vfs->path_prefix_len) == 0);
|
2017-06-20 13:21:14 -04:00
|
|
|
if (strlen(src_path) == vfs->path_prefix_len) {
|
|
|
|
// special case when src_path matches the path prefix exactly
|
|
|
|
return "/";
|
|
|
|
}
|
2016-10-25 09:02:39 -04:00
|
|
|
return src_path + vfs->path_prefix_len;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const vfs_entry_t* get_vfs_for_path(const char* path)
|
|
|
|
{
|
2017-06-21 02:17:14 -04:00
|
|
|
const vfs_entry_t* best_match = NULL;
|
|
|
|
ssize_t best_match_prefix_len = -1;
|
2016-10-25 09:02:39 -04:00
|
|
|
size_t len = strlen(path);
|
|
|
|
for (size_t i = 0; i < s_vfs_count; ++i) {
|
|
|
|
const vfs_entry_t* vfs = s_vfs[i];
|
2017-10-03 01:56:55 -04:00
|
|
|
if (!vfs || vfs->path_prefix_len == LEN_PATH_PREFIX_IGNORED) {
|
2017-05-04 07:57:11 -04:00
|
|
|
continue;
|
|
|
|
}
|
2017-06-20 13:21:14 -04:00
|
|
|
// match path prefix
|
|
|
|
if (len < vfs->path_prefix_len ||
|
|
|
|
memcmp(path, vfs->path_prefix, vfs->path_prefix_len) != 0) {
|
2016-10-25 09:02:39 -04:00
|
|
|
continue;
|
|
|
|
}
|
2017-06-23 08:07:43 -04:00
|
|
|
// this is the default VFS and we don't have a better match yet.
|
|
|
|
if (vfs->path_prefix_len == 0 && !best_match) {
|
|
|
|
best_match = vfs;
|
|
|
|
continue;
|
|
|
|
}
|
2017-06-20 13:21:14 -04:00
|
|
|
// if path is not equal to the prefix, expect to see a path separator
|
|
|
|
// i.e. don't match "/data" prefix for "/data1/foo.txt" path
|
|
|
|
if (len > vfs->path_prefix_len &&
|
|
|
|
path[vfs->path_prefix_len] != '/') {
|
2016-10-25 09:02:39 -04:00
|
|
|
continue;
|
|
|
|
}
|
2017-06-21 02:17:14 -04:00
|
|
|
// Out of all matching path prefixes, select the longest one;
|
|
|
|
// i.e. if "/dev" and "/dev/uart" both match, for "/dev/uart/1" path,
|
|
|
|
// choose "/dev/uart",
|
|
|
|
// This causes all s_vfs_count VFS entries to be scanned when opening
|
|
|
|
// a file by name. This can be optimized by introducing a table for
|
|
|
|
// FS search order, sorted so that longer prefixes are checked first.
|
|
|
|
if (best_match_prefix_len < (ssize_t) vfs->path_prefix_len) {
|
|
|
|
best_match_prefix_len = (ssize_t) vfs->path_prefix_len;
|
|
|
|
best_match = vfs;
|
2016-10-25 09:02:39 -04:00
|
|
|
}
|
|
|
|
}
|
2017-06-21 02:17:14 -04:00
|
|
|
return best_match;
|
2016-10-25 09:02:39 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Using huge multi-line macros is never nice, but in this case
|
|
|
|
* the only alternative is to repeat this chunk of code (with different function names)
|
|
|
|
* for each syscall being implemented. Given that this define is contained within a single
|
|
|
|
* file, this looks like a good tradeoff.
|
|
|
|
*
|
|
|
|
* First we check if syscall is implemented by VFS (corresponding member is not NULL),
|
|
|
|
* then call the right flavor of the method (e.g. open or open_p) depending on
|
|
|
|
* ESP_VFS_FLAG_CONTEXT_PTR flag. If ESP_VFS_FLAG_CONTEXT_PTR is set, context is passed
|
|
|
|
* in as first argument and _p variant is used for the call.
|
|
|
|
* It is enough to check just one of them for NULL, as both variants are part of a union.
|
|
|
|
*/
|
|
|
|
#define CHECK_AND_CALL(ret, r, pvfs, func, ...) \
|
|
|
|
if (pvfs->vfs.func == NULL) { \
|
|
|
|
__errno_r(r) = ENOSYS; \
|
|
|
|
return -1; \
|
|
|
|
} \
|
|
|
|
if (pvfs->vfs.flags & ESP_VFS_FLAG_CONTEXT_PTR) { \
|
|
|
|
ret = (*pvfs->vfs.func ## _p)(pvfs->ctx, __VA_ARGS__); \
|
|
|
|
} else { \
|
|
|
|
ret = (*pvfs->vfs.func)(__VA_ARGS__);\
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-01-02 14:26:25 -05:00
|
|
|
#define CHECK_AND_CALLV(r, pvfs, func, ...) \
|
|
|
|
if (pvfs->vfs.func == NULL) { \
|
|
|
|
__errno_r(r) = ENOSYS; \
|
|
|
|
return; \
|
|
|
|
} \
|
|
|
|
if (pvfs->vfs.flags & ESP_VFS_FLAG_CONTEXT_PTR) { \
|
|
|
|
(*pvfs->vfs.func ## _p)(pvfs->ctx, __VA_ARGS__); \
|
|
|
|
} else { \
|
|
|
|
(*pvfs->vfs.func)(__VA_ARGS__);\
|
|
|
|
}
|
|
|
|
|
|
|
|
#define CHECK_AND_CALLP(ret, r, pvfs, func, ...) \
|
|
|
|
if (pvfs->vfs.func == NULL) { \
|
|
|
|
__errno_r(r) = ENOSYS; \
|
|
|
|
return NULL; \
|
|
|
|
} \
|
|
|
|
if (pvfs->vfs.flags & ESP_VFS_FLAG_CONTEXT_PTR) { \
|
|
|
|
ret = (*pvfs->vfs.func ## _p)(pvfs->ctx, __VA_ARGS__); \
|
|
|
|
} else { \
|
|
|
|
ret = (*pvfs->vfs.func)(__VA_ARGS__);\
|
|
|
|
}
|
|
|
|
|
2016-10-25 09:02:39 -04:00
|
|
|
int esp_vfs_open(struct _reent *r, const char * path, int flags, int mode)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_path(path);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = ENOENT;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
const char* path_within_vfs = translate_path(vfs, path);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, open, path_within_vfs, flags, mode);
|
2016-11-07 01:26:21 -05:00
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
2017-10-10 01:11:12 -04:00
|
|
|
return ret + (vfs->offset << VFS_INDEX_S);
|
2016-10-25 09:02:39 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
ssize_t esp_vfs_write(struct _reent *r, int fd, const void * data, size_t size)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(fd);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int local_fd = translate_fd(vfs, fd);
|
2017-06-08 12:48:17 -04:00
|
|
|
ssize_t ret;
|
2016-10-25 09:02:39 -04:00
|
|
|
CHECK_AND_CALL(ret, r, vfs, write, local_fd, data, size);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2016-10-26 02:05:56 -04:00
|
|
|
off_t esp_vfs_lseek(struct _reent *r, int fd, off_t size, int mode)
|
2016-10-25 09:02:39 -04:00
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(fd);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int local_fd = translate_fd(vfs, fd);
|
2017-06-08 12:48:17 -04:00
|
|
|
off_t ret;
|
2016-10-25 09:02:39 -04:00
|
|
|
CHECK_AND_CALL(ret, r, vfs, lseek, local_fd, size, mode);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
ssize_t esp_vfs_read(struct _reent *r, int fd, void * dst, size_t size)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(fd);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int local_fd = translate_fd(vfs, fd);
|
2017-06-08 12:48:17 -04:00
|
|
|
ssize_t ret;
|
2016-10-25 09:02:39 -04:00
|
|
|
CHECK_AND_CALL(ret, r, vfs, read, local_fd, dst, size);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int esp_vfs_close(struct _reent *r, int fd)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(fd);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int local_fd = translate_fd(vfs, fd);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, close, local_fd);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int esp_vfs_fstat(struct _reent *r, int fd, struct stat * st)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(fd);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int local_fd = translate_fd(vfs, fd);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, fstat, local_fd, st);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int esp_vfs_stat(struct _reent *r, const char * path, struct stat * st)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_path(path);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = ENOENT;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
const char* path_within_vfs = translate_path(vfs, path);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, stat, path_within_vfs, st);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int esp_vfs_link(struct _reent *r, const char* n1, const char* n2)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_path(n1);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = ENOENT;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
const vfs_entry_t* vfs2 = get_vfs_for_path(n2);
|
|
|
|
if (vfs != vfs2) {
|
|
|
|
__errno_r(r) = EXDEV;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
const char* path1_within_vfs = translate_path(vfs, n1);
|
|
|
|
const char* path2_within_vfs = translate_path(vfs, n2);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, link, path1_within_vfs, path2_within_vfs);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int esp_vfs_unlink(struct _reent *r, const char *path)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_path(path);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = ENOENT;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
const char* path_within_vfs = translate_path(vfs, path);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, unlink, path_within_vfs);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int esp_vfs_rename(struct _reent *r, const char *src, const char *dst)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_path(src);
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = ENOENT;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
const vfs_entry_t* vfs_dst = get_vfs_for_path(dst);
|
|
|
|
if (vfs != vfs_dst) {
|
|
|
|
__errno_r(r) = EXDEV;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
const char* src_within_vfs = translate_path(vfs, src);
|
|
|
|
const char* dst_within_vfs = translate_path(vfs, dst);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, rename, src_within_vfs, dst_within_vfs);
|
|
|
|
return ret;
|
|
|
|
}
|
2017-01-02 14:26:25 -05:00
|
|
|
|
|
|
|
DIR* opendir(const char* name)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_path(name);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = ENOENT;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
const char* path_within_vfs = translate_path(vfs, name);
|
|
|
|
DIR* ret;
|
|
|
|
CHECK_AND_CALLP(ret, r, vfs, opendir, path_within_vfs);
|
|
|
|
if (ret != NULL) {
|
|
|
|
ret->dd_vfs_idx = vfs->offset << VFS_INDEX_S;
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct dirent* readdir(DIR* pdir)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(pdir->dd_vfs_idx);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = EBADF;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
struct dirent* ret;
|
|
|
|
CHECK_AND_CALLP(ret, r, vfs, readdir, pdir);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int readdir_r(DIR* pdir, struct dirent* entry, struct dirent** out_dirent)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(pdir->dd_vfs_idx);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
errno = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, readdir_r, pdir, entry, out_dirent);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
long telldir(DIR* pdir)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(pdir->dd_vfs_idx);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
errno = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
long ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, telldir, pdir);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void seekdir(DIR* pdir, long loc)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(pdir->dd_vfs_idx);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
errno = EBADF;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
CHECK_AND_CALLV(r, vfs, seekdir, pdir, loc);
|
|
|
|
}
|
|
|
|
|
|
|
|
void rewinddir(DIR* pdir)
|
|
|
|
{
|
|
|
|
seekdir(pdir, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int closedir(DIR* pdir)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(pdir->dd_vfs_idx);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
errno = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, closedir, pdir);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int mkdir(const char* name, mode_t mode)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_path(name);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = ENOENT;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
const char* path_within_vfs = translate_path(vfs, name);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, mkdir, path_within_vfs, mode);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int rmdir(const char* name)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_path(name);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = ENOENT;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
const char* path_within_vfs = translate_path(vfs, name);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, rmdir, path_within_vfs);
|
|
|
|
return ret;
|
|
|
|
}
|
2017-08-16 02:58:06 -04:00
|
|
|
|
|
|
|
int fcntl(int fd, int cmd, ...)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(fd);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int local_fd = translate_fd(vfs, fd);
|
|
|
|
int ret;
|
|
|
|
va_list args;
|
|
|
|
va_start(args, cmd);
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, fcntl, local_fd, cmd, args);
|
|
|
|
va_end(args);
|
|
|
|
return ret;
|
|
|
|
}
|
2017-10-03 18:24:40 -04:00
|
|
|
|
|
|
|
int ioctl(int fd, int cmd, ...)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(fd);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int local_fd = translate_fd(vfs, fd);
|
|
|
|
int ret;
|
|
|
|
va_list args;
|
|
|
|
va_start(args, cmd);
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, ioctl, local_fd, cmd, args);
|
|
|
|
va_end(args);
|
|
|
|
return ret;
|
|
|
|
}
|
2017-10-17 02:00:01 -04:00
|
|
|
|
|
|
|
int fsync(int fd)
|
|
|
|
{
|
|
|
|
const vfs_entry_t* vfs = get_vfs_for_fd(fd);
|
|
|
|
struct _reent* r = __getreent();
|
|
|
|
if (vfs == NULL) {
|
|
|
|
__errno_r(r) = EBADF;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
int local_fd = translate_fd(vfs, fd);
|
|
|
|
int ret;
|
|
|
|
CHECK_AND_CALL(ret, r, vfs, fsync, local_fd);
|
|
|
|
return ret;
|
|
|
|
}
|