1 /* $OpenBSD: route.c,v 1.87 2009/08/04 03:45:47 tedu Exp $ */ 2 /* $NetBSD: route.c,v 1.15 1996/05/07 02:55:06 thorpej Exp $ */ 3 4 /* 5 * Copyright (c) 1983, 1988, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33 #include <sys/param.h> 34 #include <sys/protosw.h> 35 #include <sys/socket.h> 36 #include <sys/mbuf.h> 37 38 #include <net/if.h> 39 #include <net/if_dl.h> 40 #include <net/if_types.h> 41 #define _KERNEL 42 #include <net/route.h> 43 #undef _KERNEL 44 #include <netinet/in.h> 45 #include <arpa/inet.h> 46 47 #include <sys/sysctl.h> 48 49 #include <err.h> 50 #include <limits.h> 51 #include <netdb.h> 52 #include <stdio.h> 53 #include <stdlib.h> 54 #include <string.h> 55 #include <unistd.h> 56 57 #ifndef INET 58 #define INET 59 #endif 60 61 #include <netinet/ip_ipsp.h> 62 #include "netstat.h" 63 64 /* alignment constraint for routing socket */ 65 #define ROUNDUP(a) \ 66 ((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long)) 67 #define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len)) 68 69 struct radix_node_head ***rt_head; 70 struct radix_node_head ***rnt; 71 struct radix_node_head *rt_tables[AF_MAX+1]; /* provides enough space */ 72 u_int8_t af2rtafidx[AF_MAX+1]; 73 74 static union { 75 struct sockaddr u_sa; 76 u_int32_t u_data[64]; 77 int u_dummy; /* force word-alignment */ 78 } pt_u; 79 80 int do_rtent = 0; 81 struct rtentry rtentry; 82 struct radix_node rnode; 83 struct radix_mask rmask; 84 85 static struct sockaddr *kgetsa(struct sockaddr *); 86 static void p_tree(struct radix_node *); 87 static void p_rtnode(void); 88 static void p_rtflags(u_char); 89 static void p_krtentry(struct rtentry *); 90 static void encap_print(struct rtentry *); 91 92 /* 93 * Print routing tables. 94 */ 95 void 96 routepr(u_long rtree, u_long mtree, u_long af2idx, u_long rtbl_id_max, 97 u_int tableid) 98 { 99 struct radix_node_head *rnh, head; 100 int i, idxmax = 0; 101 u_int rtidxmax; 102 103 printf("Routing tables\n"); 104 105 if (rtree == NULL || af2idx == NULL) { 106 printf("rt_tables: symbol not in namelist\n"); 107 return; 108 } 109 110 kread((u_long)rtree, &rt_head, sizeof(rt_head)); 111 kread((u_long)rtbl_id_max, &rtidxmax, sizeof(rtidxmax)); 112 kread((long)af2idx, &af2rtafidx, sizeof(af2rtafidx)); 113 114 for (i = 0; i <= AF_MAX; i++) { 115 if (af2rtafidx[i] > idxmax) 116 idxmax = af2rtafidx[i]; 117 } 118 119 if ((rnt = calloc(rtidxmax + 1, sizeof(struct radix_node_head **))) == 120 NULL) 121 err(1, NULL); 122 123 kread((u_long)rt_head, rnt, (rtidxmax + 1) * 124 sizeof(struct radix_node_head **)); 125 if (tableid > rtidxmax || rnt[tableid] == NULL) { 126 printf("Bad table %u\n", tableid); 127 return; 128 } 129 kread((u_long)rnt[tableid], rt_tables, (idxmax + 1) * sizeof(rnh)); 130 131 for (i = 0; i <= AF_MAX; i++) { 132 if (i == AF_UNSPEC) { 133 if (Aflag && (af == AF_UNSPEC || af == 0xff)) { 134 kread(mtree, &rnh, sizeof(rnh)); 135 kread((u_long)rnh, &head, sizeof(head)); 136 printf("Netmasks:\n"); 137 p_tree(head.rnh_treetop); 138 } 139 continue; 140 } 141 if (af2rtafidx[i] == NULL) 142 /* no table for this AF */ 143 continue; 144 if ((rnh = rt_tables[af2rtafidx[i]]) == NULL) 145 continue; 146 kread((u_long)rnh, &head, sizeof(head)); 147 if (af == AF_UNSPEC || af == i) { 148 pr_family(i); 149 do_rtent = 1; 150 pr_rthdr(i, Aflag); 151 p_tree(head.rnh_treetop); 152 } 153 } 154 } 155 156 static struct sockaddr * 157 kgetsa(struct sockaddr *dst) 158 { 159 160 kread((u_long)dst, &pt_u.u_sa, sizeof(pt_u.u_sa)); 161 if (pt_u.u_sa.sa_len > sizeof (pt_u.u_sa)) 162 kread((u_long)dst, pt_u.u_data, pt_u.u_sa.sa_len); 163 return (&pt_u.u_sa); 164 } 165 166 static void 167 p_tree(struct radix_node *rn) 168 { 169 170 again: 171 kread((u_long)rn, &rnode, sizeof(rnode)); 172 if (rnode.rn_b < 0) { 173 if (Aflag) 174 printf("%-16p ", rn); 175 if (rnode.rn_flags & RNF_ROOT) { 176 if (Aflag) 177 printf("(root node)%s", 178 rnode.rn_dupedkey ? " =>\n" : "\n"); 179 } else if (do_rtent) { 180 kread((u_long)rn, &rtentry, sizeof(rtentry)); 181 p_krtentry(&rtentry); 182 if (Aflag) 183 p_rtnode(); 184 } else { 185 p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_key), 186 0, 0, 44); 187 putchar('\n'); 188 } 189 if ((rn = rnode.rn_dupedkey)) 190 goto again; 191 } else { 192 if (Aflag && do_rtent) { 193 printf("%-16p ", rn); 194 p_rtnode(); 195 } 196 rn = rnode.rn_r; 197 p_tree(rnode.rn_l); 198 p_tree(rn); 199 } 200 } 201 202 static void 203 p_rtflags(u_char flags) 204 { 205 putchar('<'); 206 if (flags & RNF_NORMAL) 207 putchar('N'); 208 if (flags & RNF_ROOT) 209 putchar('R'); 210 if (flags & RNF_ACTIVE) 211 putchar('A'); 212 if (flags & ~(RNF_NORMAL | RNF_ROOT | RNF_ACTIVE)) 213 printf("/0x%02x", flags); 214 putchar('>'); 215 } 216 217 char nbuf[25]; 218 219 static void 220 p_rtnode(void) 221 { 222 struct radix_mask *rm = rnode.rn_mklist; 223 224 if (rnode.rn_b < 0) { 225 snprintf(nbuf, sizeof nbuf, " => %p", rnode.rn_dupedkey); 226 printf("\t (%p)%s", rnode.rn_p, 227 rnode.rn_dupedkey ? nbuf : ""); 228 if (rnode.rn_mask) { 229 printf(" mask "); 230 p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_mask), 231 0, 0, -1); 232 } else if (rm == NULL) { 233 putchar('\n'); 234 return; 235 } 236 } else { 237 snprintf(nbuf, sizeof nbuf, "(%d)", rnode.rn_b); 238 printf("%6.6s (%p) %16p : %16p", nbuf, rnode.rn_p, rnode.rn_l, 239 rnode.rn_r); 240 } 241 242 putchar(' '); 243 p_rtflags(rnode.rn_flags); 244 245 while (rm) { 246 kread((u_long)rm, &rmask, sizeof(rmask)); 247 snprintf(nbuf, sizeof nbuf, " %d refs, ", rmask.rm_refs); 248 printf("\n\tmk = %p {(%d),%s", 249 rm, -1 - rmask.rm_b, rmask.rm_refs ? nbuf : " "); 250 p_rtflags(rmask.rm_flags); 251 printf(", "); 252 if (rmask.rm_flags & RNF_NORMAL) { 253 struct radix_node rnode_aux; 254 255 printf("leaf = %p ", rmask.rm_leaf); 256 kread((u_long)rmask.rm_leaf, &rnode_aux, sizeof(rnode_aux)); 257 p_sockaddr(kgetsa((struct sockaddr *)rnode_aux.rn_mask), 258 0, 0, -1); 259 } else 260 p_sockaddr(kgetsa((struct sockaddr *)rmask.rm_mask), 261 0, 0, -1); 262 putchar('}'); 263 if ((rm = rmask.rm_mklist)) 264 printf(" ->"); 265 } 266 putchar('\n'); 267 } 268 269 static void 270 p_krtentry(struct rtentry *rt) 271 { 272 static struct ifnet ifnet, *lastif; 273 struct sockaddr_storage sock1, sock2; 274 struct sockaddr *sa = (struct sockaddr *)&sock1; 275 struct sockaddr *mask = (struct sockaddr *)&sock2; 276 277 bcopy(kgetsa(rt_key(rt)), sa, sizeof(struct sockaddr)); 278 if (sa->sa_len > sizeof(struct sockaddr)) 279 bcopy(kgetsa(rt_key(rt)), sa, sa->sa_len); 280 281 if (sa->sa_family == PF_KEY) { 282 encap_print(rt); 283 return; 284 } 285 286 if (rt_mask(rt)) { 287 bcopy(kgetsa(rt_mask(rt)), mask, sizeof(struct sockaddr)); 288 if (sa->sa_len > sizeof(struct sockaddr)) 289 bcopy(kgetsa(rt_mask(rt)), mask, sa->sa_len); 290 } else 291 mask = 0; 292 293 p_addr(sa, mask, rt->rt_flags); 294 p_gwaddr(kgetsa(rt->rt_gateway), sa->sa_family); 295 p_flags(rt->rt_flags, "%-6.6s "); 296 printf("%5u %8lld ", rt->rt_refcnt, rt->rt_use); 297 if (rt->rt_rmx.rmx_mtu) 298 printf("%5u ", rt->rt_rmx.rmx_mtu); 299 else 300 printf("%5s ", "-"); 301 putchar((rt->rt_rmx.rmx_locks & RTV_MTU) ? 'L' : ' '); 302 printf(" %2d", rt->rt_priority); 303 304 if (rt->rt_ifp) { 305 if (rt->rt_ifp != lastif) { 306 kread((u_long)rt->rt_ifp, &ifnet, sizeof(ifnet)); 307 lastif = rt->rt_ifp; 308 } 309 printf(" %.16s%s", ifnet.if_xname, 310 rt->rt_nodes[0].rn_dupedkey ? " =>" : ""); 311 } 312 putchar('\n'); 313 if (vflag) 314 printf("\texpire %10u%c\n", 315 rt->rt_rmx.rmx_expire, 316 (rt->rt_rmx.rmx_locks & RTV_EXPIRE) ? 'L' : ' '); 317 } 318 319 /* 320 * Print routing statistics 321 */ 322 void 323 rt_stats(void) 324 { 325 struct rtstat rtstat; 326 int mib[6]; 327 size_t size; 328 329 mib[0] = CTL_NET; 330 mib[1] = PF_ROUTE; 331 mib[2] = 0; 332 mib[3] = 0; 333 mib[4] = NET_RT_STATS; 334 mib[5] = 0; 335 size = sizeof (rtstat); 336 337 if (sysctl(mib, 6, &rtstat, &size, NULL, 0) < 0) { 338 perror("sysctl of routing table statistics"); 339 exit(1); 340 } 341 342 printf("routing:\n"); 343 printf("\t%u bad routing redirect%s\n", 344 rtstat.rts_badredirect, plural(rtstat.rts_badredirect)); 345 printf("\t%u dynamically created route%s\n", 346 rtstat.rts_dynamic, plural(rtstat.rts_dynamic)); 347 printf("\t%u new gateway%s due to redirects\n", 348 rtstat.rts_newgateway, plural(rtstat.rts_newgateway)); 349 printf("\t%u destination%s found unreachable\n", 350 rtstat.rts_unreach, plural(rtstat.rts_unreach)); 351 printf("\t%u use%s of a wildcard route\n", 352 rtstat.rts_wildcard, plural(rtstat.rts_wildcard)); 353 } 354 355 static void 356 encap_print(struct rtentry *rt) 357 { 358 struct sockaddr_encap sen1, sen2, sen3; 359 struct ipsec_policy ipo; 360 struct sockaddr_in6 s61, s62; 361 362 bcopy(kgetsa(rt_key(rt)), &sen1, sizeof(sen1)); 363 bcopy(kgetsa(rt_mask(rt)), &sen2, sizeof(sen2)); 364 bcopy(kgetsa(rt->rt_gateway), &sen3, sizeof(sen3)); 365 366 if (sen1.sen_type == SENT_IP4) { 367 printf("%-18s %-5u ", netname4(sen1.sen_ip_src.s_addr, 368 sen2.sen_ip_src.s_addr), ntohs(sen1.sen_sport)); 369 printf("%-18s %-5u %-5u ", netname4(sen1.sen_ip_dst.s_addr, 370 sen2.sen_ip_dst.s_addr), 371 ntohs(sen1.sen_dport), sen1.sen_proto); 372 } 373 374 if (sen1.sen_type == SENT_IP6) { 375 bzero(&s61, sizeof(s61)); 376 bzero(&s62, sizeof(s62)); 377 s61.sin6_family = s62.sin6_family = AF_INET6; 378 s61.sin6_len = s62.sin6_len = sizeof(s61); 379 bcopy(&sen1.sen_ip6_src, &s61.sin6_addr, sizeof(struct in6_addr)); 380 #ifdef __KAME__ 381 if (IN6_IS_ADDR_LINKLOCAL(&s61.sin6_addr) || 382 IN6_IS_ADDR_MC_LINKLOCAL(&s61.sin6_addr) || 383 IN6_IS_ADDR_MC_INTFACELOCAL(&s61.sin6_addr)) { 384 s61.sin6_scope_id = 385 ((u_int16_t)s61.sin6_addr.s6_addr[2] << 8) | 386 s61.sin6_addr.s6_addr[3]; 387 s61.sin6_addr.s6_addr[2] = s61.sin6_addr.s6_addr[3] = 0; 388 } 389 #endif 390 bcopy(&sen2.sen_ip6_src, &s62.sin6_addr, sizeof(struct in6_addr)); 391 #ifdef __KAME__ 392 if (IN6_IS_ADDR_LINKLOCAL(&s62.sin6_addr) || 393 IN6_IS_ADDR_MC_LINKLOCAL(&s62.sin6_addr) || 394 IN6_IS_ADDR_MC_INTFACELOCAL(&s62.sin6_addr)) { 395 s62.sin6_scope_id = 396 ((u_int16_t)s62.sin6_addr.s6_addr[2] << 8) | 397 s62.sin6_addr.s6_addr[3]; 398 s62.sin6_addr.s6_addr[2] = s62.sin6_addr.s6_addr[3] = 0; 399 } 400 #endif 401 402 printf("%-42s %-5u ", netname6(&s61, &s62), 403 ntohs(sen1.sen_ip6_sport)); 404 405 bzero(&s61, sizeof(s61)); 406 bzero(&s62, sizeof(s62)); 407 s61.sin6_family = s62.sin6_family = AF_INET6; 408 s61.sin6_len = s62.sin6_len = sizeof(s61); 409 bcopy(&sen1.sen_ip6_dst, &s61.sin6_addr, sizeof(struct in6_addr)); 410 #ifdef __KAME__ 411 if (IN6_IS_ADDR_LINKLOCAL(&s61.sin6_addr) || 412 IN6_IS_ADDR_MC_LINKLOCAL(&s61.sin6_addr) || 413 IN6_IS_ADDR_MC_INTFACELOCAL(&s61.sin6_addr)) { 414 s61.sin6_scope_id = 415 ((u_int16_t)s61.sin6_addr.s6_addr[2] << 8) | 416 s61.sin6_addr.s6_addr[3]; 417 s61.sin6_addr.s6_addr[2] = s61.sin6_addr.s6_addr[3] = 0; 418 } 419 #endif 420 bcopy(&sen2.sen_ip6_dst, &s62.sin6_addr, sizeof(struct in6_addr)); 421 #ifdef __KAME__ 422 if (IN6_IS_ADDR_LINKLOCAL(&s62.sin6_addr) || 423 IN6_IS_ADDR_MC_LINKLOCAL(&s62.sin6_addr) || 424 IN6_IS_ADDR_MC_INTFACELOCAL(&s62.sin6_addr)) { 425 s62.sin6_scope_id = 426 ((u_int16_t)s62.sin6_addr.s6_addr[2] << 8) | 427 s62.sin6_addr.s6_addr[3]; 428 s62.sin6_addr.s6_addr[2] = s62.sin6_addr.s6_addr[3] = 0; 429 } 430 #endif 431 432 printf("%-42s %-5u %-5u ", netname6(&s61, &s62), 433 ntohs(sen1.sen_ip6_dport), sen1.sen_ip6_proto); 434 } 435 436 if (sen3.sen_type == SENT_IPSP) { 437 char hostn[NI_MAXHOST]; 438 439 kread((u_long)sen3.sen_ipsp, &ipo, sizeof(ipo)); 440 441 if (getnameinfo(&ipo.ipo_dst.sa, ipo.ipo_dst.sa.sa_len, 442 hostn, NI_MAXHOST, NULL, 0, NI_NUMERICHOST) != 0) 443 strlcpy (hostn, "none", NI_MAXHOST); 444 445 printf("%s", hostn); 446 printf("/%-u", ipo.ipo_sproto); 447 448 switch (ipo.ipo_type) { 449 case IPSP_IPSEC_REQUIRE: 450 printf("/require"); 451 break; 452 case IPSP_IPSEC_ACQUIRE: 453 printf("/acquire"); 454 break; 455 case IPSP_IPSEC_USE: 456 printf("/use"); 457 break; 458 case IPSP_IPSEC_DONTACQ: 459 printf("/dontacq"); 460 break; 461 case IPSP_PERMIT: 462 printf("/bypass"); 463 break; 464 case IPSP_DENY: 465 printf("/deny"); 466 break; 467 default: 468 printf("/<unknown type!>"); 469 break; 470 } 471 472 if ((ipo.ipo_addr.sen_type == SENT_IP4 && 473 ipo.ipo_addr.sen_direction == IPSP_DIRECTION_IN) || 474 (ipo.ipo_addr.sen_type == SENT_IP6 && 475 ipo.ipo_addr.sen_ip6_direction == IPSP_DIRECTION_IN)) 476 printf("/in\n"); 477 else if ((ipo.ipo_addr.sen_type == SENT_IP4 && 478 ipo.ipo_addr.sen_direction == IPSP_DIRECTION_OUT) || 479 (ipo.ipo_addr.sen_type == SENT_IP6 && 480 ipo.ipo_addr.sen_ip6_direction == IPSP_DIRECTION_OUT)) 481 printf("/out\n"); 482 else 483 printf("/<unknown>\n"); 484 } 485 } 486