blob: aa89186bdd6d6ca33662124a4ca925d10bab7100 [file] [log] [blame]
Steinar H. Gunderson6846a452011-01-20 01:31:36 +01001/* $NetBSD: ip6.h,v 1.23 2007/12/25 18:33:46 perry Exp $ */
2/* $KAME: ip6.h,v 1.45 2003/06/05 04:46:38 keiichi Exp $ */
3
4/*
5 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
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.
19 *
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
30 * SUCH DAMAGE.
31 */
32
33/*
34 * Copyright (c) 1982, 1986, 1993
35 * The Regents of the University of California. All rights reserved.
36 *
37 * Redistribution and use in source and binary forms, with or without
38 * modification, are permitted provided that the following conditions
39 * are met:
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 * 3. 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.
48 *
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
59 * SUCH DAMAGE.
60 *
61 * @(#)ip.h 8.1 (Berkeley) 6/10/93
62 */
63
64#ifndef _NETINET_IP6_H_
65#define _NETINET_IP6_H_
66
Josh Gaoef7c95b2016-04-07 11:16:35 -070067#include <sys/types.h>
68
69#include <linux/in6.h>
70
Steinar H. Gunderson6846a452011-01-20 01:31:36 +010071/*
72 * Definition for internet protocol version 6.
73 * RFC 2460
74 */
75
76struct ip6_hdr {
77 union {
78 struct ip6_hdrctl {
79 u_int32_t ip6_un1_flow; /* 20 bits of flow-ID */
80 u_int16_t ip6_un1_plen; /* payload length */
81 u_int8_t ip6_un1_nxt; /* next header */
82 u_int8_t ip6_un1_hlim; /* hop limit */
83 } ip6_un1;
84 u_int8_t ip6_un2_vfc; /* 4 bits version, top 4 bits class */
85 } ip6_ctlun;
86 struct in6_addr ip6_src; /* source address */
87 struct in6_addr ip6_dst; /* destination address */
88} __packed;
89
90#define ip6_vfc ip6_ctlun.ip6_un2_vfc
91#define ip6_flow ip6_ctlun.ip6_un1.ip6_un1_flow
92#define ip6_plen ip6_ctlun.ip6_un1.ip6_un1_plen
93#define ip6_nxt ip6_ctlun.ip6_un1.ip6_un1_nxt
94#define ip6_hlim ip6_ctlun.ip6_un1.ip6_un1_hlim
95#define ip6_hops ip6_ctlun.ip6_un1.ip6_un1_hlim
96
97#define IPV6_VERSION 0x60
98#define IPV6_VERSION_MASK 0xf0
99
100#if BYTE_ORDER == BIG_ENDIAN
101#define IPV6_FLOWINFO_MASK 0x0fffffff /* flow info (28 bits) */
102#define IPV6_FLOWLABEL_MASK 0x000fffff /* flow label (20 bits) */
103#else
104#if BYTE_ORDER == LITTLE_ENDIAN
105#define IPV6_FLOWINFO_MASK 0xffffff0f /* flow info (28 bits) */
106#define IPV6_FLOWLABEL_MASK 0xffff0f00 /* flow label (20 bits) */
107#endif /* LITTLE_ENDIAN */
108#endif
109#if 1
110/* ECN bits proposed by Sally Floyd */
111#define IP6TOS_CE 0x01 /* congestion experienced */
112#define IP6TOS_ECT 0x02 /* ECN-capable transport */
113#endif
114
115#ifdef _KERNEL
116/*
117 * for IPv6 pseudo header checksum
118 * XXX nonstandard
119 */
120struct ip6_hdr_pseudo {
121 struct in6_addr ip6ph_src;
122 struct in6_addr ip6ph_dst;
123 u_int32_t ip6ph_len;
124 u_int8_t ip6ph_zero[3];
125 u_int8_t ip6ph_nxt;
126} __packed;
127#endif
128
129/*
130 * Extension Headers
131 */
132
133struct ip6_ext {
134 u_int8_t ip6e_nxt;
135 u_int8_t ip6e_len;
136} __packed;
137
138/* Hop-by-Hop options header */
139/* XXX should we pad it to force alignment on an 8-byte boundary? */
140struct ip6_hbh {
141 u_int8_t ip6h_nxt; /* next header */
142 u_int8_t ip6h_len; /* length in units of 8 octets */
143 /* followed by options */
144} __packed;
145
146/* Destination options header */
147/* XXX should we pad it to force alignment on an 8-byte boundary? */
148struct ip6_dest {
149 u_int8_t ip6d_nxt; /* next header */
150 u_int8_t ip6d_len; /* length in units of 8 octets */
151 /* followed by options */
152} __packed;
153
154/* Option types and related macros */
155#define IP6OPT_PAD1 0x00 /* 00 0 00000 */
156#define IP6OPT_PADN 0x01 /* 00 0 00001 */
157#define IP6OPT_JUMBO 0xC2 /* 11 0 00010 = 194 */
158#define IP6OPT_NSAP_ADDR 0xC3 /* 11 0 00011 */
159#define IP6OPT_TUNNEL_LIMIT 0x04 /* 00 0 00100 */
160#define IP6OPT_RTALERT 0x05 /* 00 0 00101 (KAME definition) */
161#define IP6OPT_ROUTER_ALERT 0x05 /* (RFC3542 def, recommended) */
162
163#define IP6OPT_RTALERT_LEN 4
164#define IP6OPT_RTALERT_MLD 0 /* Datagram contains an MLD message */
165#define IP6OPT_RTALERT_RSVP 1 /* Datagram contains an RSVP message */
166#define IP6OPT_RTALERT_ACTNET 2 /* contains an Active Networks msg */
167#define IP6OPT_MINLEN 2
168
169#define IP6OPT_TYPE(o) ((o) & 0xC0)
170#define IP6OPT_TYPE_SKIP 0x00
171#define IP6OPT_TYPE_DISCARD 0x40
172#define IP6OPT_TYPE_FORCEICMP 0x80
173#define IP6OPT_TYPE_ICMP 0xC0
174
175#define IP6OPT_MUTABLE 0x20
176
177/* IPv6 options: common part */
178struct ip6_opt {
179 u_int8_t ip6o_type;
180 u_int8_t ip6o_len;
181} __packed;
182
183/* Jumbo Payload Option */
184struct ip6_opt_jumbo {
185 u_int8_t ip6oj_type;
186 u_int8_t ip6oj_len;
187 u_int8_t ip6oj_jumbo_len[4];
188} __packed;
189#define IP6OPT_JUMBO_LEN 6
190
191/* NSAP Address Option */
192struct ip6_opt_nsap {
193 u_int8_t ip6on_type;
194 u_int8_t ip6on_len;
195 u_int8_t ip6on_src_nsap_len;
196 u_int8_t ip6on_dst_nsap_len;
197 /* followed by source NSAP */
198 /* followed by destination NSAP */
199} __packed;
200
201/* Tunnel Limit Option */
202struct ip6_opt_tunnel {
203 u_int8_t ip6ot_type;
204 u_int8_t ip6ot_len;
205 u_int8_t ip6ot_encap_limit;
206} __packed;
207
208/* Router Alert Option */
209struct ip6_opt_router {
210 u_int8_t ip6or_type;
211 u_int8_t ip6or_len;
212 u_int8_t ip6or_value[2];
213} __packed;
214/* Router alert values (in network byte order) */
215#if BYTE_ORDER == BIG_ENDIAN
216#define IP6_ALERT_MLD 0x0000
217#define IP6_ALERT_RSVP 0x0001
218#define IP6_ALERT_AN 0x0002
219#else
220#if BYTE_ORDER == LITTLE_ENDIAN
221#define IP6_ALERT_MLD 0x0000
222#define IP6_ALERT_RSVP 0x0100
223#define IP6_ALERT_AN 0x0200
224#endif /* LITTLE_ENDIAN */
225#endif
226
227/* Routing header */
228struct ip6_rthdr {
229 u_int8_t ip6r_nxt; /* next header */
230 u_int8_t ip6r_len; /* length in units of 8 octets */
231 u_int8_t ip6r_type; /* routing type */
232 u_int8_t ip6r_segleft; /* segments left */
233 /* followed by routing type specific data */
234} __packed;
235
236/* Type 0 Routing header */
237struct ip6_rthdr0 {
238 u_int8_t ip6r0_nxt; /* next header */
239 u_int8_t ip6r0_len; /* length in units of 8 octets */
240 u_int8_t ip6r0_type; /* always zero */
241 u_int8_t ip6r0_segleft; /* segments left */
242 u_int32_t ip6r0_reserved; /* reserved field */
243} __packed;
244
245/* Fragment header */
246struct ip6_frag {
247 u_int8_t ip6f_nxt; /* next header */
248 u_int8_t ip6f_reserved; /* reserved field */
249 u_int16_t ip6f_offlg; /* offset, reserved, and flag */
250 u_int32_t ip6f_ident; /* identification */
251} __packed;
252
253#if BYTE_ORDER == BIG_ENDIAN
254#define IP6F_OFF_MASK 0xfff8 /* mask out offset from _offlg */
255#define IP6F_RESERVED_MASK 0x0006 /* reserved bits in ip6f_offlg */
256#define IP6F_MORE_FRAG 0x0001 /* more-fragments flag */
257#else /* BYTE_ORDER == LITTLE_ENDIAN */
258#define IP6F_OFF_MASK 0xf8ff /* mask out offset from _offlg */
259#define IP6F_RESERVED_MASK 0x0600 /* reserved bits in ip6f_offlg */
260#define IP6F_MORE_FRAG 0x0100 /* more-fragments flag */
261#endif /* BYTE_ORDER == LITTLE_ENDIAN */
262
263/*
264 * Internet implementation parameters.
265 */
266#define IPV6_MAXHLIM 255 /* maximum hoplimit */
267#define IPV6_DEFHLIM 64 /* default hlim */
268#define IPV6_FRAGTTL 120 /* ttl for fragment packets, in slowtimo tick */
269#define IPV6_HLIMDEC 1 /* subtracted when forwarding */
270
271#define IPV6_MMTU 1280 /* minimal MTU and reassembly. 1024 + 256 */
272#define IPV6_MAXPACKET 65535 /* ip6 max packet size without Jumbo payload*/
273
274#ifdef _KERNEL
275/*
276 * IP6_EXTHDR_GET ensures that intermediate protocol header (from "off" to
277 * "len") is located in single mbuf, on contiguous memory region.
278 * The pointer to the region will be returned to pointer variable "val",
279 * with type "typ".
280 * IP6_EXTHDR_GET0 does the same, except that it aligns the structure at the
281 * very top of mbuf. GET0 is likely to make memory copy than GET.
282 *
283 * XXX we're now testing this, needs m_pulldown()
284 */
285#define IP6_EXTHDR_GET(val, typ, m, off, len) \
286do { \
287 struct mbuf *_t; \
288 int _tmp; \
289 if ((m)->m_len >= (off) + (len)) \
290 (val) = (typ)(mtod((m), char *) + (off)); \
291 else { \
292 _t = m_pulldown((m), (off), (len), &_tmp); \
293 if (_t) { \
294 if (_t->m_len < _tmp + (len)) \
295 panic("m_pulldown malfunction"); \
296 (val) = (typ)(mtod(_t, char *) + _tmp); \
297 } else { \
298 (val) = (typ)NULL; \
299 (m) = NULL; \
300 } \
301 } \
302} while (/*CONSTCOND*/ 0)
303
304#define IP6_EXTHDR_GET0(val, typ, m, off, len) \
305do { \
306 struct mbuf *_t; \
307 if ((off) == 0 && (m)->m_len >= len) \
308 (val) = (typ)mtod((m), void *); \
309 else { \
310 _t = m_pulldown((m), (off), (len), NULL); \
311 if (_t) { \
312 if (_t->m_len < (len)) \
313 panic("m_pulldown malfunction"); \
314 (val) = (typ)mtod(_t, void *); \
315 } else { \
316 (val) = (typ)NULL; \
317 (m) = NULL; \
318 } \
319 } \
320} while (/*CONSTCOND*/ 0)
321#endif /*_KERNEL*/
322
323#endif /* !_NETINET_IP6_H_ */