975   assert(N->getIterator() != AllNodes.begin() &&  in DeleteNodeNotInCSEMaps()
1009   NodeAllocator.Deallocate(AllNodes.remove(N));  in DeallocateNode()
1068   AllNodes.push_back(N);  in InsertNode()
1270   assert(&*AllNodes.begin() == &EntryNode);  in allnodes_clear()
1271   AllNodes.remove(AllNodes.begin());  in allnodes_clear()
1272   while (!AllNodes.empty())  in allnodes_clear()
1273     DeallocateNode(&AllNodes.front());  in allnodes_clear()
10365   Order.reserve(AllNodes.size());  in CreateTopologicalOrder()
10486         SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q));  in AssignTopologicalOrder()
10487       assert(SortedPos != AllNodes.end() && "Overran node list");  in AssignTopologicalOrder()
10510           SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P));  in AssignTopologicalOrder()
10511         assert(SortedPos != AllNodes.end() && "Overran node list");  in AssignTopologicalOrder()
10531   assert(SortedPos == AllNodes.end() &&  in AssignTopologicalOrder()
10533   assert(AllNodes.front().getOpcode() == ISD::EntryToken &&  in AssignTopologicalOrder()
10535   assert(AllNodes.front().getNodeId() == 0 &&  in AssignTopologicalOrder()
10537   assert(AllNodes.front().getNumOperands() == 0 &&  in AssignTopologicalOrder()
10539   assert(AllNodes.back().getNodeId() == (int)DAGSize-1 &&  in AssignTopologicalOrder()
10541   assert(AllNodes.back().use_empty() &&  in AssignTopologicalOrder()