mroute6.c revision 330897
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 * @(#)mroute.c 8.2 (Berkeley) 4/28/95 68 */ 69 70#include <sys/cdefs.h> 71__FBSDID("$FreeBSD: stable/11/usr.bin/netstat/mroute6.c 330897 2018-03-14 03:19:51Z eadler $"); 72 73#ifdef INET6 74#include <sys/param.h> 75#include <sys/queue.h> 76#include <sys/socket.h> 77#include <sys/socketvar.h> 78#include <sys/sysctl.h> 79#include <sys/protosw.h> 80#include <sys/mbuf.h> 81#include <sys/time.h> 82 83#include <net/if.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#include <stdbool.h> 93#include <libxo/xo.h> 94 95#define KERNEL 1 96#include <netinet6/ip6_mroute.h> 97#undef KERNEL 98 99#include "netstat.h" 100 101#define WID_ORG (Wflag ? 39 : (numeric_addr ? 29 : 18)) /* width of origin column */ 102#define WID_GRP (Wflag ? 18 : (numeric_addr ? 16 : 18)) /* width of group column */ 103 104void 105mroute6pr() 106{ 107 struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp; 108 struct mif6_sctl mif6table[MAXMIFS]; 109 struct mf6c mfc; 110 struct rtdetq rte, *rtep; 111 struct mif6_sctl *mifp; 112 mifi_t mifi; 113 int i; 114 int banner_printed; 115 int saved_numeric_addr; 116 mifi_t maxmif = 0; 117 long int waitings; 118 size_t len; 119 120 if (live == 0) 121 return; 122 123 len = sizeof(mif6table); 124 if (sysctlbyname("net.inet6.ip6.mif6table", mif6table, &len, NULL, 0) < 125 0) { 126 xo_warn("sysctl: net.inet6.ip6.mif6table"); 127 return; 128 } 129 130 saved_numeric_addr = numeric_addr; 131 numeric_addr = 1; 132 banner_printed = 0; 133 134 for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) { 135 char ifname[IFNAMSIZ]; 136 137 if (mifp->m6_ifp == 0) 138 continue; 139 140 maxmif = mifi; 141 if (!banner_printed) { 142 xo_open_list("multicast-interface"); 143 xo_emit("\n{T:IPv6 Multicast Interface Table}\n" 144 "{T: Mif Rate PhyIF Pkts-In Pkts-Out}\n"); 145 banner_printed = 1; 146 } 147 148 xo_open_instance("multicast-interface"); 149 xo_emit(" {:mif/%2u} {:rate-limit/%4d}", 150 mifi, mifp->m6_rate_limit); 151 xo_emit(" {:ifname/%5s}", (mifp->m6_flags & MIFF_REGISTER) ? 152 "reg0" : if_indextoname(mifp->m6_ifp, ifname)); 153 154 xo_emit(" {:received-packets/%9ju} {:sent-packets/%9ju}\n", 155 (uintmax_t)mifp->m6_pkt_in, 156 (uintmax_t)mifp->m6_pkt_out); 157 xo_close_instance("multicast-interface"); 158 } 159 if (banner_printed) 160 xo_open_list("multicast-interface"); 161 else 162 xo_emit("\n{T:IPv6 Multicast Interface Table is empty}\n"); 163 164 len = sizeof(mf6ctable); 165 if (sysctlbyname("net.inet6.ip6.mf6ctable", mf6ctable, &len, NULL, 0) < 166 0) { 167 xo_warn("sysctl: net.inet6.ip6.mf6ctable"); 168 return; 169 } 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 xo_open_list("multicast-forwarding-cache"); 179 xo_emit("\n" 180 "{T:IPv6 Multicast Forwarding Cache}\n"); 181 xo_emit(" {T:%-*.*s} {T:%-*.*s} {T:%s}", 182 WID_ORG, WID_ORG, "Origin", 183 WID_GRP, WID_GRP, "Group", 184 " Packets Waits In-Mif Out-Mifs\n"); 185 banner_printed = 1; 186 } 187 188 xo_open_instance("multicast-forwarding-cache"); 189 190 xo_emit(" {:origin/%-*.*s}", WID_ORG, WID_ORG, 191 routename(sin6tosa(&mfc.mf6c_origin), 192 numeric_addr)); 193 xo_emit(" {:group/%-*.*s}", WID_GRP, WID_GRP, 194 routename(sin6tosa(&mfc.mf6c_mcastgrp), 195 numeric_addr)); 196 xo_emit(" {:total-packets/%9ju}", 197 (uintmax_t)mfc.mf6c_pkt_cnt); 198 199 for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) { 200 waitings++; 201 /* XXX KVM */ 202 kread((u_long)rtep, (char *)&rte, sizeof(rte)); 203 rtep = rte.next; 204 } 205 xo_emit(" {:waitings/%3ld}", waitings); 206 207 if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT) 208 xo_emit(" --- "); 209 else 210 xo_emit(" {:parent/%3d} ", mfc.mf6c_parent); 211 xo_open_list("mif"); 212 for (mifi = 0; mifi <= maxmif; mifi++) { 213 if (IF_ISSET(mifi, &mfc.mf6c_ifset)) 214 xo_emit(" {l:%u}", mifi); 215 } 216 xo_close_list("mif"); 217 xo_emit("\n"); 218 219 mfcp = mfc.mf6c_next; 220 xo_close_instance("multicast-forwarding-cache"); 221 } 222 } 223 if (banner_printed) 224 xo_close_list("multicast-forwarding-cache"); 225 else 226 xo_emit("\n{T:IPv6 Multicast Forwarding Table is empty}\n"); 227 228 xo_emit("\n"); 229 numeric_addr = saved_numeric_addr; 230} 231 232void 233mrt6_stats() 234{ 235 struct mrt6stat mrtstat; 236 237 if (fetch_stats("net.inet6.ip6.mrt6stat", 0, &mrtstat, 238 sizeof(mrtstat), kread_counters) != 0) 239 return; 240 241 xo_open_container("multicast-statistics"); 242 xo_emit("{T:IPv6 multicast forwarding}:\n"); 243 244#define p(f, m) if (mrtstat.f || sflag <= 1) \ 245 xo_emit(m, (uintmax_t)mrtstat.f, plural(mrtstat.f)) 246#define p2(f, m) if (mrtstat.f || sflag <= 1) \ 247 xo_emit(m, (uintmax_t)mrtstat.f, plurales(mrtstat.f)) 248 249 p(mrt6s_mfc_lookups, "\t{:cache-lookups/%ju} " 250 "{N:/multicast forwarding cache lookup%s}\n"); 251 p2(mrt6s_mfc_misses, "\t{:cache-misses/%ju} " 252 "{N:/multicast forwarding cache miss%s}\n"); 253 p(mrt6s_upcalls, "\t{:upcalls/%ju} " 254 "{N:/upcall%s to multicast routing daemon}\n"); 255 p(mrt6s_upq_ovflw, "\t{:upcall-overflows/%ju} " 256 "{N:/upcall queue overflow%s}\n"); 257 p(mrt6s_upq_sockfull, "\t{:upcalls-dropped-full-buffer/%ju} " 258 "{N:/upcall%s dropped due to full socket buffer}\n"); 259 p(mrt6s_cache_cleanups, "\t{:cache-cleanups/%ju} " 260 "{N:/cache cleanup%s}\n"); 261 p(mrt6s_no_route, "\t{:dropped-no-origin/%ju} " 262 "{N:/datagram%s with no route for origin}\n"); 263 p(mrt6s_bad_tunnel, "\t{:dropped-bad-tunnel/%ju} " 264 "{N:/datagram%s arrived with bad tunneling}\n"); 265 p(mrt6s_cant_tunnel, "\t{:dropped-could-not-tunnel/%ju} " 266 "{N:/datagram%s could not be tunneled}\n"); 267 p(mrt6s_wrong_if, "\t{:dropped-wrong-incoming-interface/%ju} " 268 "{N:/datagram%s arrived on wrong interface}\n"); 269 p(mrt6s_drop_sel, "\t{:dropped-selectively/%ju} " 270 "{N:/datagram%s selectively dropped}\n"); 271 p(mrt6s_q_overflow, "\t{:dropped-queue-overflow/%ju} " 272 "{N:/datagram%s dropped due to queue overflow}\n"); 273 p(mrt6s_pkt2large, "\t{:dropped-too-large/%ju} " 274 "{N:/datagram%s dropped for being too large}\n"); 275 276#undef p2 277#undef p 278 xo_close_container("multicast-statistics"); 279} 280#endif /*INET6*/ 281