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 <vppinfra/linux/sysfs.h>
47 #include <vlib/vlib.h>
48 #include <vlib/unix/unix.h>
49 #include <vpp/stats/stat_segment.h>
51 #define VLIB_BUFFER_DEFAULT_BUFFERS_PER_NUMA 16384
52 #define VLIB_BUFFER_DEFAULT_BUFFERS_PER_NUMA_UNPRIV 8192
54 #ifdef CLIB_HAVE_VEC128
55 /* Assumptions by vlib_buffer_free_inline: */
56 STATIC_ASSERT_FITS_IN (vlib_buffer_t, flags, 16);
57 STATIC_ASSERT_FITS_IN (vlib_buffer_t, ref_count, 16);
58 STATIC_ASSERT_FITS_IN (vlib_buffer_t, buffer_pool_index, 16);
61 /* Make sure that buffer template size is not accidentally changed */
62 STATIC_ASSERT_OFFSET_OF (vlib_buffer_t, template_end, 64);
64 u16 __vlib_buffer_external_hdr_size = 0;
67 buffer_gauges_update_cached_fn (stat_segment_directory_entry_t * e,
71 buffer_gauges_update_available_fn (stat_segment_directory_entry_t * e,
75 buffer_gauges_update_used_fn (stat_segment_directory_entry_t * e, u32 index);
78 vlib_buffer_length_in_chain_slow_path (vlib_main_t * vm,
79 vlib_buffer_t * b_first)
81 vlib_buffer_t *b = b_first;
82 uword l_first = b_first->current_length;
84 while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
86 b = vlib_get_buffer (vm, b->next_buffer);
87 l += b->current_length;
89 b_first->total_length_not_including_first_buffer = l;
90 b_first->flags |= VLIB_BUFFER_TOTAL_LENGTH_VALID;
95 format_vlib_buffer_no_chain (u8 * s, va_list * args)
97 vlib_buffer_t *b = va_arg (*args, vlib_buffer_t *);
98 u32 indent = format_get_indent (s);
101 #define _(bit, name, v) \
102 if (v && (b->flags & VLIB_BUFFER_##name)) \
103 a = format (a, "%s ", v);
104 foreach_vlib_buffer_flag
106 s = format (s, "current data %d, length %d, buffer-pool %d, "
107 "ref-count %u", b->current_data, b->current_length,
108 b->buffer_pool_index, b->ref_count);
110 if (b->flags & VLIB_BUFFER_TOTAL_LENGTH_VALID)
111 s = format (s, ", totlen-nifb %d",
112 b->total_length_not_including_first_buffer);
114 if (b->flags & VLIB_BUFFER_IS_TRACED)
115 s = format (s, ", trace handle 0x%x", b->trace_handle);
118 s = format (s, "\n%U%v", format_white_space, indent, a);
125 format_vlib_buffer (u8 * s, va_list * args)
127 vlib_main_t *vm = vlib_get_main ();
128 vlib_buffer_t *b = va_arg (*args, vlib_buffer_t *);
129 u32 indent = format_get_indent (s);
131 s = format (s, "%U", format_vlib_buffer_no_chain, b);
133 while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
135 u32 next_buffer = b->next_buffer;
136 b = vlib_get_buffer (vm, next_buffer);
139 format (s, "\n%Unext-buffer 0x%x, segment length %d, ref-count %u",
140 format_white_space, indent, next_buffer, b->current_length,
148 format_vlib_buffer_and_data (u8 * s, va_list * args)
150 vlib_buffer_t *b = va_arg (*args, vlib_buffer_t *);
152 s = format (s, "%U, %U",
153 format_vlib_buffer, b,
154 format_hex_bytes, vlib_buffer_get_current (b), 64);
160 format_vlib_buffer_known_state (u8 * s, va_list * args)
162 vlib_buffer_known_state_t state = va_arg (*args, vlib_buffer_known_state_t);
167 case VLIB_BUFFER_UNKNOWN:
171 case VLIB_BUFFER_KNOWN_ALLOCATED:
172 t = "known-allocated";
175 case VLIB_BUFFER_KNOWN_FREE:
184 return format (s, "%s", t);
188 format_vlib_buffer_contents (u8 * s, va_list * va)
190 vlib_main_t *vm = va_arg (*va, vlib_main_t *);
191 vlib_buffer_t *b = va_arg (*va, vlib_buffer_t *);
195 vec_add (s, vlib_buffer_get_current (b), b->current_length);
196 if (!(b->flags & VLIB_BUFFER_NEXT_PRESENT))
198 b = vlib_get_buffer (vm, b->next_buffer);
205 vlib_validate_buffer_helper (vlib_main_t * vm,
207 uword follow_buffer_next, uword ** unique_hash)
209 vlib_buffer_main_t *bm = vm->buffer_main;
210 vlib_buffer_t *b = vlib_get_buffer (vm, bi);
212 if (vec_len (bm->buffer_pools) <= b->buffer_pool_index)
213 return format (0, "unknown buffer pool 0x%x", b->buffer_pool_index);
215 if ((signed) b->current_data < (signed) -VLIB_BUFFER_PRE_DATA_SIZE)
216 return format (0, "current data %d before pre-data", b->current_data);
218 if (b->current_data + b->current_length >
219 vlib_buffer_get_default_data_size (vm))
220 return format (0, "%d-%d beyond end of buffer %d", b->current_data,
221 b->current_length, vlib_buffer_get_default_data_size (vm));
223 if (follow_buffer_next && (b->flags & VLIB_BUFFER_NEXT_PRESENT))
225 vlib_buffer_known_state_t k;
228 k = vlib_buffer_is_known (vm, b->next_buffer);
229 if (k != VLIB_BUFFER_KNOWN_ALLOCATED)
230 return format (0, "next 0x%x: %U",
231 b->next_buffer, format_vlib_buffer_known_state, k);
235 if (hash_get (*unique_hash, b->next_buffer))
236 return format (0, "duplicate buffer 0x%x", b->next_buffer);
238 hash_set1 (*unique_hash, b->next_buffer);
241 msg = vlib_validate_buffer (vm, b->next_buffer, follow_buffer_next);
244 result = format (0, "next 0x%x: %v", b->next_buffer, msg);
254 vlib_validate_buffer (vlib_main_t * vm, u32 bi, uword follow_buffer_next)
256 return vlib_validate_buffer_helper (vm, bi, follow_buffer_next,
257 /* unique_hash */ 0);
261 vlib_validate_buffers (vlib_main_t * vm,
263 uword next_buffer_stride,
265 vlib_buffer_known_state_t known_state,
266 uword follow_buffer_next)
269 u32 bi, *b = buffers;
270 vlib_buffer_known_state_t k;
271 u8 *msg = 0, *result = 0;
273 hash = hash_create (0, 0);
274 for (i = 0; i < n_buffers; i++)
277 b += next_buffer_stride;
279 /* Buffer is not unique. */
280 if (hash_get (hash, bi))
282 msg = format (0, "not unique");
286 k = vlib_buffer_is_known (vm, bi);
287 if (k != known_state)
289 msg = format (0, "is %U; expected %U",
290 format_vlib_buffer_known_state, k,
291 format_vlib_buffer_known_state, known_state);
295 msg = vlib_validate_buffer_helper (vm, bi, follow_buffer_next, &hash);
299 hash_set1 (hash, bi);
305 result = format (0, "0x%x: %v", bi, msg);
313 * Hand-craft a static vector w/ length 1, so vec_len(vlib_mains) =1
314 * and vlib_mains[0] = &vlib_global_main from the beginning of time.
316 * The only place which should ever expand vlib_mains is start_workers()
317 * in threads.c. It knows about the bootstrap vector.
324 } __attribute__ ((packed)) __bootstrap_vlib_main_vector
325 __attribute__ ((aligned (CLIB_CACHE_LINE_BYTES))) =
328 .vm = &vlib_global_main,
332 vlib_main_t **vlib_mains = &__bootstrap_vlib_main_vector.vm;
335 /* When debugging validate that given buffers are either known allocated
338 vlib_buffer_validate_alloc_free (vlib_main_t * vm,
341 vlib_buffer_known_state_t expected_state)
343 vlib_buffer_main_t *bm = vm->buffer_main;
345 uword i, bi, is_free;
350 is_free = expected_state == VLIB_BUFFER_KNOWN_ALLOCATED;
352 for (i = 0; i < n_buffers; i++)
354 vlib_buffer_known_state_t known;
358 known = vlib_buffer_is_known (vm, bi);
360 if (known == VLIB_BUFFER_UNKNOWN &&
361 expected_state == VLIB_BUFFER_KNOWN_FREE)
362 known = VLIB_BUFFER_KNOWN_FREE;
364 if (known != expected_state)
366 clib_panic ("%s %U buffer 0x%x", is_free ? "freeing" : "allocating",
367 format_vlib_buffer_known_state, known, bi);
370 clib_spinlock_lock (&bm->buffer_known_hash_lockp);
371 hash_set (bm->buffer_known_hash, bi, is_free ? VLIB_BUFFER_KNOWN_FREE :
372 VLIB_BUFFER_KNOWN_ALLOCATED);
373 clib_spinlock_unlock (&bm->buffer_known_hash_lockp);
378 vlib_packet_template_init (vlib_main_t * vm,
379 vlib_packet_template_t * t,
381 uword n_packet_data_bytes,
382 uword min_n_buffers_each_alloc, char *fmt, ...)
387 t->name = va_format (0, fmt, &va);
390 vlib_worker_thread_barrier_sync (vm);
392 clib_memset (t, 0, sizeof (t[0]));
394 vec_add (t->packet_data, packet_data, n_packet_data_bytes);
395 t->min_n_buffers_each_alloc = min_n_buffers_each_alloc;
396 vlib_worker_thread_barrier_release (vm);
400 vlib_packet_template_get_packet (vlib_main_t * vm,
401 vlib_packet_template_t * t, u32 * bi_result)
406 if (vlib_buffer_alloc (vm, &bi, 1) != 1)
411 b = vlib_get_buffer (vm, bi);
412 clib_memcpy_fast (vlib_buffer_get_current (b),
413 t->packet_data, vec_len (t->packet_data));
414 b->current_length = vec_len (t->packet_data);
419 /* Append given data to end of buffer, possibly allocating new buffers. */
421 vlib_buffer_add_data (vlib_main_t * vm, u32 * buffer_index, void *data,
424 u32 n_buffer_bytes, n_left, n_left_this_buffer, bi;
429 if (bi == ~0 && 1 != vlib_buffer_alloc (vm, &bi, 1))
433 n_left = n_data_bytes;
434 n_buffer_bytes = vlib_buffer_get_default_data_size (vm);
436 b = vlib_get_buffer (vm, bi);
437 b->flags &= ~VLIB_BUFFER_TOTAL_LENGTH_VALID;
439 /* Get to the end of the chain before we try to append data... */
440 while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
441 b = vlib_get_buffer (vm, b->next_buffer);
447 ASSERT (n_buffer_bytes >= b->current_length);
449 n_buffer_bytes - (b->current_data + b->current_length);
450 n = clib_min (n_left_this_buffer, n_left);
451 clib_memcpy_fast (vlib_buffer_get_current (b) + b->current_length, d,
453 b->current_length += n;
459 if (1 != vlib_buffer_alloc (vm, &b->next_buffer, 1))
462 b->flags |= VLIB_BUFFER_NEXT_PRESENT;
464 b = vlib_get_buffer (vm, b->next_buffer);
471 clib_warning ("out of buffers");
476 vlib_buffer_chain_append_data_with_alloc (vlib_main_t * vm,
477 vlib_buffer_t * first,
478 vlib_buffer_t ** last, void *data,
481 vlib_buffer_t *l = *last;
482 u32 n_buffer_bytes = vlib_buffer_get_default_data_size (vm);
484 ASSERT (n_buffer_bytes >= l->current_length + l->current_data);
487 u16 max = n_buffer_bytes - l->current_length - l->current_data;
490 if (1 != vlib_buffer_alloc_from_pool (vm, &l->next_buffer, 1,
491 first->buffer_pool_index))
493 *last = l = vlib_buffer_chain_buffer (vm, l, l->next_buffer);
494 max = n_buffer_bytes - l->current_length - l->current_data;
497 u16 len = (data_len > max) ? max : data_len;
498 clib_memcpy_fast (vlib_buffer_get_current (l) + l->current_length,
500 vlib_buffer_chain_increase_length (first, l, len);
508 vlib_buffer_alloc_size (uword ext_hdr_size, uword data_size)
510 uword alloc_size = ext_hdr_size + sizeof (vlib_buffer_t) + data_size;
511 alloc_size = CLIB_CACHE_LINE_ROUND (alloc_size);
513 /* in case when we have even number of cachelines, we add one more for
514 * better cache occupancy */
515 alloc_size |= CLIB_CACHE_LINE_BYTES;
521 vlib_buffer_pool_create (vlib_main_t * vm, char *name, u32 data_size,
522 u32 physmem_map_index)
524 vlib_buffer_main_t *bm = vm->buffer_main;
525 vlib_buffer_pool_t *bp;
526 vlib_physmem_map_t *m = vlib_physmem_get_map (vm, physmem_map_index);
527 uword start = pointer_to_uword (m->base);
528 uword size = (uword) m->n_pages << m->log2_page_size;
530 u32 alloc_size, n_alloc_per_page;
532 if (vec_len (bm->buffer_pools) >= 255)
535 vec_add2_aligned (bm->buffer_pools, bp, 1, CLIB_LOG2_CACHE_LINE_BYTES);
537 if (bm->buffer_mem_size == 0)
539 bm->buffer_mem_start = start;
540 bm->buffer_mem_size = size;
542 else if (start < bm->buffer_mem_start)
544 bm->buffer_mem_size += bm->buffer_mem_start - start;
545 bm->buffer_mem_start = start;
546 if (size > bm->buffer_mem_size)
547 bm->buffer_mem_size = size;
549 else if (start > bm->buffer_mem_start)
551 uword new_size = start - bm->buffer_mem_start + size;
552 if (new_size > bm->buffer_mem_size)
553 bm->buffer_mem_size = new_size;
556 if ((u64) bm->buffer_mem_size >
557 ((u64) 1 << (32 + CLIB_LOG2_CACHE_LINE_BYTES)))
559 clib_panic ("buffer memory size out of range!");
564 bp->index = bp - bm->buffer_pools;
565 bp->buffer_template.buffer_pool_index = bp->index;
566 bp->buffer_template.ref_count = 1;
567 bp->physmem_map_index = physmem_map_index;
568 bp->name = format (0, "%s%c", name, 0);
569 bp->data_size = data_size;
570 bp->numa_node = m->numa_node;
572 vec_validate_aligned (bp->threads, vec_len (vlib_mains) - 1,
573 CLIB_CACHE_LINE_BYTES);
575 alloc_size = vlib_buffer_alloc_size (bm->ext_hdr_size, data_size);
576 n_alloc_per_page = (1ULL << m->log2_page_size) / alloc_size;
578 /* preallocate buffer indices memory */
579 bp->n_buffers = m->n_pages * n_alloc_per_page;
580 bp->buffers = clib_mem_alloc_aligned (bp->n_buffers * sizeof (u32),
581 CLIB_CACHE_LINE_BYTES);
583 clib_spinlock_init (&bp->lock);
585 for (j = 0; j < m->n_pages; j++)
586 for (i = 0; i < n_alloc_per_page; i++)
591 p = m->base + (j << m->log2_page_size) + i * alloc_size;
592 p += bm->ext_hdr_size;
595 * Waste 1 buffer (maximum) so that 0 is never a valid buffer index.
596 * Allows various places to ASSERT (bi != 0). Much easier
597 * than debugging downstream crashes in successor nodes.
602 vlib_buffer_copy_template ((vlib_buffer_t *) p, &bp->buffer_template);
604 bi = vlib_get_buffer_index (vm, (vlib_buffer_t *) p);
606 bp->buffers[bp->n_avail++] = bi;
608 vlib_get_buffer (vm, bi);
615 format_vlib_buffer_pool (u8 * s, va_list * va)
617 vlib_main_t *vm = va_arg (*va, vlib_main_t *);
618 vlib_buffer_pool_t *bp = va_arg (*va, vlib_buffer_pool_t *);
619 vlib_buffer_pool_thread_t *bpt;
623 return format (s, "%-20s%=6s%=6s%=6s%=11s%=6s%=8s%=8s%=8s",
624 "Pool Name", "Index", "NUMA", "Size", "Data Size",
625 "Total", "Avail", "Cached", "Used");
628 vec_foreach (bpt, bp->threads)
629 cached += bpt->n_cached;
632 s = format (s, "%-20s%=6d%=6d%=6u%=11u%=6u%=8u%=8u%=8u",
633 bp->name, bp->index, bp->numa_node, bp->data_size +
634 sizeof (vlib_buffer_t) + vm->buffer_main->ext_hdr_size,
635 bp->data_size, bp->n_buffers, bp->n_avail, cached,
636 bp->n_buffers - bp->n_avail - cached);
641 static clib_error_t *
642 show_buffers (vlib_main_t * vm,
643 unformat_input_t * input, vlib_cli_command_t * cmd)
645 vlib_buffer_main_t *bm = vm->buffer_main;
646 vlib_buffer_pool_t *bp;
648 vlib_cli_output (vm, "%U", format_vlib_buffer_pool, vm, 0);
651 vec_foreach (bp, bm->buffer_pools)
652 vlib_cli_output (vm, "%U", format_vlib_buffer_pool, vm, bp);
659 VLIB_CLI_COMMAND (show_buffers_command, static) = {
660 .path = "show buffers",
661 .short_help = "Show packet buffer allocation",
662 .function = show_buffers,
667 vlib_buffer_worker_init (vlib_main_t * vm)
669 vlib_buffer_main_t *bm = vm->buffer_main;
670 vlib_buffer_pool_t *bp;
673 vec_foreach (bp, bm->buffer_pools)
675 clib_spinlock_lock (&bp->lock);
676 vec_validate_aligned (bp->threads, vec_len (vlib_mains) - 1,
677 CLIB_CACHE_LINE_BYTES);
678 clib_spinlock_unlock (&bp->lock);
685 VLIB_WORKER_INIT_FUNCTION (vlib_buffer_worker_init);
687 static clib_error_t *
688 vlib_buffer_main_init_numa_node (struct vlib_main_t *vm, u32 numa_node,
691 vlib_buffer_main_t *bm = vm->buffer_main;
693 u32 physmem_map_index;
694 uword n_pages, pagesize;
695 u32 buffers_per_numa;
696 u32 buffer_size = vlib_buffer_alloc_size (bm->ext_hdr_size,
697 vlib_buffer_get_default_data_size
701 pagesize = clib_mem_get_default_hugepage_size ();
702 name = format (0, "buffers-numa-%d%c", numa_node, 0);
704 buffers_per_numa = bm->buffers_per_numa ? bm->buffers_per_numa :
705 VLIB_BUFFER_DEFAULT_BUFFERS_PER_NUMA;
709 if (buffer_size > pagesize)
712 clib_error_return (0,
713 "buffer size (%llu) is greater than page size (%llu)",
714 buffer_size, pagesize);
718 n_pages = (buffers_per_numa - 1) / (pagesize / buffer_size) + 1;
719 error = vlib_physmem_shared_map_create (vm, (char *) name,
721 min_log2 (pagesize), numa_node,
724 if (error && pagesize != clib_mem_get_page_size ())
726 vlib_log_warn (bm->log_default, "%U", format_clib_error, error);
727 clib_error_free (error);
728 vlib_log_warn (bm->log_default, "falling back to non-hugepage "
729 "backed buffer pool");
730 pagesize = clib_mem_get_page_size ();
731 buffers_per_numa = bm->buffers_per_numa ? bm->buffers_per_numa :
732 VLIB_BUFFER_DEFAULT_BUFFERS_PER_NUMA_UNPRIV;
739 vec_reset_length (name);
740 name = format (name, "default-numa-%d%c", numa_node, 0);
742 *index = vlib_buffer_pool_create (vm, (char *) name,
743 vlib_buffer_get_default_data_size (vm),
746 if (*index == (u8) ~ 0)
748 error = clib_error_return (0, "maximum number of buffer pools reached");
758 vlib_buffer_main_alloc (vlib_main_t * vm)
760 vlib_buffer_main_t *bm;
765 vm->buffer_main = bm = clib_mem_alloc (sizeof (bm[0]));
766 clib_memset (vm->buffer_main, 0, sizeof (bm[0]));
767 bm->default_data_size = VLIB_BUFFER_DEFAULT_DATA_SIZE;
771 buffer_get_cached (vlib_buffer_pool_t * bp)
774 vlib_buffer_pool_thread_t *bpt;
776 clib_spinlock_lock (&bp->lock);
779 vec_foreach (bpt, bp->threads)
780 cached += bpt->n_cached;
783 clib_spinlock_unlock (&bp->lock);
788 static vlib_buffer_pool_t *
789 buffer_get_by_index (vlib_buffer_main_t * bm, u32 index)
791 vlib_buffer_pool_t *bp;
792 if (!bm->buffer_pools || vec_len (bm->buffer_pools) < index)
794 bp = vec_elt_at_index (bm->buffer_pools, index);
800 buffer_gauges_update_used_fn (stat_segment_directory_entry_t * e, u32 index)
802 vlib_main_t *vm = vlib_get_main ();
803 vlib_buffer_pool_t *bp = buffer_get_by_index (vm->buffer_main, index);
807 e->value = bp->n_buffers - bp->n_avail - buffer_get_cached (bp);
811 buffer_gauges_update_available_fn (stat_segment_directory_entry_t * e,
814 vlib_main_t *vm = vlib_get_main ();
815 vlib_buffer_pool_t *bp = buffer_get_by_index (vm->buffer_main, index);
819 e->value = bp->n_avail;
823 buffer_gauges_update_cached_fn (stat_segment_directory_entry_t * e, u32 index)
825 vlib_main_t *vm = vlib_get_main ();
826 vlib_buffer_pool_t *bp = buffer_get_by_index (vm->buffer_main, index);
830 e->value = buffer_get_cached (bp);
834 vlib_buffer_main_init (struct vlib_main_t * vm)
836 vlib_buffer_main_t *bm;
838 clib_bitmap_t *bmp = 0, *bmp_has_memory = 0;
840 vlib_buffer_pool_t *bp;
841 u8 *name = 0, first_valid_buffer_pool_index = ~0;
843 vlib_buffer_main_alloc (vm);
845 bm = vm->buffer_main;
846 bm->log_default = vlib_log_register_class ("buffer", 0);
847 bm->ext_hdr_size = __vlib_buffer_external_hdr_size;
849 clib_spinlock_init (&bm->buffer_known_hash_lockp);
851 if ((err = clib_sysfs_read ("/sys/devices/system/node/online", "%U",
852 unformat_bitmap_list, &bmp)))
853 clib_error_free (err);
855 if ((err = clib_sysfs_read ("/sys/devices/system/node/has_memory", "%U",
856 unformat_bitmap_list, &bmp_has_memory)))
857 clib_error_free (err);
859 if (bmp && bmp_has_memory)
860 bmp = clib_bitmap_and (bmp, bmp_has_memory);
862 /* no info from sysfs, assuming that only numa 0 exists */
864 bmp = clib_bitmap_set (bmp, 0, 1);
866 if (clib_bitmap_last_set (bmp) >= VLIB_BUFFER_MAX_NUMA_NODES)
867 clib_panic ("system have more than %u NUMA nodes",
868 VLIB_BUFFER_MAX_NUMA_NODES);
871 clib_bitmap_foreach (numa_node, bmp,
873 u8 *index = bm->default_buffer_pool_index_for_numa + numa_node;
875 if ((err = vlib_buffer_main_init_numa_node (vm, numa_node, index)))
877 clib_error_report (err);
878 clib_error_free (err);
882 if (first_valid_buffer_pool_index == 0xff)
883 first_valid_buffer_pool_index = index[0];
887 if (first_valid_buffer_pool_index == (u8) ~ 0)
889 err = clib_error_return (0, "failed to allocate buffer pool(s)");
894 clib_bitmap_foreach (numa_node, bmp,
896 if (bm->default_buffer_pool_index_for_numa[numa_node] == (u8) ~0)
897 bm->default_buffer_pool_index_for_numa[numa_node] =
898 first_valid_buffer_pool_index;
902 vec_foreach (bp, bm->buffer_pools)
904 if (bp->n_buffers == 0)
907 vec_reset_length (name);
908 name = format (name, "/buffer-pools/%s/cached%c", bp->name, 0);
909 stat_segment_register_gauge (name, buffer_gauges_update_cached_fn,
910 bp - bm->buffer_pools);
912 vec_reset_length (name);
913 name = format (name, "/buffer-pools/%s/used%c", bp->name, 0);
914 stat_segment_register_gauge (name, buffer_gauges_update_used_fn,
915 bp - bm->buffer_pools);
917 vec_reset_length (name);
918 name = format (name, "/buffer-pools/%s/available%c", bp->name, 0);
919 stat_segment_register_gauge (name, buffer_gauges_update_available_fn,
920 bp - bm->buffer_pools);
925 vec_free (bmp_has_memory);
930 static clib_error_t *
931 vlib_buffers_configure (vlib_main_t * vm, unformat_input_t * input)
933 vlib_buffer_main_t *bm;
935 vlib_buffer_main_alloc (vm);
937 bm = vm->buffer_main;
939 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
941 if (unformat (input, "buffers-per-numa %u", &bm->buffers_per_numa))
943 else if (unformat (input, "default data-size %u",
944 &bm->default_data_size))
947 return unformat_parse_error (input);
950 unformat_free (input);
954 VLIB_EARLY_CONFIG_FUNCTION (vlib_buffers_configure, "buffers");
956 #if VLIB_BUFFER_ALLOC_FAULT_INJECTOR > 0
958 vlib_buffer_alloc_may_fail (vlib_main_t * vm, u32 n_buffers)
962 r = random_f64 (&vm->buffer_alloc_success_seed);
964 /* Fail this request? */
965 if (r > vm->buffer_alloc_success_rate)
967 /* 5% chance of returning nothing at all */
968 if (r > vm->buffer_alloc_success_rate && r > 0.95)
977 * fd.io coding-style-patch-verification: ON
980 * eval: (c-set-style "gnu")