Debian Codegraph @

llvm/test/Transforms/LoopInterchange/bail-out-all-deps.ll

raw
1 ; RUN: opt < %s -passes=loop-interchange -pass-remarks-output=%t \
2 ; RUN: -disable-output
3 ; RUN: FileCheck -input-file %t %s
4
5 ; Check that loop interchange bails out early when finding a direction vector
6 ; with all '*' elements.
7 ;
8 ; for (int i = 0; i < 4; i++)
9 ; for (int j = 0; j < 4; j++)
10 ; A[i & val][j & val] = 0;
11
12 ; CHECK: --- !Missed
13 ; CHECK-NEXT: Pass: loop-interchange
14 ; CHECK-NEXT: Name: Dependence
15 ; CHECK-NEXT: Function: f
16 ; CHECK-NEXT: Args:
17 ; CHECK-NEXT: - String: All loops have dependencies in all directions.
18 ; CHECK-NEXT: ...
19 define void @f(ptr %A, i64 %val) {
20 entry:
21 br label %for.i.header
22
23 for.i.header:
24 %i = phi i64 [ 0, %entry ], [ %i.next, %for.i.latch ]
25 br label %for.j
26
27 for.j:
28 %j = phi i64 [ 0, %for.i.header ], [ %j.next, %for.j ]
29 %subscript.0 = and i64 %i, %val
30 %subscript.1 = and i64 %j, %val
31 %idx = getelementptr inbounds [4 x i8], ptr %A, i64 %subscript.0, i64 %subscript.1
32 store i8 0, ptr %idx
33 %j.next = add nuw nsw i64 %j, 1
34 %exit.j = icmp eq i64 %j.next, 4
35 br i1 %exit.j, label %for.i.latch, label %for.j
36
37 for.i.latch:
38 %i.next = add nuw nsw i64 %i, 1
39 %exit.i = icmp eq i64 %i.next, 4
40 br i1 %exit.i, label %exit, label %for.i.header
41
42 exit:
43 ret void
44 }