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
|
/* $OpenBSD: route.c,v 1.87 2009/08/04 03:45:47 tedu Exp $ */
/* $NetBSD: route.c,v 1.15 1996/05/07 02:55:06 thorpej Exp $ */
/*
* Copyright (c) 1983, 1988, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/protosw.h>
#include <sys/socket.h>
#include <sys/mbuf.h>
#include <net/if.h>
#include <net/if_dl.h>
#include <net/if_types.h>
#define _KERNEL
#include <net/route.h>
#undef _KERNEL
#include <netinet/in.h>
#include <arpa/inet.h>
#include <sys/sysctl.h>
#include <err.h>
#include <limits.h>
#include <netdb.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#ifndef INET
#define INET
#endif
#include <netinet/ip_ipsp.h>
#include "netstat.h"
/* alignment constraint for routing socket */
#define ROUNDUP(a) \
((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
struct radix_node_head ***rt_head;
struct radix_node_head ***rnt;
struct radix_node_head *rt_tables[AF_MAX+1]; /* provides enough space */
u_int8_t af2rtafidx[AF_MAX+1];
static union {
struct sockaddr u_sa;
u_int32_t u_data[64];
int u_dummy; /* force word-alignment */
} pt_u;
int do_rtent = 0;
struct rtentry rtentry;
struct radix_node rnode;
struct radix_mask rmask;
static struct sockaddr *kgetsa(struct sockaddr *);
static void p_tree(struct radix_node *);
static void p_rtnode(void);
static void p_rtflags(u_char);
static void p_krtentry(struct rtentry *);
static void encap_print(struct rtentry *);
/*
* Print routing tables.
*/
void
routepr(u_long rtree, u_long mtree, u_long af2idx, u_long rtbl_id_max,
u_int tableid)
{
struct radix_node_head *rnh, head;
int i, idxmax = 0;
u_int rtidxmax;
printf("Routing tables\n");
if (rtree == NULL || af2idx == NULL) {
printf("rt_tables: symbol not in namelist\n");
return;
}
kread((u_long)rtree, &rt_head, sizeof(rt_head));
kread((u_long)rtbl_id_max, &rtidxmax, sizeof(rtidxmax));
kread((long)af2idx, &af2rtafidx, sizeof(af2rtafidx));
for (i = 0; i <= AF_MAX; i++) {
if (af2rtafidx[i] > idxmax)
idxmax = af2rtafidx[i];
}
if ((rnt = calloc(rtidxmax + 1, sizeof(struct radix_node_head **))) ==
NULL)
err(1, NULL);
kread((u_long)rt_head, rnt, (rtidxmax + 1) *
sizeof(struct radix_node_head **));
if (tableid > rtidxmax || rnt[tableid] == NULL) {
printf("Bad table %u\n", tableid);
return;
}
kread((u_long)rnt[tableid], rt_tables, (idxmax + 1) * sizeof(rnh));
for (i = 0; i <= AF_MAX; i++) {
if (i == AF_UNSPEC) {
if (Aflag && (af == AF_UNSPEC || af == 0xff)) {
kread(mtree, &rnh, sizeof(rnh));
kread((u_long)rnh, &head, sizeof(head));
printf("Netmasks:\n");
p_tree(head.rnh_treetop);
}
continue;
}
if (af2rtafidx[i] == NULL)
/* no table for this AF */
continue;
if ((rnh = rt_tables[af2rtafidx[i]]) == NULL)
continue;
kread((u_long)rnh, &head, sizeof(head));
if (af == AF_UNSPEC || af == i) {
pr_family(i);
do_rtent = 1;
pr_rthdr(i, Aflag);
p_tree(head.rnh_treetop);
}
}
}
static struct sockaddr *
kgetsa(struct sockaddr *dst)
{
kread((u_long)dst, &pt_u.u_sa, sizeof(pt_u.u_sa));
if (pt_u.u_sa.sa_len > sizeof (pt_u.u_sa))
kread((u_long)dst, pt_u.u_data, pt_u.u_sa.sa_len);
return (&pt_u.u_sa);
}
static void
p_tree(struct radix_node *rn)
{
again:
kread((u_long)rn, &rnode, sizeof(rnode));
if (rnode.rn_b < 0) {
if (Aflag)
printf("%-16p ", rn);
if (rnode.rn_flags & RNF_ROOT) {
if (Aflag)
printf("(root node)%s",
rnode.rn_dupedkey ? " =>\n" : "\n");
} else if (do_rtent) {
kread((u_long)rn, &rtentry, sizeof(rtentry));
p_krtentry(&rtentry);
if (Aflag)
p_rtnode();
} else {
p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_key),
0, 0, 44);
putchar('\n');
}
if ((rn = rnode.rn_dupedkey))
goto again;
} else {
if (Aflag && do_rtent) {
printf("%-16p ", rn);
p_rtnode();
}
rn = rnode.rn_r;
p_tree(rnode.rn_l);
p_tree(rn);
}
}
static void
p_rtflags(u_char flags)
{
putchar('<');
if (flags & RNF_NORMAL)
putchar('N');
if (flags & RNF_ROOT)
putchar('R');
if (flags & RNF_ACTIVE)
putchar('A');
if (flags & ~(RNF_NORMAL | RNF_ROOT | RNF_ACTIVE))
printf("/0x%02x", flags);
putchar('>');
}
char nbuf[25];
static void
p_rtnode(void)
{
struct radix_mask *rm = rnode.rn_mklist;
if (rnode.rn_b < 0) {
snprintf(nbuf, sizeof nbuf, " => %p", rnode.rn_dupedkey);
printf("\t (%p)%s", rnode.rn_p,
rnode.rn_dupedkey ? nbuf : "");
if (rnode.rn_mask) {
printf(" mask ");
p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_mask),
0, 0, -1);
} else if (rm == NULL) {
putchar('\n');
return;
}
} else {
snprintf(nbuf, sizeof nbuf, "(%d)", rnode.rn_b);
printf("%6.6s (%p) %16p : %16p", nbuf, rnode.rn_p, rnode.rn_l,
rnode.rn_r);
}
putchar(' ');
p_rtflags(rnode.rn_flags);
while (rm) {
kread((u_long)rm, &rmask, sizeof(rmask));
snprintf(nbuf, sizeof nbuf, " %d refs, ", rmask.rm_refs);
printf("\n\tmk = %p {(%d),%s",
rm, -1 - rmask.rm_b, rmask.rm_refs ? nbuf : " ");
p_rtflags(rmask.rm_flags);
printf(", ");
if (rmask.rm_flags & RNF_NORMAL) {
struct radix_node rnode_aux;
printf("leaf = %p ", rmask.rm_leaf);
kread((u_long)rmask.rm_leaf, &rnode_aux, sizeof(rnode_aux));
p_sockaddr(kgetsa((struct sockaddr *)rnode_aux.rn_mask),
0, 0, -1);
} else
p_sockaddr(kgetsa((struct sockaddr *)rmask.rm_mask),
0, 0, -1);
putchar('}');
if ((rm = rmask.rm_mklist))
printf(" ->");
}
putchar('\n');
}
static void
p_krtentry(struct rtentry *rt)
{
static struct ifnet ifnet, *lastif;
struct sockaddr_storage sock1, sock2;
struct sockaddr *sa = (struct sockaddr *)&sock1;
struct sockaddr *mask = (struct sockaddr *)&sock2;
bcopy(kgetsa(rt_key(rt)), sa, sizeof(struct sockaddr));
if (sa->sa_len > sizeof(struct sockaddr))
bcopy(kgetsa(rt_key(rt)), sa, sa->sa_len);
if (sa->sa_family == PF_KEY) {
encap_print(rt);
return;
}
if (rt_mask(rt)) {
bcopy(kgetsa(rt_mask(rt)), mask, sizeof(struct sockaddr));
if (sa->sa_len > sizeof(struct sockaddr))
bcopy(kgetsa(rt_mask(rt)), mask, sa->sa_len);
} else
mask = 0;
p_addr(sa, mask, rt->rt_flags);
p_gwaddr(kgetsa(rt->rt_gateway), sa->sa_family);
p_flags(rt->rt_flags, "%-6.6s ");
printf("%5u %8lld ", rt->rt_refcnt, rt->rt_use);
if (rt->rt_rmx.rmx_mtu)
printf("%5u ", rt->rt_rmx.rmx_mtu);
else
printf("%5s ", "-");
putchar((rt->rt_rmx.rmx_locks & RTV_MTU) ? 'L' : ' ');
printf(" %2d", rt->rt_priority);
if (rt->rt_ifp) {
if (rt->rt_ifp != lastif) {
kread((u_long)rt->rt_ifp, &ifnet, sizeof(ifnet));
lastif = rt->rt_ifp;
}
printf(" %.16s%s", ifnet.if_xname,
rt->rt_nodes[0].rn_dupedkey ? " =>" : "");
}
putchar('\n');
if (vflag)
printf("\texpire %10u%c\n",
rt->rt_rmx.rmx_expire,
(rt->rt_rmx.rmx_locks & RTV_EXPIRE) ? 'L' : ' ');
}
/*
* Print routing statistics
*/
void
rt_stats(void)
{
struct rtstat rtstat;
int mib[6];
size_t size;
mib[0] = CTL_NET;
mib[1] = PF_ROUTE;
mib[2] = 0;
mib[3] = 0;
mib[4] = NET_RT_STATS;
mib[5] = 0;
size = sizeof (rtstat);
if (sysctl(mib, 6, &rtstat, &size, NULL, 0) < 0) {
perror("sysctl of routing table statistics");
exit(1);
}
printf("routing:\n");
printf("\t%u bad routing redirect%s\n",
rtstat.rts_badredirect, plural(rtstat.rts_badredirect));
printf("\t%u dynamically created route%s\n",
rtstat.rts_dynamic, plural(rtstat.rts_dynamic));
printf("\t%u new gateway%s due to redirects\n",
rtstat.rts_newgateway, plural(rtstat.rts_newgateway));
printf("\t%u destination%s found unreachable\n",
rtstat.rts_unreach, plural(rtstat.rts_unreach));
printf("\t%u use%s of a wildcard route\n",
rtstat.rts_wildcard, plural(rtstat.rts_wildcard));
}
static void
encap_print(struct rtentry *rt)
{
struct sockaddr_encap sen1, sen2, sen3;
struct ipsec_policy ipo;
struct sockaddr_in6 s61, s62;
bcopy(kgetsa(rt_key(rt)), &sen1, sizeof(sen1));
bcopy(kgetsa(rt_mask(rt)), &sen2, sizeof(sen2));
bcopy(kgetsa(rt->rt_gateway), &sen3, sizeof(sen3));
if (sen1.sen_type == SENT_IP4) {
printf("%-18s %-5u ", netname4(sen1.sen_ip_src.s_addr,
sen2.sen_ip_src.s_addr), ntohs(sen1.sen_sport));
printf("%-18s %-5u %-5u ", netname4(sen1.sen_ip_dst.s_addr,
sen2.sen_ip_dst.s_addr),
ntohs(sen1.sen_dport), sen1.sen_proto);
}
if (sen1.sen_type == SENT_IP6) {
bzero(&s61, sizeof(s61));
bzero(&s62, sizeof(s62));
s61.sin6_family = s62.sin6_family = AF_INET6;
s61.sin6_len = s62.sin6_len = sizeof(s61);
bcopy(&sen1.sen_ip6_src, &s61.sin6_addr, sizeof(struct in6_addr));
#ifdef __KAME__
if (IN6_IS_ADDR_LINKLOCAL(&s61.sin6_addr) ||
IN6_IS_ADDR_MC_LINKLOCAL(&s61.sin6_addr) ||
IN6_IS_ADDR_MC_INTFACELOCAL(&s61.sin6_addr)) {
s61.sin6_scope_id =
((u_int16_t)s61.sin6_addr.s6_addr[2] << 8) |
s61.sin6_addr.s6_addr[3];
s61.sin6_addr.s6_addr[2] = s61.sin6_addr.s6_addr[3] = 0;
}
#endif
bcopy(&sen2.sen_ip6_src, &s62.sin6_addr, sizeof(struct in6_addr));
#ifdef __KAME__
if (IN6_IS_ADDR_LINKLOCAL(&s62.sin6_addr) ||
IN6_IS_ADDR_MC_LINKLOCAL(&s62.sin6_addr) ||
IN6_IS_ADDR_MC_INTFACELOCAL(&s62.sin6_addr)) {
s62.sin6_scope_id =
((u_int16_t)s62.sin6_addr.s6_addr[2] << 8) |
s62.sin6_addr.s6_addr[3];
s62.sin6_addr.s6_addr[2] = s62.sin6_addr.s6_addr[3] = 0;
}
#endif
printf("%-42s %-5u ", netname6(&s61, &s62),
ntohs(sen1.sen_ip6_sport));
bzero(&s61, sizeof(s61));
bzero(&s62, sizeof(s62));
s61.sin6_family = s62.sin6_family = AF_INET6;
s61.sin6_len = s62.sin6_len = sizeof(s61);
bcopy(&sen1.sen_ip6_dst, &s61.sin6_addr, sizeof(struct in6_addr));
#ifdef __KAME__
if (IN6_IS_ADDR_LINKLOCAL(&s61.sin6_addr) ||
IN6_IS_ADDR_MC_LINKLOCAL(&s61.sin6_addr) ||
IN6_IS_ADDR_MC_INTFACELOCAL(&s61.sin6_addr)) {
s61.sin6_scope_id =
((u_int16_t)s61.sin6_addr.s6_addr[2] << 8) |
s61.sin6_addr.s6_addr[3];
s61.sin6_addr.s6_addr[2] = s61.sin6_addr.s6_addr[3] = 0;
}
#endif
bcopy(&sen2.sen_ip6_dst, &s62.sin6_addr, sizeof(struct in6_addr));
#ifdef __KAME__
if (IN6_IS_ADDR_LINKLOCAL(&s62.sin6_addr) ||
IN6_IS_ADDR_MC_LINKLOCAL(&s62.sin6_addr) ||
IN6_IS_ADDR_MC_INTFACELOCAL(&s62.sin6_addr)) {
s62.sin6_scope_id =
((u_int16_t)s62.sin6_addr.s6_addr[2] << 8) |
s62.sin6_addr.s6_addr[3];
s62.sin6_addr.s6_addr[2] = s62.sin6_addr.s6_addr[3] = 0;
}
#endif
printf("%-42s %-5u %-5u ", netname6(&s61, &s62),
ntohs(sen1.sen_ip6_dport), sen1.sen_ip6_proto);
}
if (sen3.sen_type == SENT_IPSP) {
char hostn[NI_MAXHOST];
kread((u_long)sen3.sen_ipsp, &ipo, sizeof(ipo));
if (getnameinfo(&ipo.ipo_dst.sa, ipo.ipo_dst.sa.sa_len,
hostn, NI_MAXHOST, NULL, 0, NI_NUMERICHOST) != 0)
strlcpy (hostn, "none", NI_MAXHOST);
printf("%s", hostn);
printf("/%-u", ipo.ipo_sproto);
switch (ipo.ipo_type) {
case IPSP_IPSEC_REQUIRE:
printf("/require");
break;
case IPSP_IPSEC_ACQUIRE:
printf("/acquire");
break;
case IPSP_IPSEC_USE:
printf("/use");
break;
case IPSP_IPSEC_DONTACQ:
printf("/dontacq");
break;
case IPSP_PERMIT:
printf("/bypass");
break;
case IPSP_DENY:
printf("/deny");
break;
default:
printf("/<unknown type!>");
break;
}
if ((ipo.ipo_addr.sen_type == SENT_IP4 &&
ipo.ipo_addr.sen_direction == IPSP_DIRECTION_IN) ||
(ipo.ipo_addr.sen_type == SENT_IP6 &&
ipo.ipo_addr.sen_ip6_direction == IPSP_DIRECTION_IN))
printf("/in\n");
else if ((ipo.ipo_addr.sen_type == SENT_IP4 &&
ipo.ipo_addr.sen_direction == IPSP_DIRECTION_OUT) ||
(ipo.ipo_addr.sen_type == SENT_IP6 &&
ipo.ipo_addr.sen_ip6_direction == IPSP_DIRECTION_OUT))
printf("/out\n");
else
printf("/<unknown>\n");
}
}
|