47 h += (x & (((uint64_t)1 << sh) - 1)) != 0;
48 return ldexp((
double)h, sh);
70 }
else if (exp <= 2) {
83 mant = ldexp((
double)base, 1 - bits);
86 uint64_t h = (base >> (bits - 53)) + 1;
87 mant = ldexp((
double)h, -52);
111 }
else if (exp == 2) {
125 h = (base[
n - 1] >> (
t - 53)) + 1;
128 h = ((base[
n - 1] << (53 -
t)) | (base[
n - 2] >> (
LIMB_BITS - 53 +
t))) + 1;
154 }
else if (exp == 2) {
157 rn -= (dst[rn - 1] == 0);
173 for (
ulong i = 1; i < exp; ++i) {
176 rn -= (dst[rn - 1] == 0);
180 return lmmp_pow_1_(dst, rn, base[0], exp) + base_tz;
206 for (; i <= tz; i += 2) {
209 rn -= (dst[rn - 1] == 0);
212 rn -= (sq[rn - 1] == 0);
216 rn -= (dst[rn - 1] == 0);
226 for (; i <= tz; i += 2) {
229 rn -= (sq[rn - 1] == 0);
232 rn -= (dst[rn - 1] == 0);
#define lmmp_limb_popcnt_
#define lmmp_tailing_zeros_
#define lmmp_copy(dst, src, n)
#define lmmp_zero(dst, n)
const mp_limb_t * mp_srcptr
#define lmmp_param_assert(x)
mp_limb_t lmmp_mul_1_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_limb_t x)
乘以单limb操作 [dst,na] = [numa,na] * x
#define POW_WIN2_EXP_THRESHOLD
#define POW_1_EXP_THRESHOLD
#define POW_WIN2_N_THRESHOLD
mp_size_t lmmp_pow_1_size_(mp_limb_t base, ulong exp)
计算幂次方需要的limb缓冲区长度 base ^ exp
mp_size_t lmmp_pow_win2_(mp_ptr dst, mp_size_t rn, mp_srcptr base, mp_size_t n, ulong exp)
计算幂次方2比特窗口快速幂算法 [dst,rn] = [base,n] ^ exp
mp_size_t lmmp_pow_1_(mp_ptr dst, mp_size_t rn, mp_limb_t base, ulong exp)
计算幂次方 [dst,rn] = [base,1] ^ exp
mp_size_t lmmp_pow_basecase_(mp_ptr dst, mp_size_t rn, mp_srcptr base, mp_size_t n, ulong exp)
计算奇数次幂算法 [dst,rn] = [base,n] ^ exp
mp_size_t lmmp_pow_(mp_ptr dst, mp_size_t rn, mp_srcptr base, mp_size_t n, ulong exp)
计算大整数幂 [dst,rn] = [base,n] ^ exp
mp_size_t lmmp_pow_size_(mp_srcptr base, mp_size_t n, ulong exp)
计算幂次方需要的limb缓冲区长度 [base,n] ^ exp
static mp_size_t floor1_u64(double r)
计算floor(r)+1并转为mp_size_t
static double ulong_upper_d(ulong x)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define restrict
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define TALLOC_TYPE(n, type)