Lines Matching defs:lower
174 * A -1 return indicates ref1 is a 'lower' block than ref2, while 1
2572 INIT_LIST_HEAD(&node->lower);
2621 if (list_empty(&upper->lower)) {
2622 list_add_tail(&upper->lower, &cache->leaves);
2646 struct btrfs_backref_node, lower);
2755 struct btrfs_backref_node *lower;
2817 lower = cur;
2823 lower->bytenr);
2828 list_add(&lower->list, &cache->useless_node);
2830 lower->root = root;
2846 lower->level + 1);
2888 btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER);
2894 lower = upper;
3056 list_add_tail(&start->lower, &cache->leaves);
3069 struct btrfs_backref_node *lower;
3075 lower = edge->node[LOWER];
3083 if (list_empty(&lower->upper))
3084 list_add(&lower->list, useless_node);
3097 list_del_init(&upper->lower);
3101 list_add_tail(&edge->list[UPPER], &upper->lower);
3128 list_add_tail(&edge->list[UPPER], &upper->lower);
3143 struct btrfs_backref_node *lower;
3148 lower = list_first_entry(&cache->useless_node,
3150 list_del_init(&lower->list);
3157 lower = edge->node[LOWER];
3165 if (list_empty(&lower->upper) &&
3166 RB_EMPTY_NODE(&lower->rb_node))
3167 list_add(&lower->list, &cache->useless_node);
3181 lower = list_first_entry(&cache->useless_node,
3183 list_del_init(&lower->list);
3184 if (lower == node)
3186 btrfs_backref_drop_node(cache, lower);