| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | FlattenCFG.cpp | 177 Value *PC = PBI->getCondition(); in FlattenParallelAndOr() 255 auto *CI = dyn_cast<CmpInst>(BI->getCondition()); in FlattenParallelAndOr() 284 Value *PC = PBI->getCondition(); in FlattenParallelAndOr() 293 Value *CC = PBI->getCondition(); in FlattenParallelAndOr() 417 Instruction *CInst2 = dyn_cast<Instruction>(DomBI2->getCondition()); in MergeIfRegion() 429 Instruction *CInst1 = dyn_cast<Instruction>(DomBI1->getCondition()); in MergeIfRegion() 486 assert(PBI->getCondition() == CInst2); in MergeIfRegion()
|
| H A D | GuardUtils.cpp | 75 CheckBI->setCondition(B.CreateAnd(CheckBI->getCondition(), WC, in makeGuardControlFlowExplicit() 101 Instruction *WCAnd = cast<Instruction>(WidenableBR->getCondition()); in widenWidenableBranch() 120 Instruction *WCAnd = cast<Instruction>(WidenableBR->getCondition()); in setWidenableBranchCond()
|
| H A D | SimplifyCFG.cpp | 731 CV = SI->getCondition(); in isValueEqualityComparison() 2363 Value *BrCond = BI->getCondition(); in SpeculativelyExecuteBB() 3409 ->getCondition(); in mergeConditionalStoreToAddress() 3624 if (PBI->getCondition() == BI->getCondition() && in SimplifyCondBranchToCondBranch() 3650 PBI->isConditional() && PBI->getCondition() == BI->getCondition() && in SimplifyCondBranchToCondBranch() 3779 Value *BICond = BI->getCondition(); in SimplifyCondBranchToCondBranch() 4045 if (SI->getCondition() != V) in tryToSimplifyUncondBranchWithICmpInIt() 4817 Value *Sub = SI->getCondition(); in TurnSwitchRangeIntoICmp() 4887 Value *Cond = SI->getCondition(); in eliminateDeadSwitchCases() 5864 TableIndex = SI->getCondition(); in SwitchToLookupTable() [all …]
|
| H A D | CodeMoverUtils.cpp | 141 << *BI->getCondition() << "\" is true from " in collectControlConditions() 144 ControlCondition(BI->getCondition(), true)); in collectControlConditions() 147 << *BI->getCondition() << "\" is false from " in collectControlConditions() 150 ControlCondition(BI->getCondition(), false)); in collectControlConditions()
|
| H A D | SCCPSolver.cpp | 595 ValueLatticeElement BCValue = getValueState(BI->getCondition()); in getFeasibleSuccessors() 621 const ValueLatticeElement &SCValue = getValueState(SI->getCondition()); in getFeasibleSuccessors() 908 ValueLatticeElement CondValue = getValueState(I.getCondition()); in visitSelectInst() 1515 if (!getValueState(BI->getCondition()).isUnknownOrUndef()) in resolvedUndefsIn() 1520 if (isa<UndefValue>(BI->getCondition())) { in resolvedUndefsIn() 1570 !getValueState(SI->getCondition()).isUnknownOrUndef()) in resolvedUndefsIn() 1575 if (isa<UndefValue>(SI->getCondition())) { in resolvedUndefsIn()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | GuardWidening.cpp | 81 static Value *getCondition(Instruction *I) { in getCondition() function 92 return cast<BranchInst>(I)->getCondition(); in getCondition() 262 widenCondCommon(getCondition(ToWiden), NewCondition, ToWiden, Result, in widenGuard() 314 assert(isa<ConstantInt>(getCondition(I)) && "Should be!"); in run() 334 if (isa<ConstantInt>(getCondition(Instr))) in eliminateInstrViaWidening() 371 LLVM_DEBUG(dbgs() << "Score between " << *getCondition(Instr) in eliminateInstrViaWidening() 372 << " and " << *getCondition(Candidate) << " is " in eliminateInstrViaWidening() 392 widenGuard(BestSoFar, getCondition(Instr), InvertCondition); in eliminateInstrViaWidening() 420 if (!isAvailableAt(getCondition(DominatedInstr), DominatingGuard)) in computeWideningScore() 431 if (isWideningCondProfitable(getCondition(DominatedInstr), in computeWideningScore() [all …]
|
| H A D | SimpleLoopUnswitch.cpp | 440 if (L.isLoopInvariant(BI.getCondition())) { in unswitchTrivialBranch() 441 Invariants.push_back(BI.getCondition()); in unswitchTrivialBranch() 659 Value *LoopCond = SI.getCondition(); in unswitchTrivialSwitch() 987 if (isa<Constant>(SI->getCondition())) in unswitchAllTrivialConditions() 1205 ClonedConditionToErase = BI->getCondition(); in buildClonedLoopBlocks() 1207 ClonedConditionToErase = SI->getCondition(); in buildClonedLoopBlocks() 2045 assert(isa<Instruction>(BI->getCondition()) && in unswitchNontrivialInvariants() 2060 Value *Cond = BI->getCondition(); in unswitchNontrivialInvariants() 2712 if (!isa<Constant>(SI->getCondition()) && in unswitchBestCondition() 2725 Value *Cond = BI->getCondition(), *CondNext; in unswitchBestCondition() [all …]
|
| H A D | IndVarSimplify.cpp | 470 Cond = BI->getCondition(); in rewriteFirstIterationLoopExitValues() 472 Cond = SI->getCondition(); in rewriteFirstIterationLoopExitValues() 701 ICmpInst *ICmp = dyn_cast<ICmpInst>(BI->getCondition()); in isLoopExitTestBasedOn() 720 if (L->isLoopInvariant(BI->getCondition())) in needsLFTR() 724 ICmpInst *Cond = dyn_cast<ICmpInst>(BI->getCondition()); in needsLFTR() 1188 Value *OrigCond = BI->getCondition(); in linearFunctionTestReplace() 1296 auto *OldCond = BI->getCondition(); in replaceExitCond() 1306 auto *OldCond = BI->getCondition(); in foldExit() 1416 if (isa<Constant>(BI->getCondition())) in optimizeLoopExits() 1594 if (isa<Constant>(BI->getCondition())) in predicateLoopExits() [all …]
|
| H A D | LoopUnswitch.cpp | 586 Value *Cond = BInst->getCondition(); in isUnreachableDueToPreviousUnswitching() 758 Value *LoopCond = findLIVLoopCondition(BI->getCondition(), CurrentLoop, in processCurrentLoop() 768 Value *SC = SI->getCondition(); in processCurrentLoop() 832 Value *LoopCond = findLIVLoopCondition(SI->getCondition(), CurrentLoop, in processCurrentLoop() 1191 } else if (BI->getCondition() == ConstantInt::getTrue(Context)) { in tryTrivialLoopUnswitch() 1193 } else if (BI->getCondition() == ConstantInt::getFalse(Context)) { in tryTrivialLoopUnswitch() 1202 ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition()); in tryTrivialLoopUnswitch() 1225 Value *LoopCond = findLIVLoopCondition(BI->getCondition(), CurrentLoop, in tryTrivialLoopUnswitch() 1231 if (!LoopCond || LoopCond != BI->getCondition()) in tryTrivialLoopUnswitch() 1260 Value *LoopCond = findLIVLoopCondition(SI->getCondition(), CurrentLoop, in tryTrivialLoopUnswitch() [all …]
|
| H A D | LowerExpectIntrinsic.cpp | 79 CallInst *CI = dyn_cast<CallInst>(SI.getCondition()); in handleSwitchExpect() 274 ICmpInst *CmpI = dyn_cast<ICmpInst>(BSI.getCondition()); in handleBrSelExpect() 278 CI = dyn_cast<CallInst>(BSI.getCondition()); in handleBrSelExpect()
|
| H A D | LoopBoundSplit.cpp | 209 ICmpInst *ICmp = cast<ICmpInst>(ExitingBI->getCondition()); in canSplitLoopBound() 254 if (L.isLoopInvariant(BI->getCondition())) in findSplitCandidate() 258 ICmpInst *ICmp = cast<ICmpInst>(BI->getCondition()); in findSplitCandidate()
|
| H A D | LoopPredication.cpp | 826 unsigned NumWidened = collectChecks(Checks, BI->getCondition(), in widenWidenableBranchGuardConditions() 836 auto *OldCond = BI->getCondition(); in widenWidenableBranchGuardConditions() 865 auto *ICI = dyn_cast<ICmpInst>(BI->getCondition()); in parseLoopLatchICmp() 1113 auto *IP = cast<Instruction>(WidenableBR->getCondition()); in predicateLoopExits() 1133 if (isa<Constant>(BI->getCondition())) in predicateLoopExits() 1173 Value *OldCond = BI->getCondition(); in predicateLoopExits()
|
| H A D | ConstraintElimination.cpp | 288 if (match(Br->getCondition(), m_LogicalOr(m_Value(Op0), m_Value(Op1))) && in eliminateConstraints() 303 if (match(Br->getCondition(), m_LogicalAnd(m_Value(Op0), m_Value(Op1))) && in eliminateConstraints() 315 auto *CmpI = dyn_cast<CmpInst>(Br->getCondition()); in eliminateConstraints()
|
| H A D | CorrelatedValuePropagation.cpp | 132 if (isa<Constant>(S->getCondition())) return false; in processSelect() 134 Constant *C = LVI->getConstant(S->getCondition(), S); in processSelect() 230 Value *Condition = SI->getCondition(); in processPHI() 331 Value *Cond = I->getCondition(); in processSwitch() 359 Cond = SI->getCondition(); in processSwitch()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | SparsePropagation.h | 302 getValueState(KeyInfo::getLatticeKeyFromValue(BI->getCondition())); in getFeasibleSuccessors() 305 KeyInfo::getLatticeKeyFromValue(BI->getCondition())); in getFeasibleSuccessors() 320 std::move(BCValue), BI->getCondition()->getType())); in getFeasibleSuccessors() 341 SCValue = getValueState(KeyInfo::getLatticeKeyFromValue(SI.getCondition())); in getFeasibleSuccessors() 344 KeyInfo::getLatticeKeyFromValue(SI.getCondition())); in getFeasibleSuccessors() 358 std::move(SCValue), SI.getCondition()->getType())); in getFeasibleSuccessors()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineSelect.cpp | 277 Value *Cond = SI.getCondition(); in foldSelectOpOp() 690 Value *Cond = Sel.getCondition(); in foldSetClearBits() 1722 Value *CondVal = SI.getCondition(); in foldAddSubSelect() 1931 Value *Cond = Sel.getCondition(); in foldSelectExtConst() 2021 Value *Cond = Sel.getCondition(); in canonicalizeScalarSelectOfVecs() 2037 Value *Cond = Sel.getCondition(); in foldSelectCmpBitcasts() 2120 if (Select->getCondition() == SI.getCondition()) in foldSelectCmpXchg() 2362 Value *Cond = Sel.getCondition(); in foldSelectFunnelShift() 2387 Value *Cond = Sel.getCondition(); in foldSelectToCopysign() 2445 Value *Cond = Sel.getCondition(); in foldVectorSelect() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
| H A D | ProvenanceAnalysis.cpp | 46 if (A->getCondition() == SB->getCondition()) in relatedSelect()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | ControlHeightReduction.cpp | 918 bool IsHoistable = checkHoistValue(SI->getCondition(), InsertPoint, in checkScopeHoistable() 971 assert(checkHoistValue(Branch->getCondition(), InsertPoint, in checkScopeHoistable() 979 assert(checkHoistValue(SI->getCondition(), InsertPoint, DT, in checkScopeHoistable() 1048 ConditionValues.insert(BI->getCondition()); in getCHRConditionValuesForRegion() 1051 ConditionValues.insert(SI->getCondition()); in getCHRConditionValuesForRegion() 1510 hoistValue(BI->getCondition(), HoistPoint, R, Scope->HoistStopMap, in hoistScopeConditions() 1518 hoistValue(SI->getCondition(), HoistPoint, R, Scope->HoistStopMap, in hoistScopeConditions() 1668 Value *V = BI->getCondition(); in assertBranchOrSelectConditionHoisted() 1682 Value *V = SI->getCondition(); in assertBranchOrSelectConditionHoisted() 1910 Value *Cond = BI->getCondition(); in fixupBranch() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | HardwareLoops.cpp | 352 if (BI->isUnconditional() || !isa<ICmpInst>(BI->getCondition())) in CanGenerateTest() 357 auto ICmp = cast<ICmpInst>(BI->getCondition()); in CanGenerateTest() 478 Value *OldCond = ExitBranch->getCondition(); in InsertLoopDec() 521 Value *OldCond = ExitBranch->getCondition(); in UpdateBranch()
|
| /freebsd-13.1/contrib/llvm-project/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() 353 PHINode *Phi = dyn_cast<PHINode>(Term->getCondition()); in runOnFunction()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/BPF/ |
| H A D | BPFAdjustOpt.cpp | 182 auto *Cond = dyn_cast<ICmpInst>(BI->getCondition()); in serializeICMPCrossBB() 192 Cond = dyn_cast<ICmpInst>(BI->getCondition()); in serializeICMPCrossBB()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanHCFGBuilder.cpp | 209 getOrCreateVPOperand(Br->getCondition()); in createVPInstructionsForVPBB() 299 Value *BrCond = Br->getCondition(); in buildPlainCFG()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopNestAnalysis.cpp | 87 const CmpInst *OuterLoopLatchCmp = dyn_cast<CmpInst>(BI->getCondition()); in arePerfectlyNested() 97 (InnerGuard) ? dyn_cast<CmpInst>(InnerGuard->getCondition()) : nullptr; in arePerfectlyNested()
|
| H A D | GuardUtils.cpp | 66 auto *Cond = BI->getCondition(); in parseWidenableBranch()
|
| /freebsd-13.1/contrib/llvm-project/llvm/tools/llvm-diff/ |
| H A D | DifferenceEngine.cpp | 326 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff() 358 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff()
|