/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 __anona95449ec0111::WalkAST 139 if (isSizeof(L, DstArg) && isOne(R->IgnoreParenCasts())) in containsBadStrncatPattern()
|
/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/llvm/lib/Transforms/Scalar/ |
H A D | LoopPredication.cpp | 479 return Step->isOne() || (Step->isAllOnesValue() && EnableCountDownLoop); in isSupportedStep() 644 RC.IV->getStepRecurrence(*SE)->isOne() && in normalizePredicate() 707 if (Step->isOne()) in widenICmpRangeCheck() 855 if (Step->isOne()) { in parseLoopLatchICmp()
|
H A D | StraightLineStrengthReduce.cpp | 321 return C.Index->isOne() || C.Index->isMinusOne(); in isSimplestForm() 329 return ((C.Index->isOne() || C.Index->isMinusOne()) && in isSimplestForm()
|
H A D | LoopIdiomRecognize.cpp | 974 if (!StoreSizeSCEV->isOne()) { in getStartForNegStride() 1599 !((SubOneOp->getOpcode() == Instruction::Sub && Dec->isOne()) || in detectPopcountIdiom() 1620 if (!Inc || !Inc->isOne()) in detectPopcountIdiom() 1715 if (!Shft || !Shft->isOne()) in detectShiftUntilZeroIdiom() 1744 if (!Inc || (!Inc->isOne() && !Inc->isMinusOne())) in detectShiftUntilZeroIdiom() 2003 if (cast<ConstantInt>(CntInst->getOperand(1))->isOne()) { in transformLoopToCountable()
|
H A D | CorrelatedValuePropagation.cpp | 140 U.set(CI->isOne() ? S->getTrueValue() : S->getFalseValue()); in processSelect() 490 bool IsIntMinPoison = cast<ConstantInt>(II->getArgOperand(1))->isOne(); in processAbsIntrinsic()
|
H A D | JumpThreading.cpp | 199 (CI->isOne() ? BranchProbability::getBranchProbability( in updatePredecessorProfileMetadata() 708 cast<ConstantInt>(I->getOperand(1))->isOne()) { in computeValueKnownInPredecessorsImpl() 896 KnownCond = CI->isOne(); in computeValueKnownInPredecessorsImpl() 2206 } else if (CI->isOne()) { in maybethreadThroughTwoBasicBlocks()
|
H A D | IndVarSimplify.cpp | 808 if (!Step || !Step->isOne()) in isLoopCounter() 910 assert(AR->getStepRecurrence(*SE)->isOne() && "only handles unit stride"); in genLoopLimit()
|
/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 | 167 if (CI->isOne()) in getCanonicalInductionVariable() 424 if (!Step || !Step->isOne()) in isCanonical()
|
/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 __anone240b46e0111::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() 964 if (C->isOne() && Op0->hasOneUse()) { in foldAddWithConstant() 986 if (C->isOne()) { in foldAddWithConstant()
|
H A D | InstCombineCompares.cpp | 87 if (C.isOne()) { in isSignTest() 1413 if (C.isOne() && C.getBitWidth() > 1) { in foldICmpTruncConstant() 1916 X->getType()->isIntOrIntVectorTy(1) && (C.isZero() || C.isOne())) { in foldICmpAndConstant() 1992 if (C.isOne()) { in foldICmpOrConstant() 2126 if ((*MulC & 1).isOne() || Mul->hasNoUnsignedWrap()) { in foldICmpMulConstant() 2662 if (C2->isZero() || C2->isOne() || (DivIsSigned && C2->isAllOnes())) in foldICmpDivConstant() 2852 if (Pred == ICmpInst::ICMP_SLT && C.isOne()) in foldICmpSubConstant() 3432 else if (C.isOne()) in foldICmpBinOpEqualityWithConstant() 3911 if (Pred == ICmpInst::ICMP_SLT && C.isOne()) in foldICmpIntrinsicWithConstant() 4961 !C->isOne()) { in foldICmpBinOp() [all …]
|
H A D | InstCombineSelect.cpp | 499 return C1I.isOne() || C1I.isAllOnes() || C2I.isOne() || C2I.isAllOnes(); in isSelect01() 1978 auto IsZeroOrOne = [](const APInt &C) { return C.isZero() || C.isOne(); }; in foldOverflowingAddSubSelect() 3732 if (Known.One.isOne()) in visitSelectInst() 3734 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 | 203 bool isOne() const { return Val.isOne(); } in isOne() function
|
/freebsd/contrib/llvm-project/llvm/lib/IR/ |
H A D | ConstantFold.cpp | 813 if (CI2->isOne()) in ConstantFoldBinaryInstruction() 873 assert(CI2->isOne()); in ConstantFoldBinaryInstruction() 1432 if (!CI->isOne()) in isInBoundsIndices() 1437 if (!CI || !CI->isOne()) in isInBoundsIndices()
|
H A D | Instruction.cpp | 937 return cast<ConstantInt>(II->getArgOperand(2))->isOne(); in isVolatile() 939 return cast<ConstantInt>(II->getArgOperand(3))->isOne(); in isVolatile()
|
H A D | Module.cpp | 551 return Val && cast<ConstantInt>(Val->getValue())->isOne(); in isDwarf64()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | TargetLowering.cpp | 950 if (!N1C || !N1C->isOne()) in combineShiftToAVG() 969 ConstOp->isOne()) { in combineShiftToAVG() 976 ConstOp->isOne()) { in combineShiftToAVG() 2005 if (DemandedBits.isOne()) in SimplifyDemandedBits() 3860 return CVal.isOne(); in isConstTrueVal() 3895 return N->isOne(); in isExtendedTrueVal() 4769 } else if (N1C->isOne()) { in SimplifySetCC() 6372 if (Divisor.isOne()) { in BuildUDIV() 6860 HadOneDivisor |= D.isOne(); in prepareSREMEqFold() 6861 AllDivisorsAreOnes &= D.isOne(); in prepareSREMEqFold() [all …]
|
/freebsd/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGCleanup.h | 328 assert(Var.getAlignment().isOne()); in setActiveFlag()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAGNodes.h | 1636 bool isOne() const { return Value->isOne(); } 2775 return !cast<ConstantSDNode>(getScale())->isOne(); 2859 return !cast<ConstantSDNode>(getScale())->isOne();
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | ScaledNumber.h | 545 bool isOne() const { in isOne() function
|