-
Notifications
You must be signed in to change notification settings - Fork 3
/
kroute.c
1546 lines (1321 loc) · 35.8 KB
/
kroute.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 <renato@openbsd.org>
* Copyright (c) 2004 Esben Norby <norby@openbsd.org>
* Copyright (c) 2003, 2004 Henning Brauer <henning@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 <sys/types.h>
#include <sys/socket.h>
#include <sys/sysctl.h>
#include <net/if.h>
#include <net/if_dl.h>
#include <net/route.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "eigrpd.h"
#include "log.h"
static struct {
uint32_t rtseq;
pid_t pid;
int fib_sync;
int fd;
struct event ev;
unsigned int rdomain;
} kr_state;
struct kroute_node {
TAILQ_ENTRY(kroute_node) entry;
struct kroute_priority *kprio; /* back pointer */
struct kroute r;
};
struct kroute_priority {
TAILQ_ENTRY(kroute_priority) entry;
struct kroute_prefix *kp; /* back pointer */
uint8_t priority;
TAILQ_HEAD(, kroute_node) nexthops;
};
struct kroute_prefix {
RB_ENTRY(kroute_prefix) entry;
int af;
union eigrpd_addr prefix;
uint8_t prefixlen;
TAILQ_HEAD(plist, kroute_priority) priorities;
};
RB_HEAD(kroute_tree, kroute_prefix);
RB_PROTOTYPE(kroute_tree, kroute_prefix, entry, kroute_compare)
struct kif_addr {
TAILQ_ENTRY(kif_addr) entry;
struct kaddr a;
};
struct kif_node {
RB_ENTRY(kif_node) entry;
TAILQ_HEAD(, kif_addr) addrs;
struct kif k;
};
RB_HEAD(kif_tree, kif_node);
RB_PROTOTYPE(kif_tree, kif_node, entry, kif_compare)
static void kr_dispatch_msg(int, short, void *);
static void kr_redist_remove(struct kroute *);
static int kr_redist_eval(struct kroute *);
static void kr_redistribute(struct kroute_prefix *);
static __inline int kroute_compare(struct kroute_prefix *,
struct kroute_prefix *);
static struct kroute_prefix *kroute_find_prefix(int, union eigrpd_addr *,
uint8_t);
static struct kroute_priority *kroute_find_prio(struct kroute_prefix *,
uint8_t);
static struct kroute_node *kroute_find_gw(struct kroute_priority *,
union eigrpd_addr *);
static struct kroute_node *kroute_insert(struct kroute *);
static int kroute_remove(struct kroute *);
static void kroute_clear(void);
static __inline int kif_compare(struct kif_node *, struct kif_node *);
static struct kif_node *kif_find(unsigned short);
static struct kif_node *kif_insert(unsigned short);
static int kif_remove(struct kif_node *);
static struct kif *kif_update(unsigned short, int, struct if_data *,
struct sockaddr_dl *);
static int kif_validate(unsigned short);
static void protect_lo(void);
static uint8_t prefixlen_classful(in_addr_t);
static void get_rtaddrs(int, struct sockaddr *, struct sockaddr **);
static void if_change(unsigned short, int, struct if_data *,
struct sockaddr_dl *);
static void if_newaddr(unsigned short, struct sockaddr *,
struct sockaddr *, struct sockaddr *);
static void if_deladdr(unsigned short, struct sockaddr *,
struct sockaddr *, struct sockaddr *);
static void if_announce(void *);
static int send_rtmsg_v4(int, int, struct kroute *);
static int send_rtmsg_v6(int, int, struct kroute *);
static int send_rtmsg(int, int, struct kroute *);
static int fetchtable(void);
static int fetchifs(void);
static int dispatch_rtmsg(void);
static int rtmsg_process(char *, size_t);
static int rtmsg_process_route(struct rt_msghdr *,
struct sockaddr *[RTAX_MAX]);
RB_GENERATE(kroute_tree, kroute_prefix, entry, kroute_compare)
RB_GENERATE(kif_tree, kif_node, entry, kif_compare)
static struct kroute_tree krt = RB_INITIALIZER(&krt);
static struct kif_tree kit = RB_INITIALIZER(&kit);
int
kif_init(void)
{
if (fetchifs() == -1)
return (-1);
return (0);
}
int
kr_init(int fs, unsigned int rdomain)
{
int opt = 0, rcvbuf, default_rcvbuf;
socklen_t optlen;
kr_state.fib_sync = fs;
kr_state.rdomain = rdomain;
if ((kr_state.fd = socket(AF_ROUTE,
SOCK_RAW | SOCK_CLOEXEC | SOCK_NONBLOCK, 0)) == -1) {
log_warn("%s: socket", __func__);
return (-1);
}
/* not interested in my own messages */
if (setsockopt(kr_state.fd, SOL_SOCKET, SO_USELOOPBACK,
&opt, sizeof(opt)) == -1)
log_warn("%s: setsockopt(SO_USELOOPBACK)", __func__);
/* grow receive buffer, don't wanna miss messages */
optlen = sizeof(default_rcvbuf);
if (getsockopt(kr_state.fd, SOL_SOCKET, SO_RCVBUF,
&default_rcvbuf, &optlen) == -1)
log_warn("%s: getsockopt SOL_SOCKET SO_RCVBUF", __func__);
else
for (rcvbuf = MAX_RTSOCK_BUF;
rcvbuf > default_rcvbuf &&
setsockopt(kr_state.fd, SOL_SOCKET, SO_RCVBUF,
&rcvbuf, sizeof(rcvbuf)) == -1 && errno == ENOBUFS;
rcvbuf /= 2)
; /* nothing */
kr_state.pid = getpid();
kr_state.rtseq = 1;
if (fetchtable() == -1)
return (-1);
protect_lo();
event_set(&kr_state.ev, kr_state.fd, EV_READ | EV_PERSIST,
kr_dispatch_msg, NULL);
event_add(&kr_state.ev, NULL);
return (0);
}
void
kif_redistribute(void)
{
struct kif_node *kif;
struct kif_addr *ka;
RB_FOREACH(kif, kif_tree, &kit) {
main_imsg_compose_eigrpe(IMSG_IFINFO, 0, &kif->k,
sizeof(struct kif));
TAILQ_FOREACH(ka, &kif->addrs, entry) {
main_imsg_compose_eigrpe(IMSG_NEWADDR, 0, &ka->a,
sizeof(ka->a));
}
}
}
int
kr_change(struct kroute *kr)
{
struct kroute_prefix *kp;
struct kroute_priority *kprio;
struct kroute_node *kn;
int action = RTM_ADD;
kp = kroute_find_prefix(kr->af, &kr->prefix, kr->prefixlen);
if (kp == NULL)
kn = kroute_insert(kr);
else {
kprio = kroute_find_prio(kp, kr->priority);
if (kprio == NULL)
kn = kroute_insert(kr);
else {
kn = kroute_find_gw(kprio, &kr->nexthop);
if (kn == NULL)
kn = kroute_insert(kr);
else
action = RTM_CHANGE;
}
}
/* send update */
if (send_rtmsg(kr_state.fd, action, kr) == -1)
return (-1);
kn->r.flags |= F_EIGRPD_INSERTED;
return (0);
}
int
kr_delete(struct kroute *kr)
{
struct kroute_prefix *kp;
struct kroute_priority *kprio;
struct kroute_node *kn;
kp = kroute_find_prefix(kr->af, &kr->prefix, kr->prefixlen);
if (kp == NULL)
return (0);
kprio = kroute_find_prio(kp, kr->priority);
if (kprio == NULL)
return (0);
kn = kroute_find_gw(kprio, &kr->nexthop);
if (kn == NULL)
return (0);
if (!(kn->r.flags & F_EIGRPD_INSERTED))
return (0);
if (send_rtmsg(kr_state.fd, RTM_DELETE, &kn->r) == -1)
return (-1);
if (kroute_remove(kr) == -1)
return (-1);
return (0);
}
void
kr_shutdown(void)
{
kr_fib_decouple();
kroute_clear();
kif_clear();
}
void
kr_fib_couple(void)
{
struct kroute_prefix *kp;
struct kroute_priority *kprio;
struct kroute_node *kn;
if (kr_state.fib_sync == 1) /* already coupled */
return;
kr_state.fib_sync = 1;
RB_FOREACH(kp, kroute_tree, &krt)
TAILQ_FOREACH(kprio, &kp->priorities, entry)
TAILQ_FOREACH(kn, &kprio->nexthops, entry) {
if (!(kn->r.flags & F_EIGRPD_INSERTED))
continue;
send_rtmsg(kr_state.fd, RTM_ADD, &kn->r);
}
log_info("kernel routing table coupled");
}
void
kr_fib_decouple(void)
{
struct kroute_prefix *kp;
struct kroute_priority *kprio;
struct kroute_node *kn;
if (kr_state.fib_sync == 0) /* already decoupled */
return;
RB_FOREACH(kp, kroute_tree, &krt)
TAILQ_FOREACH(kprio, &kp->priorities, entry)
TAILQ_FOREACH(kn, &kprio->nexthops, entry) {
if (!(kn->r.flags & F_EIGRPD_INSERTED))
continue;
send_rtmsg(kr_state.fd, RTM_DELETE, &kn->r);
}
kr_state.fib_sync = 0;
log_info("kernel routing table decoupled");
}
/* ARGSUSED */
static void
kr_dispatch_msg(int fd, short event, void *bula)
{
if (dispatch_rtmsg() == -1)
event_loopexit(NULL);
}
void
kr_show_route(struct imsg *imsg)
{
struct kroute_prefix *kp;
struct kroute_priority *kprio;
struct kroute_node *kn;
struct kroute kr;
int flags;
if (imsg->hdr.len != IMSG_HEADER_SIZE + sizeof(flags)) {
log_warnx("%s: wrong imsg len", __func__);
return;
}
memcpy(&flags, imsg->data, sizeof(flags));
RB_FOREACH(kp, kroute_tree, &krt)
TAILQ_FOREACH(kprio, &kp->priorities, entry)
TAILQ_FOREACH(kn, &kprio->nexthops, entry) {
if (flags && !(kn->r.flags & flags))
continue;
kr = kn->r;
if (kr.priority ==
eigrpd_conf->fib_priority_external)
kr.flags |= F_CTL_EXTERNAL;
main_imsg_compose_eigrpe(IMSG_CTL_KROUTE,
imsg->hdr.pid, &kr, sizeof(kr));
}
main_imsg_compose_eigrpe(IMSG_CTL_END, imsg->hdr.pid, NULL, 0);
}
void
kr_ifinfo(char *ifname, pid_t pid)
{
struct kif_node *kif;
RB_FOREACH(kif, kif_tree, &kit)
if (ifname == NULL || !strcmp(ifname, kif->k.ifname)) {
main_imsg_compose_eigrpe(IMSG_CTL_IFINFO,
pid, &kif->k, sizeof(kif->k));
}
main_imsg_compose_eigrpe(IMSG_CTL_END, pid, NULL, 0);
}
static void
kr_redist_remove(struct kroute *kr)
{
/* was the route redistributed? */
if (!(kr->flags & F_REDISTRIBUTED))
return;
/* remove redistributed flag */
kr->flags &= ~F_REDISTRIBUTED;
main_imsg_compose_rde(IMSG_NETWORK_DEL, 0, kr, sizeof(*kr));
}
static int
kr_redist_eval(struct kroute *kr)
{
/* Only non-eigrpd routes are considered for redistribution. */
if (!(kr->flags & F_KERNEL))
goto dont_redistribute;
/* Dynamic routes are not redistributable. */
if (kr->flags & F_DYNAMIC)
goto dont_redistribute;
/* filter-out non-redistributable addresses */
if (bad_addr(kr->af, &kr->prefix) ||
(kr->af == AF_INET6 && IN6_IS_SCOPE_EMBED(&kr->prefix.v6)))
goto dont_redistribute;
/* interface is not up and running so don't announce */
if (kr->flags & F_DOWN)
goto dont_redistribute;
/*
* Consider networks with nexthop loopback as not redistributable
* unless it is a reject or blackhole route.
*/
switch (kr->af) {
case AF_INET:
if (kr->nexthop.v4.s_addr == htonl(INADDR_LOOPBACK) &&
!(kr->flags & (F_BLACKHOLE|F_REJECT)))
goto dont_redistribute;
break;
case AF_INET6:
if (IN6_IS_ADDR_LOOPBACK(&kr->nexthop.v6) &&
!(kr->flags & (F_BLACKHOLE|F_REJECT)))
goto dont_redistribute;
break;
default:
log_debug("%s: unexpected address-family", __func__);
break;
}
/* prefix should be redistributed */
kr->flags |= F_REDISTRIBUTED;
main_imsg_compose_rde(IMSG_NETWORK_ADD, 0, kr, sizeof(*kr));
return (1);
dont_redistribute:
kr_redist_remove(kr);
return (0);
}
static void
kr_redistribute(struct kroute_prefix *kp)
{
struct kroute_priority *kprio;
struct kroute_node *kn;
/* only the highest prio route can be redistributed */
TAILQ_FOREACH_REVERSE(kprio, &kp->priorities, plist, entry) {
if (kprio == TAILQ_FIRST(&kp->priorities)) {
TAILQ_FOREACH(kn, &kprio->nexthops, entry)
/* pick just one entry in case of multipath */
if (kr_redist_eval(&kn->r))
break;
} else {
TAILQ_FOREACH(kn, &kprio->nexthops, entry)
kr_redist_remove(&kn->r);
}
}
}
static __inline int
kroute_compare(struct kroute_prefix *a, struct kroute_prefix *b)
{
int addrcmp;
if (a->af < b->af)
return (-1);
if (a->af > b->af)
return (1);
addrcmp = eigrp_addrcmp(a->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);
}
/* tree management */
static struct kroute_prefix *
kroute_find_prefix(int af, union eigrpd_addr *prefix, uint8_t prefixlen)
{
struct kroute_prefix s;
s.af = af;
s.prefix = *prefix;
s.prefixlen = prefixlen;
return (RB_FIND(kroute_tree, &krt, &s));
}
static struct kroute_priority *
kroute_find_prio(struct kroute_prefix *kp, uint8_t prio)
{
struct kroute_priority *kprio;
/* RTP_ANY here picks the lowest priority node */
if (prio == RTP_ANY)
return (TAILQ_FIRST(&kp->priorities));
TAILQ_FOREACH(kprio, &kp->priorities, entry)
if (kprio->priority == prio)
return (kprio);
return (NULL);
}
static struct kroute_node *
kroute_find_gw(struct kroute_priority *kprio, union eigrpd_addr *nh)
{
struct kroute_node *kn;
TAILQ_FOREACH(kn, &kprio->nexthops, entry)
if (eigrp_addrcmp(kprio->kp->af, &kn->r.nexthop, nh) == 0)
return (kn);
return (NULL);
}
static struct kroute_node *
kroute_insert(struct kroute *kr)
{
struct kroute_prefix *kp;
struct kroute_priority *kprio, *tmp;
struct kroute_node *kn;
kp = kroute_find_prefix(kr->af, &kr->prefix, kr->prefixlen);
if (kp == NULL) {
kp = calloc(1, sizeof((*kp)));
if (kp == NULL)
fatal("kroute_insert");
kp->af = kr->af;
kp->prefix = kr->prefix;
kp->prefixlen = kr->prefixlen;
TAILQ_INIT(&kp->priorities);
RB_INSERT(kroute_tree, &krt, kp);
}
kprio = kroute_find_prio(kp, kr->priority);
if (kprio == NULL) {
kprio = calloc(1, sizeof(*kprio));
if (kprio == NULL)
fatal("kroute_insert");
kprio->kp = kp;
kprio->priority = kr->priority;
TAILQ_INIT(&kprio->nexthops);
/* lower priorities first */
TAILQ_FOREACH(tmp, &kp->priorities, entry)
if (tmp->priority > kprio->priority)
break;
if (tmp)
TAILQ_INSERT_BEFORE(tmp, kprio, entry);
else
TAILQ_INSERT_TAIL(&kp->priorities, kprio, entry);
}
kn = kroute_find_gw(kprio, &kr->nexthop);
if (kn == NULL) {
kn = calloc(1, sizeof(*kn));
if (kn == NULL)
fatal("kroute_insert");
kn->kprio = kprio;
kn->r = *kr;
TAILQ_INSERT_TAIL(&kprio->nexthops, kn, entry);
}
if (!(kr->flags & F_KERNEL)) {
/* don't validate or redistribute eigrp route */
kr->flags &= ~F_DOWN;
return (kn);
}
if (kif_validate(kr->ifindex))
kr->flags &= ~F_DOWN;
else
kr->flags |= F_DOWN;
kr_redistribute(kp);
return (kn);
}
static int
kroute_remove(struct kroute *kr)
{
struct kroute_prefix *kp;
struct kroute_priority *kprio;
struct kroute_node *kn;
kp = kroute_find_prefix(kr->af, &kr->prefix, kr->prefixlen);
if (kp == NULL)
goto notfound;
kprio = kroute_find_prio(kp, kr->priority);
if (kprio == NULL)
goto notfound;
kn = kroute_find_gw(kprio, &kr->nexthop);
if (kn == NULL)
goto notfound;
kr_redist_remove(&kn->r);
TAILQ_REMOVE(&kprio->nexthops, kn, entry);
free(kn);
if (TAILQ_EMPTY(&kprio->nexthops)) {
TAILQ_REMOVE(&kp->priorities, kprio, entry);
free(kprio);
}
if (TAILQ_EMPTY(&kp->priorities)) {
if (RB_REMOVE(kroute_tree, &krt, kp) == NULL) {
log_warnx("%s failed for %s/%u", __func__,
log_addr(kr->af, &kr->prefix), kp->prefixlen);
return (-1);
}
free(kp);
} else
kr_redistribute(kp);
return (0);
notfound:
log_warnx("%s failed to find %s/%u", __func__,
log_addr(kr->af, &kr->prefix), kr->prefixlen);
return (-1);
}
static void
kroute_clear(void)
{
struct kroute_prefix *kp;
struct kroute_priority *kprio;
struct kroute_node *kn;
while ((kp = RB_MIN(kroute_tree, &krt)) != NULL) {
while ((kprio = TAILQ_FIRST(&kp->priorities)) != NULL) {
while ((kn = TAILQ_FIRST(&kprio->nexthops)) != NULL) {
TAILQ_REMOVE(&kprio->nexthops, kn, entry);
free(kn);
}
TAILQ_REMOVE(&kp->priorities, kprio, entry);
free(kprio);
}
RB_REMOVE(kroute_tree, &krt, kp);
free(kp);
}
}
static __inline int
kif_compare(struct kif_node *a, struct kif_node *b)
{
return (b->k.ifindex - a->k.ifindex);
}
/* tree management */
static struct kif_node *
kif_find(unsigned short ifindex)
{
struct kif_node s;
memset(&s, 0, sizeof(s));
s.k.ifindex = ifindex;
return (RB_FIND(kif_tree, &kit, &s));
}
struct kif *
kif_findname(char *ifname)
{
struct kif_node *kif;
RB_FOREACH(kif, kif_tree, &kit)
if (!strcmp(ifname, kif->k.ifname))
return (&kif->k);
return (NULL);
}
static struct kif_node *
kif_insert(unsigned short ifindex)
{
struct kif_node *kif;
if ((kif = calloc(1, sizeof(struct kif_node))) == NULL)
return (NULL);
kif->k.ifindex = ifindex;
TAILQ_INIT(&kif->addrs);
if (RB_INSERT(kif_tree, &kit, kif) != NULL)
fatalx("kif_insert: RB_INSERT");
return (kif);
}
static int
kif_remove(struct kif_node *kif)
{
struct kif_addr *ka;
if (RB_REMOVE(kif_tree, &kit, kif) == NULL) {
log_warnx("%s failed for inteface %s", __func__, kif->k.ifname);
return (-1);
}
while ((ka = TAILQ_FIRST(&kif->addrs)) != NULL) {
TAILQ_REMOVE(&kif->addrs, ka, entry);
free(ka);
}
free(kif);
return (0);
}
void
kif_clear(void)
{
struct kif_node *kif;
while ((kif = RB_MIN(kif_tree, &kit)) != NULL)
kif_remove(kif);
}
static struct kif *
kif_update(unsigned short ifindex, int flags, struct if_data *ifd,
struct sockaddr_dl *sdl)
{
struct kif_node *kif;
if ((kif = kif_find(ifindex)) == NULL) {
if ((kif = kif_insert(ifindex)) == NULL)
return (NULL);
kif->k.nh_reachable = (flags & IFF_UP) &&
LINK_STATE_IS_UP(ifd->ifi_link_state);
}
kif->k.flags = flags;
kif->k.link_state = ifd->ifi_link_state;
kif->k.if_type = ifd->ifi_type;
kif->k.baudrate = ifd->ifi_baudrate;
kif->k.mtu = ifd->ifi_mtu;
if (sdl && sdl->sdl_family == AF_LINK) {
if (sdl->sdl_nlen >= sizeof(kif->k.ifname))
memcpy(kif->k.ifname, sdl->sdl_data,
sizeof(kif->k.ifname) - 1);
else if (sdl->sdl_nlen > 0)
memcpy(kif->k.ifname, sdl->sdl_data,
sdl->sdl_nlen);
/* string already terminated via calloc() */
}
return (&kif->k);
}
static int
kif_validate(unsigned short ifindex)
{
struct kif_node *kif;
if ((kif = kif_find(ifindex)) == NULL)
return (0);
return (kif->k.nh_reachable);
}
/* misc */
static void
protect_lo(void)
{
struct kroute kr4, kr6;
/* special protection for 127/8 */
memset(&kr4, 0, sizeof(kr4));
kr4.af = AF_INET;
kr4.prefix.v4.s_addr = htonl(INADDR_LOOPBACK & IN_CLASSA_NET);
kr4.prefixlen = 8;
kr4.flags = F_KERNEL|F_CONNECTED;
kroute_insert(&kr4);
/* special protection for ::1 */
memset(&kr6, 0, sizeof(kr6));
kr6.af = AF_INET6;
kr6.prefix.v6 = in6addr_loopback;
kr6.prefixlen = 128;
kr6.flags = F_KERNEL|F_CONNECTED;
kroute_insert(&kr6);
}
/* misc */
static uint8_t
prefixlen_classful(in_addr_t ina)
{
/* it hurt to write this. */
if (ina >= 0xf0000000U) /* class E */
return (32);
else if (ina >= 0xe0000000U) /* class D */
return (4);
else if (ina >= 0xc0000000U) /* class C */
return (24);
else if (ina >= 0x80000000U) /* class B */
return (16);
else /* class A */
return (8);
}
#define ROUNDUP(a) \
(((a) & (sizeof(long) - 1)) ? (1 + ((a) | (sizeof(long) - 1))) : (a))
static void
get_rtaddrs(int addrs, struct sockaddr *sa, struct sockaddr **rti_info)
{
int i;
for (i = 0; i < RTAX_MAX; i++) {
if (addrs & (1 << i)) {
rti_info[i] = sa;
sa = (struct sockaddr *)((char *)(sa) +
ROUNDUP(sa->sa_len));
} else
rti_info[i] = NULL;
}
}
static void
if_change(unsigned short ifindex, int flags, struct if_data *ifd,
struct sockaddr_dl *sdl)
{
struct kroute_prefix *kp;
struct kroute_priority *kprio;
struct kroute_node *kn;
struct kif *kif;
uint8_t reachable;
if ((kif = kif_update(ifindex, flags, ifd, sdl)) == NULL) {
log_warn("%s: kif_update(%u)", __func__, ifindex);
return;
}
reachable = (kif->flags & IFF_UP) &&
LINK_STATE_IS_UP(kif->link_state);
if (reachable == kif->nh_reachable)
return; /* nothing changed wrt nexthop validity */
kif->nh_reachable = reachable;
/* notify eigrpe about link state */
main_imsg_compose_eigrpe(IMSG_IFINFO, 0, kif, sizeof(struct kif));
/* notify rde about link going down */
if (!kif->nh_reachable)
main_imsg_compose_rde(IMSG_IFDOWN, 0, kif, sizeof(struct kif));
/* update redistribute list */
RB_FOREACH(kp, kroute_tree, &krt) {
TAILQ_FOREACH(kprio, &kp->priorities, entry) {
TAILQ_FOREACH(kn, &kprio->nexthops, entry) {
if (kn->r.ifindex != ifindex)
continue;
if (reachable)
kn->r.flags &= ~F_DOWN;
else
kn->r.flags |= F_DOWN;
}
}
kr_redistribute(kp);
}
}
static void
if_newaddr(unsigned short ifindex, struct sockaddr *ifa, struct sockaddr *mask,
struct sockaddr *brd)
{
struct kif_node *kif;
struct sockaddr_in *ifa4, *mask4, *brd4;
struct sockaddr_in6 *ifa6, *mask6, *brd6;
struct kif_addr *ka;
if (ifa == NULL)
return;
if ((kif = kif_find(ifindex)) == NULL) {
log_warnx("%s: corresponding if %d not found", __func__,
ifindex);
return;
}
switch (ifa->sa_family) {
case AF_INET:
ifa4 = (struct sockaddr_in *) ifa;
mask4 = (struct sockaddr_in *) mask;
brd4 = (struct sockaddr_in *) brd;
/* filter out unwanted addresses */
if (bad_addr_v4(ifa4->sin_addr))
return;
if ((ka = calloc(1, sizeof(struct kif_addr))) == NULL)
fatal("if_newaddr");
ka->a.addr.v4 = ifa4->sin_addr;
if (mask4)
ka->a.prefixlen =
mask2prefixlen(mask4->sin_addr.s_addr);
if (brd4)
ka->a.dstbrd.v4 = brd4->sin_addr;
break;
case AF_INET6:
ifa6 = (struct sockaddr_in6 *) ifa;
mask6 = (struct sockaddr_in6 *) mask;
brd6 = (struct sockaddr_in6 *) brd;
/* We only care about link-local and global-scope. */
if (bad_addr_v6(&ifa6->sin6_addr))
return;
clearscope(&ifa6->sin6_addr);
if ((ka = calloc(1, sizeof(struct kif_addr))) == NULL)
fatal("if_newaddr");
ka->a.addr.v6 = ifa6->sin6_addr;
if (mask6)
ka->a.prefixlen = mask2prefixlen6(mask6);
if (brd6)
ka->a.dstbrd.v6 = brd6->sin6_addr;
break;
default:
return;
}
ka->a.ifindex = ifindex;
ka->a.af = ifa->sa_family;
TAILQ_INSERT_TAIL(&kif->addrs, ka, entry);
/* notify eigrpe about new address */
main_imsg_compose_eigrpe(IMSG_NEWADDR, 0, &ka->a, sizeof(ka->a));
}
static void
if_deladdr(unsigned short ifindex, struct sockaddr *ifa, struct sockaddr *mask,
struct sockaddr *brd)
{
struct kif_node *kif;
struct sockaddr_in *ifa4, *mask4, *brd4;
struct sockaddr_in6 *ifa6, *mask6, *brd6;
struct kaddr k;
struct kif_addr *ka, *nka;
if (ifa == NULL)
return;
if ((kif = kif_find(ifindex)) == NULL) {
log_warnx("%s: corresponding if %d not found", __func__,
ifindex);
return;
}
memset(&k, 0, sizeof(k));
k.af = ifa->sa_family;
switch (ifa->sa_family) {
case AF_INET:
ifa4 = (struct sockaddr_in *) ifa;
mask4 = (struct sockaddr_in *) mask;
brd4 = (struct sockaddr_in *) brd;
/* filter out unwanted addresses */
if (bad_addr_v4(ifa4->sin_addr))
return;
k.addr.v4 = ifa4->sin_addr;
if (mask4)
k.prefixlen = mask2prefixlen(mask4->sin_addr.s_addr);
if (brd4)
k.dstbrd.v4 = brd4->sin_addr;
break;
case AF_INET6:
ifa6 = (struct sockaddr_in6 *) ifa;
mask6 = (struct sockaddr_in6 *) mask;
brd6 = (struct sockaddr_in6 *) brd;
/* We only care about link-local and global-scope. */
if (bad_addr_v6(&ifa6->sin6_addr))
return;
clearscope(&ifa6->sin6_addr);
k.addr.v6 = ifa6->sin6_addr;
if (mask6)
k.prefixlen = mask2prefixlen6(mask6);
if (brd6)
k.dstbrd.v6 = brd6->sin6_addr;
break;
default:
return;
}
for (ka = TAILQ_FIRST(&kif->addrs); ka != NULL; ka = nka) {
nka = TAILQ_NEXT(ka, entry);
if (ka->a.af != k.af ||
ka->a.prefixlen != k.prefixlen ||
eigrp_addrcmp(ka->a.af, &ka->a.addr, &k.addr) ||