mroute6.c revision 162797
1/*
2 * Copyright (C) 1998 WIDE Project.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the project nor the names of its contributors
14 *    may be used to endorse or promote products derived from this software
15 *    without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED.  IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30/*
31 * Copyright (c) 1989 Stephen Deering
32 * Copyright (c) 1992, 1993
33 *	The Regents of the University of California.  All rights reserved.
34 *
35 * This code is derived from software contributed to Berkeley by
36 * Stephen Deering of Stanford University.
37 *
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
40 * are met:
41 * 1. Redistributions of source code must retain the above copyright
42 *    notice, this list of conditions and the following disclaimer.
43 * 2. Redistributions in binary form must reproduce the above copyright
44 *    notice, this list of conditions and the following disclaimer in the
45 *    documentation and/or other materials provided with the distribution.
46 * 3. All advertising materials mentioning features or use of this software
47 *    must display the following acknowledgement:
48 *	This product includes software developed by the University of
49 *	California, Berkeley and its contributors.
50 * 4. Neither the name of the University nor the names of its contributors
51 *    may be used to endorse or promote products derived from this software
52 *    without specific prior written permission.
53 *
54 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
64 * SUCH DAMAGE.
65 *
66 *	@(#)mroute.c	8.2 (Berkeley) 4/28/95
67 */
68
69#include <sys/cdefs.h>
70__FBSDID("$FreeBSD: head/usr.bin/netstat/mroute6.c 162797 2006-09-29 16:16:41Z bms $");
71
72#ifdef INET6
73#include <sys/param.h>
74#include <sys/queue.h>
75#include <sys/socket.h>
76#include <sys/socketvar.h>
77#include <sys/protosw.h>
78
79#include <net/if.h>
80#include <net/if_var.h>
81#include <net/route.h>
82
83#include <netinet/in.h>
84
85#include <stdint.h>
86#include <stdio.h>
87
88#define	KERNEL 1
89#include <netinet6/ip6_mroute.h>
90#undef KERNEL
91
92#include "netstat.h"
93
94#define	WID_ORG	(Wflag ? 39 : (numeric_addr ? 29 : 18)) /* width of origin column */
95#define	WID_GRP	(Wflag ? 18 : (numeric_addr ? 16 : 18)) /* width of group column */
96
97void
98mroute6pr(u_long mfcaddr, u_long mifaddr)
99{
100	struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp;
101	struct mif6 mif6table[MAXMIFS];
102	struct mf6c mfc;
103	struct rtdetq rte, *rtep;
104	struct mif6 *mifp;
105	mifi_t mifi;
106	int i;
107	int banner_printed;
108	int saved_numeric_addr;
109	mifi_t maxmif = 0;
110	long int waitings;
111
112	if (mfcaddr == 0 || mifaddr == 0) {
113		printf("No IPv6 multicast routing compiled into this"
114		       " system.\n");
115		return;
116	}
117
118	saved_numeric_addr = numeric_addr;
119	numeric_addr = 1;
120
121	kread(mifaddr, (char *)&mif6table, sizeof(mif6table));
122	banner_printed = 0;
123	for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) {
124		struct ifnet ifnet;
125		char ifname[IFNAMSIZ];
126
127		if (mifp->m6_ifp == NULL)
128			continue;
129
130		kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet));
131		maxmif = mifi;
132		if (!banner_printed) {
133			printf("\nIPv6 Multicast Interface Table\n"
134			       " Mif   Rate   PhyIF   "
135			       "Pkts-In   Pkts-Out\n");
136			banner_printed = 1;
137		}
138
139		printf("  %2u   %4d",
140		       mifi, mifp->m6_rate_limit);
141		printf("   %5s", (mifp->m6_flags & MIFF_REGISTER) ?
142		       "reg0" : if_indextoname(ifnet.if_index, ifname));
143
144		printf(" %9ju  %9ju\n", (uintmax_t)mifp->m6_pkt_in,
145		    (uintmax_t)mifp->m6_pkt_out);
146	}
147	if (!banner_printed)
148		printf("\nIPv6 Multicast Interface Table is empty\n");
149
150	kread(mfcaddr, (char *)&mf6ctable, sizeof(mf6ctable));
151	banner_printed = 0;
152	for (i = 0; i < MF6CTBLSIZ; ++i) {
153		mfcp = mf6ctable[i];
154		while(mfcp) {
155			kread((u_long)mfcp, (char *)&mfc, sizeof(mfc));
156			if (!banner_printed) {
157				printf ("\nIPv6 Multicast Forwarding Cache\n");
158				printf(" %-*.*s %-*.*s %s",
159				       WID_ORG, WID_ORG, "Origin",
160				       WID_GRP, WID_GRP, "Group",
161				       "  Packets Waits In-Mif  Out-Mifs\n");
162				banner_printed = 1;
163			}
164
165			printf(" %-*.*s", WID_ORG, WID_ORG,
166			       routename6(&mfc.mf6c_origin));
167			printf(" %-*.*s", WID_GRP, WID_GRP,
168			       routename6(&mfc.mf6c_mcastgrp));
169			printf(" %9ju", (uintmax_t)mfc.mf6c_pkt_cnt);
170
171			for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) {
172				waitings++;
173				kread((u_long)rtep, (char *)&rte, sizeof(rte));
174				rtep = rte.next;
175			}
176			printf("   %3ld", waitings);
177
178			if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT)
179				printf(" ---   ");
180			else
181				printf("  %3d   ", mfc.mf6c_parent);
182			for (mifi = 0; mifi <= maxmif; mifi++) {
183				if (IF_ISSET(mifi, &mfc.mf6c_ifset))
184					printf(" %u", mifi);
185			}
186			printf("\n");
187
188			mfcp = mfc.mf6c_next;
189		}
190	}
191	if (!banner_printed)
192		printf("\nIPv6 Multicast Routing Table is empty\n");
193
194	printf("\n");
195	numeric_addr = saved_numeric_addr;
196}
197
198void
199mrt6_stats(u_long mstaddr)
200{
201	struct mrt6stat mrtstat;
202
203	if (mstaddr == 0) {
204		printf("No IPv6 multicast routing compiled into this"
205		       " system.\n");
206		return;
207	}
208
209	kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat));
210	printf("IPv6 multicast forwarding:\n");
211
212#define	p(f, m) if (mrtstat.f || sflag <= 1) \
213	printf(m, (uintmax_t)mrtstat.f, plural(mrtstat.f))
214#define	p2(f, m) if (mrtstat.f || sflag <= 1) \
215	printf(m, (uintmax_t)mrtstat.f, plurales(mrtstat.f))
216
217	p(mrt6s_mfc_lookups, "\t%ju multicast forwarding cache lookup%s\n");
218	p2(mrt6s_mfc_misses, "\t%ju multicast forwarding cache miss%s\n");
219	p(mrt6s_upcalls, "\t%ju upcall%s to multicast routing daemon\n");
220	p(mrt6s_upq_ovflw, "\t%ju upcall queue overflow%s\n");
221	p(mrt6s_upq_sockfull,
222	    "\t%ju upcall%s dropped due to full socket buffer\n");
223	p(mrt6s_cache_cleanups, "\t%ju cache cleanup%s\n");
224	p(mrt6s_no_route, "\t%ju datagram%s with no route for origin\n");
225	p(mrt6s_bad_tunnel, "\t%ju datagram%s arrived with bad tunneling\n");
226	p(mrt6s_cant_tunnel, "\t%ju datagram%s could not be tunneled\n");
227	p(mrt6s_wrong_if, "\t%ju datagram%s arrived on wrong interface\n");
228	p(mrt6s_drop_sel, "\t%ju datagram%s selectively dropped\n");
229	p(mrt6s_q_overflow,
230	    "\t%ju datagram%s dropped due to queue overflow\n");
231	p(mrt6s_pkt2large, "\t%ju datagram%s dropped for being too large\n");
232
233#undef	p2
234#undef	p
235}
236#endif /*INET6*/
237