NetBSD/usr.bin/netstat/mroute.c

260 lines
7.4 KiB
C

/*
* Copyright (c) 1989 Stephen Deering
* Copyright (c) 1992, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Stephen Deering of Stanford University.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* from: @(#)mroute.c 8.1 (Berkeley) 6/6/93
* $Id: mroute.c,v 1.8 1995/06/12 03:49:45 mycroft Exp $
*/
/*
* Print DVMRP multicast routing structures and statistics.
*
* MROUTING 1.0
*/
#include <sys/param.h>
#include <sys/socket.h>
#include <sys/socketvar.h>
#include <sys/protosw.h>
#include <net/if.h>
#include <net/route.h>
#include <netinet/in.h>
#include <netinet/igmp.h>
#define _KERNEL
#include <netinet/ip_mroute.h>
#undef _KERNEL
#include <stdio.h>
#include <stdlib.h>
#include "netstat.h"
char *
pktscale(n)
u_long n;
{
static char buf[8];
char t;
if (n < 1024)
t = ' ';
else if (n < 1024 * 1024) {
t = 'k';
n /= 1024;
} else {
t = 'm';
n /= 1048576;
}
sprintf(buf, "%u%c", n, t);
return (buf);
}
void
mroutepr(mrpaddr, mfchashtbladdr, mfchashaddr, vifaddr)
u_long mrpaddr, mfchashtbladdr, mfchashaddr, vifaddr;
{
u_int mrtproto;
LIST_HEAD(, mfc) *mfchashtbl;
u_long mfchash;
struct vif viftable[MAXVIFS];
struct mfc *mfcp, mfc;
register struct vif *v;
register vifi_t vifi;
struct in_addr *grp;
int i;
int banner_printed;
int saved_nflag;
int numvifs;
int nmfc; /* No. of cache entries */
if (mrpaddr == 0) {
printf("ip_mrtproto: symbol not in namelist\n");
return;
}
kread(mrpaddr, (char *)&mrtproto, sizeof(mrtproto));
switch (mrtproto) {
case 0:
printf("no multicast routing compiled into this system\n");
return;
case IGMP_DVMRP:
break;
default:
printf("multicast routing protocol %u, unknown\n", mrtproto);
return;
}
if (mfchashtbladdr == 0) {
printf("mfchashtbl: symbol not in namelist\n");
return;
}
if (mfchashaddr == 0) {
printf("mfchash: symbol not in namelist\n");
return;
}
if (vifaddr == 0) {
printf("viftable: symbol not in namelist\n");
return;
}
saved_nflag = nflag;
nflag = 1;
kread(vifaddr, (char *)&viftable, sizeof(viftable));
banner_printed = 0;
numvifs = 0;
for (vifi = 0, v = viftable; vifi < MAXVIFS; ++vifi, ++v) {
if (v->v_lcl_addr.s_addr == 0)
continue;
numvifs = vifi;
if (!banner_printed) {
printf("\nVirtual Interface Table\n %s%s",
"Vif Thresh Limit Local-Address ",
"Remote-Address Pkt_in Pkt_out\n");
banner_printed = 1;
}
printf(" %3u %3u %5u %-15.15s",
vifi, v->v_threshold, v->v_rate_limit,
routename(v->v_lcl_addr.s_addr));
printf(" %-15.15s %6u %7u\n", (v->v_flags & VIFF_TUNNEL) ?
routename(v->v_rmt_addr.s_addr) : "",
v->v_pkt_in, v->v_pkt_out);
}
if (!banner_printed)
printf("\nVirtual Interface Table is empty\n");
kread(mfchashtbladdr, (char *)&mfchashtbl, sizeof(mfchashtbl));
kread(mfchashaddr, (char *)&mfchash, sizeof(mfchash));
banner_printed = 0;
nmfc = 0;
for (i = 0; i <= mfchash; ++i) {
kread((u_long)&mfchashtbl[i], (char *)&mfcp, sizeof(mfcp));
for (; mfcp != 0; mfcp = mfc.mfc_hash.le_next) {
if (!banner_printed) {
printf("\nMulticast Forwarding Cache\n %s%s",
"Hash Origin Mcastgroup ",
"Traffic In-Vif Out-Vifs/Forw-ttl\n");
banner_printed = 1;
}
kread((u_long)mfcp, (char *)&mfc, sizeof(mfc));
printf(" %3u %-15.15s",
i, routename(mfc.mfc_origin.s_addr));
printf(" %-15.15s %7s %3u ",
routename(mfc.mfc_mcastgrp.s_addr),
pktscale(mfc.mfc_pkt_cnt), mfc.mfc_parent);
for (vifi = 0; vifi <= numvifs; ++vifi)
if (mfc.mfc_ttls[vifi])
printf(" %u/%u", vifi, mfc.mfc_ttls[vifi]);
printf("\n");
nmfc++;
}
}
if (!banner_printed)
printf("\nMulticast Forwarding Cache is empty\n");
else
printf("\nTotal no. of entries in cache: %d\n", nmfc);
printf("\n");
nflag = saved_nflag;
}
void
mrt_stats(mrpaddr, mstaddr)
u_long mrpaddr, mstaddr;
{
u_int mrtproto;
struct mrtstat mrtstat;
if (mrpaddr == 0) {
printf("ip_mrtproto: symbol not in namelist\n");
return;
}
kread(mrpaddr, (char *)&mrtproto, sizeof(mrtproto));
switch (mrtproto) {
case 0:
printf("no multicast routing compiled into this system\n");
return;
case IGMP_DVMRP:
break;
default:
printf("multicast routing protocol %u, unknown\n", mrtproto);
return;
}
if (mstaddr == 0) {
printf("mrtstat: symbol not in namelist\n");
return;
}
kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat));
printf("multicast routing:\n");
printf("\t%d datagram%s with no route for origin\n",
mrtstat.mrts_no_route, plural(mrtstat.mrts_no_route));
printf("\t%d upcall%s made to mrouted\n",
mrtstat.mrts_upcalls, plural(mrtstat.mrts_upcalls));
printf("\t%d datagram%s with malformed tunnel options\n",
mrtstat.mrts_bad_tunnel, plural(mrtstat.mrts_bad_tunnel));
printf("\t%d datagram%s with no room for tunnel options\n",
mrtstat.mrts_cant_tunnel, plural(mrtstat.mrts_cant_tunnel));
printf("\t%d datagram%s arrived on wrong interface\n",
mrtstat.mrts_wrong_if, plural(mrtstat.mrts_wrong_if));
printf("\t%d datagram%s dropped due to upcall Q overflow\n",
mrtstat.mrts_upq_ovflw, plural(mrtstat.mrts_upq_ovflw));
printf("\t%d datagram%s dropped due to upcall socket overflow\n",
mrtstat.mrts_upq_sockfull, plural(mrtstat.mrts_upq_sockfull));
printf("\t%d datagram%s cleaned up by the cache\n",
mrtstat.mrts_cache_cleanups, plural(mrtstat.mrts_cache_cleanups));
printf("\t%d datagram%s dropped selectively by ratelimiter\n",
mrtstat.mrts_drop_sel, plural(mrtstat.mrts_drop_sel));
printf("\t%d datagram%s dropped - bucket Q overflow\n",
mrtstat.mrts_q_overflow, plural(mrtstat.mrts_q_overflow));
printf("\t%d datagram%s dropped - larger than bkt size\n",
mrtstat.mrts_pkt2large, plural(mrtstat.mrts_pkt2large));
}