Home
last modified time | relevance | path

Searched refs:BlockTraits (Results 1 – 7 of 7) sorted by relevance

/external/llvm/include/llvm/Analysis/
DLoopInfoImpl.h36 typedef GraphTraits<BlockT*> BlockTraits; in getExitingBlocks() typedef
38 for (typename BlockTraits::ChildIteratorType I = in getExitingBlocks()
39 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitingBlocks()
65 typedef GraphTraits<BlockT*> BlockTraits; in getExitBlocks() typedef
67 for (typename BlockTraits::ChildIteratorType I = in getExitBlocks()
68 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitBlocks()
90 typedef GraphTraits<BlockT*> BlockTraits; in getExitEdges() typedef
92 for (typename BlockTraits::ChildIteratorType I = in getExitEdges()
93 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitEdges()
114 typedef GraphTraits<BlockT*> BlockTraits; in getLoopPreheader() typedef
[all …]
DRegionIterator.h38 typedef GraphTraits<BlockT*> BlockTraits; typedef
39 typedef typename BlockTraits::ChildIteratorType SuccIterTy;
97 BItor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
101 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator()
111 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator()
137 while (BItor != BlockTraits::child_end(getNode()->getEntry())
161 typedef GraphTraits<BlockT*> BlockTraits; typedef
162 typedef typename BlockTraits::ChildIteratorType SuccIterTy;
177 Itor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
183 while (BlockTraits::child_end(Node->getEntry()) != Itor in RNSuccIterator()
[all …]
DRegionInfoImpl.h243 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyBBInRegion()
244 SE = BlockTraits::child_end(BB); in verifyBBInRegion()
270 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyWalk()
271 SE = BlockTraits::child_end(BB); in verifyWalk()
456 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion()
649 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()
651 if (num_successors <= 1 && exit == *(BlockTraits::child_begin(entry))) in isTrivialRegion()
843 else if (++BlockTraits::child_begin(BB) == BlockTraits::child_end(BB)) in getMaxRegionExit()
844 Exit = *BlockTraits::child_begin(BB); in getMaxRegionExit()
DDominanceFrontier.h38 typedef GraphTraits<BlockT *> BlockTraits; typedef
117 typedef GraphTraits<BlockT *> BlockTraits; typedef
DRegionInfo.h258 typedef GraphTraits<BlockT *> BlockTraits;
260 typedef typename BlockTraits::ChildIteratorType SuccIterTy;
662 typedef GraphTraits<BlockT *> BlockTraits;
664 typedef typename BlockTraits::ChildIteratorType SuccIterTy;
DLoopInfo.h168 typedef GraphTraits<const BlockT*> BlockTraits; in isLoopExiting() typedef
169 for (typename BlockTraits::ChildIteratorType SI = in isLoopExiting()
170 BlockTraits::child_begin(BB), in isLoopExiting()
171 SE = BlockTraits::child_end(BB); SI != SE; ++SI) { in isLoopExiting()
DDominanceFrontierImpl.h177 for (auto SI = BlockTraits::child_begin(currentBB), in calculate()
178 SE = BlockTraits::child_end(currentBB); in calculate()