File: cycled_phis.ll

package info (click to toggle)
llvm-toolchain-14 1%3A14.0.6-12
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,496,180 kB
  • sloc: cpp: 5,593,972; ansic: 986,872; asm: 585,869; python: 184,223; objc: 72,530; lisp: 31,119; f90: 27,793; javascript: 9,780; pascal: 9,762; sh: 9,482; perl: 7,468; ml: 5,432; awk: 3,523; makefile: 2,538; xml: 953; cs: 573; fortran: 567
file content (136 lines) | stat: -rw-r--r-- 6,973 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" 2>&1 | FileCheck %s

declare i1 @cond()

; FIXME: Range of phi_1 and phi_2 here can be sharpened to [10, 21).
define void @test_01() {
; CHECK-LABEL: 'test_01'
; CHECK-NEXT:  Classifying expressions for: @test_01
; CHECK-NEXT:    %phi_1 = phi i32 [ 10, %entry ], [ %phi_2, %loop ]
; CHECK-NEXT:    --> %phi_1 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT:    %phi_2 = phi i32 [ 20, %entry ], [ %phi_1, %loop ]
; CHECK-NEXT:    --> %phi_2 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT:    %cond = call i1 @cond()
; CHECK-NEXT:    --> %cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
; CHECK-NEXT:  Determining loop execution counts for: @test_01
; CHECK-NEXT:  Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT:  Loop %loop: Unpredictable max backedge-taken count.
; CHECK-NEXT:  Loop %loop: Unpredictable predicated backedge-taken count.
;
entry:
  br label %loop

loop:
  %phi_1 = phi i32 [ 10, %entry], [%phi_2, %loop]
  %phi_2 = phi i32 [ 20, %entry], [%phi_1, %loop]
  %cond = call i1 @cond()
  br i1 %cond, label %loop, label %exit

exit:
  ret void
}

; FIXME: Both inner and outer loop Phis should have the same range [0, 3000).
define void @test_02(i32* %p, i32* %q) {
; CHECK-LABEL: 'test_02'
; CHECK-NEXT:  Classifying expressions for: @test_02
; CHECK-NEXT:    %start = load i32, i32* %p, align 4, !range !0
; CHECK-NEXT:    --> %start U: [0,1000) S: [0,1000)
; CHECK-NEXT:    %outer_phi = phi i32 [ %start, %entry ], [ %inner_lcssa, %outer_backedge ]
; CHECK-NEXT:    --> %outer_phi U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
; CHECK-NEXT:    %inner_phi = phi i32 [ %outer_phi, %outer_loop ], [ %inner_load, %inner_loop ]
; CHECK-NEXT:    --> %inner_phi U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
; CHECK-NEXT:    %inner_load = load i32, i32* %q, align 4, !range !1
; CHECK-NEXT:    --> %inner_load U: [2000,3000) S: [2000,3000) Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
; CHECK-NEXT:    %inner_cond = call i1 @cond()
; CHECK-NEXT:    --> %inner_cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
; CHECK-NEXT:    %inner_lcssa = phi i32 [ %inner_phi, %inner_loop ]
; CHECK-NEXT:    --> %inner_lcssa U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
; CHECK-NEXT:    %outer_cond = call i1 @cond()
; CHECK-NEXT:    --> %outer_cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
; CHECK-NEXT:  Determining loop execution counts for: @test_02
; CHECK-NEXT:  Loop %inner_loop: Unpredictable backedge-taken count.
; CHECK-NEXT:  Loop %inner_loop: Unpredictable max backedge-taken count.
; CHECK-NEXT:  Loop %inner_loop: Unpredictable predicated backedge-taken count.
; CHECK-NEXT:  Loop %outer_loop: Unpredictable backedge-taken count.
; CHECK-NEXT:  Loop %outer_loop: Unpredictable max backedge-taken count.
; CHECK-NEXT:  Loop %outer_loop: Unpredictable predicated backedge-taken count.
;
entry:
  %start = load i32, i32* %p, !range !0
  br label %outer_loop

outer_loop:
  %outer_phi = phi i32 [ %start, %entry], [%inner_lcssa, %outer_backedge]
  br label %inner_loop

inner_loop:
  %inner_phi = phi i32 [%outer_phi, %outer_loop], [%inner_load, %inner_loop]
  %inner_load = load i32, i32* %q, !range !1
  %inner_cond = call i1 @cond()
  br i1 %inner_cond, label %inner_loop, label %outer_backedge

outer_backedge:
  %inner_lcssa = phi i32 [%inner_phi, %inner_loop]
  %outer_cond = call i1 @cond()
  br i1 %outer_cond, label %outer_loop, label %exit

exit:
  ret void
}

