aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/CodeGen/MachineFunction.cpp
diff options
context:
space:
mode:
authorDavid Green <david.green@arm.com>2021-10-07 12:52:12 +0100
committerDavid Green <david.green@arm.com>2021-10-07 12:52:12 +0100
commit73346f58486d29c0d2687af1208fa146168d62d8 (patch)
tree3b6b9fc3b6850e587371aa6d49e1fd25c2f5ace9 /llvm/lib/CodeGen/MachineFunction.cpp
parentb5d6ad20e182318b2048a923eac56a198250ed0a (diff)
downloadllvm-73346f58486d29c0d2687af1208fa146168d62d8.zip
llvm-73346f58486d29c0d2687af1208fa146168d62d8.tar.gz
llvm-73346f58486d29c0d2687af1208fa146168d62d8.tar.bz2
[ARM] Introduce a MQPRCopy
Currently when creating tail predicated loops, we need to validate that all the live-outs of a loop will be equivalent with and without tail predication, and if they are not we cannot legally create a tail-predicated loop, leaving expensive vctp and vpst instructions in the loop. These notably can include register-allocation instructions like stack loads and stores, and copys lowered from COPYs to MVE_VORRs. Instead of trying to prove this is valid late in the pipeline, this patch introduces a MQPRCopy pseudo instruction that COPY is lowered to. This can then either be converted to a MVE_VORR where possible, or to a couple of VMOVD instructions if not. This way they do not behave differently within and outside of tail-predications regions, and we can know by construction that they are always valid. The idea is that we can do the same with stack load and stores, converting them to VLDR/VSTR or VLDM/VSTM where required to prove tail predication is always valid. This does unfortunately mean inserting multiple VMOVD instructions, instead of a single MVE_VORR, but my experiments show it to be an improvement in general. Differential Revision: https://reviews.llvm.org/D111048
Diffstat (limited to 'llvm/lib/CodeGen/MachineFunction.cpp')
0 files changed, 0 insertions, 0 deletions