|
|
1.1 root 1: /*
2: * Copyright (c) 1982, 1986 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution is only permitted until one year after the first shipment
6: * of 4.4BSD by the Regents. Otherwise, redistribution and use in source and
7: * binary forms are permitted provided that: (1) source distributions retain
8: * this entire copyright notice and comment, and (2) distributions including
9: * binaries display the following acknowledgement: This product includes
10: * software developed by the University of California, Berkeley and its
11: * contributors'' in the documentation or other materials provided with the
12: * distribution and in all advertising materials mentioning features or use
13: * of this software. Neither the name of the University nor the names of
14: * its contributors may be used to endorse or promote products derived from
15: * this software without specific prior written permission.
16: * THIS SOFTWARE IS PROVIDED AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
17: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
18: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
19: *
20: * @(#)icmp_var.h 7.5 (Berkeley) 6/28/90
21: */
22:
23: /*
24: * Variables related to this implementation
25: * of the internet control message protocol.
26: */
27: struct icmpstat {
28: /* statistics related to icmp packets generated */
29: int icps_error; /* # of calls to icmp_error */
30: int icps_oldshort; /* no error 'cuz old ip too short */
31: int icps_oldicmp; /* no error 'cuz old was icmp */
32: int icps_outhist[ICMP_MAXTYPE + 1];
33: /* statistics related to input messages processed */
34: int icps_badcode; /* icmp_code out of range */
35: int icps_tooshort; /* packet < ICMP_MINLEN */
36: int icps_checksum; /* bad checksum */
37: int icps_badlen; /* calculated bound mismatch */
38: int icps_reflect; /* number of responses */
39: int icps_inhist[ICMP_MAXTYPE + 1];
40: };
41:
42: #ifdef KERNEL
43: struct icmpstat icmpstat;
44: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.