Skip to content

Conversation

@ThrudPrimrose
Copy link
Collaborator

Nice NSDFG connector names:
This:
image

Becomes:
image

Args:
sdfg (dace.SDFG): Modified in-place.
"""
recurse_in: Set[dace.nodes.NestedSDFG] = set()
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

should the function run recursively?

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think yes, if nested SDFG has more nested SDFGs the function should just continue doing?

return candidate_name


def dealias(sdfg: dace.SDFG):
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

maybe find a better name such as make_unique_nested_data or something

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think of the name def find_readable_connector_names_for_nested_sdfgs(sdfg: dace.SDFG): what do you think?

return candidate_name
else:
i = 1
candidate_name = f"{edge.data.data}_{SLICE_SUFFIX}_{i}"
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

actually, you can also use data.find_new_name(f'{edge.data.data}_{SLICE_SUFFIX}') to get A_slice followed by A_slice_#

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I will use find_new_name and remove FULLVIEW_SUFFIX

@ThrudPrimrose ThrudPrimrose requested a review from tbennun October 1, 2025 14:33
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants