diff options
Diffstat (limited to 'llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll')
| -rw-r--r-- | llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll | 104 |
1 files changed, 104 insertions, 0 deletions
diff --git a/llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll b/llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll new file mode 100644 index 00000000000..2657982979d --- /dev/null +++ b/llvm/test/Analysis/ScalarEvolution/smax-br-phi-idioms.ll @@ -0,0 +1,104 @@ +; RUN: opt -analyze -scalar-evolution < %s | FileCheck %s + +define i32 @f0(i32 %x, i32 %y) { +; CHECK-LABEL: Classifying expressions for: @f0 + entry: + %c = icmp sgt i32 %y, 0 + br i1 %c, label %add, label %merge + + add: + %sum = add i32 %x, %y + br label %merge + + merge: + %v = phi i32 [ %sum, %add ], [ %x, %entry ] +; CHECK: %v = phi i32 [ %sum, %add ], [ %x, %entry ] +; CHECK-NEXT: --> ((0 smax %y) + %x) U: full-set S: full-set + ret i32 %v +} + +define i32 @f1(i32 %x, i32 %y) { +; CHECK-LABEL: Classifying expressions for: @f1 + entry: + %c = icmp sge i32 %y, 0 + br i1 %c, label %add, label %merge + + add: + %sum = add i32 %x, %y + br label %merge + + merge: + %v = phi i32 [ %sum, %add ], [ %x, %entry ] +; CHECK: %v = phi i32 [ %sum, %add ], [ %x, %entry ] +; CHECK-NEXT: --> ((0 smax %y) + %x) U: full-set S: full-set + ret i32 %v +} + +define i32 @f2(i32 %x, i32 %y, i32* %ptr) { +; CHECK-LABEL: Classifying expressions for: @f2 + entry: + %c = icmp sge i32 %y, 0 + br i1 %c, label %add, label %merge + + add: + %lv = load i32, i32* %ptr + br label %merge + + merge: + %v = phi i32 [ %lv, %add ], [ %x, %entry ] +; CHECK: %v = phi i32 [ %lv, %add ], [ %x, %entry ] +; CHECK-NEXT: --> %v U: full-set S: full-set + ret i32 %v +} + +define i32 @f3(i32 %x, i32 %init, i32 %lim) { +; CHECK-LABEL: Classifying expressions for: @f3 + entry: + br label %loop + +loop: + %iv = phi i32 [ %init, %entry ], [ %iv.inc, %merge ] + %iv.inc = add i32 %iv, 1 + %c = icmp sge i32 %iv, 0 + br i1 %c, label %add, label %merge + + add: + %sum = add i32 %x, %iv + br label %merge + + merge: + %v = phi i32 [ %sum, %add ], [ %x, %loop ] +; CHECK: %v = phi i32 [ %sum, %add ], [ %x, %loop ] +; CHECK-NEXT: --> ((0 smax {%init,+,1}<%loop>) + %x) U: full-set S: full-set + %be.cond = icmp eq i32 %iv.inc, %lim + br i1 %be.cond, label %loop, label %leave + + leave: + ret i32 0 +} + +define i32 @f4(i32 %x, i32 %init, i32 %lim) { +; CHECK-LABEL: Classifying expressions for: @f4 + entry: + %c = icmp sge i32 %init, 0 + br i1 %c, label %add, label %merge + + add: + br label %loop + + loop: + %iv = phi i32 [ %init, %add ], [ %iv.inc, %loop ] + %iv.inc = add i32 %iv, 1 + %be.cond = icmp eq i32 %iv.inc, %lim + br i1 %be.cond, label %loop, label %add.cont + + add.cont: + %sum = add i32 %x, %iv + br label %merge + + merge: + %v = phi i32 [ %sum, %add.cont ], [ %x, %entry ] +; CHECK: %v = phi i32 [ %sum, %add.cont ], [ %x, %entry ] +; CHECK-NEXT: --> %v U: full-set S: full-set + ret i32 %v +} |

