Repository navigation
Conversation
Cache immutable source and serialized program bytecode per VM, with weak decoded-code and importer references. Promote repeated sources to full function bytecode, retain fresh execution state, and evict by a configurable byte budget to avoid JSC shared-cache churn on large module graphs.
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
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.
Superseded by #85, which contains the adaptive admission design and the accepted performance trade-off.
This closed, unmerged experiment remains at
43b776326792abc8f24af82218892b141a3dc7b1. Its bounded immutable-bytecode cache improved largenode:vmgraphs, but did not meet the original Node-parity target. The replacement PR documents the later 1,750-source admission threshold, small-graph cost, consumer validation, and engine follow-up work. No code was merged through this PR.