page_end = (pg_index << PAGE_SHIFT) + folio_size(folio) - 1;
                btrfs_lock_extent(tree, cur, page_end, NULL);
                read_lock(&em_tree->lock);
-               em = lookup_extent_mapping(em_tree, cur, page_end + 1 - cur);
+               em = btrfs_lookup_extent_mapping(em_tree, cur, page_end + 1 - cur);
                read_unlock(&em_tree->lock);
 
                /*
 
        /* we need the actual starting offset of this extent in the file */
        read_lock(&em_tree->lock);
-       em = lookup_extent_mapping(em_tree, file_offset, fs_info->sectorsize);
+       em = btrfs_lookup_extent_mapping(em_tree, file_offset, fs_info->sectorsize);
        read_unlock(&em_tree->lock);
        if (!em) {
                ret = BLK_STS_IOERR;
 
         * full extent lock.
         */
        read_lock(&em_tree->lock);
-       em = lookup_extent_mapping(em_tree, start, sectorsize);
+       em = btrfs_lookup_extent_mapping(em_tree, start, sectorsize);
        read_unlock(&em_tree->lock);
 
        /*
 
         * a pre-existing one.
         */
        if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags)) {
-               ret = split_extent_map(bbio->inode, bbio->file_offset,
-                                      ordered->num_bytes, len,
-                                      ordered->disk_bytenr);
+               ret = btrfs_split_extent_map(bbio->inode, bbio->file_offset,
+                                            ordered->num_bytes, len,
+                                            ordered->disk_bytenr);
                if (ret)
                        return ret;
        }
 
 
        btrfs_extent_io_tree_init(fs_info, &BTRFS_I(inode)->io_tree,
                                  IO_TREE_BTREE_INODE_IO);
-       extent_map_tree_init(&BTRFS_I(inode)->extent_tree);
+       btrfs_extent_map_tree_init(&BTRFS_I(inode)->extent_tree);
 
        BTRFS_I(inode)->root = btrfs_grab_root(fs_info->tree_root);
        set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags);
 
                struct extent_map *em;
 
                write_lock(&extent_tree->lock);
