forked from FRRouting/frr
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbgp_updgrp.c
1902 lines (1601 loc) · 49.8 KB
/
bgp_updgrp.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
/**
* bgp_updgrp.c: BGP update group structures
*
* @copyright Copyright (C) 2014 Cumulus Networks, Inc.
*
* @author Avneesh Sachdev <avneesh@sproute.net>
* @author Rajesh Varadarajan <rajesh@sproute.net>
* @author Pradosh Mohapatra <pradosh@sproute.net>
*
* This file is part of GNU Zebra.
*
* GNU Zebra is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2, or (at your option) any
* later version.
*
* GNU Zebra is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; see the file COPYING; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <zebra.h>
#include "prefix.h"
#include "thread.h"
#include "buffer.h"
#include "stream.h"
#include "command.h"
#include "sockunion.h"
#include "network.h"
#include "memory.h"
#include "filter.h"
#include "routemap.h"
#include "log.h"
#include "plist.h"
#include "linklist.h"
#include "workqueue.h"
#include "hash.h"
#include "jhash.h"
#include "queue.h"
#include "bgpd/bgpd.h"
#include "bgpd/bgp_table.h"
#include "bgpd/bgp_debug.h"
#include "bgpd/bgp_errors.h"
#include "bgpd/bgp_fsm.h"
#include "bgpd/bgp_advertise.h"
#include "bgpd/bgp_packet.h"
#include "bgpd/bgp_updgrp.h"
#include "bgpd/bgp_route.h"
#include "bgpd/bgp_filter.h"
#include "bgpd/bgp_io.h"
/********************
* PRIVATE FUNCTIONS
********************/
/**
* assign a unique ID to update group and subgroup. Mostly for display/
* debugging purposes. It's a 64-bit space - used leisurely without a
* worry about its wrapping and about filling gaps. While at it, timestamp
* the creation.
*/
static void update_group_checkin(struct update_group *updgrp)
{
updgrp->id = ++bm->updgrp_idspace;
updgrp->uptime = bgp_clock();
}
static void update_subgroup_checkin(struct update_subgroup *subgrp,
struct update_group *updgrp)
{
subgrp->id = ++bm->subgrp_idspace;
subgrp->uptime = bgp_clock();
}
static void sync_init(struct update_subgroup *subgrp)
{
subgrp->sync =
XCALLOC(MTYPE_BGP_SYNCHRONISE, sizeof(struct bgp_synchronize));
bgp_adv_fifo_init(&subgrp->sync->update);
bgp_adv_fifo_init(&subgrp->sync->withdraw);
bgp_adv_fifo_init(&subgrp->sync->withdraw_low);
subgrp->hash =
hash_create(baa_hash_key, baa_hash_cmp, "BGP SubGroup Hash");
/* We use a larger buffer for subgrp->work in the event that:
* - We RX a BGP_UPDATE where the attributes alone are just
* under BGP_MAX_PACKET_SIZE
* - The user configures an outbound route-map that does many as-path
* prepends or adds many communities. At most they can have
* CMD_ARGC_MAX
* args in a route-map so there is a finite limit on how large they
* can
* make the attributes.
*
* Having a buffer with BGP_MAX_PACKET_SIZE_OVERFLOW allows us to avoid
* bounds
* checking for every single attribute as we construct an UPDATE.
*/
subgrp->work =
stream_new(BGP_MAX_PACKET_SIZE + BGP_MAX_PACKET_SIZE_OVERFLOW);
subgrp->scratch = stream_new(BGP_MAX_PACKET_SIZE);
}
static void sync_delete(struct update_subgroup *subgrp)
{
XFREE(MTYPE_BGP_SYNCHRONISE, subgrp->sync);
if (subgrp->hash)
hash_free(subgrp->hash);
subgrp->hash = NULL;
if (subgrp->work)
stream_free(subgrp->work);
subgrp->work = NULL;
if (subgrp->scratch)
stream_free(subgrp->scratch);
subgrp->scratch = NULL;
}
/**
* conf_copy
*
* copy only those fields that are relevant to update group match
*/
static void conf_copy(struct peer *dst, struct peer *src, afi_t afi,
safi_t safi)
{
struct bgp_filter *srcfilter;
struct bgp_filter *dstfilter;
srcfilter = &src->filter[afi][safi];
dstfilter = &dst->filter[afi][safi];
dst->bgp = src->bgp;
dst->sort = src->sort;
dst->as = src->as;
dst->v_routeadv = src->v_routeadv;
dst->flags = src->flags;
dst->af_flags[afi][safi] = src->af_flags[afi][safi];
dst->pmax_out[afi][safi] = src->pmax_out[afi][safi];
XFREE(MTYPE_BGP_PEER_HOST, dst->host);
dst->host = XSTRDUP(MTYPE_BGP_PEER_HOST, src->host);
dst->cap = src->cap;
dst->af_cap[afi][safi] = src->af_cap[afi][safi];
dst->afc_nego[afi][safi] = src->afc_nego[afi][safi];
dst->orf_plist[afi][safi] = src->orf_plist[afi][safi];
dst->addpath_type[afi][safi] = src->addpath_type[afi][safi];
dst->local_as = src->local_as;
dst->change_local_as = src->change_local_as;
dst->shared_network = src->shared_network;
memcpy(&(dst->nexthop), &(src->nexthop), sizeof(struct bgp_nexthop));
dst->group = src->group;
if (src->default_rmap[afi][safi].name) {
dst->default_rmap[afi][safi].name =
XSTRDUP(MTYPE_ROUTE_MAP_NAME,
src->default_rmap[afi][safi].name);
dst->default_rmap[afi][safi].map =
src->default_rmap[afi][safi].map;
}
if (DISTRIBUTE_OUT_NAME(srcfilter)) {
DISTRIBUTE_OUT_NAME(dstfilter) = XSTRDUP(
MTYPE_BGP_FILTER_NAME, DISTRIBUTE_OUT_NAME(srcfilter));
DISTRIBUTE_OUT(dstfilter) = DISTRIBUTE_OUT(srcfilter);
}
if (PREFIX_LIST_OUT_NAME(srcfilter)) {
PREFIX_LIST_OUT_NAME(dstfilter) = XSTRDUP(
MTYPE_BGP_FILTER_NAME, PREFIX_LIST_OUT_NAME(srcfilter));
PREFIX_LIST_OUT(dstfilter) = PREFIX_LIST_OUT(srcfilter);
}
if (FILTER_LIST_OUT_NAME(srcfilter)) {
FILTER_LIST_OUT_NAME(dstfilter) = XSTRDUP(
MTYPE_BGP_FILTER_NAME, FILTER_LIST_OUT_NAME(srcfilter));
FILTER_LIST_OUT(dstfilter) = FILTER_LIST_OUT(srcfilter);
}
if (ROUTE_MAP_OUT_NAME(srcfilter)) {
ROUTE_MAP_OUT_NAME(dstfilter) = XSTRDUP(
MTYPE_BGP_FILTER_NAME, ROUTE_MAP_OUT_NAME(srcfilter));
ROUTE_MAP_OUT(dstfilter) = ROUTE_MAP_OUT(srcfilter);
}
if (UNSUPPRESS_MAP_NAME(srcfilter)) {
UNSUPPRESS_MAP_NAME(dstfilter) = XSTRDUP(
MTYPE_BGP_FILTER_NAME, UNSUPPRESS_MAP_NAME(srcfilter));
UNSUPPRESS_MAP(dstfilter) = UNSUPPRESS_MAP(srcfilter);
}
}
/**
* since we did a bunch of XSTRDUP's in conf_copy, time to free them up
*/
static void conf_release(struct peer *src, afi_t afi, safi_t safi)
{
struct bgp_filter *srcfilter;
srcfilter = &src->filter[afi][safi];
XFREE(MTYPE_ROUTE_MAP_NAME, src->default_rmap[afi][safi].name);
XFREE(MTYPE_BGP_FILTER_NAME, srcfilter->dlist[FILTER_OUT].name);
XFREE(MTYPE_BGP_FILTER_NAME, srcfilter->plist[FILTER_OUT].name);
XFREE(MTYPE_BGP_FILTER_NAME, srcfilter->aslist[FILTER_OUT].name);
XFREE(MTYPE_BGP_FILTER_NAME, srcfilter->map[RMAP_OUT].name);
XFREE(MTYPE_BGP_FILTER_NAME, srcfilter->usmap.name);
XFREE(MTYPE_BGP_PEER_HOST, src->host);
}
static void peer2_updgrp_copy(struct update_group *updgrp, struct peer_af *paf)
{
struct peer *src;
struct peer *dst;
if (!updgrp || !paf)
return;
src = paf->peer;
dst = updgrp->conf;
if (!src || !dst)
return;
updgrp->afi = paf->afi;
updgrp->safi = paf->safi;
updgrp->afid = paf->afid;
updgrp->bgp = src->bgp;
conf_copy(dst, src, paf->afi, paf->safi);
}
/**
* auxiliary functions to maintain the hash table.
* - updgrp_hash_alloc - to create a new entry, passed to hash_get
* - updgrp_hash_key_make - makes the key for update group search
* - updgrp_hash_cmp - compare two update groups.
*/
static void *updgrp_hash_alloc(void *p)
{
struct update_group *updgrp;
const struct update_group *in;
in = (const struct update_group *)p;
updgrp = XCALLOC(MTYPE_BGP_UPDGRP, sizeof(struct update_group));
memcpy(updgrp, in, sizeof(struct update_group));
updgrp->conf = XCALLOC(MTYPE_BGP_PEER, sizeof(struct peer));
conf_copy(updgrp->conf, in->conf, in->afi, in->safi);
return updgrp;
}
/**
* The hash value for a peer is computed from the following variables:
* v = f(
* 1. IBGP (1) or EBGP (2)
* 2. FLAGS based on configuration:
* LOCAL_AS_NO_PREPEND
* LOCAL_AS_REPLACE_AS
* 3. AF_FLAGS based on configuration:
* Refer to definition in bgp_updgrp.h
* 4. (AF-independent) Capability flags:
* AS4_RCV capability
* 5. (AF-dependent) Capability flags:
* ORF_PREFIX_SM_RCV (peer can send prefix ORF)
* 6. MRAI
* 7. peer-group name
* 8. Outbound route-map name (neighbor route-map <> out)
* 9. Outbound distribute-list name (neighbor distribute-list <> out)
* 10. Outbound prefix-list name (neighbor prefix-list <> out)
* 11. Outbound as-list name (neighbor filter-list <> out)
* 12. Unsuppress map name (neighbor unsuppress-map <>)
* 13. default rmap name (neighbor default-originate route-map <>)
* 14. encoding both global and link-local nexthop?
* 15. If peer is configured to be a lonesoul, peer ip address
* 16. Local-as should match, if configured.
* )
*/
static unsigned int updgrp_hash_key_make(const void *p)
{
const struct update_group *updgrp;
const struct peer *peer;
const struct bgp_filter *filter;
uint32_t flags;
uint32_t key;
afi_t afi;
safi_t safi;
#define SEED1 999331
#define SEED2 2147483647
updgrp = p;
peer = updgrp->conf;
afi = updgrp->afi;
safi = updgrp->safi;
flags = peer->af_flags[afi][safi];
filter = &peer->filter[afi][safi];
key = 0;
key = jhash_1word(peer->sort, key); /* EBGP or IBGP */
key = jhash_1word((peer->flags & PEER_UPDGRP_FLAGS), key);
key = jhash_1word((flags & PEER_UPDGRP_AF_FLAGS), key);
key = jhash_1word((uint32_t)peer->addpath_type[afi][safi], key);
key = jhash_1word((peer->cap & PEER_UPDGRP_CAP_FLAGS), key);
key = jhash_1word((peer->af_cap[afi][safi] & PEER_UPDGRP_AF_CAP_FLAGS),
key);
key = jhash_1word(peer->v_routeadv, key);
key = jhash_1word(peer->change_local_as, key);
if (peer->group)
key = jhash_1word(jhash(peer->group->name,
strlen(peer->group->name), SEED1),
key);
if (filter->map[RMAP_OUT].name)
key = jhash_1word(jhash(filter->map[RMAP_OUT].name,
strlen(filter->map[RMAP_OUT].name),
SEED1),
key);
if (filter->dlist[FILTER_OUT].name)
key = jhash_1word(jhash(filter->dlist[FILTER_OUT].name,
strlen(filter->dlist[FILTER_OUT].name),
SEED1),
key);
if (filter->plist[FILTER_OUT].name)
key = jhash_1word(jhash(filter->plist[FILTER_OUT].name,
strlen(filter->plist[FILTER_OUT].name),
SEED1),
key);
if (filter->aslist[FILTER_OUT].name)
key = jhash_1word(jhash(filter->aslist[FILTER_OUT].name,
strlen(filter->aslist[FILTER_OUT].name),
SEED1),
key);
if (filter->usmap.name)
key = jhash_1word(jhash(filter->usmap.name,
strlen(filter->usmap.name), SEED1),
key);
if (peer->default_rmap[afi][safi].name)
key = jhash_1word(
jhash(peer->default_rmap[afi][safi].name,
strlen(peer->default_rmap[afi][safi].name),
SEED1),
key);
/* If peer is on a shared network and is exchanging IPv6 prefixes,
* it needs to include link-local address. That's different from
* non-shared-network peers (nexthop encoded with 32 bytes vs 16
* bytes). We create different update groups to take care of that.
*/
key = jhash_1word(
(peer->shared_network && peer_afi_active_nego(peer, AFI_IP6)),
key);
/*
* There are certain peers that must get their own update-group:
* - lonesoul peers
* - peers that negotiated ORF
*/
if (CHECK_FLAG(peer->flags, PEER_FLAG_LONESOUL)
|| CHECK_FLAG(peer->af_cap[afi][safi], PEER_CAP_ORF_PREFIX_SM_RCV)
|| CHECK_FLAG(peer->af_cap[afi][safi],
PEER_CAP_ORF_PREFIX_SM_OLD_RCV))
key = jhash_1word(jhash(peer->host, strlen(peer->host), SEED2),
key);
return key;
}
static bool updgrp_hash_cmp(const void *p1, const void *p2)
{
const struct update_group *grp1;
const struct update_group *grp2;
const struct peer *pe1;
const struct peer *pe2;
uint32_t flags1;
uint32_t flags2;
const struct bgp_filter *fl1;
const struct bgp_filter *fl2;
afi_t afi;
safi_t safi;
if (!p1 || !p2)
return false;
grp1 = p1;
grp2 = p2;
pe1 = grp1->conf;
pe2 = grp2->conf;
afi = grp1->afi;
safi = grp1->safi;
flags1 = pe1->af_flags[afi][safi];
flags2 = pe2->af_flags[afi][safi];
fl1 = &pe1->filter[afi][safi];
fl2 = &pe2->filter[afi][safi];
/* put EBGP and IBGP peers in different update groups */
if (pe1->sort != pe2->sort)
return false;
/* check peer flags */
if ((pe1->flags & PEER_UPDGRP_FLAGS)
!= (pe2->flags & PEER_UPDGRP_FLAGS))
return false;
/* If there is 'local-as' configured, it should match. */
if (pe1->change_local_as != pe2->change_local_as)
return false;
/* flags like route reflector client */
if ((flags1 & PEER_UPDGRP_AF_FLAGS) != (flags2 & PEER_UPDGRP_AF_FLAGS))
return false;
if (pe1->addpath_type[afi][safi] != pe2->addpath_type[afi][safi])
return false;
if ((pe1->cap & PEER_UPDGRP_CAP_FLAGS)
!= (pe2->cap & PEER_UPDGRP_CAP_FLAGS))
return false;
if ((pe1->af_cap[afi][safi] & PEER_UPDGRP_AF_CAP_FLAGS)
!= (pe2->af_cap[afi][safi] & PEER_UPDGRP_AF_CAP_FLAGS))
return false;
if (pe1->v_routeadv != pe2->v_routeadv)
return false;
if (pe1->group != pe2->group)
return false;
/* route-map names should be the same */
if ((fl1->map[RMAP_OUT].name && !fl2->map[RMAP_OUT].name)
|| (!fl1->map[RMAP_OUT].name && fl2->map[RMAP_OUT].name)
|| (fl1->map[RMAP_OUT].name && fl2->map[RMAP_OUT].name
&& strcmp(fl1->map[RMAP_OUT].name, fl2->map[RMAP_OUT].name)))
return false;
if ((fl1->dlist[FILTER_OUT].name && !fl2->dlist[FILTER_OUT].name)
|| (!fl1->dlist[FILTER_OUT].name && fl2->dlist[FILTER_OUT].name)
|| (fl1->dlist[FILTER_OUT].name && fl2->dlist[FILTER_OUT].name
&& strcmp(fl1->dlist[FILTER_OUT].name,
fl2->dlist[FILTER_OUT].name)))
return false;
if ((fl1->plist[FILTER_OUT].name && !fl2->plist[FILTER_OUT].name)
|| (!fl1->plist[FILTER_OUT].name && fl2->plist[FILTER_OUT].name)
|| (fl1->plist[FILTER_OUT].name && fl2->plist[FILTER_OUT].name
&& strcmp(fl1->plist[FILTER_OUT].name,
fl2->plist[FILTER_OUT].name)))
return false;
if ((fl1->aslist[FILTER_OUT].name && !fl2->aslist[FILTER_OUT].name)
|| (!fl1->aslist[FILTER_OUT].name && fl2->aslist[FILTER_OUT].name)
|| (fl1->aslist[FILTER_OUT].name && fl2->aslist[FILTER_OUT].name
&& strcmp(fl1->aslist[FILTER_OUT].name,
fl2->aslist[FILTER_OUT].name)))
return false;
if ((fl1->usmap.name && !fl2->usmap.name)
|| (!fl1->usmap.name && fl2->usmap.name)
|| (fl1->usmap.name && fl2->usmap.name
&& strcmp(fl1->usmap.name, fl2->usmap.name)))
return false;
if ((pe1->default_rmap[afi][safi].name
&& !pe2->default_rmap[afi][safi].name)
|| (!pe1->default_rmap[afi][safi].name
&& pe2->default_rmap[afi][safi].name)
|| (pe1->default_rmap[afi][safi].name
&& pe2->default_rmap[afi][safi].name
&& strcmp(pe1->default_rmap[afi][safi].name,
pe2->default_rmap[afi][safi].name)))
return false;
if ((afi == AFI_IP6) && (pe1->shared_network != pe2->shared_network))
return false;
if ((CHECK_FLAG(pe1->flags, PEER_FLAG_LONESOUL)
|| CHECK_FLAG(pe1->af_cap[afi][safi], PEER_CAP_ORF_PREFIX_SM_RCV)
|| CHECK_FLAG(pe1->af_cap[afi][safi],
PEER_CAP_ORF_PREFIX_SM_OLD_RCV))
&& !sockunion_same(&pe1->su, &pe2->su))
return false;
return true;
}
static void peer_lonesoul_or_not(struct peer *peer, int set)
{
/* no change in status? */
if (set == (CHECK_FLAG(peer->flags, PEER_FLAG_LONESOUL) > 0))
return;
if (set)
SET_FLAG(peer->flags, PEER_FLAG_LONESOUL);
else
UNSET_FLAG(peer->flags, PEER_FLAG_LONESOUL);
update_group_adjust_peer_afs(peer);
}
/*
* subgroup_total_packets_enqueued
*
* Returns the total number of packets enqueued to a subgroup.
*/
static unsigned int
subgroup_total_packets_enqueued(struct update_subgroup *subgrp)
{
struct bpacket *pkt;
pkt = bpacket_queue_last(SUBGRP_PKTQ(subgrp));
return pkt->ver - 1;
}
static int update_group_show_walkcb(struct update_group *updgrp, void *arg)
{
struct updwalk_context *ctx = arg;
struct vty *vty;
struct update_subgroup *subgrp;
struct peer_af *paf;
struct bgp_filter *filter;
int match = 0;
if (!ctx)
return CMD_SUCCESS;
if (ctx->subgrp_id) {
UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) {
if (ctx->subgrp_id && (ctx->subgrp_id != subgrp->id))
continue;
else {
match = 1;
break;
}
}
} else {
match = 1;
}
if (!match) {
/* Since this routine is invoked from a walk, we cannot signal
* any */
/* error here, can only return. */
return CMD_SUCCESS;
}
vty = ctx->vty;
vty_out(vty, "Update-group %" PRIu64 ":\n", updgrp->id);
vty_out(vty, " Created: %s", timestamp_string(updgrp->uptime));
filter = &updgrp->conf->filter[updgrp->afi][updgrp->safi];
if (filter->map[RMAP_OUT].name)
vty_out(vty, " Outgoing route map: %s\n",
filter->map[RMAP_OUT].name);
vty_out(vty, " MRAI value (seconds): %d\n", updgrp->conf->v_routeadv);
if (updgrp->conf->change_local_as)
vty_out(vty, " Local AS %u%s%s\n",
updgrp->conf->change_local_as,
CHECK_FLAG(updgrp->conf->flags,
PEER_FLAG_LOCAL_AS_NO_PREPEND)
? " no-prepend"
: "",
CHECK_FLAG(updgrp->conf->flags,
PEER_FLAG_LOCAL_AS_REPLACE_AS)
? " replace-as"
: "");
UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) {
if (ctx->subgrp_id && (ctx->subgrp_id != subgrp->id))
continue;
vty_out(vty, "\n");
vty_out(vty, " Update-subgroup %" PRIu64 ":\n", subgrp->id);
vty_out(vty, " Created: %s",
timestamp_string(subgrp->uptime));
if (subgrp->split_from.update_group_id
|| subgrp->split_from.subgroup_id) {
vty_out(vty, " Split from group id: %" PRIu64 "\n",
subgrp->split_from.update_group_id);
vty_out(vty,
" Split from subgroup id: %" PRIu64 "\n",
subgrp->split_from.subgroup_id);
}
vty_out(vty, " Join events: %u\n", subgrp->join_events);
vty_out(vty, " Prune events: %u\n", subgrp->prune_events);
vty_out(vty, " Merge events: %u\n", subgrp->merge_events);
vty_out(vty, " Split events: %u\n", subgrp->split_events);
vty_out(vty, " Update group switch events: %u\n",
subgrp->updgrp_switch_events);
vty_out(vty, " Peer refreshes combined: %u\n",
subgrp->peer_refreshes_combined);
vty_out(vty, " Merge checks triggered: %u\n",
subgrp->merge_checks_triggered);
vty_out(vty, " Coalesce Time: %u%s\n",
(UPDGRP_INST(subgrp->update_group))->coalesce_time,
subgrp->t_coalesce ? "(Running)" : "");
vty_out(vty, " Version: %" PRIu64 "\n", subgrp->version);
vty_out(vty, " Packet queue length: %d\n",
bpacket_queue_length(SUBGRP_PKTQ(subgrp)));
vty_out(vty, " Total packets enqueued: %u\n",
subgroup_total_packets_enqueued(subgrp));
vty_out(vty, " Packet queue high watermark: %d\n",
bpacket_queue_hwm_length(SUBGRP_PKTQ(subgrp)));
vty_out(vty, " Adj-out list count: %u\n", subgrp->adj_count);
vty_out(vty, " Advertise list: %s\n",
advertise_list_is_empty(subgrp) ? "empty"
: "not empty");
vty_out(vty, " Flags: %s\n",
CHECK_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH)
? "R"
: "");
if (subgrp->peer_count > 0) {
vty_out(vty, " Peers:\n");
SUBGRP_FOREACH_PEER (subgrp, paf)
vty_out(vty, " - %s\n", paf->peer->host);
}
}
return UPDWALK_CONTINUE;
}
/*
* Helper function to show the packet queue for each subgroup of update group.
* Will be constrained to a particular subgroup id if id !=0
*/
static int updgrp_show_packet_queue_walkcb(struct update_group *updgrp,
void *arg)
{
struct updwalk_context *ctx = arg;
struct update_subgroup *subgrp;
struct vty *vty;
vty = ctx->vty;
UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) {
if (ctx->subgrp_id && (ctx->subgrp_id != subgrp->id))
continue;
vty_out(vty, "update group %" PRIu64 ", subgroup %" PRIu64 "\n",
updgrp->id, subgrp->id);
bpacket_queue_show_vty(SUBGRP_PKTQ(subgrp), vty);
}
return UPDWALK_CONTINUE;
}
/*
* Show the packet queue for each subgroup of update group. Will be
* constrained to a particular subgroup id if id !=0
*/
void update_group_show_packet_queue(struct bgp *bgp, afi_t afi, safi_t safi,
struct vty *vty, uint64_t id)
{
struct updwalk_context ctx;
memset(&ctx, 0, sizeof(ctx));
ctx.vty = vty;
ctx.subgrp_id = id;
ctx.flags = 0;
update_group_af_walk(bgp, afi, safi, updgrp_show_packet_queue_walkcb,
&ctx);
}
static struct update_group *update_group_find(struct peer_af *paf)
{
struct update_group *updgrp;
struct update_group tmp;
struct peer tmp_conf;
if (!peer_established(PAF_PEER(paf)))
return NULL;
memset(&tmp, 0, sizeof(tmp));
memset(&tmp_conf, 0, sizeof(tmp_conf));
tmp.conf = &tmp_conf;
peer2_updgrp_copy(&tmp, paf);
updgrp = hash_lookup(paf->peer->bgp->update_groups[paf->afid], &tmp);
conf_release(&tmp_conf, paf->afi, paf->safi);
return updgrp;
}
static struct update_group *update_group_create(struct peer_af *paf)
{
struct update_group *updgrp;
struct update_group tmp;
struct peer tmp_conf;
memset(&tmp, 0, sizeof(tmp));
memset(&tmp_conf, 0, sizeof(tmp_conf));
tmp.conf = &tmp_conf;
peer2_updgrp_copy(&tmp, paf);
updgrp = hash_get(paf->peer->bgp->update_groups[paf->afid], &tmp,
updgrp_hash_alloc);
if (!updgrp)
return NULL;
update_group_checkin(updgrp);
if (BGP_DEBUG(update_groups, UPDATE_GROUPS))
zlog_debug("create update group %" PRIu64, updgrp->id);
UPDGRP_GLOBAL_STAT(updgrp, updgrps_created) += 1;
conf_release(&tmp_conf, paf->afi, paf->safi);
return updgrp;
}
static void update_group_delete(struct update_group *updgrp)
{
if (BGP_DEBUG(update_groups, UPDATE_GROUPS))
zlog_debug("delete update group %" PRIu64, updgrp->id);
UPDGRP_GLOBAL_STAT(updgrp, updgrps_deleted) += 1;
hash_release(updgrp->bgp->update_groups[updgrp->afid], updgrp);
conf_release(updgrp->conf, updgrp->afi, updgrp->safi);
XFREE(MTYPE_BGP_PEER_HOST, updgrp->conf->host);
XFREE(MTYPE_BGP_PEER_IFNAME, updgrp->conf->ifname);
XFREE(MTYPE_BGP_PEER, updgrp->conf);
XFREE(MTYPE_BGP_UPDGRP, updgrp);
}
static void update_group_add_subgroup(struct update_group *updgrp,
struct update_subgroup *subgrp)
{
if (!updgrp || !subgrp)
return;
LIST_INSERT_HEAD(&(updgrp->subgrps), subgrp, updgrp_train);
subgrp->update_group = updgrp;
}
static void update_group_remove_subgroup(struct update_group *updgrp,
struct update_subgroup *subgrp)
{
if (!updgrp || !subgrp)
return;
LIST_REMOVE(subgrp, updgrp_train);
subgrp->update_group = NULL;
if (LIST_EMPTY(&(updgrp->subgrps)))
update_group_delete(updgrp);
}
static struct update_subgroup *
update_subgroup_create(struct update_group *updgrp)
{
struct update_subgroup *subgrp;
subgrp = XCALLOC(MTYPE_BGP_UPD_SUBGRP, sizeof(struct update_subgroup));
update_subgroup_checkin(subgrp, updgrp);
subgrp->v_coalesce = (UPDGRP_INST(updgrp))->coalesce_time;
sync_init(subgrp);
bpacket_queue_init(SUBGRP_PKTQ(subgrp));
bpacket_queue_add(SUBGRP_PKTQ(subgrp), NULL, NULL);
TAILQ_INIT(&(subgrp->adjq));
if (BGP_DEBUG(update_groups, UPDATE_GROUPS))
zlog_debug("create subgroup u%" PRIu64 ":s%" PRIu64, updgrp->id,
subgrp->id);
update_group_add_subgroup(updgrp, subgrp);
UPDGRP_INCR_STAT(updgrp, subgrps_created);
return subgrp;
}
static void update_subgroup_delete(struct update_subgroup *subgrp)
{
if (!subgrp)
return;
if (subgrp->update_group)
UPDGRP_INCR_STAT(subgrp->update_group, subgrps_deleted);
if (subgrp->t_merge_check)
THREAD_OFF(subgrp->t_merge_check);
if (subgrp->t_coalesce)
THREAD_TIMER_OFF(subgrp->t_coalesce);
bpacket_queue_cleanup(SUBGRP_PKTQ(subgrp));
subgroup_clear_table(subgrp);
if (subgrp->t_coalesce)
THREAD_TIMER_OFF(subgrp->t_coalesce);
sync_delete(subgrp);
if (BGP_DEBUG(update_groups, UPDATE_GROUPS) && subgrp->update_group)
zlog_debug("delete subgroup u%" PRIu64 ":s%" PRIu64,
subgrp->update_group->id, subgrp->id);
update_group_remove_subgroup(subgrp->update_group, subgrp);
XFREE(MTYPE_BGP_UPD_SUBGRP, subgrp);
}
void update_subgroup_inherit_info(struct update_subgroup *to,
struct update_subgroup *from)
{
if (!to || !from)
return;
to->sflags = from->sflags;
}
/*
* update_subgroup_check_delete
*
* Delete a subgroup if it is ready to be deleted.
*
* Returns true if the subgroup was deleted.
*/
static bool update_subgroup_check_delete(struct update_subgroup *subgrp)
{
if (!subgrp)
return false;
if (!LIST_EMPTY(&(subgrp->peers)))
return false;
update_subgroup_delete(subgrp);
return true;
}
/*
* update_subgroup_add_peer
*
* @param send_enqueued_packets If true all currently enqueued packets will
* also be sent to the peer.
*/
static void update_subgroup_add_peer(struct update_subgroup *subgrp,
struct peer_af *paf,
int send_enqueued_pkts)
{
struct bpacket *pkt;
if (!subgrp || !paf)
return;
LIST_INSERT_HEAD(&(subgrp->peers), paf, subgrp_train);
paf->subgroup = subgrp;
subgrp->peer_count++;
if (bgp_debug_peer_updout_enabled(paf->peer->host)) {
UPDGRP_PEER_DBG_EN(subgrp->update_group);
}
SUBGRP_INCR_STAT(subgrp, join_events);
if (send_enqueued_pkts) {
pkt = bpacket_queue_first(SUBGRP_PKTQ(subgrp));
} else {
/*
* Hang the peer off of the last, placeholder, packet in the
* queue. This means it won't see any of the packets that are
* currently the queue.
*/
pkt = bpacket_queue_last(SUBGRP_PKTQ(subgrp));
assert(pkt->buffer == NULL);
}
bpacket_add_peer(pkt, paf);
bpacket_queue_sanity_check(SUBGRP_PKTQ(subgrp));
if (BGP_DEBUG(update_groups, UPDATE_GROUPS))
zlog_debug("peer %s added to subgroup s%" PRIu64,
paf->peer->host, subgrp->id);
}
/*
* update_subgroup_remove_peer_internal
*
* Internal function that removes a peer from a subgroup, but does not
* delete the subgroup. A call to this function must almost always be
* followed by a call to update_subgroup_check_delete().
*
* @see update_subgroup_remove_peer
*/
static void update_subgroup_remove_peer_internal(struct update_subgroup *subgrp,
struct peer_af *paf)
{
assert(subgrp && paf && subgrp->update_group);
if (bgp_debug_peer_updout_enabled(paf->peer->host)) {
UPDGRP_PEER_DBG_DIS(subgrp->update_group);
}
bpacket_queue_remove_peer(paf);
LIST_REMOVE(paf, subgrp_train);
paf->subgroup = NULL;
subgrp->peer_count--;
if (BGP_DEBUG(update_groups, UPDATE_GROUPS))
zlog_debug("peer %s deleted from subgroup s%"
PRIu64 " peer cnt %d",
paf->peer->host, subgrp->id, subgrp->peer_count);
SUBGRP_INCR_STAT(subgrp, prune_events);
}
/*
* update_subgroup_remove_peer
*/
void update_subgroup_remove_peer(struct update_subgroup *subgrp,
struct peer_af *paf)
{
if (!subgrp || !paf)
return;
update_subgroup_remove_peer_internal(subgrp, paf);
if (update_subgroup_check_delete(subgrp))
return;
/*
* The deletion of the peer may have caused some packets to be
* deleted from the subgroup packet queue. Check if the subgroup can
* be merged now.
*/
update_subgroup_check_merge(subgrp, "removed peer from subgroup");
}
static struct update_subgroup *update_subgroup_find(struct update_group *updgrp,
struct peer_af *paf)
{
struct update_subgroup *subgrp = NULL;
uint64_t version;
if (paf->subgroup) {
assert(0);
return NULL;
} else
version = 0;
if (!peer_established(PAF_PEER(paf)))
return NULL;
UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) {
if (subgrp->version != version
|| CHECK_FLAG(subgrp->sflags,
SUBGRP_STATUS_DEFAULT_ORIGINATE))
continue;
/*
* The version number is not meaningful on a subgroup that needs
* a refresh.
*/
if (update_subgroup_needs_refresh(subgrp))
continue;
break;
}
return subgrp;
}
/*
* update_subgroup_ready_for_merge
*
* Returns true if this subgroup is in a state that allows it to be
* merged into another subgroup.
*/
static bool update_subgroup_ready_for_merge(struct update_subgroup *subgrp)
{
/*
* Not ready if there are any encoded packets waiting to be written
* out to peers.
*/
if (!bpacket_queue_is_empty(SUBGRP_PKTQ(subgrp)))
return false;
/*
* Not ready if there enqueued updates waiting to be encoded.
*/
if (!advertise_list_is_empty(subgrp))
return false;