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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
;=========================== begin_copyright_notice ============================
;
; Copyright (C) 2025 Intel Corporation
;
; SPDX-License-Identifier: MIT
;
;============================ end_copyright_notice =============================
; RUN: igc_opt --typed-pointers --enable-debugify --igc-promote-to-predicated-memory-access --platformbmg -S < %s 2>&1 | FileCheck %s
; Debug-info related check
; 2 warnings are related to 2 deleted phi instructions
; CHECK-COUNT-2: WARNING
; CHECK: CheckModuleDebugify: PASS
; Test basic logic
; CHECK-LABEL: @test1(
define <64 x i32> @test1(<64 x i32> addrspace(1)* %src, i1 %pred, <64 x i32> %data) {
entry:
; CHECK: br label %st
br i1 %pred, label %st, label %exit
st:
; CHECK: %load = call <64 x i32> @llvm.genx.GenISA.PredicatedLoad.v64i32.p1v64i32.v64i32(<64 x i32> addrspace(1)* %src, i64 4, i1 %pred, <64 x i32> %data)
%load = load <64 x i32>, <64 x i32> addrspace(1)* %src, align 4
br label %exit
exit:
; CHECK-NOT: phi
; CHECK: ret <64 x i32> %load
%res = phi <64 x i32> [ %load, %st ], [ %data, %entry ]
ret <64 x i32> %res
}
; Test inverse condition
; CHECK-LABEL: @test2(
define <64 x i32> @test2(<64 x i32> addrspace(1)* %src, i1 %pred, <64 x i32> %data) {
entry:
; CHECK: br label %st
br i1 %pred, label %exit, label %st
st:
; CHECK: [[NOT:%.*]] = xor i1 %pred, true
; CHECK: %load = call <64 x i32> @llvm.genx.GenISA.PredicatedLoad.v64i32.p1v64i32.v64i32(<64 x i32> addrspace(1)* %src, i64 4, i1 [[NOT]], <64 x i32> %data)
%load = load <64 x i32>, <64 x i32> addrspace(1)* %src, align 4
br label %exit
exit:
; CHECK-NOT: phi
; CHECK: ret <64 x i32> %load
%res = phi <64 x i32> [ %load, %st ], [ %data, %entry ]
ret <64 x i32> %res
}
; test early exit if not only load/store instructions need to be conditional
; CHECK-LABEL: @test3(
define <64 x i32> @test3(<64 x i32> addrspace(1)* %src, i1 %pred, <64 x i32> %data) {
entry:
; CHECK: br i1 %pred, label %exit, label %st
br i1 %pred, label %exit, label %st
st:
; CHECK: %load = load <64 x i32>, <64 x i32> addrspace(1)* %src, align 4
%load = load <64 x i32>, <64 x i32> addrspace(1)* %src, align 4
%a = add i32 3, 8
br label %exit
exit:
; CHECK: %res = phi <64 x i32> [ %load, %st ], [ %data, %entry ]
%res = phi <64 x i32> [ %load, %st ], [ %data, %entry ]
%var = phi i32 [ %a, %st ], [ 0, %entry ]
; CHECK: ret <64 x i32> %res
ret <64 x i32> %res
}
; test exit if it is not "hammock"
; CHECK-LABEL: @test4(
define <64 x i32> @test4(<64 x i32> addrspace(1)* %src, i1 %pred.a, i1 %pred.b, <64 x i32> %data) {
entry:
; CHECK: br i1 %pred.a, label %if, label %exit
br i1 %pred.a, label %if, label %exit
if:
; CHECK: br i1 %pred.b, label %then, label %exit
br i1 %pred.b, label %then, label %exit
then:
; CHECK: %load = load <64 x i32>, <64 x i32> addrspace(1)* %src, align 4
%load = load <64 x i32>, <64 x i32> addrspace(1)* %src, align 4
br label %exit
exit:
; CHECK: %res = phi <64 x i32> [ %load, %then ], [ %data, %if ], [ zeroinitializer, %entry ]
; CHECK: ret <64 x i32> %res
%res = phi <64 x i32> [ %load, %then ], [ %data, %if ], [ zeroinitializer, %entry ]
ret <64 x i32> %res
}
; Test exit if load is not simple
; CHECK-LABEL: @test5(
define <64 x i32> @test5(<64 x i32> addrspace(1)* %src, i1 %pred, <64 x i32> %data) {
entry:
; CHECK: br i1 %pred, label %st, label %exit
br i1 %pred, label %st, label %exit
st:
; CHECK: %load = load volatile <64 x i32>, <64 x i32> addrspace(1)* %src, align 4
%load = load volatile <64 x i32>, <64 x i32> addrspace(1)* %src, align 4
br label %exit
exit:
; CHECK: %res = phi <64 x i32> [ %load, %st ], [ %data, %entry ]
; CHECK: ret <64 x i32> %res
%res = phi <64 x i32> [ %load, %st ], [ %data, %entry ]
ret <64 x i32> %res
}
; Test exit if integer size is not legal
; CHECK-LABEL: @test6(
define i42 @test6(i42 addrspace(1)* %src, i1 %pred, i42 %data) {
entry:
; CHECK: br i1 %pred, label %st, label %exit
br i1 %pred, label %st, label %exit
st:
; CHECK: %load = load i42, i42 addrspace(1)* %src, align 4
%load = load i42, i42 addrspace(1)* %src, align 4
br label %exit
exit:
; CHECK: %res = phi i42 [ %load, %st ], [ %data, %entry ]
; CHECK: ret i42 %res
%res = phi i42 [ %load, %st ], [ %data, %entry ]
ret i42 %res
}
; Call instruction with side effects
; CHECK-LABEL: @test7(
define i32 @test7(i32 addrspace(1)* %src, i1 %pred, i32 %data) {
entry:
; CHECK: br i1 %pred, label %st, label %exit
br i1 %pred, label %st, label %exit
st:
; CHECK: %load = load i32, i32 addrspace(1)* %src, align 4
%load = load i32, i32 addrspace(1)* %src, align 4
call void @side_effect_function()
br label %exit
exit:
; CHECK: %res = phi i32 [ %load, %st ], [ %data, %entry ]
; CHECK: ret i32 %res
%res = phi i32 [ %load, %st ], [ %data, %entry ]
ret i32 %res
}
declare void @side_effect_function()
; Convergent call
; CHECK-LABEL: @test8(
define i32 @test8(i32 addrspace(1)* %src, i1 %pred, i32 %data) {
entry:
; CHECK: br i1 %pred, label %st, label %exit
br i1 %pred, label %st, label %exit
st:
; CHECK: %load = load i32, i32 addrspace(1)* %src, align 4
%load = load i32, i32 addrspace(1)* %src, align 4
call void @convergent_function()
br label %exit
exit:
; CHECK: %res = phi i32 [ %load, %st ], [ %data, %entry ]
; CHECK: ret i32 %res
%res = phi i32 [ %load, %st ], [ %data, %entry ]
ret i32 %res
}
declare void @convergent_function() nounwind readnone willreturn convergent
; Instruction may read from memory
; CHECK-LABEL: @test9(
define i32 @test9(i32 addrspace(1)* %src, i32 addrspace(1)* %src1, i1 %pred, i32 %data) {
entry:
; CHECK: br i1 %pred, label %st, label %exit
br i1 %pred, label %st, label %exit
st:
; CHECK: %load = load i32, i32 addrspace(1)* %src, align 4
%load = load i32, i32 addrspace(1)* %src, align 4
%load1 = load i32, i32 addrspace(1)* %src1, align 4
br label %exit
exit:
; CHECK: %res = phi i32 [ %load, %st ], [ %data, %entry ]
; CHECK: ret i32 %res
%res = phi i32 [ %load, %st ], [ %data, %entry ]
ret i32 %res
}
; Test pass does nothing, if nothing to convert
; CHECK-LABEL: @test10(
define i32 @test10(i1 %pred) {
entry:
; CHECK: br i1 %pred, label %st, label %exit
br i1 %pred, label %st, label %exit
st:
; CHECK: %a = add i32 3, 8
%a = add i32 3, 8
br label %exit
exit:
; CHECK: ret i32 42
ret i32 42
}
|
