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