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 …]
185 AllNodes.insert(KVP.first); in onPassEntry() 188 NodeCount = AllNodes.size(); in onPassEntry() 225 auto I = AllNodes.insert(AdjNode); in onPassEntry()
91 DenseSet<const LazyCallGraph::Node *> AllNodes;90 DenseSet<const LazyCallGraph::Node *> AllNodes; global() 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();1811 /// Topological-sort the AllNodes list and a1816 /// Move node N in the AllNodes list to be immediately1820 AllNodes.insert(Position, AllNodes[all...]
1058 // AllNodes list, and delete the node.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())1367 DeallocateNode(&AllNodes.front()); in FindNodeOrInsertPos() 11609 Order.reserve(AllNodes in peekThroughBitcasts() [all...]
1019 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in DumpNodesr()