maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/llvm/test/Analysis/ScalarEvolution/umin-umax-folds.ll

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

319 lines
16 KiB
LLVM
Raw Normal View History

[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
[SCEV] Fix ScalarEvolution tests under NPM Many tests use opt's -analyze feature, which does not translate well to NPM and has better alternatives. The alternative here is to explicitly add a pass that calls ScalarEvolution::print(). The legacy pass manager RUNs aren't changing, but they are now pinned to the legacy pass manager. For each legacy pass manager RUN, I added a corresponding NPM RUN using the 'print<scalar-evolution>' pass. For compatibility with update_analyze_test_checks.py and existing test CHECKs, 'print<scalar-evolution>' now prints what -analyze prints per function. This was generated by the following Python script and failures were manually fixed up: import sys for i in sys.argv: with open(i, 'r') as f: s = f.read() with open(i, 'w') as f: for l in s.splitlines(): if "RUN:" in l and ' -analyze ' in l and '\\' not in l: f.write(l.replace(' -analyze ', ' -analyze -enable-new-pm=0 ')) f.write('\n') f.write(l.replace(' -analyze ', ' -disable-output ').replace(' -scalar-evolution ', ' "-passes=print<scalar-evolution>" ').replace(" | ", " 2>&1 | ")) f.write('\n') else: f.write(l) There are a couple failures still in ScalarEvolution under NPM, but those are due to other unrelated naming conflicts. Reviewed By: asbirlea Differential Revision: https://reviews.llvm.org/D83798
2020-07-17 02:09:47 +08:00
; RUN: opt -analyze -enable-new-pm=0 -scalar-evolution < %s | FileCheck %s
; RUN: opt -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
define void @umin_sext_x_zext_x(i32 %len) {
; CHECK-LABEL: 'umin_sext_x_zext_x'
; CHECK-NEXT: Classifying expressions for: @umin_sext_x_zext_x
; CHECK-NEXT: %len.zext = zext i32 %len to i64
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296)
; CHECK-NEXT: %len.sext = sext i32 %len to i64
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648)
; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %iv.next = add i64 %iv, 1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4294967297) S: [1,4294967297) Exits: (1 + (zext i32 %len to i64))<nuw><nsw> LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %and = and i1 %cmp1, %cmp2
; CHECK-NEXT: --> %and U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT: Determining loop execution counts for: @umin_sext_x_zext_x
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Loop %loop: max backedge-taken count is 4294967295
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
%len.sext = sext i32 %len to i64
br label %loop
loop:
%iv = phi i64 [0, %entry], [%iv.next, %loop]
%iv.next = add i64 %iv, 1
%cmp1 = icmp ult i64 %iv, %len.zext
%cmp2 = icmp ult i64 %iv, %len.sext
%and = and i1 %cmp1, %cmp2
br i1 %and, label %loop, label %exit
exit:
ret void
}
define void @ule_sext_x_zext_x(i32 %len) {
; CHECK-LABEL: 'ule_sext_x_zext_x'
; CHECK-NEXT: Classifying expressions for: @ule_sext_x_zext_x
; CHECK-NEXT: %len.zext = zext i32 %len to i64
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296)
; CHECK-NEXT: %len.sext = sext i32 %len to i64
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648)
; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %iv.next = add i64 %iv, 1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4294967297) S: [1,4294967297) Exits: (1 + (zext i32 %len to i64))<nuw><nsw> LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %sel = select i1 %cmp1, i64 %len.zext, i64 %len.sext
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Invariant }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Determining loop execution counts for: @ule_sext_x_zext_x
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Loop %loop: max backedge-taken count is 4294967295
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
%len.sext = sext i32 %len to i64
br label %loop
loop:
%iv = phi i64 [0, %entry], [%iv.next, %loop]
%iv.next = add i64 %iv, 1
%cmp1 = icmp ule i64 %len.zext, %len.sext
%sel = select i1 %cmp1, i64 %len.zext, i64 %len.sext
%cmp2 = icmp ult i64 %iv, %sel
br i1 %cmp2, label %loop, label %exit
exit:
ret void
}
define void @uge_sext_x_zext_x(i32 %len) {
; CHECK-LABEL: 'uge_sext_x_zext_x'
; CHECK-NEXT: Classifying expressions for: @uge_sext_x_zext_x
; CHECK-NEXT: %len.zext = zext i32 %len to i64
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296)
; CHECK-NEXT: %len.sext = sext i32 %len to i64
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648)
; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {0,+,1}<%loop> U: full-set S: full-set Exits: (sext i32 %len to i64) LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %iv.next = add i64 %iv, 1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {1,+,1}<%loop> U: full-set S: full-set Exits: (1 + (sext i32 %len to i64))<nsw> LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %sel = select i1 %cmp1, i64 %len.zext, i64 %len.sext
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648) Exits: (sext i32 %len to i64) LoopDispositions: { %loop: Invariant }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Determining loop execution counts for: @uge_sext_x_zext_x
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: backedge-taken count is (sext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (sext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
%len.sext = sext i32 %len to i64
br label %loop
loop:
%iv = phi i64 [0, %entry], [%iv.next, %loop]
%iv.next = add i64 %iv, 1
%cmp1 = icmp uge i64 %len.zext, %len.sext
%sel = select i1 %cmp1, i64 %len.zext, i64 %len.sext
%cmp2 = icmp ult i64 %iv, %sel
br i1 %cmp2, label %loop, label %exit
exit:
ret void
}
define void @ult_sext_x_zext_x(i32 %len) {
; CHECK-LABEL: 'ult_sext_x_zext_x'
; CHECK-NEXT: Classifying expressions for: @ult_sext_x_zext_x
; CHECK-NEXT: %len.zext = zext i32 %len to i64
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296)
; CHECK-NEXT: %len.sext = sext i32 %len to i64
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648)
; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %iv.next = add i64 %iv, 1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4294967297) S: [1,4294967297) Exits: (1 + (zext i32 %len to i64))<nuw><nsw> LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %umin = select i1 %cmp1, i64 %len.zext, i64 %len.sext
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Invariant }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Determining loop execution counts for: @ult_sext_x_zext_x
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Loop %loop: max backedge-taken count is 4294967295
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
%len.sext = sext i32 %len to i64
br label %loop
loop:
%iv = phi i64 [0, %entry], [%iv.next, %loop]
%iv.next = add i64 %iv, 1
%cmp1 = icmp ult i64 %len.zext, %len.sext
%umin = select i1 %cmp1, i64 %len.zext, i64 %len.sext
%cmp2 = icmp ult i64 %iv, %umin
br i1 %cmp2, label %loop, label %exit
exit:
ret void
}
define void @ugt_sext_x_zext_x(i32 %len) {
; CHECK-LABEL: 'ugt_sext_x_zext_x'
; CHECK-NEXT: Classifying expressions for: @ugt_sext_x_zext_x
; CHECK-NEXT: %len.zext = zext i32 %len to i64
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296)
; CHECK-NEXT: %len.sext = sext i32 %len to i64
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648)
; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {0,+,1}<%loop> U: full-set S: full-set Exits: (sext i32 %len to i64) LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %iv.next = add i64 %iv, 1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {1,+,1}<%loop> U: full-set S: full-set Exits: (1 + (sext i32 %len to i64))<nsw> LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %umax = select i1 %cmp1, i64 %len.zext, i64 %len.sext
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648) Exits: (sext i32 %len to i64) LoopDispositions: { %loop: Invariant }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Determining loop execution counts for: @ugt_sext_x_zext_x
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: backedge-taken count is (sext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (sext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
%len.sext = sext i32 %len to i64
br label %loop
loop:
%iv = phi i64 [0, %entry], [%iv.next, %loop]
%iv.next = add i64 %iv, 1
%cmp1 = icmp ugt i64 %len.zext, %len.sext
%umax = select i1 %cmp1, i64 %len.zext, i64 %len.sext
%cmp2 = icmp ult i64 %iv, %umax
br i1 %cmp2, label %loop, label %exit
exit:
ret void
}
define void @sle_sext_x_zext_x(i32 %len) {
; CHECK-LABEL: 'sle_sext_x_zext_x'
; CHECK-NEXT: Classifying expressions for: @sle_sext_x_zext_x
; CHECK-NEXT: %len.zext = zext i32 %len to i64
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296)
; CHECK-NEXT: %len.sext = sext i32 %len to i64
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648)
; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %iv.next = add i64 %iv, 1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4294967297) S: [1,4294967297) Exits: (1 + (zext i32 %len to i64))<nuw><nsw> LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %sel = select i1 %cmp1, i64 %len.zext, i64 %len.sext
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Invariant }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Determining loop execution counts for: @sle_sext_x_zext_x
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Loop %loop: max backedge-taken count is 4294967295
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
%len.sext = sext i32 %len to i64
br label %loop
loop:
%iv = phi i64 [0, %entry], [%iv.next, %loop]
%iv.next = add i64 %iv, 1
%cmp1 = icmp ule i64 %len.zext, %len.sext
%sel = select i1 %cmp1, i64 %len.zext, i64 %len.sext
%cmp2 = icmp ult i64 %iv, %sel
br i1 %cmp2, label %loop, label %exit
exit:
ret void
}
define void @sge_sext_x_zext_x(i32 %len) {
; CHECK-LABEL: 'sge_sext_x_zext_x'
; CHECK-NEXT: Classifying expressions for: @sge_sext_x_zext_x
; CHECK-NEXT: %len.zext = zext i32 %len to i64
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296)
; CHECK-NEXT: %len.sext = sext i32 %len to i64
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648)
; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %iv.next = add i64 %iv, 1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4294967297) S: [1,4294967297) Exits: (1 + (zext i32 %len to i64))<nuw><nsw> LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %sel = select i1 %cmp1, i64 %len.zext, i64 %len.sext
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Invariant }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Determining loop execution counts for: @sge_sext_x_zext_x
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Loop %loop: max backedge-taken count is 4294967295
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
%len.sext = sext i32 %len to i64
br label %loop
loop:
%iv = phi i64 [0, %entry], [%iv.next, %loop]
%iv.next = add i64 %iv, 1
%cmp1 = icmp sge i64 %len.zext, %len.sext
%sel = select i1 %cmp1, i64 %len.zext, i64 %len.sext
%cmp2 = icmp ult i64 %iv, %sel
br i1 %cmp2, label %loop, label %exit
exit:
ret void
}
define void @slt_sext_x_zext_x(i32 %len) {
; CHECK-LABEL: 'slt_sext_x_zext_x'
; CHECK-NEXT: Classifying expressions for: @slt_sext_x_zext_x
; CHECK-NEXT: %len.zext = zext i32 %len to i64
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296)
; CHECK-NEXT: %len.sext = sext i32 %len to i64
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648)
; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {0,+,1}<%loop> U: full-set S: full-set Exits: (sext i32 %len to i64) LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %iv.next = add i64 %iv, 1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {1,+,1}<%loop> U: full-set S: full-set Exits: (1 + (sext i32 %len to i64))<nsw> LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %umin = select i1 %cmp1, i64 %len.zext, i64 %len.sext
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648) Exits: (sext i32 %len to i64) LoopDispositions: { %loop: Invariant }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Determining loop execution counts for: @slt_sext_x_zext_x
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: backedge-taken count is (sext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (sext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
%len.sext = sext i32 %len to i64
br label %loop
loop:
%iv = phi i64 [0, %entry], [%iv.next, %loop]
%iv.next = add i64 %iv, 1
%cmp1 = icmp slt i64 %len.zext, %len.sext
%umin = select i1 %cmp1, i64 %len.zext, i64 %len.sext
%cmp2 = icmp ult i64 %iv, %umin
br i1 %cmp2, label %loop, label %exit
exit:
ret void
}
define void @sgt_sext_x_zext_x(i32 %len) {
; CHECK-LABEL: 'sgt_sext_x_zext_x'
; CHECK-NEXT: Classifying expressions for: @sgt_sext_x_zext_x
; CHECK-NEXT: %len.zext = zext i32 %len to i64
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296)
; CHECK-NEXT: %len.sext = sext i32 %len to i64
; CHECK-NEXT: --> (sext i32 %len to i64) U: [-2147483648,2147483648) S: [-2147483648,2147483648)
; CHECK-NEXT: %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {0,+,1}<%loop> U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %iv.next = add i64 %iv, 1
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> {1,+,1}<%loop> U: [1,4294967297) S: [1,4294967297) Exits: (1 + (zext i32 %len to i64))<nuw><nsw> LoopDispositions: { %loop: Computable }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: %umax = select i1 %cmp1, i64 %len.zext, i64 %len.sext
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: --> (zext i32 %len to i64) U: [0,4294967296) S: [0,4294967296) Exits: (zext i32 %len to i64) LoopDispositions: { %loop: Invariant }
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Determining loop execution counts for: @sgt_sext_x_zext_x
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Loop %loop: max backedge-taken count is 4294967295
[SCEV] Simplify umin/max of zext and sext of the same value This is a common idiom which arises after induction variables are widened, and we have two or more exit conditions. Interestingly, we don't have instcombine or instsimplify support for this either. Differential Revision: https://reviews.llvm.org/D69006 llvm-svn: 375349
2019-10-20 01:23:02 +08:00
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
[Test] Precommit test for D69006 llvm-svn: 375190
2019-10-18 07:32:35 +08:00
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
%len.sext = sext i32 %len to i64
br label %loop
loop:
%iv = phi i64 [0, %entry], [%iv.next, %loop]
%iv.next = add i64 %iv, 1
%cmp1 = icmp sgt i64 %len.zext, %len.sext
%umax = select i1 %cmp1, i64 %len.zext, i64 %len.sext
%cmp2 = icmp ult i64 %iv, %umax
br i1 %cmp2, label %loop, label %exit
exit:
ret void
}