fs/bcachefs/btree_update_interior.c

70 	int ret = 0;
144 	return ret;
149 		ret = -BCH_ERR_btree_need_topology_repair;
151 		ret = bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_check_topology);
317 	int ret;
332 	ret = bch2_alloc_sectors_start_trans(trans,
342 	if (unlikely(ret))
343 		return ERR_PTR(ret);
384 	int ret;
422 	ret = bch2_btree_node_hash_insert(&c->btree_cache, b, level, as->btree_id);
423 	BUG_ON(ret);
530 	int ret = 0;
538 	ret = bch2_btree_cache_cannibalize_lock(trans, cl);
539 	if (ret)
540 		return ret;
549 				ret = PTR_ERR(b);
558 	return ret;
637 	int ret = PTR_ERR_OR_ZERO(e);
638 	if (ret)
639 		return ret;
648 		ret = bch2_key_trigger_old(trans, as->btree_id, level, bkey_i_to_s_c(k),
650 		if (ret)
651 			return ret;
657 		ret = bch2_key_trigger_new(trans, as->btree_id, level, bkey_i_to_s(k),
659 		if (ret)
660 			return ret;
673 	int ret;
682 	ret = bch2_journal_error(&c->journal);
683 	if (ret)
720 	ret = commit_do(trans, &as->disk_res, &journal_seq,
728 	bch2_fs_fatal_err_on(ret && !bch2_journal_error(&c->journal), c,
729 			     "%s", bch2_err_str(ret));
785 			if (!ret) {
1143 	int ret = 0;
1163 		ret = bch2_trans_relock(trans);
1164 		if (ret)
1165 			return ERR_PTR(ret);
1172 		ret = bch2_btree_path_upgrade(trans, path, level_end + 1);
1173 		if (ret)
1174 			return ERR_PTR(ret);
1195 		ret = drop_locks_do(trans, (down_read(&c->gc_lock), 0));
1196 		if (ret) {
1198 			return ERR_PTR(ret);
1233 	ret = bch2_journal_error(&c->journal);
1234 	if (ret)
1237 	ret = bch2_disk_reservation_get(c, &as->disk_res,
1241 	if (ret)
1244 	ret = bch2_btree_reserve_get(trans, as, nr_nodes, flags, NULL);
1245 	if (bch2_err_matches(ret, ENOSPC) ||
1246 	    bch2_err_matches(ret, ENOMEM)) {
1253 		if (bch2_err_matches(ret, ENOSPC) &&
1256 			ret = -BCH_ERR_journal_reclaim_would_deadlock;
1263 			ret = bch2_btree_reserve_get(trans, as, nr_nodes, flags, &cl);
1267 		} while (bch2_err_matches(ret, BCH_ERR_operation_blocked));
1270 	if (ret) {
1272 				_RET_IP_, nr_nodes[0] + nr_nodes[1], ret);
1276 	ret = bch2_trans_relock(trans);
1277 	if (ret)
1284 	if (!bch2_err_matches(ret, ENOSPC) &&
1285 	    !bch2_err_matches(ret, EROFS) &&
1286 	    ret != -BCH_ERR_journal_reclaim_would_deadlock)
1287 		bch_err_fn_ratelimited(c, ret);
1288 	return ERR_PTR(ret);
1326 		int ret = bch2_btree_node_lock_write(trans, path, &old->c);
1327 		if (ret)
1328 			return ret;
1586 	int ret = 0;
1592 	ret = bch2_btree_node_check_topology(trans, b);
1593 	if (ret)
1594 		return ret;
1685 		ret = bch2_btree_insert_node(as, trans, path, parent, &as->parent_keys);
1687 		ret = bch2_btree_set_root(as, trans, trans->paths + path, n3, false);
1690 		ret = bch2_btree_set_root(as, trans, trans->paths + path, n1, false);
1693 	if (ret)
1742 	return ret;
1777 	int ret;
1785 	ret = bch2_btree_node_lock_write(trans, path, &b->c);
1786 	if (ret)
1787 		return ret;
1796 	ret = bch2_btree_node_check_topology(trans, b);
1797 	if (ret) {
1799 		return ret;
1848 	int ret = 0;
1856 	ret = btree_split(as, trans, path, b, NULL);
1857 	if (ret) {
1859 		return ret;
1865 	     btree_node_intent_locked(&trans->paths[path], l) && !ret;
1867 		ret = bch2_foreground_maybe_merge(trans, path, l, flags);
1869 	return ret;
1898 	int ret = bch2_btree_set_root(as, trans, path, n, true);
1899 	BUG_ON(ret);
1948 	int ret = 0;
1983 	ret = bch2_btree_path_traverse(trans, sib_path, false);
1984 	if (ret)
2017 		ret = bch2_topology_error(c);
2047 	ret = PTR_ERR_OR_ZERO(as);
2048 	if (ret)
2087 	ret = bch2_btree_insert_node(as, trans, path, parent, &as->parent_keys);
2088 	if (ret)
2114 	if (ret == -BCH_ERR_journal_reclaim_would_deadlock)
2115 		ret = 0;
2116 	if (!ret)
2117 		ret = bch2_trans_relock(trans);
2118 	return ret;
2134 	int ret;
2141 	ret = PTR_ERR_OR_ZERO(as);
2142 	if (ret)
2162 		ret = bch2_btree_insert_node(as, trans, iter->path, parent, &as->parent_keys);
2164 		ret = bch2_btree_set_root(as, trans, btree_iter_path(trans, iter), n, false);
2167 	if (ret)
2183 	return ret;
2206 	int ret;
2211 	ret = PTR_ERR_OR_ZERO(b);
2212 	if (ret)
2228 	ret = bch2_btree_node_rewrite(trans, &iter, b, 0);
2232 	return ret;
2240 	int ret;
2242 	ret = bch2_trans_do(c, NULL, NULL, 0,
2244 	bch_err_fn_ratelimited(c, ret);
2252 	int ret;
2281 		ret = bch2_fs_read_write_early(c);
2282 		bch_err_msg(c, ret, "going read-write");
2283 		if (ret) {
2331 	int ret;
2334 		ret   = bch2_key_trigger_old(trans, b->c.btree_id, b->c.level + 1,
2340 		if (ret)
2341 			return ret;
2346 		ret = bch2_btree_node_hash_insert(&c->btree_cache,
2348 		BUG_ON(ret);
2367 		ret   = bch2_btree_iter_traverse(&iter2) ?:
2369 		if (ret)
2376 		ret = PTR_ERR_OR_ZERO(e);
2377 		if (ret)
2378 			return ret;
2386 	ret = bch2_trans_commit(trans, NULL, NULL, commit_flags);
2387 	if (ret)
2398 		ret = __bch2_btree_node_hash_insert(&c->btree_cache, b);
2399 		BUG_ON(ret);
2408 	return ret;
2426 	int ret = 0;
2428 	ret = bch2_btree_path_upgrade(trans, path, b->c.level + 1);
2429 	if (ret)
2430 		return ret;
2439 		ret = bch2_btree_cache_cannibalize_lock(trans, &cl);
2440 		if (ret) {
2441 			ret = drop_locks_do(trans, (closure_sync(&cl), 0));
2442 			if (ret)
2443 				return ret;
2450 	ret = __bch2_btree_node_update_key(trans, iter, b, new_hash, new_key,
2464 	return ret;
2472 	int ret;
2477 	ret = bch2_btree_iter_traverse(&iter);
2478 	if (ret)
2494 	ret = bch2_btree_node_update_key(trans, &iter, b, new_key,
2498 	return ret;
2519 	int ret;
2524 		ret = bch2_btree_cache_cannibalize_lock(trans, &cl);
2526 	} while (ret);
2549 	ret = bch2_btree_node_hash_insert(&c->btree_cache, b,
2551 	BUG_ON(ret);
2591 	bool ret;
2594 	ret = !list_empty(&c->btree_interior_update_list);
2597 	return ret;
2602 	bool ret = bch2_btree_interior_updates_pending(c);
2604 	if (ret)
2607 	return ret;