/* * Copyright (c) 2008-2009 Apple Inc. All rights reserved. * * @APPLE_OSREFERENCE_LICENSE_HEADER_START@ * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. The rights granted to you under the License * may not be used to create, or enable the creation or redistribution of, * unlawful or unlicensed copies of an Apple operating system, or to * circumvent, violate, or enable the circumvention or violation of, any * terms of an Apple operating system software license agreement. * * Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this file. * * The Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. * Please see the License for the specific language governing rights and * limitations under the License. * * @APPLE_OSREFERENCE_LICENSE_HEADER_END@ */ /* * 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 * $FreeBSD: src/usr.bin/netstat/mroute6.c,v 1.1.2.5 2001/08/10 09:07:09 ru Exp $ */ #ifdef INET6 #include <sys/param.h> #include <sys/queue.h> #include <sys/socket.h> #include <sys/socketvar.h> #include <sys/sysctl.h> #include <net/if.h> #include <net/if_var.h> #include <net/route.h> #include <netinet/in.h> #include <stdio.h> #include <stdlib.h> #include <err.h> #define KERNEL 1 #include <netinet6/ip6_mroute.h> #undef KERNEL #include "netstat.h" #define WID_ORG (lflag ? 39 : (nflag ? 29 : 18)) /* width of origin column */ #define WID_GRP (lflag ? 18 : (nflag ? 16 : 18)) /* width of group column */ void mroute6pr(void) { #if 0 struct mf6c **mf6ctable = 0, *mfcp; struct mif6 mif6table[MAXMIFS]; struct mf6c mfc; struct rtdetq *rtep; register struct mif6 *mifp; register mifi_t mifi; register int i; register int banner_printed; register int saved_nflag; mifi_t maxmif = 0; long waitings; size_t len; len = sizeof(mif6table); if (sysctlbyname("net.inet6.ip6.mif6table", mif6table, &len, 0, 9) == -1) { //printf("No IPv6 multicast routing compiled into this system.\n"); return; } saved_nflag = nflag; nflag = 1; banner_printed = 0; for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) { struct ifnet ifnet = { 0 } ; char ifname[IFNAMSIZ]; if (mifp->m6_ifp == NULL) continue; /* * m6_ifp should be ifindex instead of ifnet pointer * * 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(" %9llu %9llu\n", (unsigned long long)mifp->m6_pkt_in, (unsigned long long)mifp->m6_pkt_out); } if (!banner_printed) printf("\nIPv6 Multicast Interface Table is empty\n"); len = sizeof(MF6CTBLSIZ * sizeof(struct mf6c)); mf6ctable = malloc(len); if (mf6ctable == 0) return; if (sysctlbyname("net.inet6.ip6.mf6ctable", mf6ctable, &len, 0, 0) == -1) { //printf("No IPv6 multicast routing compiled into this system.\n"); free(mf6ctable); return; } banner_printed = 0; for (i = 0; i < MF6CTBLSIZ; ++i) { mfcp = mf6ctable[i]; while(mfcp) { 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(" %9llu", (unsigned long long)mfc.mf6c_pkt_cnt); for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) { /* The sysctl should return the number of packet waiting * struct rtdetq rte; * kread((u_long)rtep, (char *)&rte, sizeof(rte)); * rtep = rte.next; */ waitings++; } 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 Routing Table is empty\n"); printf("\n"); nflag = saved_nflag; free(mf6ctable); #endif } void mrt6_stats(void) { struct mrt6stat mrtstat; size_t len; len = sizeof(mrtstat); if (sysctlbyname("net.inet6.ip6.mrt6stat", &mrtstat, &len, 0, 0) == -1) { //printf("No IPv6 multicast routing compiled into this system\n"); return; } printf("IPv6 multicast forwarding:\n"); printf(" %10llu multicast forwarding cache lookup%s\n", (unsigned long long)mrtstat.mrt6s_mfc_lookups, plural(mrtstat.mrt6s_mfc_lookups)); printf(" %10llu multicast forwarding cache miss%s\n", (unsigned long long)mrtstat.mrt6s_mfc_misses, plurales(mrtstat.mrt6s_mfc_misses)); printf(" %10llu upcall%s to mrouted\n", (unsigned long long)mrtstat.mrt6s_upcalls, plural(mrtstat.mrt6s_upcalls)); printf(" %10llu upcall queue overflow%s\n", (unsigned long long)mrtstat.mrt6s_upq_ovflw, plural(mrtstat.mrt6s_upq_ovflw)); printf(" %10llu upcall%s dropped due to full socket buffer\n", (unsigned long long)mrtstat.mrt6s_upq_sockfull, plural(mrtstat.mrt6s_upq_sockfull)); printf(" %10llu cache cleanup%s\n", (unsigned long long)mrtstat.mrt6s_cache_cleanups, plural(mrtstat.mrt6s_cache_cleanups)); printf(" %10llu datagram%s with no route for origin\n", (unsigned long long)mrtstat.mrt6s_no_route, plural(mrtstat.mrt6s_no_route)); printf(" %10llu datagram%s arrived with bad tunneling\n", (unsigned long long)mrtstat.mrt6s_bad_tunnel, plural(mrtstat.mrt6s_bad_tunnel)); printf(" %10llu datagram%s could not be tunneled\n", (unsigned long long)mrtstat.mrt6s_cant_tunnel, plural(mrtstat.mrt6s_cant_tunnel)); printf(" %10llu datagram%s arrived on wrong interface\n", (unsigned long long)mrtstat.mrt6s_wrong_if, plural(mrtstat.mrt6s_wrong_if)); printf(" %10llu datagram%s selectively dropped\n", (unsigned long long)mrtstat.mrt6s_drop_sel, plural(mrtstat.mrt6s_drop_sel)); printf(" %10llu datagram%s dropped due to queue overflow\n", (unsigned long long)mrtstat.mrt6s_q_overflow, plural(mrtstat.mrt6s_q_overflow)); printf(" %10llu datagram%s dropped for being too large\n", (unsigned long long)mrtstat.mrt6s_pkt2large, plural(mrtstat.mrt6s_pkt2large)); } #endif /*INET6*/