-
Notifications
You must be signed in to change notification settings - Fork 13.3k
[experimental, do not merge!] a faster implementation of Polonius #141326
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
base: master
Are you sure you want to change the base?
Conversation
Some changes occurred in src/tools/compiletest cc @jieyouxu |
We don't plan on landing this as-is (no need for reviews), but want to see the overhead on NLLs. @bors try @rust-timer queue |
This comment has been minimized.
This comment has been minimized.
[experimental, do not merge!] a faster implementation of Polonius This is an experiment to use a more lazy approach to Polonius by only invoking the location-sensitive analysis when needed and using NLL otherwise. This means all programs that currently compile will still use NLL for borrow checking, and the experimental location-sensitive analysis will only be triggered if NLL encounters an invalid access. The idea is that it should not affect performance significantly for existing programs that compile with NLL. However, it still alters the computation of active loans in rustc_borrowck, and I want a perf run to measure the performance impact. I expect a slight regression but hopefully not so much. r? lqd
⌛ Trying commit 95e1a43 with merge 77f7e0d0156c8e753ba3018f883f09a1ba0ff4a6... |
This comment has been minimized.
This comment has been minimized.
☀️ Try build successful - checks-actions |
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
Finished benchmarking commit (77f7e0d): comparison URL. Overall result: ❌✅ regressions and improvements - 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 71.0%, secondary 24.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 2.2%, secondary 1.5%)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: 775.275s -> 776.64s (0.18%) |
The job Click to see the possible cause of the failure (guessed by this bot)
|
This is an experiment to use a more lazy approach to Polonius by only invoking the
location-sensitive analysis when needed and using NLL otherwise. This means all programs that
currently compile will still use NLL for borrow checking, and the experimental location-sensitive
analysis will only be triggered if NLL encounters an invalid access. The idea is that it should not affect
performance significantly for existing programs that compile with NLL. However, it still alters the
computation of active loans in rustc_borrowck, and I want a perf run to measure the performance
impact. I expect a slight regression but hopefully not so much.
r? lqd