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
|
/* $OpenBSD$ */
/*
* Copyright (c) 2013, 2016 Renato Westphal <renato@openbsd.org>
* Copyright (c) 2009 Michele Marchetto <michele@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <zebra.h>
#include "ldpd.h"
#include "lde.h"
#include "log.h"
#include "mpls.h"
static __inline int fec_compare(struct fec *, struct fec *);
static int lde_nbr_is_nexthop(struct fec_node *,
struct lde_nbr *);
static void fec_free(void *);
static struct fec_node *fec_add(struct fec *fec);
static struct fec_nh *fec_nh_add(struct fec_node *, int, union ldpd_addr *,
ifindex_t, uint8_t);
static void fec_nh_del(struct fec_nh *);
RB_GENERATE(fec_tree, fec, entry, fec_compare)
struct fec_tree ft = RB_INITIALIZER(&ft);
struct thread *gc_timer;
/* FEC tree functions */
void
fec_init(struct fec_tree *fh)
{
RB_INIT(fh);
}
static __inline int
fec_compare(struct fec *a, struct fec *b)
{
if (a->type < b->type)
return (-1);
if (a->type > b->type)
return (1);
switch (a->type) {
case FEC_TYPE_IPV4:
if (ntohl(a->u.ipv4.prefix.s_addr) <
ntohl(b->u.ipv4.prefix.s_addr))
return (-1);
if (ntohl(a->u.ipv4.prefix.s_addr) >
ntohl(b->u.ipv4.prefix.s_addr))
return (1);
if (a->u.ipv4.prefixlen < b->u.ipv4.prefixlen)
return (-1);
if (a->u.ipv4.prefixlen > b->u.ipv4.prefixlen)
return (1);
return (0);
case FEC_TYPE_IPV6:
if (memcmp(&a->u.ipv6.prefix, &b->u.ipv6.prefix,
sizeof(struct in6_addr)) < 0)
return (-1);
if (memcmp(&a->u.ipv6.prefix, &b->u.ipv6.prefix,
sizeof(struct in6_addr)) > 0)
return (1);
if (a->u.ipv6.prefixlen < b->u.ipv6.prefixlen)
return (-1);
if (a->u.ipv6.prefixlen > b->u.ipv6.prefixlen)
return (1);
return (0);
case FEC_TYPE_PWID:
if (a->u.pwid.type < b->u.pwid.type)
return (-1);
if (a->u.pwid.type > b->u.pwid.type)
return (1);
if (a->u.pwid.pwid < b->u.pwid.pwid)
return (-1);
if (a->u.pwid.pwid > b->u.pwid.pwid)
return (1);
if (ntohl(a->u.pwid.lsr_id.s_addr) <
ntohl(b->u.pwid.lsr_id.s_addr))
return (-1);
if (ntohl(a->u.pwid.lsr_id.s_addr) >
ntohl(b->u.pwid.lsr_id.s_addr))
return (1);
return (0);
}
return (-1);
}
struct fec *
fec_find(struct fec_tree *fh, struct fec *f)
{
return (RB_FIND(fec_tree, fh, f));
}
int
fec_insert(struct fec_tree *fh, struct fec *f)
{
if (RB_INSERT(fec_tree, fh, f) != NULL)
return (-1);
return (0);
}
int
fec_remove(struct fec_tree *fh, struct fec *f)
{
if (RB_REMOVE(fec_tree, fh, f) == NULL) {
log_warnx("%s failed for %s", __func__, log_fec(f));
return (-1);
}
return (0);
}
void
fec_clear(struct fec_tree *fh, void (*free_cb)(void *))
{
struct fec *f;
while ((f = RB_ROOT(fh)) != NULL) {
fec_remove(fh, f);
free_cb(f);
}
}
/* routing table functions */
static int
lde_nbr_is_nexthop(struct fec_node *fn, struct lde_nbr *ln)
{
struct fec_nh *fnh;
LIST_FOREACH(fnh, &fn->nexthops, entry)
if (lde_address_find(ln, fnh->af, &fnh->nexthop))
return (1);
return (0);
}
void
rt_dump(pid_t pid)
{
struct fec *f;
struct fec_node *fn;
struct lde_map *me;
static struct ctl_rt rtctl;
RB_FOREACH(f, fec_tree, &ft) {
fn = (struct fec_node *)f;
if (fn->local_label == NO_LABEL &&
RB_EMPTY(&fn->downstream))
continue;
rtctl.first = 1;
switch (fn->fec.type) {
case FEC_TYPE_IPV4:
rtctl.af = AF_INET;
rtctl.prefix.v4 = fn->fec.u.ipv4.prefix;
rtctl.prefixlen = fn->fec.u.ipv4.prefixlen;
break;
case FEC_TYPE_IPV6:
rtctl.af = AF_INET6;
rtctl.prefix.v6 = fn->fec.u.ipv6.prefix;
rtctl.prefixlen = fn->fec.u.ipv6.prefixlen;
break;
default:
continue;
}
rtctl.local_label = fn->local_label;
RB_FOREACH(me, lde_map_head, &fn->downstream) {
rtctl.in_use = lde_nbr_is_nexthop(fn, me->nexthop);
rtctl.nexthop = me->nexthop->id;
rtctl.remote_label = me->map.label;
lde_imsg_compose_ldpe(IMSG_CTL_SHOW_LIB, 0, pid,
&rtctl, sizeof(rtctl));
rtctl.first = 0;
}
if (RB_EMPTY(&fn->downstream)) {
rtctl.in_use = 0;
rtctl.nexthop.s_addr = INADDR_ANY;
rtctl.remote_label = NO_LABEL;
lde_imsg_compose_ldpe(IMSG_CTL_SHOW_LIB, 0, pid,
&rtctl, sizeof(rtctl));
}
}
}
void
fec_snap(struct lde_nbr *ln)
{
struct fec *f;
struct fec_node *fn;
RB_FOREACH(f, fec_tree, &ft) {
fn = (struct fec_node *)f;
if (fn->local_label == NO_LABEL)
continue;
lde_send_labelmapping(ln, fn, 0);
}
lde_imsg_compose_ldpe(IMSG_MAPPING_ADD_END, ln->peerid, 0, NULL, 0);
}
static void
fec_free(void *arg)
{
struct fec_node *fn = arg;
struct fec_nh *fnh;
while ((fnh = LIST_FIRST(&fn->nexthops)))
fec_nh_del(fnh);
if (!RB_EMPTY(&fn->downstream))
log_warnx("%s: fec %s downstream list not empty", __func__,
log_fec(&fn->fec));
if (!RB_EMPTY(&fn->upstream))
log_warnx("%s: fec %s upstream list not empty", __func__,
log_fec(&fn->fec));
free(fn);
}
void
fec_tree_clear(void)
{
fec_clear(&ft, fec_free);
}
static struct fec_node *
fec_add(struct fec *fec)
{
struct fec_node *fn;
fn = calloc(1, sizeof(*fn));
if (fn == NULL)
fatal(__func__);
fn->fec = *fec;
fn->local_label = NO_LABEL;
RB_INIT(&fn->upstream);
RB_INIT(&fn->downstream);
LIST_INIT(&fn->nexthops);
if (fec_insert(&ft, &fn->fec))
log_warnx("failed to add %s to ft tree",
log_fec(&fn->fec));
return (fn);
}
struct fec_nh *
fec_nh_find(struct fec_node *fn, int af, union ldpd_addr *nexthop,
ifindex_t ifindex, uint8_t priority)
{
struct fec_nh *fnh;
LIST_FOREACH(fnh, &fn->nexthops, entry)
if (fnh->af == af &&
ldp_addrcmp(af, &fnh->nexthop, nexthop) == 0 &&
fnh->ifindex == ifindex &&
fnh->priority == priority)
return (fnh);
return (NULL);
}
static struct fec_nh *
fec_nh_add(struct fec_node *fn, int af, union ldpd_addr *nexthop,
ifindex_t ifindex, uint8_t priority)
{
struct fec_nh *fnh;
fnh = calloc(1, sizeof(*fnh));
if (fnh == NULL)
fatal(__func__);
fnh->af = af;
fnh->nexthop = *nexthop;
fnh->ifindex = ifindex;
fnh->remote_label = NO_LABEL;
fnh->priority = priority;
LIST_INSERT_HEAD(&fn->nexthops, fnh, entry);
return (fnh);
}
static void
fec_nh_del(struct fec_nh *fnh)
{
LIST_REMOVE(fnh, entry);
free(fnh);
}
void
lde_kernel_insert(struct fec *fec, int af, union ldpd_addr *nexthop,
ifindex_t ifindex, uint8_t priority, int connected, void *data)
{
struct fec_node *fn;
struct fec_nh *fnh;
struct lde_map *me;
struct lde_nbr *ln;
fn = (struct fec_node *)fec_find(&ft, fec);
if (fn == NULL)
fn = fec_add(fec);
fnh = fec_nh_find(fn, af, nexthop, ifindex, priority);
if (fnh != NULL) {
lde_send_change_klabel(fn, fnh);
fnh->flags |= F_FEC_NH_NEW;
return;
}
if (fn->fec.type == FEC_TYPE_PWID)
fn->data = data;
if (fn->local_label == NO_LABEL) {
fn->local_label = lde_assign_label(&fn->fec, connected);
/* FEC.1: perform lsr label distribution procedure */
if (fn->local_label != NO_LABEL)
RB_FOREACH(ln, nbr_tree, &lde_nbrs)
lde_send_labelmapping(ln, fn, 1);
}
fnh = fec_nh_add(fn, af, nexthop, ifindex, priority);
fnh->flags |= F_FEC_NH_NEW;
lde_send_change_klabel(fn, fnh);
switch (fn->fec.type) {
case FEC_TYPE_IPV4:
case FEC_TYPE_IPV6:
ln = lde_nbr_find_by_addr(af, &fnh->nexthop);
break;
case FEC_TYPE_PWID:
ln = lde_nbr_find_by_lsrid(fn->fec.u.pwid.lsr_id);
break;
default:
ln = NULL;
break;
}
if (ln) {
/* FEC.2 */
me = (struct lde_map *)fec_find(&ln->recv_map, &fn->fec);
if (me)
/* FEC.5 */
lde_check_mapping(&me->map, ln);
}
}
void
lde_kernel_remove(struct fec *fec, int af, union ldpd_addr *nexthop,
ifindex_t ifindex, uint8_t priority)
{
struct fec_node *fn;
struct fec_nh *fnh;
fn = (struct fec_node *)fec_find(&ft, fec);
if (fn == NULL)
/* route lost */
return;
fnh = fec_nh_find(fn, af, nexthop, ifindex, priority);
if (fnh == NULL)
/* route lost */
return;
lde_send_delete_klabel(fn, fnh);
fec_nh_del(fnh);
if (LIST_EMPTY(&fn->nexthops)) {
lde_send_labelwithdraw_all(fn, NO_LABEL);
fn->local_label = NO_LABEL;
if (fn->fec.type == FEC_TYPE_PWID)
fn->data = NULL;
}
}
/*
* Whenever a route is changed, zebra advertises its new version without
* withdrawing the old one. So, after processing a ZEBRA_REDISTRIBUTE_IPV[46]_ADD
* message, we need to check for nexthops that were removed and, for each of
* them (if any), withdraw the associated labels from zebra.
*/
void
lde_kernel_reevaluate(struct fec *fec)
{
struct fec_node *fn;
struct fec_nh *fnh, *safe;
fn = (struct fec_node *)fec_find(&ft, fec);
if (fn == NULL)
return;
LIST_FOREACH_SAFE(fnh, &fn->nexthops, entry, safe) {
if (fnh->flags & F_FEC_NH_NEW)
fnh->flags &= ~F_FEC_NH_NEW;
else
lde_kernel_remove(fec, fnh->af, &fnh->nexthop,
fnh->ifindex, fnh->priority);
}
}
void
lde_check_mapping(struct map *map, struct lde_nbr *ln)
{
struct fec fec;
struct fec_node *fn;
struct fec_nh *fnh;
struct lde_req *lre;
struct lde_map *me;
struct l2vpn_pw *pw;
int msgsource = 0;
lde_map2fec(map, ln->id, &fec);
switch (fec.type) {
case FEC_TYPE_IPV4:
if (lde_acl_check(ldeconf->ipv4.acl_label_accept_from,
AF_INET, (union ldpd_addr *)&ln->id, 32) != FILTER_PERMIT)
return;
if (lde_acl_check(ldeconf->ipv4.acl_label_accept_for,
AF_INET, (union ldpd_addr *)&fec.u.ipv4.prefix,
fec.u.ipv4.prefixlen) != FILTER_PERMIT)
return;
break;
case FEC_TYPE_IPV6:
if (lde_acl_check(ldeconf->ipv6.acl_label_accept_from,
AF_INET, (union ldpd_addr *)&ln->id, 32) != FILTER_PERMIT)
return;
if (lde_acl_check(ldeconf->ipv6.acl_label_accept_for,
AF_INET6, (union ldpd_addr *)&fec.u.ipv6.prefix,
fec.u.ipv6.prefixlen) != FILTER_PERMIT)
return;
break;
default:
break;
}
fn = (struct fec_node *)fec_find(&ft, &fec);
if (fn == NULL)
fn = fec_add(&fec);
/* LMp.1: first check if we have a pending request running */
lre = (struct lde_req *)fec_find(&ln->sent_req, &fn->fec);
if (lre)
/* LMp.2: delete record of outstanding label request */
lde_req_del(ln, lre, 1);
/* RFC 4447 control word and status tlv negotiation */
if (map->type == MAP_TYPE_PWID && l2vpn_pw_negotiate(ln, fn, map))
return;
/*
* LMp.3 - LMp.8: loop detection - unnecessary for frame-mode
* mpls networks.
*/
/* LMp.9 */
me = (struct lde_map *)fec_find(&ln->recv_map, &fn->fec);
if (me) {
/* LMp.10 */
if (me->map.label != map->label && lre == NULL) {
/* LMp.10a */
lde_send_labelrelease(ln, fn, me->map.label);
/*
* Can not use lde_nbr_find_by_addr() because there's
* the possibility of multipath.
*/
LIST_FOREACH(fnh, &fn->nexthops, entry) {
if (lde_address_find(ln, fnh->af,
&fnh->nexthop) == NULL)
continue;
lde_send_delete_klabel(fn, fnh);
fnh->remote_label = NO_LABEL;
}
}
}
/*
* LMp.11 - 12: consider multiple nexthops in order to
* support multipath
*/
LIST_FOREACH(fnh, &fn->nexthops, entry) {
/* LMp.15: install FEC in FIB */
switch (fec.type) {
case FEC_TYPE_IPV4:
case FEC_TYPE_IPV6:
if (!lde_address_find(ln, fnh->af, &fnh->nexthop))
continue;
fnh->remote_label = map->label;
lde_send_change_klabel(fn, fnh);
break;
case FEC_TYPE_PWID:
pw = (struct l2vpn_pw *) fn->data;
if (pw == NULL)
continue;
pw->remote_group = map->fec.pwid.group_id;
if (map->flags & F_MAP_PW_IFMTU)
pw->remote_mtu = map->fec.pwid.ifmtu;
if (map->flags & F_MAP_PW_STATUS)
pw->remote_status = map->pw_status;
fnh->remote_label = map->label;
if (l2vpn_pw_ok(pw, fnh))
lde_send_change_klabel(fn, fnh);
break;
default:
break;
}
msgsource = 1;
}
/* LMp.13 & LMp.16: Record the mapping from this peer */
if (me == NULL)
me = lde_map_add(ln, fn, 0);
me->map = *map;
if (msgsource == 0)
/* LMp.13: just return since we use liberal lbl retention */
return;
/*
* LMp.17 - LMp.27 are unnecessary since we don't need to implement
* loop detection. LMp.28 - LMp.30 are unnecessary because we are
* merging capable.
*/
}
void
lde_check_request(struct map *map, struct lde_nbr *ln)
{
struct fec fec;
struct lde_req *lre;
struct fec_node *fn;
struct fec_nh *fnh;
/* LRq.1: skip loop detection (not necessary) */
/* LRq.2: is there a next hop for fec? */
lde_map2fec(map, ln->id, &fec);
fn = (struct fec_node *)fec_find(&ft, &fec);
if (fn == NULL || LIST_EMPTY(&fn->nexthops)) {
/* LRq.5: send No Route notification */
lde_send_notification(ln->peerid, S_NO_ROUTE, map->msg_id,
htons(MSG_TYPE_LABELREQUEST));
return;
}
/* LRq.3: is MsgSource the next hop? */
LIST_FOREACH(fnh, &fn->nexthops, entry) {
switch (fec.type) {
case FEC_TYPE_IPV4:
case FEC_TYPE_IPV6:
if (!lde_address_find(ln, fnh->af, &fnh->nexthop))
continue;
/* LRq.4: send Loop Detected notification */
lde_send_notification(ln->peerid, S_LOOP_DETECTED,
map->msg_id, htons(MSG_TYPE_LABELREQUEST));
return;
default:
break;
}
}
/* LRq.6: first check if we have a pending request running */
lre = (struct lde_req *)fec_find(&ln->recv_req, &fn->fec);
if (lre != NULL)
/* LRq.7: duplicate request */
return;
/* LRq.8: record label request */
lre = lde_req_add(ln, &fn->fec, 0);
if (lre != NULL)
lre->msg_id = ntohl(map->msg_id);
/* LRq.9: perform LSR label distribution */
lde_send_labelmapping(ln, fn, 1);
/*
* LRq.10: do nothing (Request Never) since we use liberal
* label retention.
* LRq.11 - 12 are unnecessary since we are merging capable.
*/
}
void
lde_check_release(struct map *map, struct lde_nbr *ln)
{
struct fec fec;
struct fec_node *fn;
struct lde_wdraw *lw;
struct lde_map *me;
/* TODO group wildcard */
if (map->type == MAP_TYPE_PWID && !(map->flags & F_MAP_PW_ID))
return;
lde_map2fec(map, ln->id, &fec);
fn = (struct fec_node *)fec_find(&ft, &fec);
/* LRl.1: does FEC match a known FEC? */
if (fn == NULL)
return;
/* LRl.3: first check if we have a pending withdraw running */
lw = (struct lde_wdraw *)fec_find(&ln->sent_wdraw, &fn->fec);
if (lw && (map->label == NO_LABEL ||
(lw->label != NO_LABEL && map->label == lw->label))) {
/* LRl.4: delete record of outstanding label withdraw */
lde_wdraw_del(ln, lw);
}
/* LRl.6: check sent map list and remove it if available */
me = (struct lde_map *)fec_find(&ln->sent_map, &fn->fec);
if (me && (map->label == NO_LABEL || map->label == me->map.label))
lde_map_del(ln, me, 1);
/*
* LRl.11 - 13 are unnecessary since we remove the label from
* forwarding/switching as soon as the FEC is unreachable.
*/
}
void
lde_check_release_wcard(struct map *map, struct lde_nbr *ln)
{
struct fec *f;
struct fec_node *fn;
struct lde_wdraw *lw;
struct lde_map *me;
RB_FOREACH(f, fec_tree, &ft) {
fn = (struct fec_node *)f;
/* LRl.3: first check if we have a pending withdraw running */
lw = (struct lde_wdraw *)fec_find(&ln->sent_wdraw, &fn->fec);
if (lw && (map->label == NO_LABEL ||
(lw->label != NO_LABEL && map->label == lw->label))) {
/* LRl.4: delete record of outstanding lbl withdraw */
lde_wdraw_del(ln, lw);
}
/* LRl.6: check sent map list and remove it if available */
me = (struct lde_map *)fec_find(&ln->sent_map, &fn->fec);
if (me &&
(map->label == NO_LABEL || map->label == me->map.label))
lde_map_del(ln, me, 1);
/*
* LRl.11 - 13 are unnecessary since we remove the label from
* forwarding/switching as soon as the FEC is unreachable.
*/
}
}
void
lde_check_withdraw(struct map *map, struct lde_nbr *ln)
{
struct fec fec;
struct fec_node *fn;
struct fec_nh *fnh;
struct lde_map *me;
struct l2vpn_pw *pw;
/* TODO group wildcard */
if (map->type == MAP_TYPE_PWID && !(map->flags & F_MAP_PW_ID))
return;
lde_map2fec(map, ln->id, &fec);
fn = (struct fec_node *)fec_find(&ft, &fec);
if (fn == NULL)
fn = fec_add(&fec);
/* LWd.1: remove label from forwarding/switching use */
LIST_FOREACH(fnh, &fn->nexthops, entry) {
switch (fec.type) {
case FEC_TYPE_IPV4:
case FEC_TYPE_IPV6:
if (!lde_address_find(ln, fnh->af, &fnh->nexthop))
continue;
break;
case FEC_TYPE_PWID:
pw = (struct l2vpn_pw *) fn->data;
if (pw == NULL)
continue;
break;
default:
break;
}
lde_send_delete_klabel(fn, fnh);
fnh->remote_label = NO_LABEL;
}
/* LWd.2: send label release */
lde_send_labelrelease(ln, fn, map->label);
/* LWd.3: check previously received label mapping */
me = (struct lde_map *)fec_find(&ln->recv_map, &fn->fec);
if (me && (map->label == NO_LABEL || map->label == me->map.label))
/* LWd.4: remove record of previously received lbl mapping */
lde_map_del(ln, me, 0);
}
void
lde_check_withdraw_wcard(struct map *map, struct lde_nbr *ln)
{
struct fec *f;
struct fec_node *fn;
struct fec_nh *fnh;
struct lde_map *me;
/* LWd.2: send label release */
lde_send_labelrelease(ln, NULL, map->label);
RB_FOREACH(f, fec_tree, &ft) {
fn = (struct fec_node *)f;
/* LWd.1: remove label from forwarding/switching use */
LIST_FOREACH(fnh, &fn->nexthops, entry) {
switch (f->type) {
case FEC_TYPE_IPV4:
case FEC_TYPE_IPV6:
if (!lde_address_find(ln, fnh->af,
&fnh->nexthop))
continue;
break;
case FEC_TYPE_PWID:
if (f->u.pwid.lsr_id.s_addr != ln->id.s_addr)
continue;
break;
default:
break;
}
lde_send_delete_klabel(fn, fnh);
fnh->remote_label = NO_LABEL;
}
/* LWd.3: check previously received label mapping */
me = (struct lde_map *)fec_find(&ln->recv_map, &fn->fec);
if (me && (map->label == NO_LABEL ||
map->label == me->map.label))
/*
* LWd.4: remove record of previously received
* label mapping
*/
lde_map_del(ln, me, 0);
}
}
/* gabage collector timer: timer to remove dead entries from the LIB */
/* ARGSUSED */
int
lde_gc_timer(struct thread *thread)
{
struct fec *fec, *safe;
struct fec_node *fn;
int count = 0;
RB_FOREACH_SAFE(fec, fec_tree, &ft, safe) {
fn = (struct fec_node *) fec;
if (!LIST_EMPTY(&fn->nexthops) ||
!RB_EMPTY(&fn->downstream) ||
!RB_EMPTY(&fn->upstream))
continue;
fec_remove(&ft, &fn->fec);
free(fn);
count++;
}
if (count > 0)
log_debug("%s: %u entries removed", __func__, count);
lde_gc_start_timer();
return (0);
}
void
lde_gc_start_timer(void)
{
THREAD_TIMER_OFF(gc_timer);
gc_timer = thread_add_timer(master, lde_gc_timer, NULL,
LDE_GC_INTERVAL);
}
void
lde_gc_stop_timer(void)
{
THREAD_TIMER_OFF(gc_timer);
}
|