-
Notifications
You must be signed in to change notification settings - Fork 116
/
local_storage_test.py
257 lines (197 loc) · 7.79 KB
/
local_storage_test.py
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
# Copyright 2019-2021 ETH Zurich and the DaCe authors. All rights reserved.
import unittest
import dace
import numpy as np
from dace.transformation.dataflow import MapTiling, OutLocalStorage
from dace.transformation.dataflow.local_storage import InLocalStorage
import dace.transformation.helpers as xfh
N = dace.symbol('N')
@dace.program
def copy_sdfg(A: dace.float32[N, N], B: dace.float32[N, N]):
for i, j in dace.map[0:N, 0:N]:
with dace.tasklet:
a << A[i, j]
b >> B[i, j]
b = a
def find_map_entries(sdfg):
outer_map_entry = None
inner_map_entry = None
for node in sdfg.start_state.nodes():
if not isinstance(node, dace.nodes.MapEntry):
continue
if xfh.get_parent_map(sdfg.start_state, node) is None:
assert outer_map_entry is None
outer_map_entry = node
else:
assert inner_map_entry is None
inner_map_entry = node
assert not outer_map_entry is None
assert not inner_map_entry is None
return outer_map_entry, inner_map_entry
def test_in_local_storage_explicit():
sdfg = copy_sdfg.to_sdfg()
sdfg.simplify()
sdfg.apply_transformations([MapTiling], options=[{"tile_sizes": [8]}])
outer_map_entry, inner_map_entry = find_map_entries(sdfg)
InLocalStorage.apply_to(sdfg=sdfg,
node_a=outer_map_entry,
node_b=inner_map_entry,
options={
"array": "A",
"create_array": True,
"prefix": "loc_"
},
save=True)
# Finding relevant node
local_storage_node = None
for node in sdfg.start_state.nodes():
if not isinstance(node, dace.nodes.AccessNode):
continue
if node.data == "loc_A":
assert local_storage_node is None
local_storage_node = node
break
assert not local_storage_node is None
# Check transient array created
trans_array = local_storage_node.data
assert trans_array in sdfg.arrays
# Check properties
desc = sdfg.arrays[local_storage_node.data]
assert desc.shape == (8, 8)
assert desc.transient == True
# Check array was set correctly
serialized = sdfg.transformation_hist[0].to_json()
assert serialized["array"] == "A"
def test_in_local_storage_implicit():
sdfg = copy_sdfg.to_sdfg()
sdfg.simplify()
sdfg.apply_transformations([MapTiling], options=[{"tile_sizes": [8]}])
outer_map_entry, inner_map_entry = find_map_entries(sdfg)
InLocalStorage.apply_to(sdfg=sdfg,
node_a=outer_map_entry,
node_b=inner_map_entry,
options={
"create_array": True,
"prefix": "loc_"
},
save=True)
# Finding relevant node
local_storage_node = None
for node in sdfg.start_state.nodes():
if not isinstance(node, dace.nodes.AccessNode):
continue
if node.data == "loc_A":
assert local_storage_node is None
local_storage_node = node
break
assert not local_storage_node is None
# Check transient array created
trans_array = local_storage_node.data
assert trans_array in sdfg.arrays
# Check properties
desc = sdfg.arrays[local_storage_node.data]
assert desc.shape == (8, 8)
assert desc.transient == True
# Check array was set correctly
serialized = sdfg.transformation_hist[0].to_json()
assert serialized["array"] == None
def test_out_local_storage_explicit():
sdfg = copy_sdfg.to_sdfg()
sdfg.simplify()
sdfg.apply_transformations([MapTiling], options=[{"tile_sizes": [8]}])
outer_map_entry, inner_map_entry = find_map_entries(sdfg)
outer_map_exit = sdfg.start_state.exit_node(outer_map_entry)
inner_map_exit = sdfg.start_state.exit_node(inner_map_entry)
OutLocalStorage.apply_to(sdfg=sdfg,
node_a=inner_map_exit,
node_b=outer_map_exit,
options={
"array": "B",
"create_array": True,
"prefix": "loc_"
},
save=True)
# Finding relevant node
local_storage_node = None
for node in sdfg.start_state.nodes():
if not isinstance(node, dace.nodes.AccessNode):
continue
if node.data == "loc_B":
assert local_storage_node is None
local_storage_node = node
break
assert not local_storage_node is None
# Check transient array created
trans_array = local_storage_node.data
assert trans_array in sdfg.arrays
# Check properties
desc = sdfg.arrays[local_storage_node.data]
assert desc.shape == (8, 8)
assert desc.transient == True
# Check array was set correctly
serialized = sdfg.transformation_hist[0].to_json()
assert serialized["array"] == "B"
def test_out_local_storage_implicit():
sdfg = copy_sdfg.to_sdfg()
sdfg.simplify()
sdfg.apply_transformations([MapTiling], options=[{"tile_sizes": [8]}])
outer_map_entry, inner_map_entry = find_map_entries(sdfg)
outer_map_exit = sdfg.start_state.exit_node(outer_map_entry)
inner_map_exit = sdfg.start_state.exit_node(inner_map_entry)
OutLocalStorage.apply_to(sdfg=sdfg,
node_a=inner_map_exit,
node_b=outer_map_exit,
options={
"create_array": True,
"prefix": "loc_"
},
save=True)
# Finding relevant node
local_storage_node = None
for node in sdfg.start_state.nodes():
if not isinstance(node, dace.nodes.AccessNode):
continue
if node.data == "loc_B":
assert local_storage_node is None
local_storage_node = node
break
assert not local_storage_node is None
# Check transient array created
trans_array = local_storage_node.data
assert trans_array in sdfg.arrays
# Check properties
desc = sdfg.arrays[local_storage_node.data]
assert desc.shape == (8, 8)
assert desc.transient == True
# Check array was set correctly
serialized = sdfg.transformation_hist[0].to_json()
assert serialized["array"] == None
@dace.program
def arange():
out = np.ndarray([N], np.int32)
for i in dace.map[0:N]:
with dace.tasklet:
o >> out[i]
o = i
return out
class LocalStorageTests(unittest.TestCase):
def test_even(self):
sdfg = arange.to_sdfg()
sdfg.apply_transformations([MapTiling, OutLocalStorage], options=[{'tile_sizes': [8]}, {}])
self.assertTrue(np.array_equal(sdfg(N=16), np.arange(16, dtype=np.int32)))
def test_uneven(self):
# For testing uneven decomposition, use longer buffer and ensure
# it's not filled over
output = np.ones(20, np.int32)
sdfg = arange.to_sdfg()
sdfg.apply_transformations([MapTiling, OutLocalStorage], options=[{'tile_sizes': [5]}, {}])
dace.propagate_memlets_sdfg(sdfg)
sdfg(N=16, __return=output)
self.assertTrue(np.array_equal(output[:16], np.arange(16, dtype=np.int32)))
self.assertTrue(np.array_equal(output[16:], np.ones(4, np.int32)))
if __name__ == '__main__':
unittest.main()
test_in_local_storage_explicit()
test_in_local_storage_implicit()
test_out_local_storage_explicit()
test_out_local_storage_implicit()