; FIXME: All phis should have range [0, 3000)
define void @test_03(i32* %p, i32* %q) {
; CHECK-LABEL: 'test_03'
; CHECK-NEXT:  Classifying expressions for: @test_03
; CHECK-NEXT:    %start_1 = load i32, i32* %p, align 4, !range !0
; CHECK-NEXT:    --> %start_1 U: [0,1000) S: [0,1000)
; CHECK-NEXT:    %start_2 = load i32, i32* %q, align 4, !range !1
; CHECK-NEXT:    --> %start_2 U: [2000,3000) S: [2000,3000)
; CHECK-NEXT:    %outer_phi = phi i32 [ %start_1, %entry ], [ %inner_lcssa, %outer_backedge ]
; CHECK-NEXT:    --> %outer_phi U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
; CHECK-NEXT:    %inner_phi_1 = phi i32 [ %outer_phi, %outer_loop ], [ %inner_phi_2, %inner_loop ]
; CHECK-NEXT:    --> %inner_phi_1 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
; CHECK-NEXT:    %inner_phi_2 = phi i32 [ %start_2, %outer_loop ], [ %inner_phi_1, %inner_loop ]
; CHECK-NEXT:    --> %inner_phi_2 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
; CHECK-NEXT:    %inner_cond = call i1 @cond()
; CHECK-NEXT:    --> %inner_cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner_loop: Variant, %outer_loop: Variant }
; CHECK-NEXT:    %inner_lcssa = phi i32 [ %inner_phi_1, %inner_loop ]
; CHECK-NEXT:    --> %inner_lcssa U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
; CHECK-NEXT:    %outer_cond = call i1 @cond()
; CHECK-NEXT:    --> %outer_cond U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %outer_loop: Variant, %inner_loop: Invariant }
; CHECK-NEXT:  Determining loop execution counts for: @test_03
; CHECK-NEXT:  Loop %inner_loop: Unpredictable backedge-taken count.
; CHECK-NEXT:  Loop %inner_loop: Unpredictable max backedge-taken count.
; CHECK-NEXT:  Loop %inner_loop: Unpredictable predicated backedge-taken count.
; CHECK-NEXT:  Loop %outer_loop: Unpredictable backedge-taken count.
; CHECK-NEXT:  Loop %outer_loop: Unpredictable max backedge-taken count.
; CHECK-NEXT:  Loop %outer_loop: Unpredictable predicated backedge-taken count.
;
entry:
  %start_1 = load i32, i32* %p, !range !0
  %start_2 = load i32, i32* %q, !range !1
  br label %outer_loop

outer_loop:
  %outer_phi = phi i32 [ %start_1, %entry], [%inner_lcssa, %outer_backedge]
  br label %inner_loop

inner_loop:
  %inner_phi_1 = phi i32 [%outer_phi, %outer_loop], [%inner_phi_2, %inner_loop]
  %inner_phi_2 = phi i32 [%start_2, %outer_loop], [%inner_phi_1, %inner_loop]
  %inner_cond = call i1 @cond()
  br i1 %inner_cond, label %inner_loop, label %outer_backedge

outer_backedge:
  %inner_lcssa = phi i32 [%inner_phi_1, %inner_loop]
  %outer_cond = call i1 @cond()
  br i1 %outer_cond, label %outer_loop, label %exit

exit:
  ret void
}

!0 = !{i32 0, i32 1000}
!1 = !{i32 2000, i32 3000}