LMMP 4.3.0
Lamina High-Precision Arithmetic Library
载入中...
搜索中...
未找到
mul_hard.h
浏览该文件的文档.
1/**
2 * Copyright (C) 2026 HJimmyK (Jericho Knox)
3 *
4 * This file is part of LMMP.
5 *
6 * LMMP is free software: you can redistribute it and/or modify it
7 * under the terms of the GNU Lesser General Public License as
8 * published by the Free Software Foundation; either version 3 of
9 * the License, or (at your option) any later version.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library. If not, see
18 * <https://www.gnu.org/licenses/>.
19 *
20 * SPDX-License-Identifier: LGPL-3.0-or-later
21 */
22
23#ifndef __LMMP_IMPL_MUL_HARD_H__
24#define __LMMP_IMPL_MUL_HARD_H__
25
26#include "lmmp/lmmpn.h"
27
28
29#define LMMP_MUL_HARD_MAX_N 19
30
31#define LMMP_DECL_MUL_HARD(n) \
32 void lmmp_mul_hard_##n##_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb);
33#define LMMP_DECL_SQR_HARD(n) void lmmp_sqr_hard_##n##_(mp_ptr dst, mp_srcptr numa);
34
54
74
75/**
76 * @brief 硬编码平衡乘法跳转表, [i] 即 lmmp_mul_hard_i_, 下标 0 为 NULL
77 * @note 调用点原地取函数指针直接调用(单次 call 进入目标), 省去经分派函数
78 * 中转的又一次 call; 按短乘数长度固化调用的场景(如不平衡乘法分块
79 * 累加)可将指针外提出循环; 下标必须满足 0 < i <= LMMP_MUL_HARD_MAX_N
80 */
81extern void (*const lmmp_mul_hard_fns_[LMMP_MUL_HARD_MAX_N + 1])(mp_ptr dst, mp_srcptr numa, mp_srcptr numb);
82
83/**
84 * @brief 硬编码平衡平方跳转表, [i] 即 lmmp_sqr_hard_i_, 下标 0 为 NULL
85 * @note 同 lmmp_mul_hard_fns_; 下标必须满足 0 < i <= LMMP_MUL_HARD_MAX_N
86 */
87extern void (*const lmmp_sqr_hard_fns_[LMMP_MUL_HARD_MAX_N + 1])(mp_ptr dst, mp_srcptr numa);
88
89/**
90 * @brief 硬编码平衡乘法分派 [dst,2n] = [numa,n] * [numb,n]
91 * @param dst 结果输出指针
92 * @param numa 第一个乘数
93 * @param numb 第二个乘数
94 * @param n 操作数 limb 长度
95 * @warning 0 < n, sep(dst,[numa|numb]), dst!=NULL, numa!=NULL, numb!=NULL;
96 * n <= LMMP_MUL_HARD_MAX_N 时查表直调硬编码函数, 其余回落 mul_basecase
97 * @return 无
98 */
99static inline void __lmmp_mul_hard_n_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n) {
100 if (n <= LMMP_MUL_HARD_MAX_N)
101 lmmp_mul_hard_fns_[n](dst, numa, numb);
102 else
103 lmmp_mul_basecase_(dst, numa, n, numb, n);
104}
105
106/**
107 * @brief 硬编码平衡平方分派 [dst,2n] = [numa,n]^2
108 * @param dst 结果输出指针
109 * @param numa 输入操作数
110 * @param n 操作数 limb 长度
111 * @warning 0 < n, sep(dst,numa), dst!=NULL, numa!=NULL;
112 * n <= LMMP_MUL_HARD_MAX_N 时查表直调硬编码函数, 其余回落 sqr_basecase
113 * @return 无
114 */
115static inline void __lmmp_sqr_hard_n_(mp_ptr dst, mp_srcptr numa, mp_size_t n) {
116 if (n <= LMMP_MUL_HARD_MAX_N)
117 lmmp_sqr_hard_fns_[n](dst, numa);
118 else
119 lmmp_sqr_basecase_(dst, numa, n);
120}
121
122#define lmmp_mul_hard_n_ __lmmp_mul_hard_n_
123#define lmmp_sqr_hard_n_ __lmmp_sqr_hard_n_
124
125#endif /* __LMMP_IMPL_MUL_HARD_H__ */
mp_limb_t * mp_ptr
定义 lmmp.h:96
uint64_t mp_size_t
定义 lmmp.h:93
const mp_limb_t * mp_srcptr
定义 lmmp.h:97
void lmmp_sqr_basecase_(mp_ptr dst, mp_srcptr numa, mp_size_t na)
基础平方运算 [dst,2*na] = [numa,na]^2
void lmmp_mul_basecase_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
基础乘法运算 [dst,na+nb] = [numa,na] * [numb,nb]
#define LMMP_MUL_HARD_MAX_N
Copyright (C) 2026 HJimmyK (Jericho Knox)
void(*const lmmp_sqr_hard_fns_[19+1])(mp_ptr dst, mp_srcptr numa)
硬编码平衡平方跳转表, [i] 即 lmmp_sqr_hard_i_, 下标 0 为 NULL
static void __lmmp_mul_hard_n_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
硬编码平衡乘法分派 [dst,2n] = [numa,n] * [numb,n]
#define LMMP_DECL_SQR_HARD(n)
#define LMMP_DECL_MUL_HARD(n)
void(*const lmmp_mul_hard_fns_[19+1])(mp_ptr dst, mp_srcptr numa, mp_srcptr numb)
硬编码平衡乘法跳转表, [i] 即 lmmp_mul_hard_i_, 下标 0 为 NULL
static void __lmmp_sqr_hard_n_(mp_ptr dst, mp_srcptr numa, mp_size_t n)
硬编码平衡平方分派 [dst,2n] = [numa,n]^2
#define numb
#define n