Skip to content

[InstCombine] Simplify the overflow result of umulov X, X #80796

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Feb 6, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 11 additions & 0 deletions llvm/lib/Transforms/InstCombine/InstructionCombining.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -3459,6 +3459,17 @@ InstCombinerImpl::foldExtractOfOverflowIntrinsic(ExtractValueInst &EV) {
WO->getLHS()->getType()->isIntOrIntVectorTy(1))
return BinaryOperator::CreateAnd(WO->getLHS(), WO->getRHS());

// extractvalue (umul_with_overflow X, X), 1 -> X u> 2^(N/2)-1
if (OvID == Intrinsic::umul_with_overflow && WO->getLHS() == WO->getRHS()) {
unsigned BitWidth = WO->getLHS()->getType()->getScalarSizeInBits();
// Only handle even bitwidths for performance reasons.
if (BitWidth % 2 == 0)
return new ICmpInst(
ICmpInst::ICMP_UGT, WO->getLHS(),
ConstantInt::get(WO->getLHS()->getType(),
APInt::getLowBitsSet(BitWidth, BitWidth / 2)));
}

// If only the overflow result is used, and the right hand side is a
// constant (or constant splat), we can remove the intrinsic by directly
// checking for overflow.
Expand Down
72 changes: 72 additions & 0 deletions llvm/test/Transforms/InstCombine/umulo-square.ll
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --version 4
; RUN: opt -passes=instcombine -S %s | FileCheck %s

define i1 @umulov_square_i32(i32 %x) {
; CHECK-LABEL: define i1 @umulov_square_i32(
; CHECK-SAME: i32 [[X:%.*]]) {
; CHECK-NEXT: [[RES:%.*]] = icmp ugt i32 [[X]], 65535
; CHECK-NEXT: ret i1 [[RES]]
;
%ret = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %x, i32 %x)
%res = extractvalue {i32, i1} %ret, 1
ret i1 %res
}

define i1 @umulov_square_i16(i16 %x) {
; CHECK-LABEL: define i1 @umulov_square_i16(
; CHECK-SAME: i16 [[X:%.*]]) {
; CHECK-NEXT: [[RES:%.*]] = icmp ugt i16 [[X]], 255
; CHECK-NEXT: ret i1 [[RES]]
;
%ret = call {i16, i1} @llvm.umul.with.overflow.i16(i16 %x, i16 %x)
%res = extractvalue {i16, i1} %ret, 1
ret i1 %res
}

; Negative tests

define i1 @umulov_square_i13(i13 %x) {
; CHECK-LABEL: define i1 @umulov_square_i13(
; CHECK-SAME: i13 [[X:%.*]]) {
; CHECK-NEXT: [[RET:%.*]] = call { i13, i1 } @llvm.umul.with.overflow.i13(i13 [[X]], i13 [[X]])
; CHECK-NEXT: [[RES:%.*]] = extractvalue { i13, i1 } [[RET]], 1
; CHECK-NEXT: ret i1 [[RES]]
;
%ret = call {i13, i1} @llvm.umul.with.overflow.i13(i13 %x, i13 %x)
%res = extractvalue {i13, i1} %ret, 1
ret i1 %res
}

define i1 @umulov_square_i32_multiuse(i32 %x) {
; CHECK-LABEL: define i1 @umulov_square_i32_multiuse(
; CHECK-SAME: i32 [[X:%.*]]) {
; CHECK-NEXT: [[RET:%.*]] = call { i32, i1 } @llvm.umul.with.overflow.i32(i32 [[X]], i32 [[X]])
; CHECK-NEXT: [[RES:%.*]] = extractvalue { i32, i1 } [[RET]], 1
; CHECK-NEXT: [[VAL:%.*]] = extractvalue { i32, i1 } [[RET]], 0
; CHECK-NEXT: call void @use(i32 [[VAL]])
; CHECK-NEXT: ret i1 [[RES]]
;
%ret = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %x, i32 %x)
%res = extractvalue {i32, i1} %ret, 1
%val = extractvalue {i32, i1} %ret, 0
call void @use(i32 %val)
ret i1 %res
}

define i1 @smulov_square_i32(i32 %x) {
; CHECK-LABEL: define i1 @smulov_square_i32(
; CHECK-SAME: i32 [[X:%.*]]) {
; CHECK-NEXT: [[RET:%.*]] = call { i32, i1 } @llvm.smul.with.overflow.i32(i32 [[X]], i32 [[X]])
; CHECK-NEXT: [[RES:%.*]] = extractvalue { i32, i1 } [[RET]], 1
; CHECK-NEXT: ret i1 [[RES]]
;
%ret = call {i32, i1} @llvm.smul.with.overflow.i32(i32 %x, i32 %x)
%res = extractvalue {i32, i1} %ret, 1
ret i1 %res
}

declare {i32, i1} @llvm.umul.with.overflow.i32(i32, i32)
declare {i32, i1} @llvm.smul.with.overflow.i32(i32, i32)
declare {i16, i1} @llvm.umul.with.overflow.i16(i16, i16)
declare {i13, i1} @llvm.umul.with.overflow.i13(i13, i13)
declare void @use(i32)