Searched refs:node_iter (Results 1 – 5 of 5) sorted by relevance
/linux/fs/bcachefs/ |
H A D | btree_journal_iter.c | 513 return bch2_btree_node_iter_peek_unpack(&iter->node_iter, in bch2_journal_iter_peek_btree() 519 bch2_btree_node_iter_advance(&iter->node_iter, iter->b); in bch2_journal_iter_advance_btree() 612 struct btree_node_iter node_iter, in __bch2_btree_and_journal_iter_init_node_iter() argument 619 iter->node_iter = node_iter; in __bch2_btree_and_journal_iter_init_node_iter() 639 struct btree_node_iter node_iter; in bch2_btree_and_journal_iter_init_node_iter() local 641 bch2_btree_node_iter_init_from_start(&node_iter, b); in bch2_btree_and_journal_iter_init_node_iter() 642 __bch2_btree_and_journal_iter_init_node_iter(trans, iter, b, node_iter, b->data->min_key); in bch2_btree_and_journal_iter_init_node_iter()
|
H A D | btree_journal_iter.h | 22 struct btree_node_iter node_iter; member
|
H A D | btree_trans_commit.c | 156 struct btree_node_iter *node_iter, in bch2_btree_bset_insert_key() argument 171 k = bch2_btree_node_iter_peek_all(node_iter, b); in bch2_btree_bset_insert_key() 218 k = bch2_btree_node_iter_bset_pos(node_iter, b, bset_tree_last(b)); in bch2_btree_bset_insert_key() 224 bch2_btree_node_iter_fix(trans, path, b, node_iter, k, in bch2_btree_bset_insert_key()
|
H A D | btree_update_interior.c | 1380 struct btree_node_iter *node_iter, in bch2_insert_fixup_btree_ptr() argument 1415 while ((k = bch2_btree_node_iter_peek_all(node_iter, b)) && in bch2_insert_fixup_btree_ptr() 1417 bch2_btree_node_iter_advance(node_iter, b); in bch2_insert_fixup_btree_ptr() 1419 bch2_btree_bset_insert_key(trans, path, b, node_iter, insert); in bch2_insert_fixup_btree_ptr() 1439 struct btree_node_iter node_iter, in bch2_btree_insert_keys_interior() argument 1447 while ((k = bch2_btree_node_iter_prev_all(&node_iter, b)) && in bch2_btree_insert_keys_interior() 1454 bch2_insert_fixup_btree_ptr(as, trans, path, b, &node_iter, insert); in bch2_btree_insert_keys_interior() 1619 struct btree_node_iter node_iter; in btree_split_insert_keys() local 1621 bch2_btree_node_iter_init(&node_iter, b, &bch2_keylist_front(keys)->k.p); in btree_split_insert_keys() 1623 int ret = bch2_btree_insert_keys_interior(as, trans, path, b, node_iter, key in btree_split_insert_keys() [all...] |
H A D | ec.c | 1119 struct btree_iter node_iter; in ec_stripe_update_extent() local 1122 b = bch2_backpointer_get_node(trans, bp, &node_iter, last_flushed); in ec_stripe_update_extent() 1123 bch2_trans_iter_exit(trans, &node_iter); in ec_stripe_update_extent()
|