Searched refs:SortedPos (Results 1 – 1 of 1) sorted by relevance
12293 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local12309 if (Q != SortedPos) in AssignTopologicalOrder()12310 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()12311 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()12312 ++SortedPos; in AssignTopologicalOrder()12333 if (P->getIterator() != SortedPos) in AssignTopologicalOrder()12334 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()12335 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()12336 ++SortedPos; in AssignTopologicalOrder()12342 if (Node.getIterator() == SortedPos) { in AssignTopologicalOrder()[all …]