Lines Matching refs:lower
3042 INIT_LIST_HEAD(&node->lower); in btrfs_backref_alloc_node()
3056 ASSERT(list_empty(&node->lower)); in btrfs_backref_free_node()
3115 list_del_init(&node->lower); in btrfs_backref_drop_node()
3165 struct btrfs_backref_node *lower, in btrfs_backref_link_edge() argument
3168 ASSERT(upper && lower && upper->level == lower->level + 1); in btrfs_backref_link_edge()
3169 edge->node[LOWER] = lower; in btrfs_backref_link_edge()
3171 list_add_tail(&edge->list[LOWER], &lower->upper); in btrfs_backref_link_edge()
3267 struct btrfs_backref_node *lower; in handle_indirect_tree_backref() local
3333 lower = cur; in handle_indirect_tree_backref()
3339 lower->bytenr); in handle_indirect_tree_backref()
3344 list_add(&lower->list, &cache->useless_node); in handle_indirect_tree_backref()
3346 lower->root = root; in handle_indirect_tree_backref()
3362 lower->level + 1); in handle_indirect_tree_backref()
3411 btrfs_backref_link_edge(edge, lower, upper); in handle_indirect_tree_backref()
3417 lower = upper; in handle_indirect_tree_backref()
3583 struct btrfs_backref_node *lower; in btrfs_backref_finish_upper_links() local
3589 lower = edge->node[LOWER]; in btrfs_backref_finish_upper_links()
3597 if (list_empty(&lower->upper)) in btrfs_backref_finish_upper_links()
3598 list_add(&lower->list, useless_node); in btrfs_backref_finish_upper_links()
3610 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_finish_upper_links()
3626 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_finish_upper_links()
3641 struct btrfs_backref_node *lower; in btrfs_backref_error_cleanup() local
3646 lower = list_first_entry(&cache->useless_node, in btrfs_backref_error_cleanup()
3648 list_del_init(&lower->list); in btrfs_backref_error_cleanup()
3655 lower = edge->node[LOWER]; in btrfs_backref_error_cleanup()
3663 if (list_empty(&lower->upper) && in btrfs_backref_error_cleanup()
3664 RB_EMPTY_NODE(&lower->rb_node)) in btrfs_backref_error_cleanup()
3665 list_add(&lower->list, &cache->useless_node); in btrfs_backref_error_cleanup()
3679 lower = list_first_entry(&cache->useless_node, in btrfs_backref_error_cleanup()
3681 list_del_init(&lower->list); in btrfs_backref_error_cleanup()
3682 if (lower == node) in btrfs_backref_error_cleanup()
3684 btrfs_backref_drop_node(cache, lower); in btrfs_backref_error_cleanup()