Home
last modified time | relevance | path

Searched refs:BasicBlock (Results 1 – 25 of 539) sorted by relevance

12345678910>>...22

/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DBasicBlock.h82 BasicBlock(const BasicBlock &) = delete;
83 BasicBlock &operator=(const BasicBlock &) = delete;
84 ~BasicBlock();
224 return const_cast<BasicBlock *>( in getSinglePredecessor()
236 return const_cast<BasicBlock *>( in getUniquePredecessor()
251 BasicBlock *getSingleSuccessor() { in getSingleSuccessor()
252 return const_cast<BasicBlock *>( in getSingleSuccessor()
261 BasicBlock *getUniqueSuccessor() { in getUniqueSuccessor()
291 friend BasicBlock; variable
339 return &BasicBlock::InstList; in getSublistAccess()
[all …]
H A DDominators.h36 extern template class DomTreeNodeBase<BasicBlock>;
40 extern template class cfg::Update<BasicBlock *>;
43 using BBDomTree = DomTreeBase<BasicBlock>;
75 using DomTreeNode = DomTreeNodeBase<BasicBlock>;
78 const BasicBlock *Start;
79 const BasicBlock *End;
82 BasicBlockEdge(const BasicBlock *Start_, const BasicBlock *End_) : in BasicBlockEdge()
85 BasicBlockEdge(const std::pair<BasicBlock *, BasicBlock *> &Pair) in BasicBlockEdge() argument
88 BasicBlockEdge(const std::pair<const BasicBlock *, const BasicBlock *> &Pair) in BasicBlockEdge() argument
91 const BasicBlock *getStart() const { in getStart()
[all …]
H A DDomTreeUpdater.h107 void insertEdge(BasicBlock *From, BasicBlock *To);
118 void insertEdgeRelaxed(BasicBlock *From, BasicBlock *To);
129 void deleteEdge(BasicBlock *From, BasicBlock *To);
140 void deleteEdgeRelaxed(BasicBlock *From, BasicBlock *To);
149 void deleteBB(BasicBlock *DelBB);
159 void callbackDeleteBB(BasicBlock *DelBB,
189 CallBackOnDeletion(BasicBlock *V, in CallBackOnDeletion()
194 BasicBlock *DelBB = nullptr;
209 SmallPtrSet<BasicBlock *, 8> DeletedBBs;
227 BasicBlock *To);
[all …]
H A DCFG.h117 inline bool pred_empty(const BasicBlock *BB) { in pred_empty()
125 inline pred_range predecessors(BasicBlock *BB) { in predecessors()
283 inline bool succ_empty(const BasicBlock *BB) {
289 inline succ_range successors(BasicBlock *BB) {
303 template <> struct GraphTraits<BasicBlock*> {
304 using NodeRef = BasicBlock *;
313 using NodeRef = const BasicBlock *;
328 using NodeRef = BasicBlock *;
337 using NodeRef = const BasicBlock *;
370 public GraphTraits<const BasicBlock*> {
[all …]
/freebsd-12.1/contrib/llvm/lib/IR/
H A DBasicBlock.cpp64 BasicBlock::~BasicBlock() { in ~BasicBlock()
115 iplist<BasicBlock>::iterator BasicBlock::eraseFromParent() { in eraseFromParent()
121 void BasicBlock::moveBefore(BasicBlock *MovePos) { in moveBefore()
128 void BasicBlock::moveAfter(BasicBlock *MovePos) { in moveAfter()
234 const BasicBlock *BasicBlock::getSinglePredecessor() const { in getSinglePredecessor()
247 const BasicBlock *BasicBlock::getUniquePredecessor() const { in getUniquePredecessor()
269 const BasicBlock *BasicBlock::getSingleSuccessor() const { in getSingleSuccessor()
277 const BasicBlock *BasicBlock::getUniqueSuccessor() const { in getUniqueSuccessor()
291 iterator_range<BasicBlock::phi_iterator> BasicBlock::phis() { in phis()
302 void BasicBlock::removePredecessor(BasicBlock *Pred, in removePredecessor()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DMemorySSAUpdater.h68 std::pair<const GraphDiff<BasicBlock *> *, Inverse<BasicBlock *>>;
105 void removeEdge(BasicBlock *From, BasicBlock *To);
109 void removeDuplicatePhiEdgesBetween(BasicBlock *From, BasicBlock *To);
120 void updateForClonedBlockIntoPred(BasicBlock *BB, BasicBlock *P1,
128 ArrayRef<BasicBlock *> ExitBlocks,
153 void moveAllAfterSpliceBlocks(BasicBlock *From, BasicBlock *To,
169 void moveAllAfterMergeBlocks(BasicBlock *From, BasicBlock *To,
177 BasicBlock *Old, BasicBlock *New, ArrayRef<BasicBlock *> Preds,
253 void moveAllAccesses(BasicBlock *From, BasicBlock *To, Instruction *Start);
257 getPreviousDefFromEnd(BasicBlock *,
[all …]
H A DBranchProbabilityInfo.h104 bool isEdgeHot(const BasicBlock *Src, const BasicBlock *Dst) const;
110 const BasicBlock *getHotSucc(const BasicBlock *BB) const;
138 void eraseBlock(const BasicBlock *BB);
141 using SccMap = DenseMap<const BasicBlock *, int>;
157 BPI->eraseBlock(cast<BasicBlock>(getValPtr())); in deleted()
170 using Edge = std::pair<const BasicBlock *, unsigned>;
193 bool calcUnreachableHeuristics(const BasicBlock *BB);
194 bool calcMetadataWeights(const BasicBlock *BB);
195 bool calcColdCallHeuristics(const BasicBlock *BB);
196 bool calcPointerHeuristics(const BasicBlock *BB);
[all …]
H A DIteratedDominanceFrontier.h49 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT) in IDFCalculator() argument
52 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT, in IDFCalculator() argument
53 const GraphDiff<BasicBlock *, IsPostDom> *GD) in IDFCalculator() argument
61 void setDefiningBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) { in setDefiningBlocks()
71 void setLiveInBlocks(const SmallPtrSetImpl<BasicBlock *> &Blocks) { in setLiveInBlocks()
89 void calculate(SmallVectorImpl<BasicBlock *> &IDFBlocks);
92 DominatorTreeBase<BasicBlock, IsPostDom> &DT;
93 const GraphDiff<BasicBlock *, IsPostDom> *GD;
95 const SmallPtrSetImpl<BasicBlock *> *LiveInBlocks;
96 const SmallPtrSetImpl<BasicBlock *> *DefBlocks;
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/Transforms/Scalar/
H A DJumpThreading.h33 class BasicBlock; variable
112 bool ProcessBlock(BasicBlock *BB);
113 bool ThreadEdge(BasicBlock *BB, const SmallVectorImpl<BasicBlock *> &PredBBs,
114 BasicBlock *SuccBB);
116 BasicBlock *BB, const SmallVectorImpl<BasicBlock *> &PredBBs);
139 bool ProcessImpliedCondition(BasicBlock *BB);
142 void UnfoldSelectInstr(BasicBlock *Pred, BasicBlock *BB, SelectInst *SI,
149 bool ProcessGuards(BasicBlock *BB);
153 BasicBlock *SplitBlockPreds(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
155 void UpdateBlockFreqAndEdgeWeight(BasicBlock *PredBB, BasicBlock *BB,
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h57 void FoldSingleEntryPHINodes(BasicBlock *BB,
142 inline BasicBlock *
143 SplitCriticalEdge(BasicBlock *BB, succ_iterator SI,
168 inline BasicBlock *
169 SplitCriticalEdge(BasicBlock *Src, BasicBlock *Dst,
189 BasicBlock *SplitEdge(BasicBlock *From, BasicBlock *To,
197 BasicBlock *SplitBlock(BasicBlock *Old, Instruction *SplitPt,
215 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
234 BasicBlock *OrigBB, ArrayRef<BasicBlock *> Preds, const char *Suffix,
300 Value *GetIfCondition(BasicBlock *BB, BasicBlock *&IfTrue,
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DCFG.cpp28 SmallVectorImpl<std::pair<const BasicBlock*,const BasicBlock*> > &Result) { in FindFunctionBackedges() argument
29 const BasicBlock *BB = &F.getEntryBlock(); in FindFunctionBackedges()
33 SmallPtrSet<const BasicBlock*, 8> Visited; in FindFunctionBackedges()
42 const BasicBlock *ParentBB = Top.first; in FindFunctionBackedges()
73 const BasicBlock *Succ) { in GetSuccessorNumber()
99 const BasicBlock *FirstPred = *I; in isCriticalEdge()
125 const BasicBlock *BB1, const BasicBlock *BB2) { in loopContainsBoth()
132 SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, in isPotentiallyReachableFromMany()
175 bool llvm::isPotentiallyReachable(const BasicBlock *A, const BasicBlock *B, in isPotentiallyReachable()
180 SmallVector<BasicBlock*, 32> Worklist; in isPotentiallyReachable()
[all …]
H A DMemorySSAUpdater.cpp43 BasicBlock *BB, in getPreviousDefRecursive()
156 BasicBlock *BB, in getPreviousDefFromEnd()
396 void MemorySSAUpdater::removeEdge(BasicBlock *From, BasicBlock *To) { in removeEdge()
421 void MemorySSAUpdater::cloneUsesAndDefs(BasicBlock *BB, BasicBlock *NewBB, in cloneUsesAndDefs()
514 BasicBlock *NewBlock = cast_or_null<BasicBlock>(VMap.lookup(BB)); in updateForClonedLoop()
540 BasicBlock *BB, BasicBlock *P1, const ValueToValueMapTy &VM) { in updateForClonedBlockIntoPred()
673 [&](const SmallSetVector<BasicBlock *, 2> &BBSet) -> BasicBlock * { in applyInsertUpdates() argument
683 [&](BasicBlock *PrevIDom, BasicBlock *CurrIDom, in applyInsertUpdates()
725 SmallDenseMap<std::pair<BasicBlock *, BasicBlock *>, int> EdgeCountMap; in applyInsertUpdates()
954 void MemorySSAUpdater::moveAllAccesses(BasicBlock *From, BasicBlock *To, in moveAllAccesses()
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp53 bool CompareIfRegionBlock(BasicBlock *Head1, BasicBlock *Head2,
54 BasicBlock *Block1, BasicBlock *Block2);
59 bool run(BasicBlock *BB);
142 BasicBlock *LastCondBlock = nullptr; in FlattenParallelAndOr()
143 BasicBlock *FirstCondBlock = nullptr; in FlattenParallelAndOr()
144 BasicBlock *UnCondBlock = nullptr; in FlattenParallelAndOr()
151 BasicBlock *Pred = *PI; in FlattenParallelAndOr()
281 BasicBlock *CB; in FlattenParallelAndOr()
325 bool FlattenCFGOpt::CompareIfRegionBlock(BasicBlock *Head1, BasicBlock *Head2, in CompareIfRegionBlock()
400 BasicBlock *IfTrue2, *IfFalse2; in MergeIfRegion()
[all …]
H A DLoopUnrollRuntime.cpp70 BasicBlock *PreHeader, BasicBlock *NewPreHeader, in ConnectProlog()
86 BasicBlock *PrologLatch = cast<BasicBlock>(VMap[Latch]); in ConnectProlog()
185 BasicBlock *Exit, BasicBlock *PreHeader, in ConnectEpilog()
186 BasicBlock *EpilogPreHeader, BasicBlock *NewPreHeader, in ConnectEpilog()
191 BasicBlock *EpilogLatch = cast<BasicBlock>(VMap[Latch]); in ConnectEpilog()
304 BasicBlock *InsertBot, BasicBlock *Preheader, in CloneLoopBlocks()
353 BasicBlock *FirstLoopBB = cast<BasicBlock>(VMap[Header]); in CloneLoopBlocks()
391 BasicBlock *NewLatch = cast<BasicBlock>(VMap[Latch]); in CloneLoopBlocks()
470 Loop *L, SmallVectorImpl<BasicBlock *> &OtherExits, BasicBlock *LatchExit, in canProfitablyUnrollMultiExitLoop()
669 BasicBlock *NewPreHeader; in UnrollRuntimeLoopRemainder()
[all …]
H A DBasicBlockUtils.cpp279 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, DominatorTree *DT, in SplitEdge()
321 BasicBlock *llvm::SplitBlock(BasicBlock *Old, Instruction *SplitPt, in SplitBlock()
354 static void UpdateAnalysisInformation(BasicBlock *OldBB, BasicBlock *NewBB, in UpdateAnalysisInformation()
445 static void UpdatePHINodes(BasicBlock *OrigBB, BasicBlock *NewBB, in UpdatePHINodes()
511 BasicBlock *llvm::SplitBlockPredecessors(BasicBlock *BB, in SplitBlockPredecessors()
532 BasicBlock *NewBB = BasicBlock::Create( in SplitBlockPredecessors()
583 BasicBlock *NewBB1 = BasicBlock::Create(OrigBB->getContext(), in SplitLandingPadPredecessors()
728 BasicBlock *ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail); in SplitBlockAndInsertIfThen()
771 BasicBlock *ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail); in SplitBlockAndInsertIfThenElse()
772 BasicBlock *ElseBlock = BasicBlock::Create(C, "", Head->getParent(), Tail); in SplitBlockAndInsertIfThenElse()
[all …]
H A DLowerSwitch.cpp84 BasicBlock* BB;
99 BasicBlock *OrigBlock, BasicBlock *Default,
101 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val, BasicBlock *OrigBlock,
182 static void fixPhis(BasicBlock *SuccBB, BasicBlock *OrigBB, BasicBlock *NewBB, in fixPhis()
219 BasicBlock *
222 BasicBlock *Predecessor, BasicBlock *OrigBlock, in switchConvert()
285 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in switchConvert()
312 BasicBlock* NewLeaf = BasicBlock::Create(Val->getContext(), "LeafBlock"); in newLeafBlock()
344 BasicBlock* Succ = Leaf.BB; in newLeafBlock()
530 BasicBlock *NewDefault = BasicBlock::Create(SI->getContext(), "NewDefault"); in processSwitchInst()
[all …]
H A DCloneFunction.cpp41 BasicBlock *llvm::CloneBasicBlock(const BasicBlock *BB, ValueToValueMapTy &VMap, in CloneBasicBlock()
46 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), "", F); in CloneBasicBlock()
167 const BasicBlock &BB = *BI; in CloneFunctionInto()
296 BasicBlock *NewBB; in CloneBlock()
398 BasicBlock *Dest = const_cast<BasicBlock*>(Case.getCaseSuccessor()); in CloneBlock()
456 const BasicBlock *StartingBB; in CloneAndPruneIntoFromInst()
481 BasicBlock *NewBB = cast_or_null<BasicBlock>(V); in CloneAndPruneIntoFromInst()
511 BasicBlock *NewBB = cast<BasicBlock>(VMap[OldBB]); in CloneAndPruneIntoFromInst()
521 if (BasicBlock *MappedBlock = cast_or_null<BasicBlock>(V)) { in CloneAndPruneIntoFromInst()
738 Loop *llvm::cloneLoopWithPreheader(BasicBlock *Before, BasicBlock *LoopDomBB, in cloneLoopWithPreheader()
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp83 using BB2BBMap = DenseMap<BasicBlock *, BasicBlock *>;
223 void delPhiValues(BasicBlock *From, BasicBlock *To);
225 void addPhiValues(BasicBlock *From, BasicBlock *To);
234 BasicBlock *getNextFlow(BasicBlock *Dominator);
238 BasicBlock *needPostfix(BasicBlock *Flow, bool ExitUseAllowed);
389 BasicBlock *BB = N->getNodeAs<BasicBlock>(); in analyzeLoops()
579 void StructurizeCFG::delPhiValues(BasicBlock *From, BasicBlock *To) { in delPhiValues()
711 BasicBlock *BB = Node->getNodeAs<BasicBlock>(); in changeExit()
721 BasicBlock *StructurizeCFG::getNextFlow(BasicBlock *Dominator) { in getNextFlow()
725 BasicBlock *Flow = BasicBlock::Create(Context, FlowBlockName, in getNextFlow()
[all …]
H A DLoopSink.cpp86 for (BasicBlock *B : BBs) in adjustedSumFreq()
120 static SmallPtrSet<BasicBlock *, 2>
124 SmallPtrSet<BasicBlock *, 2> BBsToSinkInto; in findBBsToSinkInto()
139 for (BasicBlock *ColdestBB : ColdLoopBBs) { in findBBsToSinkInto()
156 for (BasicBlock *BB : BBsToSinkInto) { in findBBsToSinkInto()
181 SmallPtrSet<BasicBlock *, 2> BBs; in sinkInstruction()
218 llvm::sort(SortedBBsToSinkInto, [&](BasicBlock *A, BasicBlock *B) { in sinkInstruction()
281 for (BasicBlock *BB : L.blocks()) in sinkLoopInvariantInstructions()
286 SmallVector<BasicBlock *, 10> ColdLoopBBs; in sinkLoopInvariantInstructions()
289 for (BasicBlock *B : L.blocks()) in sinkLoopInvariantInstructions()
[all …]
H A DSimpleLoopUnswitch.cpp680 SmallDenseMap<BasicBlock *, BasicBlock *, 2> SplitExitBBMap; in unswitchTrivialSwitch()
943 Loop &L, BasicBlock *LoopPH, BasicBlock *SplitBB, in buildClonedLoopBlocks()
944 ArrayRef<BasicBlock *> ExitBlocks, BasicBlock *ParentBB, in buildClonedLoopBlocks()
945 BasicBlock *UnswitchedSuccBB, BasicBlock *ContinueSuccBB, in buildClonedLoopBlocks()
946 const SmallDenseMap<BasicBlock *, BasicBlock *, 16> &DominatingSucc, in buildClonedLoopBlocks() argument
1337 llvm::sort(OrderedClonedExitsInLoops, [&](BasicBlock *LHS, BasicBlock *RHS) { in buildClonedLoops()
1428 for (BasicBlock *BB : llvm::concat<BasicBlock *const>(L.blocks(), ExitBlocks)) in deleteDeadClonedBlocks()
1430 if (BasicBlock *ClonedBB = cast_or_null<BasicBlock>(VMap->lookup(BB))) in deleteDeadClonedBlocks()
1716 [&](BasicBlock *LHS, BasicBlock *RHS) { in rebuildLoopAfterUnswitch()
1974 SmallDenseMap<BasicBlock *, BasicBlock *, 16> DominatingSucc; in unswitchNontrivialInvariants()
[all …]
/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp100 SmallVector<BasicBlock *, 8> Stack; in isUniformlyReached()
101 SmallPtrSet<BasicBlock *, 8> Visited; in isUniformlyReached()
103 for (BasicBlock *Pred : predecessors(&BB)) in isUniformlyReached()
107 BasicBlock *Top = Stack.pop_back_val(); in isUniformlyReached()
127 BasicBlock *NewRetBlock = BasicBlock::Create(F.getContext(), Name, &F); in unifyReturnBlockSet()
142 for (BasicBlock *BB : ReturningBlocks) { in unifyReturnBlockSet()
153 for (BasicBlock *BB : ReturningBlocks) { in unifyReturnBlockSet()
174 BasicBlock *DummyReturnBB = nullptr; in runOnFunction()
176 for (BasicBlock *BB : PDT.getRoots()) { in runOnFunction()
202 BasicBlock *TransitionBB = BasicBlock::Create(F.getContext(), in runOnFunction()
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp59 unsigned BasicBlock::addPredecessor(BasicBlock *Pred) { in addPredecessor()
166 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort()
190 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort()
209 void BasicBlock::computeDominator() { in computeDominator()
210 BasicBlock *Candidate = nullptr; in computeDominator()
236 void BasicBlock::computePostDominator() { in computePostDominator()
237 BasicBlock *Candidate = nullptr; in computePostDominator()
268 BasicBlock::TopologyNode BasicBlock::*TN) { in computeNodeSize()
269 BasicBlock::TopologyNode *N = &(B->*TN); in computeNodeSize()
279 BasicBlock::TopologyNode BasicBlock::*TN) { in computeNodeID()
[all …]
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DWinEHPrepare.cpp98 MapVector<BasicBlock *, std::vector<BasicBlock *>> FuncletBlocks;
177 for (BasicBlock &BB : *F) { in calculateStateNumbersForInvokes()
186 BasicBlock *FuncletUnwindDest; in calculateStateNumbersForInvokes()
219 static const BasicBlock *getEHPadFromPredecessor(const BasicBlock *BB, in getEHPadFromPredecessor()
683 for (BasicBlock &BB : F) { in colorFunclets()
695 BasicBlock *BB = &*FI++; in demotePHIsOnFunclets()
736 std::vector<std::pair<BasicBlock *, BasicBlock *>> Orig2Clone; in cloneCommonBlocks()
751 BasicBlock *CBB = in cloneCommonBlocks()
1010 BasicBlock *BB = &*FI++; in cleanupPreparedFunclets()
1023 for (BasicBlock &BB : F) { in verifyPreparedFunclets()
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp186 BasicBlock *EntryBlock, BasicBlock *ExitBlock, in OutlineRegionInfo()
192 BasicBlock *ExitBlock;
410 [&ORE](SmallVectorImpl<BasicBlock *> &BlockList) -> BasicBlock * { in computeOutliningColdRegionsInfo()
554 auto IsSuccessor = [](BasicBlock *Succ, BasicBlock *BB) { in computeOutliningInfo()
563 auto GetReturnBlock = [&](BasicBlock *Succ1, BasicBlock *Succ2) { in computeOutliningInfo()
569 return std::make_tuple<BasicBlock *, BasicBlock *>(nullptr, nullptr); in computeOutliningInfo()
573 auto GetCommonSucc = [&](BasicBlock *Succ1, BasicBlock *Succ2) { in computeOutliningInfo()
579 return std::make_tuple<BasicBlock *, BasicBlock *>(nullptr, nullptr); in computeOutliningInfo()
966 BasicBlock *NewE = cast<BasicBlock>(VMap[E]); in FunctionCloner()
993 BasicBlock *NewExitBlock = cast<BasicBlock>(VMap[RegionInfo.ExitBlock]); in FunctionCloner()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DWasmEHFuncInfo.h26 using BBOrMBB = PointerUnion<const BasicBlock *, MachineBasicBlock *>;
38 const BasicBlock *getEHPadUnwindDest(const BasicBlock *BB) const { in getEHPadUnwindDest()
39 return EHPadUnwindMap.lookup(BB).get<const BasicBlock *>(); in getEHPadUnwindDest()
41 void setEHPadUnwindDest(const BasicBlock *BB, const BasicBlock *Dest) { in setEHPadUnwindDest()
44 const BasicBlock *getThrowUnwindDest(BasicBlock *BB) const { in getThrowUnwindDest()
45 return ThrowUnwindMap.lookup(BB).get<const BasicBlock *>(); in getThrowUnwindDest()
47 void setThrowUnwindDest(const BasicBlock *BB, const BasicBlock *Dest) { in setThrowUnwindDest()
50 bool hasEHPadUnwindDest(const BasicBlock *BB) const { in hasEHPadUnwindDest()
53 bool hasThrowUnwindDest(const BasicBlock *BB) const { in hasThrowUnwindDest()

12345678910>>...22