From: Milan Tripkovic <milant2002@gmail.com>
To: pjw@kernel.org, palmer@dabbelt.com, aou@eecs.berkeley.edu,
kees@kernel.org
Cc: alex@ghiti.fr, andy@kernel.org, linux-riscv@lists.infradead.org,
linux-kernel@vger.kernel.org, linux-hardening@vger.kernel.org,
Dusan.Stojkovic@rt-rk.com,
Milan Tripkovic <Milan.Tripkovic@rt-rk.com>
Subject: [PATCH v3 2/2] lib/string_kunit: extend benchmarks and unit test to memcmp()
Date: Fri, 15 May 2026 16:10:19 +0200 [thread overview]
Message-ID: <20260515141019.1234037-3-milant2002@gmail.com> (raw)
In-Reply-To: <20260515141019.1234037-1-milant2002@gmail.com>
From: Milan Tripkovic <Milan.Tripkovic@rt-rk.com>
Extend the string benchmarking suite to include memcmp().
Extend the string unit test to include memcmp().
Signed-off-by: Milan Tripkovic <Milan.Tripkovic@rt-rk.com>
---
lib/tests/string_kunit.c | 116 +++++++++++++++++++++++++++++++++++++++
1 file changed, 116 insertions(+)
diff --git a/lib/tests/string_kunit.c b/lib/tests/string_kunit.c
index 0819ace5b..95d65c25b 100644
--- a/lib/tests/string_kunit.c
+++ b/lib/tests/string_kunit.c
@@ -881,6 +881,120 @@ static void string_bench_strrchr(struct kunit *test)
STRING_BENCH_BUF(test, buf, len, strrchr, buf, '\0');
}
+static void string_test_memcmp(struct kunit *test)
+{
+ const unsigned int max_offset = 16;
+ const unsigned int max_len = 32;
+ const unsigned int buf_size = max_offset + max_len + 32;
+ u8 *buf1, *buf2;
+ unsigned int i, j, len, k;
+ int res;
+
+ buf1 = kunit_kzalloc(test, buf_size, GFP_KERNEL);
+ buf2 = kunit_kzalloc(test, buf_size, GFP_KERNEL);
+ KUNIT_ASSERT_NOT_ERR_OR_NULL(test, buf1);
+ KUNIT_ASSERT_NOT_ERR_OR_NULL(test, buf2);
+
+ for (i = 0; i < max_offset; i++) {
+ for (j = 0; j < max_offset; j++) {
+ for (len = 0; len <= max_len; len++) {
+ memset(buf1, 'A', buf_size);
+ memset(buf2, 'A', buf_size);
+ KUNIT_EXPECT_EQ_MSG(test, memcmp(buf1 + i, buf2 + j, len), 0,
+ "Should be equal: i:%u j:%u len:%u", i, j, len);
+ for (k = 0; k < len; k++) {
+ memset(buf1, 'A', buf_size);
+ memset(buf2, 'A', buf_size);
+ buf2[j + k] = 'B';
+ res = memcmp(buf1 + i, buf2 + j, len);
+ KUNIT_EXPECT_NE_MSG(test, res, 0,
+ "Should detect difference at k:%u (i:%u j:%u len:%u)",
+ k, i, j, len);
+ if (buf1[i + k] < buf2[j + k])
+ KUNIT_EXPECT_LT(test, res, 0);
+ else
+ KUNIT_EXPECT_GT(test, res, 0);
+ }
+ }
+ }
+ }
+}
+
+static void do_string_bench_memcmp(struct kunit *test)
+{
+ char *buf1 = NULL;
+ char *buf2 = NULL;
+ const u64 lengths[] = { 1, 7, 8, 16, 32, 64, 128, 512, 1024, 4096 };
+ const int offsets[] = { 0, 1, 3, 7 };
+ const u64 max_len = 4096 + 64;
+ unsigned int w, o, i;
+ unsigned int off;
+ u64 len;
+ char *p1;
+ char *p2;
+ u64 iterations;
+ u64 elapsed;
+ u64 ns_per_call;
+ u64 mbps;
+ u64 j;
+
+ buf1 = vmalloc(max_len);
+ buf2 = vmalloc(max_len);
+
+ if (!buf1 || !buf2) {
+ vfree(buf1);
+ vfree(buf2);
+ kunit_err(test, "vmalloc failed\n");
+ return;
+ }
+
+ memset(buf1, 'A', max_len);
+ memset(buf2, 'A', max_len);
+
+ for (w = 0; w < 100000U; w++)
+ (void)memcmp(buf1, buf2, 4096);
+
+ for (o = 0; o < ARRAY_SIZE(offsets); o++) {
+ off = offsets[o];
+
+ for (i = 0; i < ARRAY_SIZE(lengths); i++) {
+ len = lengths[i];
+ p1 = buf1;
+ p2 = buf2 + off;
+ iterations = (len < 512) ? 100000ULL : 10000ULL;
+
+ for (j = 0; j < iterations; j++) {
+ (void)memcmp(p1, p2, len);
+ barrier();
+ }
+
+ elapsed = STRING_BENCH(iterations, memcmp, p1, p2, len);
+ ns_per_call = div_u64(elapsed, iterations);
+ mbps = len ? div_u64(iterations * len * (NSEC_PER_SEC / MEGA), elapsed) : 0;
+
+ if (off == 0) {
+ kunit_info(test, "bench_memcmp_aligned: len=%-4llu: %llu MB/s (%llu ns/call)\n",
+ len, mbps, ns_per_call);
+ } else {
+ kunit_info(test, "bench_memcmp_unaligned(off=%u): len=%-4llu: %llu MB/s (%llu ns/call)\n",
+ off, len, mbps, ns_per_call);
+ }
+ }
+ }
+
+ vfree(buf1);
+ vfree(buf2);
+}
+
+static void string_bench_memcmp(struct kunit *test)
+{
+ if (!IS_ENABLED(CONFIG_STRING_KUNIT_BENCH)) {
+ kunit_skip(test, "CONFIG_STRING_KUNIT_BENCH not enabled");
+ return;
+ }
+ do_string_bench_memcmp(test);
+}
+
static struct kunit_case string_test_cases[] = {
KUNIT_CASE(string_test_memset16),
KUNIT_CASE(string_test_memset32),
@@ -910,6 +1024,8 @@ static struct kunit_case string_test_cases[] = {
KUNIT_CASE(string_bench_strnlen),
KUNIT_CASE(string_bench_strchr),
KUNIT_CASE(string_bench_strrchr),
+ KUNIT_CASE(string_test_memcmp),
+ KUNIT_CASE_SLOW(string_bench_memcmp),
{}
};
--
2.43.0
_______________________________________________
linux-riscv mailing list
linux-riscv@lists.infradead.org
http://lists.infradead.org/mailman/listinfo/linux-riscv
prev parent reply other threads:[~2026-05-15 14:10 UTC|newest]
Thread overview: 3+ messages / expand[flat|nested] mbox.gz Atom feed top
2026-05-15 14:10 [PATCH v3 0/2] riscv: lib: add optimized memcmp() and extend KUnit tests Milan Tripkovic
2026-05-15 14:10 ` [PATCH v3 1/2] riscv: lib: add memcmp() implementation Milan Tripkovic
2026-05-15 14:10 ` Milan Tripkovic [this message]
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=20260515141019.1234037-3-milant2002@gmail.com \
--to=milant2002@gmail.com \
--cc=Dusan.Stojkovic@rt-rk.com \
--cc=Milan.Tripkovic@rt-rk.com \
--cc=alex@ghiti.fr \
--cc=andy@kernel.org \
--cc=aou@eecs.berkeley.edu \
--cc=kees@kernel.org \
--cc=linux-hardening@vger.kernel.org \
--cc=linux-kernel@vger.kernel.org \
--cc=linux-riscv@lists.infradead.org \
--cc=palmer@dabbelt.com \
--cc=pjw@kernel.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox