/external/llvm/lib/Analysis/ |
D | SparsePropagation.cpp | 134 BCValue = getOrInitValueState(BI->getCondition()); in getFeasibleSuccessors() 136 BCValue = getLatticeState(BI->getCondition()); in getFeasibleSuccessors() 149 Constant *C = LatticeFunc->GetConstant(BCValue, BI->getCondition(), *this); in getFeasibleSuccessors() 176 SCValue = getOrInitValueState(SI.getCondition()); in getFeasibleSuccessors() 178 SCValue = getLatticeState(SI.getCondition()); in getFeasibleSuccessors() 191 Constant *C = LatticeFunc->GetConstant(SCValue, SI.getCondition(), *this); in getFeasibleSuccessors()
|
D | LazyValueInfo.cpp | 817 if (BI->getCondition() == Val) { in getEdgeValue() 825 ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition()); in getEdgeValue() 874 if (SI->getCondition() == Val) { in getEdgeValue()
|
D | BranchProbabilityInfo.cpp | 170 Value *Cond = BI->getCondition(); in calcPointerHeuristics()
|
D | LoopInfo.cpp | 184 if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) { in getTripCount()
|
/external/llvm/lib/Transforms/Utils/ |
D | SimplifyCFG.cpp | 182 return Pred1Br->getCondition(); in GetIfCondition() 204 return BI->getCondition(); in GetIfCondition() 436 Cond = dyn_cast<Instruction>(SI->getCondition()); in EraseTerminatorInstAndDCECond() 439 Cond = dyn_cast<Instruction>(BI->getCondition()); in EraseTerminatorInstAndDCECond() 457 CV = SI->getCondition(); in isValueEqualityComparison() 459 if (BI->isConditional() && BI->getCondition()->hasOneUse()) in isValueEqualityComparison() 460 if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) in isValueEqualityComparison() 487 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); in GetValueEqualityComparisonCases() 931 (Builder.CreateSelect(BI->getCondition(), BB1V, BB2V, in HoistThenElseCodeToIf() 973 Value *BrCond = BI->getCondition(); in SpeculativelyExecuteBB() [all …]
|
D | LowerExpectIntrinsic.cpp | 47 CallInst *CI = dyn_cast<CallInst>(SI->getCondition()); in HandleSwitchExpect() 90 ICmpInst *CmpI = dyn_cast<ICmpInst>(BI->getCondition()); in HandleIfExpect()
|
D | Local.cpp | 65 if (ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition())) { in ConstantFoldTerminator() 96 Value *Cond = BI->getCondition(); in ConstantFoldTerminator() 108 ConstantInt *CI = dyn_cast<ConstantInt>(SI->getCondition()); in ConstantFoldTerminator() 162 Value *Cond = SI->getCondition(); in ConstantFoldTerminator() 172 Value *Cond = Builder.CreateICmpEQ(SI->getCondition(), in ConstantFoldTerminator()
|
D | CloneFunction.cpp | 261 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition()); in CloneBlock() 264 Value *V = VMap[BI->getCondition()]; in CloneBlock() 278 ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition()); in CloneBlock() 280 Value *V = VMap[SI->getCondition()]; in CloneBlock()
|
D | LoopSimplify.cpp | 189 if (UndefValue *Cond = dyn_cast<UndefValue>(BI->getCondition())) { in ProcessLoop() 297 CmpInst *CI = dyn_cast<CmpInst>(BI->getCondition()); in ProcessLoop()
|
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/ |
D | UnfoldSelect.cpp | 37 node->getCondition()->traverse(this); in visitSelection() 39 node->getCondition()->traverse(mOutputHLSL); in visitSelection()
|
D | OutputGLSL.cpp | 401 node->getCondition()->traverse(this); in visitSelection() 411 node->getCondition()->traverse(this); in visitSelection() 623 if (node->getCondition()) in visitLoop() 624 node->getCondition()->traverse(this); in visitLoop() 634 ASSERT(node->getCondition() != NULL); in visitLoop() 635 node->getCondition()->traverse(this); in visitLoop() 651 ASSERT(node->getCondition() != NULL); in visitLoop() 652 node->getCondition()->traverse(this); in visitLoop()
|
D | intermOut.cpp | 288 node->getCondition()->traverse(this); in visitSelection() 355 if (node->getCondition()) { in visitLoop() 357 node->getCondition()->traverse(this); in visitLoop()
|
D | OutputHLSL.cpp | 1385 mUnfoldSelect->traverse(node->getCondition()); in visitSelection() 1389 node->getCondition()->traverse(this); in visitSelection() 1441 if (node->getCondition()) in visitLoop() 1443 mUnfoldSelect->traverse(node->getCondition()); in visitLoop() 1460 if (node->getCondition()) in visitLoop() 1462 node->getCondition()->traverse(this); in visitLoop() 1487 node->getCondition()->traverse(this); in visitLoop() 1602 if (index != NULL && node->getCondition()) in handleExcessiveLoop() 1604 TIntermBinary *test = node->getCondition()->getAsBinaryNode(); in handleExcessiveLoop()
|
D | intermediate.h | 289 TIntermTyped* getCondition() { return cond; } in getCondition() function 470 TIntermNode* getCondition() const { return condition; } in getCondition() function
|
D | ValidateLimitations.cpp | 248 TIntermNode* cond = node->getCondition(); in validateForLoopCond()
|
/external/llvm/lib/Transforms/InstCombine/ |
D | InstCombineSelect.cpp | 28 ICmpInst *ICI = dyn_cast<ICmpInst>(SI->getCondition()); in MatchSelectPattern() 136 Value *NewSI = Builder->CreateSelect(SI.getCondition(), TI->getOperand(0), in FoldSelectOpOp() 176 Value *NewSI = Builder->CreateSelect(SI.getCondition(), OtherOpT, in FoldSelectOpOp() 225 Value *NewSel = Builder->CreateSelect(SI.getCondition(), OOp, C); in FoldSelectIntoOp() 260 Value *NewSel = Builder->CreateSelect(SI.getCondition(), C, OOp); in FoldSelectIntoOp() 523 const PHINode *CondPHI = cast<PHINode>(SI.getCondition()); in CanSelectOperandBeMappingIntoPredBlock() 574 const ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition()); in foldSelectICmpAnd() 638 Value *CondVal = SI.getCondition(); in visitSelectInst() 848 if (isa<PHINode>(SI.getCondition())) in visitSelectInst() 856 if (TrueSI->getCondition() == CondVal) { in visitSelectInst() [all …]
|
D | InstructionCombining.cpp | 532 return SelectInst::Create(SI->getCondition(), in FoldOpIntoSelect() 1132 BI.getCondition()->hasOneUse()) in visitBranchInst() 1135 FCmpInst *Cond = cast<FCmpInst>(BI.getCondition()); in visitBranchInst() 1149 BI.getCondition()->hasOneUse()) in visitBranchInst() 1153 ICmpInst *Cond = cast<ICmpInst>(BI.getCondition()); in visitBranchInst() 1166 Value *Cond = SI.getCondition(); in visitSwitchInst() 1453 if (BI->isConditional() && isa<ConstantInt>(BI->getCondition())) { in AddReachableCodeToWorklist() 1454 bool CondVal = cast<ConstantInt>(BI->getCondition())->getZExtValue(); in AddReachableCodeToWorklist() 1460 if (ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition())) { in AddReachableCodeToWorklist()
|
D | InstCombineAddSub.cpp | 279 return SelectInst::Create(SI->getCondition(), N, A); in visitAdd() 283 return SelectInst::Create(SI->getCondition(), A, N); in visitAdd()
|
/external/llvm/lib/Transforms/Scalar/ |
D | SCCP.cpp | 558 LatticeVal BCValue = getValueState(BI->getCondition()); in getFeasibleSuccessors() 580 LatticeVal SCValue = getValueState(SI->getCondition()); in getFeasibleSuccessors() 623 LatticeVal BCValue = getValueState(BI->getCondition()); in isEdgeFeasible() 640 LatticeVal SCValue = getValueState(SI->getCondition()); in isEdgeFeasible() 866 LatticeVal CondValue = getValueState(I.getCondition()); in visitSelectInst() 1551 if (!getValueState(BI->getCondition()).isUndefined()) in ResolvedUndefsIn() 1556 if (isa<UndefValue>(BI->getCondition())) { in ResolvedUndefsIn() 1565 markForcedConstant(BI->getCondition(), in ResolvedUndefsIn() 1573 if (!getValueState(SI->getCondition()).isUndefined()) in ResolvedUndefsIn() 1578 if (isa<UndefValue>(SI->getCondition())) { in ResolvedUndefsIn() [all …]
|
D | LoopUnswitch.cpp | 247 Value *LoopCond = FindLIVLoopCondition(BI->getCondition(), in processCurrentLoop() 256 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(), in processCurrentLoop() 278 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(), in processCurrentLoop() 360 if (!BI->isConditional() || BI->getCondition() != Cond) in IsTrivialUnswitchCondition() 376 if (SI->getCondition() != Cond) return false; in IsTrivialUnswitchCondition() 1043 if (ConstantInt *CB = dyn_cast<ConstantInt>(BI->getCondition())){ in SimplifyCode()
|
D | LoopRotation.cpp | 300 if (!isa<ConstantInt>(PHBI->getCondition()) || in rotateLoop() 301 PHBI->getSuccessor(cast<ConstantInt>(PHBI->getCondition())->isZero()) in rotateLoop()
|
D | IndVarSimplify.cpp | 1493 ICmpInst *OrigCond = dyn_cast<ICmpInst>(BI->getCondition()); in isHighCostExpansion() 1566 ICmpInst *Cond = dyn_cast<ICmpInst>(BI->getCondition()); in getBackedgeIVType() 1645 ICmpInst *Cond = dyn_cast<ICmpInst>(BI->getCondition()); in needsLFTR() 1711 cast<BranchInst>(L->getExitingBlock()->getTerminator())->getCondition(); in FindLoopCounter() 1894 Value *OrigCond = BI->getCondition(); in LinearFunctionTestReplace()
|
/external/apache-http/src/org/apache/http/impl/conn/tsccm/ |
D | WaitingThread.java | 89 public final Condition getCondition() { in getCondition() method in WaitingThread
|
/external/llvm/tools/llvm-diff/ |
D | DifferenceEngine.cpp | 301 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff() 313 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff()
|
/external/llvm/unittests/VMCore/ |
D | InstructionsTest.cpp | 86 EXPECT_EQ(b1->getCondition(), One); in TEST()
|