42 return b ? ((
lo >> b) | (hi << (64 - b))) :
lo;
65 *dr += 64 * (
slong)(l - wlimbs);
69 if (l > 0 && v[l - 1] == 0) --l;
113 for (
int i = hb - 1; i >= 0; --i) {
114 mp_ptr Q = (P == bufa) ? bufb : bufa;
119 if ((exp >> i) & 1) {
160 unsigned bit = (unsigned)(
s & 63);
171 unsigned bit = (unsigned)((-
s) & 63);
174 if (m > nlimbs - loff) m = nlimbs - loff;
176 if (loff + m < nlimbs) dst[loff + m] = cy;
194 if (a[i] != b[i])
return a[i] < b[i] ? -1 : 1;
209 while (i < yn && y[i] ==
LIMB_MAX) y[i++] = 0;
229 if (y[yn - 1] == 0) --yn;
290 if (ycap < yneed) ycap = yneed;
291 return 2 * ycap + na + 4 + 13 * nq + 123;
307 lmmp_zero(dstr + na, (root - 1) * nr + 1 - na);
315 for (
ulong i = 0; i < root; ++i) acc *= dsts[0];
316 dstr[0] = numa[0] - acc;
348 mp_ptr q1 =
tp,
r1 = q1 + na / 2 + 2, S =
r1 + na / 2 + 2, r2v = S + nr + 2,
349 sum = r2v + na / 2 + 2, prd = sum + na / 2 + 3;
359 if (un > s2n)
lmmp_zero(sum + s2n, un - s2n);
361 if (cy) sum[un++] = cy;
368 if (cy2) prd[pn++] = cy2;
370 if (pn > outr) pn = outr;
379 ulong Lp = (
B + root - 1) / root;
391 if (Ycap < yneed) Ycap = yneed;
396 mp_ptr xb = work + na + 4;
424 unsigned sh = (unsigned)(129 - bl);
444 xb[0] = (e[0] >> 1) | (e[1] << 63);
445 xb[1] = (1ULL << 63) | (e[1] >> 1);
448 shx = (
slong)((
B - 1) / root) - 127;
455 if (e_eff >= (
slong)Lp)
break;
456 slong e2 = 2 * e_eff - lambda;
458 if (e2 >= (
slong)Lp) {
463 slong delta = e2 - e_eff;
474 if (cy) Db[dl++] = cy;
479 mp_size_t nd = dl < nq + 3 ? dl : nq + 3;
486 lmmp_div_(asmb, NULL, Nseg, Lseg, Db + dl - nd, nd);
502 - (
slong)root + (
slong)(root - 1) * delta + drop;
511 if (cy2) t2[tl++] = cy2;
524 unsigned bit = (unsigned)((-X) & 63);
528 if (cy3) Nseg[tl++] = cy3;
540 unsigned dbit = (unsigned)(delta & 63);
543 if (cy4) asmb[dloff + al++] = cy4;
546 if (cy5) asmb[dloff + al++] = cy5;
561 }
else if (al >= tl) {
583 if (np[
xn - 1] == 0) --
xn;
592 if (final_stage)
break;
602 unsigned bit = (unsigned)((-shx) & 63);
611 if (y[yn - 1] == 0) --yn;
647 for (
int iter = 0; iter < 4 && !settled; ++iter) {
656 if (shift < -1 || shift > 1)
break;
666 }
else if (shift < 0) {
678 while (sn > 0 && slk[sn - 1] == 0) --sn;
680 if (sn < 2 ||
lmmp_limb_bits_(slk[sn - 1]) + 64 * (
unsigned)(sn - 1) < hb + 70)
692 unsigned sbit = (unsigned)(
s & 63);
713 t2[loff + SPL + bpn] = mcy;
738 t2[loff + SPL + 2] = mcy;
745 unsigned b2 = (unsigned)(
c1 & 63);
775 int dec_cnt = 0, inc_cnt = 0;
805 if (yn < nr)
lmmp_zero(dsts + yn, nr - yn);
static mp_limb_t lmmp_shr64_(mp_srcptr p, mp_size_t n, uint64_t s)
#define lmmp_copy(dst, src, n)
#define lmmp_zero(dst, n)
#define lmmp_debug_assert(x)
const mp_limb_t * mp_srcptr
#define lmmp_param_assert(x)
mp_limb_t lmmp_div_1_(mp_ptr dstq, mp_srcptr numa, mp_size_t na, mp_limb_t x)
单精度数除法
static mp_limb_t lmmp_add_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
加法静态内联函数 [dst,na]=[numa,na]+[numb,nb]
#define lmmp_dec(p)
减1宏(预期无借位)
static mp_limb_t lmmp_add_1_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_limb_t x)
加单精度数静态内联函数 [dst,na]=[numa,na]+x
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
void lmmp_mul_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
不等长乘法操作 [dst,na+nb] = [numa,na] * [numb,nb]
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
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
static mp_limb_t lmmp_sub_1_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_limb_t x)
减单精度数静态内联函数 [dst,na]=[numa,na]-x
void lmmp_div_(mp_ptr dstq, mp_ptr dstr, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
除法和取模操作
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
static mp_size_t nthroot_inc_len_(mp_ptr y, mp_size_t yn)
[y,yn] += 1 并维护精确长度
static void nthroot_top_limbs_(mp_ptr dst, mp_size_t nlimbs, mp_srcptr numa, mp_size_t na, ulong bl)
提取 [numa,na] 的顶 nlimbs 个 limb(左补零语义)
static void nthroot_add_small_(mp_ptr p, mp_size_t n, mp_limb_t c0, mp_limb_t c1)
[p,n] += c0 + c1·B(探针证书的小常数增量)
static mp_size_t nthroot_pow_trunc_(mp_ptr dst, slong *drop, mp_size_t wlimbs, mp_srcptr base, mp_size_t bn, ulong exp, mp_ptr bufa, mp_ptr bufb)
计算窗口截断幂链 [dst] ≈ [base,bn]^exp / 2^(*drop)
static void nthroot_sub_small_(mp_ptr p, mp_size_t n, mp_limb_t c0, mp_limb_t c1)
[p,n] -= c0 + c1·B(探针证书的小常数量减)
static int nthroot_cmp_ext_(mp_srcptr a, mp_size_t an, mp_srcptr b, mp_size_t bn)
零扩展比较:把 [a,an] 与 [b,bn] 视作等长后比较
static void nthroot_chop_(mp_ptr v, mp_size_t *plen, slong *dr, mp_size_t wlimbs)
截断幂链的逐层截断+归一化(nthroot_pow_trunc_ 的层内步骤)
static mp_size_t nthroot_dec_len_(mp_ptr y, mp_size_t yn)
[y,yn] -= 1 并维护精确长度
mp_size_t lmmp_nthroot_size_(mp_size_t na, ulong root)
计算 lmmp_nthroot_ 所需的 tp 缓冲区长度(任意长度输入入口)
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
ulong lmmp_nthroot_ulong_(ulong n, ulong root)
计算 floor(n^(1/root))
void lmmp_nthroot_(mp_ptr dsts, mp_ptr dstr, mp_srcptr numa, mp_size_t na, ulong root, mp_ptr tp)
计算算术根 [dsts,nr] = floor([numa,na]^(1/root))(任意 na/任意顶 limb)
void lmmp_sqrt_(mp_ptr dsts, mp_ptr dstr, mp_srcptr numa, mp_size_t na, mp_size_t nf)
计算 [numa,na] * B^(2*nf) 的平方根和余数