Home
last modified time | relevance | path

Searched refs:isKnownToBeAPowerOfTwo (Results 1 – 20 of 20) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h443 bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero = false,
446 return llvm::isKnownToBeAPowerOfTwo(V, OrZero, SQ.getWithInstruction(CxtI),
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DValueTracking.h129 LLVM_ABI bool isKnownToBeAPowerOfTwo(const Value *V, const DataLayout &DL,
137 LLVM_ABI bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero,
H A DScalarEvolution.h1060 LLVM_ABI bool isKnownToBeAPowerOfTwo(const SCEV *S, bool OrZero = false,
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp266 bool llvm::isKnownToBeAPowerOfTwo(const Value *V, const DataLayout &DL, in isKnownToBeAPowerOfTwo() function in llvm
271 return ::isKnownToBeAPowerOfTwo( in isKnownToBeAPowerOfTwo()
2347 if (!isKnownToBeAPowerOfTwo(Start, OrZero, Q, Depth)) in isPowerOfTwoRecurrence()
2363 isKnownToBeAPowerOfTwo(Step, OrZero, Q, Depth); in isPowerOfTwoRecurrence()
2375 isKnownToBeAPowerOfTwo(Step, false, Q, Depth); in isPowerOfTwoRecurrence()
2412 bool llvm::isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, in isKnownToBeAPowerOfTwo() function in llvm
2481 return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2483 return OrZero && isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2486 return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2490 return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
[all …]
H A DInstructionSimplify.cpp1998 isKnownToBeAPowerOfTwo(Op1, Q.DL, /*OrZero*/ true, Q.AC, Q.CxtI, Q.DT)) in simplifyAndCommutative()
2004 isKnownToBeAPowerOfTwo(Op1, Q.DL, /*OrZero*/ true, Q.AC, Q.CxtI, Q.DT)) in simplifyAndCommutative()
2012 isKnownToBeAPowerOfTwo(X, Q.DL, /*OrZero*/ true, Q.AC, Q.CxtI) && in simplifyAndCommutative()
2081 isKnownToBeAPowerOfTwo(Shift, Q.DL, /*OrZero*/ false, Q.AC, Q.CxtI, in simplifyAndInst()
6322 if (isKnownToBeAPowerOfTwo(Op0, Q.DL, /*OrZero*/ false, Q.AC, Q.CxtI, Q.DT)) in simplifyUnaryIntrinsic()
H A DScalarEvolution.cpp9222 isKnownToBeAPowerOfTwo(AR->getStepRecurrence(*this), /*OrZero=*/true, in computeExitLimitFromICmp()
10954 bool ScalarEvolution::isKnownToBeAPowerOfTwo(const SCEV *S, bool OrZero, in isKnownToBeAPowerOfTwo() function in ScalarEvolution
13300 if (isKnownToBeAPowerOfTwo(Stride)) { in howManyLessThans()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DUtils.h343 isKnownToBeAPowerOfTwo(Register Val, const MachineRegisterInfo &MRI,
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineMulDivRem.cpp69 IC.isKnownToBeAPowerOfTwo(I->getOperand(0), false, &CxtI)) { in simplifyValueKnownNonZero()
1734 if (isKnownToBeAPowerOfTwo(Denom, /*OrZero=*/true, &I)) in visitUDiv()
1869 if (isKnownToBeAPowerOfTwo(Op1, /*OrZero*/ true, &I)) { in visitSDiv()
2423 if (isKnownToBeAPowerOfTwo(Op1, /*OrZero*/ true, &I)) { in visitURem()
H A DInstCombineAndOrXor.cpp700 isKnownToBeAPowerOfTwo(B, /*OrZero=*/false, Q) && in foldLogOpOfMaskedICmps()
701 isKnownToBeAPowerOfTwo(D, /*OrZero=*/false, Q)) { in foldLogOpOfMaskedICmps()
803 !isKnownToBeAPowerOfTwo(Pow2, Q.DL, /*OrZero=*/true, Q.AC, Q.CxtI, Q.DT)) in foldAndOrOfICmpsWithPow2AndWithZero()
2449 isKnownToBeAPowerOfTwo(Y, /*OrZero*/ true, &I)) in visitAnd()
4426 isKnownToBeAPowerOfTwo(Pow2, /*OrZero=*/true, &I)) { in foldXorOfICmps()
5029 isKnownToBeAPowerOfTwo(II->getArgOperand(0), /*OrZero */ true)) { in visitXor()
H A DInstCombineCompares.cpp1189 if (!isKnownToBeAPowerOfTwo(Y, /*OrZero*/ true, &I)) in foldIRemByPowerOfTwoToBitTest()
4453 return isKnownToBeAPowerOfTwo(I->getOperand(0), Q.DL, /*OrZero*/ true, in isMaskOrZero()
4459 return isKnownToBeAPowerOfTwo(I->getOperand(1), Q.DL, /*OrZero*/ true, in isMaskOrZero()
6165 isKnownToBeAPowerOfTwo(Op1, /* OrZero */ false, &I)) in foldICmpEquality()
6170 isKnownToBeAPowerOfTwo(Op0, /* OrZero */ false, &I)) in foldICmpEquality()
6208 if (IsZero && isKnownToBeAPowerOfTwo(A, /* OrZero */ true, &I)) in foldICmpEquality()
7799 match(Op1, m_Zero()) && isKnownToBeAPowerOfTwo(X, false, &I) && in visitICmpInst()
H A DInstCombineShifts.cpp1628 isKnownToBeAPowerOfTwo(Shl0_Op0, /*OrZero=*/true, &I)) { in visitLShr()
H A DInstCombineCalls.cpp701 if (IC.isKnownToBeAPowerOfTwo(Op0, /* OrZero */ true)) in foldCtpop()
2048 isKnownToBeAPowerOfTwo(X, /* OrZero */ true)) { in visitCallInst()
H A DInstCombineSelect.cpp2806 IC.isKnownToBeAPowerOfTwo(Remainder, /*OrZero=*/true) && in foldSelectWithSRem()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DUtils.cpp1107 bool llvm::isKnownToBeAPowerOfTwo(Register Reg, const MachineRegisterInfo &MRI, in isKnownToBeAPowerOfTwo() function in llvm
1147 if (!isKnownToBeAPowerOfTwo(MO.getReg(), MRI, VT)) in isKnownToBeAPowerOfTwo()
H A DCombinerHelper.cpp3010 return isKnownToBeAPowerOfTwo(MO.getReg(), MRI, VT); in matchOperandIsKnownToBeAPowerOfTwo()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUCodeGenPrepare.cpp1361 if (isKnownToBeAPowerOfTwo(C, DL, true, AC, &I, DT)) in divHasSpecialOptimization()
1371 isKnownToBeAPowerOfTwo(BinOpDen->getOperand(0), DL, true, AC, &I, DT)) { in divHasSpecialOptimization()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp4617 bool SelectionDAG::isKnownToBeAPowerOfTwo(SDValue Val, unsigned Depth) const { in isKnownToBeAPowerOfTwo() function in SelectionDAG
4636 return isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1) && in isKnownToBeAPowerOfTwo()
4646 return isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1) && in isKnownToBeAPowerOfTwo()
4651 return isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1); in isKnownToBeAPowerOfTwo()
4671 isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1)) in isKnownToBeAPowerOfTwo()
4676 return isKnownToBeAPowerOfTwo(Val.getOperand(1), Depth + 1) && in isKnownToBeAPowerOfTwo()
4677 isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1); in isKnownToBeAPowerOfTwo()
4680 return isKnownToBeAPowerOfTwo(Val.getOperand(2), Depth + 1) && in isKnownToBeAPowerOfTwo()
4681 isKnownToBeAPowerOfTwo(Val.getOperand(1), Depth + 1); in isKnownToBeAPowerOfTwo()
4694 return isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1); in isKnownToBeAPowerOfTwo()
[all …]
H A DDAGCombiner.cpp5341 if (DAG.isKnownToBeAPowerOfTwo(N1)) { in visitREM()
5353 DAG.isKnownToBeAPowerOfTwo(N1.getOperand(0))) { in visitREM()
29165 if (InexpensiveLogBase2 || InexpensiveOnly || !DAG.isKnownToBeAPowerOfTwo(V)) in BuildLogBase2()
H A DTargetLowering.cpp4214 DAG.isKnownToBeAPowerOfTwo(Y)) { in foldSetCCWithAnd()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSelectionDAG.h2166 LLVM_ABI bool isKnownToBeAPowerOfTwo(SDValue Val, unsigned Depth = 0) const;