Annotation of 43BSD/sys/netinet/icmp_var.h, revision 1.1

1.1     ! root        1: /*
        !             2:  * Copyright (c) 1982, 1986 Regents of the University of California.
        !             3:  * All rights reserved.  The Berkeley software License Agreement
        !             4:  * specifies the terms and conditions for redistribution.
        !             5:  *
        !             6:  *     @(#)icmp_var.h  7.2 (Berkeley) 1/13/87
        !             7:  */
        !             8: 
        !             9: /*
        !            10:  * Variables related to this implementation
        !            11:  * of the internet control message protocol.
        !            12:  */
        !            13: struct icmpstat {
        !            14: /* statistics related to icmp packets generated */
        !            15:        int     icps_error;             /* # of calls to icmp_error */
        !            16:        int     icps_oldshort;          /* no error 'cuz old ip too short */
        !            17:        int     icps_oldicmp;           /* no error 'cuz old was icmp */
        !            18:        int     icps_outhist[ICMP_MAXTYPE + 1];
        !            19: /* statistics related to input messages processed */
        !            20:        int     icps_badcode;           /* icmp_code out of range */
        !            21:        int     icps_tooshort;          /* packet < ICMP_MINLEN */
        !            22:        int     icps_checksum;          /* bad checksum */
        !            23:        int     icps_badlen;            /* calculated bound mismatch */
        !            24:        int     icps_reflect;           /* number of responses */
        !            25:        int     icps_inhist[ICMP_MAXTYPE + 1];
        !            26: };
        !            27: 
        !            28: #ifdef KERNEL
        !            29: struct icmpstat icmpstat;
        !            30: #endif

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.