1 // SPDX-License-Identifier: GPL-2.0-only
5 * Copyright (C) 2009 Oracle. All rights reserved.
8 #include <linux/sort.h>
9 #include <cluster/masklog.h>
17 #include "buffer_head_io.h"
18 #include "blockcheck.h"
19 #include "refcounttree.h"
22 #include "extent_map.h"
26 #include "ocfs2_trace.h"
29 #include <linux/bio.h>
30 #include <linux/blkdev.h>
31 #include <linux/slab.h>
32 #include <linux/writeback.h>
33 #include <linux/pagevec.h>
34 #include <linux/swap.h>
35 #include <linux/security.h>
36 #include <linux/fsnotify.h>
37 #include <linux/quotaops.h>
38 #include <linux/namei.h>
39 #include <linux/mount.h>
40 #include <linux/posix_acl.h>
42 struct ocfs2_cow_context {
46 struct ocfs2_extent_tree data_et;
47 struct ocfs2_refcount_tree *ref_tree;
48 struct buffer_head *ref_root_bh;
49 struct ocfs2_alloc_context *meta_ac;
50 struct ocfs2_alloc_context *data_ac;
51 struct ocfs2_cached_dealloc_ctxt dealloc;
53 struct ocfs2_post_refcount *post_refcount;
55 int (*get_clusters)(struct ocfs2_cow_context *context,
56 u32 v_cluster, u32 *p_cluster,
58 unsigned int *extent_flags);
59 int (*cow_duplicate_clusters)(handle_t *handle,
61 u32 cpos, u32 old_cluster,
62 u32 new_cluster, u32 new_len);
65 static inline struct ocfs2_refcount_tree *
66 cache_info_to_refcount(struct ocfs2_caching_info *ci)
68 return container_of(ci, struct ocfs2_refcount_tree, rf_ci);
71 static int ocfs2_validate_refcount_block(struct super_block *sb,
72 struct buffer_head *bh)
75 struct ocfs2_refcount_block *rb =
76 (struct ocfs2_refcount_block *)bh->b_data;
78 trace_ocfs2_validate_refcount_block((unsigned long long)bh->b_blocknr);
80 BUG_ON(!buffer_uptodate(bh));
83 * If the ecc fails, we return the error but otherwise
84 * leave the filesystem running. We know any error is
85 * local to this block.
87 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &rb->rf_check);
89 mlog(ML_ERROR, "Checksum failed for refcount block %llu\n",
90 (unsigned long long)bh->b_blocknr);
95 if (!OCFS2_IS_VALID_REFCOUNT_BLOCK(rb)) {
97 "Refcount block #%llu has bad signature %.*s\n",
98 (unsigned long long)bh->b_blocknr, 7,
103 if (le64_to_cpu(rb->rf_blkno) != bh->b_blocknr) {
105 "Refcount block #%llu has an invalid rf_blkno of %llu\n",
106 (unsigned long long)bh->b_blocknr,
107 (unsigned long long)le64_to_cpu(rb->rf_blkno));
111 if (le32_to_cpu(rb->rf_fs_generation) != OCFS2_SB(sb)->fs_generation) {
113 "Refcount block #%llu has an invalid rf_fs_generation of #%u\n",
114 (unsigned long long)bh->b_blocknr,
115 le32_to_cpu(rb->rf_fs_generation));
122 static int ocfs2_read_refcount_block(struct ocfs2_caching_info *ci,
124 struct buffer_head **bh)
127 struct buffer_head *tmp = *bh;
129 rc = ocfs2_read_block(ci, rb_blkno, &tmp,
130 ocfs2_validate_refcount_block);
132 /* If ocfs2_read_block() got us a new bh, pass it up. */
139 static u64 ocfs2_refcount_cache_owner(struct ocfs2_caching_info *ci)
141 struct ocfs2_refcount_tree *rf = cache_info_to_refcount(ci);
146 static struct super_block *
147 ocfs2_refcount_cache_get_super(struct ocfs2_caching_info *ci)
149 struct ocfs2_refcount_tree *rf = cache_info_to_refcount(ci);
154 static void ocfs2_refcount_cache_lock(struct ocfs2_caching_info *ci)
155 __acquires(&rf->rf_lock)
157 struct ocfs2_refcount_tree *rf = cache_info_to_refcount(ci);
159 spin_lock(&rf->rf_lock);
162 static void ocfs2_refcount_cache_unlock(struct ocfs2_caching_info *ci)
163 __releases(&rf->rf_lock)
165 struct ocfs2_refcount_tree *rf = cache_info_to_refcount(ci);
167 spin_unlock(&rf->rf_lock);
170 static void ocfs2_refcount_cache_io_lock(struct ocfs2_caching_info *ci)
172 struct ocfs2_refcount_tree *rf = cache_info_to_refcount(ci);
174 mutex_lock(&rf->rf_io_mutex);
177 static void ocfs2_refcount_cache_io_unlock(struct ocfs2_caching_info *ci)
179 struct ocfs2_refcount_tree *rf = cache_info_to_refcount(ci);
181 mutex_unlock(&rf->rf_io_mutex);
184 static const struct ocfs2_caching_operations ocfs2_refcount_caching_ops = {
185 .co_owner = ocfs2_refcount_cache_owner,
186 .co_get_super = ocfs2_refcount_cache_get_super,
187 .co_cache_lock = ocfs2_refcount_cache_lock,
188 .co_cache_unlock = ocfs2_refcount_cache_unlock,
189 .co_io_lock = ocfs2_refcount_cache_io_lock,
190 .co_io_unlock = ocfs2_refcount_cache_io_unlock,
193 static struct ocfs2_refcount_tree *
194 ocfs2_find_refcount_tree(struct ocfs2_super *osb, u64 blkno)
196 struct rb_node *n = osb->osb_rf_lock_tree.rb_node;
197 struct ocfs2_refcount_tree *tree = NULL;
200 tree = rb_entry(n, struct ocfs2_refcount_tree, rf_node);
202 if (blkno < tree->rf_blkno)
204 else if (blkno > tree->rf_blkno)
213 /* osb_lock is already locked. */
214 static void ocfs2_insert_refcount_tree(struct ocfs2_super *osb,
215 struct ocfs2_refcount_tree *new)
217 u64 rf_blkno = new->rf_blkno;
218 struct rb_node *parent = NULL;
219 struct rb_node **p = &osb->osb_rf_lock_tree.rb_node;
220 struct ocfs2_refcount_tree *tmp;
225 tmp = rb_entry(parent, struct ocfs2_refcount_tree,
228 if (rf_blkno < tmp->rf_blkno)
230 else if (rf_blkno > tmp->rf_blkno)
233 /* This should never happen! */
234 mlog(ML_ERROR, "Duplicate refcount block %llu found!\n",
235 (unsigned long long)rf_blkno);
240 rb_link_node(&new->rf_node, parent, p);
241 rb_insert_color(&new->rf_node, &osb->osb_rf_lock_tree);
244 static void ocfs2_free_refcount_tree(struct ocfs2_refcount_tree *tree)
246 ocfs2_metadata_cache_exit(&tree->rf_ci);
247 ocfs2_simple_drop_lockres(OCFS2_SB(tree->rf_sb), &tree->rf_lockres);
248 ocfs2_lock_res_free(&tree->rf_lockres);
253 ocfs2_erase_refcount_tree_from_list_no_lock(struct ocfs2_super *osb,
254 struct ocfs2_refcount_tree *tree)
256 rb_erase(&tree->rf_node, &osb->osb_rf_lock_tree);
257 if (osb->osb_ref_tree_lru && osb->osb_ref_tree_lru == tree)
258 osb->osb_ref_tree_lru = NULL;
261 static void ocfs2_erase_refcount_tree_from_list(struct ocfs2_super *osb,
262 struct ocfs2_refcount_tree *tree)
264 spin_lock(&osb->osb_lock);
265 ocfs2_erase_refcount_tree_from_list_no_lock(osb, tree);
266 spin_unlock(&osb->osb_lock);
269 static void ocfs2_kref_remove_refcount_tree(struct kref *kref)
271 struct ocfs2_refcount_tree *tree =
272 container_of(kref, struct ocfs2_refcount_tree, rf_getcnt);
274 ocfs2_free_refcount_tree(tree);
278 ocfs2_refcount_tree_get(struct ocfs2_refcount_tree *tree)
280 kref_get(&tree->rf_getcnt);
284 ocfs2_refcount_tree_put(struct ocfs2_refcount_tree *tree)
286 kref_put(&tree->rf_getcnt, ocfs2_kref_remove_refcount_tree);
289 static inline void ocfs2_init_refcount_tree_ci(struct ocfs2_refcount_tree *new,
290 struct super_block *sb)
292 ocfs2_metadata_cache_init(&new->rf_ci, &ocfs2_refcount_caching_ops);
293 mutex_init(&new->rf_io_mutex);
295 spin_lock_init(&new->rf_lock);
298 static inline void ocfs2_init_refcount_tree_lock(struct ocfs2_super *osb,
299 struct ocfs2_refcount_tree *new,
300 u64 rf_blkno, u32 generation)
302 init_rwsem(&new->rf_sem);
303 ocfs2_refcount_lock_res_init(&new->rf_lockres, osb,
304 rf_blkno, generation);
307 static struct ocfs2_refcount_tree*
308 ocfs2_allocate_refcount_tree(struct ocfs2_super *osb, u64 rf_blkno)
310 struct ocfs2_refcount_tree *new;
312 new = kzalloc(sizeof(struct ocfs2_refcount_tree), GFP_NOFS);
316 new->rf_blkno = rf_blkno;
317 kref_init(&new->rf_getcnt);
318 ocfs2_init_refcount_tree_ci(new, osb->sb);
323 static int ocfs2_get_refcount_tree(struct ocfs2_super *osb, u64 rf_blkno,
324 struct ocfs2_refcount_tree **ret_tree)
327 struct ocfs2_refcount_tree *tree, *new = NULL;
328 struct buffer_head *ref_root_bh = NULL;
329 struct ocfs2_refcount_block *ref_rb;
331 spin_lock(&osb->osb_lock);
332 if (osb->osb_ref_tree_lru &&
333 osb->osb_ref_tree_lru->rf_blkno == rf_blkno)
334 tree = osb->osb_ref_tree_lru;
336 tree = ocfs2_find_refcount_tree(osb, rf_blkno);
340 spin_unlock(&osb->osb_lock);
342 new = ocfs2_allocate_refcount_tree(osb, rf_blkno);
349 * We need the generation to create the refcount tree lock and since
350 * it isn't changed during the tree modification, we are safe here to
351 * read without protection.
352 * We also have to purge the cache after we create the lock since the
353 * refcount block may have the stale data. It can only be trusted when
354 * we hold the refcount lock.
356 ret = ocfs2_read_refcount_block(&new->rf_ci, rf_blkno, &ref_root_bh);
359 ocfs2_metadata_cache_exit(&new->rf_ci);
364 ref_rb = (struct ocfs2_refcount_block *)ref_root_bh->b_data;
365 new->rf_generation = le32_to_cpu(ref_rb->rf_generation);
366 ocfs2_init_refcount_tree_lock(osb, new, rf_blkno,
368 ocfs2_metadata_cache_purge(&new->rf_ci);
370 spin_lock(&osb->osb_lock);
371 tree = ocfs2_find_refcount_tree(osb, rf_blkno);
375 ocfs2_insert_refcount_tree(osb, new);
383 osb->osb_ref_tree_lru = tree;
385 spin_unlock(&osb->osb_lock);
388 ocfs2_free_refcount_tree(new);
394 static int ocfs2_get_refcount_block(struct inode *inode, u64 *ref_blkno)
397 struct buffer_head *di_bh = NULL;
398 struct ocfs2_dinode *di;
400 ret = ocfs2_read_inode_block(inode, &di_bh);
406 BUG_ON(!ocfs2_is_refcount_inode(inode));
408 di = (struct ocfs2_dinode *)di_bh->b_data;
409 *ref_blkno = le64_to_cpu(di->i_refcount_loc);
415 static int __ocfs2_lock_refcount_tree(struct ocfs2_super *osb,
416 struct ocfs2_refcount_tree *tree, int rw)
420 ret = ocfs2_refcount_lock(tree, rw);
427 down_write(&tree->rf_sem);
429 down_read(&tree->rf_sem);
436 * Lock the refcount tree pointed by ref_blkno and return the tree.
437 * In most case, we lock the tree and read the refcount block.
438 * So read it here if the caller really needs it.
440 * If the tree has been re-created by other node, it will free the
441 * old one and re-create it.
443 int ocfs2_lock_refcount_tree(struct ocfs2_super *osb,
444 u64 ref_blkno, int rw,
445 struct ocfs2_refcount_tree **ret_tree,
446 struct buffer_head **ref_bh)
448 int ret, delete_tree = 0;
449 struct ocfs2_refcount_tree *tree = NULL;
450 struct buffer_head *ref_root_bh = NULL;
451 struct ocfs2_refcount_block *rb;
454 ret = ocfs2_get_refcount_tree(osb, ref_blkno, &tree);
460 ocfs2_refcount_tree_get(tree);
462 ret = __ocfs2_lock_refcount_tree(osb, tree, rw);
465 ocfs2_refcount_tree_put(tree);
469 ret = ocfs2_read_refcount_block(&tree->rf_ci, tree->rf_blkno,
473 ocfs2_unlock_refcount_tree(osb, tree, rw);
477 rb = (struct ocfs2_refcount_block *)ref_root_bh->b_data;
479 * If the refcount block has been freed and re-created, we may need
480 * to recreate the refcount tree also.
482 * Here we just remove the tree from the rb-tree, and the last
483 * kref holder will unlock and delete this refcount_tree.
484 * Then we goto "again" and ocfs2_get_refcount_tree will create
485 * the new refcount tree for us.
487 if (tree->rf_generation != le32_to_cpu(rb->rf_generation)) {
488 if (!tree->rf_removed) {
489 ocfs2_erase_refcount_tree_from_list(osb, tree);
490 tree->rf_removed = 1;
494 ocfs2_unlock_refcount_tree(osb, tree, rw);
496 * We get an extra reference when we create the refcount
497 * tree, so another put will destroy it.
500 ocfs2_refcount_tree_put(tree);
508 *ref_bh = ref_root_bh;
516 void ocfs2_unlock_refcount_tree(struct ocfs2_super *osb,
517 struct ocfs2_refcount_tree *tree, int rw)
520 up_write(&tree->rf_sem);
522 up_read(&tree->rf_sem);
524 ocfs2_refcount_unlock(tree, rw);
525 ocfs2_refcount_tree_put(tree);
528 void ocfs2_purge_refcount_trees(struct ocfs2_super *osb)
530 struct rb_node *node;
531 struct ocfs2_refcount_tree *tree;
532 struct rb_root *root = &osb->osb_rf_lock_tree;
534 while ((node = rb_last(root)) != NULL) {
535 tree = rb_entry(node, struct ocfs2_refcount_tree, rf_node);
537 trace_ocfs2_purge_refcount_trees(
538 (unsigned long long) tree->rf_blkno);
540 rb_erase(&tree->rf_node, root);
541 ocfs2_free_refcount_tree(tree);
546 * Create a refcount tree for an inode.
547 * We take for granted that the inode is already locked.
549 static int ocfs2_create_refcount_tree(struct inode *inode,
550 struct buffer_head *di_bh)
553 handle_t *handle = NULL;
554 struct ocfs2_alloc_context *meta_ac = NULL;
555 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
556 struct ocfs2_inode_info *oi = OCFS2_I(inode);
557 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
558 struct buffer_head *new_bh = NULL;
559 struct ocfs2_refcount_block *rb;
560 struct ocfs2_refcount_tree *new_tree = NULL, *tree = NULL;
561 u16 suballoc_bit_start;
563 u64 suballoc_loc, first_blkno;
565 BUG_ON(ocfs2_is_refcount_inode(inode));
567 trace_ocfs2_create_refcount_tree(
568 (unsigned long long)oi->ip_blkno);
570 ret = ocfs2_reserve_new_metadata_blocks(osb, 1, &meta_ac);
576 handle = ocfs2_start_trans(osb, OCFS2_REFCOUNT_TREE_CREATE_CREDITS);
577 if (IS_ERR(handle)) {
578 ret = PTR_ERR(handle);
583 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
584 OCFS2_JOURNAL_ACCESS_WRITE);
590 ret = ocfs2_claim_metadata(handle, meta_ac, 1, &suballoc_loc,
591 &suballoc_bit_start, &num_got,
598 new_tree = ocfs2_allocate_refcount_tree(osb, first_blkno);
605 new_bh = sb_getblk(inode->i_sb, first_blkno);
611 ocfs2_set_new_buffer_uptodate(&new_tree->rf_ci, new_bh);
613 ret = ocfs2_journal_access_rb(handle, &new_tree->rf_ci, new_bh,
614 OCFS2_JOURNAL_ACCESS_CREATE);
620 /* Initialize ocfs2_refcount_block. */
621 rb = (struct ocfs2_refcount_block *)new_bh->b_data;
622 memset(rb, 0, inode->i_sb->s_blocksize);
623 strcpy((void *)rb, OCFS2_REFCOUNT_BLOCK_SIGNATURE);
624 rb->rf_suballoc_slot = cpu_to_le16(meta_ac->ac_alloc_slot);
625 rb->rf_suballoc_loc = cpu_to_le64(suballoc_loc);
626 rb->rf_suballoc_bit = cpu_to_le16(suballoc_bit_start);
627 rb->rf_fs_generation = cpu_to_le32(osb->fs_generation);
628 rb->rf_blkno = cpu_to_le64(first_blkno);
629 rb->rf_count = cpu_to_le32(1);
630 rb->rf_records.rl_count =
631 cpu_to_le16(ocfs2_refcount_recs_per_rb(osb->sb));
632 spin_lock(&osb->osb_lock);
633 rb->rf_generation = osb->s_next_generation++;
634 spin_unlock(&osb->osb_lock);
636 ocfs2_journal_dirty(handle, new_bh);
638 spin_lock(&oi->ip_lock);
639 oi->ip_dyn_features |= OCFS2_HAS_REFCOUNT_FL;
640 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
641 di->i_refcount_loc = cpu_to_le64(first_blkno);
642 spin_unlock(&oi->ip_lock);
644 trace_ocfs2_create_refcount_tree_blkno((unsigned long long)first_blkno);
646 ocfs2_journal_dirty(handle, di_bh);
649 * We have to init the tree lock here since it will use
650 * the generation number to create it.
652 new_tree->rf_generation = le32_to_cpu(rb->rf_generation);
653 ocfs2_init_refcount_tree_lock(osb, new_tree, first_blkno,
654 new_tree->rf_generation);
656 spin_lock(&osb->osb_lock);
657 tree = ocfs2_find_refcount_tree(osb, first_blkno);
660 * We've just created a new refcount tree in this block. If
661 * we found a refcount tree on the ocfs2_super, it must be
662 * one we just deleted. We free the old tree before
663 * inserting the new tree.
665 BUG_ON(tree && tree->rf_generation == new_tree->rf_generation);
667 ocfs2_erase_refcount_tree_from_list_no_lock(osb, tree);
668 ocfs2_insert_refcount_tree(osb, new_tree);
669 spin_unlock(&osb->osb_lock);
672 ocfs2_refcount_tree_put(tree);
675 ocfs2_commit_trans(osb, handle);
679 ocfs2_metadata_cache_exit(&new_tree->rf_ci);
685 ocfs2_free_alloc_context(meta_ac);
690 static int ocfs2_set_refcount_tree(struct inode *inode,
691 struct buffer_head *di_bh,
695 handle_t *handle = NULL;
696 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
697 struct ocfs2_inode_info *oi = OCFS2_I(inode);
698 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
699 struct buffer_head *ref_root_bh = NULL;
700 struct ocfs2_refcount_block *rb;
701 struct ocfs2_refcount_tree *ref_tree;
703 BUG_ON(ocfs2_is_refcount_inode(inode));
705 ret = ocfs2_lock_refcount_tree(osb, refcount_loc, 1,
706 &ref_tree, &ref_root_bh);
712 handle = ocfs2_start_trans(osb, OCFS2_REFCOUNT_TREE_SET_CREDITS);
713 if (IS_ERR(handle)) {
714 ret = PTR_ERR(handle);
719 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
720 OCFS2_JOURNAL_ACCESS_WRITE);
726 ret = ocfs2_journal_access_rb(handle, &ref_tree->rf_ci, ref_root_bh,
727 OCFS2_JOURNAL_ACCESS_WRITE);
733 rb = (struct ocfs2_refcount_block *)ref_root_bh->b_data;
734 le32_add_cpu(&rb->rf_count, 1);
736 ocfs2_journal_dirty(handle, ref_root_bh);
738 spin_lock(&oi->ip_lock);
739 oi->ip_dyn_features |= OCFS2_HAS_REFCOUNT_FL;
740 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
741 di->i_refcount_loc = cpu_to_le64(refcount_loc);
742 spin_unlock(&oi->ip_lock);
743 ocfs2_journal_dirty(handle, di_bh);
746 ocfs2_commit_trans(osb, handle);
748 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
754 int ocfs2_remove_refcount_tree(struct inode *inode, struct buffer_head *di_bh)
756 int ret, delete_tree = 0;
757 handle_t *handle = NULL;
758 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
759 struct ocfs2_inode_info *oi = OCFS2_I(inode);
760 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
761 struct ocfs2_refcount_block *rb;
762 struct inode *alloc_inode = NULL;
763 struct buffer_head *alloc_bh = NULL;
764 struct buffer_head *blk_bh = NULL;
765 struct ocfs2_refcount_tree *ref_tree;
766 int credits = OCFS2_REFCOUNT_TREE_REMOVE_CREDITS;
767 u64 blk = 0, bg_blkno = 0, ref_blkno = le64_to_cpu(di->i_refcount_loc);
770 if (!ocfs2_is_refcount_inode(inode))
774 ret = ocfs2_lock_refcount_tree(osb, ref_blkno, 1, &ref_tree, &blk_bh);
780 rb = (struct ocfs2_refcount_block *)blk_bh->b_data;
783 * If we are the last user, we need to free the block.
784 * So lock the allocator ahead.
786 if (le32_to_cpu(rb->rf_count) == 1) {
787 blk = le64_to_cpu(rb->rf_blkno);
788 bit = le16_to_cpu(rb->rf_suballoc_bit);
789 if (rb->rf_suballoc_loc)
790 bg_blkno = le64_to_cpu(rb->rf_suballoc_loc);
792 bg_blkno = ocfs2_which_suballoc_group(blk, bit);
794 alloc_inode = ocfs2_get_system_file_inode(osb,
795 EXTENT_ALLOC_SYSTEM_INODE,
796 le16_to_cpu(rb->rf_suballoc_slot));
802 inode_lock(alloc_inode);
804 ret = ocfs2_inode_lock(alloc_inode, &alloc_bh, 1);
810 credits += OCFS2_SUBALLOC_FREE;
813 handle = ocfs2_start_trans(osb, credits);
814 if (IS_ERR(handle)) {
815 ret = PTR_ERR(handle);
820 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
821 OCFS2_JOURNAL_ACCESS_WRITE);
827 ret = ocfs2_journal_access_rb(handle, &ref_tree->rf_ci, blk_bh,
828 OCFS2_JOURNAL_ACCESS_WRITE);
834 spin_lock(&oi->ip_lock);
835 oi->ip_dyn_features &= ~OCFS2_HAS_REFCOUNT_FL;
836 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
837 di->i_refcount_loc = 0;
838 spin_unlock(&oi->ip_lock);
839 ocfs2_journal_dirty(handle, di_bh);
841 le32_add_cpu(&rb->rf_count , -1);
842 ocfs2_journal_dirty(handle, blk_bh);
846 ocfs2_erase_refcount_tree_from_list(osb, ref_tree);
847 ret = ocfs2_free_suballoc_bits(handle, alloc_inode,
848 alloc_bh, bit, bg_blkno, 1);
854 ocfs2_commit_trans(osb, handle);
857 ocfs2_inode_unlock(alloc_inode, 1);
862 inode_unlock(alloc_inode);
866 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
868 ocfs2_refcount_tree_put(ref_tree);
874 static void ocfs2_find_refcount_rec_in_rl(struct ocfs2_caching_info *ci,
875 struct buffer_head *ref_leaf_bh,
876 u64 cpos, unsigned int len,
877 struct ocfs2_refcount_rec *ret_rec,
881 struct ocfs2_refcount_block *rb =
882 (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
883 struct ocfs2_refcount_rec *rec = NULL;
885 for (; i < le16_to_cpu(rb->rf_records.rl_used); i++) {
886 rec = &rb->rf_records.rl_recs[i];
888 if (le64_to_cpu(rec->r_cpos) +
889 le32_to_cpu(rec->r_clusters) <= cpos)
891 else if (le64_to_cpu(rec->r_cpos) > cpos)
894 /* ok, cpos fail in this rec. Just return. */
901 /* We meet with a hole here, so fake the rec. */
902 ret_rec->r_cpos = cpu_to_le64(cpos);
903 ret_rec->r_refcount = 0;
904 if (i < le16_to_cpu(rb->rf_records.rl_used) &&
905 le64_to_cpu(rec->r_cpos) < cpos + len)
906 ret_rec->r_clusters =
907 cpu_to_le32(le64_to_cpu(rec->r_cpos) - cpos);
909 ret_rec->r_clusters = cpu_to_le32(len);
917 * Try to remove refcount tree. The mechanism is:
918 * 1) Check whether i_clusters == 0, if no, exit.
919 * 2) check whether we have i_xattr_loc in dinode. if yes, exit.
920 * 3) Check whether we have inline xattr stored outside, if yes, exit.
921 * 4) Remove the tree.
923 int ocfs2_try_remove_refcount_tree(struct inode *inode,
924 struct buffer_head *di_bh)
927 struct ocfs2_inode_info *oi = OCFS2_I(inode);
928 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
930 down_write(&oi->ip_xattr_sem);
931 down_write(&oi->ip_alloc_sem);
936 if ((oi->ip_dyn_features & OCFS2_HAS_XATTR_FL) && di->i_xattr_loc)
939 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL &&
940 ocfs2_has_inline_xattr_value_outside(inode, di))
943 ret = ocfs2_remove_refcount_tree(inode, di_bh);
947 up_write(&oi->ip_alloc_sem);
948 up_write(&oi->ip_xattr_sem);
953 * Find the end range for a leaf refcount block indicated by
954 * el->l_recs[index].e_blkno.
956 static int ocfs2_get_refcount_cpos_end(struct ocfs2_caching_info *ci,
957 struct buffer_head *ref_root_bh,
958 struct ocfs2_extent_block *eb,
959 struct ocfs2_extent_list *el,
960 int index, u32 *cpos_end)
962 int ret, i, subtree_root;
965 struct super_block *sb = ocfs2_metadata_cache_get_super(ci);
966 struct ocfs2_path *left_path = NULL, *right_path = NULL;
967 struct ocfs2_extent_tree et;
968 struct ocfs2_extent_list *tmp_el;
970 if (index < le16_to_cpu(el->l_next_free_rec) - 1) {
972 * We have a extent rec after index, so just use the e_cpos
973 * of the next extent rec.
975 *cpos_end = le32_to_cpu(el->l_recs[index+1].e_cpos);
979 if (!eb || !eb->h_next_leaf_blk) {
981 * We are the last extent rec, so any high cpos should
982 * be stored in this leaf refcount block.
984 *cpos_end = UINT_MAX;
989 * If the extent block isn't the last one, we have to find
990 * the subtree root between this extent block and the next
991 * leaf extent block and get the corresponding e_cpos from
992 * the subroot. Otherwise we may corrupt the b-tree.
994 ocfs2_init_refcount_extent_tree(&et, ci, ref_root_bh);
996 left_path = ocfs2_new_path_from_et(&et);
1003 cpos = le32_to_cpu(eb->h_list.l_recs[index].e_cpos);
1004 ret = ocfs2_find_path(ci, left_path, cpos);
1010 right_path = ocfs2_new_path_from_path(left_path);
1017 ret = ocfs2_find_cpos_for_right_leaf(sb, left_path, &cpos);
1023 ret = ocfs2_find_path(ci, right_path, cpos);
1029 subtree_root = ocfs2_find_subtree_root(&et, left_path,
1032 tmp_el = left_path->p_node[subtree_root].el;
1033 blkno = left_path->p_node[subtree_root+1].bh->b_blocknr;
1034 for (i = 0; i < le16_to_cpu(tmp_el->l_next_free_rec); i++) {
1035 if (le64_to_cpu(tmp_el->l_recs[i].e_blkno) == blkno) {
1036 *cpos_end = le32_to_cpu(tmp_el->l_recs[i+1].e_cpos);
1041 BUG_ON(i == le16_to_cpu(tmp_el->l_next_free_rec));
1044 ocfs2_free_path(left_path);
1045 ocfs2_free_path(right_path);
1050 * Given a cpos and len, try to find the refcount record which contains cpos.
1051 * 1. If cpos can be found in one refcount record, return the record.
1052 * 2. If cpos can't be found, return a fake record which start from cpos
1053 * and end at a small value between cpos+len and start of the next record.
1054 * This fake record has r_refcount = 0.
1056 static int ocfs2_get_refcount_rec(struct ocfs2_caching_info *ci,
1057 struct buffer_head *ref_root_bh,
1058 u64 cpos, unsigned int len,
1059 struct ocfs2_refcount_rec *ret_rec,
1061 struct buffer_head **ret_bh)
1063 int ret = 0, i, found;
1064 u32 low_cpos, cpos_end;
1065 struct ocfs2_extent_list *el;
1066 struct ocfs2_extent_rec *rec = NULL;
1067 struct ocfs2_extent_block *eb = NULL;
1068 struct buffer_head *eb_bh = NULL, *ref_leaf_bh = NULL;
1069 struct super_block *sb = ocfs2_metadata_cache_get_super(ci);
1070 struct ocfs2_refcount_block *rb =
1071 (struct ocfs2_refcount_block *)ref_root_bh->b_data;
1073 if (!(le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL)) {
1074 ocfs2_find_refcount_rec_in_rl(ci, ref_root_bh, cpos, len,
1076 *ret_bh = ref_root_bh;
1077 get_bh(ref_root_bh);
1082 low_cpos = cpos & OCFS2_32BIT_POS_MASK;
1084 if (el->l_tree_depth) {
1085 ret = ocfs2_find_leaf(ci, el, low_cpos, &eb_bh);
1091 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
1094 if (el->l_tree_depth) {
1095 ret = ocfs2_error(sb,
1096 "refcount tree %llu has non zero tree depth in leaf btree tree block %llu\n",
1097 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1098 (unsigned long long)eb_bh->b_blocknr);
1104 for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) {
1105 rec = &el->l_recs[i];
1107 if (le32_to_cpu(rec->e_cpos) <= low_cpos) {
1114 ret = ocfs2_get_refcount_cpos_end(ci, ref_root_bh,
1115 eb, el, i, &cpos_end);
1121 if (cpos_end < low_cpos + len)
1122 len = cpos_end - low_cpos;
1125 ret = ocfs2_read_refcount_block(ci, le64_to_cpu(rec->e_blkno),
1132 ocfs2_find_refcount_rec_in_rl(ci, ref_leaf_bh, cpos, len,
1134 *ret_bh = ref_leaf_bh;
1140 enum ocfs2_ref_rec_contig {
1141 REF_CONTIG_NONE = 0,
1144 REF_CONTIG_LEFTRIGHT,
1147 static enum ocfs2_ref_rec_contig
1148 ocfs2_refcount_rec_adjacent(struct ocfs2_refcount_block *rb,
1151 if ((rb->rf_records.rl_recs[index].r_refcount ==
1152 rb->rf_records.rl_recs[index + 1].r_refcount) &&
1153 (le64_to_cpu(rb->rf_records.rl_recs[index].r_cpos) +
1154 le32_to_cpu(rb->rf_records.rl_recs[index].r_clusters) ==
1155 le64_to_cpu(rb->rf_records.rl_recs[index + 1].r_cpos)))
1156 return REF_CONTIG_RIGHT;
1158 return REF_CONTIG_NONE;
1161 static enum ocfs2_ref_rec_contig
1162 ocfs2_refcount_rec_contig(struct ocfs2_refcount_block *rb,
1165 enum ocfs2_ref_rec_contig ret = REF_CONTIG_NONE;
1167 if (index < le16_to_cpu(rb->rf_records.rl_used) - 1)
1168 ret = ocfs2_refcount_rec_adjacent(rb, index);
1171 enum ocfs2_ref_rec_contig tmp;
1173 tmp = ocfs2_refcount_rec_adjacent(rb, index - 1);
1175 if (tmp == REF_CONTIG_RIGHT) {
1176 if (ret == REF_CONTIG_RIGHT)
1177 ret = REF_CONTIG_LEFTRIGHT;
1179 ret = REF_CONTIG_LEFT;
1186 static void ocfs2_rotate_refcount_rec_left(struct ocfs2_refcount_block *rb,
1189 BUG_ON(rb->rf_records.rl_recs[index].r_refcount !=
1190 rb->rf_records.rl_recs[index+1].r_refcount);
1192 le32_add_cpu(&rb->rf_records.rl_recs[index].r_clusters,
1193 le32_to_cpu(rb->rf_records.rl_recs[index+1].r_clusters));
1195 if (index < le16_to_cpu(rb->rf_records.rl_used) - 2)
1196 memmove(&rb->rf_records.rl_recs[index + 1],
1197 &rb->rf_records.rl_recs[index + 2],
1198 sizeof(struct ocfs2_refcount_rec) *
1199 (le16_to_cpu(rb->rf_records.rl_used) - index - 2));
1201 memset(&rb->rf_records.rl_recs[le16_to_cpu(rb->rf_records.rl_used) - 1],
1202 0, sizeof(struct ocfs2_refcount_rec));
1203 le16_add_cpu(&rb->rf_records.rl_used, -1);
1207 * Merge the refcount rec if we are contiguous with the adjacent recs.
1209 static void ocfs2_refcount_rec_merge(struct ocfs2_refcount_block *rb,
1212 enum ocfs2_ref_rec_contig contig =
1213 ocfs2_refcount_rec_contig(rb, index);
1215 if (contig == REF_CONTIG_NONE)
1218 if (contig == REF_CONTIG_LEFT || contig == REF_CONTIG_LEFTRIGHT) {
1223 ocfs2_rotate_refcount_rec_left(rb, index);
1225 if (contig == REF_CONTIG_LEFTRIGHT)
1226 ocfs2_rotate_refcount_rec_left(rb, index);
1230 * Change the refcount indexed by "index" in ref_bh.
1231 * If refcount reaches 0, remove it.
1233 static int ocfs2_change_refcount_rec(handle_t *handle,
1234 struct ocfs2_caching_info *ci,
1235 struct buffer_head *ref_leaf_bh,
1236 int index, int merge, int change)
1239 struct ocfs2_refcount_block *rb =
1240 (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
1241 struct ocfs2_refcount_list *rl = &rb->rf_records;
1242 struct ocfs2_refcount_rec *rec = &rl->rl_recs[index];
1244 ret = ocfs2_journal_access_rb(handle, ci, ref_leaf_bh,
1245 OCFS2_JOURNAL_ACCESS_WRITE);
1251 trace_ocfs2_change_refcount_rec(
1252 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1253 index, le32_to_cpu(rec->r_refcount), change);
1254 le32_add_cpu(&rec->r_refcount, change);
1256 if (!rec->r_refcount) {
1257 if (index != le16_to_cpu(rl->rl_used) - 1) {
1258 memmove(rec, rec + 1,
1259 (le16_to_cpu(rl->rl_used) - index - 1) *
1260 sizeof(struct ocfs2_refcount_rec));
1261 memset(&rl->rl_recs[le16_to_cpu(rl->rl_used) - 1],
1262 0, sizeof(struct ocfs2_refcount_rec));
1265 le16_add_cpu(&rl->rl_used, -1);
1267 ocfs2_refcount_rec_merge(rb, index);
1269 ocfs2_journal_dirty(handle, ref_leaf_bh);
1274 static int ocfs2_expand_inline_ref_root(handle_t *handle,
1275 struct ocfs2_caching_info *ci,
1276 struct buffer_head *ref_root_bh,
1277 struct buffer_head **ref_leaf_bh,
1278 struct ocfs2_alloc_context *meta_ac)
1281 u16 suballoc_bit_start;
1283 u64 suballoc_loc, blkno;
1284 struct super_block *sb = ocfs2_metadata_cache_get_super(ci);
1285 struct buffer_head *new_bh = NULL;
1286 struct ocfs2_refcount_block *new_rb;
1287 struct ocfs2_refcount_block *root_rb =
1288 (struct ocfs2_refcount_block *)ref_root_bh->b_data;
1290 ret = ocfs2_journal_access_rb(handle, ci, ref_root_bh,
1291 OCFS2_JOURNAL_ACCESS_WRITE);
1297 ret = ocfs2_claim_metadata(handle, meta_ac, 1, &suballoc_loc,
1298 &suballoc_bit_start, &num_got,
1305 new_bh = sb_getblk(sb, blkno);
1306 if (new_bh == NULL) {
1311 ocfs2_set_new_buffer_uptodate(ci, new_bh);
1313 ret = ocfs2_journal_access_rb(handle, ci, new_bh,
1314 OCFS2_JOURNAL_ACCESS_CREATE);
1321 * Initialize ocfs2_refcount_block.
1322 * It should contain the same information as the old root.
1323 * so just memcpy it and change the corresponding field.
1325 memcpy(new_bh->b_data, ref_root_bh->b_data, sb->s_blocksize);
1327 new_rb = (struct ocfs2_refcount_block *)new_bh->b_data;
1328 new_rb->rf_suballoc_slot = cpu_to_le16(meta_ac->ac_alloc_slot);
1329 new_rb->rf_suballoc_loc = cpu_to_le64(suballoc_loc);
1330 new_rb->rf_suballoc_bit = cpu_to_le16(suballoc_bit_start);
1331 new_rb->rf_blkno = cpu_to_le64(blkno);
1332 new_rb->rf_cpos = cpu_to_le32(0);
1333 new_rb->rf_parent = cpu_to_le64(ref_root_bh->b_blocknr);
1334 new_rb->rf_flags = cpu_to_le32(OCFS2_REFCOUNT_LEAF_FL);
1335 ocfs2_journal_dirty(handle, new_bh);
1337 /* Now change the root. */
1338 memset(&root_rb->rf_list, 0, sb->s_blocksize -
1339 offsetof(struct ocfs2_refcount_block, rf_list));
1340 root_rb->rf_list.l_count = cpu_to_le16(ocfs2_extent_recs_per_rb(sb));
1341 root_rb->rf_clusters = cpu_to_le32(1);
1342 root_rb->rf_list.l_next_free_rec = cpu_to_le16(1);
1343 root_rb->rf_list.l_recs[0].e_blkno = cpu_to_le64(blkno);
1344 root_rb->rf_list.l_recs[0].e_leaf_clusters = cpu_to_le16(1);
1345 root_rb->rf_flags = cpu_to_le32(OCFS2_REFCOUNT_TREE_FL);
1347 ocfs2_journal_dirty(handle, ref_root_bh);
1349 trace_ocfs2_expand_inline_ref_root((unsigned long long)blkno,
1350 le16_to_cpu(new_rb->rf_records.rl_used));
1352 *ref_leaf_bh = new_bh;
1359 static int ocfs2_refcount_rec_no_intersect(struct ocfs2_refcount_rec *prev,
1360 struct ocfs2_refcount_rec *next)
1362 if (ocfs2_get_ref_rec_low_cpos(prev) + le32_to_cpu(prev->r_clusters) <=
1363 ocfs2_get_ref_rec_low_cpos(next))
1369 static int cmp_refcount_rec_by_low_cpos(const void *a, const void *b)
1371 const struct ocfs2_refcount_rec *l = a, *r = b;
1372 u32 l_cpos = ocfs2_get_ref_rec_low_cpos(l);
1373 u32 r_cpos = ocfs2_get_ref_rec_low_cpos(r);
1375 if (l_cpos > r_cpos)
1377 if (l_cpos < r_cpos)
1382 static int cmp_refcount_rec_by_cpos(const void *a, const void *b)
1384 const struct ocfs2_refcount_rec *l = a, *r = b;
1385 u64 l_cpos = le64_to_cpu(l->r_cpos);
1386 u64 r_cpos = le64_to_cpu(r->r_cpos);
1388 if (l_cpos > r_cpos)
1390 if (l_cpos < r_cpos)
1395 static void swap_refcount_rec(void *a, void *b, int size)
1397 struct ocfs2_refcount_rec *l = a, *r = b;
1403 * The refcount cpos are ordered by their 64bit cpos,
1404 * But we will use the low 32 bit to be the e_cpos in the b-tree.
1405 * So we need to make sure that this pos isn't intersected with others.
1407 * Note: The refcount block is already sorted by their low 32 bit cpos,
1408 * So just try the middle pos first, and we will exit when we find
1409 * the good position.
1411 static int ocfs2_find_refcount_split_pos(struct ocfs2_refcount_list *rl,
1412 u32 *split_pos, int *split_index)
1414 int num_used = le16_to_cpu(rl->rl_used);
1415 int delta, middle = num_used / 2;
1417 for (delta = 0; delta < middle; delta++) {
1418 /* Let's check delta earlier than middle */
1419 if (ocfs2_refcount_rec_no_intersect(
1420 &rl->rl_recs[middle - delta - 1],
1421 &rl->rl_recs[middle - delta])) {
1422 *split_index = middle - delta;
1426 /* For even counts, don't walk off the end */
1427 if ((middle + delta + 1) == num_used)
1430 /* Now try delta past middle */
1431 if (ocfs2_refcount_rec_no_intersect(
1432 &rl->rl_recs[middle + delta],
1433 &rl->rl_recs[middle + delta + 1])) {
1434 *split_index = middle + delta + 1;
1439 if (delta >= middle)
1442 *split_pos = ocfs2_get_ref_rec_low_cpos(&rl->rl_recs[*split_index]);
1446 static int ocfs2_divide_leaf_refcount_block(struct buffer_head *ref_leaf_bh,
1447 struct buffer_head *new_bh,
1450 int split_index = 0, num_moved, ret;
1452 struct ocfs2_refcount_block *rb =
1453 (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
1454 struct ocfs2_refcount_list *rl = &rb->rf_records;
1455 struct ocfs2_refcount_block *new_rb =
1456 (struct ocfs2_refcount_block *)new_bh->b_data;
1457 struct ocfs2_refcount_list *new_rl = &new_rb->rf_records;
1459 trace_ocfs2_divide_leaf_refcount_block(
1460 (unsigned long long)ref_leaf_bh->b_blocknr,
1461 le16_to_cpu(rl->rl_count), le16_to_cpu(rl->rl_used));
1464 * XXX: Improvement later.
1465 * If we know all the high 32 bit cpos is the same, no need to sort.
1467 * In order to make the whole process safe, we do:
1468 * 1. sort the entries by their low 32 bit cpos first so that we can
1469 * find the split cpos easily.
1470 * 2. call ocfs2_insert_extent to insert the new refcount block.
1471 * 3. move the refcount rec to the new block.
1472 * 4. sort the entries by their 64 bit cpos.
1473 * 5. dirty the new_rb and rb.
1475 sort(&rl->rl_recs, le16_to_cpu(rl->rl_used),
1476 sizeof(struct ocfs2_refcount_rec),
1477 cmp_refcount_rec_by_low_cpos, swap_refcount_rec);
1479 ret = ocfs2_find_refcount_split_pos(rl, &cpos, &split_index);
1485 new_rb->rf_cpos = cpu_to_le32(cpos);
1487 /* move refcount records starting from split_index to the new block. */
1488 num_moved = le16_to_cpu(rl->rl_used) - split_index;
1489 memcpy(new_rl->rl_recs, &rl->rl_recs[split_index],
1490 num_moved * sizeof(struct ocfs2_refcount_rec));
1492 /*ok, remove the entries we just moved over to the other block. */
1493 memset(&rl->rl_recs[split_index], 0,
1494 num_moved * sizeof(struct ocfs2_refcount_rec));
1496 /* change old and new rl_used accordingly. */
1497 le16_add_cpu(&rl->rl_used, -num_moved);
1498 new_rl->rl_used = cpu_to_le16(num_moved);
1500 sort(&rl->rl_recs, le16_to_cpu(rl->rl_used),
1501 sizeof(struct ocfs2_refcount_rec),
1502 cmp_refcount_rec_by_cpos, swap_refcount_rec);
1504 sort(&new_rl->rl_recs, le16_to_cpu(new_rl->rl_used),
1505 sizeof(struct ocfs2_refcount_rec),
1506 cmp_refcount_rec_by_cpos, swap_refcount_rec);
1512 static int ocfs2_new_leaf_refcount_block(handle_t *handle,
1513 struct ocfs2_caching_info *ci,
1514 struct buffer_head *ref_root_bh,
1515 struct buffer_head *ref_leaf_bh,
1516 struct ocfs2_alloc_context *meta_ac)
1519 u16 suballoc_bit_start;
1520 u32 num_got, new_cpos;
1521 u64 suballoc_loc, blkno;
1522 struct super_block *sb = ocfs2_metadata_cache_get_super(ci);
1523 struct ocfs2_refcount_block *root_rb =
1524 (struct ocfs2_refcount_block *)ref_root_bh->b_data;
1525 struct buffer_head *new_bh = NULL;
1526 struct ocfs2_refcount_block *new_rb;
1527 struct ocfs2_extent_tree ref_et;
1529 BUG_ON(!(le32_to_cpu(root_rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL));
1531 ret = ocfs2_journal_access_rb(handle, ci, ref_root_bh,
1532 OCFS2_JOURNAL_ACCESS_WRITE);
1538 ret = ocfs2_journal_access_rb(handle, ci, ref_leaf_bh,
1539 OCFS2_JOURNAL_ACCESS_WRITE);
1545 ret = ocfs2_claim_metadata(handle, meta_ac, 1, &suballoc_loc,
1546 &suballoc_bit_start, &num_got,
1553 new_bh = sb_getblk(sb, blkno);
1554 if (new_bh == NULL) {
1559 ocfs2_set_new_buffer_uptodate(ci, new_bh);
1561 ret = ocfs2_journal_access_rb(handle, ci, new_bh,
1562 OCFS2_JOURNAL_ACCESS_CREATE);
1568 /* Initialize ocfs2_refcount_block. */
1569 new_rb = (struct ocfs2_refcount_block *)new_bh->b_data;
1570 memset(new_rb, 0, sb->s_blocksize);
1571 strcpy((void *)new_rb, OCFS2_REFCOUNT_BLOCK_SIGNATURE);
1572 new_rb->rf_suballoc_slot = cpu_to_le16(meta_ac->ac_alloc_slot);
1573 new_rb->rf_suballoc_loc = cpu_to_le64(suballoc_loc);
1574 new_rb->rf_suballoc_bit = cpu_to_le16(suballoc_bit_start);
1575 new_rb->rf_fs_generation = cpu_to_le32(OCFS2_SB(sb)->fs_generation);
1576 new_rb->rf_blkno = cpu_to_le64(blkno);
1577 new_rb->rf_parent = cpu_to_le64(ref_root_bh->b_blocknr);
1578 new_rb->rf_flags = cpu_to_le32(OCFS2_REFCOUNT_LEAF_FL);
1579 new_rb->rf_records.rl_count =
1580 cpu_to_le16(ocfs2_refcount_recs_per_rb(sb));
1581 new_rb->rf_generation = root_rb->rf_generation;
1583 ret = ocfs2_divide_leaf_refcount_block(ref_leaf_bh, new_bh, &new_cpos);
1589 ocfs2_journal_dirty(handle, ref_leaf_bh);
1590 ocfs2_journal_dirty(handle, new_bh);
1592 ocfs2_init_refcount_extent_tree(&ref_et, ci, ref_root_bh);
1594 trace_ocfs2_new_leaf_refcount_block(
1595 (unsigned long long)new_bh->b_blocknr, new_cpos);
1597 /* Insert the new leaf block with the specific offset cpos. */
1598 ret = ocfs2_insert_extent(handle, &ref_et, new_cpos, new_bh->b_blocknr,
1608 static int ocfs2_expand_refcount_tree(handle_t *handle,
1609 struct ocfs2_caching_info *ci,
1610 struct buffer_head *ref_root_bh,
1611 struct buffer_head *ref_leaf_bh,
1612 struct ocfs2_alloc_context *meta_ac)
1615 struct buffer_head *expand_bh = NULL;
1617 if (ref_root_bh == ref_leaf_bh) {
1619 * the old root bh hasn't been expanded to a b-tree,
1620 * so expand it first.
1622 ret = ocfs2_expand_inline_ref_root(handle, ci, ref_root_bh,
1623 &expand_bh, meta_ac);
1629 expand_bh = ref_leaf_bh;
1634 /* Now add a new refcount block into the tree.*/
1635 ret = ocfs2_new_leaf_refcount_block(handle, ci, ref_root_bh,
1636 expand_bh, meta_ac);
1645 * Adjust the extent rec in b-tree representing ref_leaf_bh.
1647 * Only called when we have inserted a new refcount rec at index 0
1648 * which means ocfs2_extent_rec.e_cpos may need some change.
1650 static int ocfs2_adjust_refcount_rec(handle_t *handle,
1651 struct ocfs2_caching_info *ci,
1652 struct buffer_head *ref_root_bh,
1653 struct buffer_head *ref_leaf_bh,
1654 struct ocfs2_refcount_rec *rec)
1657 u32 new_cpos, old_cpos;
1658 struct ocfs2_path *path = NULL;
1659 struct ocfs2_extent_tree et;
1660 struct ocfs2_refcount_block *rb =
1661 (struct ocfs2_refcount_block *)ref_root_bh->b_data;
1662 struct ocfs2_extent_list *el;
1664 if (!(le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL))
1667 rb = (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
1668 old_cpos = le32_to_cpu(rb->rf_cpos);
1669 new_cpos = le64_to_cpu(rec->r_cpos) & OCFS2_32BIT_POS_MASK;
1670 if (old_cpos <= new_cpos)
1673 ocfs2_init_refcount_extent_tree(&et, ci, ref_root_bh);
1675 path = ocfs2_new_path_from_et(&et);
1682 ret = ocfs2_find_path(ci, path, old_cpos);
1689 * 2 more credits, one for the leaf refcount block, one for
1690 * the extent block contains the extent rec.
1692 ret = ocfs2_extend_trans(handle, 2);
1698 ret = ocfs2_journal_access_rb(handle, ci, ref_leaf_bh,
1699 OCFS2_JOURNAL_ACCESS_WRITE);
1705 ret = ocfs2_journal_access_eb(handle, ci, path_leaf_bh(path),
1706 OCFS2_JOURNAL_ACCESS_WRITE);
1712 /* change the leaf extent block first. */
1713 el = path_leaf_el(path);
1715 for (i = 0; i < le16_to_cpu(el->l_next_free_rec); i++)
1716 if (le32_to_cpu(el->l_recs[i].e_cpos) == old_cpos)
1719 BUG_ON(i == le16_to_cpu(el->l_next_free_rec));
1721 el->l_recs[i].e_cpos = cpu_to_le32(new_cpos);
1723 /* change the r_cpos in the leaf block. */
1724 rb->rf_cpos = cpu_to_le32(new_cpos);
1726 ocfs2_journal_dirty(handle, path_leaf_bh(path));
1727 ocfs2_journal_dirty(handle, ref_leaf_bh);
1730 ocfs2_free_path(path);
1734 static int ocfs2_insert_refcount_rec(handle_t *handle,
1735 struct ocfs2_caching_info *ci,
1736 struct buffer_head *ref_root_bh,
1737 struct buffer_head *ref_leaf_bh,
1738 struct ocfs2_refcount_rec *rec,
1739 int index, int merge,
1740 struct ocfs2_alloc_context *meta_ac)
1743 struct ocfs2_refcount_block *rb =
1744 (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
1745 struct ocfs2_refcount_list *rf_list = &rb->rf_records;
1746 struct buffer_head *new_bh = NULL;
1748 BUG_ON(le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL);
1750 if (rf_list->rl_used == rf_list->rl_count) {
1751 u64 cpos = le64_to_cpu(rec->r_cpos);
1752 u32 len = le32_to_cpu(rec->r_clusters);
1754 ret = ocfs2_expand_refcount_tree(handle, ci, ref_root_bh,
1755 ref_leaf_bh, meta_ac);
1761 ret = ocfs2_get_refcount_rec(ci, ref_root_bh,
1762 cpos, len, NULL, &index,
1769 ref_leaf_bh = new_bh;
1770 rb = (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
1771 rf_list = &rb->rf_records;
1774 ret = ocfs2_journal_access_rb(handle, ci, ref_leaf_bh,
1775 OCFS2_JOURNAL_ACCESS_WRITE);
1781 if (index < le16_to_cpu(rf_list->rl_used))
1782 memmove(&rf_list->rl_recs[index + 1],
1783 &rf_list->rl_recs[index],
1784 (le16_to_cpu(rf_list->rl_used) - index) *
1785 sizeof(struct ocfs2_refcount_rec));
1787 trace_ocfs2_insert_refcount_rec(
1788 (unsigned long long)ref_leaf_bh->b_blocknr, index,
1789 (unsigned long long)le64_to_cpu(rec->r_cpos),
1790 le32_to_cpu(rec->r_clusters), le32_to_cpu(rec->r_refcount));
1792 rf_list->rl_recs[index] = *rec;
1794 le16_add_cpu(&rf_list->rl_used, 1);
1797 ocfs2_refcount_rec_merge(rb, index);
1799 ocfs2_journal_dirty(handle, ref_leaf_bh);
1802 ret = ocfs2_adjust_refcount_rec(handle, ci,
1814 * Split the refcount_rec indexed by "index" in ref_leaf_bh.
1815 * This is much simple than our b-tree code.
1816 * split_rec is the new refcount rec we want to insert.
1817 * If split_rec->r_refcount > 0, we are changing the refcount(in case we
1818 * increase refcount or decrease a refcount to non-zero).
1819 * If split_rec->r_refcount == 0, we are punching a hole in current refcount
1820 * rec( in case we decrease a refcount to zero).
1822 static int ocfs2_split_refcount_rec(handle_t *handle,
1823 struct ocfs2_caching_info *ci,
1824 struct buffer_head *ref_root_bh,
1825 struct buffer_head *ref_leaf_bh,
1826 struct ocfs2_refcount_rec *split_rec,
1827 int index, int merge,
1828 struct ocfs2_alloc_context *meta_ac,
1829 struct ocfs2_cached_dealloc_ctxt *dealloc)
1833 struct ocfs2_refcount_block *rb =
1834 (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
1835 struct ocfs2_refcount_list *rf_list = &rb->rf_records;
1836 struct ocfs2_refcount_rec *orig_rec = &rf_list->rl_recs[index];
1837 struct ocfs2_refcount_rec *tail_rec = NULL;
1838 struct buffer_head *new_bh = NULL;
1840 BUG_ON(le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL);
1842 trace_ocfs2_split_refcount_rec(le64_to_cpu(orig_rec->r_cpos),
1843 le32_to_cpu(orig_rec->r_clusters),
1844 le32_to_cpu(orig_rec->r_refcount),
1845 le64_to_cpu(split_rec->r_cpos),
1846 le32_to_cpu(split_rec->r_clusters),
1847 le32_to_cpu(split_rec->r_refcount));
1850 * If we just need to split the header or tail clusters,
1851 * no more recs are needed, just split is OK.
1852 * Otherwise we at least need one new recs.
1854 if (!split_rec->r_refcount &&
1855 (split_rec->r_cpos == orig_rec->r_cpos ||
1856 le64_to_cpu(split_rec->r_cpos) +
1857 le32_to_cpu(split_rec->r_clusters) ==
1858 le64_to_cpu(orig_rec->r_cpos) + le32_to_cpu(orig_rec->r_clusters)))
1864 * We need one more rec if we split in the middle and the new rec have
1865 * some refcount in it.
1867 if (split_rec->r_refcount &&
1868 (split_rec->r_cpos != orig_rec->r_cpos &&
1869 le64_to_cpu(split_rec->r_cpos) +
1870 le32_to_cpu(split_rec->r_clusters) !=
1871 le64_to_cpu(orig_rec->r_cpos) + le32_to_cpu(orig_rec->r_clusters)))
1874 /* If the leaf block don't have enough record, expand it. */
1875 if (le16_to_cpu(rf_list->rl_used) + recs_need >
1876 le16_to_cpu(rf_list->rl_count)) {
1877 struct ocfs2_refcount_rec tmp_rec;
1878 u64 cpos = le64_to_cpu(orig_rec->r_cpos);
1879 len = le32_to_cpu(orig_rec->r_clusters);
1880 ret = ocfs2_expand_refcount_tree(handle, ci, ref_root_bh,
1881 ref_leaf_bh, meta_ac);
1888 * We have to re-get it since now cpos may be moved to
1889 * another leaf block.
1891 ret = ocfs2_get_refcount_rec(ci, ref_root_bh,
1892 cpos, len, &tmp_rec, &index,
1899 ref_leaf_bh = new_bh;
1900 rb = (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
1901 rf_list = &rb->rf_records;
1902 orig_rec = &rf_list->rl_recs[index];
1905 ret = ocfs2_journal_access_rb(handle, ci, ref_leaf_bh,
1906 OCFS2_JOURNAL_ACCESS_WRITE);
1913 * We have calculated out how many new records we need and store
1914 * in recs_need, so spare enough space first by moving the records
1915 * after "index" to the end.
1917 if (index != le16_to_cpu(rf_list->rl_used) - 1)
1918 memmove(&rf_list->rl_recs[index + 1 + recs_need],
1919 &rf_list->rl_recs[index + 1],
1920 (le16_to_cpu(rf_list->rl_used) - index - 1) *
1921 sizeof(struct ocfs2_refcount_rec));
1923 len = (le64_to_cpu(orig_rec->r_cpos) +
1924 le32_to_cpu(orig_rec->r_clusters)) -
1925 (le64_to_cpu(split_rec->r_cpos) +
1926 le32_to_cpu(split_rec->r_clusters));
1929 * If we have "len", the we will split in the tail and move it
1930 * to the end of the space we have just spared.
1933 tail_rec = &rf_list->rl_recs[index + recs_need];
1935 memcpy(tail_rec, orig_rec, sizeof(struct ocfs2_refcount_rec));
1936 le64_add_cpu(&tail_rec->r_cpos,
1937 le32_to_cpu(tail_rec->r_clusters) - len);
1938 tail_rec->r_clusters = cpu_to_le32(len);
1942 * If the split pos isn't the same as the original one, we need to
1943 * split in the head.
1945 * Note: We have the chance that split_rec.r_refcount = 0,
1946 * recs_need = 0 and len > 0, which means we just cut the head from
1947 * the orig_rec and in that case we have done some modification in
1948 * orig_rec above, so the check for r_cpos is faked.
1950 if (split_rec->r_cpos != orig_rec->r_cpos && tail_rec != orig_rec) {
1951 len = le64_to_cpu(split_rec->r_cpos) -
1952 le64_to_cpu(orig_rec->r_cpos);
1953 orig_rec->r_clusters = cpu_to_le32(len);
1957 le16_add_cpu(&rf_list->rl_used, recs_need);
1959 if (split_rec->r_refcount) {
1960 rf_list->rl_recs[index] = *split_rec;
1961 trace_ocfs2_split_refcount_rec_insert(
1962 (unsigned long long)ref_leaf_bh->b_blocknr, index,
1963 (unsigned long long)le64_to_cpu(split_rec->r_cpos),
1964 le32_to_cpu(split_rec->r_clusters),
1965 le32_to_cpu(split_rec->r_refcount));
1968 ocfs2_refcount_rec_merge(rb, index);
1971 ocfs2_journal_dirty(handle, ref_leaf_bh);
1978 static int __ocfs2_increase_refcount(handle_t *handle,
1979 struct ocfs2_caching_info *ci,
1980 struct buffer_head *ref_root_bh,
1981 u64 cpos, u32 len, int merge,
1982 struct ocfs2_alloc_context *meta_ac,
1983 struct ocfs2_cached_dealloc_ctxt *dealloc)
1986 struct buffer_head *ref_leaf_bh = NULL;
1987 struct ocfs2_refcount_rec rec;
1988 unsigned int set_len = 0;
1990 trace_ocfs2_increase_refcount_begin(
1991 (unsigned long long)ocfs2_metadata_cache_owner(ci),
1992 (unsigned long long)cpos, len);
1995 ret = ocfs2_get_refcount_rec(ci, ref_root_bh,
1996 cpos, len, &rec, &index,
2003 set_len = le32_to_cpu(rec.r_clusters);
2006 * Here we may meet with 3 situations:
2008 * 1. If we find an already existing record, and the length
2009 * is the same, cool, we just need to increase the r_refcount
2011 * 2. If we find a hole, just insert it with r_refcount = 1.
2012 * 3. If we are in the middle of one extent record, split
2015 if (rec.r_refcount && le64_to_cpu(rec.r_cpos) == cpos &&
2017 trace_ocfs2_increase_refcount_change(
2018 (unsigned long long)cpos, set_len,
2019 le32_to_cpu(rec.r_refcount));
2020 ret = ocfs2_change_refcount_rec(handle, ci,
2027 } else if (!rec.r_refcount) {
2028 rec.r_refcount = cpu_to_le32(1);
2030 trace_ocfs2_increase_refcount_insert(
2031 (unsigned long long)le64_to_cpu(rec.r_cpos),
2033 ret = ocfs2_insert_refcount_rec(handle, ci, ref_root_bh,
2042 set_len = min((u64)(cpos + len),
2043 le64_to_cpu(rec.r_cpos) + set_len) - cpos;
2044 rec.r_cpos = cpu_to_le64(cpos);
2045 rec.r_clusters = cpu_to_le32(set_len);
2046 le32_add_cpu(&rec.r_refcount, 1);
2048 trace_ocfs2_increase_refcount_split(
2049 (unsigned long long)le64_to_cpu(rec.r_cpos),
2050 set_len, le32_to_cpu(rec.r_refcount));
2051 ret = ocfs2_split_refcount_rec(handle, ci,
2052 ref_root_bh, ref_leaf_bh,
2063 brelse(ref_leaf_bh);
2068 brelse(ref_leaf_bh);
2072 static int ocfs2_remove_refcount_extent(handle_t *handle,
2073 struct ocfs2_caching_info *ci,
2074 struct buffer_head *ref_root_bh,
2075 struct buffer_head *ref_leaf_bh,
2076 struct ocfs2_alloc_context *meta_ac,
2077 struct ocfs2_cached_dealloc_ctxt *dealloc)
2080 struct super_block *sb = ocfs2_metadata_cache_get_super(ci);
2081 struct ocfs2_refcount_block *rb =
2082 (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
2083 struct ocfs2_extent_tree et;
2085 BUG_ON(rb->rf_records.rl_used);
2087 trace_ocfs2_remove_refcount_extent(
2088 (unsigned long long)ocfs2_metadata_cache_owner(ci),
2089 (unsigned long long)ref_leaf_bh->b_blocknr,
2090 le32_to_cpu(rb->rf_cpos));
2092 ocfs2_init_refcount_extent_tree(&et, ci, ref_root_bh);
2093 ret = ocfs2_remove_extent(handle, &et, le32_to_cpu(rb->rf_cpos),
2094 1, meta_ac, dealloc);
2100 ocfs2_remove_from_cache(ci, ref_leaf_bh);
2103 * add the freed block to the dealloc so that it will be freed
2104 * when we run dealloc.
2106 ret = ocfs2_cache_block_dealloc(dealloc, EXTENT_ALLOC_SYSTEM_INODE,
2107 le16_to_cpu(rb->rf_suballoc_slot),
2108 le64_to_cpu(rb->rf_suballoc_loc),
2109 le64_to_cpu(rb->rf_blkno),
2110 le16_to_cpu(rb->rf_suballoc_bit));
2116 ret = ocfs2_journal_access_rb(handle, ci, ref_root_bh,
2117 OCFS2_JOURNAL_ACCESS_WRITE);
2123 rb = (struct ocfs2_refcount_block *)ref_root_bh->b_data;
2125 le32_add_cpu(&rb->rf_clusters, -1);
2128 * check whether we need to restore the root refcount block if
2129 * there is no leaf extent block at atll.
2131 if (!rb->rf_list.l_next_free_rec) {
2132 BUG_ON(rb->rf_clusters);
2134 trace_ocfs2_restore_refcount_block(
2135 (unsigned long long)ref_root_bh->b_blocknr);
2140 memset(&rb->rf_records, 0, sb->s_blocksize -
2141 offsetof(struct ocfs2_refcount_block, rf_records));
2142 rb->rf_records.rl_count =
2143 cpu_to_le16(ocfs2_refcount_recs_per_rb(sb));
2146 ocfs2_journal_dirty(handle, ref_root_bh);
2152 int ocfs2_increase_refcount(handle_t *handle,
2153 struct ocfs2_caching_info *ci,
2154 struct buffer_head *ref_root_bh,
2156 struct ocfs2_alloc_context *meta_ac,
2157 struct ocfs2_cached_dealloc_ctxt *dealloc)
2159 return __ocfs2_increase_refcount(handle, ci, ref_root_bh,
2164 static int ocfs2_decrease_refcount_rec(handle_t *handle,
2165 struct ocfs2_caching_info *ci,
2166 struct buffer_head *ref_root_bh,
2167 struct buffer_head *ref_leaf_bh,
2168 int index, u64 cpos, unsigned int len,
2169 struct ocfs2_alloc_context *meta_ac,
2170 struct ocfs2_cached_dealloc_ctxt *dealloc)
2173 struct ocfs2_refcount_block *rb =
2174 (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
2175 struct ocfs2_refcount_rec *rec = &rb->rf_records.rl_recs[index];
2177 BUG_ON(cpos < le64_to_cpu(rec->r_cpos));
2179 le64_to_cpu(rec->r_cpos) + le32_to_cpu(rec->r_clusters));
2181 trace_ocfs2_decrease_refcount_rec(
2182 (unsigned long long)ocfs2_metadata_cache_owner(ci),
2183 (unsigned long long)cpos, len);
2185 if (cpos == le64_to_cpu(rec->r_cpos) &&
2186 len == le32_to_cpu(rec->r_clusters))
2187 ret = ocfs2_change_refcount_rec(handle, ci,
2188 ref_leaf_bh, index, 1, -1);
2190 struct ocfs2_refcount_rec split = *rec;
2191 split.r_cpos = cpu_to_le64(cpos);
2192 split.r_clusters = cpu_to_le32(len);
2194 le32_add_cpu(&split.r_refcount, -1);
2196 ret = ocfs2_split_refcount_rec(handle, ci,
2197 ref_root_bh, ref_leaf_bh,
2207 /* Remove the leaf refcount block if it contains no refcount record. */
2208 if (!rb->rf_records.rl_used && ref_leaf_bh != ref_root_bh) {
2209 ret = ocfs2_remove_refcount_extent(handle, ci, ref_root_bh,
2210 ref_leaf_bh, meta_ac,
2220 static int __ocfs2_decrease_refcount(handle_t *handle,
2221 struct ocfs2_caching_info *ci,
2222 struct buffer_head *ref_root_bh,
2224 struct ocfs2_alloc_context *meta_ac,
2225 struct ocfs2_cached_dealloc_ctxt *dealloc,
2228 int ret = 0, index = 0;
2229 struct ocfs2_refcount_rec rec;
2230 unsigned int r_count = 0, r_len;
2231 struct super_block *sb = ocfs2_metadata_cache_get_super(ci);
2232 struct buffer_head *ref_leaf_bh = NULL;
2234 trace_ocfs2_decrease_refcount(
2235 (unsigned long long)ocfs2_metadata_cache_owner(ci),
2236 (unsigned long long)cpos, len, delete);
2239 ret = ocfs2_get_refcount_rec(ci, ref_root_bh,
2240 cpos, len, &rec, &index,
2247 r_count = le32_to_cpu(rec.r_refcount);
2248 BUG_ON(r_count == 0);
2250 BUG_ON(r_count > 1);
2252 r_len = min((u64)(cpos + len), le64_to_cpu(rec.r_cpos) +
2253 le32_to_cpu(rec.r_clusters)) - cpos;
2255 ret = ocfs2_decrease_refcount_rec(handle, ci, ref_root_bh,
2264 if (le32_to_cpu(rec.r_refcount) == 1 && delete) {
2265 ret = ocfs2_cache_cluster_dealloc(dealloc,
2266 ocfs2_clusters_to_blocks(sb, cpos),
2276 brelse(ref_leaf_bh);
2281 brelse(ref_leaf_bh);
2285 /* Caller must hold refcount tree lock. */
2286 int ocfs2_decrease_refcount(struct inode *inode,
2287 handle_t *handle, u32 cpos, u32 len,
2288 struct ocfs2_alloc_context *meta_ac,
2289 struct ocfs2_cached_dealloc_ctxt *dealloc,
2294 struct buffer_head *ref_root_bh = NULL;
2295 struct ocfs2_refcount_tree *tree;
2297 BUG_ON(!ocfs2_is_refcount_inode(inode));
2299 ret = ocfs2_get_refcount_block(inode, &ref_blkno);
2305 ret = ocfs2_get_refcount_tree(OCFS2_SB(inode->i_sb), ref_blkno, &tree);
2311 ret = ocfs2_read_refcount_block(&tree->rf_ci, tree->rf_blkno,
2318 ret = __ocfs2_decrease_refcount(handle, &tree->rf_ci, ref_root_bh,
2319 cpos, len, meta_ac, dealloc, delete);
2323 brelse(ref_root_bh);
2328 * Mark the already-existing extent at cpos as refcounted for len clusters.
2329 * This adds the refcount extent flag.
2331 * If the existing extent is larger than the request, initiate a
2332 * split. An attempt will be made at merging with adjacent extents.
2334 * The caller is responsible for passing down meta_ac if we'll need it.
2336 static int ocfs2_mark_extent_refcounted(struct inode *inode,
2337 struct ocfs2_extent_tree *et,
2338 handle_t *handle, u32 cpos,
2340 struct ocfs2_alloc_context *meta_ac,
2341 struct ocfs2_cached_dealloc_ctxt *dealloc)
2345 trace_ocfs2_mark_extent_refcounted(OCFS2_I(inode)->ip_blkno,
2348 if (!ocfs2_refcount_tree(OCFS2_SB(inode->i_sb))) {
2349 ret = ocfs2_error(inode->i_sb, "Inode %lu want to use refcount tree, but the feature bit is not set in the super block\n",
2354 ret = ocfs2_change_extent_flag(handle, et, cpos,
2355 len, phys, meta_ac, dealloc,
2356 OCFS2_EXT_REFCOUNTED, 0);
2365 * Given some contiguous physical clusters, calculate what we need
2366 * for modifying their refcount.
2368 static int ocfs2_calc_refcount_meta_credits(struct super_block *sb,
2369 struct ocfs2_caching_info *ci,
2370 struct buffer_head *ref_root_bh,
2376 int ret = 0, index, ref_blocks = 0, recs_add = 0;
2377 u64 cpos = start_cpos;
2378 struct ocfs2_refcount_block *rb;
2379 struct ocfs2_refcount_rec rec;
2380 struct buffer_head *ref_leaf_bh = NULL, *prev_bh = NULL;
2384 ret = ocfs2_get_refcount_rec(ci, ref_root_bh,
2385 cpos, clusters, &rec,
2386 &index, &ref_leaf_bh);
2392 if (ref_leaf_bh != prev_bh) {
2394 * Now we encounter a new leaf block, so calculate
2395 * whether we need to extend the old leaf.
2398 rb = (struct ocfs2_refcount_block *)
2401 if (le16_to_cpu(rb->rf_records.rl_used) +
2403 le16_to_cpu(rb->rf_records.rl_count))
2410 prev_bh = ref_leaf_bh;
2414 trace_ocfs2_calc_refcount_meta_credits_iterate(
2415 recs_add, (unsigned long long)cpos, clusters,
2416 (unsigned long long)le64_to_cpu(rec.r_cpos),
2417 le32_to_cpu(rec.r_clusters),
2418 le32_to_cpu(rec.r_refcount), index);
2420 len = min((u64)cpos + clusters, le64_to_cpu(rec.r_cpos) +
2421 le32_to_cpu(rec.r_clusters)) - cpos;
2423 * We record all the records which will be inserted to the
2424 * same refcount block, so that we can tell exactly whether
2425 * we need a new refcount block or not.
2427 * If we will insert a new one, this is easy and only happens
2428 * during adding refcounted flag to the extent, so we don't
2429 * have a chance of spliting. We just need one record.
2431 * If the refcount rec already exists, that would be a little
2432 * complicated. we may have to:
2433 * 1) split at the beginning if the start pos isn't aligned.
2434 * we need 1 more record in this case.
2435 * 2) split int the end if the end pos isn't aligned.
2436 * we need 1 more record in this case.
2437 * 3) split in the middle because of file system fragmentation.
2438 * we need 2 more records in this case(we can't detect this
2439 * beforehand, so always think of the worst case).
2441 if (rec.r_refcount) {
2443 /* Check whether we need a split at the beginning. */
2444 if (cpos == start_cpos &&
2445 cpos != le64_to_cpu(rec.r_cpos))
2448 /* Check whether we need a split in the end. */
2449 if (cpos + clusters < le64_to_cpu(rec.r_cpos) +
2450 le32_to_cpu(rec.r_clusters))
2455 brelse(ref_leaf_bh);
2462 rb = (struct ocfs2_refcount_block *)prev_bh->b_data;
2464 if (le16_to_cpu(rb->rf_records.rl_used) + recs_add >
2465 le16_to_cpu(rb->rf_records.rl_count))
2474 *meta_add += ref_blocks;
2475 *credits += ref_blocks;
2478 * So we may need ref_blocks to insert into the tree.
2479 * That also means we need to change the b-tree and add that number
2480 * of records since we never merge them.
2481 * We need one more block for expansion since the new created leaf
2482 * block is also full and needs split.
2484 rb = (struct ocfs2_refcount_block *)ref_root_bh->b_data;
2485 if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL) {
2486 struct ocfs2_extent_tree et;
2488 ocfs2_init_refcount_extent_tree(&et, ci, ref_root_bh);
2489 *meta_add += ocfs2_extend_meta_needed(et.et_root_el);
2490 *credits += ocfs2_calc_extend_credits(sb,
2493 *credits += OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
2499 trace_ocfs2_calc_refcount_meta_credits(
2500 (unsigned long long)start_cpos, clusters,
2501 *meta_add, *credits);
2502 brelse(ref_leaf_bh);
2508 * For refcount tree, we will decrease some contiguous clusters
2509 * refcount count, so just go through it to see how many blocks
2510 * we gonna touch and whether we need to create new blocks.
2512 * Normally the refcount blocks store these refcount should be
2513 * contiguous also, so that we can get the number easily.
2514 * We will at most add split 2 refcount records and 2 more
2515 * refcount blocks, so just check it in a rough way.
2517 * Caller must hold refcount tree lock.
2519 int ocfs2_prepare_refcount_change_for_del(struct inode *inode,
2527 struct buffer_head *ref_root_bh = NULL;
2528 struct ocfs2_refcount_tree *tree;
2529 u64 start_cpos = ocfs2_blocks_to_clusters(inode->i_sb, phys_blkno);
2531 if (!ocfs2_refcount_tree(OCFS2_SB(inode->i_sb))) {
2532 ret = ocfs2_error(inode->i_sb, "Inode %lu want to use refcount tree, but the feature bit is not set in the super block\n",
2537 BUG_ON(!ocfs2_is_refcount_inode(inode));
2539 ret = ocfs2_get_refcount_tree(OCFS2_SB(inode->i_sb),
2540 refcount_loc, &tree);
2546 ret = ocfs2_read_refcount_block(&tree->rf_ci, refcount_loc,
2553 ret = ocfs2_calc_refcount_meta_credits(inode->i_sb,
2556 start_cpos, clusters,
2557 ref_blocks, credits);
2563 trace_ocfs2_prepare_refcount_change_for_del(*ref_blocks, *credits);
2566 brelse(ref_root_bh);
2570 #define MAX_CONTIG_BYTES 1048576
2572 static inline unsigned int ocfs2_cow_contig_clusters(struct super_block *sb)
2574 return ocfs2_clusters_for_bytes(sb, MAX_CONTIG_BYTES);
2577 static inline unsigned int ocfs2_cow_contig_mask(struct super_block *sb)
2579 return ~(ocfs2_cow_contig_clusters(sb) - 1);
2583 * Given an extent that starts at 'start' and an I/O that starts at 'cpos',
2584 * find an offset (start + (n * contig_clusters)) that is closest to cpos
2585 * while still being less than or equal to it.
2587 * The goal is to break the extent at a multiple of contig_clusters.
2589 static inline unsigned int ocfs2_cow_align_start(struct super_block *sb,
2593 BUG_ON(start > cpos);
2595 return start + ((cpos - start) & ocfs2_cow_contig_mask(sb));
2599 * Given a cluster count of len, pad it out so that it is a multiple
2600 * of contig_clusters.
2602 static inline unsigned int ocfs2_cow_align_length(struct super_block *sb,
2605 unsigned int padded =
2606 (len + (ocfs2_cow_contig_clusters(sb) - 1)) &
2607 ocfs2_cow_contig_mask(sb);
2617 * Calculate out the start and number of virtual clusters we need to CoW.
2619 * cpos is vitual start cluster position we want to do CoW in a
2620 * file and write_len is the cluster length.
2621 * max_cpos is the place where we want to stop CoW intentionally.
2623 * Normal we will start CoW from the beginning of extent record cotaining cpos.
2624 * We try to break up extents on boundaries of MAX_CONTIG_BYTES so that we
2625 * get good I/O from the resulting extent tree.
2627 static int ocfs2_refcount_cal_cow_clusters(struct inode *inode,
2628 struct ocfs2_extent_list *el,
2636 int tree_height = le16_to_cpu(el->l_tree_depth), i;
2637 struct buffer_head *eb_bh = NULL;
2638 struct ocfs2_extent_block *eb = NULL;
2639 struct ocfs2_extent_rec *rec;
2640 unsigned int want_clusters, rec_end = 0;
2641 int contig_clusters = ocfs2_cow_contig_clusters(inode->i_sb);
2644 BUG_ON(cpos + write_len > max_cpos);
2646 if (tree_height > 0) {
2647 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, cpos, &eb_bh);
2653 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
2656 if (el->l_tree_depth) {
2657 ret = ocfs2_error(inode->i_sb,
2658 "Inode %lu has non zero tree depth in leaf block %llu\n",
2660 (unsigned long long)eb_bh->b_blocknr);
2666 for (i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
2667 rec = &el->l_recs[i];
2669 if (ocfs2_is_empty_extent(rec)) {
2670 mlog_bug_on_msg(i != 0, "Inode %lu has empty record in "
2671 "index %d\n", inode->i_ino, i);
2675 if (le32_to_cpu(rec->e_cpos) +
2676 le16_to_cpu(rec->e_leaf_clusters) <= cpos)
2679 if (*cow_len == 0) {
2681 * We should find a refcounted record in the
2684 BUG_ON(!(rec->e_flags & OCFS2_EXT_REFCOUNTED));
2685 *cow_start = le32_to_cpu(rec->e_cpos);
2689 * If we encounter a hole, a non-refcounted record or
2690 * pass the max_cpos, stop the search.
2692 if ((!(rec->e_flags & OCFS2_EXT_REFCOUNTED)) ||
2693 (*cow_len && rec_end != le32_to_cpu(rec->e_cpos)) ||
2694 (max_cpos <= le32_to_cpu(rec->e_cpos)))
2697 leaf_clusters = le16_to_cpu(rec->e_leaf_clusters);
2698 rec_end = le32_to_cpu(rec->e_cpos) + leaf_clusters;
2699 if (rec_end > max_cpos) {
2701 leaf_clusters = rec_end - le32_to_cpu(rec->e_cpos);
2705 * How many clusters do we actually need from
2706 * this extent? First we see how many we actually
2707 * need to complete the write. If that's smaller
2708 * than contig_clusters, we try for contig_clusters.
2711 want_clusters = write_len;
2713 want_clusters = (cpos + write_len) -
2714 (*cow_start + *cow_len);
2715 if (want_clusters < contig_clusters)
2716 want_clusters = contig_clusters;
2719 * If the write does not cover the whole extent, we
2720 * need to calculate how we're going to split the extent.
2721 * We try to do it on contig_clusters boundaries.
2723 * Any extent smaller than contig_clusters will be
2724 * CoWed in its entirety.
2726 if (leaf_clusters <= contig_clusters)
2727 *cow_len += leaf_clusters;
2728 else if (*cow_len || (*cow_start == cpos)) {
2730 * This extent needs to be CoW'd from its
2731 * beginning, so all we have to do is compute
2732 * how many clusters to grab. We align
2733 * want_clusters to the edge of contig_clusters
2734 * to get better I/O.
2736 want_clusters = ocfs2_cow_align_length(inode->i_sb,
2739 if (leaf_clusters < want_clusters)
2740 *cow_len += leaf_clusters;
2742 *cow_len += want_clusters;
2743 } else if ((*cow_start + contig_clusters) >=
2744 (cpos + write_len)) {
2746 * Breaking off contig_clusters at the front
2747 * of the extent will cover our write. That's
2750 *cow_len = contig_clusters;
2751 } else if ((rec_end - cpos) <= contig_clusters) {
2753 * Breaking off contig_clusters at the tail of
2754 * this extent will cover cpos.
2756 *cow_start = rec_end - contig_clusters;
2757 *cow_len = contig_clusters;
2758 } else if ((rec_end - cpos) <= want_clusters) {
2760 * While we can't fit the entire write in this
2761 * extent, we know that the write goes from cpos
2762 * to the end of the extent. Break that off.
2763 * We try to break it at some multiple of
2764 * contig_clusters from the front of the extent.
2765 * Failing that (ie, cpos is within
2766 * contig_clusters of the front), we'll CoW the
2769 *cow_start = ocfs2_cow_align_start(inode->i_sb,
2771 *cow_len = rec_end - *cow_start;
2774 * Ok, the entire write lives in the middle of
2775 * this extent. Let's try to slice the extent up
2776 * nicely. Optimally, our CoW region starts at
2777 * m*contig_clusters from the beginning of the
2778 * extent and goes for n*contig_clusters,
2779 * covering the entire write.
2781 *cow_start = ocfs2_cow_align_start(inode->i_sb,
2784 want_clusters = (cpos + write_len) - *cow_start;
2785 want_clusters = ocfs2_cow_align_length(inode->i_sb,
2787 if (*cow_start + want_clusters <= rec_end)
2788 *cow_len = want_clusters;
2790 *cow_len = rec_end - *cow_start;
2793 /* Have we covered our entire write yet? */
2794 if ((*cow_start + *cow_len) >= (cpos + write_len))
2798 * If we reach the end of the extent block and don't get enough
2799 * clusters, continue with the next extent block if possible.
2801 if (i + 1 == le16_to_cpu(el->l_next_free_rec) &&
2802 eb && eb->h_next_leaf_blk) {
2806 ret = ocfs2_read_extent_block(INODE_CACHE(inode),
2807 le64_to_cpu(eb->h_next_leaf_blk),
2814 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
2826 * Prepare meta_ac, data_ac and calculate credits when we want to add some
2827 * num_clusters in data_tree "et" and change the refcount for the old
2828 * clusters(starting form p_cluster) in the refcount tree.
2831 * 1. since we may split the old tree, so we at most will need num_clusters + 2
2832 * more new leaf records.
2833 * 2. In some case, we may not need to reserve new clusters(e.g, reflink), so
2834 * just give data_ac = NULL.
2836 static int ocfs2_lock_refcount_allocators(struct super_block *sb,
2837 u32 p_cluster, u32 num_clusters,
2838 struct ocfs2_extent_tree *et,
2839 struct ocfs2_caching_info *ref_ci,
2840 struct buffer_head *ref_root_bh,
2841 struct ocfs2_alloc_context **meta_ac,
2842 struct ocfs2_alloc_context **data_ac,
2845 int ret = 0, meta_add = 0;
2846 int num_free_extents = ocfs2_num_free_extents(et);
2848 if (num_free_extents < 0) {
2849 ret = num_free_extents;
2854 if (num_free_extents < num_clusters + 2)
2856 ocfs2_extend_meta_needed(et->et_root_el);
2858 *credits += ocfs2_calc_extend_credits(sb, et->et_root_el);
2860 ret = ocfs2_calc_refcount_meta_credits(sb, ref_ci, ref_root_bh,
2861 p_cluster, num_clusters,
2862 &meta_add, credits);
2868 trace_ocfs2_lock_refcount_allocators(meta_add, *credits);
2869 ret = ocfs2_reserve_new_metadata_blocks(OCFS2_SB(sb), meta_add,
2877 ret = ocfs2_reserve_clusters(OCFS2_SB(sb), num_clusters,
2886 ocfs2_free_alloc_context(*meta_ac);
2894 static int ocfs2_clear_cow_buffer(handle_t *handle, struct buffer_head *bh)
2896 BUG_ON(buffer_dirty(bh));
2898 clear_buffer_mapped(bh);
2903 int ocfs2_duplicate_clusters_by_page(handle_t *handle,
2904 struct inode *inode,
2905 u32 cpos, u32 old_cluster,
2906 u32 new_cluster, u32 new_len)
2908 int ret = 0, partial;
2909 struct super_block *sb = inode->i_sb;
2910 u64 new_block = ocfs2_clusters_to_blocks(sb, new_cluster);
2913 unsigned int from, to;
2914 loff_t offset, end, map_end;
2915 struct address_space *mapping = inode->i_mapping;
2917 trace_ocfs2_duplicate_clusters_by_page(cpos, old_cluster,
2918 new_cluster, new_len);
2920 offset = ((loff_t)cpos) << OCFS2_SB(sb)->s_clustersize_bits;
2921 end = offset + (new_len << OCFS2_SB(sb)->s_clustersize_bits);
2923 * We only duplicate pages until we reach the page contains i_size - 1.
2924 * So trim 'end' to i_size.
2926 if (end > i_size_read(inode))
2927 end = i_size_read(inode);
2929 while (offset < end) {
2930 page_index = offset >> PAGE_SHIFT;
2931 map_end = ((loff_t)page_index + 1) << PAGE_SHIFT;
2935 /* from, to is the offset within the page. */
2936 from = offset & (PAGE_SIZE - 1);
2938 if (map_end & (PAGE_SIZE - 1))
2939 to = map_end & (PAGE_SIZE - 1);
2942 page = find_or_create_page(mapping, page_index, GFP_NOFS);
2950 * In case PAGE_SIZE <= CLUSTER_SIZE, we do not expect a dirty
2951 * page, so write it back.
2953 if (PAGE_SIZE <= OCFS2_SB(sb)->s_clustersize) {
2954 if (PageDirty(page)) {
2958 ret = filemap_write_and_wait_range(mapping,
2959 offset, map_end - 1);
2964 if (!PageUptodate(page)) {
2965 struct folio *folio = page_folio(page);
2967 ret = block_read_full_folio(folio, ocfs2_get_block);
2975 if (page_has_buffers(page)) {
2976 ret = walk_page_buffers(handle, page_buffers(page),
2978 ocfs2_clear_cow_buffer);
2985 ocfs2_map_and_dirty_page(inode,
2987 page, 0, &new_block);
2988 mark_page_accessed(page);
3001 int ocfs2_duplicate_clusters_by_jbd(handle_t *handle,
3002 struct inode *inode,
3003 u32 cpos, u32 old_cluster,
3004 u32 new_cluster, u32 new_len)
3007 struct super_block *sb = inode->i_sb;
3008 struct ocfs2_caching_info *ci = INODE_CACHE(inode);
3009 int i, blocks = ocfs2_clusters_to_blocks(sb, new_len);
3010 u64 old_block = ocfs2_clusters_to_blocks(sb, old_cluster);
3011 u64 new_block = ocfs2_clusters_to_blocks(sb, new_cluster);
3012 struct ocfs2_super *osb = OCFS2_SB(sb);
3013 struct buffer_head *old_bh = NULL;
3014 struct buffer_head *new_bh = NULL;
3016 trace_ocfs2_duplicate_clusters_by_page(cpos, old_cluster,
3017 new_cluster, new_len);
3019 for (i = 0; i < blocks; i++, old_block++, new_block++) {
3020 new_bh = sb_getblk(osb->sb, new_block);
3021 if (new_bh == NULL) {
3027 ocfs2_set_new_buffer_uptodate(ci, new_bh);
3029 ret = ocfs2_read_block(ci, old_block, &old_bh, NULL);
3035 ret = ocfs2_journal_access(handle, ci, new_bh,
3036 OCFS2_JOURNAL_ACCESS_CREATE);
3042 memcpy(new_bh->b_data, old_bh->b_data, sb->s_blocksize);
3043 ocfs2_journal_dirty(handle, new_bh);
3056 static int ocfs2_clear_ext_refcount(handle_t *handle,
3057 struct ocfs2_extent_tree *et,
3058 u32 cpos, u32 p_cluster, u32 len,
3059 unsigned int ext_flags,
3060 struct ocfs2_alloc_context *meta_ac,
3061 struct ocfs2_cached_dealloc_ctxt *dealloc)
3064 struct ocfs2_extent_rec replace_rec;
3065 struct ocfs2_path *path = NULL;
3066 struct ocfs2_extent_list *el;
3067 struct super_block *sb = ocfs2_metadata_cache_get_super(et->et_ci);
3068 u64 ino = ocfs2_metadata_cache_owner(et->et_ci);
3070 trace_ocfs2_clear_ext_refcount((unsigned long long)ino,
3071 cpos, len, p_cluster, ext_flags);
3073 memset(&replace_rec, 0, sizeof(replace_rec));
3074 replace_rec.e_cpos = cpu_to_le32(cpos);
3075 replace_rec.e_leaf_clusters = cpu_to_le16(len);
3076 replace_rec.e_blkno = cpu_to_le64(ocfs2_clusters_to_blocks(sb,
3078 replace_rec.e_flags = ext_flags;
3079 replace_rec.e_flags &= ~OCFS2_EXT_REFCOUNTED;
3081 path = ocfs2_new_path_from_et(et);
3088 ret = ocfs2_find_path(et->et_ci, path, cpos);
3094 el = path_leaf_el(path);
3096 index = ocfs2_search_extent_list(el, cpos);
3098 ret = ocfs2_error(sb,
3099 "Inode %llu has an extent at cpos %u which can no longer be found\n",
3100 (unsigned long long)ino, cpos);
3104 ret = ocfs2_split_extent(handle, et, path, index,
3105 &replace_rec, meta_ac, dealloc);
3110 ocfs2_free_path(path);
3114 static int ocfs2_replace_clusters(handle_t *handle,
3115 struct ocfs2_cow_context *context,
3118 unsigned int ext_flags)
3121 struct ocfs2_caching_info *ci = context->data_et.et_ci;
3122 u64 ino = ocfs2_metadata_cache_owner(ci);
3124 trace_ocfs2_replace_clusters((unsigned long long)ino,
3125 cpos, old, new, len, ext_flags);
3127 /*If the old clusters is unwritten, no need to duplicate. */
3128 if (!(ext_flags & OCFS2_EXT_UNWRITTEN)) {
3129 ret = context->cow_duplicate_clusters(handle, context->inode,
3130 cpos, old, new, len);
3137 ret = ocfs2_clear_ext_refcount(handle, &context->data_et,
3138 cpos, new, len, ext_flags,
3139 context->meta_ac, &context->dealloc);
3146 int ocfs2_cow_sync_writeback(struct super_block *sb,
3147 struct inode *inode,
3148 u32 cpos, u32 num_clusters)
3153 if (ocfs2_should_order_data(inode))
3156 start = ((loff_t)cpos) << OCFS2_SB(sb)->s_clustersize_bits;
3157 end = start + (num_clusters << OCFS2_SB(sb)->s_clustersize_bits) - 1;
3159 ret = filemap_write_and_wait_range(inode->i_mapping, start, end);
3166 static int ocfs2_di_get_clusters(struct ocfs2_cow_context *context,
3167 u32 v_cluster, u32 *p_cluster,
3169 unsigned int *extent_flags)
3171 return ocfs2_get_clusters(context->inode, v_cluster, p_cluster,
3172 num_clusters, extent_flags);
3175 static int ocfs2_make_clusters_writable(struct super_block *sb,
3176 struct ocfs2_cow_context *context,
3177 u32 cpos, u32 p_cluster,
3178 u32 num_clusters, unsigned int e_flags)
3180 int ret, delete, index, credits = 0;
3181 u32 new_bit, new_len, orig_num_clusters;
3182 unsigned int set_len;
3183 struct ocfs2_super *osb = OCFS2_SB(sb);
3185 struct buffer_head *ref_leaf_bh = NULL;
3186 struct ocfs2_caching_info *ref_ci = &context->ref_tree->rf_ci;
3187 struct ocfs2_refcount_rec rec;
3189 trace_ocfs2_make_clusters_writable(cpos, p_cluster,
3190 num_clusters, e_flags);
3192 ret = ocfs2_lock_refcount_allocators(sb, p_cluster, num_clusters,
3195 context->ref_root_bh,
3197 &context->data_ac, &credits);
3203 if (context->post_refcount)
3204 credits += context->post_refcount->credits;
3206 credits += context->extra_credits;
3207 handle = ocfs2_start_trans(osb, credits);
3208 if (IS_ERR(handle)) {
3209 ret = PTR_ERR(handle);
3214 orig_num_clusters = num_clusters;
3216 while (num_clusters) {
3217 ret = ocfs2_get_refcount_rec(ref_ci, context->ref_root_bh,
3218 p_cluster, num_clusters,
3219 &rec, &index, &ref_leaf_bh);
3225 BUG_ON(!rec.r_refcount);
3226 set_len = min((u64)p_cluster + num_clusters,
3227 le64_to_cpu(rec.r_cpos) +
3228 le32_to_cpu(rec.r_clusters)) - p_cluster;
3231 * There are many different situation here.
3232 * 1. If refcount == 1, remove the flag and don't COW.
3233 * 2. If refcount > 1, allocate clusters.
3234 * Here we may not allocate r_len once at a time, so continue
3235 * until we reach num_clusters.
3237 if (le32_to_cpu(rec.r_refcount) == 1) {
3239 ret = ocfs2_clear_ext_refcount(handle,
3252 ret = __ocfs2_claim_clusters(handle,
3255 &new_bit, &new_len);
3261 ret = ocfs2_replace_clusters(handle, context,
3262 cpos, p_cluster, new_bit,
3271 ret = __ocfs2_decrease_refcount(handle, ref_ci,
3272 context->ref_root_bh,
3275 &context->dealloc, delete);
3282 p_cluster += set_len;
3283 num_clusters -= set_len;
3284 brelse(ref_leaf_bh);
3288 /* handle any post_cow action. */
3289 if (context->post_refcount && context->post_refcount->func) {
3290 ret = context->post_refcount->func(context->inode, handle,
3291 context->post_refcount->para);
3299 * Here we should write the new page out first if we are
3300 * in write-back mode.
3302 if (context->get_clusters == ocfs2_di_get_clusters) {
3303 ret = ocfs2_cow_sync_writeback(sb, context->inode, cpos,
3310 ocfs2_commit_trans(osb, handle);
3313 if (context->data_ac) {
3314 ocfs2_free_alloc_context(context->data_ac);
3315 context->data_ac = NULL;
3317 if (context->meta_ac) {
3318 ocfs2_free_alloc_context(context->meta_ac);
3319 context->meta_ac = NULL;
3321 brelse(ref_leaf_bh);
3326 static int ocfs2_replace_cow(struct ocfs2_cow_context *context)
3329 struct inode *inode = context->inode;
3330 u32 cow_start = context->cow_start, cow_len = context->cow_len;
3331 u32 p_cluster, num_clusters;
3332 unsigned int ext_flags;
3333 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3335 if (!ocfs2_refcount_tree(osb)) {
3336 return ocfs2_error(inode->i_sb, "Inode %lu want to use refcount tree, but the feature bit is not set in the super block\n",
3340 ocfs2_init_dealloc_ctxt(&context->dealloc);
3343 ret = context->get_clusters(context, cow_start, &p_cluster,
3344 &num_clusters, &ext_flags);
3350 BUG_ON(!(ext_flags & OCFS2_EXT_REFCOUNTED));
3352 if (cow_len < num_clusters)
3353 num_clusters = cow_len;
3355 ret = ocfs2_make_clusters_writable(inode->i_sb, context,
3356 cow_start, p_cluster,
3357 num_clusters, ext_flags);
3363 cow_len -= num_clusters;
3364 cow_start += num_clusters;
3367 if (ocfs2_dealloc_has_cluster(&context->dealloc)) {
3368 ocfs2_schedule_truncate_log_flush(osb, 1);
3369 ocfs2_run_deallocs(osb, &context->dealloc);
3376 * Starting at cpos, try to CoW write_len clusters. Don't CoW
3377 * past max_cpos. This will stop when it runs into a hole or an
3378 * unrefcounted extent.
3380 static int ocfs2_refcount_cow_hunk(struct inode *inode,
3381 struct buffer_head *di_bh,
3382 u32 cpos, u32 write_len, u32 max_cpos)
3385 u32 cow_start = 0, cow_len = 0;
3386 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3387 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
3388 struct buffer_head *ref_root_bh = NULL;
3389 struct ocfs2_refcount_tree *ref_tree;
3390 struct ocfs2_cow_context *context = NULL;
3392 BUG_ON(!ocfs2_is_refcount_inode(inode));
3394 ret = ocfs2_refcount_cal_cow_clusters(inode, &di->id2.i_list,
3395 cpos, write_len, max_cpos,
3396 &cow_start, &cow_len);
3402 trace_ocfs2_refcount_cow_hunk(OCFS2_I(inode)->ip_blkno,
3403 cpos, write_len, max_cpos,
3404 cow_start, cow_len);
3406 BUG_ON(cow_len == 0);
3408 context = kzalloc(sizeof(struct ocfs2_cow_context), GFP_NOFS);
3415 ret = ocfs2_lock_refcount_tree(osb, le64_to_cpu(di->i_refcount_loc),
3416 1, &ref_tree, &ref_root_bh);
3422 context->inode = inode;
3423 context->cow_start = cow_start;
3424 context->cow_len = cow_len;
3425 context->ref_tree = ref_tree;
3426 context->ref_root_bh = ref_root_bh;
3427 context->cow_duplicate_clusters = ocfs2_duplicate_clusters_by_page;
3428 context->get_clusters = ocfs2_di_get_clusters;
3430 ocfs2_init_dinode_extent_tree(&context->data_et,
3431 INODE_CACHE(inode), di_bh);
3433 ret = ocfs2_replace_cow(context);
3438 * truncate the extent map here since no matter whether we meet with
3439 * any error during the action, we shouldn't trust cached extent map
3442 ocfs2_extent_map_trunc(inode, cow_start);
3444 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
3445 brelse(ref_root_bh);
3452 * CoW any and all clusters between cpos and cpos+write_len.
3453 * Don't CoW past max_cpos. If this returns successfully, all
3454 * clusters between cpos and cpos+write_len are safe to modify.
3456 int ocfs2_refcount_cow(struct inode *inode,
3457 struct buffer_head *di_bh,
3458 u32 cpos, u32 write_len, u32 max_cpos)
3461 u32 p_cluster, num_clusters;
3462 unsigned int ext_flags;
3465 ret = ocfs2_get_clusters(inode, cpos, &p_cluster,
3466 &num_clusters, &ext_flags);
3472 if (write_len < num_clusters)
3473 num_clusters = write_len;
3475 if (ext_flags & OCFS2_EXT_REFCOUNTED) {
3476 ret = ocfs2_refcount_cow_hunk(inode, di_bh, cpos,
3477 num_clusters, max_cpos);
3484 write_len -= num_clusters;
3485 cpos += num_clusters;
3491 static int ocfs2_xattr_value_get_clusters(struct ocfs2_cow_context *context,
3492 u32 v_cluster, u32 *p_cluster,
3494 unsigned int *extent_flags)
3496 struct inode *inode = context->inode;
3497 struct ocfs2_xattr_value_root *xv = context->cow_object;
3499 return ocfs2_xattr_get_clusters(inode, v_cluster, p_cluster,
3500 num_clusters, &xv->xr_list,
3505 * Given a xattr value root, calculate the most meta/credits we need for
3506 * refcount tree change if we truncate it to 0.
3508 int ocfs2_refcounted_xattr_delete_need(struct inode *inode,
3509 struct ocfs2_caching_info *ref_ci,
3510 struct buffer_head *ref_root_bh,
3511 struct ocfs2_xattr_value_root *xv,
3512 int *meta_add, int *credits)
3514 int ret = 0, index, ref_blocks = 0;
3515 u32 p_cluster, num_clusters;
3516 u32 cpos = 0, clusters = le32_to_cpu(xv->xr_clusters);
3517 struct ocfs2_refcount_block *rb;
3518 struct ocfs2_refcount_rec rec;
3519 struct buffer_head *ref_leaf_bh = NULL;
3521 while (cpos < clusters) {
3522 ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
3523 &num_clusters, &xv->xr_list,
3530 cpos += num_clusters;
3532 while (num_clusters) {
3533 ret = ocfs2_get_refcount_rec(ref_ci, ref_root_bh,
3534 p_cluster, num_clusters,
3542 BUG_ON(!rec.r_refcount);
3544 rb = (struct ocfs2_refcount_block *)ref_leaf_bh->b_data;
3547 * We really don't know whether the other clusters is in
3548 * this refcount block or not, so just take the worst
3549 * case that all the clusters are in this block and each
3550 * one will split a refcount rec, so totally we need
3551 * clusters * 2 new refcount rec.
3553 if (le16_to_cpu(rb->rf_records.rl_used) + clusters * 2 >
3554 le16_to_cpu(rb->rf_records.rl_count))
3558 brelse(ref_leaf_bh);
3561 if (num_clusters <= le32_to_cpu(rec.r_clusters))
3564 num_clusters -= le32_to_cpu(rec.r_clusters);
3565 p_cluster += num_clusters;
3569 *meta_add += ref_blocks;
3573 rb = (struct ocfs2_refcount_block *)ref_root_bh->b_data;
3574 if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL)
3575 *credits += OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
3577 struct ocfs2_extent_tree et;
3579 ocfs2_init_refcount_extent_tree(&et, ref_ci, ref_root_bh);
3580 *credits += ocfs2_calc_extend_credits(inode->i_sb,
3585 brelse(ref_leaf_bh);
3592 int ocfs2_refcount_cow_xattr(struct inode *inode,
3593 struct ocfs2_dinode *di,
3594 struct ocfs2_xattr_value_buf *vb,
3595 struct ocfs2_refcount_tree *ref_tree,
3596 struct buffer_head *ref_root_bh,
3597 u32 cpos, u32 write_len,
3598 struct ocfs2_post_refcount *post)
3601 struct ocfs2_xattr_value_root *xv = vb->vb_xv;
3602 struct ocfs2_cow_context *context = NULL;
3603 u32 cow_start, cow_len;
3605 BUG_ON(!ocfs2_is_refcount_inode(inode));
3607 ret = ocfs2_refcount_cal_cow_clusters(inode, &xv->xr_list,
3608 cpos, write_len, UINT_MAX,
3609 &cow_start, &cow_len);
3615 BUG_ON(cow_len == 0);
3617 context = kzalloc(sizeof(struct ocfs2_cow_context), GFP_NOFS);
3624 context->inode = inode;
3625 context->cow_start = cow_start;
3626 context->cow_len = cow_len;
3627 context->ref_tree = ref_tree;
3628 context->ref_root_bh = ref_root_bh;
3629 context->cow_object = xv;
3631 context->cow_duplicate_clusters = ocfs2_duplicate_clusters_by_jbd;
3632 /* We need the extra credits for duplicate_clusters by jbd. */
3633 context->extra_credits =
3634 ocfs2_clusters_to_blocks(inode->i_sb, 1) * cow_len;
3635 context->get_clusters = ocfs2_xattr_value_get_clusters;
3636 context->post_refcount = post;
3638 ocfs2_init_xattr_value_extent_tree(&context->data_et,
3639 INODE_CACHE(inode), vb);
3641 ret = ocfs2_replace_cow(context);
3651 * Insert a new extent into refcount tree and mark a extent rec
3652 * as refcounted in the dinode tree.
3654 int ocfs2_add_refcount_flag(struct inode *inode,
3655 struct ocfs2_extent_tree *data_et,
3656 struct ocfs2_caching_info *ref_ci,
3657 struct buffer_head *ref_root_bh,
3658 u32 cpos, u32 p_cluster, u32 num_clusters,
3659 struct ocfs2_cached_dealloc_ctxt *dealloc,
3660 struct ocfs2_post_refcount *post)
3664 int credits = 1, ref_blocks = 0;
3665 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3666 struct ocfs2_alloc_context *meta_ac = NULL;
3668 /* We need to be able to handle at least an extent tree split. */
3669 ref_blocks = ocfs2_extend_meta_needed(data_et->et_root_el);
3671 ret = ocfs2_calc_refcount_meta_credits(inode->i_sb,
3672 ref_ci, ref_root_bh,
3673 p_cluster, num_clusters,
3674 &ref_blocks, &credits);
3680 trace_ocfs2_add_refcount_flag(ref_blocks, credits);
3683 ret = ocfs2_reserve_new_metadata_blocks(osb,
3684 ref_blocks, &meta_ac);
3692 credits += post->credits;
3694 handle = ocfs2_start_trans(osb, credits);
3695 if (IS_ERR(handle)) {
3696 ret = PTR_ERR(handle);
3701 ret = ocfs2_mark_extent_refcounted(inode, data_et, handle,
3702 cpos, num_clusters, p_cluster,
3709 ret = __ocfs2_increase_refcount(handle, ref_ci, ref_root_bh,
3710 p_cluster, num_clusters, 0,
3717 if (post && post->func) {
3718 ret = post->func(inode, handle, post->para);
3724 ocfs2_commit_trans(osb, handle);
3727 ocfs2_free_alloc_context(meta_ac);
3731 static int ocfs2_change_ctime(struct inode *inode,
3732 struct buffer_head *di_bh)
3736 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
3738 handle = ocfs2_start_trans(OCFS2_SB(inode->i_sb),
3739 OCFS2_INODE_UPDATE_CREDITS);
3740 if (IS_ERR(handle)) {
3741 ret = PTR_ERR(handle);
3746 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
3747 OCFS2_JOURNAL_ACCESS_WRITE);
3753 inode_set_ctime_current(inode);
3754 di->i_ctime = cpu_to_le64(inode_get_ctime(inode).tv_sec);
3755 di->i_ctime_nsec = cpu_to_le32(inode_get_ctime(inode).tv_nsec);
3757 ocfs2_journal_dirty(handle, di_bh);
3760 ocfs2_commit_trans(OCFS2_SB(inode->i_sb), handle);
3765 static int ocfs2_attach_refcount_tree(struct inode *inode,
3766 struct buffer_head *di_bh)
3768 int ret, data_changed = 0;
3769 struct buffer_head *ref_root_bh = NULL;
3770 struct ocfs2_inode_info *oi = OCFS2_I(inode);
3771 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
3772 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3773 struct ocfs2_refcount_tree *ref_tree;
3774 unsigned int ext_flags;
3776 u32 cpos, num_clusters, clusters, p_cluster;
3777 struct ocfs2_cached_dealloc_ctxt dealloc;
3778 struct ocfs2_extent_tree di_et;
3780 ocfs2_init_dealloc_ctxt(&dealloc);
3782 if (!ocfs2_is_refcount_inode(inode)) {
3783 ret = ocfs2_create_refcount_tree(inode, di_bh);
3790 BUG_ON(!di->i_refcount_loc);
3791 ret = ocfs2_lock_refcount_tree(osb,
3792 le64_to_cpu(di->i_refcount_loc), 1,
3793 &ref_tree, &ref_root_bh);
3799 if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL)
3802 ocfs2_init_dinode_extent_tree(&di_et, INODE_CACHE(inode), di_bh);
3804 size = i_size_read(inode);
3805 clusters = ocfs2_clusters_for_bytes(inode->i_sb, size);
3808 while (cpos < clusters) {
3809 ret = ocfs2_get_clusters(inode, cpos, &p_cluster,
3810 &num_clusters, &ext_flags);
3815 if (p_cluster && !(ext_flags & OCFS2_EXT_REFCOUNTED)) {
3816 ret = ocfs2_add_refcount_flag(inode, &di_et,
3819 p_cluster, num_clusters,
3828 cpos += num_clusters;
3832 if (oi->ip_dyn_features & OCFS2_HAS_XATTR_FL) {
3833 ret = ocfs2_xattr_attach_refcount_tree(inode, di_bh,
3844 ret = ocfs2_change_ctime(inode, di_bh);
3850 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
3851 brelse(ref_root_bh);
3853 if (!ret && ocfs2_dealloc_has_cluster(&dealloc)) {
3854 ocfs2_schedule_truncate_log_flush(osb, 1);
3855 ocfs2_run_deallocs(osb, &dealloc);
3859 * Empty the extent map so that we may get the right extent
3860 * record from the disk.
3862 ocfs2_extent_map_trunc(inode, 0);
3867 static int ocfs2_add_refcounted_extent(struct inode *inode,
3868 struct ocfs2_extent_tree *et,
3869 struct ocfs2_caching_info *ref_ci,
3870 struct buffer_head *ref_root_bh,
3871 u32 cpos, u32 p_cluster, u32 num_clusters,
3872 unsigned int ext_flags,
3873 struct ocfs2_cached_dealloc_ctxt *dealloc)
3878 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3879 struct ocfs2_alloc_context *meta_ac = NULL;
3881 ret = ocfs2_lock_refcount_allocators(inode->i_sb,
3882 p_cluster, num_clusters,
3884 ref_root_bh, &meta_ac,
3891 handle = ocfs2_start_trans(osb, credits);
3892 if (IS_ERR(handle)) {
3893 ret = PTR_ERR(handle);
3898 ret = ocfs2_insert_extent(handle, et, cpos,
3899 ocfs2_clusters_to_blocks(inode->i_sb, p_cluster),
3900 num_clusters, ext_flags, meta_ac);
3906 ret = ocfs2_increase_refcount(handle, ref_ci, ref_root_bh,
3907 p_cluster, num_clusters,
3914 ret = dquot_alloc_space_nodirty(inode,
3915 ocfs2_clusters_to_bytes(osb->sb, num_clusters));
3920 ocfs2_commit_trans(osb, handle);
3923 ocfs2_free_alloc_context(meta_ac);
3927 static int ocfs2_duplicate_inline_data(struct inode *s_inode,
3928 struct buffer_head *s_bh,
3929 struct inode *t_inode,
3930 struct buffer_head *t_bh)
3934 struct ocfs2_super *osb = OCFS2_SB(s_inode->i_sb);
3935 struct ocfs2_dinode *s_di = (struct ocfs2_dinode *)s_bh->b_data;
3936 struct ocfs2_dinode *t_di = (struct ocfs2_dinode *)t_bh->b_data;
3938 BUG_ON(!(OCFS2_I(s_inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL));
3940 handle = ocfs2_start_trans(osb, OCFS2_INODE_UPDATE_CREDITS);
3941 if (IS_ERR(handle)) {
3942 ret = PTR_ERR(handle);
3947 ret = ocfs2_journal_access_di(handle, INODE_CACHE(t_inode), t_bh,
3948 OCFS2_JOURNAL_ACCESS_WRITE);
3954 t_di->id2.i_data.id_count = s_di->id2.i_data.id_count;
3955 memcpy(t_di->id2.i_data.id_data, s_di->id2.i_data.id_data,
3956 le16_to_cpu(s_di->id2.i_data.id_count));
3957 spin_lock(&OCFS2_I(t_inode)->ip_lock);
3958 OCFS2_I(t_inode)->ip_dyn_features |= OCFS2_INLINE_DATA_FL;
3959 t_di->i_dyn_features = cpu_to_le16(OCFS2_I(t_inode)->ip_dyn_features);
3960 spin_unlock(&OCFS2_I(t_inode)->ip_lock);
3962 ocfs2_journal_dirty(handle, t_bh);
3965 ocfs2_commit_trans(osb, handle);
3970 static int ocfs2_duplicate_extent_list(struct inode *s_inode,
3971 struct inode *t_inode,
3972 struct buffer_head *t_bh,
3973 struct ocfs2_caching_info *ref_ci,
3974 struct buffer_head *ref_root_bh,
3975 struct ocfs2_cached_dealloc_ctxt *dealloc)
3978 u32 p_cluster, num_clusters, clusters, cpos;
3980 unsigned int ext_flags;
3981 struct ocfs2_extent_tree et;
3983 ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(t_inode), t_bh);
3985 size = i_size_read(s_inode);
3986 clusters = ocfs2_clusters_for_bytes(s_inode->i_sb, size);
3989 while (cpos < clusters) {
3990 ret = ocfs2_get_clusters(s_inode, cpos, &p_cluster,
3991 &num_clusters, &ext_flags);
3997 ret = ocfs2_add_refcounted_extent(t_inode, &et,
3998 ref_ci, ref_root_bh,
4009 cpos += num_clusters;
4017 * change the new file's attributes to the src.
4019 * reflink creates a snapshot of a file, that means the attributes
4020 * must be identical except for three exceptions - nlink, ino, and ctime.
4022 static int ocfs2_complete_reflink(struct inode *s_inode,
4023 struct buffer_head *s_bh,
4024 struct inode *t_inode,
4025 struct buffer_head *t_bh,
4030 struct ocfs2_dinode *s_di = (struct ocfs2_dinode *)s_bh->b_data;
4031 struct ocfs2_dinode *di = (struct ocfs2_dinode *)t_bh->b_data;
4032 loff_t size = i_size_read(s_inode);
4034 handle = ocfs2_start_trans(OCFS2_SB(t_inode->i_sb),
4035 OCFS2_INODE_UPDATE_CREDITS);
4036 if (IS_ERR(handle)) {
4037 ret = PTR_ERR(handle);
4042 ret = ocfs2_journal_access_di(handle, INODE_CACHE(t_inode), t_bh,
4043 OCFS2_JOURNAL_ACCESS_WRITE);
4049 spin_lock(&OCFS2_I(t_inode)->ip_lock);
4050 OCFS2_I(t_inode)->ip_clusters = OCFS2_I(s_inode)->ip_clusters;
4051 OCFS2_I(t_inode)->ip_attr = OCFS2_I(s_inode)->ip_attr;
4052 OCFS2_I(t_inode)->ip_dyn_features = OCFS2_I(s_inode)->ip_dyn_features;
4053 spin_unlock(&OCFS2_I(t_inode)->ip_lock);
4054 i_size_write(t_inode, size);
4055 t_inode->i_blocks = s_inode->i_blocks;
4057 di->i_xattr_inline_size = s_di->i_xattr_inline_size;
4058 di->i_clusters = s_di->i_clusters;
4059 di->i_size = s_di->i_size;
4060 di->i_dyn_features = s_di->i_dyn_features;
4061 di->i_attr = s_di->i_attr;
4064 t_inode->i_uid = s_inode->i_uid;
4065 t_inode->i_gid = s_inode->i_gid;
4066 t_inode->i_mode = s_inode->i_mode;
4067 di->i_uid = s_di->i_uid;
4068 di->i_gid = s_di->i_gid;
4069 di->i_mode = s_di->i_mode;
4073 * we want mtime to appear identical to the source and
4076 inode_set_ctime_current(t_inode);
4078 di->i_ctime = cpu_to_le64(inode_get_ctime(t_inode).tv_sec);
4079 di->i_ctime_nsec = cpu_to_le32(inode_get_ctime(t_inode).tv_nsec);
4081 t_inode->i_mtime = s_inode->i_mtime;
4082 di->i_mtime = s_di->i_mtime;
4083 di->i_mtime_nsec = s_di->i_mtime_nsec;
4086 ocfs2_journal_dirty(handle, t_bh);
4089 ocfs2_commit_trans(OCFS2_SB(t_inode->i_sb), handle);
4093 static int ocfs2_create_reflink_node(struct inode *s_inode,
4094 struct buffer_head *s_bh,
4095 struct inode *t_inode,
4096 struct buffer_head *t_bh,
4100 struct buffer_head *ref_root_bh = NULL;
4101 struct ocfs2_cached_dealloc_ctxt dealloc;
4102 struct ocfs2_super *osb = OCFS2_SB(s_inode->i_sb);
4103 struct ocfs2_dinode *di = (struct ocfs2_dinode *)s_bh->b_data;
4104 struct ocfs2_refcount_tree *ref_tree;
4106 ocfs2_init_dealloc_ctxt(&dealloc);
4108 ret = ocfs2_set_refcount_tree(t_inode, t_bh,
4109 le64_to_cpu(di->i_refcount_loc));
4115 if (OCFS2_I(s_inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
4116 ret = ocfs2_duplicate_inline_data(s_inode, s_bh,
4123 ret = ocfs2_lock_refcount_tree(osb, le64_to_cpu(di->i_refcount_loc),
4124 1, &ref_tree, &ref_root_bh);
4130 ret = ocfs2_duplicate_extent_list(s_inode, t_inode, t_bh,
4131 &ref_tree->rf_ci, ref_root_bh,
4135 goto out_unlock_refcount;
4138 out_unlock_refcount:
4139 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
4140 brelse(ref_root_bh);
4142 if (ocfs2_dealloc_has_cluster(&dealloc)) {
4143 ocfs2_schedule_truncate_log_flush(osb, 1);
4144 ocfs2_run_deallocs(osb, &dealloc);
4150 static int __ocfs2_reflink(struct dentry *old_dentry,
4151 struct buffer_head *old_bh,
4152 struct inode *new_inode,
4156 struct inode *inode = d_inode(old_dentry);
4157 struct buffer_head *new_bh = NULL;
4159 if (OCFS2_I(inode)->ip_flags & OCFS2_INODE_SYSTEM_FILE) {
4165 ret = filemap_fdatawrite(inode->i_mapping);
4171 ret = ocfs2_attach_refcount_tree(inode, old_bh);
4177 inode_lock_nested(new_inode, I_MUTEX_CHILD);
4178 ret = ocfs2_inode_lock_nested(new_inode, &new_bh, 1,
4179 OI_LS_REFLINK_TARGET);
4185 ret = ocfs2_create_reflink_node(inode, old_bh,
4186 new_inode, new_bh, preserve);
4192 if (OCFS2_I(inode)->ip_dyn_features & OCFS2_HAS_XATTR_FL) {
4193 ret = ocfs2_reflink_xattrs(inode, old_bh,
4202 ret = ocfs2_complete_reflink(inode, old_bh,
4203 new_inode, new_bh, preserve);
4208 ocfs2_inode_unlock(new_inode, 1);
4211 inode_unlock(new_inode);
4214 ret = filemap_fdatawait(inode->i_mapping);
4221 static int ocfs2_reflink(struct dentry *old_dentry, struct inode *dir,
4222 struct dentry *new_dentry, bool preserve)
4224 int error, had_lock;
4225 struct inode *inode = d_inode(old_dentry);
4226 struct buffer_head *old_bh = NULL;
4227 struct inode *new_orphan_inode = NULL;
4228 struct ocfs2_lock_holder oh;
4230 if (!ocfs2_refcount_tree(OCFS2_SB(inode->i_sb)))
4234 error = ocfs2_create_inode_in_orphan(dir, inode->i_mode,
4241 error = ocfs2_rw_lock(inode, 1);
4247 error = ocfs2_inode_lock(inode, &old_bh, 1);
4250 ocfs2_rw_unlock(inode, 1);
4254 down_write(&OCFS2_I(inode)->ip_xattr_sem);
4255 down_write(&OCFS2_I(inode)->ip_alloc_sem);
4256 error = __ocfs2_reflink(old_dentry, old_bh,
4257 new_orphan_inode, preserve);
4258 up_write(&OCFS2_I(inode)->ip_alloc_sem);
4259 up_write(&OCFS2_I(inode)->ip_xattr_sem);
4261 ocfs2_inode_unlock(inode, 1);
4262 ocfs2_rw_unlock(inode, 1);
4270 had_lock = ocfs2_inode_lock_tracker(new_orphan_inode, NULL, 1,
4278 /* If the security isn't preserved, we need to re-initialize them. */
4280 error = ocfs2_init_security_and_acl(dir, new_orphan_inode,
4281 &new_dentry->d_name);
4286 error = ocfs2_mv_orphaned_inode_to_new(dir, new_orphan_inode,
4291 ocfs2_inode_unlock_tracker(new_orphan_inode, 1, &oh, had_lock);
4294 if (new_orphan_inode) {
4296 * We need to open_unlock the inode no matter whether we
4297 * succeed or not, so that other nodes can delete it later.
4299 ocfs2_open_unlock(new_orphan_inode);
4301 iput(new_orphan_inode);
4308 * Below here are the bits used by OCFS2_IOC_REFLINK() to fake
4309 * sys_reflink(). This will go away when vfs_reflink() exists in
4313 /* copied from may_create in VFS. */
4314 static inline int ocfs2_may_create(struct inode *dir, struct dentry *child)
4316 if (d_really_is_positive(child))
4318 if (IS_DEADDIR(dir))
4320 return inode_permission(&nop_mnt_idmap, dir, MAY_WRITE | MAY_EXEC);
4324 * ocfs2_vfs_reflink - Create a reference-counted link
4326 * @old_dentry: source dentry + inode
4327 * @dir: directory to create the target
4328 * @new_dentry: target dentry
4329 * @preserve: if true, preserve all file attributes
4331 static int ocfs2_vfs_reflink(struct dentry *old_dentry, struct inode *dir,
4332 struct dentry *new_dentry, bool preserve)
4334 struct inode *inode = d_inode(old_dentry);
4340 error = ocfs2_may_create(dir, new_dentry);
4344 if (dir->i_sb != inode->i_sb)
4348 * A reflink to an append-only or immutable file cannot be created.
4350 if (IS_APPEND(inode) || IS_IMMUTABLE(inode))
4353 /* Only regular files can be reflinked. */
4354 if (!S_ISREG(inode->i_mode))
4358 * If the caller wants to preserve ownership, they require the
4362 if (!uid_eq(current_fsuid(), inode->i_uid) && !capable(CAP_CHOWN))
4364 if (!in_group_p(inode->i_gid) && !capable(CAP_CHOWN))
4369 * If the caller is modifying any aspect of the attributes, they
4370 * are not creating a snapshot. They need read permission on the
4374 error = inode_permission(&nop_mnt_idmap, inode, MAY_READ);
4380 error = dquot_initialize(dir);
4382 error = ocfs2_reflink(old_dentry, dir, new_dentry, preserve);
4383 inode_unlock(inode);
4385 fsnotify_create(dir, new_dentry);
4389 * Most codes are copied from sys_linkat.
4391 int ocfs2_reflink_ioctl(struct inode *inode,
4392 const char __user *oldname,
4393 const char __user *newname,
4396 struct dentry *new_dentry;
4397 struct path old_path, new_path;
4400 if (!ocfs2_refcount_tree(OCFS2_SB(inode->i_sb)))
4403 error = user_path_at(AT_FDCWD, oldname, 0, &old_path);
4409 new_dentry = user_path_create(AT_FDCWD, newname, &new_path, 0);
4410 error = PTR_ERR(new_dentry);
4411 if (IS_ERR(new_dentry)) {
4417 if (old_path.mnt != new_path.mnt) {
4422 error = ocfs2_vfs_reflink(old_path.dentry,
4423 d_inode(new_path.dentry),
4424 new_dentry, preserve);
4426 done_path_create(&new_path, new_dentry);
4428 path_put(&old_path);
4433 /* Update destination inode size, if necessary. */
4434 int ocfs2_reflink_update_dest(struct inode *dest,
4435 struct buffer_head *d_bh,
4441 dest->i_blocks = ocfs2_inode_sector_count(dest);
4443 if (newlen <= i_size_read(dest))
4446 handle = ocfs2_start_trans(OCFS2_SB(dest->i_sb),
4447 OCFS2_INODE_UPDATE_CREDITS);
4448 if (IS_ERR(handle)) {
4449 ret = PTR_ERR(handle);
4454 /* Extend i_size if needed. */
4455 spin_lock(&OCFS2_I(dest)->ip_lock);
4456 if (newlen > i_size_read(dest))
4457 i_size_write(dest, newlen);
4458 spin_unlock(&OCFS2_I(dest)->ip_lock);
4459 dest->i_mtime = inode_set_ctime_current(dest);
4461 ret = ocfs2_mark_inode_dirty(handle, dest, d_bh);
4468 ocfs2_commit_trans(OCFS2_SB(dest->i_sb), handle);
4472 /* Remap the range pos_in:len in s_inode to pos_out:len in t_inode. */
4473 static loff_t ocfs2_reflink_remap_extent(struct inode *s_inode,
4474 struct buffer_head *s_bh,
4476 struct inode *t_inode,
4477 struct buffer_head *t_bh,
4480 struct ocfs2_cached_dealloc_ctxt *dealloc)
4482 struct ocfs2_extent_tree s_et;
4483 struct ocfs2_extent_tree t_et;
4484 struct ocfs2_dinode *dis;
4485 struct buffer_head *ref_root_bh = NULL;
4486 struct ocfs2_refcount_tree *ref_tree;
4487 struct ocfs2_super *osb;
4488 loff_t remapped_bytes = 0;
4489 loff_t pstart, plen;
4490 u32 p_cluster, num_clusters, slast, spos, tpos, remapped_clus = 0;
4491 unsigned int ext_flags;
4494 osb = OCFS2_SB(s_inode->i_sb);
4495 dis = (struct ocfs2_dinode *)s_bh->b_data;
4496 ocfs2_init_dinode_extent_tree(&s_et, INODE_CACHE(s_inode), s_bh);
4497 ocfs2_init_dinode_extent_tree(&t_et, INODE_CACHE(t_inode), t_bh);
4499 spos = ocfs2_bytes_to_clusters(s_inode->i_sb, pos_in);
4500 tpos = ocfs2_bytes_to_clusters(t_inode->i_sb, pos_out);
4501 slast = ocfs2_clusters_for_bytes(s_inode->i_sb, pos_in + len);
4503 while (spos < slast) {
4504 if (fatal_signal_pending(current)) {
4509 /* Look up the extent. */
4510 ret = ocfs2_get_clusters(s_inode, spos, &p_cluster,
4511 &num_clusters, &ext_flags);
4517 num_clusters = min_t(u32, num_clusters, slast - spos);
4519 /* Punch out the dest range. */
4520 pstart = ocfs2_clusters_to_bytes(t_inode->i_sb, tpos);
4521 plen = ocfs2_clusters_to_bytes(t_inode->i_sb, num_clusters);
4522 ret = ocfs2_remove_inode_range(t_inode, t_bh, pstart, plen);
4531 /* Lock the refcount btree... */
4532 ret = ocfs2_lock_refcount_tree(osb,
4533 le64_to_cpu(dis->i_refcount_loc),
4534 1, &ref_tree, &ref_root_bh);
4540 /* Mark s_inode's extent as refcounted. */
4541 if (!(ext_flags & OCFS2_EXT_REFCOUNTED)) {
4542 ret = ocfs2_add_refcount_flag(s_inode, &s_et,
4545 p_cluster, num_clusters,
4549 goto out_unlock_refcount;
4553 /* Map in the new extent. */
4554 ext_flags |= OCFS2_EXT_REFCOUNTED;
4555 ret = ocfs2_add_refcounted_extent(t_inode, &t_et,
4564 goto out_unlock_refcount;
4567 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
4568 brelse(ref_root_bh);
4570 spos += num_clusters;
4571 tpos += num_clusters;
4572 remapped_clus += num_clusters;
4576 out_unlock_refcount:
4577 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
4578 brelse(ref_root_bh);
4580 remapped_bytes = ocfs2_clusters_to_bytes(t_inode->i_sb, remapped_clus);
4581 remapped_bytes = min_t(loff_t, len, remapped_bytes);
4583 return remapped_bytes > 0 ? remapped_bytes : ret;
4586 /* Set up refcount tree and remap s_inode to t_inode. */
4587 loff_t ocfs2_reflink_remap_blocks(struct inode *s_inode,
4588 struct buffer_head *s_bh,
4590 struct inode *t_inode,
4591 struct buffer_head *t_bh,
4595 struct ocfs2_cached_dealloc_ctxt dealloc;
4596 struct ocfs2_super *osb;
4597 struct ocfs2_dinode *dis;
4598 struct ocfs2_dinode *dit;
4601 osb = OCFS2_SB(s_inode->i_sb);
4602 dis = (struct ocfs2_dinode *)s_bh->b_data;
4603 dit = (struct ocfs2_dinode *)t_bh->b_data;
4604 ocfs2_init_dealloc_ctxt(&dealloc);
4607 * If we're reflinking the entire file and the source is inline
4608 * data, just copy the contents.
4610 if (pos_in == pos_out && pos_in == 0 && len == i_size_read(s_inode) &&
4611 i_size_read(t_inode) <= len &&
4612 (OCFS2_I(s_inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL)) {
4613 ret = ocfs2_duplicate_inline_data(s_inode, s_bh, t_inode, t_bh);
4620 * If both inodes belong to two different refcount groups then
4621 * forget it because we don't know how (or want) to go merging
4625 if (ocfs2_is_refcount_inode(s_inode) &&
4626 ocfs2_is_refcount_inode(t_inode) &&
4627 le64_to_cpu(dis->i_refcount_loc) !=
4628 le64_to_cpu(dit->i_refcount_loc))
4631 /* Neither inode has a refcount tree. Add one to s_inode. */
4632 if (!ocfs2_is_refcount_inode(s_inode) &&
4633 !ocfs2_is_refcount_inode(t_inode)) {
4634 ret = ocfs2_create_refcount_tree(s_inode, s_bh);
4641 /* Ensure that both inodes end up with the same refcount tree. */
4642 if (!ocfs2_is_refcount_inode(s_inode)) {
4643 ret = ocfs2_set_refcount_tree(s_inode, s_bh,
4644 le64_to_cpu(dit->i_refcount_loc));
4650 if (!ocfs2_is_refcount_inode(t_inode)) {
4651 ret = ocfs2_set_refcount_tree(t_inode, t_bh,
4652 le64_to_cpu(dis->i_refcount_loc));
4659 /* Turn off inline data in the dest file. */
4660 if (OCFS2_I(t_inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
4661 ret = ocfs2_convert_inline_data_to_extents(t_inode, t_bh);
4668 /* Actually remap extents now. */
4669 ret = ocfs2_reflink_remap_extent(s_inode, s_bh, pos_in, t_inode, t_bh,
4670 pos_out, len, &dealloc);
4677 if (ocfs2_dealloc_has_cluster(&dealloc)) {
4678 ocfs2_schedule_truncate_log_flush(osb, 1);
4679 ocfs2_run_deallocs(osb, &dealloc);
4685 /* Lock an inode and grab a bh pointing to the inode. */
4686 int ocfs2_reflink_inodes_lock(struct inode *s_inode,
4687 struct buffer_head **bh_s,
4688 struct inode *t_inode,
4689 struct buffer_head **bh_t)
4691 struct inode *inode1 = s_inode;
4692 struct inode *inode2 = t_inode;
4693 struct ocfs2_inode_info *oi1;
4694 struct ocfs2_inode_info *oi2;
4695 struct buffer_head *bh1 = NULL;
4696 struct buffer_head *bh2 = NULL;
4697 bool same_inode = (s_inode == t_inode);
4698 bool need_swap = (inode1->i_ino > inode2->i_ino);
4701 /* First grab the VFS and rw locks. */
4702 lock_two_nondirectories(s_inode, t_inode);
4704 swap(inode1, inode2);
4706 status = ocfs2_rw_lock(inode1, 1);
4712 status = ocfs2_rw_lock(inode2, 1);
4719 /* Now go for the cluster locks */
4720 oi1 = OCFS2_I(inode1);
4721 oi2 = OCFS2_I(inode2);
4723 trace_ocfs2_double_lock((unsigned long long)oi1->ip_blkno,
4724 (unsigned long long)oi2->ip_blkno);
4726 /* We always want to lock the one with the lower lockid first. */
4727 if (oi1->ip_blkno > oi2->ip_blkno)
4728 mlog_errno(-ENOLCK);
4731 status = ocfs2_inode_lock_nested(inode1, &bh1, 1,
4732 OI_LS_REFLINK_TARGET);
4734 if (status != -ENOENT)
4741 status = ocfs2_inode_lock_nested(inode2, &bh2, 1,
4742 OI_LS_REFLINK_TARGET);
4744 if (status != -ENOENT)
4753 * If we swapped inode order above, we have to swap the buffer heads
4754 * before passing them back to the caller.
4761 trace_ocfs2_double_lock_end(
4762 (unsigned long long)oi1->ip_blkno,
4763 (unsigned long long)oi2->ip_blkno);
4768 ocfs2_inode_unlock(inode1, 1);
4771 ocfs2_rw_unlock(inode2, 1);
4773 ocfs2_rw_unlock(inode1, 1);
4775 unlock_two_nondirectories(s_inode, t_inode);
4779 /* Unlock both inodes and release buffers. */
4780 void ocfs2_reflink_inodes_unlock(struct inode *s_inode,
4781 struct buffer_head *s_bh,
4782 struct inode *t_inode,
4783 struct buffer_head *t_bh)
4785 ocfs2_inode_unlock(s_inode, 1);
4786 ocfs2_rw_unlock(s_inode, 1);
4788 if (s_inode != t_inode) {
4789 ocfs2_inode_unlock(t_inode, 1);
4790 ocfs2_rw_unlock(t_inode, 1);
4793 unlock_two_nondirectories(s_inode, t_inode);