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