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
|
/* $OpenBSD: adjacency.c,v 1.7 2015/07/21 04:52:29 renato Exp $ */
/*
* Copyright (c) 2009 Michele Marchetto <michele@openbsd.org>
* Copyright (c) 2005 Claudio Jeker <claudio@openbsd.org>
* Copyright (c) 2004, 2005, 2008 Esben Norby <norby@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 <arpa/inet.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "ldpd.h"
#include "ldpe.h"
#include "control.h"
#include "log.h"
extern struct ldpd_conf *leconf;
void adj_itimer(int, short, void *);
char *print_hello_src(struct hello_source *);
void tnbr_hello_timer(int, short, void *);
void tnbr_start_hello_timer(struct tnbr *);
void tnbr_stop_hello_timer(struct tnbr *);
struct adj *
adj_new(struct nbr *nbr, struct hello_source *source, struct in_addr addr)
{
struct adj *adj;
log_debug("adj_new: LSR ID %s, %s", inet_ntoa(nbr->id),
print_hello_src(source));
if ((adj = calloc(1, sizeof(*adj))) == NULL)
fatal("adj_new");
adj->nbr = nbr;
memcpy(&adj->source, source, sizeof(*source));
adj->addr = addr;
evtimer_set(&adj->inactivity_timer, adj_itimer, adj);
LIST_INSERT_HEAD(&nbr->adj_list, adj, nbr_entry);
switch (source->type) {
case HELLO_LINK:
LIST_INSERT_HEAD(&source->link.iface->adj_list, adj,
iface_entry);
break;
case HELLO_TARGETED:
source->target->adj = adj;
break;
}
return (adj);
}
void
adj_del(struct adj *adj)
{
log_debug("adj_del: LSR ID %s, %s", inet_ntoa(adj->nbr->id),
print_hello_src(&adj->source));
adj_stop_itimer(adj);
LIST_REMOVE(adj, nbr_entry);
/* last adjacency deleted */
if (LIST_EMPTY(&adj->nbr->adj_list))
nbr_del(adj->nbr);
free(adj);
}
struct adj *
adj_find(struct nbr *nbr, struct hello_source *source)
{
struct adj *adj;
LIST_FOREACH(adj, &nbr->adj_list, nbr_entry) {
if (adj->source.type != source->type)
continue;
switch (source->type) {
case HELLO_LINK:
if (adj->source.link.src_addr.s_addr ==
source->link.src_addr.s_addr)
return (adj);
break;
case HELLO_TARGETED:
if (adj->source.target == source->target)
return (adj);
break;
}
}
return (NULL);
}
char *
print_hello_src(struct hello_source *src)
{
static char buffer[64];
switch (src->type) {
case HELLO_LINK:
snprintf(buffer, sizeof(buffer), "iface %s",
src->link.iface->name);
break;
case HELLO_TARGETED:
snprintf(buffer, sizeof(buffer), "source %s",
inet_ntoa(src->target->addr));
break;
}
return (buffer);
}
/* adjacency timers */
/* ARGSUSED */
void
adj_itimer(int fd, short event, void *arg)
{
struct adj *adj = arg;
log_debug("adj_itimer: LDP ID %s", inet_ntoa(adj->nbr->id));
switch (adj->source.type) {
case HELLO_LINK:
LIST_REMOVE(adj, iface_entry);
break;
case HELLO_TARGETED:
if (!(adj->source.target->flags & F_TNBR_CONFIGURED) &&
adj->source.target->pw_count == 0) {
/* remove dynamic targeted neighbor */
LIST_REMOVE(adj->source.target, entry);
tnbr_del(adj->source.target);
return;
}
adj->source.target->adj = NULL;
break;
}
adj_del(adj);
}
void
adj_start_itimer(struct adj *adj)
{
struct timeval tv;
timerclear(&tv);
tv.tv_sec = adj->holdtime;
if (evtimer_add(&adj->inactivity_timer, &tv) == -1)
fatal("adj_start_itimer");
}
void
adj_stop_itimer(struct adj *adj)
{
if (evtimer_pending(&adj->inactivity_timer, NULL) &&
evtimer_del(&adj->inactivity_timer) == -1)
fatal("adj_stop_itimer");
}
/* targeted neighbors */
struct tnbr *
tnbr_new(struct ldpd_conf *xconf, struct in_addr addr)
{
struct tnbr *tnbr;
if ((tnbr = calloc(1, sizeof(*tnbr))) == NULL)
fatal("tnbr_new");
tnbr->addr.s_addr = addr.s_addr;
tnbr->hello_holdtime = xconf->thello_holdtime;
tnbr->hello_interval = xconf->thello_interval;
return (tnbr);
}
void
tnbr_del(struct tnbr *tnbr)
{
tnbr_stop_hello_timer(tnbr);
if (tnbr->adj)
adj_del(tnbr->adj);
free(tnbr);
}
struct tnbr *
tnbr_check(struct tnbr *tnbr)
{
if (!(tnbr->flags & (F_TNBR_CONFIGURED|F_TNBR_DYNAMIC)) &&
tnbr->pw_count == 0) {
LIST_REMOVE(tnbr, entry);
tnbr_del(tnbr);
return (NULL);
}
return (tnbr);
}
void
tnbr_init(struct ldpd_conf *xconf, struct tnbr *tnbr)
{
/* set event handlers for targeted neighbor */
evtimer_set(&tnbr->hello_timer, tnbr_hello_timer, tnbr);
tnbr->discovery_fd = xconf->ldp_ediscovery_socket;
tnbr_start_hello_timer(tnbr);
}
struct tnbr *
tnbr_find(struct ldpd_conf *xconf, struct in_addr addr)
{
struct tnbr *tnbr;
LIST_FOREACH(tnbr, &xconf->tnbr_list, entry)
if (addr.s_addr == tnbr->addr.s_addr)
return (tnbr);
return (NULL);
}
/* target neighbors timers */
/* ARGSUSED */
void
tnbr_hello_timer(int fd, short event, void *arg)
{
struct tnbr *tnbr = arg;
struct timeval tv;
send_hello(HELLO_TARGETED, NULL, tnbr);
/* reschedule hello_timer */
timerclear(&tv);
tv.tv_sec = tnbr->hello_interval;
if (evtimer_add(&tnbr->hello_timer, &tv) == -1)
fatal("tnbr_hello_timer");
}
void
tnbr_start_hello_timer(struct tnbr *tnbr)
{
struct timeval tv;
send_hello(HELLO_TARGETED, NULL, tnbr);
timerclear(&tv);
tv.tv_sec = tnbr->hello_interval;
if (evtimer_add(&tnbr->hello_timer, &tv) == -1)
fatal("tnbr_start_hello_timer");
}
void
tnbr_stop_hello_timer(struct tnbr *tnbr)
{
if (evtimer_pending(&tnbr->hello_timer, NULL) &&
evtimer_del(&tnbr->hello_timer) == -1)
fatal("tnbr_stop_hello_timer");
}
struct ctl_adj *
adj_to_ctl(struct adj *adj)
{
static struct ctl_adj actl;
actl.id.s_addr = adj->nbr->id.s_addr;
actl.type = adj->source.type;
switch (adj->source.type) {
case HELLO_LINK:
memcpy(actl.ifname, adj->source.link.iface->name,
sizeof(actl.ifname));
break;
case HELLO_TARGETED:
actl.src_addr.s_addr = adj->source.target->addr.s_addr;
break;
}
actl.holdtime = adj->holdtime;
return (&actl);
}
void
ldpe_adj_ctl(struct ctl_conn *c)
{
struct adj *adj;
struct iface *iface;
struct tnbr *tnbr;
struct ctl_adj *actl;
/* basic discovery mechanism */
LIST_FOREACH(iface, &leconf->iface_list, entry)
LIST_FOREACH(adj, &iface->adj_list, iface_entry) {
actl = adj_to_ctl(adj);
imsg_compose_event(&c->iev, IMSG_CTL_SHOW_DISCOVERY,
0, 0, -1, actl, sizeof(struct ctl_adj));
}
/* extended discovery mechanism */
LIST_FOREACH(tnbr, &leconf->tnbr_list, entry)
if (tnbr->adj) {
actl = adj_to_ctl(tnbr->adj);
imsg_compose_event(&c->iev, IMSG_CTL_SHOW_DISCOVERY,
0, 0, -1, actl, sizeof(struct ctl_adj));
}
imsg_compose_event(&c->iev, IMSG_CTL_END, 0, 0, -1, NULL, 0);
}
|