|
| 1 | +; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5 |
| 2 | +; RUN: opt -passes='print<scalar-evolution>' -scalar-evolution-classify-expressions=0 -disable-output %s 2>&1 | FileCheck %s |
| 3 | + |
| 4 | +; %i and %i + 1 can overflow. |
| 5 | +define void @test1(i64 %x, ptr %a, ptr %b) { |
| 6 | +; CHECK-LABEL: 'test1' |
| 7 | +; CHECK-NEXT: Determining loop execution counts for: @test1 |
| 8 | +; CHECK-NEXT: Loop %header: <multiple exits> Unpredictable backedge-taken count. |
| 9 | +; CHECK-NEXT: exit count for header: ***COULDNOTCOMPUTE*** |
| 10 | +; CHECK-NEXT: exit count for latch: ***COULDNOTCOMPUTE*** |
| 11 | +; CHECK-NEXT: Loop %header: Unpredictable constant max backedge-taken count. |
| 12 | +; CHECK-NEXT: Loop %header: Unpredictable symbolic max backedge-taken count. |
| 13 | +; CHECK-NEXT: symbolic max exit count for header: ***COULDNOTCOMPUTE*** |
| 14 | +; CHECK-NEXT: symbolic max exit count for latch: ***COULDNOTCOMPUTE*** |
| 15 | +; |
| 16 | +entry: |
| 17 | + br label %header |
| 18 | + |
| 19 | +header: |
| 20 | + %conv11 = phi i64 [ 0, %entry ], [ %conv, %latch ] |
| 21 | + %i.010 = phi i32 [ 0, %entry ], [ %add, %latch ] |
| 22 | + %add = add i32 %i.010, 1 |
| 23 | + %idxprom = zext i32 %add to i64 |
| 24 | + %arrayidx = getelementptr inbounds i32, ptr %a, i64 %idxprom |
| 25 | + %ld = load i32, ptr %arrayidx, align 4 |
| 26 | + %uncountable.c = icmp eq i32 %ld, 10 |
| 27 | + br i1 %uncountable.c, label %exit, label %latch |
| 28 | + |
| 29 | +latch: |
| 30 | + %add2 = add nsw i32 %ld, 1 |
| 31 | + %arrayidx4 = getelementptr inbounds i32, ptr %b, i64 %conv11 |
| 32 | + store i32 %add2, ptr %arrayidx4, align 4 |
| 33 | + %conv = zext i32 %add to i64 |
| 34 | + %cmp = icmp ult i64 %conv, %x |
| 35 | + br i1 %cmp, label %header, label %exit |
| 36 | + |
| 37 | +exit: |
| 38 | + ret void |
| 39 | +} |
| 40 | + |
| 41 | +; %i can overflow. |
| 42 | +; |
| 43 | +; We need to check that i doesn't wrap, but we don't need a run-time alias |
| 44 | +; check. We also need an extra no-wrap check to get the backedge taken count. |
| 45 | +define void @test2(i64 %x, ptr %a) { |
| 46 | +; CHECK-LABEL: 'test2' |
| 47 | +; CHECK-NEXT: Determining loop execution counts for: @test2 |
| 48 | +; CHECK-NEXT: Loop %header: <multiple exits> Unpredictable backedge-taken count. |
| 49 | +; CHECK-NEXT: exit count for header: ***COULDNOTCOMPUTE*** |
| 50 | +; CHECK-NEXT: exit count for latch: ***COULDNOTCOMPUTE*** |
| 51 | +; CHECK-NEXT: Loop %header: Unpredictable constant max backedge-taken count. |
| 52 | +; CHECK-NEXT: Loop %header: Unpredictable symbolic max backedge-taken count. |
| 53 | +; CHECK-NEXT: symbolic max exit count for header: ***COULDNOTCOMPUTE*** |
| 54 | +; CHECK-NEXT: symbolic max exit count for latch: ***COULDNOTCOMPUTE*** |
| 55 | +; |
| 56 | +entry: |
| 57 | + br label %header |
| 58 | + |
| 59 | +header: |
| 60 | + %conv11 = phi i64 [ 0, %entry ], [ %conv, %latch ] |
| 61 | + %i.010 = phi i32 [ 0, %entry ], [ %inc, %latch ] |
| 62 | + %arrayidx = getelementptr inbounds i32, ptr %a, i64 %conv11 |
| 63 | + %ld = load i32, ptr %arrayidx, align 4 |
| 64 | + %uncountable.c = icmp eq i32 %ld, 10 |
| 65 | + br i1 %uncountable.c, label %exit, label %latch |
| 66 | + |
| 67 | +latch: |
| 68 | + %add = add nsw i32 %ld, 1 |
| 69 | + store i32 %add, ptr %arrayidx, align 4 |
| 70 | + %inc = add i32 %i.010, 1 |
| 71 | + %conv = zext i32 %inc to i64 |
| 72 | + %cmp = icmp ult i64 %conv, %x |
| 73 | + br i1 %cmp, label %header, label %exit |
| 74 | + |
| 75 | +exit: |
| 76 | + ret void |
| 77 | +} |
0 commit comments