maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/llvm/test/Transforms/IndVarSimplify/checks_against_min_value.ll

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

88 lines
2.7 KiB
LLVM
Raw Normal View History

[Test] Missing range check removal opportunity
2020-09-18 18:38:08 +08:00
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -indvars -S | FileCheck %s
; RUN: opt < %s -passes=indvars -S | FileCheck %s
define void @test_signed(i32 %start) {
; CHECK-LABEL: @test_signed(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[COND:%.*]] = icmp ne i32 [[START:%.*]], -2147483648
; CHECK-NEXT: br i1 [[COND]], label [[LOOP_PREHEADER:%.*]], label [[EXIT:%.*]]
; CHECK: loop.preheader:
; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop:
; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[IV_NEXT:%.*]], [[GUARDED:%.*]] ], [ [[START]], [[LOOP_PREHEADER]] ]
; CHECK-NEXT: [[IV_NEXT]] = add i32 [[IV]], -1
; CHECK-NEXT: [[CHECK:%.*]] = icmp slt i32 [[IV_NEXT]], [[IV]]
; CHECK-NEXT: br i1 [[CHECK]], label [[GUARDED]], label [[FAIL:%.*]]
; CHECK: guarded:
[IndVars] Provide eliminateIVComparison with context We can prove more predicates when we have a context when eliminating ICmp. As first (and very obvious) approximation we can use the ICmp instruction itself, though in the future we are going to use a common dominator of all its users. Need some refactoring before that. Observed ~0.5% negative compile time impact. Differential Revision: https://reviews.llvm.org/D98697 Reviewed By: lebedev.ri
2021-03-19 13:00:06 +08:00
; CHECK-NEXT: br i1 true, label [[LOOP]], label [[EXIT_LOOPEXIT:%.*]]
[Test] Missing range check removal opportunity
2020-09-18 18:38:08 +08:00
; CHECK: exit.loopexit:
; CHECK-NEXT: br label [[EXIT]]
; CHECK: exit:
; CHECK-NEXT: ret void
; CHECK: fail:
; CHECK-NEXT: unreachable
;
entry:
%cond = icmp ne i32 %start, -2147483648
br i1 %cond, label %loop, label %exit
loop:
%iv = phi i32 [%start, %entry], [%iv.next, %guarded]
%iv.next = add i32 %iv, -1
%check = icmp slt i32 %iv.next, %iv
br i1 %check, label %guarded, label %fail
guarded:
%loop.cond = icmp ne i32 %iv, -2147483648
br i1 %loop.cond, label %loop, label %exit
exit:
ret void
fail:
unreachable
}
define void @test_unsigned(i32 %start) {
; CHECK-LABEL: @test_unsigned(
; CHECK-NEXT: entry:
; CHECK-NEXT: [[COND:%.*]] = icmp ne i32 [[START:%.*]], 0
; CHECK-NEXT: br i1 [[COND]], label [[LOOP_PREHEADER:%.*]], label [[EXIT:%.*]]
; CHECK: loop.preheader:
; CHECK-NEXT: br label [[LOOP:%.*]]
; CHECK: loop:
; CHECK-NEXT: [[IV:%.*]] = phi i32 [ [[IV_NEXT:%.*]], [[GUARDED:%.*]] ], [ [[START]], [[LOOP_PREHEADER]] ]
; CHECK-NEXT: [[IV_NEXT]] = add i32 [[IV]], -1
; CHECK-NEXT: [[CHECK:%.*]] = icmp ult i32 [[IV_NEXT]], [[IV]]
; CHECK-NEXT: br i1 [[CHECK]], label [[GUARDED]], label [[FAIL:%.*]]
; CHECK: guarded:
[IndVars] Provide eliminateIVComparison with context We can prove more predicates when we have a context when eliminating ICmp. As first (and very obvious) approximation we can use the ICmp instruction itself, though in the future we are going to use a common dominator of all its users. Need some refactoring before that. Observed ~0.5% negative compile time impact. Differential Revision: https://reviews.llvm.org/D98697 Reviewed By: lebedev.ri
2021-03-19 13:00:06 +08:00
; CHECK-NEXT: br i1 true, label [[LOOP]], label [[EXIT_LOOPEXIT:%.*]]
[Test] Missing range check removal opportunity
2020-09-18 18:38:08 +08:00
; CHECK: exit.loopexit:
; CHECK-NEXT: br label [[EXIT]]
; CHECK: exit:
; CHECK-NEXT: ret void
; CHECK: fail:
; CHECK-NEXT: unreachable
;
entry:
%cond = icmp ne i32 %start, 0
br i1 %cond, label %loop, label %exit
loop:
%iv = phi i32 [%start, %entry], [%iv.next, %guarded]
%iv.next = add i32 %iv, -1
%check = icmp ult i32 %iv.next, %iv
br i1 %check, label %guarded, label %fail
guarded:
%loop.cond = icmp ne i32 %iv, 0
br i1 %loop.cond, label %loop, label %exit
exit:
ret void
fail:
unreachable
}