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