aboutsummaryrefslogtreecommitdiff
path: root/lldb/source/Commands/CommandObjectScript.cpp
diff options
context:
space:
mode:
authorDavid Sherwood <david.sherwood@arm.com>2022-03-10 14:22:34 +0000
committerDavid Sherwood <david.sherwood@arm.com>2022-05-16 09:14:24 +0100
commitbefc952045066e840c7d84b3d3a4ab112a36366a (patch)
tree377c2fa965e9af64f9f7126c67707eda28a3e95a /lldb/source/Commands/CommandObjectScript.cpp
parent40f361ace3e9a9c24bd99300216aeabd49ad99bb (diff)
downloadllvm-befc952045066e840c7d84b3d3a4ab112a36366a.zip
llvm-befc952045066e840c7d84b3d3a4ab112a36366a.tar.gz
llvm-befc952045066e840c7d84b3d3a4ab112a36366a.tar.bz2
[LoopVectorize] Permit tail-folding for low trip counts using scalable vectors
When the loop vectoriser encounters a known low trip count it tries to create a single predicated loop in order to get the benefit of vectorisation and eliminate the scalar tail. However, until now the vectoriser prevented the use of scalable vectors in this case due to concerns in the past about stability. I believe that tail-folded loops using scalable vectors are now sufficiently well tested that we can enable this. For the same reason I've also enabled it when optimising for code size too. Tests added here: Transforms/LoopVectorize/AArch64/sve-low-trip-count.ll Transforms/LoopVectorize/AArch64/sve-tail-folding-optsize.ll Transforms/LoopVectorize/RISCV/low-trip-count.ll Differential Revision: https://reviews.llvm.org/D121595
Diffstat (limited to 'lldb/source/Commands/CommandObjectScript.cpp')
0 files changed, 0 insertions, 0 deletions