luat_fs_mem.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928
  1. #include "luat_base.h"
  2. #include "luat_fs.h"
  3. #include "luat_mem.h"
  4. #define LUAT_LOG_TAG "fs"
  5. #include "luat_log.h"
  6. #if 0
  7. #define BLOCK_SIZE 4096
  8. typedef struct ram_file_block
  9. {
  10. uint8_t data[BLOCK_SIZE];
  11. struct ram_file_block* next;
  12. } ram_file_block_t;
  13. typedef struct ram_file
  14. {
  15. size_t size; // 当前文件大小
  16. char name[32]; // 文件名称
  17. ram_file_block_t* head; // 链表头指针
  18. } ram_file_t;
  19. typedef struct luat_ram_fd
  20. {
  21. int fid;
  22. uint32_t offset;
  23. uint8_t readonly;
  24. } luat_raw_fd_t;
  25. #define RAM_FILE_MAX (64)
  26. static ram_file_t* files[RAM_FILE_MAX];
  27. FILE* luat_vfs_ram_fopen(void* userdata, const char *filename, const char *mode) {
  28. (void)userdata;
  29. // LLOGD("ram fs open %s %s", filename, mode);
  30. if (filename == NULL || mode == NULL || strlen(filename) > 31)
  31. return NULL;
  32. // 读文件
  33. if (!strcmp("r", mode) || !strcmp("rb", mode)) {
  34. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  35. {
  36. if (files[i] == NULL)
  37. continue;
  38. if (!strcmp(files[i]->name, filename)) {
  39. luat_raw_fd_t* fd = luat_heap_malloc(sizeof(luat_raw_fd_t));
  40. if (fd == NULL) {
  41. LLOGE("out of memory when malloc luat_raw_fd_t");
  42. return NULL;
  43. }
  44. fd->fid = i;
  45. fd->offset = 0;
  46. fd->readonly = 1;
  47. return (FILE*)fd;
  48. }
  49. }
  50. return NULL;
  51. }
  52. // 写文件
  53. else if (!strcmp("w", mode) || !strcmp("wb", mode) || !strcmp("w+", mode) || !strcmp("wb+", mode) || !strcmp("w+b", mode) || !strcmp("r+", mode) || !strcmp("rb+", mode) || !strcmp("r+b", mode)) {
  54. // 先看看是否存在, 如果存在就重用老的
  55. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  56. {
  57. if (files[i] == NULL)
  58. continue;
  59. if (!strcmp(files[i]->name, filename)) {
  60. luat_raw_fd_t* fd = luat_heap_malloc(sizeof(luat_raw_fd_t));
  61. if (fd == NULL) {
  62. LLOGE("out of memory when malloc luat_raw_fd_t");
  63. return NULL;
  64. }
  65. fd->fid = i;
  66. fd->readonly = 0;
  67. fd->offset = 0;
  68. if (!strcmp("w+", mode) || !strcmp("wb+", mode) || !strcmp("w+b", mode)) {
  69. // 截断模式
  70. files[i]->size = 0;
  71. ram_file_block_t* block = files[i]->head;
  72. while (block) {
  73. ram_file_block_t* next = block->next;
  74. luat_heap_free(block);
  75. block = next;
  76. }
  77. files[i]->head = NULL;
  78. }
  79. return (FILE*)fd;
  80. }
  81. }
  82. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  83. {
  84. if (files[i] != NULL)
  85. continue;
  86. ram_file_t *file = luat_heap_malloc(sizeof(ram_file_t));
  87. if (file == NULL) {
  88. LLOGE("out of memory when malloc ram_file_t");
  89. return NULL;
  90. }
  91. memset(file, 0, sizeof(ram_file_t));
  92. strcpy(file->name, filename);
  93. files[i] = file;
  94. luat_raw_fd_t* fd = luat_heap_malloc(sizeof(luat_raw_fd_t));
  95. if (fd == NULL) {
  96. LLOGE("out of memory when malloc luat_raw_fd_t");
  97. return NULL;
  98. }
  99. fd->fid = i;
  100. fd->offset = 0;
  101. fd->readonly = 0;
  102. return (FILE*)fd;
  103. }
  104. }
  105. // 追加模式
  106. else if (!strcmp("a", mode) || !strcmp("ab", mode) || !strcmp("a+", mode) || !strcmp("ab+", mode) || !strcmp("a+b", mode) ) {
  107. // 先看看是否存在, 如果存在就重用老的
  108. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  109. {
  110. if (files[i] == NULL)
  111. continue;
  112. if (!strcmp(files[i]->name, filename)) {
  113. luat_raw_fd_t* fd = luat_heap_malloc(sizeof(luat_raw_fd_t));
  114. if (fd == NULL) {
  115. LLOGE("out of memory when malloc luat_raw_fd_t");
  116. return NULL;
  117. }
  118. fd->fid = i;
  119. fd->offset = files[i]->size;
  120. fd->readonly = 0;
  121. return (FILE*)fd;
  122. }
  123. }
  124. }
  125. else {
  126. LLOGE("unkown open mode %s", mode);
  127. return NULL;
  128. }
  129. LLOGE("too many ram files >= %d", RAM_FILE_MAX);
  130. return NULL;
  131. }
  132. int luat_vfs_ram_getc(void* userdata, FILE* stream) {
  133. (void)userdata;
  134. //LLOGD("getc %p %p", userdata, stream);
  135. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  136. //LLOGD("getc %p %p %d %d", userdata, stream, fd->offset, fd->size);
  137. if (fd->fid < 0 || fd->fid >= RAM_FILE_MAX) {
  138. return -1;
  139. }
  140. if (files[fd->fid] == NULL) {
  141. return -1;
  142. }
  143. ram_file_block_t* block = files[fd->fid]->head;
  144. size_t offset = fd->offset;
  145. while (block) {
  146. if (offset < BLOCK_SIZE) {
  147. uint8_t c = block->data[offset];
  148. if (c == '\0') {
  149. return -1;
  150. }
  151. fd->offset++;
  152. return c;
  153. }
  154. offset -= BLOCK_SIZE;
  155. block = block->next;
  156. }
  157. return -1;
  158. }
  159. int luat_vfs_ram_fseek(void* userdata, FILE* stream, long int offset, int origin) {
  160. (void)userdata;
  161. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  162. // LLOGE("luat_vfs_ram_fseek seek %p %p %d %d", userdata, stream, offset, origin);
  163. if (origin == SEEK_CUR) {
  164. fd->offset += offset;
  165. }
  166. else if (origin == SEEK_SET) {
  167. fd->offset = offset;
  168. }
  169. else {
  170. fd->offset = files[fd->fid]->size - offset;
  171. }
  172. return 0;
  173. }
  174. int luat_vfs_ram_ftell(void* userdata, FILE* stream) {
  175. (void)userdata;
  176. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  177. // LLOGD("tell %p %p offset %d", userdata, stream, fd->offset);
  178. return fd->offset;
  179. }
  180. int luat_vfs_ram_fclose(void* userdata, FILE* stream) {
  181. (void)userdata;
  182. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  183. //LLOGD("fclose %p %p %d %d", userdata, stream, fd->size, fd->offset);
  184. luat_heap_free(fd);
  185. return 0;
  186. }
  187. int luat_vfs_ram_feof(void* userdata, FILE* stream) {
  188. (void)userdata;
  189. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  190. //LLOGD("feof %p %p %d %d", userdata, stream, fd->size, fd->offset);
  191. return fd->offset >= files[fd->fid]->size ? 1 : 0;
  192. }
  193. int luat_vfs_ram_ferror(void* userdata, FILE *stream) {
  194. (void)userdata;
  195. (void)stream;
  196. return 0;
  197. }
  198. size_t luat_vfs_ram_fread(void* userdata, void *ptr, size_t size, size_t nmemb, FILE *stream) {
  199. (void)userdata;
  200. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  201. size_t read_size = size * nmemb;
  202. // 如果偏移量已经超出文件大小
  203. if (fd->offset >= files[fd->fid]->size) {
  204. LLOGW("offset %d >= size %d", fd->offset, files[fd->fid]->size);
  205. return 0;
  206. }
  207. // 如果读取的大小超出文件剩余大小,调整读取大小
  208. if (fd->offset + read_size > files[fd->fid]->size) {
  209. read_size = files[fd->fid]->size - fd->offset;
  210. }
  211. // 找到offset对应的起始block
  212. ram_file_block_t* block = files[fd->fid]->head;
  213. size_t offset = fd->offset;
  214. while (block != NULL && offset >= BLOCK_SIZE) {
  215. offset -= BLOCK_SIZE;
  216. block = block->next;
  217. }
  218. // 如果没有找到对应的block
  219. if (block == NULL) {
  220. LLOGW("no block for offset %d", fd->offset);
  221. return 0;
  222. }
  223. // 开始读取
  224. uint8_t* dst = (uint8_t*)ptr;
  225. size_t bytes_read = 0; // 用于记录实际读取的字节数
  226. while (block != NULL && read_size > 0) {
  227. size_t copy_size = BLOCK_SIZE - (offset % BLOCK_SIZE);
  228. if (copy_size > read_size) {
  229. copy_size = read_size;
  230. }
  231. memcpy(dst, block->data + (offset % BLOCK_SIZE), copy_size);
  232. dst += copy_size;
  233. read_size -= copy_size;
  234. offset += copy_size;
  235. bytes_read += copy_size; // 累加读取的字节数
  236. if (offset % BLOCK_SIZE == 0) {
  237. block = block->next;
  238. }
  239. }
  240. fd->offset += bytes_read; // 更新文件偏移量
  241. return bytes_read; // 返回实际读取的字节数
  242. }
  243. size_t luat_vfs_ram_fwrite(void* userdata, const void *ptr, size_t size, size_t nmemb, FILE *stream) {
  244. (void)userdata;
  245. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  246. size_t write_size = size * nmemb;
  247. if (fd->readonly) {
  248. LLOGW("readonly fd %d!! path %s", fd->fid, files[fd->fid]->name);
  249. return 0;
  250. }
  251. // 计算最终需要的总大小
  252. size_t total_size = fd->offset + write_size;
  253. size_t current_size = files[fd->fid]->size; // 当前文件大小
  254. // 先补齐block
  255. ram_file_block_t* block = files[fd->fid]->head;
  256. size_t block_offset = 0; // 当前block的偏移量
  257. // 遍历现有的block,直到block_offset达到total_size
  258. while (block != NULL && block_offset < total_size) {
  259. block_offset += BLOCK_SIZE;
  260. block = block->next;
  261. }
  262. // 如果block_offset小于total_size,继续分配新的block
  263. while (block_offset < total_size) {
  264. block = luat_heap_malloc(sizeof(ram_file_block_t));
  265. if (block == NULL) {
  266. LLOGW("out of memory when malloc ram_file_block_t");
  267. return 0;
  268. }
  269. memset(block, 0, sizeof(ram_file_block_t));
  270. block->next = NULL;
  271. // 将新分配的block链接到链表末尾
  272. if (files[fd->fid]->head == NULL) {
  273. files[fd->fid]->head = block;
  274. } else {
  275. ram_file_block_t* last = files[fd->fid]->head;
  276. while (last->next) {
  277. last = last->next;
  278. }
  279. last->next = block;
  280. }
  281. block_offset += BLOCK_SIZE;
  282. }
  283. // 现在偏移到offset对应的block
  284. block = files[fd->fid]->head;
  285. size_t offset = fd->offset;
  286. while (block != NULL && offset >= BLOCK_SIZE) {
  287. offset -= BLOCK_SIZE;
  288. block = block->next;
  289. }
  290. // 开始写
  291. const uint8_t* src = (const uint8_t*)ptr;
  292. while (write_size > 0) {
  293. size_t copy_size = BLOCK_SIZE - (offset % BLOCK_SIZE);
  294. if (copy_size > write_size) {
  295. copy_size = write_size;
  296. }
  297. memcpy(block->data + (offset % BLOCK_SIZE), src, copy_size);
  298. src += copy_size;
  299. write_size -= copy_size;
  300. offset += copy_size;
  301. if (offset % BLOCK_SIZE == 0) {
  302. block = block->next;
  303. }
  304. }
  305. fd->offset += (size_t)(src - (const uint8_t*)ptr);
  306. files[fd->fid]->size = offset > files[fd->fid]->size ? offset : files[fd->fid]->size;
  307. // 打印一下写入的数据
  308. // LLOGD("write data %s", (char*)ptr);
  309. return (size_t)(src - (const uint8_t*)ptr);
  310. }
  311. int luat_vfs_ram_remove(void* userdata, const char *filename) {
  312. (void)userdata;
  313. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  314. {
  315. if (files[i] == NULL)
  316. continue;
  317. if (!strcmp(filename, files[i]->name)) {
  318. ram_file_block_t* block = files[i]->head;
  319. while (block) {
  320. ram_file_block_t* next = block->next;
  321. luat_heap_free(block);
  322. block = next;
  323. }
  324. luat_heap_free(files[i]);
  325. files[i] = NULL;
  326. return 0;
  327. }
  328. }
  329. return 0;
  330. }
  331. int luat_vfs_ram_rename(void* userdata, const char *old_filename, const char *new_filename) {
  332. (void)userdata;
  333. if (old_filename == NULL || new_filename == NULL)
  334. return -1;
  335. if (strlen(old_filename) > 31 || strlen(new_filename) > 31)
  336. return -2;
  337. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  338. {
  339. if (files[i] == NULL)
  340. continue;
  341. if (!strcmp(old_filename, files[i]->name)) {
  342. strcpy(files[i]->name, new_filename);
  343. return 0;
  344. }
  345. }
  346. return 0;
  347. }
  348. int luat_vfs_ram_fexist(void* userdata, const char *filename) {
  349. (void)userdata;
  350. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  351. {
  352. if (files[i] == NULL)
  353. continue;
  354. if (!strcmp(filename, files[i]->name)) {
  355. return 1;
  356. }
  357. }
  358. return 0;
  359. }
  360. size_t luat_vfs_ram_fsize(void* userdata, const char *filename) {
  361. (void)userdata;
  362. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  363. {
  364. if (files[i] == NULL)
  365. continue;
  366. if (!strcmp(filename, files[i]->name)) {
  367. return files[i]->size;
  368. }
  369. }
  370. return 0;
  371. }
  372. void* luat_vfs_ram_mmap(void* userdata, FILE *stream) {
  373. (void)userdata;
  374. luat_raw_fd_t *fd = (luat_raw_fd_t*)(stream);
  375. //LLOGD("fsize %p %p %d %d", userdata, fd);
  376. return files[fd->fid]->head->data;
  377. }
  378. int luat_vfs_ram_mkfs(void* userdata, luat_fs_conf_t *conf) {
  379. (void)userdata;
  380. (void)conf;
  381. return -1;
  382. }
  383. int luat_vfs_ram_mount(void** userdata, luat_fs_conf_t *conf) {
  384. (void)userdata;
  385. (void)conf;
  386. return 0;
  387. }
  388. int luat_vfs_ram_umount(void* userdata, luat_fs_conf_t *conf) {
  389. (void)userdata;
  390. (void)conf;
  391. return 0;
  392. }
  393. int luat_vfs_ram_mkdir(void* userdata, char const* _DirName) {
  394. (void)userdata;
  395. (void)_DirName;
  396. return -1;
  397. }
  398. int luat_vfs_ram_rmdir(void* userdata, char const* _DirName) {
  399. (void)userdata;
  400. (void)_DirName;
  401. return -1;
  402. }
  403. int luat_vfs_ram_lsdir(void* userdata, char const* _DirName, luat_fs_dirent_t* ents, size_t offset, size_t len) {
  404. (void)userdata;
  405. (void)_DirName;
  406. size_t count = 0;
  407. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  408. {
  409. if (count >= len)
  410. break;
  411. if (files[i] == NULL)
  412. continue;
  413. if (offset > 0) {
  414. offset --;
  415. continue;
  416. }
  417. ents[count].d_type = 0;
  418. strcpy(ents[count].d_name, files[i]->name);
  419. count ++;
  420. }
  421. return count;
  422. }
  423. int luat_vfs_ram_info(void* userdata, const char* path, luat_fs_info_t *conf) {
  424. (void)userdata;
  425. (void)path;
  426. memcpy(conf->filesystem, "ram", strlen("ram")+1);
  427. size_t ftotal = 0;
  428. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  429. {
  430. if (files[i] == NULL)
  431. continue;
  432. ftotal += files[i]->size;
  433. }
  434. size_t total; size_t used; size_t max_used;
  435. luat_meminfo_sys(&total, &used, &max_used);
  436. conf->type = 0;
  437. conf->total_block = 64;
  438. conf->block_used = (ftotal + BLOCK_SIZE) / BLOCK_SIZE;
  439. conf->block_size = BLOCK_SIZE;
  440. return 0;
  441. }
  442. int luat_vfs_ram_truncate(void* fsdata, char const* path, size_t nsize) {
  443. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  444. {
  445. if (files[i] == NULL)
  446. continue;
  447. if (!strcmp(files[i]->name, path)) {
  448. ram_file_block_t* block = files[i]->head;
  449. size_t offset = 0;
  450. while (block) {
  451. if (offset + BLOCK_SIZE > nsize) {
  452. memset(block->data + (nsize - offset), 0, BLOCK_SIZE - (nsize - offset));
  453. }
  454. offset += BLOCK_SIZE;
  455. block = block->next;
  456. }
  457. files[i]->size = nsize;
  458. return 0;
  459. }
  460. }
  461. return 0;
  462. }
  463. #else
  464. typedef struct ram_file
  465. {
  466. size_t size; // 当前文件大小, 也是指针对应内存块的大小
  467. // size_t ptr_size; // 数值指针的大小
  468. char name[32]; // 文件名称
  469. char ptr[4];
  470. }ram_file_t;
  471. typedef struct luat_ram_fd
  472. {
  473. int fid;
  474. uint32_t offset;
  475. uint8_t readonly;
  476. }luat_raw_fd_t;
  477. #define RAM_FILE_MAX (64)
  478. static ram_file_t* files[RAM_FILE_MAX];
  479. FILE* luat_vfs_ram_fopen(void* userdata, const char *filename, const char *mode) {
  480. (void)userdata;
  481. // LLOGD("ram fs open %s %s", filename, mode);
  482. if (filename == NULL || mode == NULL || strlen(filename) > 31)
  483. return NULL;
  484. // 读文件
  485. if (!strcmp("r", mode) || !strcmp("rb", mode)) {
  486. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  487. {
  488. if (files[i]== NULL)
  489. continue;
  490. if (!strcmp(files[i]->name, filename)) {
  491. luat_raw_fd_t* fd = luat_heap_malloc(sizeof(luat_raw_fd_t));
  492. if (fd == NULL) {
  493. LLOGE("out of memory when malloc luat_raw_fd_t");
  494. return NULL;
  495. }
  496. fd->fid = i;
  497. fd->offset = 0;
  498. fd->readonly = 1;
  499. return (FILE*)fd;
  500. }
  501. }
  502. return NULL;
  503. }
  504. // 写文件
  505. else if (!strcmp("w", mode) || !strcmp("wb", mode) || !strcmp("w+", mode) || !strcmp("wb+", mode) || !strcmp("w+b", mode) || !strcmp("r+", mode) || !strcmp("rb+", mode) || !strcmp("r+b", mode)) {
  506. // 先看看是否存在, 如果存在就重用老的
  507. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  508. {
  509. if (files[i]== NULL)
  510. continue;
  511. if (!strcmp(files[i]->name, filename)) {
  512. luat_raw_fd_t* fd = luat_heap_malloc(sizeof(luat_raw_fd_t));
  513. if (fd == NULL) {
  514. LLOGE("out of memory when malloc luat_raw_fd_t");
  515. return NULL;
  516. }
  517. fd->fid = i;
  518. fd->readonly = 0;
  519. fd->offset = 0;
  520. if (!strcmp("w+", mode) || !strcmp("wb+", mode) || !strcmp("w+b", mode)) {
  521. // 截断模式
  522. char* tmp = luat_heap_realloc(files[i], sizeof(ram_file_t));
  523. if (tmp) {
  524. files[i] = (ram_file_t*)tmp;
  525. }
  526. else {
  527. LLOGE("realloc ram_file_t failed");
  528. luat_heap_free(fd);
  529. return NULL;
  530. }
  531. files[i]->size = 0;
  532. }
  533. return (FILE*)fd;
  534. }
  535. }
  536. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  537. {
  538. if (files[i] != NULL)
  539. continue;
  540. ram_file_t *file = luat_heap_malloc(sizeof(ram_file_t));
  541. if (file == NULL) {
  542. LLOGE("out of memory when malloc ram_file_t");
  543. return NULL;
  544. }
  545. memset(file, 0, sizeof(ram_file_t));
  546. strcpy(file->name, filename);
  547. files[i] = file;
  548. luat_raw_fd_t* fd = luat_heap_malloc(sizeof(luat_raw_fd_t));
  549. if (fd == NULL) {
  550. LLOGE("out of memory when malloc luat_raw_fd_t");
  551. return NULL;
  552. }
  553. fd->fid = i;
  554. fd->offset = 0;
  555. fd->readonly = 0;
  556. return (FILE*)fd;
  557. }
  558. }
  559. // 追加模式
  560. else if (!strcmp("a", mode) || !strcmp("ab", mode) || !strcmp("a+", mode) || !strcmp("ab+", mode) || !strcmp("a+b", mode) ) {
  561. // 先看看是否存在, 如果存在就重用老的
  562. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  563. {
  564. if (files[i] == NULL)
  565. continue;
  566. if (!strcmp(files[i]->name, filename)) {
  567. luat_raw_fd_t* fd = luat_heap_malloc(sizeof(luat_raw_fd_t));
  568. if (fd == NULL) {
  569. LLOGE("out of memory when malloc luat_raw_fd_t");
  570. return NULL;
  571. }
  572. fd->fid = i;
  573. fd->offset = files[i]->size;
  574. fd->readonly = 0;
  575. return (FILE*)fd;
  576. }
  577. }
  578. }
  579. else {
  580. LLOGE("unkown open mode %s", mode);
  581. return NULL;
  582. }
  583. LLOGE("too many ram files >= %d", RAM_FILE_MAX);
  584. return NULL;
  585. }
  586. int luat_vfs_ram_getc(void* userdata, FILE* stream) {
  587. (void)userdata;
  588. //LLOGD("getc %p %p", userdata, stream);
  589. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  590. //LLOGD("getc %p %p %d %d", userdata, stream, fd->offset, fd->size);
  591. if (fd->fid < 0 || fd->fid >= RAM_FILE_MAX) {
  592. return -1;
  593. }
  594. if (files[fd->fid] == NULL) {
  595. return -1;
  596. }
  597. if (fd->offset < files[fd->fid]->size) {
  598. uint8_t c = (uint8_t)files[fd->fid]->ptr[fd->offset];
  599. fd->offset ++;
  600. //LLOGD("getc %02X", c);
  601. return c;
  602. }
  603. return -1;
  604. }
  605. int luat_vfs_ram_fseek(void* userdata, FILE* stream, long int offset, int origin) {
  606. (void)userdata;
  607. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  608. if (origin == SEEK_CUR) {
  609. fd->offset += offset;
  610. return 0;
  611. }
  612. else if (origin == SEEK_SET) {
  613. fd->offset = offset;
  614. return 0;
  615. }
  616. else {
  617. fd->offset = files[fd->fid]->size - offset;
  618. return 0;
  619. }
  620. }
  621. int luat_vfs_ram_ftell(void* userdata, FILE* stream) {
  622. (void)userdata;
  623. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  624. // LLOGD("tell %p %p offset %d", userdata, stream, fd->offset);
  625. return fd->offset;
  626. }
  627. int luat_vfs_ram_fclose(void* userdata, FILE* stream) {
  628. (void)userdata;
  629. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  630. //LLOGD("fclose %p %p %d %d", userdata, stream, fd->size, fd->offset);
  631. luat_heap_free(fd);
  632. return 0;
  633. }
  634. int luat_vfs_ram_feof(void* userdata, FILE* stream) {
  635. (void)userdata;
  636. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  637. //LLOGD("feof %p %p %d %d", userdata, stream, fd->size, fd->offset);
  638. return fd->offset >= files[fd->fid]->size ? 1 : 0;
  639. }
  640. int luat_vfs_ram_ferror(void* userdata, FILE *stream) {
  641. (void)userdata;
  642. (void)stream;
  643. return 0;
  644. }
  645. size_t luat_vfs_ram_fread(void* userdata, void *ptr, size_t size, size_t nmemb, FILE *stream) {
  646. (void)userdata;
  647. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  648. //LLOGD("fread %p %p %d %d", userdata, stream, fd->size, fd->offset);
  649. //LLOGD("fread2 %p %p %d %d", userdata, stream, size * nmemb, fd->offset);
  650. size_t read_size = size*nmemb;
  651. if (fd->offset >= files[fd->fid]->size) {
  652. return 0;
  653. }
  654. if (fd->offset + read_size >= files[fd->fid]->size) {
  655. read_size = files[fd->fid]->size - fd->offset;
  656. }
  657. memcpy(ptr, files[fd->fid]->ptr + fd->offset, read_size);
  658. fd->offset += read_size;
  659. return read_size;
  660. }
  661. size_t luat_vfs_ram_fwrite(void* userdata, const void *ptr, size_t size, size_t nmemb, FILE *stream) {
  662. (void)userdata;
  663. luat_raw_fd_t* fd = (luat_raw_fd_t*)stream;
  664. size_t write_size = size*nmemb;
  665. if (write_size > 128 * 1024) {
  666. LLOGW("ramfs large write !! %ld", write_size);
  667. }
  668. if (fd->readonly) {
  669. LLOGW("readonly fd %d!! path %s", fd->fid, files[fd->fid]->name);
  670. return 0;
  671. }
  672. if (fd->offset + write_size > files[fd->fid]->size) {
  673. char* ptr = luat_heap_realloc(files[fd->fid], fd->offset + write_size + sizeof(ram_file_t));
  674. if (ptr == NULL) {
  675. LLOGW("/ram out of sys memory!! %ld", write_size);
  676. return 0;
  677. }
  678. files[fd->fid] = (ram_file_t*)ptr;
  679. files[fd->fid]->size = fd->offset + write_size;
  680. }
  681. memcpy(files[fd->fid]->ptr + fd->offset, ptr, write_size);
  682. fd->offset += write_size;
  683. return write_size;
  684. }
  685. int luat_vfs_ram_remove(void* userdata, const char *filename) {
  686. (void)userdata;
  687. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  688. {
  689. if (files[i] == NULL)
  690. continue;
  691. if (!strcmp(filename, files[i]->name)) {
  692. luat_heap_free(files[i]);
  693. files[i] = NULL;
  694. }
  695. }
  696. return 0;
  697. }
  698. int luat_vfs_ram_rename(void* userdata, const char *old_filename, const char *new_filename) {
  699. (void)userdata;
  700. if (old_filename == NULL || new_filename == NULL)
  701. return -1;
  702. if (strlen(old_filename) > 31 || strlen(new_filename) > 31)
  703. return -2;
  704. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  705. {
  706. if (files[i] == NULL)
  707. continue;
  708. if (!strcmp(old_filename, files[i]->name)) {
  709. strcpy(files[i]->name, new_filename);
  710. return 0;
  711. }
  712. }
  713. return 0;
  714. }
  715. int luat_vfs_ram_fexist(void* userdata, const char *filename) {
  716. (void)userdata;
  717. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  718. {
  719. if (files[i] == NULL)
  720. continue;
  721. if (!strcmp(filename, files[i]->name)) {
  722. return 1;
  723. }
  724. }
  725. return 0;
  726. }
  727. size_t luat_vfs_ram_fsize(void* userdata, const char *filename) {
  728. (void)userdata;
  729. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  730. {
  731. if (files[i] == NULL)
  732. continue;
  733. if (!strcmp(filename, files[i]->name)) {
  734. return files[i]->size;
  735. }
  736. }
  737. return 0;
  738. }
  739. void* luat_vfs_ram_mmap(void* userdata, FILE *stream) {
  740. (void)userdata;
  741. luat_raw_fd_t *fd = (luat_raw_fd_t*)(stream);
  742. //LLOGD("fsize %p %p %d %d", userdata, fd);
  743. return files[fd->fid]->ptr;
  744. }
  745. int luat_vfs_ram_mkfs(void* userdata, luat_fs_conf_t *conf) {
  746. (void)userdata;
  747. (void)conf;
  748. return -1;
  749. }
  750. int luat_vfs_ram_mount(void** userdata, luat_fs_conf_t *conf) {
  751. (void)userdata;
  752. (void)conf;
  753. return 0;
  754. }
  755. int luat_vfs_ram_umount(void* userdata, luat_fs_conf_t *conf) {
  756. (void)userdata;
  757. (void)conf;
  758. return 0;
  759. }
  760. int luat_vfs_ram_mkdir(void* userdata, char const* _DirName) {
  761. (void)userdata;
  762. (void)_DirName;
  763. return -1;
  764. }
  765. int luat_vfs_ram_rmdir(void* userdata, char const* _DirName) {
  766. (void)userdata;
  767. (void)_DirName;
  768. return -1;
  769. }
  770. int luat_vfs_ram_lsdir(void* userdata, char const* _DirName, luat_fs_dirent_t* ents, size_t offset, size_t len) {
  771. (void)userdata;
  772. (void)_DirName;
  773. size_t count = 0;
  774. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  775. {
  776. if (count >= len)
  777. break;
  778. if (files[i] == NULL)
  779. continue;
  780. if (offset > 0) {
  781. offset --;
  782. continue;
  783. }
  784. ents[count].d_type = 0;
  785. strcpy(ents[count].d_name, files[i]->name);
  786. count ++;
  787. }
  788. return count;
  789. }
  790. int luat_vfs_ram_info(void* userdata, const char* path, luat_fs_info_t *conf) {
  791. (void)userdata;
  792. (void)path;
  793. memcpy(conf->filesystem, "ram", strlen("ram")+1);
  794. size_t ftotal = 0;
  795. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  796. {
  797. if (files[i] == NULL)
  798. continue;
  799. ftotal += files[i]->size;
  800. }
  801. size_t total; size_t used; size_t max_used;
  802. luat_meminfo_sys(&total, &used, &max_used);
  803. conf->type = 0;
  804. conf->total_block = 64;
  805. conf->block_used = (ftotal + 1023) / 1024;
  806. conf->block_size = 1024;
  807. return 0;
  808. }
  809. int luat_vfs_ram_truncate(void* fsdata, char const* path, size_t nsize) {
  810. for (size_t i = 0; i < RAM_FILE_MAX; i++)
  811. {
  812. if (files[i] == NULL)
  813. continue;
  814. if (!strcmp(files[i]->name, path)) {
  815. if (files[i]->size > nsize) {
  816. files[i]->size = nsize;
  817. char* ptr = luat_heap_realloc(files[i], nsize + sizeof(ram_file_t));
  818. if (ptr) {
  819. files[i] = (ram_file_t*)ptr;
  820. }
  821. }
  822. return 0;
  823. }
  824. }
  825. return 0;
  826. }
  827. #endif
  828. #define T(name) .name = luat_vfs_ram_##name
  829. const struct luat_vfs_filesystem vfs_fs_ram = {
  830. .name = "ram",
  831. .opts = {
  832. .mkfs = NULL,
  833. T(mount),
  834. T(umount),
  835. .mkdir = NULL,
  836. .rmdir = NULL,
  837. T(lsdir),
  838. T(remove),
  839. T(rename),
  840. T(fsize),
  841. T(fexist),
  842. T(info),
  843. T(truncate)
  844. },
  845. .fopts = {
  846. T(fopen),
  847. T(getc),
  848. T(fseek),
  849. T(ftell),
  850. T(fclose),
  851. T(feof),
  852. T(ferror),
  853. T(fread),
  854. T(fwrite)
  855. }
  856. };