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 * Copyright (c) 1989 Stephen Deering 31 * Copyright (c) 1992, 1993 32 * The Regents of the University of California. All rights reserved. 33 * 34 * This code is derived from software contributed to Berkeley by 35 * Stephen Deering of Stanford University. 36 * 37 * Redistribution and use in source and binary forms, with or without 38 * modification, are permitted provided that the following conditions 39 * are met: 40 * 1. Redistributions of source code must retain the above copyright 41 * notice, this list of conditions and the following disclaimer. 42 * 2. Redistributions in binary form must reproduce the above copyright 43 * notice, this list of conditions and the following disclaimer in the 44 * documentation and/or other materials provided with the distribution. 45 * 3. All advertising materials mentioning features or use of this software 46 * must display the following acknowledgement: 47 * This product includes software developed by the University of 48 * California, Berkeley and its contributors. 49 * 4. Neither the name of the University nor the names of its contributors 50 * may be used to endorse or promote products derived from this software 51 * without specific prior written permission. 52 * 53 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 54 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 55 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 56 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 57 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 58 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 59 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 60 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 61 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 62 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 63 * SUCH DAMAGE. 64 * 65 * @(#)mroute.c 8.2 (Berkeley) 4/28/95 66 */ 67 68 #include <sys/cdefs.h> 69 __FBSDID("$FreeBSD$"); 70 71 #ifdef INET6 72 #include <sys/param.h> 73 #include <sys/queue.h> 74 #include <sys/socket.h> 75 #include <sys/socketvar.h> 76 #include <sys/sysctl.h> 77 #include <sys/protosw.h> 78 #include <sys/mbuf.h> 79 #include <sys/time.h> 80 81 #include <net/if.h> 82 #include <net/if_var.h> 83 #include <net/route.h> 84 85 #include <netinet/in.h> 86 87 #include <err.h> 88 #include <stdint.h> 89 #include <stdio.h> 90 #include <stdlib.h> 91 92 #define KERNEL 1 93 #include <netinet6/ip6_mroute.h> 94 #undef KERNEL 95 96 #include "netstat.h" 97 98 #define WID_ORG (Wflag ? 39 : (numeric_addr ? 29 : 18)) /* width of origin column */ 99 #define WID_GRP (Wflag ? 18 : (numeric_addr ? 16 : 18)) /* width of group column */ 100 101 void 102 mroute6pr(u_long mfcaddr, u_long mifaddr) 103 { 104 struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp; 105 struct mif6 mif6table[MAXMIFS]; 106 struct mf6c mfc; 107 struct rtdetq rte, *rtep; 108 struct mif6 *mifp; 109 mifi_t mifi; 110 int i; 111 int banner_printed; 112 int saved_numeric_addr; 113 mifi_t maxmif = 0; 114 long int waitings; 115 size_t len; 116 117 len = sizeof(mif6table); 118 if (live) { 119 if (sysctlbyname("net.inet6.ip6.mif6table", mif6table, &len, 120 NULL, 0) < 0) { 121 warn("sysctl: net.inet6.ip6.mif6table"); 122 return; 123 } 124 } else 125 kread(mifaddr, (char *)mif6table, sizeof(mif6table)); 126 127 saved_numeric_addr = numeric_addr; 128 numeric_addr = 1; 129 banner_printed = 0; 130 131 for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) { 132 struct ifnet ifnet; 133 char ifname[IFNAMSIZ]; 134 135 if (mifp->m6_ifp == NULL) 136 continue; 137 138 /* XXX KVM */ 139 kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet)); 140 141 maxmif = mifi; 142 if (!banner_printed) { 143 printf("\nIPv6 Multicast Interface Table\n" 144 " Mif Rate PhyIF " 145 "Pkts-In Pkts-Out\n"); 146 banner_printed = 1; 147 } 148 149 printf(" %2u %4d", 150 mifi, mifp->m6_rate_limit); 151 printf(" %5s", (mifp->m6_flags & MIFF_REGISTER) ? 152 "reg0" : if_indextoname(ifnet.if_index, ifname)); 153 154 printf(" %9ju %9ju\n", (uintmax_t)mifp->m6_pkt_in, 155 (uintmax_t)mifp->m6_pkt_out); 156 } 157 if (!banner_printed) 158 printf("\nIPv6 Multicast Interface Table is empty\n"); 159 160 len = sizeof(mf6ctable); 161 if (live) { 162 if (sysctlbyname("net.inet6.ip6.mf6ctable", mf6ctable, &len, 163 NULL, 0) < 0) { 164 warn("sysctl: net.inet6.ip6.mf6ctable"); 165 return; 166 } 167 } else 168 kread(mfcaddr, (char *)mf6ctable, sizeof(mf6ctable)); 169 170 banner_printed = 0; 171 172 for (i = 0; i < MF6CTBLSIZ; ++i) { 173 mfcp = mf6ctable[i]; 174 while(mfcp) { 175 kread((u_long)mfcp, (char *)&mfc, sizeof(mfc)); 176 if (!banner_printed) { 177 printf ("\nIPv6 Multicast Forwarding Cache\n"); 178 printf(" %-*.*s %-*.*s %s", 179 WID_ORG, WID_ORG, "Origin", 180 WID_GRP, WID_GRP, "Group", 181 " Packets Waits In-Mif Out-Mifs\n"); 182 banner_printed = 1; 183 } 184 185 printf(" %-*.*s", WID_ORG, WID_ORG, 186 routename6(&mfc.mf6c_origin)); 187 printf(" %-*.*s", WID_GRP, WID_GRP, 188 routename6(&mfc.mf6c_mcastgrp)); 189 printf(" %9ju", (uintmax_t)mfc.mf6c_pkt_cnt); 190 191 for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) { 192 waitings++; 193 /* XXX KVM */ 194 kread((u_long)rtep, (char *)&rte, sizeof(rte)); 195 rtep = rte.next; 196 } 197 printf(" %3ld", waitings); 198 199 if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT) 200 printf(" --- "); 201 else 202 printf(" %3d ", mfc.mf6c_parent); 203 for (mifi = 0; mifi <= maxmif; mifi++) { 204 if (IF_ISSET(mifi, &mfc.mf6c_ifset)) 205 printf(" %u", mifi); 206 } 207 printf("\n"); 208 209 mfcp = mfc.mf6c_next; 210 } 211 } 212 if (!banner_printed) 213 printf("\nIPv6 Multicast Forwarding Table is empty\n"); 214 215 printf("\n"); 216 numeric_addr = saved_numeric_addr; 217 } 218 219 void 220 mrt6_stats(u_long mstaddr) 221 { 222 struct mrt6stat mrtstat; 223 size_t len = sizeof mrtstat; 224 225 if (live) { 226 if (sysctlbyname("net.inet6.ip6.mrt6stat", &mrtstat, &len, 227 NULL, 0) < 0) { 228 warn("sysctl: net.inet6.ip6.mrt6stat"); 229 return; 230 } 231 } else 232 kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat)); 233 234 printf("IPv6 multicast forwarding:\n"); 235 236 #define p(f, m) if (mrtstat.f || sflag <= 1) \ 237 printf(m, (uintmax_t)mrtstat.f, plural(mrtstat.f)) 238 #define p2(f, m) if (mrtstat.f || sflag <= 1) \ 239 printf(m, (uintmax_t)mrtstat.f, plurales(mrtstat.f)) 240 241 p(mrt6s_mfc_lookups, "\t%ju multicast forwarding cache lookup%s\n"); 242 p2(mrt6s_mfc_misses, "\t%ju multicast forwarding cache miss%s\n"); 243 p(mrt6s_upcalls, "\t%ju upcall%s to multicast routing daemon\n"); 244 p(mrt6s_upq_ovflw, "\t%ju upcall queue overflow%s\n"); 245 p(mrt6s_upq_sockfull, 246 "\t%ju upcall%s dropped due to full socket buffer\n"); 247 p(mrt6s_cache_cleanups, "\t%ju cache cleanup%s\n"); 248 p(mrt6s_no_route, "\t%ju datagram%s with no route for origin\n"); 249 p(mrt6s_bad_tunnel, "\t%ju datagram%s arrived with bad tunneling\n"); 250 p(mrt6s_cant_tunnel, "\t%ju datagram%s could not be tunneled\n"); 251 p(mrt6s_wrong_if, "\t%ju datagram%s arrived on wrong interface\n"); 252 p(mrt6s_drop_sel, "\t%ju datagram%s selectively dropped\n"); 253 p(mrt6s_q_overflow, 254 "\t%ju datagram%s dropped due to queue overflow\n"); 255 p(mrt6s_pkt2large, "\t%ju datagram%s dropped for being too large\n"); 256 257 #undef p2 258 #undef p 259 } 260 #endif /*INET6*/ 261