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