Searched refs:SortedPos (Results 1 – 1 of 1) sorted by relevance
8411 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local8428 if (Q != SortedPos) in AssignTopologicalOrder()8429 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()8430 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()8431 ++SortedPos; in AssignTopologicalOrder()8454 if (P->getIterator() != SortedPos) in AssignTopologicalOrder()8455 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()8456 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()8457 ++SortedPos; in AssignTopologicalOrder()8463 if (Node.getIterator() == SortedPos) { in AssignTopologicalOrder()[all …]