Lines Matching refs:lower
3045 INIT_LIST_HEAD(&node->lower); in btrfs_backref_alloc_node()
3059 ASSERT(list_empty(&node->lower)); in btrfs_backref_free_node()
3118 list_del_init(&node->lower); in btrfs_backref_drop_node()
3153 if (list_empty(&upper->lower)) { in btrfs_backref_cleanup_node()
3154 list_add_tail(&upper->lower, &cache->leaves); in btrfs_backref_cleanup_node()
3178 struct btrfs_backref_node, lower); in btrfs_backref_release_cache()
3200 struct btrfs_backref_node *lower, in btrfs_backref_link_edge() argument
3204 ASSERT(upper && lower && upper->level == lower->level + 1); in btrfs_backref_link_edge()
3205 edge->node[LOWER] = lower; in btrfs_backref_link_edge()
3208 list_add_tail(&edge->list[LOWER], &lower->upper); in btrfs_backref_link_edge()
3210 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_link_edge()
3306 struct btrfs_backref_node *lower; in handle_indirect_tree_backref() local
3368 lower = cur; in handle_indirect_tree_backref()
3374 lower->bytenr); in handle_indirect_tree_backref()
3379 list_add(&lower->list, &cache->useless_node); in handle_indirect_tree_backref()
3381 lower->root = root; in handle_indirect_tree_backref()
3397 lower->level + 1); in handle_indirect_tree_backref()
3439 btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER); in handle_indirect_tree_backref()
3445 lower = upper; in handle_indirect_tree_backref()
3604 list_add_tail(&start->lower, &cache->leaves); in btrfs_backref_finish_upper_links()
3617 struct btrfs_backref_node *lower; in btrfs_backref_finish_upper_links() local
3623 lower = edge->node[LOWER]; in btrfs_backref_finish_upper_links()
3631 if (list_empty(&lower->upper)) in btrfs_backref_finish_upper_links()
3632 list_add(&lower->list, useless_node); in btrfs_backref_finish_upper_links()
3645 list_del_init(&upper->lower); in btrfs_backref_finish_upper_links()
3649 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_finish_upper_links()
3676 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_finish_upper_links()
3691 struct btrfs_backref_node *lower; in btrfs_backref_error_cleanup() local
3696 lower = list_first_entry(&cache->useless_node, in btrfs_backref_error_cleanup()
3698 list_del_init(&lower->list); in btrfs_backref_error_cleanup()
3705 lower = edge->node[LOWER]; in btrfs_backref_error_cleanup()
3713 if (list_empty(&lower->upper) && in btrfs_backref_error_cleanup()
3714 RB_EMPTY_NODE(&lower->rb_node)) in btrfs_backref_error_cleanup()
3715 list_add(&lower->list, &cache->useless_node); in btrfs_backref_error_cleanup()
3729 lower = list_first_entry(&cache->useless_node, in btrfs_backref_error_cleanup()
3731 list_del_init(&lower->list); in btrfs_backref_error_cleanup()
3732 if (lower == node) in btrfs_backref_error_cleanup()
3734 btrfs_backref_drop_node(cache, lower); in btrfs_backref_error_cleanup()