1 // SPDX-License-Identifier: GPL-2.0
5 #include "alloc_foreground.h"
7 #include "btree_update.h"
12 #include "extent_update.h"
15 #include "fs-io-buffered.h"
16 #include "fs-io-pagecache.h"
26 #include <linux/aio.h>
27 #include <linux/backing-dev.h>
28 #include <linux/falloc.h>
29 #include <linux/migrate.h>
30 #include <linux/mmu_context.h>
31 #include <linux/pagevec.h>
32 #include <linux/rmap.h>
33 #include <linux/sched/signal.h>
34 #include <linux/task_io_accounting_ops.h>
35 #include <linux/uio.h>
37 #include <trace/events/writeback.h>
45 static void nocow_flush_endio(struct bio *_bio)
48 struct nocow_flush *bio = container_of(_bio, struct nocow_flush, bio);
51 percpu_ref_put(&bio->ca->io_ref);
55 void bch2_inode_flush_nocow_writes_async(struct bch_fs *c,
56 struct bch_inode_info *inode,
59 struct nocow_flush *bio;
61 struct bch_devs_mask devs;
64 dev = find_first_bit(inode->ei_devs_need_flush.d, BCH_SB_MEMBERS_MAX);
65 if (dev == BCH_SB_MEMBERS_MAX)
68 devs = inode->ei_devs_need_flush;
69 memset(&inode->ei_devs_need_flush, 0, sizeof(inode->ei_devs_need_flush));
71 for_each_set_bit(dev, devs.d, BCH_SB_MEMBERS_MAX) {
73 ca = rcu_dereference(c->devs[dev]);
74 if (ca && !percpu_ref_tryget(&ca->io_ref))
81 bio = container_of(bio_alloc_bioset(ca->disk_sb.bdev, 0,
84 &c->nocow_flush_bioset),
85 struct nocow_flush, bio);
88 bio->bio.bi_end_io = nocow_flush_endio;
89 closure_bio_submit(&bio->bio, cl);
93 static int bch2_inode_flush_nocow_writes(struct bch_fs *c,
94 struct bch_inode_info *inode)
98 closure_init_stack(&cl);
99 bch2_inode_flush_nocow_writes_async(c, inode, &cl);
105 /* i_size updates: */
107 struct inode_new_size {
113 static int inode_set_size(struct btree_trans *trans,
114 struct bch_inode_info *inode,
115 struct bch_inode_unpacked *bi,
118 struct inode_new_size *s = p;
120 bi->bi_size = s->new_size;
121 if (s->fields & ATTR_ATIME)
122 bi->bi_atime = s->now;
123 if (s->fields & ATTR_MTIME)
124 bi->bi_mtime = s->now;
125 if (s->fields & ATTR_CTIME)
126 bi->bi_ctime = s->now;
131 int __must_check bch2_write_inode_size(struct bch_fs *c,
132 struct bch_inode_info *inode,
133 loff_t new_size, unsigned fields)
135 struct inode_new_size s = {
136 .new_size = new_size,
137 .now = bch2_current_time(c),
141 return bch2_write_inode(c, inode, inode_set_size, &s, fields);
144 void __bch2_i_sectors_acct(struct bch_fs *c, struct bch_inode_info *inode,
145 struct quota_res *quota_res, s64 sectors)
147 bch2_fs_inconsistent_on((s64) inode->v.i_blocks + sectors < 0, c,
148 "inode %lu i_blocks underflow: %llu + %lli < 0 (ondisk %lli)",
149 inode->v.i_ino, (u64) inode->v.i_blocks, sectors,
150 inode->ei_inode.bi_sectors);
151 inode->v.i_blocks += sectors;
153 #ifdef CONFIG_BCACHEFS_QUOTA
155 !test_bit(EI_INODE_SNAPSHOT, &inode->ei_flags) &&
157 BUG_ON(sectors > quota_res->sectors);
158 BUG_ON(sectors > inode->ei_quota_reserved);
160 quota_res->sectors -= sectors;
161 inode->ei_quota_reserved -= sectors;
163 bch2_quota_acct(c, inode->ei_qid, Q_SPC, sectors, KEY_TYPE_QUOTA_WARN);
171 * inode->ei_inode.bi_journal_seq won't be up to date since it's set in an
172 * insert trigger: look up the btree inode instead
174 static int bch2_flush_inode(struct bch_fs *c,
175 struct bch_inode_info *inode)
177 struct bch_inode_unpacked u;
180 if (c->opts.journal_flush_disabled)
183 ret = bch2_inode_find_by_inum(c, inode_inum(inode), &u);
187 return bch2_journal_flush_seq(&c->journal, u.bi_journal_seq) ?:
188 bch2_inode_flush_nocow_writes(c, inode);
191 int bch2_fsync(struct file *file, loff_t start, loff_t end, int datasync)
193 struct bch_inode_info *inode = file_bch_inode(file);
194 struct bch_fs *c = inode->v.i_sb->s_fs_info;
198 * check if unlinked, disable/defer until relink
202 * also: add a mode where a file is a tmpfile until fully,
203 * asynchronously written
207 ret = file_write_and_wait_range(file, start, end);
210 ret = sync_inode_metadata(&inode->v, 1);
213 ret = bch2_flush_inode(c, inode);
215 return bch2_err_class(ret);
220 static inline int range_has_data(struct bch_fs *c, u32 subvol,
224 struct btree_trans *trans = bch2_trans_get(c);
225 struct btree_iter iter;
229 bch2_trans_begin(trans);
231 ret = bch2_subvolume_get_snapshot(trans, subvol, &start.snapshot);
235 for_each_btree_key_upto_norestart(trans, iter, BTREE_ID_extents, start, end, 0, k, ret)
236 if (bkey_extent_is_data(k.k) && !bkey_extent_is_unwritten(k)) {
241 bch2_trans_iter_exit(trans, &iter);
243 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
246 bch2_trans_put(trans);
250 static int __bch2_truncate_folio(struct bch_inode_info *inode,
251 pgoff_t index, loff_t start, loff_t end)
253 struct bch_fs *c = inode->v.i_sb->s_fs_info;
254 struct address_space *mapping = inode->v.i_mapping;
256 unsigned start_offset;
260 s64 i_sectors_delta = 0;
264 folio = filemap_lock_folio(mapping, index);
265 if (IS_ERR_OR_NULL(folio)) {
267 * XXX: we're doing two index lookups when we end up reading the
270 ret = range_has_data(c, inode->ei_subvol,
271 POS(inode->v.i_ino, (index << PAGE_SECTORS_SHIFT)),
272 POS(inode->v.i_ino, (index << PAGE_SECTORS_SHIFT) + PAGE_SECTORS));
276 folio = __filemap_get_folio(mapping, index,
277 FGP_LOCK|FGP_CREAT, GFP_KERNEL);
278 if (IS_ERR_OR_NULL(folio)) {
284 BUG_ON(start >= folio_end_pos(folio));
285 BUG_ON(end <= folio_pos(folio));
287 start_offset = max(start, folio_pos(folio)) - folio_pos(folio);
288 end_offset = min_t(u64, end, folio_end_pos(folio)) - folio_pos(folio);
290 /* Folio boundary? Nothing to do */
291 if (start_offset == 0 &&
292 end_offset == folio_size(folio)) {
297 s = bch2_folio_create(folio, 0);
303 if (!folio_test_uptodate(folio)) {
304 ret = bch2_read_single_folio(folio, mapping);
309 ret = bch2_folio_set(c, inode_inum(inode), &folio, 1);
313 for (i = round_up(start_offset, block_bytes(c)) >> 9;
314 i < round_down(end_offset, block_bytes(c)) >> 9;
316 s->s[i].nr_replicas = 0;
318 i_sectors_delta -= s->s[i].state == SECTOR_dirty;
319 bch2_folio_sector_set(folio, s, i, SECTOR_unallocated);
322 bch2_i_sectors_acct(c, inode, NULL, i_sectors_delta);
325 * Caller needs to know whether this folio will be written out by
326 * writeback - doing an i_size update if necessary - or whether it will
327 * be responsible for the i_size update.
329 * Note that we shouldn't ever see a folio beyond EOF, but check and
330 * warn if so. This has been observed by failure to clean up folios
331 * after a short write and there's still a chance reclaim will fix
334 WARN_ON_ONCE(folio_pos(folio) >= inode->v.i_size);
335 end_pos = folio_end_pos(folio);
336 if (inode->v.i_size > folio_pos(folio))
337 end_pos = min_t(u64, inode->v.i_size, end_pos);
338 ret = s->s[folio_pos_to_s(folio, end_pos - 1)].state >= SECTOR_dirty;
340 folio_zero_segment(folio, start_offset, end_offset);
343 * Bit of a hack - we don't want truncate to fail due to -ENOSPC.
345 * XXX: because we aren't currently tracking whether the folio has actual
346 * data in it (vs. just 0s, or only partially written) this wrong. ick.
348 BUG_ON(bch2_get_folio_disk_reservation(c, inode, folio, false));
351 * This removes any writeable userspace mappings; we need to force
352 * .page_mkwrite to be called again before any mmapped writes, to
353 * redirty the full page:
355 folio_mkclean(folio);
356 filemap_dirty_folio(mapping, folio);
364 static int bch2_truncate_folio(struct bch_inode_info *inode, loff_t from)
366 return __bch2_truncate_folio(inode, from >> PAGE_SHIFT,
367 from, ANYSINT_MAX(loff_t));
370 static int bch2_truncate_folios(struct bch_inode_info *inode,
371 loff_t start, loff_t end)
373 int ret = __bch2_truncate_folio(inode, start >> PAGE_SHIFT,
377 start >> PAGE_SHIFT != end >> PAGE_SHIFT)
378 ret = __bch2_truncate_folio(inode,
379 (end - 1) >> PAGE_SHIFT,
384 static int bch2_extend(struct mnt_idmap *idmap,
385 struct bch_inode_info *inode,
386 struct bch_inode_unpacked *inode_u,
389 struct address_space *mapping = inode->v.i_mapping;
395 * this has to be done _before_ extending i_size:
397 ret = filemap_write_and_wait_range(mapping, inode_u->bi_size, S64_MAX);
401 truncate_setsize(&inode->v, iattr->ia_size);
403 return bch2_setattr_nonsize(idmap, inode, iattr);
406 int bchfs_truncate(struct mnt_idmap *idmap,
407 struct bch_inode_info *inode, struct iattr *iattr)
409 struct bch_fs *c = inode->v.i_sb->s_fs_info;
410 struct address_space *mapping = inode->v.i_mapping;
411 struct bch_inode_unpacked inode_u;
412 s64 i_sectors_delta = 0;
416 * If the truncate call with change the size of the file, the
417 * cmtimes should be updated. If the size will not change, we
418 * do not need to update the cmtimes.
420 if (iattr->ia_size != inode->v.i_size) {
421 if (!(iattr->ia_valid & ATTR_MTIME))
422 ktime_get_coarse_real_ts64(&iattr->ia_mtime);
423 if (!(iattr->ia_valid & ATTR_CTIME))
424 ktime_get_coarse_real_ts64(&iattr->ia_ctime);
425 iattr->ia_valid |= ATTR_MTIME|ATTR_CTIME;
428 inode_dio_wait(&inode->v);
429 bch2_pagecache_block_get(inode);
431 ret = bch2_inode_find_by_inum(c, inode_inum(inode), &inode_u);
436 * check this before next assertion; on filesystem error our normal
437 * invariants are a bit broken (truncate has to truncate the page cache
440 ret = bch2_journal_error(&c->journal);
444 WARN_ONCE(!test_bit(EI_INODE_ERROR, &inode->ei_flags) &&
445 inode->v.i_size < inode_u.bi_size,
446 "truncate spotted in mem i_size < btree i_size: %llu < %llu\n",
447 (u64) inode->v.i_size, inode_u.bi_size);
449 if (iattr->ia_size > inode->v.i_size) {
450 ret = bch2_extend(idmap, inode, &inode_u, iattr);
454 iattr->ia_valid &= ~ATTR_SIZE;
456 ret = bch2_truncate_folio(inode, iattr->ia_size);
457 if (unlikely(ret < 0))
460 truncate_setsize(&inode->v, iattr->ia_size);
463 * When extending, we're going to write the new i_size to disk
464 * immediately so we need to flush anything above the current on disk
467 * Also, when extending we need to flush the page that i_size currently
468 * straddles - if it's mapped to userspace, we need to ensure that
469 * userspace has to redirty it and call .mkwrite -> set_page_dirty
470 * again to allocate the part of the page that was extended.
472 if (iattr->ia_size > inode_u.bi_size)
473 ret = filemap_write_and_wait_range(mapping,
476 else if (iattr->ia_size & (PAGE_SIZE - 1))
477 ret = filemap_write_and_wait_range(mapping,
478 round_down(iattr->ia_size, PAGE_SIZE),
483 ret = bch2_truncate(c, inode_inum(inode), iattr->ia_size, &i_sectors_delta);
484 bch2_i_sectors_acct(c, inode, NULL, i_sectors_delta);
488 * If we error here, VFS caches are now inconsistent with btree
490 set_bit(EI_INODE_ERROR, &inode->ei_flags);
494 bch2_fs_inconsistent_on(!inode->v.i_size && inode->v.i_blocks &&
495 !bch2_journal_error(&c->journal), c,
496 "inode %lu truncated to 0 but i_blocks %llu (ondisk %lli)",
497 inode->v.i_ino, (u64) inode->v.i_blocks,
498 inode->ei_inode.bi_sectors);
500 ret = bch2_setattr_nonsize(idmap, inode, iattr);
502 bch2_pagecache_block_put(inode);
503 return bch2_err_class(ret);
508 static int inode_update_times_fn(struct btree_trans *trans,
509 struct bch_inode_info *inode,
510 struct bch_inode_unpacked *bi, void *p)
512 struct bch_fs *c = inode->v.i_sb->s_fs_info;
514 bi->bi_mtime = bi->bi_ctime = bch2_current_time(c);
518 static long bchfs_fpunch(struct bch_inode_info *inode, loff_t offset, loff_t len)
520 struct bch_fs *c = inode->v.i_sb->s_fs_info;
521 u64 end = offset + len;
522 u64 block_start = round_up(offset, block_bytes(c));
523 u64 block_end = round_down(end, block_bytes(c));
524 bool truncated_last_page;
527 ret = bch2_truncate_folios(inode, offset, end);
528 if (unlikely(ret < 0))
531 truncated_last_page = ret;
533 truncate_pagecache_range(&inode->v, offset, end - 1);
535 if (block_start < block_end) {
536 s64 i_sectors_delta = 0;
538 ret = bch2_fpunch(c, inode_inum(inode),
539 block_start >> 9, block_end >> 9,
541 bch2_i_sectors_acct(c, inode, NULL, i_sectors_delta);
544 mutex_lock(&inode->ei_update_lock);
545 if (end >= inode->v.i_size && !truncated_last_page) {
546 ret = bch2_write_inode_size(c, inode, inode->v.i_size,
547 ATTR_MTIME|ATTR_CTIME);
549 ret = bch2_write_inode(c, inode, inode_update_times_fn, NULL,
550 ATTR_MTIME|ATTR_CTIME);
552 mutex_unlock(&inode->ei_update_lock);
557 static long bchfs_fcollapse_finsert(struct bch_inode_info *inode,
558 loff_t offset, loff_t len,
561 struct bch_fs *c = inode->v.i_sb->s_fs_info;
562 struct address_space *mapping = inode->v.i_mapping;
563 s64 i_sectors_delta = 0;
566 if ((offset | len) & (block_bytes(c) - 1))
570 if (offset >= inode->v.i_size)
573 if (offset + len >= inode->v.i_size)
577 ret = bch2_write_invalidate_inode_pages_range(mapping, offset, LLONG_MAX);
582 i_size_write(&inode->v, inode->v.i_size + len);
584 ret = bch2_fcollapse_finsert(c, inode_inum(inode), offset >> 9, len >> 9,
585 insert, &i_sectors_delta);
587 i_size_write(&inode->v, inode->v.i_size - len);
588 bch2_i_sectors_acct(c, inode, NULL, i_sectors_delta);
593 static int __bchfs_fallocate(struct bch_inode_info *inode, int mode,
594 u64 start_sector, u64 end_sector)
596 struct bch_fs *c = inode->v.i_sb->s_fs_info;
597 struct btree_trans *trans = bch2_trans_get(c);
598 struct btree_iter iter;
599 struct bpos end_pos = POS(inode->v.i_ino, end_sector);
600 struct bch_io_opts opts;
603 bch2_inode_opts_get(&opts, c, &inode->ei_inode);
605 bch2_trans_iter_init(trans, &iter, BTREE_ID_extents,
606 POS(inode->v.i_ino, start_sector),
607 BTREE_ITER_SLOTS|BTREE_ITER_INTENT);
609 while (!ret && bkey_lt(iter.pos, end_pos)) {
610 s64 i_sectors_delta = 0;
611 struct quota_res quota_res = { 0 };
615 u64 hole_start, hole_end;
618 bch2_trans_begin(trans);
620 ret = bch2_subvolume_get_snapshot(trans,
621 inode->ei_subvol, &snapshot);
625 bch2_btree_iter_set_snapshot(&iter, snapshot);
627 k = bch2_btree_iter_peek_slot(&iter);
628 if ((ret = bkey_err(k)))
631 hole_start = iter.pos.offset;
632 hole_end = bpos_min(k.k->p, end_pos).offset;
633 is_allocation = bkey_extent_is_allocation(k.k);
635 /* already reserved */
636 if (bkey_extent_is_reservation(k) &&
637 bch2_bkey_nr_ptrs_fully_allocated(k) >= opts.data_replicas) {
638 bch2_btree_iter_advance(&iter);
642 if (bkey_extent_is_data(k.k) &&
643 !(mode & FALLOC_FL_ZERO_RANGE)) {
644 bch2_btree_iter_advance(&iter);
648 if (!(mode & FALLOC_FL_ZERO_RANGE)) {
650 * Lock ordering - can't be holding btree locks while
651 * blocking on a folio lock:
653 if (bch2_clamp_data_hole(&inode->v,
656 opts.data_replicas, true))
657 ret = drop_locks_do(trans,
658 (bch2_clamp_data_hole(&inode->v,
661 opts.data_replicas, false), 0));
662 bch2_btree_iter_set_pos(&iter, POS(iter.pos.inode, hole_start));
667 if (hole_start == hole_end)
671 sectors = hole_end - hole_start;
673 if (!is_allocation) {
674 ret = bch2_quota_reservation_add(c, inode,
675 "a_res, sectors, true);
680 ret = bch2_extent_fallocate(trans, inode_inum(inode), &iter,
681 sectors, opts, &i_sectors_delta,
682 writepoint_hashed((unsigned long) current));
686 bch2_i_sectors_acct(c, inode, "a_res, i_sectors_delta);
689 (bch2_mark_pagecache_reserved(inode, hole_start, iter.pos.offset), 0));
691 bch2_quota_reservation_put(c, inode, "a_res);
692 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
696 if (bch2_err_matches(ret, ENOSPC) && (mode & FALLOC_FL_ZERO_RANGE)) {
697 struct quota_res quota_res = { 0 };
698 s64 i_sectors_delta = 0;
700 bch2_fpunch_at(trans, &iter, inode_inum(inode),
701 end_sector, &i_sectors_delta);
702 bch2_i_sectors_acct(c, inode, "a_res, i_sectors_delta);
703 bch2_quota_reservation_put(c, inode, "a_res);
706 bch2_trans_iter_exit(trans, &iter);
707 bch2_trans_put(trans);
711 static long bchfs_fallocate(struct bch_inode_info *inode, int mode,
712 loff_t offset, loff_t len)
714 struct bch_fs *c = inode->v.i_sb->s_fs_info;
715 u64 end = offset + len;
716 u64 block_start = round_down(offset, block_bytes(c));
717 u64 block_end = round_up(end, block_bytes(c));
718 bool truncated_last_page = false;
721 if (!(mode & FALLOC_FL_KEEP_SIZE) && end > inode->v.i_size) {
722 ret = inode_newsize_ok(&inode->v, end);
727 if (mode & FALLOC_FL_ZERO_RANGE) {
728 ret = bch2_truncate_folios(inode, offset, end);
729 if (unlikely(ret < 0))
732 truncated_last_page = ret;
734 truncate_pagecache_range(&inode->v, offset, end - 1);
736 block_start = round_up(offset, block_bytes(c));
737 block_end = round_down(end, block_bytes(c));
740 ret = __bchfs_fallocate(inode, mode, block_start >> 9, block_end >> 9);
743 * On -ENOSPC in ZERO_RANGE mode, we still want to do the inode update,
744 * so that the VFS cache i_size is consistent with the btree i_size:
747 !(bch2_err_matches(ret, ENOSPC) && (mode & FALLOC_FL_ZERO_RANGE)))
750 if (mode & FALLOC_FL_KEEP_SIZE && end > inode->v.i_size)
751 end = inode->v.i_size;
753 if (end >= inode->v.i_size &&
754 (((mode & FALLOC_FL_ZERO_RANGE) && !truncated_last_page) ||
755 !(mode & FALLOC_FL_KEEP_SIZE))) {
756 spin_lock(&inode->v.i_lock);
757 i_size_write(&inode->v, end);
758 spin_unlock(&inode->v.i_lock);
760 mutex_lock(&inode->ei_update_lock);
761 ret2 = bch2_write_inode_size(c, inode, end, 0);
762 mutex_unlock(&inode->ei_update_lock);
768 long bch2_fallocate_dispatch(struct file *file, int mode,
769 loff_t offset, loff_t len)
771 struct bch_inode_info *inode = file_bch_inode(file);
772 struct bch_fs *c = inode->v.i_sb->s_fs_info;
775 if (!bch2_write_ref_tryget(c, BCH_WRITE_REF_fallocate))
778 inode_lock(&inode->v);
779 inode_dio_wait(&inode->v);
780 bch2_pagecache_block_get(inode);
782 ret = file_modified(file);
786 if (!(mode & ~(FALLOC_FL_KEEP_SIZE|FALLOC_FL_ZERO_RANGE)))
787 ret = bchfs_fallocate(inode, mode, offset, len);
788 else if (mode == (FALLOC_FL_PUNCH_HOLE|FALLOC_FL_KEEP_SIZE))
789 ret = bchfs_fpunch(inode, offset, len);
790 else if (mode == FALLOC_FL_INSERT_RANGE)
791 ret = bchfs_fcollapse_finsert(inode, offset, len, true);
792 else if (mode == FALLOC_FL_COLLAPSE_RANGE)
793 ret = bchfs_fcollapse_finsert(inode, offset, len, false);
797 bch2_pagecache_block_put(inode);
798 inode_unlock(&inode->v);
799 bch2_write_ref_put(c, BCH_WRITE_REF_fallocate);
801 return bch2_err_class(ret);
805 * Take a quota reservation for unallocated blocks in a given file range
806 * Does not check pagecache
808 static int quota_reserve_range(struct bch_inode_info *inode,
809 struct quota_res *res,
812 struct bch_fs *c = inode->v.i_sb->s_fs_info;
813 struct btree_trans *trans = bch2_trans_get(c);
814 struct btree_iter iter;
817 u64 sectors = end - start;
821 bch2_trans_begin(trans);
823 ret = bch2_subvolume_get_snapshot(trans, inode->ei_subvol, &snapshot);
827 bch2_trans_iter_init(trans, &iter, BTREE_ID_extents,
828 SPOS(inode->v.i_ino, pos, snapshot), 0);
830 while (!(ret = btree_trans_too_many_iters(trans)) &&
831 (k = bch2_btree_iter_peek_upto(&iter, POS(inode->v.i_ino, end - 1))).k &&
832 !(ret = bkey_err(k))) {
833 if (bkey_extent_is_allocation(k.k)) {
834 u64 s = min(end, k.k->p.offset) -
835 max(start, bkey_start_offset(k.k));
839 bch2_btree_iter_advance(&iter);
841 pos = iter.pos.offset;
842 bch2_trans_iter_exit(trans, &iter);
844 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
847 bch2_trans_put(trans);
849 return ret ?: bch2_quota_reservation_add(c, inode, res, sectors, true);
852 loff_t bch2_remap_file_range(struct file *file_src, loff_t pos_src,
853 struct file *file_dst, loff_t pos_dst,
854 loff_t len, unsigned remap_flags)
856 struct bch_inode_info *src = file_bch_inode(file_src);
857 struct bch_inode_info *dst = file_bch_inode(file_dst);
858 struct bch_fs *c = src->v.i_sb->s_fs_info;
859 struct quota_res quota_res = { 0 };
860 s64 i_sectors_delta = 0;
864 if (remap_flags & ~(REMAP_FILE_DEDUP|REMAP_FILE_ADVISORY))
867 if (remap_flags & REMAP_FILE_DEDUP)
870 if ((pos_src & (block_bytes(c) - 1)) ||
871 (pos_dst & (block_bytes(c) - 1)))
875 abs(pos_src - pos_dst) < len)
878 lock_two_nondirectories(&src->v, &dst->v);
879 bch2_lock_inodes(INODE_PAGECACHE_BLOCK, src, dst);
881 inode_dio_wait(&src->v);
882 inode_dio_wait(&dst->v);
884 ret = generic_remap_file_range_prep(file_src, pos_src,
887 if (ret < 0 || len == 0)
890 aligned_len = round_up((u64) len, block_bytes(c));
892 ret = bch2_write_invalidate_inode_pages_range(dst->v.i_mapping,
893 pos_dst, pos_dst + len - 1);
897 ret = quota_reserve_range(dst, "a_res, pos_dst >> 9,
898 (pos_dst + aligned_len) >> 9);
902 file_update_time(file_dst);
904 bch2_mark_pagecache_unallocated(src, pos_src >> 9,
905 (pos_src + aligned_len) >> 9);
907 ret = bch2_remap_range(c,
908 inode_inum(dst), pos_dst >> 9,
909 inode_inum(src), pos_src >> 9,
911 pos_dst + len, &i_sectors_delta);
916 * due to alignment, we might have remapped slightly more than requsted
918 ret = min((u64) ret << 9, (u64) len);
920 bch2_i_sectors_acct(c, dst, "a_res, i_sectors_delta);
922 spin_lock(&dst->v.i_lock);
923 if (pos_dst + ret > dst->v.i_size)
924 i_size_write(&dst->v, pos_dst + ret);
925 spin_unlock(&dst->v.i_lock);
927 if ((file_dst->f_flags & (__O_SYNC | O_DSYNC)) ||
928 IS_SYNC(file_inode(file_dst)))
929 ret = bch2_flush_inode(c, dst);
931 bch2_quota_reservation_put(c, dst, "a_res);
932 bch2_unlock_inodes(INODE_PAGECACHE_BLOCK, src, dst);
933 unlock_two_nondirectories(&src->v, &dst->v);
935 return bch2_err_class(ret);
940 static loff_t bch2_seek_data(struct file *file, u64 offset)
942 struct bch_inode_info *inode = file_bch_inode(file);
943 struct bch_fs *c = inode->v.i_sb->s_fs_info;
944 struct btree_trans *trans;
945 struct btree_iter iter;
947 subvol_inum inum = inode_inum(inode);
948 u64 isize, next_data = MAX_LFS_FILESIZE;
952 isize = i_size_read(&inode->v);
956 trans = bch2_trans_get(c);
958 bch2_trans_begin(trans);
960 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot);
964 for_each_btree_key_upto_norestart(trans, iter, BTREE_ID_extents,
965 SPOS(inode->v.i_ino, offset >> 9, snapshot),
966 POS(inode->v.i_ino, U64_MAX),
968 if (bkey_extent_is_data(k.k)) {
969 next_data = max(offset, bkey_start_offset(k.k) << 9);
971 } else if (k.k->p.offset >> 9 > isize)
974 bch2_trans_iter_exit(trans, &iter);
976 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
979 bch2_trans_put(trans);
983 if (next_data > offset)
984 next_data = bch2_seek_pagecache_data(&inode->v,
985 offset, next_data, 0, false);
987 if (next_data >= isize)
990 return vfs_setpos(file, next_data, MAX_LFS_FILESIZE);
993 static loff_t bch2_seek_hole(struct file *file, u64 offset)
995 struct bch_inode_info *inode = file_bch_inode(file);
996 struct bch_fs *c = inode->v.i_sb->s_fs_info;
997 struct btree_trans *trans;
998 struct btree_iter iter;
1000 subvol_inum inum = inode_inum(inode);
1001 u64 isize, next_hole = MAX_LFS_FILESIZE;
1005 isize = i_size_read(&inode->v);
1006 if (offset >= isize)
1009 trans = bch2_trans_get(c);
1011 bch2_trans_begin(trans);
1013 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot);
1017 for_each_btree_key_norestart(trans, iter, BTREE_ID_extents,
1018 SPOS(inode->v.i_ino, offset >> 9, snapshot),
1019 BTREE_ITER_SLOTS, k, ret) {
1020 if (k.k->p.inode != inode->v.i_ino) {
1021 next_hole = bch2_seek_pagecache_hole(&inode->v,
1022 offset, MAX_LFS_FILESIZE, 0, false);
1024 } else if (!bkey_extent_is_data(k.k)) {
1025 next_hole = bch2_seek_pagecache_hole(&inode->v,
1026 max(offset, bkey_start_offset(k.k) << 9),
1027 k.k->p.offset << 9, 0, false);
1029 if (next_hole < k.k->p.offset << 9)
1032 offset = max(offset, bkey_start_offset(k.k) << 9);
1035 bch2_trans_iter_exit(trans, &iter);
1037 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1040 bch2_trans_put(trans);
1044 if (next_hole > isize)
1047 return vfs_setpos(file, next_hole, MAX_LFS_FILESIZE);
1050 loff_t bch2_llseek(struct file *file, loff_t offset, int whence)
1058 ret = generic_file_llseek(file, offset, whence);
1061 ret = bch2_seek_data(file, offset);
1064 ret = bch2_seek_hole(file, offset);
1071 return bch2_err_class(ret);
1074 void bch2_fs_fsio_exit(struct bch_fs *c)
1076 bioset_exit(&c->nocow_flush_bioset);
1079 int bch2_fs_fsio_init(struct bch_fs *c)
1081 if (bioset_init(&c->nocow_flush_bioset,
1082 1, offsetof(struct nocow_flush, bio), 0))
1083 return -BCH_ERR_ENOMEM_nocow_flush_bioset_init;
1088 #endif /* NO_BCACHEFS_FS */