Home
last modified time | relevance | path

Searched refs:btrfs_backref_edge (Results 1 – 3 of 3) sorted by relevance

/fs/btrfs/
Dbackref.h217 struct btrfs_backref_edge { struct
275 struct btrfs_backref_edge *btrfs_backref_alloc_edge(
280 static inline void btrfs_backref_link_edge(struct btrfs_backref_edge *edge, in btrfs_backref_link_edge()
308 struct btrfs_backref_edge *edge) in btrfs_backref_free_edge()
Drelocation.c183 struct btrfs_backref_edge *edges[], int *index) in walk_up_backref()
185 struct btrfs_backref_edge *edge; in walk_up_backref()
190 struct btrfs_backref_edge, list[LOWER]); in walk_up_backref()
203 struct btrfs_backref_edge *edges[], int *index) in walk_down_backref()
205 struct btrfs_backref_edge *edge; in walk_down_backref()
217 struct btrfs_backref_edge, list[LOWER]); in walk_down_backref()
409 struct btrfs_backref_edge *edge; in handle_useless_nodes()
413 struct btrfs_backref_edge, list[UPPER]); in handle_useless_nodes()
466 struct btrfs_backref_edge *edge; in build_backref_tree()
497 struct btrfs_backref_edge, list[UPPER]); in build_backref_tree()
[all …]
Dbackref.c2581 struct btrfs_backref_edge *btrfs_backref_alloc_edge(
2584 struct btrfs_backref_edge *edge;
2603 struct btrfs_backref_edge *edge;
2610 edge = list_entry(node->upper.next, struct btrfs_backref_edge,
2679 struct btrfs_backref_edge *edge;
2756 struct btrfs_backref_edge *edge;
2920 struct btrfs_backref_edge *edge;
2948 edge = list_entry(cur->upper.next, struct btrfs_backref_edge,
3043 struct btrfs_backref_edge *edge;
3072 struct btrfs_backref_edge, list[UPPER]);
[all …]