IR minimizer bitwidth minimization in reverse topo order on bit-typed ops#4287
Merged
Conversation
copybara-service
Bot
force-pushed
the
test_918107819
branch
4 times, most recently
from
bb8dcb3 to
398b230
Compare
… ops This reverse-topo sorted pass on the IR takes bitslices of the operands of a node to reduce the node's bitwidth. This approach does not add extends by relying on the node's users having introduced bitslices on their operands, meaning we can shrink the node by dropping or modifying bitslices. PiperOrigin-RevId: 919110993
copybara-service
Bot
force-pushed
the
test_918107819
branch
from
398b230 to
74832d3
Compare
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
IR minimizer bitwidth minimization in reverse topo order on bit-typed ops
This reverse-topo sorted pass on the IR takes bitslices of the operands of a node to reduce the node's bitwidth. This approach does not add extends by relying on the node's users having introduced bitslices on their operands, meaning we can shrink the node by dropping or modifying bitslices.