Lines Matching refs:lower
2506 INIT_LIST_HEAD(&node->lower);
2555 if (list_empty(&upper->lower)) {
2556 list_add_tail(&upper->lower, &cache->leaves);
2580 struct btrfs_backref_node, lower);
2689 struct btrfs_backref_node *lower; local
2751 lower = cur;
2757 lower->bytenr);
2762 list_add(&lower->list, &cache->useless_node);
2764 lower->root = root;
2780 lower->level + 1);
2822 btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER);
2828 lower = upper;
2990 list_add_tail(&start->lower, &cache->leaves);
3003 struct btrfs_backref_node *lower; local
3009 lower = edge->node[LOWER];
3017 if (list_empty(&lower->upper))
3018 list_add(&lower->list, useless_node);
3031 list_del_init(&upper->lower);
3035 list_add_tail(&edge->list[UPPER], &upper->lower);
3062 list_add_tail(&edge->list[UPPER], &upper->lower);
3077 struct btrfs_backref_node *lower; local
3082 lower = list_first_entry(&cache->useless_node,
3084 list_del_init(&lower->list);
3091 lower = edge->node[LOWER];
3099 if (list_empty(&lower->upper) &&
3100 RB_EMPTY_NODE(&lower->rb_node))
3101 list_add(&lower->list, &cache->useless_node);
3115 lower = list_first_entry(&cache->useless_node,
3117 list_del_init(&lower->list);
3118 if (lower == node)
3120 btrfs_backref_drop_node(cache, lower);