1/* @(#) Header: /tcpdump/master/tcpdump/ip6.h,v 1.8 2007-08-29 02:31:44 mcr Exp (LBL) */ 2/* NetBSD: ip6.h,v 1.9 2000/07/13 05:34:21 itojun Exp */ 3/* $KAME: ip6.h,v 1.9 2000/07/02 21:01:32 itojun Exp $ */ 4 5/* 6 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. 7 * All rights reserved. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 3. Neither the name of the project nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34/* 35 * Copyright (c) 1982, 1986, 1993 36 * The Regents of the University of California. All rights reserved. 37 * 38 * Redistribution and use in source and binary forms, with or without 39 * modification, are permitted provided that the following conditions 40 * are met: 41 * 1. Redistributions of source code must retain the above copyright 42 * notice, this list of conditions and the following disclaimer. 43 * 2. Redistributions in binary form must reproduce the above copyright 44 * notice, this list of conditions and the following disclaimer in the 45 * documentation and/or other materials provided with the distribution. 46 * 3. Neither the name of the University nor the names of its contributors 47 * may be used to endorse or promote products derived from this software 48 * without specific prior written permission. 49 * 50 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 51 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 52 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 53 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 54 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 55 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 56 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 57 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 58 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 59 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 60 * SUCH DAMAGE. 61 * 62 * @(#)ip.h 8.1 (Berkeley) 6/10/93 63 */ 64 65#ifndef _NETINET_IP6_H_ 66#define _NETINET_IP6_H_ 67 68/* 69 * Definition for internet protocol version 6. 70 * RFC 2460 71 */ 72 73struct ip6_hdr { 74 union { 75 struct ip6_hdrctl { 76 u_int32_t ip6_un1_flow; /* 20 bits of flow-ID */ 77 u_int16_t ip6_un1_plen; /* payload length */ 78 u_int8_t ip6_un1_nxt; /* next header */ 79 u_int8_t ip6_un1_hlim; /* hop limit */ 80 } ip6_un1; 81 u_int8_t ip6_un2_vfc; /* 4 bits version, top 4 bits class */ 82 } ip6_ctlun; 83 struct in6_addr ip6_src; /* source address */ 84 struct in6_addr ip6_dst; /* destination address */ 85}; 86 87/* 88 * Pseudo header, used for higher layer checksumming. 89 */ 90union ip6_pseudo_hdr { 91 struct { 92 struct in6_addr ph_src; 93 struct in6_addr ph_dst; 94 u_int32_t ph_len; 95 u_int8_t ph_zero[3]; 96 u_int8_t ph_nxt; 97 } ph; 98 u_int16_t pa[20]; 99}; 100 101#define ip6_vfc ip6_ctlun.ip6_un2_vfc 102#define ip6_flow ip6_ctlun.ip6_un1.ip6_un1_flow 103#define ip6_plen ip6_ctlun.ip6_un1.ip6_un1_plen 104#define ip6_nxt ip6_ctlun.ip6_un1.ip6_un1_nxt 105#define ip6_hlim ip6_ctlun.ip6_un1.ip6_un1_hlim 106#define ip6_hops ip6_ctlun.ip6_un1.ip6_un1_hlim 107 108/* in network endian */ 109#define IPV6_FLOWINFO_MASK ((u_int32_t)htonl(0x0fffffff)) /* flow info (28 bits) */ 110#define IPV6_FLOWLABEL_MASK ((u_int32_t)htonl(0x000fffff)) /* flow label (20 bits) */ 111#if 1 112/* ECN bits proposed by Sally Floyd */ 113#define IP6TOS_CE 0x01 /* congestion experienced */ 114#define IP6TOS_ECT 0x02 /* ECN-capable transport */ 115#endif 116 117/* 118 * Extension Headers 119 */ 120 121struct ip6_ext { 122 u_char ip6e_nxt; 123 u_char ip6e_len; 124}; 125 126/* Hop-by-Hop options header */ 127/* XXX should we pad it to force alignment on an 8-byte boundary? */ 128struct ip6_hbh { 129 u_int8_t ip6h_nxt; /* next header */ 130 u_int8_t ip6h_len; /* length in units of 8 octets */ 131 /* followed by options */ 132}; 133 134/* Destination options header */ 135/* XXX should we pad it to force alignment on an 8-byte boundary? */ 136struct ip6_dest { 137 u_int8_t ip6d_nxt; /* next header */ 138 u_int8_t ip6d_len; /* length in units of 8 octets */ 139 /* followed by options */ 140}; 141 142/* Option types and related macros */ 143#define IP6OPT_PAD1 0x00 /* 00 0 00000 */ 144#define IP6OPT_PADN 0x01 /* 00 0 00001 */ 145#define IP6OPT_JUMBO 0xC2 /* 11 0 00010 = 194 */ 146#define IP6OPT_JUMBO_LEN 6 147#define IP6OPT_ROUTER_ALERT 0x05 /* 00 0 00101 */ 148 149#define IP6OPT_RTALERT_LEN 4 150#define IP6OPT_RTALERT_MLD 0 /* Datagram contains an MLD message */ 151#define IP6OPT_RTALERT_RSVP 1 /* Datagram contains an RSVP message */ 152#define IP6OPT_RTALERT_ACTNET 2 /* contains an Active Networks msg */ 153#define IP6OPT_MINLEN 2 154 155#define IP6OPT_BINDING_UPDATE 0xc6 /* 11 0 00110 */ 156#define IP6OPT_BINDING_ACK 0x07 /* 00 0 00111 */ 157#define IP6OPT_BINDING_REQ 0x08 /* 00 0 01000 */ 158#define IP6OPT_HOME_ADDRESS 0xc9 /* 11 0 01001 */ 159#define IP6OPT_EID 0x8a /* 10 0 01010 */ 160 161#define IP6OPT_TYPE(o) ((o) & 0xC0) 162#define IP6OPT_TYPE_SKIP 0x00 163#define IP6OPT_TYPE_DISCARD 0x40 164#define IP6OPT_TYPE_FORCEICMP 0x80 165#define IP6OPT_TYPE_ICMP 0xC0 166 167#define IP6OPT_MUTABLE 0x20 168 169/* Routing header */ 170struct ip6_rthdr { 171 u_int8_t ip6r_nxt; /* next header */ 172 u_int8_t ip6r_len; /* length in units of 8 octets */ 173 u_int8_t ip6r_type; /* routing type */ 174 u_int8_t ip6r_segleft; /* segments left */ 175 /* followed by routing type specific data */ 176}; 177 178/* Type 0 Routing header */ 179struct ip6_rthdr0 { 180 u_int8_t ip6r0_nxt; /* next header */ 181 u_int8_t ip6r0_len; /* length in units of 8 octets */ 182 u_int8_t ip6r0_type; /* always zero */ 183 u_int8_t ip6r0_segleft; /* segments left */ 184 u_int8_t ip6r0_reserved; /* reserved field */ 185 u_int8_t ip6r0_slmap[3]; /* strict/loose bit map */ 186 struct in6_addr ip6r0_addr[1]; /* up to 23 addresses */ 187}; 188 189/* Fragment header */ 190struct ip6_frag { 191 u_int8_t ip6f_nxt; /* next header */ 192 u_int8_t ip6f_reserved; /* reserved field */ 193 u_int16_t ip6f_offlg; /* offset, reserved, and flag */ 194 u_int32_t ip6f_ident; /* identification */ 195}; 196 197#define IP6F_OFF_MASK 0xfff8 /* mask out offset from ip6f_offlg */ 198#define IP6F_RESERVED_MASK 0x0006 /* reserved bits in ip6f_offlg */ 199#define IP6F_MORE_FRAG 0x0001 /* more-fragments flag */ 200 201#endif /* not _NETINET_IP6_H_ */ 202