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