1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
; This test makes sure that these instructions are properly eliminated.
;
; RUN: opt < %s -instcombine -S | FileCheck %s
; CHECK-NOT: xor
define i32 @test1(i32 %A) {
%B = xor i32 %A, -1 ; <i32> [#uses=1]
%C = xor i32 %B, -1 ; <i32> [#uses=1]
ret i32 %C
}
define i1 @test2(i32 %A, i32 %B) {
; Can change into setge
%cond = icmp sle i32 %A, %B ; <i1> [#uses=1]
%Ret = xor i1 %cond, true ; <i1> [#uses=1]
ret i1 %Ret
}
; Test that demorgans law can be instcombined
define i32 @test3(i32 %A, i32 %B) {
%a = xor i32 %A, -1 ; <i32> [#uses=1]
%b = xor i32 %B, -1 ; <i32> [#uses=1]
%c = and i32 %a, %b ; <i32> [#uses=1]
%d = xor i32 %c, -1 ; <i32> [#uses=1]
ret i32 %d
}
; Test that demorgens law can work with constants
define i32 @test4(i32 %A, i32 %B) {
%a = xor i32 %A, -1 ; <i32> [#uses=1]
%c = and i32 %a, 5 ; <i32> [#uses=1]
%d = xor i32 %c, -1 ; <i32> [#uses=1]
ret i32 %d
}
; test the mirror of demorgans law...
define i32 @test5(i32 %A, i32 %B) {
%a = xor i32 %A, -1 ; <i32> [#uses=1]
%b = xor i32 %B, -1 ; <i32> [#uses=1]
%c = or i32 %a, %b ; <i32> [#uses=1]
%d = xor i32 %c, -1 ; <i32> [#uses=1]
ret i32 %d
}
; PR2298
define zeroext i8 @test6(i32 %a, i32 %b) nounwind {
entry:
%tmp1not = xor i32 %a, -1 ; <i32> [#uses=1]
%tmp2not = xor i32 %b, -1 ; <i32> [#uses=1]
%tmp3 = icmp slt i32 %tmp1not, %tmp2not ; <i1> [#uses=1]
%retval67 = zext i1 %tmp3 to i8 ; <i8> [#uses=1]
ret i8 %retval67
}
define <2 x i1> @test7(<2 x i32> %A, <2 x i32> %B) {
%cond = icmp sle <2 x i32> %A, %B
%Ret = xor <2 x i1> %cond, <i1 true, i1 true>
ret <2 x i1> %Ret
}
|
