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