| commit | 96c99810d80d4e000b88bf726499d25cb4726bb5 | [log] [tgz] |
|---|---|---|
| author | Sanjay Patel <spatel@rotateright.com> | Tue Feb 13 22:24:37 2018 +0000 |
| committer | Sanjay Patel <spatel@rotateright.com> | Tue Feb 13 22:24:37 2018 +0000 |
| tree | f54ef5b174eabe5fb90013e16d6445742c27c05d | |
| parent | 2a3f34a9794a8e75faccd562beb2bd22eb0d24ae [diff] |
[InstCombine] (lshr X, 31) * Y --> (ashr X, 31) & Y This replaces the bit-tracking based fold that did the same thing, but it only worked for scalars and not directly. There is no evidence in existing regression tests that the greater power of bit-tracking was needed here, but we should be aware of this potential loss of optimization. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@325062 91177308-0d34-0410-b5e6-96231b3b80d8