Home
last modified time | relevance | path

Searched refs:iter (Results 1 – 25 of 212) sorted by relevance

123456789

/fs/udf/
A Ddirectory.c115 iter->name = iter->namebuf; in udf_copy_fi()
135 if (iter->loffset + ralen > (iter->elen >> iter->dir->i_blkbits)) in udf_readahead_dir()
136 ralen = (iter->elen >> iter->dir->i_blkbits) - iter->loffset; in udf_readahead_dir()
177 err = udf_next_aext(iter->dir, &iter->epos, &iter->eloc, in udf_fiiter_advance_blk()
202 if (!iter->bh[0] && iter->elen) { in udf_fiiter_load_bhs()
240 iter->bh[0] = iter->bh[1] = NULL; in udf_fiiter_load_bhs()
270 &iter->eloc, &iter->elen, &iter->loffset, &etype); in udf_fiiter_init()
305 iter->bh[0] = iter->bh[1]; in udf_fiiter_advance()
428 iter->name == iter->namebuf ? iter->name : NULL); in udf_fiiter_write_fi()
453 udf_write_aext(iter->dir, &iter->epos, &iter->eloc, iter->elen, 1); in udf_fiiter_update_elen()
[all …]
A Dnamei.c100 udf_fiiter_release(iter); in udf_fiiter_find_entry()
125 udf_fiiter_release(&iter); in udf_lookup()
215 udf_fiiter_release(&iter); in udf_expand_dir_adinicb()
250 iter->name = iter->namebuf; in udf_fiiter_add_entry()
256 udf_fiiter_release(iter); in udf_fiiter_add_entry()
261 udf_fiiter_release(iter); in udf_fiiter_add_entry()
286 udf_fiiter_release(iter); in udf_fiiter_add_entry()
306 iter->name = iter->namebuf; in udf_fiiter_add_entry()
313 udf_fiiter_update_elen(iter, iter->elen - in udf_fiiter_add_entry()
366 udf_fiiter_release(&iter); in udf_add_nondir()
[all …]
A Ddir.c44 struct udf_fileident_iter iter; in udf_readdir() local
76 for (ret = udf_fiiter_init(&iter, dir, nf_pos); in udf_readdir()
77 !ret && iter.pos < dir->i_size; in udf_readdir()
78 ret = udf_fiiter_advance(&iter)) { in udf_readdir()
83 if (iter.pos < emit_pos) in udf_readdir()
88 ctx->pos = (iter.pos >> 2) + 1; in udf_readdir()
106 flen = udf_get_filename(sb, iter.name, in udf_readdir()
107 iter.fi.lengthFileIdent, fname, UDF_NAME_LEN); in udf_readdir()
111 tloc = lelb_to_cpu(iter.fi.icb.extLocation); in udf_readdir()
118 ctx->pos = (iter.pos >> 2) + 1; in udf_readdir()
[all …]
/fs/iomap/
A Diter.c12 memset(&iter->iomap, 0, sizeof(iter->iomap)); in iomap_iter_reset_iomap()
13 memset(&iter->srcmap, 0, sizeof(iter->srcmap)); in iomap_iter_reset_iomap()
32 WARN_ON_ONCE(iter->iomap.offset > iter->pos); in iomap_iter_done()
34 WARN_ON_ONCE(iter->iomap.offset + iter->iomap.length <= iter->pos); in iomap_iter_done()
37 iter->iter_start_pos = iter->pos; in iomap_iter_done()
39 trace_iomap_iter_dstmap(iter->inode, &iter->iomap); in iomap_iter_done()
75 advanced = iter->pos - iter->iter_start_pos; in iomap_iter()
80 iomap_length_trim(iter, iter->iter_start_pos, in iomap_iter()
82 advanced, iter->flags, &iter->iomap); in iomap_iter()
108 ret = ops->iomap_begin(iter->inode, iter->pos, iter->len, iter->flags, in iomap_iter()
[all …]
A Dseek.c14 switch (iter->iomap.type) { in iomap_seek_hole_iter()
17 iter->pos, iter->pos + length, SEEK_HOLE); in iomap_seek_hole_iter()
22 *hole_pos = iter->pos; in iomap_seek_hole_iter()
33 struct iomap_iter iter = { in iomap_seek_hole() local
44 iter.len = size - pos; in iomap_seek_hole()
46 iter.status = iomap_seek_hole_iter(&iter, &pos); in iomap_seek_hole()
65 iter->pos, iter->pos + length, SEEK_DATA); in iomap_seek_data_iter()
70 *hole_pos = iter->pos; in iomap_seek_data_iter()
79 struct iomap_iter iter = { in iomap_seek_data() local
90 iter.len = size - pos; in iomap_seek_data()
[all …]
A Dbuffered-io.c313 ifs_alloc(iter->inode, folio, iter->flags); in iomap_read_inline_data()
380 ifs = ifs_alloc(iter->inode, folio, iter->flags); in iomap_readpage_iter()
469 iter.status = iomap_read_folio_iter(&iter, &ctx); in iomap_read_folio()
541 iter.status = iomap_readahead_iter(&iter, &ctx); in iomap_readahead()
710 ifs = ifs_alloc(iter->inode, folio, iter->flags); in __iomap_write_begin()
988 iomap_write_failed(iter->inode, iter->pos, bytes); in iomap_write_iter()
1066 iter.status = iomap_write_iter(&iter, i, write_ops); in iomap_file_buffered_write()
1358 iter.status = iomap_unshare_iter(&iter, write_ops); in iomap_file_unshare()
1450 iter.status = iomap_zero_iter(&iter, did_zero, in iomap_zero_range()
1453 iter.len = len - (iter.pos - pos); in iomap_zero_range()
[all …]
A Ddirect-io.c48 struct iov_iter *iter; member
329 struct inode *inode = iter->inode; in iomap_dio_bio_iter()
332 loff_t pos = iter->pos; in iomap_dio_bio_iter()
353 if (length != iter->len) in iomap_dio_bio_iter()
505 loff_t length = iov_iter_zero(iomap_length(iter), dio->submit.iter); in iomap_dio_hole_iter()
516 struct iov_iter *iter = dio->submit.iter; in iomap_dio_inline_iter() local
547 switch (iter->iomap.type) { in iomap_dio_iter()
605 .len = iov_iter_count(iter), in __iomap_dio_rw()
633 dio->submit.iter = iter; in __iomap_dio_rw()
639 if (iov_iter_rw(iter) == READ) { in __iomap_dio_rw()
[all …]
A Dfiemap.c44 if (iter->iomap.type == IOMAP_HOLE) in iomap_fiemap_iter()
48 *prev = iter->iomap; in iomap_fiemap_iter()
55 return iomap_iter_advance_full(iter); in iomap_fiemap_iter()
61 struct iomap_iter iter = { in iomap_fiemap() local
72 ret = fiemap_prep(inode, fi, start, &iter.len, 0); in iomap_fiemap()
76 while ((ret = iomap_iter(&iter, ops)) > 0) in iomap_fiemap()
77 iter.status = iomap_fiemap_iter(&iter, fi, &prev); in iomap_fiemap()
97 struct iomap_iter iter = { in iomap_bmap() local
110 while ((ret = iomap_iter(&iter, ops)) > 0) { in iomap_bmap()
111 if (iter.iomap.type == IOMAP_MAPPED) in iomap_bmap()
[all …]
/fs/bcachefs/
A Dbkey_sort.c15 return !iter->used; in sort_iter_end()
24 i + 1 < iter->used && in sort_iter_sift()
25 cmp(iter->b, iter->data[i].k, iter->data[i + 1].k) > 0; in sort_iter_sift()
27 swap(iter->data[i], iter->data[i + 1]); in sort_iter_sift()
32 unsigned i = iter->used; in sort_iter_sort()
40 return !sort_iter_end(iter) ? iter->data->k : NULL; in sort_iter_peek()
47 BUG_ON(!iter->used); in sort_iter_advance()
54 array_remove_item(iter->data, iter->used, 0); in sort_iter_advance()
88 return iter->used >= 2 && in should_drop_next_key()
90 iter->data[0].k, in should_drop_next_key()
[all …]
A Dbtree_iter.c265 iter->pos.snapshot != iter->snapshot); in __bch2_btree_iter_verify_entry_exit()
267 BUG_ON(iter->flags & BTREE_ITER_all_snapshots ? !bpos_eq(iter->pos, iter->k.p) : in __bch2_btree_iter_verify_entry_exit()
268 !(iter->flags & BTREE_ITER_is_extents) ? !bkey_eq(iter->pos, iter->k.p) : in __bch2_btree_iter_verify_entry_exit()
270 bkey_gt(iter->pos, iter->k.p))); in __bch2_btree_iter_verify_entry_exit()
1931 iter->k.p = iter->pos = b->key.k.p; in bch2_btree_iter_peek_node()
2032 iter->k.p = iter->pos = b->key.k.p; in bch2_btree_iter_next_node()
2430 iter->update_path = iter->path; in bch2_btree_iter_peek_max()
2496 iter->pos.snapshot = iter->snapshot; in bch2_btree_iter_peek_max()
2749 iter->pos = bpos_min(iter->pos, k.k->p);; in bch2_btree_iter_peek_prev_min()
2752 iter->pos.snapshot = iter->snapshot; in bch2_btree_iter_peek_prev_min()
[all …]
A Dbtree_journal_iter.c461 if (iter->idx < iter->keys->size) { in bch2_journal_iter_advance()
463 if (iter->idx == iter->keys->gap) in bch2_journal_iter_advance()
464 iter->idx += iter->keys->size - iter->keys->nr; in bch2_journal_iter_advance()
473 while (iter->idx < iter->keys->size) { in bch2_journal_iter_peek()
474 struct journal_key *k = iter->keys->data + iter->idx; in bch2_journal_iter_peek()
514 iter->b, &iter->unpacked); in bch2_journal_iter_peek_btree()
519 bch2_btree_node_iter_advance(&iter->node_iter, iter->b); in bch2_journal_iter_advance_btree()
527 iter->pos = bpos_successor(iter->pos); in bch2_btree_and_journal_iter_advance()
562 if (iter->prefetch && iter->journal.level) in bch2_btree_and_journal_iter_peek()
615 memset(iter, 0, sizeof(*iter)); in __bch2_btree_and_journal_iter_init_node_iter()
[all …]
A Dbtree_update.c98 struct btree_iter iter; in need_whiteout_for_snapshot() local
134 struct btree_iter iter; in __bch2_insert_snapshot_whiteouts() local
271 struct btree_iter iter; in bch2_trans_update_extent() local
471 iter->key_cache_path = in bch2_trans_update_get_key_cache()
499 btree_path_idx_t path_idx = iter->update_path ?: iter->path; in bch2_trans_update_ip()
617 struct btree_iter iter; in bch2_btree_insert_nonextent() local
633 struct btree_iter iter; in bch2_btree_insert_trans() local
671 k->k.p = iter->pos; in bch2_btree_delete_at()
679 struct btree_iter iter; in bch2_btree_delete() local
733 iter.pos.offset); in bch2_btree_delete_range_trans()
[all …]
A Dbkey_sort.h15 static inline void sort_iter_init(struct sort_iter *iter, struct btree *b, unsigned size) in sort_iter_init() argument
17 iter->b = b; in sort_iter_init()
18 iter->used = 0; in sort_iter_init()
19 iter->size = size; in sort_iter_init()
23 struct sort_iter iter; member
27 static inline void sort_iter_stack_init(struct sort_iter_stack *iter, struct btree *b) in sort_iter_stack_init() argument
29 sort_iter_init(&iter->iter, b, ARRAY_SIZE(iter->sets)); in sort_iter_stack_init()
32 static inline void sort_iter_add(struct sort_iter *iter, in sort_iter_add() argument
36 BUG_ON(iter->used >= iter->size); in sort_iter_add()
39 iter->data[iter->used++] = (struct sort_iter_set) { k, end }; in sort_iter_add()
A Dbset.c1230 BUG_ON(pos >= iter->data + ARRAY_SIZE(iter->data)); in __bch2_btree_node_iter_push()
1319 memset(iter, 0, sizeof(*iter)); in bch2_btree_node_iter_init()
1357 memset(iter, 0, sizeof(*iter)); in bch2_btree_node_iter_init_from_start()
1388 swap(iter->data[first], iter->data[first + 1]); in btree_node_iter_sort_two()
1410 iter->data + ARRAY_SIZE(iter->data) - 1; in bch2_btree_node_iter_set_drop()
1419 iter->data->k += __bch2_btree_node_iter_peek_all(iter, b)->u64s; in __bch2_btree_node_iter_advance()
1421 EBUG_ON(iter->data->k > iter->data->end); in __bch2_btree_node_iter_advance()
1425 iter->data[0] = iter->data[1]; in __bch2_btree_node_iter_advance()
1426 iter->data[1] = iter->data[2]; in __bch2_btree_node_iter_advance()
1488 BUG_ON(set != &iter->data[__btree_node_iter_used(iter)]); in bch2_btree_node_iter_prev_all()
[all …]
A Dtests.c35 struct btree_iter iter; in test_delete() local
76 struct btree_iter iter; in test_delete_written() local
348 struct btree_iter iter; in test_peek_end() local
370 struct btree_iter iter; in test_peek_end_extents() local
481 struct btree_iter iter; in test_snapshot_filter() local
600 struct btree_iter iter; in rand_lookup() local
640 cookie->k.p = iter->pos; in rand_mixed_trans()
650 struct btree_iter iter; in rand_mixed() local
673 struct btree_iter iter; in __do_delete() local
723 if (iter.pos.offset >= nr) in seq_insert()
[all …]
A Dmigrate.c53 bch2_btree_node_update_key(trans, iter, b, k.k, 0, false); in drop_btree_ptrs()
61 struct btree_iter *iter, in bch2_dev_usrdata_drop_key() argument
106 struct btree_iter iter; in bch2_dev_btree_drop_key() local
112 ret = drop_btree_ptrs(trans, &iter, b, dev_idx, flags); in bch2_dev_btree_drop_key()
114 bch2_trans_iter_exit(trans, &iter); in bch2_dev_btree_drop_key()
150 struct btree_iter iter; in bch2_dev_metadata_drop() local
171 (b = bch2_btree_iter_peek_node(trans, &iter)) && in bch2_dev_metadata_drop()
187 bch2_btree_iter_next_node(trans, &iter); in bch2_dev_metadata_drop()
192 bch2_trans_iter_exit(trans, &iter); in bch2_dev_metadata_drop()
213 struct btree_iter iter; in data_drop_bp() local
[all …]
A Dbtree_iter.h442 iter->k.p.inode = iter->pos.inode = new_pos.inode; in __bch2_btree_iter_set_pos()
443 iter->k.p.offset = iter->pos.offset = new_pos.offset; in __bch2_btree_iter_set_pos()
444 iter->k.p.snapshot = iter->pos.snapshot = new_pos.snapshot; in __bch2_btree_iter_set_pos()
445 iter->k.size = 0; in __bch2_btree_iter_set_pos()
454 iter->update_path = 0; in bch2_btree_iter_set_pos()
465 iter->pos = bkey_start_pos(&iter->k); in bch2_btree_iter_set_pos_to_extent_start()
517 iter->update_path = 0; in bch2_trans_iter_init_common()
520 iter->min_depth = 0; in bch2_trans_iter_init_common()
521 iter->flags = flags; in bch2_trans_iter_init_common()
523 iter->pos = pos; in bch2_trans_iter_init_common()
[all …]
A Dstr_hash.h152 struct btree_iter *iter, in bch2_hash_lookup_in_snapshot() argument
183 struct btree_iter *iter, in bch2_hash_lookup() argument
199 struct btree_iter *iter, in bch2_hash_hole() argument
229 struct btree_iter iter; in bch2_hash_needs_whiteout() local
255 struct btree_iter *iter, in bch2_hash_set_or_get_in_snapshot() argument
305 swap(*iter, slot); in bch2_hash_set_or_get_in_snapshot()
307 insert->k.p = iter->pos; in bch2_hash_set_or_get_in_snapshot()
322 struct btree_iter iter; in bch2_hash_set_in_snapshot() local
356 struct btree_iter *iter, in bch2_hash_delete_at() argument
372 delete->k.p = iter->pos; in bch2_hash_delete_at()
[all …]
A Dbset.h354 return iter->data[i].k == iter->data[i].end; in __btree_node_iter_set_end()
359 return __btree_node_iter_set_end(iter, 0); in bch2_btree_node_iter_end()
408 return __btree_node_offset_to_key(b, iter->data->k); in __bch2_btree_node_iter_peek_all()
414 return !bch2_btree_node_iter_end(iter) in bch2_btree_node_iter_peek_all()
415 ? __btree_node_offset_to_key(b, iter->data->k) in bch2_btree_node_iter_peek_all()
426 bch2_btree_node_iter_advance(iter, b); in bch2_btree_node_iter_peek()
437 bch2_btree_node_iter_advance(iter, b); in bch2_btree_node_iter_next_all()
451 #define for_each_btree_node_key(b, k, iter) \ argument
454 bch2_btree_node_iter_advance(iter, b))
459 bch2_btree_node_iter_advance(iter, b))
[all …]
A Dfs-io-direct.c94 if (shorten >= iter->count) in bch2_direct_IO_read()
96 iter->count -= shorten; in bch2_direct_IO_read()
135 while (iter->count) { in bch2_direct_IO_read()
161 if (iter->count) in bch2_direct_IO_read()
177 iter->count += shorten; in bch2_direct_IO_read()
244 struct iov_iter iter; member
256 struct btree_iter iter; in bch2_check_range_allocated() local
283 offset = iter.pos.offset; in bch2_check_range_allocated()
338 memcpy(iov, dio->iter.__iov, dio->iter.nr_segs * sizeof(*iov)); in bch2_dio_write_copy_iov()
339 dio->iter.__iov = iov; in bch2_dio_write_copy_iov()
[all …]
/fs/afs/
A Ddir_search.c78 if (iter->block) { in afs_dir_find_block()
80 iter->block = NULL; in afs_dir_find_block()
102 iter->fq = fq; in afs_dir_find_block()
103 iter->fq_slot = slot; in afs_dir_find_block()
104 iter->fpos = fpos; in afs_dir_find_block()
106 return iter->block; in afs_dir_find_block()
114 iter->fq = NULL; in afs_dir_find_block()
115 iter->fq_slot = 0; in afs_dir_find_block()
148 iter->bucket, resv, slot, slot + iter->nr_slots - 1); in afs_dir_search_bucket()
176 if (iter->block) { in afs_dir_search_bucket()
[all …]
A Ddir_edit.c131 fq = iter->fq; in afs_dir_get_block()
145 iter->fq = fq; in afs_dir_get_block()
146 iter->fq_slot = s; in afs_dir_get_block()
147 iter->fpos = fpos; in afs_dir_get_block()
152 iter->fq_slot = 0; in afs_dir_get_block()
156 iter->fq = NULL; in afs_dir_get_block()
157 iter->fq_slot = 0; in afs_dir_get_block()
261 meta = afs_dir_get_block(&iter, 0); in afs_edit_dir_add()
466 if (!iter.prev_entry) { in afs_edit_dir_remove()
472 iter.bucket, iter.prev_entry, prev_next, entry, in afs_edit_dir_remove()
[all …]
/fs/netfs/
A Diterator.c114 size_t len, span = 0, n = iter->count; in netfs_limit_bvec()
117 if (WARN_ON(!iov_iter_is_bvec(iter)) || in netfs_limit_bvec()
156 loff_t pos = iter->xarray_start + iter->iov_offset; in netfs_limit_xarray()
158 size_t span = 0, n = iter->count; in netfs_limit_xarray()
160 XA_STATE(xas, iter->xarray, index); in netfs_limit_xarray()
201 unsigned int slot = iter->folioq_slot; in netfs_limit_folioq()
202 size_t span = 0, n = iter->count; in netfs_limit_folioq()
215 start_offset += iter->iov_offset; in netfs_limit_folioq()
242 if (iov_iter_is_folioq(iter)) in netfs_limit_iter()
244 if (iov_iter_is_bvec(iter)) in netfs_limit_iter()
[all …]
/fs/xfs/
A Dxfs_zone_gc.c208 data->iter.recs = kcalloc(XFS_ZONE_GC_RECS, sizeof(*data->iter.recs), in xfs_zone_gc_data_alloc()
265 iter->rec_idx = 0; in xfs_zone_gc_iter_init()
284 iter->recs[iter->rec_count] = *irec; in xfs_zone_gc_query_cb()
351 sort(iter->recs, iter->rec_count, sizeof(iter->recs[0]), in xfs_zone_gc_query()
384 if (iter->rec_idx == iter->rec_count) { in xfs_zone_gc_iter_next()
392 irec = &iter->recs[iter->rec_idx]; in xfs_zone_gc_iter_next()
407 iter->rec_idx++; in xfs_zone_gc_iter_next()
425 struct xfs_rmap_irec *irec = &iter->recs[iter->rec_idx]; in xfs_zone_gc_iter_advance()
431 iter->rec_idx++; in xfs_zone_gc_iter_advance()
488 struct xfs_zone_gc_iter *iter = &data->iter; in xfs_zone_gc_select_victim() local
[all …]
/fs/
A Ddax.c1005 pgoff_t pgoff = dax_iomap_pgoff(&iter->iomap, iter->pos); in copy_cow_page_dax()
1487 struct iomap_iter iter = { in dax_file_unshare() local
1500 iter.status = dax_unshare_iter(&iter); in dax_file_unshare()
1549 loff_t pos = iter->pos; in dax_zero_iter()
1588 iter.status = dax_zero_iter(&iter, did_zero); in dax_zero_range()
1703 map_len, iter); in dax_iomap_iter()
1706 map_len, iter); in dax_iomap_iter()
1709 map_len, iter); in dax_iomap_iter()
1910 if (iter.pos >= i_size_read(iter.inode)) { in dax_iomap_pte_fault()
1951 iter.status = iomap_iter_advance(&iter, &length); in dax_iomap_pte_fault()
[all …]

Completed in 88 milliseconds

123456789