-
Notifications
You must be signed in to change notification settings - Fork 3
/
rde_dual.c
1323 lines (1111 loc) · 32.6 KB
/
rde_dual.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
/* $OpenBSD$ */
/*
* Copyright (c) 2015 Renato Westphal <[email protected]>
*
* 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 <sys/types.h>
#include <stdlib.h>
#include <string.h>
#include "eigrpd.h"
#include "eigrpe.h"
#include "rde.h"
#include "log.h"
static int dual_fsm(struct rt_node *, enum dual_event);
static __inline int rt_compare(struct rt_node *, struct rt_node *);
static struct rt_node *rt_find(struct eigrp *, struct rinfo *);
static struct rt_node *rt_new(struct eigrp *, struct rinfo *);
static struct eigrp_route *route_find(struct rde_nbr *, struct rt_node *);
static struct eigrp_route *route_new(struct rt_node *, struct rde_nbr *,
struct rinfo *);
static void route_del(struct rt_node *, struct eigrp_route *);
static uint32_t safe_sum_uint32(uint32_t, uint32_t);
static uint32_t safe_mul_uint32(uint32_t, uint32_t);
static uint32_t route_composite_metric(uint8_t *, uint32_t, uint32_t,
uint8_t, uint8_t);
static void route_update_metrics(struct eigrp *,
struct eigrp_route *, struct rinfo *);
static void reply_outstanding_add(struct rt_node *,
struct rde_nbr *);
static struct reply_node *reply_outstanding_find(struct rt_node *,
struct rde_nbr *);
static void reply_outstanding_remove(struct reply_node *);
static void reply_active_timer(int, short, void *);
static void reply_active_start_timer(struct reply_node *);
static void reply_active_stop_timer(struct reply_node *);
static void reply_sia_timer(int, short, void *);
static void reply_sia_start_timer(struct reply_node *);
static void reply_sia_stop_timer(struct reply_node *);
static void rinfo_fill_infinite(struct rt_node *, enum route_type,
struct rinfo *);
static void rt_update_fib(struct rt_node *);
static void rt_set_successor(struct rt_node *,
struct eigrp_route *);
static struct eigrp_route *rt_get_successor_fc(struct rt_node *);
static void rde_send_update(struct eigrp_iface *, struct rinfo *);
static void rde_send_update_all(struct rt_node *, struct rinfo *);
static void rde_send_query(struct eigrp_iface *, struct rinfo *,
int);
static void rde_send_siaquery(struct rde_nbr *, struct rinfo *);
static void rde_send_query_all(struct eigrp *, struct rt_node *,
int);
static void rde_send_reply(struct rde_nbr *, struct rinfo *, int);
static void rde_last_reply(struct rt_node *);
static __inline int rde_nbr_compare(struct rde_nbr *, struct rde_nbr *);
RB_GENERATE(rt_tree, rt_node, entry, rt_compare)
RB_GENERATE(rde_nbr_head, rde_nbr, entry, rde_nbr_compare)
struct rde_nbr_head rde_nbrs = RB_INITIALIZER(&rde_nbrs);
/*
* NOTE: events that don't cause a state transition aren't triggered to avoid
* too much verbosity and are here mostly for illustration purposes.
*/
static struct {
int state;
enum dual_event event;
int new_state;
} dual_fsm_tbl[] = {
/* current state event resulting state */
/* Passive */
{DUAL_STA_PASSIVE, DUAL_EVT_1, 0},
{DUAL_STA_PASSIVE, DUAL_EVT_2, 0},
{DUAL_STA_PASSIVE, DUAL_EVT_3, DUAL_STA_ACTIVE3},
{DUAL_STA_PASSIVE, DUAL_EVT_4, DUAL_STA_ACTIVE1},
/* Active Oij=0 */
{DUAL_STA_ACTIVE0, DUAL_EVT_5, DUAL_STA_ACTIVE2},
{DUAL_STA_ACTIVE0, DUAL_EVT_11, DUAL_STA_ACTIVE1},
{DUAL_STA_ACTIVE0, DUAL_EVT_14, DUAL_STA_PASSIVE},
/* Active Oij=1 */
{DUAL_STA_ACTIVE1, DUAL_EVT_5, DUAL_STA_ACTIVE2},
{DUAL_STA_ACTIVE1, DUAL_EVT_9, DUAL_STA_ACTIVE0},
{DUAL_STA_ACTIVE1, DUAL_EVT_15, DUAL_STA_PASSIVE},
/* Active Oij=2 */
{DUAL_STA_ACTIVE2, DUAL_EVT_12, DUAL_STA_ACTIVE3},
{DUAL_STA_ACTIVE2, DUAL_EVT_16, DUAL_STA_PASSIVE},
/* Active Oij=3 */
{DUAL_STA_ACTIVE3, DUAL_EVT_10, DUAL_STA_ACTIVE2},
{DUAL_STA_ACTIVE3, DUAL_EVT_13, DUAL_STA_PASSIVE},
/* Active (all) */
{DUAL_STA_ACTIVE_ALL, DUAL_EVT_6, 0},
{DUAL_STA_ACTIVE_ALL, DUAL_EVT_7, 0},
{DUAL_STA_ACTIVE_ALL, DUAL_EVT_8, 0},
/* sentinel */
{-1, 0, 0},
};
static const char * const dual_event_names[] = {
"DUAL_EVT_1",
"DUAL_EVT_2",
"DUAL_EVT_3",
"DUAL_EVT_4",
"DUAL_EVT_5",
"DUAL_EVT_6",
"DUAL_EVT_7",
"DUAL_EVT_8",
"DUAL_EVT_9",
"DUAL_EVT_10",
"DUAL_EVT_11",
"DUAL_EVT_12",
"DUAL_EVT_13",
"DUAL_EVT_14",
"DUAL_EVT_15",
"DUAL_EVT_16"
};
static int
dual_fsm(struct rt_node *rn, enum dual_event event)
{
int old_state;
int new_state = 0;
int i;
old_state = rn->state;
for (i = 0; dual_fsm_tbl[i].state != -1; i++)
if ((dual_fsm_tbl[i].state & old_state) &&
(dual_fsm_tbl[i].event == event)) {
new_state = dual_fsm_tbl[i].new_state;
break;
}
if (dual_fsm_tbl[i].state == -1) {
/* event outside of the defined fsm, ignore it. */
log_warnx("%s: route %s, event %s not expected in state %s",
__func__, log_prefix(rn), dual_event_names[event],
dual_state_name(old_state));
return (0);
}
if (new_state != 0)
rn->state = new_state;
if (old_state != rn->state) {
log_debug("%s: event %s changing state for prefix %s "
"from %s to %s", __func__, dual_event_names[event],
log_prefix(rn), dual_state_name(old_state),
dual_state_name(rn->state));
if (old_state == DUAL_STA_PASSIVE ||
new_state == DUAL_STA_PASSIVE)
rt_update_fib(rn);
}
return (0);
}
static __inline int
rt_compare(struct rt_node *a, struct rt_node *b)
{
int addrcmp;
addrcmp = eigrp_addrcmp(a->eigrp->af, &a->prefix, &b->prefix);
if (addrcmp != 0)
return (addrcmp);
if (a->prefixlen < b->prefixlen)
return (-1);
if (a->prefixlen > b->prefixlen)
return (1);
return (0);
}
static struct rt_node *
rt_find(struct eigrp *eigrp, struct rinfo *ri)
{
struct rt_node rn;
rn.eigrp = eigrp;
rn.prefix = ri->prefix;
rn.prefixlen = ri->prefixlen;
return (RB_FIND(rt_tree, &eigrp->topology, &rn));
}
static struct rt_node *
rt_new(struct eigrp *eigrp, struct rinfo *ri)
{
struct rt_node *rn;
if ((rn = calloc(1, sizeof(*rn))) == NULL)
fatal("rt_new");
rn->eigrp = eigrp;
rn->prefix = ri->prefix;
rn->prefixlen = ri->prefixlen;
rn->state = DUAL_STA_PASSIVE;
TAILQ_INIT(&rn->routes);
TAILQ_INIT(&rn->rijk);
rt_set_successor(rn, NULL);
if (RB_INSERT(rt_tree, &eigrp->topology, rn) != NULL) {
log_warnx("%s failed for %s", __func__, log_prefix(rn));
free(rn);
return (NULL);
}
log_debug("%s: prefix %s", __func__, log_prefix(rn));
return (rn);
}
void
rt_del(struct rt_node *rn)
{
struct eigrp_route *route;
struct reply_node *reply;
log_debug("%s: prefix %s", __func__, log_prefix(rn));
while ((reply = TAILQ_FIRST(&rn->rijk)) != NULL)
reply_outstanding_remove(reply);
while ((route = TAILQ_FIRST(&rn->routes)) != NULL)
route_del(rn, route);
RB_REMOVE(rt_tree, &rn->eigrp->topology, rn);
free(rn);
}
static struct eigrp_route *
route_find(struct rde_nbr *nbr, struct rt_node *rn)
{
struct eigrp_route *route;
TAILQ_FOREACH(route, &rn->routes, entry)
if (route->nbr == nbr)
return (route);
return (NULL);
}
static struct eigrp_route *
route_new(struct rt_node *rn, struct rde_nbr *nbr, struct rinfo *ri)
{
struct eigrp *eigrp = rn->eigrp;
struct eigrp_route *route, *tmp;
if ((route = calloc(1, sizeof(*route))) == NULL)
fatal("route_new");
route->nbr = nbr;
route->type = ri->type;
if (eigrp_addrisset(eigrp->af, &ri->nexthop))
route->nexthop = ri->nexthop;
else
route->nexthop = nbr->addr;
route_update_metrics(eigrp, route, ri);
/* order by nexthop */
TAILQ_FOREACH(tmp, &rn->routes, entry)
if (eigrp_addrcmp(eigrp->af, &tmp->nexthop,
&route->nexthop) > 0)
break;
if (tmp)
TAILQ_INSERT_BEFORE(tmp, route, entry);
else
TAILQ_INSERT_TAIL(&rn->routes, route, entry);
log_debug("%s: prefix %s via %s distance (%u/%u)", __func__,
log_prefix(rn), log_route_origin(eigrp->af, route->nbr),
route->distance, route->rdistance);
return (route);
}
static void
route_del(struct rt_node *rn, struct eigrp_route *route)
{
struct eigrp *eigrp = rn->eigrp;
log_debug("%s: prefix %s via %s", __func__, log_prefix(rn),
log_route_origin(eigrp->af, route->nbr));
if (route->flags & F_EIGRP_ROUTE_INSTALLED)
rde_send_delete_kroute(rn, route);
TAILQ_REMOVE(&rn->routes, route, entry);
free(route);
}
static uint32_t
safe_sum_uint32(uint32_t a, uint32_t b)
{
uint64_t total;
total = (uint64_t) a + (uint64_t) b;
if (total >> 32)
return ((uint32_t )(~0));
return ((uint32_t) total);
}
static uint32_t
safe_mul_uint32(uint32_t a, uint32_t b)
{
uint64_t total;
total = (uint64_t) a * (uint64_t) b;
if (total >> 32)
return ((uint32_t )(~0));
return ((uint32_t) total);
}
uint32_t
eigrp_composite_delay(uint32_t delay)
{
/* cheap overflow protection */
delay = min(delay, (1 << 24) - 1);
return (delay * EIGRP_SCALING_FACTOR);
}
uint32_t
eigrp_real_delay(uint32_t delay)
{
return (delay / EIGRP_SCALING_FACTOR);
}
uint32_t
eigrp_composite_bandwidth(uint32_t bandwidth)
{
/* truncate before applying the scaling factor */
bandwidth = 10000000 / bandwidth;
return (EIGRP_SCALING_FACTOR * bandwidth);
}
uint32_t
eigrp_real_bandwidth(uint32_t bandwidth)
{
/*
* apply the scaling factor before the division and only then truncate.
* this is to keep consistent with what cisco does.
*/
return ((EIGRP_SCALING_FACTOR * (uint32_t)10000000) / bandwidth);
}
static uint32_t
route_composite_metric(uint8_t *kvalues, uint32_t delay, uint32_t bandwidth,
uint8_t load, uint8_t reliability)
{
uint64_t distance;
uint32_t operand1, operand2, operand3;
double operand4;
/*
* Need to apply the scaling factor before any division to avoid
* losing information from truncation.
*/
operand1 = safe_mul_uint32(kvalues[0] * EIGRP_SCALING_FACTOR,
10000000 / bandwidth);
operand2 = safe_mul_uint32(kvalues[1] * EIGRP_SCALING_FACTOR,
10000000 / bandwidth) / (256 - load);
operand3 = safe_mul_uint32(kvalues[2] * EIGRP_SCALING_FACTOR, delay);
distance = (uint64_t) operand1 + (uint64_t) operand2 +
(uint64_t) operand3;
/* if K5 is set to zero, the last term of the formula is not used */
if (kvalues[4] != 0) {
operand4 = (double) kvalues[4] / (reliability + kvalues[3]);
/* no risk of overflow (64 bits), operand4 can be at most 255 */
distance *= operand4;
}
/* overflow protection */
if (distance >> 32)
distance = ((uint32_t )(~0));
return ((uint32_t) distance);
}
static void
route_update_metrics(struct eigrp *eigrp, struct eigrp_route *route,
struct rinfo *ri)
{
struct eigrp_iface *ei = route->nbr->ei;
uint32_t delay, bandwidth;
int mtu;
route->metric = ri->metric;
route->emetric = ri->emetric;
route->flags |= F_EIGRP_ROUTE_M_CHANGED;
delay = eigrp_real_delay(route->metric.delay);
bandwidth = eigrp_real_bandwidth(route->metric.bandwidth);
if (route->nbr->flags & F_RDE_NBR_SELF)
route->rdistance = 0;
else {
route->rdistance = route_composite_metric(eigrp->kvalues,
delay, bandwidth, route->metric.load,
route->metric.reliability);
/* update the delay */
delay = safe_sum_uint32(delay, ei->delay);
route->metric.delay = eigrp_composite_delay(delay);
/* update the bandwidth */
bandwidth = min(bandwidth, ei->bandwidth);
route->metric.bandwidth = eigrp_composite_bandwidth(bandwidth);
/* update the mtu */
mtu = min(metric_decode_mtu(route->metric.mtu), ei->iface->mtu);
metric_encode_mtu(route->metric.mtu, mtu);
/* update the hop count */
if (route->metric.hop_count < UINT8_MAX)
route->metric.hop_count++;
}
route->distance = route_composite_metric(eigrp->kvalues, delay,
bandwidth, DEFAULT_LOAD, DEFAULT_RELIABILITY);
}
static void
reply_outstanding_add(struct rt_node *rn, struct rde_nbr *nbr)
{
struct reply_node *reply;
if ((reply = calloc(1, sizeof(*reply))) == NULL)
fatal("reply_outstanding_add");
evtimer_set(&reply->ev_active_timeout, reply_active_timer, reply);
evtimer_set(&reply->ev_sia_timeout, reply_sia_timer, reply);
reply->siaquery_sent = 0;
reply->siareply_recv = 0;
reply->rn = rn;
reply->nbr = nbr;
TAILQ_INSERT_TAIL(&rn->rijk, reply, rn_entry);
TAILQ_INSERT_TAIL(&nbr->rijk, reply, nbr_entry);
if (rn->eigrp->active_timeout > 0) {
reply_active_start_timer(reply);
reply_sia_start_timer(reply);
}
}
static struct reply_node *
reply_outstanding_find(struct rt_node *rn, struct rde_nbr *nbr)
{
struct reply_node *reply;
TAILQ_FOREACH(reply, &rn->rijk, rn_entry)
if (reply->nbr == nbr)
return (reply);
return (NULL);
}
static void
reply_outstanding_remove(struct reply_node *reply)
{
reply_active_stop_timer(reply);
reply_sia_stop_timer(reply);
TAILQ_REMOVE(&reply->rn->rijk, reply, rn_entry);
TAILQ_REMOVE(&reply->nbr->rijk, reply, nbr_entry);
free(reply);
}
/* ARGSUSED */
static void
reply_active_timer(int fd, short event, void *arg)
{
struct reply_node *reply = arg;
struct rde_nbr *nbr = reply->nbr;
log_debug("%s: neighbor %s is stuck in active", __func__,
log_addr(nbr->eigrp->af, &nbr->addr));
rde_nbr_del(reply->nbr, 1);
}
static void
reply_active_start_timer(struct reply_node *reply)
{
struct eigrp *eigrp = reply->nbr->eigrp;
struct timeval tv;
timerclear(&tv);
tv.tv_sec = eigrp->active_timeout * 60;
if (evtimer_add(&reply->ev_active_timeout, &tv) == -1)
fatal("reply_active_start_timer");
}
static void
reply_active_stop_timer(struct reply_node *reply)
{
if (evtimer_pending(&reply->ev_active_timeout, NULL) &&
evtimer_del(&reply->ev_active_timeout) == -1)
fatal("reply_active_stop_timer");
}
/* ARGSUSED */
static void
reply_sia_timer(int fd, short event, void *arg)
{
struct reply_node *reply = arg;
struct rde_nbr *nbr = reply->nbr;
struct rt_node *rn = reply->rn;
struct rinfo ri;
log_debug("%s: nbr %s prefix %s", __func__, log_addr(nbr->eigrp->af,
&nbr->addr), log_prefix(rn));
if (reply->siaquery_sent > 0 && reply->siareply_recv == 0) {
log_debug("%s: neighbor %s is stuck in active", __func__,
log_addr(nbr->eigrp->af, &nbr->addr));
rde_nbr_del(nbr, 1);
return;
}
/*
* draft-savage-eigrp-04 - Section 4.4.1.1:
* "Up to three SIA-QUERY packets for a specific destination may
* be sent, each at a value of one-half the ACTIVE time, so long
* as each are successfully acknowledged and met with an SIA-REPLY".
*/
if (reply->siaquery_sent >= 3)
return;
reply->siaquery_sent++;
reply->siareply_recv = 0;
/* restart sia and active timeouts */
reply_sia_start_timer(reply);
reply_active_start_timer(reply);
/* send an sia-query */
rinfo_fill_successor(rn, &ri);
ri.metric.flags |= F_METRIC_ACTIVE;
rde_send_siaquery(nbr, &ri);
}
static void
reply_sia_start_timer(struct reply_node *reply)
{
struct eigrp *eigrp = reply->nbr->eigrp;
struct timeval tv;
/*
* draft-savage-eigrp-04 - Section 4.4.1.1:
* "The SIA-QUERY packet SHOULD be sent on a per-destination basis
* at one-half of the ACTIVE timeout period."
*/
timerclear(&tv);
tv.tv_sec = (eigrp->active_timeout * 60) / 2;
if (evtimer_add(&reply->ev_sia_timeout, &tv) == -1)
fatal("reply_sia_start_timer");
}
static void
reply_sia_stop_timer(struct reply_node *reply)
{
if (evtimer_pending(&reply->ev_sia_timeout, NULL) &&
evtimer_del(&reply->ev_sia_timeout) == -1)
fatal("reply_sia_stop_timer");
}
void
rinfo_fill_successor(struct rt_node *rn, struct rinfo *ri)
{
if (rn->successor.nbr == NULL) {
rinfo_fill_infinite(rn, EIGRP_ROUTE_INTERNAL, ri);
return;
}
memset(ri, 0, sizeof(*ri));
ri->af = rn->eigrp->af;
ri->type = rn->successor.type;
ri->prefix = rn->prefix;
ri->prefixlen = rn->prefixlen;
ri->metric = rn->successor.metric;
if (ri->type == EIGRP_ROUTE_EXTERNAL)
ri->emetric = rn->successor.emetric;
}
static void
rinfo_fill_infinite(struct rt_node *rn, enum route_type type, struct rinfo *ri)
{
memset(ri, 0, sizeof(*ri));
ri->af = rn->eigrp->af;
ri->type = type;
ri->prefix = rn->prefix;
ri->prefixlen = rn->prefixlen;
ri->metric.delay = EIGRP_INFINITE_METRIC;
}
static void
rt_update_fib(struct rt_node *rn)
{
struct eigrp *eigrp = rn->eigrp;
uint8_t maximum_paths = eigrp->maximum_paths;
uint8_t variance = eigrp->variance;
int installed = 0;
struct eigrp_route *route;
if (rn->state == DUAL_STA_PASSIVE) {
/* no multipath for attached networks. */
if (rn->successor.nbr &&
(rn->successor.nbr->flags & F_RDE_NBR_LOCAL))
return;
TAILQ_FOREACH(route, &rn->routes, entry) {
/* skip redistributed routes */
if (route->nbr->flags & F_RDE_NBR_REDIST)
continue;
/*
* Only feasible successors and the successor itself
* are elegible to be installed.
*/
if (route->rdistance >= rn->successor.fdistance)
goto uninstall;
if (route->distance >
(rn->successor.fdistance * variance))
goto uninstall;
if (installed >= maximum_paths)
goto uninstall;
installed++;
if ((route->flags & F_EIGRP_ROUTE_INSTALLED) &&
!(route->flags & F_EIGRP_ROUTE_M_CHANGED))
continue;
rde_send_change_kroute(rn, route);
continue;
uninstall:
if (route->flags & F_EIGRP_ROUTE_INSTALLED)
rde_send_delete_kroute(rn, route);
}
} else {
TAILQ_FOREACH(route, &rn->routes, entry)
if (route->flags & F_EIGRP_ROUTE_INSTALLED)
rde_send_delete_kroute(rn, route);
}
}
static void
rt_set_successor(struct rt_node *rn, struct eigrp_route *successor)
{
struct eigrp *eigrp = rn->eigrp;
struct eigrp_iface *ei;
struct summary_addr *summary;
if (successor == NULL) {
rn->successor.nbr = NULL;
rn->successor.type = 0;
rn->successor.fdistance = EIGRP_INFINITE_METRIC;
rn->successor.rdistance = EIGRP_INFINITE_METRIC;
memset(&rn->successor.metric, 0,
sizeof(rn->successor.metric));
rn->successor.metric.delay = EIGRP_INFINITE_METRIC;
memset(&rn->successor.emetric, 0,
sizeof(rn->successor.emetric));
} else {
rn->successor.nbr = successor->nbr;
rn->successor.type = successor->type;
rn->successor.fdistance = successor->distance;
rn->successor.rdistance = successor->rdistance;
rn->successor.metric = successor->metric;
rn->successor.emetric = successor->emetric;
}
TAILQ_FOREACH(ei, &eigrp->ei_list, e_entry) {
summary = rde_summary_check(ei, &rn->prefix, rn->prefixlen);
if (summary)
rt_summary_set(eigrp, summary, &rn->successor.metric);
}
}
static struct eigrp_route *
rt_get_successor_fc(struct rt_node *rn)
{
struct eigrp_route *route, *successor = NULL;
uint32_t distance = EIGRP_INFINITE_METRIC;
int external_only = 1;
TAILQ_FOREACH(route, &rn->routes, entry)
if (route->type == EIGRP_ROUTE_INTERNAL) {
/*
* connected routes should always be prefered over
* received routes independent of the metric.
*/
if (route->nbr->flags & F_RDE_NBR_LOCAL)
return (route);
external_only = 0;
}
TAILQ_FOREACH(route, &rn->routes, entry) {
/*
* draft-savage-eigrp-04 - Section 5.4.7:
* "Internal routes MUST be prefered over external routes
* independent of the metric."
*/
if (route->type == EIGRP_ROUTE_EXTERNAL && !external_only)
continue;
/* pick the best route that meets the feasibility condition */
if (route->rdistance < rn->successor.fdistance &&
route->distance < distance) {
distance = route->distance;
successor = route;
}
}
return (successor);
}
struct summary_addr *
rde_summary_check(struct eigrp_iface *ei, union eigrpd_addr *prefix,
uint8_t prefixlen)
{
struct summary_addr *summary;
TAILQ_FOREACH(summary, &ei->summary_list, entry) {
/* do not filter the summary itself */
if (summary->prefixlen == prefixlen &&
!eigrp_addrcmp(ei->eigrp->af, prefix, &summary->prefix))
return (NULL);
if (summary->prefixlen <= prefixlen &&
!eigrp_prefixcmp(ei->eigrp->af, prefix, &summary->prefix,
summary->prefixlen))
return (summary);
}
return (NULL);
}
static void
rde_send_update(struct eigrp_iface *ei, struct rinfo *ri)
{
if (ri->metric.hop_count >= ei->eigrp->maximum_hops ||
rde_summary_check(ei, &ri->prefix, ri->prefixlen))
ri->metric.delay = EIGRP_INFINITE_METRIC;
rde_imsg_compose_eigrpe(IMSG_SEND_MUPDATE, ei->ifaceid, 0,
ri, sizeof(*ri));
rde_imsg_compose_eigrpe(IMSG_SEND_MUPDATE_END, ei->ifaceid, 0,
NULL, 0);
}
static void
rde_send_update_all(struct rt_node *rn, struct rinfo *ri)
{
struct eigrp *eigrp = rn->eigrp;
struct eigrp_iface *ei;
TAILQ_FOREACH(ei, &eigrp->ei_list, e_entry) {
/* respect split-horizon configuration */
if (rn->successor.nbr && rn->successor.nbr->ei == ei &&
ei->splithorizon)
continue;
rde_send_update(ei, ri);
}
}
static void
rde_send_query(struct eigrp_iface *ei, struct rinfo *ri, int push)
{
rde_imsg_compose_eigrpe(IMSG_SEND_MQUERY, ei->ifaceid, 0,
ri, sizeof(*ri));
if (push)
rde_imsg_compose_eigrpe(IMSG_SEND_MQUERY_END, ei->ifaceid,
0, NULL, 0);
}
static void
rde_send_siaquery(struct rde_nbr *nbr, struct rinfo *ri)
{
rde_imsg_compose_eigrpe(IMSG_SEND_QUERY, nbr->peerid, 0,
ri, sizeof(*ri));
rde_imsg_compose_eigrpe(IMSG_SEND_SIAQUERY_END, nbr->peerid, 0,
NULL, 0);
}
static void
rde_send_query_all(struct eigrp *eigrp, struct rt_node *rn, int push)
{
struct eigrp_iface *ei;
struct rde_nbr *nbr;
struct rinfo ri;
rinfo_fill_successor(rn, &ri);
ri.metric.flags |= F_METRIC_ACTIVE;
TAILQ_FOREACH(ei, &eigrp->ei_list, e_entry) {
/* respect split-horizon configuration */
if (rn->successor.nbr && rn->successor.nbr->ei == ei &&
ei->splithorizon)
continue;
rde_send_query(ei, &ri, push);
}
RB_FOREACH(nbr, rde_nbr_head, &rde_nbrs)
if (nbr->ei->eigrp == eigrp && !(nbr->flags & F_RDE_NBR_SELF)) {
/* respect split-horizon configuration */
if (rn->successor.nbr &&
rn->successor.nbr->ei == nbr->ei &&
nbr->ei->splithorizon)
continue;
reply_outstanding_add(rn, nbr);
}
}
void
rde_flush_queries(void)
{
struct eigrp *eigrp;
struct eigrp_iface *ei;
TAILQ_FOREACH(eigrp, &rdeconf->instances, entry)
TAILQ_FOREACH(ei, &eigrp->ei_list, e_entry)
rde_imsg_compose_eigrpe(IMSG_SEND_MQUERY_END,
ei->ifaceid, 0, NULL, 0);
}
static void
rde_send_reply(struct rde_nbr *nbr, struct rinfo *ri, int siareply)
{
int type;
if (ri->metric.hop_count >= nbr->eigrp->maximum_hops ||
rde_summary_check(nbr->ei, &ri->prefix, ri->prefixlen))
ri->metric.delay = EIGRP_INFINITE_METRIC;
if (!siareply)
type = IMSG_SEND_REPLY_END;
else
type = IMSG_SEND_SIAREPLY_END;
rde_imsg_compose_eigrpe(IMSG_SEND_REPLY, nbr->peerid, 0,
ri, sizeof(*ri));
rde_imsg_compose_eigrpe(type, nbr->peerid, 0, NULL, 0);
}
void
rde_check_update(struct rde_nbr *nbr, struct rinfo *ri)
{
struct eigrp *eigrp = nbr->eigrp;
struct rt_node *rn;
struct eigrp_route *route, *successor;
uint32_t old_fdistance;
struct rinfo sri;
rn = rt_find(eigrp, ri);
if (rn == NULL) {
if (ri->metric.delay == EIGRP_INFINITE_METRIC)
return;
rn = rt_new(eigrp, ri);
route = route_new(rn, nbr, ri);
old_fdistance = EIGRP_INFINITE_METRIC;
} else {
old_fdistance = rn->successor.fdistance;
if (ri->metric.delay == EIGRP_INFINITE_METRIC) {
route = route_find(nbr, rn);
if (route)
route_del(rn, route);
} else {
route = route_find(nbr, rn);
if (route == NULL)
route = route_new(rn, nbr, ri);
else
route_update_metrics(eigrp, route, ri);
}
}
switch (rn->state) {
case DUAL_STA_PASSIVE:
successor = rt_get_successor_fc(rn);
/*
* go active if the successor was affected and no feasible
* successor exist.
*/
if (successor == NULL) {
rde_send_query_all(eigrp, rn, 1);
dual_fsm(rn, DUAL_EVT_4);
} else {
rt_set_successor(rn, successor);
rt_update_fib(rn);
/* send update with new metric if necessary */
rinfo_fill_successor(rn, &sri);
if (rn->successor.fdistance != old_fdistance)
rde_send_update_all(rn, &sri);
}
break;
case DUAL_STA_ACTIVE1:
/* XXX event 9 if cost increase? */
break;
case DUAL_STA_ACTIVE3:
/* XXX event 10 if cost increase? */
break;
}
if ((rn->state & DUAL_STA_ACTIVE_ALL) && TAILQ_EMPTY(&rn->rijk))
rde_last_reply(rn);
}
void
rde_check_query(struct rde_nbr *nbr, struct rinfo *ri, int siaquery)
{
struct eigrp *eigrp = nbr->eigrp;
struct rt_node *rn;
struct eigrp_route *route, *successor;
uint32_t old_fdistance;
struct rinfo sri;
int reply_sent = 0;
/*
* draft-savage-eigrp-02 - Section 4.3:
* "When a query is received for a route that doesn't exist in our
* topology table, a reply with infinite metric is sent and an entry
* in the topology table is added with the metric in the QUERY if
* the metric is not an infinite value".
*/
rn = rt_find(eigrp, ri);
if (rn == NULL) {
sri = *ri;
sri.metric.delay = EIGRP_INFINITE_METRIC;
rde_send_reply(nbr, &sri, 0);
if (ri->metric.delay == EIGRP_INFINITE_METRIC)
return;
rn = rt_new(eigrp, ri);
route = route_new(rn, nbr, ri);
rt_set_successor(rn, route);
return;
}
old_fdistance = rn->successor.fdistance;
if (ri->metric.delay == EIGRP_INFINITE_METRIC) {
route = route_find(nbr, rn);
if (route)
route_del(rn, route);
} else {
route = route_find(nbr, rn);
if (route == NULL)
route = route_new(rn, nbr, ri);
else
route_update_metrics(eigrp, route, ri);
}
switch (rn->state) {
case DUAL_STA_PASSIVE:
successor = rt_get_successor_fc(rn);
/*
* go active if the successor was affected and no feasible
* successor exist.
*/
if (successor == NULL) {
rde_send_query_all(eigrp, rn, 1);
dual_fsm(rn, DUAL_EVT_3);
} else {
rt_set_successor(rn, successor);
rt_update_fib(rn);
/* send reply */
rinfo_fill_successor(rn, &sri);