Lines Matching full:upper
3031 INIT_LIST_HEAD(&node->upper); in btrfs_backref_alloc_node()
3054 * upper edges and any uncached nodes in the path.
3062 struct btrfs_backref_node *upper; in btrfs_backref_cleanup_node() local
3069 while (!list_empty(&node->upper)) { in btrfs_backref_cleanup_node()
3070 edge = list_entry(node->upper.next, struct btrfs_backref_edge, in btrfs_backref_cleanup_node()
3072 upper = edge->node[UPPER]; in btrfs_backref_cleanup_node()
3074 list_del(&edge->list[UPPER]); in btrfs_backref_cleanup_node()
3081 if (list_empty(&upper->lower)) { in btrfs_backref_cleanup_node()
3082 list_add_tail(&upper->lower, &cache->leaves); in btrfs_backref_cleanup_node()
3083 upper->lowest = 1; in btrfs_backref_cleanup_node()
3140 struct btrfs_backref_node *upper; in handle_direct_tree_backref() local
3173 upper = btrfs_backref_alloc_node(cache, ref_key->offset, in handle_direct_tree_backref()
3175 if (!upper) { in handle_direct_tree_backref()
3181 * Backrefs for the upper level block isn't cached, add the in handle_direct_tree_backref()
3184 list_add_tail(&edge->list[UPPER], &cache->pending_edge); in handle_direct_tree_backref()
3187 upper = rb_entry(rb_node, struct btrfs_backref_node, rb_node); in handle_direct_tree_backref()
3188 ASSERT(upper->checked); in handle_direct_tree_backref()
3189 INIT_LIST_HEAD(&edge->list[UPPER]); in handle_direct_tree_backref()
3191 btrfs_backref_link_edge(edge, cur, upper, LINK_LOWER); in handle_direct_tree_backref()
3216 struct btrfs_backref_node *upper; in handle_indirect_tree_backref() local
3307 upper = btrfs_backref_alloc_node(cache, eb->start, in handle_indirect_tree_backref()
3309 if (!upper) { in handle_indirect_tree_backref()
3315 upper->owner = btrfs_header_owner(eb); in handle_indirect_tree_backref()
3317 upper->cowonly = 1; in handle_indirect_tree_backref()
3324 upper->checked = 0; in handle_indirect_tree_backref()
3326 upper->checked = 1; in handle_indirect_tree_backref()
3333 if (!upper->checked && need_check) { in handle_indirect_tree_backref()
3335 list_add_tail(&edge->list[UPPER], in handle_indirect_tree_backref()
3338 if (upper->checked) in handle_indirect_tree_backref()
3340 INIT_LIST_HEAD(&edge->list[UPPER]); in handle_indirect_tree_backref()
3343 upper = rb_entry(rb_node, struct btrfs_backref_node, in handle_indirect_tree_backref()
3345 ASSERT(upper->checked); in handle_indirect_tree_backref()
3346 INIT_LIST_HEAD(&edge->list[UPPER]); in handle_indirect_tree_backref()
3347 if (!upper->owner) in handle_indirect_tree_backref()
3348 upper->owner = btrfs_header_owner(eb); in handle_indirect_tree_backref()
3350 btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER); in handle_indirect_tree_backref()
3356 lower = upper; in handle_indirect_tree_backref()
3357 upper = NULL; in handle_indirect_tree_backref()
3367 * NOTE: Even if the function returned 0, @cur is not yet cached as its upper
3405 if (!list_empty(&cur->upper)) { in btrfs_backref_add_tree_node()
3410 ASSERT(list_is_singular(&cur->upper)); in btrfs_backref_add_tree_node()
3411 edge = list_entry(cur->upper.next, struct btrfs_backref_edge, in btrfs_backref_add_tree_node()
3413 ASSERT(list_empty(&edge->list[UPPER])); in btrfs_backref_add_tree_node()
3414 exist = edge->node[UPPER]; in btrfs_backref_add_tree_node()
3416 * Add the upper level block to pending list if we need check in btrfs_backref_add_tree_node()
3420 list_add_tail(&edge->list[UPPER], &cache->pending_edge); in btrfs_backref_add_tree_node()
3523 list_for_each_entry(edge, &start->upper, list[LOWER]) in btrfs_backref_finish_upper_links()
3524 list_add_tail(&edge->list[UPPER], &pending_edge); in btrfs_backref_finish_upper_links()
3527 struct btrfs_backref_node *upper; in btrfs_backref_finish_upper_links() local
3531 struct btrfs_backref_edge, list[UPPER]); in btrfs_backref_finish_upper_links()
3532 list_del_init(&edge->list[UPPER]); in btrfs_backref_finish_upper_links()
3533 upper = edge->node[UPPER]; in btrfs_backref_finish_upper_links()
3537 if (upper->detached) { in btrfs_backref_finish_upper_links()
3542 if (list_empty(&lower->upper)) in btrfs_backref_finish_upper_links()
3550 * So if we have upper->rb_node populated, this means a cache in btrfs_backref_finish_upper_links()
3551 * hit. We only need to link the edge, as @upper and all its in btrfs_backref_finish_upper_links()
3554 if (!RB_EMPTY_NODE(&upper->rb_node)) { in btrfs_backref_finish_upper_links()
3555 if (upper->lowest) { in btrfs_backref_finish_upper_links()
3556 list_del_init(&upper->lower); in btrfs_backref_finish_upper_links()
3557 upper->lowest = 0; in btrfs_backref_finish_upper_links()
3560 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_finish_upper_links()
3565 if (!upper->checked) { in btrfs_backref_finish_upper_links()
3571 if (start->cowonly != upper->cowonly) { in btrfs_backref_finish_upper_links()
3577 if (!upper->cowonly) { in btrfs_backref_finish_upper_links()
3578 rb_node = rb_simple_insert(&cache->rb_root, upper->bytenr, in btrfs_backref_finish_upper_links()
3579 &upper->rb_node); in btrfs_backref_finish_upper_links()
3582 upper->bytenr, -EEXIST); in btrfs_backref_finish_upper_links()
3587 list_add_tail(&edge->list[UPPER], &upper->lower); in btrfs_backref_finish_upper_links()
3591 * to finish the upper linkage in btrfs_backref_finish_upper_links()
3593 list_for_each_entry(edge, &upper->upper, list[LOWER]) in btrfs_backref_finish_upper_links()
3594 list_add_tail(&edge->list[UPPER], &pending_edge); in btrfs_backref_finish_upper_links()
3603 struct btrfs_backref_node *upper; in btrfs_backref_error_cleanup() local
3613 struct btrfs_backref_edge, list[UPPER]); in btrfs_backref_error_cleanup()
3614 list_del(&edge->list[UPPER]); in btrfs_backref_error_cleanup()
3617 upper = edge->node[UPPER]; in btrfs_backref_error_cleanup()
3621 * Lower is no longer linked to any upper backref nodes and in btrfs_backref_error_cleanup()
3624 if (list_empty(&lower->upper) && in btrfs_backref_error_cleanup()
3628 if (!RB_EMPTY_NODE(&upper->rb_node)) in btrfs_backref_error_cleanup()
3631 /* Add this guy's upper edges to the list to process */ in btrfs_backref_error_cleanup()
3632 list_for_each_entry(edge, &upper->upper, list[LOWER]) in btrfs_backref_error_cleanup()
3633 list_add_tail(&edge->list[UPPER], in btrfs_backref_error_cleanup()
3635 if (list_empty(&upper->upper)) in btrfs_backref_error_cleanup()
3636 list_add(&upper->list, &cache->useless_node); in btrfs_backref_error_cleanup()