From: Vladimir Medvedkin <vladimir.medvedkin@intel.com>
To: dev@dpdk.org
Cc: stephen@networkplumber.org, Yipeng Wang <yipeng1.wang@intel.com>,
Sameh Gobriel <sameh.gobriel@intel.com>,
Bruce Richardson <bruce.richardson@intel.com>
Subject: [PATCH v3 4/4] test/thash: add tests for RSS key generation API
Date: Fri, 11 Oct 2024 18:17:02 +0000 [thread overview]
Message-ID: <20241011181703.236985-5-vladimir.medvedkin@intel.com> (raw)
In-Reply-To: <20241011181703.236985-1-vladimir.medvedkin@intel.com>
This patch adds tests for RSS key generation. In this test we measure
distribution of hash LSBs for a given random tuple where only some part
of bits is variable.
At first we generate random hash key and measure the worst distribution
for a given ReTa size value (RETA_SZ_LOG). Then we adjust the key with
the new API and run the test again, noting the new distribution. Finally,
we also measure said distribution for some well known RSS hash key which
is used in some PMDs.
Signed-off-by: Vladimir Medvedkin <vladimir.medvedkin@intel.com>
---
app/test/test_thash.c | 108 ++++++++++++++++++++++++++++++++++++++++++
1 file changed, 108 insertions(+)
diff --git a/app/test/test_thash.c b/app/test/test_thash.c
index 65d42fd900..fca2ba03dd 100644
--- a/app/test/test_thash.c
+++ b/app/test/test_thash.c
@@ -7,6 +7,7 @@
#include <rte_ip.h>
#include <rte_random.h>
#include <rte_malloc.h>
+#include <rte_byteorder.h>
#include "test.h"
@@ -935,6 +936,112 @@ test_adjust_tuple_mult_reta(void)
return TEST_SUCCESS;
}
+#define RETA_SZ_LOG 11
+#define RSS_KEY_SZ 40
+#define RETA_SZ (1 << RETA_SZ_LOG)
+#define NB_HASH_ITER RETA_SZ
+#define NB_TEST_ITER 10
+
+static inline void
+run_hash_calc_loop(uint8_t *key, union rte_thash_tuple *tuple,
+ unsigned int *rss_reta_hits)
+{
+ uint32_t rss_hash;
+ int i;
+
+ for (i = 0; i < NB_HASH_ITER; i++) {
+ /* variable part starts from the most significant bit */
+ tuple->v4.dport = (i << (sizeof(tuple->v4.dport) * CHAR_BIT -
+ RETA_SZ_LOG));
+ /*
+ * swap sport and dport on LE arch since rte_softrss()
+ * works with host byte order uint32_t values
+ */
+ tuple->v4.dport = rte_cpu_to_be_16(tuple->v4.dport);
+ tuple->v4.sctp_tag = rte_be_to_cpu_32(tuple->v4.sctp_tag);
+ rss_hash = rte_softrss((uint32_t *)tuple,
+ RTE_THASH_V4_L4_LEN, key);
+ /* unroll swap, required only for sport */
+ tuple->v4.sctp_tag = rte_cpu_to_be_32(tuple->v4.sctp_tag);
+ rss_reta_hits[rss_hash & (RETA_SZ - 1)]++;
+ }
+}
+
+static int
+hash_calc_iteration(unsigned int *min_before, unsigned int *max_before,
+ unsigned int *min_after, unsigned int *max_after,
+ unsigned int *min_default, unsigned int *max_default)
+{
+ uint8_t key[RSS_KEY_SZ] = {0};
+ union rte_thash_tuple tuple;
+ unsigned int rss_reta_hits_before_adjust[RETA_SZ] = {0};
+ unsigned int rss_reta_hits_after_adjust[RETA_SZ] = {0};
+ unsigned int rss_reta_hits_default_key[RETA_SZ] = {0};
+ int i;
+
+ for (i = 0; i < RSS_KEY_SZ; i++)
+ key[i] = rte_rand();
+
+ tuple.v4.src_addr = rte_rand();
+ tuple.v4.dst_addr = rte_rand();
+ tuple.v4.sport = rte_rand();
+
+ run_hash_calc_loop(key, &tuple, rss_reta_hits_before_adjust);
+
+ int ret = rte_thash_gen_key(key, RSS_KEY_SZ, RETA_SZ_LOG,
+ offsetof(union rte_thash_tuple, v4.dport)*CHAR_BIT,
+ RETA_SZ_LOG);
+
+ if (ret) {
+ printf("Can't generate key\n");
+ return -1;
+ }
+
+ run_hash_calc_loop(key, &tuple, rss_reta_hits_after_adjust);
+
+ run_hash_calc_loop(default_rss_key, &tuple, rss_reta_hits_default_key);
+
+ for (i = 0; i < RETA_SZ; i++) {
+ *min_before = RTE_MIN(*min_before, rss_reta_hits_before_adjust[i]);
+ *max_before = RTE_MAX(*max_before, rss_reta_hits_before_adjust[i]);
+ *min_after = RTE_MIN(*min_after, rss_reta_hits_after_adjust[i]);
+ *max_after = RTE_MAX(*max_after, rss_reta_hits_after_adjust[i]);
+ *min_default = RTE_MIN(*min_default, rss_reta_hits_default_key[i]);
+ *max_default = RTE_MAX(*max_default, rss_reta_hits_default_key[i]);
+ }
+
+ return 0;
+}
+
+static int
+test_keygen(void)
+{
+ int i, ret;
+ unsigned int min_before = UINT32_MAX;
+ unsigned int min_after = UINT32_MAX;
+ unsigned int min_default = UINT32_MAX;
+ unsigned int max_before = 0;
+ unsigned int max_after = 0;
+ unsigned int max_default = 0;
+
+ for (i = 0; i < NB_TEST_ITER; i++) {
+ /* calculates the worst distribution for each key */
+ ret = hash_calc_iteration(&min_before, &max_before, &min_after,
+ &max_after, &min_default, &max_default);
+ if (ret)
+ return ret;
+ }
+
+ printf("RSS before key adjustment: min=%d, max=%d\n",
+ min_before, max_before);
+ printf("RSS after key adjustment: min=%d, max=%d\n",
+ min_after, max_after);
+ printf("RSS default key: min=%d, max=%d\n",
+ min_default, max_default);
+
+ return TEST_SUCCESS;
+}
+
static struct unit_test_suite thash_tests = {
.suite_name = "thash autotest",
.setup = NULL,
@@ -956,6 +1063,7 @@ static struct unit_test_suite thash_tests = {
TEST_CASE(test_predictable_rss_multirange),
TEST_CASE(test_adjust_tuple),
TEST_CASE(test_adjust_tuple_mult_reta),
+ TEST_CASE(test_keygen),
TEST_CASES_END()
}
};
--
2.43.0
next prev parent reply other threads:[~2024-10-11 18:17 UTC|newest]
Thread overview: 25+ messages / expand[flat|nested] mbox.gz Atom feed top
2024-10-10 12:33 [PATCH v2 0/4] RSS hash key generation Vladimir Medvedkin
2024-10-10 12:33 ` [PATCH v2 1/4] thash: add RSS hash key generation API Vladimir Medvedkin
2024-10-10 15:04 ` Stephen Hemminger
2024-10-10 12:33 ` [PATCH v2 2/4] hash: add dynamic polynomial calculation Vladimir Medvedkin
2024-10-10 12:33 ` [PATCH v2 3/4] hash: implement RSS hash key generation API Vladimir Medvedkin
2024-10-10 12:33 ` [PATCH v2 4/4] test/thash: add tests for RSS " Vladimir Medvedkin
2024-10-11 18:16 ` [PATCH v3 0/4] RSS hash key generation Vladimir Medvedkin
2024-10-11 18:16 ` [PATCH v3 1/4] thash: add RSS hash key generation API Vladimir Medvedkin
2024-10-11 18:17 ` [PATCH v3 2/4] hash: add dynamic polynomial calculation Vladimir Medvedkin
2024-10-15 22:29 ` Stephen Hemminger
2024-10-16 16:28 ` Medvedkin, Vladimir
2024-10-17 3:23 ` Stephen Hemminger
2024-10-18 13:42 ` Medvedkin, Vladimir
2024-10-11 18:17 ` [PATCH v3 3/4] hash: implement RSS hash key generation API Vladimir Medvedkin
2024-10-11 18:17 ` Vladimir Medvedkin [this message]
2024-10-24 18:46 ` [PATCH v4 0/4] RSS hash key generation Vladimir Medvedkin
2024-10-24 18:46 ` [PATCH v4 1/4] thash: add RSS hash key generation API Vladimir Medvedkin
2024-10-24 19:05 ` Stephen Hemminger
2024-10-24 18:46 ` [PATCH v4 2/4] hash: add dynamic polynomial calculation Vladimir Medvedkin
2024-10-24 19:06 ` Stephen Hemminger
2024-10-24 18:46 ` [PATCH v4 3/4] hash: implement RSS hash key generation API Vladimir Medvedkin
2024-10-24 19:06 ` Stephen Hemminger
2024-10-24 18:46 ` [PATCH v4 4/4] test/thash: add tests for RSS " Vladimir Medvedkin
2024-10-24 19:06 ` Stephen Hemminger
2024-11-11 12:55 ` [PATCH v4 0/4] RSS hash key generation Thomas Monjalon
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=20241011181703.236985-5-vladimir.medvedkin@intel.com \
--to=vladimir.medvedkin@intel.com \
--cc=bruce.richardson@intel.com \
--cc=dev@dpdk.org \
--cc=sameh.gobriel@intel.com \
--cc=stephen@networkplumber.org \
--cc=yipeng1.wang@intel.com \
/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;
as well as URLs for NNTP newsgroup(s).