Lines Matching +full:- +full:i

27     lfs_soff_t pos = -1;
29     for (int i = 0; i < SKIP; i++) {
56     lfs_file_seek(&lfs, &file, -size, LFS_SEEK_CUR) => pos;
60     lfs_file_seek(&lfs, &file, -size, LFS_SEEK_END) >= 0 => 1;
96     lfs_soff_t pos = -1;
98     for (int i = 0; i < SKIP; i++) {
121     lfs_file_seek(&lfs, &file, -size, LFS_SEEK_END) >= 0 => 1;
154     for (unsigned i = 0; i < sizeof(offsets) / sizeof(offsets[0]); i++) {
155         lfs_soff_t off = offsets[i];
229     lfs_file_seek(&lfs, &file, -((COUNT+SKIP)*size),
233     lfs_file_seek(&lfs, &file, -((COUNT+2*SKIP)*size),
252     for (unsigned i = 0; i < SIZE; i++) {
254         lfs_file_tell(&lfs, &file) => i+1;
255         lfs_file_size(&lfs, &file) => i+1;
261     for (unsigned i = 0; i < SIZE; i++) {
272     for (unsigned i = 0; i < SIZE; i++) {
274         lfs_file_tell(&lfs, &file) => i+1;
277         lfs_file_tell(&lfs, &file) => i+1;
279         if (i < SIZE-2) {
281             lfs_file_seek(&lfs, &file, -1, LFS_SEEK_CUR) => i;
283             lfs_file_tell(&lfs, &file) => i+3;
285             lfs_file_seek(&lfs, &file, i+1, LFS_SEEK_SET) => i+1;
286             lfs_file_tell(&lfs, &file) => i+1;
294     for (unsigned i = 0; i < SIZE; i++) {
308 [[case]] # file seek and write with power-loss
309 # must be power-of-2 for quadratic probing to be exhaustive
349     // 11-byte words in the file