LMMP 4.3.0
Lamina High-Precision Arithmetic Library
载入中...
搜索中...
未找到
is_prime_n.c
浏览该文件的文档.
1/**
2 * Copyright (C) 2026 HJimmyK (Jericho Knox)
3 *
4 * This file is part of LMMP.
5 *
6 * LMMP is free software: you can redistribute it and/or modify it
7 * under the terms of the GNU Lesser General Public License as
8 * published by the Free Software Foundation; either version 3 of
9 * the License, or (at your option) any later version.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library. If not, see
18 * <https://www.gnu.org/licenses/>.
19 *
20 * SPDX-License-Identifier: LGPL-3.0-or-later
21 */
22
23#include "prime_pool.h"
24
25static double bench_is_prime_n(mp_size_t n, int strength, PrimePool kind, const bench_options *o) {
26 int cnt = pool_cnt(n);
27 mp_ptr a = pool_n(n, cnt, 0x51ce77ac01ull + (mp_limb_t)strength * 131 + n, kind);
28 size_t idx = 0;
29 double us;
30 BENCH_MEASURE(us, o, bench_sink += (mp_limb_t)lmmp_is_prime_n_(a + n * (idx++ % cnt), n, strength););
31 lmmp_free(a);
32 return us;
33}
34
35static double bench_is_prime_n_notrial(mp_size_t n, int strength, PrimePool kind, const bench_options *o) {
36 int cnt = pool_cnt(n);
37 mp_ptr a = pool_n(n, cnt, 0x51ce77ac03ull + (mp_limb_t)strength * 131 + n, kind);
38 size_t idx = 0;
39 double us;
40 BENCH_MEASURE(us, o, bench_sink += (mp_limb_t)lmmp_is_prime_n_notrial_(a + n * (idx++ % cnt), n, strength););
41 lmmp_free(a);
42 return us;
43}
44
45/*
46 MR 轮的指数为模数全长,单 op 成本随 n^3 增长(200L 已 ~1s),
47 默认阶梯到 200L 止;更大尺寸用 bench_is_prime_n(n, ...) 单点测量。
48*/
49static void run_is_prime_n(void) {
50 const mp_size_t SZ[] = {3, 8, 16, 32, 64, 200};
51 for (size_t i = 0; i < ARRAY_SIZE(SZ); ++i) {
52 mp_size_t n = SZ[i];
53 report_n("is_prime_n s4 coprime", n, bench_is_prime_n(n, 4, PRIME_POOL_COPRIME, &bench_default), 0);
54 }
55}
56
57/* 素数池最坏情形与强度档位扩展(素数池构造昂贵,仅取小尺寸) */
58static void run_is_prime_n_prime(void) {
59 const mp_size_t SZ[] = {8, 64};
60 for (size_t i = 0; i < ARRAY_SIZE(SZ); ++i) {
61 mp_size_t n = SZ[i];
62 report_n("is_prime_n s4 prime", n, bench_is_prime_n(n, 4, PRIME_POOL_PRIME, &bench_default), 0);
63 }
64}
65
66/* coprime 池已过试除,notrial 与全函数对照差即试除腿纯开销 */
67static void run_is_prime_n_notrial(void) {
68 const mp_size_t SZ[] = {3, 8, 16, 64};
69 for (size_t i = 0; i < ARRAY_SIZE(SZ); ++i) {
70 mp_size_t n = SZ[i];
71 report_n("is_prime_n_notrial s4 coprime", n, bench_is_prime_n_notrial(n, 4, PRIME_POOL_COPRIME, &bench_default), 0);
72 }
73}
74
75static void run_is_prime_n_tier(void) {
76 const int STR[] = {0, 2, 4, 7};
77 for (size_t i = 0; i < ARRAY_SIZE(STR); ++i) {
78 int s = STR[i];
79 char buf[64];
80 snprintf(buf, sizeof(buf), "is_prime_n s%d prime(8L)", s);
81 report(buf, bench_is_prime_n(8, s, PRIME_POOL_PRIME, &bench_default), 0);
82 }
83}
84
85int main(void) {
86 setvbuf(stdout, NULL, _IONBF, 0);
88 puts("[numth/prime/is_prime_n]");
90 puts("[numth/prime/is_prime_n_prime]");
92 puts("[numth/prime/is_prime_n_notrial]");
94 puts("[numth/prime/is_prime_n_tier]");
97 return 0;
98}
int main(void)
Copyright (C) 2026 HJimmyK (Jericho Knox)
定义 main.c:26
mp_limb_t * mp_ptr
定义 lmmp.h:96
uint64_t mp_size_t
定义 lmmp.h:93
void lmmp_free(void *ptr)
内存释放函数(调用lmmp_heap_free_fn)
void lmmp_global_init(void)
全局初始化函数(线程局部的)
uint64_t mp_limb_t
定义 lmmp.h:92
void lmmp_global_deinit(void)
全局释放函数(线程局部的)
#define s
#define n
int lmmp_is_prime_n_notrial_(mp_srcptr np, mp_size_t nn, int strength)
大整数素性检验(无试除法,强度分档,大于 128 位)
int lmmp_is_prime_n_(mp_srcptr np, mp_size_t nn, int strength)
大整数素性检验(强度分档,大于 128 位)
static void run_is_prime_n_prime(void)
static double bench_is_prime_n_notrial(mp_size_t n, int strength, PrimePool kind, const bench_options *o)
static void run_is_prime_n_notrial(void)
static void run_is_prime_n_tier(void)
static void run_is_prime_n(void)
static double bench_is_prime_n(mp_size_t n, int strength, PrimePool kind, const bench_options *o)
Copyright (C) 2026 HJimmyK (Jericho Knox)
#define ARRAY_SIZE(a)
Copyright (C) 2026 HJimmyK (Jericho Knox)
定义 perf.h:40
#define BENCH_MEASURE(result, options,...)
定义 perf.h:93
PrimePool
Copyright (C) 2026 HJimmyK (Jericho Knox)
@ PRIME_POOL_PRIME
@ PRIME_POOL_COPRIME