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>
49 vlib_buffer_length_in_chain_slow_path (vlib_main_t * vm,
50 vlib_buffer_t * b_first)
52 vlib_buffer_t *b = b_first;
53 uword l_first = b_first->current_length;
55 while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
57 b = vlib_get_buffer (vm, b->next_buffer);
58 l += b->current_length;
60 b_first->total_length_not_including_first_buffer = l;
61 b_first->flags |= VLIB_BUFFER_TOTAL_LENGTH_VALID;
66 format_vlib_buffer (u8 * s, va_list * args)
68 vlib_buffer_t *b = va_arg (*args, vlib_buffer_t *);
69 uword indent = format_get_indent (s);
71 s = format (s, "current data %d, length %d, free-list %d",
72 b->current_data, b->current_length, b->free_list_index);
74 if (b->flags & VLIB_BUFFER_TOTAL_LENGTH_VALID)
75 s = format (s, ", totlen-nifb %d",
76 b->total_length_not_including_first_buffer);
78 if (b->flags & VLIB_BUFFER_IS_TRACED)
79 s = format (s, ", trace 0x%x", b->trace_index);
81 while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
83 vlib_main_t *vm = vlib_get_main ();
84 u32 next_buffer = b->next_buffer;
85 b = vlib_get_buffer (vm, next_buffer);
87 s = format (s, "\n%Unext-buffer 0x%x, segment length %d",
88 format_white_space, indent, next_buffer, b->current_length);
95 format_vlib_buffer_and_data (u8 * s, va_list * args)
97 vlib_buffer_t *b = va_arg (*args, vlib_buffer_t *);
99 s = format (s, "%U, %U",
100 format_vlib_buffer, b,
101 format_hex_bytes, vlib_buffer_get_current (b), 64);
107 format_vlib_buffer_known_state (u8 * s, va_list * args)
109 vlib_buffer_known_state_t state = va_arg (*args, vlib_buffer_known_state_t);
114 case VLIB_BUFFER_UNKNOWN:
118 case VLIB_BUFFER_KNOWN_ALLOCATED:
119 t = "known-allocated";
122 case VLIB_BUFFER_KNOWN_FREE:
131 return format (s, "%s", t);
135 format_vlib_buffer_contents (u8 * s, va_list * va)
137 vlib_main_t *vm = va_arg (*va, vlib_main_t *);
138 vlib_buffer_t *b = va_arg (*va, vlib_buffer_t *);
142 vec_add (s, vlib_buffer_get_current (b), b->current_length);
143 if (!(b->flags & VLIB_BUFFER_NEXT_PRESENT))
145 b = vlib_get_buffer (vm, b->next_buffer);
152 vlib_validate_buffer_helper (vlib_main_t * vm,
154 uword follow_buffer_next, uword ** unique_hash)
156 vlib_buffer_t *b = vlib_get_buffer (vm, bi);
157 vlib_buffer_main_t *bm = vm->buffer_main;
158 vlib_buffer_free_list_t *fl;
160 if (pool_is_free_index (bm->buffer_free_list_pool, b->free_list_index))
161 return format (0, "unknown free list 0x%x", b->free_list_index);
163 fl = pool_elt_at_index (bm->buffer_free_list_pool, b->free_list_index);
165 if ((signed) b->current_data < (signed) -VLIB_BUFFER_PRE_DATA_SIZE)
166 return format (0, "current data %d before pre-data", b->current_data);
168 if (b->current_data + b->current_length > fl->n_data_bytes)
169 return format (0, "%d-%d beyond end of buffer %d",
170 b->current_data, b->current_length, fl->n_data_bytes);
172 if (follow_buffer_next && (b->flags & VLIB_BUFFER_NEXT_PRESENT))
174 vlib_buffer_known_state_t k;
177 k = vlib_buffer_is_known (vm, b->next_buffer);
178 if (k != VLIB_BUFFER_KNOWN_ALLOCATED)
179 return format (0, "next 0x%x: %U",
180 b->next_buffer, format_vlib_buffer_known_state, k);
184 if (hash_get (*unique_hash, b->next_buffer))
185 return format (0, "duplicate buffer 0x%x", b->next_buffer);
187 hash_set1 (*unique_hash, b->next_buffer);
190 msg = vlib_validate_buffer (vm, b->next_buffer, follow_buffer_next);
193 result = format (0, "next 0x%x: %v", b->next_buffer, msg);
203 vlib_validate_buffer (vlib_main_t * vm, u32 bi, uword follow_buffer_next)
205 return vlib_validate_buffer_helper (vm, bi, follow_buffer_next,
206 /* unique_hash */ 0);
210 vlib_validate_buffers (vlib_main_t * vm,
212 uword next_buffer_stride,
214 vlib_buffer_known_state_t known_state,
215 uword follow_buffer_next)
218 u32 bi, *b = buffers;
219 vlib_buffer_known_state_t k;
220 u8 *msg = 0, *result = 0;
222 hash = hash_create (0, 0);
223 for (i = 0; i < n_buffers; i++)
226 b += next_buffer_stride;
228 /* Buffer is not unique. */
229 if (hash_get (hash, bi))
231 msg = format (0, "not unique");
235 k = vlib_buffer_is_known (vm, bi);
236 if (k != known_state)
238 msg = format (0, "is %U; expected %U",
239 format_vlib_buffer_known_state, k,
240 format_vlib_buffer_known_state, known_state);
244 msg = vlib_validate_buffer_helper (vm, bi, follow_buffer_next, &hash);
248 hash_set1 (hash, bi);
254 result = format (0, "0x%x: %v", bi, msg);
261 vlib_main_t **vlib_mains;
263 /* When dubugging validate that given buffers are either known allocated
265 static void __attribute__ ((unused))
266 vlib_buffer_validate_alloc_free (vlib_main_t * vm,
269 vlib_buffer_known_state_t expected_state)
272 uword i, bi, is_free;
277 ASSERT (os_get_cpu_number () == 0);
279 /* smp disaster check */
281 ASSERT (vm == vlib_mains[0]);
283 is_free = expected_state == VLIB_BUFFER_KNOWN_ALLOCATED;
285 for (i = 0; i < n_buffers; i++)
287 vlib_buffer_known_state_t known;
291 known = vlib_buffer_is_known (vm, bi);
292 if (known != expected_state)
296 (vm, "%s %U buffer 0x%x",
297 is_free ? "freeing" : "allocating",
298 format_vlib_buffer_known_state, known, bi);
301 vlib_buffer_set_known_state
303 is_free ? VLIB_BUFFER_KNOWN_FREE : VLIB_BUFFER_KNOWN_ALLOCATED);
307 #define BUFFERS_PER_COPY (sizeof (vlib_copy_unit_t) / sizeof (u32))
309 /* Make sure we have at least given number of unaligned buffers. */
311 fill_unaligned (vlib_main_t * vm,
312 vlib_buffer_free_list_t * free_list,
313 uword n_unaligned_buffers)
315 word la = vec_len (free_list->aligned_buffers);
316 word lu = vec_len (free_list->unaligned_buffers);
318 /* Aligned come in aligned copy-sized chunks. */
319 ASSERT (la % BUFFERS_PER_COPY == 0);
321 ASSERT (la >= n_unaligned_buffers);
323 while (lu < n_unaligned_buffers)
325 /* Copy 4 buffers from end of aligned vector to unaligned vector. */
326 vec_add (free_list->unaligned_buffers,
327 free_list->aligned_buffers + la - BUFFERS_PER_COPY,
329 la -= BUFFERS_PER_COPY;
330 lu += BUFFERS_PER_COPY;
332 _vec_len (free_list->aligned_buffers) = la;
335 /* After free aligned buffers may not contain even sized chunks. */
337 trim_aligned (vlib_buffer_free_list_t * f)
341 /* Add unaligned to aligned before trim. */
342 l = vec_len (f->unaligned_buffers);
345 vec_add_aligned (f->aligned_buffers, f->unaligned_buffers, l,
346 /* align */ sizeof (vlib_copy_unit_t));
348 _vec_len (f->unaligned_buffers) = 0;
351 /* Remove unaligned buffers from end of aligned vector and save for next trim. */
352 l = vec_len (f->aligned_buffers);
353 n_trim = l % BUFFERS_PER_COPY;
356 /* Trim aligned -> unaligned. */
357 vec_add (f->unaligned_buffers, f->aligned_buffers + l - n_trim, n_trim);
359 /* Remove from aligned. */
360 _vec_len (f->aligned_buffers) = l - n_trim;
365 merge_free_lists (vlib_buffer_free_list_t * dst,
366 vlib_buffer_free_list_t * src)
374 l = vec_len (src->aligned_buffers);
377 vec_add2_aligned (dst->aligned_buffers, d, l,
378 /* align */ sizeof (vlib_copy_unit_t));
379 clib_memcpy (d, src->aligned_buffers, l * sizeof (d[0]));
380 vec_free (src->aligned_buffers);
383 l = vec_len (src->unaligned_buffers);
386 vec_add (dst->unaligned_buffers, src->unaligned_buffers, l);
387 vec_free (src->unaligned_buffers);
392 vlib_buffer_get_free_list_with_size (vlib_main_t * vm, u32 size)
394 vlib_buffer_main_t *bm = vm->buffer_main;
396 size = vlib_buffer_round_size (size);
397 uword *p = hash_get (bm->free_list_by_size, size);
398 return p ? p[0] : ~0;
401 /* Add buffer free list. */
403 vlib_buffer_create_free_list_helper (vlib_main_t * vm,
405 u32 is_public, u32 is_default, u8 * name)
407 vlib_buffer_main_t *bm = vm->buffer_main;
408 vlib_buffer_free_list_t *f;
411 ASSERT (os_get_cpu_number () == 0);
413 if (!is_default && pool_elts (bm->buffer_free_list_pool) == 0)
415 u32 default_free_free_list_index;
418 default_free_free_list_index =
419 vlib_buffer_create_free_list_helper
421 /* default buffer size */ VLIB_BUFFER_DEFAULT_FREE_LIST_BYTES,
426 ASSERT (default_free_free_list_index ==
427 VLIB_BUFFER_DEFAULT_FREE_LIST_INDEX);
429 if (n_data_bytes == VLIB_BUFFER_DEFAULT_FREE_LIST_BYTES && is_public)
430 return default_free_free_list_index;
433 pool_get_aligned (bm->buffer_free_list_pool, f, CLIB_CACHE_LINE_BYTES);
435 memset (f, 0, sizeof (f[0]));
436 f->index = f - bm->buffer_free_list_pool;
437 f->n_data_bytes = vlib_buffer_round_size (n_data_bytes);
438 f->min_n_buffers_each_physmem_alloc = 16;
439 f->name = clib_mem_is_heap_object (name) ? name : format (0, "%s", name);
441 /* Setup free buffer template. */
442 f->buffer_init_template.free_list_index = f->index;
446 uword *p = hash_get (bm->free_list_by_size, f->n_data_bytes);
448 hash_set (bm->free_list_by_size, f->n_data_bytes, f->index);
451 for (i = 1; i < vec_len (vlib_mains); i++)
453 vlib_buffer_main_t *wbm = vlib_mains[i]->buffer_main;
454 vlib_buffer_free_list_t *wf;
455 pool_get_aligned (wbm->buffer_free_list_pool,
456 wf, CLIB_CACHE_LINE_BYTES);
457 ASSERT (f - bm->buffer_free_list_pool ==
458 wf - wbm->buffer_free_list_pool);
460 wf->aligned_buffers = 0;
461 wf->unaligned_buffers = 0;
469 vlib_buffer_create_free_list (vlib_main_t * vm, u32 n_data_bytes,
476 name = va_format (0, fmt, &va);
479 return vlib_buffer_create_free_list_helper (vm, n_data_bytes,
486 vlib_buffer_get_or_create_free_list (vlib_main_t * vm, u32 n_data_bytes,
489 u32 i = vlib_buffer_get_free_list_with_size (vm, n_data_bytes);
497 name = va_format (0, fmt, &va);
500 i = vlib_buffer_create_free_list_helper (vm, n_data_bytes,
510 del_free_list (vlib_main_t * vm, vlib_buffer_free_list_t * f)
514 for (i = 0; i < vec_len (f->buffer_memory_allocated); i++)
515 vm->os_physmem_free (f->buffer_memory_allocated[i]);
517 vec_free (f->buffer_memory_allocated);
518 vec_free (f->unaligned_buffers);
519 vec_free (f->aligned_buffers);
522 /* Add buffer free list. */
524 vlib_buffer_delete_free_list_internal (vlib_main_t * vm, u32 free_list_index)
526 vlib_buffer_main_t *bm = vm->buffer_main;
527 vlib_buffer_free_list_t *f;
531 ASSERT (os_get_cpu_number () == 0);
533 f = vlib_buffer_get_free_list (vm, free_list_index);
535 ASSERT (vec_len (f->unaligned_buffers) + vec_len (f->aligned_buffers) ==
537 merge_index = vlib_buffer_get_free_list_with_size (vm, f->n_data_bytes);
538 if (merge_index != ~0 && merge_index != free_list_index)
540 merge_free_lists (pool_elt_at_index (bm->buffer_free_list_pool,
544 del_free_list (vm, f);
547 memset (f, 0xab, sizeof (f[0]));
549 pool_put (bm->buffer_free_list_pool, f);
551 for (i = 1; i < vec_len (vlib_mains); i++)
553 bm = vlib_mains[i]->buffer_main;
554 f = vlib_buffer_get_free_list (vlib_mains[i], free_list_index);;
555 memset (f, 0xab, sizeof (f[0]));
556 pool_put (bm->buffer_free_list_pool, f);
560 /* Make sure free list has at least given number of free buffers. */
562 fill_free_list (vlib_main_t * vm,
563 vlib_buffer_free_list_t * fl, uword min_free_buffers)
565 vlib_buffer_t *buffers, *b;
568 u32 n_remaining, n_alloc, n_this_chunk;
572 /* Already have enough free buffers on free list? */
573 n = min_free_buffers - vec_len (fl->aligned_buffers);
575 return min_free_buffers;
577 /* Always allocate round number of buffers. */
578 n = round_pow2 (n, BUFFERS_PER_COPY);
580 /* Always allocate new buffers in reasonably large sized chunks. */
581 n = clib_max (n, fl->min_n_buffers_each_physmem_alloc);
585 while (n_remaining > 0)
587 n_this_chunk = clib_min (n_remaining, 16);
589 n_bytes = n_this_chunk * (sizeof (b[0]) + fl->n_data_bytes);
591 /* drb: removed power-of-2 ASSERT */
592 buffers = vm->os_physmem_alloc_aligned (&vm->physmem_main,
594 sizeof (vlib_buffer_t));
598 /* Record chunk as being allocated so we can free it later. */
599 vec_add1 (fl->buffer_memory_allocated, buffers);
601 fl->n_alloc += n_this_chunk;
602 n_alloc += n_this_chunk;
603 n_remaining -= n_this_chunk;
606 vec_add2_aligned (fl->aligned_buffers, bi, n_this_chunk,
607 sizeof (vlib_copy_unit_t));
608 for (i = 0; i < n_this_chunk; i++)
610 bi[i] = vlib_get_buffer_index (vm, b);
613 vlib_buffer_set_known_state (vm, bi[i], VLIB_BUFFER_KNOWN_FREE);
614 b = vlib_buffer_next_contiguous (b, fl->n_data_bytes);
617 memset (buffers, 0, n_bytes);
619 /* Initialize all new buffers. */
621 for (i = 0; i < n_this_chunk; i++)
623 vlib_buffer_init_for_free_list (b, fl);
624 b = vlib_buffer_next_contiguous (b, fl->n_data_bytes);
627 if (fl->buffer_init_function)
628 fl->buffer_init_function (vm, fl, bi, n_this_chunk);
634 copy_alignment (u32 * x)
636 return (pointer_to_uword (x) / sizeof (x[0])) % BUFFERS_PER_COPY;
641 alloc_from_free_list (vlib_main_t * vm,
642 vlib_buffer_free_list_t * free_list,
643 u32 * alloc_buffers, u32 n_alloc_buffers)
647 uword n_unaligned_start, n_unaligned_end, n_filled;
649 n_left = n_alloc_buffers;
651 n_unaligned_start = ((BUFFERS_PER_COPY - copy_alignment (dst))
652 & (BUFFERS_PER_COPY - 1));
654 n_filled = fill_free_list (vm, free_list, n_alloc_buffers);
658 n_left = n_filled < n_left ? n_filled : n_left;
659 n_alloc_buffers = n_left;
661 if (n_unaligned_start >= n_left)
663 n_unaligned_start = n_left;
667 n_unaligned_end = copy_alignment (dst + n_alloc_buffers);
669 fill_unaligned (vm, free_list, n_unaligned_start + n_unaligned_end);
671 u_len = vec_len (free_list->unaligned_buffers);
672 u_src = free_list->unaligned_buffers + u_len - 1;
674 if (n_unaligned_start)
676 uword n_copy = n_unaligned_start;
688 /* Now dst should be aligned. */
690 ASSERT (pointer_to_uword (dst) % sizeof (vlib_copy_unit_t) == 0);
695 vlib_copy_unit_t *d, *s;
698 if (vec_len (free_list->aligned_buffers) <
699 ((n_left / BUFFERS_PER_COPY) * BUFFERS_PER_COPY))
702 n_copy = n_left / BUFFERS_PER_COPY;
703 n_left = n_left % BUFFERS_PER_COPY;
705 /* Remove buffers from aligned free list. */
706 _vec_len (free_list->aligned_buffers) -= n_copy * BUFFERS_PER_COPY;
708 s = (vlib_copy_unit_t *) vec_end (free_list->aligned_buffers);
709 d = (vlib_copy_unit_t *) dst;
711 /* Fast path loop. */
734 /* Unaligned copy. */
735 ASSERT (n_unaligned_end == n_left);
743 if (!free_list->unaligned_buffers)
746 _vec_len (free_list->unaligned_buffers) = u_len;
748 /* Verify that buffers are known free. */
749 vlib_buffer_validate_alloc_free (vm, alloc_buffers,
750 n_alloc_buffers, VLIB_BUFFER_KNOWN_FREE);
752 return n_alloc_buffers;
756 /* Allocate a given number of buffers into given array.
757 Returns number actually allocated which will be either zero or
760 vlib_buffer_alloc_internal (vlib_main_t * vm, u32 * buffers, u32 n_buffers)
762 vlib_buffer_main_t *bm = vm->buffer_main;
764 return alloc_from_free_list
766 pool_elt_at_index (bm->buffer_free_list_pool,
767 VLIB_BUFFER_DEFAULT_FREE_LIST_INDEX),
772 vlib_buffer_alloc_from_free_list_internal (vlib_main_t * vm,
774 u32 n_buffers, u32 free_list_index)
776 vlib_buffer_main_t *bm = vm->buffer_main;
777 vlib_buffer_free_list_t *f;
778 f = pool_elt_at_index (bm->buffer_free_list_pool, free_list_index);
779 return alloc_from_free_list (vm, f, buffers, n_buffers);
783 add_buffer_to_free_list (vlib_main_t * vm,
784 vlib_buffer_free_list_t * f,
785 u32 buffer_index, u8 do_init)
788 b = vlib_get_buffer (vm, buffer_index);
789 if (PREDICT_TRUE (do_init))
790 vlib_buffer_init_for_free_list (b, f);
791 vec_add1_aligned (f->aligned_buffers, buffer_index,
792 sizeof (vlib_copy_unit_t));
795 always_inline vlib_buffer_free_list_t *
796 buffer_get_free_list (vlib_main_t * vm, vlib_buffer_t * b, u32 * index)
798 vlib_buffer_main_t *bm = vm->buffer_main;
801 *index = i = b->free_list_index;
802 return pool_elt_at_index (bm->buffer_free_list_pool, i);
806 vlib_set_buffer_free_callback (vlib_main_t * vm, void *fp)
808 vlib_buffer_main_t *bm = vm->buffer_main;
809 void *rv = bm->buffer_free_callback;
811 bm->buffer_free_callback = fp;
815 static_always_inline void
816 vlib_buffer_free_inline (vlib_main_t * vm,
817 u32 * buffers, u32 n_buffers, u32 follow_buffer_next)
819 vlib_buffer_main_t *bm = vm->buffer_main;
820 vlib_buffer_free_list_t *fl;
821 static u32 *next_to_free[2]; /* smp bad */
822 u32 i_next_to_free, *b, *n, *f, fi;
825 static vlib_buffer_free_list_t **announce_list;
826 vlib_buffer_free_list_t *fl0 = 0, *fl1 = 0;
827 u32 bi0 = (u32) ~ 0, bi1 = (u32) ~ 0, fi0, fi1 = (u32) ~ 0;
828 u8 free0, free1 = 0, free_next0, free_next1;
829 u32 (*cb) (vlib_main_t * vm, u32 * buffers, u32 n_buffers,
830 u32 follow_buffer_next);
832 ASSERT (os_get_cpu_number () == 0);
834 cb = bm->buffer_free_callback;
836 if (PREDICT_FALSE (cb != 0))
837 n_buffers = (*cb) (vm, buffers, n_buffers, follow_buffer_next);
842 /* Use first buffer to get default free list. */
844 u32 bi0 = buffers[0];
847 b0 = vlib_get_buffer (vm, bi0);
848 fl = buffer_get_free_list (vm, b0, &fi);
849 if (fl->buffers_added_to_freelist_function)
850 vec_add1 (announce_list, fl);
853 vec_validate (next_to_free[0], n_buffers - 1);
854 vec_validate (next_to_free[1], n_buffers - 1);
861 /* Verify that buffers are known allocated. */
862 vlib_buffer_validate_alloc_free (vm, b,
863 n_left, VLIB_BUFFER_KNOWN_ALLOCATED);
865 vec_add2_aligned (fl->aligned_buffers, f, n_left,
866 /* align */ sizeof (vlib_copy_unit_t));
868 n = next_to_free[i_next_to_free];
871 vlib_buffer_t *b0, *b1, *binit0, *binit1, dummy_buffers[2];
882 /* Prefetch buffers for next iteration. */
883 vlib_prefetch_buffer_with_index (vm, b[0], WRITE);
884 vlib_prefetch_buffer_with_index (vm, b[1], WRITE);
886 b0 = vlib_get_buffer (vm, bi0);
887 b1 = vlib_get_buffer (vm, bi1);
889 free0 = (b0->flags & VLIB_BUFFER_RECYCLE) == 0;
890 free1 = (b1->flags & VLIB_BUFFER_RECYCLE) == 0;
892 /* Must be before init which will over-write buffer flags. */
893 if (follow_buffer_next)
895 n[0] = b0->next_buffer;
896 free_next0 = free0 && (b0->flags & VLIB_BUFFER_NEXT_PRESENT) != 0;
899 n[0] = b1->next_buffer;
900 free_next1 = free1 && (b1->flags & VLIB_BUFFER_NEXT_PRESENT) != 0;
904 free_next0 = free_next1 = 0;
906 /* Must be before init which will over-write buffer free list. */
907 fi0 = b0->free_list_index;
908 fi1 = b1->free_list_index;
910 if (PREDICT_FALSE (fi0 != fi || fi1 != fi))
913 binit0 = free0 ? b0 : &dummy_buffers[0];
914 binit1 = free1 ? b1 : &dummy_buffers[1];
916 vlib_buffer_init_two_for_free_list (binit0, binit1, fl);
920 /* Backup speculation. */
922 n -= free_next0 + free_next1;
924 _vec_len (fl->aligned_buffers) = f - fl->aligned_buffers;
926 fl0 = pool_elt_at_index (bm->buffer_free_list_pool, fi0);
927 fl1 = pool_elt_at_index (bm->buffer_free_list_pool, fi1);
929 add_buffer_to_free_list (vm, fl0, bi0, free0);
930 if (PREDICT_FALSE (fl0->buffers_added_to_freelist_function != 0))
933 for (i = 0; i < vec_len (announce_list); i++)
934 if (fl0 == announce_list[i])
936 vec_add1 (announce_list, fl0);
939 if (PREDICT_FALSE (fl1->buffers_added_to_freelist_function != 0))
942 for (i = 0; i < vec_len (announce_list); i++)
943 if (fl1 == announce_list[i])
945 vec_add1 (announce_list, fl1);
949 add_buffer_to_free_list (vm, fl1, bi1, free1);
951 /* Possibly change current free list. */
952 if (fi0 != fi && fi1 != fi)
955 fl = pool_elt_at_index (bm->buffer_free_list_pool, fi);
958 vec_add2_aligned (fl->aligned_buffers, f, n_left,
959 /* align */ sizeof (vlib_copy_unit_t));
964 vlib_buffer_t *b0, *binit0, dummy_buffers[1];
972 b0 = vlib_get_buffer (vm, bi0);
974 free0 = (b0->flags & VLIB_BUFFER_RECYCLE) == 0;
976 /* Must be before init which will over-write buffer flags. */
977 if (follow_buffer_next)
979 n[0] = b0->next_buffer;
980 free_next0 = free0 && (b0->flags & VLIB_BUFFER_NEXT_PRESENT) != 0;
986 /* Must be before init which will over-write buffer free list. */
987 fi0 = b0->free_list_index;
989 if (PREDICT_FALSE (fi0 != fi))
992 binit0 = free0 ? b0 : &dummy_buffers[0];
994 vlib_buffer_init_for_free_list (binit0, fl);
998 /* Backup speculation. */
1002 _vec_len (fl->aligned_buffers) = f - fl->aligned_buffers;
1004 fl0 = pool_elt_at_index (bm->buffer_free_list_pool, fi0);
1006 add_buffer_to_free_list (vm, fl0, bi0, free0);
1007 if (PREDICT_FALSE (fl0->buffers_added_to_freelist_function != 0))
1010 for (i = 0; i < vec_len (announce_list); i++)
1011 if (fl0 == announce_list[i])
1013 vec_add1 (announce_list, fl0);
1018 fl = pool_elt_at_index (bm->buffer_free_list_pool, fi);
1020 vec_add2_aligned (fl->aligned_buffers, f, n_left,
1021 /* align */ sizeof (vlib_copy_unit_t));
1024 if (follow_buffer_next && ((n_left = n - next_to_free[i_next_to_free]) > 0))
1026 b = next_to_free[i_next_to_free];
1027 i_next_to_free ^= 1;
1031 _vec_len (fl->aligned_buffers) = f - fl->aligned_buffers;
1033 if (vec_len (announce_list))
1035 vlib_buffer_free_list_t *fl;
1036 for (i = 0; i < vec_len (announce_list); i++)
1038 fl = announce_list[i];
1039 fl->buffers_added_to_freelist_function (vm, fl);
1041 _vec_len (announce_list) = 0;
1046 vlib_buffer_free_internal (vlib_main_t * vm, u32 * buffers, u32 n_buffers)
1048 vlib_buffer_free_inline (vm, buffers, n_buffers, /* follow_buffer_next */
1053 vlib_buffer_free_no_next_internal (vlib_main_t * vm, u32 * buffers,
1056 vlib_buffer_free_inline (vm, buffers, n_buffers, /* follow_buffer_next */
1060 /* Copy template packet data into buffers as they are allocated. */
1061 static void __attribute__ ((unused))
1062 vlib_packet_template_buffer_init (vlib_main_t * vm,
1063 vlib_buffer_free_list_t * fl,
1064 u32 * buffers, u32 n_buffers)
1066 vlib_packet_template_t *t =
1067 uword_to_pointer (fl->buffer_init_function_opaque,
1068 vlib_packet_template_t *);
1071 for (i = 0; i < n_buffers; i++)
1073 vlib_buffer_t *b = vlib_get_buffer (vm, buffers[i]);
1074 ASSERT (b->current_length == vec_len (t->packet_data));
1075 clib_memcpy (vlib_buffer_get_current (b), t->packet_data,
1081 vlib_packet_template_init (vlib_main_t * vm,
1082 vlib_packet_template_t * t,
1084 uword n_packet_data_bytes,
1085 uword min_n_buffers_each_physmem_alloc,
1088 vlib_buffer_main_t *bm = vm->buffer_main;
1090 __attribute__ ((unused)) u8 *name;
1091 vlib_buffer_free_list_t *fl;
1094 name = va_format (0, fmt, &va);
1097 if (bm->cb.vlib_packet_template_init_cb)
1098 bm->cb.vlib_packet_template_init_cb (vm, (void *) t, packet_data,
1099 n_packet_data_bytes,
1100 min_n_buffers_each_physmem_alloc,
1103 vlib_worker_thread_barrier_sync (vm);
1105 memset (t, 0, sizeof (t[0]));
1107 vec_add (t->packet_data, packet_data, n_packet_data_bytes);
1108 t->min_n_buffers_each_physmem_alloc = min_n_buffers_each_physmem_alloc;
1110 t->free_list_index = vlib_buffer_create_free_list_helper
1111 (vm, n_packet_data_bytes,
1116 ASSERT (t->free_list_index != 0);
1117 fl = vlib_buffer_get_free_list (vm, t->free_list_index);
1118 fl->min_n_buffers_each_physmem_alloc = t->min_n_buffers_each_physmem_alloc;
1120 fl->buffer_init_function = vlib_packet_template_buffer_init;
1121 fl->buffer_init_function_opaque = pointer_to_uword (t);
1123 fl->buffer_init_template.current_data = 0;
1124 fl->buffer_init_template.current_length = n_packet_data_bytes;
1125 fl->buffer_init_template.flags = 0;
1126 vlib_worker_thread_barrier_release (vm);
1130 vlib_packet_template_get_packet (vlib_main_t * vm,
1131 vlib_packet_template_t * t, u32 * bi_result)
1136 if (vlib_buffer_alloc (vm, &bi, 1) != 1)
1141 b = vlib_get_buffer (vm, bi);
1142 clib_memcpy (vlib_buffer_get_current (b),
1143 t->packet_data, vec_len (t->packet_data));
1144 b->current_length = vec_len (t->packet_data);
1150 vlib_packet_template_get_packet_helper (vlib_main_t * vm,
1151 vlib_packet_template_t * t)
1153 word n = t->min_n_buffers_each_physmem_alloc;
1154 word l = vec_len (t->packet_data);
1158 ASSERT (vec_len (t->free_buffers) == 0);
1160 vec_validate (t->free_buffers, n - 1);
1161 n_alloc = vlib_buffer_alloc_from_free_list (vm, t->free_buffers,
1162 n, t->free_list_index);
1163 _vec_len (t->free_buffers) = n_alloc;
1166 /* Append given data to end of buffer, possibly allocating new buffers. */
1168 vlib_buffer_add_data (vlib_main_t * vm,
1169 u32 free_list_index,
1170 u32 buffer_index, void *data, u32 n_data_bytes)
1172 u32 n_buffer_bytes, n_left, n_left_this_buffer, bi;
1178 && 1 != vlib_buffer_alloc_from_free_list (vm, &bi, 1, free_list_index))
1179 goto out_of_buffers;
1182 n_left = n_data_bytes;
1183 n_buffer_bytes = vlib_buffer_free_list_buffer_size (vm, free_list_index);
1185 b = vlib_get_buffer (vm, bi);
1186 b->flags &= ~VLIB_BUFFER_TOTAL_LENGTH_VALID;
1188 /* Get to the end of the chain before we try to append data... */
1189 while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
1190 b = vlib_get_buffer (vm, b->next_buffer);
1196 ASSERT (n_buffer_bytes >= b->current_length);
1197 n_left_this_buffer =
1198 n_buffer_bytes - (b->current_data + b->current_length);
1199 n = clib_min (n_left_this_buffer, n_left);
1200 clib_memcpy (vlib_buffer_get_current (b) + b->current_length, d, n);
1201 b->current_length += n;
1208 vlib_buffer_alloc_from_free_list (vm, &b->next_buffer, 1,
1210 goto out_of_buffers;
1212 b->flags |= VLIB_BUFFER_NEXT_PRESENT;
1214 b = vlib_get_buffer (vm, b->next_buffer);
1220 clib_error ("out of buffers");
1225 vlib_buffer_chain_append_data_with_alloc (vlib_main_t * vm,
1226 u32 free_list_index,
1227 vlib_buffer_t * first,
1228 vlib_buffer_t ** last,
1229 void *data, u16 data_len)
1231 vlib_buffer_t *l = *last;
1232 u32 n_buffer_bytes =
1233 vlib_buffer_free_list_buffer_size (vm, free_list_index);
1235 ASSERT (n_buffer_bytes >= l->current_length + l->current_data);
1238 u16 max = n_buffer_bytes - l->current_length - l->current_data;
1242 vlib_buffer_alloc_from_free_list (vm, &l->next_buffer, 1,
1245 *last = l = vlib_buffer_chain_buffer (vm, first, l, l->next_buffer);
1246 max = n_buffer_bytes - l->current_length - l->current_data;
1249 u16 len = (data_len > max) ? max : data_len;
1250 clib_memcpy (vlib_buffer_get_current (l) + l->current_length,
1251 data + copied, len);
1252 vlib_buffer_chain_increase_length (first, l, len);
1261 format_vlib_buffer_free_list (u8 * s, va_list * va)
1263 vlib_buffer_free_list_t *f = va_arg (*va, vlib_buffer_free_list_t *);
1264 u32 threadnum = va_arg (*va, u32);
1265 uword bytes_alloc, bytes_free, n_free, size;
1268 return format (s, "%=7s%=30s%=12s%=12s%=12s%=12s%=12s%=12s",
1269 "Thread", "Name", "Index", "Size", "Alloc", "Free",
1272 size = sizeof (vlib_buffer_t) + f->n_data_bytes;
1273 n_free = vec_len (f->aligned_buffers) + vec_len (f->unaligned_buffers);
1274 bytes_alloc = size * f->n_alloc;
1275 bytes_free = size * n_free;
1277 s = format (s, "%7d%30s%12d%12d%=12U%=12U%=12d%=12d", threadnum,
1278 f->name, f->index, f->n_data_bytes,
1279 format_memory_size, bytes_alloc,
1280 format_memory_size, bytes_free, f->n_alloc, n_free);
1285 static clib_error_t *
1286 show_buffers (vlib_main_t * vm,
1287 unformat_input_t * input, vlib_cli_command_t * cmd)
1289 vlib_buffer_main_t *bm;
1290 vlib_buffer_free_list_t *f;
1291 vlib_main_t *curr_vm;
1294 vlib_cli_output (vm, "%U", format_vlib_buffer_free_list, 0, 0);
1298 curr_vm = vec_len (vlib_mains) ? vlib_mains[vm_index] : vm;
1299 bm = curr_vm->buffer_main;
1302 pool_foreach (f, bm->buffer_free_list_pool, ({
1303 vlib_cli_output (vm, "%U", format_vlib_buffer_free_list, f, vm_index);
1309 while (vm_index < vec_len (vlib_mains));
1315 VLIB_CLI_COMMAND (show_buffers_command, static) = {
1316 .path = "show buffers",
1317 .short_help = "Show packet buffer allocation",
1318 .function = show_buffers,
1323 vlib_buffer_cb_init (struct vlib_main_t *vm)
1325 vlib_buffer_main_t *bm = vm->buffer_main;
1326 bm->cb.vlib_buffer_alloc_cb = &vlib_buffer_alloc_internal;
1327 bm->cb.vlib_buffer_alloc_from_free_list_cb =
1328 &vlib_buffer_alloc_from_free_list_internal;
1329 bm->cb.vlib_buffer_free_cb = &vlib_buffer_free_internal;
1330 bm->cb.vlib_buffer_free_no_next_cb = &vlib_buffer_free_no_next_internal;
1331 bm->cb.vlib_buffer_delete_free_list_cb =
1332 &vlib_buffer_delete_free_list_internal;
1333 bm->extern_buffer_mgmt = 0;
1337 vlib_buffer_cb_register (struct vlib_main_t *vm, vlib_buffer_callbacks_t * cb)
1339 vlib_buffer_main_t *bm = vm->buffer_main;
1340 if (bm->extern_buffer_mgmt)
1343 #define _(x) bm->cb.x = cb->x
1344 _(vlib_buffer_alloc_cb);
1345 _(vlib_buffer_alloc_from_free_list_cb);
1346 _(vlib_buffer_free_cb);
1347 _(vlib_buffer_free_no_next_cb);
1348 _(vlib_buffer_delete_free_list_cb);
1350 bm->extern_buffer_mgmt = 1;
1356 * fd.io coding-style-patch-verification: ON
1359 * eval: (c-set-style "gnu")