Lines Matching defs:upper
200 while (!list_empty(&node->upper)) {
201 edge = list_entry(node->upper.next,
224 if (list_is_last(&edge->list[LOWER], &lower->upper)) {
408 ASSERT(list_empty(&cur->upper));
432 if (list_empty(&lower->upper))
440 * Backref nodes for upper level tree blocks are left in the
460 * upper level blocks that reference the block, and then check backrefs of
461 * these upper level blocks recursively. The recursion stops when tree root is
465 * all upper level blocks that directly/indirectly reference the block are also
521 /* Finish the upper linkage of newly added edges/nodes */
617 &new_edge->node[LOWER]->upper);
1745 * In merge_reloc_root(), we modify the upper level pointer to swap the
2341 if (list_empty(&next->upper))
2344 edge = list_entry(next->upper.next,
2396 * relocate a block tree, and then update pointers in upper level
2408 struct btrfs_backref_node *upper;
2426 list_for_each_entry(edge, &node->upper, list[LOWER]) {
2431 upper = edge->node[UPPER];
2432 root = select_reloc_root(trans, rc, upper, edges);
2438 if (upper->eb && !upper->locked) {
2440 ret = btrfs_bin_search(upper->eb, 0, key, &slot);
2444 bytenr = btrfs_node_blockptr(upper->eb, slot);
2448 btrfs_backref_drop_node_buffer(upper);
2451 if (!upper->eb) {
2461 if (!upper->eb) {
2462 upper->eb = path->nodes[upper->level];
2463 path->nodes[upper->level] = NULL;
2465 BUG_ON(upper->eb != path->nodes[upper->level]);
2468 upper->locked = 1;
2469 path->locks[upper->level] = 0;
2471 slot = path->slots[upper->level];
2474 ret = btrfs_bin_search(upper->eb, 0, key, &slot);
2480 bytenr = btrfs_node_blockptr(upper->eb, slot);
2484 "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu",
2486 upper->eb->start);
2496 eb = btrfs_read_node_slot(upper->eb, slot);
2504 ret = btrfs_cow_block(trans, root, eb, upper->eb,
2516 btrfs_set_node_blockptr(upper->eb, slot,
2518 btrfs_set_node_ptr_generation(upper->eb, slot,
2520 btrfs_mark_buffer_dirty(trans, upper->eb);
2524 upper->eb->start);
2526 btrfs_header_owner(upper->eb),
2531 upper->eb);
2536 if (!upper->pending)
2537 btrfs_backref_drop_node_buffer(upper);
2539 btrfs_backref_unlock_node_buffer(upper);
2619 if (list_empty(&next->upper))
2622 edge = list_entry(next->upper.next,