test_interspersed.toml 7.9 KB

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