mul.rs 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133
  1. use int::{Int, LargeInt};
  2. macro_rules! mul {
  3. ($intrinsic:ident: $ty:ty) => {
  4. /// Returns `a * b`
  5. #[cfg_attr(not(test), no_mangle)]
  6. pub extern "C" fn $intrinsic(a: $ty, b: $ty) -> $ty {
  7. let half_bits = <$ty>::bits() / 4;
  8. let lower_mask = !0 >> half_bits;
  9. let mut low = (a.low() & lower_mask) * (b.low() & lower_mask);
  10. let mut t = low >> half_bits;
  11. low &= lower_mask;
  12. t += (a.low() >> half_bits) * (b.low() & lower_mask);
  13. low += (t & lower_mask) << half_bits;
  14. let mut high = t >> half_bits;
  15. t = low >> half_bits;
  16. low &= lower_mask;
  17. t += (b.low() >> half_bits) * (a.low() & lower_mask);
  18. low += (t & lower_mask) << half_bits;
  19. high += t >> half_bits;
  20. high += (a.low() >> half_bits) * (b.low() >> half_bits);
  21. high = high.wrapping_add(a.high().wrapping_mul(b.low()).wrapping_add(a.low().wrapping_mul(b.high())));
  22. <$ty>::from_parts(low, high)
  23. }
  24. }
  25. }
  26. macro_rules! mulo {
  27. ($intrinsic:ident: $ty:ty) => {
  28. /// Returns `a * b` and sets `*overflow = 1` if `a * b` overflows
  29. #[cfg_attr(not(test), no_mangle)]
  30. pub extern "C" fn $intrinsic(a: $ty, b: $ty, overflow: &mut i32) -> $ty {
  31. *overflow = 0;
  32. let result = a.wrapping_mul(b);
  33. if a == <$ty>::min_value() {
  34. if b != 0 && b != 1 {
  35. *overflow = 1;
  36. }
  37. return result;
  38. }
  39. if b == <$ty>::min_value() {
  40. if a != 0 && a != 1 {
  41. *overflow = 1;
  42. }
  43. return result;
  44. }
  45. let sa = a >> (<$ty>::bits() - 1);
  46. let abs_a = (a ^ sa) - sa;
  47. let sb = b >> (<$ty>::bits() - 1);
  48. let abs_b = (b ^ sb) - sb;
  49. if abs_a < 2 || abs_b < 2 {
  50. return result;
  51. }
  52. if sa == sb {
  53. if abs_a > <$ty>::max_value() / abs_b {
  54. *overflow = 1;
  55. }
  56. } else {
  57. if abs_a > <$ty>::min_value() / -abs_b {
  58. *overflow = 1;
  59. }
  60. }
  61. result
  62. }
  63. }
  64. }
  65. mul!(__muldi3: u64);
  66. mulo!(__mulosi4: i32);
  67. mulo!(__mulodi4: i64);
  68. #[cfg(test)]
  69. mod tests {
  70. use qc::{I32, I64, U64};
  71. use gcc_s;
  72. use rand;
  73. quickcheck! {
  74. fn muldi(a: U64, b: U64) -> bool {
  75. let (a, b) = (a.0, b.0);
  76. let r = super::__muldi3(a, b);
  77. match gcc_s::muldi3() {
  78. Some(muldi3) if rand::random() => r == unsafe { muldi3(a, b) },
  79. _ => r == a.wrapping_mul(b),
  80. }
  81. }
  82. fn mulosi(a: I32, b: I32) -> bool {
  83. let (a, b) = (a.0, b.0);
  84. let mut overflow = 2;
  85. let r = super::__mulosi4(a, b, &mut overflow);
  86. if overflow != 0 && overflow != 1 {
  87. return false;
  88. }
  89. match gcc_s::mulosi4() {
  90. Some(mulosi4) if rand::random() => {
  91. let mut gcc_s_overflow = 2;
  92. let gcc_s_r = unsafe {
  93. mulosi4(a, b, &mut gcc_s_overflow)
  94. };
  95. (r, overflow) == (gcc_s_r, gcc_s_overflow)
  96. },
  97. _ => (r, overflow != 0) == a.overflowing_mul(b),
  98. }
  99. }
  100. fn mulodi(a: I64, b: I64) -> bool {
  101. let (a, b) = (a.0, b.0);
  102. let mut overflow = 2;
  103. let r = super::__mulodi4(a, b, &mut overflow);
  104. if overflow != 0 && overflow != 1 {
  105. return false;
  106. }
  107. match gcc_s::mulodi4() {
  108. Some(mulodi4) if rand::random() => {
  109. let mut gcc_s_overflow = 2;
  110. let gcc_s_r = unsafe {
  111. mulodi4(a, b, &mut gcc_s_overflow)
  112. };
  113. (r, overflow) == (gcc_s_r, gcc_s_overflow)
  114. },
  115. _ => (r, overflow != 0) == a.overflowing_mul(b),
  116. }
  117. }
  118. }
  119. }