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