/external/llvm/include/llvm/Analysis/ |
D | LoopInfoImpl.h | 36 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 …]
|
D | RegionIterator.h | 38 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 …]
|
D | RegionInfoImpl.h | 242 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyBBInRegion() 243 SE = BlockTraits::child_end(BB); in verifyBBInRegion() 269 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyWalk() 270 SE = BlockTraits::child_end(BB); in verifyWalk() 455 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion() 648 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion() 650 if (num_successors <= 1 && exit == *(BlockTraits::child_begin(entry))) in isTrivialRegion() 842 else if (++BlockTraits::child_begin(BB) == BlockTraits::child_end(BB)) in getMaxRegionExit() 843 Exit = *BlockTraits::child_begin(BB); in getMaxRegionExit()
|
D | DominanceFrontier.h | 39 typedef GraphTraits<BlockT *> BlockTraits; typedef 118 typedef GraphTraits<BlockT *> BlockTraits; typedef
|
D | RegionInfo.h | 259 typedef GraphTraits<BlockT *> BlockTraits; 261 typedef typename BlockTraits::ChildIteratorType SuccIterTy; 663 typedef GraphTraits<BlockT *> BlockTraits; 665 typedef typename BlockTraits::ChildIteratorType SuccIterTy;
|
D | LoopInfo.h | 161 typedef GraphTraits<const BlockT*> BlockTraits; in isLoopExiting() typedef 162 for (typename BlockTraits::ChildIteratorType SI = in isLoopExiting() 163 BlockTraits::child_begin(BB), in isLoopExiting() 164 SE = BlockTraits::child_end(BB); SI != SE; ++SI) { in isLoopExiting()
|
D | DominanceFrontierImpl.h | 177 for (auto SI = BlockTraits::child_begin(currentBB), in calculate() 178 SE = BlockTraits::child_end(currentBB); in calculate()
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
D | RegionIterator.h | 43 using BlockTraits = GraphTraits<BlockT *>; variable 44 using SuccIterTy = typename BlockTraits::ChildIteratorType; 108 BItor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator() 111 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator() 121 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator() 147 while (BItor != BlockTraits::child_end(getNode()->getEntry()) 170 using BlockTraits = GraphTraits<BlockT *>; variable 171 using SuccIterTy = typename BlockTraits::ChildIteratorType; 185 : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator() 191 while (BlockTraits::child_end(Node->getEntry()) != Itor && in RNSuccIterator() [all …]
|
D | LoopInfoImpl.h | 102 typedef GraphTraits<BlockT *> BlockTraits; in getUniqueExitBlocks() typedef 127 if (std::distance(BlockTraits::child_begin(Block), in getUniqueExitBlocks() 128 BlockTraits::child_end(Block)) <= 2) { in getUniqueExitBlocks() 186 typedef GraphTraits<BlockT *> BlockTraits; in getLoopPreheader() typedef 187 typename BlockTraits::ChildIteratorType SI = BlockTraits::child_begin(Out); in getLoopPreheader() 189 if (SI != BlockTraits::child_end(Out)) in getLoopPreheader() 489 typedef GraphTraits<BlockT *> BlockTraits; typedef 490 typedef typename BlockTraits::ChildIteratorType SuccIterTy;
|
D | RegionInfoImpl.h | 263 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyBBInRegion() 288 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyWalk() 474 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion() 655 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion() 657 if (num_successors <= 1 && exit == *(BlockTraits::child_begin(entry))) in isTrivialRegion() 849 else if (++BlockTraits::child_begin(BB) == BlockTraits::child_end(BB)) in getMaxRegionExit() 850 Exit = *BlockTraits::child_begin(BB); in getMaxRegionExit()
|
D | DominanceFrontier.h | 48 using BlockTraits = GraphTraits<BlockT *>; 126 using BlockTraits = GraphTraits<BlockT *>;
|
D | RegionInfo.h | 269 using BlockTraits = GraphTraits<BlockT *>; 271 using SuccIterTy = typename BlockTraits::ChildIteratorType; 689 using BlockTraits = GraphTraits<BlockT *>; 691 using SuccIterTy = typename BlockTraits::ChildIteratorType;
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
D | LoopInfo.h | 147 typedef GraphTraits<BlockT*> BlockTraits; in isLoopExiting() typedef 148 for (typename BlockTraits::ChildIteratorType SI = in isLoopExiting() 149 BlockTraits::child_begin(const_cast<BlockT*>(BB)), in isLoopExiting() 150 SE = BlockTraits::child_end(const_cast<BlockT*>(BB)); SI != SE; ++SI) { in isLoopExiting() 191 typedef GraphTraits<BlockT*> BlockTraits; in getExitingBlocks() typedef 193 for (typename BlockTraits::ChildIteratorType I = in getExitingBlocks() 194 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitingBlocks() 222 typedef GraphTraits<BlockT*> BlockTraits; in getExitBlocks() typedef 224 for (typename BlockTraits::ChildIteratorType I = in getExitBlocks() 225 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitBlocks() [all …]
|