workbench/network/common/include/netinet/ip_var.h

   1 /*
   2  * Copyright (c) 1982, 1986 Regents of the University of California.
   3  * All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  *
  33  *      @(#)ip_var.h    7.7 (Berkeley) 6/28/90
  34  */
  35
  36 #ifndef IP_VAR_H
  37 #define IP_VAR_H
  38
  39 /*
  40  * Overlay for ip header used by other protocols (tcp, udp).
  41  */
  42 struct ipovly {
  43         u_char  ih_x1[9];                       /* (unused) */
  44         u_char  ih_pr;                  /* protocol */
  45         short   ih_len;                 /* protocol length */
  46         struct  in_addr ih_src;         /* source internet address */
  47         struct  in_addr ih_dst;         /* destination internet address */
  48 };
  49
  50 /*
  51  * Ip reassembly queue structure.  Each fragment
  52  * being reassembled is attached to one of these structures.
  53  * They are timed out after ipq_ttl drops to 0, and may also
  54  * be reclaimed if memory becomes tight.
  55  */
  56 struct ipq {
  57         struct  ipq *next,*prev;        /* to other reass headers */
  58         u_char  ipq_ttl;                /* time for reass q to live */
  59         u_char  ipq_p;                  /* protocol of this fragment */
  60         u_short ipq_id;                 /* sequence id for reassembly */
  61         struct  ipasfrag *ipq_next,*ipq_prev;
  62                                         /* to ip headers of fragments */
  63         struct  in_addr ipq_src,ipq_dst;
  64 };
  65
  66 /*
  67  * Ip header, when holding a fragment.
  68  *
  69  * Note: ipf_next must be at same offset as ipq_next above
  70  */
  71 struct  ipasfrag {
  72 #if BYTE_ORDER == LITTLE_ENDIAN
  73         u_char  ip_hl:4;
  74         u_char  ip_v:4;
  75 #endif
  76 #if BYTE_ORDER == BIG_ENDIAN
  77         u_char  ip_v:4;
  78         u_char  ip_hl:4;
  79 #endif
  80         u_char  ipf_mff;                /* copied from (ip_off&IP_MF) */
  81         short   ip_len;
  82         u_short ip_id;
  83         short   ip_off;
  84         u_char  ip_ttl;
  85         u_char  ip_p;
  86         u_short ip_sum;
  87         struct  ipasfrag *ipf_next;     /* next fragment */
  88         struct  ipasfrag *ipf_prev;     /* previous fragment */
  89 };
  90
  91 /*
  92  * Structure stored in mbuf in inpcb.ip_options
  93  * and passed to ip_output when ip options are in use.
  94  * The actual length of the options (including ipopt_dst)
  95  * is in m_len.
  96  */
  97 #define MAX_IPOPTLEN    40
  98
  99 struct ipoption {
 100         struct  in_addr ipopt_dst;      /* first-hop dst if source routed */
 101         char    ipopt_list[MAX_IPOPTLEN];       /* options proper */
 102 };
 103
 104 struct  ipstat {
 105         u_long  ips_total;              /* total packets received */
 106         u_long  ips_badsum;             /* checksum bad */
 107         u_long  ips_tooshort;           /* packet too short */
 108         u_long  ips_toosmall;           /* not enough data */
 109         u_long  ips_badhlen;            /* ip header length < data size */
 110         u_long  ips_badlen;             /* ip length < ip header length */
 111         u_long  ips_fragments;          /* fragments received */
 112         u_long  ips_fragdropped;        /* frags dropped (dups, out of space) */
 113         u_long  ips_fragtimeout;        /* fragments timed out */
 114         u_long  ips_forward;            /* packets forwarded */
 115         u_long  ips_cantforward;        /* packets rcvd for unreachable dest */
 116         u_long  ips_redirectsent;       /* packets forwarded on same net */
 117         u_long  ips_noproto;            /* unknown or unsupported protocol */
 118         u_long  ips_delivered;          /* packets consumed here */
 119         u_long  ips_localout;           /* total ip packets generated here */
 120         u_long  ips_odropped;           /* lost packets due to nobufs, etc. */
 121         u_long  ips_reassembled;        /* total packets reassembled ok */
 122         u_long  ips_fragmented;         /* output packets fragmented ok */
 123         u_long  ips_ofragments;         /* output fragments created */
 124         u_long  ips_cantfrag;           /* don't fragment flag was set, etc. */
 125         u_long  ips_badoptions;         /* error in option processing */
 126         u_long  ips_noroute;            /* packets discarded due to no route */
 127         u_long  ips_badvers;            /* ip version != 4 */
 128         u_long  ips_rawout;             /* total raw ip packets generated */
 129 };
 130
 131 #ifdef KERNEL
 132 /* flags passed to ip_output as last parameter */
 133 #define IP_FORWARDING           0x1             /* most of ip header exists */
 134 #define IP_ROUTETOIF            SO_DONTROUTE    /* bypass routing tables */
 135 #define IP_ALLOWBROADCAST       SO_BROADCAST    /* can send broadcast packets */
 136
 137 /*
 138  * definitions moved to ip_input.c
 139  */
 140 extern struct   ipstat  ipstat;
 141 extern struct   ipq     ipq;                    /* ip reass. queue */
 142 extern u_short  ip_id;                          /* ip packet ctr, for ids */
 143
 144 struct  mbuf *ip_srcroute(void);
 145 #endif
 146
 147 #endif /* !IP_VAR_H */