| /freebsd-12.1/contrib/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineSelect.cpp | 303 Type *CondTy = SI.getCondition()->getType(); in foldSelectOpOp() 1213 Value *CondVal = SI.getCondition(); in foldAddSubSelect() 1300 Value *Cond = Sel.getCondition(); in foldSelectExtConst() 1345 Value *CondVal = SI.getCondition(); in canonicalizeSelectToShuffle() 1385 Value *Cond = Sel.getCondition(); in foldSelectCmpBitcasts() 1468 if (Select->getCondition() == SI.getCondition()) in foldSelectCmpXchg() 1595 Value *Cond = Sel.getCondition(); in foldSelectRotate() 1611 Value *CondVal = SI.getCondition(); in visitSelectInst() 1914 if (TrueSI->getCondition() == CondVal) { in visitSelectInst() 1934 if (FalseSI->getCondition() == CondVal) { in visitSelectInst() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | GuardWidening.cpp | 90 static Value *getCondition(Instruction *I) { in getCondition() function 96 return cast<BranchInst>(I)->getCondition(); in getCondition() 328 assert(isa<ConstantInt>(getCondition(I)) && "Should be!"); in run() 348 if (isa<ConstantInt>(getCondition(GuardInst))) in eliminateGuardViaWidening() 396 LLVM_DEBUG(dbgs() << "Score between " << *getCondition(GuardInst) in eliminateGuardViaWidening() 397 << " and " << *getCondition(Candidate) << " is " in eliminateGuardViaWidening() 417 widenGuard(BestSoFar, getCondition(GuardInst), InvertCondition); in eliminateGuardViaWidening() 442 if (!isAvailableAt(getCondition(DominatedGuard), DominatingGuard)) in computeWideningScore() 453 if (isWideningCondProfitable(getCondition(DominatedGuard), in computeWideningScore() 454 getCondition(DominatingGuard), InvertCond)) in computeWideningScore()
|
| H A D | SimpleLoopUnswitch.cpp | 366 if (L.isLoopInvariant(BI.getCondition())) { in unswitchTrivialBranch() 367 Invariants.push_back(BI.getCondition()); in unswitchTrivialBranch() 370 if (auto *CondInst = dyn_cast<Instruction>(BI.getCondition())) in unswitchTrivialBranch() 480 assert(cast<Instruction>(BI.getCondition())->getOpcode() == in unswitchTrivialBranch() 484 assert(cast<Instruction>(BI.getCondition())->getOpcode() == in unswitchTrivialBranch() 577 Value *LoopCond = SI.getCondition(); in unswitchTrivialSwitch() 861 if (isa<Constant>(SI->getCondition())) in unswitchAllTrivialConditions() 1893 assert(isa<Instruction>(BI->getCondition()) && in unswitchNontrivialInvariants() 2528 if (!isa<Constant>(SI->getCondition()) && in unswitchBestCondition() 2529 L.isLoopInvariant(SI->getCondition())) in unswitchBestCondition() [all …]
|
| H A D | LoopUnswitch.cpp | 571 Value *Cond = BInst->getCondition(); in isUnreachableDueToPreviousUnswitching() 739 Value *LoopCond = FindLIVLoopCondition(BI->getCondition(), in processCurrentLoop() 748 Value *SC = SI->getCondition(); in processCurrentLoop() 812 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(), in processCurrentLoop() 1093 } else if (BI->getCondition() == ConstantInt::getTrue(Context)) { in TryTrivialLoopUnswitch() 1095 } else if (BI->getCondition() == ConstantInt::getFalse(Context)) { in TryTrivialLoopUnswitch() 1104 ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition()); in TryTrivialLoopUnswitch() 1127 Value *LoopCond = FindLIVLoopCondition(BI->getCondition(), in TryTrivialLoopUnswitch() 1132 if (!LoopCond || LoopCond != BI->getCondition()) in TryTrivialLoopUnswitch() 1161 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(), in TryTrivialLoopUnswitch() [all …]
|
| H A D | LowerExpectIntrinsic.cpp | 58 CallInst *CI = dyn_cast<CallInst>(SI.getCondition()); in handleSwitchExpect() 246 ICmpInst *CmpI = dyn_cast<ICmpInst>(BSI.getCondition()); in handleBrSelExpect() 250 CI = dyn_cast<CallInst>(BSI.getCondition()); in handleBrSelExpect()
|
| H A D | SCCP.cpp | 668 LatticeVal BCValue = getValueState(BI->getCondition()); in getFeasibleSuccessors() 694 LatticeVal SCValue = getValueState(SI->getCondition()); in getFeasibleSuccessors() 933 LatticeVal CondValue = getValueState(I.getCondition()); in visitSelectInst() 1628 if (!getValueState(BI->getCondition()).isUnknown()) in ResolvedUndefsIn() 1633 if (isa<UndefValue>(BI->getCondition())) { in ResolvedUndefsIn() 1680 if (!SI->getNumCases() || !getValueState(SI->getCondition()).isUnknown()) in ResolvedUndefsIn() 1685 if (isa<UndefValue>(SI->getCondition())) { in ResolvedUndefsIn() 1907 if (!isa<ConstantInt>(SI->getCondition())) { in forceIndeterminateEdge() 1913 if (!isa<ConstantInt>(BI->getCondition())) { in forceIndeterminateEdge()
|
| H A D | CorrelatedValuePropagation.cpp | 110 Constant *C = LVI->getConstant(S->getCondition(), S->getParent(), S); in processSelect() 204 Value *Condition = SI->getCondition(); in processPHI() 313 Value *Cond = SI->getCondition(); in processSwitch() 372 Cond = SI->getCondition(); in processSwitch()
|
| H A D | MakeGuardsExplicit.cpp | 74 B.CreateAnd(ExplicitGuard->getCondition(), WidenableCondition); in turnToExplicitForm()
|
| H A D | JumpThreading.cpp | 902 ComputeValueKnownInPredecessorsImpl(SI->getCondition(), BB, Conds, in ComputeValueKnownInPredecessorsImpl() 1050 Condition = BI->getCondition(); in ProcessBlock() 1052 Condition = SI->getCondition(); in ProcessBlock() 1227 Value *Cond = BI->getCondition(); in ProcessImpliedCondition() 1243 isImpliedCondition(PBI->getCondition(), Cond, DL, CondIsTrue); in ProcessImpliedCondition() 2418 BranchInst::Create(NewBB, BB, SI->getCondition(), Pred); in UnfoldSelectInstr() 2435 PHINode *CondPHI = dyn_cast<PHINode>(SI->getCondition()); in TryToUnfoldSelect() 2554 Value *Cond = SI->getCondition(); in TryToUnfoldSelectInCurrBB() 2583 SplitBlockAndInsertIfThen(SI->getCondition(), SI, false); in TryToUnfoldSelectInCurrBB() 2666 Value *BranchCond = BI->getCondition(); in ThreadGuard()
|
| H A D | IndVarSimplify.cpp | 739 Cond = BI->getCondition(); in rewriteFirstIterationLoopExitValues() 741 Cond = SI->getCondition(); in rewriteFirstIterationLoopExitValues() 1846 UpdateRangeFromCondition(BI->getCondition(), /*TrueDest=*/true); in calculatePostIncRange() 1849 UpdateRangeFromCondition(BI->getCondition(), /*TrueDest=*/false); in calculatePostIncRange() 2024 return dyn_cast<ICmpInst>(BI->getCondition()); in getLoopTest() 2200 Value *Cond = cast<BranchInst>(ExitingBB->getTerminator())->getCondition(); in FindLoopCounter() 2444 if (auto *Cond = dyn_cast<Instruction>(BI->getCondition())) in linearFunctionTestReplace() 2509 << " was: " << *BI->getCondition() << "\n"); in linearFunctionTestReplace() 2512 Value *OrigCond = BI->getCondition(); in linearFunctionTestReplace()
|
| H A D | LoopSimplifyCFG.cpp | 64 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition()); in getOnlyLiveSuccessor() 71 auto *CI = dyn_cast<ConstantInt>(SI->getCondition()); in getOnlyLiveSuccessor()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | FlattenCFG.cpp | 178 Value *PC = PBI->getCondition(); in FlattenParallelAndOr() 256 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition()); in FlattenParallelAndOr() 285 Value *PC = PBI->getCondition(); in FlattenParallelAndOr() 294 Value *CC = PBI->getCondition(); in FlattenParallelAndOr() 449 Value *CC = PBI->getCondition(); in MergeIfRegion()
|
| H A D | SimplifyCFG.cpp | 697 CV = SI->getCondition(); in isValueEqualityComparison() 1940 Value *BrCond = BI->getCondition(); in SpeculativelyExecuteBB() 2473 Value *BrCond = BI->getCondition(); in SimplifyCondBranchToTwoReturns() 3183 if (PBI->getCondition() == BI->getCondition() && in SimplifyCondBranchToCondBranch() 3209 PBI->isConditional() && PBI->getCondition() == BI->getCondition() && in SimplifyCondBranchToCondBranch() 3327 Value *BICond = BI->getCondition(); in SimplifyCondBranchToCondBranch() 3565 if (SI->getCondition() != V) in tryToSimplifyUncondBranchWithICmpInIt() 4334 Value *Sub = SI->getCondition(); in TurnSwitchRangeIntoICmp() 4393 Value *Cond = SI->getCondition(); in eliminateDeadSwitchCases() 5352 TableIndex = SI->getCondition(); in SwitchToLookupTable() [all …]
|
| H A D | PredicateInfo.cpp | 393 if (match(BI->getCondition(), m_And(m_Cmp(Pred, m_Value(), m_Value()), in processBranch() 395 match(BI->getCondition(), m_Or(m_Cmp(Pred, m_Value(), m_Value()), in processBranch() 397 auto *BinOp = cast<BinaryOperator>(BI->getCondition()); in processBranch() 404 ConditionsToProcess.push_back(BI->getCondition()); in processBranch() 405 } else if (isa<CmpInst>(BI->getCondition())) { in processBranch() 406 ConditionsToProcess.push_back(BI->getCondition()); in processBranch() 432 Value *Op = SI->getCondition(); in processSwitch()
|
| H A D | CloneFunction.cpp | 374 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition()); in CloneBlock() 377 Value *V = VMap.lookup(BI->getCondition()); in CloneBlock() 391 ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition()); in CloneBlock() 393 Value *V = VMap.lookup(SI->getCondition()); in CloneBlock()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | SparsePropagation.h | 303 getValueState(KeyInfo::getLatticeKeyFromValue(BI->getCondition())); in getFeasibleSuccessors() 306 KeyInfo::getLatticeKeyFromValue(BI->getCondition())); in getFeasibleSuccessors() 321 std::move(BCValue), BI->getCondition()->getType())); in getFeasibleSuccessors() 346 SCValue = getValueState(KeyInfo::getLatticeKeyFromValue(SI.getCondition())); in getFeasibleSuccessors() 349 KeyInfo::getLatticeKeyFromValue(SI.getCondition())); in getFeasibleSuccessors() 363 std::move(SCValue), SI.getCondition()->getType())); in getFeasibleSuccessors()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/ObjCARC/ |
| H A D | ProvenanceAnalysis.cpp | 48 if (A->getCondition() == SB->getCondition()) in relatedSelect()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/ |
| H A D | ControlHeightReduction.cpp | 896 bool IsHoistable = checkHoistValue(SI->getCondition(), InsertPoint, in checkScopeHoistable() 948 assert(checkHoistValue(Branch->getCondition(), InsertPoint, in checkScopeHoistable() 955 assert(checkHoistValue(SI->getCondition(), InsertPoint, DT, in checkScopeHoistable() 1024 ConditionValues.insert(BI->getCondition()); in getCHRConditionValuesForRegion() 1027 ConditionValues.insert(SI->getCondition()); in getCHRConditionValuesForRegion() 1468 hoistValue(BI->getCondition(), HoistPoint, R, Scope->HoistStopMap, in hoistScopeConditions() 1476 hoistValue(SI->getCondition(), HoistPoint, R, Scope->HoistStopMap, in hoistScopeConditions() 1633 Value *V = BI->getCondition(); in assertBranchOrSelectConditionHoisted() 1647 Value *V = SI->getCondition(); in assertBranchOrSelectConditionHoisted() 1874 Value *Cond = BI->getCondition(); in fixupBranch() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | SIAnnotateControlFlow.cpp | 208 Value *Ret = CallInst::Create(If, Term->getCondition(), "", Term); in openIf() 264 Value *Cond = Term->getCondition(); in handleLoop() 333 PHINode *Phi = dyn_cast<PHINode>(Term->getCondition()); in runOnFunction()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanHCFGBuilder.cpp | 204 getOrCreateVPOperand(Br->getCondition()); in createVPInstructionsForVPBB() 288 Value *BrCond = Br->getCondition(); in buildPlainCFG()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | DivergenceAnalysis.cpp | 116 return isDivergent(*BranchTerm->getCondition()); in updateTerminator() 119 return isDivergent(*SwitchTerm->getCondition()); in updateTerminator()
|
| H A D | MustExecute.cpp | 123 if (auto *Cond = dyn_cast<ConstantInt>(BI->getCondition())) in CanProveNotTakenFirstIteration() 125 auto *Cond = dyn_cast<CmpInst>(BI->getCondition()); in CanProveNotTakenFirstIteration()
|
| H A D | BranchProbabilityInfo.cpp | 399 Value *Cond = BI->getCondition(); in calcPointerHeuristics() 491 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition()); in computeUnlikelySuccessors() 659 Value *Cond = BI->getCondition(); in calcZeroHeuristics() 771 Value *Cond = BI->getCondition(); in calcFloatingPointHeuristics()
|
| H A D | InlineCost.cpp | 1322 return BI.isUnconditional() || isa<ConstantInt>(BI.getCondition()) || in visitBranchInst() 1324 SimplifiedValues.lookup(BI.getCondition())); in visitBranchInst() 1339 dyn_cast_or_null<Constant>(SimplifiedValues.lookup(SI.getCondition())); in visitSelectInst() 1411 if (isa<ConstantInt>(SI.getCondition())) in visitSwitchInst() 1413 if (Value *V = SimplifiedValues.lookup(SI.getCondition())) in visitSwitchInst() 1850 Value *Cond = BI->getCondition(); in analyzeCall() 1861 Value *Cond = SI->getCondition(); in analyzeCall()
|
| /freebsd-12.1/contrib/llvm/tools/llvm-diff/ |
| H A D | DifferenceEngine.cpp | 297 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff() 329 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff()
|