90 return xn < yn ? -1 : 1;
108 if (am == 0 ||
xn == 0) {
111 if (bm != 0 && yn != 0) {
118 dst->
neg = tn != 0 && be < 0;
121 if (bm == 0 || yn == 0) {
131 if ((al < 0) == (be < 0)) {
151 while (tn > 0 && dst->
p[tn - 1] == 0)
154 dst->
neg = (al < 0) && tn != 0;
168 for (
int dir = 0;; ++dir) {
178 while (tn > 0 && dst->
p[tn - 1] == 0)
181 dst->
neg = (al < 0) && tn != 0;
197 for (
int i = 0; i < 4; ++i) {
198 if (i != ia && i != ib) {
213 lmmp_param_assert(up != NULL && vp != NULL && dstg != NULL && dsts != NULL && sn != NULL);
222 }
else if (un == vn) {
245 mp_ptr rowp = pool + 4 * RSZ;
246 mp_ptr t1 = rowp + 4 * RSZ;
249 mp_ptr qt = t2f + (2 * un + 8);
250 mp_ptr rt = qt + (un + 2);
251 mp_ptr tg = rt + (un + 2);
255 sco_t u0 = {rowp, 0, 0}, u1 = {rowp + RSZ, 0, 0};
256 sco_t k0 = {rowp + 2 * RSZ, 0, 0}, k1 = {rowp + 3 * RSZ, 0, 0};
291 int sn1 = (u1.neg != 0) ^ (det < 0);
296 }
else if (cmp2 > 0) {
300 while (sun > 0 && sp[sun - 1] == 0)
302 suneg = sun != 0 && !sn1;
322 int p1neg = 0, p2neg = 0;
323 if (sigma != 0 && u1.n != 0) {
329 p1neg = (sigma < 0) ^ (u1.neg != 0);
331 if (tqn != 0 && u0.
n != 0) {
337 while (p2n > 0 && t2f[p2n - 1] == 0)
339 p2neg = (tgn < 0) ^ (u0.
neg != 0);
344 if (det < 0 && sun != 0)
359 while (rn > 0 && a[rn - 1] == 0)
361 if (qn == 1 && qt[0] < (1ull << 63)) {
363 int d0 = u0.
neg ? -1 : 1, d1 = u1.neg ? -1 : 1;
364 lc1_(&k0, (
slong)qt[0] * d0, u0.
p, u0.
n, d1, u1.p, u1.n);
367 if (qn != 0 && u0.
n != 0) {
373 while (pn > 0 && t2f[pn - 1] == 0)
402 sco_t sa = {pool + f1 * RSZ, 0, 0}, sb = {pool + f2 * RSZ, 0, 0};
406 int da = sa.
neg ? -1 : 1, db = sb.neg ? -1 : 1;
410 int d0 = u0.
neg ? -1 : 1, d1 = u1.neg ? -1 : 1;
411 lc1_(&k0, sda * M.
m12 * d0, u0.
p, u0.
n, -sda * M.
m11 * d1, u1.p, u1.n);
412 lc1_(&k1, -sdb * M.
m22 * d0, u0.
p, u0.
n, sdb * M.
m21 * d1, u1.p, u1.n);
413 det = (int)(det * da * db * dlin);
436 }
else if (sb.n == 0) {
443 }
else if (
mag_cmp_(sa.
p, sa.
n, sb.p, sb.n) < 0) {
466 lmmp_gcdext_emit_(dstg, dsts, sn, dstt, tn, gp, gn, sp, sun, suneg, sw, up, un, vp, vn, t2f, rt,
static void lmmp_gcd_lehmer_step_(slong u, slong v, lmmp_gcd_lehmer_t *M)
static void lmmp_gcd_lehmer_extract_(mp_srcptr up, mp_size_t un, mp_srcptr vp, mp_size_t vn, slong *restrict a, slong *restrict b)
static void lmmp_gcdext_smag_(mp_ptr dst, mp_size_t *n, int *neg, mp_srcptr x, mp_size_t xn, int xneg, mp_srcptr y, mp_size_t yn, int yneg)
void lmmp_gcdext_emit_(mp_ptr dstg, mp_ptr dsts, mp_ssize_t *sn, mp_ptr dstt, mp_ssize_t *tn, mp_srcptr gp, mp_size_t gn, mp_srcptr sp, mp_size_t sun, int suneg, int sw, mp_srcptr up, mp_size_t un, mp_srcptr vp, mp_size_t vn, mp_ptr nb, mp_ptr yt, mp_ptr qt)
发射:g 与 S(值序大者系数)按 sw 映射到 (dsts,dstt),另一系数经恒等式导出
static void pool_free2_(int ia, int ib, int *f1, int *f2)
static int mag_cmp_(mp_srcptr x, mp_size_t xn, mp_srcptr y, mp_size_t yn)
static void lc1_(sco_t *dst, slong al, mp_srcptr x, mp_size_t xn, slong be, mp_srcptr y, mp_size_t yn)
dst = al*x + be*y(x,y 为非负幅度;al,be 为带符号标量,|al|,|be| < 2^63)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define LMMP_SWAP(x, y, type)
交换两个变量的值
#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)
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
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]
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_addmul_1_(mp_ptr numa, mp_srcptr numb, mp_size_t n, mp_limb_t b)
乘以单limb并累加操作 [numa,n] += [numb,n] * b
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)
除法和取模操作
mp_limb_t lmmp_submul_1_(mp_ptr numa, mp_srcptr numb, mp_size_t n, mp_limb_t b)
乘以单limb并累减操作 [numa,n] -= [numb,n] * b
mp_size_t lmmp_gcdext_1_(mp_ptr dstg, mp_ptr dsts, mp_ssize_t *sn, mp_ptr dstt, mp_ssize_t *tn, mp_srcptr up, mp_size_t un, ulong v)
扩展欧几里得(任意长度对单 limb):g = gcd([up,un],v),s*u + t*v = g
mp_size_t lmmp_gcdext_lehmer_(mp_ptr dstg, mp_ptr dsts, mp_ssize_t *sn, mp_ptr dstt, mp_ssize_t *tn, mp_srcptr up, mp_size_t un, mp_srcptr vp, mp_size_t vn)
扩展欧几里得(Lehmer 算法):g = gcd(u,v),s*u + t*v = g
#define BALLOC_TYPE(n, type)