84 #define LOWER	0  macro
345 				  struct backref_edge, list[LOWER]);  in walk_up_backref()
366 		lower = edge->node[LOWER];  in walk_down_backref()
367 		if (list_is_last(&edge->list[LOWER], &lower->upper)) {  in walk_down_backref()
371 		edge = list_entry(edge->list[LOWER].next,  in walk_down_backref()
372 				  struct backref_edge, list[LOWER]);  in walk_down_backref()
426 				  list[LOWER]);  in remove_backref_node()
428 		list_del(&edge->list[LOWER]);  in remove_backref_node()
719 				  list[LOWER]);  in build_backref_tree()
828 			list_add_tail(&edge->list[LOWER], &cur->upper);  in build_backref_tree()
829 			edge->node[LOWER] = cur;  in build_backref_tree()
960 			list_add_tail(&edge->list[LOWER], &lower->upper);  in build_backref_tree()
961 			edge->node[LOWER] = lower;  in build_backref_tree()
1009 	list_for_each_entry(edge, &node->upper, list[LOWER])  in build_backref_tree()
1017 			list_del(&edge->list[LOWER]);  in build_backref_tree()
1018 			lower = edge->node[LOWER];  in build_backref_tree()
1060 		list_for_each_entry(edge, &upper->upper, list[LOWER])  in build_backref_tree()
1083 			list_del(&edge->list[LOWER]);  in build_backref_tree()
1084 			lower = edge->node[LOWER];  in build_backref_tree()
1112 			list_del(&edge->list[LOWER]);  in build_backref_tree()
1113 			lower = edge->node[LOWER];  in build_backref_tree()
1129 			list_for_each_entry(edge, &upper->upper, list[LOWER])  in build_backref_tree()
1211 			new_edge->node[LOWER] = edge->node[LOWER];  in clone_backref_node()
1226 			list_add_tail(&new_edge->list[LOWER],  in clone_backref_node()
1227 				      &new_edge->node[LOWER]->upper);  in clone_backref_node()
2605 					  struct backref_edge, list[LOWER]);  in calcu_metadata_size()
2685 	list_for_each_entry(edge, &node->upper, list[LOWER]) {  in do_relocation()
2896 					  struct backref_edge, list[LOWER]);  in update_processed_blocks()