Lines Matching refs:AllNodes
1063 assert(N->getIterator() != AllNodes.begin() && in DeleteNodeNotInCSEMaps()
1097 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()
1161 AllNodes.push_back(N); in InsertNode()
1364 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()
1365 AllNodes.remove(AllNodes.begin()); in allnodes_clear()
1366 while (!AllNodes.empty()) in allnodes_clear()
1367 DeallocateNode(&AllNodes.front()); in allnodes_clear()
11609 Order.reserve(AllNodes.size()); in CreateTopologicalOrder()
11731 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()
11732 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()
11755 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()
11756 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()
11776 assert(SortedPos == AllNodes.end() && in AssignTopologicalOrder()
11778 assert(AllNodes.front().getOpcode() == ISD::EntryToken && in AssignTopologicalOrder()
11780 assert(AllNodes.front().getNodeId() == 0 && in AssignTopologicalOrder()
11782 assert(AllNodes.front().getNumOperands() == 0 && in AssignTopologicalOrder()
11784 assert(AllNodes.back().getNodeId() == (int)DAGSize-1 && in AssignTopologicalOrder()
11786 assert(AllNodes.back().use_empty() && in AssignTopologicalOrder()