route.c revision 1.34
1 /* $NetBSD: route.c,v 1.34 1999/01/15 19:06:25 kml 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. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 #ifndef lint 38 #if 0 39 static char sccsid[] = "from: @(#)route.c 8.3 (Berkeley) 3/9/94"; 40 #else 41 __RCSID("$NetBSD: route.c,v 1.34 1999/01/15 19:06:25 kml Exp $"); 42 #endif 43 #endif /* not lint */ 44 45 #include <sys/param.h> 46 #include <sys/protosw.h> 47 #include <sys/socket.h> 48 #include <sys/mbuf.h> 49 #include <sys/un.h> 50 51 #include <net/if.h> 52 #include <net/if_dl.h> 53 #include <net/if_types.h> 54 #define _KERNEL 55 #include <net/route.h> 56 #undef _KERNEL 57 #include <netinet/in.h> 58 #include <netatalk/at.h> 59 #include <netiso/iso.h> 60 61 #include <netns/ns.h> 62 63 #include <sys/sysctl.h> 64 65 #include <err.h> 66 #include <netdb.h> 67 #include <stdio.h> 68 #include <stdlib.h> 69 #include <string.h> 70 #include <unistd.h> 71 72 #include "netstat.h" 73 74 #define kget(p, d) (kread((u_long)(p), (char *)&(d), sizeof (d))) 75 76 /* 77 * Definitions for showing gateway flags. 78 */ 79 struct bits { 80 short b_mask; 81 char b_val; 82 } bits[] = { 83 { RTF_UP, 'U' }, 84 { RTF_GATEWAY, 'G' }, 85 { RTF_HOST, 'H' }, 86 { RTF_REJECT, 'R' }, 87 { RTF_DYNAMIC, 'D' }, 88 { RTF_MODIFIED, 'M' }, 89 { RTF_DONE, 'd' }, /* Completed -- for routing messages only */ 90 { RTF_MASK, 'm' }, /* Mask Present -- for routing messages only */ 91 { RTF_CLONING, 'C' }, 92 { RTF_XRESOLVE, 'X' }, 93 { RTF_LLINFO, 'L' }, 94 { RTF_STATIC, 'S' }, 95 { RTF_PROTO1, '1' }, 96 { RTF_PROTO2, '2' }, 97 { 0 } 98 }; 99 100 /* 101 * XXX we put all of the sockaddr types in here to force the alignment 102 * to be correct. 103 */ 104 static union { 105 struct sockaddr u_sa; 106 struct sockaddr_in u_in; 107 struct sockaddr_un u_un; 108 struct sockaddr_iso u_iso; 109 struct sockaddr_at u_at; 110 struct sockaddr_dl u_dl; 111 struct sockaddr_ns u_ns; 112 u_short u_data[128]; 113 } pt_u; 114 115 int do_rtent = 0; 116 struct rtentry rtentry; 117 struct radix_node rnode; 118 struct radix_mask rmask; 119 120 int NewTree = 0; 121 122 static struct sockaddr *kgetsa __P((struct sockaddr *)); 123 static void p_tree __P((struct radix_node *)); 124 static void p_rtnode __P((void)); 125 static void ntreestuff __P((void)); 126 static void np_rtentry __P((struct rt_msghdr *)); 127 static void p_sockaddr __P((const struct sockaddr *, 128 const struct sockaddr *, int, int)); 129 static void p_flags __P((int, char *)); 130 static void p_rtentry __P((struct rtentry *)); 131 static void ntreestuff __P((void)); 132 static u_long forgemask __P((u_long)); 133 static void domask __P((char *, size_t, u_long, u_long)); 134 135 /* 136 * Print routing tables. 137 */ 138 void 139 routepr(rtree) 140 u_long rtree; 141 { 142 struct radix_node_head *rnh, head; 143 int i; 144 145 printf("Routing tables\n"); 146 147 if (Aflag == 0 && NewTree) 148 ntreestuff(); 149 else { 150 if (rtree == 0) { 151 printf("rt_tables: symbol not in namelist\n"); 152 return; 153 } 154 155 kget(rtree, rt_tables); 156 for (i = 0; i <= AF_MAX; i++) { 157 if ((rnh = rt_tables[i]) == 0) 158 continue; 159 kget(rnh, head); 160 if (i == AF_UNSPEC) { 161 if (Aflag && af == 0) { 162 printf("Netmasks:\n"); 163 p_tree(head.rnh_treetop); 164 } 165 } else if (af == AF_UNSPEC || af == i) { 166 pr_family(i); 167 do_rtent = 1; 168 pr_rthdr(); 169 p_tree(head.rnh_treetop); 170 } 171 } 172 } 173 } 174 175 /* 176 * Print address family header before a section of the routing table. 177 */ 178 void 179 pr_family(af) 180 int af; 181 { 182 char *afname; 183 184 switch (af) { 185 case AF_INET: 186 afname = "Internet"; 187 break; 188 case AF_NS: 189 afname = "XNS"; 190 break; 191 case AF_ISO: 192 afname = "ISO"; 193 break; 194 case AF_APPLETALK: 195 afname = "AppleTalk"; 196 break; 197 case AF_CCITT: 198 afname = "X.25"; 199 break; 200 default: 201 afname = NULL; 202 break; 203 } 204 if (afname) 205 printf("\n%s:\n", afname); 206 else 207 printf("\nProtocol Family %d:\n", af); 208 } 209 210 /* column widths; each followed by one space */ 211 #define WID_DST 18 /* width of destination column */ 212 #define WID_GW 18 /* width of gateway column */ 213 214 /* 215 * Print header for routing table columns. 216 */ 217 void 218 pr_rthdr() 219 { 220 221 if (Aflag) 222 printf("%-8.8s ","Address"); 223 printf("%-*.*s %-*.*s %-6.6s %6.6s%8.8s %6.6s %s\n", 224 WID_DST, WID_DST, "Destination", 225 WID_GW, WID_GW, "Gateway", 226 "Flags", "Refs", "Use", "Mtu", "Interface"); 227 } 228 229 static struct sockaddr * 230 kgetsa(dst) 231 struct sockaddr *dst; 232 { 233 234 kget(dst, pt_u.u_sa); 235 if (pt_u.u_sa.sa_len > sizeof (pt_u.u_sa)) 236 kread((u_long)dst, (char *)pt_u.u_data, pt_u.u_sa.sa_len); 237 return (&pt_u.u_sa); 238 } 239 240 static void 241 p_tree(rn) 242 struct radix_node *rn; 243 { 244 245 again: 246 kget(rn, rnode); 247 if (rnode.rn_b < 0) { 248 if (Aflag) 249 printf("%-8.8lx ", (u_long) rn); 250 if (rnode.rn_flags & RNF_ROOT) { 251 if (Aflag) 252 printf("(root node)%s", 253 rnode.rn_dupedkey ? " =>\n" : "\n"); 254 } else if (do_rtent) { 255 kget(rn, rtentry); 256 p_rtentry(&rtentry); 257 if (Aflag) 258 p_rtnode(); 259 } else { 260 p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_key), 261 NULL, 0, 44); 262 putchar('\n'); 263 } 264 if ((rn = rnode.rn_dupedkey) != NULL) 265 goto again; 266 } else { 267 if (Aflag && do_rtent) { 268 printf("%-8.8lx ", (u_long) rn); 269 p_rtnode(); 270 } 271 rn = rnode.rn_r; 272 p_tree(rnode.rn_l); 273 p_tree(rn); 274 } 275 } 276 277 static void 278 p_rtnode() 279 { 280 struct radix_mask *rm = rnode.rn_mklist; 281 char nbuf[20]; 282 283 if (rnode.rn_b < 0) { 284 if (rnode.rn_mask) { 285 printf("\t mask "); 286 p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_mask), 287 NULL, 0, -1); 288 } else if (rm == 0) 289 return; 290 } else { 291 (void)snprintf(nbuf, sizeof nbuf, "(%d)", rnode.rn_b); 292 printf("%6.6s %8.8lx : %8.8lx", nbuf, (u_long) rnode.rn_l, 293 (u_long) rnode.rn_r); 294 } 295 while (rm) { 296 kget(rm, rmask); 297 (void)snprintf(nbuf, sizeof nbuf, " %d refs, ", rmask.rm_refs); 298 printf(" mk = %8.8lx {(%d),%s", (u_long) rm, 299 -1 - rmask.rm_b, rmask.rm_refs ? nbuf : " "); 300 if (rmask.rm_flags & RNF_NORMAL) { 301 struct radix_node rnode_aux; 302 printf(" <normal>, "); 303 kget(rmask.rm_leaf, rnode_aux); 304 p_sockaddr(kgetsa((struct sockaddr *)rnode_aux.rn_mask), 305 NULL, 0, -1); 306 } else 307 p_sockaddr(kgetsa((struct sockaddr *)rmask.rm_mask), 308 NULL, 0, -1); 309 putchar('}'); 310 if ((rm = rmask.rm_mklist) != NULL) 311 printf(" ->"); 312 } 313 putchar('\n'); 314 } 315 316 static void 317 ntreestuff() 318 { 319 size_t needed; 320 int mib[6]; 321 char *buf, *next, *lim; 322 struct rt_msghdr *rtm; 323 324 mib[0] = CTL_NET; 325 mib[1] = PF_ROUTE; 326 mib[2] = 0; 327 mib[3] = 0; 328 mib[4] = NET_RT_DUMP; 329 mib[5] = 0; 330 if (sysctl(mib, 6, NULL, &needed, NULL, 0) < 0) 331 err(1, "route sysctl estimate"); 332 if ((buf = malloc(needed)) == 0) 333 errx(1, "out of space"); 334 if (sysctl(mib, 6, buf, &needed, NULL, 0) < 0) 335 err(1, "sysctl of routing table"); 336 lim = buf + needed; 337 for (next = buf; next < lim; next += rtm->rtm_msglen) { 338 rtm = (struct rt_msghdr *)next; 339 np_rtentry(rtm); 340 } 341 } 342 343 static void 344 np_rtentry(rtm) 345 struct rt_msghdr *rtm; 346 { 347 struct sockaddr *sa = (struct sockaddr *)(rtm + 1); 348 #ifdef notdef 349 static int masks_done, banner_printed; 350 #endif 351 static int old_af; 352 int af = 0, interesting = RTF_UP | RTF_GATEWAY | RTF_HOST; 353 354 #ifdef notdef 355 /* for the moment, netmasks are skipped over */ 356 if (!banner_printed) { 357 printf("Netmasks:\n"); 358 banner_printed = 1; 359 } 360 if (masks_done == 0) { 361 if (rtm->rtm_addrs != RTA_DST ) { 362 masks_done = 1; 363 af = sa->sa_family; 364 } 365 } else 366 #endif 367 af = sa->sa_family; 368 if (af != old_af) { 369 pr_family(af); 370 old_af = af; 371 } 372 if (rtm->rtm_addrs == RTA_DST) 373 p_sockaddr(sa, NULL, 0, 36); 374 else { 375 p_sockaddr(sa, NULL, rtm->rtm_flags, 16); 376 if (sa->sa_len == 0) 377 sa->sa_len = sizeof(long); 378 sa = (struct sockaddr *)(sa->sa_len + (char *)sa); 379 p_sockaddr(sa, NULL, 0, 18); 380 } 381 p_flags(rtm->rtm_flags & interesting, "%-6.6s "); 382 putchar('\n'); 383 } 384 385 static void 386 p_sockaddr(sa, mask, flags, width) 387 const struct sockaddr *sa, *mask; 388 int flags, width; 389 { 390 char workbuf[128], *cplim; 391 char *cp = workbuf; 392 393 switch(sa->sa_family) { 394 case AF_INET: 395 { 396 struct sockaddr_in *sin = (struct sockaddr_in *)sa; 397 398 if (sin->sin_addr.s_addr == INADDR_ANY) 399 cp = "default"; 400 else if (flags & RTF_HOST) 401 cp = routename(sin->sin_addr.s_addr); 402 else if (mask) 403 cp = netname(sin->sin_addr.s_addr, 404 ((struct sockaddr_in *)mask)->sin_addr.s_addr); 405 else 406 cp = netname(sin->sin_addr.s_addr, INADDR_ANY); 407 break; 408 } 409 410 #ifndef SMALL 411 case AF_APPLETALK: 412 case 0: 413 { 414 if (!(flags & RTF_HOST) && mask) 415 cp = atalk_print2(sa,mask,11); 416 else 417 cp = atalk_print(sa,11); 418 break; 419 } 420 case AF_NS: 421 cp = ns_print((struct sockaddr *)sa); 422 break; 423 #endif 424 425 case AF_LINK: 426 { 427 struct sockaddr_dl *sdl = (struct sockaddr_dl *)sa; 428 429 if (sdl->sdl_nlen == 0 && sdl->sdl_alen == 0 && 430 sdl->sdl_slen == 0) 431 (void)snprintf(workbuf, sizeof workbuf, "link#%d", 432 sdl->sdl_index); 433 else switch (sdl->sdl_type) { 434 case IFT_FDDI: 435 case IFT_ETHER: 436 { 437 int i; 438 u_char *lla = (u_char *)sdl->sdl_data + 439 sdl->sdl_nlen; 440 441 cplim = ""; 442 for (i = 0; i < sdl->sdl_alen; i++, lla++) { 443 /* XXX */ 444 cp += sprintf(cp, "%s%02x", cplim, *lla); 445 cplim = ":"; 446 } 447 cp = workbuf; 448 break; 449 } 450 default: 451 cp = link_ntoa(sdl); 452 break; 453 } 454 break; 455 } 456 457 default: 458 { 459 u_char *s = (u_char *)sa->sa_data, *slim; 460 461 slim = sa->sa_len + (u_char *) sa; 462 cplim = cp + sizeof(workbuf) - 6; 463 cp += sprintf(cp, "(%d)", sa->sa_family); 464 while (s < slim && cp < cplim) { 465 cp += sprintf(cp, " %02x", *s++); 466 if (s < slim) 467 cp += sprintf(cp, "%02x", *s++); 468 } 469 cp = workbuf; 470 } 471 } 472 if (width < 0 ) 473 printf("%s ", cp); 474 else { 475 if (nflag) 476 printf("%-*s ", width, cp); 477 else 478 printf("%-*.*s ", width, width, cp); 479 } 480 } 481 482 static void 483 p_flags(f, format) 484 int f; 485 char *format; 486 { 487 char name[33], *flags; 488 struct bits *p = bits; 489 490 for (flags = name; p->b_mask && flags - name < sizeof(name); p++) 491 if (p->b_mask & f) 492 *flags++ = p->b_val; 493 *flags = '\0'; 494 printf(format, name); 495 } 496 497 static void 498 p_rtentry(rt) 499 struct rtentry *rt; 500 { 501 static struct ifnet ifnet, *lastif; 502 struct sockaddr *sa, addr, mask; 503 504 if (!(sa = kgetsa(rt_key(rt)))) 505 memset(&addr, 0, sizeof addr); 506 else 507 addr = *sa; 508 if (!rt_mask(rt) || !(sa = kgetsa(rt_mask(rt)))) 509 memset(&mask, 0, sizeof mask); 510 else 511 mask = *sa; 512 p_sockaddr(&addr, &mask, rt->rt_flags, WID_DST); 513 p_sockaddr(kgetsa(rt->rt_gateway), NULL, RTF_HOST, WID_GW); 514 p_flags(rt->rt_flags, "%-6.6s "); 515 printf("%6d %8lu ", rt->rt_refcnt, rt->rt_use); 516 if (rt->rt_rmx.rmx_mtu) 517 printf("%6lu", rt->rt_rmx.rmx_mtu); 518 else 519 printf("%6s", "-"); 520 putchar((rt->rt_rmx.rmx_locks & RTV_MTU) ? 'L' : ' '); 521 if (rt->rt_ifp) { 522 if (rt->rt_ifp != lastif) { 523 kget(rt->rt_ifp, ifnet); 524 lastif = rt->rt_ifp; 525 } 526 printf(" %.16s%s", ifnet.if_xname, 527 rt->rt_nodes[0].rn_dupedkey ? " =>" : ""); 528 } 529 putchar('\n'); 530 if (vflag) { 531 printf("\texpire %10lu%c recvpipe %10ld%c " 532 "sendpipe %10ld%c\n", 533 rt->rt_rmx.rmx_expire, 534 (rt->rt_rmx.rmx_locks & RTV_EXPIRE) ? 'L' : ' ', 535 rt->rt_rmx.rmx_recvpipe, 536 (rt->rt_rmx.rmx_locks & RTV_RPIPE) ? 'L' : ' ', 537 rt->rt_rmx.rmx_sendpipe, 538 (rt->rt_rmx.rmx_locks & RTV_SPIPE) ? 'L' : ' '); 539 printf("\tssthresh %10lu%c rtt %10ld%c " 540 "rttvar %10ld%c\n", 541 rt->rt_rmx.rmx_ssthresh, 542 (rt->rt_rmx.rmx_locks & RTV_SSTHRESH) ? 'L' : ' ', 543 rt->rt_rmx.rmx_rtt, 544 (rt->rt_rmx.rmx_locks & RTV_RTT) ? 'L' : ' ', 545 rt->rt_rmx.rmx_rttvar, 546 (rt->rt_rmx.rmx_locks & RTV_RTTVAR) ? 'L' : ' '); 547 } 548 549 } 550 551 char * 552 routename(in) 553 u_int32_t in; 554 { 555 char *cp; 556 static char line[MAXHOSTNAMELEN + 1]; 557 struct hostent *hp; 558 static char domain[MAXHOSTNAMELEN + 1]; 559 static int first = 1; 560 561 if (first) { 562 first = 0; 563 if (gethostname(domain, MAXHOSTNAMELEN) == 0) { 564 domain[sizeof(domain) - 1] = '\0'; 565 if ((cp = strchr(domain, '.'))) 566 (void)strcpy(domain, cp + 1); 567 else 568 domain[0] = 0; 569 } else 570 domain[0] = 0; 571 } 572 cp = 0; 573 if (!nflag) { 574 hp = gethostbyaddr((char *)&in, sizeof (struct in_addr), 575 AF_INET); 576 if (hp) { 577 if ((cp = strchr(hp->h_name, '.')) && 578 !strcmp(cp + 1, domain)) 579 *cp = 0; 580 cp = hp->h_name; 581 } 582 } 583 if (cp) { 584 strncpy(line, cp, sizeof(line) - 1); 585 line[sizeof(line) - 1] = '\0'; 586 } else { 587 #define C(x) ((x) & 0xff) 588 in = ntohl(in); 589 snprintf(line, sizeof line, "%u.%u.%u.%u", 590 C(in >> 24), C(in >> 16), C(in >> 8), C(in)); 591 } 592 return (line); 593 } 594 595 static u_long 596 forgemask(a) 597 u_long a; 598 { 599 u_long m; 600 601 if (IN_CLASSA(a)) 602 m = IN_CLASSA_NET; 603 else if (IN_CLASSB(a)) 604 m = IN_CLASSB_NET; 605 else 606 m = IN_CLASSC_NET; 607 return (m); 608 } 609 610 static void 611 domask(dst, dlen, addr, mask) 612 char *dst; 613 size_t dlen; 614 u_long addr, mask; 615 { 616 int b, i; 617 618 if (!mask || (forgemask(addr) == mask)) { 619 *dst = '\0'; 620 return; 621 } 622 i = 0; 623 for (b = 0; b < 32; b++) 624 if (mask & (1 << b)) { 625 int bb; 626 627 i = b; 628 for (bb = b+1; bb < 32; bb++) 629 if (!(mask & (1 << bb))) { 630 i = -1; /* noncontig */ 631 break; 632 } 633 break; 634 } 635 if (i == -1) 636 (void)snprintf(dst, dlen, "&0x%lx", mask); 637 else 638 (void)snprintf(dst, dlen, "/%d", 32-i); 639 } 640 641 /* 642 * Return the name of the network whose address is given. 643 * The address is assumed to be that of a net or subnet, not a host. 644 */ 645 char * 646 netname(in, mask) 647 u_int32_t in, mask; 648 { 649 char *cp = 0; 650 static char line[MAXHOSTNAMELEN + 4]; 651 struct netent *np = 0; 652 u_int32_t net, omask; 653 u_int32_t i; 654 int subnetshift; 655 656 i = ntohl(in); 657 omask = mask = ntohl(mask); 658 if (!nflag && i != INADDR_ANY) { 659 if (mask == INADDR_ANY) { 660 switch (mask = forgemask(i)) { 661 case IN_CLASSA_NET: 662 subnetshift = 8; 663 break; 664 case IN_CLASSB_NET: 665 subnetshift = 8; 666 break; 667 case IN_CLASSC_NET: 668 subnetshift = 4; 669 break; 670 default: 671 abort(); 672 } 673 /* 674 * If there are more bits than the standard mask 675 * would suggest, subnets must be in use. 676 * Guess at the subnet mask, assuming reasonable 677 * width subnet fields. 678 */ 679 while (i &~ mask) 680 mask = (long)mask >> subnetshift; 681 } 682 net = i & mask; 683 /* 684 * Note: shift the hosts bits out in octet units, since 685 * not all versions of getnetbyaddr() do this for us (e.g. 686 * the current `etc/networks' parser). 687 */ 688 while ((mask & 0xff) == 0) 689 mask >>= 8, net >>= 8; 690 np = getnetbyaddr(net, AF_INET); 691 if (np) 692 cp = np->n_name; 693 } 694 if (cp) 695 strncpy(line, cp, sizeof(line) - 1); 696 else if ((i & 0xffffff) == 0) 697 (void)snprintf(line, sizeof line, "%u", C(i >> 24)); 698 else if ((i & 0xffff) == 0) 699 (void)snprintf(line, sizeof line, "%u.%u", C(i >> 24) 700 , C(i >> 16)); 701 else if ((i & 0xff) == 0) 702 (void)snprintf(line, sizeof line, "%u.%u.%u", C(i >> 24), 703 C(i >> 16), C(i >> 8)); 704 else 705 (void)snprintf(line, sizeof line, "%u.%u.%u.%u", C(i >> 24), 706 C(i >> 16), C(i >> 8), C(i)); 707 domask(line + strlen(line), sizeof(line) - strlen(line), i, omask); 708 return (line); 709 } 710 711 /* 712 * Print routing statistics 713 */ 714 void 715 rt_stats(off) 716 u_long off; 717 { 718 struct rtstat rtstat; 719 720 if (off == 0) { 721 printf("rtstat: symbol not in namelist\n"); 722 return; 723 } 724 kread(off, (char *)&rtstat, sizeof (rtstat)); 725 printf("routing:\n"); 726 printf("\t%u bad routing redirect%s\n", 727 rtstat.rts_badredirect, plural(rtstat.rts_badredirect)); 728 printf("\t%u dynamically created route%s\n", 729 rtstat.rts_dynamic, plural(rtstat.rts_dynamic)); 730 printf("\t%u new gateway%s due to redirects\n", 731 rtstat.rts_newgateway, plural(rtstat.rts_newgateway)); 732 printf("\t%u destination%s found unreachable\n", 733 rtstat.rts_unreach, plural(rtstat.rts_unreach)); 734 printf("\t%u use%s of a wildcard route\n", 735 rtstat.rts_wildcard, plural(rtstat.rts_wildcard)); 736 } 737 short ns_nullh[] = {0,0,0}; 738 short ns_bh[] = {-1,-1,-1}; 739 740 char * 741 ns_print(sa) 742 struct sockaddr *sa; 743 { 744 struct sockaddr_ns *sns = (struct sockaddr_ns*)sa; 745 struct ns_addr work; 746 union { 747 union ns_net net_e; 748 u_long long_e; 749 } net; 750 u_short port; 751 static char mybuf[50], cport[10], chost[25]; 752 char *host = ""; 753 char *p; 754 u_char *q; 755 756 work = sns->sns_addr; 757 port = ntohs(work.x_port); 758 work.x_port = 0; 759 net.net_e = work.x_net; 760 if (ns_nullhost(work) && net.long_e == 0) { 761 if (port ) { 762 (void)snprintf(mybuf, sizeof mybuf, "*.%xH", port); 763 upHex(mybuf); 764 } else 765 (void)snprintf(mybuf, sizeof mybuf, "*.*"); 766 return (mybuf); 767 } 768 769 if (memcmp(ns_bh, work.x_host.c_host, 6) == 0) { 770 host = "any"; 771 } else if (memcmp(ns_nullh, work.x_host.c_host, 6) == 0) { 772 host = "*"; 773 } else { 774 q = work.x_host.c_host; 775 (void)snprintf(chost, sizeof chost, "%02x%02x%02x%02x%02x%02xH", 776 q[0], q[1], q[2], q[3], q[4], q[5]); 777 for (p = chost; *p == '0' && p < chost + 12; p++) 778 continue; 779 host = p; 780 } 781 if (port) 782 (void)snprintf(cport, sizeof cport, ".%xH", htons(port)); 783 else 784 *cport = 0; 785 786 (void)snprintf(mybuf, sizeof mybuf, "%xH.%s%s", (int)ntohl(net.long_e), 787 host, cport); 788 upHex(mybuf); 789 return (mybuf); 790 } 791 792 char * 793 ns_phost(sa) 794 struct sockaddr *sa; 795 { 796 struct sockaddr_ns *sns = (struct sockaddr_ns *)sa; 797 struct sockaddr_ns work; 798 static union ns_net ns_zeronet; 799 char *p; 800 801 work = *sns; 802 work.sns_addr.x_port = 0; 803 work.sns_addr.x_net = ns_zeronet; 804 805 p = ns_print((struct sockaddr *)&work); 806 if (strncmp("0H.", p, 3) == 0) 807 p += 3; 808 return (p); 809 } 810 811 void 812 upHex(p0) 813 char *p0; 814 { 815 char *p = p0; 816 817 for (; *p; p++) 818 switch (*p) { 819 case 'a': 820 case 'b': 821 case 'c': 822 case 'd': 823 case 'e': 824 case 'f': 825 *p += ('A' - 'a'); 826 } 827 } 828
Indexes created Tue Sep 23 22:09:46 GMT 2025