Annotation of src/usr.bin/netstat/route.c, Revision 1.3
1.3 ! deraadt 1: /* $OpenBSD: route.c,v 1.15 1996/05/07 02:55:06 thorpej Exp $ */
1.2 deraadt 2: /* $NetBSD: route.c,v 1.15 1996/05/07 02:55:06 thorpej Exp $ */
1.1 deraadt 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. All advertising materials mentioning features or use of this software
17: * must display the following acknowledgement:
18: * This product includes software developed by the University of
19: * California, Berkeley and its contributors.
20: * 4. Neither the name of the University nor the names of its contributors
21: * may be used to endorse or promote products derived from this software
22: * without specific prior written permission.
23: *
24: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34: * SUCH DAMAGE.
35: */
36:
37: #ifndef lint
38: #if 0
39: static char sccsid[] = "from: @(#)route.c 8.3 (Berkeley) 3/9/94";
40: #else
1.3 ! deraadt 41: static char *rcsid = "$OpenBSD: route.c,v 1.15 1996/05/07 02:55:06 thorpej Exp $";
1.1 deraadt 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:
50: #include <net/if.h>
51: #include <net/if_dl.h>
52: #include <net/if_types.h>
53: #define _KERNEL
54: #include <net/route.h>
55: #undef _KERNEL
56: #include <netinet/in.h>
57:
58: #include <netns/ns.h>
59:
60: #include <sys/sysctl.h>
61:
62: #include <netdb.h>
63: #include <stdio.h>
64: #include <stdlib.h>
65: #include <string.h>
66: #include <unistd.h>
67: #include "netstat.h"
68:
69: #define kget(p, d) (kread((u_long)(p), (char *)&(d), sizeof (d)))
70:
71: /*
72: * Definitions for showing gateway flags.
73: */
74: struct bits {
75: short b_mask;
76: char b_val;
77: } bits[] = {
78: { RTF_UP, 'U' },
79: { RTF_GATEWAY, 'G' },
80: { RTF_HOST, 'H' },
81: { RTF_REJECT, 'R' },
82: { RTF_DYNAMIC, 'D' },
83: { RTF_MODIFIED, 'M' },
84: { RTF_DONE, 'd' }, /* Completed -- for routing messages only */
85: { RTF_MASK, 'm' }, /* Mask Present -- for routing messages only */
86: { RTF_CLONING, 'C' },
87: { RTF_XRESOLVE, 'X' },
88: { RTF_LLINFO, 'L' },
89: { RTF_STATIC, 'S' },
90: { RTF_PROTO1, '1' },
91: { RTF_PROTO2, '2' },
92: { 0 }
93: };
94:
95: static union {
96: struct sockaddr u_sa;
97: u_short u_data[128];
98: } pt_u;
99:
100: int do_rtent = 0;
101: struct rtentry rtentry;
102: struct radix_node rnode;
103: struct radix_mask rmask;
104:
105: int NewTree = 0;
106:
107: static struct sockaddr *kgetsa __P((struct sockaddr *));
108: static void p_tree __P((struct radix_node *));
109: static void p_rtnode __P(());
110: static void ntreestuff __P(());
111: static void np_rtentry __P((struct rt_msghdr *));
112: static void p_sockaddr __P((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: 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: 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: p_sockaddr(kgetsa((struct sockaddr *)rmask.rm_mask), 0, -1);
279: putchar('}');
280: if (rm = rmask.rm_mklist)
281: printf(" ->");
282: }
283: putchar('\n');
284: }
285:
286: static void
287: ntreestuff()
288: {
289: size_t needed;
290: int mib[6];
291: char *buf, *next, *lim;
292: register struct rt_msghdr *rtm;
293:
294: mib[0] = CTL_NET;
295: mib[1] = PF_ROUTE;
296: mib[2] = 0;
297: mib[3] = 0;
298: mib[4] = NET_RT_DUMP;
299: mib[5] = 0;
300: if (sysctl(mib, 6, NULL, &needed, NULL, 0) < 0)
301: { perror("route-sysctl-estimate"); exit(1);}
302: if ((buf = malloc(needed)) == 0)
303: { printf("out of space\n"); exit(1);}
304: if (sysctl(mib, 6, buf, &needed, NULL, 0) < 0)
305: { perror("sysctl of routing table"); exit(1);}
306: lim = buf + needed;
307: for (next = buf; next < lim; next += rtm->rtm_msglen) {
308: rtm = (struct rt_msghdr *)next;
309: np_rtentry(rtm);
310: }
311: }
312:
313: static void
314: np_rtentry(rtm)
315: register struct rt_msghdr *rtm;
316: {
317: register struct sockaddr *sa = (struct sockaddr *)(rtm + 1);
318: #ifdef notdef
319: static int masks_done, banner_printed;
320: #endif
321: static int old_af;
322: int af = 0, interesting = RTF_UP | RTF_GATEWAY | RTF_HOST;
323:
324: #ifdef notdef
325: /* for the moment, netmasks are skipped over */
326: if (!banner_printed) {
327: printf("Netmasks:\n");
328: banner_printed = 1;
329: }
330: if (masks_done == 0) {
331: if (rtm->rtm_addrs != RTA_DST ) {
332: masks_done = 1;
333: af = sa->sa_family;
334: }
335: } else
336: #endif
337: af = sa->sa_family;
338: if (af != old_af) {
339: pr_family(af);
340: old_af = af;
341: }
342: if (rtm->rtm_addrs == RTA_DST)
343: p_sockaddr(sa, 0, 36);
344: else {
345: p_sockaddr(sa, rtm->rtm_flags, 16);
346: if (sa->sa_len == 0)
347: sa->sa_len = sizeof(long);
348: sa = (struct sockaddr *)(sa->sa_len + (char *)sa);
349: p_sockaddr(sa, 0, 18);
350: }
351: p_flags(rtm->rtm_flags & interesting, "%-6.6s ");
352: putchar('\n');
353: }
354:
355: static void
356: p_sockaddr(sa, flags, width)
357: struct sockaddr *sa;
358: int flags, width;
359: {
360: char workbuf[128], *cplim;
361: register char *cp = workbuf;
362:
363: switch(sa->sa_family) {
364: case AF_INET:
365: {
366: register struct sockaddr_in *sin = (struct sockaddr_in *)sa;
367:
368: cp = (sin->sin_addr.s_addr == 0) ? "default" :
369: ((flags & RTF_HOST) ?
370: routename(sin->sin_addr.s_addr) :
371: netname(sin->sin_addr.s_addr, INADDR_ANY));
372: break;
373: }
374:
375: case AF_NS:
376: cp = ns_print(sa);
377: break;
378:
379: case AF_LINK:
380: {
381: register struct sockaddr_dl *sdl = (struct sockaddr_dl *)sa;
382:
383: if (sdl->sdl_nlen == 0 && sdl->sdl_alen == 0 &&
384: sdl->sdl_slen == 0)
385: (void) sprintf(workbuf, "link#%d", sdl->sdl_index);
386: else switch (sdl->sdl_type) {
387: case IFT_ETHER:
388: {
389: register int i;
390: register u_char *lla = (u_char *)sdl->sdl_data +
391: sdl->sdl_nlen;
392:
393: cplim = "";
394: for (i = 0; i < sdl->sdl_alen; i++, lla++) {
395: cp += sprintf(cp, "%s%x", cplim, *lla);
396: cplim = ":";
397: }
398: cp = workbuf;
399: break;
400: }
401: default:
402: cp = link_ntoa(sdl);
403: break;
404: }
405: break;
406: }
407:
408: default:
409: {
410: register u_char *s = (u_char *)sa->sa_data, *slim;
411:
412: slim = sa->sa_len + (u_char *) sa;
413: cplim = cp + sizeof(workbuf) - 6;
414: cp += sprintf(cp, "(%d)", sa->sa_family);
415: while (s < slim && cp < cplim) {
416: cp += sprintf(cp, " %02x", *s++);
417: if (s < slim)
418: cp += sprintf(cp, "%02x", *s++);
419: }
420: cp = workbuf;
421: }
422: }
423: if (width < 0 )
424: printf("%s ", cp);
425: else {
426: if (nflag)
427: printf("%-*s ", width, cp);
428: else
429: printf("%-*.*s ", width, width, cp);
430: }
431: }
432:
433: static void
434: p_flags(f, format)
435: register int f;
436: char *format;
437: {
438: char name[33], *flags;
439: register struct bits *p = bits;
440:
441: for (flags = name; p->b_mask; p++)
442: if (p->b_mask & f)
443: *flags++ = p->b_val;
444: *flags = '\0';
445: printf(format, name);
446: }
447:
448: static void
449: p_rtentry(rt)
450: register struct rtentry *rt;
451: {
452: static struct ifnet ifnet, *lastif;
453:
454: p_sockaddr(kgetsa(rt_key(rt)), rt->rt_flags, WID_DST);
455: p_sockaddr(kgetsa(rt->rt_gateway), RTF_HOST, WID_GW);
456: p_flags(rt->rt_flags, "%-6.6s ");
457: printf("%6d %8d ", rt->rt_refcnt, rt->rt_use);
458: if (rt->rt_rmx.rmx_mtu)
459: printf("%6d ", rt->rt_rmx.rmx_mtu);
460: else
461: printf("%6s ", "-");
462: if (rt->rt_ifp) {
463: if (rt->rt_ifp != lastif) {
464: kget(rt->rt_ifp, ifnet);
465: lastif = rt->rt_ifp;
466: }
1.2 deraadt 467: printf(" %.16s%s", ifnet.if_xname,
1.1 deraadt 468: rt->rt_nodes[0].rn_dupedkey ? " =>" : "");
469: }
470: putchar('\n');
471: }
472:
473: char *
474: routename(in)
475: u_int32_t in;
476: {
477: register char *cp;
478: static char line[MAXHOSTNAMELEN + 1];
479: struct hostent *hp;
480: static char domain[MAXHOSTNAMELEN + 1];
481: static int first = 1;
482:
483: if (first) {
484: first = 0;
485: if (gethostname(domain, MAXHOSTNAMELEN) == 0 &&
486: (cp = index(domain, '.')))
487: (void) strcpy(domain, cp + 1);
488: else
489: domain[0] = 0;
490: }
491: cp = 0;
492: if (!nflag) {
493: hp = gethostbyaddr((char *)&in, sizeof (struct in_addr),
494: AF_INET);
495: if (hp) {
496: if ((cp = index(hp->h_name, '.')) &&
497: !strcmp(cp + 1, domain))
498: *cp = 0;
499: cp = hp->h_name;
500: }
501: }
502: if (cp)
503: strncpy(line, cp, sizeof(line) - 1);
504: else {
505: #define C(x) ((x) & 0xff)
506: in = ntohl(in);
507: sprintf(line, "%u.%u.%u.%u",
508: C(in >> 24), C(in >> 16), C(in >> 8), C(in));
509: }
510: return (line);
511: }
512:
513: /*
514: * Return the name of the network whose address is given.
515: * The address is assumed to be that of a net or subnet, not a host.
516: */
517: char *
518: netname(in, mask)
519: u_int32_t in, mask;
520: {
521: char *cp = 0;
522: static char line[MAXHOSTNAMELEN + 1];
523: struct netent *np = 0;
524: u_int32_t net;
525: int subnetshift;
526:
527: in = ntohl(in);
528: mask = ntohl(mask);
529: if (!nflag && in != INADDR_ANY) {
530: if (mask == INADDR_ANY) {
531: if (IN_CLASSA(in)) {
532: mask = IN_CLASSA_NET;
533: subnetshift = 8;
534: } else if (IN_CLASSB(in)) {
535: mask = IN_CLASSB_NET;
536: subnetshift = 8;
537: } else {
538: mask = IN_CLASSC_NET;
539: subnetshift = 4;
540: }
541: /*
542: * If there are more bits than the standard mask
543: * would suggest, subnets must be in use.
544: * Guess at the subnet mask, assuming reasonable
545: * width subnet fields.
546: */
547: while (in &~ mask)
548: mask = (long)mask >> subnetshift;
549: }
550: net = in & mask;
551: while ((mask & 1) == 0)
552: mask >>= 1, net >>= 1;
553: np = getnetbyaddr(net, AF_INET);
554: if (np)
555: cp = np->n_name;
556: }
557: if (cp)
558: strncpy(line, cp, sizeof(line) - 1);
559: else if ((in & 0xffffff) == 0)
560: sprintf(line, "%u", C(in >> 24));
561: else if ((in & 0xffff) == 0)
562: sprintf(line, "%u.%u", C(in >> 24) , C(in >> 16));
563: else if ((in & 0xff) == 0)
564: sprintf(line, "%u.%u.%u", C(in >> 24), C(in >> 16), C(in >> 8));
565: else
566: sprintf(line, "%u.%u.%u.%u", C(in >> 24),
567: C(in >> 16), C(in >> 8), C(in));
568: return (line);
569: }
570:
571: /*
572: * Print routing statistics
573: */
574: void
575: rt_stats(off)
576: u_long off;
577: {
578: struct rtstat rtstat;
579:
580: if (off == 0) {
581: printf("rtstat: symbol not in namelist\n");
582: return;
583: }
584: kread(off, (char *)&rtstat, sizeof (rtstat));
585: printf("routing:\n");
586: printf("\t%u bad routing redirect%s\n",
587: rtstat.rts_badredirect, plural(rtstat.rts_badredirect));
588: printf("\t%u dynamically created route%s\n",
589: rtstat.rts_dynamic, plural(rtstat.rts_dynamic));
590: printf("\t%u new gateway%s due to redirects\n",
591: rtstat.rts_newgateway, plural(rtstat.rts_newgateway));
592: printf("\t%u destination%s found unreachable\n",
593: rtstat.rts_unreach, plural(rtstat.rts_unreach));
594: printf("\t%u use%s of a wildcard route\n",
595: rtstat.rts_wildcard, plural(rtstat.rts_wildcard));
596: }
597: short ns_nullh[] = {0,0,0};
598: short ns_bh[] = {-1,-1,-1};
599:
600: char *
601: ns_print(sa)
602: register struct sockaddr *sa;
603: {
604: register struct sockaddr_ns *sns = (struct sockaddr_ns*)sa;
605: struct ns_addr work;
606: union { union ns_net net_e; u_long long_e; } net;
607: u_short port;
608: static char mybuf[50], cport[10], chost[25];
609: char *host = "";
610: register char *p; register u_char *q;
611:
612: work = sns->sns_addr;
613: port = ntohs(work.x_port);
614: work.x_port = 0;
615: net.net_e = work.x_net;
616: if (ns_nullhost(work) && net.long_e == 0) {
617: if (port ) {
618: sprintf(mybuf, "*.%xH", port);
619: upHex(mybuf);
620: } else
621: sprintf(mybuf, "*.*");
622: return (mybuf);
623: }
624:
625: if (bcmp(ns_bh, work.x_host.c_host, 6) == 0) {
626: host = "any";
627: } else if (bcmp(ns_nullh, work.x_host.c_host, 6) == 0) {
628: host = "*";
629: } else {
630: q = work.x_host.c_host;
631: sprintf(chost, "%02x%02x%02x%02x%02x%02xH",
632: q[0], q[1], q[2], q[3], q[4], q[5]);
633: for (p = chost; *p == '0' && p < chost + 12; p++)
634: continue;
635: host = p;
636: }
637: if (port)
638: sprintf(cport, ".%xH", htons(port));
639: else
640: *cport = 0;
641:
642: sprintf(mybuf,"%xH.%s%s", ntohl(net.long_e), host, cport);
643: upHex(mybuf);
644: return(mybuf);
645: }
646:
647: char *
648: ns_phost(sa)
649: struct sockaddr *sa;
650: {
651: register struct sockaddr_ns *sns = (struct sockaddr_ns *)sa;
652: struct sockaddr_ns work;
653: static union ns_net ns_zeronet;
654: char *p;
655:
656: work = *sns;
657: work.sns_addr.x_port = 0;
658: work.sns_addr.x_net = ns_zeronet;
659:
660: p = ns_print((struct sockaddr *)&work);
661: if (strncmp("0H.", p, 3) == 0) p += 3;
662: return(p);
663: }
664:
665: void
666: upHex(p0)
667: char *p0;
668: {
669: register char *p = p0;
670: for (; *p; p++) switch (*p) {
671:
672: case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
673: *p += ('A' - 'a');
674: }
675: }