1*66dfcc85SDavid van Moolenbroek /* $NetBSD: mroute.c,v 1.25 2014/11/06 21:30:09 christos Exp $ */
2*66dfcc85SDavid van Moolenbroek
3*66dfcc85SDavid van Moolenbroek /*
4*66dfcc85SDavid van Moolenbroek * Copyright (c) 1992, 1993
5*66dfcc85SDavid van Moolenbroek * The Regents of the University of California. All rights reserved.
6*66dfcc85SDavid van Moolenbroek *
7*66dfcc85SDavid van Moolenbroek * This code is derived from software contributed to Berkeley by
8*66dfcc85SDavid van Moolenbroek * Stephen Deering of Stanford University.
9*66dfcc85SDavid van Moolenbroek *
10*66dfcc85SDavid van Moolenbroek * Redistribution and use in source and binary forms, with or without
11*66dfcc85SDavid van Moolenbroek * modification, are permitted provided that the following conditions
12*66dfcc85SDavid van Moolenbroek * are met:
13*66dfcc85SDavid van Moolenbroek * 1. Redistributions of source code must retain the above copyright
14*66dfcc85SDavid van Moolenbroek * notice, this list of conditions and the following disclaimer.
15*66dfcc85SDavid van Moolenbroek * 2. Redistributions in binary form must reproduce the above copyright
16*66dfcc85SDavid van Moolenbroek * notice, this list of conditions and the following disclaimer in the
17*66dfcc85SDavid van Moolenbroek * documentation and/or other materials provided with the distribution.
18*66dfcc85SDavid van Moolenbroek * 3. Neither the name of the University nor the names of its contributors
19*66dfcc85SDavid van Moolenbroek * may be used to endorse or promote products derived from this software
20*66dfcc85SDavid van Moolenbroek * without specific prior written permission.
21*66dfcc85SDavid van Moolenbroek *
22*66dfcc85SDavid van Moolenbroek * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23*66dfcc85SDavid van Moolenbroek * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24*66dfcc85SDavid van Moolenbroek * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25*66dfcc85SDavid van Moolenbroek * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26*66dfcc85SDavid van Moolenbroek * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27*66dfcc85SDavid van Moolenbroek * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28*66dfcc85SDavid van Moolenbroek * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29*66dfcc85SDavid van Moolenbroek * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30*66dfcc85SDavid van Moolenbroek * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31*66dfcc85SDavid van Moolenbroek * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32*66dfcc85SDavid van Moolenbroek * SUCH DAMAGE.
33*66dfcc85SDavid van Moolenbroek *
34*66dfcc85SDavid van Moolenbroek * from: @(#)mroute.c 8.1 (Berkeley) 6/6/93
35*66dfcc85SDavid van Moolenbroek */
36*66dfcc85SDavid van Moolenbroek
37*66dfcc85SDavid van Moolenbroek /*
38*66dfcc85SDavid van Moolenbroek * Copyright (c) 1989 Stephen Deering
39*66dfcc85SDavid van Moolenbroek *
40*66dfcc85SDavid van Moolenbroek * This code is derived from software contributed to Berkeley by
41*66dfcc85SDavid van Moolenbroek * Stephen Deering of Stanford University.
42*66dfcc85SDavid van Moolenbroek *
43*66dfcc85SDavid van Moolenbroek * Redistribution and use in source and binary forms, with or without
44*66dfcc85SDavid van Moolenbroek * modification, are permitted provided that the following conditions
45*66dfcc85SDavid van Moolenbroek * are met:
46*66dfcc85SDavid van Moolenbroek * 1. Redistributions of source code must retain the above copyright
47*66dfcc85SDavid van Moolenbroek * notice, this list of conditions and the following disclaimer.
48*66dfcc85SDavid van Moolenbroek * 2. Redistributions in binary form must reproduce the above copyright
49*66dfcc85SDavid van Moolenbroek * notice, this list of conditions and the following disclaimer in the
50*66dfcc85SDavid van Moolenbroek * documentation and/or other materials provided with the distribution.
51*66dfcc85SDavid van Moolenbroek * 3. All advertising materials mentioning features or use of this software
52*66dfcc85SDavid van Moolenbroek * must display the following acknowledgement:
53*66dfcc85SDavid van Moolenbroek * This product includes software developed by the University of
54*66dfcc85SDavid van Moolenbroek * California, Berkeley and its contributors.
55*66dfcc85SDavid van Moolenbroek * 4. Neither the name of the University nor the names of its contributors
56*66dfcc85SDavid van Moolenbroek * may be used to endorse or promote products derived from this software
57*66dfcc85SDavid van Moolenbroek * without specific prior written permission.
58*66dfcc85SDavid van Moolenbroek *
59*66dfcc85SDavid van Moolenbroek * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60*66dfcc85SDavid van Moolenbroek * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61*66dfcc85SDavid van Moolenbroek * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62*66dfcc85SDavid van Moolenbroek * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63*66dfcc85SDavid van Moolenbroek * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64*66dfcc85SDavid van Moolenbroek * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65*66dfcc85SDavid van Moolenbroek * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66*66dfcc85SDavid van Moolenbroek * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67*66dfcc85SDavid van Moolenbroek * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68*66dfcc85SDavid van Moolenbroek * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69*66dfcc85SDavid van Moolenbroek * SUCH DAMAGE.
70*66dfcc85SDavid van Moolenbroek *
71*66dfcc85SDavid van Moolenbroek * from: @(#)mroute.c 8.1 (Berkeley) 6/6/93
72*66dfcc85SDavid van Moolenbroek */
73*66dfcc85SDavid van Moolenbroek
74*66dfcc85SDavid van Moolenbroek #include <sys/cdefs.h>
75*66dfcc85SDavid van Moolenbroek #ifndef lint
76*66dfcc85SDavid van Moolenbroek #if 0
77*66dfcc85SDavid van Moolenbroek static char sccsid[] = "from: @(#)mroute.c 8.1 (Berkeley) 6/6/93";
78*66dfcc85SDavid van Moolenbroek #else
79*66dfcc85SDavid van Moolenbroek __RCSID("$NetBSD: mroute.c,v 1.25 2014/11/06 21:30:09 christos Exp $");
80*66dfcc85SDavid van Moolenbroek #endif
81*66dfcc85SDavid van Moolenbroek #endif /* not lint */
82*66dfcc85SDavid van Moolenbroek
83*66dfcc85SDavid van Moolenbroek /*
84*66dfcc85SDavid van Moolenbroek * Print multicast routing structures and statistics.
85*66dfcc85SDavid van Moolenbroek *
86*66dfcc85SDavid van Moolenbroek * MROUTING 1.0
87*66dfcc85SDavid van Moolenbroek */
88*66dfcc85SDavid van Moolenbroek
89*66dfcc85SDavid van Moolenbroek #include <sys/param.h>
90*66dfcc85SDavid van Moolenbroek #include <sys/socket.h>
91*66dfcc85SDavid van Moolenbroek #include <sys/socketvar.h>
92*66dfcc85SDavid van Moolenbroek #include <sys/protosw.h>
93*66dfcc85SDavid van Moolenbroek
94*66dfcc85SDavid van Moolenbroek #include <net/if.h>
95*66dfcc85SDavid van Moolenbroek #include <net/route.h>
96*66dfcc85SDavid van Moolenbroek #include <netinet/in.h>
97*66dfcc85SDavid van Moolenbroek #include <netinet/igmp.h>
98*66dfcc85SDavid van Moolenbroek #define _KERNEL
99*66dfcc85SDavid van Moolenbroek #include <netinet/ip_mroute.h>
100*66dfcc85SDavid van Moolenbroek #undef _KERNEL
101*66dfcc85SDavid van Moolenbroek
102*66dfcc85SDavid van Moolenbroek #include <stdio.h>
103*66dfcc85SDavid van Moolenbroek #include <stdlib.h>
104*66dfcc85SDavid van Moolenbroek #include <kvm.h>
105*66dfcc85SDavid van Moolenbroek #include "netstat.h"
106*66dfcc85SDavid van Moolenbroek #include "rtutil.h"
107*66dfcc85SDavid van Moolenbroek
108*66dfcc85SDavid van Moolenbroek static char *pktscale(u_long);
109*66dfcc85SDavid van Moolenbroek static void print_bw_meter(struct bw_meter *, int *);
110*66dfcc85SDavid van Moolenbroek
111*66dfcc85SDavid van Moolenbroek static char *
pktscale(u_long n)112*66dfcc85SDavid van Moolenbroek pktscale(u_long n)
113*66dfcc85SDavid van Moolenbroek {
114*66dfcc85SDavid van Moolenbroek static char buf[20];
115*66dfcc85SDavid van Moolenbroek char t;
116*66dfcc85SDavid van Moolenbroek
117*66dfcc85SDavid van Moolenbroek if (n < 1024)
118*66dfcc85SDavid van Moolenbroek t = ' ';
119*66dfcc85SDavid van Moolenbroek else if (n < 1024 * 1024) {
120*66dfcc85SDavid van Moolenbroek t = 'k';
121*66dfcc85SDavid van Moolenbroek n /= 1024;
122*66dfcc85SDavid van Moolenbroek } else {
123*66dfcc85SDavid van Moolenbroek t = 'm';
124*66dfcc85SDavid van Moolenbroek n /= 1048576;
125*66dfcc85SDavid van Moolenbroek }
126*66dfcc85SDavid van Moolenbroek
127*66dfcc85SDavid van Moolenbroek (void)snprintf(buf, sizeof buf, "%lu%c", n, t);
128*66dfcc85SDavid van Moolenbroek return (buf);
129*66dfcc85SDavid van Moolenbroek }
130*66dfcc85SDavid van Moolenbroek
131*66dfcc85SDavid van Moolenbroek void
mroutepr(u_long mrpaddr,u_long mfchashtbladdr,u_long mfchashaddr,u_long vifaddr)132*66dfcc85SDavid van Moolenbroek mroutepr(u_long mrpaddr, u_long mfchashtbladdr, u_long mfchashaddr,
133*66dfcc85SDavid van Moolenbroek u_long vifaddr)
134*66dfcc85SDavid van Moolenbroek {
135*66dfcc85SDavid van Moolenbroek u_int mrtproto;
136*66dfcc85SDavid van Moolenbroek LIST_HEAD(, mfc) *mfchashtbl;
137*66dfcc85SDavid van Moolenbroek u_long mfchash, i;
138*66dfcc85SDavid van Moolenbroek struct vif viftable[MAXVIFS];
139*66dfcc85SDavid van Moolenbroek struct mfc *mfcp, mfc;
140*66dfcc85SDavid van Moolenbroek struct vif *v;
141*66dfcc85SDavid van Moolenbroek vifi_t vifi;
142*66dfcc85SDavid van Moolenbroek int banner_printed;
143*66dfcc85SDavid van Moolenbroek int saved_numeric_addr;
144*66dfcc85SDavid van Moolenbroek int numvifs;
145*66dfcc85SDavid van Moolenbroek int nmfc; /* No. of cache entries */
146*66dfcc85SDavid van Moolenbroek
147*66dfcc85SDavid van Moolenbroek if (mrpaddr == 0) {
148*66dfcc85SDavid van Moolenbroek printf("ip_mrtproto: symbol not in namelist\n");
149*66dfcc85SDavid van Moolenbroek return;
150*66dfcc85SDavid van Moolenbroek }
151*66dfcc85SDavid van Moolenbroek
152*66dfcc85SDavid van Moolenbroek kread(mrpaddr, (char *)&mrtproto, sizeof(mrtproto));
153*66dfcc85SDavid van Moolenbroek switch (mrtproto) {
154*66dfcc85SDavid van Moolenbroek case 0:
155*66dfcc85SDavid van Moolenbroek printf("no multicast routing compiled into this system\n");
156*66dfcc85SDavid van Moolenbroek return;
157*66dfcc85SDavid van Moolenbroek
158*66dfcc85SDavid van Moolenbroek case IGMP_DVMRP:
159*66dfcc85SDavid van Moolenbroek break;
160*66dfcc85SDavid van Moolenbroek
161*66dfcc85SDavid van Moolenbroek default:
162*66dfcc85SDavid van Moolenbroek printf("multicast routing protocol %u, unknown\n", mrtproto);
163*66dfcc85SDavid van Moolenbroek return;
164*66dfcc85SDavid van Moolenbroek }
165*66dfcc85SDavid van Moolenbroek
166*66dfcc85SDavid van Moolenbroek if (mfchashtbladdr == 0) {
167*66dfcc85SDavid van Moolenbroek printf("mfchashtbl: symbol not in namelist\n");
168*66dfcc85SDavid van Moolenbroek return;
169*66dfcc85SDavid van Moolenbroek }
170*66dfcc85SDavid van Moolenbroek if (mfchashaddr == 0) {
171*66dfcc85SDavid van Moolenbroek printf("mfchash: symbol not in namelist\n");
172*66dfcc85SDavid van Moolenbroek return;
173*66dfcc85SDavid van Moolenbroek }
174*66dfcc85SDavid van Moolenbroek if (vifaddr == 0) {
175*66dfcc85SDavid van Moolenbroek printf("viftable: symbol not in namelist\n");
176*66dfcc85SDavid van Moolenbroek return;
177*66dfcc85SDavid van Moolenbroek }
178*66dfcc85SDavid van Moolenbroek
179*66dfcc85SDavid van Moolenbroek saved_numeric_addr = numeric_addr;
180*66dfcc85SDavid van Moolenbroek numeric_addr = 1;
181*66dfcc85SDavid van Moolenbroek
182*66dfcc85SDavid van Moolenbroek kread(vifaddr, (char *)&viftable, sizeof(viftable));
183*66dfcc85SDavid van Moolenbroek banner_printed = 0;
184*66dfcc85SDavid van Moolenbroek numvifs = 0;
185*66dfcc85SDavid van Moolenbroek
186*66dfcc85SDavid van Moolenbroek for (vifi = 0, v = viftable; vifi < MAXVIFS; ++vifi, ++v) {
187*66dfcc85SDavid van Moolenbroek if (v->v_lcl_addr.s_addr == 0)
188*66dfcc85SDavid van Moolenbroek continue;
189*66dfcc85SDavid van Moolenbroek numvifs = vifi;
190*66dfcc85SDavid van Moolenbroek
191*66dfcc85SDavid van Moolenbroek if (!banner_printed) {
192*66dfcc85SDavid van Moolenbroek printf("\nVirtual Interface Table\n %s%s",
193*66dfcc85SDavid van Moolenbroek "Vif Thresh Limit Local-Address ",
194*66dfcc85SDavid van Moolenbroek "Remote-Address Pkt_in Pkt_out\n");
195*66dfcc85SDavid van Moolenbroek banner_printed = 1;
196*66dfcc85SDavid van Moolenbroek }
197*66dfcc85SDavid van Moolenbroek
198*66dfcc85SDavid van Moolenbroek printf(" %3u %3u %5u %-15.15s",
199*66dfcc85SDavid van Moolenbroek vifi, v->v_threshold, v->v_rate_limit,
200*66dfcc85SDavid van Moolenbroek routename4(v->v_lcl_addr.s_addr, nflag));
201*66dfcc85SDavid van Moolenbroek printf(" %-15.15s %6lu %7lu\n", (v->v_flags & VIFF_TUNNEL) ?
202*66dfcc85SDavid van Moolenbroek routename4(v->v_rmt_addr.s_addr, nflag) : "",
203*66dfcc85SDavid van Moolenbroek v->v_pkt_in, v->v_pkt_out);
204*66dfcc85SDavid van Moolenbroek }
205*66dfcc85SDavid van Moolenbroek if (!banner_printed)
206*66dfcc85SDavid van Moolenbroek printf("\nVirtual Interface Table is empty\n");
207*66dfcc85SDavid van Moolenbroek
208*66dfcc85SDavid van Moolenbroek kread(mfchashtbladdr, (char *)&mfchashtbl, sizeof(mfchashtbl));
209*66dfcc85SDavid van Moolenbroek kread(mfchashaddr, (char *)&mfchash, sizeof(mfchash));
210*66dfcc85SDavid van Moolenbroek banner_printed = 0;
211*66dfcc85SDavid van Moolenbroek nmfc = 0;
212*66dfcc85SDavid van Moolenbroek
213*66dfcc85SDavid van Moolenbroek if (mfchashtbl != 0)
214*66dfcc85SDavid van Moolenbroek for (i = 0; i <= mfchash; ++i) {
215*66dfcc85SDavid van Moolenbroek kread((u_long)&mfchashtbl[i], (char *)&mfcp, sizeof(mfcp));
216*66dfcc85SDavid van Moolenbroek
217*66dfcc85SDavid van Moolenbroek for (; mfcp != 0; mfcp = mfc.mfc_hash.le_next) {
218*66dfcc85SDavid van Moolenbroek if (!banner_printed) {
219*66dfcc85SDavid van Moolenbroek printf("\nMulticast Forwarding Cache\n %s%s",
220*66dfcc85SDavid van Moolenbroek "Hash Origin Mcastgroup ",
221*66dfcc85SDavid van Moolenbroek "Traffic In-Vif Out-Vifs/Forw-ttl\n");
222*66dfcc85SDavid van Moolenbroek banner_printed = 1;
223*66dfcc85SDavid van Moolenbroek }
224*66dfcc85SDavid van Moolenbroek
225*66dfcc85SDavid van Moolenbroek kread((u_long)mfcp, (char *)&mfc, sizeof(mfc));
226*66dfcc85SDavid van Moolenbroek printf(" %3lu %-15.15s",
227*66dfcc85SDavid van Moolenbroek i, routename4(mfc.mfc_origin.s_addr, nflag));
228*66dfcc85SDavid van Moolenbroek printf(" %-15.15s %7s %3u ",
229*66dfcc85SDavid van Moolenbroek routename4(mfc.mfc_mcastgrp.s_addr, nflag),
230*66dfcc85SDavid van Moolenbroek pktscale(mfc.mfc_pkt_cnt), mfc.mfc_parent);
231*66dfcc85SDavid van Moolenbroek for (vifi = 0; vifi <= numvifs; ++vifi)
232*66dfcc85SDavid van Moolenbroek if (mfc.mfc_ttls[vifi])
233*66dfcc85SDavid van Moolenbroek printf(" %u/%u", vifi, mfc.mfc_ttls[vifi]);
234*66dfcc85SDavid van Moolenbroek
235*66dfcc85SDavid van Moolenbroek printf("\n");
236*66dfcc85SDavid van Moolenbroek
237*66dfcc85SDavid van Moolenbroek /* Print the bw meter information */
238*66dfcc85SDavid van Moolenbroek {
239*66dfcc85SDavid van Moolenbroek struct bw_meter bw_meter, *bwm;
240*66dfcc85SDavid van Moolenbroek int banner_printed2 = 0;
241*66dfcc85SDavid van Moolenbroek
242*66dfcc85SDavid van Moolenbroek bwm = mfc.mfc_bw_meter;
243*66dfcc85SDavid van Moolenbroek while (bwm) {
244*66dfcc85SDavid van Moolenbroek kread((u_long)bwm,
245*66dfcc85SDavid van Moolenbroek (char *)&bw_meter,
246*66dfcc85SDavid van Moolenbroek sizeof bw_meter);
247*66dfcc85SDavid van Moolenbroek print_bw_meter(&bw_meter,
248*66dfcc85SDavid van Moolenbroek &banner_printed2);
249*66dfcc85SDavid van Moolenbroek bwm = bw_meter.bm_mfc_next;
250*66dfcc85SDavid van Moolenbroek }
251*66dfcc85SDavid van Moolenbroek #if 0 /* Don't ever print it? */
252*66dfcc85SDavid van Moolenbroek if (! banner_printed2)
253*66dfcc85SDavid van Moolenbroek printf("\n No Bandwidth Meters\n");
254*66dfcc85SDavid van Moolenbroek #endif
255*66dfcc85SDavid van Moolenbroek }
256*66dfcc85SDavid van Moolenbroek
257*66dfcc85SDavid van Moolenbroek nmfc++;
258*66dfcc85SDavid van Moolenbroek }
259*66dfcc85SDavid van Moolenbroek }
260*66dfcc85SDavid van Moolenbroek if (!banner_printed)
261*66dfcc85SDavid van Moolenbroek printf("\nMulticast Forwarding Cache is empty\n");
262*66dfcc85SDavid van Moolenbroek else
263*66dfcc85SDavid van Moolenbroek printf("\nTotal no. of entries in cache: %d\n", nmfc);
264*66dfcc85SDavid van Moolenbroek
265*66dfcc85SDavid van Moolenbroek printf("\n");
266*66dfcc85SDavid van Moolenbroek numeric_addr = saved_numeric_addr;
267*66dfcc85SDavid van Moolenbroek }
268*66dfcc85SDavid van Moolenbroek
269*66dfcc85SDavid van Moolenbroek static void
print_bw_meter(struct bw_meter * bw_meter,int * banner_printed)270*66dfcc85SDavid van Moolenbroek print_bw_meter(struct bw_meter *bw_meter, int *banner_printed)
271*66dfcc85SDavid van Moolenbroek {
272*66dfcc85SDavid van Moolenbroek char s0[256], s1[256], s2[256], s3[256];
273*66dfcc85SDavid van Moolenbroek struct timeval now, end, delta;
274*66dfcc85SDavid van Moolenbroek
275*66dfcc85SDavid van Moolenbroek gettimeofday(&now, NULL);
276*66dfcc85SDavid van Moolenbroek
277*66dfcc85SDavid van Moolenbroek if (! *banner_printed) {
278*66dfcc85SDavid van Moolenbroek printf(" Bandwidth Meters\n");
279*66dfcc85SDavid van Moolenbroek printf(" %-30s", "Measured(Start|Packets|Bytes)");
280*66dfcc85SDavid van Moolenbroek printf(" %s", "Type");
281*66dfcc85SDavid van Moolenbroek printf(" %-30s", "Thresh(Interval|Packets|Bytes)");
282*66dfcc85SDavid van Moolenbroek printf(" Remain");
283*66dfcc85SDavid van Moolenbroek printf("\n");
284*66dfcc85SDavid van Moolenbroek *banner_printed = 1;
285*66dfcc85SDavid van Moolenbroek }
286*66dfcc85SDavid van Moolenbroek
287*66dfcc85SDavid van Moolenbroek /* The measured values */
288*66dfcc85SDavid van Moolenbroek if (bw_meter->bm_flags & BW_METER_UNIT_PACKETS)
289*66dfcc85SDavid van Moolenbroek sprintf(s1, "%llu", (unsigned long long)bw_meter->bm_measured.b_packets);
290*66dfcc85SDavid van Moolenbroek else
291*66dfcc85SDavid van Moolenbroek sprintf(s1, "?");
292*66dfcc85SDavid van Moolenbroek if (bw_meter->bm_flags & BW_METER_UNIT_BYTES)
293*66dfcc85SDavid van Moolenbroek sprintf(s2, "%llu", (unsigned long long)bw_meter->bm_measured.b_bytes);
294*66dfcc85SDavid van Moolenbroek else
295*66dfcc85SDavid van Moolenbroek sprintf(s2, "?");
296*66dfcc85SDavid van Moolenbroek sprintf(s0, "%lld.%ld|%s|%s",
297*66dfcc85SDavid van Moolenbroek (long long)bw_meter->bm_start_time.tv_sec,
298*66dfcc85SDavid van Moolenbroek (long)bw_meter->bm_start_time.tv_usec,
299*66dfcc85SDavid van Moolenbroek s1, s2);
300*66dfcc85SDavid van Moolenbroek printf(" %-30s", s0);
301*66dfcc85SDavid van Moolenbroek
302*66dfcc85SDavid van Moolenbroek /* The type of entry */
303*66dfcc85SDavid van Moolenbroek sprintf(s0, "%s", "?");
304*66dfcc85SDavid van Moolenbroek if (bw_meter->bm_flags & BW_METER_GEQ)
305*66dfcc85SDavid van Moolenbroek sprintf(s0, "%s", ">=");
306*66dfcc85SDavid van Moolenbroek else if (bw_meter->bm_flags & BW_METER_LEQ)
307*66dfcc85SDavid van Moolenbroek sprintf(s0, "%s", "<=");
308*66dfcc85SDavid van Moolenbroek printf(" %-3s", s0);
309*66dfcc85SDavid van Moolenbroek
310*66dfcc85SDavid van Moolenbroek /* The threshold values */
311*66dfcc85SDavid van Moolenbroek if (bw_meter->bm_flags & BW_METER_UNIT_PACKETS)
312*66dfcc85SDavid van Moolenbroek sprintf(s1, "%llu", (unsigned long long)bw_meter->bm_threshold.b_packets);
313*66dfcc85SDavid van Moolenbroek else
314*66dfcc85SDavid van Moolenbroek sprintf(s1, "?");
315*66dfcc85SDavid van Moolenbroek if (bw_meter->bm_flags & BW_METER_UNIT_BYTES)
316*66dfcc85SDavid van Moolenbroek sprintf(s2, "%llu", (unsigned long long)bw_meter->bm_threshold.b_bytes);
317*66dfcc85SDavid van Moolenbroek else
318*66dfcc85SDavid van Moolenbroek sprintf(s2, "?");
319*66dfcc85SDavid van Moolenbroek sprintf(s0, "%lld.%ld|%s|%s",
320*66dfcc85SDavid van Moolenbroek (long long)bw_meter->bm_threshold.b_time.tv_sec,
321*66dfcc85SDavid van Moolenbroek (long)bw_meter->bm_threshold.b_time.tv_usec,
322*66dfcc85SDavid van Moolenbroek s1, s2);
323*66dfcc85SDavid van Moolenbroek printf(" %-30s", s0);
324*66dfcc85SDavid van Moolenbroek
325*66dfcc85SDavid van Moolenbroek /* Remaining time */
326*66dfcc85SDavid van Moolenbroek timeradd(&bw_meter->bm_start_time,
327*66dfcc85SDavid van Moolenbroek &bw_meter->bm_threshold.b_time, &end);
328*66dfcc85SDavid van Moolenbroek if (timercmp(&now, &end, <=)) {
329*66dfcc85SDavid van Moolenbroek timersub(&end, &now, &delta);
330*66dfcc85SDavid van Moolenbroek sprintf(s3, "%lld.%ld",
331*66dfcc85SDavid van Moolenbroek (long long)delta.tv_sec, (long)delta.tv_usec);
332*66dfcc85SDavid van Moolenbroek } else {
333*66dfcc85SDavid van Moolenbroek /* Negative time */
334*66dfcc85SDavid van Moolenbroek timersub(&now, &end, &delta);
335*66dfcc85SDavid van Moolenbroek sprintf(s3, "-%lld.%ld",
336*66dfcc85SDavid van Moolenbroek (long long)delta.tv_sec, (long)delta.tv_usec);
337*66dfcc85SDavid van Moolenbroek }
338*66dfcc85SDavid van Moolenbroek printf(" %s", s3);
339*66dfcc85SDavid van Moolenbroek
340*66dfcc85SDavid van Moolenbroek printf("\n");
341*66dfcc85SDavid van Moolenbroek }
342*66dfcc85SDavid van Moolenbroek
343*66dfcc85SDavid van Moolenbroek void
mrt_stats(u_long mrpaddr,u_long mstaddr)344*66dfcc85SDavid van Moolenbroek mrt_stats(u_long mrpaddr, u_long mstaddr)
345*66dfcc85SDavid van Moolenbroek {
346*66dfcc85SDavid van Moolenbroek u_int mrtproto;
347*66dfcc85SDavid van Moolenbroek struct mrtstat mrtstat;
348*66dfcc85SDavid van Moolenbroek
349*66dfcc85SDavid van Moolenbroek if (mrpaddr == 0) {
350*66dfcc85SDavid van Moolenbroek printf("ip_mrtproto: symbol not in namelist\n");
351*66dfcc85SDavid van Moolenbroek return;
352*66dfcc85SDavid van Moolenbroek }
353*66dfcc85SDavid van Moolenbroek
354*66dfcc85SDavid van Moolenbroek kread(mrpaddr, (char *)&mrtproto, sizeof(mrtproto));
355*66dfcc85SDavid van Moolenbroek switch (mrtproto) {
356*66dfcc85SDavid van Moolenbroek case 0:
357*66dfcc85SDavid van Moolenbroek printf("no multicast routing compiled into this system\n");
358*66dfcc85SDavid van Moolenbroek return;
359*66dfcc85SDavid van Moolenbroek
360*66dfcc85SDavid van Moolenbroek case IGMP_DVMRP:
361*66dfcc85SDavid van Moolenbroek break;
362*66dfcc85SDavid van Moolenbroek
363*66dfcc85SDavid van Moolenbroek default:
364*66dfcc85SDavid van Moolenbroek printf("multicast routing protocol %u, unknown\n", mrtproto);
365*66dfcc85SDavid van Moolenbroek return;
366*66dfcc85SDavid van Moolenbroek }
367*66dfcc85SDavid van Moolenbroek
368*66dfcc85SDavid van Moolenbroek if (mstaddr == 0) {
369*66dfcc85SDavid van Moolenbroek printf("mrtstat: symbol not in namelist\n");
370*66dfcc85SDavid van Moolenbroek return;
371*66dfcc85SDavid van Moolenbroek }
372*66dfcc85SDavid van Moolenbroek
373*66dfcc85SDavid van Moolenbroek kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat));
374*66dfcc85SDavid van Moolenbroek printf("multicast routing:\n");
375*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s with no route for origin\n",
376*66dfcc85SDavid van Moolenbroek mrtstat.mrts_no_route, plural(mrtstat.mrts_no_route));
377*66dfcc85SDavid van Moolenbroek printf("\t%lu upcall%s made to mrouted\n",
378*66dfcc85SDavid van Moolenbroek mrtstat.mrts_upcalls, plural(mrtstat.mrts_upcalls));
379*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s with malformed tunnel options\n",
380*66dfcc85SDavid van Moolenbroek mrtstat.mrts_bad_tunnel, plural(mrtstat.mrts_bad_tunnel));
381*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s with no room for tunnel options\n",
382*66dfcc85SDavid van Moolenbroek mrtstat.mrts_cant_tunnel, plural(mrtstat.mrts_cant_tunnel));
383*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s arrived on wrong interface\n",
384*66dfcc85SDavid van Moolenbroek mrtstat.mrts_wrong_if, plural(mrtstat.mrts_wrong_if));
385*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s dropped due to upcall Q overflow\n",
386*66dfcc85SDavid van Moolenbroek mrtstat.mrts_upq_ovflw, plural(mrtstat.mrts_upq_ovflw));
387*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s dropped due to upcall socket overflow\n",
388*66dfcc85SDavid van Moolenbroek mrtstat.mrts_upq_sockfull, plural(mrtstat.mrts_upq_sockfull));
389*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s cleaned up by the cache\n",
390*66dfcc85SDavid van Moolenbroek mrtstat.mrts_cache_cleanups, plural(mrtstat.mrts_cache_cleanups));
391*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s dropped selectively by ratelimiter\n",
392*66dfcc85SDavid van Moolenbroek mrtstat.mrts_drop_sel, plural(mrtstat.mrts_drop_sel));
393*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s dropped - bucket Q overflow\n",
394*66dfcc85SDavid van Moolenbroek mrtstat.mrts_q_overflow, plural(mrtstat.mrts_q_overflow));
395*66dfcc85SDavid van Moolenbroek printf("\t%lu datagram%s dropped - larger than bkt size\n",
396*66dfcc85SDavid van Moolenbroek mrtstat.mrts_pkt2large, plural(mrtstat.mrts_pkt2large));
397*66dfcc85SDavid van Moolenbroek }
398