Searched refs:LOWER (Results 1 – 3 of 3) sorted by relevance
| /fs/btrfs/ |
| A D | backref.c | 3138 list[LOWER]); in btrfs_backref_cleanup_node()
3139 list_del(&edge->list[LOWER]); in btrfs_backref_cleanup_node()
3169 edge->node[LOWER] = lower; in btrfs_backref_link_edge()
3171 list_add_tail(&edge->list[LOWER], &lower->upper); in btrfs_backref_link_edge()
3473 list[LOWER]); in btrfs_backref_add_tree_node()
3578 list_for_each_entry(edge, &start->upper, list[LOWER]) in btrfs_backref_finish_upper_links()
3589 lower = edge->node[LOWER]; in btrfs_backref_finish_upper_links()
3593 list_del(&edge->list[LOWER]); in btrfs_backref_finish_upper_links()
3632 list_for_each_entry(edge, &upper->upper, list[LOWER]) in btrfs_backref_finish_upper_links()
3654 list_del(&edge->list[LOWER]); in btrfs_backref_error_cleanup()
[all …]
|
| A D | relocation.c | 210 list[LOWER]); in walk_up_backref()
231 lower = edge->node[LOWER]; in walk_down_backref()
232 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref()
236 edge = list_first_entry(&edge->list[LOWER], struct btrfs_backref_edge, in walk_down_backref()
237 list[LOWER]); in walk_down_backref()
364 list_del(&edge->list[LOWER]); in handle_useless_nodes()
365 lower = edge->node[LOWER]; in handle_useless_nodes()
2140 list[LOWER]); in calcu_metadata_size()
2226 list_for_each_entry(edge, &node->upper, list[LOWER]) { in do_relocation()
2426 list[LOWER]); in update_processed_blocks()
|
| A D | backref.h | 369 #define LOWER 0 macro
|
Completed in 19 milliseconds