LAMMP 4.2.0
Lamina High-Precision Arithmetic Library
载入中...
搜索中...
未找到
mul_toom53.c
浏览该文件的文档.
1/**
2 * Copyright (C) 2026 HJimmyK(Jericho Knox)
3 *
4 * This file is part of LAMMP.
5 *
6 * LAMMP is free software: you can redistribute it and/or modify it under
7 * the terms of the GNU Lesser General Public License (LGPL) as published
8 * by the Free Software Foundation; either version 3 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed WITHOUT ANY WARRANTY.
12 *
13 * See <https://www.gnu.org/licenses/>.
14 */
15
16#include "../../../include/lammp/impl/mparam.h"
17#include "../../../include/lammp/impl/toom_interp.h"
18
19
20#if MUL_TOOM44_THRESHOLD < MUL_FFT_THRESHOLD
21#define lmmp_mul_n_(dst, numa, numb, n) \
22 if ((n) < MUL_TOOM22_THRESHOLD) \
23 lmmp_mul_basecase_((dst), (numa), (n), (numb), (n)); \
24 else if ((n) < MUL_TOOM33_THRESHOLD) \
25 lmmp_mul_toom22_((dst), (numa), (n), (numb), (n)); \
26 else if ((n) < MUL_TOOM44_THRESHOLD) \
27 lmmp_mul_toom33_((dst), (numa), (n), (numb), (n)); \
28 else \
29 lmmp_mul_toom44_((dst), (numa), (n), (numb), (n))
30#endif
31
32/*
33Evaluate in: 0, +1, -1, +2, -2, 1/2, +inf
34
35 <-s-><--n--><--n--><--n--><--n-->
36 |a4-|--a3--|--a2--|--a1--|--a0--|
37 |--b2|--b1--|--b0--|
38 <-t--><--n--><--n-->
39
40 v0 = a0 * b0 # A(0)*B(0)
41 v1 = ( a0+ a1+ a2+ a3+ a4)*( b0+ b1+ b2) # A(1)*B(1) ah <= 4 bh <= 2
42 vm1 = ( a0- a1+ a2- a3+ a4)*( b0- b1+ b2) # A(-1)*B(-1) |ah| <= 2 bh <= 1
43 v2 = ( a0+2a1+4a2+8a3+16a4)*( b0+2b1+4b2) # A(2)*B(2) ah <= 30 bh <= 6
44 vm2 = ( a0-2a1+4a2-8a3+16a4)*( b0-2b1+4b2) # A(2)*B(2) -9<=ah<=20 -1<=bh<=4
45 vh = (16a0+8a1+4a2+2a3+ a4)*(4b0+2b1+ b2) # A(1/2)*B(1/2) ah <= 30 bh <= 6
46 vinf= a4 * b2 # A(inf)*B(inf)
47*/
48
50 lmmp_param_assert(9 * na <= 20 * nb);
51 lmmp_param_assert(5 * nb <= 3 * na);
52 mp_size_t n, s, t;
54 mp_ptr gp;
57 mp_ptr tmp;
58 enum toom7_flags flags;
60
61#define a0 numa
62#define a1 (numa + n)
63#define a2 (numa + 2 * n)
64#define a3 (numa + 3 * n)
65#define a4 (numa + 4 * n)
66#define b0 numb
67#define b1 (numb + n)
68#define b2 (numb + 2 * n)
69
70 n = 1 + (3 * na >= 5 * nb ? (na - 1) / (mp_size_t)5 : (nb - 1) / (mp_size_t)3);
72 s = na - 4 * n;
73 t = nb - 2 * n;
74
75 tmp = SALLOC_TYPE(10 * (n + 1), mp_limb_t);
76 as1 = tmp;
77 tmp += n + 1;
78 asm1 = tmp;
79 tmp += n + 1;
80 as2 = tmp;
81 tmp += n + 1;
82 asm2 = tmp;
83 tmp += n + 1;
84 ash = tmp;
85 tmp += n + 1;
86 bs1 = tmp;
87 tmp += n + 1;
88 bsm1 = tmp;
89 tmp += n + 1;
90 bs2 = tmp;
91 tmp += n + 1;
92 bsm2 = tmp;
93 tmp += n + 1;
94 bsh = tmp;
95 tmp += n + 1;
96
97 gp = dst;
98
99 /* Compute as1 and asm1. */
101
102 /* Compute as2 and asm2. */
104
105 /* Compute ash = 16 a0 + 8 a1 + 4 a2 + 2 a3 + a4
106 = 2*(2*(2*(2*a0 + a1) + a2) + a3) + a4 */
107 cy = lmmp_addshl1_n_(ash, a1, a0, n);
108 cy = 2 * cy + lmmp_addshl1_n_(ash, a2, ash, n);
109 cy = 2 * cy + lmmp_addshl1_n_(ash, a3, ash, n);
110 if (s < n) {
113 ash[n] = 2 * cy + lmmp_shl_(ash + s, ash + s, n - s, 1);
114 lmmp_inc_1(ash + s, cy2);
115 } else
116 ash[n] = 2 * cy + lmmp_addshl1_n_(ash, a4, ash, n);
117
118
119 /* Compute bs1 and bsm1. */
120 bs1[n] = lmmp_add_(bs1, b0, n, b2, t); /* b0 + b2 */
121 if (bs1[n] == 0 && lmmp_cmp_(bs1, b1, n) < 0) {
122 bs1[n] = lmmp_add_n_sub_n_(bs1, bsm1, b1, bs1, n) >> 1;
123 bsm1[n] = 0;
125 } else {
127 bsm1[n] = bs1[n] - (cy & 1);
128 bs1[n] += (cy >> 1);
129 }
130
131 /* Compute bs2 and bsm2. */
132
133 cy = lmmp_shl_(gp, b2, t, 2);
134 bs2[n] = lmmp_add_(bs2, b0, n, gp, t);
135 lmmp_inc_1(bs2 + t, cy);
136
137 gp[n] = lmmp_shl_(gp, b1, n, 1);
138
139 if (lmmp_cmp_(bs2, gp, n + 1) < 0) {
140 lmmp_add_n_sub_n_(bs2, bsm2, gp, bs2, n + 1);
142 } else {
143 lmmp_add_n_sub_n_(bs2, bsm2, bs2, gp, n + 1);
144 }
145
146 /* Compute bsh = 4 b0 + 2 b1 + b2 = 2*(2*b0 + b1)+b2. */
147
148 cy = lmmp_addshl1_n_(bsh, b1, b0, n);
149 if (t < n) {
152 bsh[n] = 2 * cy + lmmp_shl_(bsh + t, bsh + t, n - t, 1);
153 lmmp_inc_1(bsh + t, cy2);
154 } else
155 bsh[n] = 2 * cy + lmmp_addshl1_n_(bsh, b2, bsh, n);
156
157 lmmp_debug_assert(as1[n] <= 4);
158 lmmp_debug_assert(bs1[n] <= 2);
159 lmmp_debug_assert(asm1[n] <= 2);
160 lmmp_debug_assert(bsm1[n] <= 1);
161 lmmp_debug_assert(as2[n] <= 30);
162 lmmp_debug_assert(bs2[n] <= 6);
163 lmmp_debug_assert(asm2[n] <= 20);
164 lmmp_debug_assert(bsm2[n] <= 4);
165 lmmp_debug_assert(ash[n] <= 30);
166 lmmp_debug_assert(bsh[n] <= 6);
167
168#define v0 dst /* 2n */
169#define v1 (dst + 2 * n) /* 2n+1 */
170#define vinf (dst + 6 * n) /* s+t */
171#define v2 scratch /* 2n+1 */
172#define vm2 (scratch + 2 * n + 1) /* 2n+1 */
173#define vh (scratch + 4 * n + 2) /* 2n+1 */
174#define vm1 (scratch + 6 * n + 3) /* 2n+1 */
175#define scratch_out (scratch + 8 * n + 4) /* 2n+1 */
176 /* Total scratch need: 10*n+5 */
177
178 /* Must be in allocation order, as they overwrite one limb beyond
179 * 2n+1. */
180 lmmp_mul_n_(v2, as2, bs2, n + 1); /* v2, 2n+1 limbs */
181 lmmp_mul_n_(vm2, asm2, bsm2, n + 1); /* vm2, 2n+1 limbs */
182 lmmp_mul_n_(vh, ash, bsh, n + 1); /* vh, 2n+1 limbs */
183
184 /* vm1, 2n+1 limbs */
185 vm1[2 * n] = 0;
186 lmmp_mul_n_(vm1, asm1, bsm1, n + ((asm1[n] | bsm1[n]) != 0));
187
188
189 /* v1, 2n+1 limbs */
190 v1[2 * n] = 0;
191 lmmp_mul_n_(v1, as1, bs1, n + ((as1[n] | bs1[n]) != 0));
192
193
194 lmmp_mul_n_(v0, a0, b0, n); /* v0, 2n limbs */
195
196 /* vinf, s+t limbs */
197 if (s > t)
198 lmmp_mul_(vinf, a4, s, b2, t);
199 else
200 lmmp_mul_(vinf, b2, t, a4, s);
201
203
205}
mp_limb_t * mp_ptr
Definition lmmp.h:80
uint64_t mp_size_t
Definition lmmp.h:77
#define lmmp_debug_assert(x)
Definition lmmp.h:390
const mp_limb_t * mp_srcptr
Definition lmmp.h:81
uint64_t mp_limb_t
Definition lmmp.h:76
#define lmmp_param_assert(x)
Definition lmmp.h:401
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]
Definition lmmpn.h:1050
static int lmmp_cmp_(mp_srcptr numa, mp_srcptr numb, mp_size_t n)
大数比较函数(内联)
Definition lmmpn.h:996
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)
Definition shl.c:66
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
Definition shl.c:19
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])
Definition add_n_sub_n.c:20
#define lmmp_inc_1(p, inc)
大数加指定值宏(预期无进位)
Definition lmmpn.h:950
#define bsm1
#define asm1
#define t
#define numb
#define s
#define n
#define bs1
#define bs2
#define as2
#define asm2
#define bsm2
#define as1
void lmmp_mul_toom53_(mp_ptr restrict dst, mp_srcptr restrict numa, mp_size_t na, mp_srcptr restrict numb, mp_size_t nb)
Definition mul_toom53.c:49
#define b0
#define v0
#define a4
#define a3
#define lmmp_mul_n_(dst, numa, numb, n)
Copyright (C) 2026 HJimmyK(Jericho Knox)
Definition mul_toom53.c:21
#define b1
#define v2
#define vm1
#define scratch_out
#define vh
#define a2
#define a0
#define a1
#define b2
#define vinf
#define v1
#define vm2
#define scratch
#define tmp
#define bsh
#define SALLOC_TYPE(n, type)
Definition tmp_alloc.h:144
#define TEMP_S_DECL
Definition tmp_alloc.h:133
#define TEMP_S_FREE
Definition tmp_alloc.h:166
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 处求值
toom7_flags
Definition toom_interp.h:24
@ toom7_w1_neg
Definition toom_interp.h:24
@ toom7_w3_neg
Definition toom_interp.h:24
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)
Toom插值计算(7点插值):用于Toom-44、Toom-53、Toom-62 乘法算法
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 处求值