27 mp_ptr a = alloc_limbs(
n), b = alloc_limbs(
n), d = alloc_limbs(
n);
28 fill_random(a,
n, 0x0f0e0d0c0b0a0908ull +
n);
29 fill_random(b,
n, 0x0102030405060708ull +
n);
39 mp_ptr a = alloc_limbs(
n), b = alloc_limbs(
n), d = alloc_limbs(
n);
40 fill_random(a,
n, 0x120e3489bc7ull +
n);
41 fill_random(b,
n, 0x92cab5432217ull +
n * 3);
51 mp_ptr a = alloc_limbs(
n), b = alloc_limbs(
n), d = alloc_limbs(
n),
tp = alloc_limbs(2 *
n);
52 fill_random(a,
n, 0x120e3489bc8ull +
n);
53 fill_random(b,
n, 0x92cab5432218ull +
n * 3);
64 mp_ptr a = alloc_limbs(
n), b = alloc_limbs(
n), d = alloc_limbs(
n),
tp = alloc_limbs(2 *
n);
65 fill_random(a,
n, 0x120e3489bc9ull +
n);
66 fill_random(b,
n, 0x92cab5432219ull +
n * 3);
98 setvbuf(stdout, NULL, _IONBF, 0);
100 puts(
"[lmmpn/mullo/mullo]");
102 puts(
"[lmmpn/mullo/basecase]");
int main(void)
Copyright (C) 2026 HJimmyK (Jericho Knox)
void lmmp_free(void *ptr)
内存释放函数(调用lmmp_heap_free_fn)
void lmmp_global_init(void)
全局初始化函数(线程局部的)
void lmmp_global_deinit(void)
全局释放函数(线程局部的)
void lmmp_mullo_dc_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_ptr tp, mp_size_t n)
低位乘法 [dst,n] = [numa,n] * [numb,n] mod B^n
void lmmp_mullo_basecase_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
基础低位乘法 [dst,n] = [numa,n] * [numb,n] mod B^n
void lmmp_mullo_fft_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n, mp_ptr scratch)
低位FFT乘法 [dst,n] = [numa,n] * [numb,n] mod B^n
void lmmp_mullo_(mp_ptr dst, mp_srcptr numa, mp_srcptr numb, mp_size_t n)
低位乘法 [dst,n] = [numa,n] * [numb,n] mod B^n
static double bench_mullo_dc(mp_size_t n, const bench_options *o)
static double bench_mullo(mp_size_t n, const bench_options *o)
static void run_mullo(void)
static double bench_mullo_fft(mp_size_t n, const bench_options *o)
static double bench_mullo_basecase(mp_size_t n, const bench_options *o)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define ARRAY_SIZE(a)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define BENCH_MEASURE(result, options,...)