1; REQUIRES: asserts
2; RUN: opt < %s -basicaa -loop-interchange -S -debug 2>&1 | FileCheck %s
3
4target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
5target triple = "x86_64-unknown-linux-gnu"
6
7@A = common global [100 x [100 x i32]] zeroinitializer
8@B = common global [100 x i32] zeroinitializer
9@C = common global [100 x [100 x i32]] zeroinitializer
10@D = common global [100 x [100 x [100 x i32]]] zeroinitializer
11
12;; Loops not tightly nested are not interchanged
13;;  for(int j=0;j<N;j++) {
14;;    B[j] = j+k;
15;;    for(int i=0;i<N;i++)
16;;      A[j][i] = A[j][i]+B[j];
17;;  }
18
19; CHECK: Not interchanging loops. Cannot prove legality.
20
21define void @interchange_05(i32 %k, i32 %N){
22entry:
23  %cmp30 = icmp sgt i32 %N, 0
24  br i1 %cmp30, label %for.body.lr.ph, label %for.end17
25
26for.body.lr.ph:
27  %0 = add i32 %N, -1
28  %1 = zext i32 %k to i64
29  br label %for.body
30
31for.body:
32  %indvars.iv32 = phi i64 [ 0, %for.body.lr.ph ], [ %indvars.iv.next33, %for.inc15 ]
33  %2 = add nsw i64 %indvars.iv32, %1
34  %arrayidx = getelementptr inbounds [100 x i32], [100 x i32]* @B, i64 0, i64 %indvars.iv32
35  %3 = trunc i64 %2 to i32
36  store i32 %3, i32* %arrayidx
37  br label %for.body3
38
39for.body3:
40  %indvars.iv = phi i64 [ 0, %for.body ], [ %indvars.iv.next, %for.body3 ]
41  %arrayidx7 = getelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* @A, i64 0, i64 %indvars.iv32, i64 %indvars.iv
42  %4 = load i32, i32* %arrayidx7
43  %add10 = add nsw i32 %3, %4
44  store i32 %add10, i32* %arrayidx7
45  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
46  %lftr.wideiv = trunc i64 %indvars.iv to i32
47  %exitcond = icmp eq i32 %lftr.wideiv, %0
48  br i1 %exitcond, label %for.inc15, label %for.body3
49
50for.inc15:
51  %indvars.iv.next33 = add nuw nsw i64 %indvars.iv32, 1
52  %lftr.wideiv35 = trunc i64 %indvars.iv32 to i32
53  %exitcond36 = icmp eq i32 %lftr.wideiv35, %0
54  br i1 %exitcond36, label %for.end17, label %for.body
55
56for.end17:
57  ret void
58}
59
60declare void @foo(...) readnone
61
62;; Loops not tightly nested are not interchanged
63;;  for(int j=0;j<N;j++) {
64;;    foo();
65;;    for(int i=2;i<N;i++)
66;;      A[j][i] = A[j][i]+k;
67;;  }
68
69; CHECK: Not interchanging loops. Cannot prove legality.
70
71define void @interchange_06(i32 %k, i32 %N) {
72entry:
73  %cmp22 = icmp sgt i32 %N, 0
74  br i1 %cmp22, label %for.body.lr.ph, label %for.end12
75
76for.body.lr.ph:
77  %0 = add i32 %N, -1
78  br label %for.body
79
80for.body:
81  %indvars.iv24 = phi i64 [ 0, %for.body.lr.ph ], [ %indvars.iv.next25, %for.inc10 ]
82  tail call void (...) @foo()
83  br label %for.body3
84
85for.body3:
86  %indvars.iv = phi i64 [ %indvars.iv.next, %for.body3 ], [ 2, %for.body ]
87  %arrayidx5 = getelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* @A, i64 0, i64 %indvars.iv24, i64 %indvars.iv
88  %1 = load i32, i32* %arrayidx5
89  %add = add nsw i32 %1, %k
90  store i32 %add, i32* %arrayidx5
91  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
92  %lftr.wideiv = trunc i64 %indvars.iv to i32
93  %exitcond = icmp eq i32 %lftr.wideiv, %0
94  br i1 %exitcond, label %for.inc10, label %for.body3
95
96for.inc10:
97  %indvars.iv.next25 = add nuw nsw i64 %indvars.iv24, 1
98  %lftr.wideiv26 = trunc i64 %indvars.iv24 to i32
99  %exitcond27 = icmp eq i32 %lftr.wideiv26, %0
100  br i1 %exitcond27, label %for.end12, label %for.body
101
102for.end12:
103  ret void
104}
105