| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineSelect.cpp | 130 Type *CondTy = SI.getCondition()->getType(); in FoldSelectOpOp()
157 Value *NewSI = Builder->CreateSelect(SI.getCondition(), TI->getOperand(0), in FoldSelectOpOp()
202 Value *NewSI = Builder->CreateSelect(SI.getCondition(), OtherOpT, in FoldSelectOpOp()
250 Value *NewSel = Builder->CreateSelect(SI.getCondition(), OOp, C); in FoldSelectIntoOp()
280 Value *NewSel = Builder->CreateSelect(SI.getCondition(), C, OOp); in FoldSelectIntoOp()
312 const ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition()); in foldSelectICmpAndOr()
632 const PHINode *CondPHI = cast<PHINode>(SI.getCondition()); in CanSelectOperandBeMappingIntoPredBlock()
713 SI->getCondition(), SI->getFalseValue(), SI->getTrueValue()); in FoldSPFofSPF()
772 const ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition()); in foldSelectICmpAnd()
844 Value *CondVal = SI.getCondition(); in foldAddSubSelect()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | SparsePropagation.cpp | 135 BCValue = getOrInitValueState(BI->getCondition()); in getFeasibleSuccessors()
137 BCValue = getLatticeState(BI->getCondition()); in getFeasibleSuccessors()
150 Constant *C = LatticeFunc->GetConstant(BCValue, BI->getCondition(), *this); in getFeasibleSuccessors()
177 SCValue = getOrInitValueState(SI.getCondition()); in getFeasibleSuccessors()
179 SCValue = getLatticeState(SI.getCondition()); in getFeasibleSuccessors()
192 Constant *C = LatticeFunc->GetConstant(SCValue, SI.getCondition(), *this); in getFeasibleSuccessors()
|
| /external/angle/src/compiler/translator/tree_ops/gl/mac/ |
| D | AddAndTrueToLoopCondition.cpp | 35 if (loop->getCondition() == nullptr) in visitLoop()
44 TIntermBinary *andOp = new TIntermBinary(EOpLogicalAnd, loop->getCondition(), trueValue); in visitLoop()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| 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()
372 LLVM_DEBUG(dbgs() << "Score between " << *getCondition(Instr) in eliminateInstrViaWidening()
373 << " and " << *getCondition(Candidate) << " is " in eliminateInstrViaWidening()
393 widenGuard(BestSoFar, getCondition(Instr), InvertCondition); in eliminateInstrViaWidening()
421 if (!isAvailableAt(getCondition(DominatedInstr), DominatingGuard)) in computeWideningScore()
432 if (isWideningCondProfitable(getCondition(DominatedInstr), in computeWideningScore()
[all …]
|
| D | SimpleLoopUnswitch.cpp | 378 if (L.isLoopInvariant(BI.getCondition())) { in unswitchTrivialBranch()
379 Invariants.push_back(BI.getCondition()); in unswitchTrivialBranch()
382 if (auto *CondInst = dyn_cast<Instruction>(BI.getCondition())) in unswitchTrivialBranch()
412 if (cast<Instruction>(BI.getCondition())->getOpcode() != Instruction::Or) in unswitchTrivialBranch()
415 if (cast<Instruction>(BI.getCondition())->getOpcode() != Instruction::And) in unswitchTrivialBranch()
493 assert(cast<Instruction>(BI.getCondition())->getOpcode() == in unswitchTrivialBranch()
497 assert(cast<Instruction>(BI.getCondition())->getOpcode() == in unswitchTrivialBranch()
593 Value *LoopCond = SI.getCondition(); in unswitchTrivialSwitch()
905 if (isa<Constant>(SI->getCondition())) in unswitchAllTrivialConditions()
935 if (!BI->isConditional() || isa<Constant>(BI->getCondition())) in unswitchAllTrivialConditions()
[all …]
|
| /external/llvm-project/llvm/lib/Transforms/Scalar/ |
| 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()
372 LLVM_DEBUG(dbgs() << "Score between " << *getCondition(Instr) in eliminateInstrViaWidening()
373 << " and " << *getCondition(Candidate) << " is " in eliminateInstrViaWidening()
393 widenGuard(BestSoFar, getCondition(Instr), InvertCondition); in eliminateInstrViaWidening()
421 if (!isAvailableAt(getCondition(DominatedInstr), DominatingGuard)) in computeWideningScore()
432 if (isWideningCondProfitable(getCondition(DominatedInstr), in computeWideningScore()
[all …]
|
| D | SimpleLoopUnswitch.cpp | 385 if (L.isLoopInvariant(BI.getCondition())) { in unswitchTrivialBranch()
386 Invariants.push_back(BI.getCondition()); in unswitchTrivialBranch()
389 if (auto *CondInst = dyn_cast<Instruction>(BI.getCondition())) in unswitchTrivialBranch()
419 if (cast<Instruction>(BI.getCondition())->getOpcode() != Instruction::Or) in unswitchTrivialBranch()
422 if (cast<Instruction>(BI.getCondition())->getOpcode() != Instruction::And) in unswitchTrivialBranch()
500 assert(cast<Instruction>(BI.getCondition())->getOpcode() == in unswitchTrivialBranch()
504 assert(cast<Instruction>(BI.getCondition())->getOpcode() == in unswitchTrivialBranch()
600 Value *LoopCond = SI.getCondition(); in unswitchTrivialSwitch()
929 if (isa<Constant>(SI->getCondition())) in unswitchAllTrivialConditions()
959 if (!BI->isConditional() || isa<Constant>(BI->getCondition())) in unswitchAllTrivialConditions()
[all …]
|
| D | ConstraintElimination.cpp | 221 if (match(Br->getCondition(), m_Or(m_Cmp(), m_Cmp()))) { in eliminateConstraints()
224 auto *OrI = cast<Instruction>(Br->getCondition()); in eliminateConstraints()
236 if (match(Br->getCondition(), m_And(m_Cmp(), m_Cmp()))) { in eliminateConstraints()
239 auto *AndI = cast<Instruction>(Br->getCondition()); in eliminateConstraints()
248 auto *CmpI = dyn_cast<CmpInst>(Br->getCondition()); in eliminateConstraints()
|
| 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()
893 Value *Cond = cast<BranchInst>(ExitingBB->getTerminator())->getCondition(); in FindLoopCounter()
1131 if (auto *Cond = dyn_cast<Instruction>(BI->getCondition())) in linearFunctionTestReplace()
1184 << " was: " << *BI->getCondition() << "\n"); in linearFunctionTestReplace()
1187 Value *OrigCond = BI->getCondition(); in linearFunctionTestReplace()
1295 auto *OldCond = BI->getCondition(); in replaceExitCond()
[all …]
|
| /external/llvm-project/llvm/lib/Transforms/Utils/ |
| 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()
|
| 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()
482 assert(PBI->getCondition() == IfCond2); in MergeIfRegion()
|
| D | SimplifyCFG.cpp | 317 CmpInst *Ci2 = dyn_cast<CmpInst>(SI2->getCondition()); in isProfitableToFoldUnconditional()
728 Cond = dyn_cast<Instruction>(SI->getCondition()); in EraseTerminatorAndDCECond()
731 Cond = dyn_cast<Instruction>(BI->getCondition()); in EraseTerminatorAndDCECond()
749 CV = SI->getCondition(); in isValueEqualityComparison()
751 if (BI->isConditional() && BI->getCondition()->hasOneUse()) in isValueEqualityComparison()
752 if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) { in isValueEqualityComparison()
781 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); in GetValueEqualityComparisonCases()
1026 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); in GetBranchWeights()
1480 Builder.CreateSelect(BI->getCondition(), BB1V, BB2V, in HoistThenElseCodeToIf()
2116 Value *BrCond = BI->getCondition(); in SpeculativelyExecuteBB()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| 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()
|
| 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()
448 Value *CC = PBI->getCondition(); in MergeIfRegion()
|
| D | SimplifyCFG.cpp | 274 CmpInst *Ci2 = dyn_cast<CmpInst>(SI2->getCondition()); in isProfitableToFoldUnconditional()
685 Cond = dyn_cast<Instruction>(SI->getCondition()); in EraseTerminatorAndDCECond()
688 Cond = dyn_cast<Instruction>(BI->getCondition()); in EraseTerminatorAndDCECond()
706 CV = SI->getCondition(); in isValueEqualityComparison()
708 if (BI->isConditional() && BI->getCondition()->hasOneUse()) in isValueEqualityComparison()
709 if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) { in isValueEqualityComparison()
738 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); in GetValueEqualityComparisonCases()
983 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); in GetBranchWeights()
1414 Builder.CreateSelect(BI->getCondition(), BB1V, BB2V, in HoistThenElseCodeToIf()
1966 Value *BrCond = BI->getCondition(); in SpeculativelyExecuteBB()
[all …]
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/lexicalpreservation/changes/ |
| D | Change.java | 14 switch (csmConditional.getCondition()) { in evaluate()
24 …pportedOperationException("" + csmConditional.getProperty() + " " + csmConditional.getCondition()); in evaluate()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LowerExpectIntrinsic.cpp | 57 CallInst *CI = dyn_cast<CallInst>(SI.getCondition()); in handleSwitchExpect()
101 ICmpInst *CmpI = dyn_cast<ICmpInst>(BI.getCondition()); in handleBranchExpect()
103 CI = dyn_cast<CallInst>(BI.getCondition()); in handleBranchExpect()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | FlattenCFG.cpp | 165 Value *PC = PBI->getCondition(); in FlattenParallelAndOr()
243 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition()); in FlattenParallelAndOr()
272 Value *PC = PBI->getCondition(); in FlattenParallelAndOr()
281 Value *CC = PBI->getCondition(); in FlattenParallelAndOr()
438 Value *CC = PBI->getCondition(); in MergeIfRegion()
|
| D | SimplifyCFG.cpp | 216 CmpInst *Ci2 = dyn_cast<CmpInst>(SI2->getCondition()); in isProfitableToFoldUnconditional()
629 Cond = dyn_cast<Instruction>(SI->getCondition()); in EraseTerminatorInstAndDCECond()
632 Cond = dyn_cast<Instruction>(BI->getCondition()); in EraseTerminatorInstAndDCECond()
652 CV = SI->getCondition(); in isValueEqualityComparison()
654 if (BI->isConditional() && BI->getCondition()->hasOneUse()) in isValueEqualityComparison()
655 if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) { in isValueEqualityComparison()
685 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); in GetValueEqualityComparisonCases()
922 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); in GetBranchWeights()
1304 Builder.CreateSelect(BI->getCondition(), BB1V, BB2V, in HoistThenElseCodeToIf()
1598 Value *BrCond = BI->getCondition(); in SpeculativelyExecuteBB()
[all …]
|
| /external/llvm-project/llvm/include/llvm/Analysis/ |
| 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()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| 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()
|
| /external/llvm-project/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineSelect.cpp | 66 if (!match(Sel.getCondition(), m_Cmp(Pred, m_Value(X), m_Constant(C)))) in foldSelectBinOpIdentity()
276 Value *Cond = SI.getCondition(); in foldSelectOpOp()
426 Value *NewSel = Builder.CreateSelect(SI.getCondition(), OOp, C); in foldSelectIntoOp()
458 Value *NewSel = Builder.CreateSelect(SI.getCondition(), C, OOp); in foldSelectIntoOp()
661 Value *Cond = Sel.getCondition(); in foldSetClearBits()
1583 const PHINode *CondPHI = cast<PHINode>(SI.getCondition()); in canSelectOperandBeMappingIntoPredBlock()
1674 Builder.CreateSelect(SI->getCondition(), SI->getFalseValue(), in foldSPFofSPF()
1733 Value *CondVal = SI.getCondition(); in foldAddSubSelect()
1808 Value *CondVal = SI.getCondition(); in foldOverflowingAddSubSelect()
1942 Value *Cond = Sel.getCondition(); in foldSelectExtConst()
[all …]
|
| /external/angle/src/libANGLE/ |
| D | Fence.h | 42 GLenum getCondition() const { return mCondition; } in getCondition() function
72 GLenum getCondition() const { return mCondition; } in getCondition() function
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineSelect.cpp | 64 if (!match(Sel.getCondition(), m_Cmp(Pred, m_Value(X), m_Constant(C)))) in foldSelectBinOpIdentity()
295 Value *Cond = SI.getCondition(); in foldSelectOpOp()
447 Value *NewSel = Builder.CreateSelect(SI.getCondition(), OOp, C); in foldSelectIntoOp()
478 Value *NewSel = Builder.CreateSelect(SI.getCondition(), C, OOp); in foldSelectIntoOp()
1531 const PHINode *CondPHI = cast<PHINode>(SI.getCondition()); in canSelectOperandBeMappingIntoPredBlock()
1622 Builder.CreateSelect(SI->getCondition(), SI->getFalseValue(), in foldSPFofSPF()
1681 Value *CondVal = SI.getCondition(); in foldAddSubSelect()
1756 Value *CondVal = SI.getCondition(); in foldOverflowingAddSubSelect()
1890 Value *Cond = Sel.getCondition(); in foldSelectExtConst()
1935 Value *CondVal = SI.getCondition(); in canonicalizeSelectToShuffle()
[all …]
|
| /external/angle/src/compiler/translator/ |
| D | OutputTree.cpp | 506 node->getCondition()->traverse(this); in visitTernary()
536 node->getCondition()->traverse(this); in visitIfElse()
574 if (node->getCondition() == nullptr) in visitCase()
643 if (node->getCondition()) in visitLoop()
646 node->getCondition()->traverse(this); in visitLoop()
|