Improve performance by optimizing bundle merging logic.#204
Merged
cfallin merged 2 commits intobytecodealliance:mainfrom Dec 2, 2024
Merged
Improve performance by optimizing bundle merging logic.#204cfallin merged 2 commits intobytecodealliance:mainfrom
cfallin merged 2 commits intobytecodealliance:mainfrom
Conversation
While merging two bundles, the `merge_bundles` function appends two sorted vectors and sort the resulting vector again. This approach used to be fast in most cases, but rustc 1.81 introduced changes in sorting algorithm that made `sort_unstable_by_key` to behave very bad with vectors are that are almost sorted. This introduces an optimization consisting in handling the special case where the vector being appended contains a single item differently. This case is very common, and there's a benefit in handling it differently both with rust 1.81 and with earlier versions.
cfallin
approved these changes
Dec 2, 2024
Member
cfallin
left a comment
cfallin
left a comment
There was a problem hiding this comment.
Thanks very much for this! I'll fuzz locally for a bit just for extra caution, then cut a new release and get this into Cranelift/Wasmtime.
Member
|
(I'm looking into the cargo-deny failure -- seems to be a license issue with a crate dependency) |
cfallin
added a commit
to cfallin/regalloc2
that referenced
this pull request
Dec 2, 2024
Includes bytecodealliance#204 to fix a performance regression with Rust 1.81's new standard library sort function.
Merged
cfallin
added a commit
that referenced
this pull request
Dec 2, 2024
Includes #204 to fix a performance regression with Rust 1.81's new standard library sort function.
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
2 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.
While merging two bundles, the
merge_bundlesfunction appends two sorted vectors and sort the resulting vector again. This approach used to be fast in most cases, but rustc 1.81 introduced changes in sorting algorithm that madesort_unstable_by_keyto behave very bad with vectors that are almost sorted.This introduces an optimization consisting in handling the special case where the vector being appended contains a single item differently. This case is very common, and there's a benefit in handling it differently both with rust 1.81 and with earlier versions.
Fixes #203