Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Map-fission-single-data-multi-connectors #1216

Merged
merged 5 commits into from
Mar 15, 2023
Merged

Map-fission-single-data-multi-connectors #1216

Show file tree
Hide file tree
Changes from 2 commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
7072ca2
MapFission now reconnects the nodes around the Map to the nested SDFG…
alexnick83 Mar 13, 2023
77e8b18
Added tests.
alexnick83 Mar 13, 2023
40be34e
Fixed tests.
alexnick83 Mar 14, 2023
80e90f5
Removed comments.
alexnick83 Mar 14, 2023
82b378b
Merge branch 'master' into map-fission-single-data-multi-connectors
alexnick83 Mar 14, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
11 changes: 6 additions & 5 deletions dace/transformation/dataflow/map_fission.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -498,18 +498,19 @@ def apply(self, graph: sd.SDFGState, sdfg: sd.SDFG):
edge.data.num_accesses = edge.data.subset.num_elements()

# Find matching edge inside map
inner_edge = next(e for e in graph.out_edges(map_entry)
if e.src_conn and e.src_conn[4:] == edge.dst_conn[3:])
graph.add_edge(edge.src, edge.src_conn, nsdfg_node, inner_edge.dst_conn, dcpy(edge.data))
# inner_edge = next(e for e in graph.out_edges(map_entry) if e.src_conn and e.src_conn[4:] == edge.dst_conn[3:])
for inner_edge in graph.out_edges_by_connector(map_entry, f"OUT_{edge.dst_conn[3:]}"):
graph.add_edge(edge.src, edge.src_conn, nsdfg_node, inner_edge.dst_conn, dcpy(edge.data))

for edge in graph.out_edges(map_exit):
# Modify edge coming out of nested SDFG to include entire array
desc = sdfg.arrays[edge.data.data]
edge.data.subset = subsets.Range.from_array(desc)

# Find matching edge inside map
inner_edge = next(e for e in graph.in_edges(map_exit) if e.dst_conn[3:] == edge.src_conn[4:])
graph.add_edge(nsdfg_node, inner_edge.src_conn, edge.dst, edge.dst_conn, dcpy(edge.data))
# inner_edge = next(e for e in graph.in_edges(map_exit) if e.dst_conn[3:] == edge.src_conn[4:])
for inner_edge in graph.in_edges_by_connector(map_exit, f"IN_{edge.src_conn[4:]}"):
graph.add_edge(nsdfg_node, inner_edge.src_conn, edge.dst, edge.dst_conn, dcpy(edge.data))

# Remove outer map
graph.remove_nodes_from([map_entry, map_exit])
Expand Down