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 <nlist.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 /* 100 * kvm(3) bindings for every needed symbol 101 */ 102 static struct nlist mrl[] = { 103 #define N_MF6CTABLE 0 104 { .n_name = "_mf6ctable" }, 105 #define N_MIF6TABLE 1 106 { .n_name = "_mif6table" }, 107 #define N_MRT6STAT 2 108 { .n_name = "_mrt6stat" }, 109 { .n_name = NULL }, 110 }; 111 112 113 #define WID_ORG (Wflag ? 39 : (numeric_addr ? 29 : 18)) /* width of origin column */ 114 #define WID_GRP (Wflag ? 18 : (numeric_addr ? 16 : 18)) /* width of group column */ 115 116 void 117 mroute6pr() 118 { 119 struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp; 120 struct mif6 mif6table[MAXMIFS]; 121 struct mf6c mfc; 122 struct rtdetq rte, *rtep; 123 struct mif6 *mifp; 124 u_long mfcaddr, mifaddr; 125 mifi_t mifi; 126 int i; 127 int banner_printed; 128 int saved_numeric_addr; 129 mifi_t maxmif = 0; 130 long int waitings; 131 size_t len; 132 133 kresolve_list(mrl); 134 mfcaddr = mrl[N_MF6CTABLE].n_value; 135 mifaddr = mrl[N_MIF6TABLE].n_value; 136 137 if (mfcaddr == 0 || mifaddr == 0) { 138 fprintf(stderr, "No IPv6 MROUTING kernel support.\n"); 139 return; 140 } 141 142 len = sizeof(mif6table); 143 if (live) { 144 if (sysctlbyname("net.inet6.ip6.mif6table", mif6table, &len, 145 NULL, 0) < 0) { 146 warn("sysctl: net.inet6.ip6.mif6table"); 147 return; 148 } 149 } else 150 kread(mifaddr, (char *)mif6table, sizeof(mif6table)); 151 152 saved_numeric_addr = numeric_addr; 153 numeric_addr = 1; 154 banner_printed = 0; 155 156 for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) { 157 struct ifnet ifnet; 158 char ifname[IFNAMSIZ]; 159 160 if (mifp->m6_ifp == NULL) 161 continue; 162 163 /* XXX KVM */ 164 kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet)); 165 166 maxmif = mifi; 167 if (!banner_printed) { 168 printf("\nIPv6 Multicast Interface Table\n" 169 " Mif Rate PhyIF " 170 "Pkts-In Pkts-Out\n"); 171 banner_printed = 1; 172 } 173 174 printf(" %2u %4d", 175 mifi, mifp->m6_rate_limit); 176 printf(" %5s", (mifp->m6_flags & MIFF_REGISTER) ? 177 "reg0" : if_indextoname(ifnet.if_index, ifname)); 178 179 printf(" %9ju %9ju\n", (uintmax_t)mifp->m6_pkt_in, 180 (uintmax_t)mifp->m6_pkt_out); 181 } 182 if (!banner_printed) 183 printf("\nIPv6 Multicast Interface Table is empty\n"); 184 185 len = sizeof(mf6ctable); 186 if (live) { 187 if (sysctlbyname("net.inet6.ip6.mf6ctable", mf6ctable, &len, 188 NULL, 0) < 0) { 189 warn("sysctl: net.inet6.ip6.mf6ctable"); 190 return; 191 } 192 } else 193 kread(mfcaddr, (char *)mf6ctable, sizeof(mf6ctable)); 194 195 banner_printed = 0; 196 197 for (i = 0; i < MF6CTBLSIZ; ++i) { 198 mfcp = mf6ctable[i]; 199 while(mfcp) { 200 kread((u_long)mfcp, (char *)&mfc, sizeof(mfc)); 201 if (!banner_printed) { 202 printf ("\nIPv6 Multicast Forwarding Cache\n"); 203 printf(" %-*.*s %-*.*s %s", 204 WID_ORG, WID_ORG, "Origin", 205 WID_GRP, WID_GRP, "Group", 206 " Packets Waits In-Mif Out-Mifs\n"); 207 banner_printed = 1; 208 } 209 210 printf(" %-*.*s", WID_ORG, WID_ORG, 211 routename6(&mfc.mf6c_origin)); 212 printf(" %-*.*s", WID_GRP, WID_GRP, 213 routename6(&mfc.mf6c_mcastgrp)); 214 printf(" %9ju", (uintmax_t)mfc.mf6c_pkt_cnt); 215 216 for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) { 217 waitings++; 218 /* XXX KVM */ 219 kread((u_long)rtep, (char *)&rte, sizeof(rte)); 220 rtep = rte.next; 221 } 222 printf(" %3ld", waitings); 223 224 if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT) 225 printf(" --- "); 226 else 227 printf(" %3d ", mfc.mf6c_parent); 228 for (mifi = 0; mifi <= maxmif; mifi++) { 229 if (IF_ISSET(mifi, &mfc.mf6c_ifset)) 230 printf(" %u", mifi); 231 } 232 printf("\n"); 233 234 mfcp = mfc.mf6c_next; 235 } 236 } 237 if (!banner_printed) 238 printf("\nIPv6 Multicast Forwarding Table is empty\n"); 239 240 printf("\n"); 241 numeric_addr = saved_numeric_addr; 242 } 243 244 void 245 mrt6_stats() 246 { 247 struct mrt6stat mrtstat; 248 u_long mstaddr; 249 size_t len = sizeof mrtstat; 250 251 kresolve_list(mrl); 252 mstaddr = mrl[N_MRT6STAT].n_value; 253 254 if (mstaddr == 0) { 255 fprintf(stderr, "No IPv6 MROUTING kernel support.\n"); 256 return; 257 } 258 259 if (live) { 260 if (sysctlbyname("net.inet6.ip6.mrt6stat", &mrtstat, &len, 261 NULL, 0) < 0) { 262 warn("sysctl: net.inet6.ip6.mrt6stat"); 263 return; 264 } 265 } else 266 kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat)); 267 268 printf("IPv6 multicast forwarding:\n"); 269 270 #define p(f, m) if (mrtstat.f || sflag <= 1) \ 271 printf(m, (uintmax_t)mrtstat.f, plural(mrtstat.f)) 272 #define p2(f, m) if (mrtstat.f || sflag <= 1) \ 273 printf(m, (uintmax_t)mrtstat.f, plurales(mrtstat.f)) 274 275 p(mrt6s_mfc_lookups, "\t%ju multicast forwarding cache lookup%s\n"); 276 p2(mrt6s_mfc_misses, "\t%ju multicast forwarding cache miss%s\n"); 277 p(mrt6s_upcalls, "\t%ju upcall%s to multicast routing daemon\n"); 278 p(mrt6s_upq_ovflw, "\t%ju upcall queue overflow%s\n"); 279 p(mrt6s_upq_sockfull, 280 "\t%ju upcall%s dropped due to full socket buffer\n"); 281 p(mrt6s_cache_cleanups, "\t%ju cache cleanup%s\n"); 282 p(mrt6s_no_route, "\t%ju datagram%s with no route for origin\n"); 283 p(mrt6s_bad_tunnel, "\t%ju datagram%s arrived with bad tunneling\n"); 284 p(mrt6s_cant_tunnel, "\t%ju datagram%s could not be tunneled\n"); 285 p(mrt6s_wrong_if, "\t%ju datagram%s arrived on wrong interface\n"); 286 p(mrt6s_drop_sel, "\t%ju datagram%s selectively dropped\n"); 287 p(mrt6s_q_overflow, 288 "\t%ju datagram%s dropped due to queue overflow\n"); 289 p(mrt6s_pkt2large, "\t%ju datagram%s dropped for being too large\n"); 290 291 #undef p2 292 #undef p 293 } 294 #endif /*INET6*/ 295