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];643 NodeT &SuccNode = AllNodes[Edge.dst];661 for (NodeT &Node : AllNodes) { in mergeForcedPairs() 671 for (NodeT &PredNode : AllNodes) { in mergeForcedPairs() 696 for (NodeT &Node : AllNodes) { in mergeChainPairs() 701 Node.ForcedSucc = &AllNodes[SuccIndex]; in mergeChainPairs() 702 AllNodes[SuccIndex].ForcedPred = &Node; in mergeChainPairs() 712 for (NodeT &Node : AllNodes) { in mergeChainPairs() 972 std::vector<NodeT> AllNodes; global() member in __anon4fceb0470111::ExtTSPImpl [all...]
185 AllNodes.insert(KVP.first); in MLInlineAdvisor()188 NodeCount = AllNodes.size(); in MLInlineAdvisor()225 auto I = AllNodes.insert(AdjNode); in onPassEntry()
91 DenseSet<const LazyCallGraph::Node *> AllNodes; variable
262 ilist<SDNode> AllNodes;545 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }546 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }550 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }551 allnodes_iterator allnodes_end() { return AllNodes.end(); }554 return AllNodes.size();1820 AllNodes.insert(Position, AllNodes.remove(N));
1063 assert(N->getIterator() != AllNodes.begin() && in DeleteNodeNotInCSEMaps()1097 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()1161 AllNodes.push_back(N); in InsertNode()1364 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()1365 AllNodes.remove(AllNodes.begin()); in allnodes_clear()1366 while (!AllNodes.empty()) in allnodes_clear()1367 DeallocateNode(&AllNodes.front()); in allnodes_clear()11609 Order.reserve(AllNodes.size()); in CreateTopologicalOrder()11731 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()11732 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()[all …]
1019 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()