Lines Matching defs:lower
218 struct btrfs_backref_node *lower;
223 lower = edge->node[LOWER];
224 if (list_is_last(&edge->list[LOWER], &lower->upper)) {
415 list_del_init(&cur->lower);
419 /* Cleanup the lower edges */
420 while (!list_empty(&cur->lower)) {
422 struct btrfs_backref_node *lower;
424 edge = list_entry(cur->lower.next,
428 lower = edge->node[LOWER];
432 if (list_empty(&lower->upper))
433 list_add(&lower->list, useless_node);
597 list_for_each_entry(edge, &node->lower, list[UPPER]) {
606 list_add_tail(&new_node->lower, &cache->leaves);
615 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
622 while (!list_empty(&new_node->lower)) {
623 new_edge = list_entry(new_node->lower.next,