Lines Matching refs:UPPER
85 #define UPPER 1 macro
347 node = edge->node[UPPER]; in walk_up_backref()
375 return edge->node[UPPER]; in walk_down_backref()
427 upper = edge->node[UPPER]; in remove_backref_node()
429 list_del(&edge->list[UPPER]); in remove_backref_node()
720 ASSERT(list_empty(&edge->list[UPPER])); in build_backref_tree()
721 exist = edge->node[UPPER]; in build_backref_tree()
727 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
821 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
826 INIT_LIST_HEAD(&edge->list[UPPER]); in build_backref_tree()
830 edge->node[UPPER] = upper; in build_backref_tree()
945 list_add_tail(&edge->list[UPPER], in build_backref_tree()
950 INIT_LIST_HEAD(&edge->list[UPPER]); in build_backref_tree()
956 INIT_LIST_HEAD(&edge->list[UPPER]); in build_backref_tree()
962 edge->node[UPPER] = upper; in build_backref_tree()
989 edge = list_entry(list.next, struct backref_edge, list[UPPER]); in build_backref_tree()
990 list_del_init(&edge->list[UPPER]); in build_backref_tree()
991 cur = edge->node[UPPER]; in build_backref_tree()
1010 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
1013 edge = list_entry(list.next, struct backref_edge, list[UPPER]); in build_backref_tree()
1014 list_del_init(&edge->list[UPPER]); in build_backref_tree()
1015 upper = edge->node[UPPER]; in build_backref_tree()
1031 list_add_tail(&edge->list[UPPER], &upper->lower); in build_backref_tree()
1058 list_add_tail(&edge->list[UPPER], &upper->lower); in build_backref_tree()
1061 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
1081 struct backref_edge, list[UPPER]); in build_backref_tree()
1082 list_del(&edge->list[UPPER]); in build_backref_tree()
1110 list[UPPER]); in build_backref_tree()
1111 list_del(&edge->list[UPPER]); in build_backref_tree()
1114 upper = edge->node[UPPER]; in build_backref_tree()
1130 list_add_tail(&edge->list[UPPER], &list); in build_backref_tree()
1205 list_for_each_entry(edge, &node->lower, list[UPPER]) { in clone_backref_node()
1210 new_edge->node[UPPER] = new_node; in clone_backref_node()
1212 list_add_tail(&new_edge->list[UPPER], in clone_backref_node()
1225 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
1234 struct backref_edge, list[UPPER]); in clone_backref_node()
1235 list_del(&new_edge->list[UPPER]); in clone_backref_node()
2533 next = edges[index]->node[UPPER]; in select_reloc_root()
2607 next = edge->node[UPPER]; in calcu_metadata_size()
2690 upper = edge->node[UPPER]; in do_relocation()
2898 next = edge->node[UPPER]; in update_processed_blocks()