Home
last modified time | relevance | path

Searched refs:node_iter (Results 1 – 6 of 6) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbtree_journal_iter.c508 return bch2_btree_node_iter_peek_unpack(&iter->node_iter, in bch2_journal_iter_peek_btree()
514 bch2_btree_node_iter_advance(&iter->node_iter, iter->b); in bch2_journal_iter_advance_btree()
607 struct btree_node_iter node_iter, in __bch2_btree_and_journal_iter_init_node_iter() argument
614 iter->node_iter = node_iter; in __bch2_btree_and_journal_iter_init_node_iter()
634 struct btree_node_iter node_iter; in bch2_btree_and_journal_iter_init_node_iter() local
636 bch2_btree_node_iter_init_from_start(&node_iter, b); in bch2_btree_and_journal_iter_init_node_iter()
637 __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 Dbtree_journal_iter.h22 struct btree_node_iter node_iter; member
H A Dbtree_iter.c421 struct btree_node_iter *node_iter, in __bch2_btree_node_iter_fix() argument
432 unsigned orig_iter_pos = node_iter->data[0].k; in __bch2_btree_node_iter_fix()
437 btree_node_iter_for_each(node_iter, set) in __bch2_btree_node_iter_fix()
470 bch2_btree_node_iter_sort(node_iter, b); in __bch2_btree_node_iter_fix()
472 if (node_iter->data[0].k != orig_iter_pos) in __bch2_btree_node_iter_fix()
482 if (!bch2_btree_node_iter_end(node_iter) && in __bch2_btree_node_iter_fix()
504 btree_node_iter_set_set_pos(node_iter, in __bch2_btree_node_iter_fix()
513 struct btree_node_iter *node_iter, in bch2_btree_node_iter_fix() argument
522 if (node_iter != &path->l[b->c.level].iter) { in bch2_btree_node_iter_fix()
527 bch2_btree_node_iter_verify(node_iter, b); in bch2_btree_node_iter_fix()
[all …]
H A Dbtree_trans_commit.c154 struct btree_node_iter *node_iter, in bch2_btree_bset_insert_key() argument
169 k = bch2_btree_node_iter_peek_all(node_iter, b); in bch2_btree_bset_insert_key()
216 k = bch2_btree_node_iter_bset_pos(node_iter, b, bset_tree_last(b)); in bch2_btree_bset_insert_key()
222 bch2_btree_node_iter_fix(trans, path, b, node_iter, k, in bch2_btree_bset_insert_key()
H A Dbtree_update_interior.c1338 struct btree_node_iter *node_iter, in bch2_insert_fixup_btree_ptr() argument
1373 while ((k = bch2_btree_node_iter_peek_all(node_iter, b)) && in bch2_insert_fixup_btree_ptr()
1375 bch2_btree_node_iter_advance(node_iter, b); in bch2_insert_fixup_btree_ptr()
1377 bch2_btree_bset_insert_key(trans, path, b, node_iter, insert); in bch2_insert_fixup_btree_ptr()
1397 struct btree_node_iter node_iter, in bch2_btree_insert_keys_interior() argument
1405 while ((k = bch2_btree_node_iter_prev_all(&node_iter, b)) && in bch2_btree_insert_keys_interior()
1412 bch2_insert_fixup_btree_ptr(as, trans, path, b, &node_iter, insert); in bch2_btree_insert_keys_interior()
1577 struct btree_node_iter node_iter; in btree_split_insert_keys() local
1579 bch2_btree_node_iter_init(&node_iter, b, &bch2_keylist_front(keys)->k.p); in btree_split_insert_keys()
1581 int ret = bch2_btree_insert_keys_interior(as, trans, path, b, node_iter, keys); in btree_split_insert_keys()
H A Dec.c1111 struct btree_iter node_iter; in ec_stripe_update_extent() local
1114 b = bch2_backpointer_get_node(trans, bp, &node_iter, last_flushed); in ec_stripe_update_extent()
1115 bch2_trans_iter_exit(trans, &node_iter); in ec_stripe_update_extent()