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
|
/* $OpenBSD: lde.c,v 1.6 2009/09/28 09:48:46 michele 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 "ldp.h"
#include "ldpd.h"
#include "ldpe.h"
#include "log.h"
#include "lde.h"
void lde_sig_handler(int sig, short, void *);
void lde_shutdown(void);
void lde_dispatch_imsg(int, short, void *);
void lde_dispatch_parent(int, short, void *);
void lde_nbr_init(u_int32_t);
void lde_nbr_free(void);
struct lde_nbr *lde_nbr_find(u_int32_t);
struct lde_nbr *lde_nbr_new(u_int32_t, struct lde_nbr *);
void lde_nbr_del(struct lde_nbr *);
void lde_address_list_free(struct lde_nbr *);
void lde_req_list_free(struct lde_nbr *);
void lde_map_list_free(struct lde_nbr *);
struct ldpd_conf *ldeconf = NULL, *nconf = NULL;
struct imsgev *iev_ldpe;
struct imsgev *iev_main;
struct lde_nbr *nbrself;
/* ARGSUSED */
void
lde_sig_handler(int sig, short event, void *arg)
{
/*
* signal handler rules don't apply, libevent decouples for us
*/
switch (sig) {
case SIGINT:
case SIGTERM:
lde_shutdown();
/* NOTREACHED */
default:
fatalx("unexpected signal");
}
}
/* label decision engine */
pid_t
lde(struct ldpd_conf *xconf, int pipe_parent2lde[2], int pipe_ldpe2lde[2],
int pipe_parent2ldpe[2])
{
struct event ev_sigint, ev_sigterm;
struct timeval now;
struct passwd *pw;
pid_t pid;
switch (pid = fork()) {
case -1:
fatal("cannot fork");
/* NOTREACHED */
case 0:
break;
default:
return (pid);
}
ldeconf = xconf;
if ((pw = getpwnam(LDPD_USER)) == NULL)
fatal("getpwnam");
if (chroot(pw->pw_dir) == -1)
fatal("chroot");
if (chdir("/") == -1)
fatal("chdir(\"/\")");
setproctitle("label decision engine");
ldpd_process = PROC_LDE_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();
lde_nbr_init(NBR_HASHSIZE);
/* setup signal handler */
signal_set(&ev_sigint, SIGINT, lde_sig_handler, NULL);
signal_set(&ev_sigterm, SIGTERM, lde_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_ldpe2lde[0]);
close(pipe_parent2lde[0]);
close(pipe_parent2ldpe[0]);
close(pipe_parent2ldpe[1]);
if ((iev_ldpe = malloc(sizeof(struct imsgev))) == NULL ||
(iev_main = malloc(sizeof(struct imsgev))) == NULL)
fatal(NULL);
imsg_init(&iev_ldpe->ibuf, pipe_ldpe2lde[1]);
iev_ldpe->handler = lde_dispatch_imsg;
imsg_init(&iev_main->ibuf, pipe_parent2lde[1]);
iev_main->handler = lde_dispatch_parent;
/* setup event handler */
iev_ldpe->events = EV_READ;
event_set(&iev_ldpe->ev, iev_ldpe->ibuf.fd, iev_ldpe->events,
iev_ldpe->handler, iev_ldpe);
event_add(&iev_ldpe->ev, NULL);
iev_main->events = EV_READ;
event_set(&iev_main->ev, iev_main->ibuf.fd, iev_main->events,
iev_main->handler, iev_main);
event_add(&iev_main->ev, NULL);
rt_init();
gettimeofday(&now, NULL);
ldeconf->uptime = now.tv_sec;
event_dispatch();
lde_shutdown();
/* NOTREACHED */
return (0);
}
void
lde_shutdown(void)
{
rt_clear();
lde_nbr_free();
msgbuf_clear(&iev_ldpe->ibuf.w);
free(iev_ldpe);
msgbuf_clear(&iev_main->ibuf.w);
free(iev_main);
free(ldeconf);
log_info("label decision engine exiting");
_exit(0);
}
int
lde_imsg_compose_ldpe(int type, u_int32_t peerid, pid_t pid, void *data,
u_int16_t datalen)
{
return (imsg_compose_event(iev_ldpe, type, peerid, pid,
-1, data, datalen));
}
/* ARGSUSED */
void
lde_dispatch_imsg(int fd, short event, void *bula)
{
struct imsgev *iev = bula;
struct imsgbuf *ibuf = &iev->ibuf;
struct imsg imsg;
struct lde_nbr rn, *nbr;
struct map map;
struct timespec tp;
struct in_addr addr;
ssize_t n;
time_t now;
int state, shut = 0;
if (event & EV_READ) {
if ((n = imsg_read(ibuf)) == -1)
fatal("imsg_read error");
if (n == 0) /* connection closed */
shut = 1;
}
if (event & EV_WRITE) {
if (msgbuf_write(&ibuf->w) == -1)
fatal("msgbuf_write");
}
clock_gettime(CLOCK_MONOTONIC, &tp);
now = tp.tv_sec;
for (;;) {
if ((n = imsg_get(ibuf, &imsg)) == -1)
fatal("lde_dispatch_imsg: imsg_read error");
if (n == 0)
break;
switch (imsg.hdr.type) {
case IMSG_LABEL_MAPPING:
if (imsg.hdr.len - IMSG_HEADER_SIZE != sizeof(map))
fatalx("invalid size of OE request");
memcpy(&map, imsg.data, sizeof(map));
nbr = lde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL) {
log_debug("lde_dispatch_imsg: cannot find "
"lde neighbor");
return;
}
lde_check_mapping(&map, nbr);
break;
case IMSG_LABEL_MAPPING_FULL:
rt_snap(imsg.hdr.peerid);
lde_imsg_compose_ldpe(IMSG_MAPPING_ADD_END,
imsg.hdr.peerid, 0, 0, 0);
break;
case IMSG_LABEL_REQUEST:
if (imsg.hdr.len - IMSG_HEADER_SIZE != sizeof(map))
fatalx("invalid size of OE request");
memcpy(&map, imsg.data, sizeof(map));
nbr = lde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL) {
log_debug("lde_dispatch_imsg: cannot find "
"lde neighbor");
return;
}
lde_check_request(&map, nbr);
break;
case IMSG_ADDRESS_ADD:
if (imsg.hdr.len - IMSG_HEADER_SIZE != sizeof(addr))
fatalx("invalid size of OE request");
memcpy(&addr, imsg.data, sizeof(addr));
nbr = lde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL) {
log_debug("lde_dispatch_imsg: cannot find "
"lde neighbor");
return;
}
if (lde_address_add(nbr, &addr) < 0) {
log_debug("lde_dispatch_imsg: cannot add "
"address %s, it already exists",
inet_ntoa(addr));
}
break;
case IMSG_ADDRESS_DEL:
if (imsg.hdr.len - IMSG_HEADER_SIZE != sizeof(addr))
fatalx("invalid size of OE request");
memcpy(&addr, imsg.data, sizeof(addr));
nbr = lde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL) {
log_debug("lde_dispatch_imsg: cannot find "
"lde neighbor");
return;
}
if (lde_address_del(nbr, &addr) < 0) {
log_debug("lde_dispatch_imsg: cannot delete "
"address %s, it does not exists",
inet_ntoa(addr));
}
break;
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 (lde_nbr_find(imsg.hdr.peerid))
fatalx("lde_dispatch_imsg: "
"neighbor already exists");
lde_nbr_new(imsg.hdr.peerid, &rn);
break;
case IMSG_NEIGHBOR_DOWN:
lde_nbr_del(lde_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 = lde_nbr_find(imsg.hdr.peerid);
if (nbr == NULL)
break;
nbr->state = state;
break;
case IMSG_CTL_SHOW_LIB:
rt_dump(imsg.hdr.pid);
imsg_compose_event(iev_ldpe, IMSG_CTL_END, 0,
imsg.hdr.pid, -1, NULL, 0);
break;
default:
log_debug("lde_dispatch_imsg: unexpected imsg %d",
imsg.hdr.type);
break;
}
imsg_free(&imsg);
}
if (!shut)
imsg_event_add(iev);
else {
/* this pipe is dead, so remove the event handler */
event_del(&iev->ev);
event_loopexit(NULL);
}
}
/* ARGSUSED */
void
lde_dispatch_parent(int fd, short event, void *bula)
{
struct imsg imsg;
struct kroute kr;
struct rroute rr;
struct imsgev *iev = bula;
struct imsgbuf *ibuf = &iev->ibuf;
ssize_t n;
int shut = 0;
if (event & EV_READ) {
if ((n = imsg_read(ibuf)) == -1)
fatal("imsg_read error");
if (n == 0) /* connection closed */
shut = 1;
}
if (event & EV_WRITE) {
if (msgbuf_write(&ibuf->w) == -1)
fatal("msgbuf_write");
}
for (;;) {
if ((n = imsg_get(ibuf, &imsg)) == -1)
fatal("lde_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("lde_dispatch_parent: "
"wrong imsg len");
break;
}
memcpy(&rr, imsg.data, sizeof(rr));
lde_kernel_insert(&rr.kr);
break;
case IMSG_NETWORK_DEL:
if (imsg.hdr.len != IMSG_HEADER_SIZE + sizeof(kr)) {
log_warnx("lde_dispatch_parent: "
"wrong imsg len");
break;
}
memcpy(&kr, imsg.data, sizeof(kr));
lde_kernel_remove(&kr);
break;
case IMSG_RECONF_CONF:
if ((nconf = malloc(sizeof(struct ldpd_conf))) ==
NULL)
fatal(NULL);
memcpy(nconf, imsg.data, sizeof(struct ldpd_conf));
break;
case IMSG_RECONF_AREA:
break;
case IMSG_RECONF_IFACE:
break;
case IMSG_RECONF_END:
break;
default:
log_debug("lde_dispatch_parent: unexpected imsg %d",
imsg.hdr.type);
break;
}
imsg_free(&imsg);
}
if (!shut)
imsg_event_add(iev);
else {
/* this pipe is dead, so remove the event handler */
event_del(&iev->ev);
event_loopexit(NULL);
}
}
u_int32_t
lde_router_id(void)
{
return (ldeconf->rtr_id.s_addr);
}
void
lde_send_insert_klabel(struct rt_node *r)
{
struct kroute kr;
bzero(&kr, sizeof(kr));
kr.prefix.s_addr = r->prefix.s_addr;
kr.nexthop.s_addr = r->nexthop.s_addr;
kr.local_label = r->local_label;
kr.remote_label = r->remote_label;
kr.prefixlen = r->prefixlen;
kr.ext_tag = r->ext_tag;
imsg_compose_event(iev_main, IMSG_KLABEL_INSERT, 0, 0, -1,
&kr, sizeof(kr));
}
void
lde_send_change_klabel(struct rt_node *r)
{
struct kroute kr;
bzero(&kr, sizeof(kr));
kr.prefix.s_addr = r->prefix.s_addr;
kr.nexthop.s_addr = r->nexthop.s_addr;
kr.local_label = r->local_label;
kr.remote_label = r->remote_label;
kr.prefixlen = r->prefixlen;
kr.ext_tag = r->ext_tag;
imsg_compose_event(iev_main, IMSG_KLABEL_CHANGE, 0, 0, -1,
&kr, sizeof(kr));
}
void
lde_send_delete_klabel(struct rt_node *r)
{
struct kroute kr;
bzero(&kr, sizeof(kr));
kr.prefix.s_addr = r->prefix.s_addr;
kr.prefixlen = r->prefixlen;
imsg_compose_event(iev_main, IMSG_KLABEL_DELETE, 0, 0, -1,
&kr, sizeof(kr));
}
void
lde_send_labelrequest(u_int32_t peerid, struct map *map)
{
imsg_compose_event(iev_ldpe, IMSG_REQUEST_ADD, peerid, 0,
-1, map, sizeof(*map));
imsg_compose_event(iev_ldpe, IMSG_REQUEST_ADD_END, peerid, 0,
-1, NULL, 0);
}
void
lde_send_labelmapping(u_int32_t peerid, struct map *map)
{
imsg_compose_event(iev_ldpe, IMSG_MAPPING_ADD, peerid, 0,
-1, map, sizeof(*map));
imsg_compose_event(iev_ldpe, IMSG_MAPPING_ADD_END, peerid, 0,
-1, NULL, 0);
}
void
lde_send_labelrelease(u_int32_t peerid, struct map *map)
{
imsg_compose_event(iev_ldpe, IMSG_RELEASE_ADD, peerid, 0,
-1, map, sizeof(*map));
imsg_compose_event(iev_ldpe, IMSG_RELEASE_ADD_END, peerid, 0,
-1, NULL, 0);
}
void
lde_send_notification(u_int32_t peerid, u_int32_t code, u_int32_t msgid,
u_int32_t type)
{
struct notify_msg nm;
bzero(&nm, sizeof(nm));
/* Every field is in host byte order, to keep things clear */
nm.status = code;
nm.messageid = ntohl(msgid);
nm.type = type;
imsg_compose_event(iev_ldpe, IMSG_NOTIFICATION_SEND, peerid, 0,
-1, &nm, sizeof(nm));
}
LIST_HEAD(lde_nbr_head, lde_nbr);
struct nbr_table {
struct lde_nbr_head *hashtbl;
u_int32_t hashmask;
} ldenbrtable;
#define LDE_NBR_HASH(x) \
&ldenbrtable.hashtbl[(x) & ldenbrtable.hashmask]
void
lde_nbr_init(u_int32_t hashsize)
{
struct lde_nbr_head *head;
u_int32_t hs, i;
for (hs = 1; hs < hashsize; hs <<= 1)
;
ldenbrtable.hashtbl = calloc(hs, sizeof(struct lde_nbr_head));
if (ldenbrtable.hashtbl == NULL)
fatal("lde_nbr_init");
for (i = 0; i < hs; i++)
LIST_INIT(&ldenbrtable.hashtbl[i]);
ldenbrtable.hashmask = hs - 1;
if ((nbrself = calloc(1, sizeof(*nbrself))) == NULL)
fatal("lde_nbr_init");
nbrself->id.s_addr = lde_router_id();
nbrself->peerid = NBR_IDSELF;
nbrself->state = NBR_STA_DOWN;
nbrself->self = 1;
head = LDE_NBR_HASH(NBR_IDSELF);
LIST_INSERT_HEAD(head, nbrself, hash);
}
void
lde_nbr_free(void)
{
free(nbrself);
free(ldenbrtable.hashtbl);
}
struct lde_nbr *
lde_nbr_find(u_int32_t peerid)
{
struct lde_nbr_head *head;
struct lde_nbr *nbr;
head = LDE_NBR_HASH(peerid);
LIST_FOREACH(nbr, head, hash) {
if (nbr->peerid == peerid)
return (nbr);
}
return (NULL);
}
struct lde_nbr *
lde_nbr_new(u_int32_t peerid, struct lde_nbr *new)
{
struct lde_nbr_head *head;
struct lde_nbr *nbr;
struct iface *iface;
if (lde_nbr_find(peerid))
return (NULL);
if ((nbr = calloc(1, sizeof(*nbr))) == NULL)
fatal("lde_nbr_new");
memcpy(nbr, new, sizeof(*nbr));
nbr->peerid = peerid;
TAILQ_INIT(&nbr->addr_list);
TAILQ_INIT(&nbr->req_list);
TAILQ_INIT(&nbr->sent_map_list);
TAILQ_INIT(&nbr->recv_map_list);
head = LDE_NBR_HASH(peerid);
LIST_INSERT_HEAD(head, nbr, hash);
LIST_FOREACH(iface, &ldeconf->iface_list, entry) {
if (iface->ifindex == new->ifindex) {
LIST_INSERT_HEAD(&iface->lde_nbr_list, nbr, entry);
break;
}
}
return (nbr);
}
int
lde_address_add(struct lde_nbr *lr, struct in_addr *addr)
{
struct lde_nbr_address *address;
if (lde_address_find(lr, addr) != NULL)
return (-1);
if ((address = calloc(1, sizeof(*address))) == NULL)
fatal("lde_address_add");
address->addr.s_addr = addr->s_addr;
TAILQ_INSERT_TAIL(&lr->addr_list, address, entry);
log_debug("lde_address_add: added %s", inet_ntoa(*addr));
return (0);
}
struct lde_nbr_address *
lde_address_find(struct lde_nbr *lr, struct in_addr *addr)
{
struct lde_nbr_address *address = NULL;
TAILQ_FOREACH(address, &lr->addr_list, entry) {
if (address->addr.s_addr == addr->s_addr)
return (address);
}
return (NULL);
}
int
lde_address_del(struct lde_nbr *lr, struct in_addr *addr)
{
struct lde_nbr_address *address;
address = lde_address_find(lr, addr);
if (address == NULL)
return (-1);
TAILQ_REMOVE(&lr->addr_list, address, entry);
free(address);
log_debug("lde_address_del: deleted %s", inet_ntoa(*addr));
return (0);
}
void
lde_address_list_free(struct lde_nbr *nbr)
{
struct lde_nbr_address *addr;
while ((addr = TAILQ_FIRST(&nbr->addr_list)) != NULL) {
TAILQ_REMOVE(&nbr->addr_list, addr, entry);
free(addr);
}
}
void
lde_req_list_free(struct lde_nbr *nbr)
{
struct lde_req_entry *req;
while ((req = TAILQ_FIRST(&nbr->req_list)) != NULL) {
TAILQ_REMOVE(&nbr->req_list, req, entry);
free(req);
}
}
void
lde_map_list_free(struct lde_nbr *nbr)
{
struct lde_map_entry *map;
while ((map = TAILQ_FIRST(&nbr->recv_map_list)) != NULL) {
TAILQ_REMOVE(&nbr->recv_map_list, map, entry);
free(map);
}
while ((map = TAILQ_FIRST(&nbr->sent_map_list)) != NULL) {
TAILQ_REMOVE(&nbr->sent_map_list, map, entry);
free(map);
}
}
void
lde_nbr_del(struct lde_nbr *nbr)
{
if (nbr == NULL)
return;
lde_req_list_free(nbr);
lde_map_list_free(nbr);
lde_address_list_free(nbr);
LIST_REMOVE(nbr, hash);
LIST_REMOVE(nbr, entry);
free(nbr);
}
struct lde_nbr *
lde_find_address(struct in_addr address)
{
struct iface *iface;
struct lde_nbr *ln;
LIST_FOREACH(iface, &ldeconf->iface_list, entry) {
LIST_FOREACH(ln, &iface->lde_nbr_list, entry) {
if (lde_address_find(ln, &address) != NULL)
return (ln);
}
}
return (NULL);
}
|