DPDK  16.11.11
rte_reorder.h
Go to the documentation of this file.
1 /*-
2  * BSD LICENSE
3  *
4  * Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  *
11  * * Redistributions of source code must retain the above copyright
12  * notice, this list of conditions and the following disclaimer.
13  * * Redistributions in binary form must reproduce the above copyright
14  * notice, this list of conditions and the following disclaimer in
15  * the documentation and/or other materials provided with the
16  * distribution.
17  * * Neither the name of Intel Corporation nor the names of its
18  * contributors may be used to endorse or promote products derived
19  * from this software without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32  */
33 
34 #ifndef _RTE_REORDER_H_
35 #define _RTE_REORDER_H_
36 
47 #include <rte_mbuf.h>
48 
49 #ifdef __cplusplus
50 extern "C" {
51 #endif
52 
53 struct rte_reorder_buffer;
54 
74 struct rte_reorder_buffer *
75 rte_reorder_create(const char *name, unsigned socket_id, unsigned int size);
76 
93 struct rte_reorder_buffer *
94 rte_reorder_init(struct rte_reorder_buffer *b, unsigned int bufsize,
95  const char *name, unsigned int size);
96 
109 struct rte_reorder_buffer *
110 rte_reorder_find_existing(const char *name);
111 
118 void
119 rte_reorder_reset(struct rte_reorder_buffer *b);
120 
129 void
130 rte_reorder_free(struct rte_reorder_buffer *b);
131 
154 int
155 rte_reorder_insert(struct rte_reorder_buffer *b, struct rte_mbuf *mbuf);
156 
174 unsigned int
175 rte_reorder_drain(struct rte_reorder_buffer *b, struct rte_mbuf **mbufs,
176  unsigned max_mbufs);
177 
178 #ifdef __cplusplus
179 }
180 #endif
181 
182 #endif /* _RTE_REORDER_H_ */
unsigned int rte_reorder_drain(struct rte_reorder_buffer *b, struct rte_mbuf **mbufs, unsigned max_mbufs)
int rte_reorder_insert(struct rte_reorder_buffer *b, struct rte_mbuf *mbuf)
struct rte_reorder_buffer * rte_reorder_find_existing(const char *name)
void rte_reorder_free(struct rte_reorder_buffer *b)
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_create(const char *name, unsigned socket_id, unsigned int size)
void rte_reorder_reset(struct rte_reorder_buffer *b)