route.c revision 1.70 1 1.70 dyoung /* $NetBSD: route.c,v 1.70 2008/01/21 20:34:13 dyoung Exp $ */
2 1.14 thorpej
3 1.1 cgd /*
4 1.10 mycroft * Copyright (c) 1983, 1988, 1993
5 1.10 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.63 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.23 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.14 thorpej #if 0
35 1.14 thorpej static char sccsid[] = "from: @(#)route.c 8.3 (Berkeley) 3/9/94";
36 1.14 thorpej #else
37 1.70 dyoung __RCSID("$NetBSD: route.c,v 1.70 2008/01/21 20:34:13 dyoung Exp $");
38 1.14 thorpej #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.70 dyoung #include <stdbool.h>
42 1.1 cgd #include <sys/param.h>
43 1.10 mycroft #include <sys/protosw.h>
44 1.1 cgd #include <sys/socket.h>
45 1.1 cgd #include <sys/mbuf.h>
46 1.30 mrg #include <sys/un.h>
47 1.1 cgd
48 1.1 cgd #include <net/if.h>
49 1.10 mycroft #include <net/if_dl.h>
50 1.10 mycroft #include <net/if_types.h>
51 1.11 jtc #define _KERNEL
52 1.1 cgd #include <net/route.h>
53 1.11 jtc #undef _KERNEL
54 1.1 cgd #include <netinet/in.h>
55 1.21 christos #include <netatalk/at.h>
56 1.30 mrg #include <netiso/iso.h>
57 1.1 cgd
58 1.68 matt #ifdef NS
59 1.1 cgd #include <netns/ns.h>
60 1.68 matt #endif
61 1.1 cgd
62 1.10 mycroft #include <sys/sysctl.h>
63 1.4 paul
64 1.38 itojun #include <arpa/inet.h>
65 1.38 itojun
66 1.29 mrg #include <err.h>
67 1.66 rpaulo #include <kvm.h>
68 1.1 cgd #include <netdb.h>
69 1.1 cgd #include <stdio.h>
70 1.10 mycroft #include <stdlib.h>
71 1.1 cgd #include <string.h>
72 1.10 mycroft #include <unistd.h>
73 1.29 mrg
74 1.10 mycroft #include "netstat.h"
75 1.1 cgd
76 1.10 mycroft #define kget(p, d) (kread((u_long)(p), (char *)&(d), sizeof (d)))
77 1.1 cgd
78 1.39 itojun /* alignment constraint for routing socket */
79 1.39 itojun #define ROUNDUP(a) \
80 1.39 itojun ((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
81 1.39 itojun #define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
82 1.39 itojun
83 1.1 cgd /*
84 1.30 mrg * XXX we put all of the sockaddr types in here to force the alignment
85 1.30 mrg * to be correct.
86 1.30 mrg */
87 1.37 chopps static union sockaddr_union {
88 1.10 mycroft struct sockaddr u_sa;
89 1.30 mrg struct sockaddr_in u_in;
90 1.30 mrg struct sockaddr_un u_un;
91 1.30 mrg struct sockaddr_iso u_iso;
92 1.30 mrg struct sockaddr_at u_at;
93 1.30 mrg struct sockaddr_dl u_dl;
94 1.68 matt #ifdef NS
95 1.30 mrg struct sockaddr_ns u_ns;
96 1.68 matt #endif
97 1.10 mycroft u_short u_data[128];
98 1.38 itojun int u_dummy; /* force word-alignment */
99 1.10 mycroft } pt_u;
100 1.10 mycroft
101 1.10 mycroft int do_rtent = 0;
102 1.10 mycroft struct rtentry rtentry;
103 1.10 mycroft struct radix_node rnode;
104 1.10 mycroft struct radix_mask rmask;
105 1.10 mycroft
106 1.69 dyoung static struct sockaddr *kgetsa(const struct sockaddr *);
107 1.67 elad static void p_tree(struct radix_node *);
108 1.67 elad static void p_rtnode(void);
109 1.67 elad static void p_krtentry(struct rtentry *);
110 1.3 cgd
111 1.3 cgd /*
112 1.1 cgd * Print routing tables.
113 1.1 cgd */
114 1.10 mycroft void
115 1.10 mycroft routepr(rtree)
116 1.10 mycroft u_long rtree;
117 1.1 cgd {
118 1.10 mycroft struct radix_node_head *rnh, head;
119 1.59 matt struct radix_node_head *rt_tables[AF_MAX+1];
120 1.10 mycroft int i;
121 1.1 cgd
122 1.1 cgd printf("Routing tables\n");
123 1.10 mycroft
124 1.67 elad if (rtree == 0) {
125 1.67 elad printf("rt_tables: symbol not in namelist\n");
126 1.67 elad return;
127 1.67 elad }
128 1.10 mycroft
129 1.67 elad kget(rtree, rt_tables);
130 1.67 elad for (i = 0; i <= AF_MAX; i++) {
131 1.67 elad if ((rnh = rt_tables[i]) == 0)
132 1.67 elad continue;
133 1.67 elad kget(rnh, head);
134 1.67 elad if (i == AF_UNSPEC) {
135 1.67 elad if (Aflag && (af == 0 || af == 0xff)) {
136 1.67 elad printf("Netmasks:\n");
137 1.10 mycroft p_tree(head.rnh_treetop);
138 1.10 mycroft }
139 1.67 elad } else if (af == AF_UNSPEC || af == i) {
140 1.67 elad pr_family(i);
141 1.67 elad do_rtent = 1;
142 1.67 elad pr_rthdr(i, Aflag);
143 1.67 elad p_tree(head.rnh_treetop);
144 1.1 cgd }
145 1.1 cgd }
146 1.1 cgd }
147 1.1 cgd
148 1.10 mycroft static struct sockaddr *
149 1.69 dyoung kgetsa(const struct sockaddr *dst)
150 1.1 cgd {
151 1.10 mycroft
152 1.1 cgd kget(dst, pt_u.u_sa);
153 1.10 mycroft if (pt_u.u_sa.sa_len > sizeof (pt_u.u_sa))
154 1.10 mycroft kread((u_long)dst, (char *)pt_u.u_data, pt_u.u_sa.sa_len);
155 1.1 cgd return (&pt_u.u_sa);
156 1.1 cgd }
157 1.1 cgd
158 1.10 mycroft static void
159 1.1 cgd p_tree(rn)
160 1.10 mycroft struct radix_node *rn;
161 1.1 cgd {
162 1.1 cgd
163 1.1 cgd again:
164 1.1 cgd kget(rn, rnode);
165 1.1 cgd if (rnode.rn_b < 0) {
166 1.1 cgd if (Aflag)
167 1.21 christos printf("%-8.8lx ", (u_long) rn);
168 1.10 mycroft if (rnode.rn_flags & RNF_ROOT) {
169 1.10 mycroft if (Aflag)
170 1.10 mycroft printf("(root node)%s",
171 1.1 cgd rnode.rn_dupedkey ? " =>\n" : "\n");
172 1.10 mycroft } else if (do_rtent) {
173 1.1 cgd kget(rn, rtentry);
174 1.67 elad p_krtentry(&rtentry);
175 1.1 cgd if (Aflag)
176 1.1 cgd p_rtnode();
177 1.1 cgd } else {
178 1.1 cgd p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_key),
179 1.16 mellon NULL, 0, 44);
180 1.1 cgd putchar('\n');
181 1.1 cgd }
182 1.21 christos if ((rn = rnode.rn_dupedkey) != NULL)
183 1.1 cgd goto again;
184 1.1 cgd } else {
185 1.1 cgd if (Aflag && do_rtent) {
186 1.21 christos printf("%-8.8lx ", (u_long) rn);
187 1.1 cgd p_rtnode();
188 1.1 cgd }
189 1.1 cgd rn = rnode.rn_r;
190 1.1 cgd p_tree(rnode.rn_l);
191 1.1 cgd p_tree(rn);
192 1.1 cgd }
193 1.1 cgd }
194 1.1 cgd
195 1.10 mycroft static void
196 1.1 cgd p_rtnode()
197 1.1 cgd {
198 1.10 mycroft struct radix_mask *rm = rnode.rn_mklist;
199 1.29 mrg char nbuf[20];
200 1.1 cgd
201 1.1 cgd if (rnode.rn_b < 0) {
202 1.1 cgd if (rnode.rn_mask) {
203 1.1 cgd printf("\t mask ");
204 1.1 cgd p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_mask),
205 1.16 mellon NULL, 0, -1);
206 1.1 cgd } else if (rm == 0)
207 1.1 cgd return;
208 1.1 cgd } else {
209 1.29 mrg (void)snprintf(nbuf, sizeof nbuf, "(%d)", rnode.rn_b);
210 1.21 christos printf("%6.6s %8.8lx : %8.8lx", nbuf, (u_long) rnode.rn_l,
211 1.21 christos (u_long) rnode.rn_r);
212 1.1 cgd }
213 1.1 cgd while (rm) {
214 1.1 cgd kget(rm, rmask);
215 1.29 mrg (void)snprintf(nbuf, sizeof nbuf, " %d refs, ", rmask.rm_refs);
216 1.21 christos printf(" mk = %8.8lx {(%d),%s", (u_long) rm,
217 1.21 christos -1 - rmask.rm_b, rmask.rm_refs ? nbuf : " ");
218 1.16 mellon if (rmask.rm_flags & RNF_NORMAL) {
219 1.16 mellon struct radix_node rnode_aux;
220 1.16 mellon printf(" <normal>, ");
221 1.16 mellon kget(rmask.rm_leaf, rnode_aux);
222 1.16 mellon p_sockaddr(kgetsa((struct sockaddr *)rnode_aux.rn_mask),
223 1.16 mellon NULL, 0, -1);
224 1.16 mellon } else
225 1.29 mrg p_sockaddr(kgetsa((struct sockaddr *)rmask.rm_mask),
226 1.29 mrg NULL, 0, -1);
227 1.1 cgd putchar('}');
228 1.21 christos if ((rm = rmask.rm_mklist) != NULL)
229 1.1 cgd printf(" ->");
230 1.1 cgd }
231 1.1 cgd putchar('\n');
232 1.1 cgd }
233 1.1 cgd
234 1.37 chopps static struct sockaddr *sockcopy __P((struct sockaddr *,
235 1.37 chopps union sockaddr_union *));
236 1.35 chopps
237 1.35 chopps /*
238 1.35 chopps * copy a sockaddr into an allocated region, allocate at least sockaddr
239 1.35 chopps * bytes and zero unused
240 1.35 chopps */
241 1.35 chopps static struct sockaddr *
242 1.37 chopps sockcopy(sp, dp)
243 1.35 chopps struct sockaddr *sp;
244 1.37 chopps union sockaddr_union *dp;
245 1.35 chopps {
246 1.37 chopps int len;
247 1.35 chopps
248 1.37 chopps if (sp == 0 || sp->sa_len == 0)
249 1.37 chopps (void)memset(dp, 0, sizeof (*sp));
250 1.37 chopps else {
251 1.37 chopps len = (sp->sa_len >= sizeof (*sp)) ? sp->sa_len : sizeof (*sp);
252 1.37 chopps (void)memcpy(dp, sp, len);
253 1.37 chopps }
254 1.37 chopps return ((struct sockaddr *)dp);
255 1.35 chopps }
256 1.35 chopps
257 1.10 mycroft static void
258 1.67 elad p_krtentry(rt)
259 1.23 lukem struct rtentry *rt;
260 1.4 paul {
261 1.10 mycroft static struct ifnet ifnet, *lastif;
262 1.37 chopps union sockaddr_union addr_un, mask_un;
263 1.35 chopps struct sockaddr *addr, *mask;
264 1.41 itojun int af;
265 1.40 is
266 1.40 is if (Lflag && (rt->rt_flags & RTF_LLINFO))
267 1.40 is return;
268 1.4 paul
269 1.38 itojun memset(&addr_un, 0, sizeof(addr_un));
270 1.38 itojun memset(&mask_un, 0, sizeof(mask_un));
271 1.69 dyoung addr = sockcopy(kgetsa(rt_getkey(rt)), &addr_un);
272 1.41 itojun af = addr->sa_family;
273 1.35 chopps if (rt_mask(rt))
274 1.37 chopps mask = sockcopy(kgetsa(rt_mask(rt)), &mask_un);
275 1.16 mellon else
276 1.38 itojun mask = sockcopy(NULL, &mask_un);
277 1.67 elad p_addr(addr, mask, rt->rt_flags);
278 1.67 elad p_gwaddr(kgetsa(rt->rt_gateway), kgetsa(rt->rt_gateway)->sa_family);
279 1.67 elad p_flags(rt->rt_flags, "%-6.6s ");
280 1.27 kml printf("%6d %8lu ", rt->rt_refcnt, rt->rt_use);
281 1.13 thorpej if (rt->rt_rmx.rmx_mtu)
282 1.27 kml printf("%6lu", rt->rt_rmx.rmx_mtu);
283 1.13 thorpej else
284 1.26 kml printf("%6s", "-");
285 1.26 kml putchar((rt->rt_rmx.rmx_locks & RTV_MTU) ? 'L' : ' ');
286 1.10 mycroft if (rt->rt_ifp) {
287 1.10 mycroft if (rt->rt_ifp != lastif) {
288 1.10 mycroft kget(rt->rt_ifp, ifnet);
289 1.10 mycroft lastif = rt->rt_ifp;
290 1.10 mycroft }
291 1.15 thorpej printf(" %.16s%s", ifnet.if_xname,
292 1.10 mycroft rt->rt_nodes[0].rn_dupedkey ? " =>" : "");
293 1.1 cgd }
294 1.10 mycroft putchar('\n');
295 1.34 kml if (vflag) {
296 1.34 kml printf("\texpire %10lu%c recvpipe %10ld%c "
297 1.34 kml "sendpipe %10ld%c\n",
298 1.34 kml rt->rt_rmx.rmx_expire,
299 1.34 kml (rt->rt_rmx.rmx_locks & RTV_EXPIRE) ? 'L' : ' ',
300 1.34 kml rt->rt_rmx.rmx_recvpipe,
301 1.34 kml (rt->rt_rmx.rmx_locks & RTV_RPIPE) ? 'L' : ' ',
302 1.34 kml rt->rt_rmx.rmx_sendpipe,
303 1.34 kml (rt->rt_rmx.rmx_locks & RTV_SPIPE) ? 'L' : ' ');
304 1.34 kml printf("\tssthresh %10lu%c rtt %10ld%c "
305 1.34 kml "rttvar %10ld%c\n",
306 1.34 kml rt->rt_rmx.rmx_ssthresh,
307 1.34 kml (rt->rt_rmx.rmx_locks & RTV_SSTHRESH) ? 'L' : ' ',
308 1.34 kml rt->rt_rmx.rmx_rtt,
309 1.34 kml (rt->rt_rmx.rmx_locks & RTV_RTT) ? 'L' : ' ',
310 1.34 kml rt->rt_rmx.rmx_rttvar,
311 1.34 kml (rt->rt_rmx.rmx_locks & RTV_RTTVAR) ? 'L' : ' ');
312 1.54 enami printf("\thopcount %10lu%c\n",
313 1.54 enami rt->rt_rmx.rmx_hopcount,
314 1.54 enami (rt->rt_rmx.rmx_locks & RTV_HOPCOUNT) ? 'L' : ' ');
315 1.54 enami }
316 1.1 cgd }
317 1.1 cgd
318 1.1 cgd /*
319 1.1 cgd * Print routing statistics
320 1.1 cgd */
321 1.10 mycroft void
322 1.1 cgd rt_stats(off)
323 1.9 cgd u_long off;
324 1.1 cgd {
325 1.1 cgd struct rtstat rtstat;
326 1.1 cgd
327 1.67 elad if (use_sysctl) {
328 1.67 elad size_t rtsize = sizeof(rtstat);
329 1.67 elad
330 1.67 elad if (sysctlbyname("net.route.stats", &rtstat, &rtsize,
331 1.67 elad NULL, 0) == -1)
332 1.67 elad err(1, "rt_stats: sysctl");
333 1.67 elad } else if (off == 0) {
334 1.1 cgd printf("rtstat: symbol not in namelist\n");
335 1.1 cgd return;
336 1.67 elad } else
337 1.67 elad kread(off, (char *)&rtstat, sizeof (rtstat));
338 1.67 elad
339 1.1 cgd printf("routing:\n");
340 1.53 itojun printf("\t%llu bad routing redirect%s\n",
341 1.53 itojun (unsigned long long)rtstat.rts_badredirect,
342 1.53 itojun plural(rtstat.rts_badredirect));
343 1.53 itojun printf("\t%llu dynamically created route%s\n",
344 1.53 itojun (unsigned long long)rtstat.rts_dynamic,
345 1.53 itojun plural(rtstat.rts_dynamic));
346 1.53 itojun printf("\t%llu new gateway%s due to redirects\n",
347 1.53 itojun (unsigned long long)rtstat.rts_newgateway,
348 1.53 itojun plural(rtstat.rts_newgateway));
349 1.53 itojun printf("\t%llu destination%s found unreachable\n",
350 1.53 itojun (unsigned long long)rtstat.rts_unreach,
351 1.53 itojun plural(rtstat.rts_unreach));
352 1.53 itojun printf("\t%llu use%s of a wildcard route\n",
353 1.53 itojun (unsigned long long)rtstat.rts_wildcard,
354 1.53 itojun plural(rtstat.rts_wildcard));
355 1.1 cgd }
356 1.67 elad
357 1.68 matt #ifdef NS
358 1.1 cgd short ns_nullh[] = {0,0,0};
359 1.1 cgd short ns_bh[] = {-1,-1,-1};
360 1.1 cgd
361 1.1 cgd char *
362 1.10 mycroft ns_print(sa)
363 1.17 mellon struct sockaddr *sa;
364 1.1 cgd {
365 1.23 lukem struct sockaddr_ns *sns = (struct sockaddr_ns*)sa;
366 1.1 cgd struct ns_addr work;
367 1.29 mrg union {
368 1.29 mrg union ns_net net_e;
369 1.29 mrg u_long long_e;
370 1.29 mrg } net;
371 1.1 cgd u_short port;
372 1.1 cgd static char mybuf[50], cport[10], chost[25];
373 1.1 cgd char *host = "";
374 1.23 lukem char *p;
375 1.23 lukem u_char *q;
376 1.1 cgd
377 1.1 cgd work = sns->sns_addr;
378 1.1 cgd port = ntohs(work.x_port);
379 1.1 cgd work.x_port = 0;
380 1.1 cgd net.net_e = work.x_net;
381 1.1 cgd if (ns_nullhost(work) && net.long_e == 0) {
382 1.1 cgd if (port ) {
383 1.29 mrg (void)snprintf(mybuf, sizeof mybuf, "*.%xH", port);
384 1.1 cgd upHex(mybuf);
385 1.1 cgd } else
386 1.29 mrg (void)snprintf(mybuf, sizeof mybuf, "*.*");
387 1.1 cgd return (mybuf);
388 1.1 cgd }
389 1.1 cgd
390 1.23 lukem if (memcmp(ns_bh, work.x_host.c_host, 6) == 0) {
391 1.1 cgd host = "any";
392 1.23 lukem } else if (memcmp(ns_nullh, work.x_host.c_host, 6) == 0) {
393 1.1 cgd host = "*";
394 1.1 cgd } else {
395 1.1 cgd q = work.x_host.c_host;
396 1.29 mrg (void)snprintf(chost, sizeof chost, "%02x%02x%02x%02x%02x%02xH",
397 1.1 cgd q[0], q[1], q[2], q[3], q[4], q[5]);
398 1.10 mycroft for (p = chost; *p == '0' && p < chost + 12; p++)
399 1.10 mycroft continue;
400 1.1 cgd host = p;
401 1.1 cgd }
402 1.1 cgd if (port)
403 1.29 mrg (void)snprintf(cport, sizeof cport, ".%xH", htons(port));
404 1.1 cgd else
405 1.1 cgd *cport = 0;
406 1.1 cgd
407 1.29 mrg (void)snprintf(mybuf, sizeof mybuf, "%xH.%s%s", (int)ntohl(net.long_e),
408 1.29 mrg host, cport);
409 1.1 cgd upHex(mybuf);
410 1.29 mrg return (mybuf);
411 1.1 cgd }
412 1.1 cgd
413 1.1 cgd char *
414 1.10 mycroft ns_phost(sa)
415 1.10 mycroft struct sockaddr *sa;
416 1.1 cgd {
417 1.23 lukem struct sockaddr_ns *sns = (struct sockaddr_ns *)sa;
418 1.1 cgd struct sockaddr_ns work;
419 1.1 cgd static union ns_net ns_zeronet;
420 1.1 cgd char *p;
421 1.10 mycroft
422 1.1 cgd work = *sns;
423 1.1 cgd work.sns_addr.x_port = 0;
424 1.1 cgd work.sns_addr.x_net = ns_zeronet;
425 1.1 cgd
426 1.10 mycroft p = ns_print((struct sockaddr *)&work);
427 1.29 mrg if (strncmp("0H.", p, 3) == 0)
428 1.29 mrg p += 3;
429 1.29 mrg return (p);
430 1.1 cgd }
431 1.68 matt #endif
432 1.10 mycroft
433 1.10 mycroft void
434 1.1 cgd upHex(p0)
435 1.10 mycroft char *p0;
436 1.1 cgd {
437 1.23 lukem char *p = p0;
438 1.1 cgd
439 1.29 mrg for (; *p; p++)
440 1.29 mrg switch (*p) {
441 1.29 mrg case 'a':
442 1.29 mrg case 'b':
443 1.29 mrg case 'c':
444 1.29 mrg case 'd':
445 1.29 mrg case 'e':
446 1.29 mrg case 'f':
447 1.29 mrg *p += ('A' - 'a');
448 1.29 mrg }
449 1.1 cgd }
450 1.67 elad
451 1.67 elad
452