| /freebsd-12.1/contrib/compiler-rt/lib/ubsan/ |
| H A D | ubsan_value.h | 182 bool isMinusOne() const { in isMinusOne() function
|
| H A D | ubsan_handlers.cc | 251 if (RHSVal.isMinusOne()) in handleDivremOverflowImpl()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAddSub.cpp | 79 bool isMinusOne() const { return isInt() && IntVal == -1; } in isMinusOne() function in __anonf964e0cb0111::FAddendCoef
298 if (That.isMinusOne()) { in operator *=()
719 if (CE.isMinusOne() || CE.isMinusTwo()) in calcInstrNumber()
725 if (!CE.isMinusOne() && !CE.isOne()) in calcInstrNumber()
751 if (Coeff.isMinusOne() || Coeff.isOne()) { in createAddendVal()
752 NeedNeg = Coeff.isMinusOne(); in createAddendVal()
|
| H A D | InstCombineSimplifyDemanded.cpp | 606 if (Rem->isMinusOne()) in SimplifyDemandedUseBits()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | StraightLineStrengthReduce.cpp | 315 return C.Index->isOne() || C.Index->isMinusOne(); in isSimplestForm()
323 return ((C.Index->isOne() || C.Index->isMinusOne()) && in isSimplestForm()
|
| H A D | LoopIdiomRecognize.cpp | 1226 Dec->isMinusOne()))) { in detectPopcountIdiom()
|
| H A D | InductiveRangeCheckElimination.cpp | 949 if (StepCI->isMinusOne()) { in parseLoopStructure()
|
| H A D | SCCP.cpp | 1015 if (CI->isMinusOne()) in visitBinaryOperator()
|
| H A D | Reassociate.cpp | 2173 cast<ConstantInt>(Ops.back().Op)->isMinusOne()) { in ReassociateExpression()
|
| H A D | GVN.cpp | 1762 bool isKnownTrue = CI->isMinusOne(); in propagateEquality()
|
| /freebsd-12.1/contrib/llvm/lib/Target/SystemZ/ |
| H A D | SystemZTDC.cpp | 250 } else if (Pred == CmpInst::ICMP_SGT && Const->isMinusOne()) { in convertICmp()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | Evaluator.cpp | 505 if (!Size->isMinusOne() && in EvaluateBlock()
|
| H A D | SimplifyLibCalls.cpp | 2746 if (ObjSizeCI->isMinusOne()) in isFortifiedCallFoldable()
|
| /freebsd-12.1/contrib/llvm/lib/IR/ |
| H A D | ConstantFold.cpp | 245 if (RHSC->isMinusOne()) in ExtractConstantBytes()
1061 if (CI2->isMinusOne()) in ConstantFoldBinaryInstruction()
1099 if (CI2->isMinusOne()) in ConstantFoldBinaryInstruction()
|
| H A D | Constants.cpp | 103 return CI->isMinusOne(); in isAllOnesValue()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | Lint.cpp | 425 !cast<ConstantInt>(UnderlyingObject)->isMinusOne(), in visitMemoryReference()
|
| H A D | BranchProbabilityInfo.cpp | 732 } else if (CV->isMinusOne()) { in calcZeroHeuristics()
|
| H A D | IVDescriptors.cpp | 811 if (ConstStep && (ConstStep->isOne() || ConstStep->isMinusOne())) in getConsecutiveDirection()
|
| H A D | ScalarEvolution.cpp | 379 return SC->getValue()->isMinusOne(); in isAllOnesValue()
6239 if (CI->isMinusOne()) in createSCEV()
6314 if (CI->isMinusOne()) in createSCEV()
8703 if (StepC->getValue()->isOne() || StepC->getValue()->isMinusOne()) { in howFarToZero()
|
| /freebsd-12.1/contrib/llvm/include/llvm/IR/ |
| H A D | Constants.h | 209 bool isMinusOne() const { in isMinusOne() function
|
| H A D | IRBuilder.h | 1166 if (isa<ConstantInt>(RC) && cast<ConstantInt>(RC)->isMinusOne())
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOInstrumentation.cpp | 267 else if (CV->isMinusOne()) in getBranchCondString()
|
| H A D | AddressSanitizer.cpp | 1013 if (Size->isMinusOne()) return; in visitIntrinsicInst()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | AtomicExpandPass.cpp | 1304 return C->isMinusOne(); in isIdempotentRMW()
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | SelectionDAGNodes.h | 1525 bool isAllOnesValue() const { return Value->isMinusOne(); }
|