Lines Matching full:affine
14 affine.for %i = -1 to 10 {
15 affine.for %j = -1 to 10 {
16 %idx0 = affine.apply affine_map<(d0, d1) -> (d0)>(%i, %j)
17 %idx1 = affine.apply affine_map<(d0, d1) -> (d1)>(%i, %j)
19 %x = affine.load %A[%idx0, %idx1] : memref<9 x 9 x i32>
20 // expected-error@-1 {{'affine.load' op memref out of upper bound access along dimension #1}}
21 // expected-error@-2 {{'affine.load' op memref out of lower bound access along dimension #1}}
22 // expected-error@-3 {{'affine.load' op memref out of upper bound access along dimension #2}}
23 // expected-error@-4 {{'affine.load' op memref out of lower bound access along dimension #2}}
25 %idy = affine.apply affine_map<(d0, d1) -> (10*d0 - d1 + 19)>(%i, %j)
26 %y = affine.load %B[%idy] : memref<111 x i32>
30 affine.for %k = 0 to 10 {
32 %u = affine.load %B[%zero] : memref<111 x i32>
34 …%v = affine.load %B[%sym] : memref<111 x i32> // expected-error {{'affine.load' op memref out of u…
36 …affine.store %v, %B[%minusone] : memref<111 x i32> // expected-error {{'affine.store' op memref o…
46 affine.for %i = 0 to 256 {
47 affine.for %j = 0 to 256 {
48 %idx0 = affine.apply affine_map<(d0, d1, d2) -> (d0 mod 128 + 1)>(%i, %j, %j)
49 %idx1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4 + 1)>(%i, %j, %j)
50 %idx2 = affine.apply affine_map<(d0, d1, d2) -> (d2 ceildiv 4)>(%i, %j, %j)
51 %x = affine.load %A[%idx0, %idx1, %idx2] : memref<128 x 64 x 64 x i32>
52 // expected-error@-1 {{'affine.load' op memref out of upper bound access along dimension #1}}
53 // expected-error@-2 {{'affine.load' op memref out of upper bound access along dimension #2}}
54 // expected-error@-3 {{'affine.load' op memref out of upper bound access along dimension #3}}
55 %idy0 = affine.apply affine_map<(d0, d1, d2) -> (d0 mod 128)>(%i, %j, %j)
56 %idy1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4)>(%i, %j, %j)
57 %idy2 = affine.apply affine_map<(d0, d1, d2) -> (d2 ceildiv 4 - 1)>(%i, %j, %j)
58 …affine.store %x, %A[%idy0, %idy1, %idy2] : memref<128 x 64 x 64 x i32> // expected-error {{'affine…
71 affine.for %i = 0 to 256 {
72 affine.for %j = 0 to 256 {
74 // CHECK: %{{.*}} = affine.apply {{#map.*}}(%{{.*}}, %{{.*}})
75 // CHECK-NEXT: %{{.*}} = affine.load %{{.*}}[%{{.*}}, %{{.*}}] : memref<257x256xi32>
76 // CHECK-NEXT: %{{.*}} = affine.apply {{#map.*}}(%{{.*}}, %{{.*}})
77 // CHECK-NEXT: %{{.*}} = affine.load %{{.*}}[%{{.*}}] : memref<1xi32>
78 %idx0 = affine.apply affine_map<(d0, d1) -> ( 64 * (d0 ceildiv 64))>(%i, %j)
82 %x = affine.load %A[%idx0, %zero] : memref<257 x 256 x i32>
83 %idy = affine.apply affine_map<(d0, d1) -> (d0 floordiv 256)>(%i, %i)
84 %y = affine.load %B[%idy] : memref<1 x i32>
95 affine.for %i = 0 to 256 {
96 affine.for %j = 0 to 256 {
97 %idx0 = affine.apply affine_map<(d0, d1, d2) -> (d0 mod 128 + 1)>(%i, %j, %j)
98 %idx1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4 + 1)>(%i, %j, %j)
99 %idx2 = affine.apply affine_map<(d0, d1, d2) -> (d2 ceildiv 4)>(%i, %j, %j)
100 %x = affine.load %A[%idx0, %idx1, %idx2] : memref<128 x 64 x 64 x i32>
101 // expected-error@-1 {{'affine.load' op memref out of upper bound access along dimension #1}}
102 // expected-error@-2 {{'affine.load' op memref out of upper bound access along dimension #2}}
103 // expected-error@-3 {{'affine.load' op memref out of upper bound access along dimension #3}}
104 %idy0 = affine.apply affine_map<(d0, d1, d2) -> (d0 mod 128)>(%i, %j, %j)
105 %idy1 = affine.apply affine_map<(d0, d1, d2) -> (d1 floordiv 4)>(%i, %j, %j)
106 %idy2 = affine.apply affine_map<(d0, d1, d2) -> (d2 ceildiv 4 - 1)>(%i, %j, %j)
107 …affine.store %x, %A[%idy0, %idy1, %idy2] : memref<128 x 64 x 64 x i32> // expected-error {{'affine…
117 affine.for %i = 0 to 256 {
118 affine.for %j = 0 to 256 {
119 %idx0 = affine.apply affine_map<(d0, d1) -> ((d0 mod 1024) floordiv 4)>(%i, %j)
120 %idx1 = affine.apply affine_map<(d0, d1) -> ((((d1 mod 128) mod 32) ceildiv 4) * 32)>(%i, %j)
121 …affine.load %A[%idx0, %idx1] : memref<256 x 256 x i32> // expected-error {{'affine.load' op memref…
130 affine.for %i = 0 to 10 {
131 %idx = affine.apply affine_map<(d0)[s0] -> (d0 * s0)>(%i)[%N]
132 %y = affine.load %B[%idx] : memref<10 x i32>
133 // expected-error@-1 {{getMemRefRegion: compose affine map failed}}
141 affine.for %ii = 0 to 64 {
142 %idx0 = affine.apply affine_map<(d0) -> ((d0 mod 147456) floordiv 1152)> (%ii)
143 %idx1 = affine.apply affine_map<(d0) -> (((d0 mod 147456) mod 1152) floordiv 384)> (%ii)
144 %v = affine.load %A[%idx0, %idx1] : memref<2x2xi32>
156 affine.for %ii = 0 to 64 {
157 affine.for %jj = 0 to 9 {
158 %a0 = affine.apply affine_map<(d0, d1) -> (d0 * (9 * 1024) + d1 * 128)> (%ii, %jj)
159 %a10 = affine.apply affine_map<(d0) ->
161 %a11 = affine.apply affine_map<(d0) ->
163 %a12 = affine.apply affine_map<(d0) ->
165 %a13 = affine.apply affine_map<(d0) ->
167 %a14 = affine.apply affine_map<(d0) ->
169 %a15 = affine.apply affine_map<(d0) ->
172 %v0 = affine.load %in[%a10, %a11, %a13, %a14, %a12, %a15]
183 affine.store %c0, %arg0[] : memref<i32>
192 affine.for %i0 = 10 to 11 {
193 %idy = affine.apply affine_map<(d0) -> (100 * d0 floordiv 1000)> (%i0)
194 …affine.store %c9, %in[%idy] : memref<1xi32> // expected-error {{'affine.store' op memref out of up…
212 affine.for %i0 = 0 to 64 {
213 affine.for %i1 = 0 to 9 {
214 %2 = affine.apply #map3(%i0, %i1)
215 %3 = affine.apply #map4(%i0, %i1)
216 %4 = affine.apply #map5(%i0, %i1)
217 %5 = affine.load %arg0[%2, %c0, %4, %c0] : memref<4x4x16x1xf32>
233 affine.for %i0 = 0 to 4096 {
234 affine.for %i1 = #map0(%i0) to #map1(%i0) {
235 affine.load %0[%i1] : memref<7 x f32>
236 affine.load %1[%i1] : memref<6 x f32>
237 // expected-error@-1 {{'affine.load' op memref out of upper bound access along dimension #1}}
255 affine.for %i0 = 0 to 4096 {
256 affine.for %i1 = #map0(%i0) to #map1(%i0) {
257 affine.load %0[%i1] : memref<1027 x f32>
258 affine.load %1[%i1] : memref<1026 x f32>
259 // expected-error@-1 {{'affine.load' op memref out of upper bound access along dimension #1}}
261 affine.for %i2 = 0 to #map2(%N) {
263 %v = affine.load %2[%i2] : memref<4096 x f32>
271 // This should not give an out of bounds error. The result of the affine.apply
279 affine.for %i0 = 4 to 1028 step 4 {
280 %i1 = affine.apply affine_map<(d0) -> (d0 - 4)> (%i0)
281 affine.for %i2 = #map_lb(%i1) to #map_ub(%i1) {
282 %0 = affine.load %arg0[%i2] : memref<1024xf32>
291 affine.for %i = 0 to 100 {
292 affine.load %Z[] : memref<f32>
299 affine.parallel (%i) = (0) to (3000) {
300 affine.for %j = 0 to 2048 {
301 affine.load %M[%i, %j] : memref<2048x2048xf64>
302 … // expected-error@above {{'affine.load' op memref out of upper bound access along dimension #1}}