23#ifndef LMMP_TEST_UTILS_H
24#define LMMP_TEST_UTILS_H
48 for (
size_t i = 0; i <
n; ++i) p[i] =
xorshift64(seed);
49 if (
n > 0 && top_nonzero) p[
n - 1] |= (
u64)1 << 63;
58 while (
n > 0 && p[
n - 1] == 0) --
n;
67 u64 carry = (p[0] < old) ? 1 : 0;
68 while (carry && ++i <
n) {
71 carry = (p[i] < old) ? 1 : 0;
73 return (carry && i ==
n) ? 1 : 0;
81 u64 borrow = (p[0] > old) ? 1 : 0;
82 while (borrow && ++i <
n) {
85 borrow = (p[i] > old) ? 1 : 0;
87 return (borrow && i ==
n) ? 1 : 0;
93 for (
size_t i = 0; i + 1 <
n; ++i) p[i] = (p[i] >> 1) | (p[i + 1] << 63);
94 if (
n > 0) p[
n - 1] = (p[
n - 1] >> 1) | (top_bit << 63);
102 if (
an !=
bn)
return an <
bn ? -1 : 1;
104 if (a[i] != b[i])
return a[i] < b[i] ? -1 : 1;
117static const u32 MOD_P[] = {4294967291u, 4294967279u, 4294967231u, 2147483647u, 1000000007u};
147 if (
mod32(r, rn, p) != want)
return false;
161 if (
mod32(r, rn, p) != want)
return false;
175 if (
mod32(r, rn, p) != want)
return false;
182 if (dn == 0)
return false;
194 memcpy(sum, a, (
size_t)la * 8);
197 memcpy(pad, b, (
size_t)lb * 8);
205 if (la >= lb)
lmmp_mul_(dst, a, la, b, lb);
213 if ((
size_t)en + 1 >= cap)
return -1;
222 if (
n < 2)
return false;
223 for (
u32 d = 2; (
u64)d * d <=
n; ++d)
224 if (
n % d == 0)
return false;
235 if (need > buf + 4)
return 0;
240 if (ly >= want_n)
return ly;
#define lmmp_zero(dst, n)
void * lmmp_alloc(size_t size)
内存分配函数(调用lmmp_heap_alloc_fn)
void lmmp_free(void *ptr)
内存释放函数(调用lmmp_heap_free_fn)
static bool mpn_eq(const mp_limb_t *a, mp_size_t an, const mp_limb_t *b, mp_size_t bn)
static u64 shr1_inplace(mp_ptr p, size_t n, u64 top_bit)
static bool mod_is_product(const mp_limb_t *r, mp_size_t rn, const mp_limb_t *a, mp_size_t an, const mp_limb_t *b, mp_size_t bn)
static void random_limbs_with_top(mp_ptr p, size_t n, u64 *seed, bool top_nonzero)
static const int MOD_P_CNT
static bool mod_is_sum(const mp_limb_t *r, mp_size_t rn, const mp_limb_t *a, mp_size_t an, const mp_limb_t *b, mp_size_t bn)
static u64 sub_small_inplace(mp_ptr p, size_t n, u64 v)
static u64 mulmod32(u64 a, u64 b, u64 m)
static mp_ptr alloc_limbs(size_t n)
static u64 xorshift64(u64 *s)
static void mul_sorted(mp_ptr dst, const mp_limb_t *a, mp_size_t la, const mp_limb_t *b, mp_size_t lb)
static bool is_prime_small(u32 n)
static bool mod_eq(const mp_limb_t *a, mp_size_t an, const mp_limb_t *b, mp_size_t bn)
static u64 mod32(const mp_limb_t *p, mp_size_t n, u32 m)
static int mpn_cmp(const mp_limb_t *a, mp_size_t an, const mp_limb_t *b, mp_size_t bn)
static bool mod_is_diff(const mp_limb_t *r, mp_size_t rn, const mp_limb_t *a, mp_size_t an, const mp_limb_t *b, mp_size_t bn)
static void random_limbs(mp_ptr p, size_t n, u64 *seed)
static mp_size_t fib_pair(mp_ptr x, mp_ptr y, mp_size_t buf, mp_size_t want_n)
static void pad_add(const mp_limb_t *a, mp_size_t la, const mp_limb_t *b, mp_size_t lb, mp_size_t mx, mp_ptr sum)
static mp_size_t norm_len(const mp_limb_t *p, mp_size_t n)
static bool divides_all(const mp_limb_t *d, mp_size_t dn, const mp_limb_t *p, mp_size_t pn)
static u64 addmod32(u64 a, u64 b, u64 m)
static u64 add_small_inplace(mp_ptr p, size_t n, u64 v)
mp_limb_t u64
Copyright (C) 2026 HJimmyK (Jericho Knox)
static u64 submod32(u64 a, u64 b, u64 m)
static mp_size_t chain_mul_small(mp_ptr e, mp_size_t en, u64 v, size_t cap)
mp_limb_t lmmp_mod_1_(mp_srcptr numa, mp_size_t na, mp_limb_t 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_mul_1_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_limb_t x)
乘以单limb操作 [dst,na] = [numa,na] * x
void lmmp_div_(mp_ptr dstq, mp_ptr dstr, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
除法和取模操作
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]
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 缓冲区长度