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