return ret;
}
-int bch2_extent_atomic_end(struct btree_trans *trans,
- struct btree_iter *iter,
+int bch2_extent_atomic_end(struct btree_iter *iter,
struct bkey_i *insert,
struct bpos *end)
{
+ struct btree_trans *trans = iter->trans;
struct btree *b = iter->l[0].b;
struct btree_node_iter node_iter = iter->l[0].iter;
struct bkey_packed *_k;
struct bpos end;
int ret;
- ret = bch2_extent_atomic_end(iter->trans, iter, k, &end);
+ ret = bch2_extent_atomic_end(iter, k, &end);
if (ret)
return ret;
struct bpos end;
int ret;
- ret = bch2_extent_atomic_end(iter->trans, iter, k, &end);
+ ret = bch2_extent_atomic_end(iter, k, &end);
if (ret)
return ret;
.key_merge = bch2_reservation_merge, \
}
-int bch2_extent_atomic_end(struct btree_trans *, struct btree_iter *,
- struct bkey_i *, struct bpos *);
+int bch2_extent_atomic_end(struct btree_iter *, struct bkey_i *,
+ struct bpos *);
int bch2_extent_trim_atomic(struct bkey_i *, struct btree_iter *);
int bch2_extent_is_atomic(struct bkey_i *, struct btree_iter *);
if (ret)
goto err;
- ret = bch2_extent_atomic_end(&trans, split_iter,
- k, &atomic_end);
+ ret = bch2_extent_atomic_end(split_iter, k, &atomic_end);
if (ret)
goto err;