fs/bcachefs/btree_gc.c

97 	int ret;
119 	ret = bch2_journal_key_insert_take(c, b->c.btree_id, b->c.level + 1, &new->k_i);
120 	if (ret) {
122 		return ret;
133 	int ret;
146 	ret = bch2_journal_key_delete(c, b->c.btree_id, b->c.level + 1, b->key.k.p);
147 	if (ret)
148 		return ret;
159 	ret = bch2_journal_key_insert_take(c, b->c.btree_id, b->c.level + 1, &new->k_i);
160 	if (ret) {
162 		return ret;
171 	ret = __bch2_btree_node_hash_insert(&c->btree_cache, b);
172 	BUG_ON(ret);
185 	int ret = 0;
209 			ret = bch2_get_scanned_nodes(c, b->c.btree_id, 0,
212 			if (ret)
216 			ret = DID_FILL_FROM_SCAN;
220 				ret = set_node_min(c, cur, expected_start);
227 					ret = DROP_PREV_NODE;
231 					ret = set_node_max(c, prev,
238 					ret = DROP_THIS_NODE;
242 					ret = set_node_min(c, cur, expected_start);
249 	return ret;
256 	int ret = 0;
272 			ret = bch2_get_scanned_nodes(c, b->c.btree_id, 0,
274 			if (ret)
278 			ret = DID_FILL_FROM_SCAN;
280 			ret = set_node_max(c, child, b->key.k.p);
286 	return ret;
299 	int ret = 0;
322 		ret = PTR_ERR_OR_ZERO(cur);
327 		if (mustfix_fsck_err_on(bch2_err_matches(ret, EIO), c,
336 			ret = bch2_journal_key_delete(c, b->c.btree_id,
338 			if (ret)
342 				ret = bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_scan_for_btree_nodes);
343 				if (ret)
349 		bch_err_msg(c, ret, "getting btree node");
350 		if (ret)
357 			ret = bch2_journal_key_delete(c, b->c.btree_id,
360 			if (ret)
365 		ret = btree_check_node_boundaries(c, b, prev, cur, pulled_from_scan);
366 		if (ret == DID_FILL_FROM_SCAN) {
368 			ret = 0;
371 		if (ret == DROP_THIS_NODE) {
374 			ret = bch2_journal_key_delete(c, b->c.btree_id,
377 			if (ret)
386 		if (ret == DROP_PREV_NODE) {
389 			ret = bch2_journal_key_delete(c, b->c.btree_id,
391 			if (ret)
396 		} else if (ret)
404 	if (!ret && !IS_ERR_OR_NULL(prev)) {
406 		ret = btree_repair_node_end(c, b, prev, pulled_from_scan);
407 		if (ret == DID_FILL_FROM_SCAN) {
409 			ret = 0;
420 	if (ret)
438 		ret = PTR_ERR_OR_ZERO(cur);
440 		bch_err_msg(c, ret, "getting btree node");
441 		if (ret)
444 		ret = bch2_btree_repair_topology_recurse(trans, cur, pulled_from_scan);
448 		if (ret == DROP_THIS_NODE) {
450 			ret = bch2_journal_key_delete(c, b->c.btree_id,
455 		if (ret)
470 		ret = DROP_THIS_NODE;
480 	if (!ret && new_pass)
483 	BUG_ON(!ret && bch2_btree_node_check_topology(trans, b));
488 	return ret;
495 	int ret = 0;
497 	for (unsigned i = 0; i < btree_id_nr_alive(c) && !ret; i++) {
502 			ret = bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_scan_for_btree_nodes);
503 			if (ret)
518 				ret = bch2_get_scanned_nodes(c, i, 0, POS_MIN, SPOS_MAX);
519 				if (ret)
529 		ret = bch2_btree_repair_topology_recurse(trans, b, &pulled_from_scan);
532 		if (ret == DROP_THIS_NODE) {
546 			ret = 0;
551 	return ret;
568 			int ret = bch2_btree_node_check_topology(trans, b);
569 			if (ret)
570 				return ret;
578 	int ret = 0;
612 	ret = bch2_key_trigger(trans, btree_id, level, old, unsafe_bkey_s_c_to_s(k),
614 	if (ret)
618 		ret = bch2_trans_commit(trans, NULL, NULL, 0) ?:
623 	ret = bch2_key_trigger(trans, btree_id, level, old, unsafe_bkey_s_c_to_s(k),
628 	bch_err_fn(c, ret);
629 	return ret;
636 	int ret = 0;
647 		ret = lockrestart_do(trans,
654 	if (ret)
655 		return ret;
663 		ret = for_each_btree_key_continue(trans, iter, 0, k, ({
667 		if (ret)
671 	return ret;
685 	int ret = 0;
691 	for (i = 0; i < btree_id_nr_alive(c) && !ret; i++) {
697 		ret = bch2_gc_btree(trans, btree, true);
699 		if (mustfix_fsck_err_on(bch2_err_matches(ret, EIO),
703 			ret = bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_check_topology);
707 	bch_err_fn(c, ret);
708 	return ret;
716 	int ret = bch2_trans_mark_dev_sbs_flags(c, BTREE_TRIGGER_gc);
718 	return ret;
743 	int ret = 0;
819 	bch_err_fn(c, ret);
822 	return ret;
875 	int ret;
939 	ret = PTR_ERR_OR_ZERO(a);
940 	if (ret)
941 		return ret;
952 	ret = bch2_trans_update(trans, iter, &a->k_i, BTREE_TRIGGER_norun);
954 	return ret;
959 	int ret = 0;
962 		ret = bch2_trans_run(c,
969 		if (ret) {
975 	bch_err_fn(c, ret);
976 	return ret;
997 	int ret = bch2_trans_run(c,
1015 	bch_err_fn(c, ret);
1016 	return ret;
1028 	int ret = 0;
1052 		ret = PTR_ERR_OR_ZERO(new);
1053 		if (ret)
1060 		ret = bch2_trans_update(trans, iter, new, 0);
1065 	return ret;
1072 	int ret = bch2_trans_run(c,
1079 	return ret;
1086 	int ret = bch2_trans_run(c,
1097 				ret = -BCH_ERR_ENOMEM_gc_reflink_start;
1107 	bch_err_fn(c, ret);
1108 	return ret;
1121 	int ret = 0;
1148 		ret = PTR_ERR_OR_ZERO(new);
1149 		if (ret)
1150 			return ret;
1157 		ret = bch2_trans_update(trans, iter, &new->k_i, 0);
1161 	return ret;
1198 	int ret;
1206 	ret   = bch2_gc_start(c) ?:
1209 	if (ret)
1214 	ret = bch2_mark_superblocks(c);
1215 	BUG_ON(ret);
1217 	ret = bch2_gc_btrees(c);
1218 	if (ret)
1225 	ret   = bch2_gc_alloc_done(c) ?:
1246 	bch_err_fn(c, ret);
1247 	return ret;
1257 	int ret;
1290 	ret = PTR_ERR_OR_ZERO(u);
1291 	if (ret)
1292 		return ret;
1304 	int ret;
1310 	ret = PTR_ERR_OR_ZERO(a_mut);
1311 	if (ret)
1312 		return ret;
1323 	int ret;
1344 			ret = -BCH_ERR_ENOMEM_gc_gens;
1358 			ret = bch2_trans_run(c,
1366 			if (ret)
1371 	ret = bch2_trans_run(c,
1387 	if (ret)
1405 	if (!bch2_err_matches(ret, EROFS))
1406 		bch_err_fn(c, ret);
1407 	return ret;