52 	bch2_btree_id_level_to_text(out, bp.v->btree_id, bp.v->level);  in bch2_backpointer_to_text()
71 			      enum btree_id btree_id, unsigned level,  in extent_matches_bp()  argument
81 		bch2_extent_ptr_to_bp(c, btree_id, level, k, p, entry, &bp2);  in extent_matches_bp()
227 			bch2_extent_ptr_to_bp(c, bp.v->btree_id, bp.v->level, target_k, p, entry, &bp2);  in backpointer_target_not_found()
270 				  bp.v->btree_id,  in __bch2_backpointer_get_node()
281 	if (extent_matches_bp(c, bp.v->btree_id, bp.v->level,  in __bch2_backpointer_get_node()
306 	if (unlikely(bp.v->btree_id >= btree_id_nr_alive(c)))  in __bch2_backpointer_get_key()
310 				  bp.v->btree_id,  in __bch2_backpointer_get_key()
334 	    extent_matches_bp(c, bp.v->btree_id, bp.v->level, k, bp))  in __bch2_backpointer_get_key()
442 static int drop_dev_and_update(struct btree_trans *trans, enum btree_id btree,  in drop_dev_and_update()
455 				 enum btree_id btree, struct bkey_s_c extent,  in check_extent_checksum()
456 				 enum btree_id o_btree, struct bkey_s_c extent2, unsigned dev)  in check_extent_checksum()
582 				ret = drop_dev_and_update(trans, other_bp.v->btree_id,  in check_bp_exists()
600 			ret = drop_dev_and_update(trans, other_bp.v->btree_id,  in check_bp_exists()
606 			ret = drop_dev_and_update(trans, bp->v.btree_id, orig_k, bp->k.p.inode);  in check_bp_exists()
614 				    other_bp.v->btree_id, other_extent,  in check_bp_exists()
615 				    bp->v.btree_id, orig_k,  in check_bp_exists()
624 	ret = check_extent_checksum(trans, bp->v.btree_id, orig_k,  in check_bp_exists()
625 				    other_bp.v->btree_id, other_extent, bp->k.p.inode);  in check_bp_exists()
658 					enum btree_id btree, unsigned level,  in check_extent_to_backpointers()
695 					    enum btree_id btree_id,  in check_btree_root_to_backpointers()  argument
704 	bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN,  in check_btree_root_to_backpointers()
705 				  0, bch2_btree_id_root(c, btree_id)->b->c.level, 0);  in check_btree_root_to_backpointers()
719 	ret = check_extent_to_backpointers(trans, s, btree_id, b->c.level + 1, k);  in check_btree_root_to_backpointers()
728 		.btree	= bp.btree_id,  in bp_to_bbpos()
765 	for (enum btree_id btree = start.btree;  in bch2_get_btree_in_memory_pos()
800 	for (enum btree_id btree_id = 0;  in bch2_check_extents_to_backpointers_pass()  local
801 	     btree_id < btree_id_nr_alive(c);  in bch2_check_extents_to_backpointers_pass()
802 	     btree_id++) {  in bch2_check_extents_to_backpointers_pass()
803 		int level, depth = btree_type_has_ptrs(btree_id) ? 0 : 1;  in bch2_check_extents_to_backpointers_pass()
807 				check_btree_root_to_backpointers(trans, s, btree_id, &level));  in bch2_check_extents_to_backpointers_pass()
813 			bch2_trans_node_iter_init(trans, &iter, btree_id, POS_MIN, 0, level,  in bch2_check_extents_to_backpointers_pass()
818 				check_extent_to_backpointers(trans, s, btree_id, level, k) ?:  in bch2_check_extents_to_backpointers_pass()
986 				  enum btree_id btree, unsigned level)  in btree_node_get_and_pin()
1032 		bch2_btree_node_prefetch(trans, path, tmp.k, path->btree_id, path->level - 1);  in bch2_pin_backpointer_nodes_with_missing()
1056 		int ret2 = btree_node_get_and_pin(trans, tmp.k, path->btree_id, path->level - 1);  in bch2_pin_backpointer_nodes_with_missing()