123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216 |
- /*
- * Copyright (C) 2017 National Institute of Advanced Industrial Science
- * and Technology (AIST)
- *
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- * Redistributions of source code must retain the above copyright notice, this
- * list of conditions and the following disclaimer.
- *
- * 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.
- *
- * Neither the name of AIST 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 COPYRIGHT HOLDERS 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 COPYRIGHT HOLDER 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.
- */
- #include <string.h>
- #include <stdint.h>
- #include <stdio.h>
- #include "romfs.h"
- #include "esp_spi_flash.h"
- #define RFS_STRING_MAX 64
- static u32_be_t cache[(RFS_STRING_MAX + 32) / 4];
- static romfs_inode_t ci = (romfs_inode_t)cache;
- static romfs_t cr = (romfs_t)cache;
- static void
- set_cache(romfs_inode_t inode, size_t len)
- {
- spi_flash_read((uint32_t)inode, cache, len);
- }
- static uint32_t
- ntohl(const u32_be_t be)
- {
- return ((be >> 24) & 0xff) |
- ((be >> 16) & 0xff) << 8 |
- ((be >> 8) & 0xff) << 16 |
- (be & 0xff) << 24;
- }
- static romfs_inode_t
- romfs_lookup(romfs_t romfs, romfs_inode_t start, const char *path);
- static int
- plus_padding(const uint8_t *s)
- {
- int n;
-
- set_cache((romfs_inode_t)s, RFS_STRING_MAX);
- n = strlen((const char *)cache);
- if (!(n & 15))
- n += 0x10;
- return (n + 15) & ~15;
- }
- static romfs_inode_t
- skip_and_pad(romfs_inode_t ri)
- {
- const uint8_t *p = ((const uint8_t *)ri) + sizeof(*ri);
- return (romfs_inode_t)(p + plus_padding(p));
- }
- size_t
- romfs_mount_check(romfs_t romfs)
- {
- set_cache((romfs_inode_t)romfs, sizeof(*romfs));
- if (cr->magic1 != 0x6d6f722d ||
- cr->magic2 != 0x2d736631)
- return 0;
- return ntohl(cr->size);
- }
- static romfs_inode_t
- romfs_symlink(romfs_t romfs, romfs_inode_t level, romfs_inode_t i)
- {
- const char *p = (const char *)skip_and_pad(i);
- if (*p == '/') {
- level = skip_and_pad((romfs_inode_t)romfs);
- p++;
- }
- return romfs_lookup(romfs, level, p);
- }
- static romfs_inode_t
- dir_link(romfs_t romfs, romfs_inode_t i)
- {
- set_cache(i, sizeof(*i));
- return (romfs_inode_t)((const uint8_t *)romfs +
- ntohl(ci->dir_start));
- }
- static romfs_inode_t
- romfs_lookup(romfs_t romfs, romfs_inode_t start, const char *path)
- {
- romfs_inode_t level, i = start;
- const char *p, *n, *cp;
- uint32_t next_be;
- if (start == (romfs_inode_t)romfs)
- i = skip_and_pad((romfs_inode_t)romfs);
- level = i;
- while (i != (romfs_inode_t)romfs) {
- p = path;
- n = ((const char *)i) + sizeof(*i);
- set_cache(i, sizeof(*i));
- next_be = ci->next;
- cp = (const char *)cache;
- set_cache((romfs_inode_t)n, RFS_STRING_MAX);
- while (*p && *p != '/' && *cp && *p == *cp) {
- p++;
- n++;
- cp++;
- }
- if (!*cp && (!*p || *p == '/') &&
- (ntohl(next_be) & 7) == RFST_HARDLINK) {
- set_cache(i, sizeof(*i));
- return (romfs_inode_t)
- ((const uint8_t *)romfs +
- (ntohl(ci->dir_start) & ~15));
- }
- if (!*p && !*cp) {
- set_cache(i, sizeof(*i));
- if ((ntohl(ci->next) & 7) == RFST_SYMLINK) {
- i = romfs_symlink(romfs, level, i);
- continue;
- }
- return i;
- }
- if (*p == '/' && !*cp) {
- set_cache(i, sizeof(*i));
- switch (ntohl(ci->next) & 7) {
- case RFST_SYMLINK:
- i = romfs_symlink(romfs, level, i);
- if (!i)
- return NULL;
- i = dir_link(romfs, i);
- while (*path != '/' && *path)
- path++;
- if (!*path)
- return NULL;
- path++;
- continue;
- case RFST_DIR:
- path = p + 1;
- i = dir_link(romfs, i);
- break;
- default:
- path = p + 1;
- i = skip_and_pad(i);
- break;
- }
- level = i;
- continue;
- }
- set_cache(i, sizeof(*i));
- if (!(ntohl(ci->next) & ~15))
- return NULL;
- i = (romfs_inode_t)((const uint8_t *)romfs +
- (ntohl(ci->next) & ~15));
- }
- return NULL;
- }
- const void *
- romfs_get_info(romfs_t romfs, const char *path, size_t *len)
- {
- romfs_inode_t i;
-
- if (*path == '/')
- path++;
- i = romfs_lookup(romfs, (romfs_inode_t)romfs, path);
- if (!i)
- return NULL;
- set_cache(i, sizeof(*i));
- *len = ntohl(ci->size);
- return (void *)skip_and_pad(i);
- }
|