Searched refs:SortedPos (Results 1 – 2 of 2) sorted by relevance
5520 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local5537 if (Q != SortedPos) in AssignTopologicalOrder()5538 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()5539 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()5540 ++SortedPos; in AssignTopologicalOrder()5563 if (P != SortedPos) in AssignTopologicalOrder()5564 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()5565 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()5566 ++SortedPos; in AssignTopologicalOrder()5572 if (I == SortedPos) { in AssignTopologicalOrder()[all …]
6564 allnodes_iterator SortedPos = allnodes_begin(); in AssignTopologicalOrder() local6581 if (Q != SortedPos) in AssignTopologicalOrder()6582 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()6583 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()6584 ++SortedPos; in AssignTopologicalOrder()6607 if (P->getIterator() != SortedPos) in AssignTopologicalOrder()6608 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()6609 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()6610 ++SortedPos; in AssignTopologicalOrder()6616 if (Node.getIterator() == SortedPos) { in AssignTopologicalOrder()[all …]