1 ; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
2 ; RUN: opt -disable-output "-passes=print<scalar-evolution>" %s 2>&1 | FileCheck %s
4 target triple = "x86_64-unknown-linux-gnu"
6 define void @test_and(i16 %in) {
7 ; CHECK-LABEL: 'test_and'
8 ; CHECK-NEXT: Classifying expressions for: @test_and
9 ; CHECK-NEXT: %_tmp25.i = phi i16 [ %in, %bb2 ], [ %_tmp6.i, %bb1.i ]
10 ; CHECK-NEXT: --> {%in,+,1}<nsw><%bb1.i> U: full-set S: full-set Exits: 1 LoopDispositions: { %bb1.i: Computable, %bb2: Variant }
11 ; CHECK-NEXT: %_tmp6.i = add nsw i16 %_tmp25.i, 1
12 ; CHECK-NEXT: --> {(1 + %in),+,1}<nsw><%bb1.i> U: full-set S: full-set Exits: 2 LoopDispositions: { %bb1.i: Computable, %bb2: Variant }
13 ; CHECK-NEXT: %or.cond = and i1 %_tmp10.i, %exitcond.i
14 ; CHECK-NEXT: --> %or.cond U: full-set S: full-set Exits: true LoopDispositions: { %bb1.i: Variant, %bb2: Variant }
15 ; CHECK-NEXT: Determining loop execution counts for: @test_and
16 ; CHECK-NEXT: Loop %bb1.i: backedge-taken count is (1 + (-1 * %in))
17 ; CHECK-NEXT: Loop %bb1.i: max backedge-taken count is -1
18 ; CHECK-NEXT: Loop %bb1.i: Predicated backedge-taken count is (1 + (-1 * %in))
19 ; CHECK-NEXT: Predicates:
20 ; CHECK: Loop %bb1.i: Trip multiple is 1
21 ; CHECK-NEXT: Loop %bb2: <multiple exits> Unpredictable backedge-taken count.
22 ; CHECK-NEXT: Loop %bb2: Unpredictable max backedge-taken count.
23 ; CHECK-NEXT: Loop %bb2: Unpredictable predicated backedge-taken count.
27 bb2: ; preds = %bb1.i, %bb2, %0
28 %_tmp44.i = icmp slt i16 %in, 2
29 br i1 %_tmp44.i, label %bb1.i, label %bb2
31 bb1.i: ; preds = %bb1.i, %bb2
32 %_tmp25.i = phi i16 [ %in, %bb2 ], [ %_tmp6.i, %bb1.i ]
33 %_tmp6.i = add nsw i16 %_tmp25.i, 1
34 %_tmp10.i = icmp sge i16 %_tmp6.i, 2
35 %exitcond.i = icmp eq i16 %_tmp6.i, 2
36 %or.cond = and i1 %_tmp10.i, %exitcond.i
37 br i1 %or.cond, label %bb2, label %bb1.i
40 define void @test_or() {
41 ; CHECK-LABEL: 'test_or'
42 ; CHECK-NEXT: Classifying expressions for: @test_or
43 ; CHECK-NEXT: %indvars.iv = phi i64 [ -1, %BB ], [ -1, %0 ]
44 ; CHECK-NEXT: --> -1 U: [-1,0) S: [-1,0) Exits: -1 LoopDispositions: { %BB: Invariant }
45 ; CHECK-NEXT: %sum.01 = phi i32 [ %2, %BB ], [ undef, %0 ]
46 ; CHECK-NEXT: --> {undef,+,-1}<%BB> U: full-set S: full-set Exits: 0 LoopDispositions: { %BB: Computable }
47 ; CHECK-NEXT: %1 = trunc i64 %indvars.iv to i32
48 ; CHECK-NEXT: --> -1 U: [-1,0) S: [-1,0) Exits: -1 LoopDispositions: { %BB: Invariant }
49 ; CHECK-NEXT: %2 = add nsw i32 %1, %sum.01
50 ; CHECK-NEXT: --> {(-1 + undef),+,-1}<%BB> U: full-set S: full-set Exits: -1 LoopDispositions: { %BB: Computable }
51 ; CHECK-NEXT: %B3 = add i32 %1, %2
52 ; CHECK-NEXT: --> {(-2 + undef),+,-1}<%BB> U: full-set S: full-set Exits: -2 LoopDispositions: { %BB: Computable }
53 ; CHECK-NEXT: %B = or i1 %C5, %C11
54 ; CHECK-NEXT: --> %B U: full-set S: full-set Exits: false LoopDispositions: { %BB: Variant }
55 ; CHECK-NEXT: Determining loop execution counts for: @test_or
56 ; CHECK-NEXT: Loop %BB: backedge-taken count is undef
57 ; CHECK-NEXT: Loop %BB: max backedge-taken count is -1
58 ; CHECK-NEXT: Loop %BB: Predicated backedge-taken count is undef
59 ; CHECK-NEXT: Predicates:
60 ; CHECK: Loop %BB: Trip multiple is 1
62 %C10 = icmp slt i1 undef, undef
63 br i1 %C10, label %BB, label %exit
66 %indvars.iv = phi i64 [ -1, %BB ], [ -1, %0 ]
67 %sum.01 = phi i32 [ %2, %BB ], [ undef, %0 ]
68 %1 = trunc i64 %indvars.iv to i32
69 %2 = add nsw i32 %1, %sum.01
71 %C11 = icmp ult i32 %2, %1
72 %C5 = icmp sle i32 %1, %B3
74 br i1 %B, label %BB, label %exit
76 exit: ; preds = %BB, %0