Home
last modified time | relevance | path

Searched refs:iter2 (Results 1 – 8 of 8) sorted by relevance

/linux-6.15/drivers/soc/ti/
H A Dknav_dma.c411 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-6.15/block/
H A Dblk-map.c214 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-6.15/fs/bcachefs/
H A Dfsck.c1604 struct btree_iter iter1, iter2 = {}; in overlapping_extents_found() local
1633 bch2_trans_copy_iter(trans, &iter2, &iter1); in overlapping_extents_found()
1636 bch2_btree_iter_advance(trans, &iter2); in overlapping_extents_found()
1667 old_iter = &iter2; in overlapping_extents_found()
1707 bch2_trans_iter_exit(trans, &iter2); in overlapping_extents_found()
1836 struct btree_iter iter2; in check_extent() local
1838 bch2_trans_copy_iter(trans, &iter2, iter); in check_extent()
1839 bch2_btree_iter_set_snapshot(trans, &iter2, i->snapshot); in check_extent()
1840 ret = bch2_btree_iter_traverse(trans, &iter2) ?: in check_extent()
1841 bch2_btree_delete_at(trans, &iter2, in check_extent()
[all …]
H A Dbtree_update_interior.c2424 struct btree_iter iter2 = {}; in __bch2_btree_node_update_key() local
2448 bch2_trans_copy_iter(trans, &iter2, iter); in __bch2_btree_node_update_key()
2450 iter2.path = bch2_btree_path_make_mut(trans, iter2.path, in __bch2_btree_node_update_key()
2451 iter2.flags & BTREE_ITER_intent, in __bch2_btree_node_update_key()
2454 struct btree_path *path2 = btree_iter_path(trans, &iter2); in __bch2_btree_node_update_key()
2462 ret = bch2_btree_iter_traverse(trans, &iter2) ?: in __bch2_btree_node_update_key()
2463 bch2_trans_update(trans, &iter2, new_key, BTREE_TRIGGER_norun); in __bch2_btree_node_update_key()
2503 bch2_trans_iter_exit(trans, &iter2); in __bch2_btree_node_update_key()
H A Dalloc_background.c1053 struct btree_iter iter2; in bch2_get_key_or_hole() local
1056 bch2_trans_copy_iter(trans, &iter2, iter); in bch2_get_key_or_hole()
1068 k = bch2_btree_iter_peek_max(trans, &iter2, end); in bch2_get_key_or_hole()
1069 next = iter2.pos; in bch2_get_key_or_hole()
1070 bch2_trans_iter_exit(trans, &iter2); in bch2_get_key_or_hole()
H A Dfs.c1969 struct btree_iter iter2; in bch2_get_name() local
1986 bch2_trans_iter_init(trans, &iter2, BTREE_ID_dirents, in bch2_get_name()
1996 bch2_btree_iter_set_snapshot(trans, &iter2, snapshot); in bch2_get_name()
2029 for_each_btree_key_continue_norestart(trans, iter2, 0, k, ret) { in bch2_get_name()
2061 bch2_trans_iter_exit(trans, &iter2); in bch2_get_name()
H A Dbtree_iter.c2822 struct btree_iter iter2; in bch2_btree_iter_peek_slot() local
2824 bch2_trans_copy_iter(trans, &iter2, iter); in bch2_btree_iter_peek_slot()
2825 k = bch2_btree_iter_peek_max(trans, &iter2, end); in bch2_btree_iter_peek_slot()
2828 swap(iter->key_cache_path, iter2.key_cache_path); in bch2_btree_iter_peek_slot()
2829 iter->k = iter2.k; in bch2_btree_iter_peek_slot()
2832 bch2_trans_iter_exit(trans, &iter2); in bch2_btree_iter_peek_slot()
/linux-6.15/net/dsa/
H A Duser.c3203 struct list_head *iter1, *iter2; in dsa_lag_conduit_validate() local
3206 netdev_for_each_lower_dev(lag_dev, lower2, iter2) { in dsa_lag_conduit_validate()