[TIR] Add tir::builtin::assume #12267
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Contributor
Author
|
This is currently a draft PR, as the unit tests depend on functionality introduced in #12264. |
Contributor
Author
|
#12264 has landed (Thank you @junrushao1994 for the quick review!), and this PR is ready for review. |
Member
|
CC @yzh119 who might be interested :-) |
vinx13
approved these changes
Aug 3, 2022
This was referenced Aug 5, 2022
xinetzone
pushed a commit
to daobook/tvm
that referenced
this pull request
Nov 25, 2022
* [RemoveAssume] Implemented T.assume in TVMScript, RemoveAssume * [UnitTest] RemoveAssume, initial functionality tests
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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 PR introduces
tir::builtin::assume, which is used to represent assumptions to be exposed to transformations, which would otherwise require out-of-scope information to prove.This PR is part of the handling of padded buffer layout transformations (tracking issue, rfc). Later PRs will introduce transformations that make use of the information provided by assumptions.