Lines Matching +full:- +full:i

12     while (LFS_BLOCK_COUNT - lfs_fs_size(&lfs) > 16) {
22         for (int i = 0; i < COUNT; i++) {
23             sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
31         for (int i = 0; i < COUNT; i++) {
32             sprintf(path, "test%03d_loooooooooooooooooong_name", i);
39         if (j == ITERATIONS-1) {
43         for (int i = 0; i < COUNT; i++) {
44             sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
54     for (int i = 0; i < COUNT; i++) {
55         sprintf(path, "test%03d_loooooooooooooooooong_name", i);
61     for (int i = 0; i < COUNT; i++) {
62         sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
78     while (LFS_BLOCK_COUNT - lfs_fs_size(&lfs) > 16) {
88         for (int i = 0; i < COUNT; i++) {
89             sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
97         for (int i = 0; i < COUNT; i++) {
98             sprintf(path, "test%03d_loooooooooooooooooong_name", i);
103             sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
113         for (int i = 0; i < COUNT; i++) {
114             sprintf(path, "test%03d_loooooooooooooooooong_name", i);
119             sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
129         for (int i = 0; i < COUNT; i++) {
130             sprintf(path, "test%03d_loooooooooooooooooong_name", i);
138         for (int i = 0; i < COUNT; i++) {
139             sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
150 # TODO fix this case, caused by non-DAG trees
166     for (int i = 0; i < CYCLES; i++) {
193             assert(strcmp(info.name, &full_path[2*(DEPTH-1)+1]) == 0);
197             for (int d = DEPTH-1; d >= 0; d--) {
212 # TODO fix this case, caused by non-DAG trees
228     for (int i = 0; i < CYCLES; i++) {
255             assert(strcmp(info.name, &full_path[2*(DEPTH-1)+1]) == 0);
293                 for (int d = DEPTH-1; d >= 0; d--) {