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
|
/*
* Code for encoding/decoding FPM messages that are in netlink format.
*
* Copyright (C) 1997, 98, 99 Kunihiro Ishiguro
* Copyright (C) 2012 by Open Source Routing.
* Copyright (C) 2012 by Internet Systems Consortium, Inc. ("ISC")
*
* This file is part of GNU Zebra.
*
* GNU Zebra is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2, or (at your option) any
* later version.
*
* GNU Zebra is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU Zebra; see the file COPYING. If not, write to the Free
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-1307, USA.
*/
#include <zebra.h>
#include "log.h"
#include "rib.h"
#include "rt_netlink.h"
#include "zebra_fpm_private.h"
/*
* addr_to_a
*
* Returns string representation of an address of the given AF.
*/
static inline const char *
addr_to_a (u_char af, void *addr)
{
if (!addr)
return "<No address>";
switch (af)
{
case AF_INET:
return inet_ntoa (*((struct in_addr *) addr));
#ifdef HAVE_IPV6
case AF_INET6:
return inet6_ntoa (*((struct in6_addr *) addr));
#endif
default:
return "<Addr in unknown AF>";
}
}
/*
* prefix_addr_to_a
*
* Convience wrapper that returns a human-readable string for the
* address in a prefix.
*/
static const char *
prefix_addr_to_a (struct prefix *prefix)
{
if (!prefix)
return "<No address>";
return addr_to_a (prefix->family, &prefix->u.prefix);
}
/*
* af_addr_size
*
* The size of an address in a given address family.
*/
static size_t
af_addr_size (u_char af)
{
switch (af)
{
case AF_INET:
return 4;
#ifdef HAVE_IPV6
case AF_INET6:
return 16;
#endif
default:
assert(0);
return 16;
}
}
/*
* netlink_nh_info_t
*
* Holds information about a single nexthop for netlink. These info
* structures are transient and may contain pointers into rib
* data structures for convenience.
*/
typedef struct netlink_nh_info_t_
{
uint32_t if_index;
union g_addr *gateway;
/*
* Information from the struct nexthop from which this nh was
* derived. For debug purposes only.
*/
int recursive;
enum nexthop_types_t type;
} netlink_nh_info_t;
/*
* netlink_route_info_t
*
* A structure for holding information for a netlink route message.
*/
typedef struct netlink_route_info_t_
{
uint16_t nlmsg_type;
u_char rtm_type;
uint32_t rtm_table;
u_char rtm_protocol;
u_char af;
struct prefix *prefix;
uint32_t *metric;
int num_nhs;
/*
* Nexthop structures. We keep things simple for now by enforcing a
* maximum of 64 in case MULTIPATH_NUM is 0;
*/
netlink_nh_info_t nhs[MAX (MULTIPATH_NUM, 64)];
union g_addr *pref_src;
} netlink_route_info_t;
/*
* netlink_route_info_add_nh
*
* Add information about the given nexthop to the given route info
* structure.
*
* Returns TRUE if a nexthop was added, FALSE otherwise.
*/
static int
netlink_route_info_add_nh (netlink_route_info_t *ri, struct nexthop *nexthop,
int recursive)
{
netlink_nh_info_t nhi;
union g_addr *src;
memset (&nhi, 0, sizeof (nhi));
src = NULL;
if (ri->num_nhs >= (int) ZEBRA_NUM_OF (ri->nhs))
return 0;
nhi.recursive = recursive;
nhi.type = nexthop->type;
nhi.if_index = nexthop->ifindex;
if (nexthop->type == NEXTHOP_TYPE_IPV4
|| nexthop->type == NEXTHOP_TYPE_IPV4_IFINDEX)
{
nhi.gateway = &nexthop->gate;
if (nexthop->src.ipv4.s_addr)
src = &nexthop->src;
}
#ifdef HAVE_IPV6
if (nexthop->type == NEXTHOP_TYPE_IPV6
|| nexthop->type == NEXTHOP_TYPE_IPV6_IFNAME
|| nexthop->type == NEXTHOP_TYPE_IPV6_IFINDEX)
{
nhi.gateway = &nexthop->gate;
}
#endif /* HAVE_IPV6 */
if (nexthop->type == NEXTHOP_TYPE_IFINDEX
|| nexthop->type == NEXTHOP_TYPE_IFNAME)
{
if (nexthop->src.ipv4.s_addr)
src = &nexthop->src;
}
if (!nhi.gateway && nhi.if_index == 0)
return 0;
/*
* We have a valid nhi. Copy the structure over to the route_info.
*/
ri->nhs[ri->num_nhs] = nhi;
ri->num_nhs++;
if (src && !ri->pref_src)
ri->pref_src = src;
return 1;
}
/*
* netlink_proto_from_route_type
*/
static u_char
netlink_proto_from_route_type (int type)
{
switch (type)
{
case ZEBRA_ROUTE_KERNEL:
case ZEBRA_ROUTE_CONNECT:
return RTPROT_KERNEL;
default:
return RTPROT_ZEBRA;
}
}
/*
* netlink_route_info_fill
*
* Fill out the route information object from the given route.
*
* Returns TRUE on success and FALSE on failure.
*/
static int
netlink_route_info_fill (netlink_route_info_t *ri, int cmd,
rib_dest_t *dest, struct rib *rib)
{
struct nexthop *nexthop, *tnexthop;
int recursing;
int discard;
memset (ri, 0, sizeof (*ri));
ri->prefix = rib_dest_prefix (dest);
ri->af = rib_dest_af (dest);
ri->nlmsg_type = cmd;
ri->rtm_table = rib_dest_vrf (dest)->id;
ri->rtm_protocol = RTPROT_UNSPEC;
/*
* An RTM_DELROUTE need not be accompanied by any nexthops,
* particularly in our communication with the FPM.
*/
if (cmd == RTM_DELROUTE && !rib)
goto skip;
if (rib)
ri->rtm_protocol = netlink_proto_from_route_type (rib->type);
if ((rib->flags & ZEBRA_FLAG_BLACKHOLE) || (rib->flags & ZEBRA_FLAG_REJECT))
discard = 1;
else
discard = 0;
if (cmd == RTM_NEWROUTE)
{
if (discard)
{
if (rib->flags & ZEBRA_FLAG_BLACKHOLE)
ri->rtm_type = RTN_BLACKHOLE;
else if (rib->flags & ZEBRA_FLAG_REJECT)
ri->rtm_type = RTN_UNREACHABLE;
else
assert (0);
}
else
ri->rtm_type = RTN_UNICAST;
}
ri->metric = &rib->metric;
if (discard)
{
goto skip;
}
for (ALL_NEXTHOPS_RO(rib->nexthop, nexthop, tnexthop, recursing))
{
if (MULTIPATH_NUM != 0 && ri->num_nhs >= MULTIPATH_NUM)
break;
if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE))
continue;
if ((cmd == RTM_NEWROUTE
&& CHECK_FLAG (nexthop->flags, NEXTHOP_FLAG_ACTIVE))
|| (cmd == RTM_DELROUTE
&& CHECK_FLAG (nexthop->flags, NEXTHOP_FLAG_FIB)))
{
netlink_route_info_add_nh (ri, nexthop, recursing);
}
}
/* If there is no useful nexthop then return. */
if (ri->num_nhs == 0)
{
zfpm_debug ("netlink_encode_route(): No useful nexthop.");
return 0;
}
skip:
return 1;
}
/*
* netlink_route_info_encode
*
* Returns the number of bytes written to the buffer. 0 or a negative
* value indicates an error.
*/
static int
netlink_route_info_encode (netlink_route_info_t *ri, char *in_buf,
size_t in_buf_len)
{
int bytelen;
int nexthop_num = 0;
size_t buf_offset;
netlink_nh_info_t *nhi;
struct
{
struct nlmsghdr n;
struct rtmsg r;
char buf[1];
} *req;
req = (void *) in_buf;
buf_offset = ((char *) req->buf) - ((char *) req);
if (in_buf_len < buf_offset) {
assert(0);
return 0;
}
memset (req, 0, buf_offset);
bytelen = af_addr_size (ri->af);
req->n.nlmsg_len = NLMSG_LENGTH (sizeof (struct rtmsg));
req->n.nlmsg_flags = NLM_F_CREATE | NLM_F_REQUEST;
req->n.nlmsg_type = ri->nlmsg_type;
req->r.rtm_family = ri->af;
req->r.rtm_table = ri->rtm_table;
req->r.rtm_dst_len = ri->prefix->prefixlen;
req->r.rtm_protocol = ri->rtm_protocol;
req->r.rtm_scope = RT_SCOPE_UNIVERSE;
addattr_l (&req->n, in_buf_len, RTA_DST, &ri->prefix->u.prefix, bytelen);
req->r.rtm_type = ri->rtm_type;
/* Metric. */
if (ri->metric)
addattr32 (&req->n, in_buf_len, RTA_PRIORITY, *ri->metric);
if (ri->num_nhs == 0)
goto done;
if (ri->num_nhs == 1)
{
nhi = &ri->nhs[0];
if (nhi->gateway)
{
addattr_l (&req->n, in_buf_len, RTA_GATEWAY, nhi->gateway,
bytelen);
}
if (nhi->if_index)
{
addattr32 (&req->n, in_buf_len, RTA_OIF, nhi->if_index);
}
goto done;
}
/*
* Multipath case.
*/
char buf[NL_PKT_BUF_SIZE];
struct rtattr *rta = (void *) buf;
struct rtnexthop *rtnh;
rta->rta_type = RTA_MULTIPATH;
rta->rta_len = RTA_LENGTH (0);
rtnh = RTA_DATA (rta);
for (nexthop_num = 0; nexthop_num < ri->num_nhs; nexthop_num++)
{
nhi = &ri->nhs[nexthop_num];
rtnh->rtnh_len = sizeof (*rtnh);
rtnh->rtnh_flags = 0;
rtnh->rtnh_hops = 0;
rtnh->rtnh_ifindex = 0;
rta->rta_len += rtnh->rtnh_len;
if (nhi->gateway)
{
rta_addattr_l (rta, sizeof (buf), RTA_GATEWAY, nhi->gateway, bytelen);
rtnh->rtnh_len += sizeof (struct rtattr) + bytelen;
}
if (nhi->if_index)
{
rtnh->rtnh_ifindex = nhi->if_index;
}
rtnh = RTNH_NEXT (rtnh);
}
assert (rta->rta_len > RTA_LENGTH (0));
addattr_l (&req->n, in_buf_len, RTA_MULTIPATH, RTA_DATA (rta),
RTA_PAYLOAD (rta));
done:
if (ri->pref_src)
{
addattr_l (&req->n, in_buf_len, RTA_PREFSRC, &ri->pref_src, bytelen);
}
assert (req->n.nlmsg_len < in_buf_len);
return req->n.nlmsg_len;
}
/*
* zfpm_log_route_info
*
* Helper function to log the information in a route_info structure.
*/
static void
zfpm_log_route_info (netlink_route_info_t *ri, const char *label)
{
netlink_nh_info_t *nhi;
int i;
zfpm_debug ("%s : %s %s/%d, Proto: %s, Metric: %u", label,
nl_msg_type_to_str (ri->nlmsg_type),
prefix_addr_to_a (ri->prefix), ri->prefix->prefixlen,
nl_rtproto_to_str (ri->rtm_protocol),
ri->metric ? *ri->metric : 0);
for (i = 0; i < ri->num_nhs; i++)
{
nhi = &ri->nhs[i];
zfpm_debug(" Intf: %u, Gateway: %s, Recursive: %s, Type: %s",
nhi->if_index, addr_to_a (ri->af, nhi->gateway),
nhi->recursive ? "yes" : "no",
nexthop_type_to_str (nhi->type));
}
}
/*
* zfpm_netlink_encode_route
*
* Create a netlink message corresponding to the given route in the
* given buffer space.
*
* Returns the number of bytes written to the buffer. 0 or a negative
* value indicates an error.
*/
int
zfpm_netlink_encode_route (int cmd, rib_dest_t *dest, struct rib *rib,
char *in_buf, size_t in_buf_len)
{
netlink_route_info_t ri_space, *ri;
ri = &ri_space;
if (!netlink_route_info_fill (ri, cmd, dest, rib))
return 0;
zfpm_log_route_info (ri, __FUNCTION__);
return netlink_route_info_encode (ri, in_buf, in_buf_len);
}
|