-
Notifications
You must be signed in to change notification settings - Fork 13.5k
Compute jump threading opportunities in a single pass #142821
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 to MIR optimizations cc @rust-lang/wg-mir-opt |
This comment has been minimized.
This comment has been minimized.
@bors try @rust-timer queue |
This comment has been minimized.
This comment has been minimized.
Compute jump threading opportunities in a single pass The current implementation of jump threading walks MIR CFG backwards from each `SwitchInt` terminator. This PR replaces this by a single postorder traversal of MIR. In theory, we could do a full fixpoint dataflow analysis, but this has low returns as we forbid threading through a loop header, and we do not merge TOs yet. The second commit in this PR modifies the carried state to a lighter data structure. The current implementation uses some kind of `IndexVec<ValueIndex, &[Condition]>`. This is needlessly heavy, as the state rarely ever carries more than a few `Condition`s. The first commit replaces this state with a simpler `&[Condition]`, and puts the corresponding `ValueIndex` inside `Condition`. The last commit is the main change. It needs a fair amount of data structure tweaks, as each condition now needs to carry its chain of blocks with it.
☀️ Try build successful - checks-actions |
This comment has been minimized.
This comment has been minimized.
Finished benchmarking commit (d27b44e): comparison URL. Overall result: ❌✅ regressions and improvements - please read the text belowBenchmarking this pull request means it may be perf-sensitive – we'll automatically label it not fit for rolling up. You can override this, but we strongly advise not to, due to possible changes in compiler perf. Next Steps: If you can justify the regressions found in this try perf run, please do so in sufficient writing along with @bors rollup=never Instruction countOur most reliable metric. Used to determine the overall result above. However, even this metric can be noisy.
Max RSS (memory usage)Results (primary -1.9%, secondary -3.6%)A less reliable metric. May be of interest, but not used to determine the overall result above.
CyclesResults (primary 1.6%, secondary 2.4%)A less reliable metric. May be of interest, but not used to determine the overall result above.
Binary sizeResults (primary -0.1%, secondary -0.5%)A less reliable metric. May be of interest, but not used to determine the overall result above.
Bootstrap: 689.042s -> 688.964s (-0.01%) |
bdf9d85
to
3f66e3a
Compare
This comment has been minimized.
This comment has been minimized.
Some changes occurred in coverage tests. cc @Zalathar |
r? wg-mir-opt |
Failed to set assignee to
|
325fee6
to
b541dc6
Compare
oh, there are people in the wg which can't actually be assigned for review 😅 |
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.
I can yolo-review it (check that the general design makes sense and appears to be doing what it is supposed to), but I am certain I cannot antagonistically review it in the way that we should be reviewing mir opts to make sure we don't have a misoptimization. I have tried the last two weeks but I don't think I am a good reviewer for such work
@@ -26,7 +26,7 @@ rustc_index::newtype_index!( | |||
/// This index uniquely identifies a tracked place and therefore a slot in [`State`]. | |||
/// | |||
/// It is an implementation detail of this module. |
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.
this comment is now outdated
r? mir |
FYI, never mind, to me, a person who approves a pull request is never at fault. I can see a compiler growing up, always caught between bugs and features. I always see LLVM containing some miscompiled from a decade ago. |
@oli-obk i don't expect you to yolo-review it, nor to bring a specific counter example to prove it wrong. Instead, I'm very interested in questions on what isn't clear, what looks fishy or inconsistent, and where you expect traps... It's my role to add in-code comments to prove myself. |
The current implementation of jump threading walks MIR CFG backwards from each
SwitchInt
terminator. This PR replaces this by a single postorder traversal of MIR. In theory, we could do a full fixpoint dataflow analysis, but this has low returns as we forbid threading through a loop header, and we do not merge TOs yet.The second commit in this PR modifies the carried state to a lighter data structure. The current implementation uses some kind of
IndexVec<ValueIndex, &[Condition]>
. This is needlessly heavy, as the state rarely ever carries more than a fewCondition
s. The first commit replaces this state with a simpler&[Condition]
, and puts the correspondingValueIndex
insideCondition
.The third commit is the main change. It needs a fair amount of data structure tweaks, as each condition now needs to carry its chain of blocks with it.
Later commits are perf tweaks.