1; RUN: opt < %s -analyze -scalar-evolution -scalar-evolution-max-iterations=0 | FileCheck %s
2; RUN: opt < %s -passes='print<scalar-evolution>' -disable-output 2>&1 | FileCheck %s
3; PR1101
4
5target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
6target triple = "x86_64-unknown-linux-gnu"
7
8@A = weak global [1000 x i32] zeroinitializer, align 32
9
10; CHECK-LABEL: Determining loop execution counts for: @test1
11; CHECK: backedge-taken count is 10000
12
13define void @test1(i32 %N) {
14entry:
15        br label %bb3
16
17bb:             ; preds = %bb3
18        %tmp = getelementptr [1000 x i32], [1000 x i32]* @A, i32 0, i32 %i.0          ; <i32*> [#uses=1]
19        store i32 123, i32* %tmp
20        %tmp2 = add i32 %i.0, 1         ; <i32> [#uses=1]
21        br label %bb3
22
23bb3:            ; preds = %bb, %entry
24        %i.0 = phi i32 [ 0, %entry ], [ %tmp2, %bb ]            ; <i32> [#uses=3]
25        %tmp3 = icmp sle i32 %i.0, 9999          ; <i1> [#uses=1]
26        br i1 %tmp3, label %bb, label %bb5
27
28bb5:            ; preds = %bb3
29        br label %return
30
31return:         ; preds = %bb5
32        ret void
33}
34
35; PR22795
36; CHECK-LABEL: Classifying expressions for: @test2
37; CHECK:   %iv = phi i32 [ -1, %entry ], [ %next.1, %for.inc.1 ]
38; CHECK-NEXT:  -->  {-1,+,2}<%preheader> U: full-set S: full-set             Exits: 13
39
40define i32 @test2() {
41entry:
42  %bins = alloca [16 x i64], align 16
43  %0 = bitcast [16 x i64]* %bins to i8*
44  call void @llvm.memset.p0i8.i64(i8* align 16 %0, i8 0, i64 128, i1 false)
45  br label %preheader
46
47preheader:                                        ; preds = %for.inc.1, %entry
48  %v11 = phi i64 [ 0, %entry ], [ %next12.1, %for.inc.1 ]
49  %iv = phi i32 [ -1, %entry ], [ %next.1, %for.inc.1 ]
50  %cmp = icmp sgt i64 %v11, 0
51  br i1 %cmp, label %for.body, label %for.inc
52
53for.body:                                         ; preds = %preheader
54  %zext = zext i32 %iv to i64
55  %arrayidx = getelementptr [16 x i64], [16 x i64]* %bins, i64 0, i64 %v11
56  %loaded = load i64, i64* %arrayidx, align 8
57  %add = add i64 %loaded, 1
58  %add2 = add i64 %add, %zext
59  store i64 %add2, i64* %arrayidx, align 8
60  br label %for.inc
61
62for.inc:                                          ; preds = %for.body, %preheader
63  %next12 = add nuw nsw i64 %v11, 1
64  %next = add nsw i32 %iv, 1
65  br i1 true, label %for.body.1, label %for.inc.1
66
67end:                                              ; preds = %for.inc.1
68  %arrayidx8 = getelementptr [16 x i64], [16 x i64]* %bins, i64 0, i64 2
69  %load = load i64, i64* %arrayidx8, align 16
70  %shr4 = lshr i64 %load, 32
71  %conv = trunc i64 %shr4 to i32
72  ret i32 %conv
73
74for.body.1:                                       ; preds = %for.inc
75  %zext.1 = zext i32 %next to i64
76  %arrayidx.1 = getelementptr [16 x i64], [16 x i64]* %bins, i64 0, i64 %next12
77  %loaded.1 = load i64, i64* %arrayidx.1, align 8
78  %add.1 = add i64 %loaded.1, 1
79  %add2.1 = add i64 %add.1, %zext.1
80  store i64 %add2.1, i64* %arrayidx.1, align 8
81  br label %for.inc.1
82
83for.inc.1:                                        ; preds = %for.body.1, %for.inc
84  %next12.1 = add nuw nsw i64 %next12, 1
85  %next.1 = add nuw nsw i32 %next, 1
86  %exitcond.1 = icmp eq i64 %next12.1, 16
87  br i1 %exitcond.1, label %end, label %preheader
88}
89
90; Function Attrs: nounwind
91declare void @llvm.memset.p0i8.i64(i8* nocapture, i8, i64, i1) #0
92
93declare void @may_exit() nounwind
94
95define void @pr28012(i32 %n) {
96; CHECK-LABEL: Classifying expressions for: @pr28012
97; CHECK: Loop %loop: backedge-taken count is -1431655751
98; CHECK: Loop %loop: max backedge-taken count is -1431655751
99; CHECK: Loop %loop: Predicated backedge-taken count is -1431655751
100
101entry:
102  br label %loop
103
104loop:
105  %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
106  %iv.inc = add nsw i32 %iv, 3
107  call void @may_exit()
108  %becond = icmp ne i32 %iv.inc, 46
109  br i1 %becond, label %loop, label %leave
110
111leave:
112  ret void
113}
114