| /freebsd/contrib/llvm-project/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 __anon84b617a60111::FAddendCoef
298 if (That.isMinusOne()) { in operator *=()
709 if (!CE.isMinusOne() && !CE.isOne()) in calcInstrNumber()
733 if (Coeff.isMinusOne() || Coeff.isOne()) { in createAddendVal()
734 NeedNeg = Coeff.isMinusOne(); in createAddendVal()
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/ubsan/ |
| H A D | ubsan_value.h | 218 bool isMinusOne() const { in isMinusOne() function
|
| H A D | ubsan_handlers.cpp | 293 if (RHSVal.isMinusOne()) in handleDivremOverflowImpl()
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ByteCode/ |
| H A D | Boolean.h | 63 constexpr static bool isMinusOne() { return false; } in isMinusOne() function
|
| H A D | FixedPoint.h | 63 bool isMinusOne() const { return V.isSigned() && V.getValue() == -1; } in isMinusOne() function
|
| H A D | Floating.h | 146 bool isMinusOne() const { return getValue().isExactlyValue(-1.0); } in isMinusOne() function
|
| H A D | Integral.h | 152 bool isMinusOne() const { return Signed && V == ReprT(-1); }
|
| H A D | IntegralAP.h | 177 bool isMinusOne() const { return Signed && getValue().isAllOnes(); } in isMinusOne() function
|
| /freebsd/contrib/llvm-project/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 | 1960 if (!Inc || (!Inc->isOne() && !Inc->isMinusOne())) in detectShiftUntilLessThanIdiom()
2045 Dec->isMinusOne()))) { in detectPopcountIdiom()
2188 if (!Inc || (!Inc->isOne() && !Inc->isMinusOne())) in detectShiftUntilZeroIdiom()
|
| H A D | Reassociate.cpp | 2331 cast<ConstantInt>(Ops.back().Op)->isMinusOne()) { in ReassociateExpression()
|
| H A D | GVN.cpp | 2612 bool IsKnownTrue = CI->isMinusOne(); in propagateEquality()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
| H A D | SystemZTDC.cpp | 250 } else if (Pred == CmpInst::ICMP_SGT && Const->isMinusOne()) { in convertICmp()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | Evaluator.cpp | 435 if (!Size->isMinusOne() && in EvaluateBlock()
|
| H A D | LoopConstrainer.cpp | 332 if (StepCI->isMinusOne()) { in parseLoopStructure()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/SandboxIR/ |
| H A D | Constant.h | 202 bool isMinusOne() const { return cast<llvm::ConstantInt>(Val)->isMinusOne(); } in isMinusOne() function
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | Lint.cpp | 414 !cast<ConstantInt>(UnderlyingObject)->isMinusOne(), in visitMemoryReference()
|
| H A D | BranchProbabilityInfo.cpp | 1014 } else if (CV->isMinusOne()) { in calcZeroHeuristics()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Constants.h | 226 bool isMinusOne() const { return Val.isAllOnes(); } in isMinusOne() function
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | AtomicExpandPass.cpp | 1596 return C->isMinusOne(); in isIdempotentRMW()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOInstrumentation.cpp | 433 else if (CV->isMinusOne()) in getBranchCondString()
|
| H A D | AddressSanitizer.cpp | 1226 if (Size->isMinusOne()) return; in visitIntrinsicInst()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | SelectionDAGNodes.h | 1767 bool isAllOnes() const { return Value->isMinusOne(); }
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Constants.cpp | 110 return CI->isMinusOne(); in isAllOnesValue()
|