1 // SPDX-License-Identifier: GPL-2.0
4 #include "btree_update.h"
10 #include "subvolume.h"
12 #include <linux/sched/signal.h>
14 static inline unsigned bkey_type_to_indirect(const struct bkey *k)
18 return KEY_TYPE_reflink_v;
19 case KEY_TYPE_inline_data:
20 return KEY_TYPE_indirect_inline_data;
26 /* reflink pointers */
28 int bch2_reflink_p_invalid(const struct bch_fs *c, struct bkey_s_c k,
29 enum bkey_invalid_flags flags,
32 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
34 if (c->sb.version >= bcachefs_metadata_version_reflink_p_fix &&
35 le64_to_cpu(p.v->idx) < le32_to_cpu(p.v->front_pad)) {
36 prt_printf(err, "idx < front_pad (%llu < %u)",
37 le64_to_cpu(p.v->idx), le32_to_cpu(p.v->front_pad));
44 void bch2_reflink_p_to_text(struct printbuf *out, struct bch_fs *c,
47 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
49 prt_printf(out, "idx %llu front_pad %u back_pad %u",
50 le64_to_cpu(p.v->idx),
51 le32_to_cpu(p.v->front_pad),
52 le32_to_cpu(p.v->back_pad));
55 bool bch2_reflink_p_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
57 struct bkey_s_reflink_p l = bkey_s_to_reflink_p(_l);
58 struct bkey_s_c_reflink_p r = bkey_s_c_to_reflink_p(_r);
61 * Disabled for now, the triggers code needs to be reworked for merging
62 * of reflink pointers to work:
66 if (le64_to_cpu(l.v->idx) + l.k->size != le64_to_cpu(r.v->idx))
69 bch2_key_resize(l.k, l.k->size + r.k->size);
73 /* indirect extents */
75 int bch2_reflink_v_invalid(const struct bch_fs *c, struct bkey_s_c k,
76 enum bkey_invalid_flags flags,
79 return bch2_bkey_ptrs_invalid(c, k, flags, err);
82 void bch2_reflink_v_to_text(struct printbuf *out, struct bch_fs *c,
85 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k);
87 prt_printf(out, "refcount: %llu ", le64_to_cpu(r.v->refcount));
89 bch2_bkey_ptrs_to_text(out, c, k);
92 bool bch2_reflink_v_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
94 struct bkey_s_reflink_v l = bkey_s_to_reflink_v(_l);
95 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(_r);
97 return l.v->refcount == r.v->refcount && bch2_extent_merge(c, _l, _r);
100 int bch2_trans_mark_reflink_v(struct btree_trans *trans,
101 enum btree_id btree_id, unsigned level,
102 struct bkey_s_c old, struct bkey_i *new,
105 if (!(flags & BTREE_TRIGGER_OVERWRITE)) {
106 struct bkey_i_reflink_v *r = bkey_i_to_reflink_v(new);
108 if (!r->v.refcount) {
109 r->k.type = KEY_TYPE_deleted;
111 set_bkey_val_u64s(&r->k, 0);
116 return bch2_trans_mark_extent(trans, btree_id, level, old, new, flags);
119 /* indirect inline data */
121 int bch2_indirect_inline_data_invalid(const struct bch_fs *c, struct bkey_s_c k,
122 enum bkey_invalid_flags flags,
123 struct printbuf *err)
128 void bch2_indirect_inline_data_to_text(struct printbuf *out,
129 struct bch_fs *c, struct bkey_s_c k)
131 struct bkey_s_c_indirect_inline_data d = bkey_s_c_to_indirect_inline_data(k);
132 unsigned datalen = bkey_inline_data_bytes(k.k);
134 prt_printf(out, "refcount %llu datalen %u: %*phN",
135 le64_to_cpu(d.v->refcount), datalen,
136 min(datalen, 32U), d.v->data);
139 int bch2_trans_mark_indirect_inline_data(struct btree_trans *trans,
140 enum btree_id btree_id, unsigned level,
141 struct bkey_s_c old, struct bkey_i *new,
144 if (!(flags & BTREE_TRIGGER_OVERWRITE)) {
145 struct bkey_i_indirect_inline_data *r =
146 bkey_i_to_indirect_inline_data(new);
148 if (!r->v.refcount) {
149 r->k.type = KEY_TYPE_deleted;
151 set_bkey_val_u64s(&r->k, 0);
158 static int bch2_make_extent_indirect(struct btree_trans *trans,
159 struct btree_iter *extent_iter,
162 struct bch_fs *c = trans->c;
163 struct btree_iter reflink_iter = { NULL };
166 struct bkey_i_reflink_p *r_p;
170 if (orig->k.type == KEY_TYPE_inline_data)
171 bch2_check_set_feature(c, BCH_FEATURE_reflink_inline_data);
173 bch2_trans_iter_init(trans, &reflink_iter, BTREE_ID_reflink, POS_MAX,
175 k = bch2_btree_iter_peek_prev(&reflink_iter);
180 r_v = bch2_trans_kmalloc(trans, sizeof(__le64) + bkey_bytes(&orig->k));
181 ret = PTR_ERR_OR_ZERO(r_v);
186 r_v->k.type = bkey_type_to_indirect(&orig->k);
187 r_v->k.p = reflink_iter.pos;
188 bch2_key_resize(&r_v->k, orig->k.size);
189 r_v->k.version = orig->k.version;
191 set_bkey_val_bytes(&r_v->k, sizeof(__le64) + bkey_val_bytes(&orig->k));
193 refcount = bkey_refcount(r_v);
195 memcpy(refcount + 1, &orig->v, bkey_val_bytes(&orig->k));
197 ret = bch2_trans_update(trans, &reflink_iter, r_v, 0);
202 * orig is in a bkey_buf which statically allocates 5 64s for the val,
203 * so we know it will be big enough:
205 orig->k.type = KEY_TYPE_reflink_p;
206 r_p = bkey_i_to_reflink_p(orig);
207 set_bkey_val_bytes(&r_p->k, sizeof(r_p->v));
209 /* FORTIFY_SOURCE is broken here, and doesn't provide unsafe_memset() */
210 #if !defined(__NO_FORTIFY) && defined(__OPTIMIZE__) && defined(CONFIG_FORTIFY_SOURCE)
211 __underlying_memset(&r_p->v, 0, sizeof(r_p->v));
213 memset(&r_p->v, 0, sizeof(r_p->v));
216 r_p->v.idx = cpu_to_le64(bkey_start_offset(&r_v->k));
218 ret = bch2_trans_update(trans, extent_iter, &r_p->k_i,
219 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
221 bch2_trans_iter_exit(trans, &reflink_iter);
226 static struct bkey_s_c get_next_src(struct btree_iter *iter, struct bpos end)
231 for_each_btree_key_upto_continue_norestart(*iter, end, 0, k, ret) {
232 if (bkey_extent_is_unwritten(k))
235 if (bkey_extent_is_data(k.k))
239 if (bkey_ge(iter->pos, end))
240 bch2_btree_iter_set_pos(iter, end);
241 return ret ? bkey_s_c_err(ret) : bkey_s_c_null;
244 s64 bch2_remap_range(struct bch_fs *c,
245 subvol_inum dst_inum, u64 dst_offset,
246 subvol_inum src_inum, u64 src_offset,
248 u64 new_i_size, s64 *i_sectors_delta)
250 struct btree_trans trans;
251 struct btree_iter dst_iter, src_iter;
252 struct bkey_s_c src_k;
253 struct bkey_buf new_dst, new_src;
254 struct bpos dst_start = POS(dst_inum.inum, dst_offset);
255 struct bpos src_start = POS(src_inum.inum, src_offset);
256 struct bpos dst_end = dst_start, src_end = src_start;
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 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 4096);
274 bch2_trans_iter_init(&trans, &src_iter, BTREE_ID_extents, src_start,
276 bch2_trans_iter_init(&trans, &dst_iter, BTREE_ID_extents, dst_start,
280 bch2_err_matches(ret, BCH_ERR_transaction_restart)) &&
281 bkey_lt(dst_iter.pos, dst_end)) {
282 struct disk_reservation disk_res = { 0 };
284 bch2_trans_begin(&trans);
286 if (fatal_signal_pending(current)) {
291 ret = bch2_subvolume_get_snapshot(&trans, src_inum.subvol,
296 bch2_btree_iter_set_snapshot(&src_iter, src_snapshot);
298 ret = bch2_subvolume_get_snapshot(&trans, dst_inum.subvol,
303 bch2_btree_iter_set_snapshot(&dst_iter, dst_snapshot);
305 dst_done = dst_iter.pos.offset - dst_start.offset;
306 src_want = POS(src_start.inode, src_start.offset + dst_done);
307 bch2_btree_iter_set_pos(&src_iter, src_want);
309 src_k = get_next_src(&src_iter, src_end);
310 ret = bkey_err(src_k);
314 if (bkey_lt(src_want, src_iter.pos)) {
315 ret = bch2_fpunch_at(&trans, &dst_iter, dst_inum,
317 dst_iter.pos.offset +
318 src_iter.pos.offset - src_want.offset),
323 if (src_k.k->type != KEY_TYPE_reflink_p) {
324 bch2_btree_iter_set_pos_to_extent_start(&src_iter);
326 bch2_bkey_buf_reassemble(&new_src, c, src_k);
327 src_k = bkey_i_to_s_c(new_src.k);
329 ret = bch2_make_extent_indirect(&trans, &src_iter,
334 BUG_ON(src_k.k->type != KEY_TYPE_reflink_p);
337 if (src_k.k->type == KEY_TYPE_reflink_p) {
338 struct bkey_s_c_reflink_p src_p =
339 bkey_s_c_to_reflink_p(src_k);
340 struct bkey_i_reflink_p *dst_p =
341 bkey_reflink_p_init(new_dst.k);
343 u64 offset = le64_to_cpu(src_p.v->idx) +
345 bkey_start_offset(src_k.k));
347 dst_p->v.idx = cpu_to_le64(offset);
352 new_dst.k->k.p = dst_iter.pos;
353 bch2_key_resize(&new_dst.k->k,
354 min(src_k.k->p.offset - src_want.offset,
355 dst_end.offset - dst_iter.pos.offset));
357 ret = bch2_extent_update(&trans, dst_inum, &dst_iter,
358 new_dst.k, &disk_res,
359 new_i_size, i_sectors_delta,
361 bch2_disk_reservation_put(c, &disk_res);
363 bch2_trans_iter_exit(&trans, &dst_iter);
364 bch2_trans_iter_exit(&trans, &src_iter);
366 BUG_ON(!ret && !bkey_eq(dst_iter.pos, dst_end));
367 BUG_ON(bkey_gt(dst_iter.pos, dst_end));
369 dst_done = dst_iter.pos.offset - dst_start.offset;
370 new_i_size = min(dst_iter.pos.offset << 9, new_i_size);
373 struct bch_inode_unpacked inode_u;
374 struct btree_iter inode_iter = { NULL };
376 bch2_trans_begin(&trans);
378 ret2 = bch2_inode_peek(&trans, &inode_iter, &inode_u,
379 dst_inum, BTREE_ITER_INTENT);
382 inode_u.bi_size < new_i_size) {
383 inode_u.bi_size = new_i_size;
384 ret2 = bch2_inode_write(&trans, &inode_iter, &inode_u) ?:
385 bch2_trans_commit(&trans, NULL, NULL,
386 BTREE_INSERT_NOFAIL);
389 bch2_trans_iter_exit(&trans, &inode_iter);
390 } while (bch2_err_matches(ret2, BCH_ERR_transaction_restart));
392 bch2_trans_exit(&trans);
393 bch2_bkey_buf_exit(&new_src, c);
394 bch2_bkey_buf_exit(&new_dst, c);
396 bch2_write_ref_put(c, BCH_WRITE_REF_reflink);
398 return dst_done ?: ret ?: ret2;