]>
git.proxmox.com Git - mirror_frr.git/blob - ldpd/lde_lib.c
4 * Copyright (c) 2013, 2016 Renato Westphal <renato@openbsd.org>
5 * Copyright (c) 2009 Michele Marchetto <michele@openbsd.org>
7 * Permission to use, copy, modify, and distribute this software for any
8 * purpose with or without fee is hereby granted, provided that the above
9 * copyright notice and this permission notice appear in all copies.
11 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
12 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
13 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
14 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
15 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
16 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
17 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
28 static __inline
int fec_compare(struct fec
*, struct fec
*);
29 static int lde_nbr_is_nexthop(struct fec_node
*,
31 static void fec_free(void *);
32 static struct fec_node
*fec_add(struct fec
*fec
);
33 static struct fec_nh
*fec_nh_add(struct fec_node
*, int, union ldpd_addr
*,
35 static void fec_nh_del(struct fec_nh
*);
37 RB_GENERATE(fec_tree
, fec
, entry
, fec_compare
)
39 struct fec_tree ft
= RB_INITIALIZER(&ft
);
40 struct thread
*gc_timer
;
42 /* FEC tree functions */
44 fec_init(struct fec_tree
*fh
)
50 fec_compare(struct fec
*a
, struct fec
*b
)
52 if (a
->type
< b
->type
)
54 if (a
->type
> b
->type
)
59 if (ntohl(a
->u
.ipv4
.prefix
.s_addr
) <
60 ntohl(b
->u
.ipv4
.prefix
.s_addr
))
62 if (ntohl(a
->u
.ipv4
.prefix
.s_addr
) >
63 ntohl(b
->u
.ipv4
.prefix
.s_addr
))
65 if (a
->u
.ipv4
.prefixlen
< b
->u
.ipv4
.prefixlen
)
67 if (a
->u
.ipv4
.prefixlen
> b
->u
.ipv4
.prefixlen
)
71 if (memcmp(&a
->u
.ipv6
.prefix
, &b
->u
.ipv6
.prefix
,
72 sizeof(struct in6_addr
)) < 0)
74 if (memcmp(&a
->u
.ipv6
.prefix
, &b
->u
.ipv6
.prefix
,
75 sizeof(struct in6_addr
)) > 0)
77 if (a
->u
.ipv6
.prefixlen
< b
->u
.ipv6
.prefixlen
)
79 if (a
->u
.ipv6
.prefixlen
> b
->u
.ipv6
.prefixlen
)
83 if (a
->u
.pwid
.type
< b
->u
.pwid
.type
)
85 if (a
->u
.pwid
.type
> b
->u
.pwid
.type
)
87 if (a
->u
.pwid
.pwid
< b
->u
.pwid
.pwid
)
89 if (a
->u
.pwid
.pwid
> b
->u
.pwid
.pwid
)
91 if (ntohl(a
->u
.pwid
.lsr_id
.s_addr
) <
92 ntohl(b
->u
.pwid
.lsr_id
.s_addr
))
94 if (ntohl(a
->u
.pwid
.lsr_id
.s_addr
) >
95 ntohl(b
->u
.pwid
.lsr_id
.s_addr
))
104 fec_find(struct fec_tree
*fh
, struct fec
*f
)
106 return (RB_FIND(fec_tree
, fh
, f
));
110 fec_insert(struct fec_tree
*fh
, struct fec
*f
)
112 if (RB_INSERT(fec_tree
, fh
, f
) != NULL
)
118 fec_remove(struct fec_tree
*fh
, struct fec
*f
)
120 if (RB_REMOVE(fec_tree
, fh
, f
) == NULL
) {
121 log_warnx("%s failed for %s", __func__
, log_fec(f
));
128 fec_clear(struct fec_tree
*fh
, void (*free_cb
)(void *))
132 while ((f
= RB_ROOT(fh
)) != NULL
) {
138 /* routing table functions */
140 lde_nbr_is_nexthop(struct fec_node
*fn
, struct lde_nbr
*ln
)
144 LIST_FOREACH(fnh
, &fn
->nexthops
, entry
)
145 if (lde_address_find(ln
, fnh
->af
, &fnh
->nexthop
))
157 static struct ctl_rt rtctl
;
159 RB_FOREACH(f
, fec_tree
, &ft
) {
160 fn
= (struct fec_node
*)f
;
161 if (fn
->local_label
== NO_LABEL
&&
162 RB_EMPTY(&fn
->downstream
))
165 memset(&rtctl
, 0, sizeof(rtctl
));
166 switch (fn
->fec
.type
) {
169 rtctl
.prefix
.v4
= fn
->fec
.u
.ipv4
.prefix
;
170 rtctl
.prefixlen
= fn
->fec
.u
.ipv4
.prefixlen
;
174 rtctl
.prefix
.v6
= fn
->fec
.u
.ipv6
.prefix
;
175 rtctl
.prefixlen
= fn
->fec
.u
.ipv6
.prefixlen
;
181 rtctl
.local_label
= fn
->local_label
;
182 if (RB_EMPTY(&fn
->downstream
)) {
184 rtctl
.nexthop
.s_addr
= INADDR_ANY
;
185 rtctl
.remote_label
= NO_LABEL
;
186 rtctl
.no_downstream
= 1;
188 lde_imsg_compose_ldpe(IMSG_CTL_SHOW_LIB_BEGIN
, 0, pid
, &rtctl
,
191 RB_FOREACH(me
, lde_map_head
, &fn
->upstream
) {
192 rtctl
.nexthop
= me
->nexthop
->id
;
193 lde_imsg_compose_ldpe(IMSG_CTL_SHOW_LIB_SENT
, 0, pid
,
194 &rtctl
, sizeof(rtctl
));
197 RB_FOREACH(me
, lde_map_head
, &fn
->downstream
) {
198 rtctl
.in_use
= lde_nbr_is_nexthop(fn
, me
->nexthop
);
199 rtctl
.nexthop
= me
->nexthop
->id
;
200 rtctl
.remote_label
= me
->map
.label
;
201 lde_imsg_compose_ldpe(IMSG_CTL_SHOW_LIB_RCVD
, 0, pid
,
202 &rtctl
, sizeof(rtctl
));
204 lde_imsg_compose_ldpe(IMSG_CTL_SHOW_LIB_END
, 0, pid
, &rtctl
,
210 fec_snap(struct lde_nbr
*ln
)
215 RB_FOREACH(f
, fec_tree
, &ft
) {
216 fn
= (struct fec_node
*)f
;
217 if (fn
->local_label
== NO_LABEL
)
220 lde_send_labelmapping(ln
, fn
, 0);
223 lde_imsg_compose_ldpe(IMSG_MAPPING_ADD_END
, ln
->peerid
, 0, NULL
, 0);
229 struct fec_node
*fn
= arg
;
232 while ((fnh
= LIST_FIRST(&fn
->nexthops
)))
234 if (!RB_EMPTY(&fn
->downstream
))
235 log_warnx("%s: fec %s downstream list not empty", __func__
,
237 if (!RB_EMPTY(&fn
->upstream
))
238 log_warnx("%s: fec %s upstream list not empty", __func__
,
247 fec_clear(&ft
, fec_free
);
250 static struct fec_node
*
251 fec_add(struct fec
*fec
)
255 fn
= calloc(1, sizeof(*fn
));
260 fn
->local_label
= NO_LABEL
;
261 RB_INIT(&fn
->upstream
);
262 RB_INIT(&fn
->downstream
);
263 LIST_INIT(&fn
->nexthops
);
265 if (fec_insert(&ft
, &fn
->fec
))
266 log_warnx("failed to add %s to ft tree",
273 fec_nh_find(struct fec_node
*fn
, int af
, union ldpd_addr
*nexthop
,
274 ifindex_t ifindex
, uint8_t priority
)
278 LIST_FOREACH(fnh
, &fn
->nexthops
, entry
)
280 ldp_addrcmp(af
, &fnh
->nexthop
, nexthop
) == 0 &&
281 fnh
->ifindex
== ifindex
&&
282 fnh
->priority
== priority
)
288 static struct fec_nh
*
289 fec_nh_add(struct fec_node
*fn
, int af
, union ldpd_addr
*nexthop
,
290 ifindex_t ifindex
, uint8_t priority
)
294 fnh
= calloc(1, sizeof(*fnh
));
299 fnh
->nexthop
= *nexthop
;
300 fnh
->ifindex
= ifindex
;
301 fnh
->remote_label
= NO_LABEL
;
302 fnh
->priority
= priority
;
303 LIST_INSERT_HEAD(&fn
->nexthops
, fnh
, entry
);
309 fec_nh_del(struct fec_nh
*fnh
)
311 LIST_REMOVE(fnh
, entry
);
316 lde_kernel_insert(struct fec
*fec
, int af
, union ldpd_addr
*nexthop
,
317 ifindex_t ifindex
, uint8_t priority
, int connected
, void *data
)
322 fn
= (struct fec_node
*)fec_find(&ft
, fec
);
328 fnh
= fec_nh_find(fn
, af
, nexthop
, ifindex
, priority
);
330 fnh
= fec_nh_add(fn
, af
, nexthop
, ifindex
, priority
);
331 fnh
->flags
|= F_FEC_NH_NEW
;
333 fnh
->flags
|= F_FEC_NH_CONNECTED
;
337 lde_kernel_remove(struct fec
*fec
, int af
, union ldpd_addr
*nexthop
,
338 ifindex_t ifindex
, uint8_t priority
)
343 fn
= (struct fec_node
*)fec_find(&ft
, fec
);
347 fnh
= fec_nh_find(fn
, af
, nexthop
, ifindex
, priority
);
352 lde_send_delete_klabel(fn
, fnh
);
357 * Whenever a route is changed, zebra advertises its new version without
358 * withdrawing the old one. So, after processing a ZEBRA_REDISTRIBUTE_IPV[46]_ADD
359 * message, we need to check for nexthops that were removed and, for each of
360 * them (if any), withdraw the associated labels from zebra.
363 lde_kernel_update(struct fec
*fec
)
366 struct fec_nh
*fnh
, *safe
;
370 fn
= (struct fec_node
*)fec_find(&ft
, fec
);
374 LIST_FOREACH_SAFE(fnh
, &fn
->nexthops
, entry
, safe
) {
375 if (fnh
->flags
& F_FEC_NH_NEW
)
376 fnh
->flags
&= ~F_FEC_NH_NEW
;
378 lde_send_delete_klabel(fn
, fnh
);
383 if (LIST_EMPTY(&fn
->nexthops
)) {
384 RB_FOREACH(ln
, nbr_tree
, &lde_nbrs
)
385 lde_send_labelwithdraw(ln
, fn
, NULL
, NULL
);
389 * Do not deallocate the local label now, do that only in the
390 * LIB garbage collector. This will prevent ldpd from changing
391 * the input label of some prefixes too often when running on
392 * an unstable network. Also, restart the garbage collector
393 * timer so that labels are deallocated only when the network
396 lde_gc_start_timer();
398 fn
->local_label
= lde_update_label(fn
);
399 if (fn
->local_label
!= NO_LABEL
&& RB_EMPTY(&fn
->upstream
))
400 /* FEC.1: perform lsr label distribution procedure */
401 RB_FOREACH(ln
, nbr_tree
, &lde_nbrs
)
402 lde_send_labelmapping(ln
, fn
, 1);
405 LIST_FOREACH(fnh
, &fn
->nexthops
, entry
) {
406 lde_send_change_klabel(fn
, fnh
);
408 switch (fn
->fec
.type
) {
411 ln
= lde_nbr_find_by_addr(fnh
->af
, &fnh
->nexthop
);
414 ln
= lde_nbr_find_by_lsrid(fn
->fec
.u
.pwid
.lsr_id
);
423 me
= (struct lde_map
*)fec_find(&ln
->recv_map
, &fn
->fec
);
426 lde_check_mapping(&me
->map
, ln
);
432 lde_check_mapping(struct map
*map
, struct lde_nbr
*ln
)
441 lde_map2fec(map
, ln
->id
, &fec
);
445 if (lde_acl_check(ldeconf
->ipv4
.acl_label_accept_from
,
446 AF_INET
, (union ldpd_addr
*)&ln
->id
, 32) != FILTER_PERMIT
)
448 if (lde_acl_check(ldeconf
->ipv4
.acl_label_accept_for
,
449 AF_INET
, (union ldpd_addr
*)&fec
.u
.ipv4
.prefix
,
450 fec
.u
.ipv4
.prefixlen
) != FILTER_PERMIT
)
454 if (lde_acl_check(ldeconf
->ipv6
.acl_label_accept_from
,
455 AF_INET
, (union ldpd_addr
*)&ln
->id
, 32) != FILTER_PERMIT
)
457 if (lde_acl_check(ldeconf
->ipv6
.acl_label_accept_for
,
458 AF_INET6
, (union ldpd_addr
*)&fec
.u
.ipv6
.prefix
,
459 fec
.u
.ipv6
.prefixlen
) != FILTER_PERMIT
)
466 fn
= (struct fec_node
*)fec_find(&ft
, &fec
);
470 /* LMp.1: first check if we have a pending request running */
471 lre
= (struct lde_req
*)fec_find(&ln
->sent_req
, &fn
->fec
);
473 /* LMp.2: delete record of outstanding label request */
474 lde_req_del(ln
, lre
, 1);
476 /* RFC 4447 control word and status tlv negotiation */
477 if (map
->type
== MAP_TYPE_PWID
&& l2vpn_pw_negotiate(ln
, fn
, map
))
481 * LMp.3 - LMp.8: loop detection - unnecessary for frame-mode
486 me
= (struct lde_map
*)fec_find(&ln
->recv_map
, &fn
->fec
);
489 if (me
->map
.label
!= map
->label
&& lre
== NULL
) {
491 lde_send_labelrelease(ln
, fn
, NULL
, me
->map
.label
);
494 * Can not use lde_nbr_find_by_addr() because there's
495 * the possibility of multipath.
497 LIST_FOREACH(fnh
, &fn
->nexthops
, entry
) {
498 if (lde_address_find(ln
, fnh
->af
,
499 &fnh
->nexthop
) == NULL
)
502 lde_send_delete_klabel(fn
, fnh
);
503 fnh
->remote_label
= NO_LABEL
;
509 * LMp.11 - 12: consider multiple nexthops in order to
512 LIST_FOREACH(fnh
, &fn
->nexthops
, entry
) {
513 /* LMp.15: install FEC in FIB */
517 if (!lde_address_find(ln
, fnh
->af
, &fnh
->nexthop
))
520 fnh
->remote_label
= map
->label
;
521 lde_send_change_klabel(fn
, fnh
);
524 pw
= (struct l2vpn_pw
*) fn
->data
;
528 pw
->remote_group
= map
->fec
.pwid
.group_id
;
529 if (map
->flags
& F_MAP_PW_IFMTU
)
530 pw
->remote_mtu
= map
->fec
.pwid
.ifmtu
;
531 if (map
->flags
& F_MAP_PW_STATUS
)
532 pw
->remote_status
= map
->pw_status
;
533 fnh
->remote_label
= map
->label
;
534 if (l2vpn_pw_ok(pw
, fnh
))
535 lde_send_change_klabel(fn
, fnh
);
541 /* LMp.13 & LMp.16: Record the mapping from this peer */
543 me
= lde_map_add(ln
, fn
, 0);
547 * LMp.17 - LMp.27 are unnecessary since we don't need to implement
548 * loop detection. LMp.28 - LMp.30 are unnecessary because we are
554 lde_check_request(struct map
*map
, struct lde_nbr
*ln
)
561 /* wildcard label request */
562 if (map
->type
== MAP_TYPE_TYPED_WCARD
) {
563 lde_check_request_wcard(map
, ln
);
567 /* LRq.1: skip loop detection (not necessary) */
569 /* LRq.2: is there a next hop for fec? */
570 lde_map2fec(map
, ln
->id
, &fec
);
571 fn
= (struct fec_node
*)fec_find(&ft
, &fec
);
572 if (fn
== NULL
|| LIST_EMPTY(&fn
->nexthops
)) {
573 /* LRq.5: send No Route notification */
574 lde_send_notification(ln
, S_NO_ROUTE
, map
->msg_id
,
575 htons(MSG_TYPE_LABELREQUEST
));
579 /* LRq.3: is MsgSource the next hop? */
580 LIST_FOREACH(fnh
, &fn
->nexthops
, entry
) {
584 if (!lde_address_find(ln
, fnh
->af
, &fnh
->nexthop
))
587 /* LRq.4: send Loop Detected notification */
588 lde_send_notification(ln
, S_LOOP_DETECTED
, map
->msg_id
,
589 htons(MSG_TYPE_LABELREQUEST
));
596 /* LRq.6: first check if we have a pending request running */
597 lre
= (struct lde_req
*)fec_find(&ln
->recv_req
, &fn
->fec
);
599 /* LRq.7: duplicate request */
602 /* LRq.8: record label request */
603 lre
= lde_req_add(ln
, &fn
->fec
, 0);
605 lre
->msg_id
= ntohl(map
->msg_id
);
607 /* LRq.9: perform LSR label distribution */
608 lde_send_labelmapping(ln
, fn
, 1);
611 * LRq.10: do nothing (Request Never) since we use liberal
613 * LRq.11 - 12 are unnecessary since we are merging capable.
618 lde_check_request_wcard(struct map
*map
, struct lde_nbr
*ln
)
624 RB_FOREACH(f
, fec_tree
, &ft
) {
625 fn
= (struct fec_node
*)f
;
627 /* only a typed wildcard is possible here */
628 if (lde_wildcard_apply(map
, &fn
->fec
, NULL
) == 0)
631 /* LRq.2: is there a next hop for fec? */
632 if (LIST_EMPTY(&fn
->nexthops
))
635 /* LRq.6: first check if we have a pending request running */
636 lre
= (struct lde_req
*)fec_find(&ln
->recv_req
, &fn
->fec
);
638 /* LRq.7: duplicate request */
641 /* LRq.8: record label request */
642 lre
= lde_req_add(ln
, &fn
->fec
, 0);
644 lre
->msg_id
= ntohl(map
->msg_id
);
646 /* LRq.9: perform LSR label distribution */
647 lde_send_labelmapping(ln
, fn
, 1);
652 lde_check_release(struct map
*map
, struct lde_nbr
*ln
)
656 struct lde_wdraw
*lw
;
658 struct fec
*pending_map
;
660 /* wildcard label release */
661 if (map
->type
== MAP_TYPE_WILDCARD
||
662 map
->type
== MAP_TYPE_TYPED_WCARD
||
663 (map
->type
== MAP_TYPE_PWID
&& !(map
->flags
& F_MAP_PW_ID
))) {
664 lde_check_release_wcard(map
, ln
);
668 lde_map2fec(map
, ln
->id
, &fec
);
669 fn
= (struct fec_node
*)fec_find(&ft
, &fec
);
670 /* LRl.1: does FEC match a known FEC? */
674 /* LRl.6: check sent map list and remove it if available */
675 me
= (struct lde_map
*)fec_find(&ln
->sent_map
, &fn
->fec
);
676 if (me
&& (map
->label
== NO_LABEL
|| map
->label
== me
->map
.label
))
677 lde_map_del(ln
, me
, 1);
679 /* LRl.3: first check if we have a pending withdraw running */
680 lw
= (struct lde_wdraw
*)fec_find(&ln
->sent_wdraw
, &fn
->fec
);
681 if (lw
&& (map
->label
== NO_LABEL
|| map
->label
== lw
->label
)) {
682 /* LRl.4: delete record of outstanding label withdraw */
683 lde_wdraw_del(ln
, lw
);
685 /* send pending label mapping if any */
686 pending_map
= fec_find(&ln
->sent_map_pending
, &fn
->fec
);
688 lde_send_labelmapping(ln
, fn
, 1);
689 lde_map_pending_del(ln
, pending_map
);
694 * LRl.11 - 13 are unnecessary since we remove the label from
695 * forwarding/switching as soon as the FEC is unreachable.
700 lde_check_release_wcard(struct map
*map
, struct lde_nbr
*ln
)
704 struct lde_wdraw
*lw
;
706 struct fec
*pending_map
;
708 RB_FOREACH(f
, fec_tree
, &ft
) {
709 fn
= (struct fec_node
*)f
;
710 me
= (struct lde_map
*)fec_find(&ln
->sent_map
, &fn
->fec
);
712 /* LRl.1: does FEC match a known FEC? */
713 if (lde_wildcard_apply(map
, &fn
->fec
, me
) == 0)
716 /* LRl.6: check sent map list and remove it if available */
718 (map
->label
== NO_LABEL
|| map
->label
== me
->map
.label
))
719 lde_map_del(ln
, me
, 1);
721 /* LRl.3: first check if we have a pending withdraw running */
722 lw
= (struct lde_wdraw
*)fec_find(&ln
->sent_wdraw
, &fn
->fec
);
723 if (lw
&& (map
->label
== NO_LABEL
|| map
->label
== lw
->label
)) {
724 /* LRl.4: delete record of outstanding lbl withdraw */
725 lde_wdraw_del(ln
, lw
);
727 /* send pending label mapping if any */
728 pending_map
= fec_find(&ln
->sent_map_pending
, &fn
->fec
);
730 lde_send_labelmapping(ln
, fn
, 1);
731 lde_map_pending_del(ln
, pending_map
);
736 * LRl.11 - 13 are unnecessary since we remove the label from
737 * forwarding/switching as soon as the FEC is unreachable.
743 lde_check_withdraw(struct map
*map
, struct lde_nbr
*ln
)
751 /* wildcard label withdraw */
752 if (map
->type
== MAP_TYPE_WILDCARD
||
753 map
->type
== MAP_TYPE_TYPED_WCARD
||
754 (map
->type
== MAP_TYPE_PWID
&& !(map
->flags
& F_MAP_PW_ID
))) {
755 lde_check_withdraw_wcard(map
, ln
);
759 lde_map2fec(map
, ln
->id
, &fec
);
760 fn
= (struct fec_node
*)fec_find(&ft
, &fec
);
764 /* LWd.1: remove label from forwarding/switching use */
765 LIST_FOREACH(fnh
, &fn
->nexthops
, entry
) {
769 if (!lde_address_find(ln
, fnh
->af
, &fnh
->nexthop
))
773 pw
= (struct l2vpn_pw
*) fn
->data
;
780 if (map
->label
!= NO_LABEL
&& map
->label
!= fnh
->remote_label
)
783 lde_send_delete_klabel(fn
, fnh
);
784 fnh
->remote_label
= NO_LABEL
;
787 /* LWd.2: send label release */
788 lde_send_labelrelease(ln
, fn
, NULL
, map
->label
);
790 /* LWd.3: check previously received label mapping */
791 me
= (struct lde_map
*)fec_find(&ln
->recv_map
, &fn
->fec
);
792 if (me
&& (map
->label
== NO_LABEL
|| map
->label
== me
->map
.label
))
793 /* LWd.4: remove record of previously received lbl mapping */
794 lde_map_del(ln
, me
, 0);
798 lde_check_withdraw_wcard(struct map
*map
, struct lde_nbr
*ln
)
805 /* LWd.2: send label release */
806 lde_send_labelrelease(ln
, NULL
, map
, map
->label
);
808 RB_FOREACH(f
, fec_tree
, &ft
) {
809 fn
= (struct fec_node
*)f
;
810 me
= (struct lde_map
*)fec_find(&ln
->recv_map
, &fn
->fec
);
812 if (lde_wildcard_apply(map
, &fn
->fec
, me
) == 0)
815 /* LWd.1: remove label from forwarding/switching use */
816 LIST_FOREACH(fnh
, &fn
->nexthops
, entry
) {
820 if (!lde_address_find(ln
, fnh
->af
,
825 if (f
->u
.pwid
.lsr_id
.s_addr
!= ln
->id
.s_addr
)
831 if (map
->label
!= NO_LABEL
&& map
->label
!=
835 lde_send_delete_klabel(fn
, fnh
);
836 fnh
->remote_label
= NO_LABEL
;
839 /* LWd.3: check previously received label mapping */
840 if (me
&& (map
->label
== NO_LABEL
||
841 map
->label
== me
->map
.label
))
843 * LWd.4: remove record of previously received
846 lde_map_del(ln
, me
, 0);
851 lde_wildcard_apply(struct map
*wcard
, struct fec
*fec
, struct lde_map
*me
)
853 switch (wcard
->type
) {
854 case MAP_TYPE_WILDCARD
:
857 case MAP_TYPE_TYPED_WCARD
:
858 switch (wcard
->fec
.twcard
.type
) {
859 case MAP_TYPE_PREFIX
:
860 if (wcard
->fec
.twcard
.u
.prefix_af
== AF_INET
&&
861 fec
->type
!= FEC_TYPE_IPV4
)
863 if (wcard
->fec
.twcard
.u
.prefix_af
== AF_INET6
&&
864 fec
->type
!= FEC_TYPE_IPV6
)
868 if (fec
->type
!= FEC_TYPE_PWID
)
870 if (wcard
->fec
.twcard
.u
.pw_type
!= PW_TYPE_WILDCARD
&&
871 wcard
->fec
.twcard
.u
.pw_type
!= fec
->u
.pwid
.type
)
875 fatalx("lde_wildcard_apply: unexpected fec type");
879 /* RFC4447 pw-id group wildcard */
880 if (fec
->type
!= FEC_TYPE_PWID
)
882 if (fec
->u
.pwid
.type
!= wcard
->fec
.pwid
.type
)
884 if (me
== NULL
|| (me
->map
.fec
.pwid
.group_id
!=
885 wcard
->fec
.pwid
.group_id
))
889 fatalx("lde_wildcard_apply: unexpected fec type");
893 /* gabage collector timer: timer to remove dead entries from the LIB */
897 lde_gc_timer(struct thread
*thread
)
899 struct fec
*fec
, *safe
;
903 RB_FOREACH_SAFE(fec
, fec_tree
, &ft
, safe
) {
904 fn
= (struct fec_node
*) fec
;
906 if (!LIST_EMPTY(&fn
->nexthops
) ||
907 !RB_EMPTY(&fn
->downstream
) ||
908 !RB_EMPTY(&fn
->upstream
))
911 fec_remove(&ft
, &fn
->fec
);
917 log_debug("%s: %u entries removed", __func__
, count
);
919 lde_gc_start_timer();
925 lde_gc_start_timer(void)
927 THREAD_TIMER_OFF(gc_timer
);
929 thread_add_timer(master
, lde_gc_timer
, NULL
, LDE_GC_INTERVAL
,
934 lde_gc_stop_timer(void)
936 THREAD_TIMER_OFF(gc_timer
);