Searched refs:isMinusOne (Results 1 – 17 of 17) sorted by relevance
15 define i32 @isMinusOne(i32 %call) nounwind {
182 bool isMinusOne() const { in isMinusOne() function
183 if (RHSVal.isMinusOne()) in handleDivremOverflowImpl()
65 bool isMinusOne() const { return isInt() && IntVal == -1; } in isMinusOne() function in __anon34d4ec880111::FAddendCoef285 if (That.isMinusOne()) { in operator *=()798 if (CE.isMinusOne() || CE.isMinusTwo()) in calcInstrNumber()804 if (!CE.isMinusOne() && !CE.isOne()) in calcInstrNumber()830 if (Coeff.isMinusOne() || Coeff.isOne()) { in createAddendVal()831 NeedNeg = Coeff.isMinusOne(); in createAddendVal()
827 if (!((Pred0 == ICmpInst::ICMP_SGT && RangeStart->isMinusOne()) || in simplifyRangeCheck()
279 return C.Index->isOne() || C.Index->isMinusOne(); in isSimplestForm()287 return ((C.Index->isOne() || C.Index->isMinusOne()) && in isSimplestForm()
727 if (StepCI->isOne() || StepCI->isMinusOne()) { in parseLoopStructure()1323 if (!(ConstD->isMinusOne() || ConstD->isOne())) in computeSafeIterationSpace()
250 } else if (Pred == CmpInst::ICMP_SGT && Const->isMinusOne()) { in convertICmp()
680 if (ConstStep && (ConstStep->isOne() || ConstStep->isMinusOne())) in getConsecutiveDirection()710 getConstIntStepValue()->isMinusOne()) in transform()
173 bool isMinusOne() const { in isMinusOne() function
198 bool isMinusOne() const { in isMinusOne() function
1196 return C->isMinusOne(); in isIdempotentRMW()
751 if (Size->isMinusOne()) return; in visitIntrinsicInst()
68 return CI->isMinusOne(); in isAllOnesValue()
108 return CI->isMinusOne(); in isAllOnesValue()
3810 if (Pred == ICmpInst::ICMP_SGT && (C1->isZero() || C1->isMinusOne())) { in matchSelectPattern()