numam-dpdk/app/test/test_string_fns.c
Bruce Richardson a9de470cc7 test: move to app directory
Since all other apps have been moved to the "app" folder, the autotest app
remains alone in the test folder. Rather than having an entire top-level
folder for this, we can move it back to where it all started in early
versions of DPDK - the "app/" folder.

This move has a couple of advantages:
* This reduces clutter at the top level of the project, due to one less
  folder.
* It eliminates the separate build task necessary for building the
  autotests using make "make test-build" which means that developers are
  less likely to miss something in their own compilation tests
* It re-aligns the final location of the test binary in the app folder when
  building with make with it's location in the source tree.

For meson builds, the autotest app is different from the other apps in that
it needs a series of different test cases defined for it for use by "meson
test". Therefore, it does not get built as part of the main loop in the
app folder, but gets built separately at the end.

Signed-off-by: Bruce Richardson <bruce.richardson@intel.com>
2019-02-26 15:29:27 +01:00

186 lines
4.9 KiB
C

/* SPDX-License-Identifier: BSD-3-Clause
* Copyright(c) 2010-2014 Intel Corporation
*/
#include <stdio.h>
#include <stdarg.h>
#include <stddef.h>
#include <errno.h>
#include <string.h>
#include <rte_string_fns.h>
#include "test.h"
#define LOG(...) do {\
fprintf(stderr, "%s() ln %d: ", __func__, __LINE__); \
fprintf(stderr, __VA_ARGS__); \
} while(0)
#define DATA_BYTE 'a'
static int
test_rte_strsplit(void)
{
int i;
do {
/* =======================================================
* split a mac address correct number of splits requested
* =======================================================*/
char test_string[] = "54:65:76:87:98:90";
char *splits[6];
LOG("Source string: '%s', to split on ':'\n", test_string);
if (rte_strsplit(test_string, sizeof(test_string),
splits, 6, ':') != 6) {
LOG("Error splitting mac address\n");
return -1;
}
for (i = 0; i < 6; i++)
LOG("Token %d = %s\n", i + 1, splits[i]);
} while (0);
do {
/* =======================================================
* split on spaces smaller number of splits requested
* =======================================================*/
char test_string[] = "54 65 76 87 98 90";
char *splits[6];
LOG("Source string: '%s', to split on ' '\n", test_string);
if (rte_strsplit(test_string, sizeof(test_string),
splits, 3, ' ') != 3) {
LOG("Error splitting mac address for max 2 splits\n");
return -1;
}
for (i = 0; i < 3; i++)
LOG("Token %d = %s\n", i + 1, splits[i]);
} while (0);
do {
/* =======================================================
* split on commas - more splits than commas requested
* =======================================================*/
char test_string[] = "a,b,c,d";
char *splits[6];
LOG("Source string: '%s', to split on ','\n", test_string);
if (rte_strsplit(test_string, sizeof(test_string),
splits, 6, ',') != 4) {
LOG("Error splitting %s on ','\n", test_string);
return -1;
}
for (i = 0; i < 4; i++)
LOG("Token %d = %s\n", i + 1, splits[i]);
} while(0);
do {
/* =======================================================
* Try splitting on non-existent character.
* =======================================================*/
char test_string[] = "a,b,c,d";
char *splits[6];
LOG("Source string: '%s', to split on ' '\n", test_string);
if (rte_strsplit(test_string, sizeof(test_string),
splits, 6, ' ') != 1) {
LOG("Error splitting %s on ' '\n", test_string);
return -1;
}
LOG("String not split\n");
} while(0);
do {
/* =======================================================
* Invalid / edge case parameter checks
* =======================================================*/
char test_string[] = "a,b,c,d";
char *splits[6];
if (rte_strsplit(NULL, 0, splits, 6, ',') >= 0
|| errno != EINVAL){
LOG("Error: rte_strsplit accepted NULL string parameter\n");
return -1;
}
if (rte_strsplit(test_string, sizeof(test_string), NULL, 0, ',') >= 0
|| errno != EINVAL){
LOG("Error: rte_strsplit accepted NULL array parameter\n");
return -1;
}
errno = 0;
if (rte_strsplit(test_string, 0, splits, 6, ',') != 0 || errno != 0) {
LOG("Error: rte_strsplit did not accept 0 length string\n");
return -1;
}
if (rte_strsplit(test_string, sizeof(test_string), splits, 0, ',') != 0
|| errno != 0) {
LOG("Error: rte_strsplit did not accept 0 length array\n");
return -1;
}
LOG("Parameter test cases passed\n");
} while(0);
LOG("%s - PASSED\n", __func__);
return 0;
}
static int
test_rte_strlcat(void)
{
/* only run actual unit tests if we have system-provided strlcat */
#if defined(__BSD_VISIBLE) || defined(RTE_USE_LIBBSD)
#define BUF_LEN 32
const char dst[BUF_LEN] = "Test string";
const char src[] = " appended";
char bsd_dst[BUF_LEN];
char rte_dst[BUF_LEN];
size_t i, bsd_ret, rte_ret;
LOG("dst = '%s', strlen(dst) = %zu\n", dst, strlen(dst));
LOG("src = '%s', strlen(src) = %zu\n", src, strlen(src));
LOG("---\n");
for (i = 0; i < BUF_LEN; i++) {
/* initialize destination buffers */
memcpy(bsd_dst, dst, BUF_LEN);
memcpy(rte_dst, dst, BUF_LEN);
/* compare implementations */
bsd_ret = strlcat(bsd_dst, src, i);
rte_ret = rte_strlcat(rte_dst, src, i);
if (bsd_ret != rte_ret) {
LOG("Incorrect retval for buf length = %zu\n", i);
LOG("BSD: '%zu', rte: '%zu'\n", bsd_ret, rte_ret);
return -1;
}
if (memcmp(bsd_dst, rte_dst, BUF_LEN) != 0) {
LOG("Resulting buffers don't match\n");
LOG("BSD: '%s', rte: '%s'\n", bsd_dst, rte_dst);
return -1;
}
LOG("buffer size = %zu: dst = '%s', ret = %zu\n",
i, rte_dst, rte_ret);
}
LOG("Checked %zu combinations\n", i);
#undef BUF_LEN
#endif /* defined(__BSD_VISIBLE) || defined(RTE_USE_LIBBSD) */
return 0;
}
static int
test_string_fns(void)
{
if (test_rte_strsplit() < 0)
return -1;
if (test_rte_strlcat() < 0)
return -1;
return 0;
}
REGISTER_TEST_COMMAND(string_autotest, test_string_fns);