diff options
| author | Sanjay Patel <spatel@rotateright.com> | 2015-04-16 17:52:13 +0000 |
|---|---|---|
| committer | Sanjay Patel <spatel@rotateright.com> | 2015-04-16 17:52:13 +0000 |
| commit | c86867cd5f920ae4edbdc0c657025b3071d21f43 (patch) | |
| tree | ab3490e95b75b3a7c4b4da80d59bc0a3579891ba /llvm/lib/Bitcode/Reader/BitcodeReader.cpp | |
| parent | c2368aafbc31a33bc9c9757c3d00c44dd3d8ced3 (diff) | |
| download | bcm5719-llvm-c86867cd5f920ae4edbdc0c657025b3071d21f43.tar.gz bcm5719-llvm-c86867cd5f920ae4edbdc0c657025b3071d21f43.zip | |
[X86, SSE] instcombine common cases of insertps intrinsics into shuffles
This is very similar to D8486 / r232852 (vperm2). If we treat insertps intrinsics
as shufflevectors, we can optimize them better.
I've left all but the full zero case of the zero mask variants out of this patch.
I don't think those can be converted into a single shuffle in all cases, but I'd
be happy to be proven wrong as I was for vperm2f128.
Either way, we'd need to support whatever sequence we come up with for those cases
in the backend before converting them here.
Differential Revision: http://reviews.llvm.org/D8833
llvm-svn: 235124
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions
