Home
last modified time | relevance | path

Searched refs:b (Results 1 – 10 of 10) sorted by relevance

/littlefs-3.5.0-3.4.0/tests/
Dtest_files.toml35 for (lfs_size_t b = 0; b < chunk; b++) {
36 buffer[b] = rand() & 0xff;
51 for (lfs_size_t b = 0; b < chunk; b++) {
52 assert(buffer[b] == (rand() & 0xff));
74 for (lfs_size_t b = 0; b < chunk; b++) {
75 buffer[b] = rand() & 0xff;
90 for (lfs_size_t b = 0; b < chunk; b++) {
91 assert(buffer[b] == (rand() & 0xff));
104 for (lfs_size_t b = 0; b < chunk; b++) {
105 buffer[b] = rand() & 0xff;
[all …]
Dtest_exhaustion.toml182 for (lfs_block_t b = 0; b < LFS_BLOCK_COUNT; b++) {
183 lfs_testbd_setwear(&cfg, b,
184 (b < run_block_count[run]) ? 0 : LFS_ERASE_CYCLES) => 0;
274 for (lfs_block_t b = 0; b < LFS_BLOCK_COUNT; b++) {
275 lfs_testbd_setwear(&cfg, b,
276 (b < run_block_count[run]) ? 0 : LFS_ERASE_CYCLES) => 0;
436 for (lfs_block_t b = 2; b < LFS_BLOCK_COUNT; b++) {
437 lfs_testbd_wear_t wear = lfs_testbd_getwear(&cfg, b);
438 printf("%08x: wear %d\n", b, wear);
455 for (lfs_block_t b = 2; b < LFS_BLOCK_COUNT; b++) {
[all …]
Dtest_move.toml6 lfs_mkdir(&lfs, "b") => 0;
45 lfs_file_open(&lfs, &file, "b/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
80 lfs_mkdir(&lfs, "b") => 0;
136 lfs_file_open(&lfs, &file, "b/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
156 lfs_mkdir(&lfs, "b") => 0;
235 lfs_file_open(&lfs, &file, "b/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
248 lfs_mkdir(&lfs, "b") => 0;
325 lfs_file_open(&lfs, &file, "b/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
348 err = lfs_mkdir(&lfs, "b");
366 if (lfs_stat(&lfs, "b/hello", &info) == 0) {
[all …]
/littlefs-3.5.0-3.4.0/
Dlfs_util.h108 static inline uint32_t lfs_max(uint32_t a, uint32_t b) { in lfs_max() argument
109 return (a > b) ? a : b; in lfs_max()
112 static inline uint32_t lfs_min(uint32_t a, uint32_t b) { in lfs_min() argument
113 return (a < b) ? a : b; in lfs_min()
164 static inline int lfs_scmp(uint32_t a, uint32_t b) { in lfs_scmp() argument
165 return (int)(unsigned)(a - b); in lfs_scmp()
Dlfs.c372 static inline void lfs_gstate_xor(lfs_gstate_t *a, const lfs_gstate_t *b) { in lfs_gstate_xor() argument
374 ((uint32_t*)a)[i] ^= ((const uint32_t*)b)[i]; in lfs_gstate_xor()
2651 lfs_off_t b = lfs->cfg->block_size - 2*4; in lfs_ctz_index() local
2652 lfs_off_t i = size / b; in lfs_ctz_index()
2657 i = (size - 4*(lfs_popc(i-1)+2)) / b; in lfs_ctz_index()
2658 *off = size - b*i - 4*lfs_popc(i); in lfs_ctz_index()
/littlefs-3.5.0-3.4.0/scripts/
Dreadtree.py12 gstate = b'\0\0\0\0\0\0\0\0\0\0\0\0'
34 .ljust(args.block_size, b'\xff'))
43 if mdir.tail.size != 8 or mdir.tail.data == 8*b'\xff':
59 gstate = bytes((a or 0) ^ (b or 0)
60 for a,b in it.zip_longest(gstate, ngstate.data))
106 struct.unpack('<HH', superblock[1].data[0:4].ljust(4, b'\xff'))))
113 tag = Tag(struct.unpack('<I', gstate[0:4].ljust(4, b'\xff'))[0])
114 blocks = struct.unpack('<II', gstate[4:4+8].ljust(8, b'\xff'))
Dreadmdir.py317 .ljust(args.block_size, b'\xff'))
324 if mdir.tail.size != 8 or mdir.tail.data == 8*b'\xff':
330 ', '.join('%#x' % b
331 for b in [args.block1, args.block2]
332 if b is not None),
Dsummary.py51 lambda rs: ft.reduce(lambda a, b: (a[0]+b[0], a[1]+b[1]), rs),
Dreadblock.py9 .ljust(args.block_size, b'\xff'))
Dcoverage.py10 import bisect as b namespace
39 i = b.bisect(funcs, (file, lineno))