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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
|
/* $OpenBSD: rde.c,v 1.10 2007/12/13 08:54:05 claudio Exp $ */
/*
* Copyright (c) 2004, 2005 Claudio Jeker <claudio@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/queue.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <err.h>
#include <errno.h>
#include <stdlib.h>
#include <signal.h>
#include <string.h>
#include <pwd.h>
#include <unistd.h>
#include <event.h>
#include "ospf6.h"
#include "ospf6d.h"
#include "ospfe.h"
#include "log.h"
#include "rde.h"
void rde_sig_handler(int sig, short, void *);
void rde_shutdown(void);
void rde_dispatch_imsg(int, short, void *);
void rde_dispatch_parent(int, short, void *);
void rde_dump_area(struct area *, int, pid_t);
void rde_send_summary(pid_t);
void rde_send_summary_area(struct area *, pid_t);
void rde_nbr_init(u_int32_t);
void rde_nbr_free(void);
struct rde_nbr *rde_nbr_find(u_int32_t);
struct rde_nbr *rde_nbr_new(u_int32_t, struct rde_nbr *);
void rde_nbr_del(struct rde_nbr *);
void rde_req_list_add(struct rde_nbr *, struct lsa_hdr *);
int rde_req_list_exists(struct rde_nbr *, struct lsa_hdr *);
void rde_req_list_del(struct rde_nbr *, struct lsa_hdr *);
void rde_req_list_free(struct rde_nbr *);
struct lsa *rde_asext_get(struct rroute *);
struct lsa *rde_asext_put(struct rroute *);
struct lsa *orig_asext_lsa(struct rroute *, u_int16_t);
struct lsa *orig_sum_lsa(struct rt_node *, struct area *, u_int8_t, int);
struct ospfd_conf *rdeconf = NULL, *nconf = NULL;
struct imsgbuf *ibuf_ospfe;
struct imsgbuf *ibuf_main;
struct rde_nbr *nbrself;
struct lsa_tree asext_tree;
/* ARGSUSED */
void
rde_sig_handler(int sig, short event, void *arg)
{
/*
* signal handler rules don't apply, libevent decouples for us
*/
switch (sig) {
case SIGINT:
case SIGTERM:
rde_shutdown();
/* NOTREACHED */
default:
fatalx("unexpected signal");
}
}
/* route decision engine */
pid_t
rde(struct ospfd_conf *xconf, int pipe_parent2rde[2], int pipe_ospfe2rde[2],
int pipe_parent2ospfe[2])
{
struct event ev_sigint, ev_sigterm;
struct timeval now;
struct passwd *pw;
struct redistribute *r;
pid_t pid;
switch (pid = fork()) {
case -1:
fatal("cannot fork");
/* NOTREACHED */
case 0:
break;
default:
return (pid);
}
rdeconf = xconf;
if ((pw = getpwnam(OSPF6D_USER)) == NULL)
fatal("getpwnam");
if (chroot(pw->pw_dir) == -1)
fatal("chroot");
if (chdir("/") == -1)
fatal("chdir(\"/\")");
setproctitle("route decision engine");
ospfd_process = PROC_RDE_ENGINE;
if (setgroups(1, &pw->pw_gid) ||
setresgid(pw->pw_gid, pw->pw_gid, pw->pw_gid) ||
setresuid(pw->pw_uid, pw->pw_uid, pw->pw_uid))
fatal("can't drop privileges");
event_init();
rde_nbr_init(NBR_HASHSIZE);
lsa_init(&asext_tree);
/* setup signal handler */
signal_set(&ev_sigint, SIGINT, rde_sig_handler, NULL);
signal_set(&ev_sigterm, SIGTERM, rde_sig_handler, NULL);
signal_add(&ev_sigint, NULL);
signal_add(&ev_sigterm, NULL);
signal(SIGPIPE, SIG_IGN);
signal(SIGHUP, SIG_IGN);
/* setup pipes */
close(pipe_ospfe2rde[0]);
close(pipe_parent2rde[0]);
close(pipe_parent2ospfe[0]);
close(pipe_parent2ospfe[1]);
if ((ibuf_ospfe = malloc(sizeof(struct imsgbuf))) == NULL ||
(ibuf_main = malloc(sizeof(struct imsgbuf))) == NULL)
fatal(NULL);
imsg_init(ibuf_ospfe, pipe_ospfe2rde[1], rde_dispatch_imsg);
imsg_init(ibuf_main, pipe_parent2rde[1], rde_dispatch_parent);
/* setup event handler */
ibuf_ospfe->events = EV_READ;
event_set(&ibuf_ospfe->ev, ibuf_ospfe->fd, ibuf_ospfe->events,
ibuf_ospfe->handler, ibuf_ospfe);
event_add(&ibuf_ospfe->ev, NULL);
ibuf_main->events = EV_READ;
event_set(&ibuf_main->ev, ibuf_main->fd, ibuf_main->events,
ibuf_main->handler, ibuf_main);
event_add(&ibuf_main->ev, NULL);
evtimer_set(&rdeconf->ev, spf_timer, rdeconf);
cand_list_init();
rt_init();
while ((r = SIMPLEQ_FIRST(&rdeconf->redist_list)) != NULL) {
SIMPLEQ_REMOVE_HEAD(&rdeconf->redist_list, entry);
free(r);
}
gettimeofday(&now, NULL);
rdeconf->uptime = now.tv_sec;
event_dispatch();
rde_shutdown();
/* NOTREACHED */
return (0);
}
void
rde_shutdown(void)
{
struct area *a;
stop_spf_timer(rdeconf);
cand_list_clr();
rt_clear();
while ((a = LIST_FIRST(&rdeconf->area_list)) != NULL) {
LIST_REMOVE(a, entry);
area_del(a);
}
rde_nbr_free();
msgbuf_clear(&ibuf_ospfe->w);
free(ibuf_ospfe);
msgbuf_clear(&ibuf_main->w);
free(ibuf_main);
free(rdeconf);
log_info("route decision engine exiting");
_exit(0);
}
int
rde_imsg_compose_ospfe(int type, u_int32_t peerid, pid_t pid, void *data,
u_int16_t datalen)
{
return (imsg_compose(ibuf_ospfe, type, peerid, pid, data, datalen));
}
/* ARGSUSED */
void
rde_dispatch_imsg(int fd, short event, void *bula)
{
struct imsgbuf *ibuf = bula;
struct imsg imsg;
struct in_addr aid;
struct ls_req_hdr req_hdr;
struct lsa_hdr lsa_hdr, *db_hdr;
struct rde_nbr rn, *nbr;
struct timespec tp;
struct lsa *lsa;
struct area *area;
struct vertex *v;
char *buf;
ssize_t n;
time_t now;
int r, state, self, shut = 0;
u_int16_t l;
switch (event) {
case EV_READ:
if ((n = imsg_read(ibuf)) == -1)
fatal("imsg_read error");
if (n == 0) /* connection closed */
shut = 1;
break;
case EV_WRITE:
if (msgbuf_write(&ibuf->w) == -1)
fatal("msgbuf_write");
imsg_event_add(ibuf);
return;
default:
fatalx("unknown event");
}
clock_gettime(CLOCK_MONOTONIC, &tp);
now = tp.tv_sec;
for (;;) {
if ((n = imsg_get(ibuf, &imsg)) == -1)
fatal("rde_dispatch_imsg: imsg_read error");
if (n == 0)
break;
switch (imsg.hdr.type) {
case IMSG_NEIGHBOR_UP:
if (imsg.hdr.len - IMSG_HEADER_SIZE != sizeof(rn))
fatalx("invalid size of OE request");
memcpy(&rn, imsg.data, sizeof(rn));
if (rde_nbr_find(imsg.hdr.peerid))
fatalx("rde_dispatch_imsg: "
"neighbor already exists");
rde_nbr_new(imsg.hdr.peerid, &rn);
break;
case IMSG_NEIGHBOR_DOWN:
rde_nbr_del(rde_nbr_find(imsg.hdr.peerid));
break;
case IMSG_NEIGHBOR_CHANGE:
if (imsg.hdr.len - IMSG_HEADER_SIZE != sizeof(state))
fatalx("invalid size of OE request");
memcpy(&state, imsg.data, sizeof(state));
nbr = rde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL)
break;
if (state != nbr->state && (nbr->state & NBR_STA_FULL ||
state & NBR_STA_FULL))
area_track(nbr->area, state);
nbr->state = state;
if (nbr->state & NBR_STA_FULL)
rde_req_list_free(nbr);
break;
case IMSG_DB_SNAPSHOT:
nbr = rde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL)
break;
lsa_snap(nbr->area, imsg.hdr.peerid);
imsg_compose(ibuf_ospfe, IMSG_DB_END, imsg.hdr.peerid,
0, NULL, 0);
break;
case IMSG_DD:
nbr = rde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL)
break;
buf = imsg.data;
for (l = imsg.hdr.len - IMSG_HEADER_SIZE;
l >= sizeof(lsa_hdr); l -= sizeof(lsa_hdr)) {
memcpy(&lsa_hdr, buf, sizeof(lsa_hdr));
buf += sizeof(lsa_hdr);
v = lsa_find(nbr->iface, lsa_hdr.type,
lsa_hdr.ls_id, lsa_hdr.adv_rtr);
if (v == NULL)
db_hdr = NULL;
else
db_hdr = &v->lsa->hdr;
if (lsa_newer(&lsa_hdr, db_hdr) > 0) {
/*
* only request LSAs that are
* newer or missing
*/
rde_req_list_add(nbr, &lsa_hdr);
imsg_compose(ibuf_ospfe, IMSG_DD,
imsg.hdr.peerid, 0, &lsa_hdr,
sizeof(lsa_hdr));
}
}
if (l != 0)
log_warnx("rde_dispatch_imsg: peerid %lu, "
"trailing garbage in Database Description "
"packet", imsg.hdr.peerid);
imsg_compose(ibuf_ospfe, IMSG_DD_END, imsg.hdr.peerid,
0, NULL, 0);
break;
case IMSG_LS_REQ:
nbr = rde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL)
break;
buf = imsg.data;
for (l = imsg.hdr.len - IMSG_HEADER_SIZE;
l >= sizeof(req_hdr); l -= sizeof(req_hdr)) {
memcpy(&req_hdr, buf, sizeof(req_hdr));
buf += sizeof(req_hdr);
if ((v = lsa_find(nbr->iface,
ntohl(req_hdr.type), req_hdr.ls_id,
req_hdr.adv_rtr)) == NULL) {
imsg_compose(ibuf_ospfe, IMSG_LS_BADREQ,
imsg.hdr.peerid, 0, NULL, 0);
continue;
}
imsg_compose(ibuf_ospfe, IMSG_LS_UPD,
imsg.hdr.peerid, 0, v->lsa,
ntohs(v->lsa->hdr.len));
}
if (l != 0)
log_warnx("rde_dispatch_imsg: peerid %lu, "
"trailing garbage in LS Request "
"packet", imsg.hdr.peerid);
break;
case IMSG_LS_UPD:
nbr = rde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL)
break;
lsa = malloc(imsg.hdr.len - IMSG_HEADER_SIZE);
if (lsa == NULL)
fatal(NULL);
memcpy(lsa, imsg.data, imsg.hdr.len - IMSG_HEADER_SIZE);
if (!lsa_check(nbr, lsa,
imsg.hdr.len - IMSG_HEADER_SIZE)) {
free(lsa);
break;
}
v = lsa_find(nbr->iface, lsa->hdr.type, lsa->hdr.ls_id,
lsa->hdr.adv_rtr);
if (v == NULL)
db_hdr = NULL;
else
db_hdr = &v->lsa->hdr;
if (nbr->self) {
lsa_merge(nbr, lsa, v);
/* lsa_merge frees the right lsa */
break;
}
r = lsa_newer(&lsa->hdr, db_hdr);
if (r > 0) {
/* new LSA newer than DB */
if (v && v->flooded &&
v->changed + MIN_LS_ARRIVAL >= now) {
free(lsa);
break;
}
rde_req_list_del(nbr, &lsa->hdr);
if (!(self = lsa_self(nbr, lsa, v)))
if (lsa_add(nbr, lsa))
/* delayed lsa */
break;
/* flood and perhaps ack LSA */
imsg_compose(ibuf_ospfe, IMSG_LS_FLOOD,
imsg.hdr.peerid, 0, lsa,
ntohs(lsa->hdr.len));
/* reflood self originated LSA */
if (self && v)
imsg_compose(ibuf_ospfe, IMSG_LS_FLOOD,
v->peerid, 0, v->lsa,
ntohs(v->lsa->hdr.len));
/* lsa not added so free it */
if (self)
free(lsa);
} else if (r < 0) {
/* lsa no longer needed */
free(lsa);
/*
* point 6 of "The Flooding Procedure"
* We are violating the RFC here because
* it does not make sense to reset a session
* because an equal LSA is already in the table.
* Only if the LSA sent is older than the one
* in the table we should reset the session.
*/
if (rde_req_list_exists(nbr, &lsa->hdr)) {
imsg_compose(ibuf_ospfe, IMSG_LS_BADREQ,
imsg.hdr.peerid, 0, NULL, 0);
break;
}
/* new LSA older than DB */
if (ntohl(db_hdr->seq_num) == MAX_SEQ_NUM &&
ntohs(db_hdr->age) == MAX_AGE)
/* seq-num wrap */
break;
if (v->changed + MIN_LS_ARRIVAL >= now)
break;
/* directly send current LSA, no ack */
imsg_compose(ibuf_ospfe, IMSG_LS_UPD,
imsg.hdr.peerid, 0, v->lsa,
ntohs(v->lsa->hdr.len));
} else {
/* LSA equal send direct ack */
imsg_compose(ibuf_ospfe, IMSG_LS_ACK,
imsg.hdr.peerid, 0, &lsa->hdr,
sizeof(lsa->hdr));
free(lsa);
}
break;
case IMSG_LS_MAXAGE:
nbr = rde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL)
break;
if (imsg.hdr.len != IMSG_HEADER_SIZE +
sizeof(struct lsa_hdr))
fatalx("invalid size of OE request");
memcpy(&lsa_hdr, imsg.data, sizeof(lsa_hdr));
if (rde_nbr_loading(nbr->area))
break;
v = lsa_find(nbr->iface, lsa_hdr.type, lsa_hdr.ls_id,
lsa_hdr.adv_rtr);
if (v == NULL)
db_hdr = NULL;
else
db_hdr = &v->lsa->hdr;
/*
* only delete LSA if the one in the db is not newer
*/
if (lsa_newer(db_hdr, &lsa_hdr) <= 0)
lsa_del(nbr, &lsa_hdr);
break;
case IMSG_CTL_SHOW_DATABASE:
case IMSG_CTL_SHOW_DB_EXT:
case IMSG_CTL_SHOW_DB_NET:
case IMSG_CTL_SHOW_DB_RTR:
case IMSG_CTL_SHOW_DB_SELF:
case IMSG_CTL_SHOW_DB_SUM:
case IMSG_CTL_SHOW_DB_ASBR:
if (imsg.hdr.len != IMSG_HEADER_SIZE &&
imsg.hdr.len != IMSG_HEADER_SIZE + sizeof(aid)) {
log_warnx("rde_dispatch: wrong imsg len");
break;
}
if (imsg.hdr.len == IMSG_HEADER_SIZE) {
LIST_FOREACH(area, &rdeconf->area_list, entry) {
rde_dump_area(area, imsg.hdr.type,
imsg.hdr.pid);
}
lsa_dump(&asext_tree, imsg.hdr.type,
imsg.hdr.pid);
} else {
memcpy(&aid, imsg.data, sizeof(aid));
if ((area = area_find(rdeconf, aid)) != NULL) {
rde_dump_area(area, imsg.hdr.type,
imsg.hdr.pid);
if (!area->stub)
lsa_dump(&asext_tree,
imsg.hdr.type,
imsg.hdr.pid);
}
}
imsg_compose(ibuf_ospfe, IMSG_CTL_END, 0, imsg.hdr.pid,
NULL, 0);
break;
case IMSG_CTL_SHOW_RIB:
LIST_FOREACH(area, &rdeconf->area_list, entry) {
imsg_compose(ibuf_ospfe, IMSG_CTL_AREA,
0, imsg.hdr.pid, area, sizeof(*area));
rt_dump(area->id, imsg.hdr.pid, RIB_RTR);
rt_dump(area->id, imsg.hdr.pid, RIB_NET);
}
aid.s_addr = 0;
rt_dump(aid, imsg.hdr.pid, RIB_EXT);
imsg_compose(ibuf_ospfe, IMSG_CTL_END, 0, imsg.hdr.pid,
NULL, 0);
break;
case IMSG_CTL_SHOW_SUM:
rde_send_summary(imsg.hdr.pid);
LIST_FOREACH(area, &rdeconf->area_list, entry)
rde_send_summary_area(area, imsg.hdr.pid);
imsg_compose(ibuf_ospfe, IMSG_CTL_END, 0, imsg.hdr.pid,
NULL, 0);
break;
default:
log_debug("rde_dispatch_msg: unexpected imsg %d",
imsg.hdr.type);
break;
}
imsg_free(&imsg);
}
if (!shut)
imsg_event_add(ibuf);
else {
/* this pipe is dead, so remove the event handler */
event_del(&ibuf->ev);
event_loopexit(NULL);
}
}
/* ARGSUSED */
void
rde_dispatch_parent(int fd, short event, void *bula)
{
static struct area *narea;
struct iface *niface, *iface;
struct imsg imsg;
struct kroute kr;
struct rroute rr;
struct imsgbuf *ibuf = bula;
struct lsa *lsa;
struct vertex *v;
struct rt_node *rn;
ssize_t n;
int shut = 0;
unsigned int ifindex;
switch (event) {
case EV_READ:
if ((n = imsg_read(ibuf)) == -1)
fatal("imsg_read error");
if (n == 0) /* connection closed */
shut = 1;
break;
case EV_WRITE:
if (msgbuf_write(&ibuf->w) == -1)
fatal("msgbuf_write");
imsg_event_add(ibuf);
return;
default:
fatalx("unknown event");
}
for (;;) {
if ((n = imsg_get(ibuf, &imsg)) == -1)
fatal("rde_dispatch_parent: imsg_read error");
if (n == 0)
break;
switch (imsg.hdr.type) {
case IMSG_NETWORK_ADD:
if (imsg.hdr.len != IMSG_HEADER_SIZE + sizeof(rr)) {
log_warnx("rde_dispatch: wrong imsg len");
break;
}
memcpy(&rr, imsg.data, sizeof(rr));
if ((lsa = rde_asext_get(&rr)) != NULL) {
v = lsa_find(NULL, lsa->hdr.type,
lsa->hdr.ls_id, lsa->hdr.adv_rtr);
lsa_merge(nbrself, lsa, v);
}
break;
case IMSG_NETWORK_DEL:
if (imsg.hdr.len != IMSG_HEADER_SIZE + sizeof(rr)) {
log_warnx("rde_dispatch: wrong imsg len");
break;
}
memcpy(&rr, imsg.data, sizeof(rr));
if ((lsa = rde_asext_put(&rr)) != NULL) {
v = lsa_find(NULL, lsa->hdr.type,
lsa->hdr.ls_id, lsa->hdr.adv_rtr);
/*
* if v == NULL no LSA is in the table and
* nothing has to be done.
*/
if (v)
lsa_merge(nbrself, lsa, v);
}
break;
case IMSG_KROUTE_GET:
if (imsg.hdr.len != IMSG_HEADER_SIZE + sizeof(kr)) {
log_warnx("rde_dispatch: wrong imsg len");
break;
}
memcpy(&kr, imsg.data, sizeof(kr));
if ((rn = rt_find(&kr.prefix, kr.prefixlen,
DT_NET)) != NULL)
rde_send_change_kroute(rn);
else
/* should not happen */
imsg_compose(ibuf_main, IMSG_KROUTE_DELETE, 0,
0, &kr, sizeof(kr));
break;
case IMSG_IFADD:
if ((niface = malloc(sizeof(struct iface))) == NULL)
fatal(NULL);
memcpy(niface, imsg.data, sizeof(struct iface));
LIST_INIT(&niface->nbr_list);
TAILQ_INIT(&niface->ls_ack_list);
RB_INIT(&niface->lsa_tree);
narea = area_find(rdeconf, niface->area_id);
LIST_INSERT_HEAD(&narea->iface_list, niface, entry);
break;
case IMSG_IFDELETE:
if (imsg.hdr.len != IMSG_HEADER_SIZE +
sizeof(ifindex))
fatalx("IFINFO imsg with wrong len");
memcpy(&ifindex, imsg.data, sizeof(ifindex));
iface = if_find(ifindex);
if (iface == NULL)
fatalx("interface lost in ospfe");
LIST_REMOVE(iface, entry);
if_del(iface);
break;
case IMSG_RECONF_CONF:
if ((nconf = malloc(sizeof(struct ospfd_conf))) ==
NULL)
fatal(NULL);
memcpy(nconf, imsg.data, sizeof(struct ospfd_conf));
LIST_INIT(&nconf->area_list);
LIST_INIT(&nconf->cand_list);
break;
case IMSG_RECONF_AREA:
if ((narea = area_new()) == NULL)
fatal(NULL);
memcpy(narea, imsg.data, sizeof(struct area));
LIST_INIT(&narea->iface_list);
LIST_INIT(&narea->nbr_list);
RB_INIT(&narea->lsa_tree);
LIST_INSERT_HEAD(&nconf->area_list, narea, entry);
break;
case IMSG_RECONF_END:
merge_config(rdeconf, nconf);
nconf = NULL;
break;
default:
log_debug("rde_dispatch_parent: unexpected imsg %d",
imsg.hdr.type);
break;
}
imsg_free(&imsg);
}
if (!shut)
imsg_event_add(ibuf);
else {
/* this pipe is dead, so remove the event handler */
event_del(&ibuf->ev);
event_loopexit(NULL);
}
}
void
rde_dump_area(struct area *area, int imsg_type, pid_t pid)
{
struct iface *iface;
/* dump header */
imsg_compose(ibuf_ospfe, IMSG_CTL_AREA, 0, pid, area, sizeof(*area));
/* dump link local lsa */
LIST_FOREACH(iface, &area->iface_list, entry) {
imsg_compose(ibuf_ospfe, IMSG_CTL_IFACE,
0, pid, iface, sizeof(*iface));
lsa_dump(&iface->lsa_tree, imsg_type, pid);
}
/* dump area lsa */
lsa_dump(&area->lsa_tree, imsg_type, pid);
}
u_int32_t
rde_router_id(void)
{
return (rdeconf->rtr_id.s_addr);
}
void
rde_send_change_kroute(struct rt_node *r)
{
struct kroute kr;
struct rt_nexthop *rn;
TAILQ_FOREACH(rn, &r->nexthop, entry) {
if (!rn->invalid)
break;
}
if (!rn)
fatalx("rde_send_change_kroute: no valid nexthop found");
bzero(&kr, sizeof(kr));
kr.prefix = r->prefix;
kr.nexthop = rn->nexthop;
kr.prefixlen = r->prefixlen;
kr.ext_tag = r->ext_tag;
imsg_compose(ibuf_main, IMSG_KROUTE_CHANGE, 0, 0, &kr, sizeof(kr));
}
void
rde_send_delete_kroute(struct rt_node *r)
{
struct kroute kr;
bzero(&kr, sizeof(kr));
kr.prefix = r->prefix;
kr.prefixlen = r->prefixlen;
imsg_compose(ibuf_main, IMSG_KROUTE_DELETE, 0, 0, &kr, sizeof(kr));
}
void
rde_send_summary(pid_t pid)
{
static struct ctl_sum sumctl;
struct timeval now;
struct area *area;
struct vertex *v;
bzero(&sumctl, sizeof(struct ctl_sum));
sumctl.rtr_id.s_addr = rde_router_id();
sumctl.spf_delay = rdeconf->spf_delay;
sumctl.spf_hold_time = rdeconf->spf_hold_time;
LIST_FOREACH(area, &rdeconf->area_list, entry)
sumctl.num_area++;
RB_FOREACH(v, lsa_tree, &asext_tree)
sumctl.num_ext_lsa++;
gettimeofday(&now, NULL);
if (rdeconf->uptime < now.tv_sec)
sumctl.uptime = now.tv_sec - rdeconf->uptime;
else
sumctl.uptime = 0;
rde_imsg_compose_ospfe(IMSG_CTL_SHOW_SUM, 0, pid, &sumctl,
sizeof(sumctl));
}
void
rde_send_summary_area(struct area *area, pid_t pid)
{
static struct ctl_sum_area sumareactl;
struct iface *iface;
struct rde_nbr *nbr;
struct lsa_tree *tree = &area->lsa_tree;
struct vertex *v;
bzero(&sumareactl, sizeof(struct ctl_sum_area));
sumareactl.area.s_addr = area->id.s_addr;
sumareactl.num_spf_calc = area->num_spf_calc;
LIST_FOREACH(iface, &area->iface_list, entry)
sumareactl.num_iface++;
LIST_FOREACH(nbr, &area->nbr_list, entry)
if (nbr->state == NBR_STA_FULL && !nbr->self)
sumareactl.num_adj_nbr++;
RB_FOREACH(v, lsa_tree, tree)
sumareactl.num_lsa++;
rde_imsg_compose_ospfe(IMSG_CTL_SHOW_SUM_AREA, 0, pid, &sumareactl,
sizeof(sumareactl));
}
LIST_HEAD(rde_nbr_head, rde_nbr);
struct nbr_table {
struct rde_nbr_head *hashtbl;
u_int32_t hashmask;
} rdenbrtable;
#define RDE_NBR_HASH(x) \
&rdenbrtable.hashtbl[(x) & rdenbrtable.hashmask]
void
rde_nbr_init(u_int32_t hashsize)
{
struct rde_nbr_head *head;
u_int32_t hs, i;
for (hs = 1; hs < hashsize; hs <<= 1)
;
rdenbrtable.hashtbl = calloc(hs, sizeof(struct rde_nbr_head));
if (rdenbrtable.hashtbl == NULL)
fatal("rde_nbr_init");
for (i = 0; i < hs; i++)
LIST_INIT(&rdenbrtable.hashtbl[i]);
rdenbrtable.hashmask = hs - 1;
if ((nbrself = calloc(1, sizeof(*nbrself))) == NULL)
fatal("rde_nbr_init");
nbrself->id.s_addr = rde_router_id();
nbrself->peerid = NBR_IDSELF;
nbrself->state = NBR_STA_DOWN;
nbrself->self = 1;
head = RDE_NBR_HASH(NBR_IDSELF);
LIST_INSERT_HEAD(head, nbrself, hash);
}
void
rde_nbr_free(void)
{
free(nbrself);
free(rdenbrtable.hashtbl);
}
struct rde_nbr *
rde_nbr_find(u_int32_t peerid)
{
struct rde_nbr_head *head;
struct rde_nbr *nbr;
head = RDE_NBR_HASH(peerid);
LIST_FOREACH(nbr, head, hash) {
if (nbr->peerid == peerid)
return (nbr);
}
return (NULL);
}
struct rde_nbr *
rde_nbr_new(u_int32_t peerid, struct rde_nbr *new)
{
struct rde_nbr_head *head;
struct rde_nbr *nbr;
struct area *area;
struct iface *iface;
if (rde_nbr_find(peerid))
return (NULL);
if ((area = area_find(rdeconf, new->area_id)) == NULL)
fatalx("rde_nbr_new: unknown area");
LIST_FOREACH(iface, &area->iface_list, entry) {
if (iface->ifindex == new->ifindex)
break;
}
if (iface == NULL)
fatalx("rde_nbr_new: unknown interface");
if ((nbr = calloc(1, sizeof(*nbr))) == NULL)
fatal("rde_nbr_new");
memcpy(nbr, new, sizeof(*nbr));
nbr->peerid = peerid;
nbr->area = area;
nbr->iface = iface;
TAILQ_INIT(&nbr->req_list);
head = RDE_NBR_HASH(peerid);
LIST_INSERT_HEAD(head, nbr, hash);
LIST_INSERT_HEAD(&area->nbr_list, nbr, entry);
return (nbr);
}
void
rde_nbr_del(struct rde_nbr *nbr)
{
if (nbr == NULL)
return;
rde_req_list_free(nbr);
LIST_REMOVE(nbr, entry);
LIST_REMOVE(nbr, hash);
free(nbr);
}
int
rde_nbr_loading(struct area *area)
{
struct rde_nbr *nbr;
int checkall = 0;
if (area == NULL) {
area = LIST_FIRST(&rdeconf->area_list);
checkall = 1;
}
while (area != NULL) {
LIST_FOREACH(nbr, &area->nbr_list, entry) {
if (nbr->self)
continue;
if (nbr->state & NBR_STA_XCHNG ||
nbr->state & NBR_STA_LOAD)
return (1);
}
if (!checkall)
break;
area = LIST_NEXT(area, entry);
}
return (0);
}
struct rde_nbr *
rde_nbr_self(struct area *area)
{
struct rde_nbr *nbr;
LIST_FOREACH(nbr, &area->nbr_list, entry)
if (nbr->self)
return (nbr);
/* this may not happen */
fatalx("rde_nbr_self: area without self");
return (NULL);
}
/*
* LSA req list
*/
void
rde_req_list_add(struct rde_nbr *nbr, struct lsa_hdr *lsa)
{
struct rde_req_entry *le;
if ((le = calloc(1, sizeof(*le))) == NULL)
fatal("rde_req_list_add");
TAILQ_INSERT_TAIL(&nbr->req_list, le, entry);
le->type = lsa->type;
le->ls_id = lsa->ls_id;
le->adv_rtr = lsa->adv_rtr;
}
int
rde_req_list_exists(struct rde_nbr *nbr, struct lsa_hdr *lsa_hdr)
{
struct rde_req_entry *le;
TAILQ_FOREACH(le, &nbr->req_list, entry) {
if ((lsa_hdr->type == le->type) &&
(lsa_hdr->ls_id == le->ls_id) &&
(lsa_hdr->adv_rtr == le->adv_rtr))
return (1);
}
return (0);
}
void
rde_req_list_del(struct rde_nbr *nbr, struct lsa_hdr *lsa_hdr)
{
struct rde_req_entry *le;
TAILQ_FOREACH(le, &nbr->req_list, entry) {
if ((lsa_hdr->type == le->type) &&
(lsa_hdr->ls_id == le->ls_id) &&
(lsa_hdr->adv_rtr == le->adv_rtr)) {
TAILQ_REMOVE(&nbr->req_list, le, entry);
free(le);
return;
}
}
}
void
rde_req_list_free(struct rde_nbr *nbr)
{
struct rde_req_entry *le;
while ((le = TAILQ_FIRST(&nbr->req_list)) != NULL) {
TAILQ_REMOVE(&nbr->req_list, le, entry);
free(le);
}
}
/*
* as-external LSA handling
*/
struct lsa *
rde_asext_get(struct rroute *rr)
{
#if 0
struct area *area;
struct iface *iface;
XXX
LIST_FOREACH(area, &rdeconf->area_list, entry)
LIST_FOREACH(iface, &area->iface_list, entry) {
if ((iface->addr.s_addr & iface->mask.s_addr) ==
rr->kr.prefix.s_addr && iface->mask.s_addr ==
prefixlen2mask(rr->kr.prefixlen)) {
/* already announced as (stub) net LSA */
log_debug("rde_asext_get: %s/%d is net LSA",
inet_ntoa(rr->kr.prefix), rr->kr.prefixlen);
return (NULL);
}
}
#endif
/* update of seqnum is done by lsa_merge */
return (orig_asext_lsa(rr, DEFAULT_AGE));
}
struct lsa *
rde_asext_put(struct rroute *rr)
{
/*
* just try to remove the LSA. If the prefix is announced as
* stub net LSA lsa_find() will fail later and nothing will happen.
*/
/* remove by reflooding with MAX_AGE */
return (orig_asext_lsa(rr, MAX_AGE));
}
/*
* summary LSA stuff
*/
void
rde_summary_update(struct rt_node *rte, struct area *area)
{
struct vertex *v = NULL;
//XXX struct lsa *lsa;
u_int16_t type = 0;
/* first check if we actually need to announce this route */
if (!(rte->d_type == DT_NET || rte->flags & OSPF_RTR_E))
return;
/* never create summaries for as-ext LSA */
if (rte->p_type == PT_TYPE1_EXT || rte->p_type == PT_TYPE2_EXT)
return;
/* no need for summary LSA in the originating area */
if (rte->area.s_addr == area->id.s_addr)
return;
/* no need to originate inter-area routes to the backbone */
if (rte->p_type == PT_INTER_AREA && area->id.s_addr == INADDR_ANY)
return;
/* TODO nexthop check, nexthop part of area -> no summary */
if (rte->cost >= LS_INFINITY)
return;
/* TODO AS border router specific checks */
/* TODO inter-area network route stuff */
/* TODO intra-area stuff -- condense LSA ??? */
if (rte->d_type == DT_NET) {
type = LSA_TYPE_INTER_A_PREFIX;
} else if (rte->d_type == DT_RTR) {
type = LSA_TYPE_INTER_A_ROUTER;
} else
#if 0 /* XXX a lot todo */
/* update lsa but only if it was changed */
v = lsa_find(area, type, rte->prefix.s_addr, rde_router_id());
lsa = orig_sum_lsa(rte, area, type, rte->invalid);
lsa_merge(rde_nbr_self(area), lsa, v);
if (v == NULL)
v = lsa_find(area, type, rte->prefix.s_addr, rde_router_id());
#endif
/* suppressed/deleted routes are not found in the second lsa_find */
if (v)
v->cost = rte->cost;
}
/*
* functions for self-originated LSA
*/
struct lsa *
orig_asext_lsa(struct rroute *rr, u_int16_t age)
{
#if 0 /* XXX a lot todo */
struct lsa *lsa;
u_int16_t len;
len = sizeof(struct lsa_hdr) + sizeof(struct lsa_asext);
if ((lsa = calloc(1, len)) == NULL)
fatal("orig_asext_lsa");
log_debug("orig_asext_lsa: %s/%d age %d",
log_in6addr(&rr->kr.prefix), rr->kr.prefixlen, age);
/* LSA header */
lsa->hdr.age = htons(age);
lsa->hdr.type = LSA_TYPE_EXTERNAL;
lsa->hdr.adv_rtr = rdeconf->rtr_id.s_addr;
lsa->hdr.seq_num = htonl(INIT_SEQ_NUM);
lsa->hdr.len = htons(len);
/* prefix and mask */
/*
* TODO ls_id must be unique, for overlapping routes this may
* not be true. In this case a hack needs to be done to
* make the ls_id unique.
*/
lsa->hdr.ls_id = rr->kr.prefix.s_addr;
lsa->data.asext.mask = prefixlen2mask(rr->kr.prefixlen);
/*
* nexthop -- on connected routes we are the nexthop,
* on all other cases we announce the true nexthop.
* XXX this is wrong as the true nexthop may be outside
* of the ospf cloud and so unreachable. For now we force
* all traffic to be directed to us.
*/
lsa->data.asext.fw_addr = 0;
lsa->data.asext.metric = htonl(rr->metric);
lsa->data.asext.ext_tag = htonl(rr->kr.ext_tag);
lsa->hdr.ls_chksum = 0;
lsa->hdr.ls_chksum =
htons(iso_cksum(lsa, len, LS_CKSUM_OFFSET));
return (lsa);
#endif
return NULL;
}
struct lsa *
orig_sum_lsa(struct rt_node *rte, struct area *area, u_int8_t type, int invalid)
{
#if 0 /* XXX a lot todo */
struct lsa *lsa;
u_int16_t len;
len = sizeof(struct lsa_hdr) + sizeof(struct lsa_sum);
if ((lsa = calloc(1, len)) == NULL)
fatal("orig_sum_lsa");
/* LSA header */
lsa->hdr.age = htons(invalid ? MAX_AGE : DEFAULT_AGE);
lsa->hdr.type = type;
lsa->hdr.adv_rtr = rdeconf->rtr_id.s_addr;
lsa->hdr.seq_num = htonl(INIT_SEQ_NUM);
lsa->hdr.len = htons(len);
/* prefix and mask */
/*
* TODO ls_id must be unique, for overlapping routes this may
* not be true. In this case a hack needs to be done to
* make the ls_id unique.
*/
lsa->hdr.ls_id = rte->prefix.s_addr;
if (type == LSA_TYPE_SUM_NETWORK)
lsa->data.sum.mask = prefixlen2mask(rte->prefixlen);
else
lsa->data.sum.mask = 0; /* must be zero per RFC */
lsa->data.sum.metric = htonl(rte->cost & LSA_METRIC_MASK);
lsa->hdr.ls_chksum = 0;
lsa->hdr.ls_chksum =
htons(iso_cksum(lsa, len, LS_CKSUM_OFFSET));
return (lsa);
#endif
return NULL;
}
|