87 #define UPPER	1  macro
351 		node = edge->node[UPPER];  in walk_up_backref()
379 		return edge->node[UPPER];  in walk_down_backref()
431 		upper = edge->node[UPPER];  in remove_backref_node()
433 		list_del(&edge->list[UPPER]);  in remove_backref_node()
724 		ASSERT(list_empty(&edge->list[UPPER]));  in build_backref_tree()
725 		exist = edge->node[UPPER];  in build_backref_tree()
731 			list_add_tail(&edge->list[UPPER], &list);  in build_backref_tree()
830 				list_add_tail(&edge->list[UPPER], &list);  in build_backref_tree()
835 				INIT_LIST_HEAD(&edge->list[UPPER]);  in build_backref_tree()
839 			edge->node[UPPER] = upper;  in build_backref_tree()
958 					list_add_tail(&edge->list[UPPER],  in build_backref_tree()
963 					INIT_LIST_HEAD(&edge->list[UPPER]);  in build_backref_tree()
969 				INIT_LIST_HEAD(&edge->list[UPPER]);  in build_backref_tree()
975 			edge->node[UPPER] = upper;  in build_backref_tree()
1002 		edge = list_entry(list.next, struct backref_edge, list[UPPER]);  in build_backref_tree()
1003 		list_del_init(&edge->list[UPPER]);  in build_backref_tree()
1004 		cur = edge->node[UPPER];  in build_backref_tree()
1023 		list_add_tail(&edge->list[UPPER], &list);  in build_backref_tree()
1026 		edge = list_entry(list.next, struct backref_edge, list[UPPER]);  in build_backref_tree()
1027 		list_del_init(&edge->list[UPPER]);  in build_backref_tree()
1028 		upper = edge->node[UPPER];  in build_backref_tree()
1044 			list_add_tail(&edge->list[UPPER], &upper->lower);  in build_backref_tree()
1071 		list_add_tail(&edge->list[UPPER], &upper->lower);  in build_backref_tree()
1074 			list_add_tail(&edge->list[UPPER], &list);  in build_backref_tree()
1094 					  struct backref_edge, list[UPPER]);  in build_backref_tree()
1095 			list_del(&edge->list[UPPER]);  in build_backref_tree()
1123 						list[UPPER]);  in build_backref_tree()
1124 			list_del(&edge->list[UPPER]);  in build_backref_tree()
1127 			upper = edge->node[UPPER];  in build_backref_tree()
1143 				list_add_tail(&edge->list[UPPER], &list);  in build_backref_tree()
1218 		list_for_each_entry(edge, &node->lower, list[UPPER]) {  in clone_backref_node()
1223 			new_edge->node[UPPER] = new_node;  in clone_backref_node()
1225 			list_add_tail(&new_edge->list[UPPER],  in clone_backref_node()
1238 		list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {  in clone_backref_node()
1247 				      struct backref_edge, list[UPPER]);  in clone_backref_node()
1248 		list_del(&new_edge->list[UPPER]);  in clone_backref_node()
2606 		next = edges[index]->node[UPPER];  in select_reloc_root()
2680 			next = edge->node[UPPER];  in calcu_metadata_size()
2764 		upper = edge->node[UPPER];  in do_relocation()
2982 			next = edge->node[UPPER];  in update_processed_blocks()