1060   assert(N->getIterator() != AllNodes.begin() &&  in DeleteNodeNotInCSEMaps()
1094   NodeAllocator.Deallocate(AllNodes.remove(N));  in DeallocateNode()
1156   AllNodes.push_back(N);  in InsertNode()
1358   assert(&*AllNodes.begin() == &EntryNode);  in allnodes_clear()
1359   AllNodes.remove(AllNodes.begin());  in allnodes_clear()
1360   while (!AllNodes.empty())  in allnodes_clear()
1361     DeallocateNode(&AllNodes.front());  in allnodes_clear()
11272   Order.reserve(AllNodes.size());  in CreateTopologicalOrder()
11394         SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q));  in AssignTopologicalOrder()
11395       assert(SortedPos != AllNodes.end() && "Overran node list");  in AssignTopologicalOrder()
11418           SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P));  in AssignTopologicalOrder()
11419         assert(SortedPos != AllNodes.end() && "Overran node list");  in AssignTopologicalOrder()
11439   assert(SortedPos == AllNodes.end() &&  in AssignTopologicalOrder()
11441   assert(AllNodes.front().getOpcode() == ISD::EntryToken &&  in AssignTopologicalOrder()
11443   assert(AllNodes.front().getNodeId() == 0 &&  in AssignTopologicalOrder()
11445   assert(AllNodes.front().getNumOperands() == 0 &&  in AssignTopologicalOrder()
11447   assert(AllNodes.back().getNodeId() == (int)DAGSize-1 &&  in AssignTopologicalOrder()
11449   assert(AllNodes.back().use_empty() &&  in AssignTopologicalOrder()