38 struct known_result {
ulong n;
u64 v; } known[] = {
39 {10, 55ull}, {50, 12586269025ull},
40 {93, 12200160415121876738ull},
42 for (
size_t k_index = 0; k_index <
ARRAY_SIZE(known); ++k_index) {
43 const struct known_result
k = known[k_index];
52 const ulong NLIM = 500;
53 for (
ulong n = 1;
n <= NLIM;
n += 7) {
55 mp_ptr fa = alloc_limbs((
size_t)rn), fb = alloc_limbs((
size_t)rn);
56 mp_ptr fc = alloc_limbs((
size_t)rn), fd = alloc_limbs((
size_t)rn);
57 mp_ptr s = alloc_limbs((
size_t)rn + 1);
74TEST_CASE(
"numth/fib", large_recurrence_and_cassini) {
75 const ulong n_values[] = {94ul, 95ul, 187ul, 371ul, 373ul, 925ul, 1000ul, 4181ul, 65536ul, 65537ul,
76 100001ul, 131072ul, 150000ul};
77 for (
size_t n_index = 0; n_index <
ARRAY_SIZE(n_values); ++n_index) {
78 ulong n = n_values[n_index];
80 mp_ptr a = alloc_limbs((
size_t)rn);
81 mp_ptr b = alloc_limbs((
size_t)rn);
82 mp_ptr c = alloc_limbs((
size_t)rn);
83 mp_ptr t = alloc_limbs((
size_t)(2 * rn));
84 mp_ptr s = alloc_limbs((
size_t)(2 * rn));
109 for (
mp_size_t i = 0; i < ld; ++i) same = same && (d[i] == b[i]);
117 TEST_CHECK_MSG(borrow == 0 &&
s[0] == 1 && norm_len(
s, 2 * rn) == 1,
"Cassini +1");
130 TEST_RUN(
"numth/fib", small_exhaustive);
131 TEST_RUN(
"numth/fib", large_recurrence_and_cassini);
#define lmmp_zero(dst, n)
void lmmp_free(void *ptr)
内存释放函数(调用lmmp_heap_free_fn)
mp_limb_t u64
Copyright (C) 2026 HJimmyK (Jericho Knox)
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]
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]
static mp_limb_t lmmp_sub_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
减法静态内联函数 [dst,na]=[numa,na]-[numb,nb]
mp_size_t lmmp_fibonacci2_(mp_ptr dst, mp_ptr dst2, mp_size_t rn, ulong n)
计算 Fibonacci 数对:[dst,rn] = F[n],[dst2,rn] = F[n-1]
mp_size_t lmmp_fibonacci_size_(ulong n)
计算 Fibonacci 数 F[n](及 F[n-1])所需的 limb 缓冲区长度
mp_size_t lmmp_fibonacci_(mp_ptr dst, mp_size_t rn, ulong n)
计算 Fibonacci 数 [dst,rn] = F[n]
#define ARRAY_SIZE(a)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define TEST_CHECK_MSG(cond, msg)
#define TEST_CASE(category, name)
#define TEST_CHECK_EQ(a, b)
#define TEST_RUN(category, name)