638   assert(N->getIterator() != AllNodes.begin() &&  in DeleteNodeNotInCSEMaps()
665   NodeAllocator.Deallocate(AllNodes.remove(N));  in DeallocateNode()
717   AllNodes.push_back(N);  in InsertNode()
908   assert(&*AllNodes.begin() == &EntryNode);  in allnodes_clear()
909   AllNodes.remove(AllNodes.begin());  in allnodes_clear()
910   while (!AllNodes.empty())  in allnodes_clear()
911     DeallocateNode(&AllNodes.front());  in allnodes_clear()
6582         SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q));  in AssignTopologicalOrder()
6583       assert(SortedPos != AllNodes.end() && "Overran node list");  in AssignTopologicalOrder()
6608           SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P));  in AssignTopologicalOrder()
6609         assert(SortedPos != AllNodes.end() && "Overran node list");  in AssignTopologicalOrder()
6629   assert(SortedPos == AllNodes.end() &&  in AssignTopologicalOrder()
6631   assert(AllNodes.front().getOpcode() == ISD::EntryToken &&  in AssignTopologicalOrder()
6633   assert(AllNodes.front().getNodeId() == 0 &&  in AssignTopologicalOrder()
6635   assert(AllNodes.front().getNumOperands() == 0 &&  in AssignTopologicalOrder()
6637   assert(AllNodes.back().getNodeId() == (int)DAGSize-1 &&  in AssignTopologicalOrder()
6639   assert(AllNodes.back().use_empty() &&  in AssignTopologicalOrder()