| H A D | backref.c | 150 struct preftrees { struct
419 struct preftrees *preftrees, int level, u64 parent, in add_direct_ref() argument
423 return add_prelim_ref(fs_info, &preftrees->direct, 0, NULL, level, in add_direct_ref()
429 struct preftrees *preftrees, u64 root_id, in add_indirect_ref() argument
434 struct preftree *tree = &preftrees->indirect; in add_indirect_ref()
437 tree = &preftrees->indirect_missing_keys; in add_indirect_ref()
442 static int is_shared_data_backref(struct preftrees *preftrees, u6 argument
151 directpreftrees global() argument
152 indirectpreftrees global() argument
153 indirect_missing_keyspreftrees global() argument
470 add_all_parents(struct btrfs_backref_walk_ctx * ctx,struct btrfs_root * root,struct btrfs_path * path,struct ulist * parents,struct preftrees * preftrees,struct prelim_ref * ref,int level) add_all_parents() argument
592 resolve_indirect_ref(struct btrfs_backref_walk_ctx * ctx,struct btrfs_path * path,struct preftrees * preftrees,struct prelim_ref * ref,struct ulist * parents) resolve_indirect_ref() argument
733 resolve_indirect_refs(struct btrfs_backref_walk_ctx * ctx,struct btrfs_path * path,struct preftrees * preftrees,struct share_check * sc) resolve_indirect_refs() argument
837 add_missing_keys(struct btrfs_fs_info * fs_info,struct preftrees * preftrees,bool lock) add_missing_keys() argument
889 add_delayed_refs(const struct btrfs_fs_info * fs_info,struct btrfs_delayed_ref_head * head,u64 seq,struct preftrees * preftrees,struct share_check * sc) add_delayed_refs() argument
1008 add_inline_refs(struct btrfs_backref_walk_ctx * ctx,struct btrfs_path * path,int * info_level,struct preftrees * preftrees,struct share_check * sc) add_inline_refs() argument
1142 add_keyed_refs(struct btrfs_backref_walk_ctx * ctx,struct btrfs_root * extent_root,struct btrfs_path * path,int info_level,struct preftrees * preftrees,struct share_check * sc) add_keyed_refs() argument
1391 struct preftrees preftrees = { find_parent_nodes() local
[all...] |