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$"); 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 97 void 98 mroute6pr(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 /* XXX: sysctl not yet implemented for mif6table. */ 113 if (mfcaddr == 0 || mifaddr == 0) { 114 printf("No IPv6 multicast forwarding configured in the " 115 "running system.\n"); 116 return; 117 } 118 119 saved_numeric_addr = numeric_addr; 120 numeric_addr = 1; 121 122 kread(mifaddr, (char *)&mif6table, sizeof(mif6table)); 123 banner_printed = 0; 124 for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) { 125 struct ifnet ifnet; 126 char ifname[IFNAMSIZ]; 127 128 if (mifp->m6_ifp == NULL) 129 continue; 130 131 kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet)); 132 maxmif = mifi; 133 if (!banner_printed) { 134 printf("\nIPv6 Multicast Interface Table\n" 135 " Mif Rate PhyIF " 136 "Pkts-In Pkts-Out\n"); 137 banner_printed = 1; 138 } 139 140 printf(" %2u %4d", 141 mifi, mifp->m6_rate_limit); 142 printf(" %5s", (mifp->m6_flags & MIFF_REGISTER) ? 143 "reg0" : if_indextoname(ifnet.if_index, ifname)); 144 145 printf(" %9ju %9ju\n", (uintmax_t)mifp->m6_pkt_in, 146 (uintmax_t)mifp->m6_pkt_out); 147 } 148 if (!banner_printed) 149 printf("\nIPv6 Multicast Interface Table is empty\n"); 150 151 /* XXX: sysctl not yet implemented for mf6ctable. */ 152 kread(mfcaddr, (char *)&mf6ctable, sizeof(mf6ctable)); 153 banner_printed = 0; 154 for (i = 0; i < MF6CTBLSIZ; ++i) { 155 mfcp = mf6ctable[i]; 156 while(mfcp) { 157 kread((u_long)mfcp, (char *)&mfc, sizeof(mfc)); 158 if (!banner_printed) { 159 printf ("\nIPv6 Multicast Forwarding Cache\n"); 160 printf(" %-*.*s %-*.*s %s", 161 WID_ORG, WID_ORG, "Origin", 162 WID_GRP, WID_GRP, "Group", 163 " Packets Waits In-Mif Out-Mifs\n"); 164 banner_printed = 1; 165 } 166 167 printf(" %-*.*s", WID_ORG, WID_ORG, 168 routename6(&mfc.mf6c_origin)); 169 printf(" %-*.*s", WID_GRP, WID_GRP, 170 routename6(&mfc.mf6c_mcastgrp)); 171 printf(" %9ju", (uintmax_t)mfc.mf6c_pkt_cnt); 172 173 for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) { 174 waitings++; 175 kread((u_long)rtep, (char *)&rte, sizeof(rte)); 176 rtep = rte.next; 177 } 178 printf(" %3ld", waitings); 179 180 if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT) 181 printf(" --- "); 182 else 183 printf(" %3d ", mfc.mf6c_parent); 184 for (mifi = 0; mifi <= maxmif; mifi++) { 185 if (IF_ISSET(mifi, &mfc.mf6c_ifset)) 186 printf(" %u", mifi); 187 } 188 printf("\n"); 189 190 mfcp = mfc.mf6c_next; 191 } 192 } 193 if (!banner_printed) 194 printf("\nIPv6 Multicast Routing Table is empty\n"); 195 196 printf("\n"); 197 numeric_addr = saved_numeric_addr; 198 } 199 200 void 201 mrt6_stats(u_long mstaddr) 202 { 203 struct mrt6stat mrtstat; 204 205 /* XXX: sysctl not yet implemented for mrt6stat. */ 206 if (mstaddr == 0) { 207 printf("No IPv6 multicast forwarding configured in the " 208 "running system.\n"); 209 return; 210 } 211 212 kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat)); 213 printf("IPv6 multicast forwarding:\n"); 214 215 #define p(f, m) if (mrtstat.f || sflag <= 1) \ 216 printf(m, (uintmax_t)mrtstat.f, plural(mrtstat.f)) 217 #define p2(f, m) if (mrtstat.f || sflag <= 1) \ 218 printf(m, (uintmax_t)mrtstat.f, plurales(mrtstat.f)) 219 220 p(mrt6s_mfc_lookups, "\t%ju multicast forwarding cache lookup%s\n"); 221 p2(mrt6s_mfc_misses, "\t%ju multicast forwarding cache miss%s\n"); 222 p(mrt6s_upcalls, "\t%ju upcall%s to multicast routing daemon\n"); 223 p(mrt6s_upq_ovflw, "\t%ju upcall queue overflow%s\n"); 224 p(mrt6s_upq_sockfull, 225 "\t%ju upcall%s dropped due to full socket buffer\n"); 226 p(mrt6s_cache_cleanups, "\t%ju cache cleanup%s\n"); 227 p(mrt6s_no_route, "\t%ju datagram%s with no route for origin\n"); 228 p(mrt6s_bad_tunnel, "\t%ju datagram%s arrived with bad tunneling\n"); 229 p(mrt6s_cant_tunnel, "\t%ju datagram%s could not be tunneled\n"); 230 p(mrt6s_wrong_if, "\t%ju datagram%s arrived on wrong interface\n"); 231 p(mrt6s_drop_sel, "\t%ju datagram%s selectively dropped\n"); 232 p(mrt6s_q_overflow, 233 "\t%ju datagram%s dropped due to queue overflow\n"); 234 p(mrt6s_pkt2large, "\t%ju datagram%s dropped for being too large\n"); 235 236 #undef p2 237 #undef p 238 } 239 #endif /*INET6*/ 240