mroute.c revision 1.17
1 /* $NetBSD: mroute.c,v 1.17 2003/08/07 11:15:21 agc Exp $ */ 2 3 /* 4 * Copyright (c) 1992, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Stephen Deering of Stanford University. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * from: @(#)mroute.c 8.1 (Berkeley) 6/6/93 35 */ 36 37 /* 38 * Copyright (c) 1989 Stephen Deering 39 * 40 * This code is derived from software contributed to Berkeley by 41 * Stephen Deering of Stanford University. 42 * 43 * Redistribution and use in source and binary forms, with or without 44 * modification, are permitted provided that the following conditions 45 * are met: 46 * 1. Redistributions of source code must retain the above copyright 47 * notice, this list of conditions and the following disclaimer. 48 * 2. Redistributions in binary form must reproduce the above copyright 49 * notice, this list of conditions and the following disclaimer in the 50 * documentation and/or other materials provided with the distribution. 51 * 3. All advertising materials mentioning features or use of this software 52 * must display the following acknowledgement: 53 * This product includes software developed by the University of 54 * California, Berkeley and its contributors. 55 * 4. Neither the name of the University nor the names of its contributors 56 * may be used to endorse or promote products derived from this software 57 * without specific prior written permission. 58 * 59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 69 * SUCH DAMAGE. 70 * 71 * from: @(#)mroute.c 8.1 (Berkeley) 6/6/93 72 */ 73 74 #include <sys/cdefs.h> 75 #ifndef lint 76 #if 0 77 static char sccsid[] = "from: @(#)mroute.c 8.1 (Berkeley) 6/6/93"; 78 #else 79 __RCSID("$NetBSD: mroute.c,v 1.17 2003/08/07 11:15:21 agc Exp $"); 80 #endif 81 #endif /* not lint */ 82 83 /* 84 * Print DVMRP multicast routing structures and statistics. 85 * 86 * MROUTING 1.0 87 */ 88 89 #include <sys/param.h> 90 #include <sys/socket.h> 91 #include <sys/socketvar.h> 92 #include <sys/protosw.h> 93 94 #include <net/if.h> 95 #include <net/route.h> 96 #include <netinet/in.h> 97 #include <netinet/igmp.h> 98 #define _KERNEL 99 #include <netinet/ip_mroute.h> 100 #undef _KERNEL 101 102 #include <stdio.h> 103 #include <stdlib.h> 104 #include "netstat.h" 105 106 static char *pktscale __P((u_long)); 107 108 static char * 109 pktscale(n) 110 u_long n; 111 { 112 static char buf[20]; 113 char t; 114 115 if (n < 1024) 116 t = ' '; 117 else if (n < 1024 * 1024) { 118 t = 'k'; 119 n /= 1024; 120 } else { 121 t = 'm'; 122 n /= 1048576; 123 } 124 125 (void)snprintf(buf, sizeof buf, "%lu%c", n, t); 126 return (buf); 127 } 128 129 void 130 mroutepr(mrpaddr, mfchashtbladdr, mfchashaddr, vifaddr) 131 u_long mrpaddr, mfchashtbladdr, mfchashaddr, vifaddr; 132 { 133 u_int mrtproto; 134 LIST_HEAD(, mfc) *mfchashtbl; 135 u_long mfchash; 136 struct vif viftable[MAXVIFS]; 137 struct mfc *mfcp, mfc; 138 struct vif *v; 139 vifi_t vifi; 140 int i; 141 int banner_printed; 142 int saved_numeric_addr; 143 int numvifs; 144 int nmfc; /* No. of cache entries */ 145 146 if (mrpaddr == 0) { 147 printf("ip_mrtproto: symbol not in namelist\n"); 148 return; 149 } 150 151 kread(mrpaddr, (char *)&mrtproto, sizeof(mrtproto)); 152 switch (mrtproto) { 153 case 0: 154 printf("no multicast routing compiled into this system\n"); 155 return; 156 157 case IGMP_DVMRP: 158 break; 159 160 default: 161 printf("multicast routing protocol %u, unknown\n", mrtproto); 162 return; 163 } 164 165 if (mfchashtbladdr == 0) { 166 printf("mfchashtbl: symbol not in namelist\n"); 167 return; 168 } 169 if (mfchashaddr == 0) { 170 printf("mfchash: symbol not in namelist\n"); 171 return; 172 } 173 if (vifaddr == 0) { 174 printf("viftable: symbol not in namelist\n"); 175 return; 176 } 177 178 saved_numeric_addr = numeric_addr; 179 numeric_addr = 1; 180 181 kread(vifaddr, (char *)&viftable, sizeof(viftable)); 182 banner_printed = 0; 183 numvifs = 0; 184 185 for (vifi = 0, v = viftable; vifi < MAXVIFS; ++vifi, ++v) { 186 if (v->v_lcl_addr.s_addr == 0) 187 continue; 188 numvifs = vifi; 189 190 if (!banner_printed) { 191 printf("\nVirtual Interface Table\n %s%s", 192 "Vif Thresh Limit Local-Address ", 193 "Remote-Address Pkt_in Pkt_out\n"); 194 banner_printed = 1; 195 } 196 197 printf(" %3u %3u %5u %-15.15s", 198 vifi, v->v_threshold, v->v_rate_limit, 199 routename(v->v_lcl_addr.s_addr)); 200 printf(" %-15.15s %6lu %7lu\n", (v->v_flags & VIFF_TUNNEL) ? 201 routename(v->v_rmt_addr.s_addr) : "", 202 v->v_pkt_in, v->v_pkt_out); 203 } 204 if (!banner_printed) 205 printf("\nVirtual Interface Table is empty\n"); 206 207 kread(mfchashtbladdr, (char *)&mfchashtbl, sizeof(mfchashtbl)); 208 kread(mfchashaddr, (char *)&mfchash, sizeof(mfchash)); 209 banner_printed = 0; 210 nmfc = 0; 211 212 if (mfchashtbl != 0) 213 for (i = 0; i <= mfchash; ++i) { 214 kread((u_long)&mfchashtbl[i], (char *)&mfcp, sizeof(mfcp)); 215 216 for (; mfcp != 0; mfcp = mfc.mfc_hash.le_next) { 217 if (!banner_printed) { 218 printf("\nMulticast Forwarding Cache\n %s%s", 219 "Hash Origin Mcastgroup ", 220 "Traffic In-Vif Out-Vifs/Forw-ttl\n"); 221 banner_printed = 1; 222 } 223 224 kread((u_long)mfcp, (char *)&mfc, sizeof(mfc)); 225 printf(" %3u %-15.15s", 226 i, routename(mfc.mfc_origin.s_addr)); 227 printf(" %-15.15s %7s %3u ", 228 routename(mfc.mfc_mcastgrp.s_addr), 229 pktscale(mfc.mfc_pkt_cnt), mfc.mfc_parent); 230 for (vifi = 0; vifi <= numvifs; ++vifi) 231 if (mfc.mfc_ttls[vifi]) 232 printf(" %u/%u", vifi, mfc.mfc_ttls[vifi]); 233 234 printf("\n"); 235 nmfc++; 236 } 237 } 238 if (!banner_printed) 239 printf("\nMulticast Forwarding Cache is empty\n"); 240 else 241 printf("\nTotal no. of entries in cache: %d\n", nmfc); 242 243 printf("\n"); 244 numeric_addr = saved_numeric_addr; 245 } 246 247 248 void 249 mrt_stats(mrpaddr, mstaddr) 250 u_long mrpaddr, mstaddr; 251 { 252 u_int mrtproto; 253 struct mrtstat mrtstat; 254 255 if (mrpaddr == 0) { 256 printf("ip_mrtproto: symbol not in namelist\n"); 257 return; 258 } 259 260 kread(mrpaddr, (char *)&mrtproto, sizeof(mrtproto)); 261 switch (mrtproto) { 262 case 0: 263 printf("no multicast routing compiled into this system\n"); 264 return; 265 266 case IGMP_DVMRP: 267 break; 268 269 default: 270 printf("multicast routing protocol %u, unknown\n", mrtproto); 271 return; 272 } 273 274 if (mstaddr == 0) { 275 printf("mrtstat: symbol not in namelist\n"); 276 return; 277 } 278 279 kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat)); 280 printf("multicast routing:\n"); 281 printf("\t%lu datagram%s with no route for origin\n", 282 mrtstat.mrts_no_route, plural(mrtstat.mrts_no_route)); 283 printf("\t%lu upcall%s made to mrouted\n", 284 mrtstat.mrts_upcalls, plural(mrtstat.mrts_upcalls)); 285 printf("\t%lu datagram%s with malformed tunnel options\n", 286 mrtstat.mrts_bad_tunnel, plural(mrtstat.mrts_bad_tunnel)); 287 printf("\t%lu datagram%s with no room for tunnel options\n", 288 mrtstat.mrts_cant_tunnel, plural(mrtstat.mrts_cant_tunnel)); 289 printf("\t%lu datagram%s arrived on wrong interface\n", 290 mrtstat.mrts_wrong_if, plural(mrtstat.mrts_wrong_if)); 291 printf("\t%lu datagram%s dropped due to upcall Q overflow\n", 292 mrtstat.mrts_upq_ovflw, plural(mrtstat.mrts_upq_ovflw)); 293 printf("\t%lu datagram%s dropped due to upcall socket overflow\n", 294 mrtstat.mrts_upq_sockfull, plural(mrtstat.mrts_upq_sockfull)); 295 printf("\t%lu datagram%s cleaned up by the cache\n", 296 mrtstat.mrts_cache_cleanups, plural(mrtstat.mrts_cache_cleanups)); 297 printf("\t%lu datagram%s dropped selectively by ratelimiter\n", 298 mrtstat.mrts_drop_sel, plural(mrtstat.mrts_drop_sel)); 299 printf("\t%lu datagram%s dropped - bucket Q overflow\n", 300 mrtstat.mrts_q_overflow, plural(mrtstat.mrts_q_overflow)); 301 printf("\t%lu datagram%s dropped - larger than bkt size\n", 302 mrtstat.mrts_pkt2large, plural(mrtstat.mrts_pkt2large)); 303 } 304
Indexes created Wed Sep 24 05:09:52 GMT 2025