122 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py UTC_ARGS: --version 32; Test 64-bit addition in which the second operand is constant.3;4; RUN: llc < %s -mtriple=s390x-linux-gnu | FileCheck %s5 6declare i64 @foo()7 8; Check addition of 1.9define zeroext i1 @f1(i64 %dummy, i64 %a, ptr %res) {10; CHECK-LABEL: f1:11; CHECK: # %bb.0:12; CHECK-NEXT: algfi %r3, 113; CHECK-NEXT: ipm %r014; CHECK-NEXT: risbg %r2, %r0, 63, 191, 3515; CHECK-NEXT: stg %r3, 0(%r4)16; CHECK-NEXT: br %r1417 %t = call {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 1)18 %val = extractvalue {i64, i1} %t, 019 %obit = extractvalue {i64, i1} %t, 120 store i64 %val, ptr %res21 ret i1 %obit22}23 24; Check the high end of the ALGFI range.25define zeroext i1 @f2(i64 %dummy, i64 %a, ptr %res) {26; CHECK-LABEL: f2:27; CHECK: # %bb.0:28; CHECK-NEXT: algfi %r3, 429496729529; CHECK-NEXT: ipm %r030; CHECK-NEXT: risbg %r2, %r0, 63, 191, 3531; CHECK-NEXT: stg %r3, 0(%r4)32; CHECK-NEXT: br %r1433 %t = call {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 4294967295)34 %val = extractvalue {i64, i1} %t, 035 %obit = extractvalue {i64, i1} %t, 136 store i64 %val, ptr %res37 ret i1 %obit38}39 40; Check the next value up, which must be loaded into a register first.41define zeroext i1 @f3(i64 %dummy, i64 %a, ptr %res) {42; CHECK-LABEL: f3:43; CHECK: # %bb.0:44; CHECK-NEXT: llihl %r0, 145; CHECK-NEXT: algr %r0, %r346; CHECK-NEXT: ipm %r147; CHECK-NEXT: risbg %r2, %r1, 63, 191, 3548; CHECK-NEXT: stg %r0, 0(%r4)49; CHECK-NEXT: br %r1450 %t = call {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 4294967296)51 %val = extractvalue {i64, i1} %t, 052 %obit = extractvalue {i64, i1} %t, 153 store i64 %val, ptr %res54 ret i1 %obit55}56 57; Likewise for negative values.58define zeroext i1 @f4(i64 %dummy, i64 %a, ptr %res) {59; CHECK-LABEL: f4:60; CHECK: # %bb.0:61; CHECK-NEXT: lghi %r0, -162; CHECK-NEXT: algr %r0, %r363; CHECK-NEXT: ipm %r164; CHECK-NEXT: risbg %r2, %r1, 63, 191, 3565; CHECK-NEXT: stg %r0, 0(%r4)66; CHECK-NEXT: br %r1467 %t = call {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 -1)68 %val = extractvalue {i64, i1} %t, 069 %obit = extractvalue {i64, i1} %t, 170 store i64 %val, ptr %res71 ret i1 %obit72}73 74; Check using the overflow result for a branch.75define void @f5(i64 %dummy, i64 %a, ptr %res) {76; CHECK-LABEL: f5:77; CHECK: # %bb.0:78; CHECK-NEXT: algfi %r3, 179; CHECK-NEXT: stg %r3, 0(%r4)80; CHECK-NEXT: jgnle foo@PLT81; CHECK-NEXT: .LBB4_1: # %exit82; CHECK-NEXT: br %r1483 %t = call {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 1)84 %val = extractvalue {i64, i1} %t, 085 %obit = extractvalue {i64, i1} %t, 186 store i64 %val, ptr %res87 br i1 %obit, label %call, label %exit88 89call:90 tail call i64 @foo()91 br label %exit92 93exit:94 ret void95}96 97; ... and the same with the inverted direction.98define void @f6(i64 %dummy, i64 %a, ptr %res) {99; CHECK-LABEL: f6:100; CHECK: # %bb.0:101; CHECK-NEXT: algfi %r3, 1102; CHECK-NEXT: stg %r3, 0(%r4)103; CHECK-NEXT: jgle foo@PLT104; CHECK-NEXT: .LBB5_1: # %exit105; CHECK-NEXT: br %r14106 %t = call {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 1)107 %val = extractvalue {i64, i1} %t, 0108 %obit = extractvalue {i64, i1} %t, 1109 store i64 %val, ptr %res110 br i1 %obit, label %exit, label %call111 112call:113 tail call i64 @foo()114 br label %exit115 116exit:117 ret void118}119 120declare {i64, i1} @llvm.uadd.with.overflow.i64(i64, i64) nounwind readnone121 122