168 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py2; RUN: llc < %s -mtriple=m68k-linux -verify-machineinstrs | FileCheck %s3 4define zeroext i8 @smul_i8(i8 signext %a, i8 signext %b) nounwind ssp {5; CHECK-LABEL: smul_i8:6; CHECK: ; %bb.0: ; %entry7; CHECK-NEXT: move.b (11,%sp), %d08; CHECK-NEXT: and.l #255, %d09; CHECK-NEXT: move.b (7,%sp), %d110; CHECK-NEXT: and.l #255, %d111; CHECK-NEXT: muls %d0, %d112; CHECK-NEXT: move.l %d1, %d013; CHECK-NEXT: and.l #65535, %d014; CHECK-NEXT: and.l #255, %d015; CHECK-NEXT: rts16entry:17 %smul = tail call { i8, i1 } @llvm.smul.with.overflow.i8(i8 %a, i8 %b)18 %cmp = extractvalue { i8, i1 } %smul, 119 %smul.result = extractvalue { i8, i1 } %smul, 020 %X = select i1 %cmp, i8 42, i8 %smul.result21 ret i8 %X22}23 24define zeroext i8 @smul_i8_no_ovf(i8 signext %a, i8 signext %b) nounwind ssp {25; CHECK-LABEL: smul_i8_no_ovf:26; CHECK: ; %bb.0: ; %entry27; CHECK-NEXT: moveq #42, %d028; CHECK-NEXT: rts29entry:30 %smul = tail call { i8, i1 } @llvm.smul.with.overflow.i8(i8 %a, i8 %b)31 %cmp = extractvalue { i8, i1 } %smul, 132 %smul.result = extractvalue { i8, i1 } %smul, 033 %X = select i1 %cmp, i8 %smul.result, i8 4234 ret i8 %X35}36 37declare { i8, i1 } @llvm.smul.with.overflow.i8(i8, i8) nounwind readnone38 39define zeroext i16 @smul_i16(i16 signext %a, i16 signext %b) nounwind ssp {40; CHECK-LABEL: smul_i16:41; CHECK: ; %bb.0: ; %entry42; CHECK-NEXT: move.w (6,%sp), %d043; CHECK-NEXT: move.w (10,%sp), %d144; CHECK-NEXT: muls %d1, %d045; CHECK-NEXT: and.l #65535, %d046; CHECK-NEXT: rts47entry:48 %smul = tail call { i16, i1 } @llvm.smul.with.overflow.i16(i16 %a, i16 %b)49 %cmp = extractvalue { i16, i1 } %smul, 150 %smul.result = extractvalue { i16, i1 } %smul, 051 %X = select i1 %cmp, i16 42, i16 %smul.result52 ret i16 %X53}54 55declare { i16, i1 } @llvm.smul.with.overflow.i16(i16, i16) nounwind readnone56 57declare i32 @printf(ptr, ...) nounwind58declare {i32, i1} @llvm.smul.with.overflow.i32(i32, i32)59 60@ok = internal constant [4 x i8] c"%d\0A\00"61@no = internal constant [4 x i8] c"no\0A\00"62 63define fastcc i1 @test1(i32 %v1, i32 %v2) nounwind {64; CHECK-LABEL: test1:65; CHECK: ; %bb.0: ; %entry66; CHECK-NEXT: suba.l #12, %sp67; CHECK-NEXT: muls.l %d1, %d068; CHECK-NEXT: bvc .LBB3_169; CHECK-NEXT: ; %bb.2: ; %overflow70; CHECK-NEXT: lea (no,%pc), %a071; CHECK-NEXT: move.l %a0, (%sp)72; CHECK-NEXT: jsr printf73; CHECK-NEXT: moveq #0, %d074; CHECK-NEXT: adda.l #12, %sp75; CHECK-NEXT: rts76; CHECK-NEXT: .LBB3_1: ; %normal77; CHECK-NEXT: move.l %d0, (4,%sp)78; CHECK-NEXT: lea (ok,%pc), %a079; CHECK-NEXT: move.l %a0, (%sp)80; CHECK-NEXT: jsr printf81; CHECK-NEXT: moveq #1, %d082; CHECK-NEXT: adda.l #12, %sp83; CHECK-NEXT: rts84entry:85 %t = call {i32, i1} @llvm.smul.with.overflow.i32(i32 %v1, i32 %v2)86 %sum = extractvalue {i32, i1} %t, 087 %obit = extractvalue {i32, i1} %t, 188 br i1 %obit, label %overflow, label %normal89 90normal:91 %t1 = tail call i32 (ptr, ...) @printf( ptr @ok, i32 %sum ) nounwind92 ret i1 true93 94overflow:95 %t2 = tail call i32 (ptr, ...) @printf( ptr @no ) nounwind96 ret i1 false97}98 99define fastcc i1 @test2(i32 %v1, i32 %v2) nounwind {100; CHECK-LABEL: test2:101; CHECK: ; %bb.0: ; %entry102; CHECK-NEXT: suba.l #12, %sp103; CHECK-NEXT: muls.l %d1, %d0104; CHECK-NEXT: svs %d1105; CHECK-NEXT: and.b #1, %d1106; CHECK-NEXT: cmpi.b #0, %d1107; CHECK-NEXT: beq .LBB4_2108; CHECK-NEXT: ; %bb.1: ; %overflow109; CHECK-NEXT: lea (no,%pc), %a0110; CHECK-NEXT: move.l %a0, (%sp)111; CHECK-NEXT: jsr printf112; CHECK-NEXT: moveq #0, %d0113; CHECK-NEXT: adda.l #12, %sp114; CHECK-NEXT: rts115; CHECK-NEXT: .LBB4_2: ; %normal116; CHECK-NEXT: move.l %d0, (4,%sp)117; CHECK-NEXT: lea (ok,%pc), %a0118; CHECK-NEXT: move.l %a0, (%sp)119; CHECK-NEXT: jsr printf120; CHECK-NEXT: moveq #1, %d0121; CHECK-NEXT: adda.l #12, %sp122; CHECK-NEXT: rts123entry:124 %t = call {i32, i1} @llvm.smul.with.overflow.i32(i32 %v1, i32 %v2)125 %sum = extractvalue {i32, i1} %t, 0126 %obit = extractvalue {i32, i1} %t, 1127 br i1 %obit, label %overflow, label %normal128 129overflow:130 %t2 = tail call i32 (ptr, ...) @printf( ptr @no ) nounwind131 ret i1 false132 133normal:134 %t1 = tail call i32 (ptr, ...) @printf( ptr @ok, i32 %sum ) nounwind135 ret i1 true136}137 138define i32 @test3(i32 %a, i32 %b) nounwind readnone {139; CHECK-LABEL: test3:140; CHECK: ; %bb.0: ; %entry141; CHECK-NEXT: move.l (8,%sp), %d0142; CHECK-NEXT: add.l (4,%sp), %d0143; CHECK-NEXT: add.l %d0, %d0144; CHECK-NEXT: rts145entry:146 %tmp0 = add i32 %b, %a147 %tmp1 = call { i32, i1 } @llvm.smul.with.overflow.i32(i32 %tmp0, i32 2)148 %tmp2 = extractvalue { i32, i1 } %tmp1, 0149 ret i32 %tmp2150}151 152; Same as umul-with-overflow, we shouldn't fallback to153; builtin here154define i32 @test4(i32 %a, i32 %b) nounwind readnone {155; CHECK-LABEL: test4:156; CHECK: ; %bb.0: ; %entry157; CHECK-NEXT: move.l (8,%sp), %d0158; CHECK-NEXT: add.l (4,%sp), %d0159; CHECK-NEXT: moveq #4, %d1160; CHECK-NEXT: muls.l %d1, %d0161; CHECK-NEXT: rts162entry:163 %tmp0 = add i32 %b, %a164 %tmp1 = call { i32, i1 } @llvm.smul.with.overflow.i32(i32 %tmp0, i32 4)165 %tmp2 = extractvalue { i32, i1 } %tmp1, 0166 ret i32 %tmp2167}168