Searched refs:isMinusOne (Results 1 – 13 of 13) sorted by relevance
15 define i32 @isMinusOne(i32 %call) nounwind {
182 bool isMinusOne() const { in isMinusOne() function
157 if (RHSVal.isMinusOne()) in handleDivremOverflowImpl()
65 bool isMinusOne() const { return isInt() && IntVal == -1; } in isMinusOne() function in __anone66ade280111::FAddendCoef299 if (That.isMinusOne()) { in operator *=()818 if (CE.isMinusOne() || CE.isMinusTwo()) in calcInstrNumber()824 if (!CE.isMinusOne() && !CE.isOne()) in calcInstrNumber()850 if (Coeff.isMinusOne() || Coeff.isOne()) { in createAddendVal()851 NeedNeg = Coeff.isMinusOne(); in createAddendVal()
79 if (Pred == ICmpInst::ICMP_SGT && (C1->isZero() || C1->isMinusOne())) { in MatchSelectPattern()
841 if (!((Pred0 == ICmpInst::ICMP_SGT && RangeStart->isMinusOne()) || in simplifyRangeCheck()
301 return C.Index->isOne() || C.Index->isMinusOne(); in isSimplestForm()309 return ((C.Index->isOne() || C.Index->isMinusOne()) && in isSimplestForm()
749 if (StepCI->isOne() || StepCI->isMinusOne()) { in parseLoopStructure()1346 if (!(ConstD->isMinusOne() || ConstD->isOne())) in computeSafeIterationSpace()
550 return C->isMinusOne(); in isIdempotentRMW()
172 bool isMinusOne() const { in isMinusOne() function
662 if (StepValue && (StepValue->isOne() || StepValue->isMinusOne())) in getConsecutiveDirection()678 if (StepValue->isMinusOne()) in transform()685 if (StepValue->isMinusOne()) in transform()
663 if (Size->isMinusOne()) return; in visitIntrinsicInst()
91 return CI->isMinusOne(); in isAllOnesValue()