1; RUN: opt < %s -basic-aa -loop-interchange -pass-remarks-missed='loop-interchange' -pass-remarks-output=%t -S \
2; RUN:     -verify-dom-info -verify-loop-info -verify-loop-lcssa -stats 2>&1
3; RUN: FileCheck --input-file=%t --check-prefix=REMARKS %s
4
5; Triply nested loop, should be able to do interchange three times
6; to get the ideal access pattern.
7; void f(int e[10][10][10], int f[10][10][10]) {
8;   for (int a = 0; a < 10; a++) {
9;     for (int b = 0; b < 10; b++) {
10;       for (int c = 0; c < 10; c++) {
11;         f[c][b][a] = e[c][b][a];
12;       }
13;     }
14;   }
15; }
16
17target triple = "powerpc64le-unknown-linux-gnu"
18
19; REMARKS: --- !Passed
20; REMARKS-NEXT: Pass:            loop-interchange
21; REMARKS-NEXT: Name:            Interchanged
22; REMARKS-NEXT: Function:        pr43326-triply-nested
23; REMARKS: --- !Passed
24; REMARKS-NEXT: Pass:            loop-interchange
25; REMARKS-NEXT: Name:            Interchanged
26; REMARKS-NEXT: Function:        pr43326-triply-nested
27; REMARKS: --- !Passed
28; REMARKS-NEXT: Pass:            loop-interchange
29; REMARKS-NEXT: Name:            Interchanged
30; REMARKS-NEXT: Function:        pr43326-triply-nested
31
32define void @pr43326-triply-nested([10 x [10 x i32]]* %e, [10 x [10 x i32]]* %f) {
33entry:
34  br label %for.outermost.header
35
36for.outermost.header:                              ; preds = %entry, %for.outermost.latch
37  %indvars.outermost = phi i64 [ 0, %entry ], [ %indvars.outermost.next, %for.outermost.latch ]
38  br label %for.middle.header
39
40for.cond.cleanup:                                 ; preds = %for.outermost.latch
41  ret void
42
43for.middle.header:                              ; preds = %for.outermost.header, %for.middle.latch
44  %indvars.middle = phi i64 [ 0, %for.outermost.header ], [ %indvars.middle.next, %for.middle.latch ]
45  br label %for.innermost
46
47for.outermost.latch:                                ; preds = %for.middle.latch
48  %indvars.outermost.next = add nuw nsw i64 %indvars.outermost, 1
49  %exitcond.outermost = icmp ne i64 %indvars.outermost.next, 10
50  br i1 %exitcond.outermost, label %for.outermost.header, label %for.cond.cleanup
51
52for.middle.latch:                                ; preds = %for.innermost
53  %indvars.middle.next = add nuw nsw i64 %indvars.middle, 1
54  %exitcond.middle = icmp ne i64 %indvars.middle.next, 10
55  br i1 %exitcond.middle, label %for.middle.header, label %for.outermost.latch
56
57for.innermost:                                        ; preds = %for.middle.header, %for.innermost
58  %indvars.innermost = phi i64 [ 0, %for.middle.header ], [ %indvars.innermost.next, %for.innermost ]
59  %arrayidx12 = getelementptr inbounds [10 x [10 x i32]], [10 x [10 x i32]]* %e, i64 %indvars.innermost, i64 %indvars.middle, i64 %indvars.outermost
60  %0 = load i32, i32* %arrayidx12
61  %arrayidx18 = getelementptr inbounds [10 x [10 x i32]], [10 x [10 x i32]]* %f, i64 %indvars.innermost, i64 %indvars.middle, i64 %indvars.outermost
62  store i32 %0, i32* %arrayidx18
63  %indvars.innermost.next = add nuw nsw i64 %indvars.innermost, 1
64  %exitcond.innermost = icmp ne i64 %indvars.innermost.next, 10
65  br i1 %exitcond.innermost, label %for.innermost, label %for.middle.latch
66}