File: accesses-completely-before-or-after.ll

package info (click to toggle)
llvm-toolchain-21 1%3A21.1.6-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,245,028 kB
  • sloc: cpp: 7,619,726; ansic: 1,434,018; asm: 1,058,748; python: 252,740; f90: 94,671; objc: 70,685; lisp: 42,813; pascal: 18,401; sh: 8,601; ml: 5,111; perl: 4,720; makefile: 3,675; awk: 3,523; javascript: 2,409; xml: 892; fortran: 770
file content (288 lines) | stat: -rw-r--r-- 9,828 bytes parent folder | download | duplicates (3)
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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
; RUN: opt -passes="print<access-info>" -disable-output %s 2>&1 | FileCheck %s

define i32 @completely_before_or_after_true_dep_different_size(ptr %d) {
; CHECK-LABEL: 'completely_before_or_after_true_dep_different_size'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Memory dependences are safe
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  %gep.128 = getelementptr i8, ptr %d, i64 128
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %gep.128.iv = getelementptr i64, ptr %gep.128, i64 %iv
  store i64 0, ptr %gep.128.iv, align 8
  %gep.iv = getelementptr i32, ptr %d, i64 %iv
  %l = load i32, ptr %gep.iv, align 4
  %iv.next = add i64 %iv, 1
  %ec = icmp eq i64 %iv.next, 32
  br i1 %ec, label %exit, label %loop

exit:
  ret i32 %l
}

define i32 @may_overlap_true_dep_different_size(ptr %d) {
; CHECK-LABEL: 'may_overlap_true_dep_different_size'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Memory dependences are safe with run-time checks
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Check 0:
; CHECK-NEXT:        Comparing group GRP0:
; CHECK-NEXT:          %gep.128.iv = getelementptr i64, ptr %gep.128, i64 %iv
; CHECK-NEXT:        Against group GRP1:
; CHECK-NEXT:          %gep.iv = getelementptr i32, ptr %d, i64 %iv
; CHECK-NEXT:      Grouped accesses:
; CHECK-NEXT:        Group GRP0:
; CHECK-NEXT:          (Low: (127 + %d) High: (383 + %d))
; CHECK-NEXT:            Member: {(127 + %d),+,8}<nw><%loop>
; CHECK-NEXT:        Group GRP1:
; CHECK-NEXT:          (Low: %d High: (128 + %d))
; CHECK-NEXT:            Member: {%d,+,4}<nw><%loop>
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  %gep.128 = getelementptr i8, ptr %d, i64 127
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %gep.128.iv = getelementptr i64, ptr %gep.128, i64 %iv
  store i64 0, ptr %gep.128.iv, align 8
  %gep.iv= getelementptr i32, ptr %d, i64 %iv
  %l = load i32, ptr %gep.iv, align 4
  %iv.next = add i64 %iv, 1
  %ec = icmp eq i64 %iv.next, 32
  br i1 %ec, label %exit, label %loop

exit:
  ret i32 %l
}

define void @completely_after_stores_with_different_sizes(ptr %dst) {
; CHECK-LABEL: 'completely_after_stores_with_different_sizes'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Memory dependences are safe
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  %gep.dst.128 = getelementptr nuw i8, ptr %dst, i64 128
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %gep.iv = getelementptr i16, ptr %dst, i64 %iv
  store i16 0, ptr %gep.iv, align 2
  %gep.dst.128.iv = getelementptr i8, ptr %gep.dst.128, i64 %iv
  store i8 0, ptr %gep.dst.128.iv, align 1
  %iv.next = add i64 %iv, 1
  %ec = icmp eq i64 %iv.next, 64
  br i1 %ec, label %exit, label %loop

exit:
  ret void
}


define void @may_overlap_stores_with_different_sizes(ptr %dst) {
; CHECK-LABEL: 'may_overlap_stores_with_different_sizes'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Memory dependences are safe with run-time checks
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Check 0:
; CHECK-NEXT:        Comparing group GRP0:
; CHECK-NEXT:          %gep.iv = getelementptr i16, ptr %dst, i64 %iv
; CHECK-NEXT:        Against group GRP1:
; CHECK-NEXT:          %gep.dst.128.iv = getelementptr i8, ptr %gep.dst.128, i64 %iv
; CHECK-NEXT:      Grouped accesses:
; CHECK-NEXT:        Group GRP0:
; CHECK-NEXT:          (Low: %dst High: (130 + %dst))
; CHECK-NEXT:            Member: {%dst,+,2}<nw><%loop>
; CHECK-NEXT:        Group GRP1:
; CHECK-NEXT:          (Low: (128 + %dst)<nuw> High: (193 + %dst))
; CHECK-NEXT:            Member: {(128 + %dst)<nuw>,+,1}<nw><%loop>
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  %gep.dst.128 = getelementptr nuw i8, ptr %dst, i64 128
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %gep.iv = getelementptr i16, ptr %dst, i64 %iv
  store i16 0, ptr %gep.iv, align 2
  %gep.dst.128.iv = getelementptr i8, ptr %gep.dst.128, i64 %iv
  store i8 0, ptr %gep.dst.128.iv, align 1
  %iv.next = add i64 %iv, 1
  %ec = icmp eq i64 %iv.next, 65
  br i1 %ec, label %exit, label %loop

exit:                            ; preds = %loop
  ret void
}

