Files
clang-p2996/llvm/test/Transforms/SCCP/ip-constant-ranges.ll
Florian Hahn 7d10213317 Recommit "[SCCP] Support NUW/NSW inference for all overflowing binary operators."
This reverts commit 43acb61a08.

Recommit the patch after fixing the issue causing the revert in 4e607ec498.
Extra tests have been added in 5c6cb61ad4.

Original commit message:

   Extend the NUW/NSW inference logic add in 72121a20cd and cdeaf5f28c
    to all overflowing binary operators.

    Reviewed By: nikic

    Differential Revision: https://reviews.llvm.org/D142721
2023-01-30 20:15:28 +00:00

322 lines
9.4 KiB
LLVM

; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --function-signature
; RUN: opt < %s -passes=ipsccp -S | FileCheck %s
; Constant range for %a is [1, 48) and for %b is [301, 1000)
define internal i32 @f1(i32 %a, i32 %b) {
; CHECK-LABEL: define {{[^@]+}}@f1
; CHECK-SAME: (i32 [[A:%.*]], i32 [[B:%.*]]) {
; CHECK-NEXT: entry:
; CHECK-NEXT: ret i32 undef
;
entry:
%cmp.a = icmp sgt i32 %a, 300
%cmp.b = icmp sgt i32 %b, 300
%cmp.a2 = icmp ugt i32 %a, 300
%cmp.b2 = icmp ugt i32 %b, 300
%a.1 = select i1 %cmp.a, i32 1, i32 2
%b.1 = select i1 %cmp.b, i32 1, i32 2
%a.2 = select i1 %cmp.a2, i32 1, i32 2
%b.2 = select i1 %cmp.b2, i32 1, i32 2
%res1 = add i32 %a.1, %b.1
%res2 = add i32 %a.2, %b.2
%res3 = add i32 %res1, %res2
ret i32 %res3
}
; Constant range for %x is [47, 302)
define internal i32 @f2(i32 %x) {
; CHECK-LABEL: define {{[^@]+}}@f2
; CHECK-SAME: (i32 [[X:%.*]]) {
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMP:%.*]] = icmp sgt i32 [[X]], 300
; CHECK-NEXT: [[CMP4:%.*]] = icmp ugt i32 [[X]], 300
; CHECK-NEXT: [[RES1:%.*]] = select i1 [[CMP]], i32 1, i32 2
; CHECK-NEXT: [[RES4:%.*]] = select i1 [[CMP4]], i32 3, i32 4
; CHECK-NEXT: [[RES6:%.*]] = add nuw nsw i32 [[RES1]], 3
; CHECK-NEXT: [[RES7:%.*]] = add nuw nsw i32 5, [[RES4]]
; CHECK-NEXT: [[RES:%.*]] = add nuw nsw i32 [[RES6]], 5
; CHECK-NEXT: ret i32 [[RES]]
;
entry:
%cmp = icmp sgt i32 %x, 300
%cmp2 = icmp ne i32 %x, 10
%cmp3 = icmp sge i32 %x, 47
%cmp4 = icmp ugt i32 %x, 300
%cmp5 = icmp uge i32 %x, 47
%res1 = select i1 %cmp, i32 1, i32 2
%res2 = select i1 %cmp2, i32 3, i32 4
%res3 = select i1 %cmp3, i32 5, i32 6
%res4 = select i1 %cmp4, i32 3, i32 4
%res5 = select i1 %cmp5, i32 5, i32 6
%res6 = add i32 %res1, %res2
%res7 = add i32 %res3, %res4
%res = add i32 %res6, %res5
ret i32 %res
}
define i32 @caller1() {
; CHECK-LABEL: define {{[^@]+}}@caller1() {
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CALL1:%.*]] = tail call i32 @f1(i32 1, i32 301)
; CHECK-NEXT: [[CALL2:%.*]] = tail call i32 @f1(i32 47, i32 999)
; CHECK-NEXT: [[CALL3:%.*]] = tail call i32 @f2(i32 47)
; CHECK-NEXT: [[CALL4:%.*]] = tail call i32 @f2(i32 301)
; CHECK-NEXT: [[RES_1:%.*]] = add nuw nsw i32 12, [[CALL3]]
; CHECK-NEXT: [[RES_2:%.*]] = add nuw nsw i32 [[RES_1]], [[CALL4]]
; CHECK-NEXT: ret i32 [[RES_2]]
;
entry:
%call1 = tail call i32 @f1(i32 1, i32 301)
%call2 = tail call i32 @f1(i32 47, i32 999)
%call3 = tail call i32 @f2(i32 47)
%call4 = tail call i32 @f2(i32 301)
%res.1 = add nsw i32 12, %call3
%res.2 = add nsw i32 %res.1, %call4
ret i32 %res.2
}
define internal i32 @f3(i32 %x) {
; CHECK-LABEL: define {{[^@]+}}@f3
; CHECK-SAME: (i32 [[X:%.*]]) {
; CHECK-NEXT: entry:
; CHECK-NEXT: ret i32 undef
;
entry:
%cmp = icmp sgt i32 %x, 300
%res = select i1 %cmp, i32 1, i32 2
ret i32 %res
}
; The phi node could be converted in a ConstantRange.
define i32 @caller2(i1 %cmp) {
; CHECK-LABEL: define {{[^@]+}}@caller2
; CHECK-SAME: (i1 [[CMP:%.*]]) {
; CHECK-NEXT: entry:
; CHECK-NEXT: br i1 [[CMP]], label [[IF_TRUE:%.*]], label [[END:%.*]]
; CHECK: if.true:
; CHECK-NEXT: br label [[END]]
; CHECK: end:
; CHECK-NEXT: [[RES:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ 1, [[IF_TRUE]] ]
; CHECK-NEXT: [[CALL1:%.*]] = tail call i32 @f3(i32 [[RES]])
; CHECK-NEXT: ret i32 2
;
entry:
br i1 %cmp, label %if.true, label %end
if.true:
br label %end
end:
%res = phi i32 [ 0, %entry], [ 1, %if.true ]
%call1 = tail call i32 @f3(i32 %res)
ret i32 2
}
define internal i32 @f4(i32 %x) {
; CHECK-LABEL: define {{[^@]+}}@f4
; CHECK-SAME: (i32 [[X:%.*]]) {
; CHECK-NEXT: entry:
; CHECK-NEXT: ret i32 undef
;
entry:
%cmp = icmp sgt i32 %x, 300
%res = select i1 %cmp, i32 1, i32 2
ret i32 %res
}
; ICmp introduces bounds on ConstantRanges.
define i32 @caller3(i32 %x) {
; CHECK-LABEL: define {{[^@]+}}@caller3
; CHECK-SAME: (i32 [[X:%.*]]) {
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMP:%.*]] = icmp sgt i32 [[X]], 300
; CHECK-NEXT: br i1 [[CMP]], label [[IF_TRUE:%.*]], label [[END:%.*]]
; CHECK: if.true:
; CHECK-NEXT: [[X_1:%.*]] = tail call i32 @f4(i32 [[X]])
; CHECK-NEXT: br label [[END]]
; CHECK: end:
; CHECK-NEXT: [[RES:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ 1, [[IF_TRUE]] ]
; CHECK-NEXT: ret i32 [[RES]]
;
entry:
%cmp = icmp sgt i32 %x, 300
br i1 %cmp, label %if.true, label %end
if.true:
%x.1 = tail call i32 @f4(i32 %x)
br label %end
end:
%res = phi i32 [ 0, %entry], [ %x.1, %if.true ]
ret i32 %res
}
; Check to make sure we do not attempt to access lattice values in unreachable
; blocks.
define i32 @test_unreachable() {
; CHECK-LABEL: define {{[^@]+}}@test_unreachable() {
; CHECK-NEXT: entry:
; CHECK-NEXT: [[TMP0:%.*]] = call i1 @test_unreachable_callee(i32 1)
; CHECK-NEXT: [[TMP1:%.*]] = call i1 @test_unreachable_callee(i32 2)
; CHECK-NEXT: ret i32 1
;
entry:
call i1 @test_unreachable_callee(i32 1)
call i1 @test_unreachable_callee(i32 2)
ret i32 1
}
define internal i1 @test_unreachable_callee(i32 %a) {
; CHECK-LABEL: define {{[^@]+}}@test_unreachable_callee
; CHECK-SAME: (i32 [[A:%.*]]) {
; CHECK-NEXT: entry:
; CHECK-NEXT: ret i1 undef
;
entry:
ret i1 true
unreachablebb:
%cmp = icmp eq i32 undef, %a
unreachable
}
; Check that we do not attempt to get range info for non-integer types and
; crash.
define double @test_struct({ double, double } %test) {
; CHECK-LABEL: define {{[^@]+}}@test_struct
; CHECK-SAME: ({ double, double } [[TEST:%.*]]) {
; CHECK-NEXT: [[V:%.*]] = extractvalue { double, double } [[TEST]], 0
; CHECK-NEXT: [[R:%.*]] = fmul double [[V]], [[V]]
; CHECK-NEXT: ret double [[R]]
;
%v = extractvalue { double, double } %test, 0
%r = fmul double %v, %v
ret double %r
}
; Constant range for %x is [47, 302)
define internal i32 @f5(i32 %x) {
; CHECK-LABEL: define {{[^@]+}}@f5
; CHECK-SAME: (i32 [[X:%.*]]) {
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMP:%.*]] = icmp sgt i32 [[X]], undef
; CHECK-NEXT: [[CMP2:%.*]] = icmp ne i32 undef, [[X]]
; CHECK-NEXT: [[RES1:%.*]] = select i1 [[CMP]], i32 1, i32 2
; CHECK-NEXT: [[RES2:%.*]] = select i1 [[CMP2]], i32 3, i32 4
; CHECK-NEXT: [[RES:%.*]] = add i32 [[RES1]], [[RES2]]
; CHECK-NEXT: ret i32 [[RES]]
;
entry:
%cmp = icmp sgt i32 %x, undef
%cmp2 = icmp ne i32 undef, %x
%res1 = select i1 %cmp, i32 1, i32 2
%res2 = select i1 %cmp2, i32 3, i32 4
%res = add i32 %res1, %res2
ret i32 %res
}
define i32 @caller4() {
; CHECK-LABEL: define {{[^@]+}}@caller4() {
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CALL1:%.*]] = tail call i32 @f5(i32 47)
; CHECK-NEXT: [[CALL2:%.*]] = tail call i32 @f5(i32 301)
; CHECK-NEXT: [[RES:%.*]] = add nsw i32 [[CALL1]], [[CALL2]]
; CHECK-NEXT: ret i32 [[RES]]
;
entry:
%call1 = tail call i32 @f5(i32 47)
%call2 = tail call i32 @f5(i32 301)
%res = add nsw i32 %call1, %call2
ret i32 %res
}
; Make sure we do re-evaluate the function after ParamState changes.
define internal i32 @recursive_f(i32 %i) {
; CHECK-LABEL: define {{[^@]+}}@recursive_f
; CHECK-SAME: (i32 [[I:%.*]]) {
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CMP:%.*]] = icmp eq i32 [[I]], 0
; CHECK-NEXT: br i1 [[CMP]], label [[IF_THEN:%.*]], label [[IF_ELSE:%.*]]
; CHECK: if.then:
; CHECK-NEXT: br label [[RETURN:%.*]]
; CHECK: if.else:
; CHECK-NEXT: [[SUB:%.*]] = sub nuw nsw i32 [[I]], 1
; CHECK-NEXT: [[CALL:%.*]] = call i32 @recursive_f(i32 [[SUB]])
; CHECK-NEXT: [[ADD:%.*]] = add i32 [[I]], [[CALL]]
; CHECK-NEXT: br label [[RETURN]]
; CHECK: return:
; CHECK-NEXT: [[RETVAL_0:%.*]] = phi i32 [ 0, [[IF_THEN]] ], [ [[ADD]], [[IF_ELSE]] ]
; CHECK-NEXT: ret i32 [[RETVAL_0]]
;
entry:
%cmp = icmp eq i32 %i, 0
br i1 %cmp, label %if.then, label %if.else
if.then: ; preds = %entry
br label %return
if.else: ; preds = %entry
%sub = sub nsw i32 %i, 1
%call = call i32 @recursive_f(i32 %sub)
%add = add i32 %i, %call
br label %return
return: ; preds = %if.else, %if.then
%retval.0 = phi i32 [ 0, %if.then ], [ %add, %if.else ]
ret i32 %retval.0
}
define i32 @caller5() {
; CHECK-LABEL: define {{[^@]+}}@caller5() {
; CHECK-NEXT: entry:
; CHECK-NEXT: [[CALL:%.*]] = call i32 @recursive_f(i32 42)
; CHECK-NEXT: ret i32 [[CALL]]
;
entry:
%call = call i32 @recursive_f(i32 42)
ret i32 %call
}
define internal i32 @callee6.1(i32 %i) {
; CHECK-LABEL: define {{[^@]+}}@callee6.1
; CHECK-SAME: (i32 [[I:%.*]]) {
; CHECK-NEXT: [[RES:%.*]] = call i32 @callee6.2(i32 [[I]])
; CHECK-NEXT: ret i32 undef
;
%res = call i32 @callee6.2(i32 %i)
ret i32 %res
}
define internal i32 @callee6.2(i32 %i) {
; CHECK-LABEL: define {{[^@]+}}@callee6.2
; CHECK-SAME: (i32 [[I:%.*]]) {
; CHECK-NEXT: br label [[IF_THEN:%.*]]
; CHECK: if.then:
; CHECK-NEXT: ret i32 undef
;
%cmp = icmp ne i32 %i, 0
br i1 %cmp, label %if.then, label %if.else
if.then: ; preds = %entry
ret i32 1
if.else: ; preds = %entry
ret i32 2
}
define i32 @caller6() {
; CHECK-LABEL: define {{[^@]+}}@caller6() {
; CHECK-NEXT: [[CALL_1:%.*]] = call i32 @callee6.1(i32 30)
; CHECK-NEXT: [[CALL_2:%.*]] = call i32 @callee6.1(i32 43)
; CHECK-NEXT: ret i32 2
;
%call.1 = call i32 @callee6.1(i32 30)
%call.2 = call i32 @callee6.1(i32 43)
%res = add i32 %call.1, %call.2
ret i32 %res
}