git/linux-cryptodev-2.6
1
0
Fork 0
mirror of https://git.kernel.org/pub/scm/linux/kernel/git/herbert/cryptodev-2.6.git synced 2026-04-27 11:58:32 -04:00
Code Issues Packages Projects Releases Wiki Activity

lib/prime_numbers: convert self-test to KUnit

Browse Source 
Extract a private header and convert the prime_numbers self-test to a
KUnit test. I considered parameterizing the test using
`KUNIT_CASE_PARAM` but didn't see how it was possible since the test
logic is entangled with the test parameter generation logic.

Signed-off-by: Tamir Duberstein <tamird@gmail.com>
Link: https://lore.kernel.org/r/20250208-prime_numbers-kunit-convert-v5-2-b0cb82ae7c7d@gmail.com
Signed-off-by: Kees Cook <kees@kernel.org>
This commit is contained in:
Tamir Duberstein
2025-02-08 21:44:39 -05:00
committed by Kees Cook
parent 9ab61886ac
commit 313b38a6ec
7 changed files with 109 additions and 77 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
lib/math/tests/Makefile
View File

@@ -4,4 +4,5 @@ obj-$(CONFIG_GCD_KUNIT_TEST) += gcd_kunit.o
obj-$(CONFIG_INT_LOG_KUNIT_TEST) += int_log_kunit.o
obj-$(CONFIG_INT_POW_KUNIT_TEST) += int_pow_kunit.o
obj-$(CONFIG_INT_SQRT_KUNIT_TEST) += int_sqrt_kunit.o
obj-$(CONFIG_PRIME_NUMBERS_KUNIT_TEST) += prime_numbers_kunit.o
obj-$(CONFIG_RATIONAL_KUNIT_TEST) += rational_kunit.o

59
lib/math/tests/prime_numbers_kunit.c Normal file
View File

@@ -0,0 +1,59 @@
// SPDX-License-Identifier: GPL-2.0-only
#include <kunit/test.h>
#include <linux/module.h>
#include <linux/prime_numbers.h>
#include "../prime_numbers_private.h"
static void dump_primes(void *ctx, const struct primes *p)
{
static char buf[PAGE_SIZE];
struct kunit_suite *suite = ctx;
bitmap_print_to_pagebuf(true, buf, p->primes, p->sz);
kunit_info(suite, "primes.{last=%lu, .sz=%lu, .primes[]=...x%lx} = %s",
p->last, p->sz, p->primes[BITS_TO_LONGS(p->sz) - 1], buf);
}
static void prime_numbers_test(struct kunit *test)
{
const unsigned long max = 65536;
unsigned long x, last, next;
for (last = 0, x = 2; x < max; x++) {
const bool slow = slow_is_prime_number(x);
const bool fast = is_prime_number(x);
KUNIT_ASSERT_EQ_MSG(test, slow, fast, "is-prime(%lu)", x);
if (!slow)
continue;
next = next_prime_number(last);
KUNIT_ASSERT_EQ_MSG(test, next, x, "next-prime(%lu)", last);
last = next;
}
}
static void kunit_suite_exit(struct kunit_suite *suite)
{
with_primes(suite, dump_primes);
}
static struct kunit_case prime_numbers_cases[] = {
KUNIT_CASE(prime_numbers_test),
{},
};
static struct kunit_suite prime_numbers_suite = {
.name = "math-prime_numbers",
.suite_exit = kunit_suite_exit,
.test_cases = prime_numbers_cases,
};
kunit_test_suite(prime_numbers_suite);
MODULE_AUTHOR("Intel Corporation");
MODULE_DESCRIPTION("Prime number library");
MODULE_LICENSE("GPL");