projects / platform / upstream / llvm.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 87a8f97) | patch
[X86] Add test case for LEA formation regression seen with D60358. NFC
authorCraig Topper <craig.topper@intel.com>
Wed, 10 Apr 2019 19:09:06 +0000 (19:09 +0000)
committerCraig Topper <craig.topper@intel.com>
Wed, 10 Apr 2019 19:09:06 +0000 (19:09 +0000)
commitcacb70c94b5fd0d45703f83aa32b53674ba6c225
treeb7e9a7619f2a136901ec040810e0ccd8e7018022tree | snapshot
parent87a8f9761e967ffd4398cef690d6016e396b9819commit | diff
[X86] Add test case for LEA formation regression seen with D60358. NFC

If we have an (add X, (and (aext (shl Y, C1)), C2)), we can pull the shift through and+aext to fold into an LEA with the.
Assuming C1 is small enough and C2 masks off all of the extend bits.

This pattern showed up in D60358. And we need to handle it to prevent a regression.

llvm-svn: 358124
llvm/test/CodeGen/X86/fold-and-shift-x86_64.ll diff | blob | history
Domain: System / Toolchain;