Skip to content

[ValueTracking] Improve tracking for constant range of {s|u}rem C #82303

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

Closed
Closed
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
13 changes: 13 additions & 0 deletions llvm/lib/Analysis/ValueTracking.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -8776,13 +8776,26 @@ static void setLimitsForBinOp(const BinaryOperator &BO, APInt &Lower,
// 'srem x, C' produces (-|C|, |C|).
Upper = C->abs();
Lower = (-Upper) + 1;
} else if (match(BO.getOperand(0), m_APInt(C))) {
if (C->isNegative()) {
// 'srem -|C|, x' produces [-|C|, 0].
Upper = 1;
Lower = *C;
} else {
// 'srem |C|, x' produces [0, |C|].
Upper = *C + 1;
Lower = 0;
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
Lower = 0;

}
}
break;

case Instruction::URem:
if (match(BO.getOperand(1), m_APInt(C)))
// 'urem x, C' produces [0, C).
Upper = *C;
else if (match(BO.getOperand(0), m_APInt(C)))
// 'urem C, x' produces [0, C].
Upper = *C + 1;
break;

default:
Expand Down
100 changes: 100 additions & 0 deletions llvm/test/Analysis/ValueTracking/constant-ranges.ll
Original file line number Diff line number Diff line change
Expand Up @@ -130,3 +130,103 @@ define i1 @and_ugt_fail(i8 %xx) {
%r = icmp ugt i8 %x_p2, 127
ret i1 %r
}

define i1 @urem_okay(i8 %x) {
; CHECK-LABEL: @urem_okay(
; CHECK-NEXT: ret i1 true
;
%val = urem i8 34, %x
%r = icmp ule i8 %val, 35
ret i1 %r
}

define i1 @urem_fail(i8 %x) {
; CHECK-LABEL: @urem_fail(
; CHECK-NEXT: [[VAL:%.*]] = urem i8 34, [[X:%.*]]
; CHECK-NEXT: [[R:%.*]] = icmp ule i8 [[VAL]], 33
; CHECK-NEXT: ret i1 [[R]]
;
%val = urem i8 34, %x
%r = icmp ule i8 %val, 33
ret i1 %r
}

define i1 @srem_posC_okay0(i8 %x) {
; CHECK-LABEL: @srem_posC_okay0(
; CHECK-NEXT: ret i1 true
;
%val = srem i8 34, %x
%r = icmp sle i8 %val, 34
ret i1 %r
}

define i1 @srem_posC_okay1(i8 %x) {
; CHECK-LABEL: @srem_posC_okay1(
; CHECK-NEXT: ret i1 true
;
%val = srem i8 34, %x
%r = icmp sge i8 %val, -3
ret i1 %r
}

define i1 @srem_negC_okay0(i8 %x) {
; CHECK-LABEL: @srem_negC_okay0(
; CHECK-NEXT: ret i1 true
;
%val = srem i8 -34, %x
%r = icmp sle i8 %val, 0
ret i1 %r
}

define i1 @srem_negC_okay1(i8 %x) {
; CHECK-LABEL: @srem_negC_okay1(
; CHECK-NEXT: ret i1 true
;
%val = srem i8 -34, %x
%r = icmp sge i8 %val, -34
ret i1 %r
}

define i1 @srem_posC_fail0(i8 %x) {
; CHECK-LABEL: @srem_posC_fail0(
; CHECK-NEXT: [[VAL:%.*]] = srem i8 34, [[X:%.*]]
; CHECK-NEXT: [[R:%.*]] = icmp sle i8 [[VAL]], 32
; CHECK-NEXT: ret i1 [[R]]
;
%val = srem i8 34, %x
%r = icmp sle i8 %val, 32
ret i1 %r
}

define i1 @srem_posC_fail1(i8 %x) {
; CHECK-LABEL: @srem_posC_fail1(
; CHECK-NEXT: [[VAL:%.*]] = srem i8 34, [[X:%.*]]
; CHECK-NEXT: [[R:%.*]] = icmp sge i8 [[VAL]], 1
; CHECK-NEXT: ret i1 [[R]]
;
%val = srem i8 34, %x
%r = icmp sge i8 %val, 1
ret i1 %r
}

define i1 @srem_negC_fail0(i8 %x) {
; CHECK-LABEL: @srem_negC_fail0(
; CHECK-NEXT: [[VAL:%.*]] = srem i8 -34, [[X:%.*]]
; CHECK-NEXT: [[R:%.*]] = icmp sle i8 [[VAL]], -1
; CHECK-NEXT: ret i1 [[R]]
;
%val = srem i8 -34, %x
%r = icmp sle i8 %val, -1
ret i1 %r
}

define i1 @srem_negC_fail1(i8 %x) {
; CHECK-LABEL: @srem_negC_fail1(
; CHECK-NEXT: [[VAL:%.*]] = srem i8 -34, [[X:%.*]]
; CHECK-NEXT: [[R:%.*]] = icmp sge i8 [[VAL]], -33
; CHECK-NEXT: ret i1 [[R]]
;
%val = srem i8 -34, %x
%r = icmp sge i8 %val, -33
ret i1 %r
}