test_interspersed.toml 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274
  1. [cases.test_interspersed_files]
  2. defines.SIZE = [10, 100]
  3. defines.FILES = [4, 10, 26]
  4. code = '''
  5. lfs_t lfs;
  6. lfs_file_t files[FILES];
  7. const char alphas[] = "abcdefghijklmnopqrstuvwxyz";
  8. lfs_format(&lfs, cfg) => 0;
  9. lfs_mount(&lfs, cfg) => 0;
  10. for (int j = 0; j < FILES; j++) {
  11. char path[1024];
  12. sprintf(path, "%c", alphas[j]);
  13. lfs_file_open(&lfs, &files[j], path,
  14. LFS_O_WRONLY | LFS_O_CREAT | LFS_O_EXCL) => 0;
  15. }
  16. for (int i = 0; i < SIZE; i++) {
  17. for (int j = 0; j < FILES; j++) {
  18. lfs_file_write(&lfs, &files[j], &alphas[j], 1) => 1;
  19. }
  20. }
  21. for (int j = 0; j < FILES; j++) {
  22. lfs_file_close(&lfs, &files[j]);
  23. }
  24. lfs_dir_t dir;
  25. lfs_dir_open(&lfs, &dir, "/") => 0;
  26. struct lfs_info info;
  27. lfs_dir_read(&lfs, &dir, &info) => 1;
  28. assert(strcmp(info.name, ".") == 0);
  29. assert(info.type == LFS_TYPE_DIR);
  30. lfs_dir_read(&lfs, &dir, &info) => 1;
  31. assert(strcmp(info.name, "..") == 0);
  32. assert(info.type == LFS_TYPE_DIR);
  33. for (int j = 0; j < FILES; j++) {
  34. char path[1024];
  35. sprintf(path, "%c", alphas[j]);
  36. lfs_dir_read(&lfs, &dir, &info) => 1;
  37. assert(strcmp(info.name, path) == 0);
  38. assert(info.type == LFS_TYPE_REG);
  39. assert(info.size == SIZE);
  40. }
  41. lfs_dir_read(&lfs, &dir, &info) => 0;
  42. lfs_dir_close(&lfs, &dir) => 0;
  43. for (int j = 0; j < FILES; j++) {
  44. char path[1024];
  45. sprintf(path, "%c", alphas[j]);
  46. lfs_file_open(&lfs, &files[j], path, LFS_O_RDONLY) => 0;
  47. }
  48. for (int i = 0; i < 10; i++) {
  49. for (int j = 0; j < FILES; j++) {
  50. uint8_t buffer[1024];
  51. lfs_file_read(&lfs, &files[j], buffer, 1) => 1;
  52. assert(buffer[0] == alphas[j]);
  53. }
  54. }
  55. for (int j = 0; j < FILES; j++) {
  56. lfs_file_close(&lfs, &files[j]);
  57. }
  58. lfs_unmount(&lfs) => 0;
  59. '''
  60. [cases.test_interspersed_remove_files]
  61. defines.SIZE = [10, 100]
  62. defines.FILES = [4, 10, 26]
  63. code = '''
  64. lfs_t lfs;
  65. const char alphas[] = "abcdefghijklmnopqrstuvwxyz";
  66. lfs_format(&lfs, cfg) => 0;
  67. lfs_mount(&lfs, cfg) => 0;
  68. for (int j = 0; j < FILES; j++) {
  69. char path[1024];
  70. sprintf(path, "%c", alphas[j]);
  71. lfs_file_t file;
  72. lfs_file_open(&lfs, &file, path,
  73. LFS_O_WRONLY | LFS_O_CREAT | LFS_O_EXCL) => 0;
  74. for (int i = 0; i < SIZE; i++) {
  75. lfs_file_write(&lfs, &file, &alphas[j], 1) => 1;
  76. }
  77. lfs_file_close(&lfs, &file);
  78. }
  79. lfs_unmount(&lfs) => 0;
  80. lfs_mount(&lfs, cfg) => 0;
  81. lfs_file_t file;
  82. lfs_file_open(&lfs, &file, "zzz", LFS_O_WRONLY | LFS_O_CREAT) => 0;
  83. for (int j = 0; j < FILES; j++) {
  84. lfs_file_write(&lfs, &file, (const void*)"~", 1) => 1;
  85. lfs_file_sync(&lfs, &file) => 0;
  86. char path[1024];
  87. sprintf(path, "%c", alphas[j]);
  88. lfs_remove(&lfs, path) => 0;
  89. }
  90. lfs_file_close(&lfs, &file);
  91. lfs_dir_t dir;
  92. lfs_dir_open(&lfs, &dir, "/") => 0;
  93. struct lfs_info info;
  94. lfs_dir_read(&lfs, &dir, &info) => 1;
  95. assert(strcmp(info.name, ".") == 0);
  96. assert(info.type == LFS_TYPE_DIR);
  97. lfs_dir_read(&lfs, &dir, &info) => 1;
  98. assert(strcmp(info.name, "..") == 0);
  99. assert(info.type == LFS_TYPE_DIR);
  100. lfs_dir_read(&lfs, &dir, &info) => 1;
  101. assert(strcmp(info.name, "zzz") == 0);
  102. assert(info.type == LFS_TYPE_REG);
  103. assert(info.size == FILES);
  104. lfs_dir_read(&lfs, &dir, &info) => 0;
  105. lfs_dir_close(&lfs, &dir) => 0;
  106. lfs_file_open(&lfs, &file, "zzz", LFS_O_RDONLY) => 0;
  107. for (int i = 0; i < FILES; i++) {
  108. uint8_t buffer[1024];
  109. lfs_file_read(&lfs, &file, buffer, 1) => 1;
  110. assert(buffer[0] == '~');
  111. }
  112. lfs_file_close(&lfs, &file);
  113. lfs_unmount(&lfs) => 0;
  114. '''
  115. [cases.test_interspersed_remove_inconveniently]
  116. defines.SIZE = [10, 100]
  117. code = '''
  118. lfs_t lfs;
  119. lfs_format(&lfs, cfg) => 0;
  120. lfs_mount(&lfs, cfg) => 0;
  121. lfs_file_t files[3];
  122. lfs_file_open(&lfs, &files[0], "e", LFS_O_WRONLY | LFS_O_CREAT) => 0;
  123. lfs_file_open(&lfs, &files[1], "f", LFS_O_WRONLY | LFS_O_CREAT) => 0;
  124. lfs_file_open(&lfs, &files[2], "g", LFS_O_WRONLY | LFS_O_CREAT) => 0;
  125. for (int i = 0; i < SIZE/2; i++) {
  126. lfs_file_write(&lfs, &files[0], (const void*)"e", 1) => 1;
  127. lfs_file_write(&lfs, &files[1], (const void*)"f", 1) => 1;
  128. lfs_file_write(&lfs, &files[2], (const void*)"g", 1) => 1;
  129. }
  130. lfs_remove(&lfs, "f") => 0;
  131. for (int i = 0; i < SIZE/2; i++) {
  132. lfs_file_write(&lfs, &files[0], (const void*)"e", 1) => 1;
  133. lfs_file_write(&lfs, &files[1], (const void*)"f", 1) => 1;
  134. lfs_file_write(&lfs, &files[2], (const void*)"g", 1) => 1;
  135. }
  136. lfs_file_close(&lfs, &files[0]);
  137. lfs_file_close(&lfs, &files[1]);
  138. lfs_file_close(&lfs, &files[2]);
  139. lfs_dir_t dir;
  140. lfs_dir_open(&lfs, &dir, "/") => 0;
  141. struct lfs_info info;
  142. lfs_dir_read(&lfs, &dir, &info) => 1;
  143. assert(strcmp(info.name, ".") == 0);
  144. assert(info.type == LFS_TYPE_DIR);
  145. lfs_dir_read(&lfs, &dir, &info) => 1;
  146. assert(strcmp(info.name, "..") == 0);
  147. assert(info.type == LFS_TYPE_DIR);
  148. lfs_dir_read(&lfs, &dir, &info) => 1;
  149. assert(strcmp(info.name, "e") == 0);
  150. assert(info.type == LFS_TYPE_REG);
  151. assert(info.size == SIZE);
  152. lfs_dir_read(&lfs, &dir, &info) => 1;
  153. assert(strcmp(info.name, "g") == 0);
  154. assert(info.type == LFS_TYPE_REG);
  155. assert(info.size == SIZE);
  156. lfs_dir_read(&lfs, &dir, &info) => 0;
  157. lfs_dir_close(&lfs, &dir) => 0;
  158. lfs_file_open(&lfs, &files[0], "e", LFS_O_RDONLY) => 0;
  159. lfs_file_open(&lfs, &files[1], "g", LFS_O_RDONLY) => 0;
  160. for (int i = 0; i < SIZE; i++) {
  161. uint8_t buffer[1024];
  162. lfs_file_read(&lfs, &files[0], buffer, 1) => 1;
  163. assert(buffer[0] == 'e');
  164. lfs_file_read(&lfs, &files[1], buffer, 1) => 1;
  165. assert(buffer[0] == 'g');
  166. }
  167. lfs_file_close(&lfs, &files[0]);
  168. lfs_file_close(&lfs, &files[1]);
  169. lfs_unmount(&lfs) => 0;
  170. '''
  171. [cases.test_interspersed_reentrant_files]
  172. defines.SIZE = [10, 100]
  173. defines.FILES = [4, 10, 26]
  174. reentrant = true
  175. defines.POWERLOSS_BEHAVIOR = [
  176. 'LFS_EMUBD_POWERLOSS_NOOP',
  177. 'LFS_EMUBD_POWERLOSS_OOO',
  178. ]
  179. code = '''
  180. lfs_t lfs;
  181. lfs_file_t files[FILES];
  182. const char alphas[] = "abcdefghijklmnopqrstuvwxyz";
  183. int err = lfs_mount(&lfs, cfg);
  184. if (err) {
  185. lfs_format(&lfs, cfg) => 0;
  186. lfs_mount(&lfs, cfg) => 0;
  187. }
  188. for (int j = 0; j < FILES; j++) {
  189. char path[1024];
  190. sprintf(path, "%c", alphas[j]);
  191. lfs_file_open(&lfs, &files[j], path,
  192. LFS_O_WRONLY | LFS_O_CREAT | LFS_O_APPEND) => 0;
  193. }
  194. for (int i = 0; i < SIZE; i++) {
  195. for (int j = 0; j < FILES; j++) {
  196. lfs_ssize_t size = lfs_file_size(&lfs, &files[j]);
  197. assert(size >= 0);
  198. if ((int)size <= i) {
  199. lfs_file_write(&lfs, &files[j], &alphas[j], 1) => 1;
  200. lfs_file_sync(&lfs, &files[j]) => 0;
  201. }
  202. }
  203. }
  204. for (int j = 0; j < FILES; j++) {
  205. lfs_file_close(&lfs, &files[j]);
  206. }
  207. lfs_dir_t dir;
  208. lfs_dir_open(&lfs, &dir, "/") => 0;
  209. struct lfs_info info;
  210. lfs_dir_read(&lfs, &dir, &info) => 1;
  211. assert(strcmp(info.name, ".") == 0);
  212. assert(info.type == LFS_TYPE_DIR);
  213. lfs_dir_read(&lfs, &dir, &info) => 1;
  214. assert(strcmp(info.name, "..") == 0);
  215. assert(info.type == LFS_TYPE_DIR);
  216. for (int j = 0; j < FILES; j++) {
  217. char path[1024];
  218. sprintf(path, "%c", alphas[j]);
  219. lfs_dir_read(&lfs, &dir, &info) => 1;
  220. assert(strcmp(info.name, path) == 0);
  221. assert(info.type == LFS_TYPE_REG);
  222. assert(info.size == SIZE);
  223. }
  224. lfs_dir_read(&lfs, &dir, &info) => 0;
  225. lfs_dir_close(&lfs, &dir) => 0;
  226. for (int j = 0; j < FILES; j++) {
  227. char path[1024];
  228. sprintf(path, "%c", alphas[j]);
  229. lfs_file_open(&lfs, &files[j], path, LFS_O_RDONLY) => 0;
  230. }
  231. for (int i = 0; i < 10; i++) {
  232. for (int j = 0; j < FILES; j++) {
  233. uint8_t buffer[1024];
  234. lfs_file_read(&lfs, &files[j], buffer, 1) => 1;
  235. assert(buffer[0] == alphas[j]);
  236. }
  237. }
  238. for (int j = 0; j < FILES; j++) {
  239. lfs_file_close(&lfs, &files[j]);
  240. }
  241. lfs_unmount(&lfs) => 0;
  242. '''