xref: /llvm-project/llvm/test/Transforms/LoopUnroll/unroll-loop-invalidation.ll (revision 4c01a58008055aa8a7ce6e1a770216cd86664711)
1; This test exercises that we don't corrupt a loop-analysis when running loop
2; unrolling in a way that deletes a loop. To do that, we first ensure the
3; analysis is cached, then unroll the loop (deleting it) and make sure that the
4; next function doesn't get a cache "hit" for this stale analysis result.
5;
6; RUN: opt -S -passes='require<access-info>,loop-unroll,print<access-info>' -debug-pass-manager < %s 2>&1 | FileCheck %s
7;
8; CHECK: Running pass: RequireAnalysisPass<{{.*}}LoopAccessAnalysis
9; CHECK: Running analysis: LoopAnalysis
10; CHECK: Running pass: LoopUnrollPass
11; CHECK: Invalidating analysis: LoopAccessAnalysis on test
12; CHECK: Running pass: LoopAccessInfoPrinterPass
13; CHECK: Running analysis: LoopAccessAnalysis on test
14; CHECK: Printing analysis 'Loop Access Analysis' for function 'test':
15; CHECK:   inner1.header:
16
17; CHECK:   inner1.header.1:
18
19target triple = "x86_64-unknown-linux-gnu"
20
21define void @test(i32 %inner1.count) {
22; CHECK-LABEL: define void @test(
23bb:
24  br label %outer.ph
25
26outer.ph:
27  br label %outer.header
28
29outer.header:
30  %outer.i = phi i32 [ 0, %outer.ph ], [ %outer.i.next, %outer.latch ]
31  br label %inner1.ph
32
33inner1.ph:
34  br label %inner1.header
35
36inner1.header:
37  %inner1.i = phi i32 [ 0, %inner1.ph ], [ %inner1.i.next, %inner1.header ]
38  %inner1.i.next = add i32 %inner1.i, 1
39  %inner1.cond = icmp eq i32 %inner1.i, %inner1.count
40  br i1 %inner1.cond, label %inner1.exit, label %inner1.header
41; We should have two unrolled copies of this loop and nothing else.
42;
43; CHECK-NOT:     icmp eq
44; CHECK-NOT:     br i1
45; CHECK:         %[[COND1:.*]] = icmp eq i32 %{{.*}}, %inner1.count
46; CHECK:         br i1 %[[COND1]],
47; CHECK-NOT:     icmp eq
48; CHECK-NOT:     br i1
49; CHECK:         %[[COND2:.*]] = icmp eq i32 %{{.*}}, %inner1.count
50; CHECK:         br i1 %[[COND2]],
51; CHECK-NOT:     icmp eq
52; CHECK-NOT:     br i1
53
54
55inner1.exit:
56  br label %inner2.ph
57
58inner2.ph:
59  br label %inner2.header
60
61inner2.header:
62  %inner2.i = phi i32 [ 0, %inner2.ph ], [ %inner2.i.next, %inner2.header ]
63  %inner2.i.next = add i32 %inner2.i, 1
64  %inner2.cond = icmp eq i32 %inner2.i, 4
65  br i1 %inner2.cond, label %inner2.exit, label %inner2.header
66
67inner2.exit:
68  br label %outer.latch
69
70outer.latch:
71  %outer.i.next = add i32 %outer.i, 1
72  %outer.cond = icmp eq i32 %outer.i.next, 2
73  br i1 %outer.cond, label %outer.exit, label %outer.header
74
75outer.exit:
76  br label %exit
77
78exit:
79  ret void
80}
81