Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h479 bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero = false,
482 return llvm::isKnownToBeAPowerOfTwo(V, DL, OrZero, Depth, &AC, CxtI, &DT);
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp264 bool llvm::isKnownToBeAPowerOfTwo(const Value *V, const DataLayout &DL, in isKnownToBeAPowerOfTwo() function in llvm
268 return ::isKnownToBeAPowerOfTwo( in isKnownToBeAPowerOfTwo()
1886 if (!isKnownToBeAPowerOfTwo(Start, OrZero, Depth, Q)) in isPowerOfTwoRecurrence()
1902 isKnownToBeAPowerOfTwo(Step, OrZero, Depth, Q); in isPowerOfTwoRecurrence()
1914 isKnownToBeAPowerOfTwo(Step, false, Depth, Q); in isPowerOfTwoRecurrence()
1969 return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Depth, Q); in isKnownToBeAPowerOfTwo()
2007 isKnownToBeAPowerOfTwo(I->getOperand(1), OrZero, Depth, Q)) in isKnownToBeAPowerOfTwo()
2011 isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Depth, Q)) in isKnownToBeAPowerOfTwo()
2056 return isKnownToBeAPowerOfTwo(U.get(), OrZero, NewDepth, RecQ); in isKnownToBeAPowerOfTwo()
2329 isKnownToBeAPowerOfTwo(Y, /*OrZero*/ false, Depth, Q)) in isNonZeroAdd()
[all …]
H A DInstructionSimplify.cpp2033 isKnownToBeAPowerOfTwo(Op1, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI, Q.DT)) in simplifyAndCommutative()
2039 isKnownToBeAPowerOfTwo(Op1, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI, Q.DT)) in simplifyAndCommutative()
2047 isKnownToBeAPowerOfTwo(X, Q.DL, /*OrZero*/ true, /*Depth*/ 0, Q.AC, in simplifyAndCommutative()
2117 isKnownToBeAPowerOfTwo(Shift, Q.DL, /*OrZero*/ false, 0, Q.AC, Q.CxtI, in simplifyAndInst()
6240 if (isKnownToBeAPowerOfTwo(Op0, Q.DL, /*OrZero*/ false, 0, Q.AC, Q.CxtI, in simplifyUnaryIntrinsic()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DUtils.h319 bool isKnownToBeAPowerOfTwo(Register Val, const MachineRegisterInfo &MRI,
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DUtils.cpp997 bool llvm::isKnownToBeAPowerOfTwo(Register Reg, const MachineRegisterInfo &MRI, in isKnownToBeAPowerOfTwo() function in llvm
1037 if (!isKnownToBeAPowerOfTwo(MO.getReg(), MRI, KB)) in isKnownToBeAPowerOfTwo()
H A DCombinerHelper.cpp2854 return isKnownToBeAPowerOfTwo(MO.getReg(), MRI, KB); in matchOperandIsKnownToBeAPowerOfTwo()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DValueTracking.h112 bool isKnownToBeAPowerOfTwo(const Value *V, const DataLayout &DL,
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineMulDivRem.cpp68 IC.isKnownToBeAPowerOfTwo(I->getOperand(0), false, 0, &CxtI)) { in simplifyValueKnownNonZero()
1566 if (isKnownToBeAPowerOfTwo(Op1, /*OrZero*/ true, 0, &I)) { in visitSDiv()
2025 if (isKnownToBeAPowerOfTwo(Op1, /*OrZero*/ true, 0, &I)) { in visitURem()
H A DInstCombineAndOrXor.cpp728 isKnownToBeAPowerOfTwo(L2, false, 0, CxtI) && in foldAndOrOfICmpsOfAndWithPow2()
729 isKnownToBeAPowerOfTwo(R2, false, 0, CxtI)) { in foldAndOrOfICmpsOfAndWithPow2()
2246 isKnownToBeAPowerOfTwo(Y, /*OrZero*/ true, /*Depth*/ 0, &I)) in visitAnd()
4626 isKnownToBeAPowerOfTwo(II->getArgOperand(0), /*OrZero */ true)) { in visitXor()
H A DInstCombineCompares.cpp1160 if (!isKnownToBeAPowerOfTwo(Y, /*OrZero*/ true, 0, &I)) in foldIRemByPowerOfTwoToBitTest()
5432 isKnownToBeAPowerOfTwo(Op1, /* OrZero */ false, 0, &I)) in foldICmpEquality()
5437 isKnownToBeAPowerOfTwo(Op0, /* OrZero */ false, 0, &I)) in foldICmpEquality()
5478 if (IsZero && isKnownToBeAPowerOfTwo(A, /* OrZero */ true, /*Depth*/ 0, &I)) in foldICmpEquality()
7120 match(Op1, m_Zero()) && isKnownToBeAPowerOfTwo(X, false, 0, &I) && in visitICmpInst()
H A DInstCombineCalls.cpp691 if (IC.isKnownToBeAPowerOfTwo(Op0, /* OrZero */ true)) in foldCtpop()
1708 isKnownToBeAPowerOfTwo(X, /* OrZero */ true)) { in visitCallInst()
H A DInstCombineSelect.cpp2611 IC.isKnownToBeAPowerOfTwo(Remainder, /*OrZero*/ true) && in foldSelectWithSRem()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUCodeGenPrepare.cpp1338 if (isKnownToBeAPowerOfTwo(C, *DL, true, 0, AC, &I, DT)) in divHasSpecialOptimization()
1348 isKnownToBeAPowerOfTwo(BinOpDen->getOperand(0), *DL, true, in divHasSpecialOptimization()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp4170 bool SelectionDAG::isKnownToBeAPowerOfTwo(SDValue Val, unsigned Depth) const { in isKnownToBeAPowerOfTwo() function in SelectionDAG
4189 return isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1) && in isKnownToBeAPowerOfTwo()
4199 return isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1) && in isKnownToBeAPowerOfTwo()
4204 return isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1); in isKnownToBeAPowerOfTwo()
4224 isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1)) in isKnownToBeAPowerOfTwo()
4229 return isKnownToBeAPowerOfTwo(Val.getOperand(1), Depth + 1) && in isKnownToBeAPowerOfTwo()
4230 isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1); in isKnownToBeAPowerOfTwo()
4233 return isKnownToBeAPowerOfTwo(Val.getOperand(2), Depth + 1) && in isKnownToBeAPowerOfTwo()
4234 isKnownToBeAPowerOfTwo(Val.getOperand(1), Depth + 1); in isKnownToBeAPowerOfTwo()
4253 return isKnownToBeAPowerOfTwo(Val.getOperand(0), Depth + 1); in isKnownToBeAPowerOfTwo()
H A DDAGCombiner.cpp5028 if (DAG.isKnownToBeAPowerOfTwo(N1)) { in visitREM()
5040 DAG.isKnownToBeAPowerOfTwo(N1.getOperand(0))) { in visitREM()
27642 if (InexpensiveLogBase2 || InexpensiveOnly || !DAG.isKnownToBeAPowerOfTwo(V)) in BuildLogBase2()
H A DTargetLowering.cpp3974 DAG.isKnownToBeAPowerOfTwo(Y)) { in foldSetCCWithAnd()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSelectionDAG.h2043 bool isKnownToBeAPowerOfTwo(SDValue Val, unsigned Depth = 0) const;