|
|
@@ -18,17 +18,13 @@
|
|
|
#include "lfs.h"
|
|
|
#include "lfs_util.h"
|
|
|
|
|
|
-#include <string.h>
|
|
|
-#include <stdlib.h>
|
|
|
-#include <assert.h>
|
|
|
-
|
|
|
|
|
|
/// Caching block device operations ///
|
|
|
static int lfs_cache_read(lfs_t *lfs, lfs_cache_t *rcache,
|
|
|
const lfs_cache_t *pcache, lfs_block_t block,
|
|
|
lfs_off_t off, void *buffer, lfs_size_t size) {
|
|
|
uint8_t *data = buffer;
|
|
|
- assert(block < lfs->cfg->block_count);
|
|
|
+ LFS_ASSERT(block < lfs->cfg->block_count);
|
|
|
|
|
|
while (size > 0) {
|
|
|
if (pcache && block == pcache->block && off >= pcache->off &&
|
|
|
@@ -153,7 +149,7 @@ static int lfs_cache_prog(lfs_t *lfs, lfs_cache_t *pcache,
|
|
|
lfs_cache_t *rcache, lfs_block_t block,
|
|
|
lfs_off_t off, const void *buffer, lfs_size_t size) {
|
|
|
const uint8_t *data = buffer;
|
|
|
- assert(block < lfs->cfg->block_count);
|
|
|
+ LFS_ASSERT(block < lfs->cfg->block_count);
|
|
|
|
|
|
while (size > 0) {
|
|
|
if (block == pcache->block && off >= pcache->off &&
|
|
|
@@ -180,7 +176,7 @@ static int lfs_cache_prog(lfs_t *lfs, lfs_cache_t *pcache,
|
|
|
|
|
|
// pcache must have been flushed, either by programming and
|
|
|
// entire block or manually flushing the pcache
|
|
|
- assert(pcache->block == 0xffffffff);
|
|
|
+ LFS_ASSERT(pcache->block == 0xffffffff);
|
|
|
|
|
|
if (off % lfs->cfg->prog_size == 0 &&
|
|
|
size >= lfs->cfg->prog_size) {
|
|
|
@@ -323,6 +319,48 @@ static void lfs_alloc_ack(lfs_t *lfs) {
|
|
|
}
|
|
|
|
|
|
|
|
|
+/// Endian swapping functions ///
|
|
|
+static void lfs_dir_fromle32(struct lfs_disk_dir *d) {
|
|
|
+ d->rev = lfs_fromle32(d->rev);
|
|
|
+ d->size = lfs_fromle32(d->size);
|
|
|
+ d->tail[0] = lfs_fromle32(d->tail[0]);
|
|
|
+ d->tail[1] = lfs_fromle32(d->tail[1]);
|
|
|
+}
|
|
|
+
|
|
|
+static void lfs_dir_tole32(struct lfs_disk_dir *d) {
|
|
|
+ d->rev = lfs_tole32(d->rev);
|
|
|
+ d->size = lfs_tole32(d->size);
|
|
|
+ d->tail[0] = lfs_tole32(d->tail[0]);
|
|
|
+ d->tail[1] = lfs_tole32(d->tail[1]);
|
|
|
+}
|
|
|
+
|
|
|
+static void lfs_entry_fromle32(struct lfs_disk_entry *d) {
|
|
|
+ d->u.dir[0] = lfs_fromle32(d->u.dir[0]);
|
|
|
+ d->u.dir[1] = lfs_fromle32(d->u.dir[1]);
|
|
|
+}
|
|
|
+
|
|
|
+static void lfs_entry_tole32(struct lfs_disk_entry *d) {
|
|
|
+ d->u.dir[0] = lfs_tole32(d->u.dir[0]);
|
|
|
+ d->u.dir[1] = lfs_tole32(d->u.dir[1]);
|
|
|
+}
|
|
|
+
|
|
|
+static void lfs_superblock_fromle32(struct lfs_disk_superblock *d) {
|
|
|
+ d->root[0] = lfs_fromle32(d->root[0]);
|
|
|
+ d->root[1] = lfs_fromle32(d->root[1]);
|
|
|
+ d->block_size = lfs_fromle32(d->block_size);
|
|
|
+ d->block_count = lfs_fromle32(d->block_count);
|
|
|
+ d->version = lfs_fromle32(d->version);
|
|
|
+}
|
|
|
+
|
|
|
+static void lfs_superblock_tole32(struct lfs_disk_superblock *d) {
|
|
|
+ d->root[0] = lfs_tole32(d->root[0]);
|
|
|
+ d->root[1] = lfs_tole32(d->root[1]);
|
|
|
+ d->block_size = lfs_tole32(d->block_size);
|
|
|
+ d->block_count = lfs_tole32(d->block_count);
|
|
|
+ d->version = lfs_tole32(d->version);
|
|
|
+}
|
|
|
+
|
|
|
+
|
|
|
/// Metadata pair and directory operations ///
|
|
|
static inline void lfs_pairswap(lfs_block_t pair[2]) {
|
|
|
lfs_block_t t = pair[0];
|
|
|
@@ -364,6 +402,7 @@ static int lfs_dir_alloc(lfs_t *lfs, lfs_dir_t *dir) {
|
|
|
// rather than clobbering one of the blocks we just pretend
|
|
|
// the revision may be valid
|
|
|
int err = lfs_bd_read(lfs, dir->pair[0], 0, &dir->d.rev, 4);
|
|
|
+ dir->d.rev = lfs_fromle32(dir->d.rev);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
@@ -389,6 +428,7 @@ static int lfs_dir_fetch(lfs_t *lfs,
|
|
|
for (int i = 0; i < 2; i++) {
|
|
|
struct lfs_disk_dir test;
|
|
|
int err = lfs_bd_read(lfs, tpair[i], 0, &test, sizeof(test));
|
|
|
+ lfs_dir_fromle32(&test);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
@@ -403,7 +443,9 @@ static int lfs_dir_fetch(lfs_t *lfs,
|
|
|
}
|
|
|
|
|
|
uint32_t crc = 0xffffffff;
|
|
|
+ lfs_dir_tole32(&test);
|
|
|
lfs_crc(&crc, &test, sizeof(test));
|
|
|
+ lfs_dir_fromle32(&test);
|
|
|
err = lfs_bd_crc(lfs, tpair[i], sizeof(test),
|
|
|
(0x7fffffff & test.size) - sizeof(test), &crc);
|
|
|
if (err) {
|
|
|
@@ -463,8 +505,10 @@ static int lfs_dir_commit(lfs_t *lfs, lfs_dir_t *dir,
|
|
|
}
|
|
|
|
|
|
uint32_t crc = 0xffffffff;
|
|
|
+ lfs_dir_tole32(&dir->d);
|
|
|
lfs_crc(&crc, &dir->d, sizeof(dir->d));
|
|
|
err = lfs_bd_prog(lfs, dir->pair[0], 0, &dir->d, sizeof(dir->d));
|
|
|
+ lfs_dir_fromle32(&dir->d);
|
|
|
if (err) {
|
|
|
if (err == LFS_ERR_CORRUPT) {
|
|
|
goto relocate;
|
|
|
@@ -511,7 +555,9 @@ static int lfs_dir_commit(lfs_t *lfs, lfs_dir_t *dir,
|
|
|
}
|
|
|
}
|
|
|
|
|
|
+ crc = lfs_tole32(crc);
|
|
|
err = lfs_bd_prog(lfs, dir->pair[0], newoff, &crc, 4);
|
|
|
+ crc = lfs_fromle32(crc);
|
|
|
if (err) {
|
|
|
if (err == LFS_ERR_CORRUPT) {
|
|
|
goto relocate;
|
|
|
@@ -584,11 +630,14 @@ relocate:
|
|
|
}
|
|
|
|
|
|
static int lfs_dir_update(lfs_t *lfs, lfs_dir_t *dir,
|
|
|
- const lfs_entry_t *entry, const void *data) {
|
|
|
- return lfs_dir_commit(lfs, dir, (struct lfs_region[]){
|
|
|
+ lfs_entry_t *entry, const void *data) {
|
|
|
+ lfs_entry_tole32(&entry->d);
|
|
|
+ int err = lfs_dir_commit(lfs, dir, (struct lfs_region[]){
|
|
|
{entry->off, sizeof(entry->d), &entry->d, sizeof(entry->d)},
|
|
|
{entry->off+sizeof(entry->d), entry->d.nlen, data, entry->d.nlen}
|
|
|
}, data ? 2 : 1);
|
|
|
+ lfs_entry_fromle32(&entry->d);
|
|
|
+ return err;
|
|
|
}
|
|
|
|
|
|
static int lfs_dir_append(lfs_t *lfs, lfs_dir_t *dir,
|
|
|
@@ -597,10 +646,14 @@ static int lfs_dir_append(lfs_t *lfs, lfs_dir_t *dir,
|
|
|
while (true) {
|
|
|
if (dir->d.size + lfs_entry_size(entry) <= lfs->cfg->block_size) {
|
|
|
entry->off = dir->d.size - 4;
|
|
|
- return lfs_dir_commit(lfs, dir, (struct lfs_region[]){
|
|
|
+
|
|
|
+ lfs_entry_tole32(&entry->d);
|
|
|
+ int err = lfs_dir_commit(lfs, dir, (struct lfs_region[]){
|
|
|
{entry->off, 0, &entry->d, sizeof(entry->d)},
|
|
|
{entry->off, 0, data, entry->d.nlen}
|
|
|
}, 2);
|
|
|
+ lfs_entry_fromle32(&entry->d);
|
|
|
+ return err;
|
|
|
}
|
|
|
|
|
|
// we need to allocate a new dir block
|
|
|
@@ -614,10 +667,12 @@ static int lfs_dir_append(lfs_t *lfs, lfs_dir_t *dir,
|
|
|
newdir.d.tail[0] = dir->d.tail[0];
|
|
|
newdir.d.tail[1] = dir->d.tail[1];
|
|
|
entry->off = newdir.d.size - 4;
|
|
|
+ lfs_entry_tole32(&entry->d);
|
|
|
err = lfs_dir_commit(lfs, &newdir, (struct lfs_region[]){
|
|
|
{entry->off, 0, &entry->d, sizeof(entry->d)},
|
|
|
{entry->off, 0, data, entry->d.nlen}
|
|
|
}, 2);
|
|
|
+ lfs_entry_fromle32(&entry->d);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
@@ -703,6 +758,7 @@ static int lfs_dir_next(lfs_t *lfs, lfs_dir_t *dir, lfs_entry_t *entry) {
|
|
|
|
|
|
int err = lfs_bd_read(lfs, dir->pair[0], dir->off,
|
|
|
&entry->d, sizeof(entry->d));
|
|
|
+ lfs_entry_fromle32(&entry->d);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
@@ -1065,11 +1121,12 @@ static int lfs_ctz_find(lfs_t *lfs,
|
|
|
lfs_ctz(current));
|
|
|
|
|
|
int err = lfs_cache_read(lfs, rcache, pcache, head, 4*skip, &head, 4);
|
|
|
+ head = lfs_fromle32(head);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
|
|
|
- assert(head >= 2 && head <= lfs->cfg->block_count);
|
|
|
+ LFS_ASSERT(head >= 2 && head <= lfs->cfg->block_count);
|
|
|
current -= 1 << skip;
|
|
|
}
|
|
|
|
|
|
@@ -1089,7 +1146,7 @@ static int lfs_ctz_extend(lfs_t *lfs,
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
- assert(nblock >= 2 && nblock <= lfs->cfg->block_count);
|
|
|
+ LFS_ASSERT(nblock >= 2 && nblock <= lfs->cfg->block_count);
|
|
|
|
|
|
if (true) {
|
|
|
err = lfs_bd_erase(lfs, nblock);
|
|
|
@@ -1140,8 +1197,10 @@ static int lfs_ctz_extend(lfs_t *lfs,
|
|
|
lfs_size_t skips = lfs_ctz(index) + 1;
|
|
|
|
|
|
for (lfs_off_t i = 0; i < skips; i++) {
|
|
|
+ head = lfs_tole32(head);
|
|
|
err = lfs_cache_prog(lfs, pcache, rcache,
|
|
|
nblock, 4*i, &head, 4);
|
|
|
+ head = lfs_fromle32(head);
|
|
|
if (err) {
|
|
|
if (err == LFS_ERR_CORRUPT) {
|
|
|
goto relocate;
|
|
|
@@ -1152,12 +1211,13 @@ static int lfs_ctz_extend(lfs_t *lfs,
|
|
|
if (i != skips-1) {
|
|
|
err = lfs_cache_read(lfs, rcache, NULL,
|
|
|
head, 4*i, &head, 4);
|
|
|
+ head = lfs_fromle32(head);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
- assert(head >= 2 && head <= lfs->cfg->block_count);
|
|
|
+ LFS_ASSERT(head >= 2 && head <= lfs->cfg->block_count);
|
|
|
}
|
|
|
|
|
|
*block = nblock;
|
|
|
@@ -1196,6 +1256,8 @@ static int lfs_ctz_traverse(lfs_t *lfs,
|
|
|
lfs_block_t heads[2];
|
|
|
int count = 2 - (index & 1);
|
|
|
err = lfs_cache_read(lfs, rcache, pcache, head, 0, &heads, count*4);
|
|
|
+ heads[0] = lfs_fromle32(heads[0]);
|
|
|
+ heads[1] = lfs_fromle32(heads[1]);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
@@ -1281,12 +1343,12 @@ int lfs_file_open(lfs_t *lfs, lfs_file_t *file,
|
|
|
if (lfs->cfg->file_buffer) {
|
|
|
file->cache.buffer = lfs->cfg->file_buffer;
|
|
|
} else if ((file->flags & 3) == LFS_O_RDONLY) {
|
|
|
- file->cache.buffer = malloc(lfs->cfg->read_size);
|
|
|
+ file->cache.buffer = lfs_malloc(lfs->cfg->read_size);
|
|
|
if (!file->cache.buffer) {
|
|
|
return LFS_ERR_NOMEM;
|
|
|
}
|
|
|
} else {
|
|
|
- file->cache.buffer = malloc(lfs->cfg->prog_size);
|
|
|
+ file->cache.buffer = lfs_malloc(lfs->cfg->prog_size);
|
|
|
if (!file->cache.buffer) {
|
|
|
return LFS_ERR_NOMEM;
|
|
|
}
|
|
|
@@ -1312,7 +1374,7 @@ int lfs_file_close(lfs_t *lfs, lfs_file_t *file) {
|
|
|
|
|
|
// clean up memory
|
|
|
if (!lfs->cfg->file_buffer) {
|
|
|
- free(file->cache.buffer);
|
|
|
+ lfs_free(file->cache.buffer);
|
|
|
}
|
|
|
|
|
|
return err;
|
|
|
@@ -1456,11 +1518,12 @@ int lfs_file_sync(lfs_t *lfs, lfs_file_t *file) {
|
|
|
lfs_entry_t entry = {.off = file->poff};
|
|
|
err = lfs_bd_read(lfs, cwd.pair[0], entry.off,
|
|
|
&entry.d, sizeof(entry.d));
|
|
|
+ lfs_entry_fromle32(&entry.d);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
|
|
|
- assert(entry.d.type == LFS_TYPE_REG);
|
|
|
+ LFS_ASSERT(entry.d.type == LFS_TYPE_REG);
|
|
|
entry.d.u.file.head = file->head;
|
|
|
entry.d.u.file.size = file->size;
|
|
|
|
|
|
@@ -1686,7 +1749,7 @@ int lfs_file_truncate(lfs_t *lfs, lfs_file_t *file, lfs_off_t size) {
|
|
|
|
|
|
// flush+seek if not already at end
|
|
|
if (file->pos != oldsize) {
|
|
|
- int err = lfs_file_seek(lfs, file, 0, SEEK_END);
|
|
|
+ int err = lfs_file_seek(lfs, file, 0, LFS_SEEK_END);
|
|
|
if (err < 0) {
|
|
|
return err;
|
|
|
}
|
|
|
@@ -1819,7 +1882,7 @@ int lfs_remove(lfs_t *lfs, const char *path) {
|
|
|
return res;
|
|
|
}
|
|
|
|
|
|
- assert(res); // must have pred
|
|
|
+ LFS_ASSERT(res); // must have pred
|
|
|
cwd.d.tail[0] = dir.d.tail[0];
|
|
|
cwd.d.tail[1] = dir.d.tail[1];
|
|
|
|
|
|
@@ -1936,7 +1999,7 @@ int lfs_rename(lfs_t *lfs, const char *oldpath, const char *newpath) {
|
|
|
return res;
|
|
|
}
|
|
|
|
|
|
- assert(res); // must have pred
|
|
|
+ LFS_ASSERT(res); // must have pred
|
|
|
newcwd.d.tail[0] = dir.d.tail[0];
|
|
|
newcwd.d.tail[1] = dir.d.tail[1];
|
|
|
|
|
|
@@ -1959,7 +2022,7 @@ static int lfs_init(lfs_t *lfs, const struct lfs_config *cfg) {
|
|
|
if (lfs->cfg->read_buffer) {
|
|
|
lfs->rcache.buffer = lfs->cfg->read_buffer;
|
|
|
} else {
|
|
|
- lfs->rcache.buffer = malloc(lfs->cfg->read_size);
|
|
|
+ lfs->rcache.buffer = lfs_malloc(lfs->cfg->read_size);
|
|
|
if (!lfs->rcache.buffer) {
|
|
|
return LFS_ERR_NOMEM;
|
|
|
}
|
|
|
@@ -1970,30 +2033,30 @@ static int lfs_init(lfs_t *lfs, const struct lfs_config *cfg) {
|
|
|
if (lfs->cfg->prog_buffer) {
|
|
|
lfs->pcache.buffer = lfs->cfg->prog_buffer;
|
|
|
} else {
|
|
|
- lfs->pcache.buffer = malloc(lfs->cfg->prog_size);
|
|
|
+ lfs->pcache.buffer = lfs_malloc(lfs->cfg->prog_size);
|
|
|
if (!lfs->pcache.buffer) {
|
|
|
return LFS_ERR_NOMEM;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
// setup lookahead, round down to nearest 32-bits
|
|
|
- assert(lfs->cfg->lookahead % 32 == 0);
|
|
|
- assert(lfs->cfg->lookahead > 0);
|
|
|
+ LFS_ASSERT(lfs->cfg->lookahead % 32 == 0);
|
|
|
+ LFS_ASSERT(lfs->cfg->lookahead > 0);
|
|
|
if (lfs->cfg->lookahead_buffer) {
|
|
|
lfs->free.buffer = lfs->cfg->lookahead_buffer;
|
|
|
} else {
|
|
|
- lfs->free.buffer = malloc(lfs->cfg->lookahead/8);
|
|
|
+ lfs->free.buffer = lfs_malloc(lfs->cfg->lookahead/8);
|
|
|
if (!lfs->free.buffer) {
|
|
|
return LFS_ERR_NOMEM;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
// check that program and read sizes are multiples of the block size
|
|
|
- assert(lfs->cfg->prog_size % lfs->cfg->read_size == 0);
|
|
|
- assert(lfs->cfg->block_size % lfs->cfg->prog_size == 0);
|
|
|
+ LFS_ASSERT(lfs->cfg->prog_size % lfs->cfg->read_size == 0);
|
|
|
+ LFS_ASSERT(lfs->cfg->block_size % lfs->cfg->prog_size == 0);
|
|
|
|
|
|
// check that the block size is large enough to fit ctz pointers
|
|
|
- assert(4*lfs_npw2(0xffffffff / (lfs->cfg->block_size-2*4))
|
|
|
+ LFS_ASSERT(4*lfs_npw2(0xffffffff / (lfs->cfg->block_size-2*4))
|
|
|
<= lfs->cfg->block_size);
|
|
|
|
|
|
// setup default state
|
|
|
@@ -2009,15 +2072,15 @@ static int lfs_init(lfs_t *lfs, const struct lfs_config *cfg) {
|
|
|
static int lfs_deinit(lfs_t *lfs) {
|
|
|
// free allocated memory
|
|
|
if (!lfs->cfg->read_buffer) {
|
|
|
- free(lfs->rcache.buffer);
|
|
|
+ lfs_free(lfs->rcache.buffer);
|
|
|
}
|
|
|
|
|
|
if (!lfs->cfg->prog_buffer) {
|
|
|
- free(lfs->pcache.buffer);
|
|
|
+ lfs_free(lfs->pcache.buffer);
|
|
|
}
|
|
|
|
|
|
if (!lfs->cfg->lookahead_buffer) {
|
|
|
- free(lfs->free.buffer);
|
|
|
+ lfs_free(lfs->free.buffer);
|
|
|
}
|
|
|
|
|
|
return 0;
|
|
|
@@ -2075,6 +2138,7 @@ int lfs_format(lfs_t *lfs, const struct lfs_config *cfg) {
|
|
|
superdir.d.size = sizeof(superdir.d) + sizeof(superblock.d) + 4;
|
|
|
|
|
|
// write both pairs to be safe
|
|
|
+ lfs_superblock_tole32(&superblock.d);
|
|
|
bool valid = false;
|
|
|
for (int i = 0; i < 2; i++) {
|
|
|
err = lfs_dir_commit(lfs, &superdir, (struct lfs_region[]){
|
|
|
@@ -2125,6 +2189,7 @@ int lfs_mount(lfs_t *lfs, const struct lfs_config *cfg) {
|
|
|
if (!err) {
|
|
|
err = lfs_bd_read(lfs, dir.pair[0], sizeof(dir.d),
|
|
|
&superblock.d, sizeof(superblock.d));
|
|
|
+ lfs_superblock_fromle32(&superblock.d);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
@@ -2182,6 +2247,7 @@ int lfs_traverse(lfs_t *lfs, int (*cb)(void*, lfs_block_t), void *data) {
|
|
|
while (dir.off + sizeof(entry.d) <= (0x7fffffff & dir.d.size)-4) {
|
|
|
err = lfs_bd_read(lfs, dir.pair[0], dir.off,
|
|
|
&entry.d, sizeof(entry.d));
|
|
|
+ lfs_entry_fromle32(&entry.d);
|
|
|
if (err) {
|
|
|
return err;
|
|
|
}
|
|
|
@@ -2222,7 +2288,7 @@ int lfs_traverse(lfs_t *lfs, int (*cb)(void*, lfs_block_t), void *data) {
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
-
|
|
|
+
|
|
|
return 0;
|
|
|
}
|
|
|
|
|
|
@@ -2256,7 +2322,7 @@ static int lfs_parent(lfs_t *lfs, const lfs_block_t dir[2],
|
|
|
if (lfs_pairisnull(lfs->root)) {
|
|
|
return 0;
|
|
|
}
|
|
|
-
|
|
|
+
|
|
|
parent->d.tail[0] = 0;
|
|
|
parent->d.tail[1] = 1;
|
|
|
|
|
|
@@ -2317,7 +2383,7 @@ static int lfs_moved(lfs_t *lfs, const void *e) {
|
|
|
break;
|
|
|
}
|
|
|
|
|
|
- if (!(0x80 & entry.d.type) &&
|
|
|
+ if (!(0x80 & entry.d.type) &&
|
|
|
memcmp(&entry.d.u, e, sizeof(entry.d.u)) == 0) {
|
|
|
return true;
|
|
|
}
|