| /linux/drivers/soc/ti/ |
| H A D | knav_dma.c | 411 struct knav_dma_chan *chan = NULL, *iter2; in knav_dma_open_channel() local
450 list_for_each_entry(iter2, &dma->chan_list, list) { in knav_dma_open_channel()
452 if (iter2->channel == chan_num) { in knav_dma_open_channel()
453 chan = iter2; in knav_dma_open_channel()
457 if (iter2->flow == chan_num) { in knav_dma_open_channel()
458 chan = iter2; in knav_dma_open_channel()
|
| /linux/block/ |
| H A D | blk-map.c | 214 struct iov_iter iter2 = *iter; in bio_copy_user_iov() local
217 iter2.data_source = ITER_SOURCE; in bio_copy_user_iov()
218 ret = bio_copy_from_iter(bio, &iter2); in bio_copy_user_iov()
|
| /linux/fs/bcachefs/ |
| H A D | fsck.c | 1747 struct btree_iter iter1, iter2 = { NULL }; in overlapping_extents_found() local
1776 bch2_trans_copy_iter(&iter2, &iter1); in overlapping_extents_found()
1779 bch2_btree_iter_advance(&iter2); in overlapping_extents_found()
1810 old_iter = &iter2; in overlapping_extents_found()
1848 bch2_trans_iter_exit(trans, &iter2); in overlapping_extents_found()
1977 struct btree_iter iter2; in check_extent() local
1979 bch2_trans_copy_iter(&iter2, iter); in check_extent()
1980 bch2_btree_iter_set_snapshot(&iter2, i->snapshot); in check_extent()
1981 ret = bch2_btree_iter_traverse(&iter2) ?: in check_extent()
1982 bch2_btree_delete_at(trans, &iter2, in check_extent()
[all …]
|
| H A D | btree_update_interior.c | 2329 struct btree_iter iter2 = { NULL }; in __bch2_btree_node_update_key() local
2353 bch2_trans_copy_iter(&iter2, iter); in __bch2_btree_node_update_key()
2355 iter2.path = bch2_btree_path_make_mut(trans, iter2.path, in __bch2_btree_node_update_key()
2356 iter2.flags & BTREE_ITER_intent, in __bch2_btree_node_update_key()
2359 struct btree_path *path2 = btree_iter_path(trans, &iter2); in __bch2_btree_node_update_key()
2367 ret = bch2_btree_iter_traverse(&iter2) ?: in __bch2_btree_node_update_key()
2368 bch2_trans_update(trans, &iter2, new_key, BTREE_TRIGGER_norun); in __bch2_btree_node_update_key()
2407 bch2_trans_iter_exit(trans, &iter2); in __bch2_btree_node_update_key()
|
| H A D | fs.c | 1621 struct btree_iter iter2; in bch2_get_name() local
1638 bch2_trans_iter_init(trans, &iter2, BTREE_ID_dirents, in bch2_get_name()
1648 bch2_btree_iter_set_snapshot(&iter2, snapshot); in bch2_get_name()
1681 for_each_btree_key_continue_norestart(iter2, 0, k, ret) { in bch2_get_name()
1713 bch2_trans_iter_exit(trans, &iter2); in bch2_get_name()
|
| H A D | alloc_background.c | 1033 struct btree_iter iter2; in bch2_get_key_or_hole() local
1036 bch2_trans_copy_iter(&iter2, iter); in bch2_get_key_or_hole()
1048 k = bch2_btree_iter_peek_upto(&iter2, end); in bch2_get_key_or_hole()
1049 next = iter2.pos; in bch2_get_key_or_hole()
1050 bch2_trans_iter_exit(iter->trans, &iter2); in bch2_get_key_or_hole()
|
| H A D | btree_iter.c | 2671 struct btree_iter iter2; in bch2_btree_iter_peek_slot() local
2673 bch2_trans_copy_iter(&iter2, iter); in bch2_btree_iter_peek_slot()
2674 k = bch2_btree_iter_peek_upto(&iter2, end); in bch2_btree_iter_peek_slot()
2677 swap(iter->key_cache_path, iter2.key_cache_path); in bch2_btree_iter_peek_slot()
2678 iter->k = iter2.k; in bch2_btree_iter_peek_slot()
2681 bch2_trans_iter_exit(trans, &iter2); in bch2_btree_iter_peek_slot()
|
| /linux/drivers/md/bcache/ |
| H A D | extents.c | 269 static inline void new_btree_iter_swap(void *iter1, void *iter2, void __always_unused *args) in new_btree_iter_swap() argument
272 struct btree_iter_set *_iter2 = iter2; in new_btree_iter_swap()
|
| H A D | bset.c | 1096 static inline void new_btree_iter_swap(void *iter1, void *iter2, void __always_unused *args) in new_btree_iter_swap() argument
1099 struct btree_iter_set *_iter2 = iter2; in new_btree_iter_swap()
|
| /linux/net/dsa/ |
| H A D | user.c | 3146 struct list_head *iter1, *iter2; in dsa_lag_conduit_validate() local
3149 netdev_for_each_lower_dev(lag_dev, lower2, iter2) { in dsa_lag_conduit_validate()
|