revert to traditional nodes-based iteration for now

spcl · Oct 20, 2023 · 12a09c0 · 12a09c0
1 parent d84d0e3
commit 12a09c0
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/dace/sdfg/analysis/schedule_tree/sdfg_to_tree.py b/dace/sdfg/analysis/schedule_tree/sdfg_to_tree.py
@@ -273,7 +273,7 @@ def remove_name_collisions(sdfg: SDFG):
 
     for nsdfg in sdfg.all_sdfgs_recursive():
         # Rename duplicate states
-        for state in nsdfg.states():
+        for state in nsdfg.nodes():
             if state.label in state_names_seen:
                 state.label = data.find_new_name(state.label, state_names_seen)
             state_names_seen.add(state.label)

diff --git a/dace/sdfg/infer_types.py b/dace/sdfg/infer_types.py
@@ -61,7 +61,7 @@ def infer_connector_types(sdfg: SDFG):
     :param sdfg: The SDFG to infer.
     """
     # Loop over states, and in a topological sort over each state's nodes
-    for state in sdfg.states():
+    for state in sdfg.nodes():
         for node in dfs_topological_sort(state):
             # Try to infer input connector type from node type or previous edges
             for e in state.in_edges(node):
@@ -167,7 +167,7 @@ def set_default_schedule_and_storage_types(scope: Union[SDFG, SDFGState, nodes.E
 
     if isinstance(scope, SDFG):
         # Set device for default top-level schedules and storages
-        for state in scope.states():
+        for state in scope.nodes():
             set_default_schedule_and_storage_types(state,
                                                    parent_schedules,
                                                    use_parent_schedule=use_parent_schedule,