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