Fix for #6903 - enable vectorization of loops with non-constant lower bound. #6926
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.
This improvements enables vectorization of the #6903. It also improves performance of some of my other
@simd
benchmarks.I timed 5 different variations of loop lowering, including the normal one that Julia uses, and this is one of three variations that came out the fastest (within measurement noise) for aforementioned benchmarks, and did significantly better than using Julia's normal loop-lowering scheme.
When we get to LLVM 3.5, let's try using Julia's usual loop lowering. LLVM 3.4's vectorizer seemed to do much better than LLVM 3.3 with the usual lowering.