fix: fix upper bound coming from isl ast #47
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This pull request to
tiralib/tiramisu/tiramisu_tree.pyincludes changes to improve the handling of upper bounds and adds new methods for generating ISL AST strings. The most important changes include modifying the upper bound calculation and adding methods to generate ISL AST string representations of the tiramisu tree.Improvements to upper bound handling:
from_isl_ast_string_listmethod to add 1 to the upper bound when converting it to an integer to account for the ISL's inclusive upper bound.Enhancements to ISL AST string generation:
get_isl_ast_stringto generate the ISL AST string representation of the tiramisu tree._get_isl_ast_string_of_nodeto recursively generate the ISL AST string for each node in the tiramisu tree.