Chris Lattner | 679da03 | 2002-05-06 17:00:47 +0000 | [diff] [blame] | 1 | ; This test makes sure that these instructions are properly eliminated. |
| 2 | ; |
| 3 | |
Reid Spencer | d0e30dc | 2006-12-02 04:23:10 +0000 | [diff] [blame] | 4 | ; RUN: llvm-upgrade < %s | llvm-as | opt -instcombine | llvm-dis | not grep xor |
Chris Lattner | 679da03 | 2002-05-06 17:00:47 +0000 | [diff] [blame] | 5 | |
| 6 | implementation |
| 7 | |
Chris Lattner | e9e7ab5 | 2002-08-20 17:07:02 +0000 | [diff] [blame] | 8 | int %test1(int %A) { |
| 9 | %B = xor int %A, -1 |
| 10 | %C = xor int %B, -1 |
Chris Lattner | 679da03 | 2002-05-06 17:00:47 +0000 | [diff] [blame] | 11 | ret int %C |
| 12 | } |
| 13 | |
Chris Lattner | f75c333 | 2002-08-21 17:11:18 +0000 | [diff] [blame] | 14 | bool %test2(int %A, int %B) { |
| 15 | %cond = setle int %A, %B ; Can change into setge |
| 16 | %Ret = xor bool %cond, true |
| 17 | ret bool %Ret |
| 18 | } |
Chris Lattner | ad1e053 | 2002-08-23 18:31:18 +0000 | [diff] [blame] | 19 | |
| 20 | |
| 21 | ; Test that demorgans law can be instcombined |
| 22 | int %test3(int %A, int %B) { |
| 23 | %a = xor int %A, -1 |
| 24 | %b = xor int %B, -1 |
| 25 | %c = and int %a, %b |
| 26 | %d = xor int %c, -1 |
| 27 | ret int %d |
| 28 | } |
Chris Lattner | f7a8385 | 2003-03-10 23:13:32 +0000 | [diff] [blame] | 29 | |
| 30 | ; Test that demorgens law can work with constants |
| 31 | int %test4(int %A, int %B) { |
| 32 | %a = xor int %A, -1 |
| 33 | %c = and int %a, 5 ; 5 = ~c2 |
| 34 | %d = xor int %c, -1 |
| 35 | ret int %d |
| 36 | } |
| 37 | |
| 38 | ; test the mirror of demorgans law... |
| 39 | int %test5(int %A, int %B) { |
| 40 | %a = xor int %A, -1 |
| 41 | %b = xor int %B, -1 |
| 42 | %c = or int %a, %b |
| 43 | %d = xor int %c, -1 |
| 44 | ret int %d |
| 45 | } |