Lines Matching refs:LOWER

95 #define LOWER	0  macro
355 				  struct backref_edge, list[LOWER]);  in walk_up_backref()
376 		lower = edge->node[LOWER];  in walk_down_backref()
377 		if (list_is_last(&edge->list[LOWER], &lower->upper)) {  in walk_down_backref()
381 		edge = list_entry(edge->list[LOWER].next,  in walk_down_backref()
382 				  struct backref_edge, list[LOWER]);  in walk_down_backref()
436 				  list[LOWER]);  in remove_backref_node()
438 		list_del(&edge->list[LOWER]);  in remove_backref_node()
752 				  list[LOWER]);
875 			list_add_tail(&edge->list[LOWER], &cur->upper);
876 			edge->node[LOWER] = cur;
994 			list_add_tail(&edge->list[LOWER], &lower->upper);
995 			edge->node[LOWER] = lower;
1043 	list_for_each_entry(edge, &node->upper, list[LOWER])
1051 			list_del(&edge->list[LOWER]);
1052 			lower = edge->node[LOWER];
1094 		list_for_each_entry(edge, &upper->upper, list[LOWER])
1117 			list_del(&edge->list[LOWER]);
1118 			lower = edge->node[LOWER];
1146 			list_del(&edge->list[LOWER]);
1147 			lower = edge->node[LOWER];
1163 			list_for_each_entry(edge, &upper->upper, list[LOWER])
1241 			new_edge->node[LOWER] = edge->node[LOWER];
1256 			list_add_tail(&new_edge->list[LOWER],
1257 				      &new_edge->node[LOWER]->upper);
2583 					  struct backref_edge, list[LOWER]);
2658 	list_for_each_entry(edge, &node->upper, list[LOWER]) {
2854 					  struct backref_edge, list[LOWER]);