39 }
while (numa[--na] == 0);
76 while (i && (msd =
lmmp_mulh_(frac, base)) == 0) {
113 if (na >= np + zeros) {
114 mp_limb_t ah = 0, al = numa[na - 1] << cnt;
120 adjust = (ah || al >= p[np - 1]);
124 if (na + adjust <= np + zeros) {
135 mp_ptr q = tpq, r = numa - zeros;
148 while (nq && q[nq - 1] == 0) --nq;
152 while (nr && r[nr - 1] == 0) --nr;
157 while (digitsl != pdigits) {
163 digits = digitsl + digitsh;
175 }
while (numa[--na] == 0);
183 int mask = (1 << cnt) - 1;
185 digits = (bits - 1) / cnt + 1;
187 int bitpos = digits * cnt -
LIMB_BITS * (na - 1);
190 while ((bitpos -= cnt) >= 0) {
191 *--dst = curlimb >> bitpos & mask;
196 curlimb = numa[na - 1];
198 *--dst = (prevlimb | curlimb >> bitpos) & mask;
218 bexp = (bexp + 1) >> 1;
229 alloc_size += npow + 1;
238 alloc_size += npow * 2;
243 for (
int i = 0; i < 2; ++i) {
249 powers[i].
digits = digitspl * (i + 1);
250 powers[i].
base = base;
256 for (
int i = 2; i < cpow; ++i) {
260 np -=
tp[np - 1] == 0;
261 if (bexp + 1 < exps[cpow - 1 - i]) {
277 powers[i].
zeros = zeros;
278 powers[i].
digits = digitspl * (bexp + 1);
279 powers[i].
base = base;
283 for (
int i = 1; i < cpow; ++i) {
302 if ((powers[i].norm_cnt = cnt))
#define lmmp_leading_zeros_
#define lmmp_tailing_zeros_
#define lmmp_copy(dst, src, n)
#define LMMP_POW2_Q(n)
检查n是否为2的幂次方
const mp_limb_t * mp_srcptr
#define LMMP_VECT_CONSERVATIVE
#define lmmp_param_assert(x)
#define DIV_MULINV_L_THRESHOLD
#define TO_STR_DIVIDE_THRESHOLD
#define TO_STR_BASEPOW_THRESHOLD
mp_limb_t lmmp_div_s_(mp_ptr dstq, mp_ptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
除法运算
static mp_size_t lmmp_div_inv_size_(mp_size_t nq, mp_size_t nb)
计算预计算逆元的尺寸
mp_limb_t lmmp_div_1_(mp_ptr dstq, mp_srcptr numa, mp_size_t na, mp_limb_t x)
单精度数除法
void lmmp_inv_prediv_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_size_t ni)
除法前的逆元预计算,[dst,ni] = invappr( (ni+1 MSLs of numa) + 1 ) / B
mp_limb_t lmmp_shr_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_size_t shr)
右移操作 [dst,na] = [numa,na]>>shr,dst的高shr位填充0
mp_size_t lmmp_to_str_(mp_byte_t *dst, mp_srcptr numa, mp_size_t na, int base)
limb数组转字节数组操作 [numa,na,B] to [dst,return value,base]
mp_size_t lmmp_to_str_len_(mp_srcptr numa, mp_size_t na, int base)
计算转换为字节数组,字节数组需要的缓冲区长度
mp_limb_t lmmp_shl_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_size_t shl)
左移操作 [dst,na] = [numa,na]<<shl,dst的低shl位填充0
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_div_mulinv_(mp_ptr dstq, mp_ptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb, mp_srcptr invappr, mp_size_t ni)
乘法逆元除法
mp_size_t lmmp_from_str_len_(const mp_byte_t *src, mp_size_t len, int base)
计算字节数组转limb数组所需的 limb 缓冲区长度
mp_size_t lmmp_to_str_basecase_(mp_byte_t *dst, mp_srcptr numa, mp_size_t na, int base, mp_byte_t off)
basecase limb 数组转字节串引擎
mp_size_t lmmp_to_str_divide_(mp_byte_t *dst, mp_ptr numa, mp_size_t na, mp_basepow_t *pow, mp_ptr tpq, mp_byte_t off)
分治 limb 数组转字节串引擎
const mp_base_t lmmp_bases_table[255]
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define restrict
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define BALLOC_TYPE(n, type)