/*- * Copyright (C) 1998 WIDE Project. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the project nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ /*- * Copyright (c) 1989 Stephen Deering * Copyright (c) 1992, 1993 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley by * Stephen Deering of Stanford University. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)mroute.c 8.2 (Berkeley) 4/28/95 */ #include <sys/cdefs.h> __FBSDID("$FreeBSD$"); #ifdef INET6 #include <sys/param.h> #include <sys/queue.h> #include <sys/socket.h> #include <sys/socketvar.h> #include <sys/sysctl.h> #include <sys/protosw.h> #include <sys/mbuf.h> #include <sys/time.h> #include <net/if.h> #include <net/if_var.h> #include <net/route.h> #include <netinet/in.h> #include <err.h> #include <nlist.h> #include <stdint.h> #include <stdio.h> #include <stdlib.h> #define KERNEL 1 #include <netinet6/ip6_mroute.h> #undef KERNEL #include "netstat.h" /* * kvm(3) bindings for every needed symbol */ static struct nlist mrl[] = { #define N_MF6CTABLE 0 { .n_name = "_mf6ctable" }, #define N_MIF6TABLE 1 { .n_name = "_mif6table" }, #define N_MRT6STAT 2 { .n_name = "_mrt6stat" }, { .n_name = NULL }, }; #define WID_ORG (Wflag ? 39 : (numeric_addr ? 29 : 18)) /* width of origin column */ #define WID_GRP (Wflag ? 18 : (numeric_addr ? 16 : 18)) /* width of group column */ void mroute6pr() { struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp; struct mif6 mif6table[MAXMIFS]; struct mf6c mfc; struct rtdetq rte, *rtep; struct mif6 *mifp; u_long mfcaddr, mifaddr; mifi_t mifi; int i; int banner_printed; int saved_numeric_addr; mifi_t maxmif = 0; long int waitings; size_t len; kresolve_list(mrl); mfcaddr = mrl[N_MF6CTABLE].n_value; mifaddr = mrl[N_MIF6TABLE].n_value; if (mfcaddr == 0 || mifaddr == 0) { fprintf(stderr, "No IPv6 MROUTING kernel support.\n"); return; } len = sizeof(mif6table); if (live) { if (sysctlbyname("net.inet6.ip6.mif6table", mif6table, &len, NULL, 0) < 0) { warn("sysctl: net.inet6.ip6.mif6table"); return; } } else kread(mifaddr, (char *)mif6table, sizeof(mif6table)); saved_numeric_addr = numeric_addr; numeric_addr = 1; banner_printed = 0; for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) { struct ifnet ifnet; char ifname[IFNAMSIZ]; if (mifp->m6_ifp == NULL) continue; /* XXX KVM */ kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet)); maxmif = mifi; if (!banner_printed) { printf("\nIPv6 Multicast Interface Table\n" " Mif Rate PhyIF " "Pkts-In Pkts-Out\n"); banner_printed = 1; } printf(" %2u %4d", mifi, mifp->m6_rate_limit); printf(" %5s", (mifp->m6_flags & MIFF_REGISTER) ? "reg0" : if_indextoname(ifnet.if_index, ifname)); printf(" %9ju %9ju\n", (uintmax_t)mifp->m6_pkt_in, (uintmax_t)mifp->m6_pkt_out); } if (!banner_printed) printf("\nIPv6 Multicast Interface Table is empty\n"); len = sizeof(mf6ctable); if (live) { if (sysctlbyname("net.inet6.ip6.mf6ctable", mf6ctable, &len, NULL, 0) < 0) { warn("sysctl: net.inet6.ip6.mf6ctable"); return; } } else kread(mfcaddr, (char *)mf6ctable, sizeof(mf6ctable)); banner_printed = 0; for (i = 0; i < MF6CTBLSIZ; ++i) { mfcp = mf6ctable[i]; while(mfcp) { kread((u_long)mfcp, (char *)&mfc, sizeof(mfc)); if (!banner_printed) { printf ("\nIPv6 Multicast Forwarding Cache\n"); printf(" %-*.*s %-*.*s %s", WID_ORG, WID_ORG, "Origin", WID_GRP, WID_GRP, "Group", " Packets Waits In-Mif Out-Mifs\n"); banner_printed = 1; } printf(" %-*.*s", WID_ORG, WID_ORG, routename6(&mfc.mf6c_origin)); printf(" %-*.*s", WID_GRP, WID_GRP, routename6(&mfc.mf6c_mcastgrp)); printf(" %9ju", (uintmax_t)mfc.mf6c_pkt_cnt); for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) { waitings++; /* XXX KVM */ kread((u_long)rtep, (char *)&rte, sizeof(rte)); rtep = rte.next; } printf(" %3ld", waitings); if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT) printf(" --- "); else printf(" %3d ", mfc.mf6c_parent); for (mifi = 0; mifi <= maxmif; mifi++) { if (IF_ISSET(mifi, &mfc.mf6c_ifset)) printf(" %u", mifi); } printf("\n"); mfcp = mfc.mf6c_next; } } if (!banner_printed) printf("\nIPv6 Multicast Forwarding Table is empty\n"); printf("\n"); numeric_addr = saved_numeric_addr; } void mrt6_stats() { struct mrt6stat mrtstat; u_long mstaddr; size_t len = sizeof mrtstat; kresolve_list(mrl); mstaddr = mrl[N_MRT6STAT].n_value; if (mstaddr == 0) { fprintf(stderr, "No IPv6 MROUTING kernel support.\n"); return; } if (live) { if (sysctlbyname("net.inet6.ip6.mrt6stat", &mrtstat, &len, NULL, 0) < 0) { warn("sysctl: net.inet6.ip6.mrt6stat"); return; } } else kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat)); printf("IPv6 multicast forwarding:\n"); #define p(f, m) if (mrtstat.f || sflag <= 1) \ printf(m, (uintmax_t)mrtstat.f, plural(mrtstat.f)) #define p2(f, m) if (mrtstat.f || sflag <= 1) \ printf(m, (uintmax_t)mrtstat.f, plurales(mrtstat.f)) p(mrt6s_mfc_lookups, "\t%ju multicast forwarding cache lookup%s\n"); p2(mrt6s_mfc_misses, "\t%ju multicast forwarding cache miss%s\n"); p(mrt6s_upcalls, "\t%ju upcall%s to multicast routing daemon\n"); p(mrt6s_upq_ovflw, "\t%ju upcall queue overflow%s\n"); p(mrt6s_upq_sockfull, "\t%ju upcall%s dropped due to full socket buffer\n"); p(mrt6s_cache_cleanups, "\t%ju cache cleanup%s\n"); p(mrt6s_no_route, "\t%ju datagram%s with no route for origin\n"); p(mrt6s_bad_tunnel, "\t%ju datagram%s arrived with bad tunneling\n"); p(mrt6s_cant_tunnel, "\t%ju datagram%s could not be tunneled\n"); p(mrt6s_wrong_if, "\t%ju datagram%s arrived on wrong interface\n"); p(mrt6s_drop_sel, "\t%ju datagram%s selectively dropped\n"); p(mrt6s_q_overflow, "\t%ju datagram%s dropped due to queue overflow\n"); p(mrt6s_pkt2large, "\t%ju datagram%s dropped for being too large\n"); #undef p2 #undef p } #endif /*INET6*/