55 {
61 int vm1_neg;
66
67#define a0 numa
68#define a1 (numa + n)
69#define a2 (numa + 2 * n)
70#define b0 numb
71#define b1 (numb + n)
72#define b2 (numb + 2 * n)
73
74#define v0 dst
75#define v1 (dst + 2 * n)
76#define vinf (dst + 4 * n)
77#define vm1 tp
78#define v2 (tp + 2 * n + 2)
79
80#define bm1 dst
81#define am1 (dst + n)
82#define ap1 tp
83#define bp1 (tp + n + 1)
84#define ap2 ap1
85#define bp2 bp1
86
87
92 am1h = 0;
93 vm1_neg = 1;
94 } else {
96 ap1[
n] = cy + (cy2 >> 1);
97 am1h = cy - (cy2 & 1);
98 vm1_neg = 0;
99 }
100
101
106 bm1h = 0;
107 vm1_neg ^= 1;
108 } else {
110 bp1[
n] = cy + (cy2 >> 1);
111 bm1h = cy - (cy2 & 1);
112 }
113
114
117 else
121
122
125
126
132
133
139
140
142
143
145 cy = 0;
146 if (am1h)
148 if (bm1h)
151
152
154
157}
#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_(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)
比较函数
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_add_n_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
无进位的n位加法 [dst,n] = [numa,n] + [numb,n]
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)