Make the slice iterator optimise better. #21448
Closed
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.
Due to the null pointer optimisation, LLVM was leaving totally useless
null pointer checks in tight loops using this iterator. We compile
Some(a_reference)
to a no-op, and matching against None in anOption<&T>
is just comparing against 0, this means that theNone
branch in
match Some(a_reference) { None => ... }
(as appearseffectively in a loop using
slice::Iter
) can't be eliminated unlessa_reference
is known to be non-null.LLVM currently doesn't seem to understand this in every situation (often
due to inlining, I am told), particularly painfully in ones involving
this iterator, but using
assume
means it understands almost always.Before:
After:
This leads to significantly better unrolling and vectorisation too.