ip6.h revision 1.5
1 /* $NetBSD: ip6.h,v 1.5 2000/02/24 09:55:24 itojun Exp $ */ 2 3 /* 4 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the project nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 /* 33 * Copyright (c) 1982, 1986, 1993 34 * The Regents of the University of California. All rights reserved. 35 * 36 * Redistribution and use in source and binary forms, with or without 37 * modification, are permitted provided that the following conditions 38 * are met: 39 * 1. Redistributions of source code must retain the above copyright 40 * notice, this list of conditions and the following disclaimer. 41 * 2. Redistributions in binary form must reproduce the above copyright 42 * notice, this list of conditions and the following disclaimer in the 43 * documentation and/or other materials provided with the distribution. 44 * 3. All advertising materials mentioning features or use of this software 45 * must display the following acknowledgement: 46 * This product includes software developed by the University of 47 * California, Berkeley and its contributors. 48 * 4. Neither the name of the University nor the names of its contributors 49 * may be used to endorse or promote products derived from this software 50 * without specific prior written permission. 51 * 52 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 53 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 54 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 55 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 56 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 57 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 58 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 59 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 60 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 61 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 62 * SUCH DAMAGE. 63 * 64 * @(#)ip.h 8.1 (Berkeley) 6/10/93 65 */ 66 67 #ifndef _NETINET_IP6_H_ 68 #define _NETINET_IP6_H_ 69 70 /* 71 * Definition for internet protocol version 6. 72 * RFC 2460 73 */ 74 75 struct ip6_hdr { 76 union { 77 struct ip6_hdrctl { 78 u_int32_t ip6_un1_flow; /* 20 bits of flow-ID */ 79 u_int16_t ip6_un1_plen; /* payload length */ 80 u_int8_t ip6_un1_nxt; /* next header */ 81 u_int8_t ip6_un1_hlim; /* hop limit */ 82 } ip6_un1; 83 u_int8_t ip6_un2_vfc; /* 4 bits version, 4 bits class */ 84 } ip6_ctlun; 85 struct in6_addr ip6_src; /* source address */ 86 struct in6_addr ip6_dst; /* destination address */ 87 }; 88 89 #define ip6_vfc ip6_ctlun.ip6_un2_vfc 90 #define ip6_flow ip6_ctlun.ip6_un1.ip6_un1_flow 91 #define ip6_plen ip6_ctlun.ip6_un1.ip6_un1_plen 92 #define ip6_nxt ip6_ctlun.ip6_un1.ip6_un1_nxt 93 #define ip6_hlim ip6_ctlun.ip6_un1.ip6_un1_hlim 94 #define ip6_hops ip6_ctlun.ip6_un1.ip6_un1_hlim 95 96 #define IPV6_VERSION 0x60 97 #define IPV6_VERSION_MASK 0xf0 98 99 #if BYTE_ORDER == BIG_ENDIAN 100 #define IPV6_FLOWINFO_MASK 0x0fffffff /* flow info (28 bits) */ 101 #define IPV6_FLOWLABEL_MASK 0x000fffff /* flow label (20 bits) */ 102 #else 103 #if BYTE_ORDER == LITTLE_ENDIAN 104 #define IPV6_FLOWINFO_MASK 0xffffff0f /* flow info (28 bits) */ 105 #define IPV6_FLOWLABEL_MASK 0xffff0f00 /* flow label (20 bits) */ 106 #endif /* LITTLE_ENDIAN */ 107 #endif 108 #if 1 109 /* ECN bits proposed by Sally Floyd */ 110 #define IP6TOS_CE 0x01 /* congestion experienced */ 111 #define IP6TOS_ECT 0x02 /* ECN-capable transport */ 112 #endif 113 114 /* 115 * Extension Headers 116 */ 117 118 struct ip6_ext { 119 u_char ip6e_nxt; 120 u_char ip6e_len; 121 }; 122 123 /* Hop-by-Hop options header */ 124 /* XXX should we pad it to force alignment on an 8-byte boundary? */ 125 struct ip6_hbh { 126 u_int8_t ip6h_nxt; /* next header */ 127 u_int8_t ip6h_len; /* length in units of 8 octets */ 128 /* followed by options */ 129 }; 130 131 /* Destination options header */ 132 /* XXX should we pad it to force alignment on an 8-byte boundary? */ 133 struct ip6_dest { 134 u_int8_t ip6d_nxt; /* next header */ 135 u_int8_t ip6d_len; /* length in units of 8 octets */ 136 /* followed by options */ 137 }; 138 139 /* Option types and related macros */ 140 #define IP6OPT_PAD1 0x00 /* 00 0 00000 */ 141 #define IP6OPT_PADN 0x01 /* 00 0 00001 */ 142 #define IP6OPT_JUMBO 0xC2 /* 11 0 00010 = 194 */ 143 #define IP6OPT_JUMBO_LEN 6 144 #define IP6OPT_RTALERT 0x05 /* 00 0 00101 */ 145 #define IP6OPT_RTALERT_LEN 4 146 #define IP6OPT_RTALERT_MLD 0 /* Datagram contains an MLD message */ 147 #define IP6OPT_RTALERT_RSVP 1 /* Datagram contains an RSVP message */ 148 #define IP6OPT_RTALERT_ACTNET 2 /* contains an Active Networks msg */ 149 #define IP6OPT_MINLEN 2 150 151 #define IP6OPT_TYPE(o) ((o) & 0xC0) 152 #define IP6OPT_TYPE_SKIP 0x00 153 #define IP6OPT_TYPE_DISCARD 0x40 154 #define IP6OPT_TYPE_FORCEICMP 0x80 155 #define IP6OPT_TYPE_ICMP 0xC0 156 157 #define IP6OPT_MUTABLE 0x20 158 159 /* Routing header */ 160 struct ip6_rthdr { 161 u_int8_t ip6r_nxt; /* next header */ 162 u_int8_t ip6r_len; /* length in units of 8 octets */ 163 u_int8_t ip6r_type; /* routing type */ 164 u_int8_t ip6r_segleft; /* segments left */ 165 /* followed by routing type specific data */ 166 }; 167 168 /* Type 0 Routing header */ 169 struct ip6_rthdr0 { 170 u_int8_t ip6r0_nxt; /* next header */ 171 u_int8_t ip6r0_len; /* length in units of 8 octets */ 172 u_int8_t ip6r0_type; /* always zero */ 173 u_int8_t ip6r0_segleft; /* segments left */ 174 u_int8_t ip6r0_reserved; /* reserved field */ 175 u_int8_t ip6r0_slmap[3]; /* strict/loose bit map */ 176 struct in6_addr ip6r0_addr[1]; /* up to 23 addresses */ 177 }; 178 179 /* Fragment header */ 180 struct ip6_frag { 181 u_int8_t ip6f_nxt; /* next header */ 182 u_int8_t ip6f_reserved; /* reserved field */ 183 u_int16_t ip6f_offlg; /* offset, reserved, and flag */ 184 u_int32_t ip6f_ident; /* identification */ 185 }; 186 187 #if BYTE_ORDER == BIG_ENDIAN 188 #define IP6F_OFF_MASK 0xfff8 /* mask out offset from _offlg */ 189 #define IP6F_RESERVED_MASK 0x0006 /* reserved bits in ip6f_offlg */ 190 #define IP6F_MORE_FRAG 0x0001 /* more-fragments flag */ 191 #else /* BYTE_ORDER == LITTLE_ENDIAN */ 192 #define IP6F_OFF_MASK 0xf8ff /* mask out offset from _offlg */ 193 #define IP6F_RESERVED_MASK 0x0600 /* reserved bits in ip6f_offlg */ 194 #define IP6F_MORE_FRAG 0x0100 /* more-fragments flag */ 195 #endif /* BYTE_ORDER == LITTLE_ENDIAN */ 196 197 /* 198 * Internet implementation parameters. 199 */ 200 #define IPV6_MAXHLIM 255 /* maximun hoplimit */ 201 #define IPV6_DEFHLIM 64 /* default hlim */ 202 #define IPV6_FRAGTTL 120 /* ttl for fragment packets, in slowtimo tick */ 203 #define IPV6_HLIMDEC 1 /* subtracted when forwaeding */ 204 205 #define IPV6_MMTU 1280 /* minimal MTU and reassembly. 1024 + 256 */ 206 #define IPV6_MAXPACKET 65535 /* ip6 max packet size without Jumbo payload*/ 207 208 #ifdef _KERNEL 209 /* 210 * IP6_EXTHDR_CHECK ensures that region between the IP6 header and the 211 * target header (including IPv6 itself, extension headers and 212 * TCP/UDP/ICMP6 headers) are continuous. KAME requires drivers 213 * to store incoming data into one internal mbuf or one or more external 214 * mbufs(never into two or more internal mbufs). Thus, the third case is 215 * supposed to never be matched but is prepared just in case. 216 */ 217 218 #define IP6_EXTHDR_CHECK(m, off, hlen, ret) \ 219 do { \ 220 if ((m)->m_next != NULL) { \ 221 if (((m)->m_flags & M_LOOP) && \ 222 ((m)->m_len < (off) + (hlen)) && \ 223 (((m) = m_pullup((m), (off) + (hlen))) == NULL)) { \ 224 ip6stat.ip6s_exthdrtoolong++; \ 225 return ret; \ 226 } else if ((m)->m_flags & M_EXT) { \ 227 if ((m)->m_len < (off) + (hlen)) { \ 228 ip6stat.ip6s_exthdrtoolong++; \ 229 m_freem(m); \ 230 return ret; \ 231 } \ 232 } else { \ 233 if ((m)->m_len < (off) + (hlen)) { \ 234 ip6stat.ip6s_exthdrtoolong++; \ 235 m_freem(m); \ 236 return ret; \ 237 } \ 238 } \ 239 } \ 240 else { \ 241 if ((m)->m_len < (off) + (hlen)) { \ 242 ip6stat.ip6s_tooshort++; \ 243 in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_truncated); \ 244 m_freem(m); \ 245 return ret; \ 246 } \ 247 } \ 248 } while (0) 249 250 /* 251 * IP6_EXTHDR_GET ensures that intermediate protocol header (from "off" to 252 * "len") is located in single mbuf, on contiguous memory region. 253 * The pointer to the region will be returned to pointer variable "val", 254 * with type "typ". 255 * IP6_EXTHDR_GET0 does the same, except that it aligns the structure at the 256 * very top of mbuf. GET0 is likely to make memory copy than GET. 257 * 258 * XXX we're now testing this, needs m_pulldown() 259 */ 260 #define IP6_EXTHDR_GET(val, typ, m, off, len) \ 261 do { \ 262 struct mbuf *t; \ 263 int tmp; \ 264 t = m_pulldown((m), (off), (len), &tmp); \ 265 if (t) { \ 266 if (t->m_len < tmp + (len)) \ 267 panic("m_pulldown malfunction"); \ 268 (val) = (typ)(mtod(t, caddr_t) + tmp); \ 269 } else \ 270 (val) = (typ)NULL; \ 271 } while (0) 272 273 #define IP6_EXTHDR_GET0(val, typ, m, off, len) \ 274 do { \ 275 struct mbuf *t; \ 276 t = m_pulldown((m), (off), (len), NULL); \ 277 if (t) { \ 278 if (t->m_len < (len)) \ 279 panic("m_pulldown malfunction"); \ 280 (val) = (typ)mtod(t, caddr_t); \ 281 } else \ 282 (val) = (typ)NULL; \ 283 } while (0) 284 #endif /*_KERNEL*/ 285 286 #endif /* not _NETINET_IP6_H_ */ 287
Indexes created Fri Sep 26 20:09:58 GMT 2025