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/sysctl.h> 78 #include <sys/protosw.h> 79 #include <sys/mbuf.h> 80 #include <sys/time.h> 81 82 #include <net/if.h> 83 #include <net/if_var.h> 84 #include <net/route.h> 85 86 #include <netinet/in.h> 87 88 #include <err.h> 89 #include <stdint.h> 90 #include <stdio.h> 91 #include <stdlib.h> 92 93 #define KERNEL 1 94 #include <netinet6/ip6_mroute.h> 95 #undef KERNEL 96 97 #include "netstat.h" 98 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 */ 101 102 void 103 mroute6pr(u_long mfcaddr, u_long mifaddr) 104 { 105 struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp; 106 struct mif6 mif6table[MAXMIFS]; 107 struct mf6c mfc; 108 struct rtdetq rte, *rtep; 109 struct mif6 *mifp; 110 mifi_t mifi; 111 int i; 112 int banner_printed; 113 int saved_numeric_addr; 114 mifi_t maxmif = 0; 115 long int waitings; 116 size_t len; 117 118 len = sizeof(mif6table); 119 if (live) { 120 if (sysctlbyname("net.inet6.ip6.mif6table", mif6table, &len, 121 NULL, 0) < 0) { 122 warn("sysctl: net.inet6.ip6.mif6table"); 123 return; 124 } 125 } else 126 kread(mifaddr, (char *)mif6table, sizeof(mif6table)); 127 128 saved_numeric_addr = numeric_addr; 129 numeric_addr = 1; 130 banner_printed = 0; 131 132 for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) { 133 struct ifnet ifnet; 134 char ifname[IFNAMSIZ]; 135 136 if (mifp->m6_ifp == NULL) 137 continue; 138 139 /* XXX KVM */ 140 kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet)); 141 142 maxmif = mifi; 143 if (!banner_printed) { 144 printf("\nIPv6 Multicast Interface Table\n" 145 " Mif Rate PhyIF " 146 "Pkts-In Pkts-Out\n"); 147 banner_printed = 1; 148 } 149 150 printf(" %2u %4d", 151 mifi, mifp->m6_rate_limit); 152 printf(" %5s", (mifp->m6_flags & MIFF_REGISTER) ? 153 "reg0" : if_indextoname(ifnet.if_index, ifname)); 154 155 printf(" %9ju %9ju\n", (uintmax_t)mifp->m6_pkt_in, 156 (uintmax_t)mifp->m6_pkt_out); 157 } 158 if (!banner_printed) 159 printf("\nIPv6 Multicast Interface Table is empty\n"); 160 161 len = sizeof(mf6ctable); 162 if (live) { 163 if (sysctlbyname("net.inet6.ip6.mf6ctable", mf6ctable, &len, 164 NULL, 0) < 0) { 165 warn("sysctl: net.inet6.ip6.mf6ctable"); 166 return; 167 } 168 } else 169 kread(mfcaddr, (char *)mf6ctable, sizeof(mf6ctable)); 170 171 banner_printed = 0; 172 173 for (i = 0; i < MF6CTBLSIZ; ++i) { 174 mfcp = mf6ctable[i]; 175 while(mfcp) { 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"); 183 banner_printed = 1; 184 } 185 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); 191 192 for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) { 193 waitings++; 194 /* XXX KVM */ 195 kread((u_long)rtep, (char *)&rte, sizeof(rte)); 196 rtep = rte.next; 197 } 198 printf(" %3ld", waitings); 199 200 if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT) 201 printf(" --- "); 202 else 203 printf(" %3d ", mfc.mf6c_parent); 204 for (mifi = 0; mifi <= maxmif; mifi++) { 205 if (IF_ISSET(mifi, &mfc.mf6c_ifset)) 206 printf(" %u", mifi); 207 } 208 printf("\n"); 209 210 mfcp = mfc.mf6c_next; 211 } 212 } 213 if (!banner_printed) 214 printf("\nIPv6 Multicast Forwarding Table is empty\n"); 215 216 printf("\n"); 217 numeric_addr = saved_numeric_addr; 218 } 219 220 void 221 mrt6_stats(u_long mstaddr) 222 { 223 struct mrt6stat mrtstat; 224 size_t len = sizeof mrtstat; 225 226 if (live) { 227 if (sysctlbyname("net.inet6.ip6.mrt6stat", &mrtstat, &len, 228 NULL, 0) < 0) { 229 warn("sysctl: net.inet6.ip6.mrt6stat"); 230 return; 231 } 232 } else 233 kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat)); 234 235 printf("IPv6 multicast forwarding:\n"); 236 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)) 241 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"); 254 p(mrt6s_q_overflow, 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"); 257 258 #undef p2 259 #undef p 260 } 261 #endif /*INET6*/ 262