Arthur Eubanks | 9adbb5c | 2020-07-16 11:09:47 -0700 | [diff] [blame] | 1 | ; RUN: opt -analyze -enable-new-pm=0 -scalar-evolution -S < %s | FileCheck %s |
| 2 | ; RUN: opt -disable-output "-passes=print<scalar-evolution>" -S < %s 2>&1 | FileCheck %s |
Krzysztof Parzyszek | 90f3249 | 2018-08-02 19:13:35 +0000 | [diff] [blame] | 3 | |
| 4 | ; The exit value from this loop was originally calculated as 0. |
| 5 | ; The actual exit condition is 256*256 == 0 (in i16). |
| 6 | |
| 7 | ; CHECK: Printing analysis 'Scalar Evolution Analysis' for function 'f0': |
| 8 | ; CHECK-NEXT: Classifying expressions for: @f0 |
| 9 | ; CHECK-NEXT: %v1 = phi i16 [ 0, %b0 ], [ %v2, %b1 ] |
| 10 | ; CHECK-NEXT: --> {0,+,-1}<%b1> U: [-255,1) S: [-255,1) Exits: -255 LoopDispositions: { %b1: Computable } |
| 11 | ; CHECK-NEXT: %v2 = add i16 %v1, -1 |
| 12 | ; CHECK-NEXT: --> {-1,+,-1}<%b1> U: [-256,0) S: [-256,0) Exits: -256 LoopDispositions: { %b1: Computable } |
| 13 | ; CHECK-NEXT: %v3 = mul i16 %v2, %v2 |
| 14 | ; CHECK-NEXT: --> {1,+,3,+,2}<%b1> U: full-set S: full-set Exits: 0 LoopDispositions: { %b1: Computable } |
| 15 | ; CHECK-NEXT: %v5 = phi i16 [ %v2, %b1 ] |
Fangrui Song | 8fdac7c | 2020-09-21 17:18:26 -0700 | [diff] [blame] | 16 | ; CHECK-NEXT: --> %v5 U: [-256,0) S: [-256,0) |
Krzysztof Parzyszek | 90f3249 | 2018-08-02 19:13:35 +0000 | [diff] [blame] | 17 | ; CHECK-NEXT: %v6 = phi i16 [ %v3, %b1 ] |
Fangrui Song | 8fdac7c | 2020-09-21 17:18:26 -0700 | [diff] [blame] | 18 | ; CHECK-NEXT: --> %v6 U: full-set S: full-set |
Krzysztof Parzyszek | 90f3249 | 2018-08-02 19:13:35 +0000 | [diff] [blame] | 19 | ; CHECK-NEXT: %v7 = sext i16 %v5 to i32 |
Fangrui Song | 8fdac7c | 2020-09-21 17:18:26 -0700 | [diff] [blame] | 20 | ; CHECK-NEXT: --> (sext i16 %v5 to i32) U: [-256,0) S: [-256,0) |
Krzysztof Parzyszek | 90f3249 | 2018-08-02 19:13:35 +0000 | [diff] [blame] | 21 | ; CHECK-NEXT: Determining loop execution counts for: @f0 |
| 22 | ; CHECK-NEXT: Loop %b1: backedge-taken count is 255 |
| 23 | ; CHECK-NEXT: Loop %b1: max backedge-taken count is 255 |
| 24 | ; CHECK-NEXT: Loop %b1: Predicated backedge-taken count is 255 |
| 25 | ; CHECK-NEXT: Predicates: |
| 26 | ; CHECK-EMPTY: |
| 27 | ; CHECK-NEXT: Loop %b1: Trip multiple is 256 |
| 28 | |
| 29 | |
| 30 | @g0 = global i32 0, align 4 |
| 31 | @g1 = global i16 0, align 2 |
| 32 | |
| 33 | define signext i32 @f0() { |
| 34 | b0: |
| 35 | br label %b1 |
| 36 | |
| 37 | b1: ; preds = %b1, %b0 |
| 38 | %v1 = phi i16 [ 0, %b0 ], [ %v2, %b1 ] |
| 39 | %v2 = add i16 %v1, -1 |
| 40 | %v3 = mul i16 %v2, %v2 |
| 41 | %v4 = icmp eq i16 %v3, 0 |
| 42 | br i1 %v4, label %b2, label %b1 |
| 43 | |
| 44 | b2: ; preds = %b1 |
| 45 | %v5 = phi i16 [ %v2, %b1 ] |
| 46 | %v6 = phi i16 [ %v3, %b1 ] |
| 47 | %v7 = sext i16 %v5 to i32 |
| 48 | store i32 %v7, i32* @g0, align 4 |
| 49 | store i16 %v6, i16* @g1, align 2 |
| 50 | ret i32 0 |
| 51 | } |
| 52 | |