Searched refs:SortedPos (Results 1 – 1 of 1) sorted by relevance
11377 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local11393 if (Q != SortedPos) in AssignTopologicalOrder()11394 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()11395 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()11396 ++SortedPos; in AssignTopologicalOrder()11417 if (P->getIterator() != SortedPos) in AssignTopologicalOrder()11418 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()11419 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()11420 ++SortedPos; in AssignTopologicalOrder()11426 if (Node.getIterator() == SortedPos) { in AssignTopologicalOrder()[all …]