summaryrefslogtreecommitdiffstats
path: root/clang/lib/Frontend/CompilerInvocation.cpp
diff options
context:
space:
mode:
authorSimon Pilgrim <llvm-dev@redking.me.uk>2017-06-04 20:12:04 +0000
committerSimon Pilgrim <llvm-dev@redking.me.uk>2017-06-04 20:12:04 +0000
commit46dd55f1e1fdbc8cdf1d2ca535864e255ab84cc2 (patch)
treecdabd48e3d4e943603841aa60c1ce85b8e775343 /clang/lib/Frontend/CompilerInvocation.cpp
parent59ed77b813a58e6f81fca3896f61e967a4f5f495 (diff)
downloadbcm5719-llvm-46dd55f1e1fdbc8cdf1d2ca535864e255ab84cc2.tar.gz
bcm5719-llvm-46dd55f1e1fdbc8cdf1d2ca535864e255ab84cc2.zip
[X86][SSE] Change BUILD_VECTOR interleaving ordering to improve coalescing/combine opportunities
We currently generate BUILD_VECTOR as a tree of UNPCKL shuffles of the same type: e.g. for v4f32: Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0> : unpcklps 1, 3 ==> Y: <?, ?, 3, 1> Step 2: unpcklps X, Y ==> <3, 2, 1, 0> The issue is because we are not placing sequential vector elements together early enough, we fail to recognise many combinable patterns - consecutive scalar loads, extractions etc. Instead, this patch unpacks progressively larger sequential vector elements together: e.g. for v4f32: Step 1: unpcklps 0, 2 ==> X: <?, ?, 1, 0> : unpcklps 1, 3 ==> Y: <?, ?, 3, 2> Step 2: unpcklpd X, Y ==> <3, 2, 1, 0> This does mean that we are creating UNPCKL shuffle of different value types, but the relevant combines that benefit from this are quite capable of handling the additional BITCASTs that are now included in the shuffle tree. Differential Revision: https://reviews.llvm.org/D33864 llvm-svn: 304688
Diffstat (limited to 'clang/lib/Frontend/CompilerInvocation.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud