Annotation of src/usr.bin/netstat/route.c, Revision 1.99
1.99 ! mpi 1: /* $OpenBSD: route.c,v 1.98 2015/02/12 01:49:02 claudio 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.
1.53 millert 16: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 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:
1.95 deraadt 33: #include <sys/types.h>
1.1 deraadt 34: #include <sys/protosw.h>
35: #include <sys/socket.h>
36:
37: #include <net/if.h>
38: #include <net/if_dl.h>
39: #include <net/if_types.h>
40: #define _KERNEL
41: #include <net/route.h>
1.96 deraadt 42: #include <netinet/ip_ipsp.h>
1.1 deraadt 43: #undef _KERNEL
44: #include <netinet/in.h>
1.13 millert 45: #include <arpa/inet.h>
1.1 deraadt 46:
47: #include <sys/sysctl.h>
48:
1.61 otto 49: #include <err.h>
1.15 millert 50: #include <limits.h>
1.1 deraadt 51: #include <netdb.h>
52: #include <stdio.h>
53: #include <stdlib.h>
54: #include <string.h>
55: #include <unistd.h>
1.9 angelos 56:
1.1 deraadt 57: #include "netstat.h"
58:
1.29 deraadt 59: /* alignment constraint for routing socket */
60: #define ROUNDUP(a) \
61: ((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
62: #define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
1.51 jason 63:
1.73 claudio 64: struct radix_node_head ***rt_head;
1.80 claudio 65: struct radix_node_head ***rnt;
1.73 claudio 66: struct radix_node_head *rt_tables[AF_MAX+1]; /* provides enough space */
67: u_int8_t af2rtafidx[AF_MAX+1];
1.29 deraadt 68:
1.1 deraadt 69: static union {
1.6 deraadt 70: struct sockaddr u_sa;
71: u_int32_t u_data[64];
1.29 deraadt 72: int u_dummy; /* force word-alignment */
1.1 deraadt 73: } pt_u;
74:
75: int do_rtent = 0;
76: struct rtentry rtentry;
77: struct radix_node rnode;
78: struct radix_mask rmask;
79:
1.45 millert 80: static struct sockaddr *kgetsa(struct sockaddr *);
81: static void p_tree(struct radix_node *);
1.54 deraadt 82: static void p_rtnode(void);
1.49 deraadt 83: static void p_rtflags(u_char);
1.72 claudio 84: static void p_krtentry(struct rtentry *);
1.1 deraadt 85:
86: /*
87: * Print routing tables.
88: */
89: void
1.85 claudio 90: routepr(u_long rtree, u_long mtree, u_long af2idx, u_long rtbl_id_max,
91: u_int tableid)
1.1 deraadt 92: {
93: struct radix_node_head *rnh, head;
1.73 claudio 94: int i, idxmax = 0;
95: u_int rtidxmax;
1.1 deraadt 96:
97: printf("Routing tables\n");
98:
1.88 miod 99: if (rtree == 0 || af2idx == 0) {
1.72 claudio 100: printf("rt_tables: symbol not in namelist\n");
101: return;
102: }
1.1 deraadt 103:
1.83 deraadt 104: kread((u_long)rtree, &rt_head, sizeof(rt_head));
105: kread((u_long)rtbl_id_max, &rtidxmax, sizeof(rtidxmax));
106: kread((long)af2idx, &af2rtafidx, sizeof(af2rtafidx));
1.73 claudio 107:
108: for (i = 0; i <= AF_MAX; i++) {
109: if (af2rtafidx[i] > idxmax)
110: idxmax = af2rtafidx[i];
111: }
112:
113: if ((rnt = calloc(rtidxmax + 1, sizeof(struct radix_node_head **))) ==
114: NULL)
115: err(1, NULL);
116:
117: kread((u_long)rt_head, rnt, (rtidxmax + 1) *
118: sizeof(struct radix_node_head **));
1.85 claudio 119: if (tableid > rtidxmax || rnt[tableid] == NULL) {
120: printf("Bad table %u\n", tableid);
121: return;
122: }
123: kread((u_long)rnt[tableid], rt_tables, (idxmax + 1) * sizeof(rnh));
1.73 claudio 124:
1.72 claudio 125: for (i = 0; i <= AF_MAX; i++) {
126: if (i == AF_UNSPEC) {
1.73 claudio 127: if (Aflag && (af == AF_UNSPEC || af == 0xff)) {
1.83 deraadt 128: kread(mtree, &rnh, sizeof(rnh));
129: kread((u_long)rnh, &head, sizeof(head));
1.72 claudio 130: printf("Netmasks:\n");
1.1 deraadt 131: p_tree(head.rnh_treetop);
132: }
1.73 claudio 133: continue;
134: }
1.88 miod 135: if (af2rtafidx[i] == 0)
1.73 claudio 136: /* no table for this AF */
137: continue;
1.83 deraadt 138: if ((rnh = rt_tables[af2rtafidx[i]]) == NULL)
1.73 claudio 139: continue;
1.83 deraadt 140: kread((u_long)rnh, &head, sizeof(head));
1.73 claudio 141: if (af == AF_UNSPEC || af == i) {
1.72 claudio 142: pr_family(i);
143: do_rtent = 1;
144: pr_rthdr(i, Aflag);
145: p_tree(head.rnh_treetop);
1.1 deraadt 146: }
147: }
148: }
149:
150: static struct sockaddr *
1.50 deraadt 151: kgetsa(struct sockaddr *dst)
1.1 deraadt 152: {
153:
1.83 deraadt 154: kread((u_long)dst, &pt_u.u_sa, sizeof(pt_u.u_sa));
1.1 deraadt 155: if (pt_u.u_sa.sa_len > sizeof (pt_u.u_sa))
1.67 jaredy 156: kread((u_long)dst, pt_u.u_data, pt_u.u_sa.sa_len);
1.1 deraadt 157: return (&pt_u.u_sa);
158: }
159:
160: static void
1.50 deraadt 161: p_tree(struct radix_node *rn)
1.1 deraadt 162: {
163:
164: again:
1.83 deraadt 165: kread((u_long)rn, &rnode, sizeof(rnode));
1.1 deraadt 166: if (rnode.rn_b < 0) {
167: if (Aflag)
1.98 claudio 168: printf("%-16p ", rn);
1.1 deraadt 169: if (rnode.rn_flags & RNF_ROOT) {
170: if (Aflag)
171: printf("(root node)%s",
172: rnode.rn_dupedkey ? " =>\n" : "\n");
173: } else if (do_rtent) {
1.83 deraadt 174: kread((u_long)rn, &rtentry, sizeof(rtentry));
1.72 claudio 175: p_krtentry(&rtentry);
1.1 deraadt 176: if (Aflag)
177: p_rtnode();
178: } else {
179: p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_key),
1.21 peter 180: 0, 0, 44);
1.1 deraadt 181: putchar('\n');
182: }
1.13 millert 183: if ((rn = rnode.rn_dupedkey))
1.1 deraadt 184: goto again;
185: } else {
186: if (Aflag && do_rtent) {
1.98 claudio 187: printf("%-16p ", rn);
1.1 deraadt 188: p_rtnode();
189: }
190: rn = rnode.rn_r;
191: p_tree(rnode.rn_l);
192: p_tree(rn);
193: }
194: }
195:
1.49 deraadt 196: static void
197: p_rtflags(u_char flags)
198: {
199: putchar('<');
200: if (flags & RNF_NORMAL)
201: putchar('N');
202: if (flags & RNF_ROOT)
203: putchar('R');
204: if (flags & RNF_ACTIVE)
205: putchar('A');
1.56 henric 206: if (flags & ~(RNF_NORMAL | RNF_ROOT | RNF_ACTIVE))
1.49 deraadt 207: printf("/0x%02x", flags);
208: putchar('>');
209: }
210:
1.23 deraadt 211: char nbuf[25];
1.1 deraadt 212:
213: static void
1.50 deraadt 214: p_rtnode(void)
1.1 deraadt 215: {
216: struct radix_mask *rm = rnode.rn_mklist;
217:
218: if (rnode.rn_b < 0) {
1.98 claudio 219: snprintf(nbuf, sizeof nbuf, " => %p", rnode.rn_dupedkey);
220: printf("\t (%p)%s", rnode.rn_p, rnode.rn_dupedkey ? nbuf : "");
1.1 deraadt 221: if (rnode.rn_mask) {
1.81 claudio 222: printf(" mask ");
1.1 deraadt 223: p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_mask),
1.21 peter 224: 0, 0, -1);
1.83 deraadt 225: } else if (rm == NULL) {
1.81 claudio 226: putchar('\n');
1.1 deraadt 227: return;
1.81 claudio 228: }
1.1 deraadt 229: } else {
1.23 deraadt 230: snprintf(nbuf, sizeof nbuf, "(%d)", rnode.rn_b);
1.90 deraadt 231: printf("%6.6s (%p) %16p : %16p", nbuf,
1.98 claudio 232: rnode.rn_p, rnode.rn_l, rnode.rn_r);
1.1 deraadt 233: }
1.49 deraadt 234:
235: putchar(' ');
236: p_rtflags(rnode.rn_flags);
237:
1.1 deraadt 238: while (rm) {
1.83 deraadt 239: kread((u_long)rm, &rmask, sizeof(rmask));
1.23 deraadt 240: snprintf(nbuf, sizeof nbuf, " %d refs, ", rmask.rm_refs);
1.98 claudio 241: printf("\n\tmk = %p {(%d),%s", rm, -1 - rmask.rm_b,
242: rmask.rm_refs ? nbuf : " ");
1.49 deraadt 243: p_rtflags(rmask.rm_flags);
244: printf(", ");
245: if (rmask.rm_flags & RNF_NORMAL) {
246: struct radix_node rnode_aux;
247:
1.98 claudio 248: printf("leaf = %p ", rmask.rm_leaf);
1.83 deraadt 249: kread((u_long)rmask.rm_leaf, &rnode_aux, sizeof(rnode_aux));
1.49 deraadt 250: p_sockaddr(kgetsa((struct sockaddr *)rnode_aux.rn_mask),
251: 0, 0, -1);
252: } else
253: p_sockaddr(kgetsa((struct sockaddr *)rmask.rm_mask),
254: 0, 0, -1);
1.1 deraadt 255: putchar('}');
1.13 millert 256: if ((rm = rmask.rm_mklist))
1.1 deraadt 257: printf(" ->");
258: }
259: putchar('\n');
260: }
261:
262: static void
1.72 claudio 263: p_krtentry(struct rtentry *rt)
1.1 deraadt 264: {
1.30 itojun 265: struct sockaddr_storage sock1, sock2;
266: struct sockaddr *sa = (struct sockaddr *)&sock1;
267: struct sockaddr *mask = (struct sockaddr *)&sock2;
1.46 deraadt 268:
1.21 peter 269: bcopy(kgetsa(rt_key(rt)), sa, sizeof(struct sockaddr));
1.30 itojun 270: if (sa->sa_len > sizeof(struct sockaddr))
271: bcopy(kgetsa(rt_key(rt)), sa, sa->sa_len);
1.21 peter 272:
1.26 angelos 273: if (sa->sa_family == PF_KEY) {
1.97 reyk 274: /* Ignore PF_KEY entries */
1.10 deraadt 275: return;
1.9 angelos 276: }
1.21 peter 277:
1.30 itojun 278: if (rt_mask(rt)) {
1.21 peter 279: bcopy(kgetsa(rt_mask(rt)), mask, sizeof(struct sockaddr));
1.30 itojun 280: if (sa->sa_len > sizeof(struct sockaddr))
281: bcopy(kgetsa(rt_mask(rt)), mask, sa->sa_len);
282: } else
1.21 peter 283: mask = 0;
1.46 deraadt 284:
1.72 claudio 285: p_addr(sa, mask, rt->rt_flags);
286: p_gwaddr(kgetsa(rt->rt_gateway), sa->sa_family);
1.1 deraadt 287: p_flags(rt->rt_flags, "%-6.6s ");
1.87 tedu 288: printf("%5u %8lld ", rt->rt_refcnt, rt->rt_use);
1.1 deraadt 289: if (rt->rt_rmx.rmx_mtu)
1.79 claudio 290: printf("%5u ", rt->rt_rmx.rmx_mtu);
1.1 deraadt 291: else
1.79 claudio 292: printf("%5s ", "-");
1.39 provos 293: putchar((rt->rt_rmx.rmx_locks & RTV_MTU) ? 'L' : ' ');
1.86 claudio 294: printf(" %2d", rt->rt_priority);
1.72 claudio 295:
1.99 ! mpi 296: if (rt->rt_ifidx != 0) {
! 297: printf(" if%d%s", rt->rt_ifidx,
1.50 deraadt 298: rt->rt_nodes[0].rn_dupedkey ? " =>" : "");
1.1 deraadt 299: }
300: putchar('\n');
1.63 claudio 301: if (vflag)
1.91 bluhm 302: printf("\texpire %10lld%c\n",
303: (long long)rt->rt_rmx.rmx_expire,
1.63 claudio 304: (rt->rt_rmx.rmx_locks & RTV_EXPIRE) ? 'L' : ' ');
1.1 deraadt 305: }
306:
307: /*
308: * Print routing statistics
309: */
310: void
1.78 claudio 311: rt_stats(void)
1.1 deraadt 312: {
313: struct rtstat rtstat;
1.72 claudio 314: int mib[6];
315: size_t size;
1.76 deraadt 316:
1.78 claudio 317: mib[0] = CTL_NET;
318: mib[1] = PF_ROUTE;
319: mib[2] = 0;
320: mib[3] = 0;
321: mib[4] = NET_RT_STATS;
322: mib[5] = 0;
323: size = sizeof (rtstat);
324:
325: if (sysctl(mib, 6, &rtstat, &size, NULL, 0) < 0) {
326: perror("sysctl of routing table statistics");
327: exit(1);
328: }
1.72 claudio 329:
1.1 deraadt 330: printf("routing:\n");
331: printf("\t%u bad routing redirect%s\n",
1.46 deraadt 332: rtstat.rts_badredirect, plural(rtstat.rts_badredirect));
1.1 deraadt 333: printf("\t%u dynamically created route%s\n",
1.46 deraadt 334: rtstat.rts_dynamic, plural(rtstat.rts_dynamic));
1.1 deraadt 335: printf("\t%u new gateway%s due to redirects\n",
1.46 deraadt 336: rtstat.rts_newgateway, plural(rtstat.rts_newgateway));
1.1 deraadt 337: printf("\t%u destination%s found unreachable\n",
1.46 deraadt 338: rtstat.rts_unreach, plural(rtstat.rts_unreach));
1.1 deraadt 339: printf("\t%u use%s of a wildcard route\n",
1.46 deraadt 340: rtstat.rts_wildcard, plural(rtstat.rts_wildcard));
1.1 deraadt 341: }
![[BACK]](/icons/back.gif){kind=icon}
Return to route.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / netstat