35TEST_CASE(
"memory/addsub", add_n_sub_n_inplace_pair) {
37 const u64 av[5] = {UINT64_MAX - 2, 1, 0, UINT64_MAX, 7};
38 const u64 bv[5] = {3, UINT64_MAX, UINT64_MAX - 1, 0, 1};
41 mp_ptr a = alloc_limbs(
n + 1), b = alloc_limbs(
n + 1), sa = alloc_limbs(
n), sb = alloc_limbs(
n),
42 ref_sum = alloc_limbs(
n), ref_diff = alloc_limbs(
n);
43 const mp_limb_t sent = UINT64_C(0x5a5af00dcafebeef);
44 a[
n] = sent; b[
n] = sent;
46 a[i] = av[i]; b[i] = bv[i]; sa[i] = av[i]; sb[i] = bv[i];
60 for (
mp_size_t i = 0; i <
n; ++i) { a[i] = av[i]; b[i] = bv[i]; }
72TEST_CASE(
"memory/addsub", addshl1_subshl1_inplace) {
74 const u64 av[4] = {1, 0, UINT64_MAX - 1, 5};
75 const u64 bv[4] = {UINT64_MAX, 1, 0, 0};
78 mp_ptr a = alloc_limbs(
n + 1), b = alloc_limbs(
n + 1), sa = alloc_limbs(
n), sb = alloc_limbs(
n),
79 ref = alloc_limbs(
n + 1);
80 const mp_limb_t sent = UINT64_C(0x5a5af00dcafebeef);
81 a[
n] = sent; b[
n] = sent;
83 a[i] = av[i]; b[i] = bv[i]; sa[i] = av[i]; sb[i] = bv[i];
94 const u64 bigv[4] = {0, 0, 0, 2};
95 for (
mp_size_t i = 0; i <
n; ++i) { a[i] = bigv[i]; sa[i] = bigv[i]; sb[i] = bv[i]; }
108 const u64 av[6] = {0, UINT64_MAX, 1, UINT64_MAX - 1, 0, 3};
109 const u64 bv[6] = {1, 1, UINT64_MAX, 0, UINT64_MAX, 0};
111 mp_ptr a = alloc_limbs(
n), b = alloc_limbs(
n), sa = alloc_limbs(
n), sb = alloc_limbs(
n),
112 ref = alloc_limbs(
n);
114 a[i] = av[i]; b[i] = bv[i]; sa[i] = av[i]; sb[i] = bv[i];
124 for (
mp_size_t i = 0; i <
n; ++i) { a[i] = av[i]; b[i] = bv[i]; }
132 for (
mp_size_t i = 0; i <
n; ++i) { a[i] = av[i]; b[i] = bv[i]; }
133 if (mpn_cmp(sa,
n, sb,
n) >= 0) {
139 for (
mp_size_t i = 0; i <
n; ++i) { a[i] = av[i]; b[i] = bv[i]; }
150 const u64 av[5] = {0, 1, UINT64_MAX, 0x8000000000000001ull, 0};
151 const u64 x = UINT64_C(0x9e3779b97f4a7c15);
153 mp_ptr a = alloc_limbs(
n), buf = alloc_limbs(
n + 2), ref = alloc_limbs(
n + 1);
154 for (
mp_size_t i = 0; i <
n; ++i) a[i] = av[i];
179 const u64 av[5] = {0, 0, UINT64_MAX, 1, 0x7fffffffffffffffull};
180 const u64 x = UINT64_C(0x100000001b3);
182 mp_ptr a = alloc_limbs(
n), buf = alloc_limbs(
n + 1), refq = alloc_limbs(
n + 1),
183 t = alloc_limbs(
n + 1);
184 for (
mp_size_t i = 0; i <
n; ++i) a[i] = av[i];
190 add_small_inplace(
t,
n + 1, r_ref);
211TEST_CASE(
"memory/muladd", addmul_submul_equal_sources) {
213 const u64 av[4] = {UINT64_MAX - 1, 0, 1, 7};
216 mp_ptr a = alloc_limbs(
n), backup = alloc_limbs(
n),
t = alloc_limbs(
n + 1);
217 for (
mp_size_t i = 0; i <
n; ++i) a[i] = av[i];
224 u64 sum_top = hi + c;
251 TEST_RUN(
"memory/addsub", add_n_sub_n_inplace_pair);
252 TEST_RUN(
"memory/addsub", addshl1_subshl1_inplace);
253 TEST_RUN(
"memory/shift", shr1add_shr1sub_inplace);
254 TEST_RUN(
"memory/mul1", mul_1_shifted_overlap);
255 TEST_RUN(
"memory/div1", div_1_shifted_overlap);
256 TEST_RUN(
"memory/muladd", addmul_submul_equal_sources);
void lmmp_free(void *ptr)
内存释放函数(调用lmmp_heap_free_fn)
mp_limb_t u64
Copyright (C) 2026 HJimmyK (Jericho Knox)
void test_memory_layout(void)
mp_limb_t lmmp_div_1_(mp_ptr dstq, mp_srcptr numa, mp_size_t na, mp_limb_t x)
单精度数除法
mp_limb_t lmmp_shr1add_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_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_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_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])
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_shr1sub_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_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)