LMMP 4.3.0
Lamina High-Precision Arithmetic Library
载入中...
搜索中...
未找到
shl.c 文件参考
#include "lmmp/lmmpn.h"
shl.c 的引用(Include)关系图:

浏览该文件的源代码.

宏定义

#define LMMP_ADDSHL1_STEP(k)
#define LMMP_SUBSHL1_STEP(k)

函数

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)
mp_limb_t lmmp_shl_ (mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_size_t shl)
 Copyright (C) 2026 HJimmyK (Jericho Knox)
mp_limb_t lmmp_shl_c_ (mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_size_t shl, mp_limb_t c)
 带进位的左移操作 [dst,na] = [numa,na]<<shl,dst的低shl位填充c的低shl位
mp_limb_t lmmp_subshl1_n_ (mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
 减法结合左移1位操作 [dst,n] = [numa,n] - ([numb,n] << 1)

宏定义说明

◆ LMMP_ADDSHL1_STEP

#define LMMP_ADDSHL1_STEP ( k)
值:
{ \
mp_limb_t v = numb[i + (k)]; \
mp_limb_t lo = (v << 1) | mb; \
mb = v >> (LIMB_BITS - 1); \
__uint128_t s = (__uint128_t)lo + numa[i + (k)] + c; \
dst[i + (k)] = (mp_limb_t)s; \
c = (mp_limb_t)(s >> 64); \
}
#define k
uint64_t mp_limb_t
定义 lmmp.h:92
#define LIMB_BITS
定义 lmmp.h:102
#define numb
#define s
#define lo

被这些函数引用 lmmp_addshl1_n_().

◆ LMMP_SUBSHL1_STEP

#define LMMP_SUBSHL1_STEP ( k)
值:
{ \
mp_limb_t v = numb[i + (k)]; \
mp_limb_t lo = (v << 1) | mb; \
mb = v >> (LIMB_BITS - 1); \
mp_limb_t o = numa[i + (k)]; \
mp_limb_t u = o - lo; \
mp_limb_t r = u - d; \
d = (u > o) + (r > u); \
dst[i + (k)] = r; \
}

被这些函数引用 lmmp_subshl1_n_().

函数说明

◆ lmmp_addshl1_n_()

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)

参数
dst结果输出指针
numa被加数指针
numb加数指针(先左移1位)
nlimb长度
警告
n>0, eqsep(dst,[numa|numb]), dst!=NULL, numa!=NULL
返回
运算后的进位值 [0|1|2]

在文件 shl.c 第 53 行定义.

53 {
54 mp_limb_t c = 0, mb = 0;
55 mp_size_t i = 0;
56
57#define LMMP_ADDSHL1_STEP(k) \
58 { \
59 mp_limb_t v = numb[i + (k)]; \
60 mp_limb_t lo = (v << 1) | mb; \
61 mb = v >> (LIMB_BITS - 1); \
62 __uint128_t s = (__uint128_t)lo + numa[i + (k)] + c; \
63 dst[i + (k)] = (mp_limb_t)s; \
64 c = (mp_limb_t)(s >> 64); \
65 }
66
67 for (; i + 4 <= n; i += 4) {
72 }
73 for (; i < n; i++) {
75 }
76#undef LMMP_ADDSHL1_STEP
77 return c + mb;
78}
uint64_t mp_size_t
定义 lmmp.h:93
#define n
#define LMMP_ADDSHL1_STEP(k)

引用了 lmmp_addshl1_n_(), LMMP_ADDSHL1_STEP, n , 以及 numb.

被这些函数引用 bench_addshl1_n(), lmmp_addshl1_n_(), lmmp_fibonacci_(), lmmp_mul_toom33_(), lmmp_mul_toom42_(), lmmp_mul_toom42_cache_(), lmmp_mul_toom42_cache_init_(), lmmp_mul_toom44_(), lmmp_mul_toom53_(), lmmp_mul_toom62_(), lmmp_mul_toom62_cache_(), lmmp_mul_toom62_cache_init_(), lmmp_shlnot_(), lmmp_sqr_toom3_(), lmmp_sqr_toom4_(), lmmp_sqrlo_dc_(), lmmp_sqrt_divide_(), TEST_CASE(), TEST_CASE(), TEST_CASE() , 以及 TEST_CASE().

函数调用图:
这是这个函数的调用关系图:

◆ lmmp_shl_()

mp_limb_t lmmp_shl_ ( mp_ptr dst,
mp_srcptr numa,
mp_size_t na,
mp_size_t shl )

Copyright (C) 2026 HJimmyK (Jericho Knox)

左移操作 [dst,na] = [numa,na]<<shl,dst的低shl位填充0

This file is part of LMMP.

LMMP is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.

This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License along with this library. If not, see https://www.gnu.org/licenses/.

SPDX-License-Identifier: LGPL-3.0-or-later

Copyright (C) 2026 HJimmyK (Jericho Knox)

参数
dst结果输出指针
numa源操作数指针
nalimb长度
shl左移的位数 (0~63)
警告
na>0, 0<=shl<64, eqsep(dst,numa), dst!=NULL, numa!=NULL
返回
其最低shl个比特位填充[numa,na]被移出的shl个最高位,其余比特位为0

在文件 shl.c 第 26 行定义.

26 {
27 if (shl == 0) {
28 lmmp_copy(dst, numa, na);
29 return 0;
30 }
31 const mp_size_t rshr = LIMB_BITS - shl;
32 mp_limb_t retval = numa[na - 1] >> rshr;
33 // 降序:dst==numa 原地时每个 numa[i-1] 在被覆盖前读取
34 for (mp_size_t i = na - 1; i > 0; i--) dst[i] = (numa[i] << shl) | (numa[i - 1] >> rshr);
35 dst[0] = numa[0] << shl;
36 return retval;
37}
#define lmmp_copy(dst, src, n)
定义 lmmp.h:474

