Annotation of src/usr.bin/netstat/route.c, Revision 1.94
1.94 ! tedu 1: /* $OpenBSD: route.c,v 1.93 2013/11/25 12:48:39 bluhm 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:
33: #include <sys/param.h>
34: #include <sys/protosw.h>
35: #include <sys/socket.h>
36:
37: #include <net/if.h>
1.92 mikeb 38: #include <net/if_var.h>
1.1 deraadt 39: #include <net/if_dl.h>
40: #include <net/if_types.h>
41: #define _KERNEL
42: #include <net/route.h>
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.26 angelos 57: #include <netinet/ip_ipsp.h>
1.1 deraadt 58: #include "netstat.h"
59:
1.29 deraadt 60: /* alignment constraint for routing socket */
61: #define ROUNDUP(a) \
62: ((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
63: #define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
1.51 jason 64:
1.73 claudio 65: struct radix_node_head ***rt_head;
1.80 claudio 66: struct radix_node_head ***rnt;
1.73 claudio 67: struct radix_node_head *rt_tables[AF_MAX+1]; /* provides enough space */
68: u_int8_t af2rtafidx[AF_MAX+1];
1.29 deraadt 69:
1.1 deraadt 70: static union {
1.6 deraadt 71: struct sockaddr u_sa;
72: u_int32_t u_data[64];
1.29 deraadt 73: int u_dummy; /* force word-alignment */
1.1 deraadt 74: } pt_u;
75:
76: int do_rtent = 0;
77: struct rtentry rtentry;
78: struct radix_node rnode;
79: struct radix_mask rmask;
80:
1.45 millert 81: static struct sockaddr *kgetsa(struct sockaddr *);
82: static void p_tree(struct radix_node *);
1.54 deraadt 83: static void p_rtnode(void);
1.49 deraadt 84: static void p_rtflags(u_char);
1.72 claudio 85: static void p_krtentry(struct rtentry *);
1.45 millert 86: static void encap_print(struct rtentry *);
1.1 deraadt 87:
88: /*
89: * Print routing tables.
90: */
91: void
1.85 claudio 92: routepr(u_long rtree, u_long mtree, u_long af2idx, u_long rtbl_id_max,
93: u_int tableid)
1.1 deraadt 94: {
95: struct radix_node_head *rnh, head;
1.73 claudio 96: int i, idxmax = 0;
97: u_int rtidxmax;
1.1 deraadt 98:
99: printf("Routing tables\n");
100:
1.88 miod 101: if (rtree == 0 || af2idx == 0) {
1.72 claudio 102: printf("rt_tables: symbol not in namelist\n");
103: return;
104: }
1.1 deraadt 105:
1.83 deraadt 106: kread((u_long)rtree, &rt_head, sizeof(rt_head));
107: kread((u_long)rtbl_id_max, &rtidxmax, sizeof(rtidxmax));
108: kread((long)af2idx, &af2rtafidx, sizeof(af2rtafidx));
1.73 claudio 109:
110: for (i = 0; i <= AF_MAX; i++) {
111: if (af2rtafidx[i] > idxmax)
112: idxmax = af2rtafidx[i];
113: }
114:
115: if ((rnt = calloc(rtidxmax + 1, sizeof(struct radix_node_head **))) ==
116: NULL)
117: err(1, NULL);
118:
119: kread((u_long)rt_head, rnt, (rtidxmax + 1) *
120: sizeof(struct radix_node_head **));
1.85 claudio 121: if (tableid > rtidxmax || rnt[tableid] == NULL) {
122: printf("Bad table %u\n", tableid);
123: return;
124: }
125: kread((u_long)rnt[tableid], rt_tables, (idxmax + 1) * sizeof(rnh));
1.73 claudio 126:
1.72 claudio 127: for (i = 0; i <= AF_MAX; i++) {
128: if (i == AF_UNSPEC) {
1.73 claudio 129: if (Aflag && (af == AF_UNSPEC || af == 0xff)) {
1.83 deraadt 130: kread(mtree, &rnh, sizeof(rnh));
131: kread((u_long)rnh, &head, sizeof(head));
1.72 claudio 132: printf("Netmasks:\n");
1.1 deraadt 133: p_tree(head.rnh_treetop);
134: }
1.73 claudio 135: continue;
136: }
1.88 miod 137: if (af2rtafidx[i] == 0)
1.73 claudio 138: /* no table for this AF */
139: continue;
1.83 deraadt 140: if ((rnh = rt_tables[af2rtafidx[i]]) == NULL)
1.73 claudio 141: continue;
1.83 deraadt 142: kread((u_long)rnh, &head, sizeof(head));
1.73 claudio 143: if (af == AF_UNSPEC || af == i) {
1.72 claudio 144: pr_family(i);
145: do_rtent = 1;
146: pr_rthdr(i, Aflag);
147: p_tree(head.rnh_treetop);
1.1 deraadt 148: }
149: }
150: }
151:
152: static struct sockaddr *
1.50 deraadt 153: kgetsa(struct sockaddr *dst)
1.1 deraadt 154: {
155:
1.83 deraadt 156: kread((u_long)dst, &pt_u.u_sa, sizeof(pt_u.u_sa));
1.1 deraadt 157: if (pt_u.u_sa.sa_len > sizeof (pt_u.u_sa))
1.67 jaredy 158: kread((u_long)dst, pt_u.u_data, pt_u.u_sa.sa_len);
1.1 deraadt 159: return (&pt_u.u_sa);
160: }
161:
162: static void
1.50 deraadt 163: p_tree(struct radix_node *rn)
1.1 deraadt 164: {
165:
166: again:
1.83 deraadt 167: kread((u_long)rn, &rnode, sizeof(rnode));
1.1 deraadt 168: if (rnode.rn_b < 0) {
169: if (Aflag)
1.93 bluhm 170: printf("%-16p ", hideroot ? 0 : rn);
1.1 deraadt 171: if (rnode.rn_flags & RNF_ROOT) {
172: if (Aflag)
173: printf("(root node)%s",
174: rnode.rn_dupedkey ? " =>\n" : "\n");
175: } else if (do_rtent) {
1.83 deraadt 176: kread((u_long)rn, &rtentry, sizeof(rtentry));
1.72 claudio 177: p_krtentry(&rtentry);
1.1 deraadt 178: if (Aflag)
179: p_rtnode();
180: } else {
181: p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_key),
1.21 peter 182: 0, 0, 44);
1.1 deraadt 183: putchar('\n');
184: }
1.13 millert 185: if ((rn = rnode.rn_dupedkey))
1.1 deraadt 186: goto again;
187: } else {
188: if (Aflag && do_rtent) {
1.93 bluhm 189: printf("%-16p ", hideroot ? 0 : rn);
1.1 deraadt 190: p_rtnode();
191: }
192: rn = rnode.rn_r;
193: p_tree(rnode.rn_l);
194: p_tree(rn);
195: }
196: }
197:
1.49 deraadt 198: static void
199: p_rtflags(u_char flags)
200: {
201: putchar('<');
202: if (flags & RNF_NORMAL)
203: putchar('N');
204: if (flags & RNF_ROOT)
205: putchar('R');
206: if (flags & RNF_ACTIVE)
207: putchar('A');
1.56 henric 208: if (flags & ~(RNF_NORMAL | RNF_ROOT | RNF_ACTIVE))
1.49 deraadt 209: printf("/0x%02x", flags);
210: putchar('>');
211: }
212:
1.23 deraadt 213: char nbuf[25];
1.1 deraadt 214:
215: static void
1.50 deraadt 216: p_rtnode(void)
1.1 deraadt 217: {
218: struct radix_mask *rm = rnode.rn_mklist;
219:
220: if (rnode.rn_b < 0) {
1.90 deraadt 221: snprintf(nbuf, sizeof nbuf, " => %p",
222: hideroot ? 0 : rnode.rn_dupedkey);
223: printf("\t (%p)%s", hideroot ? 0 : rnode.rn_p,
1.81 claudio 224: rnode.rn_dupedkey ? nbuf : "");
1.1 deraadt 225: if (rnode.rn_mask) {
1.81 claudio 226: printf(" mask ");
1.1 deraadt 227: p_sockaddr(kgetsa((struct sockaddr *)rnode.rn_mask),
1.21 peter 228: 0, 0, -1);
1.83 deraadt 229: } else if (rm == NULL) {
1.81 claudio 230: putchar('\n');
1.1 deraadt 231: return;
1.81 claudio 232: }
1.1 deraadt 233: } else {
1.23 deraadt 234: snprintf(nbuf, sizeof nbuf, "(%d)", rnode.rn_b);
1.90 deraadt 235: printf("%6.6s (%p) %16p : %16p", nbuf,
1.93 bluhm 236: hideroot ? 0 : rnode.rn_p,
237: hideroot ? 0 : rnode.rn_l,
238: hideroot ? 0 : rnode.rn_r);
1.1 deraadt 239: }
1.49 deraadt 240:
241: putchar(' ');
242: p_rtflags(rnode.rn_flags);
243:
1.1 deraadt 244: while (rm) {
1.83 deraadt 245: kread((u_long)rm, &rmask, sizeof(rmask));
1.23 deraadt 246: snprintf(nbuf, sizeof nbuf, " %d refs, ", rmask.rm_refs);
1.84 claudio 247: printf("\n\tmk = %p {(%d),%s",
1.90 deraadt 248: hideroot ? 0 : rm,
249: -1 - rmask.rm_b, rmask.rm_refs ? nbuf : " ");
1.49 deraadt 250: p_rtflags(rmask.rm_flags);
251: printf(", ");
252: if (rmask.rm_flags & RNF_NORMAL) {
253: struct radix_node rnode_aux;
254:
1.90 deraadt 255: printf("leaf = %p ", hideroot ? 0 : rmask.rm_leaf);
1.83 deraadt 256: kread((u_long)rmask.rm_leaf, &rnode_aux, sizeof(rnode_aux));
1.49 deraadt 257: p_sockaddr(kgetsa((struct sockaddr *)rnode_aux.rn_mask),
258: 0, 0, -1);
259: } else
260: p_sockaddr(kgetsa((struct sockaddr *)rmask.rm_mask),
261: 0, 0, -1);
1.1 deraadt 262: putchar('}');
1.13 millert 263: if ((rm = rmask.rm_mklist))
1.1 deraadt 264: printf(" ->");
265: }
266: putchar('\n');
267: }
268:
269: static void
1.72 claudio 270: p_krtentry(struct rtentry *rt)
1.1 deraadt 271: {
272: static struct ifnet ifnet, *lastif;
1.30 itojun 273: struct sockaddr_storage sock1, sock2;
274: struct sockaddr *sa = (struct sockaddr *)&sock1;
275: struct sockaddr *mask = (struct sockaddr *)&sock2;
1.46 deraadt 276:
1.21 peter 277: bcopy(kgetsa(rt_key(rt)), sa, sizeof(struct sockaddr));
1.30 itojun 278: if (sa->sa_len > sizeof(struct sockaddr))
279: bcopy(kgetsa(rt_key(rt)), sa, sa->sa_len);
1.21 peter 280:
1.26 angelos 281: if (sa->sa_family == PF_KEY) {
1.10 deraadt 282: encap_print(rt);
283: return;
1.9 angelos 284: }
1.21 peter 285:
1.30 itojun 286: if (rt_mask(rt)) {
1.21 peter 287: bcopy(kgetsa(rt_mask(rt)), mask, sizeof(struct sockaddr));
1.30 itojun 288: if (sa->sa_len > sizeof(struct sockaddr))
289: bcopy(kgetsa(rt_mask(rt)), mask, sa->sa_len);
290: } else
1.21 peter 291: mask = 0;
1.46 deraadt 292:
1.72 claudio 293: p_addr(sa, mask, rt->rt_flags);
294: p_gwaddr(kgetsa(rt->rt_gateway), sa->sa_family);
1.1 deraadt 295: p_flags(rt->rt_flags, "%-6.6s ");
1.87 tedu 296: printf("%5u %8lld ", rt->rt_refcnt, rt->rt_use);
1.1 deraadt 297: if (rt->rt_rmx.rmx_mtu)
1.79 claudio 298: printf("%5u ", rt->rt_rmx.rmx_mtu);
1.1 deraadt 299: else
1.79 claudio 300: printf("%5s ", "-");
1.39 provos 301: putchar((rt->rt_rmx.rmx_locks & RTV_MTU) ? 'L' : ' ');
1.86 claudio 302: printf(" %2d", rt->rt_priority);
1.72 claudio 303:
1.1 deraadt 304: if (rt->rt_ifp) {
305: if (rt->rt_ifp != lastif) {
1.83 deraadt 306: kread((u_long)rt->rt_ifp, &ifnet, sizeof(ifnet));
1.1 deraadt 307: lastif = rt->rt_ifp;
308: }
1.2 deraadt 309: printf(" %.16s%s", ifnet.if_xname,
1.50 deraadt 310: rt->rt_nodes[0].rn_dupedkey ? " =>" : "");
1.1 deraadt 311: }
312: putchar('\n');
1.63 claudio 313: if (vflag)
1.91 bluhm 314: printf("\texpire %10lld%c\n",
315: (long long)rt->rt_rmx.rmx_expire,
1.63 claudio 316: (rt->rt_rmx.rmx_locks & RTV_EXPIRE) ? 'L' : ' ');
1.1 deraadt 317: }
318:
319: /*
320: * Print routing statistics
321: */
322: void
1.78 claudio 323: rt_stats(void)
1.1 deraadt 324: {
325: struct rtstat rtstat;
1.72 claudio 326: int mib[6];
327: size_t size;
1.76 deraadt 328:
1.78 claudio 329: mib[0] = CTL_NET;
330: mib[1] = PF_ROUTE;
331: mib[2] = 0;
332: mib[3] = 0;
333: mib[4] = NET_RT_STATS;
334: mib[5] = 0;
335: size = sizeof (rtstat);
336:
337: if (sysctl(mib, 6, &rtstat, &size, NULL, 0) < 0) {
338: perror("sysctl of routing table statistics");
339: exit(1);
340: }
1.72 claudio 341:
1.1 deraadt 342: printf("routing:\n");
343: printf("\t%u bad routing redirect%s\n",
1.46 deraadt 344: rtstat.rts_badredirect, plural(rtstat.rts_badredirect));
1.1 deraadt 345: printf("\t%u dynamically created route%s\n",
1.46 deraadt 346: rtstat.rts_dynamic, plural(rtstat.rts_dynamic));
1.1 deraadt 347: printf("\t%u new gateway%s due to redirects\n",
1.46 deraadt 348: rtstat.rts_newgateway, plural(rtstat.rts_newgateway));
1.1 deraadt 349: printf("\t%u destination%s found unreachable\n",
1.46 deraadt 350: rtstat.rts_unreach, plural(rtstat.rts_unreach));
1.1 deraadt 351: printf("\t%u use%s of a wildcard route\n",
1.46 deraadt 352: rtstat.rts_wildcard, plural(rtstat.rts_wildcard));
1.5 mickey 353: }
354:
1.9 angelos 355: static void
1.50 deraadt 356: encap_print(struct rtentry *rt)
1.9 angelos 357: {
1.10 deraadt 358: struct sockaddr_encap sen1, sen2, sen3;
1.44 mickey 359: struct ipsec_policy ipo;
1.31 angelos 360: struct sockaddr_in6 s61, s62;
1.9 angelos 361:
362: bcopy(kgetsa(rt_key(rt)), &sen1, sizeof(sen1));
363: bcopy(kgetsa(rt_mask(rt)), &sen2, sizeof(sen2));
364: bcopy(kgetsa(rt->rt_gateway), &sen3, sizeof(sen3));
365:
1.46 deraadt 366: if (sen1.sen_type == SENT_IP4) {
1.72 claudio 367: printf("%-18s %-5u ", netname4(sen1.sen_ip_src.s_addr,
1.46 deraadt 368: sen2.sen_ip_src.s_addr), ntohs(sen1.sen_sport));
1.72 claudio 369: printf("%-18s %-5u %-5u ", netname4(sen1.sen_ip_dst.s_addr,
1.46 deraadt 370: sen2.sen_ip_dst.s_addr),
371: ntohs(sen1.sen_dport), sen1.sen_proto);
1.31 angelos 372: }
373:
1.46 deraadt 374: if (sen1.sen_type == SENT_IP6) {
375: bzero(&s61, sizeof(s61));
376: bzero(&s62, sizeof(s62));
377: s61.sin6_family = s62.sin6_family = AF_INET6;
378: s61.sin6_len = s62.sin6_len = sizeof(s61);
379: bcopy(&sen1.sen_ip6_src, &s61.sin6_addr, sizeof(struct in6_addr));
1.57 itojun 380: #ifdef __KAME__
381: if (IN6_IS_ADDR_LINKLOCAL(&s61.sin6_addr) ||
1.74 itojun 382: IN6_IS_ADDR_MC_LINKLOCAL(&s61.sin6_addr) ||
383: IN6_IS_ADDR_MC_INTFACELOCAL(&s61.sin6_addr)) {
1.57 itojun 384: s61.sin6_scope_id =
385: ((u_int16_t)s61.sin6_addr.s6_addr[2] << 8) |
386: s61.sin6_addr.s6_addr[3];
387: s61.sin6_addr.s6_addr[2] = s61.sin6_addr.s6_addr[3] = 0;
388: }
389: #endif
1.46 deraadt 390: bcopy(&sen2.sen_ip6_src, &s62.sin6_addr, sizeof(struct in6_addr));
1.57 itojun 391: #ifdef __KAME__
392: if (IN6_IS_ADDR_LINKLOCAL(&s62.sin6_addr) ||
1.74 itojun 393: IN6_IS_ADDR_MC_LINKLOCAL(&s62.sin6_addr) ||
394: IN6_IS_ADDR_MC_INTFACELOCAL(&s62.sin6_addr)) {
1.57 itojun 395: s62.sin6_scope_id =
396: ((u_int16_t)s62.sin6_addr.s6_addr[2] << 8) |
397: s62.sin6_addr.s6_addr[3];
398: s62.sin6_addr.s6_addr[2] = s62.sin6_addr.s6_addr[3] = 0;
399: }
400: #endif
1.46 deraadt 401:
1.72 claudio 402: printf("%-42s %-5u ", netname6(&s61, &s62),
1.46 deraadt 403: ntohs(sen1.sen_ip6_sport));
404:
405: bzero(&s61, sizeof(s61));
406: bzero(&s62, sizeof(s62));
407: s61.sin6_family = s62.sin6_family = AF_INET6;
408: s61.sin6_len = s62.sin6_len = sizeof(s61);
409: bcopy(&sen1.sen_ip6_dst, &s61.sin6_addr, sizeof(struct in6_addr));
1.57 itojun 410: #ifdef __KAME__
411: if (IN6_IS_ADDR_LINKLOCAL(&s61.sin6_addr) ||
1.74 itojun 412: IN6_IS_ADDR_MC_LINKLOCAL(&s61.sin6_addr) ||
413: IN6_IS_ADDR_MC_INTFACELOCAL(&s61.sin6_addr)) {
1.57 itojun 414: s61.sin6_scope_id =
415: ((u_int16_t)s61.sin6_addr.s6_addr[2] << 8) |
416: s61.sin6_addr.s6_addr[3];
417: s61.sin6_addr.s6_addr[2] = s61.sin6_addr.s6_addr[3] = 0;
418: }
419: #endif
1.46 deraadt 420: bcopy(&sen2.sen_ip6_dst, &s62.sin6_addr, sizeof(struct in6_addr));
1.57 itojun 421: #ifdef __KAME__
422: if (IN6_IS_ADDR_LINKLOCAL(&s62.sin6_addr) ||
1.74 itojun 423: IN6_IS_ADDR_MC_LINKLOCAL(&s62.sin6_addr) ||
424: IN6_IS_ADDR_MC_INTFACELOCAL(&s62.sin6_addr)) {
1.57 itojun 425: s62.sin6_scope_id =
426: ((u_int16_t)s62.sin6_addr.s6_addr[2] << 8) |
427: s62.sin6_addr.s6_addr[3];
428: s62.sin6_addr.s6_addr[2] = s62.sin6_addr.s6_addr[3] = 0;
429: }
430: #endif
1.31 angelos 431:
1.72 claudio 432: printf("%-42s %-5u %-5u ", netname6(&s61, &s62),
1.46 deraadt 433: ntohs(sen1.sen_ip6_dport), sen1.sen_ip6_proto);
1.31 angelos 434: }
435:
1.46 deraadt 436: if (sen3.sen_type == SENT_IPSP) {
437: char hostn[NI_MAXHOST];
1.31 angelos 438:
1.83 deraadt 439: kread((u_long)sen3.sen_ipsp, &ipo, sizeof(ipo));
1.38 angelos 440:
1.48 ho 441: if (getnameinfo(&ipo.ipo_dst.sa, ipo.ipo_dst.sa.sa_len,
442: hostn, NI_MAXHOST, NULL, 0, NI_NUMERICHOST) != 0)
443: strlcpy (hostn, "none", NI_MAXHOST);
444:
1.46 deraadt 445: printf("%s", hostn);
446: printf("/%-u", ipo.ipo_sproto);
1.44 mickey 447:
1.46 deraadt 448: switch (ipo.ipo_type) {
1.44 mickey 449: case IPSP_IPSEC_REQUIRE:
1.46 deraadt 450: printf("/require");
451: break;
1.44 mickey 452: case IPSP_IPSEC_ACQUIRE:
1.46 deraadt 453: printf("/acquire");
454: break;
1.44 mickey 455: case IPSP_IPSEC_USE:
1.46 deraadt 456: printf("/use");
457: break;
1.44 mickey 458: case IPSP_IPSEC_DONTACQ:
1.46 deraadt 459: printf("/dontacq");
460: break;
1.44 mickey 461: case IPSP_PERMIT:
1.71 hshoexer 462: printf("/bypass");
1.46 deraadt 463: break;
1.44 mickey 464: case IPSP_DENY:
1.46 deraadt 465: printf("/deny");
466: break;
1.44 mickey 467: default:
1.46 deraadt 468: printf("/<unknown type!>");
469: break;
470: }
1.44 mickey 471:
1.46 deraadt 472: if ((ipo.ipo_addr.sen_type == SENT_IP4 &&
473: ipo.ipo_addr.sen_direction == IPSP_DIRECTION_IN) ||
474: (ipo.ipo_addr.sen_type == SENT_IP6 &&
475: ipo.ipo_addr.sen_ip6_direction == IPSP_DIRECTION_IN))
476: printf("/in\n");
477: else if ((ipo.ipo_addr.sen_type == SENT_IP4 &&
478: ipo.ipo_addr.sen_direction == IPSP_DIRECTION_OUT) ||
479: (ipo.ipo_addr.sen_type == SENT_IP6 &&
480: ipo.ipo_addr.sen_ip6_direction == IPSP_DIRECTION_OUT))
481: printf("/out\n");
482: else
483: printf("/<unknown>\n");
1.1 deraadt 484: }
485: }
![[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