forked from FRRouting/frr
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbgp_labelpool.c
1744 lines (1497 loc) · 43 KB
/
bgp_labelpool.c
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
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// SPDX-License-Identifier: GPL-2.0-or-later
/*
* BGP Label Pool - Manage label chunk allocations from zebra asynchronously
*
* Copyright (C) 2018 LabN Consulting, L.L.C.
*/
#include <zebra.h>
#include "log.h"
#include "memory.h"
#include "stream.h"
#include "mpls.h"
#include "vty.h"
#include "linklist.h"
#include "skiplist.h"
#include "workqueue.h"
#include "mpls.h"
#include "bgpd/bgpd.h"
#include "bgpd/bgp_labelpool.h"
#include "bgpd/bgp_debug.h"
#include "bgpd/bgp_errors.h"
#include "bgpd/bgp_route.h"
#include "bgpd/bgp_zebra.h"
#include "bgpd/bgp_vty.h"
#include "bgpd/bgp_rd.h"
#define BGP_LABELPOOL_ENABLE_TESTS 0
#include "bgpd/bgp_labelpool_clippy.c"
#if BGP_LABELPOOL_ENABLE_TESTS
static void lptest_init(void);
static void lptest_finish(void);
#endif
/*
* Remember where pool data are kept
*/
static struct labelpool *lp;
/*
* Number of labels requested at a time from the zebra label manager.
* We start small but double the request size each time up to a
* maximum size.
*
* The label space is 20 bits which is shared with other FRR processes
* on this host, so to avoid greedily requesting a mostly wasted chunk,
* we limit the chunk size to 1/16 of the label space (that's the -4 bits
* in the definition below). This limit slightly increases our cost of
* finding free labels in our allocated chunks.
*/
#define LP_CHUNK_SIZE_MIN 128
#define LP_CHUNK_SIZE_MAX (1 << (20 - 4))
DEFINE_MTYPE_STATIC(BGPD, BGP_LABEL_CHUNK, "BGP Label Chunk");
DEFINE_MTYPE_STATIC(BGPD, BGP_LABEL_FIFO, "BGP Label FIFO item");
DEFINE_MTYPE_STATIC(BGPD, BGP_LABEL_CB, "BGP Dynamic Label Assignment");
DEFINE_MTYPE_STATIC(BGPD, BGP_LABEL_CBQ, "BGP Dynamic Label Callback");
struct lp_chunk {
uint32_t first;
uint32_t last;
uint32_t nfree; /* un-allocated count */
uint32_t idx_last_allocated; /* start looking here */
bitfield_t allocated_map;
};
/*
* label control block
*/
struct lp_lcb {
mpls_label_t label; /* MPLS_LABEL_NONE = not allocated */
int type;
void *labelid; /* unique ID */
/*
* callback for label allocation and loss
*
* allocated: false = lost
*/
int (*cbfunc)(mpls_label_t label, void *lblid, bool alloc);
};
struct lp_fifo {
struct lp_fifo_item fifo;
struct lp_lcb lcb;
};
DECLARE_LIST(lp_fifo, struct lp_fifo, fifo);
struct lp_cbq_item {
int (*cbfunc)(mpls_label_t label, void *lblid, bool alloc);
int type;
mpls_label_t label;
void *labelid;
bool allocated; /* false = lost */
};
static wq_item_status lp_cbq_docallback(struct work_queue *wq, void *data)
{
struct lp_cbq_item *lcbq = data;
int rc;
int debug = BGP_DEBUG(labelpool, LABELPOOL);
if (debug)
zlog_debug("%s: calling callback with labelid=%p label=%u allocated=%d",
__func__, lcbq->labelid, lcbq->label, lcbq->allocated);
if (lcbq->label == MPLS_LABEL_NONE) {
/* shouldn't happen */
flog_err(EC_BGP_LABEL, "%s: error: label==MPLS_LABEL_NONE",
__func__);
return WQ_SUCCESS;
}
rc = (*(lcbq->cbfunc))(lcbq->label, lcbq->labelid, lcbq->allocated);
if (lcbq->allocated && rc) {
/*
* Callback rejected allocation. This situation could arise
* if there was a label request followed by the requestor
* deciding it didn't need the assignment (e.g., config
* change) while the reply to the original request (with
* label) was in the work queue.
*/
if (debug)
zlog_debug("%s: callback rejected allocation, releasing labelid=%p label=%u",
__func__, lcbq->labelid, lcbq->label);
uintptr_t lbl = lcbq->label;
void *labelid;
struct lp_lcb *lcb;
/*
* If the rejected label was marked inuse by this labelid,
* release the label back to the pool.
*
* Further, if the rejected label was still assigned to
* this labelid in the LCB, delete the LCB.
*/
if (!skiplist_search(lp->inuse, (void *)lbl, &labelid)) {
if (labelid == lcbq->labelid) {
if (!skiplist_search(lp->ledger, labelid,
(void **)&lcb)) {
if (lcbq->label == lcb->label)
skiplist_delete(lp->ledger,
labelid, NULL);
}
skiplist_delete(lp->inuse, (void *)lbl, NULL);
}
}
}
return WQ_SUCCESS;
}
static void lp_cbq_item_free(struct work_queue *wq, void *data)
{
XFREE(MTYPE_BGP_LABEL_CBQ, data);
}
static void lp_lcb_free(void *goner)
{
XFREE(MTYPE_BGP_LABEL_CB, goner);
}
static void lp_chunk_free(void *goner)
{
struct lp_chunk *chunk = (struct lp_chunk *)goner;
bf_free(chunk->allocated_map);
XFREE(MTYPE_BGP_LABEL_CHUNK, goner);
}
void bgp_lp_init(struct event_loop *master, struct labelpool *pool)
{
if (BGP_DEBUG(labelpool, LABELPOOL))
zlog_debug("%s: entry", __func__);
lp = pool; /* Set module pointer to pool data */
lp->ledger = skiplist_new(0, NULL, lp_lcb_free);
lp->inuse = skiplist_new(0, NULL, NULL);
lp->chunks = list_new();
lp->chunks->del = lp_chunk_free;
lp_fifo_init(&lp->requests);
lp->callback_q = work_queue_new(master, "label callbacks");
lp->callback_q->spec.workfunc = lp_cbq_docallback;
lp->callback_q->spec.del_item_data = lp_cbq_item_free;
lp->callback_q->spec.max_retries = 0;
lp->next_chunksize = LP_CHUNK_SIZE_MIN;
#if BGP_LABELPOOL_ENABLE_TESTS
lptest_init();
#endif
}
/* check if a label callback was for a BGP LU node, and if so, unlock it */
static void check_bgp_lu_cb_unlock(struct lp_lcb *lcb)
{
if (lcb->type == LP_TYPE_BGP_LU)
bgp_dest_unlock_node(lcb->labelid);
}
/* check if a label callback was for a BGP LU node, and if so, lock it */
static void check_bgp_lu_cb_lock(struct lp_lcb *lcb)
{
if (lcb->type == LP_TYPE_BGP_LU)
bgp_dest_lock_node(lcb->labelid);
}
void bgp_lp_finish(void)
{
struct lp_fifo *lf;
struct work_queue_item *item, *titem;
struct listnode *node;
struct lp_chunk *chunk;
#if BGP_LABELPOOL_ENABLE_TESTS
lptest_finish();
#endif
if (!lp)
return;
skiplist_free(lp->ledger);
lp->ledger = NULL;
skiplist_free(lp->inuse);
lp->inuse = NULL;
for (ALL_LIST_ELEMENTS_RO(lp->chunks, node, chunk))
bgp_zebra_release_label_range(chunk->first, chunk->last);
list_delete(&lp->chunks);
while ((lf = lp_fifo_pop(&lp->requests))) {
check_bgp_lu_cb_unlock(&lf->lcb);
XFREE(MTYPE_BGP_LABEL_FIFO, lf);
}
lp_fifo_fini(&lp->requests);
/* we must unlock path infos for LU callbacks; but we cannot do that
* in the deletion callback of the workqueue, as that is also called
* to remove an element from the queue after it has been run, resulting
* in a double unlock. Hence we need to iterate over our queues and
* lists and manually perform the unlocking (ugh)
*/
STAILQ_FOREACH_SAFE (item, &lp->callback_q->items, wq, titem)
check_bgp_lu_cb_unlock(item->data);
work_queue_free_and_null(&lp->callback_q);
lp = NULL;
}
static mpls_label_t get_label_from_pool(void *labelid)
{
struct listnode *node;
struct lp_chunk *chunk;
int debug = BGP_DEBUG(labelpool, LABELPOOL);
/*
* Find a free label
*/
for (ALL_LIST_ELEMENTS_RO(lp->chunks, node, chunk)) {
uintptr_t lbl;
unsigned int index;
if (debug)
zlog_debug("%s: chunk first=%u last=%u",
__func__, chunk->first, chunk->last);
/*
* don't look in chunks with no available labels
*/
if (!chunk->nfree)
continue;
/*
* roll through bitfield starting where we stopped
* last time
*/
index = bf_find_next_clear_bit_wrap(
&chunk->allocated_map, chunk->idx_last_allocated + 1,
0);
/*
* since chunk->nfree is non-zero, we should always get
* a valid index
*/
assert(index != WORD_MAX);
lbl = chunk->first + index;
if (skiplist_insert(lp->inuse, (void *)lbl, labelid)) {
/* something is very wrong */
zlog_err("%s: unable to insert inuse label %u (id %p)",
__func__, (uint32_t)lbl, labelid);
return MPLS_LABEL_NONE;
}
/*
* Success
*/
bf_set_bit(chunk->allocated_map, index);
chunk->idx_last_allocated = index;
chunk->nfree -= 1;
return lbl;
}
return MPLS_LABEL_NONE;
}
/*
* Success indicated by value of "label" field in returned LCB
*/
static struct lp_lcb *lcb_alloc(
int type,
void *labelid,
int (*cbfunc)(mpls_label_t label, void *labelid, bool allocated))
{
/*
* Set up label control block
*/
struct lp_lcb *new = XCALLOC(MTYPE_BGP_LABEL_CB,
sizeof(struct lp_lcb));
new->label = get_label_from_pool(labelid);
new->type = type;
new->labelid = labelid;
new->cbfunc = cbfunc;
return new;
}
/*
* Callers who need labels must supply a type, labelid, and callback.
* The type is a value defined in bgp_labelpool.h (add types as needed).
* The callback is for asynchronous notification of label allocation.
* The labelid is passed as an argument to the callback. It should be unique
* to the requested label instance.
*
* If zebra is not connected, callbacks with labels will be delayed
* until connection is established. If zebra connection is lost after
* labels have been assigned, existing assignments via this labelpool
* module will continue until reconnection.
*
* When connection to zebra is reestablished, previous label assignments
* will be invalidated (via callbacks having the "allocated" parameter unset)
* and new labels will be automatically reassigned by this labelpool module
* (that is, a requestor does not need to call bgp_lp_get() again if it is
* notified via callback that its label has been lost: it will eventually
* get another callback with a new label assignment).
*
* The callback function should return 0 to accept the allocation
* and non-zero to refuse it. The callback function return value is
* ignored for invalidations (i.e., when the "allocated" parameter is false)
*
* Prior requests for a given labelid are detected so that requests and
* assignments are not duplicated.
*/
void bgp_lp_get(
int type,
void *labelid,
int (*cbfunc)(mpls_label_t label, void *labelid, bool allocated))
{
struct lp_lcb *lcb;
int requested = 0;
int debug = BGP_DEBUG(labelpool, LABELPOOL);
if (debug)
zlog_debug("%s: labelid=%p", __func__, labelid);
/*
* Have we seen this request before?
*/
if (!skiplist_search(lp->ledger, labelid, (void **)&lcb)) {
requested = 1;
} else {
lcb = lcb_alloc(type, labelid, cbfunc);
if (debug)
zlog_debug("%s: inserting lcb=%p label=%u",
__func__, lcb, lcb->label);
int rc = skiplist_insert(lp->ledger, labelid, lcb);
if (rc) {
/* shouldn't happen */
flog_err(EC_BGP_LABEL,
"%s: can't insert new LCB into ledger list",
__func__);
XFREE(MTYPE_BGP_LABEL_CB, lcb);
return;
}
}
if (lcb->label != MPLS_LABEL_NONE) {
/*
* Fast path: we filled the request from local pool (or
* this is a duplicate request that we filled already).
* Enqueue response work item with new label.
*/
struct lp_cbq_item *q;
q = XCALLOC(MTYPE_BGP_LABEL_CBQ, sizeof(struct lp_cbq_item));
q->cbfunc = lcb->cbfunc;
q->type = lcb->type;
q->label = lcb->label;
q->labelid = lcb->labelid;
q->allocated = true;
/* if this is a LU request, lock node before queueing */
check_bgp_lu_cb_lock(lcb);
work_queue_add(lp->callback_q, q);
return;
}
if (requested)
return;
if (debug)
zlog_debug("%s: slow path. lcb=%p label=%u",
__func__, lcb, lcb->label);
/*
* Slow path: we are out of labels in the local pool,
* so remember the request and also get another chunk from
* the label manager.
*
* We track number of outstanding label requests: don't
* need to get a chunk for each one.
*/
struct lp_fifo *lf = XCALLOC(MTYPE_BGP_LABEL_FIFO,
sizeof(struct lp_fifo));
lf->lcb = *lcb;
/* if this is a LU request, lock node before queueing */
check_bgp_lu_cb_lock(lcb);
lp_fifo_add_tail(&lp->requests, lf);
if (lp_fifo_count(&lp->requests) > lp->pending_count) {
if (!bgp_zebra_request_label_range(MPLS_LABEL_BASE_ANY,
lp->next_chunksize, true))
return;
lp->pending_count += lp->next_chunksize;
if ((lp->next_chunksize << 1) <= LP_CHUNK_SIZE_MAX)
lp->next_chunksize <<= 1;
}
}
void bgp_lp_release(
int type,
void *labelid,
mpls_label_t label)
{
struct lp_lcb *lcb;
if (!skiplist_search(lp->ledger, labelid, (void **)&lcb)) {
if (label == lcb->label && type == lcb->type) {
struct listnode *node;
struct lp_chunk *chunk;
uintptr_t lbl = label;
bool deallocated = false;
/* no longer in use */
skiplist_delete(lp->inuse, (void *)lbl, NULL);
/* no longer requested */
skiplist_delete(lp->ledger, labelid, NULL);
/*
* Find the chunk this label belongs to and
* deallocate the label
*/
for (ALL_LIST_ELEMENTS_RO(lp->chunks, node, chunk)) {
uint32_t index;
if ((label < chunk->first) ||
(label > chunk->last))
continue;
index = label - chunk->first;
assert(bf_test_index(chunk->allocated_map,
index));
bf_release_index(chunk->allocated_map, index);
chunk->nfree += 1;
deallocated = true;
break;
}
assert(deallocated);
if (deallocated &&
chunk->nfree == chunk->last - chunk->first + 1 &&
lp_fifo_count(&lp->requests) == 0) {
bgp_zebra_release_label_range(chunk->first,
chunk->last);
list_delete_node(lp->chunks, node);
lp_chunk_free(chunk);
lp->next_chunksize = LP_CHUNK_SIZE_MIN;
}
}
}
}
static void bgp_sync_label_manager(struct event *e)
{
int debug = BGP_DEBUG(labelpool, LABELPOOL);
struct lp_fifo *lf;
while ((lf = lp_fifo_pop(&lp->requests))) {
struct lp_lcb *lcb;
void *labelid = lf->lcb.labelid;
if (skiplist_search(lp->ledger, labelid, (void **)&lcb)) {
/* request no longer in effect */
if (debug) {
zlog_debug("%s: labelid %p: request no longer in effect",
__func__, labelid);
}
/* if this was a BGP_LU request, unlock node
*/
check_bgp_lu_cb_unlock(lcb);
goto finishedrequest;
}
/* have LCB */
if (lcb->label != MPLS_LABEL_NONE) {
/* request already has a label */
if (debug) {
zlog_debug("%s: labelid %p: request already has a label: %u=0x%x, lcb=%p",
__func__, labelid, lcb->label,
lcb->label, lcb);
}
/* if this was a BGP_LU request, unlock node
*/
check_bgp_lu_cb_unlock(lcb);
goto finishedrequest;
}
lcb->label = get_label_from_pool(lcb->labelid);
if (lcb->label == MPLS_LABEL_NONE) {
/*
* Out of labels in local pool, await next chunk
*/
if (debug) {
zlog_debug("%s: out of labels, await more",
__func__);
}
break;
}
/*
* we filled the request from local pool.
* Enqueue response work item with new label.
*/
struct lp_cbq_item *q = XCALLOC(MTYPE_BGP_LABEL_CBQ,
sizeof(struct lp_cbq_item));
q->cbfunc = lcb->cbfunc;
q->type = lcb->type;
q->label = lcb->label;
q->labelid = lcb->labelid;
q->allocated = true;
if (debug)
zlog_debug("%s: assigning label %u to labelid %p",
__func__, q->label, q->labelid);
work_queue_add(lp->callback_q, q);
finishedrequest:
XFREE(MTYPE_BGP_LABEL_FIFO, lf);
}
event_add_timer(bm->master, bgp_sync_label_manager, NULL, 1,
&bm->t_bgp_sync_label_manager);
}
void bgp_lp_event_chunk(uint32_t first, uint32_t last)
{
struct lp_chunk *chunk;
uint32_t labelcount;
if (last < first) {
flog_err(EC_BGP_LABEL,
"%s: zebra label chunk invalid: first=%u, last=%u",
__func__, first, last);
return;
}
chunk = XCALLOC(MTYPE_BGP_LABEL_CHUNK, sizeof(struct lp_chunk));
labelcount = last - first + 1;
chunk->first = first;
chunk->last = last;
chunk->nfree = labelcount;
bf_init(chunk->allocated_map, labelcount);
/*
* Optimize for allocation by adding the new (presumably larger)
* chunk at the head of the list so it is examined first.
*/
listnode_add_head(lp->chunks, chunk);
lp->pending_count -= labelcount;
}
/*
* continue using allocated labels until zebra returns
*/
void bgp_lp_event_zebra_down(void)
{
/* rats. */
}
/*
* Inform owners of previously-allocated labels that their labels
* are not valid. Request chunk from zebra large enough to satisfy
* previously-allocated labels plus any outstanding requests.
*/
void bgp_lp_event_zebra_up(void)
{
unsigned int labels_needed;
unsigned int chunks_needed;
void *labelid;
struct lp_lcb *lcb;
lp->reconnect_count++;
/*
* Get label chunk allocation request dispatched to zebra
*/
labels_needed = lp_fifo_count(&lp->requests) +
skiplist_count(lp->inuse);
if (labels_needed > lp->next_chunksize) {
while ((lp->next_chunksize < labels_needed) &&
(lp->next_chunksize << 1 <= LP_CHUNK_SIZE_MAX))
lp->next_chunksize <<= 1;
}
/* round up */
chunks_needed = (labels_needed + lp->next_chunksize - 1) / lp->next_chunksize;
labels_needed = chunks_needed * lp->next_chunksize;
/*
* Invalidate current list of chunks
*/
list_delete_all_node(lp->chunks);
if (labels_needed && !bgp_zebra_request_label_range(MPLS_LABEL_BASE_ANY,
labels_needed, true))
return;
lp->pending_count += labels_needed;
/*
* Invalidate any existing labels and requeue them as requests
*/
while (!skiplist_first(lp->inuse, NULL, &labelid)) {
/*
* Get LCB
*/
if (!skiplist_search(lp->ledger, labelid, (void **)&lcb)) {
if (lcb->label != MPLS_LABEL_NONE) {
/*
* invalidate
*/
struct lp_cbq_item *q;
q = XCALLOC(MTYPE_BGP_LABEL_CBQ,
sizeof(struct lp_cbq_item));
q->cbfunc = lcb->cbfunc;
q->type = lcb->type;
q->label = lcb->label;
q->labelid = lcb->labelid;
q->allocated = false;
check_bgp_lu_cb_lock(lcb);
work_queue_add(lp->callback_q, q);
lcb->label = MPLS_LABEL_NONE;
}
/*
* request queue
*/
struct lp_fifo *lf = XCALLOC(MTYPE_BGP_LABEL_FIFO,
sizeof(struct lp_fifo));
lf->lcb = *lcb;
check_bgp_lu_cb_lock(lcb);
lp_fifo_add_tail(&lp->requests, lf);
}
skiplist_delete_first(lp->inuse);
}
event_add_timer(bm->master, bgp_sync_label_manager, NULL, 1,
&bm->t_bgp_sync_label_manager);
}
DEFUN(show_bgp_labelpool_summary, show_bgp_labelpool_summary_cmd,
"show bgp labelpool summary [json]",
SHOW_STR BGP_STR
"BGP Labelpool information\n"
"BGP Labelpool summary\n" JSON_STR)
{
bool uj = use_json(argc, argv);
json_object *json = NULL;
if (!lp) {
if (uj)
vty_out(vty, "{}\n");
else
vty_out(vty, "No existing BGP labelpool\n");
return (CMD_WARNING);
}
if (uj) {
json = json_object_new_object();
json_object_int_add(json, "ledger", skiplist_count(lp->ledger));
json_object_int_add(json, "inUse", skiplist_count(lp->inuse));
json_object_int_add(json, "requests",
lp_fifo_count(&lp->requests));
json_object_int_add(json, "labelChunks", listcount(lp->chunks));
json_object_int_add(json, "pending", lp->pending_count);
json_object_int_add(json, "reconnects", lp->reconnect_count);
vty_json(vty, json);
} else {
vty_out(vty, "Labelpool Summary\n");
vty_out(vty, "-----------------\n");
vty_out(vty, "%-13s %d\n",
"Ledger:", skiplist_count(lp->ledger));
vty_out(vty, "%-13s %d\n", "InUse:", skiplist_count(lp->inuse));
vty_out(vty, "%-13s %zu\n",
"Requests:", lp_fifo_count(&lp->requests));
vty_out(vty, "%-13s %d\n",
"LabelChunks:", listcount(lp->chunks));
vty_out(vty, "%-13s %d\n", "Pending:", lp->pending_count);
vty_out(vty, "%-13s %d\n", "Reconnects:", lp->reconnect_count);
}
return CMD_SUCCESS;
}
DEFUN(show_bgp_labelpool_ledger, show_bgp_labelpool_ledger_cmd,
"show bgp labelpool ledger [json]",
SHOW_STR BGP_STR
"BGP Labelpool information\n"
"BGP Labelpool ledger\n" JSON_STR)
{
bool uj = use_json(argc, argv);
json_object *json = NULL, *json_elem = NULL;
struct lp_lcb *lcb = NULL;
struct bgp_dest *dest;
void *cursor = NULL;
const struct prefix *p;
int rc, count;
if (!lp) {
if (uj)
vty_out(vty, "{}\n");
else
vty_out(vty, "No existing BGP labelpool\n");
return (CMD_WARNING);
}
if (uj) {
count = skiplist_count(lp->ledger);
if (!count) {
vty_out(vty, "{}\n");
return CMD_SUCCESS;
}
json = json_object_new_array();
} else {
vty_out(vty, "Prefix Label\n");
vty_out(vty, "---------------------------\n");
}
for (rc = skiplist_next(lp->ledger, (void **)&dest, (void **)&lcb,
&cursor);
!rc; rc = skiplist_next(lp->ledger, (void **)&dest, (void **)&lcb,
&cursor)) {
if (uj) {
json_elem = json_object_new_object();
json_object_array_add(json, json_elem);
}
switch (lcb->type) {
case LP_TYPE_BGP_LU:
if (!CHECK_FLAG(dest->flags, BGP_NODE_LABEL_REQUESTED))
if (uj) {
json_object_string_add(
json_elem, "prefix", "INVALID");
json_object_int_add(json_elem, "label",
lcb->label);
} else
vty_out(vty, "%-18s %u\n",
"INVALID", lcb->label);
else {
p = bgp_dest_get_prefix(dest);
if (uj) {
json_object_string_addf(
json_elem, "prefix", "%pFX", p);
json_object_int_add(json_elem, "label",
lcb->label);
} else
vty_out(vty, "%-18pFX %u\n", p,
lcb->label);
}
break;
case LP_TYPE_VRF:
if (uj) {
json_object_string_add(json_elem, "prefix",
"VRF");
json_object_int_add(json_elem, "label",
lcb->label);
} else
vty_out(vty, "%-18s %u\n", "VRF",
lcb->label);
break;
case LP_TYPE_NEXTHOP:
if (uj) {
json_object_string_add(json_elem, "prefix",
"nexthop");
json_object_int_add(json_elem, "label",
lcb->label);
} else
vty_out(vty, "%-18s %u\n", "nexthop",
lcb->label);
break;
case LP_TYPE_BGP_L3VPN_BIND:
if (uj) {
json_object_string_add(json_elem, "prefix",
"l3vpn-bind");
json_object_int_add(json_elem, "label",
lcb->label);
} else
vty_out(vty, "%-18s %u\n", "l3vpn-bind",
lcb->label);
break;
}
}
if (uj)
vty_json(vty, json);
return CMD_SUCCESS;
}
DEFUN(show_bgp_labelpool_inuse, show_bgp_labelpool_inuse_cmd,
"show bgp labelpool inuse [json]",
SHOW_STR BGP_STR
"BGP Labelpool information\n"
"BGP Labelpool inuse\n" JSON_STR)
{
bool uj = use_json(argc, argv);
json_object *json = NULL, *json_elem = NULL;
struct bgp_dest *dest;
mpls_label_t label;
struct lp_lcb *lcb;
void *cursor = NULL;
const struct prefix *p;
int rc, count;
if (!lp) {
vty_out(vty, "No existing BGP labelpool\n");
return (CMD_WARNING);
}
if (!lp) {
if (uj)
vty_out(vty, "{}\n");
else
vty_out(vty, "No existing BGP labelpool\n");
return (CMD_WARNING);
}
if (uj) {
count = skiplist_count(lp->inuse);
if (!count) {
vty_out(vty, "{}\n");
return CMD_SUCCESS;
}
json = json_object_new_array();
} else {
vty_out(vty, "Prefix Label\n");
vty_out(vty, "---------------------------\n");
}
for (rc = skiplist_next(lp->inuse, (void **)&label, (void **)&dest,
&cursor);
!rc; rc = skiplist_next(lp->ledger, (void **)&label,
(void **)&dest, &cursor)) {
if (skiplist_search(lp->ledger, dest, (void **)&lcb))
continue;
if (uj) {
json_elem = json_object_new_object();
json_object_array_add(json, json_elem);
}
switch (lcb->type) {
case LP_TYPE_BGP_LU:
if (!CHECK_FLAG(dest->flags, BGP_NODE_LABEL_REQUESTED))
if (uj) {
json_object_string_add(
json_elem, "prefix", "INVALID");
json_object_int_add(json_elem, "label",
label);
} else
vty_out(vty, "INVALID %u\n",
label);
else {
p = bgp_dest_get_prefix(dest);
if (uj) {
json_object_string_addf(
json_elem, "prefix", "%pFX", p);
json_object_int_add(json_elem, "label",
label);
} else
vty_out(vty, "%-18pFX %u\n", p,
label);
}
break;
case LP_TYPE_VRF:
if (uj) {
json_object_string_add(json_elem, "prefix",
"VRF");
json_object_int_add(json_elem, "label", label);
} else
vty_out(vty, "%-18s %u\n", "VRF",
label);
break;
case LP_TYPE_NEXTHOP:
if (uj) {
json_object_string_add(json_elem, "prefix",
"nexthop");
json_object_int_add(json_elem, "label", label);
} else
vty_out(vty, "%-18s %u\n", "nexthop",
label);
break;
case LP_TYPE_BGP_L3VPN_BIND:
if (uj) {
json_object_string_add(json_elem, "prefix",
"l3vpn-bind");
json_object_int_add(json_elem, "label", label);
} else
vty_out(vty, "%-18s %u\n", "l3vpn-bind",
label);
break;
}
}
if (uj)
vty_json(vty, json);
return CMD_SUCCESS;
}
DEFUN(show_bgp_labelpool_requests, show_bgp_labelpool_requests_cmd,
"show bgp labelpool requests [json]",
SHOW_STR BGP_STR
"BGP Labelpool information\n"
"BGP Labelpool requests\n" JSON_STR)
{
bool uj = use_json(argc, argv);
json_object *json = NULL, *json_elem = NULL;
struct bgp_dest *dest;
const struct prefix *p;
struct lp_fifo *item, *next;
int count;
if (!lp) {
if (uj)
vty_out(vty, "{}\n");
else
vty_out(vty, "No existing BGP labelpool\n");
return (CMD_WARNING);
}
if (uj) {
count = lp_fifo_count(&lp->requests);
if (!count) {
vty_out(vty, "{}\n");
return CMD_SUCCESS;
}
json = json_object_new_array();
} else {
vty_out(vty, "Prefix \n");
vty_out(vty, "----------------\n");
}