Searched defs:RHSV (Results 1 - 3 of 3) sorted by relevance

/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineCompares.cpp686 Value *RHSV = GEPRHS->getOperand(DiffOperand); local
688 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), LHSV, RHSV);
1023 const APInt &RHSV = RHS->getValue(); local
1050 if ((ICI.getPredicate() == ICmpInst::ICMP_SLT && RHSV == 0) ||
1051 (ICI.getPredicate() == ICmpInst::ICMP_SGT && RHSV.isAllOnesValue())) {
1085 RHSV ^ SignBit));
1097 RHSV ^ NotSignBit));
1116 (!AndCST->isNegative() && RHSV.isNonNegative())) {
1132 if (ICI.isEquality() && RHSV.getActiveBits() <= Ty->getBitWidth()) {
1210 if (Shift && Shift->hasOneUse() && RHSV
[all...]
/external/llvm/lib/Transforms/Utils/
H A DSimplifyLibCalls.cpp960 Value *RHSV = B.CreateZExt(B.CreateLoad(CastToCStr(RHS, B), "rhsc"), local
962 return B.CreateSub(LHSV, RHSV, "chardiff");
/external/llvm/lib/Target/ARM/
H A DARMISelDAGToDAG.cpp2650 unsigned RHSV = C->getZExtValue(); local
2651 if (!RHSV) break;
2652 if (isPowerOf2_32(RHSV-1)) { // 2^n+1?
2653 unsigned ShImm = Log2_32(RHSV-1);
2668 if (isPowerOf2_32(RHSV+1)) { // 2^n-1?
2669 unsigned ShImm = Log2_32(RHSV+1);

Completed in 681 milliseconds