blob: 9555cd7d224da9aa00da24c1bcfd03778999a2a6 [file] [log] [blame]
Ed Warnickecb9cada2015-12-08 15:45:58 -07001/*
2 * Copyright (c) 2015 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
6 *
7 * http://www.apache.org/licenses/LICENSE-2.0
8 *
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
14 */
15/*
16 * buffer.h: VLIB buffers
17 *
18 * Copyright (c) 2008 Eliot Dresselhaus
19 *
20 * Permission is hereby granted, free of charge, to any person obtaining
21 * a copy of this software and associated documentation files (the
22 * "Software"), to deal in the Software without restriction, including
23 * without limitation the rights to use, copy, modify, merge, publish,
24 * distribute, sublicense, and/or sell copies of the Software, and to
25 * permit persons to whom the Software is furnished to do so, subject to
26 * the following conditions:
27 *
28 * The above copyright notice and this permission notice shall be
29 * included in all copies or substantial portions of the Software.
30 *
31 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
32 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
33 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
34 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
35 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
36 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
37 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
38 */
39
40#ifndef included_vlib_buffer_h
41#define included_vlib_buffer_h
42
43#include <vppinfra/types.h>
44#include <vppinfra/cache.h>
45#include <vppinfra/serialize.h>
46#include <vppinfra/vector.h>
Damjan Marion6b0f5892017-07-27 04:01:24 -040047#include <vppinfra/lock.h>
Ed Warnickecb9cada2015-12-08 15:45:58 -070048#include <vlib/error.h> /* for vlib_error_t */
Damjan Marion19010202016-03-24 17:17:47 +010049
Dave Barach9b8ffd92016-07-08 08:13:45 -040050#include <vlib/config.h> /* for __PRE_DATA_SIZE */
Damjan Marion878c6092017-01-04 13:19:27 +010051#define VLIB_BUFFER_DATA_SIZE (2048)
Damjan Marion19010202016-03-24 17:17:47 +010052#define VLIB_BUFFER_PRE_DATA_SIZE __PRE_DATA_SIZE
Ed Warnickecb9cada2015-12-08 15:45:58 -070053
Damjan Mariondac03522018-02-01 15:30:13 +010054typedef u8 vlib_buffer_free_list_index_t;
55
Ed Warnickecb9cada2015-12-08 15:45:58 -070056/** \file
57 vlib buffer structure definition and a few select
58 access methods. This structure and the buffer allocation
Dave Barach9b8ffd92016-07-08 08:13:45 -040059 mechanism should perhaps live in vnet, but it would take a lot
Ed Warnickecb9cada2015-12-08 15:45:58 -070060 of typing to make it so.
61*/
Dave Barach9b8ffd92016-07-08 08:13:45 -040062
Damjan Mariondac03522018-02-01 15:30:13 +010063/**
64 * Buffer Flags
65 */
66#define foreach_vlib_buffer_flag \
67 _( 0, NON_DEFAULT_FREELIST, "non-default-fl") \
68 _( 1, IS_TRACED, 0) \
69 _( 2, NEXT_PRESENT, 0) \
70 _( 3, IS_RECYCLED, "is-recycled") \
71 _( 4, TOTAL_LENGTH_VALID, 0) \
72 _( 5, REPL_FAIL, "repl-fail") \
73 _( 6, RECYCLE, "recycle") \
74 _( 7, EXT_HDR_VALID, "ext-hdr-valid")
75
76/* NOTE: only buffer generic flags should be defined here, please consider
77 using user flags. i.e. src/vnet/buffer.h */
78
79enum
80{
81#define _(bit, name, v) VLIB_BUFFER_##name = (1 << (bit)),
82 foreach_vlib_buffer_flag
83#undef _
84};
85
86enum
87{
88#define _(bit, name, v) VLIB_BUFFER_LOG2_##name = (bit),
89 foreach_vlib_buffer_flag
90#undef _
91};
92
93 /* User defined buffer flags. */
94#define LOG2_VLIB_BUFFER_FLAG_USER(n) (32 - (n))
95#define VLIB_BUFFER_FLAG_USER(n) (1 << LOG2_VLIB_BUFFER_FLAG_USER(n))
96
Ed Warnickecb9cada2015-12-08 15:45:58 -070097/* VLIB buffer representation. */
Dave Barach9b8ffd92016-07-08 08:13:45 -040098typedef struct
99{
100 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
Dave Barachf8690282017-03-01 11:38:02 -0500101 STRUCT_MARK (template_start);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700102 /* Offset within data[] that we are currently processing.
Dave Barach9b8ffd92016-07-08 08:13:45 -0400103 If negative current header points into predata area. */
104 i16 current_data; /**< signed offset in data[], pre_data[]
Ed Warnickecb9cada2015-12-08 15:45:58 -0700105 that we are currently processing.
106 If negative current header points into predata area.
107 */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400108 u16 current_length; /**< Nbytes between current data and
Ed Warnickecb9cada2015-12-08 15:45:58 -0700109 the end of this buffer.
110 */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400111 u32 flags; /**< buffer flags:
Damjan Marion072401e2017-07-13 18:53:27 +0200112 <br> VLIB_BUFFER_FREE_LIST_INDEX_MASK: bits used to store free list index,
Ed Warnickecb9cada2015-12-08 15:45:58 -0700113 <br> VLIB_BUFFER_IS_TRACED: trace this buffer.
114 <br> VLIB_BUFFER_NEXT_PRESENT: this is a multi-chunk buffer.
115 <br> VLIB_BUFFER_TOTAL_LENGTH_VALID: as it says
116 <br> VLIB_BUFFER_REPL_FAIL: packet replication failure
Dave Barachb5adaea2016-06-17 14:09:56 -0400117 <br> VLIB_BUFFER_RECYCLE: as it says
Damjan Marionff542702017-02-27 11:29:20 +0100118 <br> VLIB_BUFFER_EXT_HDR_VALID: buffer contains valid external buffer manager header,
Dave Barachad41b352016-10-07 08:30:23 -0700119 set to avoid adding it to a flow report
Ed Warnickecb9cada2015-12-08 15:45:58 -0700120 <br> VLIB_BUFFER_FLAG_USER(n): user-defined bit N
121 */
Damjan Marion072401e2017-07-13 18:53:27 +0200122
Damjan Marionaa682a32018-04-26 22:45:40 +0200123 u32 flow_id; /**< Generic flow identifier */
Ed Warnickecb9cada2015-12-08 15:45:58 -0700124
Ed Warnickecb9cada2015-12-08 15:45:58 -0700125
Ed Warnickecb9cada2015-12-08 15:45:58 -0700126 u32 next_buffer; /**< Next buffer for this linked-list of buffers.
Dave Barach9b8ffd92016-07-08 08:13:45 -0400127 Only valid if VLIB_BUFFER_NEXT_PRESENT flag is set.
Ed Warnickecb9cada2015-12-08 15:45:58 -0700128 */
129
Damjan Marionaa682a32018-04-26 22:45:40 +0200130 STRUCT_MARK (template_end);
131
Dave Barachd6534602016-06-14 18:38:02 -0400132 u32 current_config_index; /**< Used by feature subgraph arcs to
133 visit enabled feature nodes
134 */
Damjan Marionaa682a32018-04-26 22:45:40 +0200135 vlib_error_t error; /**< Error code for buffers to be enqueued
136 to error handler.
Damjan Marion87cd1192016-11-04 11:00:27 +0100137 */
Damjan Marionc47ed032017-01-25 14:18:03 +0100138 u8 n_add_refs; /**< Number of additional references to this buffer. */
139
Damjan Marion149ba772017-10-12 13:09:26 +0200140 u8 buffer_pool_index; /**< index of buffer pool this buffer belongs. */
Dave Barachb5adaea2016-06-17 14:09:56 -0400141
Damjan Marion072401e2017-07-13 18:53:27 +0200142 u32 opaque[10]; /**< Opaque data used by sub-graphs for their own purposes.
Ed Warnickecb9cada2015-12-08 15:45:58 -0700143 See .../vnet/vnet/buffer.h
144 */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400145 CLIB_CACHE_LINE_ALIGN_MARK (cacheline1);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700146
Dave Barach9b8ffd92016-07-08 08:13:45 -0400147 u32 trace_index; /**< Specifies index into trace buffer
148 if VLIB_PACKET_IS_TRACED flag is set.
Dave Barachd6534602016-06-14 18:38:02 -0400149 */
Dave Barachb5adaea2016-06-17 14:09:56 -0400150 u32 recycle_count; /**< Used by L2 path recycle code */
Damjan Marion072401e2017-07-13 18:53:27 +0200151
152 u32 total_length_not_including_first_buffer;
153 /**< Only valid for first buffer in chain. Current length plus
154 total length given here give total number of bytes in buffer chain.
155 */
Damjan Mariondac03522018-02-01 15:30:13 +0100156 vlib_buffer_free_list_index_t free_list_index; /** < only used if
157 VLIB_BUFFER_NON_DEFAULT_FREELIST
158 flag is set */
159 u8 align_pad[3]; /**< available */
Dave Barach7bee7732017-10-18 18:48:11 -0400160 u32 opaque2[12]; /**< More opaque data, see ../vnet/vnet/buffer.h */
Ed Warnickecb9cada2015-12-08 15:45:58 -0700161
162 /***** end of second cache line */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400163 CLIB_CACHE_LINE_ALIGN_MARK (cacheline2);
164 u8 pre_data[VLIB_BUFFER_PRE_DATA_SIZE]; /**< Space for inserting data
Damjan Marion19010202016-03-24 17:17:47 +0100165 before buffer start.
166 Packet rewrite string will be
167 rewritten backwards and may extend
168 back before buffer->data[0].
169 Must come directly before packet data.
170 */
Ed Warnickecb9cada2015-12-08 15:45:58 -0700171
Ed Warnickecb9cada2015-12-08 15:45:58 -0700172 u8 data[0]; /**< Packet data. Hardware DMA here */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400173} vlib_buffer_t; /* Must be a multiple of 64B. */
Ed Warnickecb9cada2015-12-08 15:45:58 -0700174
Damjan Marion19010202016-03-24 17:17:47 +0100175#define VLIB_BUFFER_HDR_SIZE (sizeof(vlib_buffer_t) - VLIB_BUFFER_PRE_DATA_SIZE)
176
Ed Warnickecb9cada2015-12-08 15:45:58 -0700177/** \brief Prefetch buffer metadata.
178 The first 64 bytes of buffer contains most header information
179
180 @param b - (vlib_buffer_t *) pointer to the buffer
181 @param type - LOAD, STORE. In most cases, STORE is the right answer
182*/
183
184#define vlib_prefetch_buffer_header(b,type) CLIB_PREFETCH (b, 64, type)
185
Ed Warnickecb9cada2015-12-08 15:45:58 -0700186always_inline void
187vlib_buffer_struct_is_sane (vlib_buffer_t * b)
188{
189 ASSERT (sizeof (b[0]) % 64 == 0);
190
191 /* Rewrite data must be before and contiguous with packet data. */
192 ASSERT (b->pre_data + VLIB_BUFFER_PRE_DATA_SIZE == b->data);
193}
194
195/** \brief Get pointer to current data to process
196
197 @param b - (vlib_buffer_t *) pointer to the buffer
198 @return - (void *) (b->data + b->current_data)
Dave Barach9b8ffd92016-07-08 08:13:45 -0400199*/
Ed Warnickecb9cada2015-12-08 15:45:58 -0700200
201always_inline void *
202vlib_buffer_get_current (vlib_buffer_t * b)
203{
204 /* Check bounds. */
205 ASSERT ((signed) b->current_data >= (signed) -VLIB_BUFFER_PRE_DATA_SIZE);
206 return b->data + b->current_data;
207}
208
209/** \brief Advance current data pointer by the supplied (signed!) amount
210
211 @param b - (vlib_buffer_t *) pointer to the buffer
212 @param l - (word) signed increment
Dave Barach9b8ffd92016-07-08 08:13:45 -0400213*/
Ed Warnickecb9cada2015-12-08 15:45:58 -0700214always_inline void
215vlib_buffer_advance (vlib_buffer_t * b, word l)
216{
217 ASSERT (b->current_length >= l);
218 b->current_data += l;
219 b->current_length -= l;
220}
221
Filip Tehlar816f4372017-04-26 16:09:06 +0200222/** \brief Check if there is enough space in buffer to advance
223
224 @param b - (vlib_buffer_t *) pointer to the buffer
225 @param l - (word) size to check
226 @return - 0 if there is less space than 'l' in buffer
227*/
228always_inline u8
229vlib_buffer_has_space (vlib_buffer_t * b, word l)
230{
231 return b->current_length >= l;
232}
233
Ed Warnickecb9cada2015-12-08 15:45:58 -0700234/** \brief Reset current header & length to state they were in when
235 packet was received.
236
237 @param b - (vlib_buffer_t *) pointer to the buffer
238*/
239
240always_inline void
241vlib_buffer_reset (vlib_buffer_t * b)
242{
243 b->current_length += clib_max (b->current_data, 0);
244 b->current_data = 0;
245}
246
247/** \brief Get pointer to buffer's opaque data array
248
249 @param b - (vlib_buffer_t *) pointer to the buffer
250 @return - (void *) b->opaque
251*/
252always_inline void *
253vlib_get_buffer_opaque (vlib_buffer_t * b)
Dave Barach9b8ffd92016-07-08 08:13:45 -0400254{
255 return (void *) b->opaque;
256}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700257
258/** \brief Get pointer to buffer's opaque2 data array
259
260 @param b - (vlib_buffer_t *) pointer to the buffer
261 @return - (void *) b->opaque2
262*/
263always_inline void *
264vlib_get_buffer_opaque2 (vlib_buffer_t * b)
Dave Barach9b8ffd92016-07-08 08:13:45 -0400265{
266 return (void *) b->opaque2;
267}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700268
Dave Barach68b0fb02017-02-28 15:15:56 -0500269/** \brief Get pointer to the end of buffer's data
270 * @param b pointer to the buffer
271 * @return pointer to tail of packet's data
272 */
273always_inline u8 *
274vlib_buffer_get_tail (vlib_buffer_t * b)
275{
276 return b->data + b->current_data + b->current_length;
277}
278
279/** \brief Append uninitialized data to buffer
280 * @param b pointer to the buffer
281 * @param size number of uninitialized bytes
282 * @return pointer to beginning of uninitialized data
283 */
284always_inline void *
285vlib_buffer_put_uninit (vlib_buffer_t * b, u8 size)
286{
287 void *p = vlib_buffer_get_tail (b);
288 /* XXX make sure there's enough space */
289 b->current_length += size;
290 return p;
291}
292
293/** \brief Prepend uninitialized data to buffer
294 * @param b pointer to the buffer
295 * @param size number of uninitialized bytes
296 * @return pointer to beginning of uninitialized data
297 */
298always_inline void *
299vlib_buffer_push_uninit (vlib_buffer_t * b, u8 size)
300{
301 ASSERT (b->current_data + VLIB_BUFFER_PRE_DATA_SIZE >= size);
302 b->current_data -= size;
303 b->current_length += size;
304
305 return vlib_buffer_get_current (b);
306}
307
308/** \brief Make head room, typically for packet headers
309 * @param b pointer to the buffer
310 * @param size number of head room bytes
311 * @return pointer to start of buffer (current data)
312 */
313always_inline void *
314vlib_buffer_make_headroom (vlib_buffer_t * b, u8 size)
315{
316 ASSERT (b->current_data + VLIB_BUFFER_PRE_DATA_SIZE >= size);
317 b->current_data += size;
318 return vlib_buffer_get_current (b);
319}
320
321/** \brief Retrieve bytes from buffer head
322 * @param b pointer to the buffer
323 * @param size number of bytes to pull
324 * @return pointer to start of buffer (current data)
325 */
326always_inline void *
327vlib_buffer_pull (vlib_buffer_t * b, u8 size)
328{
329 if (b->current_length + VLIB_BUFFER_PRE_DATA_SIZE < size)
330 return 0;
331
332 void *data = vlib_buffer_get_current (b);
333 vlib_buffer_advance (b, size);
334 return data;
335}
336
Ed Warnickecb9cada2015-12-08 15:45:58 -0700337/* Forward declaration. */
338struct vlib_main_t;
339
Dave Barach9b8ffd92016-07-08 08:13:45 -0400340typedef struct vlib_buffer_free_list_t
341{
Ed Warnickecb9cada2015-12-08 15:45:58 -0700342 /* Template buffer used to initialize first 16 bytes of buffers
343 allocated on this free list. */
344 vlib_buffer_t buffer_init_template;
345
346 /* Our index into vlib_main_t's buffer_free_list_pool. */
Damjan Mariondac03522018-02-01 15:30:13 +0100347 vlib_buffer_free_list_index_t index;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700348
349 /* Number of data bytes for buffers in this free list. */
350 u32 n_data_bytes;
351
Damjan Mariond1274cb2018-03-13 21:32:17 +0100352 /* Number of buffers to allocate when we need to allocate new buffers */
353 u32 min_n_buffers_each_alloc;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700354
355 /* Total number of buffers allocated from this free list. */
356 u32 n_alloc;
357
Damjan Marionbd69a5f2017-02-05 23:44:42 +0100358 /* Vector of free buffers. Each element is a byte offset into I/O heap. */
359 u32 *buffers;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700360
Damjan Mariond1274cb2018-03-13 21:32:17 +0100361 /* index of buffer pool used to get / put buffers */
362 u8 buffer_pool_index;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700363
364 /* Free list name. */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400365 u8 *name;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700366
367 /* Callback functions to initialize newly allocated buffers.
368 If null buffers are zeroed. */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400369 void (*buffer_init_function) (struct vlib_main_t * vm,
370 struct vlib_buffer_free_list_t * fl,
371 u32 * buffers, u32 n_buffers);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700372
373 /* Callback function to announce that buffers have been
374 added to the freelist */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400375 void (*buffers_added_to_freelist_function)
376 (struct vlib_main_t * vm, struct vlib_buffer_free_list_t * fl);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700377
378 uword buffer_init_function_opaque;
379} __attribute__ ((aligned (16))) vlib_buffer_free_list_t;
380
Damjan Marionc8a26c62017-11-24 20:15:23 +0100381typedef uword (vlib_buffer_fill_free_list_cb_t) (struct vlib_main_t * vm,
382 vlib_buffer_free_list_t * fl,
383 uword min_free_buffers);
Damjan Marion04f3db32017-11-10 21:55:45 +0100384typedef void (vlib_buffer_free_cb_t) (struct vlib_main_t * vm, u32 * buffers,
385 u32 n_buffers);
386typedef void (vlib_buffer_free_no_next_cb_t) (struct vlib_main_t * vm,
387 u32 * buffers, u32 n_buffers);
388
Dave Barach9b8ffd92016-07-08 08:13:45 -0400389typedef struct
390{
Damjan Marionc8a26c62017-11-24 20:15:23 +0100391 vlib_buffer_fill_free_list_cb_t *vlib_buffer_fill_free_list_cb;
Damjan Marion04f3db32017-11-10 21:55:45 +0100392 vlib_buffer_free_cb_t *vlib_buffer_free_cb;
393 vlib_buffer_free_no_next_cb_t *vlib_buffer_free_no_next_cb;
Damjan Marion878c6092017-01-04 13:19:27 +0100394 void (*vlib_packet_template_init_cb) (struct vlib_main_t * vm, void *t,
395 void *packet_data,
396 uword n_packet_data_bytes,
397 uword
398 min_n_buffers_each_physmem_alloc,
399 u8 * name);
400 void (*vlib_buffer_delete_free_list_cb) (struct vlib_main_t * vm,
Damjan Mariondac03522018-02-01 15:30:13 +0100401 vlib_buffer_free_list_index_t
402 free_list_index);
Damjan Marion878c6092017-01-04 13:19:27 +0100403} vlib_buffer_callbacks_t;
404
Damjan Marion04a7f052017-07-10 15:06:17 +0200405extern vlib_buffer_callbacks_t *vlib_buffer_callbacks;
406
Damjan Marion878c6092017-01-04 13:19:27 +0100407typedef struct
408{
Damjan Marion04a7f052017-07-10 15:06:17 +0200409 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
Damjan Marion149ba772017-10-12 13:09:26 +0200410 uword start;
411 uword size;
Damjan Mariond1274cb2018-03-13 21:32:17 +0100412 uword log2_page_size;
Damjan Marion149ba772017-10-12 13:09:26 +0200413 vlib_physmem_region_index_t physmem_region;
Damjan Mariond1274cb2018-03-13 21:32:17 +0100414
415 u32 *buffers;
416
417 u16 buffer_size;
418 uword buffers_per_page;
419 uword n_elts;
420 uword n_used;
421 uword next_clear;
422 uword *bitmap;
423 clib_spinlock_t lock;
Damjan Marion149ba772017-10-12 13:09:26 +0200424} vlib_buffer_pool_t;
425
426typedef struct
427{
428 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
Damjan Marion04a7f052017-07-10 15:06:17 +0200429 /* Virtual memory address and size of buffer memory, used for calculating
430 buffer index */
431 uword buffer_mem_start;
432 uword buffer_mem_size;
Damjan Marion149ba772017-10-12 13:09:26 +0200433 vlib_buffer_pool_t *buffer_pools;
Damjan Marion04a7f052017-07-10 15:06:17 +0200434
Ed Warnickecb9cada2015-12-08 15:45:58 -0700435 /* Buffer free callback, for subversive activities */
Damjan Marion04a7f052017-07-10 15:06:17 +0200436 u32 (*buffer_free_callback) (struct vlib_main_t * vm,
437 u32 * buffers,
438 u32 n_buffers, u32 follow_buffer_next);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700439#define VLIB_BUFFER_DEFAULT_FREE_LIST_INDEX (0)
Damjan Marion19010202016-03-24 17:17:47 +0100440#define VLIB_BUFFER_DEFAULT_FREE_LIST_BYTES VLIB_BUFFER_DATA_SIZE
Ed Warnickecb9cada2015-12-08 15:45:58 -0700441
442 /* Hash table mapping buffer size (rounded to next unit of
443 sizeof (vlib_buffer_t)) to free list index. */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400444 uword *free_list_by_size;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700445
446 /* Hash table mapping buffer index into number
447 0 => allocated but free, 1 => allocated and not-free.
448 If buffer index is not in hash table then this buffer
449 has never been allocated. */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400450 uword *buffer_known_hash;
Damjan Marion6b0f5892017-07-27 04:01:24 -0400451 clib_spinlock_t buffer_known_hash_lockp;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700452
Damjan Marion878c6092017-01-04 13:19:27 +0100453 /* Callbacks */
454 vlib_buffer_callbacks_t cb;
Damjan Marion04a7f052017-07-10 15:06:17 +0200455 int callbacks_registered;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700456} vlib_buffer_main_t;
457
Damjan Mariond1274cb2018-03-13 21:32:17 +0100458extern vlib_buffer_main_t buffer_main;
459
460static_always_inline vlib_buffer_pool_t *
461vlib_buffer_pool_get (u8 buffer_pool_index)
462{
463 vlib_buffer_main_t *bm = &buffer_main;
464 return vec_elt_at_index (bm->buffer_pools, buffer_pool_index);
465}
466
467u8 vlib_buffer_pool_create (struct vlib_main_t * vm,
468 vlib_physmem_region_index_t region,
469 u16 buffer_size);
Damjan Marion149ba772017-10-12 13:09:26 +0200470
Damjan Marion49d66f12017-07-20 18:10:35 +0200471clib_error_t *vlib_buffer_main_init (struct vlib_main_t *vm);
Damjan Marion878c6092017-01-04 13:19:27 +0100472
Dave Barach9b8ffd92016-07-08 08:13:45 -0400473typedef struct
474{
475 struct vlib_main_t *vlib_main;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700476
477 u32 first_buffer, last_buffer;
478
Dave Barach9b8ffd92016-07-08 08:13:45 -0400479 union
480 {
481 struct
482 {
Ed Warnickecb9cada2015-12-08 15:45:58 -0700483 /* Total accumulated bytes in chain starting with first_buffer. */
484 u32 n_total_data_bytes;
485
486 /* Max number of bytes to accumulate in chain starting with first_buffer.
Dave Barach9b8ffd92016-07-08 08:13:45 -0400487 As this limit is reached buffers are enqueued to next node. */
Ed Warnickecb9cada2015-12-08 15:45:58 -0700488 u32 max_n_data_bytes_per_chain;
489
490 /* Next node to enqueue buffers to relative to current process node. */
491 u32 next_index;
492
493 /* Free list to use to allocate new buffers. */
Damjan Mariondac03522018-02-01 15:30:13 +0100494 vlib_buffer_free_list_index_t free_list_index;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700495 } tx;
496
Dave Barach9b8ffd92016-07-08 08:13:45 -0400497 struct
498 {
Ed Warnickecb9cada2015-12-08 15:45:58 -0700499 /* CLIB fifo of buffer indices waiting to be unserialized. */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400500 u32 *buffer_fifo;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700501
502 /* Event type used to signal that RX buffers have been added to fifo. */
503 uword ready_one_time_event;
504 } rx;
505 };
506} vlib_serialize_buffer_main_t;
507
Dave Barach9b8ffd92016-07-08 08:13:45 -0400508void serialize_open_vlib_buffer (serialize_main_t * m, struct vlib_main_t *vm,
509 vlib_serialize_buffer_main_t * sm);
510void unserialize_open_vlib_buffer (serialize_main_t * m,
511 struct vlib_main_t *vm,
512 vlib_serialize_buffer_main_t * sm);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700513
514u32 serialize_close_vlib_buffer (serialize_main_t * m);
515void unserialize_close_vlib_buffer (serialize_main_t * m);
516void *vlib_set_buffer_free_callback (struct vlib_main_t *vm, void *fp);
517
518always_inline u32
519serialize_vlib_buffer_n_bytes (serialize_main_t * m)
520{
Dave Barach9b8ffd92016-07-08 08:13:45 -0400521 serialize_stream_t *s = &m->stream;
522 vlib_serialize_buffer_main_t *sm
523 = uword_to_pointer (m->stream.data_function_opaque,
524 vlib_serialize_buffer_main_t *);
525 return sm->tx.n_total_data_bytes + s->current_buffer_index +
526 vec_len (s->overflow_buffer);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700527}
528
Ed Warnickecb9cada2015-12-08 15:45:58 -0700529/*
530 */
531
532/** \brief Compile time buffer trajectory tracing option
Dave Barach9b8ffd92016-07-08 08:13:45 -0400533 Turn this on if you run into "bad monkey" contexts,
534 and you want to know exactly which nodes they've visited...
Ed Warnickecb9cada2015-12-08 15:45:58 -0700535 See vlib/main.c...
536*/
537#define VLIB_BUFFER_TRACE_TRAJECTORY 0
538
539#if VLIB_BUFFER_TRACE_TRAJECTORY > 0
Dave Barach7bee7732017-10-18 18:48:11 -0400540extern void (*vlib_buffer_trace_trajectory_cb) (vlib_buffer_t * b, u32 index);
541extern void (*vlib_buffer_trace_trajectory_init_cb) (vlib_buffer_t * b);
542extern void vlib_buffer_trace_trajectory_init (vlib_buffer_t * b);
543#define VLIB_BUFFER_TRACE_TRAJECTORY_INIT(b) \
544 vlib_buffer_trace_trajectory_init (b);
Dave Barach9b8ffd92016-07-08 08:13:45 -0400545#else
Ed Warnickecb9cada2015-12-08 15:45:58 -0700546#define VLIB_BUFFER_TRACE_TRAJECTORY_INIT(b)
547#endif /* VLIB_BUFFER_TRACE_TRAJECTORY */
548
549#endif /* included_vlib_buffer_h */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400550
Damjan Marion04a7f052017-07-10 15:06:17 +0200551#define VLIB_BUFFER_REGISTER_CALLBACKS(x,...) \
552 __VA_ARGS__ vlib_buffer_callbacks_t __##x##_buffer_callbacks; \
553static void __vlib_add_buffer_callbacks_t_##x (void) \
554 __attribute__((__constructor__)) ; \
555static void __vlib_add_buffer_callbacks_t_##x (void) \
556{ \
557 if (vlib_buffer_callbacks) \
558 clib_panic ("vlib buffer callbacks already registered"); \
559 vlib_buffer_callbacks = &__##x##_buffer_callbacks; \
560} \
Damjan Marion72d2c4f2018-04-05 21:32:29 +0200561static void __vlib_rm_buffer_callbacks_t_##x (void) \
562 __attribute__((__destructor__)) ; \
563static void __vlib_rm_buffer_callbacks_t_##x (void) \
564{ vlib_buffer_callbacks = 0; } \
Damjan Marion04a7f052017-07-10 15:06:17 +0200565__VA_ARGS__ vlib_buffer_callbacks_t __##x##_buffer_callbacks
566
Dave Barach9b8ffd92016-07-08 08:13:45 -0400567/*
568 * fd.io coding-style-patch-verification: ON
569 *
570 * Local Variables:
571 * eval: (c-set-style "gnu")
572 * End:
573 */