|
|
@ -3,31 +3,32 @@ |
|
|
|
|
|
|
|
|
#pragma intrinsic(_umul128)
|
|
|
#pragma intrinsic(_umul128)
|
|
|
#endif
|
|
|
#endif
|
|
|
|
|
|
#include <cstring>
|
|
|
#include "common/uint128.h"
|
|
|
#include "common/uint128.h"
|
|
|
|
|
|
|
|
|
namespace Common { |
|
|
namespace Common { |
|
|
|
|
|
|
|
|
u128 Multiply64Into128(u64 a, u64 b) { |
|
|
u128 Multiply64Into128(u64 a, u64 b) { |
|
|
#ifdef _MSC_VER
|
|
|
|
|
|
u128 result; |
|
|
u128 result; |
|
|
|
|
|
#ifdef _MSC_VER
|
|
|
result[0] = _umul128(a, b, &result[1]); |
|
|
result[0] = _umul128(a, b, &result[1]); |
|
|
#else
|
|
|
#else
|
|
|
unsigned __int128 tmp = a; |
|
|
unsigned __int128 tmp = a; |
|
|
tmp *= b; |
|
|
tmp *= b; |
|
|
u128 result; |
|
|
|
|
|
std::memcpy(&result, &tmp, sizeof(u128)); |
|
|
std::memcpy(&result, &tmp, sizeof(u128)); |
|
|
#endif
|
|
|
#endif
|
|
|
return result; |
|
|
return result; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
std::pair<u64, u64> Divide128On64(u128 dividend, u64 divisor) { |
|
|
|
|
|
|
|
|
std::pair<u64, u64> Divide128On32(u128 dividend, u32 divisor) { |
|
|
u64 remainder = dividend[0] % divisor; |
|
|
u64 remainder = dividend[0] % divisor; |
|
|
u64 accum = dividend[0] / divisor; |
|
|
u64 accum = dividend[0] / divisor; |
|
|
if (dividend[1] == 0) |
|
|
if (dividend[1] == 0) |
|
|
return {accum, remainder}; |
|
|
return {accum, remainder}; |
|
|
// We ignore dividend[1] / divisor as that overflows
|
|
|
// We ignore dividend[1] / divisor as that overflows
|
|
|
u64 first_segment = (dividend[1] % divisor) << 32; |
|
|
|
|
|
|
|
|
const u64 first_segment = (dividend[1] % divisor) << 32; |
|
|
accum += (first_segment / divisor) << 32; |
|
|
accum += (first_segment / divisor) << 32; |
|
|
u64 second_segment = (first_segment % divisor) << 32; |
|
|
|
|
|
|
|
|
const u64 second_segment = (first_segment % divisor) << 32; |
|
|
accum += (second_segment / divisor); |
|
|
accum += (second_segment / divisor); |
|
|
remainder += second_segment % divisor; |
|
|
remainder += second_segment % divisor; |
|
|
if (remainder >= divisor) { |
|
|
if (remainder >= divisor) { |
|
|
|