Lines Matching defs:UPPER
94 #define UPPER 1
343 node = edge->node[UPPER];
371 return edge->node[UPPER];
423 upper = edge->node[UPPER];
425 list_del(&edge->list[UPPER]);
719 BUG_ON(!list_empty(&edge->list[UPPER]));
720 exist = edge->node[UPPER];
726 list_add_tail(&edge->list[UPPER], &list);
833 list_add_tail(&edge->list[UPPER], &list);
838 INIT_LIST_HEAD(&edge->list[UPPER]);
842 edge->node[UPPER] = upper;
944 list_add_tail(&edge->list[UPPER],
947 INIT_LIST_HEAD(&edge->list[UPPER]);
952 INIT_LIST_HEAD(&edge->list[UPPER]);
958 edge->node[UPPER] = upper;
985 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
986 list_del_init(&edge->list[UPPER]);
987 cur = edge->node[UPPER];
1005 list_add_tail(&edge->list[UPPER], &list);
1008 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1009 list_del_init(&edge->list[UPPER]);
1010 upper = edge->node[UPPER];
1026 list_add_tail(&edge->list[UPPER], &upper->lower);
1038 list_add_tail(&edge->list[UPPER], &upper->lower);
1041 list_add_tail(&edge->list[UPPER], &list);
1061 struct backref_edge, list[UPPER]);
1062 list_del(&edge->list[UPPER]);
1102 upper = edge->node[UPPER];
1164 list_for_each_entry(edge, &node->lower, list[UPPER]) {
1169 new_edge->node[UPPER] = new_node;
1171 list_add_tail(&new_edge->list[UPPER],
1181 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
1190 struct backref_edge, list[UPPER]);
1191 list_del(&new_edge->list[UPPER]);
2315 next = edges[index]->node[UPPER];
2390 next = edge->node[UPPER];
2460 upper = edge->node[UPPER];
2647 next = edge->node[UPPER];