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 * $FreeBSD$ 68 */ 69 70 #include <sys/param.h> 71 #include <sys/queue.h> 72 #include <sys/socket.h> 73 #include <sys/socketvar.h> 74 #include <sys/protosw.h> 75 76 #include <net/if.h> 77 #include <net/if_var.h> 78 79 #include <netinet/in.h> 80 81 #include <stdio.h> 82 83 #define KERNEL 1 84 #include <netinet6/ip6_mroute.h> 85 #undef KERNEL 86 87 #include "netstat.h" 88 89 #define WID_ORG (lflag ? 39 : (nflag ? 29 : 18)) /* width of origin column */ 90 #define WID_GRP (lflag ? 18 : (nflag ? 16 : 18)) /* width of group column */ 91 92 extern char *routename6 __P((struct sockaddr_in6 *)); 93 94 void 95 mroute6pr(mfcaddr, mifaddr) 96 u_long mfcaddr, mifaddr; 97 { 98 struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp; 99 struct mif6 mif6table[MAXMIFS]; 100 struct mf6c mfc; 101 struct rtdetq rte, *rtep; 102 register struct mif6 *mifp; 103 register mifi_t mifi; 104 register int i; 105 register int banner_printed; 106 register int saved_nflag; 107 mifi_t maxmif = 0; 108 long int waitings; 109 110 if (mfcaddr == 0 || mifaddr == 0) { 111 printf("No IPv6 multicast routing compiled into this" 112 "system.\n"); 113 return; 114 } 115 116 saved_nflag = nflag; 117 nflag = 1; 118 119 kread(mifaddr, (char *)&mif6table, sizeof(mif6table)); 120 banner_printed = 0; 121 for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) { 122 struct ifnet ifnet; 123 char ifname[IFNAMSIZ]; 124 125 if (mifp->m6_ifp == NULL) 126 continue; 127 128 kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet)); 129 maxmif = mifi; 130 if (!banner_printed) { 131 printf("\nIPv6 Multicast Interface Table\n" 132 " Mif Rate PhyIF " 133 "Pkts-In Pkts-Out\n"); 134 banner_printed = 1; 135 } 136 137 printf(" %2u %4d", 138 mifi, mifp->m6_rate_limit); 139 printf(" %5s", (mifp->m6_flags & MIFF_REGISTER) ? 140 "reg0" : if_indextoname(ifnet.if_index, ifname)); 141 142 printf(" %9llu %9llu\n", (unsigned long long)mifp->m6_pkt_in, 143 (unsigned long long)mifp->m6_pkt_out); 144 } 145 if (!banner_printed) 146 printf("\nIPv6 Multicast Interface Table is empty\n"); 147 148 kread(mfcaddr, (char *)&mf6ctable, sizeof(mf6ctable)); 149 banner_printed = 0; 150 for (i = 0; i < MF6CTBLSIZ; ++i) { 151 mfcp = mf6ctable[i]; 152 while(mfcp) { 153 kread((u_long)mfcp, (char *)&mfc, sizeof(mfc)); 154 if (!banner_printed) { 155 printf ("\nIPv6 Multicast Forwarding Cache\n"); 156 printf(" %-*.*s %-*.*s %s", 157 WID_ORG, WID_ORG, "Origin", 158 WID_GRP, WID_GRP, "Group", 159 " Packets Waits In-Mif Out-Mifs\n"); 160 banner_printed = 1; 161 } 162 163 printf(" %-*.*s", WID_ORG, WID_ORG, 164 routename6(&mfc.mf6c_origin)); 165 printf(" %-*.*s", WID_GRP, WID_GRP, 166 routename6(&mfc.mf6c_mcastgrp)); 167 printf(" %9llu", (unsigned long long)mfc.mf6c_pkt_cnt); 168 169 for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) { 170 waitings++; 171 kread((u_long)rtep, (char *)&rte, sizeof(rte)); 172 rtep = rte.next; 173 } 174 printf(" %3ld", waitings); 175 176 if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT) 177 printf(" --- "); 178 else 179 printf(" %3d ", mfc.mf6c_parent); 180 for (mifi = 0; mifi <= maxmif; mifi++) { 181 if (IF_ISSET(mifi, &mfc.mf6c_ifset)) 182 printf(" %u", mifi); 183 } 184 printf("\n"); 185 186 mfcp = mfc.mf6c_next; 187 } 188 } 189 if (!banner_printed) 190 printf("\nIPv6 Multicast Routing Table is empty\n"); 191 192 printf("\n"); 193 nflag = saved_nflag; 194 } 195 196 void 197 mrt6_stats(mstaddr) 198 u_long mstaddr; 199 { 200 struct mrt6stat mrtstat; 201 202 if (mstaddr == 0) { 203 printf("No IPv6 multicast routing compiled into this" 204 "system.\n"); 205 return; 206 } 207 208 kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat)); 209 printf("IPv6 multicast forwarding:\n"); 210 printf(" %10llu multicast forwarding cache lookup%s\n", 211 (unsigned long long)mrtstat.mrt6s_mfc_lookups, 212 plural(mrtstat.mrt6s_mfc_lookups)); 213 printf(" %10llu multicast forwarding cache miss%s\n", 214 (unsigned long long)mrtstat.mrt6s_mfc_misses, 215 plurales(mrtstat.mrt6s_mfc_misses)); 216 printf(" %10llu upcall%s to mrouted\n", 217 (unsigned long long)mrtstat.mrt6s_upcalls, 218 plural(mrtstat.mrt6s_upcalls)); 219 printf(" %10llu upcall llueue overflow%s\n", 220 (unsigned long long)mrtstat.mrt6s_upq_ovflw, 221 plural(mrtstat.mrt6s_upq_ovflw)); 222 printf(" %10llu upcall%s dropped due to full socket buffer\n", 223 (unsigned long long)mrtstat.mrt6s_upq_sockfull, 224 plural(mrtstat.mrt6s_upq_sockfull)); 225 printf(" %10llu cache cleanup%s\n", 226 (unsigned long long)mrtstat.mrt6s_cache_cleanups, 227 plural(mrtstat.mrt6s_cache_cleanups)); 228 printf(" %10llu datagram%s with no route for origin\n", 229 (unsigned long long)mrtstat.mrt6s_no_route, 230 plural(mrtstat.mrt6s_no_route)); 231 printf(" %10llu datagram%s arrived with bad tunneling\n", 232 (unsigned long long)mrtstat.mrt6s_bad_tunnel, 233 plural(mrtstat.mrt6s_bad_tunnel)); 234 printf(" %10llu datagram%s could not be tunneled\n", 235 (unsigned long long)mrtstat.mrt6s_cant_tunnel, 236 plural(mrtstat.mrt6s_cant_tunnel)); 237 printf(" %10llu datagram%s arrived on wrong interface\n", 238 (unsigned long long)mrtstat.mrt6s_wrong_if, 239 plural(mrtstat.mrt6s_wrong_if)); 240 printf(" %10llu datagram%s selectively dropped\n", 241 (unsigned long long)mrtstat.mrt6s_drop_sel, 242 plural(mrtstat.mrt6s_drop_sel)); 243 printf(" %10llu datagram%s dropped due to llueue overflow\n", 244 (unsigned long long)mrtstat.mrt6s_q_overflow, 245 plural(mrtstat.mrt6s_q_overflow)); 246 printf(" %10llu datagram%s dropped for being too large\n", 247 (unsigned long long)mrtstat.mrt6s_pkt2large, 248 plural(mrtstat.mrt6s_pkt2large)); 249 } 250