| /freebsd/contrib/llvm-project/compiler-rt/lib/BlocksRuntime/ |
| H A D | Block_private.h | 138 BLOCK_EXPORT void _Block_use_GC( void *(*alloc)(const unsigned long, const bool isOne, const bool i… 145 BLOCK_EXPORT void _Block_use_GC5( void *(*alloc)(const unsigned long, const bool isOne, const bool …
|
| H A D | runtime.c | 213 static void *(*_Block_allocator)(const unsigned long, const bool isOne, const bool isObject) = _Blo… 231 void _Block_use_GC( void *(*alloc)(const unsigned long, const bool isOne, const bool isObject), in _Block_use_GC() argument 254 void _Block_use_GC5( void *(*alloc)(const unsigned long, const bool isOne, const bool isObject), in _Block_use_GC5() argument
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | CStringSyntaxChecker.cpp | 66 bool isOne(const Expr *E) { in isOne() function in __anon8e4070240111::WalkAST 139 if (isSizeof(L, DstArg) && isOne(R->IgnoreParenCasts())) in containsBadStrncatPattern()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 478 return Step->isOne() || (Step->isAllOnesValue() && EnableCountDownLoop); in isSupportedStep() 643 RC.IV->getStepRecurrence(*SE)->isOne() && in normalizePredicate() 706 if (Step->isOne()) in widenICmpRangeCheck() 854 if (Step->isOne()) { in parseLoopLatchICmp()
|
| H A D | LoopIdiomRecognize.cpp | 994 if (!StoreSizeSCEV->isOne()) { in getStartForNegStride() 1942 if (!Shft || !Shft->isOne()) in detectShiftUntilLessThanIdiom() 1960 if (!Inc || (!Inc->isOne() && !Inc->isMinusOne())) in detectShiftUntilLessThanIdiom() 2043 !((SubOneOp->getOpcode() == Instruction::Sub && Dec->isOne()) || in detectPopcountIdiom() 2064 if (!Inc || !Inc->isOne()) in detectPopcountIdiom() 2159 if (!Shft || !Shft->isOne()) in detectShiftUntilZeroIdiom() 2188 if (!Inc || (!Inc->isOne() && !Inc->isMinusOne())) in detectShiftUntilZeroIdiom() 2525 if (cast<ConstantInt>(CntInst->getOperand(1))->isOne()) { in transformLoopToCountable()
|
| 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 | CorrelatedValuePropagation.cpp | 133 U.set(CI->isOne() ? S->getTrueValue() : S->getFalseValue()); in processSelect() 392 else if (Res && Res->isOne()) in processSwitch() 523 bool IsIntMinPoison = cast<ConstantInt>(II->getArgOperand(1))->isOne(); in processAbsIntrinsic()
|
| H A D | JumpThreading.cpp | 198 (CI->isOne() ? BranchProbability::getBranchProbability( in updatePredecessorProfileMetadata() 702 cast<ConstantInt>(I->getOperand(1))->isOne()) { in computeValueKnownInPredecessorsImpl() 882 KnownCond = CI->isOne(); in computeValueKnownInPredecessorsImpl() 2221 } else if (CI->isOne()) { in maybethreadThroughTwoBasicBlocks()
|
| H A D | ConstraintElimination.cpp | 1038 if (!(-StepOffset).isOne()) in addInfoForInductions() 1067 if (!StepOffset.isOne()) { in addInfoForInductions() 1937 if (cast<ConstantInt>(CB.Inst->getOperand(1))->isOne()) in eliminateConstraints()
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | DivisionByConstantInfo.cpp | 76 assert(!D.isZero() && !D.isOne() && "Precondition violation."); in get()
|
| /freebsd/contrib/llvm-project/clang/include/clang/AST/ |
| H A D | CharUnits.h | 125 bool isOne() const { return Quantity == 1; } in isOne() function
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolutionDivision.cpp | 77 if (Denominator->isOne()) { in divide()
|
| H A D | LoopInfo.cpp | 168 if (CI->isOne()) in getCanonicalInductionVariable() 425 if (!Step || !Step->isOne()) in isCanonical()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionPatternMatch.h | 44 bool isValue(const APInt &C) const { return C.isOne(); } in isValue()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAddSub.cpp | 77 bool isOne() const { return isInt() && IntVal == 1; } in isOne() function in __anon84b617a60111::FAddendCoef 295 if (That.isOne()) in operator *=() 416 if (!BreakNum || Coeff.isOne()) in drillAddendDownOneStep() 484 return CE.isOne() ? Opnd0.getSymVal() : nullptr; in simplify() 709 if (!CE.isMinusOne() && !CE.isOne()) in calcInstrNumber() 733 if (Coeff.isMinusOne() || Coeff.isOne()) { in createAddendVal() 977 if (C->isOne() && Op0->hasOneUse()) { in foldAddWithConstant() 1005 if (C->isOne()) { in foldAddWithConstant() 1199 !(C1.isOne() && !IsSigned && DivOpC.isPowerOf2() && DivOpC != 2)) { in SimplifyAddWithRemainder()
|
| H A D | InstCombineCompares.cpp | 86 if (C.isOne()) { in isSignTest() 1464 if (C.isOne() && C.getBitWidth() > 1) { in foldICmpTruncConstant() 1765 ((!IsShl && C2.isOne()) || !isa<Constant>(Shift->getOperand(0)))) { in foldICmpAndShift() 1985 X->getType()->isIntOrIntVectorTy(1) && (C.isZero() || C.isOne())) { in foldICmpAndConstant() 2087 if (C.isOne()) { in foldICmpOrConstant() 2231 if ((*MulC & 1).isOne() || Mul->hasNoUnsignedWrap()) { in foldICmpMulConstant() 2306 } else if (Cmp.isSigned() && C2->isOne()) { in foldICmpShlLHSC() 2355 if (C.isZero() || (Pred == ICmpInst::ICMP_SGT ? C.isAllOnes() : C.isOne())) in foldICmpShlConstant() 2834 if (C2->isZero() || C2->isOne() || (DivIsSigned && C2->isAllOnes())) in foldICmpDivConstant() 3024 if (Pred == ICmpInst::ICMP_SLT && C.isOne()) in foldICmpSubConstant() [all …]
|
| H A D | InstCombineSelect.cpp | 490 return C1I.isOne() || C1I.isAllOnes() || C2I.isOne() || C2I.isAllOnes(); in isSelect01() 2176 auto IsZeroOrOne = [](const APInt &C) { return C.isZero() || C.isOne(); }; in foldOverflowingAddSubSelect() 3718 if (!InnerTV->isOne()) { in foldSelectToCmp() 3723 if (ICmpInst::isGT(FalseBranchSelectPredicate) && InnerTV->isOne() && in foldSelectToCmp() 4309 if (Known.One.isOne()) in visitSelectInst() 4311 if (Known.Zero.isOne()) in visitSelectInst()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | MatrixBuilder.h | 237 assert(cast<ConstantInt>(Cmp)->isOne() && "Index must be valid!");
|
| H A D | Constants.h | 220 bool isOne() const { return Val.isOne(); } in isOne() function
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | TargetLowering.cpp | 1018 if (!N1C || !N1C->isOne()) in combineShiftToAVG() 1037 ConstOp->isOne()) { in combineShiftToAVG() 1044 ConstOp->isOne()) { in combineShiftToAVG() 2104 if (DemandedBits.isOne()) in SimplifyDemandedBits() 2409 if (DemandedBits.isOne() && !TLO.LegalOps && !VT.isVector()) in SimplifyDemandedBits() 2899 if (Op.getOpcode() == ISD::SUB && DemandedBits.isOne() && in SimplifyDemandedBits() 2925 if (C && !C->isAllOnes() && !C->isOne() && in SimplifyDemandedBits() 4100 return CVal.isOne(); in isConstTrueVal() 4135 return N->isOne(); in isExtendedTrueVal() 4142 return (N->isOne() && !SExt) || (SExt && (N->getValueType(0) != MVT::i1)); in isExtendedTrueVal() [all …]
|
| /freebsd/contrib/llvm-project/clang/lib/CodeGen/ |
| H A D | CGCleanup.h | 400 assert(Var.getAlignment().isOne());
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Instruction.cpp | 1104 return cast<ConstantInt>(II->getArgOperand(2))->isOne(); in isVolatile() 1106 return cast<ConstantInt>(II->getArgOperand(3))->isOne(); in isVolatile()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | SelectionDAGNodes.h | 1765 bool isOne() const { return Value->isOne(); } 2934 return !cast<ConstantSDNode>(getScale())->isOne(); 3018 return !cast<ConstantSDNode>(getScale())->isOne();
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/SandboxIR/ |
| H A D | Constant.h | 196 bool isOne() const { return cast<llvm::ConstantInt>(Val)->isOne(); } in isOne() function
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | ScaledNumber.h | 548 bool isOne() const { in isOne() function
|