table of contents
rte_reorder.h(3) | DPDK | rte_reorder.h(3) |
NAME¶
rte_reorder.h
SYNOPSIS¶
#include <rte_compat.h>
#include <rte_mbuf.h>
#include <rte_mbuf_dyn.h>
Functions¶
static __rte_experimental rte_reorder_seqn_t *
rte_reorder_seqn (struct rte_mbuf *mbuf)
struct rte_reorder_buffer * rte_reorder_create (const char *name,
unsigned socket_id, unsigned int size)
struct rte_reorder_buffer * rte_reorder_init (struct rte_reorder_buffer
*b, unsigned int bufsize, const char *name, unsigned int size)
struct rte_reorder_buffer * rte_reorder_find_existing (const char
*name)
void rte_reorder_reset (struct rte_reorder_buffer *b)
void rte_reorder_free (struct rte_reorder_buffer *b)
int rte_reorder_insert (struct rte_reorder_buffer *b, struct
rte_mbuf *mbuf)
unsigned int rte_reorder_drain (struct rte_reorder_buffer *b, struct
rte_mbuf **mbufs, unsigned max_mbufs)
__rte_experimental unsigned int rte_reorder_drain_up_to_seqn (struct
rte_reorder_buffer *b, struct rte_mbuf **mbufs, unsigned int
max_mbufs, rte_reorder_seqn_t seqn)
__rte_experimental unsigned int rte_reorder_min_seqn_set (struct
rte_reorder_buffer *b, rte_reorder_seqn_t min_seqn)
__rte_experimental unsigned int rte_reorder_memory_footprint_get
(unsigned int size)
Detailed Description¶
RTE reorder
Reorder library is a component which is designed to provide ordering of out of ordered packets based on sequence number present in mbuf.
Definition in file rte_reorder.h.
Function Documentation¶
static __rte_experimental rte_reorder_seqn_t* rte_reorder_seqn (struct rte_mbuf * mbuf) [inline], [static]¶
Warning:
Read reorder sequence number from mbuf.
Parameters:
Returns:
Definition at line 41 of file rte_reorder.h.
struct rte_reorder_buffer* rte_reorder_create (const char * name, unsigned socket_id, unsigned int size)¶
Create a new reorder buffer instance
Allocate memory and initialize a new reorder buffer in that memory, returning the reorder buffer pointer to the user
Parameters:
socket_id The NUMA node on which the memory for the reorder buffer instance is to be reserved.
size Max number of elements that can be stored in the reorder buffer
Returns:
- ENOMEM - no appropriate memory area found in which to create memzone
- EINVAL - invalid parameters
struct rte_reorder_buffer* rte_reorder_init (struct rte_reorder_buffer * b, unsigned int bufsize, const char * name, unsigned int size)¶
Initializes given reorder buffer instance
Parameters:
bufsize Size of the reorder buffer
name The name to be given to the reorder buffer
size Number of elements that can be stored in reorder buffer
Returns:
- EINVAL - invalid parameters
- ENOMEM - not enough memory to register dynamic field
struct rte_reorder_buffer* rte_reorder_find_existing (const char * name)¶
Find an existing reorder buffer instance and return a pointer to it.
Parameters:
Returns:
- •
- ENOENT - required entry not available to return. reorder instance list
void rte_reorder_reset (struct rte_reorder_buffer * b)¶
Reset the given reorder buffer instance with initial values.
Parameters:
void rte_reorder_free (struct rte_reorder_buffer * b)¶
Free reorder buffer instance.
Parameters:
int rte_reorder_insert (struct rte_reorder_buffer * b, struct rte_mbuf * mbuf)¶
Insert given mbuf in reorder buffer in its correct position
The given mbuf is to be reordered relative to other mbufs in the system. The mbuf must contain a sequence number which is then used to place the buffer in the correct position in the reorder buffer. Reordered packets can later be taken from the buffer using the rte_reorder_drain() API.
Parameters:
mbuf mbuf of packet that needs to be inserted in reorder buffer.
Returns:
- ENOSPC - Cannot move existing mbufs from reorder buffer to accommodate early mbuf, but it can be accommodated by performing drain and then insert.
- ERANGE - Too early or late mbuf which is vastly out of range of expected window should be ignored without any handling.
unsigned int rte_reorder_drain (struct rte_reorder_buffer * b, struct rte_mbuf ** mbufs, unsigned max_mbufs)¶
Fetch reordered buffers
Returns a set of in-order buffers from the reorder buffer structure. Gaps may be present in the sequence numbers of the mbuf if packets have been delayed too long before reaching the reorder window, or have been previously dropped by the system.
Parameters:
mbufs array of mbufs where reordered packets will be inserted from reorder buffer
max_mbufs the number of elements in the mbufs array.
Returns:
__rte_experimental unsigned int rte_reorder_drain_up_to_seqn (struct rte_reorder_buffer * b, struct rte_mbuf ** mbufs, unsigned int max_mbufs, rte_reorder_seqn_t seqn)¶
Warning:
Fetch set of reordered packets up to specified sequence number (exclusive).
Returns a set of in-order packets from the reorder buffer structure. Gaps may be present since reorder buffer will try to fetch all possible packets up to given sequence number.
Parameters:
mbufs Array of mbufs where reordered packets will be inserted from reorder buffer.
max_mbufs The number of elements in the mbuf array.
seqn Sequence number up to which buffer will be drained.
Returns:
__rte_experimental unsigned int rte_reorder_min_seqn_set (struct rte_reorder_buffer * b, rte_reorder_seqn_t min_seqn)¶
Warning:
Set minimum sequence number of packet allowed to be buffered. To successfully set new value, reorder buffer has to be empty (after create, reset or drain_all).
Parameters:
min_seqn New sequence number to set.
Returns:
__rte_experimental unsigned int rte_reorder_memory_footprint_get (unsigned int size)¶
Warning:
Determine the amount of memory needed by the reorder buffer to accommodate a given number of elements.
See also:
Parameters:
Returns:
Author¶
Generated automatically by Doxygen for DPDK from the source code.
Thu May 23 2024 | Version 23.11.0 |