60 	bch2_btree_id_level_to_text(out, p->btree, p->level);  in bch2_gc_pos_to_text()
88 static void btree_ptr_to_v2(struct btree *b, struct bkey_i_btree_ptr_v2 *dst)  in btree_ptr_to_v2()
112 static int set_node_min(struct bch_fs *c, struct btree *b, struct bpos new_min)  in set_node_min()
148 static int set_node_max(struct bch_fs *c, struct btree *b, struct bpos new_max)  in set_node_max()
195 static int btree_check_node_boundaries(struct btree_trans *trans, struct btree *b,  in btree_check_node_boundaries()
196 				       struct btree *prev, struct btree *cur,  in btree_check_node_boundaries()
272 static int btree_repair_node_end(struct btree_trans *trans, struct btree *b,  in btree_repair_node_end()
273 				 struct btree *child, struct bpos *pulled_from_scan)  in btree_repair_node_end()
311 static int bch2_btree_repair_topology_recurse(struct btree_trans *trans, struct btree *b,  in bch2_btree_repair_topology_recurse()
318 	struct btree *prev = NULL, *cur = NULL;  in bch2_btree_repair_topology_recurse()
551 		struct btree *b = r->b;  in bch2_check_topology()
582 			    unsigned level, struct btree **prev,  in bch2_gc_mark_key()
590 		struct btree *b = path_l(path)->b;  in bch2_gc_mark_key()
659 static int bch2_gc_btree(struct btree_trans *trans, enum btree_id btree, bool initial)  in bch2_gc_btree()  argument
662 	unsigned target_depth = btree_node_type_has_triggers(__btree_node_type(0, btree)) ? 0 : 1;  in bch2_gc_btree()
670 		struct btree *prev = NULL;  in bch2_gc_btree()
672 		bch2_trans_node_iter_init(trans, &iter, btree, POS_MIN, 0, level,  in bch2_gc_btree()
676 			gc_pos_set(c, gc_pos_btree(btree, level, k.k->p));  in bch2_gc_btree()
677 			bch2_gc_mark_key(trans, btree, level, &prev, &iter, k, initial);  in bch2_gc_btree()
689 		bch2_trans_node_iter_init(trans, &iter, btree, POS_MIN,  in bch2_gc_btree()
690 					  0, bch2_btree_id_root(c, btree)->b->c.level, 0);  in bch2_gc_btree()
691 		struct btree *b = bch2_btree_iter_peek_node(&iter);  in bch2_gc_btree()
701 		gc_pos_set(c, gc_pos_btree(btree, b->c.level + 1, SPOS_MAX));  in bch2_gc_btree()
703 		ret = bch2_gc_mark_key(trans, btree, b->c.level + 1, NULL, NULL, k, initial);  in bch2_gc_btree()
730 		unsigned btree = i < BTREE_ID_NR ? ids[i] : i;  in bch2_gc_btrees()  local
732 		if (IS_ERR_OR_NULL(bch2_btree_id_root(c, btree)->b))  in bch2_gc_btrees()
735 		ret = bch2_gc_btree(trans, btree, true);  in bch2_gc_btrees()