2 /* $KAME: ip6.h,v 1.18 2001/03/29 05:34:30 itojun Exp $ */
5 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the project nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * Copyright (c) 1982, 1986, 1993
35 * The Regents of the University of California. All rights reserved.
37 * Redistribution and use in source and binary forms, with or without
38 * modification, are permitted provided that the following conditions
40 * 1. Redistributions of source code must retain the above copyright
41 * notice, this list of conditions and the following disclaimer.
42 * 2. Redistributions in binary form must reproduce the above copyright
43 * notice, this list of conditions and the following disclaimer in the
44 * documentation and/or other materials provided with the distribution.
45 * 4. Neither the name of the University nor the names of its contributors
46 * may be used to endorse or promote products derived from this software
47 * without specific prior written permission.
49 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
50 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
53 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61 * @(#)ip.h 8.1 (Berkeley) 6/10/93
64 #ifndef _NETINET_IP6_H_
65 #define _NETINET_IP6_H_
68 * Definition for internet protocol version 6.
75 u_int32_t ip6_un1_flow; /* 20 bits of flow-ID */
76 u_int16_t ip6_un1_plen; /* payload length */
77 u_int8_t ip6_un1_nxt; /* next header */
78 u_int8_t ip6_un1_hlim; /* hop limit */
80 u_int8_t ip6_un2_vfc; /* 4 bits version, top 4 bits class */
82 struct in6_addr ip6_src; /* source address */
83 struct in6_addr ip6_dst; /* destination address */
86 #define ip6_vfc ip6_ctlun.ip6_un2_vfc
87 #define ip6_flow ip6_ctlun.ip6_un1.ip6_un1_flow
88 #define ip6_plen ip6_ctlun.ip6_un1.ip6_un1_plen
89 #define ip6_nxt ip6_ctlun.ip6_un1.ip6_un1_nxt
90 #define ip6_hlim ip6_ctlun.ip6_un1.ip6_un1_hlim
91 #define ip6_hops ip6_ctlun.ip6_un1.ip6_un1_hlim
93 #define IPV6_VERSION 0x60
94 #define IPV6_VERSION_MASK 0xf0
96 #if BYTE_ORDER == BIG_ENDIAN
97 #define IPV6_FLOWINFO_MASK 0x0fffffff /* flow info (28 bits) */
98 #define IPV6_FLOWLABEL_MASK 0x000fffff /* flow label (20 bits) */
100 #if BYTE_ORDER == LITTLE_ENDIAN
101 #define IPV6_FLOWINFO_MASK 0xffffff0f /* flow info (28 bits) */
102 #define IPV6_FLOWLABEL_MASK 0xffff0f00 /* flow label (20 bits) */
103 #endif /* LITTLE_ENDIAN */
106 /* ECN bits proposed by Sally Floyd */
107 #define IP6TOS_CE 0x01 /* congestion experienced */
108 #define IP6TOS_ECT 0x02 /* ECN-capable transport */
120 /* Hop-by-Hop options header */
121 /* XXX should we pad it to force alignment on an 8-byte boundary? */
123 u_int8_t ip6h_nxt; /* next header */
124 u_int8_t ip6h_len; /* length in units of 8 octets */
125 /* followed by options */
128 /* Destination options header */
129 /* XXX should we pad it to force alignment on an 8-byte boundary? */
131 u_int8_t ip6d_nxt; /* next header */
132 u_int8_t ip6d_len; /* length in units of 8 octets */
133 /* followed by options */
136 /* Option types and related macros */
137 #define IP6OPT_PAD1 0x00 /* 00 0 00000 */
138 #define IP6OPT_PADN 0x01 /* 00 0 00001 */
139 #define IP6OPT_JUMBO 0xC2 /* 11 0 00010 = 194 */
140 #define IP6OPT_NSAP_ADDR 0xC3 /* 11 0 00011 */
141 #define IP6OPT_TUNNEL_LIMIT 0x04 /* 00 0 00100 */
143 #define IP6OPT_RTALERT 0x05 /* 00 0 00101 (KAME definition) */
145 #define IP6OPT_ROUTER_ALERT 0x05 /* 00 0 00101 (2292bis, recommended) */
147 #define IP6OPT_RTALERT_LEN 4
148 #define IP6OPT_RTALERT_MLD 0 /* Datagram contains an MLD message */
149 #define IP6OPT_RTALERT_RSVP 1 /* Datagram contains an RSVP message */
150 #define IP6OPT_RTALERT_ACTNET 2 /* contains an Active Networks msg */
151 #define IP6OPT_MINLEN 2
153 #define IP6OPT_EID 0x8a /* 10 0 01010 */
155 #define IP6OPT_TYPE(o) ((o) & 0xC0)
156 #define IP6OPT_TYPE_SKIP 0x00
157 #define IP6OPT_TYPE_DISCARD 0x40
158 #define IP6OPT_TYPE_FORCEICMP 0x80
159 #define IP6OPT_TYPE_ICMP 0xC0
161 #define IP6OPT_MUTABLE 0x20
163 #define IP6OPT_JUMBO_LEN 6
167 u_int8_t ip6r_nxt; /* next header */
168 u_int8_t ip6r_len; /* length in units of 8 octets */
169 u_int8_t ip6r_type; /* routing type */
170 u_int8_t ip6r_segleft; /* segments left */
171 /* followed by routing type specific data */
174 /* Type 0 Routing header */
176 u_int8_t ip6r0_nxt; /* next header */
177 u_int8_t ip6r0_len; /* length in units of 8 octets */
178 u_int8_t ip6r0_type; /* always zero */
179 u_int8_t ip6r0_segleft; /* segments left */
180 u_int32_t ip6r0_reserved; /* reserved field */
181 /* followed by up to 127 struct in6_addr */
184 /* Fragment header */
186 u_int8_t ip6f_nxt; /* next header */
187 u_int8_t ip6f_reserved; /* reserved field */
188 u_int16_t ip6f_offlg; /* offset, reserved, and flag */
189 u_int32_t ip6f_ident; /* identification */
192 #if BYTE_ORDER == BIG_ENDIAN
193 #define IP6F_OFF_MASK 0xfff8 /* mask out offset from _offlg */
194 #define IP6F_RESERVED_MASK 0x0006 /* reserved bits in ip6f_offlg */
195 #define IP6F_MORE_FRAG 0x0001 /* more-fragments flag */
196 #else /* BYTE_ORDER == LITTLE_ENDIAN */
197 #define IP6F_OFF_MASK 0xf8ff /* mask out offset from _offlg */
198 #define IP6F_RESERVED_MASK 0x0600 /* reserved bits in ip6f_offlg */
199 #define IP6F_MORE_FRAG 0x0100 /* more-fragments flag */
200 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
203 * Internet implementation parameters.
205 #define IPV6_MAXHLIM 255 /* maximun hoplimit */
206 #define IPV6_DEFHLIM 64 /* default hlim */
207 #define IPV6_FRAGTTL 120 /* ttl for fragment packets, in slowtimo tick */
208 #define IPV6_HLIMDEC 1 /* subtracted when forwaeding */
210 #define IPV6_MMTU 1280 /* minimal MTU and reassembly. 1024 + 256 */
211 #define IPV6_MAXPACKET 65535 /* ip6 max packet size without Jumbo payload*/
212 #define IPV6_MAXOPTHDR 2048 /* max option header size, 256 64-bit words */
216 * IP6_EXTHDR_CHECK ensures that region between the IP6 header and the
217 * target header (including IPv6 itself, extension headers and
218 * TCP/UDP/ICMP6 headers) are continuous. KAME requires drivers
219 * to store incoming data into one internal mbuf or one or more external
220 * mbufs(never into two or more internal mbufs). Thus, the third case is
221 * supposed to never be matched but is prepared just in case.
224 #define IP6_EXTHDR_CHECK(m, off, hlen, ret) \
226 if ((m)->m_next != NULL) { \
227 if (((m)->m_flags & M_LOOP) && \
228 ((m)->m_len < (off) + (hlen)) && \
229 (((m) = m_pullup((m), (off) + (hlen))) == NULL)) { \
230 ip6stat.ip6s_exthdrtoolong++; \
232 } else if ((m)->m_flags & M_EXT) { \
233 if ((m)->m_len < (off) + (hlen)) { \
234 ip6stat.ip6s_exthdrtoolong++; \
239 if ((m)->m_len < (off) + (hlen)) { \
240 ip6stat.ip6s_exthdrtoolong++; \
246 if ((m)->m_len < (off) + (hlen)) { \
247 ip6stat.ip6s_tooshort++; \
248 in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_truncated); \
253 } while (/*CONSTCOND*/ 0)
256 * IP6_EXTHDR_GET ensures that intermediate protocol header (from "off" to
257 * "len") is located in single mbuf, on contiguous memory region.
258 * The pointer to the region will be returned to pointer variable "val",
260 * IP6_EXTHDR_GET0 does the same, except that it aligns the structure at the
261 * very top of mbuf. GET0 is likely to make memory copy than GET.
263 * XXX we're now testing this, needs m_pulldown()
265 #define IP6_EXTHDR_GET(val, typ, m, off, len) \
269 if ((m)->m_len >= (off) + (len)) \
270 (val) = (typ)(mtod((m), caddr_t) + (off)); \
272 t = m_pulldown((m), (off), (len), &tmp); \
274 if (t->m_len < tmp + (len)) \
275 panic("m_pulldown malfunction"); \
276 (val) = (typ)(mtod(t, caddr_t) + tmp); \
282 } while (/*CONSTCOND*/ 0)
284 #define IP6_EXTHDR_GET0(val, typ, m, off, len) \
288 (val) = (typ)mtod(m, caddr_t); \
290 t = m_pulldown((m), (off), (len), NULL); \
292 if (t->m_len < (len)) \
293 panic("m_pulldown malfunction"); \
294 (val) = (typ)mtod(t, caddr_t); \
300 } while (/*CONSTCOND*/ 0)
303 #endif /* not _NETINET_IP6_H_ */