xref: /llvm-project/llvm/test/CodeGen/SystemZ/int-uadd-08.ll (revision 872276de4b8c5f13f106b79c53a27e4a6ff8ce35)
1; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py UTC_ARGS: --version 3
2; Test 32-bit addition in which the second operand is constant and in which
3; three-operand forms are available.
4;
5; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z196 | FileCheck %s
6
7declare i32 @foo()
8
9; Check addition of 1.
10define zeroext i1 @f1(i32 %dummy, i32 %a, ptr %res) {
11; CHECK-LABEL: f1:
12; CHECK:       # %bb.0:
13; CHECK-NEXT:    alhsik %r0, %r3, 1
14; CHECK-NEXT:    st %r0, 0(%r4)
15; CHECK-NEXT:    ipm %r1
16; CHECK-NEXT:    risbg %r2, %r1, 63, 191, 35
17; CHECK-NEXT:    br %r14
18  %t = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 1)
19  %val = extractvalue {i32, i1} %t, 0
20  %obit = extractvalue {i32, i1} %t, 1
21  store i32 %val, ptr %res
22  ret i1 %obit
23}
24
25; Check the high end of the ALHSIK range.
26define zeroext i1 @f2(i32 %dummy, i32 %a, ptr %res) {
27; CHECK-LABEL: f2:
28; CHECK:       # %bb.0:
29; CHECK-NEXT:    alhsik %r0, %r3, 32767
30; CHECK-NEXT:    st %r0, 0(%r4)
31; CHECK-NEXT:    ipm %r1
32; CHECK-NEXT:    risbg %r2, %r1, 63, 191, 35
33; CHECK-NEXT:    br %r14
34  %t = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 32767)
35  %val = extractvalue {i32, i1} %t, 0
36  %obit = extractvalue {i32, i1} %t, 1
37  store i32 %val, ptr %res
38  ret i1 %obit
39}
40
41; Check the next value up, which must use ALFI instead.
42define zeroext i1 @f3(i32 %dummy, i32 %a, ptr %res) {
43; CHECK-LABEL: f3:
44; CHECK:       # %bb.0:
45; CHECK-NEXT:    alfi %r3, 32768
46; CHECK-NEXT:    st %r3, 0(%r4)
47; CHECK-NEXT:    ipm %r0
48; CHECK-NEXT:    risbg %r2, %r0, 63, 191, 35
49; CHECK-NEXT:    br %r14
50  %t = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 32768)
51  %val = extractvalue {i32, i1} %t, 0
52  %obit = extractvalue {i32, i1} %t, 1
53  store i32 %val, ptr %res
54  ret i1 %obit
55}
56
57; Check the high end of the negative ALHSIK range.
58define zeroext i1 @f4(i32 %dummy, i32 %a, ptr %res) {
59; CHECK-LABEL: f4:
60; CHECK:       # %bb.0:
61; CHECK-NEXT:    alhsik %r0, %r3, -1
62; CHECK-NEXT:    st %r0, 0(%r4)
63; CHECK-NEXT:    ipm %r1
64; CHECK-NEXT:    risbg %r2, %r1, 63, 191, 35
65; CHECK-NEXT:    br %r14
66  %t = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 -1)
67  %val = extractvalue {i32, i1} %t, 0
68  %obit = extractvalue {i32, i1} %t, 1
69  store i32 %val, ptr %res
70  ret i1 %obit
71}
72
73; Check the low end of the ALHSIK range.
74define zeroext i1 @f5(i32 %dummy, i32 %a, ptr %res) {
75; CHECK-LABEL: f5:
76; CHECK:       # %bb.0:
77; CHECK-NEXT:    alhsik %r0, %r3, -32768
78; CHECK-NEXT:    st %r0, 0(%r4)
79; CHECK-NEXT:    ipm %r1
80; CHECK-NEXT:    risbg %r2, %r1, 63, 191, 35
81; CHECK-NEXT:    br %r14
82  %t = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 -32768)
83  %val = extractvalue {i32, i1} %t, 0
84  %obit = extractvalue {i32, i1} %t, 1
85  store i32 %val, ptr %res
86  ret i1 %obit
87}
88
89; Check the next value down, which must use ALFI instead.
90define zeroext i1 @f6(i32 %dummy, i32 %a, ptr %res) {
91; CHECK-LABEL: f6:
92; CHECK:       # %bb.0:
93; CHECK-NEXT:    alfi %r3, 4294934527
94; CHECK-NEXT:    st %r3, 0(%r4)
95; CHECK-NEXT:    ipm %r0
96; CHECK-NEXT:    risbg %r2, %r0, 63, 191, 35
97; CHECK-NEXT:    br %r14
98  %t = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 -32769)
99  %val = extractvalue {i32, i1} %t, 0
100  %obit = extractvalue {i32, i1} %t, 1
101  store i32 %val, ptr %res
102  ret i1 %obit
103}
104
105; Check using the overflow result for a branch.
106define void @f7(i32 %dummy, i32 %a, ptr %res) {
107; CHECK-LABEL: f7:
108; CHECK:       # %bb.0:
109; CHECK-NEXT:    alhsik %r0, %r3, 1
110; CHECK-NEXT:    st %r0, 0(%r4)
111; CHECK-NEXT:    jgnle foo@PLT
112; CHECK-NEXT:  .LBB6_1: # %exit
113; CHECK-NEXT:    br %r14
114  %t = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 1)
115  %val = extractvalue {i32, i1} %t, 0
116  %obit = extractvalue {i32, i1} %t, 1
117  store i32 %val, ptr %res
118  br i1 %obit, label %call, label %exit
119
120call:
121  tail call i32 @foo()
122  br label %exit
123
124exit:
125  ret void
126}
127
128; ... and the same with the inverted direction.
129define void @f8(i32 %dummy, i32 %a, ptr %res) {
130; CHECK-LABEL: f8:
131; CHECK:       # %bb.0:
132; CHECK-NEXT:    alhsik %r0, %r3, 1
133; CHECK-NEXT:    st %r0, 0(%r4)
134; CHECK-NEXT:    jgle foo@PLT
135; CHECK-NEXT:  .LBB7_1: # %exit
136; CHECK-NEXT:    br %r14
137  %t = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 1)
138  %val = extractvalue {i32, i1} %t, 0
139  %obit = extractvalue {i32, i1} %t, 1
140  store i32 %val, ptr %res
141  br i1 %obit, label %exit, label %call
142
143call:
144  tail call i32 @foo()
145  br label %exit
146
147exit:
148  ret void
149}
150
151
152declare {i32, i1} @llvm.uadd.with.overflow.i32(i32, i32) nounwind readnone
153
154