Lines Matching refs:btree

340 		struct btree *b = bch2_backpointer_get_node(trans, iter, bp_pos, bp);  in bch2_backpointer_get_key()
350 struct btree *bch2_backpointer_get_node(struct btree_trans *trans, in bch2_backpointer_get_node()
369 struct btree *b = bch2_btree_iter_peek_node(iter); in bch2_backpointer_get_node()
447 static int drop_dev_and_update(struct btree_trans *trans, enum btree_id btree, in drop_dev_and_update() argument
456 return bch2_btree_insert_trans(trans, btree, n, 0); in drop_dev_and_update()
460 enum btree_id btree, struct bkey_s_c extent, in check_extent_checksum() argument
504 prt_printf(&buf, "\n %s ", bch2_btree_id_str(btree)); in check_extent_checksum()
514 ret = drop_dev_and_update(trans, btree, extent, dev) ?: 1; in check_extent_checksum()
662 enum btree_id btree, unsigned level, in check_extent_to_backpointers() argument
682 bch2_extent_ptr_to_bp(c, ca, btree, level, k, p, entry, &bucket_pos, &bp); in check_extent_to_backpointers()
703 struct btree *b; in check_btree_root_to_backpointers()
731 .btree = bp.btree_id, in bp_to_bbpos()
768 for (enum btree_id btree = start.btree; in bch2_get_btree_in_memory_pos() local
769 btree < BTREE_ID_NR && !ret; in bch2_get_btree_in_memory_pos()
770 btree++) { in bch2_get_btree_in_memory_pos()
771 unsigned depth = (BIT_ULL(btree) & btree_leaf_mask) ? 0 : 1; in bch2_get_btree_in_memory_pos()
773 if (!(BIT_ULL(btree) & btree_leaf_mask) && in bch2_get_btree_in_memory_pos()
774 !(BIT_ULL(btree) & btree_interior_mask)) in bch2_get_btree_in_memory_pos()
777 ret = __for_each_btree_node(trans, iter, btree, in bch2_get_btree_in_memory_pos()
778 btree == start.btree ? start.pos : POS_MIN, in bch2_get_btree_in_memory_pos()
783 BBPOS(btree, b->key.k.p); in bch2_get_btree_in_memory_pos()
798 struct btree *last_node;
815 .btree.id = i, in progress_init()
839 struct btree *b = path_l(btree_iter_path(trans, iter))->b; in progress_update_iter()
1026 struct bbpos start = (struct bbpos) { .btree = 0, .pos = POS_MIN, }, end; in bch2_check_backpointers_to_extents()