home *** CD-ROM | disk | FTP | other *** search
- /*
- * $Id: ip_var.h,v 1.3 1993/06/30 05:45:25 jraja Exp $
- *
- * HISTORY
- * $Log: ip_var.h,v $
- * Revision 1.3 1993/06/30 05:45:25 jraja
- * Changed bitfield definitions to be more like ANSI-C.
- *
- * Revision 1.2 1993/03/03 21:35:28 jraja
- * Moved data definitions to ip_input.c.
- *
- * Revision 1.1 92/11/17 16:29:56 16:29:56 jraja (Jarno Tapio Rajahalme)
- * Initial revision
- *
- *
- */
-
- /*
- * Copyright (c) 1982, 1986 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.
- * 3. All advertising materials mentioning features or use of this software
- * must display the following acknowledgement:
- * This product includes software developed by the University of
- * California, Berkeley and its contributors.
- * 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.
- *
- * @(#)ip_var.h 7.7 (Berkeley) 6/28/90
- */
-
- #ifndef IP_VAR_H
- #define IP_VAR_H
-
- /*
- * Overlay for ip header used by other protocols (tcp, udp).
- */
- struct ipovly {
- caddr_t ih_next, ih_prev; /* for protocol sequence q's */
- u_char ih_x1; /* (unused) */
- u_char ih_pr; /* protocol */
- short ih_len; /* protocol length */
- struct in_addr ih_src; /* source internet address */
- struct in_addr ih_dst; /* destination internet address */
- };
-
- /*
- * Ip reassembly queue structure. Each fragment
- * being reassembled is attached to one of these structures.
- * They are timed out after ipq_ttl drops to 0, and may also
- * be reclaimed if memory becomes tight.
- */
- struct ipq {
- struct ipq *next,*prev; /* to other reass headers */
- u_char ipq_ttl; /* time for reass q to live */
- u_char ipq_p; /* protocol of this fragment */
- u_short ipq_id; /* sequence id for reassembly */
- struct ipasfrag *ipq_next,*ipq_prev;
- /* to ip headers of fragments */
- struct in_addr ipq_src,ipq_dst;
- };
-
- /*
- * Ip header, when holding a fragment.
- *
- * Note: ipf_next must be at same offset as ipq_next above
- */
- struct ipasfrag {
- #if BYTE_ORDER == LITTLE_ENDIAN
- u_char ip_hl:4;
- u_char ip_v:4;
- #endif
- #if BYTE_ORDER == BIG_ENDIAN
- u_char ip_v:4;
- u_char ip_hl:4;
- #endif
- u_char ipf_mff; /* copied from (ip_off&IP_MF) */
- short ip_len;
- u_short ip_id;
- short ip_off;
- u_char ip_ttl;
- u_char ip_p;
- u_short ip_sum;
- struct ipasfrag *ipf_next; /* next fragment */
- struct ipasfrag *ipf_prev; /* previous fragment */
- };
-
- /*
- * Structure stored in mbuf in inpcb.ip_options
- * and passed to ip_output when ip options are in use.
- * The actual length of the options (including ipopt_dst)
- * is in m_len.
- */
- #define MAX_IPOPTLEN 40
-
- struct ipoption {
- struct in_addr ipopt_dst; /* first-hop dst if source routed */
- char ipopt_list[MAX_IPOPTLEN]; /* options proper */
- };
-
- struct ipstat {
- long ips_total; /* total packets received */
- long ips_badsum; /* checksum bad */
- long ips_tooshort; /* packet too short */
- long ips_toosmall; /* not enough data */
- long ips_badhlen; /* ip header length < data size */
- long ips_badlen; /* ip length < ip header length */
- long ips_fragments; /* fragments received */
- long ips_fragdropped; /* frags dropped (dups, out of space) */
- long ips_fragtimeout; /* fragments timed out */
- long ips_forward; /* packets forwarded */
- long ips_cantforward; /* packets rcvd for unreachable dest */
- long ips_redirectsent; /* packets forwarded on same net */
- long ips_noproto; /* unknown or unsupported protocol */
- long ips_delivered; /* packets consumed here */
- long ips_localout; /* total ip packets generated here */
- long ips_odropped; /* lost packets due to nobufs, etc. */
- long ips_reassembled; /* total packets reassembled ok */
- long ips_fragmented; /* output packets fragmented ok */
- long ips_ofragments; /* output fragments created */
- long ips_cantfrag; /* don't fragment flag was set, etc. */
- };
-
- #ifdef KERNEL
- /* flags passed to ip_output as last parameter */
- #define IP_FORWARDING 0x1 /* most of ip header exists */
- #define IP_ROUTETOIF SO_DONTROUTE /* bypass routing tables */
- #define IP_ALLOWBROADCAST SO_BROADCAST /* can send broadcast packets */
-
- /*
- * definitions moved to ip_input.c
- */
- extern struct ipstat ipstat;
- extern struct ipq ipq; /* ip reass. queue */
- extern u_short ip_id; /* ip packet ctr, for ids */
-
- struct mbuf *ip_srcroute(void);
- #endif
-
- #endif /* !IP_VAR_H */
-