-               em = lookup_extent_mapping(extent_tree, start, len);
+               em = btrfs_lookup_extent_mapping(extent_tree, start, len);
                if (!em) {
                        write_unlock(&extent_tree->lock);
                        break;
                 * fsync performance for workloads with a data size that exceeds
                 * or is close to the system's memory).
                 */
-               remove_extent_mapping(inode, em);
+               btrfs_remove_extent_mapping(inode, em);
                /* Once for the inode's extent map tree. */
                btrfs_free_extent_map(em);
 next:
 
 
 static struct kmem_cache *extent_map_cache;
 
-int __init extent_map_init(void)
+int __init btrfs_extent_map_init(void)
 {
        extent_map_cache = kmem_cache_create("btrfs_extent_map",
                                             sizeof(struct extent_map), 0, 0, NULL);
        return 0;
 }
 
-void __cold extent_map_exit(void)
+void __cold btrfs_extent_map_exit(void)
 {
        kmem_cache_destroy(extent_map_cache);
 }
  * Initialize the extent tree @tree.  Should be called for each new inode or
  * other user of the extent_map interface.
  */
-void extent_map_tree_init(struct extent_map_tree *tree)
+void btrfs_extent_map_tree_init(struct extent_map_tree *tree)
 {
        tree->root = RB_ROOT;
        INIT_LIST_HEAD(&tree->modified_extents);
  *         -ENOENT  when the extent is not found in the tree
  *         -EUCLEAN if the found extent does not match the expected start
  */
-int unpin_extent_cache(struct btrfs_inode *inode, u64 start, u64 len, u64 gen)
+int btrfs_unpin_extent_cache(struct btrfs_inode *inode, u64 start, u64 len, u64 gen)
 {
        struct btrfs_fs_info *fs_info = inode->root->fs_info;
        struct extent_map_tree *tree = &inode->extent_tree;
        struct extent_map *em;
 
        write_lock(&tree->lock);
-       em = lookup_extent_mapping(tree, start, len);
+       em = btrfs_lookup_extent_mapping(tree, start, len);
 
        if (WARN_ON(!em)) {
                btrfs_warn(fs_info,
 
 }
 
-void clear_em_logging(struct btrfs_inode *inode, struct extent_map *em)
+void btrfs_clear_em_logging(struct btrfs_inode *inode, struct extent_map *em)
 {
        lockdep_assert_held_write(&inode->extent_tree.lock);
 
  * intersect, so check the object returned carefully to make sure that no
  * additional lookups are needed.
  */
-struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree,
-                                        u64 start, u64 len)
+struct extent_map *btrfs_lookup_extent_mapping(struct extent_map_tree *tree,
+                                              u64 start, u64 len)
 {
        return __lookup_extent_mapping(tree, start, len, 1);
 }
  *
  * If one can't be found, any nearby extent may be returned
  */
-struct extent_map *search_extent_mapping(struct extent_map_tree *tree,
-                                        u64 start, u64 len)
+struct extent_map *btrfs_search_extent_mapping(struct extent_map_tree *tree,
+                                              u64 start, u64 len)
 {
        return __lookup_extent_mapping(tree, start, len, 0);
 }
  * Remove @em from the extent tree of @inode.  No reference counts are dropped,
  * and no checks are done to see if the range is in use.
  */
-void remove_extent_mapping(struct btrfs_inode *inode, struct extent_map *em)
+void btrfs_remove_extent_mapping(struct btrfs_inode *inode, struct extent_map *em)
 {
        struct extent_map_tree *tree = &inode->extent_tree;
 
        if (ret == -EEXIST) {
                struct extent_map *existing;
 
-               existing = search_extent_mapping(&inode->extent_tree, start, len);
+               existing = btrfs_search_extent_mapping(&inode->extent_tree, start, len);
 
                trace_btrfs_handle_em_exist(fs_info, existing, em, start, len);
 
 
                em = rb_entry(node, struct extent_map, rb_node);
                em->flags &= ~(EXTENT_FLAG_PINNED | EXTENT_FLAG_LOGGING);
-               remove_extent_mapping(inode, em);
+               btrfs_remove_extent_mapping(inode, em);
                btrfs_free_extent_map(em);
 
                if (cond_resched_rwlock_write(&tree->lock))
        split2 = btrfs_alloc_extent_map();
 
        write_lock(&em_tree->lock);
-       em = lookup_extent_mapping(em_tree, start, len);
+       em = btrfs_lookup_extent_mapping(em_tree, start, len);
 
        while (em) {
                /* extent_map_end() returns exclusive value (last byte + 1). */
                                ASSERT(!split);
                                btrfs_set_inode_full_sync(inode);
                        }
-                       remove_extent_mapping(inode, em);
+                       btrfs_remove_extent_mapping(inode, em);
                }
 
                /*
  *
  * This function is used when an ordered_extent needs to be split.
  */
-int split_extent_map(struct btrfs_inode *inode, u64 start, u64 len, u64 pre,
-                    u64 new_logical)
+int btrfs_split_extent_map(struct btrfs_inode *inode, u64 start, u64 len, u64 pre,
+                          u64 new_logical)
 {
        struct extent_map_tree *em_tree = &inode->extent_tree;
        struct extent_map *em;
 
        btrfs_lock_extent(&inode->io_tree, start, start + len - 1, NULL);
        write_lock(&em_tree->lock);
-       em = lookup_extent_mapping(em_tree, start, len);
+       em = btrfs_lookup_extent_mapping(em_tree, start, len);
        if (!em) {
                ret = -EIO;
                goto out_unlock;
                if (!list_empty(&em->list) && em->generation >= cur_fs_gen)
                        btrfs_set_inode_full_sync(inode);
 
-               remove_extent_mapping(inode, em);
+               btrfs_remove_extent_mapping(inode, em);
                trace_btrfs_extent_map_shrinker_remove_em(inode, em);
                /* Drop the reference for the tree. */
                btrfs_free_extent_map(em);
 
        return em->start + em->len;
 }
 
-void extent_map_tree_init(struct extent_map_tree *tree);
-struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree,
-                                        u64 start, u64 len);
-void remove_extent_mapping(struct btrfs_inode *inode, struct extent_map *em);
-int split_extent_map(struct btrfs_inode *inode, u64 start, u64 len, u64 pre,
-                    u64 new_logical);
+void btrfs_extent_map_tree_init(struct extent_map_tree *tree);
+struct extent_map *btrfs_lookup_extent_mapping(struct extent_map_tree *tree,
+                                              u64 start, u64 len);
+void btrfs_remove_extent_mapping(struct btrfs_inode *inode, struct extent_map *em);
+int btrfs_split_extent_map(struct btrfs_inode *inode, u64 start, u64 len, u64 pre,
+                          u64 new_logical);
 
 struct extent_map *btrfs_alloc_extent_map(void);
 void btrfs_free_extent_map(struct extent_map *em);
-int __init extent_map_init(void);
-void __cold extent_map_exit(void);
-int unpin_extent_cache(struct btrfs_inode *inode, u64 start, u64 len, u64 gen);
-void clear_em_logging(struct btrfs_inode *inode, struct extent_map *em);
-struct extent_map *search_extent_mapping(struct extent_map_tree *tree,
-                                        u64 start, u64 len);
+int __init btrfs_extent_map_init(void);
+void __cold btrfs_extent_map_exit(void);
+int btrfs_unpin_extent_cache(struct btrfs_inode *inode, u64 start, u64 len, u64 gen);
+void btrfs_clear_em_logging(struct btrfs_inode *inode, struct extent_map *em);
+struct extent_map *btrfs_search_extent_mapping(struct extent_map_tree *tree,
+                                              u64 start, u64 len);
 int btrfs_add_extent_mapping(struct btrfs_inode *inode,
                             struct extent_map **em_in, u64 start, u64 len);
 void btrfs_drop_extent_map_range(struct btrfs_inode *inode,
 
        u64 alloc_hint = 0;
 
        read_lock(&em_tree->lock);
-       em = search_extent_mapping(em_tree, start, num_bytes);
+       em = btrfs_search_extent_mapping(em_tree, start, num_bytes);
        if (em) {
                /*
                 * if block start isn't an actual block number then find the
                 */
                if (em->disk_bytenr >= EXTENT_MAP_LAST_BYTE) {
                        btrfs_free_extent_map(em);
-                       em = search_extent_mapping(em_tree, 0, 0);
+                       em = btrfs_search_extent_mapping(em_tree, 0, 0);
                        if (em && em->disk_bytenr < EXTENT_MAP_LAST_BYTE)
                                alloc_hint = btrfs_extent_map_block_start(em);
                        if (em)
                goto out;
        }
 
-       ret = unpin_extent_cache(inode, ordered_extent->file_offset,
-                                ordered_extent->num_bytes, trans->transid);
+       ret = btrfs_unpin_extent_cache(inode, ordered_extent->file_offset,
+                                      ordered_extent->num_bytes, trans->transid);
        if (ret < 0) {
                btrfs_abort_transaction(trans, ret);
                goto out;
        struct extent_map_tree *em_tree = &inode->extent_tree;
 
        read_lock(&em_tree->lock);
-       em = lookup_extent_mapping(em_tree, start, len);
+       em = btrfs_lookup_extent_mapping(em_tree, start, len);
        read_unlock(&em_tree->lock);
 
        if (em) {
        ei->i_otime_nsec = 0;
 
        inode = &ei->vfs_inode;
-       extent_map_tree_init(&ei->extent_tree);
+       btrfs_extent_map_tree_init(&ei->extent_tree);
 
        /* This io tree sets the valid inode. */
        btrfs_extent_io_tree_init(fs_info, &ei->io_tree, IO_TREE_INODE_IO);
 
                .init_func = btrfs_bioset_init,
                .exit_func = btrfs_bioset_exit,
        }, {
-               .init_func = extent_map_init,
-               .exit_func = extent_map_exit,
+               .init_func = btrfs_extent_map_init,
+               .exit_func = btrfs_extent_map_exit,
 #ifdef CONFIG_BTRFS_EXPERIMENTAL
        }, {
                .init_func = btrfs_read_policy_init,
 
        while (!RB_EMPTY_ROOT(&em_tree->root)) {
                node = rb_first(&em_tree->root);
                em = rb_entry(node, struct extent_map, rb_node);
-               remove_extent_mapping(inode, em);
+               btrfs_remove_extent_mapping(inode, em);
 
 #ifdef CONFIG_BTRFS_DEBUG
                if (refcount_read(&em->refs) != 1) {
        /* Make sure our extent maps look sane. */
        ret = -EINVAL;
 
-       em = lookup_extent_mapping(em_tree, 0, SZ_16K);
+       em = btrfs_lookup_extent_mapping(em_tree, 0, SZ_16K);
        if (!em) {
                test_err("didn't find an em at 0 as expected");
                goto out;
        btrfs_free_extent_map(em);
 
        read_lock(&em_tree->lock);
-       em = lookup_extent_mapping(em_tree, SZ_16K, SZ_16K);
+       em = btrfs_lookup_extent_mapping(em_tree, SZ_16K, SZ_16K);
        read_unlock(&em_tree->lock);
        if (em) {
                test_err("found an em when we weren't expecting one");
        }
 
        read_lock(&em_tree->lock);
-       em = lookup_extent_mapping(em_tree, SZ_32K, SZ_16K);
+       em = btrfs_lookup_extent_mapping(em_tree, SZ_32K, SZ_16K);
        read_unlock(&em_tree->lock);
        if (!em) {
                test_err("didn't find an em at 32K as expected");
        btrfs_free_extent_map(em);
 
        read_lock(&em_tree->lock);
-       em = lookup_extent_mapping(em_tree, 48 * SZ_1K, (u64)-1);
+       em = btrfs_lookup_extent_mapping(em_tree, 48 * SZ_1K, (u64)-1);
        read_unlock(&em_tree->lock);
        if (em) {
                test_err("found an unexpected em above 48K");
 out:
        btrfs_free_extent_map(em);
        /* Unpin our extent to prevent warning when removing it below. */
-       ret2 = unpin_extent_cache(inode, 0, SZ_16K, 0);
+       ret2 = btrfs_unpin_extent_cache(inode, 0, SZ_16K, 0);
        if (ret == 0)
                ret = ret2;
        ret2 = free_extent_map_tree(inode);
 
                 * private list.
                 */
                if (ret) {
-                       clear_em_logging(inode, em);
+                       btrfs_clear_em_logging(inode, em);
                        btrfs_free_extent_map(em);
                        continue;
                }
 
                ret = log_one_extent(trans, inode, em, path, ctx);
                write_lock(&tree->lock);
-               clear_em_logging(inode, em);
+               btrfs_clear_em_logging(inode, em);
                btrfs_free_extent_map(em);
        }
        WARN_ON(!list_empty(&extents));
 
        ordered->disk_bytenr = logical;
 
        write_lock(&em_tree->lock);
-       em = search_extent_mapping(em_tree, ordered->file_offset,
-                                  ordered->num_bytes);
+       em = btrfs_search_extent_mapping(em_tree, ordered->file_offset,
+                                        ordered->num_bytes);
        /* The em should be a new COW extent, thus it should not have an offset. */
        ASSERT(em->offset == 0);
        em->disk_bytenr = logical;
        struct btrfs_ordered_extent *new;
 
        if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) &&
-           split_extent_map(ordered->inode, ordered->file_offset,
-                            ordered->num_bytes, len, logical))
+           btrfs_split_extent_map(ordered->inode, ordered->file_offset,
+                                  ordered->num_bytes, len, logical))
                return false;
 
        new = btrfs_split_ordered_extent(ordered, len);