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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
; RUN: opt < %s -instcombine -S | FileCheck %s
; These tests are for Integer BitWidth <= 64 && BitWidth % 2 != 0.
define i23 @test1(i23 %A) {
;; A | ~A == -1
%NotA = xor i23 -1, %A
%B = or i23 %A, %NotA
ret i23 %B
; CHECK-LABEL: @test1
; CHECK-NEXT: ret i23 -1
}
define i39 @test2(i39 %V, i39 %M) {
;; If we have: ((V + N) & C1) | (V & C2)
;; .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
;; replace with V+N.
%C1 = xor i39 274877906943, -1 ;; C2 = 274877906943
%N = and i39 %M, 274877906944
%A = add i39 %V, %N
%B = and i39 %A, %C1
%D = and i39 %V, 274877906943
%R = or i39 %B, %D
ret i39 %R
; CHECK-LABEL: @test2
; CHECK-NEXT: %N = and i39 %M, -274877906944
; CHECK-NEXT: %A = add i39 %N, %V
; CHECK-NEXT: ret i39 %A
}
define i43 @test3(i43 %A, i43 %B) {
;; (~A | ~B) == (~(A & B)) - De Morgan's Law
%NotA = xor i43 %A, -1
%NotB = xor i43 %B, -1
%C1 = or i43 %NotA, %NotB
ret i43 %C1
; CHECK-LABEL: @test3
; CHECK-NEXT: %C1.demorgan = and i43 %A, %B
; CHECK-NEXT: %C1 = xor i43 %C1.demorgan, -1
; CHECK-NEXT: ret i43 %C1
}
; These tests are for Integer BitWidth > 64 && BitWidth <= 1024.
define i1023 @test4(i1023 %A) {
;; A | ~A == -1
%NotA = xor i1023 -1, %A
%B = or i1023 %A, %NotA
ret i1023 %B
; CHECK-LABEL: @test4
; CHECK-NEXT: ret i1023 -1
}
define i399 @test5(i399 %V, i399 %M) {
;; If we have: ((V + N) & C1) | (V & C2)
;; .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
;; replace with V+N.
%C1 = xor i399 274877906943, -1 ;; C2 = 274877906943
%N = and i399 %M, 18446742974197923840
%A = add i399 %V, %N
%B = and i399 %A, %C1
%D = and i399 %V, 274877906943
%R = or i399 %B, %D
ret i399 %R
; CHECK-LABEL: @test5
; CHECK-NEXT: %N = and i399 %M, 18446742974197923840
; CHECK-NEXT: %A = add i399 %N, %V
; CHECK-NEXT: ret i399 %A
}
define i129 @test6(i129 %A, i129 %B) {
;; (~A | ~B) == (~(A & B)) - De Morgan's Law
%NotA = xor i129 %A, -1
%NotB = xor i129 %B, -1
%C1 = or i129 %NotA, %NotB
ret i129 %C1
; CHECK-LABEL: @test6
; CHECK-NEXT: %C1.demorgan = and i129 %A, %B
; CHECK-NEXT: %C1 = xor i129 %C1.demorgan, -1
; CHECK-NEXT: ret i129 %C1
}
|
