fs/bcachefs/btree_gc.c

76 static void btree_ptr_to_v2(struct btree *b, struct bkey_i_btree_ptr_v2 *dst)
101 					     enum btree_id btree, unsigned level,
105 	struct btree *b;
112 	b = bch2_btree_node_get_noiter(trans, tmp.k, btree, level, true);
129 static int set_node_min(struct bch_fs *c, struct btree *b, struct bpos new_min)
165 static int set_node_max(struct bch_fs *c, struct btree *b, struct bpos new_max)
212 static int btree_check_node_boundaries(struct bch_fs *c, struct btree *b,
213 				       struct btree *prev, struct btree *cur,
229 	prt_printf(&buf, "  at btree %s level %u:\n  parent: ",
254 					     "btree node with incorrect min_key%s", buf.buf))
261 						     "btree node overwritten by next node%s", buf.buf))
265 						     "btree node with incorrect max_key%s", buf.buf))
272 						     "btree node overwritten by prev node%s", buf.buf))
276 						     "btree node with incorrect min_key%s", buf.buf))
287 static int btree_repair_node_end(struct bch_fs *c, struct btree *b,
288 				 struct btree *child, struct bpos *pulled_from_scan)
296 	prt_printf(&buf, "at btree %s level %u:\n  parent: ",
304 			     "btree node with incorrect max_key%s", buf.buf)) {
324 static int bch2_btree_repair_topology_recurse(struct btree_trans *trans, struct btree *b,
331 	struct btree *prev = NULL, *cur = NULL;
364 				"Topology repair: unreadable btree node at btree %s level %u:\n"
384 		bch_err_msg(c, ret, "getting btree node");
389 			bch_info(c, "btree node %s older than nodes found by scanning", buf.buf);
475 		bch_err_msg(c, ret, "getting btree node");
501 			"empty interior btree node at btree %s level %u\n"
541 			bch_info(c, "btree root %s unreadable, must recover from scan", bch2_btree_id_str(i));
548 						 "no nodes found for btree %s, continue?", bch2_btree_id_str(i));
561 		struct btree *b = r->b;
578 			bch_err(c, "empty btree root %s", bch2_btree_id_str(i));
612 				"bucket %u:%zu data type %s ptr gen %u missing in alloc btree\n"
717 			bch_err(c, "cannot update btree roots yet");
733 			 * We don't want to drop btree node pointers - if the
734 			 * btree node isn't there anymore, the read path will
821 /* marking of btree keys/nodes: */
854 				"btree ptr not marked in member info btree allocated bitmap\n  %s",
873 static int btree_gc_mark_node(struct btree_trans *trans, struct btree *b, bool initial)
906 	struct btree *b;
941 static int bch2_gc_btree_init_recurse(struct btree_trans *trans, struct btree *b,
976 			struct btree *child;
994 					  "Unreadable btree node at btree %s level %u:\n"
1012 				bch_err_msg(c, ret, "getting btree node");
1036 	struct btree *b;
1048 			"btree root with incorrect min_key: %s", buf.buf)) {
1058 			"btree root with incorrect max_key: %s", buf.buf)) {
1259 			      b.btree,		"btree");
1753  *    move it to the btree, but not the reverse.
2028 		 * Full gc is currently incompatible with btree key cache: