-
Notifications
You must be signed in to change notification settings - Fork 13.2k
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
Verify that query keys result in unique dep nodes #122227
Conversation
@bors try @rust-timer queue |
This comment has been minimized.
This comment has been minimized.
Verify that query keys result in unique dep nodes This implements checking that query keys result into unique dep nodes as mentioned in rust-lang#112469. We could do a perf check to see how expensive this is. r? `@michaelwoerister`
☀️ Try build successful - checks-actions |
This comment has been minimized.
This comment has been minimized.
Finished benchmarking commit (d8a5ccf): comparison URL. Overall result: ❌ regressions - ACTION NEEDEDBenchmarking 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 a highly reliable metric that was used to determine the overall result at the top of this comment.
Max RSS (memory usage)ResultsThis 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.
CyclesResultsThis 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: 649.534s -> 651.184s (0.25%) |
a43d029
to
8099206
Compare
I've made |
@bors try @rust-timer queue |
This comment has been minimized.
This comment has been minimized.
Verify that query keys result in unique dep nodes This implements checking that query keys result into unique dep nodes as mentioned in rust-lang#112469. We could do a perf check to see how expensive this is. r? `@michaelwoerister`
☀️ Try build successful - checks-actions |
This comment has been minimized.
This comment has been minimized.
Finished benchmarking commit (8455f36): comparison URL. Overall result: ❌ regressions - ACTION NEEDEDBenchmarking 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 a highly reliable metric that was used to determine the overall result at the top of this comment.
Max RSS (memory usage)ResultsThis 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.
CyclesResultsThis 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: 648.949s -> 648.36s (-0.09%) |
(random passerby note about these last results, they show the worst case: for stability reasons the perf runs are done with incremental hash verification turned on all the time, instead of the default lower verification frequency) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for the PR, @Zoxc! Looks good to me.
One thing we could try to reduce the perf impact is skipping any DefId
query keys because for these we already do exhaustive collision checking when constructing the DefPathHash
map. I'm not sure if we are as thorough with other query keys that map to a DefPathHash
. But we could do a perf run that skips queries with FingerprintStyle::reconstructible() == true
to see what impact that has.
Thanks for the hint, @lqd! That's really good to know. |
Not sure if it's worth optimizing given that it's opt-in. |
Yes, I agree. The overall perf impact is low enough not to make a real difference for compilers with debug assertions enabled and regular compilers won't be affected at all. @bors r+ As per @lqd's comment, the performance cost will be visible to perf.rlo but that is an artificial side effect of perf.rlo enabling fingerprint verification. Regular users of the compiler won't be affected. @rustbot label: +perf-regression-triaged |
☀️ Test successful - checks-actions |
Finished benchmarking commit (d3555f3): comparison URL. Overall result: ❌ regressions - ACTION NEEDEDNext Steps: If you can justify the regressions found in this perf run, please indicate this with @rustbot label: +perf-regression Instruction countThis is a highly reliable metric that was used to determine the overall result at the top of this comment.
Max RSS (memory usage)ResultsThis 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.
CyclesResultsThis 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: 673.298s -> 674.552s (0.19%) |
This implements checking that query keys result into unique dep nodes as mentioned in #112469.
We could do a perf check to see how expensive this is.
r? @michaelwoerister