[llvm] [InstCombine] Fold (X << Y) / (X << Z) -> 1 << Y >> Z (PR #68863)
via llvm-commits
llvm-commits at lists.llvm.org
Thu Oct 12 12:46:40 PDT 2023
================
@@ -980,6 +980,27 @@ static Instruction *foldIDivShl(BinaryOperator &I,
Ret = BinaryOperator::CreateSDiv(X, Y);
}
+ // If X << Y and X << Z does not overflow, then:
+ // (X << Y) / (X << Z) -> (1 << Y) / (1 << Z) -> 1 << Y >> Z
+ // Only when both Op0 and Op1 have uses, this fold produces one extra
+ // instruction.
+ if (match(Op0, m_Shl(m_Value(X), m_Value(Y))) &&
+ match(Op1, m_Shl(m_Specific(X), m_Value(Z))) &&
+ (Op0->hasOneUse() || Op1->hasOneUse())) {
----------------
goldsteinn wrote:
maybe @nikic cay more, but I'd be okay with dropping the use check to get rid of the `div`. We already increase inst count to drop `div` in other places.
https://github.com/llvm/llvm-project/pull/68863
More information about the llvm-commits
mailing list