bench_dir.toml 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270
  1. [cases.bench_dir_open]
  2. # 0 = in-order
  3. # 1 = reversed-order
  4. # 2 = random-order
  5. defines.ORDER = [0, 1, 2]
  6. defines.N = 1024
  7. defines.FILE_SIZE = 8
  8. defines.CHUNK_SIZE = 8
  9. code = '''
  10. lfs_t lfs;
  11. lfs_format(&lfs, cfg) => 0;
  12. lfs_mount(&lfs, cfg) => 0;
  13. // first create the files
  14. char name[256];
  15. uint8_t buffer[CHUNK_SIZE];
  16. for (lfs_size_t i = 0; i < N; i++) {
  17. sprintf(name, "file%08x", i);
  18. lfs_file_t file;
  19. lfs_file_open(&lfs, &file, name,
  20. LFS_O_WRONLY | LFS_O_CREAT | LFS_O_EXCL) => 0;
  21. uint32_t file_prng = i;
  22. for (lfs_size_t j = 0; j < FILE_SIZE; j += CHUNK_SIZE) {
  23. for (lfs_size_t k = 0; k < CHUNK_SIZE; k++) {
  24. buffer[k] = BENCH_PRNG(&file_prng);
  25. }
  26. lfs_file_write(&lfs, &file, buffer, CHUNK_SIZE) => CHUNK_SIZE;
  27. }
  28. lfs_file_close(&lfs, &file) => 0;
  29. }
  30. // then read the files
  31. BENCH_START();
  32. uint32_t prng = 42;
  33. for (lfs_size_t i = 0; i < N; i++) {
  34. lfs_off_t i_
  35. = (ORDER == 0) ? i
  36. : (ORDER == 1) ? (N-1-i)
  37. : BENCH_PRNG(&prng) % N;
  38. sprintf(name, "file%08x", i_);
  39. lfs_file_t file;
  40. lfs_file_open(&lfs, &file, name, LFS_O_RDONLY) => 0;
  41. uint32_t file_prng = i_;
  42. for (lfs_size_t j = 0; j < FILE_SIZE; j += CHUNK_SIZE) {
  43. lfs_file_read(&lfs, &file, buffer, CHUNK_SIZE) => CHUNK_SIZE;
  44. for (lfs_size_t k = 0; k < CHUNK_SIZE; k++) {
  45. assert(buffer[k] == BENCH_PRNG(&file_prng));
  46. }
  47. }
  48. lfs_file_close(&lfs, &file) => 0;
  49. }
  50. BENCH_STOP();
  51. lfs_unmount(&lfs) => 0;
  52. '''
  53. [cases.bench_dir_creat]
  54. # 0 = in-order
  55. # 1 = reversed-order
  56. # 2 = random-order
  57. defines.ORDER = [0, 1, 2]
  58. defines.N = 1024
  59. defines.FILE_SIZE = 8
  60. defines.CHUNK_SIZE = 8
  61. code = '''
  62. lfs_t lfs;
  63. lfs_format(&lfs, cfg) => 0;
  64. lfs_mount(&lfs, cfg) => 0;
  65. BENCH_START();
  66. uint32_t prng = 42;
  67. char name[256];
  68. uint8_t buffer[CHUNK_SIZE];
  69. for (lfs_size_t i = 0; i < N; i++) {
  70. lfs_off_t i_
  71. = (ORDER == 0) ? i
  72. : (ORDER == 1) ? (N-1-i)
  73. : BENCH_PRNG(&prng) % N;
  74. sprintf(name, "file%08x", i_);
  75. lfs_file_t file;
  76. lfs_file_open(&lfs, &file, name,
  77. LFS_O_WRONLY | LFS_O_CREAT | LFS_O_TRUNC) => 0;
  78. uint32_t file_prng = i_;
  79. for (lfs_size_t j = 0; j < FILE_SIZE; j += CHUNK_SIZE) {
  80. for (lfs_size_t k = 0; k < CHUNK_SIZE; k++) {
  81. buffer[k] = BENCH_PRNG(&file_prng);
  82. }
  83. lfs_file_write(&lfs, &file, buffer, CHUNK_SIZE) => CHUNK_SIZE;
  84. }
  85. lfs_file_close(&lfs, &file) => 0;
  86. }
  87. BENCH_STOP();
  88. lfs_unmount(&lfs) => 0;
  89. '''
  90. [cases.bench_dir_remove]
  91. # 0 = in-order
  92. # 1 = reversed-order
  93. # 2 = random-order
  94. defines.ORDER = [0, 1, 2]
  95. defines.N = 1024
  96. defines.FILE_SIZE = 8
  97. defines.CHUNK_SIZE = 8
  98. code = '''
  99. lfs_t lfs;
  100. lfs_format(&lfs, cfg) => 0;
  101. lfs_mount(&lfs, cfg) => 0;
  102. // first create the files
  103. char name[256];
  104. uint8_t buffer[CHUNK_SIZE];
  105. for (lfs_size_t i = 0; i < N; i++) {
  106. sprintf(name, "file%08x", i);
  107. lfs_file_t file;
  108. lfs_file_open(&lfs, &file, name,
  109. LFS_O_WRONLY | LFS_O_CREAT | LFS_O_EXCL) => 0;
  110. uint32_t file_prng = i;
  111. for (lfs_size_t j = 0; j < FILE_SIZE; j += CHUNK_SIZE) {
  112. for (lfs_size_t k = 0; k < CHUNK_SIZE; k++) {
  113. buffer[k] = BENCH_PRNG(&file_prng);
  114. }
  115. lfs_file_write(&lfs, &file, buffer, CHUNK_SIZE) => CHUNK_SIZE;
  116. }
  117. lfs_file_close(&lfs, &file) => 0;
  118. }
  119. // then remove the files
  120. BENCH_START();
  121. uint32_t prng = 42;
  122. for (lfs_size_t i = 0; i < N; i++) {
  123. lfs_off_t i_
  124. = (ORDER == 0) ? i
  125. : (ORDER == 1) ? (N-1-i)
  126. : BENCH_PRNG(&prng) % N;
  127. sprintf(name, "file%08x", i_);
  128. int err = lfs_remove(&lfs, name);
  129. assert(!err || err == LFS_ERR_NOENT);
  130. }
  131. BENCH_STOP();
  132. lfs_unmount(&lfs) => 0;
  133. '''
  134. [cases.bench_dir_read]
  135. defines.N = 1024
  136. defines.FILE_SIZE = 8
  137. defines.CHUNK_SIZE = 8
  138. code = '''
  139. lfs_t lfs;
  140. lfs_format(&lfs, cfg) => 0;
  141. lfs_mount(&lfs, cfg) => 0;
  142. // first create the files
  143. char name[256];
  144. uint8_t buffer[CHUNK_SIZE];
  145. for (lfs_size_t i = 0; i < N; i++) {
  146. sprintf(name, "file%08x", i);
  147. lfs_file_t file;
  148. lfs_file_open(&lfs, &file, name,
  149. LFS_O_WRONLY | LFS_O_CREAT | LFS_O_EXCL) => 0;
  150. uint32_t file_prng = i;
  151. for (lfs_size_t j = 0; j < FILE_SIZE; j += CHUNK_SIZE) {
  152. for (lfs_size_t k = 0; k < CHUNK_SIZE; k++) {
  153. buffer[k] = BENCH_PRNG(&file_prng);
  154. }
  155. lfs_file_write(&lfs, &file, buffer, CHUNK_SIZE) => CHUNK_SIZE;
  156. }
  157. lfs_file_close(&lfs, &file) => 0;
  158. }
  159. // then read the directory
  160. BENCH_START();
  161. lfs_dir_t dir;
  162. lfs_dir_open(&lfs, &dir, "/") => 0;
  163. struct lfs_info info;
  164. lfs_dir_read(&lfs, &dir, &info) => 1;
  165. assert(info.type == LFS_TYPE_DIR);
  166. assert(strcmp(info.name, ".") == 0);
  167. lfs_dir_read(&lfs, &dir, &info) => 1;
  168. assert(info.type == LFS_TYPE_DIR);
  169. assert(strcmp(info.name, "..") == 0);
  170. for (int i = 0; i < N; i++) {
  171. sprintf(name, "file%08x", i);
  172. lfs_dir_read(&lfs, &dir, &info) => 1;
  173. assert(info.type == LFS_TYPE_REG);
  174. assert(strcmp(info.name, name) == 0);
  175. }
  176. lfs_dir_read(&lfs, &dir, &info) => 0;
  177. lfs_dir_close(&lfs, &dir) => 0;
  178. BENCH_STOP();
  179. lfs_unmount(&lfs) => 0;
  180. '''
  181. [cases.bench_dir_mkdir]
  182. # 0 = in-order
  183. # 1 = reversed-order
  184. # 2 = random-order
  185. defines.ORDER = [0, 1, 2]
  186. defines.N = 8
  187. code = '''
  188. lfs_t lfs;
  189. lfs_format(&lfs, cfg) => 0;
  190. lfs_mount(&lfs, cfg) => 0;
  191. BENCH_START();
  192. uint32_t prng = 42;
  193. char name[256];
  194. for (lfs_size_t i = 0; i < N; i++) {
  195. lfs_off_t i_
  196. = (ORDER == 0) ? i
  197. : (ORDER == 1) ? (N-1-i)
  198. : BENCH_PRNG(&prng) % N;
  199. printf("hm %d\n", i);
  200. sprintf(name, "dir%08x", i_);
  201. int err = lfs_mkdir(&lfs, name);
  202. assert(!err || err == LFS_ERR_EXIST);
  203. }
  204. BENCH_STOP();
  205. lfs_unmount(&lfs) => 0;
  206. '''
  207. [cases.bench_dir_rmdir]
  208. # 0 = in-order
  209. # 1 = reversed-order
  210. # 2 = random-order
  211. defines.ORDER = [0, 1, 2]
  212. defines.N = 8
  213. code = '''
  214. lfs_t lfs;
  215. lfs_format(&lfs, cfg) => 0;
  216. lfs_mount(&lfs, cfg) => 0;
  217. // first create the dirs
  218. char name[256];
  219. for (lfs_size_t i = 0; i < N; i++) {
  220. sprintf(name, "dir%08x", i);
  221. lfs_mkdir(&lfs, name) => 0;
  222. }
  223. // then remove the dirs
  224. BENCH_START();
  225. uint32_t prng = 42;
  226. for (lfs_size_t i = 0; i < N; i++) {
  227. lfs_off_t i_
  228. = (ORDER == 0) ? i
  229. : (ORDER == 1) ? (N-1-i)
  230. : BENCH_PRNG(&prng) % N;
  231. sprintf(name, "dir%08x", i_);
  232. int err = lfs_remove(&lfs, name);
  233. assert(!err || err == LFS_ERR_NOENT);
  234. }
  235. BENCH_STOP();
  236. lfs_unmount(&lfs) => 0;
  237. '''