Searched refs:SortedPos (Results 1 – 1 of 1) sorted by relevance
9293 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local9310 if (Q != SortedPos) in AssignTopologicalOrder()9311 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()9312 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()9313 ++SortedPos; in AssignTopologicalOrder()9334 if (P->getIterator() != SortedPos) in AssignTopologicalOrder()9335 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()9336 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()9337 ++SortedPos; in AssignTopologicalOrder()9343 if (Node.getIterator() == SortedPos) { in AssignTopologicalOrder()[all …]