| /llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/ |
| H A D | ppc64-32bit-addic.ll | 15 define i32 @isMinusOne(i32 %call) nounwind {
|
| /llvm-project-15.0.7/compiler-rt/lib/ubsan/ |
| H A D | ubsan_value.h | 184 bool isMinusOne() const { in isMinusOne() function
|
| H A D | ubsan_handlers.cpp | 293 if (RHSVal.isMinusOne()) in handleDivremOverflowImpl()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAtomicRMW.cpp | 46 return C->isMinusOne(); in isIdempotentRMW()
|
| H A D | InstCombineAddSub.cpp | 79 bool isMinusOne() const { return isInt() && IntVal == -1; } in isMinusOne() function in __anonbe741ed60111::FAddendCoef
298 if (That.isMinusOne()) { in operator *=()
710 if (!CE.isMinusOne() && !CE.isOne()) in calcInstrNumber()
734 if (Coeff.isMinusOne() || Coeff.isOne()) { in createAddendVal()
735 NeedNeg = Coeff.isMinusOne(); in createAddendVal()
|
| H A D | InstCombineCalls.cpp | 1502 if (Power->isMinusOne()) in visitCallInst()
|
| /llvm-project-15.0.7/clang/lib/AST/Interp/ |
| H A D | Boolean.h | 67 constexpr static bool isMinusOne() { return false; } in isMinusOne() function
|
| H A D | Integral.h | 127 bool isMinusOne() const { return Signed && V == T(-1); }
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | StraightLineStrengthReduce.cpp | 325 return C.Index->isOne() || C.Index->isMinusOne(); in isSimplestForm()
333 return ((C.Index->isOne() || C.Index->isMinusOne()) && in isSimplestForm()
|
| H A D | LoopIdiomRecognize.cpp | 1684 Dec->isMinusOne()))) { in detectPopcountIdiom()
1827 if (!Inc || (!Inc->isOne() && !Inc->isMinusOne())) in detectShiftUntilZeroIdiom()
|
| H A D | InductiveRangeCheckElimination.cpp | 950 if (StepCI->isMinusOne()) { in parseLoopStructure()
|
| H A D | Reassociate.cpp | 2385 cast<ConstantInt>(Ops.back().Op)->isMinusOne()) { in ReassociateExpression()
|
| H A D | GVN.cpp | 2370 bool isKnownTrue = CI->isMinusOne(); in propagateEquality()
|
| /llvm-project-15.0.7/llvm/lib/Target/SystemZ/ |
| H A D | SystemZTDC.cpp | 254 } else if (Pred == CmpInst::ICMP_SGT && Const->isMinusOne()) { in convertICmp()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | Evaluator.cpp | 452 if (!Size->isMinusOne() && in EvaluateBlock()
|
| /llvm-project-15.0.7/llvm/lib/IR/ |
| H A D | ConstantFold.cpp | 246 if (RHSC->isMinusOne()) in ExtractConstantBytes()
1036 if (CI2->isMinusOne()) in ConstantFoldBinaryInstruction()
1094 if (CI2->isMinusOne()) in ConstantFoldBinaryInstruction()
|
| H A D | Constants.cpp | 96 return CI->isMinusOne(); in isAllOnesValue()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | Lint.cpp | 408 !cast<ConstantInt>(UnderlyingObject)->isMinusOne(), in visitMemoryReference()
|
| H A D | BranchProbabilityInfo.cpp | 1028 } else if (CV->isMinusOne()) { in calcZeroHeuristics()
|
| H A D | ScalarEvolution.cpp | 438 return SC->getValue()->isMinusOne(); in isAllOnesValue()
7551 if (CI->isMinusOne()) in createSCEV()
7631 if (CI->isMinusOne()) in createSCEV()
10200 if (StepC->getValue()->isOne() || StepC->getValue()->isMinusOne()) { in howFarToZero()
|
| /llvm-project-15.0.7/llvm/include/llvm/IR/ |
| H A D | Constants.h | 206 bool isMinusOne() const { return Val.isAllOnes(); } in isMinusOne() function
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOInstrumentation.cpp | 334 else if (CV->isMinusOne()) in getBranchCondString()
|
| H A D | AddressSanitizer.cpp | 1055 if (Size->isMinusOne()) return; in visitIntrinsicInst()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | AtomicExpandPass.cpp | 1426 return C->isMinusOne(); in isIdempotentRMW()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | SelectionDAGNodes.h | 1596 bool isAllOnes() const { return Value->isMinusOne(); }
|