Home
last modified time | relevance | path

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

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h33 template <class BlockT, class LoopT>
34 void LoopBase<BlockT, LoopT>::getExitingBlocks( in getExitingBlocks()
35 SmallVectorImpl<BlockT *> &ExitingBlocks) const { in getExitingBlocks()
38 for (auto *Succ : children<BlockT *>(BB)) in getExitingBlocks()
48 template <class BlockT, class LoopT>
49 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const { in getExitingBlock()
51 SmallVector<BlockT *, 8> ExitingBlocks; in getExitingBlock()
61 template <class BlockT, class LoopT>
62 void LoopBase<BlockT, LoopT>::getExitBlocks( in getExitBlocks()
63 SmallVectorImpl<BlockT *> &ExitBlocks) const { in getExitBlocks()
[all …]
H A DDominanceFrontierImpl.h34 template <class BlockT>
37 using DomTreeNodeT = DomTreeNodeBase<BlockT>;
39 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N, in DFCalculateWorkObject()
43 BlockT *currentBB;
44 BlockT *parentBB;
49 template <class BlockT, bool IsPostDom>
50 void DominanceFrontierBase<BlockT, IsPostDom>::removeBlock(BlockT *BB) { in removeBlock()
57 template <class BlockT, bool IsPostDom>
58 void DominanceFrontierBase<BlockT, IsPostDom>::addToFrontier(iterator I, in addToFrontier()
59 BlockT *Node) { in addToFrontier()
[all …]
H A DRegionInfo.h87 using BlockT = BasicBlock;
121 using BlockT = typename Tr::BlockT;
135 PointerIntPair<BlockT *, 1, bool> entry;
150 inline RegionNodeBase(RegionT *Parent, BlockT *Entry,
174 inline BlockT *getEntry() const { return entry.getPointer(); }
258 using BlockT = typename Tr::BlockT;
267 using BlockTraits = GraphTraits<BlockT *>;
268 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
278 BlockT *exit;
285 using BBNodeMapT = std::map<BlockT *, std::unique_ptr<RegionNodeT>>;
[all …]
H A DRegionInfoImpl.h44 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit, in RegionBase()
57 void RegionBase<Tr>::replaceEntry(BlockT *BB) { in replaceEntry()
62 void RegionBase<Tr>::replaceExit(BlockT *BB) { in replaceExit()
68 void RegionBase<Tr>::replaceEntryRecursive(BlockT *NewEntry) { in replaceEntryRecursive()
70 BlockT *OldEntry = getEntry(); in replaceEntryRecursive()
86 void RegionBase<Tr>::replaceExitRecursive(BlockT *NewExit) { in replaceExitRecursive()
88 BlockT *OldExit = getExit(); in replaceExitRecursive()
104 bool RegionBase<Tr>::contains(const BlockT *B) const { in contains()
105 BlockT *BB = const_cast<BlockT *>(B); in contains()
110 BlockT *entry = getEntry(), *exit = getExit(); in contains()
[all …]
H A DLoopInfo.h73 template <class BlockT, class LoopT> class LoopBase {
79 std::vector<BlockT *> Blocks;
81 SmallPtrSet<const BlockT *, 8> DenseBlockSet;
88 LoopBase(const LoopBase<BlockT, LoopT> &) = delete;
89 const LoopBase<BlockT, LoopT> &
90 operator=(const LoopBase<BlockT, LoopT> &) = delete;
104 BlockT *getHeader() const { return getBlocks().front(); } in getHeader()
132 bool contains(const BlockT *BB) const { in contains()
171 ArrayRef<BlockT *> getBlocks() const { in getBlocks()
175 typedef typename ArrayRef<BlockT *>::const_iterator block_iterator;
[all …]
H A DDominanceFrontier.h39 template <class BlockT, bool IsPostDom>
42 using DomSetType = std::set<BlockT *>; // Dom set for a bb
43 using DomSetMapType = std::map<BlockT *, DomSetType>; // Dom set map
46 using BlockTraits = GraphTraits<BlockT *>;
50 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots;
59 const SmallVectorImpl<BlockT *> &getRoots() const { return Roots; } in getRoots()
61 BlockT *getRoot() const { in getRoot()
83 iterator find(BlockT *B) { return Frontiers.find(B); } in find()
84 const_iterator find(BlockT *B) const { return Frontiers.find(B); } in find()
86 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier) { in addBasicBlock()
[all …]
H A DRegionIterator.h38 template <class NodeRef, class BlockT, class RegionT> class RNSuccIterator {
47 using BlockTraits = GraphTraits<BlockT *>;
87 NodeRef getISucc(BlockT *BB) const { in getISucc()
95 inline BlockT* getRegionSucc() const { in getRegionSucc()
101 inline bool isExit(BlockT* BB) const { in isExit()
106 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>;
137 BlockT *BB = isRegionMode() ? getRegionSucc() : *BItor;
169 template <class NodeRef, class BlockT, class RegionT>
170 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> {
171 using BlockTraits = GraphTraits<BlockT *>;
[all …]
H A DBlockFrequencyInfoImpl.h547 template <class BlockT> struct TypeMap {};
549 using BlockT = BasicBlock;
557 using BlockT = MachineBasicBlock;
565 template <class BlockT, class BFIImplT>
575 template <class BlockT> std::string getBlockName(const BlockT *BB) {
852 using BlockT = typename bfi_detail::TypeMap<BT>::BlockT;
859 using Successor = GraphTraits<const BlockT *>;
860 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
862 bfi_detail::BFICallbackVH<BlockT, BlockFrequencyInfoImpl>;
869 std::vector<const BlockT *> RPOT;
[all …]
H A DBlockFrequencyInfo.h31 template <class BlockT> class BlockFrequencyInfoImpl;
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/
H A DCFG.h138 template <class InstructionT, class BlockT>
140 : public iterator_facade_base<SuccIterator<InstructionT, BlockT>,
141 std::random_access_iterator_tag, BlockT, int,
142 BlockT *, BlockT *> {
145 using pointer = BlockT *;
146 using reference = BlockT *;
151 using Self = SuccIterator<InstructionT, BlockT>;
204 inline BlockT *operator*() const { return Inst->getSuccessor(Idx); }
207 inline BlockT *operator->() const { return operator*(); }
237 inline BlockT *getSource() { in getSource()
/netbsd-src/lib/libtelnet/
H A Dencrypt.h64 typedef unsigned char *BlockT; typedef
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineBlockFrequencyInfo.h24 template <class BlockT> class BlockFrequencyInfoImpl;
H A DMachineRegionInfo.h32 using BlockT = MachineBasicBlock;
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileLoaderBaseImpl.h52 template <typename BlockT> struct IRTraits;