]> git.proxmox.com Git - mirror_frr.git/blob - ldpd/lde_lib.c
Merge pull request #657 from donaldsharp/rompapotamus
[mirror_frr.git] / ldpd / lde_lib.c
1 /* $OpenBSD$ */
2
3 /*
4 * Copyright (c) 2013, 2016 Renato Westphal <renato@openbsd.org>
5 * Copyright (c) 2009 Michele Marchetto <michele@openbsd.org>
6 *
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.
10 *
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.
18 */
19
20 #include <zebra.h>
21
22 #include "ldpd.h"
23 #include "lde.h"
24 #include "log.h"
25
26 #include "mpls.h"
27
28 static __inline int fec_compare(struct fec *, struct fec *);
29 static int lde_nbr_is_nexthop(struct fec_node *,
30 struct lde_nbr *);
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 *,
34 ifindex_t, uint8_t);
35 static void fec_nh_del(struct fec_nh *);
36
37 RB_GENERATE(fec_tree, fec, entry, fec_compare)
38
39 struct fec_tree ft = RB_INITIALIZER(&ft);
40 struct thread *gc_timer;
41
42 /* FEC tree functions */
43 void
44 fec_init(struct fec_tree *fh)
45 {
46 RB_INIT(fh);
47 }
48
49 static __inline int
50 fec_compare(struct fec *a, struct fec *b)
51 {
52 if (a->type < b->type)
53 return (-1);
54 if (a->type > b->type)
55 return (1);
56
57 switch (a->type) {
58 case FEC_TYPE_IPV4:
59 if (ntohl(a->u.ipv4.prefix.s_addr) <
60 ntohl(b->u.ipv4.prefix.s_addr))
61 return (-1);
62 if (ntohl(a->u.ipv4.prefix.s_addr) >
63 ntohl(b->u.ipv4.prefix.s_addr))
64 return (1);
65 if (a->u.ipv4.prefixlen < b->u.ipv4.prefixlen)
66 return (-1);
67 if (a->u.ipv4.prefixlen > b->u.ipv4.prefixlen)
68 return (1);
69 return (0);
70 case FEC_TYPE_IPV6:
71 if (memcmp(&a->u.ipv6.prefix, &b->u.ipv6.prefix,
72 sizeof(struct in6_addr)) < 0)
73 return (-1);
74 if (memcmp(&a->u.ipv6.prefix, &b->u.ipv6.prefix,
75 sizeof(struct in6_addr)) > 0)
76 return (1);
77 if (a->u.ipv6.prefixlen < b->u.ipv6.prefixlen)
78 return (-1);
79 if (a->u.ipv6.prefixlen > b->u.ipv6.prefixlen)
80 return (1);
81 return (0);
82 case FEC_TYPE_PWID:
83 if (a->u.pwid.type < b->u.pwid.type)
84 return (-1);
85 if (a->u.pwid.type > b->u.pwid.type)
86 return (1);
87 if (a->u.pwid.pwid < b->u.pwid.pwid)
88 return (-1);
89 if (a->u.pwid.pwid > b->u.pwid.pwid)
90 return (1);
91 if (ntohl(a->u.pwid.lsr_id.s_addr) <
92 ntohl(b->u.pwid.lsr_id.s_addr))
93 return (-1);
94 if (ntohl(a->u.pwid.lsr_id.s_addr) >
95 ntohl(b->u.pwid.lsr_id.s_addr))
96 return (1);
97 return (0);
98 }
99
100 return (-1);
101 }
102
103 struct fec *
104 fec_find(struct fec_tree *fh, struct fec *f)
105 {
106 return (RB_FIND(fec_tree, fh, f));
107 }
108
109 int
110 fec_insert(struct fec_tree *fh, struct fec *f)
111 {
112 if (RB_INSERT(fec_tree, fh, f) != NULL)
113 return (-1);
114 return (0);
115 }
116
117 int
118 fec_remove(struct fec_tree *fh, struct fec *f)
119 {
120 if (RB_REMOVE(fec_tree, fh, f) == NULL) {
121 log_warnx("%s failed for %s", __func__, log_fec(f));
122 return (-1);
123 }
124 return (0);
125 }
126
127 void
128 fec_clear(struct fec_tree *fh, void (*free_cb)(void *))
129 {
130 struct fec *f;
131
132 while ((f = RB_ROOT(fh)) != NULL) {
133 fec_remove(fh, f);
134 free_cb(f);
135 }
136 }
137
138 /* routing table functions */
139 static int
140 lde_nbr_is_nexthop(struct fec_node *fn, struct lde_nbr *ln)
141 {
142 struct fec_nh *fnh;
143
144 LIST_FOREACH(fnh, &fn->nexthops, entry)
145 if (lde_address_find(ln, fnh->af, &fnh->nexthop))
146 return (1);
147
148 return (0);
149 }
150
151 void
152 rt_dump(pid_t pid)
153 {
154 struct fec *f;
155 struct fec_node *fn;
156 struct lde_map *me;
157 static struct ctl_rt rtctl;
158
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))
163 continue;
164
165 memset(&rtctl, 0, sizeof(rtctl));
166 switch (fn->fec.type) {
167 case FEC_TYPE_IPV4:
168 rtctl.af = AF_INET;
169 rtctl.prefix.v4 = fn->fec.u.ipv4.prefix;
170 rtctl.prefixlen = fn->fec.u.ipv4.prefixlen;
171 break;
172 case FEC_TYPE_IPV6:
173 rtctl.af = AF_INET6;
174 rtctl.prefix.v6 = fn->fec.u.ipv6.prefix;
175 rtctl.prefixlen = fn->fec.u.ipv6.prefixlen;
176 break;
177 default:
178 continue;
179 }
180
181 rtctl.local_label = fn->local_label;
182 if (RB_EMPTY(&fn->downstream)) {
183 rtctl.in_use = 0;
184 rtctl.nexthop.s_addr = INADDR_ANY;
185 rtctl.remote_label = NO_LABEL;
186 rtctl.no_downstream = 1;
187 }
188 lde_imsg_compose_ldpe(IMSG_CTL_SHOW_LIB_BEGIN, 0, pid, &rtctl,
189 sizeof(rtctl));
190
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));
195 }
196
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));
203 }
204 lde_imsg_compose_ldpe(IMSG_CTL_SHOW_LIB_END, 0, pid, &rtctl,
205 sizeof(rtctl));
206 }
207 }
208
209 void
210 fec_snap(struct lde_nbr *ln)
211 {
212 struct fec *f;
213 struct fec_node *fn;
214
215 RB_FOREACH(f, fec_tree, &ft) {
216 fn = (struct fec_node *)f;
217 if (fn->local_label == NO_LABEL)
218 continue;
219
220 lde_send_labelmapping(ln, fn, 0);
221 }
222
223 lde_imsg_compose_ldpe(IMSG_MAPPING_ADD_END, ln->peerid, 0, NULL, 0);
224 }
225
226 static void
227 fec_free(void *arg)
228 {
229 struct fec_node *fn = arg;
230 struct fec_nh *fnh;
231
232 while ((fnh = LIST_FIRST(&fn->nexthops)))
233 fec_nh_del(fnh);
234 if (!RB_EMPTY(&fn->downstream))
235 log_warnx("%s: fec %s downstream list not empty", __func__,
236 log_fec(&fn->fec));
237 if (!RB_EMPTY(&fn->upstream))
238 log_warnx("%s: fec %s upstream list not empty", __func__,
239 log_fec(&fn->fec));
240
241 free(fn);
242 }
243
244 void
245 fec_tree_clear(void)
246 {
247 fec_clear(&ft, fec_free);
248 }
249
250 static struct fec_node *
251 fec_add(struct fec *fec)
252 {
253 struct fec_node *fn;
254
255 fn = calloc(1, sizeof(*fn));
256 if (fn == NULL)
257 fatal(__func__);
258
259 fn->fec = *fec;
260 fn->local_label = NO_LABEL;
261 RB_INIT(&fn->upstream);
262 RB_INIT(&fn->downstream);
263 LIST_INIT(&fn->nexthops);
264
265 if (fec_insert(&ft, &fn->fec))
266 log_warnx("failed to add %s to ft tree",
267 log_fec(&fn->fec));
268
269 return (fn);
270 }
271
272 struct fec_nh *
273 fec_nh_find(struct fec_node *fn, int af, union ldpd_addr *nexthop,
274 ifindex_t ifindex, uint8_t priority)
275 {
276 struct fec_nh *fnh;
277
278 LIST_FOREACH(fnh, &fn->nexthops, entry)
279 if (fnh->af == af &&
280 ldp_addrcmp(af, &fnh->nexthop, nexthop) == 0 &&
281 fnh->ifindex == ifindex &&
282 fnh->priority == priority)
283 return (fnh);
284
285 return (NULL);
286 }
287
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)
291 {
292 struct fec_nh *fnh;
293
294 fnh = calloc(1, sizeof(*fnh));
295 if (fnh == NULL)
296 fatal(__func__);
297
298 fnh->af = af;
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);
304
305 return (fnh);
306 }
307
308 static void
309 fec_nh_del(struct fec_nh *fnh)
310 {
311 LIST_REMOVE(fnh, entry);
312 free(fnh);
313 }
314
315 void
316 lde_kernel_insert(struct fec *fec, int af, union ldpd_addr *nexthop,
317 ifindex_t ifindex, uint8_t priority, int connected, void *data)
318 {
319 struct fec_node *fn;
320 struct fec_nh *fnh;
321
322 fn = (struct fec_node *)fec_find(&ft, fec);
323 if (fn == NULL)
324 fn = fec_add(fec);
325 if (data)
326 fn->data = data;
327
328 fnh = fec_nh_find(fn, af, nexthop, ifindex, priority);
329 if (fnh == NULL)
330 fnh = fec_nh_add(fn, af, nexthop, ifindex, priority);
331 fnh->flags |= F_FEC_NH_NEW;
332 if (connected)
333 fnh->flags |= F_FEC_NH_CONNECTED;
334 }
335
336 void
337 lde_kernel_remove(struct fec *fec, int af, union ldpd_addr *nexthop,
338 ifindex_t ifindex, uint8_t priority)
339 {
340 struct fec_node *fn;
341 struct fec_nh *fnh;
342
343 fn = (struct fec_node *)fec_find(&ft, fec);
344 if (fn == NULL)
345 /* route lost */
346 return;
347 fnh = fec_nh_find(fn, af, nexthop, ifindex, priority);
348 if (fnh == NULL)
349 /* route lost */
350 return;
351
352 lde_send_delete_klabel(fn, fnh);
353 fec_nh_del(fnh);
354 }
355
356 /*
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.
361 */
362 void
363 lde_kernel_update(struct fec *fec)
364 {
365 struct fec_node *fn;
366 struct fec_nh *fnh, *safe;
367 struct lde_nbr *ln;
368 struct lde_map *me;
369
370 fn = (struct fec_node *)fec_find(&ft, fec);
371 if (fn == NULL)
372 return;
373
374 LIST_FOREACH_SAFE(fnh, &fn->nexthops, entry, safe) {
375 if (fnh->flags & F_FEC_NH_NEW)
376 fnh->flags &= ~F_FEC_NH_NEW;
377 else {
378 lde_send_delete_klabel(fn, fnh);
379 fec_nh_del(fnh);
380 }
381 }
382
383 if (LIST_EMPTY(&fn->nexthops)) {
384 RB_FOREACH(ln, nbr_tree, &lde_nbrs)
385 lde_send_labelwithdraw(ln, fn, NULL, NULL);
386 fn->data = NULL;
387
388 /*
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
394 * is stabilized.
395 */
396 lde_gc_start_timer();
397 } else {
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);
403 }
404
405 LIST_FOREACH(fnh, &fn->nexthops, entry) {
406 lde_send_change_klabel(fn, fnh);
407
408 switch (fn->fec.type) {
409 case FEC_TYPE_IPV4:
410 case FEC_TYPE_IPV6:
411 ln = lde_nbr_find_by_addr(fnh->af, &fnh->nexthop);
412 break;
413 case FEC_TYPE_PWID:
414 ln = lde_nbr_find_by_lsrid(fn->fec.u.pwid.lsr_id);
415 break;
416 default:
417 ln = NULL;
418 break;
419 }
420
421 if (ln) {
422 /* FEC.2 */
423 me = (struct lde_map *)fec_find(&ln->recv_map, &fn->fec);
424 if (me)
425 /* FEC.5 */
426 lde_check_mapping(&me->map, ln);
427 }
428 }
429 }
430
431 void
432 lde_check_mapping(struct map *map, struct lde_nbr *ln)
433 {
434 struct fec fec;
435 struct fec_node *fn;
436 struct fec_nh *fnh;
437 struct lde_req *lre;
438 struct lde_map *me;
439 struct l2vpn_pw *pw;
440
441 lde_map2fec(map, ln->id, &fec);
442
443 switch (fec.type) {
444 case FEC_TYPE_IPV4:
445 if (lde_acl_check(ldeconf->ipv4.acl_label_accept_from,
446 AF_INET, (union ldpd_addr *)&ln->id, 32) != FILTER_PERMIT)
447 return;
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)
451 return;
452 break;
453 case FEC_TYPE_IPV6:
454 if (lde_acl_check(ldeconf->ipv6.acl_label_accept_from,
455 AF_INET, (union ldpd_addr *)&ln->id, 32) != FILTER_PERMIT)
456 return;
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)
460 return;
461 break;
462 default:
463 break;
464 }
465
466 fn = (struct fec_node *)fec_find(&ft, &fec);
467 if (fn == NULL)
468 fn = fec_add(&fec);
469
470 /* LMp.1: first check if we have a pending request running */
471 lre = (struct lde_req *)fec_find(&ln->sent_req, &fn->fec);
472 if (lre)
473 /* LMp.2: delete record of outstanding label request */
474 lde_req_del(ln, lre, 1);
475
476 /* RFC 4447 control word and status tlv negotiation */
477 if (map->type == MAP_TYPE_PWID && l2vpn_pw_negotiate(ln, fn, map))
478 return;
479
480 /*
481 * LMp.3 - LMp.8: loop detection - unnecessary for frame-mode
482 * mpls networks.
483 */
484
485 /* LMp.9 */
486 me = (struct lde_map *)fec_find(&ln->recv_map, &fn->fec);
487 if (me) {
488 /* LMp.10 */
489 if (me->map.label != map->label && lre == NULL) {
490 /* LMp.10a */
491 lde_send_labelrelease(ln, fn, NULL, me->map.label);
492
493 /*
494 * Can not use lde_nbr_find_by_addr() because there's
495 * the possibility of multipath.
496 */
497 LIST_FOREACH(fnh, &fn->nexthops, entry) {
498 if (lde_address_find(ln, fnh->af,
499 &fnh->nexthop) == NULL)
500 continue;
501
502 lde_send_delete_klabel(fn, fnh);
503 fnh->remote_label = NO_LABEL;
504 }
505 }
506 }
507
508 /*
509 * LMp.11 - 12: consider multiple nexthops in order to
510 * support multipath
511 */
512 LIST_FOREACH(fnh, &fn->nexthops, entry) {
513 /* LMp.15: install FEC in FIB */
514 switch (fec.type) {
515 case FEC_TYPE_IPV4:
516 case FEC_TYPE_IPV6:
517 if (!lde_address_find(ln, fnh->af, &fnh->nexthop))
518 continue;
519
520 fnh->remote_label = map->label;
521 lde_send_change_klabel(fn, fnh);
522 break;
523 case FEC_TYPE_PWID:
524 pw = (struct l2vpn_pw *) fn->data;
525 if (pw == NULL)
526 continue;
527
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);
536 break;
537 default:
538 break;
539 }
540 }
541 /* LMp.13 & LMp.16: Record the mapping from this peer */
542 if (me == NULL)
543 me = lde_map_add(ln, fn, 0);
544 me->map = *map;
545
546 /*
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
549 * merging capable.
550 */
551 }
552
553 void
554 lde_check_request(struct map *map, struct lde_nbr *ln)
555 {
556 struct fec fec;
557 struct lde_req *lre;
558 struct fec_node *fn;
559 struct fec_nh *fnh;
560
561 /* wildcard label request */
562 if (map->type == MAP_TYPE_TYPED_WCARD) {
563 lde_check_request_wcard(map, ln);
564 return;
565 }
566
567 /* LRq.1: skip loop detection (not necessary) */
568
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));
576 return;
577 }
578
579 /* LRq.3: is MsgSource the next hop? */
580 LIST_FOREACH(fnh, &fn->nexthops, entry) {
581 switch (fec.type) {
582 case FEC_TYPE_IPV4:
583 case FEC_TYPE_IPV6:
584 if (!lde_address_find(ln, fnh->af, &fnh->nexthop))
585 continue;
586
587 /* LRq.4: send Loop Detected notification */
588 lde_send_notification(ln, S_LOOP_DETECTED, map->msg_id,
589 htons(MSG_TYPE_LABELREQUEST));
590 return;
591 default:
592 break;
593 }
594 }
595
596 /* LRq.6: first check if we have a pending request running */
597 lre = (struct lde_req *)fec_find(&ln->recv_req, &fn->fec);
598 if (lre != NULL)
599 /* LRq.7: duplicate request */
600 return;
601
602 /* LRq.8: record label request */
603 lre = lde_req_add(ln, &fn->fec, 0);
604 if (lre != NULL)
605 lre->msg_id = ntohl(map->msg_id);
606
607 /* LRq.9: perform LSR label distribution */
608 lde_send_labelmapping(ln, fn, 1);
609
610 /*
611 * LRq.10: do nothing (Request Never) since we use liberal
612 * label retention.
613 * LRq.11 - 12 are unnecessary since we are merging capable.
614 */
615 }
616
617 void
618 lde_check_request_wcard(struct map *map, struct lde_nbr *ln)
619 {
620 struct fec *f;
621 struct fec_node *fn;
622 struct lde_req *lre;
623
624 RB_FOREACH(f, fec_tree, &ft) {
625 fn = (struct fec_node *)f;
626
627 /* only a typed wildcard is possible here */
628 if (lde_wildcard_apply(map, &fn->fec, NULL) == 0)
629 continue;
630
631 /* LRq.2: is there a next hop for fec? */
632 if (LIST_EMPTY(&fn->nexthops))
633 continue;
634
635 /* LRq.6: first check if we have a pending request running */
636 lre = (struct lde_req *)fec_find(&ln->recv_req, &fn->fec);
637 if (lre != NULL)
638 /* LRq.7: duplicate request */
639 continue;
640
641 /* LRq.8: record label request */
642 lre = lde_req_add(ln, &fn->fec, 0);
643 if (lre != NULL)
644 lre->msg_id = ntohl(map->msg_id);
645
646 /* LRq.9: perform LSR label distribution */
647 lde_send_labelmapping(ln, fn, 1);
648 }
649 }
650
651 void
652 lde_check_release(struct map *map, struct lde_nbr *ln)
653 {
654 struct fec fec;
655 struct fec_node *fn;
656 struct lde_wdraw *lw;
657 struct lde_map *me;
658 struct fec *pending_map;
659
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);
665 return;
666 }
667
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? */
671 if (fn == NULL)
672 return;
673
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);
678
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);
684
685 /* send pending label mapping if any */
686 pending_map = fec_find(&ln->sent_map_pending, &fn->fec);
687 if (pending_map) {
688 lde_send_labelmapping(ln, fn, 1);
689 lde_map_pending_del(ln, pending_map);
690 }
691 }
692
693 /*
694 * LRl.11 - 13 are unnecessary since we remove the label from
695 * forwarding/switching as soon as the FEC is unreachable.
696 */
697 }
698
699 void
700 lde_check_release_wcard(struct map *map, struct lde_nbr *ln)
701 {
702 struct fec *f;
703 struct fec_node *fn;
704 struct lde_wdraw *lw;
705 struct lde_map *me;
706 struct fec *pending_map;
707
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);
711
712 /* LRl.1: does FEC match a known FEC? */
713 if (lde_wildcard_apply(map, &fn->fec, me) == 0)
714 continue;
715
716 /* LRl.6: check sent map list and remove it if available */
717 if (me &&
718 (map->label == NO_LABEL || map->label == me->map.label))
719 lde_map_del(ln, me, 1);
720
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);
726
727 /* send pending label mapping if any */
728 pending_map = fec_find(&ln->sent_map_pending, &fn->fec);
729 if (pending_map) {
730 lde_send_labelmapping(ln, fn, 1);
731 lde_map_pending_del(ln, pending_map);
732 }
733 }
734
735 /*
736 * LRl.11 - 13 are unnecessary since we remove the label from
737 * forwarding/switching as soon as the FEC is unreachable.
738 */
739 }
740 }
741
742 void
743 lde_check_withdraw(struct map *map, struct lde_nbr *ln)
744 {
745 struct fec fec;
746 struct fec_node *fn;
747 struct fec_nh *fnh;
748 struct lde_map *me;
749 struct l2vpn_pw *pw;
750
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);
756 return;
757 }
758
759 lde_map2fec(map, ln->id, &fec);
760 fn = (struct fec_node *)fec_find(&ft, &fec);
761 if (fn == NULL)
762 fn = fec_add(&fec);
763
764 /* LWd.1: remove label from forwarding/switching use */
765 LIST_FOREACH(fnh, &fn->nexthops, entry) {
766 switch (fec.type) {
767 case FEC_TYPE_IPV4:
768 case FEC_TYPE_IPV6:
769 if (!lde_address_find(ln, fnh->af, &fnh->nexthop))
770 continue;
771 break;
772 case FEC_TYPE_PWID:
773 pw = (struct l2vpn_pw *) fn->data;
774 if (pw == NULL)
775 continue;
776 break;
777 default:
778 break;
779 }
780 if (map->label != NO_LABEL && map->label != fnh->remote_label)
781 continue;
782
783 lde_send_delete_klabel(fn, fnh);
784 fnh->remote_label = NO_LABEL;
785 }
786
787 /* LWd.2: send label release */
788 lde_send_labelrelease(ln, fn, NULL, map->label);
789
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);
795 }
796
797 void
798 lde_check_withdraw_wcard(struct map *map, struct lde_nbr *ln)
799 {
800 struct fec *f;
801 struct fec_node *fn;
802 struct fec_nh *fnh;
803 struct lde_map *me;
804
805 /* LWd.2: send label release */
806 lde_send_labelrelease(ln, NULL, map, map->label);
807
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);
811
812 if (lde_wildcard_apply(map, &fn->fec, me) == 0)
813 continue;
814
815 /* LWd.1: remove label from forwarding/switching use */
816 LIST_FOREACH(fnh, &fn->nexthops, entry) {
817 switch (f->type) {
818 case FEC_TYPE_IPV4:
819 case FEC_TYPE_IPV6:
820 if (!lde_address_find(ln, fnh->af,
821 &fnh->nexthop))
822 continue;
823 break;
824 case FEC_TYPE_PWID:
825 if (f->u.pwid.lsr_id.s_addr != ln->id.s_addr)
826 continue;
827 break;
828 default:
829 break;
830 }
831 if (map->label != NO_LABEL && map->label !=
832 fnh->remote_label)
833 continue;
834
835 lde_send_delete_klabel(fn, fnh);
836 fnh->remote_label = NO_LABEL;
837 }
838
839 /* LWd.3: check previously received label mapping */
840 if (me && (map->label == NO_LABEL ||
841 map->label == me->map.label))
842 /*
843 * LWd.4: remove record of previously received
844 * label mapping
845 */
846 lde_map_del(ln, me, 0);
847 }
848 }
849
850 int
851 lde_wildcard_apply(struct map *wcard, struct fec *fec, struct lde_map *me)
852 {
853 switch (wcard->type) {
854 case MAP_TYPE_WILDCARD:
855 /* full wildcard */
856 return (1);
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)
862 return (0);
863 if (wcard->fec.twcard.u.prefix_af == AF_INET6 &&
864 fec->type != FEC_TYPE_IPV6)
865 return (0);
866 return (1);
867 case MAP_TYPE_PWID:
868 if (fec->type != FEC_TYPE_PWID)
869 return (0);
870 if (wcard->fec.twcard.u.pw_type != PW_TYPE_WILDCARD &&
871 wcard->fec.twcard.u.pw_type != fec->u.pwid.type)
872 return (0);
873 return (1);
874 default:
875 fatalx("lde_wildcard_apply: unexpected fec type");
876 }
877 break;
878 case MAP_TYPE_PWID:
879 /* RFC4447 pw-id group wildcard */
880 if (fec->type != FEC_TYPE_PWID)
881 return (0);
882 if (fec->u.pwid.type != wcard->fec.pwid.type)
883 return (0);
884 if (me == NULL || (me->map.fec.pwid.group_id !=
885 wcard->fec.pwid.group_id))
886 return (0);
887 return (1);
888 default:
889 fatalx("lde_wildcard_apply: unexpected fec type");
890 }
891 }
892
893 /* gabage collector timer: timer to remove dead entries from the LIB */
894
895 /* ARGSUSED */
896 int
897 lde_gc_timer(struct thread *thread)
898 {
899 struct fec *fec, *safe;
900 struct fec_node *fn;
901 int count = 0;
902
903 RB_FOREACH_SAFE(fec, fec_tree, &ft, safe) {
904 fn = (struct fec_node *) fec;
905
906 if (!LIST_EMPTY(&fn->nexthops) ||
907 !RB_EMPTY(&fn->downstream) ||
908 !RB_EMPTY(&fn->upstream))
909 continue;
910
911 fec_remove(&ft, &fn->fec);
912 free(fn);
913 count++;
914 }
915
916 if (count > 0)
917 log_debug("%s: %u entries removed", __func__, count);
918
919 lde_gc_start_timer();
920
921 return (0);
922 }
923
924 void
925 lde_gc_start_timer(void)
926 {
927 THREAD_TIMER_OFF(gc_timer);
928 gc_timer = NULL;
929 thread_add_timer(master, lde_gc_timer, NULL, LDE_GC_INTERVAL,
930 &gc_timer);
931 }
932
933 void
934 lde_gc_stop_timer(void)
935 {
936 THREAD_TIMER_OFF(gc_timer);
937 }