31#define lmmp_mul_n_(dst, numa, numb, n) \
32 if ((n) < MUL_TOOM22_THRESHOLD) \
33 lmmp_mul_hard_n_((dst), (numa), (numb), (n)); \
34 else if ((n) < MUL_TOOM33_THRESHOLD) \
35 lmmp_mul_toom22_((dst), (numa), (n), (numb), (n)); \
37 lmmp_mul_toom33_((dst), (numa), (n), (numb), (n))
59 mp_size_t n = na >= 2 * nb ? (na + 3) >> 2 : (nb + 1) >> 1,
s = na - 3 *
n,
t = nb -
n;
68#define a2 (numa + 2 * n)
69#define a3 (numa + 3 * n)
74#define v1 (dst + 2 * n)
75#define vinf (dst + 4 * n)
77#define v2 (tp + 2 * n + 2)
82#define bp1 (tp + n + 1)
192#define numb (cache->numb)
196#define _bp1 (cache->_bp1)
197#define _bm1 (cache->_bm1)
198#define tp (cache->tp)
200 int vm1_neg, flag = 0;
205#define a2 (numa + 2 * n)
206#define a3 (numa + 3 * n)
211#define v1 (dst + 2 * n)
212#define vinf (dst + 4 * n)
214#define v2 (tp + 2 * n + 2)
221#define bp2 (tp + n + 1)
222#define a13 (tp + n + 1)
329#define numb (cache->numb)
333#define _bp1 (cache->_bp1)
334#define _bm1 (cache->_bm1)
335#define tp (cache->tp)
342#define a2 (numa + 2 * n)
343#define a3 (numa + 3 * n)
348#define v1 (dst + 2 * n)
349#define vinf (dst + 4 * n)
351#define v2 (tp + 2 * n + 2)
358#define bp2 (tp + n + 1)
359#define a13 (tp + n + 1)
435 cache.
n = (2 * nb + 3) >> 2;
436 cache.
s = 2 * nb - 3 * cache.
n;
437 cache.
t = nb - cache.
n;
447 while (2 * na >= 5 * nb) {
#define lmmp_copy(dst, src, n)
#define lmmp_zero(dst, n)
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]
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_toom42_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
Toom-42乘法运算 [dst,na+nb] = [numa,na] * [numb,nb]
void lmmp_mul_toom42_unbalance_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
Toom-42不平衡乘法运算 [dst,na+nb] = [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)
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_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])
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
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_toom42_cache_(mp_ptr restrict dst, mp_srcptr restrict numa, const toom42_cache_t *cache, int flag)
static int lmmp_mul_toom42_cache_init_(mp_ptr restrict dst, mp_srcptr restrict numa, toom42_cache_t *cache)
void lmmp_toom_interp5_(mp_ptr dst, mp_ptr v2, mp_ptr vm1, mp_size_t n, mp_size_t spt, int vm1_neg, mp_limb_t vinf0)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define restrict
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define SALLOC_TYPE(n, type)