1 // SPDX-License-Identifier: GPL-2.0
4 #include "btree_update.h"
11 #include "subvolume.h"
14 #include <linux/sched/signal.h>
16 static inline unsigned bkey_type_to_indirect(const struct bkey *k)
20 return KEY_TYPE_reflink_v;
21 case KEY_TYPE_inline_data:
22 return KEY_TYPE_indirect_inline_data;
28 /* reflink pointers */
30 int bch2_reflink_p_invalid(const struct bch_fs *c, struct bkey_s_c k,
31 enum bkey_invalid_flags flags,
34 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
36 if (c->sb.version >= bcachefs_metadata_version_reflink_p_fix &&
37 le64_to_cpu(p.v->idx) < le32_to_cpu(p.v->front_pad)) {
38 prt_printf(err, "idx < front_pad (%llu < %u)",
39 le64_to_cpu(p.v->idx), le32_to_cpu(p.v->front_pad));
46 void bch2_reflink_p_to_text(struct printbuf *out, struct bch_fs *c,
49 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
51 prt_printf(out, "idx %llu front_pad %u back_pad %u",
52 le64_to_cpu(p.v->idx),
53 le32_to_cpu(p.v->front_pad),
54 le32_to_cpu(p.v->back_pad));
57 bool bch2_reflink_p_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
59 struct bkey_s_reflink_p l = bkey_s_to_reflink_p(_l);
60 struct bkey_s_c_reflink_p r = bkey_s_c_to_reflink_p(_r);
63 * Disabled for now, the triggers code needs to be reworked for merging
64 * of reflink pointers to work:
68 if (le64_to_cpu(l.v->idx) + l.k->size != le64_to_cpu(r.v->idx))
71 bch2_key_resize(l.k, l.k->size + r.k->size);
75 /* indirect extents */
77 int bch2_reflink_v_invalid(const struct bch_fs *c, struct bkey_s_c k,
78 enum bkey_invalid_flags flags,
81 return bch2_bkey_ptrs_invalid(c, k, flags, err);
84 void bch2_reflink_v_to_text(struct printbuf *out, struct bch_fs *c,
87 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k);
89 prt_printf(out, "refcount: %llu ", le64_to_cpu(r.v->refcount));
91 bch2_bkey_ptrs_to_text(out, c, k);
95 Currently disabled, needs to be debugged:
97 bool bch2_reflink_v_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
99 struct bkey_s_reflink_v l = bkey_s_to_reflink_v(_l);
100 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(_r);
102 return l.v->refcount == r.v->refcount && bch2_extent_merge(c, _l, _r);
106 int bch2_trans_mark_reflink_v(struct btree_trans *trans,
107 enum btree_id btree_id, unsigned level,
108 struct bkey_s_c old, struct bkey_i *new,
111 if (!(flags & BTREE_TRIGGER_OVERWRITE)) {
112 struct bkey_i_reflink_v *r = bkey_i_to_reflink_v(new);
114 if (!r->v.refcount) {
115 r->k.type = KEY_TYPE_deleted;
117 set_bkey_val_u64s(&r->k, 0);
122 return bch2_trans_mark_extent(trans, btree_id, level, old, new, flags);
125 /* indirect inline data */
127 int bch2_indirect_inline_data_invalid(const struct bch_fs *c, struct bkey_s_c k,
128 enum bkey_invalid_flags flags,
129 struct printbuf *err)
134 void bch2_indirect_inline_data_to_text(struct printbuf *out,
135 struct bch_fs *c, struct bkey_s_c k)
137 struct bkey_s_c_indirect_inline_data d = bkey_s_c_to_indirect_inline_data(k);
138 unsigned datalen = bkey_inline_data_bytes(k.k);
140 prt_printf(out, "refcount %llu datalen %u: %*phN",
141 le64_to_cpu(d.v->refcount), datalen,
142 min(datalen, 32U), d.v->data);
145 int bch2_trans_mark_indirect_inline_data(struct btree_trans *trans,
146 enum btree_id btree_id, unsigned level,
147 struct bkey_s_c old, struct bkey_i *new,
150 if (!(flags & BTREE_TRIGGER_OVERWRITE)) {
151 struct bkey_i_indirect_inline_data *r =
152 bkey_i_to_indirect_inline_data(new);
154 if (!r->v.refcount) {
155 r->k.type = KEY_TYPE_deleted;
157 set_bkey_val_u64s(&r->k, 0);
164 static int bch2_make_extent_indirect(struct btree_trans *trans,
165 struct btree_iter *extent_iter,
168 struct bch_fs *c = trans->c;
169 struct btree_iter reflink_iter = { NULL };
172 struct bkey_i_reflink_p *r_p;
176 if (orig->k.type == KEY_TYPE_inline_data)
177 bch2_check_set_feature(c, BCH_FEATURE_reflink_inline_data);
179 bch2_trans_iter_init(trans, &reflink_iter, BTREE_ID_reflink, POS_MAX,
181 k = bch2_btree_iter_peek_prev(&reflink_iter);
186 r_v = bch2_trans_kmalloc(trans, sizeof(__le64) + bkey_bytes(&orig->k));
187 ret = PTR_ERR_OR_ZERO(r_v);
192 r_v->k.type = bkey_type_to_indirect(&orig->k);
193 r_v->k.p = reflink_iter.pos;
194 bch2_key_resize(&r_v->k, orig->k.size);
195 r_v->k.version = orig->k.version;
197 set_bkey_val_bytes(&r_v->k, sizeof(__le64) + bkey_val_bytes(&orig->k));
199 refcount = bkey_refcount(r_v);
201 memcpy(refcount + 1, &orig->v, bkey_val_bytes(&orig->k));
203 ret = bch2_trans_update(trans, &reflink_iter, r_v, 0);
208 * orig is in a bkey_buf which statically allocates 5 64s for the val,
209 * so we know it will be big enough:
211 orig->k.type = KEY_TYPE_reflink_p;
212 r_p = bkey_i_to_reflink_p(orig);
213 set_bkey_val_bytes(&r_p->k, sizeof(r_p->v));
215 /* FORTIFY_SOURCE is broken here, and doesn't provide unsafe_memset() */
216 #if !defined(__NO_FORTIFY) && defined(__OPTIMIZE__) && defined(CONFIG_FORTIFY_SOURCE)
217 __underlying_memset(&r_p->v, 0, sizeof(r_p->v));
219 memset(&r_p->v, 0, sizeof(r_p->v));
222 r_p->v.idx = cpu_to_le64(bkey_start_offset(&r_v->k));
224 ret = bch2_trans_update(trans, extent_iter, &r_p->k_i,
225 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
227 bch2_trans_iter_exit(trans, &reflink_iter);
232 static struct bkey_s_c get_next_src(struct btree_iter *iter, struct bpos end)
237 for_each_btree_key_upto_continue_norestart(*iter, end, 0, k, ret) {
238 if (bkey_extent_is_unwritten(k))
241 if (bkey_extent_is_data(k.k))
245 if (bkey_ge(iter->pos, end))
246 bch2_btree_iter_set_pos(iter, end);
247 return ret ? bkey_s_c_err(ret) : bkey_s_c_null;
250 s64 bch2_remap_range(struct bch_fs *c,
251 subvol_inum dst_inum, u64 dst_offset,
252 subvol_inum src_inum, u64 src_offset,
254 u64 new_i_size, s64 *i_sectors_delta)
256 struct btree_trans *trans;
257 struct btree_iter dst_iter, src_iter;
258 struct bkey_s_c src_k;
259 struct bkey_buf new_dst, new_src;
260 struct bpos dst_start = POS(dst_inum.inum, dst_offset);
261 struct bpos src_start = POS(src_inum.inum, src_offset);
262 struct bpos dst_end = dst_start, src_end = src_start;
263 struct bpos src_want;
265 u32 dst_snapshot, src_snapshot;
266 int ret = 0, ret2 = 0;
268 if (!bch2_write_ref_tryget(c, BCH_WRITE_REF_reflink))
269 return -BCH_ERR_erofs_no_writes;
271 bch2_check_set_feature(c, BCH_FEATURE_reflink);
273 dst_end.offset += remap_sectors;
274 src_end.offset += remap_sectors;
276 bch2_bkey_buf_init(&new_dst);
277 bch2_bkey_buf_init(&new_src);
278 trans = bch2_trans_get(c);
280 bch2_trans_iter_init(trans, &src_iter, BTREE_ID_extents, src_start,
282 bch2_trans_iter_init(trans, &dst_iter, BTREE_ID_extents, dst_start,
286 bch2_err_matches(ret, BCH_ERR_transaction_restart)) &&
287 bkey_lt(dst_iter.pos, dst_end)) {
288 struct disk_reservation disk_res = { 0 };
290 bch2_trans_begin(trans);
292 if (fatal_signal_pending(current)) {
297 ret = bch2_subvolume_get_snapshot(trans, src_inum.subvol,
302 bch2_btree_iter_set_snapshot(&src_iter, src_snapshot);
304 ret = bch2_subvolume_get_snapshot(trans, dst_inum.subvol,
309 bch2_btree_iter_set_snapshot(&dst_iter, dst_snapshot);
311 dst_done = dst_iter.pos.offset - dst_start.offset;
312 src_want = POS(src_start.inode, src_start.offset + dst_done);
313 bch2_btree_iter_set_pos(&src_iter, src_want);
315 src_k = get_next_src(&src_iter, src_end);
316 ret = bkey_err(src_k);
320 if (bkey_lt(src_want, src_iter.pos)) {
321 ret = bch2_fpunch_at(trans, &dst_iter, dst_inum,
323 dst_iter.pos.offset +
324 src_iter.pos.offset - src_want.offset),
329 if (src_k.k->type != KEY_TYPE_reflink_p) {
330 bch2_btree_iter_set_pos_to_extent_start(&src_iter);
332 bch2_bkey_buf_reassemble(&new_src, c, src_k);
333 src_k = bkey_i_to_s_c(new_src.k);
335 ret = bch2_make_extent_indirect(trans, &src_iter,
340 BUG_ON(src_k.k->type != KEY_TYPE_reflink_p);
343 if (src_k.k->type == KEY_TYPE_reflink_p) {
344 struct bkey_s_c_reflink_p src_p =
345 bkey_s_c_to_reflink_p(src_k);
346 struct bkey_i_reflink_p *dst_p =
347 bkey_reflink_p_init(new_dst.k);
349 u64 offset = le64_to_cpu(src_p.v->idx) +
351 bkey_start_offset(src_k.k));
353 dst_p->v.idx = cpu_to_le64(offset);
358 new_dst.k->k.p = dst_iter.pos;
359 bch2_key_resize(&new_dst.k->k,
360 min(src_k.k->p.offset - src_want.offset,
361 dst_end.offset - dst_iter.pos.offset));
363 ret = bch2_extent_update(trans, dst_inum, &dst_iter,
364 new_dst.k, &disk_res,
365 new_i_size, i_sectors_delta,
367 bch2_disk_reservation_put(c, &disk_res);
369 bch2_trans_iter_exit(trans, &dst_iter);
370 bch2_trans_iter_exit(trans, &src_iter);
372 BUG_ON(!ret && !bkey_eq(dst_iter.pos, dst_end));
373 BUG_ON(bkey_gt(dst_iter.pos, dst_end));
375 dst_done = dst_iter.pos.offset - dst_start.offset;
376 new_i_size = min(dst_iter.pos.offset << 9, new_i_size);
379 struct bch_inode_unpacked inode_u;
380 struct btree_iter inode_iter = { NULL };
382 bch2_trans_begin(trans);
384 ret2 = bch2_inode_peek(trans, &inode_iter, &inode_u,
385 dst_inum, BTREE_ITER_INTENT);
388 inode_u.bi_size < new_i_size) {
389 inode_u.bi_size = new_i_size;
390 ret2 = bch2_inode_write(trans, &inode_iter, &inode_u) ?:
391 bch2_trans_commit(trans, NULL, NULL,
392 BTREE_INSERT_NOFAIL);
395 bch2_trans_iter_exit(trans, &inode_iter);
396 } while (bch2_err_matches(ret2, BCH_ERR_transaction_restart));
398 bch2_trans_put(trans);
399 bch2_bkey_buf_exit(&new_src, c);
400 bch2_bkey_buf_exit(&new_dst, c);
402 bch2_write_ref_put(c, BCH_WRITE_REF_reflink);
404 return dst_done ?: ret ?: ret2;