diff options
| author | James Molloy <james.molloy@arm.com> | 2016-02-03 15:05:06 +0000 |
|---|---|---|
| committer | James Molloy <james.molloy@arm.com> | 2016-02-03 15:05:06 +0000 |
| commit | 6e518a3b5075067b0bb839b4df5d9c05bd46ffcb (patch) | |
| tree | bda96f58049e1add24dc8b80cc95ff04db75707f /lldb/packages/Python/lldbsuite/test/python_api | |
| parent | 739ae643463efde42581c7286c2568fbb26d7c7b (diff) | |
| download | bcm5719-llvm-6e518a3b5075067b0bb839b4df5d9c05bd46ffcb.tar.gz bcm5719-llvm-6e518a3b5075067b0bb839b4df5d9c05bd46ffcb.zip | |
[DemandedBits] Revert r249687 due to PR26071
This regresses a test in LoopVectorize, so I'll need to go away and think about how to solve this in a way that isn't broken.
From the writeup in PR26071:
What's happening is that ComputeKnownZeroes is telling us that all bits except the LSB are zero. We're then deciding that only the LSB needs to be demanded from the icmp's inputs.
This is where we're wrong - we're assuming that after simplification the bits that were known zero will continue to be known zero. But they're not - during trivialization the upper bits get changed (because an XOR isn't shrunk), so the icmp fails.
The fault is in demandedbits - its contract does clearly state that a non-demanded bit may either be zero or one.
llvm-svn: 259649
Diffstat (limited to 'lldb/packages/Python/lldbsuite/test/python_api')
0 files changed, 0 insertions, 0 deletions
