Home
last modified time | relevance | path

Searched refs:GTN (Results 1 – 5 of 5) sorted by relevance

/external/llvm/lib/Target/Hexagon/
DHexagonGenExtract.cpp214 typedef GraphTraits<DomTreeNode*> GTN; in visitBlock() typedef
215 typedef GTN::ChildIteratorType Iter; in visitBlock()
216 for (Iter I = GTN::child_begin(DTN), E = GTN::child_end(DTN); I != E; ++I) in visitBlock()
DHexagonEarlyIfConv.cpp559 typedef GraphTraits<MachineDomTreeNode*> GTN; in visitBlock() typedef
568 DTNodeVectType Cn(GTN::child_begin(N), GTN::child_end(N)); in visitBlock()
929 typedef GraphTraits<MachineDomTreeNode*> GTN; in removeBlock() typedef
931 DTNodeVectType Cn(GTN::child_begin(N), GTN::child_end(N)); in removeBlock()
DHexagonCommonGEP.cpp305 typedef GraphTraits<DomTreeNode*> GTN; in getBlockTraversalOrder() typedef
306 typedef GTN::ChildIteratorType Iter; in getBlockTraversalOrder()
307 for (Iter I = GTN::child_begin(DTN), E = GTN::child_end(DTN); I != E; ++I) in getBlockTraversalOrder()
1248 typedef GraphTraits<DomTreeNode*> GTN; in removeDeadCode() typedef
1249 typedef GTN::ChildIteratorType Iter; in removeDeadCode()
1250 for (Iter I = GTN::child_begin(N), E = GTN::child_end(N); I != E; ++I) in removeDeadCode()
DHexagonGenInsert.cpp943 typedef GraphTraits<MachineDomTreeNode*> GTN; in collectInBlock() typedef
944 typedef GTN::ChildIteratorType ChildIter; in collectInBlock()
945 for (ChildIter I = GTN::child_begin(N), E = GTN::child_end(N); I != E; ++I) { in collectInBlock()
1426 typedef GraphTraits<MachineDomTreeNode*> GTN; in removeDeadCode() typedef
1427 for (auto I = GTN::child_begin(N), E = GTN::child_end(N); I != E; ++I) in removeDeadCode()
DHexagonBitSimplify.cpp221 typedef GraphTraits<MachineDomTreeNode*> GTN; in INITIALIZE_PASS_DEPENDENCY() typedef
233 for (auto I = GTN::child_begin(N), E = GTN::child_end(N); I != E; ++I) { in INITIALIZE_PASS_DEPENDENCY()
947 typedef GraphTraits<MachineDomTreeNode*> GTN; in runOnNode() typedef
948 for (auto I = GTN::child_begin(N), E = GTN::child_end(N); I != E; ++I) in runOnNode()