Debian Codegraph @

llvm/test/Transforms/LoopInterchange/loopnest-with-outer-btc0.ll

raw
1 ; RUN: opt < %s -passes=loop-interchange -verify-dom-info -verify-loop-info \
2 ; RUN: -pass-remarks-output=%t -pass-remarks='loop-interchange' -S
3 ; RUN: cat %t | FileCheck %s
4
5 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
6
7 @D = common global [100 x [100 x [100 x i32]]] zeroinitializer
8
9 ; The outer loop's backedge isn't taken. Check the loop with BTC=0 is considered
10 ; unprofitable, but that we still interchange the two inner loops.
11 ;
12 ; for(int i=0;i<1;i++)
13 ; for(int j=0;j<100;j++)
14 ; for(int k=0;k<100;k++)
15 ; D[i][k][j] = D[i][k][j]+t;
16 ;
17
18 ; CHECK: --- !Analysis
19 ; CHECK-NEXT: Pass: loop-interchange
20 ; CHECK-NEXT: Name: Dependence
21 ; CHECK-NEXT: Function: interchange_i_and_j
22 ; CHECK-NEXT: Args:
23 ; CHECK-NEXT: - String: Computed dependence info, invoking the transform.
24 ; CHECK-NEXT: ...
25 ; CHECK-NEXT: --- !Passed
26 ; CHECK-NEXT: Pass: loop-interchange
27 ; CHECK-NEXT: Name: Interchanged
28 ; CHECK-NEXT: Function: interchange_i_and_j
29 ; CHECK-NEXT: Args:
30 ; CHECK-NEXT: - String: Loop interchanged with enclosing loop.
31 ; CHECK-NEXT: ...
32 ; CHECK-NEXT: --- !Missed
33 ; CHECK-NEXT: Pass: loop-interchange
34 ; CHECK-NEXT: Name: InterchangeNotProfitable
35 ; CHECK-NEXT: Function: interchange_i_and_j
36 ; CHECK-NEXT: Args:
37 ; CHECK-NEXT: - String: Insufficient information to calculate the cost of loop for interchange.
38 ; CHECK-NEXT: ...
39
40 define void @interchange_i_and_j(i32 %t){
41 entry:
42 br label %outer.header
43
44 outer.header:
45 %i = phi i64 [ 0, %entry ], [ %inc16, %for.inc15 ]
46 br label %inner1.header
47
48 inner1.header:
49 %j = phi i64 [ 0, %outer.header ], [ %inc13, %for.inc12 ]
50 br label %inner2.body
51
52 inner2.body:
53 %k = phi i64 [ 0, %inner1.header ], [ %inc, %inner2.body ]
54 %arrayidx8 = getelementptr inbounds [100 x [100 x i32]], ptr @D, i64 %i, i64 %k, i64 %j
55 %0 = load i32, ptr %arrayidx8
56 %add = add nsw i32 %0, %t
57 store i32 %add, ptr %arrayidx8
58 %inc = add nuw nsw i64 %k, 1
59 %exitcond = icmp eq i64 %inc, 100
60 br i1 %exitcond, label %for.inc12, label %inner2.body
61
62 for.inc12:
63 %inc13 = add nuw nsw i64 %j, 1
64 %exitcond29 = icmp eq i64 %inc13, 100
65 br i1 %exitcond29, label %for.inc15, label %inner1.header
66
67 for.inc15:
68 %inc16 = add nuw nsw i64 %i, 1
69 %exitcond30 = icmp eq i64 %inc16, 1
70 br i1 %exitcond30, label %for.end17, label %outer.header
71
72 for.end17:
73 ret void
74 }