test_badblocks.toml 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375
  1. # special bad-block block device hook for simulating blocks
  2. # that are no longer writable
  3. code = '''
  4. lfs_block_t *bbbd_badblocks;
  5. size_t bbbd_badblocks_count;
  6. int bbbd_read(const struct lfs_config *c, lfs_block_t block,
  7. lfs_off_t off, void *buffer, lfs_size_t size) {
  8. for (size_t i = 0; i < bbbd_badblocks_count; i++) {
  9. if (bbbd_badblocks[i] == block) {
  10. return LFS_ERR_CORRUPT;
  11. }
  12. }
  13. return lfs_testbd_read(c, block, off, buffer, size);
  14. }
  15. int bbbd_prog(const struct lfs_config *c, lfs_block_t block,
  16. lfs_off_t off, const void *buffer, lfs_size_t size) {
  17. for (size_t i = 0; i < bbbd_badblocks_count; i++) {
  18. if (bbbd_badblocks[i] == block) {
  19. return LFS_ERR_CORRUPT;
  20. }
  21. }
  22. return lfs_testbd_prog(c, block, off, buffer, size);
  23. }
  24. int bbbd_erase(const struct lfs_config *c, lfs_block_t block) {
  25. for (size_t i = 0; i < bbbd_badblocks_count; i++) {
  26. if (bbbd_badblocks[i] == block) {
  27. return LFS_ERR_CORRUPT;
  28. }
  29. }
  30. return lfs_testbd_erase(c, block);
  31. }
  32. '''
  33. [[case]] # single bad blocks
  34. define.LFS_BD_PROG = 'bbbd_prog'
  35. define.NAMEMULT = 64
  36. define.FILEMULT = 1
  37. code = '''
  38. for (lfs_block_t badblock = 2; badblock < LFS_BLOCK_COUNT; badblock++) {
  39. bbbd_badblocks = &(lfs_block_t){badblock};
  40. bbbd_badblocks_count = 1;
  41. lfs_format(&lfs, &cfg) => 0;
  42. lfs_mount(&lfs, &cfg) => 0;
  43. for (int i = 1; i < 10; i++) {
  44. for (int j = 0; j < NAMEMULT; j++) {
  45. buffer[j] = '0'+i;
  46. }
  47. buffer[NAMEMULT] = '\0';
  48. lfs_mkdir(&lfs, (char*)buffer) => 0;
  49. buffer[NAMEMULT] = '/';
  50. for (int j = 0; j < NAMEMULT; j++) {
  51. buffer[j+NAMEMULT+1] = '0'+i;
  52. }
  53. buffer[2*NAMEMULT+1] = '\0';
  54. lfs_file_open(&lfs, &file, (char*)buffer,
  55. LFS_O_WRONLY | LFS_O_CREAT) => 0;
  56. size = NAMEMULT;
  57. for (int j = 0; j < i*FILEMULT; j++) {
  58. lfs_file_write(&lfs, &file, buffer, size) => size;
  59. }
  60. lfs_file_close(&lfs, &file) => 0;
  61. }
  62. lfs_unmount(&lfs) => 0;
  63. lfs_mount(&lfs, &cfg) => 0;
  64. for (int i = 1; i < 10; i++) {
  65. for (int j = 0; j < NAMEMULT; j++) {
  66. buffer[j] = '0'+i;
  67. }
  68. buffer[NAMEMULT] = '\0';
  69. lfs_stat(&lfs, (char*)buffer, &info) => 0;
  70. info.type => LFS_TYPE_DIR;
  71. buffer[NAMEMULT] = '/';
  72. for (int j = 0; j < NAMEMULT; j++) {
  73. buffer[j+NAMEMULT+1] = '0'+i;
  74. }
  75. buffer[2*NAMEMULT+1] = '\0';
  76. lfs_file_open(&lfs, &file, (char*)buffer, LFS_O_RDONLY) => 0;
  77. size = NAMEMULT;
  78. for (int j = 0; j < i*FILEMULT; j++) {
  79. uint8_t rbuffer[1024];
  80. lfs_file_read(&lfs, &file, rbuffer, size) => size;
  81. memcmp(buffer, rbuffer, size) => 0;
  82. }
  83. lfs_file_close(&lfs, &file) => 0;
  84. }
  85. lfs_unmount(&lfs) => 0;
  86. }
  87. '''
  88. [[case]] # single persistent blocks (can't erase)
  89. define.LFS_BD_ERASE = 'bbbd_erase'
  90. define.NAMEMULT = 64
  91. define.FILEMULT = 1
  92. code = '''
  93. for (lfs_block_t badblock = 2; badblock < LFS_BLOCK_COUNT; badblock++) {
  94. bbbd_badblocks = &(lfs_block_t){badblock};
  95. bbbd_badblocks_count = 1;
  96. lfs_format(&lfs, &cfg) => 0;
  97. lfs_mount(&lfs, &cfg) => 0;
  98. for (int i = 1; i < 10; i++) {
  99. for (int j = 0; j < NAMEMULT; j++) {
  100. buffer[j] = '0'+i;
  101. }
  102. buffer[NAMEMULT] = '\0';
  103. lfs_mkdir(&lfs, (char*)buffer) => 0;
  104. buffer[NAMEMULT] = '/';
  105. for (int j = 0; j < NAMEMULT; j++) {
  106. buffer[j+NAMEMULT+1] = '0'+i;
  107. }
  108. buffer[2*NAMEMULT+1] = '\0';
  109. lfs_file_open(&lfs, &file, (char*)buffer,
  110. LFS_O_WRONLY | LFS_O_CREAT) => 0;
  111. size = NAMEMULT;
  112. for (int j = 0; j < i*FILEMULT; j++) {
  113. lfs_file_write(&lfs, &file, buffer, size) => size;
  114. }
  115. lfs_file_close(&lfs, &file) => 0;
  116. }
  117. lfs_unmount(&lfs) => 0;
  118. lfs_mount(&lfs, &cfg) => 0;
  119. for (int i = 1; i < 10; i++) {
  120. for (int j = 0; j < NAMEMULT; j++) {
  121. buffer[j] = '0'+i;
  122. }
  123. buffer[NAMEMULT] = '\0';
  124. lfs_stat(&lfs, (char*)buffer, &info) => 0;
  125. info.type => LFS_TYPE_DIR;
  126. buffer[NAMEMULT] = '/';
  127. for (int j = 0; j < NAMEMULT; j++) {
  128. buffer[j+NAMEMULT+1] = '0'+i;
  129. }
  130. buffer[2*NAMEMULT+1] = '\0';
  131. lfs_file_open(&lfs, &file, (char*)buffer, LFS_O_RDONLY) => 0;
  132. size = NAMEMULT;
  133. for (int j = 0; j < i*FILEMULT; j++) {
  134. uint8_t rbuffer[1024];
  135. lfs_file_read(&lfs, &file, rbuffer, size) => size;
  136. memcmp(buffer, rbuffer, size) => 0;
  137. }
  138. lfs_file_close(&lfs, &file) => 0;
  139. }
  140. lfs_unmount(&lfs) => 0;
  141. }
  142. '''
  143. [[case]] # single unreadable blocks (can't read)
  144. define.LFS_BD_READ = 'bbbd_read'
  145. define.NAMEMULT = 64
  146. define.FILEMULT = 1
  147. code = '''
  148. for (lfs_block_t badblock = 2; badblock < LFS_BLOCK_COUNT; badblock++) {
  149. bbbd_badblocks = &(lfs_block_t){badblock};
  150. bbbd_badblocks_count = 1;
  151. lfs_format(&lfs, &cfg) => 0;
  152. lfs_mount(&lfs, &cfg) => 0;
  153. for (int i = 1; i < 10; i++) {
  154. for (int j = 0; j < NAMEMULT; j++) {
  155. buffer[j] = '0'+i;
  156. }
  157. buffer[NAMEMULT] = '\0';
  158. lfs_mkdir(&lfs, (char*)buffer) => 0;
  159. buffer[NAMEMULT] = '/';
  160. for (int j = 0; j < NAMEMULT; j++) {
  161. buffer[j+NAMEMULT+1] = '0'+i;
  162. }
  163. buffer[2*NAMEMULT+1] = '\0';
  164. lfs_file_open(&lfs, &file, (char*)buffer,
  165. LFS_O_WRONLY | LFS_O_CREAT) => 0;
  166. size = NAMEMULT;
  167. for (int j = 0; j < i*FILEMULT; j++) {
  168. lfs_file_write(&lfs, &file, buffer, size) => size;
  169. }
  170. lfs_file_close(&lfs, &file) => 0;
  171. }
  172. lfs_unmount(&lfs) => 0;
  173. lfs_mount(&lfs, &cfg) => 0;
  174. for (int i = 1; i < 10; i++) {
  175. for (int j = 0; j < NAMEMULT; j++) {
  176. buffer[j] = '0'+i;
  177. }
  178. buffer[NAMEMULT] = '\0';
  179. lfs_stat(&lfs, (char*)buffer, &info) => 0;
  180. info.type => LFS_TYPE_DIR;
  181. buffer[NAMEMULT] = '/';
  182. for (int j = 0; j < NAMEMULT; j++) {
  183. buffer[j+NAMEMULT+1] = '0'+i;
  184. }
  185. buffer[2*NAMEMULT+1] = '\0';
  186. lfs_file_open(&lfs, &file, (char*)buffer, LFS_O_RDONLY) => 0;
  187. size = NAMEMULT;
  188. for (int j = 0; j < i*FILEMULT; j++) {
  189. uint8_t rbuffer[1024];
  190. lfs_file_read(&lfs, &file, rbuffer, size) => size;
  191. memcmp(buffer, rbuffer, size) => 0;
  192. }
  193. lfs_file_close(&lfs, &file) => 0;
  194. }
  195. lfs_unmount(&lfs) => 0;
  196. }
  197. '''
  198. [[case]] # region corruption (causes cascading failures)
  199. define.LFS_BD_PROG = '"BADTYPE == 0 ? bbbd_prog : lfs_testbd_prog "'
  200. define.LFS_BD_ERASE = '"BADTYPE == 1 ? bbbd_erase : lfs_testbd_erase"'
  201. define.LFS_BD_READ = '"BADTYPE == 2 ? bbbd_read : lfs_testbd_read "'
  202. define.BADTYPE = 'range(3)'
  203. define.NAMEMULT = 64
  204. define.FILEMULT = 1
  205. code = '''
  206. bbbd_badblocks_count = LFS_BLOCK_COUNT/2;
  207. bbbd_badblocks = malloc(bbbd_badblocks_count*sizeof(lfs_block_t));
  208. for (size_t i = 0; i < bbbd_badblocks_count; i++) {
  209. bbbd_badblocks[i] = i+2;
  210. }
  211. lfs_format(&lfs, &cfg) => 0;
  212. lfs_mount(&lfs, &cfg) => 0;
  213. for (int i = 1; i < 10; i++) {
  214. for (int j = 0; j < NAMEMULT; j++) {
  215. buffer[j] = '0'+i;
  216. }
  217. buffer[NAMEMULT] = '\0';
  218. lfs_mkdir(&lfs, (char*)buffer) => 0;
  219. buffer[NAMEMULT] = '/';
  220. for (int j = 0; j < NAMEMULT; j++) {
  221. buffer[j+NAMEMULT+1] = '0'+i;
  222. }
  223. buffer[2*NAMEMULT+1] = '\0';
  224. lfs_file_open(&lfs, &file, (char*)buffer,
  225. LFS_O_WRONLY | LFS_O_CREAT) => 0;
  226. size = NAMEMULT;
  227. for (int j = 0; j < i*FILEMULT; j++) {
  228. lfs_file_write(&lfs, &file, buffer, size) => size;
  229. }
  230. lfs_file_close(&lfs, &file) => 0;
  231. }
  232. lfs_unmount(&lfs) => 0;
  233. lfs_mount(&lfs, &cfg) => 0;
  234. for (int i = 1; i < 10; i++) {
  235. for (int j = 0; j < NAMEMULT; j++) {
  236. buffer[j] = '0'+i;
  237. }
  238. buffer[NAMEMULT] = '\0';
  239. lfs_stat(&lfs, (char*)buffer, &info) => 0;
  240. info.type => LFS_TYPE_DIR;
  241. buffer[NAMEMULT] = '/';
  242. for (int j = 0; j < NAMEMULT; j++) {
  243. buffer[j+NAMEMULT+1] = '0'+i;
  244. }
  245. buffer[2*NAMEMULT+1] = '\0';
  246. lfs_file_open(&lfs, &file, (char*)buffer, LFS_O_RDONLY) => 0;
  247. size = NAMEMULT;
  248. for (int j = 0; j < i*FILEMULT; j++) {
  249. uint8_t rbuffer[1024];
  250. lfs_file_read(&lfs, &file, rbuffer, size) => size;
  251. memcmp(buffer, rbuffer, size) => 0;
  252. }
  253. lfs_file_close(&lfs, &file) => 0;
  254. }
  255. lfs_unmount(&lfs) => 0;
  256. free(bbbd_badblocks);
  257. '''
  258. [[case]] # alternating corruption (causes cascading failures)
  259. define.LFS_BD_PROG = '"BADTYPE == 0 ? bbbd_prog : lfs_testbd_prog "'
  260. define.LFS_BD_ERASE = '"BADTYPE == 1 ? bbbd_erase : lfs_testbd_erase"'
  261. define.LFS_BD_READ = '"BADTYPE == 2 ? bbbd_read : lfs_testbd_read "'
  262. define.BADTYPE = 'range(3)'
  263. define.NAMEMULT = 64
  264. define.FILEMULT = 1
  265. code = '''
  266. bbbd_badblocks_count = LFS_BLOCK_COUNT/2;
  267. bbbd_badblocks = malloc(bbbd_badblocks_count*sizeof(lfs_block_t));
  268. for (size_t i = 0; i < bbbd_badblocks_count; i++) {
  269. bbbd_badblocks[i] = (2*i) + 2;
  270. }
  271. lfs_format(&lfs, &cfg) => 0;
  272. lfs_mount(&lfs, &cfg) => 0;
  273. for (int i = 1; i < 10; i++) {
  274. for (int j = 0; j < NAMEMULT; j++) {
  275. buffer[j] = '0'+i;
  276. }
  277. buffer[NAMEMULT] = '\0';
  278. lfs_mkdir(&lfs, (char*)buffer) => 0;
  279. buffer[NAMEMULT] = '/';
  280. for (int j = 0; j < NAMEMULT; j++) {
  281. buffer[j+NAMEMULT+1] = '0'+i;
  282. }
  283. buffer[2*NAMEMULT+1] = '\0';
  284. lfs_file_open(&lfs, &file, (char*)buffer,
  285. LFS_O_WRONLY | LFS_O_CREAT) => 0;
  286. size = NAMEMULT;
  287. for (int j = 0; j < i*FILEMULT; j++) {
  288. lfs_file_write(&lfs, &file, buffer, size) => size;
  289. }
  290. lfs_file_close(&lfs, &file) => 0;
  291. }
  292. lfs_unmount(&lfs) => 0;
  293. lfs_mount(&lfs, &cfg) => 0;
  294. for (int i = 1; i < 10; i++) {
  295. for (int j = 0; j < NAMEMULT; j++) {
  296. buffer[j] = '0'+i;
  297. }
  298. buffer[NAMEMULT] = '\0';
  299. lfs_stat(&lfs, (char*)buffer, &info) => 0;
  300. info.type => LFS_TYPE_DIR;
  301. buffer[NAMEMULT] = '/';
  302. for (int j = 0; j < NAMEMULT; j++) {
  303. buffer[j+NAMEMULT+1] = '0'+i;
  304. }
  305. buffer[2*NAMEMULT+1] = '\0';
  306. lfs_file_open(&lfs, &file, (char*)buffer, LFS_O_RDONLY) => 0;
  307. size = NAMEMULT;
  308. for (int j = 0; j < i*FILEMULT; j++) {
  309. uint8_t rbuffer[1024];
  310. lfs_file_read(&lfs, &file, rbuffer, size) => size;
  311. memcmp(buffer, rbuffer, size) => 0;
  312. }
  313. lfs_file_close(&lfs, &file) => 0;
  314. }
  315. lfs_unmount(&lfs) => 0;
  316. free(bbbd_badblocks);
  317. '''