1 /*-
2 * SPDX-License-Identifier: BSD-4-Clause AND BSD-3-Clause
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 * Copyright (c) 1989 Stephen Deering
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. All advertising materials mentioning features or use of this software
48 * must display the following acknowledgement:
49 * This product includes software developed by the University of
50 * California, Berkeley and its contributors.
51 * 4. Neither the name of the University nor the names of its contributors
52 * may be used to endorse or promote products derived from this software
53 * without specific prior written permission.
54 *
55 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
56 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
57 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
58 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
59 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
60 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
61 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
62 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
63 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
64 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
65 * SUCH DAMAGE.
66 */
67
68 #include <sys/cdefs.h>
69 #ifdef INET6
70 #include <sys/param.h>
71 #include <sys/queue.h>
72 #include <sys/socket.h>
73 #include <sys/sysctl.h>
74 #include <sys/mbuf.h>
75 #include <sys/time.h>
76
77 #include <net/if.h>
78 #include <net/route.h>
79
80 #include <netinet/in.h>
81
82 #include <stdint.h>
83 #include <stdio.h>
84 #include <stdlib.h>
85 #include <stdbool.h>
86 #include <libxo/xo.h>
87
88 #define KERNEL 1
89 struct sockopt;
90 #include <netinet6/ip6_mroute.h>
91 #undef KERNEL
92
93 #include "netstat.h"
94
95 #define WID_ORG (Wflag ? 39 : (numeric_addr ? 29 : 18)) /* width of origin column */
96 #define WID_GRP (Wflag ? 18 : (numeric_addr ? 16 : 18)) /* width of group column */
97
98 void
mroute6pr(void)99 mroute6pr(void)
100 {
101 struct mf6c *mf6ctable[MF6CTBLSIZ], *mfcp;
102 struct mif6_sctl mif6table[MAXMIFS];
103 struct mf6c mfc;
104 struct rtdetq rte, *rtep;
105 struct mif6_sctl *mifp;
106 mifi_t mifi;
107 int i;
108 int banner_printed;
109 int saved_numeric_addr;
110 mifi_t maxmif = 0;
111 long int waitings;
112 size_t len;
113
114 if (live == 0)
115 return;
116
117 len = sizeof(mif6table);
118 if (sysctlbyname("net.inet6.ip6.mif6table", mif6table, &len, NULL, 0) <
119 0) {
120 xo_warn("sysctl: net.inet6.ip6.mif6table");
121 return;
122 }
123
124 saved_numeric_addr = numeric_addr;
125 numeric_addr = 1;
126 banner_printed = 0;
127
128 for (mifi = 0, mifp = mif6table; mifi < MAXMIFS; ++mifi, ++mifp) {
129 char ifname[IFNAMSIZ];
130
131 if (mifp->m6_ifp == 0)
132 continue;
133
134 maxmif = mifi;
135 if (!banner_printed) {
136 xo_open_list("multicast-interface");
137 xo_emit("\n{T:IPv6 Multicast Interface Table}\n"
138 "{T: Mif Rate PhyIF Pkts-In Pkts-Out}\n");
139 banner_printed = 1;
140 }
141
142 xo_open_instance("multicast-interface");
143 xo_emit(" {:mif/%2u} {:rate-limit/%4d}",
144 mifi, mifp->m6_rate_limit);
145 xo_emit(" {:ifname/%5s}", (mifp->m6_flags & MIFF_REGISTER) ?
146 "reg0" : if_indextoname(mifp->m6_ifp, ifname));
147
148 xo_emit(" {:received-packets/%9ju} {:sent-packets/%9ju}\n",
149 (uintmax_t)mifp->m6_pkt_in,
150 (uintmax_t)mifp->m6_pkt_out);
151 xo_close_instance("multicast-interface");
152 }
153 if (banner_printed)
154 xo_open_list("multicast-interface");
155 else
156 xo_emit("\n{T:IPv6 Multicast Interface Table is empty}\n");
157
158 len = sizeof(mf6ctable);
159 if (sysctlbyname("net.inet6.ip6.mf6ctable", mf6ctable, &len, NULL, 0) <
160 0) {
161 xo_warn("sysctl: net.inet6.ip6.mf6ctable");
162 return;
163 }
164
165 banner_printed = 0;
166
167 for (i = 0; i < MF6CTBLSIZ; ++i) {
168 mfcp = mf6ctable[i];
169 while(mfcp) {
170 kread((u_long)mfcp, (char *)&mfc, sizeof(mfc));
171 if (!banner_printed) {
172 xo_open_list("multicast-forwarding-cache");
173 xo_emit("\n"
174 "{T:IPv6 Multicast Forwarding Cache}\n");
175 xo_emit(" {T:%-*.*s} {T:%-*.*s} {T:%s}",
176 WID_ORG, WID_ORG, "Origin",
177 WID_GRP, WID_GRP, "Group",
178 " Packets Waits In-Mif Out-Mifs\n");
179 banner_printed = 1;
180 }
181
182 xo_open_instance("multicast-forwarding-cache");
183
184 xo_emit(" {:origin/%-*.*s}", WID_ORG, WID_ORG,
185 routename(sin6tosa(&mfc.mf6c_origin),
186 numeric_addr));
187 xo_emit(" {:group/%-*.*s}", WID_GRP, WID_GRP,
188 routename(sin6tosa(&mfc.mf6c_mcastgrp),
189 numeric_addr));
190 xo_emit(" {:total-packets/%9ju}",
191 (uintmax_t)mfc.mf6c_pkt_cnt);
192
193 for (waitings = 0, rtep = mfc.mf6c_stall; rtep; ) {
194 waitings++;
195 /* XXX KVM */
196 kread((u_long)rtep, (char *)&rte, sizeof(rte));
197 rtep = rte.next;
198 }
199 xo_emit(" {:waitings/%3ld}", waitings);
200
201 if (mfc.mf6c_parent == MF6C_INCOMPLETE_PARENT)
202 xo_emit(" --- ");
203 else
204 xo_emit(" {:parent/%3d} ", mfc.mf6c_parent);
205 xo_open_list("mif");
206 for (mifi = 0; mifi <= maxmif; mifi++) {
207 if (IF_ISSET(mifi, &mfc.mf6c_ifset))
208 xo_emit(" {l:%u}", mifi);
209 }
210 xo_close_list("mif");
211 xo_emit("\n");
212
213 mfcp = mfc.mf6c_next;
214 xo_close_instance("multicast-forwarding-cache");
215 }
216 }
217 if (banner_printed)
218 xo_close_list("multicast-forwarding-cache");
219 else
220 xo_emit("\n{T:IPv6 Multicast Forwarding Table is empty}\n");
221
222 xo_emit("\n");
223 numeric_addr = saved_numeric_addr;
224 }
225
226 void
mrt6_stats(void)227 mrt6_stats(void)
228 {
229 struct mrt6stat mrtstat;
230
231 if (fetch_stats("net.inet6.ip6.mrt6stat", 0, &mrtstat,
232 sizeof(mrtstat), kread_counters) != 0)
233 return;
234
235 xo_open_container("multicast-statistics");
236 xo_emit("{T:IPv6 multicast forwarding}:\n");
237
238 #define p(f, m) if (mrtstat.f || sflag <= 1) \
239 xo_emit(m, (uintmax_t)mrtstat.f, plural(mrtstat.f))
240 #define p2(f, m) if (mrtstat.f || sflag <= 1) \
241 xo_emit(m, (uintmax_t)mrtstat.f, plurales(mrtstat.f))
242
243 p(mrt6s_mfc_lookups, "\t{:cache-lookups/%ju} "
244 "{N:/multicast forwarding cache lookup%s}\n");
245 p2(mrt6s_mfc_misses, "\t{:cache-misses/%ju} "
246 "{N:/multicast forwarding cache miss%s}\n");
247 p(mrt6s_upcalls, "\t{:upcalls/%ju} "
248 "{N:/upcall%s to multicast routing daemon}\n");
249 p(mrt6s_upq_ovflw, "\t{:upcall-overflows/%ju} "
250 "{N:/upcall queue overflow%s}\n");
251 p(mrt6s_upq_sockfull, "\t{:upcalls-dropped-full-buffer/%ju} "
252 "{N:/upcall%s dropped due to full socket buffer}\n");
253 p(mrt6s_cache_cleanups, "\t{:cache-cleanups/%ju} "
254 "{N:/cache cleanup%s}\n");
255 p(mrt6s_no_route, "\t{:dropped-no-origin/%ju} "
256 "{N:/datagram%s with no route for origin}\n");
257 p(mrt6s_bad_tunnel, "\t{:dropped-bad-tunnel/%ju} "
258 "{N:/datagram%s arrived with bad tunneling}\n");
259 p(mrt6s_cant_tunnel, "\t{:dropped-could-not-tunnel/%ju} "
260 "{N:/datagram%s could not be tunneled}\n");
261 p(mrt6s_wrong_if, "\t{:dropped-wrong-incoming-interface/%ju} "
262 "{N:/datagram%s arrived on wrong interface}\n");
263 p(mrt6s_drop_sel, "\t{:dropped-selectively/%ju} "
264 "{N:/datagram%s selectively dropped}\n");
265 p(mrt6s_q_overflow, "\t{:dropped-queue-overflow/%ju} "
266 "{N:/datagram%s dropped due to queue overflow}\n");
267 p(mrt6s_pkt2large, "\t{:dropped-too-large/%ju} "
268 "{N:/datagram%s dropped for being too large}\n");
269
270 #undef p2
271 #undef p
272 xo_close_container("multicast-statistics");
273 }
274 #endif /*INET6*/
275