/external/llvm/lib/Transforms/Utils/ |
SimplifyCFG.cpp | 241 if (Pred1Br->getSuccessor(0) == BB && 242 Pred1Br->getSuccessor(1) == Pred2) { 245 } else if (Pred1Br->getSuccessor(0) == Pred2 && 246 Pred1Br->getSuccessor(1) == BB) { 270 if (BI->getSuccessor(0) == Pred1) { 355 if (BI == 0 || BI->isConditional() || BI->getSuccessor(0) != BB) 560 BasicBlock *Succ = BI->getSuccessor(ICI->getPredicate() == ICmpInst::ICMP_NE); 564 return BI->getSuccessor(ICI->getPredicate() == ICmpInst::ICMP_EQ); [all...] |
BreakCriticalEdges.cpp | 96 const BasicBlock *Dest = TI->getSuccessor(SuccNum); 184 BasicBlock *DestBB = TI->getSuccessor(SuccNum); 231 if (TI->getSuccessor(i) != DestBB) continue;
|
LoopUnroll.cpp | 244 bool ContinueOnTrue = L->contains(BI->getSuccessor(0)); 245 BasicBlock *LoopExit = BI->getSuccessor(ContinueOnTrue); 406 BasicBlock *Dest = Term->getSuccessor(0);
|
LoopSimplify.cpp | 198 !L->contains(BI->getSuccessor(0)))); 357 BI->getSuccessor(0)->removePredecessor(ExitingBlock); 358 BI->getSuccessor(1)->removePredecessor(ExitingBlock); 748 if (TI->getSuccessor(Op) == Header)
|
CodeExtractor.cpp | 530 if (!Blocks.count(TI->getSuccessor(i))) { 531 BasicBlock *OldTarget = TI->getSuccessor(i); 654 BranchInst::Create(TheSwitch->getSuccessor(1), TheSwitch); 658 BranchInst::Create(TheSwitch->getSuccessor(1), TheSwitch->getSuccessor(2), 666 TheSwitch->setDefaultDest(TheSwitch->getSuccessor(NumExitBlocks));
|
BasicBlockUtils.cpp | 44 BBTerm->getSuccessor(i)->removePredecessor(BB); 249 if (Term->getSuccessor(i) == Succ) 262 return LatchTerm->getSuccessor(SuccNum);
|
CloneFunction.cpp | 314 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue()); 346 ToClone.push_back(TI->getSuccessor(i)); 540 BasicBlock *Dest = BI->getSuccessor(0);
|
/external/llvm/include/llvm/Transforms/Utils/ |
BasicBlockUtils.h | 132 if (TI->getSuccessor(i) == Succ) 149 if (TI->getSuccessor(i) == Dst)
|
/external/llvm/unittests/IR/ |
IRBuilderTest.cpp | 88 EXPECT_EQ(TBB, TI->getSuccessor(0)); 89 EXPECT_EQ(FBB, TI->getSuccessor(1)); 97 EXPECT_EQ(TBB, TI->getSuccessor(0)); 98 EXPECT_EQ(FBB, TI->getSuccessor(1));
|
InstructionsTest.cpp | 97 EXPECT_EQ(bb1, b1->getSuccessor(1)); 103 EXPECT_EQ(bb0, b1->getSuccessor(0));
|
/external/llvm/lib/Target/R600/ |
SIAnnotateControlFlow.cpp | 192 push(Term->getSuccessor(1), ExtractValueInst::Create(Ret, 1, "", Term)); 199 push(Term->getSuccessor(1), ExtractValueInst::Create(Ret, 1, "", Term)); 260 BasicBlock *Target = Term->getSuccessor(1); 279 push(Term->getSuccessor(0), Arg); 303 if (I.nodeVisited(Term->getSuccessor(1))) {
|
AMDGPUStructurizeCFG.cpp | 305 BasicBlock *Succ = Term->getSuccessor(i); 381 BasicBlock *Succ = Term->getSuccessor(i); 389 BasicBlock *Other = Term->getSuccessor(!i); 465 BasicBlock *SuccTrue = Term->getSuccessor(0); 466 BasicBlock *SuccFalse = Term->getSuccessor(1);
|
/external/llvm/lib/Transforms/Scalar/ |
LoopRotation.cpp | 241 unsigned FallThruPath = BI->getSuccessor(0) == Latch ? 0 : 1; 242 BasicBlock *Header = Jmp->getSuccessor(0); 314 BasicBlock *Exit = BI->getSuccessor(0); 315 BasicBlock *NewHeader = BI->getSuccessor(1); 387 for (BasicBlock::iterator BI = TI->getSuccessor(i)->begin(); 415 PHBI->getSuccessor(cast<ConstantInt>(PHBI->getCondition())->isZero())
|
JumpThreading.cpp | 193 BasicBlock *Succ = BI->getSuccessor(0); 611 BasicBlock *TestBB = BBTerm->getSuccessor(MinSucc); 615 TestBB = BBTerm->getSuccessor(i); 710 BBTerm->getSuccessor(i)->removePredecessor(BB, true); 715 BranchInst::Create(BBTerm->getSuccessor(BestSucc), BBTerm); 772 CondBr->getSuccessor(ToRemove)->removePredecessor(BB, true); 773 BranchInst::Create(CondBr->getSuccessor(ToKeep), CondBr); [all...] |
LoopUnswitch.cpp | 580 BI->getSuccessor(0)))) { 583 BI->getSuccessor(1)))) { [all...] |
/external/llvm/lib/Analysis/ |
ProfileDataLoaderPass.cpp | 121 readEdge(ReadCount++, PB, PB.getEdge(BB,TI->getSuccessor(s)), 152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s));
|
PathProfileVerifier.cpp | 95 prev = TI->getSuccessor(s), ++s) { 96 if (prev == TI->getSuccessor(s)) 100 arrayMap[BB][TI->getSuccessor(s)][duplicate] = i++;
|
ProfileInfoLoaderPass.cpp | 168 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters); 192 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters);
|
SparsePropagation.cpp | 211 if (TI->getSuccessor(i) == To && SuccFeasible[i]) 226 markEdgeExecutable(BB, TI.getSuccessor(i));
|
LazyValueInfo.cpp | 787 BI->getSuccessor(0) != BI->getSuccessor(1)) { 788 bool isTrueDest = BI->getSuccessor(0) == BBTo; 789 assert(BI->getSuccessor(!isTrueDest) == BBTo && [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
EdgeProfiling.cpp | 107 IncrementCounterInBlock(TI->getSuccessor(s), i++, Counters);
|
OptimalEdgeProfiling.cpp | 183 BasicBlock *Succ = TI->getSuccessor(s); 189 Succ = TI->getSuccessor(s);
|
/external/llvm/tools/llvm-diff/ |
DifferenceEngine.cpp | 303 if (TryUnify) tryUnify(LI->getSuccessor(1), RI->getSuccessor(1)); 305 if (TryUnify) tryUnify(LI->getSuccessor(0), RI->getSuccessor(0)); 614 tryUnify(LTerm->getSuccessor(0), RInvoke->getNormalDest()); 627 tryUnify(LInvoke->getNormalDest(), RTerm->getSuccessor(0));
|
/external/clang/lib/CodeGen/ |
CGCleanup.cpp | 327 llvm::SwitchInst::Create(Load, Br->getSuccessor(0), 4, Block); 413 assert(Br->getSuccessor(0) == Entry); 479 assert(Br->isUnconditional() && Br->getSuccessor(0) == From); 484 if (Switch->getSuccessor(I) == From) 580 FallthroughSource->getTerminator()->getSuccessor(0) [all...] |
/external/llvm/include/llvm/Support/ |
CFG.h | 145 inline pointer operator*() const { return Term->getSuccessor(idx); }
|