1 /* $OpenBSD: mroute6.c,v 1.24 2018/06/04 19:20:12 kn 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) 1989 Stephen Deering 34 * Copyright (c) 1992, 1993 35 * The Regents of the University of California. All rights reserved. 36 * 37 * This code is derived from software contributed to Berkeley by 38 * Stephen Deering of Stanford University. 39 * 40 * Redistribution and use in source and binary forms, with or without 41 * modification, are permitted provided that the following conditions 42 * are met: 43 * 1. Redistributions of source code must retain the above copyright 44 * notice, this list of conditions and the following disclaimer. 45 * 2. Redistributions in binary form must reproduce the above copyright 46 * notice, this list of conditions and the following disclaimer in the 47 * documentation and/or other materials provided with the distribution. 48 * 3. Neither the name of the University nor the names of its contributors 49 * may be used to endorse or promote products derived from this software 50 * without specific prior written permission. 51 * 52 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 53 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 54 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 55 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 56 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 57 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 58 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 59 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 60 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 61 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 62 * SUCH DAMAGE. 63 * 64 * @(#)mroute.c 8.2 (Berkeley) 4/28/95 65 */ 66 67 #include <sys/types.h> 68 #include <sys/select.h> 69 #include <sys/socket.h> 70 #include <sys/sysctl.h> 71 72 #include <net/if.h> 73 #include <netinet/in.h> 74 #include <netinet6/ip6_mroute.h> 75 76 #include <err.h> 77 #include <errno.h> 78 #include <stdio.h> 79 #include <stdlib.h> 80 #include <util.h> 81 #include "netstat.h" 82 83 #define WID_ORG (lflag ? 39 : (nflag ? 29 : 18)) /* width of origin column */ 84 #define WID_GRP (lflag ? 18 : (nflag ? 16 : 18)) /* width of group column */ 85 86 void 87 mroute6pr(void) 88 { 89 char *buf = NULL; 90 char fmtbuf[FMT_SCALED_STRSIZE]; 91 struct mf6cinfo *mfc; 92 struct mif6info *mif; 93 size_t needed, mifi, nummifs, mfci, nummfcs; 94 int banner_printed, saved_nflag; 95 u_int mrtproto; 96 int mib[] = { CTL_NET, PF_INET6, IPPROTO_IPV6, IPV6CTL_MRTPROTO }; 97 size_t len = sizeof(int); 98 99 if (sysctl(mib, sizeof(mib) / sizeof(mib[0]), 100 &mrtproto, &len, NULL, 0) == -1) { 101 if (errno != ENOPROTOOPT) 102 warn("mroute"); 103 return; 104 } 105 switch (mrtproto) { 106 case 0: 107 break; 108 default: 109 printf("IPv6 multicast routing protocol %u, unknown\n", 110 mrtproto); 111 return; 112 } 113 114 saved_nflag = nflag; 115 nflag = 1; 116 117 mib[3] = IPV6CTL_MRTMIF; 118 needed = get_sysctl(mib, sizeof(mib) / sizeof(mib[0]), &buf); 119 nummifs = needed / sizeof(*mif); 120 mif = (struct mif6info *)buf; 121 122 banner_printed = 0; 123 for (mifi = 0; mifi < nummifs; ++mifi, ++mif) { 124 char ifname[IFNAMSIZ]; 125 126 if (mif->m6_ifindex == 0) 127 continue; 128 129 if (!banner_printed) { 130 printf("\nIPv6 Multicast Interface Table\n" 131 " Mif Rate PhyIF " 132 "Pkts-In Pkts-Out\n"); 133 banner_printed = 1; 134 } 135 136 printf(" %2u %4d", 137 mif->m6_mifi, mif->m6_rate_limit); 138 printf(" %5s", (mif->m6_flags & MIFF_REGISTER) ? 139 "reg0" : if_indextoname(mif->m6_ifindex, ifname)); 140 141 printf(" %9llu %9llu\n", mif->m6_pkt_in, mif->m6_pkt_out); 142 } 143 if (!banner_printed) 144 printf("IPv6 Multicast Interface Table is empty\n"); 145 146 mib[3] = IPV6CTL_MRTMFC; 147 needed = get_sysctl(mib, sizeof(mib) / sizeof(mib[0]), &buf); 148 nummfcs = needed / sizeof(*mfc); 149 mfc = (struct mf6cinfo *)buf; 150 151 banner_printed = 0; 152 for (mfci = 0; mfci < nummfcs; ++mfci, ++mfc) { 153 if (!banner_printed) { 154 printf("\nIPv6 Multicast Forwarding Cache\n"); 155 printf(" %-*.*s %-*.*s %s", 156 WID_ORG, WID_ORG, "Origin", 157 WID_GRP, WID_GRP, "Group", 158 " Packets Waits In-Mif Out-Mifs\n"); 159 banner_printed = 1; 160 } 161 162 printf(" %-*.*s", WID_ORG, WID_ORG, 163 routename6(&mfc->mf6c_origin)); 164 printf(" %-*.*s", WID_GRP, WID_GRP, 165 routename6(&mfc->mf6c_mcastgrp)); 166 fmt_scaled(mfc->mf6c_pkt_cnt, fmtbuf); 167 printf(" %9s", fmtbuf); 168 169 printf(" %3llu", mfc->mf6c_stall_cnt); 170 171 if (mfc->mf6c_parent == MF6C_INCOMPLETE_PARENT) 172 printf(" --- "); 173 else 174 printf(" %3d ", mfc->mf6c_parent); 175 for (mifi = 0; mifi <= MAXMIFS; mifi++) { 176 if (IF_ISSET(mifi, &mfc->mf6c_ifset)) 177 printf(" %zu", mifi); 178 } 179 printf("\n"); 180 } 181 if (!banner_printed) 182 printf("IPv6 Multicast Routing Table is empty"); 183 184 printf("\n"); 185 nflag = saved_nflag; 186 187 free(buf); 188 } 189 190 void 191 mrt6_stats(void) 192 { 193 struct mrt6stat mrt6stat; 194 u_int mrt6proto; 195 int mib[] = { CTL_NET, PF_INET6, IPPROTO_IPV6, IPV6CTL_MRTPROTO }; 196 int mib2[] = { CTL_NET, PF_INET6, IPPROTO_IPV6, IPV6CTL_MRTSTATS }; 197 size_t len = sizeof(int); 198 199 if (sysctl(mib, sizeof(mib) / sizeof(mib[0]), 200 &mrt6proto, &len, NULL, 0) == -1) { 201 if (errno != ENOPROTOOPT) 202 warn("mroute"); 203 return; 204 } 205 switch (mrt6proto) { 206 case 0: 207 printf("no IPv6 multicast routing compiled into this system\n"); 208 return; 209 default: 210 printf("IPv6 multicast routing protocol %u, unknown\n", 211 mrt6proto); 212 return; 213 } 214 215 len = sizeof(mrt6stat); 216 if (sysctl(mib2, sizeof(mib2) / sizeof(mib2[0]), 217 &mrt6stat, &len, NULL, 0) == -1) { 218 if (errno != ENOPROTOOPT) 219 warn("mroute"); 220 return; 221 } 222 223 printf("multicast forwarding:\n"); 224 printf("\t%llu multicast forwarding cache lookup%s\n", 225 mrt6stat.mrt6s_mfc_lookups, plural(mrt6stat.mrt6s_mfc_lookups)); 226 printf("\t%llu multicast forwarding cache miss%s\n", 227 mrt6stat.mrt6s_mfc_misses, plurales(mrt6stat.mrt6s_mfc_misses)); 228 printf("\t%llu upcall%s to mrouted\n", 229 mrt6stat.mrt6s_upcalls, plural(mrt6stat.mrt6s_upcalls)); 230 printf("\t%llu upcall queue overflow%s\n", 231 mrt6stat.mrt6s_upq_ovflw, plural(mrt6stat.mrt6s_upq_ovflw)); 232 printf("\t%llu upcall%s dropped due to full socket buffer\n", 233 mrt6stat.mrt6s_upq_sockfull, plural(mrt6stat.mrt6s_upq_sockfull)); 234 printf("\t%llu cache cleanup%s\n", 235 mrt6stat.mrt6s_cache_cleanups, plural(mrt6stat.mrt6s_cache_cleanups)); 236 printf("\t%llu datagram%s with no route for origin\n", 237 mrt6stat.mrt6s_no_route, plural(mrt6stat.mrt6s_no_route)); 238 printf("\t%llu datagram%s arrived with bad tunneling\n", 239 mrt6stat.mrt6s_bad_tunnel, plural(mrt6stat.mrt6s_bad_tunnel)); 240 printf("\t%llu datagram%s could not be tunneled\n", 241 mrt6stat.mrt6s_cant_tunnel, plural(mrt6stat.mrt6s_cant_tunnel)); 242 printf("\t%llu datagram%s arrived on wrong interface\n", 243 mrt6stat.mrt6s_wrong_if, plural(mrt6stat.mrt6s_wrong_if)); 244 printf("\t%llu datagram%s selectively dropped\n", 245 mrt6stat.mrt6s_drop_sel, plural(mrt6stat.mrt6s_drop_sel)); 246 printf("\t%llu datagram%s dropped due to queue overflow\n", 247 mrt6stat.mrt6s_q_overflow, plural(mrt6stat.mrt6s_q_overflow)); 248 printf("\t%llu datagram%s dropped for being too large\n", 249 mrt6stat.mrt6s_pkt2large, plural(mrt6stat.mrt6s_pkt2large)); 250 } 251