/
scalrep.mlir
790 lines (731 loc) · 27.3 KB
/
scalrep.mlir
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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
// RUN: mlir-opt -allow-unregistered-dialect %s -affine-scalrep | FileCheck %s
// CHECK-DAG: [[$MAP0:#map[0-9]*]] = affine_map<(d0, d1) -> (d1 + 1)>
// CHECK-DAG: [[$MAP1:#map[0-9]*]] = affine_map<(d0, d1) -> (d0)>
// CHECK-DAG: [[$MAP2:#map[0-9]*]] = affine_map<(d0, d1) -> (d1)>
// CHECK-DAG: [[$MAP3:#map[0-9]*]] = affine_map<(d0, d1) -> (d0 - 1)>
// CHECK-DAG: [[$MAP4:#map[0-9]*]] = affine_map<(d0) -> (d0 + 1)>
// CHECK-LABEL: func @simple_store_load() {
func.func @simple_store_load() {
%cf7 = arith.constant 7.0 : f32
%m = memref.alloc() : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.store %cf7, %m[%i0] : memref<10xf32>
%v0 = affine.load %m[%i0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
}
memref.dealloc %m : memref<10xf32>
return
// CHECK: %[[C7:.*]] = arith.constant 7.000000e+00 : f32
// CHECK-NEXT: affine.for %{{.*}} = 0 to 10 {
// CHECK-NEXT: arith.addf %[[C7]], %[[C7]] : f32
// CHECK-NEXT: }
// CHECK-NEXT: return
}
// CHECK-LABEL: func @multi_store_load() {
func.func @multi_store_load() {
%cf7 = arith.constant 7.0 : f32
%cf8 = arith.constant 8.0 : f32
%cf9 = arith.constant 9.0 : f32
%m = gpu.alloc() : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.store %cf7, %m[%i0] : memref<10xf32>
%v0 = affine.load %m[%i0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
affine.store %cf8, %m[%i0] : memref<10xf32>
affine.store %cf9, %m[%i0] : memref<10xf32>
%v2 = affine.load %m[%i0] : memref<10xf32>
%v3 = affine.load %m[%i0] : memref<10xf32>
%v4 = arith.mulf %v2, %v3 : f32
}
gpu.dealloc %m : memref<10xf32>
return
// CHECK-NEXT: %[[C7:.*]] = arith.constant 7.000000e+00 : f32
// CHECK-NEXT: arith.constant 8.000000e+00 : f32
// CHECK-NEXT: %[[C9:.*]] = arith.constant 9.000000e+00 : f32
// CHECK-NEXT: affine.for %{{.*}} = 0 to 10 {
// CHECK-NEXT: arith.addf %[[C7]], %[[C7]] : f32
// CHECK-NEXT: arith.mulf %[[C9]], %[[C9]] : f32
// CHECK-NEXT: }
// CHECK-NEXT: return
}
// The store-load forwarding can see through affine apply's since it relies on
// dependence information.
// CHECK-LABEL: func @store_load_affine_apply
func.func @store_load_affine_apply() -> memref<10x10xf32> {
%cf7 = arith.constant 7.0 : f32
%m = memref.alloc() : memref<10x10xf32>
affine.for %i0 = 0 to 10 {
affine.for %i1 = 0 to 10 {
%t0 = affine.apply affine_map<(d0, d1) -> (d1 + 1)>(%i0, %i1)
%t1 = affine.apply affine_map<(d0, d1) -> (d0)>(%i0, %i1)
%idx0 = affine.apply affine_map<(d0, d1) -> (d1)> (%t0, %t1)
%idx1 = affine.apply affine_map<(d0, d1) -> (d0 - 1)> (%t0, %t1)
affine.store %cf7, %m[%idx0, %idx1] : memref<10x10xf32>
// CHECK-NOT: affine.load %{{[0-9]+}}
%v0 = affine.load %m[%i0, %i1] : memref<10x10xf32>
%v1 = arith.addf %v0, %v0 : f32
}
}
// The memref and its stores won't be erased due to this memref return.
return %m : memref<10x10xf32>
// CHECK: %{{.*}} = arith.constant 7.000000e+00 : f32
// CHECK-NEXT: %{{.*}} = memref.alloc() : memref<10x10xf32>
// CHECK-NEXT: affine.for %{{.*}} = 0 to 10 {
// CHECK-NEXT: affine.for %{{.*}} = 0 to 10 {
// CHECK-NEXT: %{{.*}} = affine.apply [[$MAP0]](%{{.*}}, %{{.*}})
// CHECK-NEXT: %{{.*}} = affine.apply [[$MAP1]](%{{.*}}, %{{.*}})
// CHECK-NEXT: %{{.*}} = affine.apply [[$MAP2]](%{{.*}}, %{{.*}})
// CHECK-NEXT: %{{.*}} = affine.apply [[$MAP3]](%{{.*}}, %{{.*}})
// CHECK-NEXT: affine.store %{{.*}}, %{{.*}}[%{{.*}}, %{{.*}}] : memref<10x10xf32>
// CHECK-NEXT: %{{.*}} = arith.addf %{{.*}}, %{{.*}} : f32
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: return %{{.*}} : memref<10x10xf32>
}
// CHECK-LABEL: func @store_load_nested
func.func @store_load_nested(%N : index) {
%cf7 = arith.constant 7.0 : f32
%m = memref.alloc() : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.store %cf7, %m[%i0] : memref<10xf32>
affine.for %i1 = 0 to %N {
%v0 = affine.load %m[%i0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
}
}
return
// CHECK: %{{.*}} = arith.constant 7.000000e+00 : f32
// CHECK-NEXT: affine.for %{{.*}} = 0 to 10 {
// CHECK-NEXT: affine.for %{{.*}} = 0 to %{{.*}} {
// CHECK-NEXT: %{{.*}} = arith.addf %{{.*}}, %{{.*}} : f32
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: return
}
// No forwarding happens here since either of the two stores could be the last
// writer; store/load forwarding will however be possible here once loop live
// out SSA scalars are available.
// CHECK-LABEL: func @multi_store_load_nested_no_fwd
func.func @multi_store_load_nested_no_fwd(%N : index) {
%cf7 = arith.constant 7.0 : f32
%cf8 = arith.constant 8.0 : f32
%m = memref.alloc() : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.store %cf7, %m[%i0] : memref<10xf32>
affine.for %i1 = 0 to %N {
affine.store %cf8, %m[%i1] : memref<10xf32>
}
affine.for %i2 = 0 to %N {
// CHECK: %{{[0-9]+}} = affine.load %{{.*}}[%{{.*}}] : memref<10xf32>
%v0 = affine.load %m[%i0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
}
}
return
}
// No forwarding happens here since both stores have a value going into
// the load.
// CHECK-LABEL: func @store_load_store_nested_no_fwd
func.func @store_load_store_nested_no_fwd(%N : index) {
%cf7 = arith.constant 7.0 : f32
%cf9 = arith.constant 9.0 : f32
%m = memref.alloc() : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.store %cf7, %m[%i0] : memref<10xf32>
affine.for %i1 = 0 to %N {
// CHECK: %{{[0-9]+}} = affine.load %{{.*}}[%{{.*}}] : memref<10xf32>
%v0 = affine.load %m[%i0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
affine.store %cf9, %m[%i0] : memref<10xf32>
}
}
return
}
// Forwarding happens here since the last store postdominates all other stores
// and other forwarding criteria are satisfied.
// CHECK-LABEL: func @multi_store_load_nested_fwd
func.func @multi_store_load_nested_fwd(%N : index) {
%cf7 = arith.constant 7.0 : f32
%cf8 = arith.constant 8.0 : f32
%cf9 = arith.constant 9.0 : f32
%cf10 = arith.constant 10.0 : f32
%m = memref.alloc() : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.store %cf7, %m[%i0] : memref<10xf32>
affine.for %i1 = 0 to %N {
affine.store %cf8, %m[%i1] : memref<10xf32>
}
affine.for %i2 = 0 to %N {
affine.store %cf9, %m[%i2] : memref<10xf32>
}
affine.store %cf10, %m[%i0] : memref<10xf32>
affine.for %i3 = 0 to %N {
// CHECK-NOT: %{{[0-9]+}} = affine.load
%v0 = affine.load %m[%i0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
}
}
return
}
// There is no unique load location for the store to forward to.
// CHECK-LABEL: func @store_load_no_fwd
func.func @store_load_no_fwd() {
%cf7 = arith.constant 7.0 : f32
%m = memref.alloc() : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.store %cf7, %m[%i0] : memref<10xf32>
affine.for %i1 = 0 to 10 {
affine.for %i2 = 0 to 10 {
// CHECK: affine.load
%v0 = affine.load %m[%i2] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
}
}
}
return
}
// Forwarding happens here as there is a one-to-one store-load correspondence.
// CHECK-LABEL: func @store_load_fwd
func.func @store_load_fwd() {
%cf7 = arith.constant 7.0 : f32
%c0 = arith.constant 0 : index
%m = memref.alloc() : memref<10xf32>
affine.store %cf7, %m[%c0] : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.for %i1 = 0 to 10 {
affine.for %i2 = 0 to 10 {
// CHECK-NOT: affine.load %{{[0-9]}}+
%v0 = affine.load %m[%c0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
}
}
}
return
}
// Although there is a dependence from the second store to the load, it is
// satisfied by the outer surrounding loop, and does not prevent the first
// store to be forwarded to the load.
func.func @store_load_store_nested_fwd(%N : index) -> f32 {
%cf7 = arith.constant 7.0 : f32
%cf9 = arith.constant 9.0 : f32
%c0 = arith.constant 0 : index
%c1 = arith.constant 1 : index
%m = memref.alloc() : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.store %cf7, %m[%i0] : memref<10xf32>
affine.for %i1 = 0 to %N {
%v0 = affine.load %m[%i0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
%idx = affine.apply affine_map<(d0) -> (d0 + 1)> (%i0)
affine.store %cf9, %m[%idx] : memref<10xf32>
}
}
// Due to this load, the memref isn't optimized away.
%v3 = affine.load %m[%c1] : memref<10xf32>
return %v3 : f32
// CHECK: %{{.*}} = memref.alloc() : memref<10xf32>
// CHECK-NEXT: affine.for %{{.*}} = 0 to 10 {
// CHECK-NEXT: affine.store %{{.*}}, %{{.*}}[%{{.*}}] : memref<10xf32>
// CHECK-NEXT: affine.for %{{.*}} = 0 to %{{.*}} {
// CHECK-NEXT: %{{.*}} = arith.addf %{{.*}}, %{{.*}} : f32
// CHECK-NEXT: %{{.*}} = affine.apply [[$MAP4]](%{{.*}})
// CHECK-NEXT: affine.store %{{.*}}, %{{.*}}[%{{.*}}] : memref<10xf32>
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: %{{.*}} = affine.load %{{.*}}[%{{.*}}] : memref<10xf32>
// CHECK-NEXT: return %{{.*}} : f32
}
// CHECK-LABEL: func @should_not_fwd
func.func @should_not_fwd(%A: memref<100xf32>, %M : index, %N : index) -> f32 {
%cf = arith.constant 0.0 : f32
affine.store %cf, %A[%M] : memref<100xf32>
// CHECK: affine.load %{{.*}}[%{{.*}}]
%v = affine.load %A[%N] : memref<100xf32>
return %v : f32
}
// Can store forward to A[%j, %i], but no forwarding to load on %A[%i, %j]
// CHECK-LABEL: func @refs_not_known_to_be_equal
func.func @refs_not_known_to_be_equal(%A : memref<100 x 100 x f32>, %M : index) {
%N = affine.apply affine_map<(d0) -> (d0 + 1)> (%M)
%cf1 = arith.constant 1.0 : f32
affine.for %i = 0 to 100 {
// CHECK: affine.for %[[I:.*]] =
affine.for %j = 0 to 100 {
// CHECK: affine.for %[[J:.*]] =
// CHECK: affine.load %{{.*}}[%[[I]], %[[J]]]
%u = affine.load %A[%i, %j] : memref<100x100xf32>
// CHECK-NEXT: affine.store %{{.*}}, %{{.*}}[%[[J]], %[[I]]]
affine.store %cf1, %A[%j, %i] : memref<100x100xf32>
// CHECK-NEXT: affine.load %{{.*}}[%[[I]], %[[J]]]
%v = affine.load %A[%i, %j] : memref<100x100xf32>
// This load should disappear.
%w = affine.load %A[%j, %i] : memref<100x100xf32>
// CHECK-NEXT: "foo"
"foo" (%u, %v, %w) : (f32, f32, f32) -> ()
}
}
return
}
// The test checks for value forwarding from vector stores to vector loads.
// The value loaded from %in can directly be stored to %out by eliminating
// store and load from %tmp.
func.func @vector_forwarding(%in : memref<512xf32>, %out : memref<512xf32>) {
%tmp = memref.alloc() : memref<512xf32>
affine.for %i = 0 to 16 {
%ld0 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<32xf32>
affine.vector_store %ld0, %tmp[32*%i] : memref<512xf32>, vector<32xf32>
%ld1 = affine.vector_load %tmp[32*%i] : memref<512xf32>, vector<32xf32>
affine.vector_store %ld1, %out[32*%i] : memref<512xf32>, vector<32xf32>
}
return
}
// CHECK-LABEL: func @vector_forwarding
// CHECK: affine.for %{{.*}} = 0 to 16 {
// CHECK-NEXT: %[[LDVAL:.*]] = affine.vector_load
// CHECK-NEXT: affine.vector_store %[[LDVAL]],{{.*}}
// CHECK-NEXT: }
func.func @vector_no_forwarding(%in : memref<512xf32>, %out : memref<512xf32>) {
%tmp = memref.alloc() : memref<512xf32>
affine.for %i = 0 to 16 {
%ld0 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<32xf32>
affine.vector_store %ld0, %tmp[32*%i] : memref<512xf32>, vector<32xf32>
%ld1 = affine.vector_load %tmp[32*%i] : memref<512xf32>, vector<16xf32>
affine.vector_store %ld1, %out[32*%i] : memref<512xf32>, vector<16xf32>
}
return
}
// CHECK-LABEL: func @vector_no_forwarding
// CHECK: affine.for %{{.*}} = 0 to 16 {
// CHECK-NEXT: %[[LDVAL:.*]] = affine.vector_load
// CHECK-NEXT: affine.vector_store %[[LDVAL]],{{.*}}
// CHECK-NEXT: %[[LDVAL1:.*]] = affine.vector_load
// CHECK-NEXT: affine.vector_store %[[LDVAL1]],{{.*}}
// CHECK-NEXT: }
// CHECK-LABEL: func @simple_three_loads
func.func @simple_three_loads(%in : memref<10xf32>) {
affine.for %i0 = 0 to 10 {
// CHECK: affine.load
%v0 = affine.load %in[%i0] : memref<10xf32>
// CHECK-NOT: affine.load
%v1 = affine.load %in[%i0] : memref<10xf32>
%v2 = arith.addf %v0, %v1 : f32
%v3 = affine.load %in[%i0] : memref<10xf32>
%v4 = arith.addf %v2, %v3 : f32
}
return
}
// CHECK-LABEL: func @nested_loads_const_index
func.func @nested_loads_const_index(%in : memref<10xf32>) {
%c0 = arith.constant 0 : index
// CHECK: affine.load
%v0 = affine.load %in[%c0] : memref<10xf32>
affine.for %i0 = 0 to 10 {
affine.for %i1 = 0 to 20 {
affine.for %i2 = 0 to 30 {
// CHECK-NOT: affine.load
%v1 = affine.load %in[%c0] : memref<10xf32>
%v2 = arith.addf %v0, %v1 : f32
}
}
}
return
}
// CHECK-LABEL: func @nested_loads
func.func @nested_loads(%N : index, %in : memref<10xf32>) {
affine.for %i0 = 0 to 10 {
// CHECK: affine.load
%v0 = affine.load %in[%i0] : memref<10xf32>
affine.for %i1 = 0 to %N {
// CHECK-NOT: affine.load
%v1 = affine.load %in[%i0] : memref<10xf32>
%v2 = arith.addf %v0, %v1 : f32
}
}
return
}
// CHECK-LABEL: func @nested_loads_different_memref_accesses_no_cse
func.func @nested_loads_different_memref_accesses_no_cse(%in : memref<10xf32>) {
affine.for %i0 = 0 to 10 {
// CHECK: affine.load
%v0 = affine.load %in[%i0] : memref<10xf32>
affine.for %i1 = 0 to 20 {
// CHECK: affine.load
%v1 = affine.load %in[%i1] : memref<10xf32>
%v2 = arith.addf %v0, %v1 : f32
}
}
return
}
// CHECK-LABEL: func @load_load_store
func.func @load_load_store(%m : memref<10xf32>) {
affine.for %i0 = 0 to 10 {
// CHECK: affine.load
%v0 = affine.load %m[%i0] : memref<10xf32>
// CHECK-NOT: affine.load
%v1 = affine.load %m[%i0] : memref<10xf32>
%v2 = arith.addf %v0, %v1 : f32
affine.store %v2, %m[%i0] : memref<10xf32>
}
return
}
// CHECK-LABEL: func @load_load_store_2_loops_no_cse
func.func @load_load_store_2_loops_no_cse(%N : index, %m : memref<10xf32>) {
affine.for %i0 = 0 to 10 {
// CHECK: affine.load
%v0 = affine.load %m[%i0] : memref<10xf32>
affine.for %i1 = 0 to %N {
// CHECK: affine.load
%v1 = affine.load %m[%i0] : memref<10xf32>
%v2 = arith.addf %v0, %v1 : f32
affine.store %v2, %m[%i0] : memref<10xf32>
}
}
return
}
// CHECK-LABEL: func @load_load_store_3_loops_no_cse
func.func @load_load_store_3_loops_no_cse(%m : memref<10xf32>) {
%cf1 = arith.constant 1.0 : f32
affine.for %i0 = 0 to 10 {
// CHECK: affine.load
%v0 = affine.load %m[%i0] : memref<10xf32>
affine.for %i1 = 0 to 20 {
affine.for %i2 = 0 to 30 {
// CHECK: affine.load
%v1 = affine.load %m[%i0] : memref<10xf32>
%v2 = arith.addf %v0, %v1 : f32
}
affine.store %cf1, %m[%i0] : memref<10xf32>
}
}
return
}
// CHECK-LABEL: func @load_load_store_3_loops
func.func @load_load_store_3_loops(%m : memref<10xf32>) {
%cf1 = arith.constant 1.0 : f32
affine.for %i0 = 0 to 10 {
affine.for %i1 = 0 to 20 {
// CHECK: affine.load
%v0 = affine.load %m[%i0] : memref<10xf32>
affine.for %i2 = 0 to 30 {
// CHECK-NOT: affine.load
%v1 = affine.load %m[%i0] : memref<10xf32>
%v2 = arith.addf %v0, %v1 : f32
}
}
affine.store %cf1, %m[%i0] : memref<10xf32>
}
return
}
// CHECK-LABEL: func @loads_in_sibling_loops_const_index_no_cse
func.func @loads_in_sibling_loops_const_index_no_cse(%m : memref<10xf32>) {
%c0 = arith.constant 0 : index
affine.for %i0 = 0 to 10 {
// CHECK: affine.load
%v0 = affine.load %m[%c0] : memref<10xf32>
}
affine.for %i1 = 0 to 10 {
// CHECK: affine.load
%v0 = affine.load %m[%c0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
}
return
}
// CHECK-LABEL: func @load_load_affine_apply
func.func @load_load_affine_apply(%in : memref<10x10xf32>) {
affine.for %i0 = 0 to 10 {
affine.for %i1 = 0 to 10 {
%t0 = affine.apply affine_map<(d0, d1) -> (d1 + 1)>(%i0, %i1)
%t1 = affine.apply affine_map<(d0, d1) -> (d0)>(%i0, %i1)
%idx0 = affine.apply affine_map<(d0, d1) -> (d1)> (%t0, %t1)
%idx1 = affine.apply affine_map<(d0, d1) -> (d0 - 1)> (%t0, %t1)
// CHECK: affine.load
%v0 = affine.load %in[%idx0, %idx1] : memref<10x10xf32>
// CHECK-NOT: affine.load
%v1 = affine.load %in[%i0, %i1] : memref<10x10xf32>
%v2 = arith.addf %v0, %v1 : f32
}
}
return
}
// CHECK-LABEL: func @vector_loads
func.func @vector_loads(%in : memref<512xf32>, %out : memref<512xf32>) {
affine.for %i = 0 to 16 {
// CHECK: affine.vector_load
%ld0 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<32xf32>
// CHECK-NOT: affine.vector_load
%ld1 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<32xf32>
%add = arith.addf %ld0, %ld1 : vector<32xf32>
affine.vector_store %ld1, %out[32*%i] : memref<512xf32>, vector<32xf32>
}
return
}
// CHECK-LABEL: func @vector_loads_no_cse
func.func @vector_loads_no_cse(%in : memref<512xf32>, %out : memref<512xf32>) {
affine.for %i = 0 to 16 {
// CHECK: affine.vector_load
%ld0 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<32xf32>
// CHECK: affine.vector_load
%ld1 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<16xf32>
affine.vector_store %ld1, %out[32*%i] : memref<512xf32>, vector<16xf32>
}
return
}
// CHECK-LABEL: func @vector_load_store_load_no_cse
func.func @vector_load_store_load_no_cse(%in : memref<512xf32>, %out : memref<512xf32>) {
affine.for %i = 0 to 16 {
// CHECK: affine.vector_load
%ld0 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<32xf32>
affine.vector_store %ld0, %in[16*%i] : memref<512xf32>, vector<32xf32>
// CHECK: affine.vector_load
%ld1 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<32xf32>
%add = arith.addf %ld0, %ld1 : vector<32xf32>
affine.vector_store %ld1, %out[32*%i] : memref<512xf32>, vector<32xf32>
}
return
}
// CHECK-LABEL: func @reduction_multi_store
func.func @reduction_multi_store() -> memref<1xf32> {
%A = memref.alloc() : memref<1xf32>
%cf0 = arith.constant 0.0 : f32
%cf5 = arith.constant 5.0 : f32
affine.store %cf0, %A[0] : memref<1xf32>
affine.for %i = 0 to 100 step 2 {
%l = affine.load %A[0] : memref<1xf32>
%s = arith.addf %l, %cf5 : f32
// Store to load forwarding from this store should happen.
affine.store %s, %A[0] : memref<1xf32>
%m = affine.load %A[0] : memref<1xf32>
"test.foo"(%m) : (f32) -> ()
}
// CHECK: affine.for
// CHECK: affine.load
// CHECK: affine.store %[[S:.*]],
// CHECK-NEXT: "test.foo"(%[[S]])
return %A : memref<1xf32>
}
// CHECK-LABEL: func @vector_load_affine_apply_store_load
func.func @vector_load_affine_apply_store_load(%in : memref<512xf32>, %out : memref<512xf32>) {
%cf1 = arith.constant 1: index
affine.for %i = 0 to 15 {
// CHECK: affine.vector_load
%ld0 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<32xf32>
%idx = affine.apply affine_map<(d0) -> (d0 + 1)> (%i)
affine.vector_store %ld0, %in[32*%idx] : memref<512xf32>, vector<32xf32>
// CHECK-NOT: affine.vector_load
%ld1 = affine.vector_load %in[32*%i] : memref<512xf32>, vector<32xf32>
%add = arith.addf %ld0, %ld1 : vector<32xf32>
affine.vector_store %ld1, %out[32*%i] : memref<512xf32>, vector<32xf32>
}
return
}
// CHECK-LABEL: func @external_no_forward_load
func.func @external_no_forward_load(%in : memref<512xf32>, %out : memref<512xf32>) {
affine.for %i = 0 to 16 {
%ld0 = affine.load %in[32*%i] : memref<512xf32>
affine.store %ld0, %out[32*%i] : memref<512xf32>
"memop"(%in, %out) : (memref<512xf32>, memref<512xf32>) -> ()
%ld1 = affine.load %in[32*%i] : memref<512xf32>
affine.store %ld1, %out[32*%i] : memref<512xf32>
}
return
}
// CHECK: affine.load
// CHECK: affine.store
// CHECK: affine.load
// CHECK: affine.store
// CHECK-LABEL: func @external_no_forward_store
func.func @external_no_forward_store(%in : memref<512xf32>, %out : memref<512xf32>) {
%cf1 = arith.constant 1.0 : f32
affine.for %i = 0 to 16 {
affine.store %cf1, %in[32*%i] : memref<512xf32>
"memop"(%in, %out) : (memref<512xf32>, memref<512xf32>) -> ()
%ld1 = affine.load %in[32*%i] : memref<512xf32>
affine.store %ld1, %out[32*%i] : memref<512xf32>
}
return
}
// CHECK: affine.store
// CHECK: affine.load
// CHECK: affine.store
// CHECK-LABEL: func @no_forward_cast
func.func @no_forward_cast(%in : memref<512xf32>, %out : memref<512xf32>) {
%cf1 = arith.constant 1.0 : f32
%cf2 = arith.constant 2.0 : f32
%m2 = memref.cast %in : memref<512xf32> to memref<?xf32>
affine.for %i = 0 to 16 {
affine.store %cf1, %in[32*%i] : memref<512xf32>
affine.store %cf2, %m2[32*%i] : memref<?xf32>
%ld1 = affine.load %in[32*%i] : memref<512xf32>
affine.store %ld1, %out[32*%i] : memref<512xf32>
}
return
}
// CHECK: affine.store
// CHECK-NEXT: affine.store
// CHECK-NEXT: affine.load
// CHECK-NEXT: affine.store
// Although there is a dependence from the second store to the load, it is
// satisfied by the outer surrounding loop, and does not prevent the first
// store to be forwarded to the load.
// CHECK-LABEL: func @overlap_no_fwd
func.func @overlap_no_fwd(%N : index) -> f32 {
%cf7 = arith.constant 7.0 : f32
%cf9 = arith.constant 9.0 : f32
%c0 = arith.constant 0 : index
%c1 = arith.constant 1 : index
%m = memref.alloc() : memref<10xf32>
affine.for %i0 = 0 to 5 {
affine.store %cf7, %m[2 * %i0] : memref<10xf32>
affine.for %i1 = 0 to %N {
%v0 = affine.load %m[2 * %i0] : memref<10xf32>
%v1 = arith.addf %v0, %v0 : f32
affine.store %cf9, %m[%i0 + 1] : memref<10xf32>
}
}
// Due to this load, the memref isn't optimized away.
%v3 = affine.load %m[%c1] : memref<10xf32>
return %v3 : f32
// CHECK: affine.for %{{.*}} = 0 to 5 {
// CHECK-NEXT: affine.store %{{.*}}, %{{.*}}[%{{.*}}] : memref<10xf32>
// CHECK-NEXT: affine.for %{{.*}} = 0 to %{{.*}} {
// CHECK-NEXT: %{{.*}} = affine.load
// CHECK-NEXT: %{{.*}} = arith.addf %{{.*}}, %{{.*}} : f32
// CHECK-NEXT: affine.store %{{.*}}, %{{.*}}[%{{.*}}] : memref<10xf32>
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: %{{.*}} = affine.load %{{.*}}[%{{.*}}] : memref<10xf32>
// CHECK-NEXT: return %{{.*}} : f32
}
// CHECK-LABEL: func @redundant_store_elim
func.func @redundant_store_elim(%out : memref<512xf32>) {
%cf1 = arith.constant 1.0 : f32
%cf2 = arith.constant 2.0 : f32
affine.for %i = 0 to 16 {
affine.store %cf1, %out[32*%i] : memref<512xf32>
affine.store %cf2, %out[32*%i] : memref<512xf32>
}
return
}
// CHECK: affine.for
// CHECK-NEXT: affine.store
// CHECK-NEXT: }
// CHECK-LABEL: func @redundant_store_elim_fail
func.func @redundant_store_elim_fail(%out : memref<512xf32>) {
%cf1 = arith.constant 1.0 : f32
%cf2 = arith.constant 2.0 : f32
affine.for %i = 0 to 16 {
affine.store %cf1, %out[32*%i] : memref<512xf32>
"test.use"(%out) : (memref<512xf32>) -> ()
affine.store %cf2, %out[32*%i] : memref<512xf32>
}
return
}
// CHECK: affine.for
// CHECK-NEXT: affine.store
// CHECK-NEXT: "test.use"
// CHECK-NEXT: affine.store
// CHECK-NEXT: }
// CHECK-LABEL: @with_inner_ops
func.func @with_inner_ops(%arg0: memref<?xf64>, %arg1: memref<?xf64>, %arg2: i1) {
%cst = arith.constant 0.000000e+00 : f64
%cst_0 = arith.constant 3.140000e+00 : f64
%cst_1 = arith.constant 1.000000e+00 : f64
affine.for %arg3 = 0 to 28 {
affine.store %cst, %arg1[%arg3] : memref<?xf64>
affine.store %cst_0, %arg1[%arg3] : memref<?xf64>
%0 = scf.if %arg2 -> (f64) {
scf.yield %cst_1 : f64
} else {
%1 = affine.load %arg1[%arg3] : memref<?xf64>
scf.yield %1 : f64
}
affine.store %0, %arg0[%arg3] : memref<?xf64>
}
return
}
// CHECK: %[[pi:.+]] = arith.constant 3.140000e+00 : f64
// CHECK: %{{.*}} = scf.if %arg2 -> (f64) {
// CHECK: scf.yield %{{.*}} : f64
// CHECK: } else {
// CHECK: scf.yield %[[pi]] : f64
// CHECK: }
// Check if scalar replacement works correctly when affine memory ops are in the
// body of an scf.for.
// CHECK-LABEL: func @affine_store_load_in_scope
func.func @affine_store_load_in_scope(%memref: memref<1x4094x510x1xf32>, %memref_2: memref<4x4x1x64xf32>, %memref_0: memref<1x2046x254x1x64xf32>) {
%c0 = arith.constant 0 : index
%c1 = arith.constant 1 : index
%c2 = arith.constant 2 : index
%c64 = arith.constant 64 : index
%c768 = arith.constant 768 : index
scf.for %i = %c0 to %c768 step %c1 {
%9 = arith.remsi %i, %c64 : index
%10 = arith.divsi %i, %c64 : index
%11 = arith.remsi %10, %c2 : index
%12 = arith.divsi %10, %c2 : index
test.affine_scope {
%14 = arith.muli %12, %c2 : index
%15 = arith.addi %c2, %14 : index
%16 = arith.addi %15, %c0 : index
%18 = arith.muli %11, %c2 : index
%19 = arith.addi %c2, %18 : index
%20 = affine.load %memref[0, symbol(%16), symbol(%19), 0] : memref<1x4094x510x1xf32>
%21 = affine.load %memref_2[0, 0, 0, symbol(%9)] : memref<4x4x1x64xf32>
%24 = affine.load %memref_0[0, symbol(%12), symbol(%11), 0, symbol(%9)] : memref<1x2046x254x1x64xf32>
%25 = arith.mulf %20, %21 : f32
%26 = arith.addf %24, %25 : f32
// CHECK: %[[A:.*]] = arith.addf
affine.store %26, %memref_0[0, symbol(%12), symbol(%11), 0, symbol(%9)] : memref<1x2046x254x1x64xf32>
%27 = arith.addi %19, %c1 : index
%28 = affine.load %memref[0, symbol(%16), symbol(%27), 0] : memref<1x4094x510x1xf32>
%29 = affine.load %memref_2[0, 1, 0, symbol(%9)] : memref<4x4x1x64xf32>
%30 = affine.load %memref_0[0, symbol(%12), symbol(%11), 0, symbol(%9)] : memref<1x2046x254x1x64xf32>
%31 = arith.mulf %28, %29 : f32
%32 = arith.addf %30, %31 : f32
// The addf above will get the forwarded value from the store on
// %memref_0 above which is being loaded into %30..
// CHECK: arith.addf %[[A]],
"terminate"() : () -> ()
}
}
return
}
// No scalrep will be performed here but we ensure dependence correctly fails.
// CHECK-LABEL: func @affine_load_store_in_different_scopes
func.func @affine_load_store_in_different_scopes() -> memref<1xf32> {
%A = memref.alloc() : memref<1xf32>
%cf0 = arith.constant 0.0 : f32
%cf5 = arith.constant 5.0 : f32
affine.store %cf0, %A[0] : memref<1xf32>
test.affine_scope {
affine.store %cf5, %A[0] : memref<1xf32>
"test.terminate"() : () -> ()
}
%v = affine.load %A[0] : memref<1xf32>
// CHECK: affine.store
// CHECK-NEXT: test.affine_scope
// CHECK: affine.store
// CHECK: affine.load
return %A : memref<1xf32>
}
// No forwarding should again happen here.
// CHECK-LABEL: func.func @no_forwarding_across_scopes
func.func @no_forwarding_across_scopes() -> memref<1xf32> {
%A = memref.alloc() : memref<1xf32>
%cf0 = arith.constant 0.0 : f32
%cf5 = arith.constant 5.0 : f32
%c0 = arith.constant 0 : index
%c100 = arith.constant 100 : index
%c1 = arith.constant 1 : index
// Store shouldn't be forwarded to the load.
affine.store %cf0, %A[0] : memref<1xf32>
// CHECK: test.affine_scope
// CHECK-NEXT: affine.load
test.affine_scope {
%l = affine.load %A[0] : memref<1xf32>
%s = arith.addf %l, %cf5 : f32
affine.store %s, %A[0] : memref<1xf32>
"terminator"() : () -> ()
}
return %A : memref<1xf32>
}