| /freebsd-10-stable/contrib/llvm/lib/Transforms/Utils/ |
| D | FlattenCFG.cpp | 139 BranchInst *PBI = dyn_cast<BranchInst>(Pred->getTerminator()); in FlattenParallelAndOr() 210 BranchInst *BPS = dyn_cast<BranchInst>(PS->getTerminator()); in FlattenParallelAndOr() 224 BranchInst *PBI1 = dyn_cast<BranchInst>(PS1->getTerminator()); in FlattenParallelAndOr() 225 BranchInst *PBI2 = dyn_cast<BranchInst>(PS2->getTerminator()); in FlattenParallelAndOr() 240 BranchInst *BI = dyn_cast<BranchInst>(CurrBlock->getTerminator()); in FlattenParallelAndOr() 267 BranchInst *PBI = dyn_cast<BranchInst>(FirstCondBlock->getTerminator()); in FlattenParallelAndOr() 278 PBI = cast<BranchInst>(FirstCondBlock->getTerminator()); in FlattenParallelAndOr() 436 BranchInst *PBI = dyn_cast<BranchInst>(FirstEntryBlock->getTerminator()); in MergeIfRegion()
|
| D | BasicBlockUtils.cpp | 380 ArrayRef<BasicBlock*> Preds, BranchInst *BI, in UpdatePHINodes() 450 BranchInst *BI = BranchInst::Create(BB, NewBB); in SplitBlockPredecessors() 510 BranchInst *BI1 = BranchInst::Create(OrigBB, NewBB1); in SplitLandingPadPredecessors() 550 BranchInst *BI2 = BranchInst::Create(OrigBB, NewBB2); in SplitLandingPadPredecessors() 664 CheckTerm = BranchInst::Create(Tail, ThenBlock); in SplitBlockAndInsertIfThen() 665 BranchInst *HeadNewTerm = in SplitBlockAndInsertIfThen() 666 BranchInst::Create(/*ifTrue*/ThenBlock, /*ifFalse*/Tail, Cmp); in SplitBlockAndInsertIfThen() 706 BranchInst *Pred1Br = dyn_cast<BranchInst>(Pred1->getTerminator()); in GetIfCondition() 707 BranchInst *Pred2Br = dyn_cast<BranchInst>(Pred2->getTerminator()); in GetIfCondition() 759 BranchInst *BI = dyn_cast<BranchInst>(CommonPred->getTerminator()); in GetIfCondition()
|
| D | SimplifyCFG.cpp | 108 bool SimplifyUncondBranch(BranchInst *BI, IRBuilder <> &Builder); 109 bool SimplifyCondBranch(BranchInst *BI, IRBuilder <>&Builder); 149 static bool isProfitableToFoldUnconditional(BranchInst *SI1, in isProfitableToFoldUnconditional() 150 BranchInst *SI2, in isProfitableToFoldUnconditional() 273 BranchInst *BI = dyn_cast<BranchInst>(PBB->getTerminator()); in DominatesMergePoint() 451 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in EraseTerminatorInstAndDCECond() 472 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) in isValueEqualityComparison() 503 BranchInst *BI = cast<BranchInst>(TI); in GetValueEqualityComparisonCases() 595 if (isa<BranchInst>(TI)) { in SimplifyEqualityComparisonWithOnlyPredecessor() 743 if (BranchInst* BI = dyn_cast<BranchInst>(TI)) { in GetBranchWeights() [all …]
|
| D | LowerExpectIntrinsic.cpp | 47 bool HandleIfExpect(BranchInst *BI); 92 bool LowerExpectIntrinsic::HandleIfExpect(BranchInst *BI) { in HandleIfExpect() 140 if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) { in runOnFunction()
|
| D | LoopUnrollRuntime.cpp | 124 BranchInst::Create(Exit, NewPH, BrLoopExit, InsertPt); in ConnectProlog() 191 BranchInst::Create(InsertBot, NewBB); in CloneLoopBlocks() 275 BranchInst *PreHeaderBR = cast<BranchInst>(PH->getTerminator()); in UnrollRuntimeLoopProlog() 295 BranchInst::Create(PEnd, PEnd, BranchVal, PreHeaderBR); in UnrollRuntimeLoopProlog() 350 BranchInst::Create(NewBlocks[0], CompareBB, in UnrollRuntimeLoopProlog()
|
| D | LoopUnroll.cpp | 163 BranchInst *BI = dyn_cast<BranchInst>(LatchBlock->getTerminator()); in UnrollLoop() 354 BranchInst *Term = cast<BranchInst>(Latches[i]->getTerminator()); in UnrollLoop() 397 BranchInst::Create(Dest, Term); in UnrollLoop() 404 BranchInst *Term = cast<BranchInst>(Latches[i]->getTerminator()); in UnrollLoop()
|
| D | LowerSwitch.cpp | 165 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in switchConvert() 214 BranchInst::Create(Succ, Default, Comp, NewLeaf); in newLeafBlock() 285 BranchInst::Create(SI->getDefaultDest(), CurBlock); in processSwitchInst() 295 BranchInst::Create(Default, NewDefault); in processSwitchInst() 319 BranchInst::Create(SwitchBlock, OrigBlock); in processSwitchInst()
|
| D | InlineFunction.cpp | 150 BranchInst::Create(Dest, Src); in forwardResume() 763 BranchInst *NewBr = BranchInst::Create(II->getNormalDest(), TheCall); in InlineFunction() 793 BranchInst *CreatedBranchToNormalDest = NULL; in InlineFunction() 797 CreatedBranchToNormalDest = BranchInst::Create(II->getNormalDest(), TheCall); in InlineFunction() 860 BranchInst* BI = BranchInst::Create(AfterCallBB, RI); in InlineFunction() 907 assert(cast<BranchInst>(Br)->isUnconditional() && "splitBasicBlock broken!"); in InlineFunction() 908 BasicBlock *CalleeEntry = cast<BranchInst>(Br)->getSuccessor(0); in InlineFunction()
|
| D | UnifyFunctionExitNodes.cpp | 74 BranchInst::Create(UnreachableBlock, BB); in runOnFunction() 118 BranchInst::Create(NewRetBlock, BB); in runOnFunction()
|
| D | CloneFunction.cpp | 303 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) { in CloneBlock() 316 VMap[OldTI] = BranchInst::Create(Dest, NewBB); in CloneBlock() 331 VMap[OldTI] = BranchInst::Create(Dest, NewBB); in CloneBlock() 538 BranchInst *BI = dyn_cast<BranchInst>(I->getTerminator()); in CloneAndPruneFunctionInto()
|
| D | LoopSimplify.cpp | 191 if (BranchInst *BI = dyn_cast<BranchInst>((*I)->getTerminator())) in ProcessLoop() 304 BranchInst *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator()); in ProcessLoop() 683 BranchInst *BETerminator = BranchInst::Create(Header, BEBlock); in InsertUniqueBackedgeBlock()
|
| D | LowerInvoke.cpp | 183 BranchInst::Create(II->getNormalDest(), II); in insertCheapEHSupport() 249 BranchInst::Create(II->getNormalDest(), NewCall->getParent()); in rewriteExpensiveInvoke() 501 BranchInst::Create(ContBlock, CatchBB, IsNormal, EntryBB); in insertExpensiveEHSupport() 532 BranchInst::Create(UnwindBlock, TermBlock, NotNull, UnwindHandler); in insertExpensiveEHSupport() 555 BranchInst::Create(UnwindHandler, UnreachablePlaceholder); in insertExpensiveEHSupport()
|
| /freebsd-10-stable/contrib/llvm/lib/Transforms/Scalar/ |
| D | LoopRotation.cpp | 221 BranchInst *Jmp = dyn_cast<BranchInst>(Latch->getTerminator()); in simplifyLoopLatch() 229 BranchInst *BI = dyn_cast<BranchInst>(LastExit->getTerminator()); in simplifyLoopLatch() 278 BranchInst *BI = dyn_cast<BranchInst>(OrigHeader->getTerminator()); in rotateLoop() 428 BranchInst *PHBI = cast<BranchInst>(OrigPreheader->getTerminator()); in rotateLoop() 469 BranchInst *NewBI = BranchInst::Create(NewHeader, PHBI); in rotateLoop()
|
| D | JumpThreading.cpp | 182 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); in runOnFunction() 677 if (BranchInst *BI = dyn_cast<BranchInst>(Terminator)) { in ProcessBlock() 717 BranchInst::Create(BBTerm->getSuccessor(BestSucc), BBTerm); in ProcessBlock() 748 BranchInst *CondBr = dyn_cast<BranchInst>(BB->getTerminator()); in ProcessBlock() 775 BranchInst::Create(CondBr->getSuccessor(ToKeep), CondBr); in ProcessBlock() 814 if (PN->getParent() == BB && isa<BranchInst>(BB->getTerminator())) in ProcessBlock() 820 CondInst->getParent() == BB && isa<BranchInst>(BB->getTerminator())) in ProcessBlock() 1120 else if (BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator())) in ProcessThreadableEdges() 1196 if (BranchInst *PredBr = dyn_cast<BranchInst>(PredBB->getTerminator())) in ProcessBranchOnPHI() 1418 BranchInst *NewBI =BranchInst::Create(SuccBB, NewBB); in ThreadEdge() [all …]
|
| D | StructurizeCFG.cpp | 32 typedef SmallVector<BranchInst*, 8> BranchVector; 190 Value *buildCondition(BranchInst *Term, unsigned Idx, bool Invert); 299 BranchInst *Term = cast<BranchInst>(BB->getTerminator()); in analyzeLoops() 355 Value *StructurizeCFG::buildCondition(BranchInst *Term, unsigned Idx, in buildCondition() 385 BranchInst *Term = cast<BranchInst>((*PI)->getTerminator()); in gatherPredicates() 466 BranchInst *Term = *I; in insertConditions() 635 BranchInst::Create(NewExit, BB); in changeExit() 748 Conditions.push_back(BranchInst::Create(Entry, Next, BoolUndef, Flow)); in wireFlow() 793 BranchInst::Create(LoopStart, NewEntry); in handleLoops() 799 LoopConds.push_back(BranchInst::Create(Next, LoopStart, in handleLoops()
|
| D | TailRecursionElimination.cpp | 517 BranchInst::Create(OldEntry, NewEntry); in EliminateRecursiveTailCall() 614 BranchInst *NewBI = BranchInst::Create(OldEntry, Ret); in EliminateRecursiveTailCall() 634 SmallVector<BranchInst*, 8> UncondBranchPreds; in FoldReturnAndProcessPred() 638 if (BranchInst *BI = dyn_cast<BranchInst>(PTI)) in FoldReturnAndProcessPred() 644 BranchInst *BI = UncondBranchPreds.pop_back_val(); in FoldReturnAndProcessPred()
|
| D | LoopUnswitch.cpp | 437 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in processCurrentLoop() 568 if (BranchInst *BI = dyn_cast<BranchInst>(HeaderTerm)) { in IsTrivialUnswitchCondition() 697 BranchInst *BI = BranchInst::Create(TrueDest, FalseDest, BranchVal, InsertPt); in EmitPreheaderBranchOnCondition() 885 BranchInst *OldBR = cast<BranchInst>(loopPreheader->getTerminator()); in UnswitchNontrivialCondition() 1062 BranchInst::Create(Abort, OldSISucc, in RewriteLoopBodyWithConditionConstant() 1119 if (BranchInst *BI = dyn_cast<BranchInst>(I)) { in SimplifyCode()
|
| D | LoopIdiomRecognize.cpp | 77 static BranchInst *getBranch(BasicBlock *BB) { in getBranch() 78 return dyn_cast<BranchInst>(BB->getTerminator()); in getBranch() 116 Value *matchCondition (BranchInst *Br, BasicBlock *NonZeroTarget) const; 283 if (BranchInst *Br = getBranch(BB)) { in isAlmostEmpty() 290 BranchInst *Br = getBranch(BB); in getBrCondtion() 296 BranchInst *Br = getBranch(BB); in getPrecondBb() 346 Value *NclPopcountRecognize::matchCondition (BranchInst *Br, in matchCondition() 482 BranchInst *PreCondBr = LIRUtil::getBranch(PreCondBB); in detectIdiom() 501 BranchInst *PreCondBr = LIRUtil::getBranch(PreCondBB); in transform() 572 BranchInst *LbBr = LIRUtil::getBranch(Body); in transform()
|
| D | IndVarSimplify.cpp | 281 !isa<BranchInst>(Compare->use_back())) in HandleFloatingPointIV() 284 BranchInst *TheBr = cast<BranchInst>(Compare->use_back()); in HandleFloatingPointIV() 1143 static bool isHighCostExpansion(const SCEV *S, BranchInst *BI, in isHighCostExpansion() 1212 BranchInst *BI = dyn_cast<BranchInst>(L->getExitingBlock()->getTerminator()); in canExpandBackedgeTakenCount() 1269 BranchInst *BI = dyn_cast<BranchInst>(L->getExitingBlock()->getTerminator()); in getLoopTest() 1393 cast<BranchInst>(L->getExitingBlock()->getTerminator())->getCondition(); in FindLoopCounter() 1495 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator()); in genLoopLimit() 1538 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator()); in genLoopLimit() 1587 BranchInst *BI = cast<BranchInst>(L->getExitingBlock()->getTerminator()); in LinearFunctionTestReplace()
|
| /freebsd-10-stable/contrib/llvm/lib/Target/R600/ |
| D | SIAnnotateControlFlow.cpp | 78 void openIf(BranchInst *Term); 80 void insertElse(BranchInst *Term); 84 void handleLoop(BranchInst *Term); 191 void SIAnnotateControlFlow::openIf(BranchInst *Term) { in openIf() 198 void SIAnnotateControlFlow::insertElse(BranchInst *Term) { in insertElse() 261 void SIAnnotateControlFlow::handleLoop(BranchInst *Term) { in handleLoop() 297 BranchInst *Term = dyn_cast<BranchInst>((*I)->getTerminator()); in runOnFunction()
|
| /freebsd-10-stable/contrib/llvm/tools/llvm-diff/ |
| D | DifferenceEngine.cpp | 288 } else if (isa<BranchInst>(L)) { in diff() 289 BranchInst *LI = cast<BranchInst>(L); in diff() 290 BranchInst *RI = cast<BranchInst>(R); in diff() 600 if (isa<BranchInst>(LTerm) && isa<InvokeInst>(RTerm)) { in runBlockDiff() 601 if (cast<BranchInst>(LTerm)->isConditional()) return; in runBlockDiff() 613 } else if (isa<InvokeInst>(LTerm) && isa<BranchInst>(RTerm)) { in runBlockDiff() 614 if (cast<BranchInst>(RTerm)->isConditional()) return; in runBlockDiff()
|
| /freebsd-10-stable/contrib/llvm/lib/Analysis/ |
| D | BranchProbabilityInfo.cpp | 178 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI)) in calcMetadataWeights() 274 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); in calcPointerHeuristics() 361 BranchInst * BI = dyn_cast<BranchInst>(BB->getTerminator()); in calcZeroHeuristics() 435 BranchInst *BI = dyn_cast<BranchInst>(BB->getTerminator()); in calcFloatingPointHeuristics()
|
| /freebsd-10-stable/contrib/llvm/tools/clang/lib/CodeGen/ |
| D | CGCleanup.cpp | 322 if (llvm::BranchInst *Br = dyn_cast<llvm::BranchInst>(Term)) { in TransitionToCleanupSwitch() 438 llvm::BranchInst *Br = dyn_cast<llvm::BranchInst>(Pred->getTerminator()); in SimplifyCleanupEntry() 505 if (llvm::BranchInst *Br = dyn_cast<llvm::BranchInst>(Term)) { in ForwardPrebranchedFallthrough() 540 llvm::BranchInst::Create(si->case_begin().getCaseSuccessor(), si); in destroyOptimisticNormalEntry() 743 InstsToAppend.push_back(llvm::BranchInst::Create(BranchAfter)); in PopCleanupBlock() 787 InstsToAppend.push_back(llvm::BranchInst::Create(BranchThroughDest)); in PopCleanupBlock() 922 llvm::BranchInst *BI = Builder.CreateBr(Dest.getBlock()); in EmitBranchThroughCleanup()
|
| /freebsd-10-stable/contrib/llvm/include/llvm/Analysis/ |
| D | CFGPrinter.h | 103 if (const BranchInst *BI = dyn_cast<BranchInst>(Node->getTerminator()))
|
| /freebsd-10-stable/contrib/llvm/include/llvm/IR/ |
| D | Instructions.h | 2350 class BranchInst : public TerminatorInst { 2355 BranchInst(const BranchInst &BI); 2364 explicit BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore = 0); 2365 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, 2367 BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd); 2368 BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, 2371 virtual BranchInst *clone_impl() const; 2373 static BranchInst *Create(BasicBlock *IfTrue, Instruction *InsertBefore = 0) { 2374 return new(1) BranchInst(IfTrue, InsertBefore); 2376 static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse, [all …]
|