diff options
| author | David Bolvansky <david.bolvansky@gmail.com> | 2019-09-04 17:30:53 +0000 |
|---|---|---|
| committer | David Bolvansky <david.bolvansky@gmail.com> | 2019-09-04 17:30:53 +0000 |
| commit | 0e07248704fa97f6c7d9e007f82db17116fbaf78 (patch) | |
| tree | b45558b6f682aa32d89ba28dc715bc95f275f234 /lldb/packages/Python/lldbsuite/test/python_api/sbdata/main.cpp | |
| parent | 27820f99091d6547ed83ff20a2ea689ec68b9bf3 (diff) | |
| download | bcm5719-llvm-0e07248704fa97f6c7d9e007f82db17116fbaf78.tar.gz bcm5719-llvm-0e07248704fa97f6c7d9e007f82db17116fbaf78.zip | |
[InstCombine] Fold sub (and A, B) (or A, B)) to neg (xor A, B)
Summary:
```
Name: sub(and(x, y), or(x, y)) -> neg(xor(x, y))
%or = or i32 %y, %x
%and = and i32 %x, %y
%sub = sub i32 %and, %or
=>
%sub1 = xor i32 %x, %y
%sub = sub i32 0, %sub1
Optimization: sub(and(x, y), or(x, y)) -> neg(xor(x, y))
Done: 1
Optimization is correct!
```
https://rise4fun.com/Alive/VI6
Found by @lebedev.ri. Also author of the proof.
Reviewers: lebedev.ri, spatel
Reviewed By: lebedev.ri
Subscribers: llvm-commits, lebedev.ri
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D67155
llvm-svn: 370934
Diffstat (limited to 'lldb/packages/Python/lldbsuite/test/python_api/sbdata/main.cpp')
0 files changed, 0 insertions, 0 deletions
