btrfs: ulist: rename ulist_fini to ulist_release

Change the name so it matches the naming we already use eg. for
btrfs_path.

Suggested-by: Qu Wenruo <quwenruo@cn.fujitsu.com>
Signed-off-by: David Sterba <dsterba@suse.com>

diff --git a/fs/btrfs/qgroup.c b/fs/btrfs/qgroup.c
index e1d0ab1f2ae095a716b03cfbcfba8419b02709dd..366a21ae22496ee0bfabfa00aadc2a9bc54bebb6 100644 (file)
--- a/fs/btrfs/qgroup.c
+++ b/fs/btrfs/qgroup.c
@@ -2834,7 +2834,7 @@ int btrfs_qgroup_reserve_data(struct inode *inode, u64 start, u64 len)
        if (ret < 0)
                goto cleanup;
 
-       ulist_fini(&changeset.range_changed);
+       ulist_release(&changeset.range_changed);
        return ret;
 
 cleanup:
@@ -2844,7 +2844,7 @@ cleanup:
                clear_extent_bit(&BTRFS_I(inode)->io_tree, unode->val,
                                 unode->aux, EXTENT_QGROUP_RESERVED, 0, 0, NULL,
                                 GFP_NOFS);
-       ulist_fini(&changeset.range_changed);
+       ulist_release(&changeset.range_changed);
        return ret;
 }
 
@@ -2871,7 +2871,7 @@ static int __btrfs_qgroup_release_data(struct inode *inode, u64 start, u64 len,
        trace_btrfs_qgroup_release_data(inode, start, len,
                                        changeset.bytes_changed, trace_op);
 out:
-       ulist_fini(&changeset.range_changed);
+       ulist_release(&changeset.range_changed);
        return ret;
 }
 
@@ -2986,5 +2986,5 @@ void btrfs_qgroup_check_reserved_leak(struct inode *inode)
                                changeset.bytes_changed);
 
        }
-       ulist_fini(&changeset.range_changed);
+       ulist_release(&changeset.range_changed);
 }

diff --git a/fs/btrfs/ulist.c b/fs/btrfs/ulist.c
index 5deee56434fc5f34499d7fd17b1f47fd8084b8b6..d8edf164f81cb44603f9d05f6ea6a6f79675c3c4 100644 (file)
--- a/fs/btrfs/ulist.c
+++ b/fs/btrfs/ulist.c
@@ -52,13 +52,13 @@ void ulist_init(struct ulist *ulist)
 }
 
 /**
- * ulist_fini - free up additionally allocated memory for the ulist
+ * ulist_release - free up additionally allocated memory for the ulist
  * @ulist:     the ulist from which to free the additional memory
  *
  * This is useful in cases where the base 'struct ulist' has been statically
  * allocated.
  */
-void ulist_fini(struct ulist *ulist)
+void ulist_release(struct ulist *ulist)
 {
        struct ulist_node *node;
        struct ulist_node *next;
@@ -79,7 +79,7 @@ void ulist_fini(struct ulist *ulist)
  */
 void ulist_reinit(struct ulist *ulist)
 {
-       ulist_fini(ulist);
+       ulist_release(ulist);
        ulist_init(ulist);
 }
 
@@ -105,13 +105,13 @@ struct ulist *ulist_alloc(gfp_t gfp_mask)
  * ulist_free - free dynamically allocated ulist
  * @ulist:     ulist to free
  *
- * It is not necessary to call ulist_fini before.
+ * It is not necessary to call ulist_release before.
  */
 void ulist_free(struct ulist *ulist)
 {
        if (!ulist)
                return;
-       ulist_fini(ulist);
+       ulist_release(ulist);
        kfree(ulist);
 }
 

diff --git a/fs/btrfs/ulist.h b/fs/btrfs/ulist.h
index 1a4130443d7e1cb65d12f08289593704714d32c9..53c9136327337f0732e42e8e276e2335d02ac92d 100644 (file)
--- a/fs/btrfs/ulist.h
+++ b/fs/btrfs/ulist.h
@@ -44,7 +44,7 @@ struct ulist {
 };
 
 void ulist_init(struct ulist *ulist);
-void ulist_fini(struct ulist *ulist);
+void ulist_release(struct ulist *ulist);
 void ulist_reinit(struct ulist *ulist);
 struct ulist *ulist_alloc(gfp_t gfp_mask);
 void ulist_free(struct ulist *ulist);