Searched refs:BlockTraits (Results 1 – 5 of 5) sorted by relevance
47 using BlockTraits = GraphTraits<BlockT *>;48 using SuccIterTy = typename BlockTraits::ChildIteratorType;111 BItor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()114 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator()124 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator()150 while (BItor != BlockTraits::child_end(getNode()->getEntry())171 using BlockTraits = GraphTraits<BlockT *>; variable172 using SuccIterTy = typename BlockTraits::ChildIteratorType;191 : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()197 while (BlockTraits::child_end(Node->getEntry()) != Itor && in RNSuccIterator()[all …]
48 using BlockTraits = GraphTraits<BlockT *>;106 using BlockTraits = GraphTraits<BlockT *>;
448 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion()625 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()627 if (num_successors <= 1 && exit == *(BlockTraits::child_begin(entry))) in isTrivialRegion()812 else if (std::next(BlockTraits::child_begin(BB)) == in getMaxRegionExit()813 BlockTraits::child_end(BB)) in getMaxRegionExit()814 Exit = *BlockTraits::child_begin(BB); in getMaxRegionExit()
265 using BlockTraits = GraphTraits<BlockT *>;267 using SuccIterTy = typename BlockTraits::ChildIteratorType;684 using BlockTraits = GraphTraits<BlockT *>;686 using SuccIterTy = typename BlockTraits::ChildIteratorType;
516 typedef GraphTraits<BlockT *> BlockTraits; typedef517 typedef typename BlockTraits::ChildIteratorType SuccIterTy;