| /external/llvm/lib/Transforms/Utils/ |
| CmpInstAnalysis.cpp | 44 unsigned llvm::getICmpCode(const ICmpInst *ICI, bool InvertPred) {
45 ICmpInst::Predicate Pred = InvertPred ? ICI->getInversePredicate()
49 case ICmpInst::ICMP_UGT: return 1; // 001
50 case ICmpInst::ICMP_SGT: return 1; // 001
51 case ICmpInst::ICMP_EQ: return 2; // 010
52 case ICmpInst::ICMP_UGE: return 3; // 011
53 case ICmpInst::ICMP_SGE: return 3; // 011
54 case ICmpInst::ICMP_ULT: return 4; // 100
55 case ICmpInst::ICMP_SLT: return 4; // 100
56 case ICmpInst::ICMP_NE: return 5; // 10
[all...] |
| SimplifyIndVar.cpp | 80 void eliminateIVComparison(ICmpInst *ICmp, Value *IVOperand);
157 void SimplifyIndvar::eliminateIVComparison(ICmpInst *ICmp, Value *IVOperand) {
159 ICmpInst::Predicate Pred = ICmp->getPredicate();
164 Pred = ICmpInst::getSwappedPredicate(Pred);
180 else if (SE->isKnownPredicate(ICmpInst::getInversePredicate(Pred), S, X))
212 SE->isKnownPredicate(IsSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT,
223 ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT,
227 ICmpInst *ICmp = new ICmpInst(Rem, ICmpInst::ICMP_EQ
[all...] |
| LowerSwitch.cpp | 215 ICmpInst* Comp = new ICmpInst(ICmpInst::ICMP_SLT,
238 ICmpInst* Comp = nullptr;
241 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_EQ, Val,
247 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High,
251 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High
[all...] |
| LowerExpectIntrinsic.cpp | 108 ICmpInst *CmpI = dyn_cast<ICmpInst>(BI->getCondition());
|
| LoopUnrollRuntime.cpp | 111 new ICmpInst(InsertPt, ICmpInst::ICMP_ULT, TripCount,
348 Value *BranchVal = new ICmpInst(*NewBB, ICmpInst::ICMP_EQ, ModVal,
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| CmpInstAnalysis.h | 21 class ICmpInst;
47 unsigned getICmpCode(const ICmpInst *ICI, bool InvertPred = false);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineCompares.cpp | 110 static bool isSignBitCheck(ICmpInst::Predicate pred, ConstantInt *RHS,
113 case ICmpInst::ICMP_SLT: // True if LHS s< 0
116 case ICmpInst::ICMP_SLE: // True if LHS s<= RHS and RHS == -1
119 case ICmpInst::ICMP_SGT: // True if LHS s> -1
122 case ICmpInst::ICMP_UGT:
126 case ICmpInst::ICMP_UGE:
138 static bool isSignTest(ICmpInst::Predicate &pred, const ConstantInt *RHS) {
139 if (!ICmpInst::isSigned(pred))
143 return ICmpInst::isRelational(pred);
146 if (pred == ICmpInst::ICMP_SLT)
[all...] |
| InstCombineAndOrXor.cpp | 91 ICmpInst::Predicate NewPred;
266 ICmpInst::ICMP_SLE:ICmpInst::ICMP_ULE), Lo, Hi))->getZExtValue() &&
275 ICmpInst::Predicate pred = (isSigned ?
276 ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT);
293 ICmpInst::Predicate pred = (isSigned ?
294 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT);
417 ICmpInst::Predicate SCC
[all...] |
| InstCombineSelect.cpp | 31 ICmpInst *ICI = dyn_cast<ICmpInst>(SI->getCondition());
34 ICmpInst::Predicate Pred = ICI->getPredicate();
47 case ICmpInst::ICMP_UGT:
48 case ICmpInst::ICMP_UGE: return SPF_UMAX;
49 case ICmpInst::ICMP_SGT:
50 case ICmpInst::ICMP_SGE: return SPF_SMAX;
51 case ICmpInst::ICMP_ULT:
52 case ICmpInst::ICMP_ULE: return SPF_UMIN;
53 case ICmpInst::ICMP_SLT
[all...] |
| InstCombine.h | 148 Value *FoldAndOfICmps(ICmpInst *LHS, ICmpInst *RHS);
151 Value *FoldOrOfICmps(ICmpInst *LHS, ICmpInst *RHS);
167 Instruction *visitICmpInst(ICmpInst &I);
168 Instruction *visitICmpInstWithCastAndCast(ICmpInst &ICI);
169 Instruction *visitICmpInstWithInstAndIntCst(ICmpInst &ICI, Instruction *LHS,
171 Instruction *FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
173 Instruction *FoldICmpShrCst(ICmpInst &ICI, BinaryOperator *DivI,
176 ICmpInst::Predicate Pred)
[all...] |
| InstCombineCasts.cpp | 472 return new ICmpInst(ICmpInst::ICMP_NE, Src, Zero);
513 Instruction *InstCombiner::transformZExtICmp(ICmpInst *ICI, Instruction &CI,
523 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
524 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())) {
534 if (ICI->getPredicate() == ICmpInst::ICMP_SGT) {
562 bool isNE = ICI->getPredicate() == ICmpInst::ICMP_NE;
624 if (ICI->getPredicate() == ICmpInst::ICMP_EQ)
[all...] |
| InstructionCombining.cpp | 674 if (ICmpInst *CI = dyn_cast<ICmpInst>(&I))
819 else if (isa<ICmpInst>(CI))
[all...] |
| /external/llvm/lib/IR/ |
| ConstantFold.cpp | [all...] |
| Instructions.cpp | [all...] |
| /external/llvm/lib/Analysis/ |
| InstructionSimplify.cpp | [all...] |
| ScalarEvolution.cpp | [all...] |
| LazyValueInfo.cpp | 803 ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition());
808 if (isTrueDest == (ICI->getPredicate() == ICmpInst::ICMP_EQ))
818 if (ICI->getPredicate() == ICmpInst::ICMP_ULT)
[all...] |
| /external/llvm/examples/Fibonacci/ |
| fibonacci.cpp | 64 Value *CondInst = new ICmpInst(*BB, ICmpInst::ICMP_SLE, ArgX, Two, "cond");
|
| /external/llvm/lib/CodeGen/ |
| Analysis.cpp | 188 ISD::CondCode llvm::getICmpCondCode(ICmpInst::Predicate Pred) {
190 case ICmpInst::ICMP_EQ: return ISD::SETEQ;
191 case ICmpInst::ICMP_NE: return ISD::SETNE;
192 case ICmpInst::ICMP_SLE: return ISD::SETLE;
193 case ICmpInst::ICMP_ULE: return ISD::SETULE;
194 case ICmpInst::ICMP_SGE: return ISD::SETGE;
195 case ICmpInst::ICMP_UGE: return ISD::SETUGE;
196 case ICmpInst::ICMP_SLT: return ISD::SETLT;
197 case ICmpInst::ICMP_ULT: return ISD::SETULT;
198 case ICmpInst::ICMP_SGT: return ISD::SETGT
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| Analysis.h | 81 ISD::CondCode getICmpCondCode(ICmpInst::Predicate Pred);
|
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolution.h | 465 /// branch of the ICmpInst ExitCond, TBB, and FBB.
467 ICmpInst *ExitCond,
485 ICmpInst::Predicate p);
524 bool isImpliedCond(ICmpInst::Predicate Pred,
532 bool isImpliedCondOperands(ICmpInst::Predicate Pred,
539 bool isImpliedCondOperandsHelper(ICmpInst::Predicate Pred,
555 bool isKnownPredicateWithRanges(ICmpInst::Predicate Pred,
743 bool isLoopEntryGuardedByCond(const Loop *L, ICmpInst::Predicate Pred,
749 bool isLoopBackedgeGuardedByCond(const Loop *L, ICmpInst::Predicate Pred,
[all...] |
| /external/llvm/include/llvm/IR/ |
| PatternMatch.h | 681 inline CmpClass_match<LHS, RHS, ICmpInst, ICmpInst::Predicate>
682 m_ICmp(ICmpInst::Predicate &Pred, const LHS &L, const RHS &R) {
684 ICmpInst, ICmpInst::Predicate>(Pred, L, R);
974 static bool match(ICmpInst::Predicate Pred) {
981 static bool match(ICmpInst::Predicate Pred) {
988 static bool match(ICmpInst::Predicate Pred) {
995 static bool match(ICmpInst::Predicate Pred) {
1029 inline MaxMin_match<ICmpInst, LHS, RHS, smax_pred_ty
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopIdiomRecognize.cpp | 350 ICmpInst *Cond = dyn_cast<ICmpInst>(Br->getCondition());
358 ICmpInst::Predicate Pred = Cond->getPredicate();
359 if ((Pred == ICmpInst::ICMP_NE && Br->getSuccessor(0) == LoopEntry) ||
360 (Pred == ICmpInst::ICMP_EQ && Br->getSuccessor(1) == LoopEntry))
534 ICmpInst *PreCond = cast<ICmpInst>(PreCondBr->getCondition());
541 ICmpInst *NewPreCond =
542 cast<ICmpInst>(Builder.CreateICmp(PreCond->getPredicate(), Opnd0, Opnd1));
571 ICmpInst *LbCond = cast<ICmpInst>(LbBr->getCondition())
[all...] |
| /external/llvm/examples/BrainF/ |
| BrainF.cpp | 439 ICmpInst *test_0 = new ICmpInst(*testbb, ICmpInst::ICMP_EQ, tape_0,
|
| /external/llvm/unittests/IR/ |
| InstructionsTest.cpp | 312 ICmpInst *ICmp0 = new ICmpInst(ICmpInst::ICMP_SGT, PtrVecA, PtrVecB);
313 ICmpInst *ICmp1 = new ICmpInst(ICmpInst::ICMP_ULT, PtrVecA, PtrVecB);
317 // Test InsertAtEnd ICmpInst constructor.
318 ICmpInst *ICmp2 = new ICmpInst(*BB0, ICmpInst::ICMP_SGE, PtrVecA, PtrVecB)
[all...] |
