Binary Arithmetic ICs#1
Merged
Merged
Conversation
vrindisbacher
force-pushed
the
vrindisbacher/ic
branch
from
0378261 to
4024eaf
Compare
vrindisbacher
force-pushed
the
vrindisbacher/ic
branch
from
cb13ce3 to
bb053cd
Compare
Author
|
Passes the entire ECMA script test suite, merging in |
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.
Adds an IC mechanism that can be expanded upon. The strategy is quite similar to CacheIR, with some nuances.
For each function, we initialize an array of stubs for operations in that function's bytecode. Each stub is a linked list of ICs which can either execute the IC directly (as a rust fn) or emit bytecode to be used by later optimizing compilers.