| /external/llvm/include/llvm/Transforms/Utils/ |
| D | BasicBlockUtils.h | 33 class TerminatorInst; variable
140 BasicBlock *SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum,
161 TerminatorInst *TI = (*PI)->getTerminator();
176 TerminatorInst *TI = Src->getTerminator();
279 TerminatorInst *SplitBlockAndInsertIfThen(Value *Cond, Instruction *SplitBefore,
299 TerminatorInst **ThenTerm,
300 TerminatorInst **ElseTerm,
|
| /external/llvm/include/llvm/IR/ |
| D | InstVisitor.h | 166 RetTy visitReturnInst(ReturnInst &I) { DELEGATE(TerminatorInst);} in visitReturnInst()
167 RetTy visitBranchInst(BranchInst &I) { DELEGATE(TerminatorInst);} in visitBranchInst()
168 RetTy visitSwitchInst(SwitchInst &I) { DELEGATE(TerminatorInst);} in visitSwitchInst()
169 RetTy visitIndirectBrInst(IndirectBrInst &I) { DELEGATE(TerminatorInst);} in visitIndirectBrInst()
170 RetTy visitResumeInst(ResumeInst &I) { DELEGATE(TerminatorInst);} in visitResumeInst()
171 RetTy visitUnreachableInst(UnreachableInst &I) { DELEGATE(TerminatorInst);} in visitUnreachableInst()
234 RetTy visitTerminatorInst(TerminatorInst &I) { DELEGATE(Instruction);} in visitTerminatorInst()
247 DELEGATE(TerminatorInst); in visitCallSite()
|
| D | BasicBlock.h | 28 class TerminatorInst; variable
122 TerminatorInst *getTerminator();
123 const TerminatorInst *getTerminator() const;
|
| D | CFG.h | 39 while (!It.atEnd() && !isa<TerminatorInst>(*It)) in advancePastNonTerminators()
58 return cast<TerminatorInst>(*It)->getParent();
250 typedef SuccIterator<TerminatorInst*, BasicBlock> succ_iterator;
251 typedef SuccIterator<const TerminatorInst*,
|
| D | InstrTypes.h | 35 class TerminatorInst : public Instruction {
37 TerminatorInst(Type *Ty, Instruction::TermOps iType,
42 TerminatorInst(Type *Ty, Instruction::TermOps iType, in TerminatorInst() function
47 ~TerminatorInst() override;
|
| /external/llvm/include/llvm/Analysis/ |
| D | CFG.h | 28 class TerminatorInst; variable
49 bool isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum,
|
| D | SparsePropagation.h | 29 class TerminatorInst; variable
195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
200 void visitTerminatorInst(TerminatorInst &TI);
|
| /external/llvm/lib/Analysis/ |
| D | DivergenceAnalysis.cpp | 141 void exploreSyncDependency(TerminatorInst *TI);
176 void DivergencePropagator::exploreSyncDependency(TerminatorInst *TI) { in exploreSyncDependency()
277 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(V)) { in propagate()
|
| D | SparsePropagation.cpp | 121 void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI, in getFeasibleSuccessors()
208 TerminatorInst *TI = From->getTerminator(); in isEdgeFeasible()
218 void SparseSolver::visitTerminatorInst(TerminatorInst &TI) { in visitTerminatorInst()
289 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(&I)) in visitInst()
|
| D | CFG.cpp | 73 TerminatorInst *Term = BB->getTerminator(); in GetSuccessorNumber()
87 bool llvm::isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum, in isCriticalEdge()
|
| /external/llvm/lib/IR/ |
| D | BasicBlock.cpp | 120 TerminatorInst *BasicBlock::getTerminator() { in getTerminator()
122 return dyn_cast<TerminatorInst>(&InstList.back()); in getTerminator()
125 const TerminatorInst *BasicBlock::getTerminator() const { in getTerminator()
127 return dyn_cast<TerminatorInst>(&InstList.back()); in getTerminator()
383 TerminatorInst *TI = getTerminator(); in replaceSuccessorsPhiUsesWith()
|
| D | Instructions.cpp | 45 TerminatorInst::~TerminatorInst() { in ~TerminatorInst()
570 : TerminatorInst(II.getType(), Instruction::Invoke, in InvokeInst()
641 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Ret, in ReturnInst()
651 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret, in ReturnInst()
658 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret, in ReturnInst()
665 : TerminatorInst(Type::getVoidTy(Context), Instruction::Ret, in ReturnInst()
691 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Resume, in ResumeInst()
697 : TerminatorInst(Type::getVoidTy(Exn->getContext()), Instruction::Resume, in ResumeInst()
703 : TerminatorInst(Type::getVoidTy(Exn->getContext()), Instruction::Resume, in ResumeInst()
726 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable, in UnreachableInst()
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | BasicBlockUtils.cpp | 40 TerminatorInst *BBTerm = BB->getTerminator(); in DeleteDeadBlock()
239 TerminatorInst *LatchTerm = BB->getTerminator(); in SplitEdge()
266 TerminatorInst *TI = I->getTerminator(); in SplitAllCriticalEdges()
698 TerminatorInst *llvm::SplitBlockAndInsertIfThen(Value *Cond, in SplitBlockAndInsertIfThen()
705 TerminatorInst *HeadOldTerm = Head->getTerminator(); in SplitBlockAndInsertIfThen()
708 TerminatorInst *CheckTerm; in SplitBlockAndInsertIfThen()
751 TerminatorInst **ThenTerm, in SplitBlockAndInsertIfThenElse()
752 TerminatorInst **ElseTerm, in SplitBlockAndInsertIfThenElse()
756 TerminatorInst *HeadOldTerm = Head->getTerminator(); in SplitBlockAndInsertIfThenElse()
|
| D | FlattenCFG.cpp | 223 TerminatorInst *TBB = LastCondBlock->getTerminator(); in FlattenParallelAndOr()
317 TerminatorInst *PTI2 = Head2->getTerminator(); in CompareIfRegionBlock()
415 TerminatorInst *PTI2 = SecondEntryBlock->getTerminator(); in MergeIfRegion()
|
| D | SimplifyCFG.cpp | 116 Value *isValueEqualityComparison(TerminatorInst *TI);
117 BasicBlock *GetValueEqualityComparisonCases(TerminatorInst *TI,
119 bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI,
122 bool FoldValueComparisonIntoPredecessors(TerminatorInst *TI,
144 static bool SafeToMergeTerminators(TerminatorInst *SI1, TerminatorInst *SI2) { in SafeToMergeTerminators()
507 static void EraseTerminatorInstAndDCECond(TerminatorInst *TI) { in EraseTerminatorInstAndDCECond()
524 Value *SimplifyCFGOpt::isValueEqualityComparison(TerminatorInst *TI) { in isValueEqualityComparison()
553 GetValueEqualityComparisonCases(TerminatorInst *TI, in GetValueEqualityComparisonCases()
623 SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI, in SimplifyEqualityComparisonWithOnlyPredecessor()
790 static void GetBranchWeights(TerminatorInst *TI, in GetBranchWeights()
[all …]
|
| D | CodeExtractor.cpp | 238 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator(); in severSplitPHINodes()
366 TerminatorInst *TI = newFunction->begin()->getTerminator(); in constructFunction()
397 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(Users[i])) in constructFunction()
527 TerminatorInst *TI = (*i)->getTerminator(); in emitCallAndSwitchStatement()
|
| /external/clang/lib/CodeGen/ |
| D | CGLoopInfo.cpp | 99 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(I)) { in InsertHelper()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | SCCP.cpp | 444 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs);
470 void visitTerminatorInst(TerminatorInst &TI);
495 void visitResumeInst (TerminatorInst &I) { /*returns void*/ } in visitResumeInst()
496 void visitUnreachableInst(TerminatorInst &I) { /*returns void*/ } in visitUnreachableInst()
518 void SCCPSolver::getFeasibleSuccessors(TerminatorInst &TI, in getFeasibleSuccessors()
591 TerminatorInst *TI = From->getTerminator(); in isEdgeFeasible()
736 void SCCPSolver::visitTerminatorInst(TerminatorInst &TI) { in visitTerminatorInst()
1455 TerminatorInst *TI = BB->getTerminator(); in ResolvedUndefsIn()
1536 if (isa<TerminatorInst>(BB->begin())) in DeleteInstructionInBlock()
1603 if (Inst->getType()->isVoidTy() || isa<TerminatorInst>(Inst)) in runOnFunction()
[all …]
|
| D | ADCE.cpp | 61 if (isa<TerminatorInst>(I) || isa<DbgInfoIntrinsic>(I) || in runOnFunction()
|
| D | LoopRotation.cpp | 421 TerminatorInst *LoopEntryBranch = OrigPreheader->getTerminator(); in rotateLoop()
433 !isa<TerminatorInst>(Inst) && !isa<DbgInfoIntrinsic>(Inst) && in rotateLoop()
467 TerminatorInst *TI = OrigHeader->getTerminator(); in rotateLoop()
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | DependencyAnalysis.cpp | 269 const TerminatorInst *TI = cast<TerminatorInst>(&BB->back()); in FindDependencies()
|
| D | ObjCARCOpts.cpp | 856 else if (cast<TerminatorInst>(PN->getIncomingBlock(i)->back()) in OptimizeIndividualCalls()
1023 const TerminatorInst *TI = cast<TerminatorInst>(&BB->back()); in CheckForCFGHazards()
1378 TerminatorInst *EntryTI = cast<TerminatorInst>(&EntryBB->back()); in ComputePostOrders()
1385 TerminatorInst *TI = cast<TerminatorInst>(&CurrBB->back()); in ComputePostOrders()
1391 TerminatorInst *TI = cast<TerminatorInst>(&SuccBB->back()); in ComputePostOrders()
|
| /external/llvm/lib/Target/NVPTX/ |
| D | NVPTXAllocaHoisting.cpp | 46 TerminatorInst *firstTerminatorInst = (I++)->getTerminator(); in runOnFunction()
|
| /external/llvm/tools/bugpoint/ |
| D | CrashDebugger.cpp | 298 TerminatorInst *BBTerm = BB->getTerminator(); in TestBlocks()
387 assert(!isa<TerminatorInst>(Insts[i])); in TestInsts()
401 if (!Instructions.count(Inst) && !isa<TerminatorInst>(Inst) && in TestInsts()
533 if (!isa<TerminatorInst>(I)) in DebugACrash()
|
| /external/llvm/include/llvm/Transforms/ |
| D | Scalar.h | 28 class TerminatorInst; variable
|