32#define MAX_T ((ulong)0x7fffffffffff)
37#define TRIALDIV_BLK_MAX ((ushort)2012)
69 .blks = NULL, .blkc = 0, .bn = 0, .bn_inv = 0,
70 .bn_chunk = 0, .pi = 1, .t = 1,
81 G.blkc =
G.blkc ?
G.blkc * 2 : 32;
103 while (
G.pi < cnt ||
G.t > 1) {
119 for (
ushort i =
G.bn_inv; i <
n; ++i) {
135 for (
ushort i =
G.bn_chunk; i <
n; ++i) {
153 if (
G.bn_inv <
n)
G.bn_inv =
n;
175 if (cnt <= 1)
return false;
181 while (un <
G.bn &&
G.blks[un].p0 < cnt) ++un;
195 for (
ushort i = 0; i < un; ++i) {
198 if (r == 0)
return true;
#define lmmp_leading_zeros_
#define lmmp_debug_assert(x)
const mp_limb_t * mp_srcptr
void lmmp_free(void *ptr)
内存释放函数(调用lmmp_heap_free_fn)
#define LMMP_THREAD_LOCAL
#define lmmp_param_assert(x)
mp_limb_t lmmp_mod_preinv_1_(mp_srcptr numa, mp_size_t na, mp_limb_t x, mp_limb_t inv, mp_limb_t k)
单精度数取余(预备逆元版) [numa,na] mod x,同 lmmp_mod_1_
mp_limb_t lmmp_inv_1_(mp_limb_t x)
1阶逆元计算 (inv1)
static uint64_t _bpow_preinv_(uint64_t m, uint64_t k, int nb, uint64_t inv)
#define clz_shl_u64(r, x, cnt)
#define TRIALDIV_K8_THRESHOLD
#define TRIALDIV_PREINV_THRESHOLD
uint8_t uchar
Copyright (C) 2026 HJimmyK (Jericho Knox)
ulong lmmp_binvert_ulong_(ulong a)
计算 a 在2^64下的逆元
#define PRIME_SHORT_TABLE_SIZE
const ushort prime_short_table[6542]
Copyright (C) 2026 HJimmyK (Jericho Knox)
ushort lmmp_prime_cnt16_(ushort n)
计算小于等于 n 的素数数量
#define restrict
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define REALLOC_TYPE(p, new_size, type)
mp_limb_t(*) trialdiv_leg_fn(mp_srcptr np, mp_size_t nn, const trialdiv_blk *b)
static void trialdiv_init_chunk_(ushort n)
给 [bn_chunk,n) 的块补算折叠腿要用的 dinv、mi、r2、base
static void trialdiv_close(void)
把开块落盘成 blks[bn] 里的一个新块,随后开块清空
static mp_limb_t trialdiv_leg_8_(mp_srcptr np, mp_size_t nn, const trialdiv_blk *b)
static void trialdiv_init_inv_(ushort n)
给 [bn_inv,n) 的块补算 k 和 inv
static mp_limb_t trialdiv_leg_4_(mp_srcptr np, mp_size_t nn, const trialdiv_blk *b)
static mp_limb_t trialdiv_leg_preinv_(mp_srcptr np, mp_size_t nn, const trialdiv_blk *b)
static void trialdiv_extend_(ushort cnt)
打包素数,把下标 [1,cnt) 内的奇素数全部收进闭块
块内字段分三组、各按水位 [0,bn_x) 惰性初始化,纯小 nn 负载不付 chunk 组预处理、纯大 nn 负载不付 preinv 组预处理: 打包组 t/p0/pn 建块即得 preinv 组 k...
mp_limb_t lmmp_mod_8chunk_1_(mp_srcptr numa, mp_size_t na, mp_limb_t d, mp_limb_t dinv, mp_limb_t r2, mp_limb_t base, mp_limb_t mi)
8 链折叠取模:r = [numa,na] mod d
const mp_limb_t r35711_mask_map[19]
void lmmp_trialdiv_table_free_(void)
bool lmmp_trialdiv_(mp_srcptr np, mp_size_t nn, ushort N)
Copyright (C) 2026 HJimmyK (Jericho Knox)
mp_limb_t lmmp_mod_4chunk_1_(mp_srcptr numa, mp_size_t na, mp_limb_t d, mp_limb_t dinv, mp_limb_t r2, mp_limb_t base, mp_limb_t mi)
4 链折叠取模:r = [numa,na] mod d