Searched refs:AllNodes (Results 1 – 6 of 6) sorted by relevance
184 std::deque<Node *> AllNodes; in dumpIndex() local190 auto CollectChildren = [&SiblingTracker, &AllNodes](const auto &Children) { in dumpIndex()193 AllNodes.push_back(Child.get()); in dumpIndex()200 while (!AllNodes.empty()) { in dumpIndex()202 Node *const N = AllNodes.front(); in dumpIndex()203 AllNodes.pop_front(); in dumpIndex()
132 AllNodes.insert(KVP.first); in MLInlineAdvisor()135 NodeCount = AllNodes.size(); in MLInlineAdvisor()173 auto I = AllNodes.insert(AdjNode); in onPassEntry()
84 DenseSet<const LazyCallGraph::Node *> AllNodes; variable
247 ilist<SDNode> AllNodes;508 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }509 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }513 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }514 allnodes_iterator allnodes_end() { return AllNodes.end(); }517 return AllNodes.size();1758 AllNodes.insert(Position, AllNodes.remove(N));
1009 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()1068 AllNodes.push_back(N); in InsertNode()1270 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()1271 AllNodes.remove(AllNodes.begin()); in allnodes_clear()1272 while (!AllNodes.empty()) in allnodes_clear()1273 DeallocateNode(&AllNodes.front()); in allnodes_clear()10365 Order.reserve(AllNodes.size()); in CreateTopologicalOrder()10486 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()10510 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()10531 assert(SortedPos == AllNodes.end() && in AssignTopologicalOrder()[all …]
926 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()