8f532a34c4
The fib and fib6 API's have been in since 19.11 and should be marked as stable. Signed-off-by: Vladimir Medvedkin <vladimir.medvedkin@intel.com> Acked-by: Conor Walsh <conor.walsh@intel.com>
222 lines
4.8 KiB
C
222 lines
4.8 KiB
C
/* SPDX-License-Identifier: BSD-3-Clause
|
|
* Copyright(c) 2018 Vladimir Medvedkin <medvedkinv@gmail.com>
|
|
* Copyright(c) 2019 Intel Corporation
|
|
*/
|
|
|
|
#ifndef _RTE_FIB6_H_
|
|
#define _RTE_FIB6_H_
|
|
|
|
/**
|
|
* @file
|
|
*
|
|
* RTE FIB6 library.
|
|
*
|
|
* FIB (Forwarding information base) implementation
|
|
* for IPv6 Longest Prefix Match
|
|
*/
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <rte_compat.h>
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
#define RTE_FIB6_IPV6_ADDR_SIZE 16
|
|
/** Maximum depth value possible for IPv6 FIB. */
|
|
#define RTE_FIB6_MAXDEPTH 128
|
|
|
|
struct rte_fib6;
|
|
struct rte_rib6;
|
|
|
|
/** Type of FIB struct */
|
|
enum rte_fib6_type {
|
|
RTE_FIB6_DUMMY, /**< RIB6 tree based FIB */
|
|
RTE_FIB6_TRIE /**< TRIE based fib */
|
|
};
|
|
|
|
/** Modify FIB function */
|
|
typedef int (*rte_fib6_modify_fn_t)(struct rte_fib6 *fib,
|
|
const uint8_t ip[RTE_FIB6_IPV6_ADDR_SIZE], uint8_t depth,
|
|
uint64_t next_hop, int op);
|
|
/** FIB bulk lookup function */
|
|
typedef void (*rte_fib6_lookup_fn_t)(void *fib,
|
|
uint8_t ips[][RTE_FIB6_IPV6_ADDR_SIZE],
|
|
uint64_t *next_hops, const unsigned int n);
|
|
|
|
enum rte_fib6_op {
|
|
RTE_FIB6_ADD,
|
|
RTE_FIB6_DEL,
|
|
};
|
|
|
|
/** Size of nexthop (1 << nh_sz) bits for TRIE based FIB */
|
|
enum rte_fib_trie_nh_sz {
|
|
RTE_FIB6_TRIE_2B = 1,
|
|
RTE_FIB6_TRIE_4B,
|
|
RTE_FIB6_TRIE_8B
|
|
};
|
|
|
|
/** Type of lookup function implementation */
|
|
enum rte_fib6_lookup_type {
|
|
RTE_FIB6_LOOKUP_DEFAULT,
|
|
/**< Selects the best implementation based on the max simd bitwidth */
|
|
RTE_FIB6_LOOKUP_TRIE_SCALAR, /**< Scalar lookup function implementation*/
|
|
RTE_FIB6_LOOKUP_TRIE_VECTOR_AVX512 /**< Vector implementation using AVX512 */
|
|
};
|
|
|
|
/** FIB configuration structure */
|
|
struct rte_fib6_conf {
|
|
enum rte_fib6_type type; /**< Type of FIB struct */
|
|
/** Default value returned on lookup if there is no route */
|
|
uint64_t default_nh;
|
|
int max_routes;
|
|
union {
|
|
struct {
|
|
enum rte_fib_trie_nh_sz nh_sz;
|
|
uint32_t num_tbl8;
|
|
} trie;
|
|
};
|
|
};
|
|
|
|
/**
|
|
* Create FIB
|
|
*
|
|
* @param name
|
|
* FIB name
|
|
* @param socket_id
|
|
* NUMA socket ID for FIB table memory allocation
|
|
* @param conf
|
|
* Structure containing the configuration
|
|
* @return
|
|
* Handle to FIB object on success
|
|
* NULL otherwise with rte_errno set to an appropriate values.
|
|
*/
|
|
struct rte_fib6 *
|
|
rte_fib6_create(const char *name, int socket_id, struct rte_fib6_conf *conf);
|
|
|
|
/**
|
|
* Find an existing FIB object and return a pointer to it.
|
|
*
|
|
* @param name
|
|
* Name of the fib object as passed to rte_fib6_create()
|
|
* @return
|
|
* Pointer to fib object or NULL if object not found with rte_errno
|
|
* set appropriately. Possible rte_errno values include:
|
|
* - ENOENT - required entry not available to return.
|
|
*/
|
|
struct rte_fib6 *
|
|
rte_fib6_find_existing(const char *name);
|
|
|
|
/**
|
|
* Free an FIB object.
|
|
*
|
|
* @param fib
|
|
* FIB object handle
|
|
* @return
|
|
* None
|
|
*/
|
|
void
|
|
rte_fib6_free(struct rte_fib6 *fib);
|
|
|
|
/**
|
|
* Add a route to the FIB.
|
|
*
|
|
* @param fib
|
|
* FIB object handle
|
|
* @param ip
|
|
* IPv6 prefix address to be added to the FIB
|
|
* @param depth
|
|
* Prefix length
|
|
* @param next_hop
|
|
* Next hop to be added to the FIB
|
|
* @return
|
|
* 0 on success, negative value otherwise
|
|
*/
|
|
int
|
|
rte_fib6_add(struct rte_fib6 *fib, const uint8_t ip[RTE_FIB6_IPV6_ADDR_SIZE],
|
|
uint8_t depth, uint64_t next_hop);
|
|
|
|
/**
|
|
* Delete a rule from the FIB.
|
|
*
|
|
* @param fib
|
|
* FIB object handle
|
|
* @param ip
|
|
* IPv6 prefix address to be deleted from the FIB
|
|
* @param depth
|
|
* Prefix length
|
|
* @return
|
|
* 0 on success, negative value otherwise
|
|
*/
|
|
int
|
|
rte_fib6_delete(struct rte_fib6 *fib,
|
|
const uint8_t ip[RTE_FIB6_IPV6_ADDR_SIZE], uint8_t depth);
|
|
|
|
/**
|
|
* Lookup multiple IP addresses in the FIB.
|
|
*
|
|
* @param fib
|
|
* FIB object handle
|
|
* @param ips
|
|
* Array of IPv6s to be looked up in the FIB
|
|
* @param next_hops
|
|
* Next hop of the most specific rule found for IP.
|
|
* This is an array of eight byte values.
|
|
* If the lookup for the given IP failed, then corresponding element would
|
|
* contain default nexthop value configured for a FIB.
|
|
* @param n
|
|
* Number of elements in ips (and next_hops) array to lookup.
|
|
* @return
|
|
* -EINVAL for incorrect arguments, otherwise 0
|
|
*/
|
|
int
|
|
rte_fib6_lookup_bulk(struct rte_fib6 *fib,
|
|
uint8_t ips[][RTE_FIB6_IPV6_ADDR_SIZE],
|
|
uint64_t *next_hops, int n);
|
|
|
|
/**
|
|
* Get pointer to the dataplane specific struct
|
|
*
|
|
* @param fib
|
|
* FIB6 object handle
|
|
* @return
|
|
* Pointer on the dataplane struct on success
|
|
* NULL othervise
|
|
*/
|
|
void *
|
|
rte_fib6_get_dp(struct rte_fib6 *fib);
|
|
|
|
/**
|
|
* Get pointer to the RIB6
|
|
*
|
|
* @param fib
|
|
* FIB object handle
|
|
* @return
|
|
* Pointer on the RIB6 on success
|
|
* NULL othervise
|
|
*/
|
|
struct rte_rib6 *
|
|
rte_fib6_get_rib(struct rte_fib6 *fib);
|
|
|
|
/**
|
|
* Set lookup function based on type
|
|
*
|
|
* @param fib
|
|
* FIB object handle
|
|
* @param type
|
|
* type of lookup function
|
|
*
|
|
* @return
|
|
* 0 on success
|
|
* -EINVAL on failure
|
|
*/
|
|
int
|
|
rte_fib6_select_lookup(struct rte_fib6 *fib, enum rte_fib6_lookup_type type);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif /* _RTE_FIB6_H_ */
|