Searched refs:AllNodes (Results 1 – 5 of 5) sorted by relevance
132 AllNodes.insert(KVP.first); in MLInlineAdvisor()135 NodeCount = AllNodes.size(); in MLInlineAdvisor()173 auto I = AllNodes.insert(AdjNode); in onPassEntry()
88 DenseSet<const LazyCallGraph::Node *> AllNodes; variable
255 ilist<SDNode> AllNodes;527 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }528 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }532 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }533 allnodes_iterator allnodes_end() { return AllNodes.end(); }536 return AllNodes.size();1841 AllNodes.insert(Position, AllNodes.remove(N));
1018 assert(N->getIterator() != AllNodes.begin() && in DeleteNodeNotInCSEMaps()1052 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()1114 AllNodes.push_back(N); in InsertNode()1317 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()1318 AllNodes.remove(AllNodes.begin()); in allnodes_clear()1319 while (!AllNodes.empty()) in allnodes_clear()1320 DeallocateNode(&AllNodes.front()); in allnodes_clear()10624 Order.reserve(AllNodes.size()); in CreateTopologicalOrder()10746 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()10747 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()[all …]
931 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()