Lines Matching defs:SortedPos
6561 // SortedPos tracks the progress of the algorithm. Nodes before it are
6564 allnodes_iterator SortedPos = allnodes_begin();
6570 // before SortedPos will contain the topological sort index, and the
6571 // Node Id fields for nodes At SortedPos and after will contain the
6581 if (Q != SortedPos)
6582 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q));
6583 assert(SortedPos != AllNodes.end() && "Overran node list");
6584 ++SortedPos;
6607 if (P->getIterator() != SortedPos)
6608 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P));
6609 assert(SortedPos != AllNodes.end() && "Overran node list");
6610 ++SortedPos;
6616 if (Node.getIterator() == SortedPos) {
6629 assert(SortedPos == AllNodes.end() &&
