2 * Copyright (C) 1998 WIDE Project.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
31 * Copyright (c) 1989 Stephen Deering
32 * Copyright (c) 1992, 1993
33 * The Regents of the University of California. All rights reserved.
35 * This code is derived from software contributed to Berkeley by
36 * Stephen Deering of Stanford University.
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
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.
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
66 * @(#)mroute.c 8.2 (Berkeley) 4/28/95
69 #include <sys/cdefs.h>
70 __FBSDID("$FreeBSD$");
73 #include <sys/param.h>
74 #include <sys/queue.h>
75 #include <sys/socket.h>
76 #include <sys/socketvar.h>
77 #include <sys/sysctl.h>
78 #include <sys/protosw.h>
83 #include <net/if_var.h>
84 #include <net/route.h>
86 #include <netinet/in.h>
94 #include <netinet6/ip6_mroute.h>
99 #define WID_ORG (Wflag ? 39 : (numeric_addr ? 29 : 18)) /* width of origin column */
100 #define WID_GRP (Wflag ? 18 : (numeric_addr ? 16 : 18)) /* width of group column */
103 mroute6pr(u_long mfcaddr, u_long mifaddr)
105 struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp;
106 struct mif6 mif6table[MAXMIFS];
108 struct rtdetq rte, *rtep;
113 int saved_numeric_addr;
118 len = sizeof(mif6table);
120 if (sysctlbyname("net.inet6.ip6.mif6table", mif6table, &len,
122 warn("sysctl: net.inet6.ip6.mif6table");
126 kread(mifaddr, (char *)mif6table, sizeof(mif6table));
128 saved_numeric_addr = numeric_addr;
132 for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) {
134 char ifname[IFNAMSIZ];
136 if (mifp->m6_ifp == NULL)
140 kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet));
143 if (!banner_printed) {
144 printf("\nIPv6 Multicast Interface Table\n"
146 "Pkts-In Pkts-Out\n");
151 mifi, mifp->m6_rate_limit);
152 printf(" %5s", (mifp->m6_flags & MIFF_REGISTER) ?
153 "reg0" : if_indextoname(ifnet.if_index, ifname));
155 printf(" %9ju %9ju\n", (uintmax_t)mifp->m6_pkt_in,
156 (uintmax_t)mifp->m6_pkt_out);
159 printf("\nIPv6 Multicast Interface Table is empty\n");
161 len = sizeof(mf6ctable);
163 if (sysctlbyname("net.inet6.ip6.mf6ctable", mf6ctable, &len,
165 warn("sysctl: net.inet6.ip6.mf6ctable");
169 kread(mfcaddr, (char *)mf6ctable, sizeof(mf6ctable));
173 for (i = 0; i < MF6CTBLSIZ; ++i) {
176 kread((u_long)mfcp, (char *)&mfc, sizeof(mfc));
177 if (!banner_printed) {
178 printf ("\nIPv6 Multicast Forwarding Cache\n");
179 printf(" %-*.*s %-*.*s %s",
180 WID_ORG, WID_ORG, "Origin",
181 WID_GRP, WID_GRP, "Group",
182 " Packets Waits In-Mif Out-Mifs\n");
186 printf(" %-*.*s", WID_ORG, WID_ORG,
187 routename6(&mfc.mf6c_origin));
188 printf(" %-*.*s", WID_GRP, WID_GRP,
189 routename6(&mfc.mf6c_mcastgrp));
190 printf(" %9ju", (uintmax_t)mfc.mf6c_pkt_cnt);
192 for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) {
195 kread((u_long)rtep, (char *)&rte, sizeof(rte));
198 printf(" %3ld", waitings);
200 if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT)
203 printf(" %3d ", mfc.mf6c_parent);
204 for (mifi = 0; mifi <= maxmif; mifi++) {
205 if (IF_ISSET(mifi, &mfc.mf6c_ifset))
210 mfcp = mfc.mf6c_next;
214 printf("\nIPv6 Multicast Forwarding Table is empty\n");
217 numeric_addr = saved_numeric_addr;
221 mrt6_stats(u_long mstaddr)
223 struct mrt6stat mrtstat;
224 size_t len = sizeof mrtstat;
227 if (sysctlbyname("net.inet6.ip6.mrt6stat", &mrtstat, &len,
229 warn("sysctl: net.inet6.ip6.mrt6stat");
233 kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat));
235 printf("IPv6 multicast forwarding:\n");
237 #define p(f, m) if (mrtstat.f || sflag <= 1) \
238 printf(m, (uintmax_t)mrtstat.f, plural(mrtstat.f))
239 #define p2(f, m) if (mrtstat.f || sflag <= 1) \
240 printf(m, (uintmax_t)mrtstat.f, plurales(mrtstat.f))
242 p(mrt6s_mfc_lookups, "\t%ju multicast forwarding cache lookup%s\n");
243 p2(mrt6s_mfc_misses, "\t%ju multicast forwarding cache miss%s\n");
244 p(mrt6s_upcalls, "\t%ju upcall%s to multicast routing daemon\n");
245 p(mrt6s_upq_ovflw, "\t%ju upcall queue overflow%s\n");
246 p(mrt6s_upq_sockfull,
247 "\t%ju upcall%s dropped due to full socket buffer\n");
248 p(mrt6s_cache_cleanups, "\t%ju cache cleanup%s\n");
249 p(mrt6s_no_route, "\t%ju datagram%s with no route for origin\n");
250 p(mrt6s_bad_tunnel, "\t%ju datagram%s arrived with bad tunneling\n");
251 p(mrt6s_cant_tunnel, "\t%ju datagram%s could not be tunneled\n");
252 p(mrt6s_wrong_if, "\t%ju datagram%s arrived on wrong interface\n");
253 p(mrt6s_drop_sel, "\t%ju datagram%s selectively dropped\n");
255 "\t%ju datagram%s dropped due to queue overflow\n");
256 p(mrt6s_pkt2large, "\t%ju datagram%s dropped for being too large\n");