[all-commits] [llvm/llvm-project] bd0c28: [NFC][LoopVectorize] Change trip counts for some t...
david-arm via All-commits
all-commits at lists.llvm.org
Fri Mar 24 02:44:23 PDT 2023
Branch: refs/heads/main
Home: https://github.com/llvm/llvm-project
Commit: bd0c281fcdcbce224411319e7eaf981ca0a89777
https://github.com/llvm/llvm-project/commit/bd0c281fcdcbce224411319e7eaf981ca0a89777
Author: David Sherwood <david.sherwood at arm.com>
Date: 2023-03-24 (Fri, 24 Mar 2023)
Changed paths:
M llvm/test/Transforms/LoopVectorize/AArch64/masked-call.ll
M llvm/test/Transforms/LoopVectorize/AArch64/sve-tail-folding-optsize.ll
M llvm/test/Transforms/LoopVectorize/AArch64/sve-tail-folding.ll
M llvm/test/Transforms/LoopVectorize/RISCV/scalable-tailfold.ll
M llvm/test/Transforms/LoopVectorize/RISCV/uniform-load-store.ll
Log Message:
-----------
[NFC][LoopVectorize] Change trip counts for some tests to guarantee a scalar tail
Quite a few vectoriser tests were using a trip count of 1024,
which meant:
1. For fixed-length VFs we would never actually tail-fold, e.g.
see Transforms/LoopVectorize/RISCV/uniform-load-store.ll. This
is because we can prove at compile-time there will never be a
scalar tail.
2. As of D146199 the same optimisation mentioned above will also
apply to scalable VFs too.
I've changed all such trip counts to be 1025 instead.
Differential Revision: https://reviews.llvm.org/D146219
More information about the All-commits
mailing list