1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1980, 1992, 1993
5 * The Regents of the University of California. 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 University 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 REGENTS 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 REGENTS 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 #ifdef lint
34 static const char sccsid[] = "@(#)mbufs.c 8.1 (Berkeley) 6/6/93";
35 #endif
36
37 /* From:
38 "Id: mbufs.c,v 1.5 1997/02/24 20:59:03 wollman Exp"
39 */
40
41 #include <sys/param.h>
42 #include <sys/types.h>
43 #include <sys/socket.h>
44 #include <sys/sysctl.h>
45
46 #include <netinet/in.h>
47 #include <netinet/in_systm.h>
48 #include <netinet/ip.h>
49 #include <netinet/ip_var.h>
50 #include <netinet/udp.h>
51 #include <netinet/udp_var.h>
52
53 #include <inttypes.h>
54 #include <stdlib.h>
55 #include <string.h>
56 #include <paths.h>
57
58 #include "systat.h"
59 #include "extern.h"
60 #include "mode.h"
61
62 struct stat {
63 struct ipstat i;
64 struct udpstat u;
65 };
66
67 static struct stat curstat, initstat, oldstat;
68
69 /*-
70 --0 1 2 3 4 5 6 7
71 --0123456789012345678901234567890123456789012345678901234567890123456789012345
72 00 IP Input IP Output
73 01999999999 total packets received 999999999 total packets sent
74 02999999999 - with bad checksums 999999999 - generated locally
75 03999999999 - too short for header 999999999 - output drops
76 04999999999 - too short for data 999999999 output fragments generated
77 05999999999 - with invalid hlen 999999999 - fragmentation failed
78 06999999999 - with invalid length 999999999 destinations unreachable
79 07999999999 - with invalid version 999999999 packets output via raw IP
80 08999999999 - jumbograms
81 09999999999 total fragments received UDP Statistics
82 10999999999 - fragments dropped 999999999 total input packets
83 11999999999 - fragments timed out 999999999 - too short for header
84 12999999999 - packets reassembled ok 999999999 - invalid checksum
85 13999999999 packets forwarded 999999999 - no checksum
86 14999999999 - unreachable dests 999999999 - invalid length
87 15999999999 - redirects generated 999999999 - no socket for dest port
88 16999999999 option errors 999999999 - no socket for broadcast
89 17999999999 unwanted multicasts 999999999 - socket buffer full
90 18999999999 delivered to upper layer 999999999 total output packets
91 --0123456789012345678901234567890123456789012345678901234567890123456789012345
92 --0 1 2 3 4 5 6 7
93 */
94
95 WINDOW *
openip(void)96 openip(void)
97 {
98 return (subwin(stdscr, LINES-3-1, 0, MAINWIN_ROW, 0));
99 }
100
101 void
closeip(WINDOW * w)102 closeip(WINDOW *w)
103 {
104 if (w == NULL)
105 return;
106 wclear(w);
107 wrefresh(w);
108 delwin(w);
109 }
110
111 void
labelip(void)112 labelip(void)
113 {
114 wmove(wnd, 0, 0); wclrtoeol(wnd);
115 #define L(row, str) mvwprintw(wnd, row, 10, str)
116 #define R(row, str) mvwprintw(wnd, row, 45, str);
117 L(0, "IP Input"); R(0, "IP Output");
118 L(1, "total packets received"); R(1, "total packets sent");
119 L(2, "- with bad checksums"); R(2, "- generated locally");
120 L(3, "- too short for header"); R(3, "- output drops");
121 L(4, "- too short for data"); R(4, "output fragments generated");
122 L(5, "- with invalid hlen"); R(5, "- fragmentation failed");
123 L(6, "- with invalid length"); R(6, "destinations unreachable");
124 L(7, "- with invalid version"); R(7, "packets output via raw IP");
125 L(8, "- jumbograms");
126 L(9, "total fragments received"); R(9, "UDP Statistics");
127 L(10, "- fragments dropped"); R(10, "total input packets");
128 L(11, "- fragments timed out"); R(11, "- too short for header");
129 L(12, "- packets reassembled ok"); R(12, "- invalid checksum");
130 L(13, "packets forwarded"); R(13, "- no checksum");
131 L(14, "- unreachable dests"); R(14, "- invalid length");
132 L(15, "- redirects generated"); R(15, "- no socket for dest port");
133 L(16, "option errors"); R(16, "- no socket for broadcast");
134 L(17, "unwanted multicasts"); R(17, "- socket buffer full");
135 L(18, "delivered to upper layer"); R(18, "total output packets");
136 #undef L
137 #undef R
138 }
139
140 static void
domode(struct stat * ret)141 domode(struct stat *ret)
142 {
143 const struct stat *sub;
144 int divisor = 1;
145
146 switch(currentmode) {
147 case display_RATE:
148 sub = &oldstat;
149 divisor = (delay > 1000000) ? delay / 1000000 : 1;
150 break;
151 case display_DELTA:
152 sub = &oldstat;
153 break;
154 case display_SINCE:
155 sub = &initstat;
156 break;
157 default:
158 *ret = curstat;
159 return;
160 }
161 #define DO(stat) ret->stat = (curstat.stat - sub->stat) / divisor
162 DO(i.ips_total);
163 DO(i.ips_badsum);
164 DO(i.ips_tooshort);
165 DO(i.ips_toosmall);
166 DO(i.ips_badhlen);
167 DO(i.ips_badlen);
168 DO(i.ips_fragments);
169 DO(i.ips_fragdropped);
170 DO(i.ips_fragtimeout);
171 DO(i.ips_forward);
172 DO(i.ips_cantforward);
173 DO(i.ips_redirectsent);
174 DO(i.ips_noproto);
175 DO(i.ips_delivered);
176 DO(i.ips_localout);
177 DO(i.ips_odropped);
178 DO(i.ips_reassembled);
179 DO(i.ips_fragmented);
180 DO(i.ips_ofragments);
181 DO(i.ips_cantfrag);
182 DO(i.ips_badoptions);
183 DO(i.ips_noroute);
184 DO(i.ips_badvers);
185 DO(i.ips_rawout);
186 DO(i.ips_toolong);
187 DO(i.ips_notmember);
188 DO(u.udps_ipackets);
189 DO(u.udps_hdrops);
190 DO(u.udps_badsum);
191 DO(u.udps_nosum);
192 DO(u.udps_badlen);
193 DO(u.udps_noport);
194 DO(u.udps_noportbcast);
195 DO(u.udps_fullsock);
196 DO(u.udps_opackets);
197 #undef DO
198 }
199
200 void
showip(void)201 showip(void)
202 {
203 struct stat stats;
204 uint64_t totalout;
205
206 domode(&stats);
207 totalout = stats.i.ips_forward + stats.i.ips_localout;
208
209 #define DO(stat, row, col) \
210 mvwprintw(wnd, row, col, "%9"PRIu64, stats.stat)
211
212 DO(i.ips_total, 1, 0);
213 mvwprintw(wnd, 1, 35, "%9"PRIu64, totalout);
214 DO(i.ips_badsum, 2, 0);
215 DO(i.ips_localout, 2, 35);
216 DO(i.ips_tooshort, 3, 0);
217 DO(i.ips_odropped, 3, 35);
218 DO(i.ips_toosmall, 4, 0);
219 DO(i.ips_ofragments, 4, 35);
220 DO(i.ips_badhlen, 5, 0);
221 DO(i.ips_cantfrag, 5, 35);
222 DO(i.ips_badlen, 6, 0);
223 DO(i.ips_noroute, 6, 35);
224 DO(i.ips_badvers, 7, 0);
225 DO(i.ips_rawout, 7, 35);
226 DO(i.ips_toolong, 8, 0);
227 DO(i.ips_fragments, 9, 0);
228 DO(i.ips_fragdropped, 10, 0);
229 DO(u.udps_ipackets, 10, 35);
230 DO(i.ips_fragtimeout, 11, 0);
231 DO(u.udps_hdrops, 11, 35);
232 DO(i.ips_reassembled, 12, 0);
233 DO(u.udps_badsum, 12, 35);
234 DO(i.ips_forward, 13, 0);
235 DO(u.udps_nosum, 13, 35);
236 DO(i.ips_cantforward, 14, 0);
237 DO(u.udps_badlen, 14, 35);
238 DO(i.ips_redirectsent, 15, 0);
239 DO(u.udps_noport, 15, 35);
240 DO(i.ips_badoptions, 16, 0);
241 DO(u.udps_noportbcast, 16, 35);
242 DO(i.ips_notmember, 17, 0);
243 DO(u.udps_fullsock, 17, 35);
244 DO(i.ips_delivered, 18, 0);
245 DO(u.udps_opackets, 18, 35);
246 #undef DO
247 }
248
249 int
initip(void)250 initip(void)
251 {
252 size_t len;
253 int name[4];
254
255 name[0] = CTL_NET;
256 name[1] = PF_INET;
257 name[2] = IPPROTO_IP;
258 name[3] = IPCTL_STATS;
259
260 len = 0;
261 if (sysctl(name, 4, 0, &len, 0, 0) < 0) {
262 error("sysctl getting ipstat size failed");
263 return 0;
264 }
265 if (len > sizeof curstat.i) {
266 error("ipstat structure has grown--recompile systat!");
267 return 0;
268 }
269 if (sysctl(name, 4, &initstat.i, &len, 0, 0) < 0) {
270 error("sysctl getting ipstat failed");
271 return 0;
272 }
273 name[2] = IPPROTO_UDP;
274 name[3] = UDPCTL_STATS;
275
276 len = 0;
277 if (sysctl(name, 4, 0, &len, 0, 0) < 0) {
278 error("sysctl getting udpstat size failed");
279 return 0;
280 }
281 if (len > sizeof curstat.u) {
282 error("ipstat structure has grown--recompile systat!");
283 return 0;
284 }
285 if (sysctl(name, 4, &initstat.u, &len, 0, 0) < 0) {
286 error("sysctl getting udpstat failed");
287 return 0;
288 }
289 oldstat = initstat;
290 return 1;
291 }
292
293 void
resetip(void)294 resetip(void)
295 {
296 size_t len;
297 int name[4];
298
299 name[0] = CTL_NET;
300 name[1] = PF_INET;
301 name[2] = IPPROTO_IP;
302 name[3] = IPCTL_STATS;
303
304 len = sizeof initstat.i;
305 if (sysctl(name, 4, &initstat.i, &len, 0, 0) < 0) {
306 error("sysctl getting ipstat failed");
307 }
308 name[2] = IPPROTO_UDP;
309 name[3] = UDPCTL_STATS;
310
311 len = sizeof initstat.u;
312 if (sysctl(name, 4, &initstat.u, &len, 0, 0) < 0) {
313 error("sysctl getting udpstat failed");
314 }
315 oldstat = initstat;
316 }
317
318 void
fetchip(void)319 fetchip(void)
320 {
321 int name[4];
322 size_t len;
323
324 oldstat = curstat;
325 name[0] = CTL_NET;
326 name[1] = PF_INET;
327 name[2] = IPPROTO_IP;
328 name[3] = IPCTL_STATS;
329 len = sizeof curstat.i;
330
331 if (sysctl(name, 4, &curstat.i, &len, 0, 0) < 0)
332 return;
333 name[2] = IPPROTO_UDP;
334 name[3] = UDPCTL_STATS;
335 len = sizeof curstat.u;
336
337 if (sysctl(name, 4, &curstat.u, &len, 0, 0) < 0)
338 return;
339 }
340