Home
last modified time | relevance | path

Searched refs:j (Results 1 – 9 of 9) sorted by relevance

/littlefs-3.5.0-3.4.0/tests/
Dtest_badblocks.toml26 for (int j = 0; j < NAMEMULT; j++) {
27 buffer[j] = '0'+i;
33 for (int j = 0; j < NAMEMULT; j++) {
34 buffer[j+NAMEMULT+1] = '0'+i;
41 for (int j = 0; j < i*FILEMULT; j++) {
51 for (int j = 0; j < NAMEMULT; j++) {
52 buffer[j] = '0'+i;
59 for (int j = 0; j < NAMEMULT; j++) {
60 buffer[j+NAMEMULT+1] = '0'+i;
66 for (int j = 0; j < i*FILEMULT; j++) {
[all …]
Dtest_interspersed.toml10 for (int j = 0; j < FILES; j++) {
11 sprintf(path, "%c", alphas[j]);
12 lfs_file_open(&lfs, &files[j], path,
17 for (int j = 0; j < FILES; j++) {
18 lfs_file_write(&lfs, &files[j], &alphas[j], 1) => 1;
22 for (int j = 0; j < FILES; j++) {
23 lfs_file_close(&lfs, &files[j]);
33 for (int j = 0; j < FILES; j++) {
34 sprintf(path, "%c", alphas[j]);
43 for (int j = 0; j < FILES; j++) {
[all …]
Dtest_truncate.toml12 for (lfs_off_t j = 0; j < LARGESIZE; j += size) {
35 for (lfs_off_t j = 0; j < MEDIUMSIZE; j += size) {
56 for (lfs_off_t j = 0; j < LARGESIZE; j += size) {
72 for (lfs_off_t j = 0; j < MEDIUMSIZE; j += size) {
86 for (lfs_off_t j = 0; j < MEDIUMSIZE; j += size) {
107 for (lfs_off_t j = 0; j < size; ++j) {
108 wb[j] = j;
159 for (lfs_off_t j = 0; j < LARGESIZE; j += size) {
176 for (lfs_off_t j = 0; j < MEDIUMSIZE; j += size) {
189 for (lfs_off_t j = 0; j < MEDIUMSIZE; j += size) {
[all …]
Dtest_exhaustion.toml31 for (lfs_size_t j = 0; j < size; j++) {
58 for (lfs_size_t j = 0; j < size; j++) {
113 for (lfs_size_t j = 0; j < size; j++) {
140 for (lfs_size_t j = 0; j < size; j++) {
204 for (lfs_size_t j = 0; j < size; j++) {
231 for (lfs_size_t j = 0; j < size; j++) {
293 for (lfs_size_t j = 0; j < size; j++) {
320 for (lfs_size_t j = 0; j < size; j++) {
378 for (lfs_size_t j = 0; j < size; j++) {
405 for (lfs_size_t j = 0; j < size; j++) {
Dtest_seek.toml18 for (int j = 0; j < COUNT; j++) {
87 for (int j = 0; j < COUNT; j++) {
142 for (int j = 0; j < COUNT; j++) {
202 for (int j = 0; j < COUNT; j++) {
248 int j = 0;
253 lfs_file_write(&lfs, &file, &buffer[j++ % 26], 1) => 1;
273 lfs_file_write(&lfs, &file, &buffer[j++ % 26], 1) => 1;
323 for (int j = 0; j < COUNT; j++) {
335 for (int j = 0; j < COUNT; j++) {
351 for (int j = 0; j < COUNT; j++) {
[all …]
Dtest_relocations.toml21 for (int j = 0; j < ITERATIONS; j++) {
39 if (j == ITERATIONS-1) {
87 for (int j = 0; j < ITERATIONS; j++) {
Dtest_dirs.toml730 for (int j = 2; j < COUNT; j++) {
741 for (int i = 0; i < j; i++) {
751 sprintf(path, "kitty%03d", j);
769 sprintf(path, "kitty%03d", j);
790 for (int j = 2; j < COUNT; j++) {
801 for (int i = 0; i < j; i++) {
811 sprintf(path, "hi%03d", j);
829 sprintf(path, "hi%03d", j);
/littlefs-3.5.0-3.4.0/scripts/
Dreadtree.py126 for j, mdir in enumerate(dir):
144 ' ' if j == len(dir)-1 else
/littlefs-3.5.0-3.4.0/
Dlfs.c1128 for (lfs_off_t j = sizeof(tag); j < lfs_tag_dsize(tag); j++) { in lfs_dir_fetchmatch() local
1132 dir->pair[0], off+j, &dat, 1); in lfs_dir_fetchmatch()