32#if defined(__BYTE_ORDER__) && defined(__ORDER_LITTLE_ENDIAN__)
33 bool little = (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__);
47 u64 seed = 0x12345678abcdef;
48 for (
int i = 0; i < 200; ++i) {
49 u64 x = xorshift64(&seed);
52 while (
t) { ++expect;
t >>= 1; }
58 u64 seed = 0x9e3779b97f4a7c15ull;
59 for (
int i = 0; i < 300; ++i) {
60 u64 x = xorshift64(&seed);
63 while (
t) { pc += (int)(
t & 1);
t >>= 1; }
67 for (
int b = 63; b >= 0; --b) {
68 if ((x >> b) & 1)
break;
77 else while ((
t & 1) == 0) { ++tz;
t >>= 1; }
95 lmmp_mullh_(0xFFFFFFFFFFFFFFFFull, 0xFFFFFFFFFFFFFFFFull, dst);
104 u64 seed = 0xdeadbeefcafebabeull;
105 for (
int i = 0; i < 300; ++i) {
106 u64 a = xorshift64(&seed);
107 u64 b = xorshift64(&seed);
145 u64 seed = 0x1111111122222222ull;
146 for (
size_t n = 1;
n <=
MAX_N; ++
n) {
147 for (
int iter = 0; iter < 20; ++iter) {
148 mp_ptr a = alloc_limbs(
n), b = alloc_limbs(
n), dst = alloc_limbs(
n), r = alloc_limbs(
n),
150 random_limbs(a,
n, &seed);
151 random_limbs(b,
n, &seed);
167 memcpy(r, dst,
n * 8);
169 while (i < (
int)
n && ++r[i] == 0) ++i;
181 while (i < (
int)
n && r[i]-- == 0) ++i;
196 u64 seed = 0x3333333344444444ull;
197 for (
size_t n = 1;
n <=
MAX_N; ++
n) {
198 for (
int iter = 0; iter < 20; ++iter) {
199 mp_ptr a = alloc_limbs(
n), b = alloc_limbs(
n), da = alloc_limbs(
n), db = alloc_limbs(
n),
201 random_limbs(a,
n, &seed);
202 random_limbs(b,
n, &seed);
231 u64 seed = 0x5555555566666666ull;
232 for (
size_t n = 1;
n <=
MAX_N;
n += 3) {
233 for (
int iter = 0; iter < 5; ++iter) {
234 mp_ptr a = alloc_limbs(
n), dst = alloc_limbs(
n), dst2 = alloc_limbs(
n + 1),
235 vbuf = alloc_limbs(
n + 1);
236 random_limbs(a,
n, &seed);
238 for (
size_t s = 0;
s < 64; ++
s) {
241 memcpy(vbuf, dst,
n * 8);
260 u64 expect_ret = (a[0] & (((
u64)1 <<
s) - 1)) << (64 -
s);
265 u64 lowmask = ((
u64)1 <<
s) - 1;
267 u64 alow = a[0] & lowmask;
285 u64 seed = 0x7777777788888888ull;
286 for (
size_t n = 1;
n <=
MAX_N; ++
n) {
287 for (
int iter = 0; iter < 20; ++iter) {
288 mp_ptr a = alloc_limbs(
n), dst = alloc_limbs(
n + 1), q = alloc_limbs(
n + 1),
289 acc = alloc_limbs(
n + 1), acc2 = alloc_limbs(
n + 1),
t = alloc_limbs(
n + 2);
290 random_limbs(a,
n, &seed);
291 u64 x = xorshift64(&seed) | 1;
307 random_limbs(acc,
n, &seed);
308 memcpy(acc2, acc,
n * 8);
317 memcpy(acc2, acc,
n * 8);
338 u64 seed = 0x99999999aaaaaaaaull;
339 for (
size_t n = 1;
n <=
MAX_N; ++
n) {
340 for (
int iter = 0; iter < 20; ++iter) {
341 mp_ptr a = alloc_limbs(
n), b = alloc_limbs(
n), dst = alloc_limbs(
n + 1),
342 t = alloc_limbs(
n + 1),
b2 = alloc_limbs(
n + 1);
343 random_limbs(a,
n, &seed);
344 random_limbs(b,
n, &seed);
353 for (
size_t s = 0;
s < 64; ++
s) {
382 TEST_RUN(
"low/limb", popcnt_clz_ctz);
385 TEST_RUN(
"low/addsub", add_n_sub_n);
387 TEST_RUN(
"low/mul1", mul_1_addmul_submul);
388 TEST_RUN(
"low/misc", shlnot_not_addshl1_subshl1);
#define lmmp_leading_zeros_
#define lmmp_limb_popcnt_
#define lmmp_tailing_zeros_
void lmmp_free(void *ptr)
内存释放函数(调用lmmp_heap_free_fn)
mp_limb_t u64
Copyright (C) 2026 HJimmyK (Jericho Knox)
mp_limb_t lmmp_shlnot_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_size_t shl)
左移后按位取反操作 [dst,na] = ~([numa,na] << shl),dst的低shl位填充1
mp_limb_t lmmp_div_1_(mp_ptr dstq, mp_srcptr numa, mp_size_t na, mp_limb_t x)
单精度数除法
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)
mp_limb_t lmmp_shr_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_size_t shr)
右移操作 [dst,na] = [numa,na]>>shr,dst的高shr位填充0
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_add_nc_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n, mp_limb_t c)
带进位的n位加法 [dst,n] = [numa,n] + [numb,n] + c
mp_limb_t lmmp_shl_(mp_ptr dst, mp_srcptr numa, mp_size_t na, mp_size_t shl)
左移操作 [dst,na] = [numa,na]<<shl,dst的低shl位填充0
mp_limb_t lmmp_addmul_1_(mp_ptr numa, mp_srcptr numb, mp_size_t n, mp_limb_t b)
乘以单limb并累加操作 [numa,n] += [numb,n] * b
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
mp_limb_t lmmp_add_n_sub_n_(mp_ptr dsta, mp_ptr dstb, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
同时执行n位加法和减法 ([dsta,n],[dstb,n]) = ([numa,n]+[numb,n],[numa,n]-[numb,n])
static bool lmmp_endian(void)
运行时判断端序
void lmmp_not_(mp_ptr dst, mp_srcptr numa, mp_size_t na)
按位取反操作 [dst,na] = ~[numa,na] (对每个limb执行按位非操作)
mp_limb_t lmmp_submul_1_(mp_ptr numa, mp_srcptr numb, mp_size_t n, mp_limb_t b)
乘以单limb并累减操作 [numa,n] -= [numb,n] * b
mp_limb_t lmmp_sub_n_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
无借位的n位减法 [dst,n] = [numa,n] - [numb,n]
mp_limb_t lmmp_sub_nc_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n, mp_limb_t c)
带借位的n位减法 [dst,n] = [numa,n] - [numb,n] - c
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]
#define TEST_CASE(category, name)
#define TEST_CHECK_EQ(a, b)
#define TEST_RUN(category, name)
const size_t MAX_N
Copyright (C) 2026 HJimmyK (Jericho Knox)