summaryrefslogtreecommitdiffstats
path: root/src/spdk/dpdk/app/test/test_rib6.c
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-21 11:54:28 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-21 11:54:28 +0000
commite6918187568dbd01842d8d1d2c808ce16a894239 (patch)
tree64f88b554b444a49f656b6c656111a145cbbaa28 /src/spdk/dpdk/app/test/test_rib6.c
parentInitial commit. (diff)
downloadceph-e6918187568dbd01842d8d1d2c808ce16a894239.tar.xz
ceph-e6918187568dbd01842d8d1d2c808ce16a894239.zip
Adding upstream version 18.2.2.upstream/18.2.2
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'src/spdk/dpdk/app/test/test_rib6.c')
-rw-r--r--src/spdk/dpdk/app/test/test_rib6.c372
1 files changed, 372 insertions, 0 deletions
diff --git a/src/spdk/dpdk/app/test/test_rib6.c b/src/spdk/dpdk/app/test/test_rib6.c
new file mode 100644
index 000000000..c77df1129
--- /dev/null
+++ b/src/spdk/dpdk/app/test/test_rib6.c
@@ -0,0 +1,372 @@
+/* SPDX-License-Identifier: BSD-3-Clause
+ * Copyright(c) 2018 Vladimir Medvedkin <medvedkinv@gmail.com>
+ * Copyright(c) 2019 Intel Corporation
+ */
+
+#include <stdio.h>
+#include <stdint.h>
+#include <stdlib.h>
+
+#include <rte_ip.h>
+#include <rte_rib6.h>
+
+#include "test.h"
+
+typedef int32_t (*rte_rib6_test)(void);
+
+static int32_t test_create_invalid(void);
+static int32_t test_multiple_create(void);
+static int32_t test_free_null(void);
+static int32_t test_insert_invalid(void);
+static int32_t test_get_fn(void);
+static int32_t test_basic(void);
+static int32_t test_tree_traversal(void);
+
+#define MAX_DEPTH 128
+#define MAX_RULES (1 << 22)
+
+/*
+ * Check that rte_rib6_create fails gracefully for incorrect user input
+ * arguments
+ */
+int32_t
+test_create_invalid(void)
+{
+ struct rte_rib6 *rib = NULL;
+ struct rte_rib6_conf config;
+
+ config.max_nodes = MAX_RULES;
+ config.ext_sz = 0;
+
+ /* rte_rib6_create: rib name == NULL */
+ rib = rte_rib6_create(NULL, SOCKET_ID_ANY, &config);
+ RTE_TEST_ASSERT(rib == NULL,
+ "Call succeeded with invalid parameters\n");
+
+ /* rte_rib6_create: config == NULL */
+ rib = rte_rib6_create(__func__, SOCKET_ID_ANY, NULL);
+ RTE_TEST_ASSERT(rib == NULL,
+ "Call succeeded with invalid parameters\n");
+
+ /* socket_id < -1 is invalid */
+ rib = rte_rib6_create(__func__, -2, &config);
+ RTE_TEST_ASSERT(rib == NULL,
+ "Call succeeded with invalid parameters\n");
+
+ /* rte_rib6_create: max_nodes = 0 */
+ config.max_nodes = 0;
+ rib = rte_rib6_create(__func__, SOCKET_ID_ANY, &config);
+ RTE_TEST_ASSERT(rib == NULL,
+ "Call succeeded with invalid parameters\n");
+ config.max_nodes = MAX_RULES;
+
+ return TEST_SUCCESS;
+}
+
+/*
+ * Create rib table then delete rib table 10 times
+ * Use a slightly different rules size each time
+ */
+int32_t
+test_multiple_create(void)
+{
+ struct rte_rib6 *rib = NULL;
+ struct rte_rib6_conf config;
+ int32_t i;
+
+ config.ext_sz = 0;
+
+ for (i = 0; i < 100; i++) {
+ config.max_nodes = MAX_RULES - i;
+ rib = rte_rib6_create(__func__, SOCKET_ID_ANY, &config);
+ RTE_TEST_ASSERT(rib != NULL, "Failed to create RIB\n");
+ rte_rib6_free(rib);
+ }
+ /* Can not test free so return success */
+ return TEST_SUCCESS;
+}
+
+/*
+ * Call rte_rib6_free for NULL pointer user input. Note: free has no return and
+ * therefore it is impossible to check for failure but this test is added to
+ * increase function coverage metrics and to validate that freeing null does
+ * not crash.
+ */
+int32_t
+test_free_null(void)
+{
+ struct rte_rib6 *rib = NULL;
+ struct rte_rib6_conf config;
+
+ config.max_nodes = MAX_RULES;
+ config.ext_sz = 0;
+
+ rib = rte_rib6_create(__func__, SOCKET_ID_ANY, &config);
+ RTE_TEST_ASSERT(rib != NULL, "Failed to create RIB\n");
+
+ rte_rib6_free(rib);
+ rte_rib6_free(NULL);
+ return TEST_SUCCESS;
+}
+
+/*
+ * Check that rte_rib6_insert fails gracefully
+ * for incorrect user input arguments
+ */
+int32_t
+test_insert_invalid(void)
+{
+ struct rte_rib6 *rib = NULL;
+ struct rte_rib6_node *node, *node1;
+ struct rte_rib6_conf config;
+ uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE] = {0};
+ uint8_t depth = 24;
+
+ config.max_nodes = MAX_RULES;
+ config.ext_sz = 0;
+
+ /* rte_rib6_insert: rib == NULL */
+ node = rte_rib6_insert(NULL, ip, depth);
+ RTE_TEST_ASSERT(node == NULL,
+ "Call succeeded with invalid parameters\n");
+
+ /*Create valid rib to use in rest of test. */
+ rib = rte_rib6_create(__func__, SOCKET_ID_ANY, &config);
+ RTE_TEST_ASSERT(rib != NULL, "Failed to create RIB\n");
+
+ /* rte_rib6_insert: depth > MAX_DEPTH */
+ node = rte_rib6_insert(rib, ip, MAX_DEPTH + 1);
+ RTE_TEST_ASSERT(node == NULL,
+ "Call succeeded with invalid parameters\n");
+
+ /* insert the same ip/depth twice*/
+ node = rte_rib6_insert(rib, ip, depth);
+ RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");
+ node1 = rte_rib6_insert(rib, ip, depth);
+ RTE_TEST_ASSERT(node1 == NULL,
+ "Call succeeded with invalid parameters\n");
+
+ rte_rib6_free(rib);
+
+ return TEST_SUCCESS;
+}
+
+/*
+ * Call rte_rib6_node access functions with incorrect input.
+ * After call rte_rib6_node access functions with correct args
+ * and check the return values for correctness
+ */
+int32_t
+test_get_fn(void)
+{
+ struct rte_rib6 *rib = NULL;
+ struct rte_rib6_node *node;
+ struct rte_rib6_conf config;
+ void *ext;
+ uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE] = {192, 0, 2, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0};
+ uint8_t ip_ret[RTE_RIB6_IPV6_ADDR_SIZE];
+ uint64_t nh_set = 10;
+ uint64_t nh_ret;
+ uint8_t depth = 24;
+ uint8_t depth_ret;
+ int ret;
+
+ config.max_nodes = MAX_RULES;
+ config.ext_sz = 0;
+
+ rib = rte_rib6_create(__func__, SOCKET_ID_ANY, &config);
+ RTE_TEST_ASSERT(rib != NULL, "Failed to create RIB\n");
+
+ node = rte_rib6_insert(rib, ip, depth);
+ RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");
+
+ /* test rte_rib6_get_ip() with incorrect args */
+ ret = rte_rib6_get_ip(NULL, ip_ret);
+ RTE_TEST_ASSERT(ret < 0,
+ "Call succeeded with invalid parameters\n");
+ ret = rte_rib6_get_ip(node, NULL);
+ RTE_TEST_ASSERT(ret < 0,
+ "Call succeeded with invalid parameters\n");
+
+ /* test rte_rib6_get_depth() with incorrect args */
+ ret = rte_rib6_get_depth(NULL, &depth_ret);
+ RTE_TEST_ASSERT(ret < 0,
+ "Call succeeded with invalid parameters\n");
+ ret = rte_rib6_get_depth(node, NULL);
+ RTE_TEST_ASSERT(ret < 0,
+ "Call succeeded with invalid parameters\n");
+
+ /* test rte_rib6_set_nh() with incorrect args */
+ ret = rte_rib6_set_nh(NULL, nh_set);
+ RTE_TEST_ASSERT(ret < 0,
+ "Call succeeded with invalid parameters\n");
+
+ /* test rte_rib6_get_nh() with incorrect args */
+ ret = rte_rib6_get_nh(NULL, &nh_ret);
+ RTE_TEST_ASSERT(ret < 0,
+ "Call succeeded with invalid parameters\n");
+ ret = rte_rib6_get_nh(node, NULL);
+ RTE_TEST_ASSERT(ret < 0,
+ "Call succeeded with invalid parameters\n");
+
+ /* test rte_rib6_get_ext() with incorrect args */
+ ext = rte_rib6_get_ext(NULL);
+ RTE_TEST_ASSERT(ext == NULL,
+ "Call succeeded with invalid parameters\n");
+
+ /* check the return values */
+ ret = rte_rib6_get_ip(node, ip_ret);
+ RTE_TEST_ASSERT((ret == 0) && (rte_rib6_is_equal(ip_ret, ip)),
+ "Failed to get proper node ip\n");
+ ret = rte_rib6_get_depth(node, &depth_ret);
+ RTE_TEST_ASSERT((ret == 0) && (depth_ret == depth),
+ "Failed to get proper node depth\n");
+ ret = rte_rib6_set_nh(node, nh_set);
+ RTE_TEST_ASSERT(ret == 0,
+ "Failed to set rte_rib_node nexthop\n");
+ ret = rte_rib6_get_nh(node, &nh_ret);
+ RTE_TEST_ASSERT((ret == 0) && (nh_ret == nh_set),
+ "Failed to get proper nexthop\n");
+
+ rte_rib6_free(rib);
+
+ return TEST_SUCCESS;
+}
+
+/*
+ * Call insert, lookup/lookup_exact and delete for a single rule
+ */
+int32_t
+test_basic(void)
+{
+ struct rte_rib6 *rib = NULL;
+ struct rte_rib6_node *node;
+ struct rte_rib6_conf config;
+
+ uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE] = {192, 0, 2, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0};
+ uint64_t next_hop_add = 10;
+ uint64_t next_hop_return;
+ uint8_t depth = 24;
+ uint32_t status = 0;
+
+ config.max_nodes = MAX_RULES;
+ config.ext_sz = 0;
+
+ rib = rte_rib6_create(__func__, SOCKET_ID_ANY, &config);
+ RTE_TEST_ASSERT(rib != NULL, "Failed to create RIB\n");
+
+ node = rte_rib6_insert(rib, ip, depth);
+ RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");
+
+ status = rte_rib6_set_nh(node, next_hop_add);
+ RTE_TEST_ASSERT(status == 0,
+ "Failed to set rte_rib_node field\n");
+
+ node = rte_rib6_lookup(rib, ip);
+ RTE_TEST_ASSERT(node != NULL, "Failed to lookup\n");
+
+ status = rte_rib6_get_nh(node, &next_hop_return);
+ RTE_TEST_ASSERT((status == 0) && (next_hop_add == next_hop_return),
+ "Failed to get proper nexthop\n");
+
+ node = rte_rib6_lookup_exact(rib, ip, depth);
+ RTE_TEST_ASSERT(node != NULL,
+ "Failed to lookup\n");
+
+ status = rte_rib6_get_nh(node, &next_hop_return);
+ RTE_TEST_ASSERT((status == 0) && (next_hop_add == next_hop_return),
+ "Failed to get proper nexthop\n");
+
+ rte_rib6_remove(rib, ip, depth);
+
+ node = rte_rib6_lookup(rib, ip);
+ RTE_TEST_ASSERT(node == NULL,
+ "Lookup returns non existent rule\n");
+ node = rte_rib6_lookup_exact(rib, ip, depth);
+ RTE_TEST_ASSERT(node == NULL,
+ "Lookup returns non existent rule\n");
+
+ rte_rib6_free(rib);
+
+ return TEST_SUCCESS;
+}
+
+int32_t
+test_tree_traversal(void)
+{
+ struct rte_rib6 *rib = NULL;
+ struct rte_rib6_node *node;
+ struct rte_rib6_conf config;
+
+ uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE] = {10, 0, 2, 130, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0};
+ uint8_t ip1[RTE_RIB6_IPV6_ADDR_SIZE] = {10, 0, 2, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0};
+ uint8_t ip2[RTE_RIB6_IPV6_ADDR_SIZE] = {10, 0, 2, 130, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 80};
+ uint8_t depth = 126;
+
+ config.max_nodes = MAX_RULES;
+ config.ext_sz = 0;
+
+ rib = rte_rib6_create(__func__, SOCKET_ID_ANY, &config);
+ RTE_TEST_ASSERT(rib != NULL, "Failed to create RIB\n");
+
+ node = rte_rib6_insert(rib, ip1, depth);
+ RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");
+ node = rte_rib6_insert(rib, ip2, depth);
+ RTE_TEST_ASSERT(node != NULL, "Failed to insert rule\n");
+
+ node = NULL;
+ node = rte_rib6_get_nxt(rib, ip, 32, node, RTE_RIB6_GET_NXT_ALL);
+ RTE_TEST_ASSERT(node != NULL, "Failed to get rib_node\n");
+
+ rte_rib6_free(rib);
+
+ return TEST_SUCCESS;
+}
+
+static struct unit_test_suite rib6_tests = {
+ .suite_name = "rib6 autotest",
+ .setup = NULL,
+ .teardown = NULL,
+ .unit_test_cases = {
+ TEST_CASE(test_create_invalid),
+ TEST_CASE(test_free_null),
+ TEST_CASE(test_insert_invalid),
+ TEST_CASE(test_get_fn),
+ TEST_CASE(test_basic),
+ TEST_CASE(test_tree_traversal),
+ TEST_CASES_END()
+ }
+};
+
+static struct unit_test_suite rib6_slow_tests = {
+ .suite_name = "rib6 slow autotest",
+ .setup = NULL,
+ .teardown = NULL,
+ .unit_test_cases = {
+ TEST_CASE(test_multiple_create),
+ TEST_CASES_END()
+ }
+};
+
+/*
+ * Do all unit tests.
+ */
+static int
+test_rib6(void)
+{
+ return unit_test_suite_runner(&rib6_tests);
+}
+
+static int
+test_slow_rib6(void)
+{
+ return unit_test_suite_runner(&rib6_slow_tests);
+}
+
+REGISTER_TEST_COMMAND(rib6_autotest, test_rib6);
+REGISTER_TEST_COMMAND(rib6_slow_autotest, test_slow_rib6);