Home
last modified time | relevance | path

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

/external/llvm/include/llvm/Analysis/
DLoopInfoImpl.h33 template<class BlockT, class LoopT>
34 void LoopBase<BlockT, LoopT>::
35 getExitingBlocks(SmallVectorImpl<BlockT *> &ExitingBlocks) const { in getExitingBlocks()
36 typedef GraphTraits<BlockT*> BlockTraits; in getExitingBlocks()
50 template<class BlockT, class LoopT>
51 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const { in getExitingBlock()
52 SmallVector<BlockT*, 8> ExitingBlocks; in getExitingBlock()
62 template<class BlockT, class LoopT>
63 void LoopBase<BlockT, LoopT>::
64 getExitBlocks(SmallVectorImpl<BlockT*> &ExitBlocks) const { in getExitBlocks()
[all …]
DDominanceFrontierImpl.h28 template <class BlockT>
31 typedef DomTreeNodeBase<BlockT> DomTreeNodeT;
33 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N, in DFCalculateWorkObject()
36 BlockT *currentBB;
37 BlockT *parentBB;
42 template <class BlockT>
43 void DominanceFrontierBase<BlockT>::removeBlock(BlockT *BB) { in removeBlock()
50 template <class BlockT>
51 void DominanceFrontierBase<BlockT>::addToFrontier(iterator I, in addToFrontier()
52 BlockT *Node) { in addToFrontier()
[all …]
DRegionInfo.h80 typedef BasicBlock BlockT;
114 typedef typename Tr::BlockT BlockT;
131 PointerIntPair<BlockT *, 1, bool> entry;
146 inline RegionNodeBase(RegionT *Parent, BlockT *Entry,
167 inline BlockT *getEntry() const { return entry.getPointer(); }
249 typedef typename Tr::BlockT BlockT;
258 typedef GraphTraits<BlockT *> BlockTraits;
259 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits;
273 BlockT *exit;
280 typedef std::map<BlockT *, RegionNodeT *> BBNodeMapT;
[all …]
DDominanceFrontier.h31 template <class BlockT>
34 typedef std::set<BlockT *> DomSetType; // Dom set for a bb
35 typedef std::map<BlockT *, DomSetType> DomSetMapType; // Dom set map
38 typedef GraphTraits<BlockT *> BlockTraits;
41 std::vector<BlockT *> Roots;
51 inline const std::vector<BlockT *> &getRoots() const { in getRoots()
55 BlockT *getRoot() const { in getRoot()
77 iterator find(BlockT *B) { return Frontiers.find(B); } in find()
78 const_iterator find(BlockT *B) const { return Frontiers.find(B); } in find()
80 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier) { in addBasicBlock()
[all …]
DLoopInfo.h65 template<class BlockT, class LoopT>
72 std::vector<BlockT*> Blocks;
74 SmallPtrSet<const BlockT*, 8> DenseBlockSet;
80 LoopBase(const LoopBase<BlockT, LoopT> &) = delete;
81 const LoopBase<BlockT, LoopT>&
82 operator=(const LoopBase<BlockT, LoopT> &) = delete;
101 BlockT *getHeader() const { return Blocks.front(); } in getHeader()
118 bool contains(const BlockT *BB) const { in contains()
144 const std::vector<BlockT*> &getBlocks() const { return Blocks; } in getBlocks()
145 typedef typename std::vector<BlockT*>::const_iterator block_iterator;
[all …]
DRegionInfoImpl.h35 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit, in RegionBase()
54 void RegionBase<Tr>::replaceEntry(BlockT *BB) { in replaceEntry()
59 void RegionBase<Tr>::replaceExit(BlockT *BB) { in replaceExit()
65 void RegionBase<Tr>::replaceEntryRecursive(BlockT *NewEntry) { in replaceEntryRecursive()
67 BlockT *OldEntry = getEntry(); in replaceEntryRecursive()
84 void RegionBase<Tr>::replaceExitRecursive(BlockT *NewExit) { in replaceExitRecursive()
86 BlockT *OldExit = getExit(); in replaceExitRecursive()
103 bool RegionBase<Tr>::contains(const BlockT *B) const { in contains()
104 BlockT *BB = const_cast<BlockT *>(B); in contains()
109 BlockT *entry = getEntry(), *exit = getExit(); in contains()
[all …]
DRegionIterator.h33 template<class NodeType, class BlockT, class RegionT>
38 typedef GraphTraits<BlockT*> BlockTraits;
72 NodeType* getISucc(BlockT* BB) const { in getISucc()
80 inline BlockT* getRegionSucc() const { in getRegionSucc()
86 inline bool isExit(BlockT* BB) const { in isExit()
90 typedef RNSuccIterator<NodeType, BlockT, RegionT> Self;
124 BlockT *BB = isRegionMode() ? getRegionSucc() : *BItor;
157 template<class NodeType, class BlockT, class RegionT>
158 class RNSuccIterator<FlatIt<NodeType>, BlockT, RegionT>
161 typedef GraphTraits<BlockT*> BlockTraits;
[all …]
DBlockFrequencyInfoImpl.h498 template <class BlockT> struct TypeMap {};
500 typedef BasicBlock BlockT;
507 typedef MachineBasicBlock BlockT;
521 template <class BlockT> std::string getBlockName(const BlockT *BB) {
789 typedef typename bfi_detail::TypeMap<BT>::BlockT BlockT;
799 typedef GraphTraits<const BlockT *> Successor;
800 typedef GraphTraits<Inverse<const BlockT *>> Predecessor;
807 std::vector<const BlockT *> RPOT;
808 DenseMap<const BlockT *, BlockNode> Nodes;
810 typedef typename std::vector<const BlockT *>::const_iterator rpot_iterator;
[all …]
DBlockFrequencyInfo.h25 template <class BlockT> class BlockFrequencyInfoImpl;
/external/mesa3d/src/gallium/drivers/radeon/
DAMDILCFGStructurizer.cpp222 template <class BlockT, class InstrT, class RegiT>
225 BlockT *landBlk;
276 typedef typename FuncGTraits::NodeType BlockT; typedef in llvmCFGStruct::CFGStructurizer
277 typedef GraphTraits<BlockT *> BlockGTraits;
278 typedef GraphTraits<Inverse<BlockT *> > InvBlockGTraits;
280 typedef typename BlockT::iterator InstrIterator;
284 typedef std::map<BlockT *, BlockInfo *> BlockInfoMap;
288 typedef LandInformation<BlockT, InstrT, RegiT> LoopLandInfo;
291 typedef SmallVector<BlockT *, 32> BlockTSmallerVector;
304 void reversePredicateSetter(typename BlockT::iterator);
[all …]
/external/llvm/include/llvm/CodeGen/
DMachineBlockFrequencyInfo.h25 template <class BlockT> class BlockFrequencyInfoImpl;
DMachineRegionInfo.h33 typedef MachineBasicBlock BlockT;