58 	struct list_head lower;  member
95 #define LOWER	0  macro
229 				  struct backref_node, lower);  in backref_cache_cleanup()
252 		INIT_LIST_HEAD(&node->lower);  in alloc_backref_node()
341 				  struct backref_edge, list[LOWER]);  in walk_up_backref()
357 	struct backref_node *lower;  in walk_down_backref()  local
362 		lower = edge->node[LOWER];  in walk_down_backref()
363 		if (list_is_last(&edge->list[LOWER], &lower->upper)) {  in walk_down_backref()
367 		edge = list_entry(edge->list[LOWER].next,  in walk_down_backref()
368 				  struct backref_edge, list[LOWER]);  in walk_down_backref()
401 	list_del(&node->lower);  in drop_backref_node()
422 				  list[LOWER]);  in remove_backref_node()
424 		list_del(&edge->list[LOWER]);  in remove_backref_node()
439 		if (list_empty(&upper->lower)) {  in remove_backref_node()
440 			list_add_tail(&upper->lower, &cache->leaves);  in remove_backref_node()
660 	struct backref_node *lower;  local
720 				  list[LOWER]);
842 			list_add_tail(&edge->list[LOWER], &cur->upper);
843 			edge->node[LOWER] = cur;
894 		lower = cur;
898 				       lower->bytenr);
900 					list_add(&lower->list, &useless);
902 					lower->root = root;
923 				upper->level = lower->level + 1;
941 				 * we check backrefs from lower level
958 			list_add_tail(&edge->list[LOWER], &lower->upper);
959 			edge->node[LOWER] = lower;
964 			lower = upper;
1003 		list_add_tail(&node->lower, &cache->leaves);
1006 	list_for_each_entry(edge, &node->upper, list[LOWER])
1014 			list_del(&edge->list[LOWER]);
1015 			lower = edge->node[LOWER];
1017 			if (list_empty(&lower->upper))
1018 				list_add(&lower->list, &useless);
1024 				list_del_init(&upper->lower);
1028 			list_add_tail(&edge->list[UPPER], &upper->lower);
1040 		list_add_tail(&edge->list[UPPER], &upper->lower);
1042 		list_for_each_entry(edge, &upper->upper, list[LOWER])
1058 			list_del_init(&upper->lower);
1061 		while (!list_empty(&upper->lower)) {
1062 			edge = list_entry(upper->lower.next,
1065 			list_del(&edge->list[LOWER]);
1066 			lower = edge->node[LOWER];
1069 			if (list_empty(&lower->upper))
1070 				list_add(&lower->list, &useless);
1086 			lower = list_entry(useless.next,
1088 			list_del_init(&lower->upper);
1102 					  list[LOWER]);
1103 			list_del(&edge->list[LOWER]);
1167 		list_for_each_entry(edge, &node->lower, list[UPPER]) {
1173 			new_edge->node[LOWER] = edge->node[LOWER];
1175 				      &new_node->lower);
1178 		list_add_tail(&new_node->lower, &cache->leaves);
1186 		list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
1187 			list_add_tail(&new_edge->list[LOWER],
1188 				      &new_edge->node[LOWER]->upper);
1193 	while (!list_empty(&new_node->lower)) {
1194 		new_edge = list_entry(new_node->lower.next,
2412 					  struct backref_edge, list[LOWER]);
2479 	list_for_each_entry(edge, &node->upper, list[LOWER]) {
2671 					  struct backref_edge, list[LOWER]);