/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 | BranchProbabilityInfo.cpp | 203 Value *Cond = BI->getCondition(); in calcPointerHeuristics() 290 Value *Cond = BI->getCondition(); in calcZeroHeuristics() 350 Value *Cond = BI->getCondition(); in calcFloatingPointHeuristics()
|
/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
|
/external/llvm/lib/Transforms/Utils/ |
D | SimplifyCFG.cpp | 155 CmpInst *Ci2 = dyn_cast<CmpInst>(SI2->getCondition()); in isProfitableToFoldUnconditional() 255 return Pred1Br->getCondition(); in GetIfCondition() 277 return BI->getCondition(); in GetIfCondition() 507 Cond = dyn_cast<Instruction>(SI->getCondition()); in EraseTerminatorInstAndDCECond() 510 Cond = dyn_cast<Instruction>(BI->getCondition()); in EraseTerminatorInstAndDCECond() 528 CV = SI->getCondition(); in isValueEqualityComparison() 530 if (BI->isConditional() && BI->getCondition()->hasOneUse()) in isValueEqualityComparison() 531 if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) in isValueEqualityComparison() 559 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); in GetValueEqualityComparisonCases() 799 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); in GetBranchWeights() [all …]
|
D | LowerExpectIntrinsic.cpp | 61 CallInst *CI = dyn_cast<CallInst>(SI->getCondition()); in HandleSwitchExpect() 101 ICmpInst *CmpI = dyn_cast<ICmpInst>(BI->getCondition()); in HandleIfExpect()
|
D | CloneFunction.cpp | 305 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition()); in CloneBlock() 308 Value *V = VMap[BI->getCondition()]; in CloneBlock() 322 ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition()); in CloneBlock() 324 Value *V = VMap[SI->getCondition()]; in CloneBlock()
|
D | Local.cpp | 68 if (ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition())) { in ConstantFoldTerminator() 99 Value *Cond = BI->getCondition(); in ConstantFoldTerminator() 111 ConstantInt *CI = dyn_cast<ConstantInt>(SI->getCondition()); in ConstantFoldTerminator() 185 Value *Cond = SI->getCondition(); in ConstantFoldTerminator() 199 Value *Cond = Builder.CreateICmpEQ(SI->getCondition(), in ConstantFoldTerminator()
|
/external/llvm/lib/Transforms/InstCombine/ |
D | InstCombineSelect.cpp | 29 ICmpInst *ICI = dyn_cast<ICmpInst>(SI->getCondition()); in MatchSelectPattern() 134 Type *CondTy = SI.getCondition()->getType(); in FoldSelectOpOp() 143 Value *NewSI = Builder->CreateSelect(SI.getCondition(), TI->getOperand(0), in FoldSelectOpOp() 183 Value *NewSI = Builder->CreateSelect(SI.getCondition(), OtherOpT, in FoldSelectOpOp() 231 Value *NewSel = Builder->CreateSelect(SI.getCondition(), OOp, C); in FoldSelectIntoOp() 266 Value *NewSel = Builder->CreateSelect(SI.getCondition(), C, OOp); in FoldSelectIntoOp() 547 const PHINode *CondPHI = cast<PHINode>(SI.getCondition()); in CanSelectOperandBeMappingIntoPredBlock() 598 const ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition()); in foldSelectICmpAnd() 662 Value *CondVal = SI.getCondition(); in visitSelectInst() 879 if (isa<PHINode>(SI.getCondition())) in visitSelectInst() [all …]
|
D | InstructionCombining.cpp | 611 return SelectInst::Create(SI->getCondition(), in FoldOpIntoSelect() 1599 BI.getCondition()->hasOneUse()) in visitBranchInst() 1602 FCmpInst *Cond = cast<FCmpInst>(BI.getCondition()); in visitBranchInst() 1615 BI.getCondition()->hasOneUse()) in visitBranchInst() 1619 ICmpInst *Cond = cast<ICmpInst>(BI.getCondition()); in visitBranchInst() 1631 Value *Cond = SI.getCondition(); in visitSwitchInst() 2255 if (BI->isConditional() && isa<ConstantInt>(BI->getCondition())) { in AddReachableCodeToWorklist() 2256 bool CondVal = cast<ConstantInt>(BI->getCondition())->getZExtValue(); in AddReachableCodeToWorklist() 2262 if (ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition())) { in AddReachableCodeToWorklist()
|
/external/llvm/lib/Transforms/ObjCARC/ |
D | ProvenanceAnalysis.cpp | 38 if (A->getCondition() == SB->getCondition()) in relatedSelect()
|
/external/llvm/lib/Transforms/Scalar/ |
D | SCCP.cpp | 524 LatticeVal BCValue = getValueState(BI->getCondition()); in getFeasibleSuccessors() 550 LatticeVal SCValue = getValueState(SI->getCondition()); in getFeasibleSuccessors() 593 LatticeVal BCValue = getValueState(BI->getCondition()); in isEdgeFeasible() 613 LatticeVal SCValue = getValueState(SI->getCondition()); in isEdgeFeasible() 815 LatticeVal CondValue = getValueState(I.getCondition()); in visitSelectInst() 1453 if (!getValueState(BI->getCondition()).isUndefined()) in ResolvedUndefsIn() 1458 if (isa<UndefValue>(BI->getCondition())) { in ResolvedUndefsIn() 1467 markForcedConstant(BI->getCondition(), in ResolvedUndefsIn() 1475 if (!getValueState(SI->getCondition()).isUndefined()) in ResolvedUndefsIn() 1480 if (isa<UndefValue>(SI->getCondition())) { in ResolvedUndefsIn() [all …]
|
D | CorrelatedValuePropagation.cpp | 206 Value *Cond = SI->getCondition(); in processSwitch() 260 Cond = SI->getCondition(); in processSwitch()
|
D | LoopUnswitch.cpp | 445 Value *LoopCond = FindLIVLoopCondition(BI->getCondition(), in processCurrentLoop() 454 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(), in processCurrentLoop() 489 Value *LoopCond = FindLIVLoopCondition(SI->getCondition(), in processCurrentLoop() 572 if (!BI->isConditional() || BI->getCondition() != Cond) in IsTrivialUnswitchCondition() 588 if (SI->getCondition() != Cond) return false; in IsTrivialUnswitchCondition() 1269 if (ConstantInt *CB = dyn_cast<ConstantInt>(BI->getCondition())){ in SimplifyCode()
|
D | LoopRotation.cpp | 414 if (!isa<ConstantInt>(PHBI->getCondition()) || in rotateLoop() 415 PHBI->getSuccessor(cast<ConstantInt>(PHBI->getCondition())->isZero()) in rotateLoop()
|
D | LoopIdiomRecognize.cpp | 291 return Br ? Br->getCondition() : 0; in getBrCondtion() 351 ICmpInst *Cond = dyn_cast<ICmpInst>(Br->getCondition()); in matchCondition() 536 ICmpInst *PreCond = cast<ICmpInst>(PreCondBr->getCondition()); in transform() 573 ICmpInst *LbCond = cast<ICmpInst>(LbBr->getCondition()); in transform()
|
/external/llvm/lib/Target/R600/ |
D | SIAnnotateControlFlow.cpp | 190 Value *Ret = CallInst::Create(If, Term->getCondition(), "", Term); in openIf() 266 Value *Cond = Term->getCondition(); in handleLoop() 311 PHINode *Phi = dyn_cast<PHINode>(Term->getCondition()); in runOnFunction()
|
/external/apache-http/src/org/apache/http/impl/conn/tsccm/ |
D | WaitingThread.java | 89 public final Condition getCondition() { in getCondition() method in WaitingThread
|
/external/smack/src/com/kenai/jbosh/ |
D | TerminalBindingCondition.java | 195 String getCondition() { in getCondition() method in TerminalBindingCondition
|
/external/llvm/tools/llvm-diff/ |
D | DifferenceEngine.cpp | 299 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff() 311 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff()
|
/external/smack/src/org/jivesoftware/smack/packet/ |
D | XMPPError.java | 164 public String getCondition() { in getCondition() method in XMPPError 431 protected Condition getCondition() { in getCondition() method in XMPPError.ErrorSpecification
|
/external/smack/src/org/jivesoftware/smackx/packet/ |
D | AdHocCommandData.java | 268 public SpecificErrorCondition getCondition() { in getCondition() method in AdHocCommandData.SpecificError
|