Searched refs:AllNodes (Results 1 – 6 of 6) sorted by relevance
618 AllNodes.reserve(NumNodes); in initialize()661 for (NodeT &Node : AllNodes) { in initialize()671 for (NodeT &PredNode : AllNodes) { in initialize()696 for (NodeT &Node : AllNodes) { in mergeForcedPairs()712 for (NodeT &Node : AllNodes) { in mergeForcedPairs()728 for (NodeT &Node : AllNodes) { in mergeForcedPairs()1020 std::vector<NodeT> AllNodes; member in __anon8d4ae80f0111::ExtTSPImpl1062 AllNodes.reserve(NumNodes); in initialize()1099 for (NodeT &Node : AllNodes) { in initialize()1139 for (NodeT &Node : AllNodes) { in mergeChainPairs()[all …]
169 AllNodes.insert(KVP.first); in MLInlineAdvisor()172 NodeCount = AllNodes.size(); in MLInlineAdvisor()213 auto I = AllNodes.insert(AdjNode); in onPassEntry()
90 DenseSet<const LazyCallGraph::Node *> AllNodes; variable
259 ilist<SDNode> AllNodes;531 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }532 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }536 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }537 allnodes_iterator allnodes_end() { return AllNodes.end(); }540 return AllNodes.size();1840 AllNodes.insert(Position, AllNodes.remove(N));
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()11418 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()11439 assert(SortedPos == AllNodes.end() && in AssignTopologicalOrder()[all …]
961 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()