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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --version 4
; RUN: opt -passes=bdce %s -S | FileCheck %s
; The 'nuw' on the subtract allows us to deduce that %setbit is not demanded.
; But if we change that value to '0', then the 'nuw' is no longer valid. If we don't
; remove the 'nuw', another pass (-instcombine) may make a transform based on an
; that incorrect assumption and we can miscompile:
; https://bugs.llvm.org/show_bug.cgi?id=33695
define i1 @PR33695(i1 %b, i8 %x) {
; CHECK-LABEL: define i1 @PR33695(
; CHECK-SAME: i1 [[B:%.*]], i8 [[X:%.*]]) {
; CHECK-NEXT: [[LITTLE_NUMBER:%.*]] = zext i1 [[B]] to i8
; CHECK-NEXT: [[BIG_NUMBER:%.*]] = shl i8 0, 1
; CHECK-NEXT: [[SUB:%.*]] = sub i8 [[BIG_NUMBER]], [[LITTLE_NUMBER]]
; CHECK-NEXT: [[TRUNC:%.*]] = trunc i8 [[SUB]] to i1
; CHECK-NEXT: ret i1 [[TRUNC]]
;
%setbit = or i8 %x, 64
%little_number = zext i1 %b to i8
%big_number = shl i8 %setbit, 1
%sub = sub nuw i8 %big_number, %little_number
%trunc = trunc i8 %sub to i1
ret i1 %trunc
}
; Similar to above, but now with more no-wrap.
; https://bugs.llvm.org/show_bug.cgi?id=34037
define i64 @PR34037(i64 %m, i32 %r, i64 %j, i1 %b, i32 %k, i64 %p) {
; CHECK-LABEL: define i64 @PR34037(
; CHECK-SAME: i64 [[M:%.*]], i32 [[R:%.*]], i64 [[J:%.*]], i1 [[B:%.*]], i32 [[K:%.*]], i64 [[P:%.*]]) {
; CHECK-NEXT: [[SHL:%.*]] = shl i64 0, 29
; CHECK-NEXT: [[CONV1:%.*]] = select i1 [[B]], i64 7, i64 0
; CHECK-NEXT: [[SUB:%.*]] = sub i64 [[SHL]], [[CONV1]]
; CHECK-NEXT: [[CONV2:%.*]] = zext i32 [[K]] to i64
; CHECK-NEXT: [[MUL:%.*]] = mul i64 [[SUB]], [[CONV2]]
; CHECK-NEXT: [[CONV4:%.*]] = and i64 [[P]], 65535
; CHECK-NEXT: [[AND5:%.*]] = and i64 [[MUL]], [[CONV4]]
; CHECK-NEXT: ret i64 [[AND5]]
;
%conv = zext i32 %r to i64
%and = and i64 %m, %conv
%neg = xor i64 %and, 34359738367
%or = or i64 %j, %neg
%shl = shl i64 %or, 29
%conv1 = select i1 %b, i64 7, i64 0
%sub = sub nuw nsw i64 %shl, %conv1
%conv2 = zext i32 %k to i64
%mul = mul nsw i64 %sub, %conv2
%conv4 = and i64 %p, 65535
%and5 = and i64 %mul, %conv4
ret i64 %and5
}
; This is a manufactured example based on the 1st test to prove that the
; assumption-killing algorithm stops at the call. Ie, it does not remove
; nsw/nuw from the 'add' because a call demands all bits of its argument.
declare i1 @foo(i1)
define i1 @poison_on_call_user_is_ok(i1 %b, i8 %x) {
; CHECK-LABEL: define i1 @poison_on_call_user_is_ok(
; CHECK-SAME: i1 [[B:%.*]], i8 [[X:%.*]]) {
; CHECK-NEXT: [[LITTLE_NUMBER:%.*]] = zext i1 [[B]] to i8
; CHECK-NEXT: [[BIG_NUMBER:%.*]] = shl i8 0, 1
; CHECK-NEXT: [[SUB:%.*]] = sub i8 [[BIG_NUMBER]], [[LITTLE_NUMBER]]
; CHECK-NEXT: [[TRUNC:%.*]] = trunc i8 [[SUB]] to i1
; CHECK-NEXT: [[CALL_RESULT:%.*]] = call i1 @foo(i1 [[TRUNC]])
; CHECK-NEXT: [[ADD:%.*]] = add nuw nsw i1 [[CALL_RESULT]], true
; CHECK-NEXT: [[MUL:%.*]] = mul i1 [[TRUNC]], [[ADD]]
; CHECK-NEXT: ret i1 [[MUL]]
;
%setbit = or i8 %x, 64
%little_number = zext i1 %b to i8
%big_number = shl i8 %setbit, 1
%sub = sub nuw i8 %big_number, %little_number
%trunc = trunc i8 %sub to i1
%call_result = call i1 @foo(i1 %trunc)
%add = add nsw nuw i1 %call_result, 1
%mul = mul i1 %trunc, %add
ret i1 %mul
}
; We were asserting that all users of a trivialized integer-type instruction were
; also integer-typed, but that's too strong. The alloca has a pointer-type result.
define void @PR34179(ptr %a) {
; CHECK-LABEL: define void @PR34179(
; CHECK-SAME: ptr [[A:%.*]]) {
; CHECK-NEXT: [[T0:%.*]] = load volatile i32, ptr [[A]], align 4
; CHECK-NEXT: ret void
;
%t0 = load volatile i32, ptr %a
%vla = alloca i32, i32 %t0
ret void
}
define i64 @disjoint(i64 %x) {
; CHECK-LABEL: define i64 @disjoint(
; CHECK-SAME: i64 [[X:%.*]]) {
; CHECK-NEXT: [[OR:%.*]] = or i64 [[X]], -2
; CHECK-NEXT: ret i64 [[OR]]
;
%and = and i64 %x, 1
%or = or disjoint i64 %and, -2
ret i64 %or
}
define i32 @disjoint_indirect(i64 %x) {
; CHECK-LABEL: define i32 @disjoint_indirect(
; CHECK-SAME: i64 [[X:%.*]]) {
; CHECK-NEXT: [[TRUNC:%.*]] = trunc i64 [[X]] to i32
; CHECK-NEXT: [[OR:%.*]] = or i32 [[TRUNC]], -2
; CHECK-NEXT: ret i32 [[OR]]
;
%and = and i64 %x, 1
%trunc = trunc i64 %and to i32
%or = or disjoint i32 %trunc, -2
ret i32 %or
}
define i32 @range(i32 %x) {
; CHECK-LABEL: define i32 @range(
; CHECK-SAME: i32 [[X:%.*]]) {
; CHECK-NEXT: [[UMIN:%.*]] = call i32 @llvm.umin.i32(i32 [[X]], i32 100)
; CHECK-NEXT: [[AND:%.*]] = and i32 [[UMIN]], -2
; CHECK-NEXT: ret i32 [[AND]]
;
%or = or i32 %x, 1
%umin = call i32 @llvm.umin.i32(i32 %or, i32 100), !range !{i32 1, i32 101}
%and = and i32 %umin, -2
ret i32 %and
}
|
