Lines Matching refs:UPPER

96 #define UPPER	1  macro
357 		node = edge->node[UPPER];  in walk_up_backref()
385 		return edge->node[UPPER];  in walk_down_backref()
437 		upper = edge->node[UPPER];  in remove_backref_node()
439 		list_del(&edge->list[UPPER]);  in remove_backref_node()
753 		ASSERT(list_empty(&edge->list[UPPER]));
754 		exist = edge->node[UPPER];
760 			list_add_tail(&edge->list[UPPER], &list);
868 				list_add_tail(&edge->list[UPPER], &list);
873 				INIT_LIST_HEAD(&edge->list[UPPER]);
877 			edge->node[UPPER] = upper;
979 					list_add_tail(&edge->list[UPPER],
984 					INIT_LIST_HEAD(&edge->list[UPPER]);
990 				INIT_LIST_HEAD(&edge->list[UPPER]);
996 			edge->node[UPPER] = upper;
1023 		edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1024 		list_del_init(&edge->list[UPPER]);
1025 		cur = edge->node[UPPER];
1044 		list_add_tail(&edge->list[UPPER], &list);
1047 		edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1048 		list_del_init(&edge->list[UPPER]);
1049 		upper = edge->node[UPPER];
1065 			list_add_tail(&edge->list[UPPER], &upper->lower);
1092 		list_add_tail(&edge->list[UPPER], &upper->lower);
1095 			list_add_tail(&edge->list[UPPER], &list);
1115 					  struct backref_edge, list[UPPER]);
1116 			list_del(&edge->list[UPPER]);
1144 						list[UPPER]);
1145 			list_del(&edge->list[UPPER]);
1148 			upper = edge->node[UPPER];
1164 				list_add_tail(&edge->list[UPPER], &list);
1235 		list_for_each_entry(edge, &node->lower, list[UPPER]) {
1240 			new_edge->node[UPPER] = new_node;
1242 			list_add_tail(&new_edge->list[UPPER],
1255 		list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
1264 				      struct backref_edge, list[UPPER]);
1265 		list_del(&new_edge->list[UPPER]);
2512 		next = edges[index]->node[UPPER];
2585 			next = edge->node[UPPER];
2661 		upper = edge->node[UPPER];
2856 			next = edge->node[UPPER];