Searched refs:AllNodes (Results 1 – 6 of 6) sorted by relevance
618 AllNodes.reserve(NumNodes); in initialize()625 AllNodes.emplace_back(Idx, Size, ExecutionCount); in initialize()642 NodeT &PredNode = AllNodes[Edge.src]; in initialize()643 NodeT &SuccNode = AllNodes[Edge.dst]; in initialize()661 for (NodeT &Node : AllNodes) { in initialize()671 for (NodeT &PredNode : AllNodes) { in initialize()696 for (NodeT &Node : AllNodes) { in mergeForcedPairs()701 Node.ForcedSucc = &AllNodes[SuccIndex]; in mergeForcedPairs()702 AllNodes[SuccIndex].ForcedPred = &Node; in mergeForcedPairs()712 for (NodeT &Node : AllNodes) { in mergeForcedPairs()[all …]
186 AllNodes.insert(KVP.first); in MLInlineAdvisor()189 NodeCount = AllNodes.size(); in MLInlineAdvisor()239 auto I = AllNodes.insert(AdjNode); in onPassEntry()
91 DenseSet<const LazyCallGraph::Node *> AllNodes; variable
270 ilist<SDNode> AllNodes;562 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }563 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }567 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }568 allnodes_iterator allnodes_end() { return AllNodes.end(); }571 return AllNodes.size();1964 AllNodes.insert(Position, AllNodes.remove(N));
1097 assert(N->getIterator() != AllNodes.begin() && in DeleteNodeNotInCSEMaps()1131 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()1195 AllNodes.push_back(N); in InsertNode()1401 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()1402 AllNodes.remove(AllNodes.begin()); in allnodes_clear()1403 while (!AllNodes.empty()) in allnodes_clear()1404 DeallocateNode(&AllNodes.front()); in allnodes_clear()12190 Order.reserve(AllNodes.size()); in CreateTopologicalOrder()12310 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()12311 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()[all …]
1064 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()