1 /* $NetBSD: mroute6.c,v 1.15 2014/11/06 21:30:09 christos 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 #define WID_ORG (lflag ? 39 : (numeric_addr ? 29 : 18)) /* width of origin column */
125 #define WID_GRP (lflag ? 18 : (numeric_addr ? 16 : 18)) /* width of group column */
126
127 void
mroute6pr(u_long mrpaddr,u_long mfcaddr,u_long mifaddr)128 mroute6pr(u_long mrpaddr, u_long mfcaddr, u_long mifaddr)
129 {
130 u_int mrtproto;
131 struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp;
132 struct mif6 mif6table[MAXMIFS];
133 struct mf6c mfc;
134 struct rtdetq rte, *rtep;
135 register struct mif6 *mifp;
136 register mifi_t mifi;
137 register int i;
138 register int banner_printed;
139 register int saved_numeric_addr;
140 int waitings;
141
142 if (mrpaddr == 0) {
143 printf("mroute6pr: symbol not in namelist\n");
144 return;
145 }
146
147 kread(mrpaddr, (char *)&mrtproto, sizeof(mrtproto));
148 switch (mrtproto) {
149 case 0:
150 printf("no IPv6 multicast routing compiled into this system\n");
151 return;
152
153 case IPPROTO_PIM:
154 break;
155
156 default:
157 printf("IPv6 multicast routing protocol %u, unknown\n",
158 mrtproto);
159 return;
160 }
161
162 if (mfcaddr == 0) {
163 printf("mf6ctable: symbol not in namelist\n");
164 return;
165 }
166 if (mifaddr == 0) {
167 printf("miftable: symbol not in namelist\n");
168 return;
169 }
170
171 saved_numeric_addr = numeric_addr;
172 numeric_addr = 1;
173
174 kread(mifaddr, (char *)&mif6table, sizeof(mif6table));
175 banner_printed = 0;
176 for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) {
177 struct ifnet ifnet;
178 char ifname[IFNAMSIZ];
179
180 if (mifp->m6_ifp == NULL)
181 continue;
182
183 kread((u_long)mifp->m6_ifp, (char *)&ifnet, sizeof(ifnet));
184 if (!banner_printed) {
185 printf("\nIPv6 Multicast Interface Table\n"
186 " Mif Rate PhyIF Pkts-In Pkts-Out\n");
187 banner_printed = 1;
188 }
189
190 printf(" %2u %4d", mifi, mifp->m6_rate_limit);
191 printf(" %5s", (mifp->m6_flags & MIFF_REGISTER) ?
192 "reg0" : if_indextoname(ifnet.if_index, ifname));
193
194 printf(" %9llu %9llu\n", (unsigned long long)mifp->m6_pkt_in,
195 (unsigned long long)mifp->m6_pkt_out);
196 }
197 if (!banner_printed)
198 printf("\nIPv6 Multicast Interface Table is empty\n");
199
200 kread(mfcaddr, (char *)&mf6ctable, sizeof(mf6ctable));
201 banner_printed = 0;
202 for (i = 0; i < MF6CTBLSIZ; ++i) {
203 mfcp = mf6ctable[i];
204 while(mfcp) {
205 kread((u_long)mfcp, (char *)&mfc, sizeof(mfc));
206 if (!banner_printed) {
207 printf ("\nIPv6 Multicast Forwarding Cache\n");
208 printf(" %-*.*s %-*.*s %s",
209 WID_ORG, WID_ORG, "Origin",
210 WID_GRP, WID_GRP, "Group",
211 " Packets Waits In-Mif Out-Mifs\n");
212 banner_printed = 1;
213 }
214
215 printf(" %-*.*s", WID_ORG, WID_ORG,
216 routename6(&mfc.mf6c_origin, nflag));
217 printf(" %-*.*s", WID_GRP, WID_GRP,
218 routename6(&mfc.mf6c_mcastgrp, nflag));
219 printf(" %9llu", (unsigned long long)mfc.mf6c_pkt_cnt);
220
221 for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) {
222 waitings++;
223 kread((u_long)rtep, (char *)&rte, sizeof(rte));
224 rtep = rte.next;
225 }
226 printf(" %3d", waitings);
227
228 if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT)
229 printf(" --- ");
230 else
231 printf(" %3d ", mfc.mf6c_parent);
232 for (mifi = 0; mifi <= MAXMIFS; mifi++) {
233 if (IF_ISSET(mifi, &mfc.mf6c_ifset))
234 printf(" %u", mifi);
235 }
236 printf("\n");
237
238 mfcp = mfc.mf6c_next;
239 }
240 }
241 if (!banner_printed)
242 printf("\nIPv6 Multicast Routing Table is empty\n");
243
244 printf("\n");
245 numeric_addr = saved_numeric_addr;
246 }
247
248 void
mrt6_stats(u_long mrpaddr,u_long mstaddr)249 mrt6_stats(u_long mrpaddr, u_long mstaddr)
250 {
251 #define p(f, m) printf(m, (unsigned long long)mrtstat.f, plural(mrtstat.f))
252 #define pes(f, m) printf(m, (unsigned long long)mrtstat.f, plurales(mrtstat.f))
253 u_int mrtproto;
254 struct mrt6stat mrtstat;
255
256 if (mrpaddr == 0) {
257 printf("mrt6_stats: symbol not in namelist\n");
258 return;
259 }
260
261 kread(mrpaddr, (char *)&mrtproto, sizeof(mrtproto));
262 switch (mrtproto) {
263 case 0:
264 printf("no IPv6 multicast routing compiled into this system\n");
265 return;
266
267 case IPPROTO_PIM:
268 break;
269
270 default:
271 printf("IPv6 multicast routing protocol %u, unknown\n",
272 mrtproto);
273 return;
274 }
275
276 if (mstaddr == 0) {
277 printf("mrt6_stats: symbol not in namelist\n");
278 return;
279 }
280
281 kread(mstaddr, (char *)&mrtstat, sizeof(mrtstat));
282 printf("multicast forwarding:\n");
283 p(mrt6s_mfc_lookups, " %10llu multicast forwarding cache lookup%s\n");
284 pes(mrt6s_mfc_misses, " %10llu multicast forwarding cache miss%s\n");
285 p(mrt6s_upcalls, " %10llu upcall%s to mrouted\n");
286 p(mrt6s_upq_ovflw, " %10llu upcall queue overflow%s\n");
287 p(mrt6s_upq_sockfull,
288 " %10llu upcall%s dropped due to full socket buffer\n");
289 p(mrt6s_cache_cleanups, " %10llu cache cleanup%s\n");
290 p(mrt6s_no_route, " %10llu datagram%s with no route for origin\n");
291 p(mrt6s_bad_tunnel, " %10llu datagram%s arrived with bad tunneling\n");
292 p(mrt6s_cant_tunnel, " %10llu datagram%s could not be tunneled\n");
293 p(mrt6s_wrong_if, " %10llu datagram%s arrived on wrong interface\n");
294 p(mrt6s_drop_sel, " %10llu datagram%s selectively dropped\n");
295 p(mrt6s_q_overflow,
296 " %10llu datagram%s dropped due to queue overflow\n");
297 p(mrt6s_pkt2large, " %10llu datagram%s dropped for being too large\n");
298 #undef p
299 #undef pes
300 }
301 #endif /*INET6*/
302