aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/CodeGen/AsmPrinter/DebugHandlerBase.cpp
diff options
context:
space:
mode:
authorDavid Green <david.green@arm.com>2021-08-30 19:19:51 +0100
committerDavid Green <david.green@arm.com>2021-08-30 19:19:51 +0100
commitefa340fbd264c1a1fc3d0c41275536693369f897 (patch)
treea7eda2a0767e2cf912ede1747bffec2b9cc31874 /llvm/lib/CodeGen/AsmPrinter/DebugHandlerBase.cpp
parent83df94067d367d91dcc37e269a3d7317ebe97bb4 (diff)
downloadllvm-efa340fbd264c1a1fc3d0c41275536693369f897.zip
llvm-efa340fbd264c1a1fc3d0c41275536693369f897.tar.gz
llvm-efa340fbd264c1a1fc3d0c41275536693369f897.tar.bz2
[ARM] Workaround tailpredication min/max costmodel
The min/max intrinsics are not yet canonical, but when they are the tail predications analysis will change from treating them like icmp to treating them like intrinsics. Unfortunately, they can currently produce better code by not being tail predicated thanks to the vectorizer picking higher VF's and the backend folding to better instructions (especially for saturate patterns). In the long run we will need to improve the vectorizers cost modelling, recognizing the instruction directly, but in the meantime this treats min/max as before to prevent performance regressions.
Diffstat (limited to 'llvm/lib/CodeGen/AsmPrinter/DebugHandlerBase.cpp')
0 files changed, 0 insertions, 0 deletions