Skip to content

Commit 4e6cda2

Browse files
author
Chad Rosier
committedMay 10, 2016
[InstCombine] Fold icmp ugt/ult (udiv i32 C2, X), C1.
This patch adds support for two optimizations: icmp ugt (udiv C2, X), C1 -> icmp ule X, C2/(C1+1) icmp ult (udiv C2, X), C1 -> icmp ugt X, C2/C1 Differential Revision: http://reviews.llvm.org/D20123 llvm-svn: 269109
1 parent 7347fce commit 4e6cda2

File tree

2 files changed

+112
-3
lines changed

2 files changed

+112
-3
lines changed
 

‎llvm/lib/Transforms/InstCombine/InstCombineCompares.cpp

+21-3
Original file line numberDiff line numberDiff line change
@@ -2093,8 +2093,28 @@ Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
20932093
break;
20942094
}
20952095

2096-
case Instruction::SDiv:
20972096
case Instruction::UDiv:
2097+
if (ConstantInt *DivLHS = dyn_cast<ConstantInt>(LHSI->getOperand(0))) {
2098+
Value *X = LHSI->getOperand(1);
2099+
APInt C1 = RHS->getValue();
2100+
APInt C2 = DivLHS->getValue();
2101+
assert(C2 != 0 && "udiv 0, X should have been simplified already.");
2102+
// (icmp ugt (udiv C2, X), C1) -> (icmp ule X, C2/(C1+1))
2103+
if (ICI.getPredicate() == ICmpInst::ICMP_UGT) {
2104+
assert(!C1.isMaxValue() &&
2105+
"icmp ugt X, UINT_MAX should have been simplified already.");
2106+
return new ICmpInst(ICmpInst::ICMP_ULE, X,
2107+
ConstantInt::get(X->getType(), C2.udiv(C1 + 1)));
2108+
}
2109+
// (icmp ult (udiv C2, X), C1) -> (icmp ugt X, C2/C1)
2110+
if (ICI.getPredicate() == ICmpInst::ICMP_ULT) {
2111+
assert(C1 != 0 && "icmp ult X, 0 should have been simplified already.");
2112+
return new ICmpInst(ICmpInst::ICMP_UGT, X,
2113+
ConstantInt::get(X->getType(), C2.udiv(C1)));
2114+
}
2115+
}
2116+
// fall-through
2117+
case Instruction::SDiv:
20982118
// Fold: icmp pred ([us]div X, C1), C2 -> range test
20992119
// Fold this div into the comparison, producing a range check.
21002120
// Determine, based on the divide type, what the range is being
@@ -2105,8 +2125,6 @@ Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
21052125
if (Instruction *R = FoldICmpDivCst(ICI, cast<BinaryOperator>(LHSI),
21062126
DivRHS))
21072127
return R;
2108-
// FIXME: Handle (icmp ugt (udiv i32 CI2, A), CI) and
2109-
// (icmp ult (udiv i32 CI2, A), CI).
21102128
break;
21112129

21122130
case Instruction::Sub: {

‎llvm/test/Transforms/InstCombine/compare-udiv.ll

+91
Original file line numberDiff line numberDiff line change
@@ -39,3 +39,94 @@ define i1 @test5(i32 %d) {
3939
%cmp1 = icmp ne i32 %div, 0
4040
ret i1 %cmp1
4141
}
42+
43+
; CHECK-LABEL: @test6
44+
; CHECK: %cmp1 = icmp ult i32 %d, 6
45+
define i1 @test6(i32 %d) {
46+
%div = udiv i32 5, %d
47+
%cmp1 = icmp ugt i32 %div, 0
48+
ret i1 %cmp1
49+
}
50+
51+
; (icmp ugt (udiv C1, X), C1) -> false.
52+
; CHECK-LABEL: @test7
53+
; CHECK: ret i1 false
54+
define i1 @test7(i32 %d) {
55+
%div = udiv i32 8, %d
56+
%cmp1 = icmp ugt i32 %div, 8
57+
ret i1 %cmp1
58+
}
59+
60+
; CHECK-LABEL: @test8
61+
; CHECK: %cmp1 = icmp ult i32 %d, 2
62+
define i1 @test8(i32 %d) {
63+
%div = udiv i32 4, %d
64+
%cmp1 = icmp ugt i32 %div, 3
65+
ret i1 %cmp1
66+
}
67+
68+
; CHECK-LABEL: @test9
69+
; CHECK: %cmp1 = icmp ult i32 %d, 2
70+
define i1 @test9(i32 %d) {
71+
%div = udiv i32 4, %d
72+
%cmp1 = icmp ugt i32 %div, 2
73+
ret i1 %cmp1
74+
}
75+
76+
; CHECK-LABEL: @test10
77+
; CHECK: %cmp1 = icmp ult i32 %d, 3
78+
define i1 @test10(i32 %d) {
79+
%div = udiv i32 4, %d
80+
%cmp1 = icmp ugt i32 %div, 1
81+
ret i1 %cmp1
82+
}
83+
84+
; CHECK-LABEL: @test11
85+
; CHECK: %cmp1 = icmp ugt i32 %d, 4
86+
define i1 @test11(i32 %d) {
87+
%div = udiv i32 4, %d
88+
%cmp1 = icmp ult i32 %div, 1
89+
ret i1 %cmp1
90+
}
91+
92+
; CHECK-LABEL: @test12
93+
; CHECK: %cmp1 = icmp ugt i32 %d, 2
94+
define i1 @test12(i32 %d) {
95+
%div = udiv i32 4, %d
96+
%cmp1 = icmp ult i32 %div, 2
97+
ret i1 %cmp1
98+
}
99+
100+
; CHECK-LABEL: @test13
101+
; CHECK: %cmp1 = icmp ugt i32 %d, 1
102+
define i1 @test13(i32 %d) {
103+
%div = udiv i32 4, %d
104+
%cmp1 = icmp ult i32 %div, 3
105+
ret i1 %cmp1
106+
}
107+
108+
; CHECK-LABEL: @test14
109+
; CHECK: %cmp1 = icmp ugt i32 %d, 1
110+
define i1 @test14(i32 %d) {
111+
%div = udiv i32 4, %d
112+
%cmp1 = icmp ult i32 %div, 4
113+
ret i1 %cmp1
114+
}
115+
116+
; icmp ugt X, UINT_MAX -> false.
117+
; CHECK-LABEL: @test15
118+
; CHECK: ret i1 false
119+
define i1 @test15(i32 %d) {
120+
%div = udiv i32 4, %d
121+
%cmp1 = icmp ugt i32 %div, -1
122+
ret i1 %cmp1
123+
}
124+
125+
; icmp ult X, UINT_MAX -> true.
126+
; CHECK-LABEL: @test16
127+
; CHECK: ret i1 true
128+
define i1 @test16(i32 %d) {
129+
%div = udiv i32 4, %d
130+
%cmp1 = icmp ult i32 %div, -1
131+
ret i1 %cmp1
132+
}

0 commit comments

Comments
 (0)
Please sign in to comment.