ip6.h revision 127668
1251607Sdim/* @(#) $Header: /tcpdump/master/tcpdump/ip6.h,v 1.6 2002/12/11 22:29:21 guy Exp $ (LBL) */
2251607Sdim/*	$NetBSD: ip6.h,v 1.9 2000/07/13 05:34:21 itojun Exp $	*/
3251607Sdim/*	$KAME: ip6.h,v 1.9 2000/07/02 21:01:32 itojun Exp $	*/
4251607Sdim
5251607Sdim/*
6251607Sdim * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
7251607Sdim * All rights reserved.
8251607Sdim *
9251607Sdim * Redistribution and use in source and binary forms, with or without
10251607Sdim * modification, are permitted provided that the following conditions
11251607Sdim * are met:
12251607Sdim * 1. Redistributions of source code must retain the above copyright
13251607Sdim *    notice, this list of conditions and the following disclaimer.
14251607Sdim * 2. Redistributions in binary form must reproduce the above copyright
15251607Sdim *    notice, this list of conditions and the following disclaimer in the
16251607Sdim *    documentation and/or other materials provided with the distribution.
17251607Sdim * 3. Neither the name of the project nor the names of its contributors
18251607Sdim *    may be used to endorse or promote products derived from this software
19251607Sdim *    without specific prior written permission.
20251607Sdim *
21251607Sdim * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
22251607Sdim * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23251607Sdim * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24251607Sdim * ARE DISCLAIMED.  IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
25251607Sdim * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26251607Sdim * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27251607Sdim * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28251607Sdim * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29251607Sdim * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30251607Sdim * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31251607Sdim * SUCH DAMAGE.
32251607Sdim */
33251607Sdim
34251607Sdim/*
35251607Sdim * Copyright (c) 1982, 1986, 1993
36251607Sdim *	The Regents of the University of California.  All rights reserved.
37251607Sdim *
38251607Sdim * Redistribution and use in source and binary forms, with or without
39251607Sdim * modification, are permitted provided that the following conditions
40251607Sdim * are met:
41251607Sdim * 1. Redistributions of source code must retain the above copyright
42251607Sdim *    notice, this list of conditions and the following disclaimer.
43251607Sdim * 2. Redistributions in binary form must reproduce the above copyright
44251607Sdim *    notice, this list of conditions and the following disclaimer in the
45251607Sdim *    documentation and/or other materials provided with the distribution.
46251607Sdim * 3. All advertising materials mentioning features or use of this software
47251607Sdim *    must display the following acknowledgement:
48251607Sdim *	This product includes software developed by the University of
49251607Sdim *	California, Berkeley and its contributors.
50251607Sdim * 4. Neither the name of the University nor the names of its contributors
51251607Sdim *    may be used to endorse or promote products derived from this software
52251607Sdim *    without specific prior written permission.
53251607Sdim *
54251607Sdim * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
55251607Sdim * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56251607Sdim * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57251607Sdim * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
58251607Sdim * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59251607Sdim * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60251607Sdim * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61251607Sdim * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62251607Sdim * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63251607Sdim * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
64251607Sdim * SUCH DAMAGE.
65251607Sdim *
66251607Sdim *	@(#)ip.h	8.1 (Berkeley) 6/10/93
67251607Sdim */
68251607Sdim
69251607Sdim#ifndef _NETINET_IP6_H_
70251607Sdim#define _NETINET_IP6_H_
71251607Sdim
72251607Sdim/*
73251607Sdim * Definition for internet protocol version 6.
74251607Sdim * RFC 2460
75251607Sdim */
76251607Sdim
77251607Sdimstruct ip6_hdr {
78	union {
79		struct ip6_hdrctl {
80			u_int32_t ip6_un1_flow;	/* 20 bits of flow-ID */
81			u_int16_t ip6_un1_plen;	/* payload length */
82			u_int8_t  ip6_un1_nxt;	/* next header */
83			u_int8_t  ip6_un1_hlim;	/* hop limit */
84		} ip6_un1;
85		u_int8_t ip6_un2_vfc;	/* 4 bits version, top 4 bits class */
86	} ip6_ctlun;
87	struct in6_addr ip6_src;	/* source address */
88	struct in6_addr ip6_dst;	/* destination address */
89};
90
91#define ip6_vfc		ip6_ctlun.ip6_un2_vfc
92#define ip6_flow	ip6_ctlun.ip6_un1.ip6_un1_flow
93#define ip6_plen	ip6_ctlun.ip6_un1.ip6_un1_plen
94#define ip6_nxt		ip6_ctlun.ip6_un1.ip6_un1_nxt
95#define ip6_hlim	ip6_ctlun.ip6_un1.ip6_un1_hlim
96#define ip6_hops	ip6_ctlun.ip6_un1.ip6_un1_hlim
97
98#define IPV6_VERSION		0x60
99#define IPV6_VERSION_MASK	0xf0
100
101/* in network endian */
102#define IPV6_FLOWINFO_MASK	((u_int32_t)htonl(0x0fffffff))	/* flow info (28 bits) */
103#define IPV6_FLOWLABEL_MASK	((u_int32_t)htonl(0x000fffff))	/* flow label (20 bits) */
104#if 1
105/* ECN bits proposed by Sally Floyd */
106#define IP6TOS_CE		0x01	/* congestion experienced */
107#define IP6TOS_ECT		0x02	/* ECN-capable transport */
108#endif
109
110/*
111 * Extension Headers
112 */
113
114struct	ip6_ext {
115	u_char	ip6e_nxt;
116	u_char	ip6e_len;
117};
118
119/* Hop-by-Hop options header */
120/* XXX should we pad it to force alignment on an 8-byte boundary? */
121struct ip6_hbh {
122	u_int8_t ip6h_nxt;	/* next header */
123	u_int8_t ip6h_len;	/* length in units of 8 octets */
124	/* followed by options */
125};
126
127/* Destination options header */
128/* XXX should we pad it to force alignment on an 8-byte boundary? */
129struct ip6_dest {
130	u_int8_t ip6d_nxt;	/* next header */
131	u_int8_t ip6d_len;	/* length in units of 8 octets */
132	/* followed by options */
133};
134
135/* Option types and related macros */
136#define IP6OPT_PAD1		0x00	/* 00 0 00000 */
137#define IP6OPT_PADN		0x01	/* 00 0 00001 */
138#define IP6OPT_JUMBO		0xC2	/* 11 0 00010 = 194 */
139#define IP6OPT_JUMBO_LEN	6
140#define IP6OPT_ROUTER_ALERT	0x05	/* 00 0 00101 */
141
142#define IP6OPT_RTALERT_LEN	4
143#define IP6OPT_RTALERT_MLD	0	/* Datagram contains an MLD message */
144#define IP6OPT_RTALERT_RSVP	1	/* Datagram contains an RSVP message */
145#define IP6OPT_RTALERT_ACTNET	2 	/* contains an Active Networks msg */
146#define IP6OPT_MINLEN		2
147
148#define IP6OPT_BINDING_UPDATE	0xc6	/* 11 0 00110 */
149#define IP6OPT_BINDING_ACK	0x07	/* 00 0 00111 */
150#define IP6OPT_BINDING_REQ	0x08	/* 00 0 01000 */
151#define IP6OPT_HOME_ADDRESS	0xc9	/* 11 0 01001 */
152#define IP6OPT_EID		0x8a	/* 10 0 01010 */
153
154#define IP6OPT_TYPE(o)		((o) & 0xC0)
155#define IP6OPT_TYPE_SKIP	0x00
156#define IP6OPT_TYPE_DISCARD	0x40
157#define IP6OPT_TYPE_FORCEICMP	0x80
158#define IP6OPT_TYPE_ICMP	0xC0
159
160#define IP6OPT_MUTABLE		0x20
161
162/* Routing header */
163struct ip6_rthdr {
164	u_int8_t  ip6r_nxt;	/* next header */
165	u_int8_t  ip6r_len;	/* length in units of 8 octets */
166	u_int8_t  ip6r_type;	/* routing type */
167	u_int8_t  ip6r_segleft;	/* segments left */
168	/* followed by routing type specific data */
169};
170
171/* Type 0 Routing header */
172struct ip6_rthdr0 {
173	u_int8_t  ip6r0_nxt;		/* next header */
174	u_int8_t  ip6r0_len;		/* length in units of 8 octets */
175	u_int8_t  ip6r0_type;		/* always zero */
176	u_int8_t  ip6r0_segleft;	/* segments left */
177	u_int8_t  ip6r0_reserved;	/* reserved field */
178	u_int8_t  ip6r0_slmap[3];	/* strict/loose bit map */
179	struct in6_addr ip6r0_addr[1];	/* up to 23 addresses */
180};
181
182/* Fragment header */
183struct ip6_frag {
184	u_int8_t  ip6f_nxt;		/* next header */
185	u_int8_t  ip6f_reserved;	/* reserved field */
186	u_int16_t ip6f_offlg;		/* offset, reserved, and flag */
187	u_int32_t ip6f_ident;		/* identification */
188};
189
190#define IP6F_OFF_MASK		0xfff8	/* mask out offset from ip6f_offlg */
191#define IP6F_RESERVED_MASK	0x0006	/* reserved bits in ip6f_offlg */
192#define IP6F_MORE_FRAG		0x0001	/* more-fragments flag */
193
194#endif /* not _NETINET_IP6_H_ */
195