1 /* 2 * Copyright (c) 1983, 1988, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 static char sccsid[] = "@(#)route.c 8.3 (Berkeley) 3/9/94"; 36 #endif /* not lint */ 37 38 #include <sys/param.h> 39 #include <sys/protosw.h> 40 #include <sys/socket.h> 41 #include <sys/mbuf.h> 42 43 #include <net/if.h> 44 #include <net/if_dl.h> 45 #include <net/if_types.h> 46 #define KERNEL 47 #include <net/route.h> 48 #undef KERNEL 49 #include <netinet/in.h> 50 51 #include <netns/ns.h> 52 53 #include <sys/sysctl.h> 54 55 #include <netdb.h> 56 #include <stdio.h> 57 #include <stdlib.h> 58 #include <string.h> 59 #include <unistd.h> 60 #include "netstat.h" 61 62 #define kget(p, d) (kread((u_long)(p), (char *)&(d), sizeof (d))) 63 64 /* 65 * Definitions for showing gateway flags. 66 */ 67 struct bits { 68 u_long b_mask; 69 char b_val; 70 } bits[] = { 71 { RTF_UP, 'U' }, 72 { RTF_GATEWAY, 'G' }, 73 { RTF_HOST, 'H' }, 74 { RTF_REJECT, 'R' }, 75 { RTF_DYNAMIC, 'D' }, 76 { RTF_MODIFIED, 'M' }, 77 { RTF_DONE, 'd' }, /* Completed -- for routing messages only */ 78 { RTF_MASK, 'm' }, /* Mask Present -- for routing messages only */ 79 { RTF_CLONING, 'C' }, 80 { RTF_XRESOLVE, 'X' }, 81 { RTF_LLINFO, 'L' }, 82 { RTF_STATIC, 'S' }, 83 { RTF_PROTO1, '1' }, 84 { RTF_PROTO2, '2' }, 85 { RTF_WASCLONED,'W' }, 86 { RTF_PRCLONING,'c' }, 87 { RTF_PROTO3, '3' }, 88 { 0 } 89 }; 90 91 static union { 92 struct sockaddr u_sa; 93 u_short u_data[128]; 94 } pt_u; 95 96 int do_rtent = 0; 97 struct rtentry rtentry; 98 struct radix_node rnode; 99 struct radix_mask rmask; 100 101 int NewTree = 0; 102 103 static struct sockaddr *kgetsa __P((struct sockaddr *)); 104 static void p_tree __P((struct radix_node *)); 105 static void p_rtnode __P(()); 106 static void ntreestuff __P(()); 107 static void np_rtentry __P((struct rt_msghdr *)); 108 static void p_sockaddr __P((struct sockaddr *, int, int)); 109 static void p_flags __P((int, char *)); 110 static void p_rtentry __P((struct rtentry *)); 111 112 /* 113 * Print routing tables. 114 */ 115 void 116 routepr(rtree) 117 u_long rtree; 118 { 119 struct radix_node_head *rnh, head; 120 int i; 121 122 printf("Routing tables\n"); 123 124 if (Aflag == 0 && NewTree) 125 ntreestuff(); 126 else { 127 if (rtree == 0) { 128 printf("rt_tables: symbol not in namelist\n"); 129 return; 130 } 131 132 kget(rtree, rt_tables); 133 for (i = 0; i <= AF_MAX; i++) { 134 if ((rnh = rt_tables[i]) == 0) 135 continue; 136 kget(rnh, head); 137 if (i == AF_UNSPEC) { 138 if (Aflag && af == 0) { 139 printf("Netmasks:\n"); 140 p_tree(head.rnh_treetop); 141 } 142 } else if (af == AF_UNSPEC || af == i) { 143 pr_family(i); 144 do_rtent = 1; 145 pr_rthdr(); 146 p_tree(head.rnh_treetop); 147 } 148 } 149 } 150 } 151 152 /* 153 * Print address family header before a section of the routing table. 154 */ 155 void 156 pr_family(af) 157 int af; 158 { 159 char *afname; 160 161 switch (af) { 162 case AF_INET: 163 afname = "Internet"; 164 break; 165 case AF_NS: 166 afname = "XNS"; 167 break; 168 case AF_ISO: 169 afname = "ISO"; 170 break; 171 case AF_CCITT: 172 afname = "X.25"; 173 break; 174 default: 175 afname = NULL; 176 break; 177 } 178 if (afname) 179 printf("\n%s:\n", afname); 180 else 181 printf("\nProtocol Family %d:\n", af); 182 } 183 184 /* column widths; each followed by one space */ 185 #define WID_DST 16 /* width of destination column */ 186 #define WID_GW 18 /* width of gateway column */ 187 188 /* 189 * Print header for routing table columns. 190 */ 191 void 192 pr_rthdr() 193 { 194 195 if (Aflag) 196 printf("%-8.8s ","Address"); 197 printf("%-*.*s %-*.*s %-6.6s %6.6s%8.8s %s\n", 198 WID_DST, WID_DST, "Destination", 199 WID_GW, WID_GW, "Gateway", 200 "Flags", "Refs", "Use", "Interface"); 201 } 202 203 static struct sockaddr * 204 kgetsa(dst) 205 register struct sockaddr *dst; 206 { 207 208 kget(dst, pt_u.u_sa); 209 if (pt_u.u_sa.sa_len > sizeof (pt_u.u_sa)) 210 kread((u_long)dst, (char *)pt_u.u_data, pt_u.u_sa.sa_len); 211 return (&pt_u.u_sa); 212 } 213 214 static void 215 p_tree(rn) 216 struct radix_node *rn; 217 { 218 219 again: 220 kget(rn, rnode); 221 if (rnode.rn_b < 0) { 222 if (Aflag) 223 printf("%-8.8x ", rn); 224 if (rnode.rn_flags & RNF_ROOT) { 225 if (Aflag) 226 printf("(root node)%s", 227 rnode.rn_dupedkey ? " =>\n" : "\n"); 228 } else if (do_rtent) { 229 kget(rn, rtentry); 230 p_rtentry(&rtentry); 231 if (Aflag) 232 p_rtnode(); 233 } else { 234 p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_key), 235 0, 44); 236 putchar('\n'); 237 } 238 if (rn = rnode.rn_dupedkey) 239 goto again; 240 } else { 241 if (Aflag && do_rtent) { 242 printf("%-8.8x ", rn); 243 p_rtnode(); 244 } 245 rn = rnode.rn_r; 246 p_tree(rnode.rn_l); 247 p_tree(rn); 248 } 249 } 250 251 char nbuf[20]; 252 253 static void 254 p_rtnode() 255 { 256 struct radix_mask *rm = rnode.rn_mklist; 257 258 if (rnode.rn_b < 0) { 259 if (rnode.rn_mask) { 260 printf("\t mask "); 261 p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_mask), 262 0, -1); 263 } else if (rm == 0) 264 return; 265 } else { 266 sprintf(nbuf, "(%d)", rnode.rn_b); 267 printf("%6.6s %8.8x : %8.8x", nbuf, rnode.rn_l, rnode.rn_r); 268 } 269 while (rm) { 270 kget(rm, rmask); 271 sprintf(nbuf, " %d refs, ", rmask.rm_refs); 272 printf(" mk = %8.8x {(%d),%s", 273 rm, -1 - rmask.rm_b, rmask.rm_refs ? nbuf : " "); 274 p_sockaddr(kgetsa((struct sockaddr *)rmask.rm_mask), 0, -1); 275 putchar('}'); 276 if (rm = rmask.rm_mklist) 277 printf(" ->"); 278 } 279 putchar('\n'); 280 } 281 282 static void 283 ntreestuff() 284 { 285 size_t needed; 286 int mib[6]; 287 char *buf, *next, *lim; 288 register struct rt_msghdr *rtm; 289 290 mib[0] = CTL_NET; 291 mib[1] = PF_ROUTE; 292 mib[2] = 0; 293 mib[3] = 0; 294 mib[4] = NET_RT_DUMP; 295 mib[5] = 0; 296 if (sysctl(mib, 6, NULL, &needed, NULL, 0) < 0) 297 { perror("route-sysctl-estimate"); exit(1);} 298 if ((buf = malloc(needed)) == 0) 299 { printf("out of space\n"); exit(1);} 300 if (sysctl(mib, 6, buf, &needed, NULL, 0) < 0) 301 { perror("sysctl of routing table"); exit(1);} 302 lim = buf + needed; 303 for (next = buf; next < lim; next += rtm->rtm_msglen) { 304 rtm = (struct rt_msghdr *)next; 305 np_rtentry(rtm); 306 } 307 } 308 309 static void 310 np_rtentry(rtm) 311 register struct rt_msghdr *rtm; 312 { 313 register struct sockaddr *sa = (struct sockaddr *)(rtm + 1); 314 #ifdef notdef 315 static int masks_done, banner_printed; 316 #endif 317 static int old_af; 318 int af = 0, interesting = RTF_UP | RTF_GATEWAY | RTF_HOST; 319 320 #ifdef notdef 321 /* for the moment, netmasks are skipped over */ 322 if (!banner_printed) { 323 printf("Netmasks:\n"); 324 banner_printed = 1; 325 } 326 if (masks_done == 0) { 327 if (rtm->rtm_addrs != RTA_DST ) { 328 masks_done = 1; 329 af = sa->sa_family; 330 } 331 } else 332 #endif 333 af = sa->sa_family; 334 if (af != old_af) { 335 pr_family(af); 336 old_af = af; 337 } 338 if (rtm->rtm_addrs == RTA_DST) 339 p_sockaddr(sa, 0, 36); 340 else { 341 p_sockaddr(sa, rtm->rtm_flags, 16); 342 if (sa->sa_len == 0) 343 sa->sa_len = sizeof(long); 344 sa = (struct sockaddr *)(sa->sa_len + (char *)sa); 345 p_sockaddr(sa, 0, 18); 346 } 347 p_flags(rtm->rtm_flags & interesting, "%-6.6s "); 348 putchar('\n'); 349 } 350 351 static void 352 p_sockaddr(sa, flags, width) 353 struct sockaddr *sa; 354 int flags, width; 355 { 356 char workbuf[128], *cplim; 357 register char *cp = workbuf; 358 359 switch(sa->sa_family) { 360 case AF_INET: 361 { 362 register struct sockaddr_in *sin = (struct sockaddr_in *)sa; 363 364 cp = (sin->sin_addr.s_addr == 0) ? "default" : 365 ((flags & RTF_HOST) ? 366 routename(sin->sin_addr.s_addr) : 367 netname(sin->sin_addr.s_addr, 0L)); 368 break; 369 } 370 371 case AF_NS: 372 cp = ns_print(sa); 373 break; 374 375 case AF_LINK: 376 { 377 register struct sockaddr_dl *sdl = (struct sockaddr_dl *)sa; 378 379 if (sdl->sdl_nlen == 0 && sdl->sdl_alen == 0 && 380 sdl->sdl_slen == 0) 381 (void) sprintf(workbuf, "link#%d", sdl->sdl_index); 382 else switch (sdl->sdl_type) { 383 case IFT_ETHER: 384 { 385 register int i; 386 register u_char *lla = (u_char *)sdl->sdl_data + 387 sdl->sdl_nlen; 388 389 cplim = ""; 390 for (i = 0; i < sdl->sdl_alen; i++, lla++) { 391 cp += sprintf(cp, "%s%x", cplim, *lla); 392 cplim = ":"; 393 } 394 cp = workbuf; 395 break; 396 } 397 default: 398 cp = link_ntoa(sdl); 399 break; 400 } 401 break; 402 } 403 404 default: 405 { 406 register u_char *s = (u_char *)sa->sa_data, *slim; 407 408 slim = sa->sa_len + (u_char *) sa; 409 cplim = cp + sizeof(workbuf) - 6; 410 cp += sprintf(cp, "(%d)", sa->sa_family); 411 while (s < slim && cp < cplim) { 412 cp += sprintf(cp, " %02x", *s++); 413 if (s < slim) 414 cp += sprintf(cp, "%02x", *s++); 415 } 416 cp = workbuf; 417 } 418 } 419 if (width < 0 ) 420 printf("%s ", cp); 421 else { 422 if (nflag) 423 printf("%-*s ", width, cp); 424 else 425 printf("%-*.*s ", width, width, cp); 426 } 427 } 428 429 static void 430 p_flags(f, format) 431 register int f; 432 char *format; 433 { 434 char name[33], *flags; 435 register struct bits *p = bits; 436 437 for (flags = name; p->b_mask; p++) 438 if (p->b_mask & f) 439 *flags++ = p->b_val; 440 *flags = '\0'; 441 printf(format, name); 442 } 443 444 static void 445 p_rtentry(rt) 446 register struct rtentry *rt; 447 { 448 static struct ifnet ifnet, *lastif; 449 static char name[16]; 450 451 p_sockaddr(kgetsa(rt_key(rt)), rt->rt_flags, WID_DST); 452 p_sockaddr(kgetsa(rt->rt_gateway), RTF_HOST, WID_GW); 453 p_flags(rt->rt_flags, "%-6.6s "); 454 printf("%6d %8d ", rt->rt_refcnt, rt->rt_use); 455 if (rt->rt_ifp) { 456 if (rt->rt_ifp != lastif) { 457 kget(rt->rt_ifp, ifnet); 458 kread((u_long)ifnet.if_name, name, 16); 459 lastif = rt->rt_ifp; 460 } 461 printf(" %.15s%d%s", name, ifnet.if_unit, 462 rt->rt_nodes[0].rn_dupedkey ? " =>" : ""); 463 } 464 putchar('\n'); 465 } 466 467 char * 468 routename(in) 469 u_long in; 470 { 471 register char *cp; 472 static char line[MAXHOSTNAMELEN + 1]; 473 struct hostent *hp; 474 static char domain[MAXHOSTNAMELEN + 1]; 475 static int first = 1; 476 477 if (first) { 478 first = 0; 479 if (gethostname(domain, MAXHOSTNAMELEN) == 0 && 480 (cp = index(domain, '.'))) 481 (void) strcpy(domain, cp + 1); 482 else 483 domain[0] = 0; 484 } 485 cp = 0; 486 if (!nflag) { 487 hp = gethostbyaddr((char *)&in, sizeof (struct in_addr), 488 AF_INET); 489 if (hp) { 490 if ((cp = index(hp->h_name, '.')) && 491 !strcmp(cp + 1, domain)) 492 *cp = 0; 493 cp = hp->h_name; 494 } 495 } 496 if (cp) 497 strncpy(line, cp, sizeof(line) - 1); 498 else { 499 #define C(x) ((x) & 0xff) 500 in = ntohl(in); 501 sprintf(line, "%u.%u.%u.%u", 502 C(in >> 24), C(in >> 16), C(in >> 8), C(in)); 503 } 504 return (line); 505 } 506 507 /* 508 * Return the name of the network whose address is given. 509 * The address is assumed to be that of a net or subnet, not a host. 510 */ 511 char * 512 netname(in, mask) 513 u_long in, mask; 514 { 515 char *cp = 0; 516 static char line[MAXHOSTNAMELEN + 1]; 517 struct netent *np = 0; 518 u_long net; 519 register int i; 520 int subnetshift; 521 522 i = ntohl(in); 523 if (!nflag && i) { 524 if (mask == 0) { 525 if (IN_CLASSA(i)) { 526 mask = IN_CLASSA_NET; 527 subnetshift = 8; 528 } else if (IN_CLASSB(i)) { 529 mask = IN_CLASSB_NET; 530 subnetshift = 8; 531 } else { 532 mask = IN_CLASSC_NET; 533 subnetshift = 4; 534 } 535 /* 536 * If there are more bits than the standard mask 537 * would suggest, subnets must be in use. 538 * Guess at the subnet mask, assuming reasonable 539 * width subnet fields. 540 */ 541 while (i &~ mask) 542 mask = (long)mask >> subnetshift; 543 } 544 net = i & mask; 545 while ((mask & 1) == 0) 546 mask >>= 1, net >>= 1; 547 np = getnetbyaddr(net, AF_INET); 548 if (np) 549 cp = np->n_name; 550 } 551 if (cp) 552 strncpy(line, cp, sizeof(line) - 1); 553 else if ((i & 0xffffff) == 0) 554 sprintf(line, "%u", C(i >> 24)); 555 else if ((i & 0xffff) == 0) 556 sprintf(line, "%u.%u", C(i >> 24) , C(i >> 16)); 557 else if ((i & 0xff) == 0) 558 sprintf(line, "%u.%u.%u", C(i >> 24), C(i >> 16), C(i >> 8)); 559 else 560 sprintf(line, "%u.%u.%u.%u", C(i >> 24), 561 C(i >> 16), C(i >> 8), C(i)); 562 return (line); 563 } 564 565 /* 566 * Print routing statistics 567 */ 568 void 569 rt_stats(off) 570 u_long off; 571 { 572 struct rtstat rtstat; 573 574 if (off == 0) { 575 printf("rtstat: symbol not in namelist\n"); 576 return; 577 } 578 kread(off, (char *)&rtstat, sizeof (rtstat)); 579 printf("routing:\n"); 580 printf("\t%u bad routing redirect%s\n", 581 rtstat.rts_badredirect, plural(rtstat.rts_badredirect)); 582 printf("\t%u dynamically created route%s\n", 583 rtstat.rts_dynamic, plural(rtstat.rts_dynamic)); 584 printf("\t%u new gateway%s due to redirects\n", 585 rtstat.rts_newgateway, plural(rtstat.rts_newgateway)); 586 printf("\t%u destination%s found unreachable\n", 587 rtstat.rts_unreach, plural(rtstat.rts_unreach)); 588 printf("\t%u use%s of a wildcard route\n", 589 rtstat.rts_wildcard, plural(rtstat.rts_wildcard)); 590 } 591 short ns_nullh[] = {0,0,0}; 592 short ns_bh[] = {-1,-1,-1}; 593 594 char * 595 ns_print(sa) 596 register struct sockaddr *sa; 597 { 598 register struct sockaddr_ns *sns = (struct sockaddr_ns*)sa; 599 struct ns_addr work; 600 union { union ns_net net_e; u_long long_e; } net; 601 u_short port; 602 static char mybuf[50], cport[10], chost[25]; 603 char *host = ""; 604 register char *p; register u_char *q; 605 606 work = sns->sns_addr; 607 port = ntohs(work.x_port); 608 work.x_port = 0; 609 net.net_e = work.x_net; 610 if (ns_nullhost(work) && net.long_e == 0) { 611 if (port ) { 612 sprintf(mybuf, "*.%xH", port); 613 upHex(mybuf); 614 } else 615 sprintf(mybuf, "*.*"); 616 return (mybuf); 617 } 618 619 if (bcmp(ns_bh, work.x_host.c_host, 6) == 0) { 620 host = "any"; 621 } else if (bcmp(ns_nullh, work.x_host.c_host, 6) == 0) { 622 host = "*"; 623 } else { 624 q = work.x_host.c_host; 625 sprintf(chost, "%02x%02x%02x%02x%02x%02xH", 626 q[0], q[1], q[2], q[3], q[4], q[5]); 627 for (p = chost; *p == '0' && p < chost + 12; p++) 628 continue; 629 host = p; 630 } 631 if (port) 632 sprintf(cport, ".%xH", htons(port)); 633 else 634 *cport = 0; 635 636 sprintf(mybuf,"%xH.%s%s", ntohl(net.long_e), host, cport); 637 upHex(mybuf); 638 return(mybuf); 639 } 640 641 char * 642 ns_phost(sa) 643 struct sockaddr *sa; 644 { 645 register struct sockaddr_ns *sns = (struct sockaddr_ns *)sa; 646 struct sockaddr_ns work; 647 static union ns_net ns_zeronet; 648 char *p; 649 650 work = *sns; 651 work.sns_addr.x_port = 0; 652 work.sns_addr.x_net = ns_zeronet; 653 654 p = ns_print((struct sockaddr *)&work); 655 if (strncmp("0H.", p, 3) == 0) p += 3; 656 return(p); 657 } 658 659 void 660 upHex(p0) 661 char *p0; 662 { 663 register char *p = p0; 664 for (; *p; p++) switch (*p) { 665 666 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': 667 *p += ('A' - 'a'); 668 } 669 } 670