1 // SPDX-License-Identifier: GPL-2.0
4 #include "btree_update.h"
10 #include "rebalance.h"
12 #include "subvolume.h"
15 #include <linux/sched/signal.h>
17 static inline unsigned bkey_type_to_indirect(const struct bkey *k)
21 return KEY_TYPE_reflink_v;
22 case KEY_TYPE_inline_data:
23 return KEY_TYPE_indirect_inline_data;
29 /* reflink pointers */
31 int bch2_reflink_p_invalid(struct bch_fs *c, struct bkey_s_c k,
32 enum bkey_invalid_flags flags,
35 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
37 if (c->sb.version >= bcachefs_metadata_version_reflink_p_fix &&
38 le64_to_cpu(p.v->idx) < le32_to_cpu(p.v->front_pad)) {
39 prt_printf(err, "idx < front_pad (%llu < %u)",
40 le64_to_cpu(p.v->idx), le32_to_cpu(p.v->front_pad));
47 void bch2_reflink_p_to_text(struct printbuf *out, struct bch_fs *c,
50 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
52 prt_printf(out, "idx %llu front_pad %u back_pad %u",
53 le64_to_cpu(p.v->idx),
54 le32_to_cpu(p.v->front_pad),
55 le32_to_cpu(p.v->back_pad));
58 bool bch2_reflink_p_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
60 struct bkey_s_reflink_p l = bkey_s_to_reflink_p(_l);
61 struct bkey_s_c_reflink_p r = bkey_s_c_to_reflink_p(_r);
64 * Disabled for now, the triggers code needs to be reworked for merging
65 * of reflink pointers to work:
69 if (le64_to_cpu(l.v->idx) + l.k->size != le64_to_cpu(r.v->idx))
72 bch2_key_resize(l.k, l.k->size + r.k->size);
76 /* indirect extents */
78 int bch2_reflink_v_invalid(struct bch_fs *c, struct bkey_s_c k,
79 enum bkey_invalid_flags flags,
82 return bch2_bkey_ptrs_invalid(c, k, flags, err);
85 void bch2_reflink_v_to_text(struct printbuf *out, struct bch_fs *c,
88 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k);
90 prt_printf(out, "refcount: %llu ", le64_to_cpu(r.v->refcount));
92 bch2_bkey_ptrs_to_text(out, c, k);
96 Currently disabled, needs to be debugged:
98 bool bch2_reflink_v_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
100 struct bkey_s_reflink_v l = bkey_s_to_reflink_v(_l);
101 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(_r);
103 return l.v->refcount == r.v->refcount && bch2_extent_merge(c, _l, _r);
107 static inline void check_indirect_extent_deleting(struct bkey_i *new, unsigned *flags)
109 if ((*flags & BTREE_TRIGGER_INSERT) && !*bkey_refcount(new)) {
110 new->k.type = KEY_TYPE_deleted;
112 set_bkey_val_u64s(&new->k, 0);;
113 *flags &= ~BTREE_TRIGGER_INSERT;
117 int bch2_trans_mark_reflink_v(struct btree_trans *trans,
118 enum btree_id btree_id, unsigned level,
119 struct bkey_s_c old, struct bkey_i *new,
122 check_indirect_extent_deleting(new, &flags);
124 return bch2_trans_mark_extent(trans, btree_id, level, old, new, flags);
127 /* indirect inline data */
129 int bch2_indirect_inline_data_invalid(struct bch_fs *c, struct bkey_s_c k,
130 enum bkey_invalid_flags flags,
131 struct printbuf *err)
136 void bch2_indirect_inline_data_to_text(struct printbuf *out,
137 struct bch_fs *c, struct bkey_s_c k)
139 struct bkey_s_c_indirect_inline_data d = bkey_s_c_to_indirect_inline_data(k);
140 unsigned datalen = bkey_inline_data_bytes(k.k);
142 prt_printf(out, "refcount %llu datalen %u: %*phN",
143 le64_to_cpu(d.v->refcount), datalen,
144 min(datalen, 32U), d.v->data);
147 int bch2_trans_mark_indirect_inline_data(struct btree_trans *trans,
148 enum btree_id btree_id, unsigned level,
149 struct bkey_s_c old, struct bkey_i *new,
152 check_indirect_extent_deleting(new, &flags);
157 static int bch2_make_extent_indirect(struct btree_trans *trans,
158 struct btree_iter *extent_iter,
161 struct bch_fs *c = trans->c;
162 struct btree_iter reflink_iter = { NULL };
165 struct bkey_i_reflink_p *r_p;
169 if (orig->k.type == KEY_TYPE_inline_data)
170 bch2_check_set_feature(c, BCH_FEATURE_reflink_inline_data);
172 bch2_trans_iter_init(trans, &reflink_iter, BTREE_ID_reflink, POS_MAX,
174 k = bch2_btree_iter_peek_prev(&reflink_iter);
179 r_v = bch2_trans_kmalloc(trans, sizeof(__le64) + bkey_bytes(&orig->k));
180 ret = PTR_ERR_OR_ZERO(r_v);
185 r_v->k.type = bkey_type_to_indirect(&orig->k);
186 r_v->k.p = reflink_iter.pos;
187 bch2_key_resize(&r_v->k, orig->k.size);
188 r_v->k.version = orig->k.version;
190 set_bkey_val_bytes(&r_v->k, sizeof(__le64) + bkey_val_bytes(&orig->k));
192 refcount = bkey_refcount(r_v);
194 memcpy(refcount + 1, &orig->v, bkey_val_bytes(&orig->k));
196 ret = bch2_trans_update(trans, &reflink_iter, r_v, 0);
201 * orig is in a bkey_buf which statically allocates 5 64s for the val,
202 * so we know it will be big enough:
204 orig->k.type = KEY_TYPE_reflink_p;
205 r_p = bkey_i_to_reflink_p(orig);
206 set_bkey_val_bytes(&r_p->k, sizeof(r_p->v));
208 /* FORTIFY_SOURCE is broken here, and doesn't provide unsafe_memset() */
209 #if !defined(__NO_FORTIFY) && defined(__OPTIMIZE__) && defined(CONFIG_FORTIFY_SOURCE)
210 __underlying_memset(&r_p->v, 0, sizeof(r_p->v));
212 memset(&r_p->v, 0, sizeof(r_p->v));
215 r_p->v.idx = cpu_to_le64(bkey_start_offset(&r_v->k));
217 ret = bch2_trans_update(trans, extent_iter, &r_p->k_i,
218 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
220 bch2_trans_iter_exit(trans, &reflink_iter);
225 static struct bkey_s_c get_next_src(struct btree_iter *iter, struct bpos end)
230 for_each_btree_key_upto_continue_norestart(*iter, end, 0, k, ret) {
231 if (bkey_extent_is_unwritten(k))
234 if (bkey_extent_is_data(k.k))
238 if (bkey_ge(iter->pos, end))
239 bch2_btree_iter_set_pos(iter, end);
240 return ret ? bkey_s_c_err(ret) : bkey_s_c_null;
243 s64 bch2_remap_range(struct bch_fs *c,
244 subvol_inum dst_inum, u64 dst_offset,
245 subvol_inum src_inum, u64 src_offset,
247 u64 new_i_size, s64 *i_sectors_delta)
249 struct btree_trans *trans;
250 struct btree_iter dst_iter, src_iter;
251 struct bkey_s_c src_k;
252 struct bkey_buf new_dst, new_src;
253 struct bpos dst_start = POS(dst_inum.inum, dst_offset);
254 struct bpos src_start = POS(src_inum.inum, src_offset);
255 struct bpos dst_end = dst_start, src_end = src_start;
256 struct bch_io_opts opts;
257 struct bpos src_want;
259 u32 dst_snapshot, src_snapshot;
260 int ret = 0, ret2 = 0;
262 if (!bch2_write_ref_tryget(c, BCH_WRITE_REF_reflink))
263 return -BCH_ERR_erofs_no_writes;
265 bch2_check_set_feature(c, BCH_FEATURE_reflink);
267 dst_end.offset += remap_sectors;
268 src_end.offset += remap_sectors;
270 bch2_bkey_buf_init(&new_dst);
271 bch2_bkey_buf_init(&new_src);
272 trans = bch2_trans_get(c);
274 ret = bch2_inum_opts_get(trans, src_inum, &opts);
278 bch2_trans_iter_init(trans, &src_iter, BTREE_ID_extents, src_start,
280 bch2_trans_iter_init(trans, &dst_iter, BTREE_ID_extents, dst_start,
284 bch2_err_matches(ret, BCH_ERR_transaction_restart)) &&
285 bkey_lt(dst_iter.pos, dst_end)) {
286 struct disk_reservation disk_res = { 0 };
288 bch2_trans_begin(trans);
290 if (fatal_signal_pending(current)) {
295 ret = bch2_subvolume_get_snapshot(trans, src_inum.subvol,
300 bch2_btree_iter_set_snapshot(&src_iter, src_snapshot);
302 ret = bch2_subvolume_get_snapshot(trans, dst_inum.subvol,
307 bch2_btree_iter_set_snapshot(&dst_iter, dst_snapshot);
309 dst_done = dst_iter.pos.offset - dst_start.offset;
310 src_want = POS(src_start.inode, src_start.offset + dst_done);
311 bch2_btree_iter_set_pos(&src_iter, src_want);
313 src_k = get_next_src(&src_iter, src_end);
314 ret = bkey_err(src_k);
318 if (bkey_lt(src_want, src_iter.pos)) {
319 ret = bch2_fpunch_at(trans, &dst_iter, dst_inum,
321 dst_iter.pos.offset +
322 src_iter.pos.offset - src_want.offset),
327 if (src_k.k->type != KEY_TYPE_reflink_p) {
328 bch2_btree_iter_set_pos_to_extent_start(&src_iter);
330 bch2_bkey_buf_reassemble(&new_src, c, src_k);
331 src_k = bkey_i_to_s_c(new_src.k);
333 ret = bch2_make_extent_indirect(trans, &src_iter,
338 BUG_ON(src_k.k->type != KEY_TYPE_reflink_p);
341 if (src_k.k->type == KEY_TYPE_reflink_p) {
342 struct bkey_s_c_reflink_p src_p =
343 bkey_s_c_to_reflink_p(src_k);
344 struct bkey_i_reflink_p *dst_p =
345 bkey_reflink_p_init(new_dst.k);
347 u64 offset = le64_to_cpu(src_p.v->idx) +
349 bkey_start_offset(src_k.k));
351 dst_p->v.idx = cpu_to_le64(offset);
356 new_dst.k->k.p = dst_iter.pos;
357 bch2_key_resize(&new_dst.k->k,
358 min(src_k.k->p.offset - src_want.offset,
359 dst_end.offset - dst_iter.pos.offset));
361 ret = bch2_bkey_set_needs_rebalance(c, new_dst.k,
362 opts.background_target,
363 opts.background_compression) ?:
364 bch2_extent_update(trans, dst_inum, &dst_iter,
365 new_dst.k, &disk_res,
366 new_i_size, i_sectors_delta,
368 bch2_disk_reservation_put(c, &disk_res);
370 bch2_trans_iter_exit(trans, &dst_iter);
371 bch2_trans_iter_exit(trans, &src_iter);
373 BUG_ON(!ret && !bkey_eq(dst_iter.pos, dst_end));
374 BUG_ON(bkey_gt(dst_iter.pos, dst_end));
376 dst_done = dst_iter.pos.offset - dst_start.offset;
377 new_i_size = min(dst_iter.pos.offset << 9, new_i_size);
380 struct bch_inode_unpacked inode_u;
381 struct btree_iter inode_iter = { NULL };
383 bch2_trans_begin(trans);
385 ret2 = bch2_inode_peek(trans, &inode_iter, &inode_u,
386 dst_inum, BTREE_ITER_INTENT);
389 inode_u.bi_size < new_i_size) {
390 inode_u.bi_size = new_i_size;
391 ret2 = bch2_inode_write(trans, &inode_iter, &inode_u) ?:
392 bch2_trans_commit(trans, NULL, NULL,
393 BTREE_INSERT_NOFAIL);
396 bch2_trans_iter_exit(trans, &inode_iter);
397 } while (bch2_err_matches(ret2, BCH_ERR_transaction_restart));
399 bch2_trans_put(trans);
400 bch2_bkey_buf_exit(&new_src, c);
401 bch2_bkey_buf_exit(&new_dst, c);
403 bch2_write_ref_put(c, BCH_WRITE_REF_reflink);
405 return dst_done ?: ret ?: ret2;