Home
last modified time | relevance | path

Searched refs:BlockT (Results 1 – 13 of 13) sorted by relevance

/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h50 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const { in getExitingBlock()
76 BlockT *LoopBase<BlockT, LoopT>::getExitBlock() const { in getExitBlock()
92 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits()
111 for (BlockT *Successor : children<BlockT *>(Block)) { in getUniqueExitBlocks()
145 BlockT *LoopBase<BlockT, LoopT>::getUniqueExitBlock() const { in getUniqueExitBlock()
174 BlockT *LoopBase<BlockT, LoopT>::getLoopPreheader() const { in getLoopPreheader()
202 BlockT *LoopBase<BlockT, LoopT>::getLoopPredecessor() const { in getLoopPredecessor()
225 BlockT *LoopBase<BlockT, LoopT>::getLoopLatch() const { in getLoopLatch()
252 BlockT *NewBB, LoopInfoBase<BlockT, LoopT> &LIB) { in addBasicBlockToLoop() argument
305 df_ext_iterator<BlockT *, df_iterator_default_set<BlockT *>> in verifyLoop()
[all …]
H A DDominanceFrontierImpl.h35 template <class BlockT>
40 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N, in DFCalculateWorkObject()
44 BlockT *currentBB;
45 BlockT *parentBB;
51 void DominanceFrontierBase<BlockT, IsPostDom>::removeBlock(BlockT *BB) { in removeBlock()
68 iterator I, BlockT *Node) { in removeFromFrontier()
77 std::set<BlockT *> tmpSet; in compareDomSet()
78 for (BlockT *BB : DS2) in compareDomSet()
83 BlockT *Node = *I++; in compareDomSet()
111 BlockT *Node = I->first; in compare()
[all …]
H A DRegionInfo.h123 using BlockT = typename Tr::BlockT;
260 using BlockT = typename Tr::BlockT;
280 BlockT *exit;
681 using BlockT = typename Tr::BlockT;
694 using BBtoBBMap = DenseMap<BlockT *, BlockT *>;
763 bool isCommonDomFrontier(BlockT *BB, BlockT *entry, BlockT *exit) const;
767 bool isRegion(BlockT *entry, BlockT *exit) const;
781 RegionT *createRegion(BlockT *entry, BlockT *exit);
839 BlockT *getMaxRegionExit(BlockT *BB) const;
853 RegionT *getCommonRegion(BlockT *A, BlockT *B) const {
[all …]
H A DLoopInfo.h75 std::vector<BlockT *> Blocks;
85 const LoopBase<BlockT, LoopT> &
220 BlockT *Header = getHeader(); in isLoopLatch()
230 BlockT *H = getHeader(); in getNumBackEdges()
262 BlockT *getExitBlock() const;
279 typedef std::pair<const BlockT *, const BlockT *> Edge;
300 BlockT *getLoopLatch() const;
306 BlockT *H = getHeader(); in getLoopLatches()
321 void addBasicBlockToLoop(BlockT *NewBB, LoopInfoBase<BlockT, LoopT> &LI);
379 void moveToHeader(BlockT *BB) { in moveToHeader()
[all …]
H A DRegionInfoImpl.h45 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit, in RegionBase()
106 BlockT *BB = const_cast<BlockT *>(B); in contains()
192 BlockT *Pred = *PI; in getExitingBlocks()
262 for (BlockT *Succ : in verifyBBInRegion()
287 for (BlockT *Succ : in verifyWalk()
413 BlockT *BB = Element->template getNodeAs<BlockT>(); in addSubRegion()
559 BlockT *BB = Element->template getNodeAs<BlockT>(); in verifyBBMap()
567 bool RegionInfoBase<Tr>::isCommonDomFrontier(BlockT *BB, BlockT *entry, in isCommonDomFrontier()
579 bool RegionInfoBase<Tr>::isRegion(BlockT *entry, BlockT *exit) const { in isRegion()
621 void RegionInfoBase<Tr>::insertShortCut(BlockT *entry, BlockT *exit, in insertShortCut()
[all …]
H A DDominanceFrontier.h41 template <class BlockT, bool IsPostDom>
48 using BlockTraits = GraphTraits<BlockT *>;
52 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots;
63 BlockT *getRoot() const { in getRoot()
94 void removeBlock(BlockT *BB);
96 void addToFrontier(iterator I, BlockT *Node);
122 template <class BlockT>
124 : public DominanceFrontierBase<BlockT, false> {
126 using BlockTraits = GraphTraits<BlockT *>;
129 using DomTreeT = DomTreeBase<BlockT>;
[all …]
H A DRegionIterator.h39 template <class NodeRef, class BlockT, class RegionT>
43 using BlockTraits = GraphTraits<BlockT *>;
83 NodeRef getISucc(BlockT *BB) const { in getISucc()
91 inline BlockT* getRegionSucc() const { in getRegionSucc()
97 inline bool isExit(BlockT* BB) const { in isExit()
166 template <class NodeRef, class BlockT, class RegionT>
167 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>
170 using BlockTraits = GraphTraits<BlockT *>;
213 BlockT *BB = *Itor;
242 template <class NodeRef, class BlockT, class RegionT>
[all …]
H A DBlockFrequencyInfoImpl.h547 template <class BlockT> struct TypeMap {};
549 using BlockT = BasicBlock;
556 using BlockT = MachineBasicBlock;
570 template <class BlockT> std::string getBlockName(const BlockT *BB) {
847 using BlockT = typename bfi_detail::TypeMap<BT>::BlockT;
861 std::vector<const BlockT *> RPOT;
985 bool isIrrLoopHeader(const BlockT *BB) {
1063 const BlockT *Entry = &F->front();
1259 using BlockT = BT;
1319 const BlockT *BB = getBlock(Node);
[all …]
H A DBlockFrequencyInfo.h32 template <class BlockT> class BlockFrequencyInfoImpl;
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFG.h136 template <class InstructionT, class BlockT>
138 : public iterator_facade_base<SuccIterator<InstructionT, BlockT>,
139 std::random_access_iterator_tag, BlockT, int,
140 BlockT *, BlockT *> {
143 using pointer = BlockT *;
144 using reference = BlockT *;
149 using Self = SuccIterator<InstructionT, BlockT>;
202 inline BlockT *operator*() const { return Inst->getSuccessor(Idx); }
205 inline BlockT *operator->() const { return operator*(); }
235 inline BlockT *getSource() { in getSource()
/freebsd-12.1/contrib/telnet/libtelnet/
H A Dencrypt.h62 typedef unsigned char *BlockT; typedef
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineBlockFrequencyInfo.h25 template <class BlockT> class BlockFrequencyInfoImpl;
H A DMachineRegionInfo.h33 using BlockT = MachineBasicBlock;