diff options
author | Richard Sandiford <rsandifo@linux.vnet.ibm.com> | 2013-12-03 11:05:09 +0000 |
---|---|---|
committer | Richard Sandiford <rsandifo@linux.vnet.ibm.com> | 2013-12-03 11:05:09 +0000 |
commit | 2a2a323488a31fbdb3524f7f288b8e5c3fc3b7c3 (patch) | |
tree | 5377a1ea2319fa9a8bde8af0facddebf3f73ab4c /test/CodeGen/X86 | |
parent | c6b9dd1d21358914a43cfbba6fdecd069bad9742 (diff) | |
download | llvm-2a2a323488a31fbdb3524f7f288b8e5c3fc3b7c3.tar.gz llvm-2a2a323488a31fbdb3524f7f288b8e5c3fc3b7c3.tar.bz2 llvm-2a2a323488a31fbdb3524f7f288b8e5c3fc3b7c3.tar.xz |
Merging r196267:
------------------------------------------------------------------------
r196267 | rsandifo | 2013-12-03 11:01:54 +0000 (Tue, 03 Dec 2013) | 12 lines
[SystemZ] Fix choice of known-zero mask in insertion optimization
The backend converts 64-bit ORs into subreg moves if the upper 32 bits
of one operand and the low 32 bits of the other are known to be zero.
It then tries to peel away redundant ANDs from the upper 32 bits.
Since AND masks are canonicalized to exclude known-zero bits,
the test ORs the mask and the known-zero bits together before
checking for redundancy. The problem was that it was using the
wrong node when checking for known-zero bits, so could drop ANDs
that were still needed.
------------------------------------------------------------------------
git-svn-id: https://llvm.org/svn/llvm-project/llvm/branches/release_34@196268 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test/CodeGen/X86')
0 files changed, 0 insertions, 0 deletions