引用了 LIMB_BITS, lmmp_copy , 以及 lmmp_shl_().

被这些函数引用 bench_shl(), dec_pow_extend_(), dec_pow_init_(), fib2_core_(), is_square_2(), lmmp_10pow_1_(), lmmp_12pow_1_(), lmmp_14pow_1_(), lmmp_2factorial_(), lmmp_6pow_1_(), lmmp_arith_seqprod_(), lmmp_bninv_(), lmmp_bninv_appr_newton_(), lmmp_cbrt_shapply_(), lmmp_div_(), lmmp_factorial_(), lmmp_fft_shl_coef_(), lmmp_fibonacci_(), lmmp_hyperfac_(), lmmp_inv_(), lmmp_mul_fermat_recombine_(), lmmp_mul_mersenne_cache_(), lmmp_mul_mersenne_cache_init_(), lmmp_mul_mersenne_fft_(), lmmp_mul_toom43_(), lmmp_mul_toom44_(), lmmp_mul_toom53_(), lmmp_mul_toom62_(), lmmp_mul_toom62_cache_(), lmmp_mul_toom62_cache_init_(), lmmp_mullh_(), lmmp_multinomial_(), lmmp_nCr_(), lmmp_nPr_(), lmmp_nthroot_(), lmmp_pow_1_(), lmmp_shl_(), lmmp_sqr_mersenne_fft_(), lmmp_sqr_toom4_(), lmmp_sqrt_(), lmmp_sqrt_newton_(), lmmp_superfac_(), lmmp_to_str_(), lmmp_to_str_divide_(), lmmp_toom_eval_dgr3_pm2_(), lmmp_toom_eval_pm2_(), lmmp_toom_eval_pm2exp_(), lmmp_toom_eval_pm2rexp_(), lmmp_toom_interp5_(), lmmp_toom_interp6_(), lmmp_toom_interp7_(), nthroot_chop_(), nthroot_top_limbs_(), pow_nPr_(), TEST_CASE(), TEST_CASE(), TEST_CASE(), TEST_CASE(), TEST_CASE(), TEST_CASE() , 以及 TEST_CASE().

函数调用图:
这是这个函数的调用关系图:

◆ lmmp_shl_c_()

mp_limb_t lmmp_shl_c_ ( mp_ptr dst,
mp_srcptr numa,
mp_size_t na,
mp_size_t shl,
mp_limb_t c )

带进位的左移操作 [dst,na] = [numa,na]<<shl,dst的低shl位填充c的低shl位

参数
dst结果输出指针
numa源操作数指针
nalimb长度
shl左移的位数 (0~63)
c进位值(其高(64-shl)位必须为0)
警告
na>0, 0<=shl<64, eqsep(dst,numa), dst!=NULL, numa!=NULL c的高(64-shl)位必须为0
返回
其最低shl个比特位填充[numa,na]被移出的shl个最高位,其余比特位为0

在文件 shl.c 第 39 行定义.

39 {
40 if (shl == 0) {
41 lmmp_copy(dst, numa, na);
42 return 0;
43 }
44 const mp_size_t rshr = LIMB_BITS - shl;
45 mp_limb_t retval = numa[na - 1] >> rshr;
46 c &= ((mp_limb_t)1 << shl) - 1;
47 // 同 lmmp_shl_:降序写入保证原地正确
48 for (mp_size_t i = na - 1; i > 0; i--) dst[i] = (numa[i] << shl) | (numa[i - 1] >> rshr);
49 dst[0] = (numa[0] << shl) | c;
50 return retval;
51}

引用了 LIMB_BITS, lmmp_copy , 以及 lmmp_shl_c_().

被这些函数引用 lmmp_mullh_(), lmmp_shl_c_(), lmmp_sqrt_divide_(), TEST_CASE() , 以及 TEST_CASE().

函数调用图:
这是这个函数的调用关系图:

◆ lmmp_subshl1_n_()

mp_limb_t lmmp_subshl1_n_ ( mp_ptr dst,
mp_srcptr numa,
mp_srcptr numb,
mp_size_t n )

减法结合左移1位操作 [dst,n] = [numa,n] - ([numb,n] << 1)

参数
dst结果输出指针
numa被减数指针
numb减数指针(先左移1位)
nlimb长度
警告
n>0, eqsep(dst,[numa|numb]), dst!=NULL, numa!=NULL
返回
运算后的借位值 [0|1|2]

在文件 shl.c 第 80 行定义.

80 {
81 mp_limb_t d = 0, mb = 0;
82 mp_size_t i = 0;
83
84#define LMMP_SUBSHL1_STEP(k) \
85 { \
86 mp_limb_t v = numb[i + (k)]; \
87 mp_limb_t lo = (v << 1) | mb; \
88 mb = v >> (LIMB_BITS - 1); \
89 mp_limb_t o = numa[i + (k)]; \
90 mp_limb_t u = o - lo; \
91 mp_limb_t r = u - d; \
92 d = (u > o) + (r > u); \
93 dst[i + (k)] = r; \
94 }
95
96 for (; i + 4 <= n; i += 4) {
101 }
102 for (; i < n; i++) {
104 }
105#undef LMMP_SUBSHL1_STEP
106 return d + mb;
107}
#define LMMP_SUBSHL1_STEP(k)

引用了 lmmp_subshl1_n_(), LMMP_SUBSHL1_STEP, n , 以及 numb.

被这些函数引用 bench_subshl1_n(), lmmp_shlnot_(), lmmp_subshl1_n_(), TEST_CASE(), TEST_CASE(), TEST_CASE() , 以及 TEST_CASE().

函数调用图:
这是这个函数的调用关系图: