31#define CBRT_DIVIDE_MIN (0x6000000000000000ull)
34 const mp_limb_t dn = 0xC000000000000000ull;
35 const mp_limb_t di = 0x5555555555555555ull;
38 al = (a[
n - 1] << 62) | (a[
n - 2] >> 2);
43 al = (a[i] << 62) | (a[i - 1] >> 2);
60 dst[2] =
t[1] + (dst[1] <
t[0] ? 1 : 0);
103 r = (x[0] >> (64 - shift)) | (1ULL << shift);
139 return b ? ((
lo >> b) | (hi << (64 - b))) :
lo;
155 uint64_t s0 = bits - 129;
180 r[0] = (e[1] << (64 - d)) | (e[0] >> d);
181 r[1] = (e[1] >> d) | (1ULL << (
s - 64));
201 u[1] = r[1] + (u[0] == 0);
250 mp_limb_t rsav[6], w[6], u2[4], u3[5], x3sq[6];
279 for (
mp_size_t i = 0; i < na; i++) a[i] = numa[i];
#define CBRT_DIVIDE_MIN
Copyright (C) 2026 HJimmyK (Jericho Knox)
static void lmmp_cube_6_(mp_ptr restrict t, mp_srcptr restrict r)
计算 [t,6]=[r,2]^3
static void lmmp_cube_3_(mp_ptr restrict dst, mp_limb_t a)
static mp_limb_t lmmp_shr64_(mp_srcptr p, mp_size_t n, uint64_t s)
static void lmmp_cbrt_6_est_(mp_ptr r, mp_srcptr numa, mp_size_t n)
static void lmmp_cbrt_6_fix_(mp_ptr r, mp_srcptr a, mp_ptr t)
static mp_limb_t lmmp_div3_(mp_ptr q, mp_srcptr a, mp_size_t n)
#define lmmp_copy(dst, src, n)
#define lmmp_debug_assert(x)
const mp_limb_t * mp_srcptr
#define lmmp_param_assert(x)
mp_limb_t lmmp_div_s_(mp_ptr dstq, mp_ptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
除法运算
#define lmmp_dec(p)
减1宏(预期无借位)
#define lmmp_inc(p)
加1宏(预期无进位)
void lmmp_mul_basecase_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
基础乘法运算 [dst,na+nb] = [numa,na] * [numb,nb]
int lmmp_cmp_(mp_srcptr numa, mp_srcptr numb, mp_size_t n)
比较函数
static mp_limb_t lmmp_sub_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
减法静态内联函数 [dst,na]=[numa,na]-[numb,nb]
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
mp_limb_t lmmp_sub_n_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
无借位的n位减法 [dst,n] = [numa,n] - [numb,n]
#define lmmp_inc_1(p, inc)
加指定值宏(预期无进位)
mp_limb_t lmmp_add_n_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
无进位的n位加法 [dst,n] = [numa,n] + [numb,n]
void exp2_fixed_128(uint64_t *dst, uint64_t high, uint64_t low)
计算 floor(exp2(x/B)*B-B), B=2^128
void log2_fixed_128(uint64_t *dst, uint64_t high, uint64_t low)
计算 floor(log2(1+x/B)*B), B=2^128
uint64_t exp2_fixed_64(uint64_t x)
计算 floor(exp2(x/B)*B-B), B=2^64
uint64_t log2_fixed_64(uint64_t x)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define _udiv_qrnnd_preinv(q, r, nh, nl, d, di)
void lmmp_sqr_hard_2_(mp_ptr dst, mp_srcptr numa)
mp_limb_t lmmp_cbrt_3_(mp_limb_t a0, mp_limb_t a1, mp_limb_t a2)
计算算数立方根 floor(cbrt(a0+a1*B+a2*B^2))
void lmmp_cbrt_6_fast_(mp_ptr dst, mp_ptr numa, mp_ptr tp)
计算算术立方根 [dst,2] = floor(cbrt([numa,6]))
void lmmp_cbrt_6_(mp_ptr dst, mp_srcptr numa, mp_size_t na)
计算算术立方根 floor(cbrt([numa,na]))
#define restrict
Copyright (C) 2026 HJimmyK (Jericho Knox)