blob: 349b7324996f03adf4bc36ca45a08b00c4543eb9 [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 Marion19010202016-03-24 17:17:47 +010051#define VLIB_BUFFER_PRE_DATA_SIZE __PRE_DATA_SIZE
Ed Warnickecb9cada2015-12-08 15:45:58 -070052
Damjan Marion5de3fec2019-02-06 14:22:32 +010053#define VLIB_BUFFER_DEFAULT_DATA_SIZE (2048)
54
Damjan Marionbd0da972018-10-31 10:59:02 +010055/* Minimum buffer chain segment size. Does not apply to last buffer in chain.
56 Dataplane code can safely asume that specified amount of data is not split
57 into 2 chained buffers */
58#define VLIB_BUFFER_MIN_CHAIN_SEG_SIZE (128)
59
60/* Amount of head buffer data copied to each replica head buffer */
61#define VLIB_BUFFER_CLONE_HEAD_SIZE (256)
62
Ed Warnickecb9cada2015-12-08 15:45:58 -070063/** \file
64 vlib buffer structure definition and a few select
65 access methods. This structure and the buffer allocation
Dave Barach9b8ffd92016-07-08 08:13:45 -040066 mechanism should perhaps live in vnet, but it would take a lot
Ed Warnickecb9cada2015-12-08 15:45:58 -070067 of typing to make it so.
68*/
Dave Barach9b8ffd92016-07-08 08:13:45 -040069
Damjan Mariondac03522018-02-01 15:30:13 +010070/**
71 * Buffer Flags
72 */
73#define foreach_vlib_buffer_flag \
Damjan Marion36eb7c22019-01-18 20:45:30 +010074 _( 0, IS_TRACED, 0) \
Benoît Ganne43543172019-10-21 15:13:54 +020075 _( 1, NEXT_PRESENT, "next-present") \
Damjan Marion36eb7c22019-01-18 20:45:30 +010076 _( 2, TOTAL_LENGTH_VALID, 0) \
77 _( 3, EXT_HDR_VALID, "ext-hdr-valid")
Damjan Mariondac03522018-02-01 15:30:13 +010078
79/* NOTE: only buffer generic flags should be defined here, please consider
80 using user flags. i.e. src/vnet/buffer.h */
81
82enum
83{
84#define _(bit, name, v) VLIB_BUFFER_##name = (1 << (bit)),
85 foreach_vlib_buffer_flag
86#undef _
87};
88
89enum
90{
91#define _(bit, name, v) VLIB_BUFFER_LOG2_##name = (bit),
92 foreach_vlib_buffer_flag
93#undef _
94};
95
96 /* User defined buffer flags. */
97#define LOG2_VLIB_BUFFER_FLAG_USER(n) (32 - (n))
98#define VLIB_BUFFER_FLAG_USER(n) (1 << LOG2_VLIB_BUFFER_FLAG_USER(n))
Damjan Marion36eb7c22019-01-18 20:45:30 +010099#define VLIB_BUFFER_FLAGS_ALL (0x0f)
Damjan Mariondac03522018-02-01 15:30:13 +0100100
Benoît Gannef89bbbe2021-03-04 14:31:03 +0100101/** \brief Compile time buffer trajectory tracing option
102 Turn this on if you run into "bad monkey" contexts,
103 and you want to know exactly which nodes they've visited...
104 See vlib/main.c...
105*/
106#ifndef VLIB_BUFFER_TRACE_TRAJECTORY
107#define VLIB_BUFFER_TRACE_TRAJECTORY 0
108#endif /* VLIB_BUFFER_TRACE_TRAJECTORY */
109
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100110/** VLIB buffer representation. */
111typedef union
Dave Barach9b8ffd92016-07-08 08:13:45 -0400112{
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100113 struct
114 {
115 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
Damjan Marion072401e2017-07-13 18:53:27 +0200116
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100117 /** signed offset in data[], pre_data[] that we are currently
118 * processing. If negative current header points into predata area. */
119 i16 current_data;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700120
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100121 /** Nbytes between current data and the end of this buffer. */
122 u16 current_length;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700123
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100124 /** buffer flags:
125 <br> VLIB_BUFFER_FREE_LIST_INDEX_MASK: bits used to store free list index,
126 <br> VLIB_BUFFER_IS_TRACED: trace this buffer.
127 <br> VLIB_BUFFER_NEXT_PRESENT: this is a multi-chunk buffer.
128 <br> VLIB_BUFFER_TOTAL_LENGTH_VALID: as it says
129 <br> VLIB_BUFFER_EXT_HDR_VALID: buffer contains valid external buffer manager header,
130 set to avoid adding it to a flow report
131 <br> VLIB_BUFFER_FLAG_USER(n): user-defined bit N
132 */
133 u32 flags;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700134
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100135 /** Generic flow identifier */
136 u32 flow_id;
Damjan Marionc47ed032017-01-25 14:18:03 +0100137
Damjan Marion910d3692019-01-21 11:48:34 +0100138 /** Reference count for this buffer. */
139 volatile u8 ref_count;
Dave Barachb5adaea2016-06-17 14:09:56 -0400140
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100141 /** index of buffer pool this buffer belongs. */
142 u8 buffer_pool_index;
Damjan Marione58041f2019-01-18 19:56:09 +0100143
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100144 /** Error code for buffers to be enqueued to error handler. */
145 vlib_error_t error;
Damjan Marione58041f2019-01-18 19:56:09 +0100146
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100147 /** Next buffer for this linked-list of buffers. Only valid if
148 * VLIB_BUFFER_NEXT_PRESENT flag is set. */
149 u32 next_buffer;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700150
Neale Ranns76b56492018-09-28 15:16:14 +0000151 /** The following fields can be in a union because once a packet enters
152 * the punt path, it is no longer on a feature arc */
153 union
154 {
155 /** Used by feature subgraph arcs to visit enabled feature nodes */
156 u32 current_config_index;
157 /* the reason the packet once punted */
158 u32 punt_reason;
159 };
Damjan Marion072401e2017-07-13 18:53:27 +0200160
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100161 /** Opaque data used by sub-graphs for their own purposes. */
162 u32 opaque[10];
Ed Warnickecb9cada2015-12-08 15:45:58 -0700163
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100164 /** part of buffer metadata which is initialized on alloc ends here. */
165 STRUCT_MARK (template_end);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700166
Damjan Marion6807b772020-11-13 10:46:32 +0100167 /** start of 2nd half (2nd cacheline on systems where cacheline size is 64) */
168 CLIB_ALIGN_MARK (second_half, 64);
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100169
Dave Baracha638c182019-06-21 18:24:07 -0400170 /** Specifies trace buffer handle if VLIB_PACKET_IS_TRACED flag is
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100171 * set. */
Dave Baracha638c182019-06-21 18:24:07 -0400172 u32 trace_handle;
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100173
174 /** Only valid for first buffer in chain. Current length plus total length
175 * given here give total number of bytes in buffer chain. */
176 u32 total_length_not_including_first_buffer;
177
178 /**< More opaque data, see ../vnet/vnet/buffer.h */
179 u32 opaque2[14];
180
Benoît Gannef89bbbe2021-03-04 14:31:03 +0100181#if VLIB_BUFFER_TRACE_TRAJECTORY > 0
182 /** trace trajectory data - we use a specific cacheline for that in the
183 * buffer when it is compiled-in */
184#define VLIB_BUFFER_TRACE_TRAJECTORY_MAX 31
185#define VLIB_BUFFER_TRACE_TRAJECTORY_SZ 64
186#define VLIB_BUFFER_TRACE_TRAJECTORY_INIT(b) (b)->trajectory_nb = 0
187 CLIB_ALIGN_MARK (trajectory, 64);
188 u16 trajectory_nb;
189 u16 trajectory_trace[VLIB_BUFFER_TRACE_TRAJECTORY_MAX];
190#else /* VLIB_BUFFER_TRACE_TRAJECTORY */
191#define VLIB_BUFFER_TRACE_TRAJECTORY_SZ 0
192#define VLIB_BUFFER_TRACE_TRAJECTORY_INIT(b)
193#endif /* VLIB_BUFFER_TRACE_TRAJECTORY */
194
Damjan Marion6807b772020-11-13 10:46:32 +0100195 /** start of buffer headroom */
196 CLIB_ALIGN_MARK (headroom, 64);
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100197
198 /** Space for inserting data before buffer start. Packet rewrite string
199 * will be rewritten backwards and may extend back before
200 * buffer->data[0]. Must come directly before packet data. */
201 u8 pre_data[VLIB_BUFFER_PRE_DATA_SIZE];
202
203 /** Packet data */
Benoît Ganne049d0b42020-04-24 11:48:04 +0200204 u8 data[];
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100205 };
206#ifdef CLIB_HAVE_VEC128
207 u8x16 as_u8x16[4];
208#endif
209#ifdef CLIB_HAVE_VEC256
Damjan Marion22f23ae2019-01-24 15:36:57 +0100210 u8x32 as_u8x32[2];
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100211#endif
212#ifdef CLIB_HAVE_VEC512
Damjan Marion22f23ae2019-01-24 15:36:57 +0100213 u8x64 as_u8x64[1];
Damjan Marion9a8a12a2019-01-23 16:52:10 +0100214#endif
215} vlib_buffer_t;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700216
Benoît Gannef89bbbe2021-03-04 14:31:03 +0100217STATIC_ASSERT_SIZEOF (vlib_buffer_t, 128 + VLIB_BUFFER_TRACE_TRAJECTORY_SZ +
218 VLIB_BUFFER_PRE_DATA_SIZE);
Damjan Marion6807b772020-11-13 10:46:32 +0100219STATIC_ASSERT (VLIB_BUFFER_PRE_DATA_SIZE % CLIB_CACHE_LINE_BYTES == 0,
220 "VLIB_BUFFER_PRE_DATA_SIZE must be divisible by cache line size");
221
Damjan Marion19010202016-03-24 17:17:47 +0100222#define VLIB_BUFFER_HDR_SIZE (sizeof(vlib_buffer_t) - VLIB_BUFFER_PRE_DATA_SIZE)
223
Ed Warnickecb9cada2015-12-08 15:45:58 -0700224/** \brief Prefetch buffer metadata.
225 The first 64 bytes of buffer contains most header information
226
227 @param b - (vlib_buffer_t *) pointer to the buffer
228 @param type - LOAD, STORE. In most cases, STORE is the right answer
229*/
230
231#define vlib_prefetch_buffer_header(b,type) CLIB_PREFETCH (b, 64, type)
Damjan Mariond30bf012018-11-18 23:48:43 +0100232#define vlib_prefetch_buffer_data(b,type) \
233 CLIB_PREFETCH (vlib_buffer_get_current(b), CLIB_CACHE_LINE_BYTES, type)
Ed Warnickecb9cada2015-12-08 15:45:58 -0700234
Ed Warnickecb9cada2015-12-08 15:45:58 -0700235always_inline void
236vlib_buffer_struct_is_sane (vlib_buffer_t * b)
237{
238 ASSERT (sizeof (b[0]) % 64 == 0);
239
240 /* Rewrite data must be before and contiguous with packet data. */
241 ASSERT (b->pre_data + VLIB_BUFFER_PRE_DATA_SIZE == b->data);
242}
243
Damjan Marion8f499362018-10-22 13:07:02 +0200244always_inline uword
245vlib_buffer_get_va (vlib_buffer_t * b)
246{
247 return pointer_to_uword (b->data);
248}
249
Ed Warnickecb9cada2015-12-08 15:45:58 -0700250/** \brief Get pointer to current data to process
251
252 @param b - (vlib_buffer_t *) pointer to the buffer
253 @return - (void *) (b->data + b->current_data)
Dave Barach9b8ffd92016-07-08 08:13:45 -0400254*/
Ed Warnickecb9cada2015-12-08 15:45:58 -0700255
256always_inline void *
257vlib_buffer_get_current (vlib_buffer_t * b)
258{
259 /* Check bounds. */
260 ASSERT ((signed) b->current_data >= (signed) -VLIB_BUFFER_PRE_DATA_SIZE);
261 return b->data + b->current_data;
262}
263
Damjan Marion8f499362018-10-22 13:07:02 +0200264always_inline uword
265vlib_buffer_get_current_va (vlib_buffer_t * b)
266{
267 return vlib_buffer_get_va (b) + b->current_data;
268}
269
Ed Warnickecb9cada2015-12-08 15:45:58 -0700270/** \brief Advance current data pointer by the supplied (signed!) amount
271
272 @param b - (vlib_buffer_t *) pointer to the buffer
273 @param l - (word) signed increment
Dave Barach9b8ffd92016-07-08 08:13:45 -0400274*/
Ed Warnickecb9cada2015-12-08 15:45:58 -0700275always_inline void
276vlib_buffer_advance (vlib_buffer_t * b, word l)
277{
278 ASSERT (b->current_length >= l);
279 b->current_data += l;
280 b->current_length -= l;
Damjan Marionbd0da972018-10-31 10:59:02 +0100281
282 ASSERT ((b->flags & VLIB_BUFFER_NEXT_PRESENT) == 0 ||
283 b->current_length >= VLIB_BUFFER_MIN_CHAIN_SEG_SIZE);
Ed Warnickecb9cada2015-12-08 15:45:58 -0700284}
285
Filip Tehlar816f4372017-04-26 16:09:06 +0200286/** \brief Check if there is enough space in buffer to advance
287
288 @param b - (vlib_buffer_t *) pointer to the buffer
289 @param l - (word) size to check
290 @return - 0 if there is less space than 'l' in buffer
291*/
292always_inline u8
293vlib_buffer_has_space (vlib_buffer_t * b, word l)
294{
295 return b->current_length >= l;
296}
297
Ed Warnickecb9cada2015-12-08 15:45:58 -0700298/** \brief Reset current header & length to state they were in when
299 packet was received.
300
301 @param b - (vlib_buffer_t *) pointer to the buffer
302*/
303
304always_inline void
305vlib_buffer_reset (vlib_buffer_t * b)
306{
307 b->current_length += clib_max (b->current_data, 0);
308 b->current_data = 0;
309}
310
311/** \brief Get pointer to buffer's opaque data array
312
313 @param b - (vlib_buffer_t *) pointer to the buffer
314 @return - (void *) b->opaque
315*/
316always_inline void *
317vlib_get_buffer_opaque (vlib_buffer_t * b)
Dave Barach9b8ffd92016-07-08 08:13:45 -0400318{
319 return (void *) b->opaque;
320}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700321
322/** \brief Get pointer to buffer's opaque2 data array
323
324 @param b - (vlib_buffer_t *) pointer to the buffer
325 @return - (void *) b->opaque2
326*/
327always_inline void *
328vlib_get_buffer_opaque2 (vlib_buffer_t * b)
Dave Barach9b8ffd92016-07-08 08:13:45 -0400329{
330 return (void *) b->opaque2;
331}
Ed Warnickecb9cada2015-12-08 15:45:58 -0700332
Dave Barach68b0fb02017-02-28 15:15:56 -0500333/** \brief Get pointer to the end of buffer's data
334 * @param b pointer to the buffer
335 * @return pointer to tail of packet's data
336 */
337always_inline u8 *
338vlib_buffer_get_tail (vlib_buffer_t * b)
339{
340 return b->data + b->current_data + b->current_length;
341}
342
343/** \brief Append uninitialized data to buffer
344 * @param b pointer to the buffer
345 * @param size number of uninitialized bytes
346 * @return pointer to beginning of uninitialized data
347 */
348always_inline void *
Eyal Barid3d42412018-11-05 13:29:25 +0200349vlib_buffer_put_uninit (vlib_buffer_t * b, u16 size)
Dave Barach68b0fb02017-02-28 15:15:56 -0500350{
351 void *p = vlib_buffer_get_tail (b);
352 /* XXX make sure there's enough space */
353 b->current_length += size;
354 return p;
355}
356
357/** \brief Prepend uninitialized data to buffer
358 * @param b pointer to the buffer
359 * @param size number of uninitialized bytes
360 * @return pointer to beginning of uninitialized data
361 */
362always_inline void *
363vlib_buffer_push_uninit (vlib_buffer_t * b, u8 size)
364{
365 ASSERT (b->current_data + VLIB_BUFFER_PRE_DATA_SIZE >= size);
366 b->current_data -= size;
367 b->current_length += size;
368
369 return vlib_buffer_get_current (b);
370}
371
372/** \brief Make head room, typically for packet headers
373 * @param b pointer to the buffer
374 * @param size number of head room bytes
375 * @return pointer to start of buffer (current data)
376 */
377always_inline void *
378vlib_buffer_make_headroom (vlib_buffer_t * b, u8 size)
379{
Dave Barach68b0fb02017-02-28 15:15:56 -0500380 b->current_data += size;
381 return vlib_buffer_get_current (b);
382}
383
Dave Baracha638c182019-06-21 18:24:07 -0400384/** \brief Construct a trace handle from thread and pool index
385 * @param thread Thread id
386 * @param pool_index Pool index
387 * @return trace handle
388 */
389always_inline u32
390vlib_buffer_make_trace_handle (u32 thread, u32 pool_index)
391{
392 u32 rv;
393 ASSERT (thread < 0xff);
394 ASSERT (pool_index < 0x00FFFFFF);
395 rv = (thread << 24) | (pool_index & 0x00FFFFFF);
396 return rv;
397}
398
399/** \brief Extract the thread id from a trace handle
400 * @param trace_handle the trace handle
401 * @return the thread id
402 */
403always_inline u32
404vlib_buffer_get_trace_thread (vlib_buffer_t * b)
405{
406 u32 trace_handle = b->trace_handle;
407
408 return trace_handle >> 24;
409}
410
411/** \brief Extract the trace (pool) index from a trace handle
412 * @param trace_handle the trace handle
413 * @return the trace index
414 */
415always_inline u32
416vlib_buffer_get_trace_index (vlib_buffer_t * b)
417{
418 u32 trace_handle = b->trace_handle;
419 return trace_handle & 0x00FFFFFF;
420}
421
Dave Barach68b0fb02017-02-28 15:15:56 -0500422/** \brief Retrieve bytes from buffer head
423 * @param b pointer to the buffer
424 * @param size number of bytes to pull
425 * @return pointer to start of buffer (current data)
426 */
427always_inline void *
428vlib_buffer_pull (vlib_buffer_t * b, u8 size)
429{
430 if (b->current_length + VLIB_BUFFER_PRE_DATA_SIZE < size)
431 return 0;
432
433 void *data = vlib_buffer_get_current (b);
434 vlib_buffer_advance (b, size);
435 return data;
436}
437
Ed Warnickecb9cada2015-12-08 15:45:58 -0700438/* Forward declaration. */
439struct vlib_main_t;
440
Damjan Marionb6e8b1a2019-03-12 18:14:15 +0100441#define VLIB_BUFFER_POOL_PER_THREAD_CACHE_SZ 512
442
Dave Barach9b8ffd92016-07-08 08:13:45 -0400443typedef struct
444{
Damjan Marion910d3692019-01-21 11:48:34 +0100445 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
Damjan Marionb6e8b1a2019-03-12 18:14:15 +0100446 u32 cached_buffers[VLIB_BUFFER_POOL_PER_THREAD_CACHE_SZ];
447 u32 n_cached;
Damjan Marion910d3692019-01-21 11:48:34 +0100448} vlib_buffer_pool_thread_t;
Damjan Marionb6e8b1a2019-03-12 18:14:15 +0100449
Damjan Marion878c6092017-01-04 13:19:27 +0100450typedef struct
451{
Damjan Marion04a7f052017-07-10 15:06:17 +0200452 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
Damjan Marion149ba772017-10-12 13:09:26 +0200453 uword start;
454 uword size;
Damjan Mariond1274cb2018-03-13 21:32:17 +0100455 uword log2_page_size;
Damjan Marion910d3692019-01-21 11:48:34 +0100456 u8 index;
457 u32 numa_node;
Damjan Marion68b4da62018-09-30 18:26:20 +0200458 u32 physmem_map_index;
Damjan Marion910d3692019-01-21 11:48:34 +0100459 u32 data_size;
460 u32 n_buffers;
Damjan Marionb6e8b1a2019-03-12 18:14:15 +0100461 u32 n_avail;
Damjan Mariond1274cb2018-03-13 21:32:17 +0100462 u32 *buffers;
Damjan Marion910d3692019-01-21 11:48:34 +0100463 u8 *name;
Damjan Mariond1274cb2018-03-13 21:32:17 +0100464 clib_spinlock_t lock;
Damjan Marion910d3692019-01-21 11:48:34 +0100465
466 /* per-thread data */
467 vlib_buffer_pool_thread_t *threads;
468
469 /* buffer metadata template */
470 vlib_buffer_t buffer_template;
Damjan Marion149ba772017-10-12 13:09:26 +0200471} vlib_buffer_pool_t;
472
Damjan Marionb592d1b2019-02-28 23:16:11 +0100473#define VLIB_BUFFER_MAX_NUMA_NODES 32
474
Damjan Marion149ba772017-10-12 13:09:26 +0200475typedef struct
476{
477 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
Damjan Marion04a7f052017-07-10 15:06:17 +0200478 /* Virtual memory address and size of buffer memory, used for calculating
479 buffer index */
480 uword buffer_mem_start;
481 uword buffer_mem_size;
Damjan Marion149ba772017-10-12 13:09:26 +0200482 vlib_buffer_pool_t *buffer_pools;
Damjan Marion04a7f052017-07-10 15:06:17 +0200483
Ed Warnickecb9cada2015-12-08 15:45:58 -0700484 /* Hash table mapping buffer index into number
485 0 => allocated but free, 1 => allocated and not-free.
486 If buffer index is not in hash table then this buffer
487 has never been allocated. */
Dave Barach9b8ffd92016-07-08 08:13:45 -0400488 uword *buffer_known_hash;
Damjan Marion6b0f5892017-07-27 04:01:24 -0400489 clib_spinlock_t buffer_known_hash_lockp;
Damjan Marionb592d1b2019-02-28 23:16:11 +0100490 u8 default_buffer_pool_index_for_numa[VLIB_BUFFER_MAX_NUMA_NODES];
Ed Warnickecb9cada2015-12-08 15:45:58 -0700491
Damjan Marion910d3692019-01-21 11:48:34 +0100492 /* config */
493 u32 buffers_per_numa;
494 u16 ext_hdr_size;
Damjan Marion5de3fec2019-02-06 14:22:32 +0100495 u32 default_data_size;
Nathan Skrzypczak61559022020-11-23 16:25:21 +0100496 clib_mem_page_sz_t log2_page_size;
Damjan Marion910d3692019-01-21 11:48:34 +0100497
498 /* logging */
499 vlib_log_class_t log_default;
Ed Warnickecb9cada2015-12-08 15:45:58 -0700500} vlib_buffer_main_t;
501
Damjan Marion49d66f12017-07-20 18:10:35 +0200502clib_error_t *vlib_buffer_main_init (struct vlib_main_t *vm);
Damjan Marion878c6092017-01-04 13:19:27 +0100503
Damjan Marion910d3692019-01-21 11:48:34 +0100504extern u16 __vlib_buffer_external_hdr_size;
505#define VLIB_BUFFER_SET_EXT_HDR_SIZE(x) \
506static void __clib_constructor \
507vnet_buffer_set_ext_hdr_size() \
508{ \
509 if (__vlib_buffer_external_hdr_size) \
510 clib_error ("buffer external header space already set"); \
511 __vlib_buffer_external_hdr_size = CLIB_CACHE_LINE_ROUND (x); \
512}
Dave Barach9b8ffd92016-07-08 08:13:45 -0400513
Damjan Marion910d3692019-01-21 11:48:34 +0100514#endif /* included_vlib_buffer_h */
Damjan Marion04a7f052017-07-10 15:06:17 +0200515
Dave Barach9b8ffd92016-07-08 08:13:45 -0400516/*
517 * fd.io coding-style-patch-verification: ON
518 *
519 * Local Variables:
520 * eval: (c-set-style "gnu")
521 * End:
522 */