@@ -260,7 +260,7 @@ def builtin_neighbors(
260
260
iterator .indices [shifted_dim ],
261
261
me ,
262
262
shift_tasklet ,
263
- memlet = dace .Memlet . simple ( iterator .indices [shifted_dim ].data , "0" , debuginfo = di ),
263
+ memlet = dace .Memlet ( data = iterator .indices [shifted_dim ].data , subset = "0" , debuginfo = di ),
264
264
dst_conn = "__idx" ,
265
265
)
266
266
state .add_edge (shift_tasklet , "__result" , data_access_tasklet , field_index , dace .Memlet ())
@@ -280,7 +280,7 @@ def builtin_neighbors(
280
280
data_access_tasklet ,
281
281
mx ,
282
282
result_access ,
283
- memlet = dace .Memlet . simple ( result_name , neighbor_index , debuginfo = di ),
283
+ memlet = dace .Memlet ( data = result_name , subset = neighbor_index , debuginfo = di ),
284
284
src_conn = "__result" ,
285
285
)
286
286
@@ -315,7 +315,7 @@ def builtin_can_deref(
315
315
"_out" ,
316
316
result_node ,
317
317
None ,
318
- dace .Memlet . simple ( result_name , "0" , debuginfo = di ),
318
+ dace .Memlet ( data = result_name , subset = "0" , debuginfo = di ),
319
319
)
320
320
return [ValueExpr (result_node , dace .dtypes .bool )]
321
321
@@ -385,7 +385,7 @@ def builtin_list_get(
385
385
transformer .context .state .add_nedge (
386
386
args [1 ].value ,
387
387
result_node ,
388
- dace .Memlet . simple ( args [1 ].value .data , index_value ),
388
+ dace .Memlet ( data = args [1 ].value .data , subset = index_value ),
389
389
)
390
390
return [ValueExpr (result_node , args [1 ].dtype )]
391
391
@@ -634,7 +634,7 @@ def visit_Lambda(
634
634
lambda_state .add_nedge (
635
635
expr .value ,
636
636
result_access ,
637
- dace .Memlet . simple ( result_access .data , "0" ),
637
+ dace .Memlet ( data = result_access .data , subset = "0" ),
638
638
)
639
639
result = ValueExpr (value = result_access , dtype = expr .dtype )
640
640
else :
@@ -801,7 +801,7 @@ def _visit_deref(self, node: itir.FunCall) -> list[ValueExpr]:
801
801
iterator .indices [dim ] for dim in sorted_dims if dim in iterator .indices
802
802
]
803
803
deref_memlets = [dace .Memlet .from_array (iterator .field .data , field_array )] + [
804
- dace .Memlet . simple ( node .data , "0" ) for node in deref_nodes [1 :]
804
+ dace .Memlet ( data = node .data , subset = "0" ) for node in deref_nodes [1 :]
805
805
]
806
806
807
807
# we create a mapped tasklet for array slicing
@@ -927,7 +927,7 @@ def visit_OffsetLiteral(self, node: itir.OffsetLiteral) -> list[ValueExpr]:
927
927
"get_offset" , {}, {"__out" }, f"__out = { offset } " , debuginfo = di
928
928
)
929
929
self .context .state .add_edge (
930
- tasklet_node , "__out" , offset_node , None , dace .Memlet . simple ( offset_var , "0" )
930
+ tasklet_node , "__out" , offset_node , None , dace .Memlet ( data = offset_var , subset = "0" )
931
931
)
932
932
return [ValueExpr (offset_node , self .context .body .arrays [offset_var ].dtype )]
933
933
@@ -1036,7 +1036,7 @@ def _visit_reduce(self, node: itir.FunCall):
1036
1036
dace .Memlet .from_array (reduce_input_node .data , reduce_input_desc ),
1037
1037
)
1038
1038
self .context .state .add_nedge (
1039
- reduce_node , result_access , dace .Memlet . simple ( result_name , "0" )
1039
+ reduce_node , result_access , dace .Memlet ( data = result_name , subset = "0" )
1040
1040
)
1041
1041
1042
1042
# we apply map fusion only to the nested-SDFG which is generated for the reduction operator
@@ -1108,7 +1108,7 @@ def add_expr_tasklet(
1108
1108
)
1109
1109
self .context .state .add_edge (arg .value , None , expr_tasklet , internal , memlet )
1110
1110
1111
- memlet = dace .Memlet . simple ( result_access .data , "0" , debuginfo = di )
1111
+ memlet = dace .Memlet ( data = result_access .data , subset = "0" , debuginfo = di )
1112
1112
self .context .state .add_edge (expr_tasklet , "__result" , result_access , None , memlet )
1113
1113
1114
1114
return [ValueExpr (result_access , result_type )]
@@ -1140,7 +1140,7 @@ def closure_to_tasklet_sdfg(
1140
1140
)
1141
1141
access = state .add_access (name , debuginfo = body .debuginfo )
1142
1142
idx_accesses [dim ] = access
1143
- state .add_edge (tasklet , "value" , access , None , dace .Memlet . simple ( name , "0" ))
1143
+ state .add_edge (tasklet , "value" , access , None , dace .Memlet ( data = name , subset = "0" ))
1144
1144
for name , ty in inputs :
1145
1145
if isinstance (ty , ts .FieldType ):
1146
1146
ndim = len (ty .dims )
0 commit comments