-
-
Notifications
You must be signed in to change notification settings - Fork 14.1k
[perf experiment] Hash interned values, not pointers #137282
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
|
@bors try @rust-timer queue |
This comment has been minimized.
This comment has been minimized.
[perf experiment] Hash interned values, not pointers r? ghost Assessing how bad this is and/or which Hash impls are hot and when
|
☀️ Try build successful - checks-actions |
This comment has been minimized.
This comment has been minimized.
|
Finished benchmarking commit (6c5885c): comparison URL. Overall result: ❌ regressions - please read the text belowBenchmarking this pull request likely means that it is perf-sensitive, so we're automatically marking it as not fit for rolling up. While you can manually mark this PR as fit for rollup, we strongly recommend not doing so since this PR may lead to changes in compiler perf. Next Steps: If you can justify the regressions found in this try perf run, please indicate this with @bors rollup=never Instruction countThis is the most reliable metric that we have; it was used to determine the overall result at the top of this comment. However, even this metric can sometimes exhibit noise.
Max RSS (memory usage)Results (primary 1.4%)This is a less reliable metric that may be of interest but was not used to determine the overall result at the top of this comment.
CyclesResults (primary 3.2%, secondary 4.0%)This is a less reliable metric that may be of interest but was not used to determine the overall result at the top of this comment.
Binary sizeThis benchmark run did not return any relevant results for this metric. Bootstrap: 773.063s -> 790.285s (2.23%) |
|
I assume a large portion of the regression (especially nalgebra, since it does a lot of trait solving) is b/c we're interning a ton of type system stuff (like clauses, etc) which are probably somewhat large/expensive to hash. |
|
I did some slightly more deep inspection in the compiler by making the Hash impl for raw pointers panic, and it turns out that of course the compiler hashes pointers all over. I looked into the regressions above and I think there are better ways to stabilize our artifacts than undertaking such widespread changes. |
r? ghost
Assessing how bad this is and/or which Hash impls are hot and when