1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
|
/*
* Copyright (c) 2015 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
* buffer.c: allocate/free network buffers.
*
* Copyright (c) 2008 Eliot Dresselhaus
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
/**
* @file
*
* Allocate/free network buffers.
*/
#include <vppinfra/linux/sysfs.h>
#include <vlib/vlib.h>
#include <vlib/unix/unix.h>
#include <vpp/stats/stat_segment.h>
#define VLIB_BUFFER_DEFAULT_BUFFERS_PER_NUMA 16384
#define VLIB_BUFFER_DEFAULT_BUFFERS_PER_NUMA_UNPRIV 8192
#ifdef CLIB_HAVE_VEC128
/* Assumptions by vlib_buffer_free_inline: */
STATIC_ASSERT_FITS_IN (vlib_buffer_t, flags, 16);
STATIC_ASSERT_FITS_IN (vlib_buffer_t, ref_count, 16);
STATIC_ASSERT_FITS_IN (vlib_buffer_t, buffer_pool_index, 16);
#endif
/* Make sure that buffer template size is not accidentally changed */
STATIC_ASSERT_OFFSET_OF (vlib_buffer_t, template_end, 64);
u16 __vlib_buffer_external_hdr_size = 0;
static void
buffer_gauges_update_cached_fn (stat_segment_directory_entry_t * e,
u32 index);
static void
buffer_gauges_update_available_fn (stat_segment_directory_entry_t * e,
u32 index);
static void
buffer_gauges_update_used_fn (stat_segment_directory_entry_t * e, u32 index);
uword
vlib_buffer_length_in_chain_slow_path (vlib_main_t * vm,
vlib_buffer_t * b_first)
{
vlib_buffer_t *b = b_first;
uword l_first = b_first->current_length;
uword l = 0;
while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
{
b = vlib_get_buffer (vm, b->next_buffer);
l += b->current_length;
}
b_first->total_length_not_including_first_buffer = l;
b_first->flags |= VLIB_BUFFER_TOTAL_LENGTH_VALID;
return l + l_first;
}
u8 *
format_vlib_buffer (u8 * s, va_list * args)
{
vlib_buffer_t *b = va_arg (*args, vlib_buffer_t *);
u32 indent = format_get_indent (s);
u8 *a = 0;
#define _(bit, name, v) \
if (v && (b->flags & VLIB_BUFFER_##name)) \
a = format (a, "%s ", v);
foreach_vlib_buffer_flag
#undef _
s = format (s, "current data %d, length %d, buffer-pool %d, "
"ref-count %u", b->current_data, b->current_length,
b->buffer_pool_index, b->ref_count);
if (b->flags & VLIB_BUFFER_TOTAL_LENGTH_VALID)
s = format (s, ", totlen-nifb %d",
b->total_length_not_including_first_buffer);
if (b->flags & VLIB_BUFFER_IS_TRACED)
s = format (s, ", trace 0x%x", b->trace_index);
if (a)
s = format (s, "\n%U%v", format_white_space, indent, a);
vec_free (a);
while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
{
vlib_main_t *vm = vlib_get_main ();
u32 next_buffer = b->next_buffer;
b = vlib_get_buffer (vm, next_buffer);
s =
format (s, "\n%Unext-buffer 0x%x, segment length %d, ref-count %u",
format_white_space, indent, next_buffer, b->current_length,
b->ref_count);
}
return s;
}
u8 *
format_vlib_buffer_and_data (u8 * s, va_list * args)
{
vlib_buffer_t *b = va_arg (*args, vlib_buffer_t *);
s = format (s, "%U, %U",
format_vlib_buffer, b,
format_hex_bytes, vlib_buffer_get_current (b), 64);
return s;
}
static u8 *
format_vlib_buffer_known_state (u8 * s, va_list * args)
{
vlib_buffer_known_state_t state = va_arg (*args, vlib_buffer_known_state_t);
char *t;
switch (state)
{
case VLIB_BUFFER_UNKNOWN:
t = "unknown";
break;
case VLIB_BUFFER_KNOWN_ALLOCATED:
t = "known-allocated";
break;
case VLIB_BUFFER_KNOWN_FREE:
t = "known-free";
break;
default:
t = "invalid";
break;
}
return format (s, "%s", t);
}
u8 *
format_vlib_buffer_contents (u8 * s, va_list * va)
{
vlib_main_t *vm = va_arg (*va, vlib_main_t *);
vlib_buffer_t *b = va_arg (*va, vlib_buffer_t *);
while (1)
{
vec_add (s, vlib_buffer_get_current (b), b->current_length);
if (!(b->flags & VLIB_BUFFER_NEXT_PRESENT))
break;
b = vlib_get_buffer (vm, b->next_buffer);
}
return s;
}
static u8 *
vlib_validate_buffer_helper (vlib_main_t * vm,
u32 bi,
uword follow_buffer_next, uword ** unique_hash)
{
vlib_buffer_main_t *bm = vm->buffer_main;
vlib_buffer_t *b = vlib_get_buffer (vm, bi);
if (vec_len (bm->buffer_pools) <= b->buffer_pool_index)
return format (0, "unknown buffer pool 0x%x", b->buffer_pool_index);
if ((signed) b->current_data < (signed) -VLIB_BUFFER_PRE_DATA_SIZE)
return format (0, "current data %d before pre-data", b->current_data);
if (b->current_data + b->current_length >
vlib_buffer_get_default_data_size (vm))
return format (0, "%d-%d beyond end of buffer %d", b->current_data,
b->current_length, vlib_buffer_get_default_data_size (vm));
if (follow_buffer_next && (b->flags & VLIB_BUFFER_NEXT_PRESENT))
{
vlib_buffer_known_state_t k;
u8 *msg, *result;
k = vlib_buffer_is_known (vm, b->next_buffer);
if (k != VLIB_BUFFER_KNOWN_ALLOCATED)
return format (0, "next 0x%x: %U",
b->next_buffer, format_vlib_buffer_known_state, k);
if (unique_hash)
{
if (hash_get (*unique_hash, b->next_buffer))
return format (0, "duplicate buffer 0x%x", b->next_buffer);
hash_set1 (*unique_hash, b->next_buffer);
}
msg = vlib_validate_buffer (vm, b->next_buffer, follow_buffer_next);
if (msg)
{
result = format (0, "next 0x%x: %v", b->next_buffer, msg);
vec_free (msg);
return result;
}
}
return 0;
}
u8 *
vlib_validate_buffer (vlib_main_t * vm, u32 bi, uword follow_buffer_next)
{
return vlib_validate_buffer_helper (vm, bi, follow_buffer_next,
/* unique_hash */ 0);
}
u8 *
vlib_validate_buffers (vlib_main_t * vm,
u32 * buffers,
uword next_buffer_stride,
uword n_buffers,
vlib_buffer_known_state_t known_state,
uword follow_buffer_next)
{
uword i, *hash;
u32 bi, *b = buffers;
vlib_buffer_known_state_t k;
u8 *msg = 0, *result = 0;
hash = hash_create (0, 0);
for (i = 0; i < n_buffers; i++)
{
bi = b[0];
b += next_buffer_stride;
/* Buffer is not unique. */
if (hash_get (hash, bi))
{
msg = format (0, "not unique");
goto done;
}
k = vlib_buffer_is_known (vm, bi);
if (k != known_state)
{
msg = format (0, "is %U; expected %U",
format_vlib_buffer_known_state, k,
format_vlib_buffer_known_state, known_state);
goto done;
}
msg = vlib_validate_buffer_helper (vm, bi, follow_buffer_next, &hash);
if (msg)
goto done;
hash_set1 (hash, bi);
}
done:
if (msg)
{
result = format (0, "0x%x: %v", bi, msg);
vec_free (msg);
}
hash_free (hash);
return result;
}
/*
* Hand-craft a static vector w/ length 1, so vec_len(vlib_mains) =1
* and vlib_mains[0] = &vlib_global_main from the beginning of time.
*
* The only place which should ever expand vlib_mains is start_workers()
* in threads.c. It knows about the bootstrap vector.
*/
/* *INDENT-OFF* */
static struct
{
vec_header_t h;
vlib_main_t *vm;
} __attribute__ ((packed)) __bootstrap_vlib_main_vector
__attribute__ ((aligned (CLIB_CACHE_LINE_BYTES))) =
{
.h.len = 1,
.vm = &vlib_global_main,
};
/* *INDENT-ON* */
vlib_main_t **vlib_mains = &__bootstrap_vlib_main_vector.vm;
/* When dubugging validate that given buffers are either known allocated
or known free. */
void
vlib_buffer_validate_alloc_free (vlib_main_t * vm,
u32 * buffers,
uword n_buffers,
vlib_buffer_known_state_t expected_state)
{
vlib_buffer_main_t *bm = vm->buffer_main;
u32 *b;
uword i, bi, is_free;
if (CLIB_DEBUG == 0)
return;
is_free = expected_state == VLIB_BUFFER_KNOWN_ALLOCATED;
b = buffers;
for (i = 0; i < n_buffers; i++)
{
vlib_buffer_known_state_t known;
bi = b[0];
b += 1;
known = vlib_buffer_is_known (vm, bi);
if (known == VLIB_BUFFER_UNKNOWN &&
expected_state == VLIB_BUFFER_KNOWN_FREE)
known = VLIB_BUFFER_KNOWN_FREE;
if (known != expected_state)
{
clib_panic ("%s %U buffer 0x%x", is_free ? "freeing" : "allocating",
format_vlib_buffer_known_state, known, bi);
}
clib_spinlock_lock (&bm->buffer_known_hash_lockp);
hash_set (bm->buffer_known_hash, bi, is_free ? VLIB_BUFFER_KNOWN_FREE :
VLIB_BUFFER_KNOWN_ALLOCATED);
clib_spinlock_unlock (&bm->buffer_known_hash_lockp);
}
}
void
vlib_packet_template_init (vlib_main_t * vm,
vlib_packet_template_t * t,
void *packet_data,
uword n_packet_data_bytes,
uword min_n_buffers_each_alloc, char *fmt, ...)
{
va_list va;
va_start (va, fmt);
t->name = va_format (0, fmt, &va);
va_end (va);
vlib_worker_thread_barrier_sync (vm);
clib_memset (t, 0, sizeof (t[0]));
vec_add (t->packet_data, packet_data, n_packet_data_bytes);
t->min_n_buffers_each_alloc = min_n_buffers_each_alloc;
vlib_worker_thread_barrier_release (vm);
}
void *
vlib_packet_template_get_packet (vlib_main_t * vm,
vlib_packet_template_t * t, u32 * bi_result)
{
u32 bi;
vlib_buffer_t *b;
if (vlib_buffer_alloc (vm, &bi, 1) != 1)
return 0;
*bi_result = bi;
b = vlib_get_buffer (vm, bi);
clib_memcpy_fast (vlib_buffer_get_current (b),
t->packet_data, vec_len (t->packet_data));
b->current_length = vec_len (t->packet_data);
return b->data;
}
/* Append given data to end of buffer, possibly allocating new buffers. */
int
vlib_buffer_add_data (vlib_main_t * vm, u32 * buffer_index, void *data,
u32 n_data_bytes)
{
u32 n_buffer_bytes, n_left, n_left_this_buffer, bi;
vlib_buffer_t *b;
void *d;
bi = *buffer_index;
if (bi == ~0 && 1 != vlib_buffer_alloc (vm, &bi, 1))
goto out_of_buffers;
d = data;
n_left = n_data_bytes;
n_buffer_bytes = vlib_buffer_get_default_data_size (vm);
b = vlib_get_buffer (vm, bi);
b->flags &= ~VLIB_BUFFER_TOTAL_LENGTH_VALID;
/* Get to the end of the chain before we try to append data... */
while (b->flags & VLIB_BUFFER_NEXT_PRESENT)
b = vlib_get_buffer (vm, b->next_buffer);
while (1)
{
u32 n;
ASSERT (n_buffer_bytes >= b->current_length);
n_left_this_buffer =
n_buffer_bytes - (b->current_data + b->current_length);
n = clib_min (n_left_this_buffer, n_left);
clib_memcpy_fast (vlib_buffer_get_current (b) + b->current_length, d,
n);
b->current_length += n;
n_left -= n;
if (n_left == 0)
break;
d += n;
if (1 != vlib_buffer_alloc (vm, &b->next_buffer, 1))
goto out_of_buffers;
b->flags |= VLIB_BUFFER_NEXT_PRESENT;
b = vlib_get_buffer (vm, b->next_buffer);
}
*buffer_index = bi;
return 0;
out_of_buffers:
clib_warning ("out of buffers");
return 1;
}
u16
vlib_buffer_chain_append_data_with_alloc (vlib_main_t * vm,
vlib_buffer_t * first,
vlib_buffer_t ** last, void *data,
u16 data_len)
{
vlib_buffer_t *l = *last;
u32 n_buffer_bytes = vlib_buffer_get_default_data_size (vm);
u16 copied = 0;
ASSERT (n_buffer_bytes >= l->current_length + l->current_data);
while (data_len)
{
u16 max = n_buffer_bytes - l->current_length - l->current_data;
if (max == 0)
{
if (1 != vlib_buffer_alloc_from_pool (vm, &l->next_buffer, 1,
first->buffer_pool_index))
return copied;
*last = l = vlib_buffer_chain_buffer (vm, l, l->next_buffer);
max = n_buffer_bytes - l->current_length - l->current_data;
}
u16 len = (data_len > max) ? max : data_len;
clib_memcpy_fast (vlib_buffer_get_current (l) + l->current_length,
data + copied, len);
vlib_buffer_chain_increase_length (first, l, len);
data_len -= len;
copied += len;
}
return copied;
}
u8
vlib_buffer_pool_create (vlib_main_t * vm, char *name, u32 data_size,
u32 physmem_map_index)
{
vlib_buffer_main_t *bm = vm->buffer_main;
vlib_buffer_pool_t *bp;
vlib_physmem_map_t *m = vlib_physmem_get_map (vm, physmem_map_index);
uword start = pointer_to_uword (m->base);
uword size = (uword) m->n_pages << m->log2_page_size;
uword i, j;
u32 alloc_size, n_alloc_per_page;
if (vec_len (bm->buffer_pools) >= 255)
return ~0;
vec_add2_aligned (bm->buffer_pools, bp, 1, CLIB_LOG2_CACHE_LINE_BYTES);
if (bm->buffer_mem_size == 0)
{
bm->buffer_mem_start = start;
bm->buffer_mem_size = size;
}
else if (start < bm->buffer_mem_start)
{
bm->buffer_mem_size += bm->buffer_mem_start - start;
bm->buffer_mem_start = start;
if (size > bm->buffer_mem_size)
bm->buffer_mem_size = size;
}
else if (start > bm->buffer_mem_start)
{
uword new_size = start - bm->buffer_mem_start + size;
if (new_size > bm->buffer_mem_size)
bm->buffer_mem_size = new_size;
}
if ((u64) bm->buffer_mem_size >
((u64) 1 << (32 + CLIB_LOG2_CACHE_LINE_BYTES)))
{
clib_panic ("buffer memory size out of range!");
}
bp->start = start;
bp->size = size;
bp->index = bp - bm->buffer_pools;
bp->buffer_template.buffer_pool_index = bp->index;
bp->buffer_template.ref_count = 1;
bp->physmem_map_index = physmem_map_index;
bp->name = format (0, "%s%c", name, 0);
bp->data_size = data_size;
bp->numa_node = m->numa_node;
vec_validate_aligned (bp->threads, vec_len (vlib_mains) - 1,
CLIB_CACHE_LINE_BYTES);
alloc_size = data_size + sizeof (vlib_buffer_t) + bm->ext_hdr_size;
n_alloc_per_page = (1ULL << m->log2_page_size) / alloc_size;
/* preallocate buffer indices memory */
vec_validate_aligned (bp->buffers, m->n_pages * n_alloc_per_page,
CLIB_CACHE_LINE_BYTES);
vec_reset_length (bp->buffers);
clib_spinlock_init (&bp->lock);
for (j = 0; j < m->n_pages; j++)
for (i = 0; i < n_alloc_per_page; i++)
{
u8 *p;
u32 bi;
p = m->base + (j << m->log2_page_size) + i * alloc_size;
p += bm->ext_hdr_size;
vlib_buffer_copy_template ((vlib_buffer_t *) p, &bp->buffer_template);
bi = vlib_get_buffer_index (vm, (vlib_buffer_t *) p);
vec_add1_aligned (bp->buffers, bi, CLIB_CACHE_LINE_BYTES);
vlib_get_buffer (vm, bi);
}
bp->n_buffers = vec_len (bp->buffers);
return bp->index;
}
static u8 *
format_vlib_buffer_pool (u8 * s, va_list * va)
{
vlib_main_t *vm = va_arg (*va, vlib_main_t *);
vlib_buffer_pool_t *bp = va_arg (*va, vlib_buffer_pool_t *);
vlib_buffer_pool_thread_t *bpt;
u32 cached = 0;
if (!bp)
return format (s, "%-20s%=6s%=6s%=6s%=11s%=6s%=8s%=8s%=8s",
"Pool Name", "Index", "NUMA", "Size", "Data Size",
"Total", "Avail", "Cached", "Used");
/* *INDENT-OFF* */
vec_foreach (bpt, bp->threads)
cached += vec_len (bpt->cached_buffers);
/* *INDENT-ON* */
s = format (s, "%-20s%=6d%=6d%=6u%=11u%=6u%=8u%=8u%=8u",
bp->name, bp->index, bp->numa_node, bp->data_size +
sizeof (vlib_buffer_t) + vm->buffer_main->ext_hdr_size,
bp->data_size, bp->n_buffers, vec_len (bp->buffers), cached,
bp->n_buffers - vec_len (bp->buffers) - cached);
return s;
}
static clib_error_t *
show_buffers (vlib_main_t * vm,
unformat_input_t * input, vlib_cli_command_t * cmd)
{
vlib_buffer_main_t *bm = vm->buffer_main;
vlib_buffer_pool_t *bp;
vlib_cli_output (vm, "%U", format_vlib_buffer_pool, vm, 0);
/* *INDENT-OFF* */
vec_foreach (bp, bm->buffer_pools)
vlib_cli_output (vm, "%U", format_vlib_buffer_pool, vm, bp);
/* *INDENT-ON* */
return 0;
}
/* *INDENT-OFF* */
VLIB_CLI_COMMAND (show_buffers_command, static) = {
.path = "show buffers",
.short_help = "Show packet buffer allocation",
.function = show_buffers,
};
/* *INDENT-ON* */
clib_error_t *
vlib_buffer_worker_init (vlib_main_t * vm)
{
vlib_buffer_main_t *bm = vm->buffer_main;
vlib_buffer_pool_t *bp;
/* *INDENT-OFF* */
vec_foreach (bp, bm->buffer_pools)
{
clib_spinlock_lock (&bp->lock);
vec_validate_aligned (bp->threads, vec_len (vlib_mains) - 1,
CLIB_CACHE_LINE_BYTES);
clib_spinlock_unlock (&bp->lock);
}
/* *INDENT-ON* */
return 0;
}
VLIB_WORKER_INIT_FUNCTION (vlib_buffer_worker_init);
static clib_error_t *
vlib_buffer_main_init_numa_node (struct vlib_main_t *vm, u32 numa_node,
u8 * index)
{
vlib_buffer_main_t *bm = vm->buffer_main;
clib_error_t *error;
u32 physmem_map_index;
uword n_pages, pagesize;
u32 buffers_per_numa;
u32 buffer_size = CLIB_CACHE_LINE_ROUND (bm->ext_hdr_size +
sizeof (vlib_buffer_t) +
vlib_buffer_get_default_data_size
(vm));
u8 *name;
pagesize = clib_mem_get_default_hugepage_size ();
name = format (0, "buffers-numa-%d%c", numa_node, 0);
buffers_per_numa = bm->buffers_per_numa ? bm->buffers_per_numa :
VLIB_BUFFER_DEFAULT_BUFFERS_PER_NUMA;
retry:
n_pages = (buffers_per_numa - 1) / (pagesize / buffer_size) + 1;
error = vlib_physmem_shared_map_create (vm, (char *) name,
n_pages * pagesize,
min_log2 (pagesize), numa_node,
&physmem_map_index);
if (error && pagesize != clib_mem_get_page_size ())
{
vlib_log_warn (bm->log_default, "%U", format_clib_error, error);
clib_error_free (error);
vlib_log_warn (bm->log_default, "falling back to non-hugepage "
"backed buffer pool");
pagesize = clib_mem_get_page_size ();
buffers_per_numa = bm->buffers_per_numa ? bm->buffers_per_numa :
VLIB_BUFFER_DEFAULT_BUFFERS_PER_NUMA_UNPRIV;
goto retry;
}
if (error)
return error;
vec_reset_length (name);
name = format (name, "default-numa-%d%c", numa_node, 0);
*index = vlib_buffer_pool_create (vm, (char *) name,
vlib_buffer_get_default_data_size (vm),
physmem_map_index);
if (*index == (u8) ~ 0)
return clib_error_return (0, "maximum number of buffer pools reached");
return 0;
}
void
vlib_buffer_main_alloc (vlib_main_t * vm)
{
vlib_buffer_main_t *bm;
if (vm->buffer_main)
return;
vm->buffer_main = bm = clib_mem_alloc (sizeof (bm[0]));
clib_memset (vm->buffer_main, 0, sizeof (bm[0]));
bm->default_data_size = VLIB_BUFFER_DEFAULT_DATA_SIZE;
}
static u32
buffer_get_cached (vlib_buffer_pool_t * bp)
{
u32 cached = 0;
vlib_buffer_pool_thread_t *bpt;
clib_spinlock_lock (&bp->lock);
/* *INDENT-OFF* */
vec_foreach (bpt, bp->threads)
cached += vec_len (bpt->cached_buffers);
/* *INDENT-ON* */
clib_spinlock_unlock (&bp->lock);
return cached;
}
static vlib_buffer_pool_t *
buffer_get_by_index (vlib_buffer_main_t * bm, u32 index)
{
vlib_buffer_pool_t *bp;
if (!bm->buffer_pools || vec_len (bm->buffer_pools) < index)
return 0;
bp = vec_elt_at_index (bm->buffer_pools, index);
return bp;
}
static void
buffer_gauges_update_used_fn (stat_segment_directory_entry_t * e, u32 index)
{
vlib_main_t *vm = vlib_get_main ();
vlib_buffer_pool_t *bp = buffer_get_by_index (vm->buffer_main, index);
if (!bp)
return;
e->value = bp->n_buffers - vec_len (bp->buffers) - buffer_get_cached (bp);
}
static void
buffer_gauges_update_available_fn (stat_segment_directory_entry_t * e,
u32 index)
{
vlib_main_t *vm = vlib_get_main ();
vlib_buffer_pool_t *bp = buffer_get_by_index (vm->buffer_main, index);
if (!bp)
return;
e->value = vec_len (bp->buffers);
}
static void
buffer_gauges_update_cached_fn (stat_segment_directory_entry_t * e, u32 index)
{
vlib_main_t *vm = vlib_get_main ();
vlib_buffer_pool_t *bp = buffer_get_by_index (vm->buffer_main, index);
if (!bp)
return;
e->value = buffer_get_cached (bp);
}
clib_error_t *
vlib_buffer_main_init (struct vlib_main_t * vm)
{
vlib_buffer_main_t *bm;
clib_error_t *err;
clib_bitmap_t *bmp = 0, *bmp_has_memory = 0;
u32 numa_node;
vlib_buffer_pool_t *bp;
u8 *name = 0, first_valid_buffer_pool_index = ~0;
vlib_buffer_main_alloc (vm);
bm = vm->buffer_main;
bm->log_default = vlib_log_register_class ("buffer", 0);
bm->ext_hdr_size = __vlib_buffer_external_hdr_size;
clib_spinlock_init (&bm->buffer_known_hash_lockp);
if ((err = clib_sysfs_read ("/sys/devices/system/node/online", "%U",
unformat_bitmap_list, &bmp)))
clib_error_free (err);
if ((err = clib_sysfs_read ("/sys/devices/system/node/has_memory", "%U",
unformat_bitmap_list, &bmp_has_memory)))
clib_error_free (err);
if (bmp && bmp_has_memory)
bmp = clib_bitmap_and (bmp, bmp_has_memory);
/* no info from sysfs, assuming that only numa 0 exists */
if (bmp == 0)
bmp = clib_bitmap_set (bmp, 0, 1);
if (clib_bitmap_last_set (bmp) >= VLIB_BUFFER_MAX_NUMA_NODES)
clib_panic ("system have more than %u NUMA nodes",
VLIB_BUFFER_MAX_NUMA_NODES);
/* *INDENT-OFF* */
clib_bitmap_foreach (numa_node, bmp,
{
u8 *index = bm->default_buffer_pool_index_for_numa + numa_node;
index[0] = ~0;
if ((err = vlib_buffer_main_init_numa_node (vm, numa_node, index)))
{
clib_error_report (err);
clib_error_free (err);
continue;
}
if (first_valid_buffer_pool_index == 0xff)
first_valid_buffer_pool_index = index[0];
});
/* *INDENT-ON* */
if (first_valid_buffer_pool_index == (u8) ~ 0)
{
err = clib_error_return (0, "failed to allocate buffer pool(s)");
goto done;
}
/* *INDENT-OFF* */
clib_bitmap_foreach (numa_node, bmp,
{
if (bm->default_buffer_pool_index_for_numa[numa_node] == (u8) ~0)
bm->default_buffer_pool_index_for_numa[numa_node] =
first_valid_buffer_pool_index;
});
/* *INDENT-ON* */
vec_foreach (bp, bm->buffer_pools)
{
if (bp->n_buffers == 0)
continue;
vec_reset_length (name);
name = format (name, "/buffer-pools/%s/cached%c", bp->name, 0);
stat_segment_register_gauge (name, buffer_gauges_update_cached_fn,
bp - bm->buffer_pools);
vec_reset_length (name);
name = format (name, "/buffer-pools/%s/used%c", bp->name, 0);
stat_segment_register_gauge (name, buffer_gauges_update_used_fn,
bp - bm->buffer_pools);
vec_reset_length (name);
name = format (name, "/buffer-pools/%s/available%c", bp->name, 0);
stat_segment_register_gauge (name, buffer_gauges_update_available_fn,
bp - bm->buffer_pools);
}
done:
vec_free (bmp);
vec_free (bmp_has_memory);
vec_free (name);
return err;
}
static clib_error_t *
vlib_buffers_configure (vlib_main_t * vm, unformat_input_t * input)
{
vlib_buffer_main_t *bm;
vlib_buffer_main_alloc (vm);
bm = vm->buffer_main;
while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
{
if (unformat (input, "buffers-per-numa %u", &bm->buffers_per_numa))
;
else if (unformat (input, "default data-size %u",
&bm->default_data_size))
;
else
return unformat_parse_error (input);
}
unformat_free (input);
return 0;
}
VLIB_EARLY_CONFIG_FUNCTION (vlib_buffers_configure, "buffers");
/** @endcond */
/*
* fd.io coding-style-patch-verification: ON
*
* Local Variables:
* eval: (c-set-style "gnu")
* End:
*/
|