Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericLoopInfoImpl.h48 BlockT *LoopBase<BlockT, LoopT>::getExitingBlock() const { in getExitingBlock()
107 BlockT *LoopBase<BlockT, LoopT>::getExitBlock() const { in getExitBlock()
118 for (BlockT *Predecessor : inverse_children<BlockT *>(EB)) in hasDedicatedExits()
135 for (BlockT *Successor : children<BlockT *>(BB)) in getUniqueExitBlocksHelper()
158 BlockT *LoopBase<BlockT, LoopT>::getUniqueExitBlock() const { in getUniqueExitBlock()
183 template <class BlockT> bool isLegalToHoistInto(BlockT *Block) { in isLegalToHoistInto()
199 BlockT *LoopBase<BlockT, LoopT>::getLoopPreheader() const { in getLoopPreheader()
224 BlockT *LoopBase<BlockT, LoopT>::getLoopPredecessor() const { in getLoopPredecessor()
245 BlockT *LoopBase<BlockT, LoopT>::getLoopLatch() const { in getLoopLatch()
272 BlockT *NewBB, LoopInfoBase<BlockT, LoopT> &LIB) { in addBasicBlockToLoop() argument
[all …]
H A DGenericLoopInfo.h65 std::vector<BlockT *> Blocks;
75 const LoopBase<BlockT, LoopT> &
269 BlockT *getExitingBlock() const;
277 BlockT *getExitBlock() const;
301 typedef std::pair<BlockT *, BlockT *> Edge;
322 BlockT *getLoopLatch() const;
328 BlockT *H = getHeader(); in getLoopLatches()
377 void addBasicBlockToLoop(BlockT *NewBB, LoopInfoBase<BlockT, LoopT> &LI);
415 void addBlockEntry(BlockT *BB) { in addBlockEntry()
435 void moveToHeader(BlockT *BB) { in moveToHeader()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDominanceFrontierImpl.h33 template <class BlockT>
38 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N, in DFCalculateWorkObject()
42 BlockT *currentBB;
43 BlockT *parentBB;
49 void DominanceFrontierBase<BlockT, IsPostDom>::removeBlock(BlockT *BB) { in removeBlock()
65 iterator I, BlockT *Node) { in removeFromFrontier()
74 std::set<BlockT *> tmpSet; in compareDomSet()
75 for (BlockT *BB : DS2) in compareDomSet()
80 BlockT *Node = *I++; in compareDomSet()
108 BlockT *Node = I->first; in compare()
[all …]
H A DRegionInfo.h121 using BlockT = typename Tr::BlockT;
258 using BlockT = typename Tr::BlockT;
278 BlockT *exit;
678 using BlockT = typename Tr::BlockT;
691 using BBtoBBMap = DenseMap<BlockT *, BlockT *>;
760 bool isCommonDomFrontier(BlockT *BB, BlockT *entry, BlockT *exit) const;
764 bool isRegion(BlockT *entry, BlockT *exit) const;
778 RegionT *createRegion(BlockT *entry, BlockT *exit);
836 BlockT *getMaxRegionExit(BlockT *BB) const;
850 RegionT *getCommonRegion(BlockT *A, BlockT *B) const {
[all …]
H A DRegionInfoImpl.h42 RegionBase<Tr>::RegionBase(BlockT *Entry, BlockT *Exit, in RegionBase()
103 BlockT *BB = const_cast<BlockT *>(B); in contains()
178 for (BlockT *Pred : llvm::inverse_children<BlockT *>(exit)) { in getExitingBlocks()
241 for (BlockT *Succ : llvm::children<BlockT *>(BB)) { in verifyBBInRegion()
248 for (BlockT *Pred : llvm::inverse_children<BlockT *>(BB)) { in verifyBBInRegion()
266 for (BlockT *Succ : llvm::children<BlockT *>(BB)) { in verifyWalk()
391 BlockT *BB = Element->template getNodeAs<BlockT>(); in addSubRegion()
447 for (BlockT *Pred : llvm::inverse_children<BlockT *>(getExit())) in getExpandedRegion()
535 BlockT *BB = Element->template getNodeAs<BlockT>(); in verifyBBMap()
545 for (BlockT *P : llvm::inverse_children<BlockT *>(BB)) { in isCommonDomFrontier()
[all …]
H A DDominanceFrontier.h39 template <class BlockT, bool IsPostDom>
44 using DomSetType = SetVector<BlockT *>;
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>
126 using BlockTraits = GraphTraits<BlockT *>;
129 using DomTreeT = DomTreeBase<BlockT>;
[all …]
H A DRegionIterator.h47 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>;
169 template <class NodeRef, class BlockT, class RegionT>
170 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> {
171 using BlockTraits = GraphTraits<BlockT *>;
219 BlockT *BB = *Itor;
248 template <class NodeRef, class BlockT, class RegionT>
[all …]
H A DEHUtils.h17 template <typename FunctionT, typename BlockT>
18 static void computeEHOnlyBlocks(FunctionT &F, DenseSet<BlockT *> &EHBlocks) { in computeEHOnlyBlocks()
23 DenseSet<BlockT *> WorkList; in computeEHOnlyBlocks()
24 DenseMap<BlockT *, Status> Statuses; in computeEHOnlyBlocks()
26 auto GetStatus = [&](BlockT *BB) { in computeEHOnlyBlocks()
33 auto CheckPredecessors = [&](BlockT *BB, Status Stat) { in computeEHOnlyBlocks()
44 auto AddSuccesors = [&](BlockT *BB) { in computeEHOnlyBlocks()
52 BlockT *StartBlock = &F.front(); in computeEHOnlyBlocks()
H A DBlockFrequencyInfoImpl.h549 using BlockT = BasicBlock;
575 template <class BlockT> std::string getBlockName(const BlockT *BB) {
852 using BlockT = typename bfi_detail::TypeMap<BT>::BlockT;
1140 for (const BlockT &BB : F)
1411 for (const BlockT &BB : *F) {
1521 for (const BlockT *DstBB : children<const BlockT *>(SrcBB)) {
1533 for (const BlockT &BB : *F) {
1544 for (const BlockT *DstBB : inverse_children<const BlockT *>(SrcBB)) {
1555 for (const BlockT &BB : *F) {
1641 using BlockT = BT;
[all …]
H A DBlockFrequencyInfo.h32 template <class BlockT> class BlockFrequencyInfoImpl;
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h46 using BlockT = typename ContextT::BlockT;
59 SmallVector<BlockT *, 1> Entries;
66 using BlockSetVectorT = SetVector<BlockT *, SmallVector<BlockT *, 8>,
106 bool isEntry(const BlockT *Block) const { in isEntry()
133 BlockT *getCyclePreheader() const;
137 BlockT *getCyclePredecessor() const;
224 using BlockT = typename ContextT::BlockT;
234 DenseMap<BlockT *, CycleT *> BlockMap;
264 void splitCriticalEdge(BlockT *Pred, BlockT *Succ, BlockT *New);
351 template <typename BlockT>
[all …]
H A DGenericUniformityImpl.h92 using BlockT = typename ContextT::BlockT;
265 using BlockT = typename ContextT::BlockT;
284 using BlockLabelMap = DenseMap<const BlockT *, const BlockT *>;
333 using BlockT = typename ContextT::BlockT;
407 BlockT *predBlock;
487 using BlockT = typename ContextT::BlockT;
504 const BlockT &DivTermBlock;
540 bool computeJoin(const BlockT &SuccBlock, const BlockT &PushedLabel) { in computeJoin()
577 bool visitCycleExitEdge(const BlockT &ExitBlock, const BlockT &Label) { in visitCycleExitEdge()
589 bool visitEdge(const BlockT &SuccBlock, const BlockT &Label) { in visitEdge()
[all …]
H A DGenericCycleImpl.h52 for (BlockT *Block : blocks()) { in getExitBlocks()
57 BlockT *Succ = TmpStorage[Idx]; in getExitBlocks()
92 BlockT *Out = nullptr;
95 BlockT *Header = getHeader();
109 using BlockT = typename ContextT::BlockT; variable
138 void run(BlockT *EntryBlock);
143 void dfs(BlockT *EntryBlock);
385 void GenericCycleInfo<ContextT>::splitCriticalEdge(BlockT *Pred, BlockT *Succ, in splitCriticalEdge()
455 DenseSet<BlockT *> Blocks; in validateTree()
456 DenseSet<BlockT *> Entries; in validateTree()
[all …]
H A DGenericSSAContext.h70 using BlockT = typename SSATraits::BlockT; variable
78 using DominatorTreeT = DominatorTreeBase<BlockT, false>;
87 static void appendBlockDefs(SmallVectorImpl<ValueRefT> &defs, BlockT &block);
89 const BlockT &block);
92 BlockT &block);
94 const BlockT &block);
97 const BlockT *getDefBlock(ConstValueRefT value) const;
99 Printable print(const BlockT *block) const;
100 Printable printAsOperand(const BlockT *BB) const;
H A DGenericConvergenceVerifier.h25 using BlockT = typename ContextT::BlockT;
43 void visit(const BlockT &BB);
H A DGenericUniformityInfo.h31 using BlockT = typename ContextT::BlockT;
77 bool hasDivergentTerminator(const BlockT &B);
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h137 template <class InstructionT, class BlockT>
139 : public iterator_facade_base<SuccIterator<InstructionT, BlockT>,
140 std::random_access_iterator_tag, BlockT, int,
141 BlockT *, BlockT *> {
144 using pointer = BlockT *;
145 using reference = BlockT *;
150 using Self = SuccIterator<InstructionT, BlockT>;
203 inline BlockT *operator*() const { return Inst->getSuccessor(Idx); }
206 inline BlockT *operator->() const { return operator*(); }
236 inline BlockT *getSource() { in getSource()
H A DSSAContext.h32 using BlockT = BasicBlock;
H A DGenericConvergenceVerifierImpl.h58 void GenericConvergenceVerifier<ContextT>::visit(const BlockT &BB) { in visit()
136 DenseMap<const BlockT *, SmallVector<const InstructionT *, 8>> LiveTokenMap; in verify()
/freebsd-14.2/contrib/telnet/libtelnet/
H A Dencrypt.h62 typedef unsigned char *BlockT; typedef
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineSSAContext.h36 using BlockT = MachineBasicBlock;
H A DMachineBlockFrequencyInfo.h24 template <class BlockT> class BlockFrequencyInfoImpl;
H A DMachineRegionInfo.h32 using BlockT = MachineBasicBlock;
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileLoaderBaseImpl.h59 template <typename BlockT> struct IRTraits;