Lines Matching defs:lower
222 * A -1 return indicates ref1 is a 'lower' block than ref2, while 1
3029 INIT_LIST_HEAD(&node->lower);
3078 if (list_empty(&upper->lower)) {
3079 list_add_tail(&upper->lower, &cache->leaves);
3103 struct btrfs_backref_node, lower);
3214 struct btrfs_backref_node *lower;
3276 lower = cur;
3282 lower->bytenr);
3287 list_add(&lower->list, &cache->useless_node);
3289 lower->root = root;
3305 lower->level + 1);
3347 btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER);
3353 lower = upper;
3512 list_add_tail(&start->lower, &cache->leaves);
3525 struct btrfs_backref_node *lower;
3531 lower = edge->node[LOWER];
3539 if (list_empty(&lower->upper))
3540 list_add(&lower->list, useless_node);
3553 list_del_init(&upper->lower);
3557 list_add_tail(&edge->list[UPPER], &upper->lower);
3584 list_add_tail(&edge->list[UPPER], &upper->lower);
3599 struct btrfs_backref_node *lower;
3604 lower = list_first_entry(&cache->useless_node,
3606 list_del_init(&lower->list);
3613 lower = edge->node[LOWER];
3621 if (list_empty(&lower->upper) &&
3622 RB_EMPTY_NODE(&lower->rb_node))
3623 list_add(&lower->list, &cache->useless_node);
3637 lower = list_first_entry(&cache->useless_node,
3639 list_del_init(&lower->list);
3640 if (lower == node)
3642 btrfs_backref_drop_node(cache, lower);