HomeSort by relevance Sort by last modified time
    Searched refs:TerminatorInst (Results 1 - 25 of 80) sorted by null

1 2 3 4

  /external/llvm/include/llvm/Analysis/
CFG.h 28 class TerminatorInst;
49 bool isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum,
SparsePropagation.h 29 class TerminatorInst;
195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
200 void visitTerminatorInst(TerminatorInst &TI);
  /external/llvm/include/llvm/Transforms/Utils/
BasicBlockUtils.h 31 class TerminatorInst;
91 BasicBlock *SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum,
108 TerminatorInst *TI = (*PI)->getTerminator();
123 TerminatorInst *TI = Src->getTerminator();
205 TerminatorInst *SplitBlockAndInsertIfThen(Instruction *Cmp,
  /external/llvm/lib/Target/NVPTX/
NVPTXAllocaHoisting.cpp 24 TerminatorInst *firstTerminatorInst = (I++)->getTerminator();
  /external/llvm/include/llvm/
InstVisitor.h 166 RetTy visitReturnInst(ReturnInst &I) { DELEGATE(TerminatorInst);}
167 RetTy visitBranchInst(BranchInst &I) { DELEGATE(TerminatorInst);}
168 RetTy visitSwitchInst(SwitchInst &I) { DELEGATE(TerminatorInst);}
169 RetTy visitIndirectBrInst(IndirectBrInst &I) { DELEGATE(TerminatorInst);}
170 RetTy visitResumeInst(ResumeInst &I) { DELEGATE(TerminatorInst);}
171 RetTy visitUnreachableInst(UnreachableInst &I) { DELEGATE(TerminatorInst);}
233 RetTy visitTerminatorInst(TerminatorInst &I) { DELEGATE(Instruction);}
246 DELEGATE(TerminatorInst);
  /external/llvm/lib/IR/
BasicBlock.cpp 120 TerminatorInst *BasicBlock::getTerminator() {
122 return dyn_cast<TerminatorInst>(&InstList.back());
125 const TerminatorInst *BasicBlock::getTerminator() const {
127 return dyn_cast<TerminatorInst>(&InstList.back());
338 TerminatorInst *TI = getTerminator();
  /external/llvm/include/llvm/IR/
BasicBlock.h 27 class TerminatorInst;
66 /// instructions followed by a single TerminatorInst instruction.
67 /// TerminatorInst's may not occur in the middle of basic blocks, and must
121 TerminatorInst *getTerminator();
122 const TerminatorInst *getTerminator() const;
InstrTypes.h 29 // TerminatorInst Class
32 /// TerminatorInst - Subclasses of this class are all able to terminate a basic
35 class TerminatorInst : public Instruction {
37 TerminatorInst(Type *Ty, Instruction::TermOps iType,
42 TerminatorInst(Type *Ty, Instruction::TermOps iType,
47 ~TerminatorInst();
54 virtual TerminatorInst *clone_impl() const = 0;
    [all...]
  /external/llvm/lib/Transforms/Utils/
DemoteRegToStack.cpp 79 if (!isa<TerminatorInst>(I)) {
91 TerminatorInst *TI = &cast<TerminatorInst>(I);
FlattenCFG.cpp 221 TerminatorInst *TBB = LastCondBlock->getTerminator();
316 TerminatorInst *PTI2 = Head2->getTerminator();
414 TerminatorInst *PTI2 = SecondEntryBlock->getTerminator();
SimplifyCFG.cpp 93 Value *isValueEqualityComparison(TerminatorInst *TI);
94 BasicBlock *GetValueEqualityComparisonCases(TerminatorInst *TI,
96 bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI,
99 bool FoldValueComparisonIntoPredecessors(TerminatorInst *TI,
120 static bool SafeToMergeTerminators(TerminatorInst *SI1, TerminatorInst *SI2) {
446 static void EraseTerminatorInstAndDCECond(TerminatorInst *TI) {
463 Value *SimplifyCFGOpt::isValueEqualityComparison(TerminatorInst *TI) {
487 GetValueEqualityComparisonCases(TerminatorInst *TI,
557 SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI
    [all...]
  /external/llvm/include/llvm/Transforms/
Scalar.h 24 class TerminatorInst;
  /external/llvm/lib/Analysis/
SparsePropagation.cpp 120 void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI,
207 TerminatorInst *TI = From->getTerminator();
217 void SparseSolver::visitTerminatorInst(TerminatorInst &TI) {
288 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(&I))
ProfileDataLoaderPass.cpp 119 TerminatorInst *TI = BB->getTerminator();
140 TerminatorInst *TI = BB->getTerminator();
CFG.cpp 74 TerminatorInst *Term = BB->getTerminator();
88 bool llvm::isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum,
ProfileInfoLoaderPass.cpp 166 TerminatorInst *TI = BB->getTerminator();
187 TerminatorInst *TI = BB->getTerminator();
  /external/llvm/include/llvm/Support/
CFG.h 38 while (!It.atEnd() && !isa<TerminatorInst>(*It))
57 return cast<TerminatorInst>(*It)->getParent();
226 typedef SuccIterator<TerminatorInst*, BasicBlock> succ_iterator;
227 typedef SuccIterator<const TerminatorInst*,
  /external/llvm/lib/Transforms/Instrumentation/
EdgeProfiling.cpp 94 TerminatorInst *TI = BB->getTerminator();
  /external/llvm/lib/Transforms/Scalar/
ADCE.cpp 58 if (isa<TerminatorInst>(I.getInstructionIterator()) ||
SCCP.cpp 442 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs);
468 void visitTerminatorInst(TerminatorInst &TI);
493 void visitResumeInst (TerminatorInst &I) { /*returns void*/ }
494 void visitUnwindInst (TerminatorInst &I) { /*returns void*/ }
495 void visitUnreachableInst(TerminatorInst &I) { /*returns void*/ }
515 void SCCPSolver::getFeasibleSuccessors(TerminatorInst &TI,
588 TerminatorInst *TI = From->getTerminator();
733 void SCCPSolver::visitTerminatorInst(TerminatorInst &TI) {
    [all...]
LoopRotation.cpp 356 TerminatorInst *LoopEntryBranch = OrigPreheader->getTerminator();
368 !isa<TerminatorInst>(Inst) && !isa<DbgInfoIntrinsic>(Inst) &&
401 TerminatorInst *TI = OrigHeader->getTerminator();
  /external/llvm/lib/Transforms/ObjCARC/
DependencyAnalysis.cpp 253 const TerminatorInst *TI = cast<TerminatorInst>(&BB->back());
  /external/llvm/lib/CodeGen/
DwarfEHPrepare.cpp 111 TerminatorInst *TI = I->getTerminator();
  /external/llvm/tools/bugpoint/
CrashDebugger.cpp 298 TerminatorInst *BBTerm = BB->getTerminator();
388 assert(!isa<TerminatorInst>(Insts[i]));
402 if (!Instructions.count(Inst) && !isa<TerminatorInst>(Inst) &&
535 if (!isa<TerminatorInst>(I))
  /external/llvm/lib/Target/R600/
SIAnnotateControlFlow.cpp 241 TerminatorInst *Insert = From->getTerminator();
250 TerminatorInst *Insert = Parent->getTerminator();

Completed in 433 milliseconds

1 2 3 4