define void @completely_before_or_after_non_const_distance(ptr %dst) {
; CHECK-LABEL: 'completely_before_or_after_non_const_distance'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Memory dependences are safe
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  %gep.off = getelementptr i8, ptr %dst, i64 576
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %iv.mul = mul i64 %iv, 84
  %gep.404 = getelementptr i8, ptr %dst, i64 404
  %gep.iv.mul = getelementptr i8, ptr %gep.404, i64 %iv.mul
  store i32 0, ptr %gep.iv.mul, align 4
  %gep.off.iv = getelementptr i32, ptr %gep.off, i64 %iv
  store i32 0, ptr %gep.off.iv, align 4
  %iv.next = add i64 %iv, 1
  %ec = icmp eq i64 %iv.next, 3
  br i1 %ec, label %exit, label %loop

exit:
  ret void
}

define void @overlap_non_const_distance(ptr %dst) {
; CHECK-LABEL: 'overlap_non_const_distance'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop
; CHECK-NEXT:  Unknown data dependence.
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:        Unknown:
; CHECK-NEXT:            store i32 0, ptr %gep.iv.mul, align 4 ->
; CHECK-NEXT:            store i32 0, ptr %gep.off.iv, align 4
; CHECK-EMPTY:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  %gep.off = getelementptr i8, ptr %dst, i64 575
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %iv.mul = mul i64 %iv, 84
  %gep.404 = getelementptr i8, ptr %dst, i64 404
  %gep.iv.mul = getelementptr i8, ptr %gep.404, i64 %iv.mul
  store i32 0, ptr %gep.iv.mul, align 4
  %gep.off.iv = getelementptr i32, ptr %gep.off, i64 %iv
  store i32 0, ptr %gep.off.iv, align 4
  %iv.next = add i64 %iv, 1
  %ec = icmp eq i64 %iv.next, 3
  br i1 %ec, label %exit, label %loop

exit:
  ret void
}

define void @accesses_completely_before_or_after_instead_backwards_vectorizable(ptr dereferenceable(800) %dst) {
; CHECK-LABEL: 'accesses_completely_before_or_after_instead_backwards_vectorizable'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Memory dependences are safe
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %mul.2 = shl i64 %iv, 1
  %gep.mul.2 = getelementptr i16, ptr %dst, i64 %mul.2
  store i16 0, ptr %gep.mul.2, align 2
  %iv.32 = add i64 %iv, 32
  %gep.iv.32 = getelementptr i16, ptr %dst, i64 %iv.32
  store i16 0, ptr %gep.iv.32, align 2
  %iv.next = add i64 %iv, 1
  %ec = icmp eq i64 %iv, 15
  br i1 %ec, label %exit, label %loop

exit:
  ret void
}

define void @accesses_may_overlap_backwards_vectorizable(ptr dereferenceable(800) %dst) {
; CHECK-LABEL: 'accesses_may_overlap_backwards_vectorizable'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Memory dependences are safe with a maximum safe vector width of 128 bits
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:        BackwardVectorizable:
; CHECK-NEXT:            store i16 0, ptr %gep.mul.2, align 2 ->
; CHECK-NEXT:            store i16 0, ptr %gep.iv.32, align 2
; CHECK-EMPTY:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Grouped accesses:
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %mul.2 = shl i64 %iv, 1
  %gep.mul.2 = getelementptr i16, ptr %dst, i64 %mul.2
  store i16 0, ptr %gep.mul.2, align 2
  %iv.32 = add i64 %iv, 32
  %gep.iv.32 = getelementptr i16, ptr %dst, i64 %iv.32
  store i16 0, ptr %gep.iv.32, align 2
  %iv.next = add i64 %iv, 1
  %ec = icmp eq i64 %iv, 16
  br i1 %ec, label %exit, label %loop

exit:
  ret void
}