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 * from: @(#)ip_var.h 7.7 (Berkeley) 6/28/90 34 * $Id: ip_var.h,v 1.3 1993/05/20 03:50:29 cgd Exp $ 35 */ 36 37 #ifndef _NETINET_IP_VAR_H_ 38 #define _NETINET_IP_VAR_H_ 39 40 /* 41 * Overlay for ip header used by other protocols (tcp, udp). 42 */ 43 struct ipovly { 44 caddr_t ih_next, ih_prev; /* for protocol sequence q's */ 45 u_char ih_x1; /* (unused) */ 46 u_char ih_pr; /* protocol */ 47 short ih_len; /* protocol length */ 48 struct in_addr ih_src; /* source internet address */ 49 struct in_addr ih_dst; /* destination internet address */ 50 }; 51 52 /* 53 * Ip reassembly queue structure. Each fragment 54 * being reassembled is attached to one of these structures. 55 * They are timed out after ipq_ttl drops to 0, and may also 56 * be reclaimed if memory becomes tight. 57 */ 58 struct ipq { 59 struct ipq *next,*prev; /* to other reass headers */ 60 u_char ipq_ttl; /* time for reass q to live */ 61 u_char ipq_p; /* protocol of this fragment */ 62 u_short ipq_id; /* sequence id for reassembly */ 63 struct ipasfrag *ipq_next,*ipq_prev; 64 /* to ip headers of fragments */ 65 struct in_addr ipq_src,ipq_dst; 66 }; 67 68 /* 69 * Ip header, when holding a fragment. 70 * 71 * Note: ipf_next must be at same offset as ipq_next above 72 */ 73 struct ipasfrag { 74 #if BYTE_ORDER == LITTLE_ENDIAN 75 u_char ip_hl:4, 76 ip_v:4; 77 #endif 78 #if BYTE_ORDER == BIG_ENDIAN 79 u_char ip_v:4, 80 ip_hl:4; 81 #endif 82 u_char ipf_mff; /* copied from (ip_off&IP_MF) */ 83 short ip_len; 84 u_short ip_id; 85 short ip_off; 86 u_char ip_ttl; 87 u_char ip_p; 88 u_short ip_sum; 89 struct ipasfrag *ipf_next; /* next fragment */ 90 struct ipasfrag *ipf_prev; /* previous fragment */ 91 }; 92 93 /* 94 * Structure stored in mbuf in inpcb.ip_options 95 * and passed to ip_output when ip options are in use. 96 * The actual length of the options (including ipopt_dst) 97 * is in m_len. 98 */ 99 #define MAX_IPOPTLEN 40 100 101 struct ipoption { 102 struct in_addr ipopt_dst; /* first-hop dst if source routed */ 103 char ipopt_list[MAX_IPOPTLEN]; /* options proper */ 104 }; 105 106 struct ipstat { 107 long ips_total; /* total packets received */ 108 long ips_badsum; /* checksum bad */ 109 long ips_tooshort; /* packet too short */ 110 long ips_toosmall; /* not enough data */ 111 long ips_badhlen; /* ip header length < data size */ 112 long ips_badlen; /* ip length < ip header length */ 113 long ips_fragments; /* fragments received */ 114 long ips_fragdropped; /* frags dropped (dups, out of space) */ 115 long ips_fragtimeout; /* fragments timed out */ 116 long ips_forward; /* packets forwarded */ 117 long ips_cantforward; /* packets rcvd for unreachable dest */ 118 long ips_redirectsent; /* packets forwarded on same net */ 119 long ips_noproto; /* unknown or unsupported protocol */ 120 long ips_delivered; /* packets consumed here */ 121 long ips_localout; /* total ip packets generated here */ 122 long ips_odropped; /* lost packets due to nobufs, etc. */ 123 long ips_reassembled; /* total packets reassembled ok */ 124 long ips_fragmented; /* output packets fragmented ok */ 125 long ips_ofragments; /* output fragments created */ 126 long ips_cantfrag; /* don't fragment flag was set, etc. */ 127 }; 128 129 #ifdef KERNEL 130 /* flags passed to ip_output as last parameter */ 131 #define IP_FORWARDING 0x1 /* most of ip header exists */ 132 #define IP_ROUTETOIF SO_DONTROUTE /* bypass routing tables */ 133 #define IP_ALLOWBROADCAST SO_BROADCAST /* can send broadcast packets */ 134 135 struct ipstat ipstat; 136 struct ipq ipq; /* ip reass. queue */ 137 u_short ip_id; /* ip packet ctr, for ids */ 138 139 struct mbuf *ip_srcroute(); 140 #endif 141 142 #endif /* !_NETINET_IP_VAR_H_ */ 143