Lines Matching refs:lower

2506 	INIT_LIST_HEAD(&node->lower);
2562 		if (list_empty(&upper->lower)) {
2563 			list_add_tail(&upper->lower, &cache->leaves);
2587 				  struct btrfs_backref_node, lower);
2696 	struct btrfs_backref_node *lower;  local
2758 	lower = cur;
2764 			       lower->bytenr);
2769 				list_add(&lower->list, &cache->useless_node);
2771 				lower->root = root;
2787 							 lower->level + 1);
2829 		btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER);
2835 		lower = upper;
2997 		list_add_tail(&start->lower, &cache->leaves);
3010 		struct btrfs_backref_node *lower;  local
3016 		lower = edge->node[LOWER];
3024 			if (list_empty(&lower->upper))
3025 				list_add(&lower->list, useless_node);
3038 				list_del_init(&upper->lower);
3042 			list_add_tail(&edge->list[UPPER], &upper->lower);
3069 		list_add_tail(&edge->list[UPPER], &upper->lower);
3084 	struct btrfs_backref_node *lower;  local
3089 		lower = list_first_entry(&cache->useless_node,
3091 		list_del_init(&lower->list);
3098 		lower = edge->node[LOWER];
3106 		if (list_empty(&lower->upper) &&
3107 		    RB_EMPTY_NODE(&lower->rb_node))
3108 			list_add(&lower->list, &cache->useless_node);
3122 		lower = list_first_entry(&cache->useless_node,
3124 		list_del_init(&lower->list);
3125 		if (lower == node)
3127 		btrfs_backref_free_node(cache, lower);