route.c revision 1.76 1 1.76 matt /* $NetBSD: route.c,v 1.76 2011/02/01 01:39:21 matt 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.76 matt __RCSID("$NetBSD: route.c,v 1.76 2011/02/01 01:39:21 matt 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.1 cgd #include <net/route.h>
52 1.1 cgd #include <netinet/in.h>
53 1.21 christos #include <netatalk/at.h>
54 1.30 mrg #include <netiso/iso.h>
55 1.75 kefren #include <netmpls/mpls.h>
56 1.1 cgd
57 1.10 mycroft #include <sys/sysctl.h>
58 1.4 paul
59 1.38 itojun #include <arpa/inet.h>
60 1.38 itojun
61 1.29 mrg #include <err.h>
62 1.66 rpaulo #include <kvm.h>
63 1.1 cgd #include <netdb.h>
64 1.1 cgd #include <stdio.h>
65 1.10 mycroft #include <stdlib.h>
66 1.1 cgd #include <string.h>
67 1.10 mycroft #include <unistd.h>
68 1.29 mrg
69 1.10 mycroft #include "netstat.h"
70 1.1 cgd
71 1.10 mycroft #define kget(p, d) (kread((u_long)(p), (char *)&(d), sizeof (d)))
72 1.1 cgd
73 1.39 itojun /* alignment constraint for routing socket */
74 1.39 itojun #define ROUNDUP(a) \
75 1.39 itojun ((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
76 1.39 itojun #define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
77 1.39 itojun
78 1.1 cgd /*
79 1.30 mrg * XXX we put all of the sockaddr types in here to force the alignment
80 1.30 mrg * to be correct.
81 1.30 mrg */
82 1.37 chopps static union sockaddr_union {
83 1.10 mycroft struct sockaddr u_sa;
84 1.30 mrg struct sockaddr_in u_in;
85 1.30 mrg struct sockaddr_un u_un;
86 1.30 mrg struct sockaddr_iso u_iso;
87 1.30 mrg struct sockaddr_at u_at;
88 1.30 mrg struct sockaddr_dl u_dl;
89 1.10 mycroft u_short u_data[128];
90 1.38 itojun int u_dummy; /* force word-alignment */
91 1.10 mycroft } pt_u;
92 1.10 mycroft
93 1.10 mycroft int do_rtent = 0;
94 1.10 mycroft struct rtentry rtentry;
95 1.10 mycroft struct radix_node rnode;
96 1.10 mycroft struct radix_mask rmask;
97 1.10 mycroft
98 1.69 dyoung static struct sockaddr *kgetsa(const struct sockaddr *);
99 1.67 elad static void p_tree(struct radix_node *);
100 1.67 elad static void p_rtnode(void);
101 1.67 elad static void p_krtentry(struct rtentry *);
102 1.3 cgd
103 1.3 cgd /*
104 1.1 cgd * Print routing tables.
105 1.1 cgd */
106 1.10 mycroft void
107 1.10 mycroft routepr(rtree)
108 1.10 mycroft u_long rtree;
109 1.1 cgd {
110 1.10 mycroft struct radix_node_head *rnh, head;
111 1.73 lukem struct radix_node_head *rt_nodes[AF_MAX+1];
112 1.10 mycroft int i;
113 1.1 cgd
114 1.1 cgd printf("Routing tables\n");
115 1.10 mycroft
116 1.67 elad if (rtree == 0) {
117 1.67 elad printf("rt_tables: symbol not in namelist\n");
118 1.67 elad return;
119 1.67 elad }
120 1.10 mycroft
121 1.73 lukem kget(rtree, rt_nodes);
122 1.67 elad for (i = 0; i <= AF_MAX; i++) {
123 1.73 lukem if ((rnh = rt_nodes[i]) == 0)
124 1.67 elad continue;
125 1.67 elad kget(rnh, head);
126 1.67 elad if (i == AF_UNSPEC) {
127 1.67 elad if (Aflag && (af == 0 || af == 0xff)) {
128 1.67 elad printf("Netmasks:\n");
129 1.10 mycroft p_tree(head.rnh_treetop);
130 1.10 mycroft }
131 1.67 elad } else if (af == AF_UNSPEC || af == i) {
132 1.67 elad pr_family(i);
133 1.67 elad do_rtent = 1;
134 1.67 elad pr_rthdr(i, Aflag);
135 1.67 elad p_tree(head.rnh_treetop);
136 1.1 cgd }
137 1.1 cgd }
138 1.1 cgd }
139 1.1 cgd
140 1.10 mycroft static struct sockaddr *
141 1.69 dyoung kgetsa(const struct sockaddr *dst)
142 1.1 cgd {
143 1.10 mycroft
144 1.1 cgd kget(dst, pt_u.u_sa);
145 1.10 mycroft if (pt_u.u_sa.sa_len > sizeof (pt_u.u_sa))
146 1.10 mycroft kread((u_long)dst, (char *)pt_u.u_data, pt_u.u_sa.sa_len);
147 1.1 cgd return (&pt_u.u_sa);
148 1.1 cgd }
149 1.1 cgd
150 1.10 mycroft static void
151 1.1 cgd p_tree(rn)
152 1.10 mycroft struct radix_node *rn;
153 1.1 cgd {
154 1.1 cgd
155 1.1 cgd again:
156 1.1 cgd kget(rn, rnode);
157 1.1 cgd if (rnode.rn_b < 0) {
158 1.1 cgd if (Aflag)
159 1.21 christos printf("%-8.8lx ", (u_long) rn);
160 1.10 mycroft if (rnode.rn_flags & RNF_ROOT) {
161 1.10 mycroft if (Aflag)
162 1.10 mycroft printf("(root node)%s",
163 1.1 cgd rnode.rn_dupedkey ? " =>\n" : "\n");
164 1.10 mycroft } else if (do_rtent) {
165 1.1 cgd kget(rn, rtentry);
166 1.67 elad p_krtentry(&rtentry);
167 1.1 cgd if (Aflag)
168 1.1 cgd p_rtnode();
169 1.1 cgd } else {
170 1.73 lukem p_sockaddr(kgetsa((const struct sockaddr *)rnode.rn_key),
171 1.16 mellon NULL, 0, 44);
172 1.1 cgd putchar('\n');
173 1.1 cgd }
174 1.21 christos if ((rn = rnode.rn_dupedkey) != NULL)
175 1.1 cgd goto again;
176 1.1 cgd } else {
177 1.1 cgd if (Aflag && do_rtent) {
178 1.21 christos printf("%-8.8lx ", (u_long) rn);
179 1.1 cgd p_rtnode();
180 1.1 cgd }
181 1.1 cgd rn = rnode.rn_r;
182 1.1 cgd p_tree(rnode.rn_l);
183 1.1 cgd p_tree(rn);
184 1.1 cgd }
185 1.1 cgd }
186 1.1 cgd
187 1.10 mycroft static void
188 1.1 cgd p_rtnode()
189 1.1 cgd {
190 1.10 mycroft struct radix_mask *rm = rnode.rn_mklist;
191 1.29 mrg char nbuf[20];
192 1.1 cgd
193 1.1 cgd if (rnode.rn_b < 0) {
194 1.1 cgd if (rnode.rn_mask) {
195 1.1 cgd printf("\t mask ");
196 1.73 lukem p_sockaddr(kgetsa((const struct sockaddr *)rnode.rn_mask),
197 1.16 mellon NULL, 0, -1);
198 1.1 cgd } else if (rm == 0)
199 1.1 cgd return;
200 1.1 cgd } else {
201 1.29 mrg (void)snprintf(nbuf, sizeof nbuf, "(%d)", rnode.rn_b);
202 1.21 christos printf("%6.6s %8.8lx : %8.8lx", nbuf, (u_long) rnode.rn_l,
203 1.21 christos (u_long) rnode.rn_r);
204 1.1 cgd }
205 1.1 cgd while (rm) {
206 1.1 cgd kget(rm, rmask);
207 1.29 mrg (void)snprintf(nbuf, sizeof nbuf, " %d refs, ", rmask.rm_refs);
208 1.21 christos printf(" mk = %8.8lx {(%d),%s", (u_long) rm,
209 1.21 christos -1 - rmask.rm_b, rmask.rm_refs ? nbuf : " ");
210 1.16 mellon if (rmask.rm_flags & RNF_NORMAL) {
211 1.16 mellon struct radix_node rnode_aux;
212 1.16 mellon printf(" <normal>, ");
213 1.16 mellon kget(rmask.rm_leaf, rnode_aux);
214 1.73 lukem p_sockaddr(kgetsa((const struct sockaddr *)rnode_aux.rn_mask),
215 1.16 mellon NULL, 0, -1);
216 1.16 mellon } else
217 1.73 lukem p_sockaddr(kgetsa((const struct sockaddr *)rmask.rm_mask),
218 1.29 mrg NULL, 0, -1);
219 1.1 cgd putchar('}');
220 1.21 christos if ((rm = rmask.rm_mklist) != NULL)
221 1.1 cgd printf(" ->");
222 1.1 cgd }
223 1.1 cgd putchar('\n');
224 1.1 cgd }
225 1.1 cgd
226 1.37 chopps static struct sockaddr *sockcopy __P((struct sockaddr *,
227 1.37 chopps union sockaddr_union *));
228 1.35 chopps
229 1.35 chopps /*
230 1.35 chopps * copy a sockaddr into an allocated region, allocate at least sockaddr
231 1.35 chopps * bytes and zero unused
232 1.35 chopps */
233 1.35 chopps static struct sockaddr *
234 1.37 chopps sockcopy(sp, dp)
235 1.35 chopps struct sockaddr *sp;
236 1.37 chopps union sockaddr_union *dp;
237 1.35 chopps {
238 1.37 chopps int len;
239 1.35 chopps
240 1.37 chopps if (sp == 0 || sp->sa_len == 0)
241 1.37 chopps (void)memset(dp, 0, sizeof (*sp));
242 1.37 chopps else {
243 1.37 chopps len = (sp->sa_len >= sizeof (*sp)) ? sp->sa_len : sizeof (*sp);
244 1.37 chopps (void)memcpy(dp, sp, len);
245 1.37 chopps }
246 1.37 chopps return ((struct sockaddr *)dp);
247 1.35 chopps }
248 1.35 chopps
249 1.10 mycroft static void
250 1.67 elad p_krtentry(rt)
251 1.23 lukem struct rtentry *rt;
252 1.4 paul {
253 1.10 mycroft static struct ifnet ifnet, *lastif;
254 1.37 chopps union sockaddr_union addr_un, mask_un;
255 1.35 chopps struct sockaddr *addr, *mask;
256 1.40 is
257 1.40 is if (Lflag && (rt->rt_flags & RTF_LLINFO))
258 1.40 is return;
259 1.4 paul
260 1.38 itojun memset(&addr_un, 0, sizeof(addr_un));
261 1.38 itojun memset(&mask_un, 0, sizeof(mask_un));
262 1.69 dyoung addr = sockcopy(kgetsa(rt_getkey(rt)), &addr_un);
263 1.35 chopps if (rt_mask(rt))
264 1.37 chopps mask = sockcopy(kgetsa(rt_mask(rt)), &mask_un);
265 1.16 mellon else
266 1.38 itojun mask = sockcopy(NULL, &mask_un);
267 1.67 elad p_addr(addr, mask, rt->rt_flags);
268 1.67 elad p_gwaddr(kgetsa(rt->rt_gateway), kgetsa(rt->rt_gateway)->sa_family);
269 1.67 elad p_flags(rt->rt_flags, "%-6.6s ");
270 1.76 matt printf("%6d %8"PRIu64" ", rt->rt_refcnt, rt->rt_use);
271 1.13 thorpej if (rt->rt_rmx.rmx_mtu)
272 1.76 matt printf("%6"PRIu64, rt->rt_rmx.rmx_mtu);
273 1.13 thorpej else
274 1.26 kml printf("%6s", "-");
275 1.26 kml putchar((rt->rt_rmx.rmx_locks & RTV_MTU) ? 'L' : ' ');
276 1.75 kefren if (tagflag == 1) {
277 1.75 kefren if (rt->rt_tag != NULL) {
278 1.75 kefren const struct sockaddr_mpls *sampls =
279 1.75 kefren (const struct sockaddr_mpls*)kgetsa(rt->rt_tag);
280 1.75 kefren union mpls_shim shim;
281 1.75 kefren
282 1.75 kefren if (sampls->smpls_family == AF_MPLS) {
283 1.75 kefren shim.s_addr = ntohl(sampls->smpls_addr.s_addr);
284 1.75 kefren printf("%7d", shim.shim.label);
285 1.75 kefren }
286 1.75 kefren else
287 1.75 kefren printf("%7s", "-");
288 1.75 kefren } else
289 1.75 kefren printf("%7s", "-");
290 1.75 kefren }
291 1.10 mycroft if (rt->rt_ifp) {
292 1.10 mycroft if (rt->rt_ifp != lastif) {
293 1.10 mycroft kget(rt->rt_ifp, ifnet);
294 1.10 mycroft lastif = rt->rt_ifp;
295 1.10 mycroft }
296 1.15 thorpej printf(" %.16s%s", ifnet.if_xname,
297 1.10 mycroft rt->rt_nodes[0].rn_dupedkey ? " =>" : "");
298 1.1 cgd }
299 1.10 mycroft putchar('\n');
300 1.34 kml if (vflag) {
301 1.76 matt printf("\texpire %10"PRId64"%c recvpipe %10"PRIu64"%c "
302 1.76 matt "sendpipe %10"PRIu64"%c\n",
303 1.76 matt (int64_t)rt->rt_rmx.rmx_expire,
304 1.34 kml (rt->rt_rmx.rmx_locks & RTV_EXPIRE) ? 'L' : ' ',
305 1.34 kml rt->rt_rmx.rmx_recvpipe,
306 1.34 kml (rt->rt_rmx.rmx_locks & RTV_RPIPE) ? 'L' : ' ',
307 1.34 kml rt->rt_rmx.rmx_sendpipe,
308 1.34 kml (rt->rt_rmx.rmx_locks & RTV_SPIPE) ? 'L' : ' ');
309 1.76 matt printf("\tssthresh %10"PRIu64"%c rtt %10"PRIu64"%c "
310 1.76 matt "rttvar %10"PRIu64"%c\n",
311 1.34 kml rt->rt_rmx.rmx_ssthresh,
312 1.34 kml (rt->rt_rmx.rmx_locks & RTV_SSTHRESH) ? 'L' : ' ',
313 1.34 kml rt->rt_rmx.rmx_rtt,
314 1.34 kml (rt->rt_rmx.rmx_locks & RTV_RTT) ? 'L' : ' ',
315 1.34 kml rt->rt_rmx.rmx_rttvar,
316 1.34 kml (rt->rt_rmx.rmx_locks & RTV_RTTVAR) ? 'L' : ' ');
317 1.76 matt printf("\thopcount %10"PRIu64"%c\n",
318 1.54 enami rt->rt_rmx.rmx_hopcount,
319 1.54 enami (rt->rt_rmx.rmx_locks & RTV_HOPCOUNT) ? 'L' : ' ');
320 1.54 enami }
321 1.1 cgd }
322 1.1 cgd
323 1.1 cgd /*
324 1.1 cgd * Print routing statistics
325 1.1 cgd */
326 1.10 mycroft void
327 1.1 cgd rt_stats(off)
328 1.9 cgd u_long off;
329 1.1 cgd {
330 1.73 lukem struct rtstat rtstats;
331 1.1 cgd
332 1.67 elad if (use_sysctl) {
333 1.73 lukem size_t rtsize = sizeof(rtstats);
334 1.67 elad
335 1.73 lukem if (sysctlbyname("net.route.stats", &rtstats, &rtsize,
336 1.67 elad NULL, 0) == -1)
337 1.67 elad err(1, "rt_stats: sysctl");
338 1.67 elad } else if (off == 0) {
339 1.1 cgd printf("rtstat: symbol not in namelist\n");
340 1.1 cgd return;
341 1.67 elad } else
342 1.73 lukem kread(off, (char *)&rtstats, sizeof(rtstats));
343 1.67 elad
344 1.1 cgd printf("routing:\n");
345 1.53 itojun printf("\t%llu bad routing redirect%s\n",
346 1.73 lukem (unsigned long long)rtstats.rts_badredirect,
347 1.73 lukem plural(rtstats.rts_badredirect));
348 1.53 itojun printf("\t%llu dynamically created route%s\n",
349 1.73 lukem (unsigned long long)rtstats.rts_dynamic,
350 1.73 lukem plural(rtstats.rts_dynamic));
351 1.53 itojun printf("\t%llu new gateway%s due to redirects\n",
352 1.73 lukem (unsigned long long)rtstats.rts_newgateway,
353 1.73 lukem plural(rtstats.rts_newgateway));
354 1.53 itojun printf("\t%llu destination%s found unreachable\n",
355 1.73 lukem (unsigned long long)rtstats.rts_unreach,
356 1.73 lukem plural(rtstats.rts_unreach));
357 1.53 itojun printf("\t%llu use%s of a wildcard route\n",
358 1.73 lukem (unsigned long long)rtstats.rts_wildcard,
359 1.73 lukem plural(rtstats.rts_wildcard));
360 1.1 cgd }
361 1.67 elad
362 1.10 mycroft void
363 1.1 cgd upHex(p0)
364 1.10 mycroft char *p0;
365 1.1 cgd {
366 1.23 lukem char *p = p0;
367 1.1 cgd
368 1.29 mrg for (; *p; p++)
369 1.29 mrg switch (*p) {
370 1.29 mrg case 'a':
371 1.29 mrg case 'b':
372 1.29 mrg case 'c':
373 1.29 mrg case 'd':
374 1.29 mrg case 'e':
375 1.29 mrg case 'f':
376 1.29 mrg *p += ('A' - 'a');
377 1.29 mrg }
378 1.1 cgd }
379 1.67 elad
380 1.67 elad
381