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:
7 * http://www.apache.org/licenses/LICENSE-2.0
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.
16 * buffer.c: allocate/free network buffers.
18 * Copyright (c) 2008 Eliot Dresselhaus
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:
28 * The above copyright notice and this permission notice shall be
29 * included in all copies or substantial portions of the Software.
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.
43 * Allocate/free network buffers.
46 #include <vlib/vlib.h>
47 #include <vlib/unix/unix.h>
49 vlib_buffer_callbacks_t *vlib_buffer_callbacks = 0;
50 static u32 vlib_buffer_physmem_sz = 32 << 20;
52 vlib_buffer_main_t buffer_main;
55 vlib_buffer_length_in_chain_slow_path (vlib_main_t * vm,
56 vlib_buffer_t * b_first)
58 vlib_buffer_t *b = b_first;
59 uword l_first = b_first->current_length;
61 while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
63 b = vlib_get_buffer (vm, b->next_buffer);
64 l += b->current_length;
66 b_first->total_length_not_including_first_buffer = l;
67 b_first->flags |= VLIB_BUFFER_TOTAL_LENGTH_VALID;
72 format_vlib_buffer (u8 * s, va_list * args)
74 vlib_buffer_t *b = va_arg (*args, vlib_buffer_t *);
75 u32 indent = format_get_indent (s);
78 #define _(bit, name, v) \
79 if (v && (b->flags & VLIB_BUFFER_##name)) \
80 a = format (a, "%s ", v);
81 foreach_vlib_buffer_flag
83 s = format (s, "current data %d, length %d, free-list %d, clone-count %u",
84 b->current_data, b->current_length,
85 vlib_buffer_get_free_list_index (b), b->n_add_refs);
87 if (b->flags & VLIB_BUFFER_TOTAL_LENGTH_VALID)
88 s = format (s, ", totlen-nifb %d",
89 b->total_length_not_including_first_buffer);
91 if (b->flags & VLIB_BUFFER_IS_TRACED)
92 s = format (s, ", trace 0x%x", b->trace_index);
95 s = format (s, "\n%U%v", format_white_space, indent, a);
98 while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
100 vlib_main_t *vm = vlib_get_main ();
101 u32 next_buffer = b->next_buffer;
102 b = vlib_get_buffer (vm, next_buffer);
105 format (s, "\n%Unext-buffer 0x%x, segment length %d, clone-count %u",
106 format_white_space, indent, next_buffer, b->current_length,
114 format_vlib_buffer_and_data (u8 * s, va_list * args)
116 vlib_buffer_t *b = va_arg (*args, vlib_buffer_t *);
118 s = format (s, "%U, %U",
119 format_vlib_buffer, b,
120 format_hex_bytes, vlib_buffer_get_current (b), 64);
126 format_vlib_buffer_known_state (u8 * s, va_list * args)
128 vlib_buffer_known_state_t state = va_arg (*args, vlib_buffer_known_state_t);
133 case VLIB_BUFFER_UNKNOWN:
137 case VLIB_BUFFER_KNOWN_ALLOCATED:
138 t = "known-allocated";
141 case VLIB_BUFFER_KNOWN_FREE:
150 return format (s, "%s", t);
154 format_vlib_buffer_contents (u8 * s, va_list * va)
156 vlib_main_t *vm = va_arg (*va, vlib_main_t *);
157 vlib_buffer_t *b = va_arg (*va, vlib_buffer_t *);
161 vec_add (s, vlib_buffer_get_current (b), b->current_length);
162 if (!(b->flags & VLIB_BUFFER_NEXT_PRESENT))
164 b = vlib_get_buffer (vm, b->next_buffer);
171 vlib_validate_buffer_helper (vlib_main_t * vm,
173 uword follow_buffer_next, uword ** unique_hash)
175 vlib_buffer_t *b = vlib_get_buffer (vm, bi);
176 vlib_buffer_free_list_t *fl;
178 if (pool_is_free_index
179 (vm->buffer_free_list_pool, vlib_buffer_get_free_list_index (b)))
180 return format (0, "unknown free list 0x%x",
181 vlib_buffer_get_free_list_index (b));
184 pool_elt_at_index (vm->buffer_free_list_pool,
185 vlib_buffer_get_free_list_index (b));
187 if ((signed) b->current_data < (signed) -VLIB_BUFFER_PRE_DATA_SIZE)
188 return format (0, "current data %d before pre-data", b->current_data);
190 if (b->current_data + b->current_length > fl->n_data_bytes)
191 return format (0, "%d-%d beyond end of buffer %d",
192 b->current_data, b->current_length, fl->n_data_bytes);
194 if (follow_buffer_next && (b->flags & VLIB_BUFFER_NEXT_PRESENT))
196 vlib_buffer_known_state_t k;
199 k = vlib_buffer_is_known (b->next_buffer);
200 if (k != VLIB_BUFFER_KNOWN_ALLOCATED)
201 return format (0, "next 0x%x: %U",
202 b->next_buffer, format_vlib_buffer_known_state, k);
206 if (hash_get (*unique_hash, b->next_buffer))
207 return format (0, "duplicate buffer 0x%x", b->next_buffer);
209 hash_set1 (*unique_hash, b->next_buffer);
212 msg = vlib_validate_buffer (vm, b->next_buffer, follow_buffer_next);
215 result = format (0, "next 0x%x: %v", b->next_buffer, msg);
225 vlib_validate_buffer (vlib_main_t * vm, u32 bi, uword follow_buffer_next)
227 return vlib_validate_buffer_helper (vm, bi, follow_buffer_next,
228 /* unique_hash */ 0);
232 vlib_validate_buffers (vlib_main_t * vm,
234 uword next_buffer_stride,
236 vlib_buffer_known_state_t known_state,
237 uword follow_buffer_next)
240 u32 bi, *b = buffers;
241 vlib_buffer_known_state_t k;
242 u8 *msg = 0, *result = 0;
244 hash = hash_create (0, 0);
245 for (i = 0; i < n_buffers; i++)
248 b += next_buffer_stride;
250 /* Buffer is not unique. */
251 if (hash_get (hash, bi))
253 msg = format (0, "not unique");
257 k = vlib_buffer_is_known (bi);
258 if (k != known_state)
260 msg = format (0, "is %U; expected %U",
261 format_vlib_buffer_known_state, k,
262 format_vlib_buffer_known_state, known_state);
266 msg = vlib_validate_buffer_helper (vm, bi, follow_buffer_next, &hash);
270 hash_set1 (hash, bi);
276 result = format (0, "0x%x: %v", bi, msg);
284 * Hand-craft a static vector w/ length 1, so vec_len(vlib_mains) =1
285 * and vlib_mains[0] = &vlib_global_main from the beginning of time.
287 * The only place which should ever expand vlib_mains is start_workers()
288 * in threads.c. It knows about the bootstrap vector.
295 } __attribute__ ((packed)) __bootstrap_vlib_main_vector
296 __attribute__ ((aligned (CLIB_CACHE_LINE_BYTES))) =
299 .vm = &vlib_global_main,
303 vlib_main_t **vlib_mains = &__bootstrap_vlib_main_vector.vm;
306 /* When dubugging validate that given buffers are either known allocated
309 vlib_buffer_validate_alloc_free (vlib_main_t * vm,
312 vlib_buffer_known_state_t expected_state)
315 uword i, bi, is_free;
320 if (vlib_buffer_callbacks)
323 is_free = expected_state == VLIB_BUFFER_KNOWN_ALLOCATED;
325 for (i = 0; i < n_buffers; i++)
327 vlib_buffer_known_state_t known;
331 known = vlib_buffer_is_known (bi);
332 if (known != expected_state)
336 (vm, "%s %U buffer 0x%x",
337 is_free ? "freeing" : "allocating",
338 format_vlib_buffer_known_state, known, bi);
341 vlib_buffer_set_known_state
342 (bi, is_free ? VLIB_BUFFER_KNOWN_FREE : VLIB_BUFFER_KNOWN_ALLOCATED);
346 /* Add buffer free list. */
347 static vlib_buffer_free_list_index_t
348 vlib_buffer_create_free_list_helper (vlib_main_t * vm,
350 u32 is_public, u32 is_default, u8 * name)
352 vlib_buffer_main_t *bm = &buffer_main;
353 vlib_buffer_free_list_t *f;
356 ASSERT (vlib_get_thread_index () == 0);
358 if (!is_default && pool_elts (vm->buffer_free_list_pool) == 0)
360 vlib_buffer_free_list_index_t default_free_free_list_index;
363 default_free_free_list_index =
364 vlib_buffer_create_free_list_helper
366 /* default buffer size */ VLIB_BUFFER_DEFAULT_FREE_LIST_BYTES,
371 ASSERT (default_free_free_list_index ==
372 VLIB_BUFFER_DEFAULT_FREE_LIST_INDEX);
374 if (n_data_bytes == VLIB_BUFFER_DEFAULT_FREE_LIST_BYTES && is_public)
375 return default_free_free_list_index;
378 pool_get_aligned (vm->buffer_free_list_pool, f, CLIB_CACHE_LINE_BYTES);
380 memset (f, 0, sizeof (f[0]));
381 f->index = f - vm->buffer_free_list_pool;
382 f->n_data_bytes = vlib_buffer_round_size (n_data_bytes);
383 f->min_n_buffers_each_alloc = VLIB_FRAME_SIZE;
384 f->buffer_pool_index = 0;
385 f->name = clib_mem_is_vec (name) ? name : format (0, "%s", name);
387 /* Setup free buffer template. */
388 vlib_buffer_set_free_list_index (&f->buffer_init_template, f->index);
389 f->buffer_init_template.n_add_refs = 0;
393 uword *p = hash_get (bm->free_list_by_size, f->n_data_bytes);
395 hash_set (bm->free_list_by_size, f->n_data_bytes, f->index);
398 for (i = 1; i < vec_len (vlib_mains); i++)
400 vlib_main_t *wvm = vlib_mains[i];
401 vlib_buffer_free_list_t *wf;
402 pool_get_aligned (wvm->buffer_free_list_pool,
403 wf, CLIB_CACHE_LINE_BYTES);
404 ASSERT (f - vm->buffer_free_list_pool ==
405 wf - wvm->buffer_free_list_pool);
414 vlib_buffer_free_list_index_t
415 vlib_buffer_create_free_list (vlib_main_t * vm, u32 n_data_bytes,
422 name = va_format (0, fmt, &va);
425 return vlib_buffer_create_free_list_helper (vm, n_data_bytes,
432 del_free_list (vlib_main_t * vm, vlib_buffer_free_list_t * f)
434 vlib_buffer_pool_t *bp = vlib_buffer_pool_get (f->buffer_pool_index);
436 vec_add_aligned (bp->buffers, f->buffers, vec_len (f->buffers),
437 CLIB_CACHE_LINE_BYTES);
439 vec_free (f->buffers);
442 memset (f, 0xab, sizeof (f[0]));
445 /* Add buffer free list. */
447 vlib_buffer_delete_free_list_internal (vlib_main_t * vm,
448 vlib_buffer_free_list_index_t index)
450 vlib_buffer_free_list_t *f;
453 ASSERT (vlib_get_thread_index () == 0);
455 f = vlib_buffer_get_free_list (vm, index);
457 ASSERT (vec_len (f->buffers) == f->n_alloc);
459 del_free_list (vm, f);
461 pool_put (vm->buffer_free_list_pool, f);
463 for (i = 1; i < vec_len (vlib_mains); i++)
465 vlib_main_t *wvm = vlib_mains[i];
466 f = vlib_buffer_get_free_list (vlib_mains[i], index);
467 del_free_list (wvm, f);
468 pool_put (wvm->buffer_free_list_pool, f);
472 static_always_inline void *
473 vlib_buffer_pool_get_buffer (vlib_buffer_pool_t * bp)
475 uword slot, page, addr;
477 if (PREDICT_FALSE (bp->n_elts == bp->n_used))
479 clib_spinlock_unlock (&bp->lock);
482 slot = bp->next_clear;
483 bp->bitmap = clib_bitmap_set (bp->bitmap, slot, 1);
484 bp->next_clear = clib_bitmap_next_clear (bp->bitmap, slot + 1);
487 page = slot / bp->buffers_per_page;
488 slot -= page * bp->buffers_per_page;
490 addr = bp->start + (page << bp->log2_page_size) + slot * bp->buffer_size;
492 return uword_to_pointer (addr, void *);
495 /* Make sure free list has at least given number of free buffers. */
497 vlib_buffer_fill_free_list_internal (vlib_main_t * vm,
498 vlib_buffer_free_list_t * fl,
499 uword min_free_buffers)
502 vlib_buffer_pool_t *bp = vlib_buffer_pool_get (fl->buffer_pool_index);
507 /* Already have enough free buffers on free list? */
508 n = min_free_buffers - vec_len (fl->buffers);
510 return min_free_buffers;
512 if (vec_len (bp->buffers) > 0)
515 clib_spinlock_lock (&bp->lock);
516 n_copy = clib_min (vec_len (bp->buffers), n);
517 n_left = vec_len (bp->buffers) - n_copy;
518 vec_add_aligned (fl->buffers, bp->buffers + n_left, n_copy,
519 CLIB_CACHE_LINE_BYTES);
520 _vec_len (bp->buffers) = n_left;
521 clib_spinlock_unlock (&bp->lock);
522 n = min_free_buffers - vec_len (fl->buffers);
524 return min_free_buffers;
527 /* Always allocate round number of buffers. */
528 n = round_pow2 (n, CLIB_CACHE_LINE_BYTES / sizeof (u32));
530 /* Always allocate new buffers in reasonably large sized chunks. */
531 n = clib_max (n, fl->min_n_buffers_each_alloc);
533 clib_spinlock_lock (&bp->lock);
536 if ((b = vlib_buffer_pool_get_buffer (bp)) == 0)
541 vec_add2_aligned (fl->buffers, bi, 1, CLIB_CACHE_LINE_BYTES);
542 bi[0] = vlib_get_buffer_index (vm, b);
545 vlib_buffer_set_known_state (bi[0], VLIB_BUFFER_KNOWN_FREE);
547 memset (b, 0, sizeof (vlib_buffer_t));
548 vlib_buffer_init_for_free_list (b, fl);
550 if (fl->buffer_init_function)
551 fl->buffer_init_function (vm, fl, bi, 1);
555 clib_spinlock_unlock (&bp->lock);
556 fl->n_alloc += n_alloc;
561 vlib_set_buffer_free_callback (vlib_main_t * vm, void *fp)
563 vlib_buffer_main_t *bm = &buffer_main;
564 void *rv = bm->buffer_free_callback;
566 bm->buffer_free_callback = fp;
570 static_always_inline void
571 recycle_or_free (vlib_main_t * vm, vlib_buffer_main_t * bm, u32 bi,
572 vlib_buffer_t * b, u32 follow_buffer_next)
574 vlib_buffer_free_list_t *fl;
575 vlib_buffer_free_list_index_t fi;
578 fl = vlib_buffer_get_buffer_free_list (vm, b, &fi);
582 vlib_buffer_t *nb = vlib_get_buffer (vm, bi);
584 next = nb->next_buffer;
589 vlib_buffer_validate_alloc_free (vm, &bi, 1,
590 VLIB_BUFFER_KNOWN_ALLOCATED);
591 vlib_buffer_add_to_free_list (vm, fl, bi, 1);
595 while (follow_buffer_next && (flags & VLIB_BUFFER_NEXT_PRESENT));
598 static_always_inline void
599 vlib_buffer_free_inline (vlib_main_t * vm,
600 u32 * buffers, u32 n_buffers, u32 follow_buffer_next)
602 vlib_buffer_main_t *bm = &buffer_main;
603 vlib_buffer_t *p, *b0, *b1, *b2, *b3;
605 u32 (*cb) (vlib_main_t * vm, u32 * buffers, u32 n_buffers,
606 u32 follow_buffer_next);
608 cb = bm->buffer_free_callback;
610 if (PREDICT_FALSE (cb != 0))
611 n_buffers = (*cb) (vm, buffers, n_buffers, follow_buffer_next);
616 while (i + 11 < n_buffers)
618 p = vlib_get_buffer (vm, buffers[i + 8]);
619 vlib_prefetch_buffer_header (p, LOAD);
620 p = vlib_get_buffer (vm, buffers[i + 9]);
621 vlib_prefetch_buffer_header (p, LOAD);
622 p = vlib_get_buffer (vm, buffers[i + 10]);
623 vlib_prefetch_buffer_header (p, LOAD);
624 p = vlib_get_buffer (vm, buffers[i + 11]);
625 vlib_prefetch_buffer_header (p, LOAD);
627 b0 = vlib_get_buffer (vm, buffers[i]);
628 b1 = vlib_get_buffer (vm, buffers[i + 1]);
629 b2 = vlib_get_buffer (vm, buffers[i + 2]);
630 b3 = vlib_get_buffer (vm, buffers[i + 3]);
632 VLIB_BUFFER_TRACE_TRAJECTORY_INIT (b0);
633 VLIB_BUFFER_TRACE_TRAJECTORY_INIT (b1);
634 VLIB_BUFFER_TRACE_TRAJECTORY_INIT (b2);
635 VLIB_BUFFER_TRACE_TRAJECTORY_INIT (b3);
637 recycle_or_free (vm, bm, buffers[i], b0, follow_buffer_next);
638 recycle_or_free (vm, bm, buffers[i + 1], b1, follow_buffer_next);
639 recycle_or_free (vm, bm, buffers[i + 2], b2, follow_buffer_next);
640 recycle_or_free (vm, bm, buffers[i + 3], b3, follow_buffer_next);
645 while (i < n_buffers)
647 b0 = vlib_get_buffer (vm, buffers[i]);
648 VLIB_BUFFER_TRACE_TRAJECTORY_INIT (b0);
649 recycle_or_free (vm, bm, buffers[i], b0, follow_buffer_next);
655 vlib_buffer_free_internal (vlib_main_t * vm, u32 * buffers, u32 n_buffers)
657 vlib_buffer_free_inline (vm, buffers, n_buffers, /* follow_buffer_next */
662 vlib_buffer_free_no_next_internal (vlib_main_t * vm, u32 * buffers,
665 vlib_buffer_free_inline (vm, buffers, n_buffers, /* follow_buffer_next */
669 /* Copy template packet data into buffers as they are allocated. */
670 static void __attribute__ ((unused))
671 vlib_packet_template_buffer_init (vlib_main_t * vm,
672 vlib_buffer_free_list_t * fl,
673 u32 * buffers, u32 n_buffers)
675 vlib_packet_template_t *t =
676 uword_to_pointer (fl->buffer_init_function_opaque,
677 vlib_packet_template_t *);
680 for (i = 0; i < n_buffers; i++)
682 vlib_buffer_t *b = vlib_get_buffer (vm, buffers[i]);
683 ASSERT (b->current_length == vec_len (t->packet_data));
684 clib_memcpy (vlib_buffer_get_current (b), t->packet_data,
690 vlib_packet_template_init (vlib_main_t * vm,
691 vlib_packet_template_t * t,
693 uword n_packet_data_bytes,
694 uword min_n_buffers_each_alloc, char *fmt, ...)
696 vlib_buffer_main_t *bm = &buffer_main;
699 vlib_buffer_free_list_t *fl;
702 name = va_format (0, fmt, &va);
705 if (bm->cb.vlib_packet_template_init_cb)
706 bm->cb.vlib_packet_template_init_cb (vm, (void *) t, packet_data,
708 min_n_buffers_each_alloc, name);
710 vlib_worker_thread_barrier_sync (vm);
712 memset (t, 0, sizeof (t[0]));
714 vec_add (t->packet_data, packet_data, n_packet_data_bytes);
715 t->min_n_buffers_each_alloc = min_n_buffers_each_alloc;
717 t->free_list_index = vlib_buffer_create_free_list_helper
718 (vm, n_packet_data_bytes,
723 ASSERT (t->free_list_index != 0);
724 fl = vlib_buffer_get_free_list (vm, t->free_list_index);
725 fl->min_n_buffers_each_alloc = t->min_n_buffers_each_alloc;
727 fl->buffer_init_function = vlib_packet_template_buffer_init;
728 fl->buffer_init_function_opaque = pointer_to_uword (t);
730 fl->buffer_init_template.current_data = 0;
731 fl->buffer_init_template.current_length = n_packet_data_bytes;
732 fl->buffer_init_template.flags = 0;
733 fl->buffer_init_template.n_add_refs = 0;
734 vlib_worker_thread_barrier_release (vm);
738 vlib_packet_template_get_packet (vlib_main_t * vm,
739 vlib_packet_template_t * t, u32 * bi_result)
744 if (vlib_buffer_alloc (vm, &bi, 1) != 1)
749 b = vlib_get_buffer (vm, bi);
750 clib_memcpy (vlib_buffer_get_current (b),
751 t->packet_data, vec_len (t->packet_data));
752 b->current_length = vec_len (t->packet_data);
758 vlib_packet_template_get_packet_helper (vlib_main_t * vm,
759 vlib_packet_template_t * t)
761 word n = t->min_n_buffers_each_alloc;
762 word l = vec_len (t->packet_data);
766 ASSERT (vec_len (t->free_buffers) == 0);
768 vec_validate (t->free_buffers, n - 1);
769 n_alloc = vlib_buffer_alloc_from_free_list (vm, t->free_buffers,
770 n, t->free_list_index);
771 _vec_len (t->free_buffers) = n_alloc;
774 /* Append given data to end of buffer, possibly allocating new buffers. */
776 vlib_buffer_add_data (vlib_main_t * vm,
777 vlib_buffer_free_list_index_t free_list_index,
778 u32 buffer_index, void *data, u32 n_data_bytes)
780 u32 n_buffer_bytes, n_left, n_left_this_buffer, bi;
786 && 1 != vlib_buffer_alloc_from_free_list (vm, &bi, 1, free_list_index))
790 n_left = n_data_bytes;
791 n_buffer_bytes = vlib_buffer_free_list_buffer_size (vm, free_list_index);
793 b = vlib_get_buffer (vm, bi);
794 b->flags &= ~VLIB_BUFFER_TOTAL_LENGTH_VALID;
796 /* Get to the end of the chain before we try to append data... */
797 while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
798 b = vlib_get_buffer (vm, b->next_buffer);
804 ASSERT (n_buffer_bytes >= b->current_length);
806 n_buffer_bytes - (b->current_data + b->current_length);
807 n = clib_min (n_left_this_buffer, n_left);
808 clib_memcpy (vlib_buffer_get_current (b) + b->current_length, d, n);
809 b->current_length += n;
816 vlib_buffer_alloc_from_free_list (vm, &b->next_buffer, 1,
820 b->flags |= VLIB_BUFFER_NEXT_PRESENT;
822 b = vlib_get_buffer (vm, b->next_buffer);
828 clib_error ("out of buffers");
833 vlib_buffer_chain_append_data_with_alloc (vlib_main_t * vm,
834 vlib_buffer_free_list_index_t
836 vlib_buffer_t * first,
837 vlib_buffer_t ** last, void *data,
840 vlib_buffer_t *l = *last;
842 vlib_buffer_free_list_buffer_size (vm, free_list_index);
844 ASSERT (n_buffer_bytes >= l->current_length + l->current_data);
847 u16 max = n_buffer_bytes - l->current_length - l->current_data;
851 vlib_buffer_alloc_from_free_list (vm, &l->next_buffer, 1,
854 *last = l = vlib_buffer_chain_buffer (vm, first, l, l->next_buffer);
855 max = n_buffer_bytes - l->current_length - l->current_data;
858 u16 len = (data_len > max) ? max : data_len;
859 clib_memcpy (vlib_buffer_get_current (l) + l->current_length,
861 vlib_buffer_chain_increase_length (first, l, len);
869 vlib_buffer_pool_create (vlib_main_t * vm, vlib_physmem_region_index_t pri,
872 vlib_buffer_main_t *bm = &buffer_main;
873 vlib_physmem_region_t *pr = vlib_physmem_get_region (vm, pri);
874 vlib_buffer_pool_t *p;
875 uword start = pointer_to_uword (pr->mem);
876 uword size = pr->size;
878 if (bm->buffer_mem_size == 0)
880 bm->buffer_mem_start = start;
881 bm->buffer_mem_size = size;
883 else if (start < bm->buffer_mem_start)
885 bm->buffer_mem_size += bm->buffer_mem_start - start;
886 bm->buffer_mem_start = start;
887 if (size > bm->buffer_mem_size)
888 bm->buffer_mem_size = size;
890 else if (start > bm->buffer_mem_start)
892 uword new_size = start - bm->buffer_mem_start + size;
893 if (new_size > bm->buffer_mem_size)
894 bm->buffer_mem_size = new_size;
897 if ((u64) bm->buffer_mem_size >
898 ((u64) 1 << (32 + CLIB_LOG2_CACHE_LINE_BYTES)))
900 clib_panic ("buffer memory size out of range!");
903 vec_add2 (bm->buffer_pools, p, 1);
906 p->physmem_region = pri;
908 if (buffer_size == 0)
911 p->log2_page_size = pr->log2_page_size;
912 p->buffer_size = buffer_size;
913 p->buffers_per_page = (1 << pr->log2_page_size) / p->buffer_size;
914 p->n_elts = p->buffers_per_page * pr->n_pages;
916 clib_spinlock_init (&p->lock);
918 ASSERT (p - bm->buffer_pools < 256);
919 return p - bm->buffer_pools;
923 format_vlib_buffer_free_list (u8 * s, va_list * va)
925 vlib_buffer_free_list_t *f = va_arg (*va, vlib_buffer_free_list_t *);
926 u32 threadnum = va_arg (*va, u32);
927 uword bytes_alloc, bytes_free, n_free, size;
930 return format (s, "%=7s%=30s%=12s%=12s%=12s%=12s%=12s%=12s",
931 "Thread", "Name", "Index", "Size", "Alloc", "Free",
934 size = sizeof (vlib_buffer_t) + f->n_data_bytes;
935 n_free = vec_len (f->buffers);
936 bytes_alloc = size * f->n_alloc;
937 bytes_free = size * n_free;
939 s = format (s, "%7d%30v%12d%12d%=12U%=12U%=12d%=12d", threadnum,
940 f->name, f->index, f->n_data_bytes,
941 format_memory_size, bytes_alloc,
942 format_memory_size, bytes_free, f->n_alloc, n_free);
947 static clib_error_t *
948 show_buffers (vlib_main_t * vm,
949 unformat_input_t * input, vlib_cli_command_t * cmd)
951 vlib_buffer_free_list_t *f;
952 vlib_main_t *curr_vm;
955 vlib_cli_output (vm, "%U", format_vlib_buffer_free_list, 0, 0);
959 curr_vm = vlib_mains[vm_index];
962 pool_foreach (f, curr_vm->buffer_free_list_pool, ({
963 vlib_cli_output (vm, "%U", format_vlib_buffer_free_list, f, vm_index);
969 while (vm_index < vec_len (vlib_mains));
975 VLIB_CLI_COMMAND (show_buffers_command, static) = {
976 .path = "show buffers",
977 .short_help = "Show packet buffer allocation",
978 .function = show_buffers,
983 vlib_buffer_main_init (struct vlib_main_t * vm)
985 vlib_buffer_main_t *bm = &buffer_main;
986 vlib_physmem_region_index_t pri;
989 if (vlib_buffer_callbacks)
991 /* external plugin has registered own buffer callbacks
992 so we just copy them and quit */
993 clib_memcpy (&bm->cb, vlib_buffer_callbacks,
994 sizeof (vlib_buffer_callbacks_t));
995 bm->callbacks_registered = 1;
999 bm->cb.vlib_buffer_fill_free_list_cb = &vlib_buffer_fill_free_list_internal;
1000 bm->cb.vlib_buffer_free_cb = &vlib_buffer_free_internal;
1001 bm->cb.vlib_buffer_free_no_next_cb = &vlib_buffer_free_no_next_internal;
1002 bm->cb.vlib_buffer_delete_free_list_cb =
1003 &vlib_buffer_delete_free_list_internal;
1004 clib_spinlock_init (&bm->buffer_known_hash_lockp);
1006 /* allocate default region */
1007 error = vlib_physmem_region_alloc (vm, "buffers",
1008 vlib_buffer_physmem_sz, 0,
1009 VLIB_PHYSMEM_F_SHARED |
1010 VLIB_PHYSMEM_F_HUGETLB, &pri);
1015 clib_error_free (error);
1017 error = vlib_physmem_region_alloc (vm, "buffers",
1018 vlib_buffer_physmem_sz, 0,
1019 VLIB_PHYSMEM_F_SHARED, &pri);
1022 vlib_buffer_pool_create (vm, pri, sizeof (vlib_buffer_t) +
1023 VLIB_BUFFER_DEFAULT_FREE_LIST_BYTES);
1027 static clib_error_t *
1028 vlib_buffers_configure (vlib_main_t * vm, unformat_input_t * input)
1032 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1034 if (unformat (input, "memory-size-in-mb %d", &size_in_mb))
1035 vlib_buffer_physmem_sz = size_in_mb << 20;
1037 return unformat_parse_error (input);
1040 unformat_free (input);
1044 VLIB_EARLY_CONFIG_FUNCTION (vlib_buffers_configure, "buffers");
1049 * fd.io coding-style-patch-verification: ON
1052 * eval: (c-set-style "gnu")