Searched refs:AllNodes (Results 1 – 12 of 12) sorted by relevance
106 LoopNodeList AllNodes; member in Ice::LoopAnalyzer149 AllNodes.reserve(Nodes.size()); in LoopAnalyzer()155 AllNodes.emplace_back(Node); in LoopAnalyzer()160 assert(AllNodes.size() == Func->getNodes().size()); in computeLoopNestDepth()164 while (NumDeletedNodes < AllNodes.size()) { in computeLoopNestDepth()166 for (LoopNode &Node : AllNodes) in computeLoopNestDepth()172 for (LoopNode &Node : AllNodes) { in computeLoopNestDepth()199 LoopNode &Succ = AllNodes[(*Node.currentSuccessor())->getIndex()]; in processNode()209 LoopNode &Succ = AllNodes[(*Node.currentSuccessor())->getIndex()]; in processNode()
119 def AllNodes(self): member in USBNode127 for descendant_node in child_node.AllNodes():142 for node in self.AllNodes():324 for device in bus.AllNodes():
195 ilist<SDNode> AllNodes;359 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }360 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }362 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }363 allnodes_iterator allnodes_end() { return AllNodes.end(); }365 return AllNodes.size();1159 AllNodes.insert(Position, AllNodes.remove(N));
250 ilist<SDNode> AllNodes;462 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }463 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }467 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }468 allnodes_iterator allnodes_end() { return AllNodes.end(); }471 return AllNodes.size();1400 AllNodes.insert(Position, AllNodes.remove(N));
250 ilist<SDNode> AllNodes;500 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }501 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }505 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }506 allnodes_iterator allnodes_end() { return AllNodes.end(); }509 return AllNodes.size();1605 AllNodes.insert(Position, AllNodes.remove(N));
638 assert(N->getIterator() != AllNodes.begin() && in DeleteNodeNotInCSEMaps()665 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()717 AllNodes.push_back(N); in InsertNode()908 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()909 AllNodes.remove(AllNodes.begin()); in allnodes_clear()910 while (!AllNodes.empty()) in allnodes_clear()911 DeallocateNode(&AllNodes.front()); in allnodes_clear()6582 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()6583 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()6608 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()[all …]
595 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()
1383 DenseSet<SDNode*> AllNodes; in scalarizeShuffle() local1385 AllNodes.insert(&S); in scalarizeShuffle()1387 Deleter DUA(DAG, AllNodes); in scalarizeShuffle()1439 if (AllNodes.count(LV.getNode())) { in scalarizeShuffle()1458 if (AllNodes.count(Op.getNode())) in scalarizeShuffle()
767 assert(N->getIterator() != AllNodes.begin() && in DeleteNodeNotInCSEMaps()790 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()849 AllNodes.push_back(N); in InsertNode()1051 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()1052 AllNodes.remove(AllNodes.begin()); in allnodes_clear()1053 while (!AllNodes.empty()) in allnodes_clear()1054 DeallocateNode(&AllNodes.front()); in allnodes_clear()8556 Order.reserve(AllNodes.size()); in CreateTopologicalOrder()8688 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()8689 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()[all …]
836 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()
818 assert(N->getIterator() != AllNodes.begin() && in DeleteNodeNotInCSEMaps()841 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()900 AllNodes.push_back(N); in InsertNode()1102 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()1103 AllNodes.remove(AllNodes.begin()); in allnodes_clear()1104 while (!AllNodes.empty()) in allnodes_clear()1105 DeallocateNode(&AllNodes.front()); in allnodes_clear()8774 Order.reserve(AllNodes.size()); in CreateTopologicalOrder()8889 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()8890 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()[all …]
891 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()