mirror of
https://git.hardenedbsd.org/hardenedbsd/HardenedBSD.git
synced 2024-11-22 11:14:18 +01:00
537d134373
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
42 lines
846 B
C
42 lines
846 B
C
/* SPDX-License-Identifier: BSD-3-Clause
|
|
* Copyright(c) 2010-2014 Intel Corporation
|
|
*/
|
|
|
|
/**
|
|
* @file
|
|
* Branch Prediction Helpers in RTE
|
|
*/
|
|
|
|
#ifndef _RTE_BRANCH_PREDICTION_H_
|
|
#define _RTE_BRANCH_PREDICTION_H_
|
|
|
|
/**
|
|
* Check if a branch is likely to be taken.
|
|
*
|
|
* This compiler builtin allows the developer to indicate if a branch is
|
|
* likely to be taken. Example:
|
|
*
|
|
* if (likely(x > 1))
|
|
* do_stuff();
|
|
*
|
|
*/
|
|
#ifndef likely
|
|
#define likely(x) __builtin_expect(!!(x), 1)
|
|
#endif /* likely */
|
|
|
|
/**
|
|
* Check if a branch is unlikely to be taken.
|
|
*
|
|
* This compiler builtin allows the developer to indicate if a branch is
|
|
* unlikely to be taken. Example:
|
|
*
|
|
* if (unlikely(x < 1))
|
|
* do_stuff();
|
|
*
|
|
*/
|
|
#ifndef unlikely
|
|
#define unlikely(x) __builtin_expect(!!(x), 0)
|
|
#endif /* unlikely */
|
|
|
|
#endif /* _RTE_BRANCH_PREDICTION_H_ */
|