30#define lmmp_mul_n_(dst, numa, numb, n) \
31 if ((n) < MUL_TOOM22_THRESHOLD) \
32 lmmp_mul_hard_n_((dst), (numa), (numb), (n)); \
33 else if ((n) < MUL_TOOM33_THRESHOLD) \
34 lmmp_mul_toom22_((dst), (numa), (n), (numb), (n)); \
35 else if ((n) < MUL_TOOM44_THRESHOLD) \
36 lmmp_mul_toom33_((dst), (numa), (n), (numb), (n)); \
38 lmmp_mul_toom44_((dst), (numa), (n), (numb), (n))
72#define a2 (numa + 2 * n)
73#define a3 (numa + 3 * n)
74#define a4 (numa + 4 * n)
75#define a5 (numa + 5 * n)
79 n = 1 + (na >= 3 * nb ? (na - 1) / (
mp_size_t)6 : (nb - 1) >> 1);
187#define v1 (dst + 2 * n)
188#define vinf (dst + 6 * n)
190#define vm2 (scratch + 2 * n + 1)
191#define vh (scratch + 4 * n + 2)
192#define vm1 (scratch + 6 * n + 3)
193#define scratch_out (scratch + 8 * n + 4)
207 }
else if (
asm1[
n] == 2) {
216 }
else if (
as1[
n] == 2) {
218 }
else if (
as1[
n] != 0) {
258#define numb (cache->numb)
262#define scratch (cache->scratch)
263#define tmp (cache->tmp)
264#define bs1 (cache->bs1)
265#define bsm1 (cache->bsm1)
266#define bs2 (cache->bs2)
267#define bsm2 (cache->bsm2)
268#define bsh (cache->bsh)
276#define a2 (numa + 2 * n)
277#define a3 (numa + 3 * n)
278#define a4 (numa + 4 * n)
279#define a5 (numa + 5 * n)
375#define v1 (dst + 2 * n)
376#define vinf (dst + 6 * n)
378#define vm2 (scratch + 2 * n + 1)
379#define vh (scratch + 4 * n + 2)
380#define vm1 (scratch + 6 * n + 3)
381#define scratch_out (scratch + 8 * n + 4)
395 }
else if (
asm1[
n] == 2) {
404 }
else if (
as1[
n] == 2) {
406 }
else if (
as1[
n] != 0) {
444#define numb (cache->numb)
448#define scratch (cache->scratch)
449#define tmp (cache->tmp)
450#define bs1 (cache->bs1)
451#define bsm1 (cache->bsm1)
452#define bs2 (cache->bs2)
453#define bsm2 (cache->bsm2)
454#define bsh (cache->bsh)
462#define a2 (numa + 2 * n)
463#define a3 (numa + 3 * n)
464#define a4 (numa + 4 * n)
465#define a5 (numa + 5 * n)
504#define v1 (dst + 2 * n)
505#define vinf (dst + 6 * n)
507#define vm2 (scratch + 2 * n + 1)
508#define vh (scratch + 4 * n + 2)
509#define vm1 (scratch + 6 * n + 3)
510#define scratch_out (scratch + 8 * n + 4)
524 }
else if (
asm1[
n] == 2) {
533 }
else if (
as1[
n] == 2) {
535 }
else if (
as1[
n] != 0) {
580 cache.
s = 3 * nb - 5 * cache.
n;
581 cache.
t = nb - cache.
n;
584 cache.
bs1 = cache.
tmp + 5 * cache.
n + 5;
585 cache.
bsm1 = cache.
bs1 + cache.
n + 1;
587 cache.
bsm2 = cache.
bs2 + cache.
n + 1;
588 cache.
bsh = cache.
bsm2 + cache.
n + 1;
595 while (na >= 5 * nb) {
#define lmmp_copy(dst, src, n)
#define lmmp_zero(dst, n)
#define lmmp_debug_assert(x)
const mp_limb_t * mp_srcptr
#define LMMP_VECT_CONSERVATIVE
#define lmmp_param_assert(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_inc(p)
加1宏(预期无进位)
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)
void lmmp_mul_toom62_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
Toom-62乘法运算 [dst,na+nb] = [numa,na] * [numb,nb]
int lmmp_cmp_(mp_srcptr numa, mp_srcptr numb, mp_size_t n)
比较函数
int lmmp_zero_q_(mp_srcptr p, mp_size_t n)
判零函数
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_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_add_n_sub_n_(mp_ptr dsta, mp_ptr dstb, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
同时执行n位加法和减法 ([dsta,n],[dstb,n]) = ([numa,n]+[numb,n],[numa,n]-[numb,n])
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]
void lmmp_mul_toom62_unbalance_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
Toom-62不平衡乘法运算 [dst,na+nb] = [numa,na] * [numb,nb]
#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]
static void lmmp_mul_toom62_cache_(mp_ptr restrict dst, mp_srcptr restrict numa, const toom62_cache_t *cache, enum toom7_flags bflags)
static enum toom7_flags lmmp_mul_toom62_cache_init_(mp_ptr restrict dst, mp_srcptr restrict numa, toom62_cache_t *cache)
int lmmp_toom_eval_pm2_(mp_ptr xp2, mp_ptr xm2, unsigned k, mp_srcptr xp, mp_size_t n, mp_size_t hn, mp_ptr tp)
通用高阶 Toom 求值:k次多项式在 x = +2 和 x = -2 处求值
int lmmp_toom_eval_pm1_(mp_ptr xp1, mp_ptr xm1, unsigned k, mp_srcptr xp, mp_size_t n, mp_size_t hn, mp_ptr tp)
通用高阶 Toom 求值:k次多项式在 x = +1 和 x = -1 处求值
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)
#define BALLOC_TYPE(n, type)