2017-12-19 15:49:05 +00:00
|
|
|
/* SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
* Copyright(c) 2010-2014 Intel Corporation
|
2013-06-03 00:00:00 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
2018-04-04 13:20:16 +00:00
|
|
|
#include <inttypes.h>
|
2013-06-03 00:00:00 +00:00
|
|
|
#include <string.h>
|
2017-07-06 14:20:24 +00:00
|
|
|
#include <math.h>
|
2013-06-03 00:00:00 +00:00
|
|
|
#include <rte_common.h>
|
|
|
|
#include <rte_hexdump.h>
|
2017-06-05 08:58:43 +00:00
|
|
|
#include <rte_pause.h>
|
2013-06-03 00:00:00 +00:00
|
|
|
|
|
|
|
#include "test.h"
|
|
|
|
|
|
|
|
#define MAX_NUM 1 << 20
|
|
|
|
|
|
|
|
#define FAIL(x)\
|
|
|
|
{printf(x "() test failed!\n");\
|
|
|
|
return -1;}
|
|
|
|
|
|
|
|
/* this is really a sanity check */
|
|
|
|
static int
|
|
|
|
test_macros(int __rte_unused unused_parm)
|
|
|
|
{
|
|
|
|
#define SMALLER 0x1000U
|
|
|
|
#define BIGGER 0x2000U
|
|
|
|
#define PTR_DIFF BIGGER - SMALLER
|
|
|
|
|
|
|
|
uintptr_t unused = 0;
|
2021-07-28 15:21:42 +00:00
|
|
|
unsigned int smaller = SMALLER, bigger = BIGGER;
|
2022-08-27 11:32:19 +00:00
|
|
|
uint32_t arr[3];
|
2013-06-03 00:00:00 +00:00
|
|
|
|
|
|
|
RTE_SET_USED(unused);
|
|
|
|
|
2021-07-28 15:21:42 +00:00
|
|
|
RTE_SWAP(smaller, bigger);
|
2022-08-27 11:32:19 +00:00
|
|
|
RTE_TEST_ASSERT(smaller == BIGGER && bigger == SMALLER,
|
|
|
|
"RTE_SWAP");
|
|
|
|
RTE_TEST_ASSERT_EQUAL((uintptr_t)RTE_PTR_ADD(SMALLER, PTR_DIFF), BIGGER,
|
|
|
|
"RTE_PTR_ADD");
|
|
|
|
RTE_TEST_ASSERT_EQUAL((uintptr_t)RTE_PTR_SUB(BIGGER, PTR_DIFF), SMALLER,
|
|
|
|
"RTE_PTR_SUB");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(RTE_PTR_DIFF(BIGGER, SMALLER), PTR_DIFF,
|
|
|
|
"RTE_PTR_DIFF");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(RTE_MAX(SMALLER, BIGGER), BIGGER,
|
|
|
|
"RTE_MAX");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(RTE_MIN(SMALLER, BIGGER), SMALLER,
|
|
|
|
"RTE_MIN");
|
|
|
|
|
|
|
|
RTE_TEST_ASSERT_EQUAL(RTE_PTR_ADD(arr + 1, sizeof(arr[0])), &arr[2],
|
|
|
|
"RTE_PTR_ADD(expr, x)");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(RTE_PTR_SUB(arr + 1, sizeof(arr[0])), &arr[0],
|
|
|
|
"RTE_PTR_SUB(expr, x)");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(RTE_PTR_ALIGN_FLOOR(arr + 2, 4), &arr[2],
|
|
|
|
"RTE_PTR_ALIGN_FLOOR(expr, x)");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(RTE_PTR_ALIGN_CEIL(arr + 2, 4), &arr[2],
|
|
|
|
"RTE_PTR_ALIGN_CEIL(expr, x)");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(RTE_PTR_ALIGN(arr + 2, 4), &arr[2],
|
|
|
|
"RTE_PTR_ALIGN(expr, x)");
|
|
|
|
|
|
|
|
RTE_TEST_ASSERT_EQUAL(
|
|
|
|
RTE_PTR_ALIGN_FLOOR(RTE_PTR_ADD(&arr[1], 1), 4), &arr[1],
|
|
|
|
"RTE_PTR_ALIGN_FLOOR(x < y/2, y)");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(
|
|
|
|
RTE_PTR_ALIGN_FLOOR(RTE_PTR_ADD(&arr[1], 3), 4), &arr[1],
|
|
|
|
"RTE_PTR_ALIGN_FLOOR(x > y/2, y)");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(
|
|
|
|
RTE_PTR_ALIGN_CEIL(RTE_PTR_ADD(&arr[1], 3), 4), &arr[2],
|
|
|
|
"RTE_PTR_ALIGN_CEIL(x < y/2, y)");
|
|
|
|
RTE_TEST_ASSERT_EQUAL(
|
|
|
|
RTE_PTR_ALIGN_CEIL(RTE_PTR_ADD(&arr[1], 1), 4), &arr[2],
|
|
|
|
"RTE_PTR_ALIGN_CEIL(x > y/2, y)");
|
|
|
|
|
|
|
|
RTE_TEST_ASSERT(strncmp(RTE_STR(test), "test", sizeof("test")) == 0,
|
|
|
|
"RTE_STR");
|
2013-06-03 00:00:00 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-12-20 12:09:48 +00:00
|
|
|
static int
|
|
|
|
test_bsf(void)
|
|
|
|
{
|
|
|
|
uint32_t shift, pos;
|
|
|
|
|
|
|
|
/* safe versions should be able to handle 0 */
|
|
|
|
if (rte_bsf32_safe(0, &pos) != 0)
|
|
|
|
FAIL("rte_bsf32_safe");
|
|
|
|
if (rte_bsf64_safe(0, &pos) != 0)
|
|
|
|
FAIL("rte_bsf64_safe");
|
|
|
|
|
|
|
|
for (shift = 0; shift < 63; shift++) {
|
|
|
|
uint32_t val32;
|
|
|
|
uint64_t val64;
|
|
|
|
|
|
|
|
val64 = 1ULL << shift;
|
|
|
|
if ((uint32_t)rte_bsf64(val64) != shift)
|
|
|
|
FAIL("rte_bsf64");
|
|
|
|
if (rte_bsf64_safe(val64, &pos) != 1)
|
|
|
|
FAIL("rte_bsf64_safe");
|
|
|
|
if (pos != shift)
|
|
|
|
FAIL("rte_bsf64_safe");
|
|
|
|
|
|
|
|
if (shift > 31)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
val32 = 1U << shift;
|
|
|
|
if ((uint32_t)rte_bsf32(val32) != shift)
|
|
|
|
FAIL("rte_bsf32");
|
|
|
|
if (rte_bsf32_safe(val32, &pos) != 1)
|
|
|
|
FAIL("rte_bsf32_safe");
|
|
|
|
if (pos != shift)
|
|
|
|
FAIL("rte_bsf32_safe");
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-06-03 00:00:00 +00:00
|
|
|
static int
|
|
|
|
test_misc(void)
|
|
|
|
{
|
|
|
|
char memdump[] = "memdump_test";
|
|
|
|
|
2014-05-02 23:42:56 +00:00
|
|
|
rte_memdump(stdout, "test", memdump, sizeof(memdump));
|
|
|
|
rte_hexdump(stdout, "test", memdump, sizeof(memdump));
|
2013-06-03 00:00:00 +00:00
|
|
|
|
|
|
|
rte_pause();
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
test_align(void)
|
|
|
|
{
|
|
|
|
#define FAIL_ALIGN(x, i, p)\
|
|
|
|
{printf(x "() test failed: %u %u\n", i, p);\
|
|
|
|
return -1;}
|
2018-04-04 13:20:16 +00:00
|
|
|
#define FAIL_ALIGN64(x, j, q)\
|
|
|
|
{printf(x "() test failed: %"PRIu64" %"PRIu64"\n", j, q);\
|
|
|
|
return -1; }
|
2013-06-03 00:00:00 +00:00
|
|
|
#define ERROR_FLOOR(res, i, pow) \
|
|
|
|
(res % pow) || /* check if not aligned */ \
|
|
|
|
((res / pow) != (i / pow)) /* check if correct alignment */
|
|
|
|
#define ERROR_CEIL(res, i, pow) \
|
|
|
|
(res % pow) || /* check if not aligned */ \
|
|
|
|
((i % pow) == 0 ? /* check if ceiling is invoked */ \
|
|
|
|
val / pow != i / pow : /* if aligned */ \
|
|
|
|
val / pow != (i / pow) + 1) /* if not aligned, hence +1 */
|
|
|
|
|
|
|
|
uint32_t i, p, val;
|
2018-04-04 13:20:16 +00:00
|
|
|
uint64_t j, q;
|
2013-06-03 00:00:00 +00:00
|
|
|
|
|
|
|
for (i = 1, p = 1; i <= MAX_NUM; i ++) {
|
|
|
|
if (rte_align32pow2(i) != p)
|
|
|
|
FAIL_ALIGN("rte_align32pow2", i, p);
|
|
|
|
if (i == p)
|
|
|
|
p <<= 1;
|
|
|
|
}
|
|
|
|
|
2018-04-04 13:20:16 +00:00
|
|
|
for (i = 1, p = 1; i <= MAX_NUM; i++) {
|
|
|
|
if (rte_align32prevpow2(i) != p)
|
|
|
|
FAIL_ALIGN("rte_align32prevpow2", i, p);
|
|
|
|
if (rte_is_power_of_2(i + 1))
|
|
|
|
p = i + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (j = 1, q = 1; j <= MAX_NUM ; j++) {
|
|
|
|
if (rte_align64pow2(j) != q)
|
|
|
|
FAIL_ALIGN64("rte_align64pow2", j, q);
|
|
|
|
if (j == q)
|
|
|
|
q <<= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (j = 1, q = 1; j <= MAX_NUM ; j++) {
|
|
|
|
if (rte_align64prevpow2(j) != q)
|
|
|
|
FAIL_ALIGN64("rte_align64prevpow2", j, q);
|
|
|
|
if (rte_is_power_of_2(j + 1))
|
|
|
|
q = j + 1;
|
|
|
|
}
|
|
|
|
|
2013-06-03 00:00:00 +00:00
|
|
|
for (p = 2; p <= MAX_NUM; p <<= 1) {
|
|
|
|
|
|
|
|
if (!rte_is_power_of_2(p))
|
|
|
|
FAIL("rte_is_power_of_2");
|
|
|
|
|
|
|
|
for (i = 1; i <= MAX_NUM; i++) {
|
|
|
|
/* align floor */
|
2015-03-16 17:05:06 +00:00
|
|
|
if (RTE_ALIGN_FLOOR((uintptr_t)i, p) % p)
|
|
|
|
FAIL_ALIGN("RTE_ALIGN_FLOOR", i, p);
|
2013-06-03 00:00:00 +00:00
|
|
|
|
|
|
|
val = RTE_PTR_ALIGN_FLOOR((uintptr_t) i, p);
|
|
|
|
if (ERROR_FLOOR(val, i, p))
|
|
|
|
FAIL_ALIGN("RTE_PTR_ALIGN_FLOOR", i, p);
|
|
|
|
|
|
|
|
val = RTE_ALIGN_FLOOR(i, p);
|
|
|
|
if (ERROR_FLOOR(val, i, p))
|
|
|
|
FAIL_ALIGN("RTE_ALIGN_FLOOR", i, p);
|
|
|
|
|
|
|
|
/* align ceiling */
|
|
|
|
val = RTE_PTR_ALIGN((uintptr_t) i, p);
|
|
|
|
if (ERROR_CEIL(val, i, p))
|
|
|
|
FAIL_ALIGN("RTE_PTR_ALIGN", i, p);
|
|
|
|
|
|
|
|
val = RTE_ALIGN(i, p);
|
|
|
|
if (ERROR_CEIL(val, i, p))
|
|
|
|
FAIL_ALIGN("RTE_ALIGN", i, p);
|
|
|
|
|
|
|
|
val = RTE_ALIGN_CEIL(i, p);
|
|
|
|
if (ERROR_CEIL(val, i, p))
|
|
|
|
FAIL_ALIGN("RTE_ALIGN_CEIL", i, p);
|
|
|
|
|
|
|
|
val = RTE_PTR_ALIGN_CEIL((uintptr_t)i, p);
|
|
|
|
if (ERROR_CEIL(val, i, p))
|
|
|
|
FAIL_ALIGN("RTE_PTR_ALIGN_CEIL", i, p);
|
|
|
|
|
|
|
|
/* by this point we know that val is aligned to p */
|
|
|
|
if (!rte_is_aligned((void*)(uintptr_t) val, p))
|
|
|
|
FAIL("rte_is_aligned");
|
|
|
|
}
|
|
|
|
}
|
2018-03-20 13:24:34 +00:00
|
|
|
|
|
|
|
for (p = 1; p <= MAX_NUM / 2; p++) {
|
|
|
|
for (i = 1; i <= MAX_NUM / 2; i++) {
|
|
|
|
val = RTE_ALIGN_MUL_CEIL(i, p);
|
|
|
|
if (val % p != 0 || val < i)
|
|
|
|
FAIL_ALIGN("RTE_ALIGN_MUL_CEIL", i, p);
|
|
|
|
val = RTE_ALIGN_MUL_FLOOR(i, p);
|
|
|
|
if (val % p != 0 || val > i)
|
|
|
|
FAIL_ALIGN("RTE_ALIGN_MUL_FLOOR", i, p);
|
2019-03-16 19:01:50 +00:00
|
|
|
val = RTE_ALIGN_MUL_NEAR(i, p);
|
|
|
|
if (val % p != 0 || ((val != RTE_ALIGN_MUL_CEIL(i, p))
|
|
|
|
& (val != RTE_ALIGN_MUL_FLOOR(i, p))))
|
|
|
|
FAIL_ALIGN("RTE_ALIGN_MUL_NEAR", i, p);
|
2018-03-20 13:24:34 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-06-03 00:00:00 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-07-06 14:20:24 +00:00
|
|
|
static int
|
|
|
|
test_log2(void)
|
|
|
|
{
|
|
|
|
uint32_t i, base, compare;
|
|
|
|
const uint32_t max = 0x10000;
|
|
|
|
const uint32_t step = 1;
|
|
|
|
|
2019-12-20 14:01:49 +00:00
|
|
|
compare = rte_log2_u32(0);
|
|
|
|
if (compare != 0) {
|
|
|
|
printf("Wrong rte_log2_u32(0) val %x, expected 0\n", compare);
|
|
|
|
return TEST_FAILED;
|
|
|
|
}
|
|
|
|
|
|
|
|
compare = rte_log2_u64(0);
|
|
|
|
if (compare != 0) {
|
|
|
|
printf("Wrong rte_log2_u64(0) val %x, expected 0\n", compare);
|
|
|
|
return TEST_FAILED;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 1; i < max; i = i + step) {
|
2018-12-20 12:09:50 +00:00
|
|
|
uint64_t i64;
|
|
|
|
|
|
|
|
/* extend range for 64-bit */
|
|
|
|
i64 = (uint64_t)i << 32;
|
|
|
|
base = (uint32_t)ceilf(log2(i64));
|
|
|
|
compare = rte_log2_u64(i64);
|
|
|
|
if (base != compare) {
|
|
|
|
printf("Wrong rte_log2_u64(%" PRIx64 ") val %x, expected %x\n",
|
|
|
|
i64, compare, base);
|
|
|
|
return TEST_FAILED;
|
|
|
|
}
|
|
|
|
|
2017-07-06 14:20:24 +00:00
|
|
|
base = (uint32_t)ceilf(log2((uint32_t)i));
|
2018-12-20 12:09:50 +00:00
|
|
|
compare = rte_log2_u32((uint32_t)i);
|
2017-07-06 14:20:24 +00:00
|
|
|
if (base != compare) {
|
|
|
|
printf("Wrong rte_log2_u32(%x) val %x, expected %x\n",
|
|
|
|
i, compare, base);
|
|
|
|
return TEST_FAILED;
|
|
|
|
}
|
2018-12-20 12:09:50 +00:00
|
|
|
compare = rte_log2_u64((uint64_t)i);
|
|
|
|
if (base != compare) {
|
|
|
|
printf("Wrong rte_log2_u64(%x) val %x, expected %x\n",
|
|
|
|
i, compare, base);
|
|
|
|
return TEST_FAILED;
|
|
|
|
}
|
2017-07-06 14:20:24 +00:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-11-07 06:59:03 +00:00
|
|
|
static int
|
|
|
|
test_fls(void)
|
|
|
|
{
|
|
|
|
struct fls_test_vector {
|
|
|
|
uint32_t arg;
|
|
|
|
int rc;
|
|
|
|
};
|
|
|
|
int expected, rc;
|
|
|
|
uint32_t i, arg;
|
|
|
|
|
|
|
|
const struct fls_test_vector test[] = {
|
|
|
|
{0x0, 0},
|
|
|
|
{0x1, 1},
|
|
|
|
{0x4000, 15},
|
|
|
|
{0x80000000, 32},
|
|
|
|
};
|
|
|
|
|
|
|
|
for (i = 0; i < RTE_DIM(test); i++) {
|
2018-12-20 12:09:49 +00:00
|
|
|
uint64_t arg64;
|
|
|
|
|
2018-11-07 06:59:03 +00:00
|
|
|
arg = test[i].arg;
|
|
|
|
rc = rte_fls_u32(arg);
|
|
|
|
expected = test[i].rc;
|
|
|
|
if (rc != expected) {
|
|
|
|
printf("Wrong rte_fls_u32(0x%x) rc=%d, expected=%d\n",
|
|
|
|
arg, rc, expected);
|
|
|
|
return TEST_FAILED;
|
|
|
|
}
|
2018-12-20 12:09:49 +00:00
|
|
|
/* 64-bit version */
|
|
|
|
arg = test[i].arg;
|
|
|
|
rc = rte_fls_u64(arg);
|
|
|
|
expected = test[i].rc;
|
|
|
|
if (rc != expected) {
|
|
|
|
printf("Wrong rte_fls_u64(0x%x) rc=%d, expected=%d\n",
|
|
|
|
arg, rc, expected);
|
|
|
|
return TEST_FAILED;
|
|
|
|
}
|
|
|
|
/* 64-bit version shifted by 32 bits */
|
|
|
|
arg64 = (uint64_t)test[i].arg << 32;
|
|
|
|
rc = rte_fls_u64(arg64);
|
|
|
|
/* don't shift zero */
|
|
|
|
expected = test[i].rc == 0 ? 0 : test[i].rc + 32;
|
|
|
|
if (rc != expected) {
|
|
|
|
printf("Wrong rte_fls_u64(0x%" PRIx64 ") rc=%d, expected=%d\n",
|
|
|
|
arg64, rc, expected);
|
|
|
|
return TEST_FAILED;
|
|
|
|
}
|
2018-11-07 06:59:03 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-08-18 11:29:23 +00:00
|
|
|
static int
|
2013-06-03 00:00:00 +00:00
|
|
|
test_common(void)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
ret |= test_align();
|
|
|
|
ret |= test_macros(0);
|
|
|
|
ret |= test_misc();
|
2018-12-20 12:09:48 +00:00
|
|
|
ret |= test_bsf();
|
2017-07-06 14:20:24 +00:00
|
|
|
ret |= test_log2();
|
2018-11-07 06:59:03 +00:00
|
|
|
ret |= test_fls();
|
2013-06-03 00:00:00 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2014-08-18 11:29:23 +00:00
|
|
|
|
2016-07-13 12:38:13 +00:00
|
|
|
REGISTER_TEST_COMMAND(common_autotest, test_common);
|