19888c340SDavid Sterba /* SPDX-License-Identifier: GPL-2.0 */ 2a542ad1bSJan Schmidt /* 3a542ad1bSJan Schmidt * Copyright (C) 2011 STRATO. All rights reserved. 4a542ad1bSJan Schmidt */ 5a542ad1bSJan Schmidt 69888c340SDavid Sterba #ifndef BTRFS_BACKREF_H 79888c340SDavid Sterba #define BTRFS_BACKREF_H 8a542ad1bSJan Schmidt 955e301fdSFilipe Brandenburger #include <linux/btrfs.h> 108da6d581SJan Schmidt #include "ulist.h" 11741188d3SQu Wenruo #include "disk-io.h" 1291cb916cSAlexander Block #include "extent_io.h" 13a542ad1bSJan Schmidt 14a542ad1bSJan Schmidt struct inode_fs_paths { 15a542ad1bSJan Schmidt struct btrfs_path *btrfs_path; 16a542ad1bSJan Schmidt struct btrfs_root *fs_root; 17a542ad1bSJan Schmidt struct btrfs_data_container *fspath; 18a542ad1bSJan Schmidt }; 19a542ad1bSJan Schmidt 2012a824dcSFilipe Manana struct btrfs_backref_shared_cache_entry { 2112a824dcSFilipe Manana u64 bytenr; 2212a824dcSFilipe Manana u64 gen; 2312a824dcSFilipe Manana bool is_shared; 2412a824dcSFilipe Manana }; 2512a824dcSFilipe Manana 2612a824dcSFilipe Manana struct btrfs_backref_shared_cache { 2712a824dcSFilipe Manana /* 2812a824dcSFilipe Manana * A path from a root to a leaf that has a file extent item pointing to 2912a824dcSFilipe Manana * a given data extent should never exceed the maximum b+tree height. 3012a824dcSFilipe Manana */ 3112a824dcSFilipe Manana struct btrfs_backref_shared_cache_entry entries[BTRFS_MAX_LEVEL]; 3212a824dcSFilipe Manana }; 3312a824dcSFilipe Manana 34a542ad1bSJan Schmidt typedef int (iterate_extent_inodes_t)(u64 inum, u64 offset, u64 root, 35a542ad1bSJan Schmidt void *ctx); 36a542ad1bSJan Schmidt 37a542ad1bSJan Schmidt int extent_from_logical(struct btrfs_fs_info *fs_info, u64 logical, 3869917e43SLiu Bo struct btrfs_path *path, struct btrfs_key *found_key, 3969917e43SLiu Bo u64 *flags); 40a542ad1bSJan Schmidt 41a542ad1bSJan Schmidt int tree_backref_for_extent(unsigned long *ptr, struct extent_buffer *eb, 426eda71d0SLiu Bo struct btrfs_key *key, struct btrfs_extent_item *ei, 436eda71d0SLiu Bo u32 item_size, u64 *out_root, u8 *out_level); 44a542ad1bSJan Schmidt 45a542ad1bSJan Schmidt int iterate_extent_inodes(struct btrfs_fs_info *fs_info, 46a542ad1bSJan Schmidt u64 extent_item_objectid, 477a3ae2f8SJan Schmidt u64 extent_offset, int search_commit_root, 48c995ab3cSZygo Blaxell iterate_extent_inodes_t *iterate, void *ctx, 49c995ab3cSZygo Blaxell bool ignore_offset); 50a542ad1bSJan Schmidt 51a542ad1bSJan Schmidt int iterate_inodes_from_logical(u64 logical, struct btrfs_fs_info *fs_info, 52e3059ec0SDavid Sterba struct btrfs_path *path, void *ctx, 53c995ab3cSZygo Blaxell bool ignore_offset); 54a542ad1bSJan Schmidt 55a542ad1bSJan Schmidt int paths_from_inode(u64 inum, struct inode_fs_paths *ipath); 56a542ad1bSJan Schmidt 5719b546d7SQu Wenruo int btrfs_find_all_leafs(struct btrfs_trans_handle *trans, 5819b546d7SQu Wenruo struct btrfs_fs_info *fs_info, u64 bytenr, 5919b546d7SQu Wenruo u64 time_seq, struct ulist **leafs, 6019b546d7SQu Wenruo const u64 *extent_item_pos, bool ignore_offset); 618da6d581SJan Schmidt int btrfs_find_all_roots(struct btrfs_trans_handle *trans, 628da6d581SJan Schmidt struct btrfs_fs_info *fs_info, u64 bytenr, 63c7bcbb21SFilipe Manana u64 time_seq, struct ulist **roots, 648949b9a1SFilipe Manana bool skip_commit_root_sem); 6596b5bd77SJan Schmidt char *btrfs_ref_to_path(struct btrfs_root *fs_root, struct btrfs_path *path, 6696b5bd77SJan Schmidt u32 name_len, unsigned long name_off, 6796b5bd77SJan Schmidt struct extent_buffer *eb_in, u64 parent, 6896b5bd77SJan Schmidt char *dest, u32 size); 698da6d581SJan Schmidt 70a542ad1bSJan Schmidt struct btrfs_data_container *init_data_container(u32 total_bytes); 71a542ad1bSJan Schmidt struct inode_fs_paths *init_ipath(s32 total_bytes, struct btrfs_root *fs_root, 72a542ad1bSJan Schmidt struct btrfs_path *path); 73a542ad1bSJan Schmidt void free_ipath(struct inode_fs_paths *ipath); 74a542ad1bSJan Schmidt 75f186373fSMark Fasheh int btrfs_find_one_extref(struct btrfs_root *root, u64 inode_objectid, 76f186373fSMark Fasheh u64 start_off, struct btrfs_path *path, 77f186373fSMark Fasheh struct btrfs_inode_extref **ret_extref, 78f186373fSMark Fasheh u64 *found_off); 798eedaddaSFilipe Manana int btrfs_is_data_extent_shared(struct btrfs_root *root, u64 inum, u64 bytenr, 80*b8f164e3SFilipe Manana u64 extent_gen, 8112a824dcSFilipe Manana struct ulist *roots, struct ulist *tmp, 8212a824dcSFilipe Manana struct btrfs_backref_shared_cache *cache); 83f186373fSMark Fasheh 84b9e9a6cbSWang Shilong int __init btrfs_prelim_ref_init(void); 85e67c718bSDavid Sterba void __cold btrfs_prelim_ref_exit(void); 8600142756SJeff Mahoney 8700142756SJeff Mahoney struct prelim_ref { 8800142756SJeff Mahoney struct rb_node rbnode; 8900142756SJeff Mahoney u64 root_id; 9000142756SJeff Mahoney struct btrfs_key key_for_search; 9100142756SJeff Mahoney int level; 9200142756SJeff Mahoney int count; 9300142756SJeff Mahoney struct extent_inode_elem *inode_list; 9400142756SJeff Mahoney u64 parent; 9500142756SJeff Mahoney u64 wanted_disk_byte; 9600142756SJeff Mahoney }; 9700142756SJeff Mahoney 98a37f232bSQu Wenruo /* 99a37f232bSQu Wenruo * Iterate backrefs of one extent. 100a37f232bSQu Wenruo * 101a37f232bSQu Wenruo * Now it only supports iteration of tree block in commit root. 102a37f232bSQu Wenruo */ 103a37f232bSQu Wenruo struct btrfs_backref_iter { 104a37f232bSQu Wenruo u64 bytenr; 105a37f232bSQu Wenruo struct btrfs_path *path; 106a37f232bSQu Wenruo struct btrfs_fs_info *fs_info; 107a37f232bSQu Wenruo struct btrfs_key cur_key; 108a37f232bSQu Wenruo u32 item_ptr; 109a37f232bSQu Wenruo u32 cur_ptr; 110a37f232bSQu Wenruo u32 end_ptr; 111a37f232bSQu Wenruo }; 112a37f232bSQu Wenruo 113a37f232bSQu Wenruo struct btrfs_backref_iter *btrfs_backref_iter_alloc( 114a37f232bSQu Wenruo struct btrfs_fs_info *fs_info, gfp_t gfp_flag); 115a37f232bSQu Wenruo 116a37f232bSQu Wenruo static inline void btrfs_backref_iter_free(struct btrfs_backref_iter *iter) 117a37f232bSQu Wenruo { 118a37f232bSQu Wenruo if (!iter) 119a37f232bSQu Wenruo return; 120a37f232bSQu Wenruo btrfs_free_path(iter->path); 121a37f232bSQu Wenruo kfree(iter); 122a37f232bSQu Wenruo } 123a37f232bSQu Wenruo 124c39c2ddcSQu Wenruo static inline struct extent_buffer *btrfs_backref_get_eb( 125c39c2ddcSQu Wenruo struct btrfs_backref_iter *iter) 126c39c2ddcSQu Wenruo { 127c39c2ddcSQu Wenruo if (!iter) 128c39c2ddcSQu Wenruo return NULL; 129c39c2ddcSQu Wenruo return iter->path->nodes[0]; 130c39c2ddcSQu Wenruo } 131c39c2ddcSQu Wenruo 132c39c2ddcSQu Wenruo /* 133c39c2ddcSQu Wenruo * For metadata with EXTENT_ITEM key (non-skinny) case, the first inline data 134c39c2ddcSQu Wenruo * is btrfs_tree_block_info, without a btrfs_extent_inline_ref header. 135c39c2ddcSQu Wenruo * 136c39c2ddcSQu Wenruo * This helper determines if that's the case. 137c39c2ddcSQu Wenruo */ 138c39c2ddcSQu Wenruo static inline bool btrfs_backref_has_tree_block_info( 139c39c2ddcSQu Wenruo struct btrfs_backref_iter *iter) 140c39c2ddcSQu Wenruo { 141c39c2ddcSQu Wenruo if (iter->cur_key.type == BTRFS_EXTENT_ITEM_KEY && 142c39c2ddcSQu Wenruo iter->cur_ptr - iter->item_ptr == sizeof(struct btrfs_extent_item)) 143c39c2ddcSQu Wenruo return true; 144c39c2ddcSQu Wenruo return false; 145c39c2ddcSQu Wenruo } 146c39c2ddcSQu Wenruo 147a37f232bSQu Wenruo int btrfs_backref_iter_start(struct btrfs_backref_iter *iter, u64 bytenr); 148a37f232bSQu Wenruo 149c39c2ddcSQu Wenruo int btrfs_backref_iter_next(struct btrfs_backref_iter *iter); 150c39c2ddcSQu Wenruo 151c39c2ddcSQu Wenruo static inline bool btrfs_backref_iter_is_inline_ref( 152c39c2ddcSQu Wenruo struct btrfs_backref_iter *iter) 153c39c2ddcSQu Wenruo { 154c39c2ddcSQu Wenruo if (iter->cur_key.type == BTRFS_EXTENT_ITEM_KEY || 155c39c2ddcSQu Wenruo iter->cur_key.type == BTRFS_METADATA_ITEM_KEY) 156c39c2ddcSQu Wenruo return true; 157c39c2ddcSQu Wenruo return false; 158c39c2ddcSQu Wenruo } 159c39c2ddcSQu Wenruo 160a37f232bSQu Wenruo static inline void btrfs_backref_iter_release(struct btrfs_backref_iter *iter) 161a37f232bSQu Wenruo { 162a37f232bSQu Wenruo iter->bytenr = 0; 163a37f232bSQu Wenruo iter->item_ptr = 0; 164a37f232bSQu Wenruo iter->cur_ptr = 0; 165a37f232bSQu Wenruo iter->end_ptr = 0; 166a37f232bSQu Wenruo btrfs_release_path(iter->path); 167a37f232bSQu Wenruo memset(&iter->cur_key, 0, sizeof(iter->cur_key)); 168a37f232bSQu Wenruo } 169a37f232bSQu Wenruo 17070535441SQu Wenruo /* 17170535441SQu Wenruo * Backref cache related structures 17270535441SQu Wenruo * 17370535441SQu Wenruo * The whole objective of backref_cache is to build a bi-directional map 17470535441SQu Wenruo * of tree blocks (represented by backref_node) and all their parents. 17570535441SQu Wenruo */ 17670535441SQu Wenruo 17770535441SQu Wenruo /* 17870535441SQu Wenruo * Represent a tree block in the backref cache 17970535441SQu Wenruo */ 18070535441SQu Wenruo struct btrfs_backref_node { 181e9a28dc5SQu Wenruo struct { 18270535441SQu Wenruo struct rb_node rb_node; 18370535441SQu Wenruo u64 bytenr; 184e9a28dc5SQu Wenruo }; /* Use rb_simple_node for search/insert */ 18570535441SQu Wenruo 18670535441SQu Wenruo u64 new_bytenr; 18770535441SQu Wenruo /* Objectid of tree block owner, can be not uptodate */ 18870535441SQu Wenruo u64 owner; 18970535441SQu Wenruo /* Link to pending, changed or detached list */ 19070535441SQu Wenruo struct list_head list; 19170535441SQu Wenruo 19270535441SQu Wenruo /* List of upper level edges, which link this node to its parents */ 19370535441SQu Wenruo struct list_head upper; 19470535441SQu Wenruo /* List of lower level edges, which link this node to its children */ 19570535441SQu Wenruo struct list_head lower; 19670535441SQu Wenruo 19770535441SQu Wenruo /* NULL if this node is not tree root */ 19870535441SQu Wenruo struct btrfs_root *root; 19970535441SQu Wenruo /* Extent buffer got by COWing the block */ 20070535441SQu Wenruo struct extent_buffer *eb; 20170535441SQu Wenruo /* Level of the tree block */ 20270535441SQu Wenruo unsigned int level:8; 20392a7cc42SQu Wenruo /* Is the block in a non-shareable tree */ 20470535441SQu Wenruo unsigned int cowonly:1; 20570535441SQu Wenruo /* 1 if no child node is in the cache */ 20670535441SQu Wenruo unsigned int lowest:1; 20770535441SQu Wenruo /* Is the extent buffer locked */ 20870535441SQu Wenruo unsigned int locked:1; 20970535441SQu Wenruo /* Has the block been processed */ 21070535441SQu Wenruo unsigned int processed:1; 21170535441SQu Wenruo /* Have backrefs of this block been checked */ 21270535441SQu Wenruo unsigned int checked:1; 21370535441SQu Wenruo /* 21470535441SQu Wenruo * 1 if corresponding block has been COWed but some upper level block 21570535441SQu Wenruo * pointers may not point to the new location 21670535441SQu Wenruo */ 21770535441SQu Wenruo unsigned int pending:1; 21870535441SQu Wenruo /* 1 if the backref node isn't connected to any other backref node */ 21970535441SQu Wenruo unsigned int detached:1; 22070535441SQu Wenruo 22170535441SQu Wenruo /* 22270535441SQu Wenruo * For generic purpose backref cache, where we only care if it's a reloc 22370535441SQu Wenruo * root, doesn't care the source subvolid. 22470535441SQu Wenruo */ 22570535441SQu Wenruo unsigned int is_reloc_root:1; 22670535441SQu Wenruo }; 22770535441SQu Wenruo 22870535441SQu Wenruo #define LOWER 0 22970535441SQu Wenruo #define UPPER 1 23070535441SQu Wenruo 23170535441SQu Wenruo /* 23270535441SQu Wenruo * Represent an edge connecting upper and lower backref nodes. 23370535441SQu Wenruo */ 23470535441SQu Wenruo struct btrfs_backref_edge { 23570535441SQu Wenruo /* 23670535441SQu Wenruo * list[LOWER] is linked to btrfs_backref_node::upper of lower level 23770535441SQu Wenruo * node, and list[UPPER] is linked to btrfs_backref_node::lower of 23870535441SQu Wenruo * upper level node. 23970535441SQu Wenruo * 24070535441SQu Wenruo * Also, build_backref_tree() uses list[UPPER] for pending edges, before 24170535441SQu Wenruo * linking list[UPPER] to its upper level nodes. 24270535441SQu Wenruo */ 24370535441SQu Wenruo struct list_head list[2]; 24470535441SQu Wenruo 24570535441SQu Wenruo /* Two related nodes */ 24670535441SQu Wenruo struct btrfs_backref_node *node[2]; 24770535441SQu Wenruo }; 24870535441SQu Wenruo 24970535441SQu Wenruo struct btrfs_backref_cache { 25070535441SQu Wenruo /* Red black tree of all backref nodes in the cache */ 25170535441SQu Wenruo struct rb_root rb_root; 25270535441SQu Wenruo /* For passing backref nodes to btrfs_reloc_cow_block */ 25370535441SQu Wenruo struct btrfs_backref_node *path[BTRFS_MAX_LEVEL]; 25470535441SQu Wenruo /* 25570535441SQu Wenruo * List of blocks that have been COWed but some block pointers in upper 25670535441SQu Wenruo * level blocks may not reflect the new location 25770535441SQu Wenruo */ 25870535441SQu Wenruo struct list_head pending[BTRFS_MAX_LEVEL]; 25970535441SQu Wenruo /* List of backref nodes with no child node */ 26070535441SQu Wenruo struct list_head leaves; 26170535441SQu Wenruo /* List of blocks that have been COWed in current transaction */ 26270535441SQu Wenruo struct list_head changed; 26370535441SQu Wenruo /* List of detached backref node. */ 26470535441SQu Wenruo struct list_head detached; 26570535441SQu Wenruo 26670535441SQu Wenruo u64 last_trans; 26770535441SQu Wenruo 26870535441SQu Wenruo int nr_nodes; 26970535441SQu Wenruo int nr_edges; 27070535441SQu Wenruo 27170535441SQu Wenruo /* List of unchecked backref edges during backref cache build */ 27270535441SQu Wenruo struct list_head pending_edge; 27370535441SQu Wenruo 27470535441SQu Wenruo /* List of useless backref nodes during backref cache build */ 27570535441SQu Wenruo struct list_head useless_node; 27670535441SQu Wenruo 27770535441SQu Wenruo struct btrfs_fs_info *fs_info; 27870535441SQu Wenruo 27970535441SQu Wenruo /* 28070535441SQu Wenruo * Whether this cache is for relocation 28170535441SQu Wenruo * 28270535441SQu Wenruo * Reloction backref cache require more info for reloc root compared 28370535441SQu Wenruo * to generic backref cache. 28470535441SQu Wenruo */ 28570535441SQu Wenruo unsigned int is_reloc; 28670535441SQu Wenruo }; 28770535441SQu Wenruo 288584fb121SQu Wenruo void btrfs_backref_init_cache(struct btrfs_fs_info *fs_info, 289584fb121SQu Wenruo struct btrfs_backref_cache *cache, int is_reloc); 290b1818dabSQu Wenruo struct btrfs_backref_node *btrfs_backref_alloc_node( 291b1818dabSQu Wenruo struct btrfs_backref_cache *cache, u64 bytenr, int level); 29247254d07SQu Wenruo struct btrfs_backref_edge *btrfs_backref_alloc_edge( 29347254d07SQu Wenruo struct btrfs_backref_cache *cache); 294584fb121SQu Wenruo 295f39911e5SQu Wenruo #define LINK_LOWER (1 << 0) 296f39911e5SQu Wenruo #define LINK_UPPER (1 << 1) 297f39911e5SQu Wenruo static inline void btrfs_backref_link_edge(struct btrfs_backref_edge *edge, 298f39911e5SQu Wenruo struct btrfs_backref_node *lower, 299f39911e5SQu Wenruo struct btrfs_backref_node *upper, 300f39911e5SQu Wenruo int link_which) 301f39911e5SQu Wenruo { 302f39911e5SQu Wenruo ASSERT(upper && lower && upper->level == lower->level + 1); 303f39911e5SQu Wenruo edge->node[LOWER] = lower; 304f39911e5SQu Wenruo edge->node[UPPER] = upper; 305f39911e5SQu Wenruo if (link_which & LINK_LOWER) 306f39911e5SQu Wenruo list_add_tail(&edge->list[LOWER], &lower->upper); 307f39911e5SQu Wenruo if (link_which & LINK_UPPER) 308f39911e5SQu Wenruo list_add_tail(&edge->list[UPPER], &upper->lower); 309f39911e5SQu Wenruo } 310f39911e5SQu Wenruo 311741188d3SQu Wenruo static inline void btrfs_backref_free_node(struct btrfs_backref_cache *cache, 312741188d3SQu Wenruo struct btrfs_backref_node *node) 313741188d3SQu Wenruo { 314741188d3SQu Wenruo if (node) { 315eddda68dSJosef Bacik ASSERT(list_empty(&node->list)); 316eddda68dSJosef Bacik ASSERT(list_empty(&node->lower)); 317eddda68dSJosef Bacik ASSERT(node->eb == NULL); 318741188d3SQu Wenruo cache->nr_nodes--; 319741188d3SQu Wenruo btrfs_put_root(node->root); 320741188d3SQu Wenruo kfree(node); 321741188d3SQu Wenruo } 322741188d3SQu Wenruo } 323741188d3SQu Wenruo 324741188d3SQu Wenruo static inline void btrfs_backref_free_edge(struct btrfs_backref_cache *cache, 325741188d3SQu Wenruo struct btrfs_backref_edge *edge) 326741188d3SQu Wenruo { 327741188d3SQu Wenruo if (edge) { 328741188d3SQu Wenruo cache->nr_edges--; 329741188d3SQu Wenruo kfree(edge); 330741188d3SQu Wenruo } 331741188d3SQu Wenruo } 332741188d3SQu Wenruo 333b0fe7078SQu Wenruo static inline void btrfs_backref_unlock_node_buffer( 334b0fe7078SQu Wenruo struct btrfs_backref_node *node) 335b0fe7078SQu Wenruo { 336b0fe7078SQu Wenruo if (node->locked) { 337b0fe7078SQu Wenruo btrfs_tree_unlock(node->eb); 338b0fe7078SQu Wenruo node->locked = 0; 339b0fe7078SQu Wenruo } 340b0fe7078SQu Wenruo } 341b0fe7078SQu Wenruo 342b0fe7078SQu Wenruo static inline void btrfs_backref_drop_node_buffer( 343b0fe7078SQu Wenruo struct btrfs_backref_node *node) 344b0fe7078SQu Wenruo { 345b0fe7078SQu Wenruo if (node->eb) { 346b0fe7078SQu Wenruo btrfs_backref_unlock_node_buffer(node); 347b0fe7078SQu Wenruo free_extent_buffer(node->eb); 348b0fe7078SQu Wenruo node->eb = NULL; 349b0fe7078SQu Wenruo } 350b0fe7078SQu Wenruo } 351b0fe7078SQu Wenruo 352b0fe7078SQu Wenruo /* 353b0fe7078SQu Wenruo * Drop the backref node from cache without cleaning up its children 354b0fe7078SQu Wenruo * edges. 355b0fe7078SQu Wenruo * 356b0fe7078SQu Wenruo * This can only be called on node without parent edges. 357b0fe7078SQu Wenruo * The children edges are still kept as is. 358b0fe7078SQu Wenruo */ 359b0fe7078SQu Wenruo static inline void btrfs_backref_drop_node(struct btrfs_backref_cache *tree, 360b0fe7078SQu Wenruo struct btrfs_backref_node *node) 361b0fe7078SQu Wenruo { 362eddda68dSJosef Bacik ASSERT(list_empty(&node->upper)); 363b0fe7078SQu Wenruo 364b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(node); 365eddda68dSJosef Bacik list_del_init(&node->list); 366eddda68dSJosef Bacik list_del_init(&node->lower); 367b0fe7078SQu Wenruo if (!RB_EMPTY_NODE(&node->rb_node)) 368b0fe7078SQu Wenruo rb_erase(&node->rb_node, &tree->rb_root); 369b0fe7078SQu Wenruo btrfs_backref_free_node(tree, node); 370b0fe7078SQu Wenruo } 371b0fe7078SQu Wenruo 372023acb07SQu Wenruo void btrfs_backref_cleanup_node(struct btrfs_backref_cache *cache, 373023acb07SQu Wenruo struct btrfs_backref_node *node); 374023acb07SQu Wenruo 37513fe1bdbSQu Wenruo void btrfs_backref_release_cache(struct btrfs_backref_cache *cache); 37613fe1bdbSQu Wenruo 377982c92cbSQu Wenruo static inline void btrfs_backref_panic(struct btrfs_fs_info *fs_info, 378982c92cbSQu Wenruo u64 bytenr, int errno) 379982c92cbSQu Wenruo { 380982c92cbSQu Wenruo btrfs_panic(fs_info, errno, 381982c92cbSQu Wenruo "Inconsistency in backref cache found at offset %llu", 382982c92cbSQu Wenruo bytenr); 383982c92cbSQu Wenruo } 384982c92cbSQu Wenruo 3851b60d2ecSQu Wenruo int btrfs_backref_add_tree_node(struct btrfs_backref_cache *cache, 3861b60d2ecSQu Wenruo struct btrfs_path *path, 3871b60d2ecSQu Wenruo struct btrfs_backref_iter *iter, 3881b60d2ecSQu Wenruo struct btrfs_key *node_key, 3891b60d2ecSQu Wenruo struct btrfs_backref_node *cur); 3901b60d2ecSQu Wenruo 391fc997ed0SQu Wenruo int btrfs_backref_finish_upper_links(struct btrfs_backref_cache *cache, 392fc997ed0SQu Wenruo struct btrfs_backref_node *start); 393fc997ed0SQu Wenruo 3941b23ea18SQu Wenruo void btrfs_backref_error_cleanup(struct btrfs_backref_cache *cache, 3951b23ea18SQu Wenruo struct btrfs_backref_node *node); 3961b23ea18SQu Wenruo 397a542ad1bSJan Schmidt #endif 398