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