58 {
64
65#define a0 numa
66#define a1 (numa + n)
67#define a2 (numa + 2 * n)
68#define a3 (numa + 3 * n)
69#define b0 numb
70#define b1 (numb + n)
71#define b2 (numb + 2 * n)
72#define b3 (numb + 3 * n)
73
77
80
84
85
86
87
88#define v0 dst
89#define v1 (dst + 2 * n)
90#define vinf (dst + 6 * n)
91#define v2 scratch
92#define vm2 (scratch + 2 * n + 1)
93#define vh (scratch + 4 * n + 2)
94#define vm1 (scratch + 6 * n + 3)
95#define tp (scratch + 8 * n + 5)
96
97
98#define apx dst
99#define amx (dst + n + 1)
100#define bmx (dst + 2 * n + 2)
101#define bpx (dst + 4 * n + 2)
102
103
104
105
106
108
109
111
114
115
116
124 } else
126
127
128
136 } else
138
141
143
144
146
147
149
151
153
157 else
159
161
163}
#define lmmp_debug_assert(x)
#define lmmp_param_assert(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]
mp_limb_t lmmp_addshl1_n_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
加法结合左移1位操作 [dst,n] = [numa,n] + ([numb,n] << 1)
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
#define lmmp_inc_1(p, inc)
加指定值宏(预期无进位)
LMMP_VECT_CONSERVATIVE int lmmp_toom_eval_dgr3_pm1_(mp_ptr xp1, mp_ptr xm1, mp_srcptr xp, mp_size_t n, mp_size_t x3n, mp_ptr tp)
Copyright (C) 2026 HJimmyK (Jericho Knox)
int lmmp_toom_eval_dgr3_pm2_(mp_ptr xp2, mp_ptr xm2, mp_srcptr xp, mp_size_t n, mp_size_t x3n, mp_ptr tp)
Toom-3 专用:3次多项式在 x = +2 和 x = -2 处求值 计算 P(+2) 和 P(-2),其中 P(x) 是一个3次多项式(4段系数)。
void lmmp_toom_interp7_(mp_ptr dst, mp_size_t n, enum toom7_flags flags, mp_ptr w1, mp_ptr w3, mp_ptr w4, mp_ptr w5, mp_size_t w6n, mp_ptr tp)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define restrict
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define SALLOC_TYPE(n, type)