This change introduces loadable fib lookup modules based on DPDK rte_lpm lib targeted for high-speed lookups in large-scale tables. It is based on the lookup framework described in D27401. IPv4 module is called dpdk_lpm4. It wraps around rte_lpm [1] library. This library implements variation of DIR24-8 [2] lookup algorithm. Module provide lockless route lookups and in-place incremental updates, allowing for good RIB performance. IPv6 module is called dpdk_lpm6. It wraps around rte_lpm6 [3] library. Implementation can be seen as multi-bit trie where the stride or number of bits inspected on each level varies from level to level. It can vary from 1 to 14 memory accesses, with 5 being the average value for the lengths that are most commonly used in IPv6. Module provide lockless route lookups for global unicast addresses and in-place incremental updates, allowing for good RIB performance. Implementation details: * wrapper code lives in `sys/contrib/dpdk_rte_lpm/dpdk_lpm[6].c`. * rte_lpm[6] implementation contains both RIB and FIB code. . RIB ("rule_") code, backed by array of hash tables part has been commented out, as base radix already provides all the necessary primitives. * link-local lookups are currently implemented as base radix lookup. This part should be converted to something like read-only radix trie. Usage detail: Compile kernel with option FIB_ALGO and load dpdk_lpm4/dpdk_lpm6 module at any time. They will be picked up automatically when amount of routes raises to several thousand. [1]: https://doc.dpdk.org/guides/prog_guide/lpm_lib.html [2]: http://yuba.stanford.edu/~nickm/papers/Infocom98_lookup.pdf [3]: https://doc.dpdk.org/guides/prog_guide/lpm6_lib.html Differential Revision: https://reviews.freebsd.org/D27412
84 lines
2.0 KiB
C
84 lines
2.0 KiB
C
/* SPDX-License-Identifier: BSD-3-Clause
|
|
* Copyright(c) 2010-2014 Intel Corporation
|
|
*/
|
|
|
|
#ifndef _RTE_DEBUG_H_
|
|
#define _RTE_DEBUG_H_
|
|
|
|
/**
|
|
* @file
|
|
*
|
|
* Debug Functions in RTE
|
|
*
|
|
* This file defines a generic API for debug operations. Part of
|
|
* the implementation is architecture-specific.
|
|
*/
|
|
|
|
//#include "rte_log.h"
|
|
#include "rte_branch_prediction.h"
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
/**
|
|
* Dump the stack of the calling core to the console.
|
|
*/
|
|
void rte_dump_stack(void);
|
|
|
|
/**
|
|
* Dump the registers of the calling core to the console.
|
|
*
|
|
* Note: Not implemented in a userapp environment; use gdb instead.
|
|
*/
|
|
void rte_dump_registers(void);
|
|
|
|
/**
|
|
* Provide notification of a critical non-recoverable error and terminate
|
|
* execution abnormally.
|
|
*
|
|
* Display the format string and its expanded arguments (printf-like).
|
|
*
|
|
* In a linux environment, this function dumps the stack and calls
|
|
* abort() resulting in a core dump if enabled.
|
|
*
|
|
* The function never returns.
|
|
*
|
|
* @param ...
|
|
* The format string, followed by the variable list of arguments.
|
|
*/
|
|
#define rte_panic(...) rte_panic_(__func__, __VA_ARGS__, "dummy")
|
|
#define rte_panic_(func, format, ...) __rte_panic(func, format "%.0s", __VA_ARGS__)
|
|
|
|
#ifdef RTE_ENABLE_ASSERT
|
|
#define RTE_ASSERT(exp) RTE_VERIFY(exp)
|
|
#else
|
|
#define RTE_ASSERT(exp) do {} while (0)
|
|
#endif
|
|
#define RTE_VERIFY(exp) do { \
|
|
if (unlikely(!(exp))) \
|
|
rte_panic("line %d\tassert \"%s\" failed\n", __LINE__, #exp); \
|
|
} while (0)
|
|
|
|
/*
|
|
* Provide notification of a critical non-recoverable error and stop.
|
|
*
|
|
* This function should not be called directly. Refer to rte_panic() macro
|
|
* documentation.
|
|
*/
|
|
void __rte_panic(const char *funcname , const char *format, ...)
|
|
{
|
|
#ifdef __GNUC__
|
|
#if (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 2))
|
|
__rte_cold
|
|
#endif
|
|
#endif
|
|
//__rte_noreturn
|
|
//__rte_format_printf(2, 3);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif /* _RTE_DEBUG_H_ */
|