38ffa2bb96
For remainder: If (1 << (Bitwidth / 2)) % Divisor == 1, we can add the high and low halves together and use a (Bitwidth / 2) urem. If (BitWidth /2) is a legal integer type, this urem will be expand by DAGCombiner using multiply by magic constant. We do have to take into account that adding high and low together can produce a carry, making it a (BitWidth / 2)+1 bit number. So we need to also add back in the carry from the first addition. For division: We can use the above trick to compute the remainder, subtract that remainder from the dividend, then multiply by the multiplicative inverse of the Divisor modulo (1 << BitWidth). This is based on the section "Remainder by Summing Digits" in Hacker's delight. The remainder trick is similar to a trick you may have learned for determining if a decimal number is divisible by 3. You can add all the digits together and see if the sum is divisible by 3. If you're not sure if the sum is divisible by 3, you can add its digits together. This can be repeated until you have a single decimal digit. If that digit is 3, 6, or 9, then the original number is divisible by 3. This works because 10 % 3 == 1. gcc already does this same trick. There are additional tricks gcc does urem as well as srem, udiv, and sdiv that I plan to add in future patches. Reviewed By: RKSimon Differential Revision: https://reviews.llvm.org/D130862
300 lines
8.4 KiB
LLVM
300 lines
8.4 KiB
LLVM
; RUN: llc < %s -mtriple=ve-unknown-unknown | FileCheck %s
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i128 @remi128(i128 %a, i128 %b) {
|
|
; CHECK-LABEL: remi128:
|
|
; CHECK: .LBB{{[0-9]+}}_2:
|
|
; CHECK-NEXT: lea %s4, __modti3@lo
|
|
; CHECK-NEXT: and %s4, %s4, (32)0
|
|
; CHECK-NEXT: lea.sl %s12, __modti3@hi(, %s4)
|
|
; CHECK-NEXT: bsic %s10, (, %s12)
|
|
; CHECK-NEXT: or %s11, 0, %s9
|
|
%r = srem i128 %a, %b
|
|
ret i128 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @remi64(i64 %a, i64 %b) {
|
|
; CHECK-LABEL: remi64:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divs.l %s2, %s0, %s1
|
|
; CHECK-NEXT: muls.l %s1, %s2, %s1
|
|
; CHECK-NEXT: subs.l %s0, %s0, %s1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = srem i64 %a, %b
|
|
ret i64 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i32 @remi32(i32 signext %a, i32 signext %b) {
|
|
; CHECK-LABEL: remi32:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divs.w.sx %s2, %s0, %s1
|
|
; CHECK-NEXT: muls.w.sx %s1, %s2, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: adds.w.sx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = srem i32 %a, %b
|
|
ret i32 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i128 @remu128(i128 %a, i128 %b) {
|
|
; CHECK-LABEL: remu128:
|
|
; CHECK: .LBB{{[0-9]+}}_2:
|
|
; CHECK-NEXT: lea %s4, __umodti3@lo
|
|
; CHECK-NEXT: and %s4, %s4, (32)0
|
|
; CHECK-NEXT: lea.sl %s12, __umodti3@hi(, %s4)
|
|
; CHECK-NEXT: bsic %s10, (, %s12)
|
|
; CHECK-NEXT: or %s11, 0, %s9
|
|
%r = urem i128 %a, %b
|
|
ret i128 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @remu64(i64 %a, i64 %b) {
|
|
; CHECK-LABEL: remu64:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divu.l %s2, %s0, %s1
|
|
; CHECK-NEXT: muls.l %s1, %s2, %s1
|
|
; CHECK-NEXT: subs.l %s0, %s0, %s1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = urem i64 %a, %b
|
|
ret i64 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define zeroext i32 @remu32(i32 zeroext %a, i32 zeroext %b) {
|
|
; CHECK-LABEL: remu32:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divu.w %s2, %s0, %s1
|
|
; CHECK-NEXT: muls.w.sx %s1, %s2, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: adds.w.zx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = urem i32 %a, %b
|
|
ret i32 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i16 @remi16(i16 signext %a, i16 signext %b) {
|
|
; CHECK-LABEL: remi16:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divs.w.sx %s2, %s0, %s1
|
|
; CHECK-NEXT: muls.w.sx %s1, %s2, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: adds.w.sx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%a32 = sext i16 %a to i32
|
|
%b32 = sext i16 %b to i32
|
|
%r32 = srem i32 %a32, %b32
|
|
%r = trunc i32 %r32 to i16
|
|
ret i16 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define zeroext i16 @remu16(i16 zeroext %a, i16 zeroext %b) {
|
|
; CHECK-LABEL: remu16:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divu.w %s2, %s0, %s1
|
|
; CHECK-NEXT: muls.w.sx %s1, %s2, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: adds.w.zx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = urem i16 %a, %b
|
|
ret i16 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i8 @remi8(i8 signext %a, i8 signext %b) {
|
|
; CHECK-LABEL: remi8:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divs.w.sx %s2, %s0, %s1
|
|
; CHECK-NEXT: muls.w.sx %s1, %s2, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: adds.w.sx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%a32 = sext i8 %a to i32
|
|
%b32 = sext i8 %b to i32
|
|
%r32 = srem i32 %a32, %b32
|
|
%r = trunc i32 %r32 to i8
|
|
ret i8 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define zeroext i8 @remu8(i8 zeroext %a, i8 zeroext %b) {
|
|
; CHECK-LABEL: remu8:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divu.w %s2, %s0, %s1
|
|
; CHECK-NEXT: muls.w.sx %s1, %s2, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: adds.w.zx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = urem i8 %a, %b
|
|
ret i8 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i128 @remi128ri(i128 %a) {
|
|
; CHECK-LABEL: remi128ri:
|
|
; CHECK: .LBB{{[0-9]+}}_2:
|
|
; CHECK-NEXT: lea %s2, __modti3@lo
|
|
; CHECK-NEXT: and %s2, %s2, (32)0
|
|
; CHECK-NEXT: lea.sl %s12, __modti3@hi(, %s2)
|
|
; CHECK-NEXT: or %s2, 3, (0)1
|
|
; CHECK-NEXT: or %s3, 0, (0)1
|
|
; CHECK-NEXT: bsic %s10, (, %s12)
|
|
; CHECK-NEXT: or %s11, 0, %s9
|
|
%r = srem i128 %a, 3
|
|
ret i128 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @remi64ri(i64 %a) {
|
|
; CHECK-LABEL: remi64ri:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divs.l %s1, %s0, (62)0
|
|
; CHECK-NEXT: muls.l %s1, 3, %s1
|
|
; CHECK-NEXT: subs.l %s0, %s0, %s1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = srem i64 %a, 3
|
|
ret i64 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i32 @remi32ri(i32 signext %a) {
|
|
; CHECK-LABEL: remi32ri:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divs.w.sx %s1, %s0, (62)0
|
|
; CHECK-NEXT: muls.w.sx %s1, 3, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: adds.w.sx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = srem i32 %a, 3
|
|
ret i32 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i128 @remu128ri(i128 %a) {
|
|
; CHECK-LABEL: remu128ri:
|
|
; CHECK: .LBB{{[0-9]+}}_2:
|
|
; CHECK-NEXT: lea %s2, __umodti3@lo
|
|
; CHECK-NEXT: and %s2, %s2, (32)0
|
|
; CHECK-NEXT: lea.sl %s12, __umodti3@hi(, %s2)
|
|
; CHECK-NEXT: or %s2, 11, (0)1
|
|
; CHECK-NEXT: or %s3, 0, (0)1
|
|
; CHECK-NEXT: bsic %s10, (, %s12)
|
|
; CHECK-NEXT: or %s11, 0, %s9
|
|
%r = urem i128 %a, 11
|
|
ret i128 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @remu64ri(i64 %a) {
|
|
; CHECK-LABEL: remu64ri:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divu.l %s1, %s0, (62)0
|
|
; CHECK-NEXT: muls.l %s1, 3, %s1
|
|
; CHECK-NEXT: subs.l %s0, %s0, %s1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = urem i64 %a, 3
|
|
ret i64 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define zeroext i32 @remu32ri(i32 zeroext %a) {
|
|
; CHECK-LABEL: remu32ri:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divu.w %s1, %s0, (62)0
|
|
; CHECK-NEXT: muls.w.sx %s1, 3, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: adds.w.zx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = urem i32 %a, 3
|
|
ret i32 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i128 @remi128li(i128 %a) {
|
|
; CHECK-LABEL: remi128li:
|
|
; CHECK: .LBB{{[0-9]+}}_2:
|
|
; CHECK-NEXT: or %s3, 0, %s1
|
|
; CHECK-NEXT: or %s2, 0, %s0
|
|
; CHECK-NEXT: lea %s0, __modti3@lo
|
|
; CHECK-NEXT: and %s0, %s0, (32)0
|
|
; CHECK-NEXT: lea.sl %s12, __modti3@hi(, %s0)
|
|
; CHECK-NEXT: or %s0, 3, (0)1
|
|
; CHECK-NEXT: or %s1, 0, (0)1
|
|
; CHECK-NEXT: bsic %s10, (, %s12)
|
|
; CHECK-NEXT: or %s11, 0, %s9
|
|
%r = srem i128 3, %a
|
|
ret i128 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @remi64li(i64 %a, i64 %b) {
|
|
; CHECK-LABEL: remi64li:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divs.l %s0, 3, %s1
|
|
; CHECK-NEXT: muls.l %s0, %s0, %s1
|
|
; CHECK-NEXT: subs.l %s0, 3, %s0
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = srem i64 3, %b
|
|
ret i64 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define signext i32 @remi32li(i32 signext %a, i32 signext %b) {
|
|
; CHECK-LABEL: remi32li:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divs.w.sx %s0, 3, %s1
|
|
; CHECK-NEXT: muls.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, 3, %s0
|
|
; CHECK-NEXT: adds.w.zx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = srem i32 3, %b
|
|
ret i32 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i128 @remu128li(i128) {
|
|
; CHECK-LABEL: remu128li:
|
|
; CHECK: .LBB{{[0-9]+}}_2:
|
|
; CHECK-NEXT: or %s3, 0, %s1
|
|
; CHECK-NEXT: or %s2, 0, %s0
|
|
; CHECK-NEXT: lea %s0, __umodti3@lo
|
|
; CHECK-NEXT: and %s0, %s0, (32)0
|
|
; CHECK-NEXT: lea.sl %s12, __umodti3@hi(, %s0)
|
|
; CHECK-NEXT: or %s0, 3, (0)1
|
|
; CHECK-NEXT: or %s1, 0, (0)1
|
|
; CHECK-NEXT: bsic %s10, (, %s12)
|
|
; CHECK-NEXT: or %s11, 0, %s9
|
|
%2 = urem i128 3, %0
|
|
ret i128 %2
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define i64 @remu64li(i64 %a, i64 %b) {
|
|
; CHECK-LABEL: remu64li:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divu.l %s0, 3, %s1
|
|
; CHECK-NEXT: muls.l %s0, %s0, %s1
|
|
; CHECK-NEXT: subs.l %s0, 3, %s0
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = urem i64 3, %b
|
|
ret i64 %r
|
|
}
|
|
|
|
; Function Attrs: norecurse nounwind readnone
|
|
define zeroext i32 @remu32li(i32 zeroext %a, i32 zeroext %b) {
|
|
; CHECK-LABEL: remu32li:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: divu.w %s0, 3, %s1
|
|
; CHECK-NEXT: muls.w.sx %s0, %s0, %s1
|
|
; CHECK-NEXT: subs.w.sx %s0, 3, %s0
|
|
; CHECK-NEXT: adds.w.zx %s0, %s0, (0)1
|
|
; CHECK-NEXT: b.l.t (, %s10)
|
|
%r = urem i32 3, %b
|
|
ret i32 %r
|
|
}
|