diff options
| author | Sanjay Patel <spatel@rotateright.com> | 2017-06-14 20:37:11 +0000 |
|---|---|---|
| committer | Sanjay Patel <spatel@rotateright.com> | 2017-06-14 20:37:11 +0000 |
| commit | 83cb0079406b166f017cf565352d0f399e3ddc11 (patch) | |
| tree | a535430fea5dd81bdbfadad81352f3abde0850ce /llvm/lib/Bitcode/Reader/BitcodeReader.cpp | |
| parent | 5960d9b1c314c4fe1125d11ef01aaaa8550d8744 (diff) | |
| download | bcm5719-llvm-83cb0079406b166f017cf565352d0f399e3ddc11.tar.gz bcm5719-llvm-83cb0079406b166f017cf565352d0f399e3ddc11.zip | |
[x86] avoid unnecessary shuffle mask math in combineX86ShufflesRecursively()
This is a follow-up to https://reviews.llvm.org/D34174 / https://reviews.llvm.org/rL305398.
We mentioned replacing the multiplies with shifts, but the real win seems to be in
bypassing the extra ops in the common case when the RootRatio and OpRatio are one.
This gives us another 1-2% overall win for the test in PR32037:
https://bugs.llvm.org/show_bug.cgi?id=32037
llvm-svn: 305414
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions
