blob: 243b6c8b249d864bce689dd94ee997f73bf76ad9 [file] [log] [blame]
bellardf0cbd3e2004-04-22 00:10:48 +00001/*
2 * Copyright (c) 1982, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
aliguori2f5f8992009-01-26 19:37:41 +000013 * 3. Neither the name of the University nor the names of its contributors
bellardf0cbd3e2004-04-22 00:10:48 +000014 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * @(#)ip.h 8.1 (Berkeley) 6/10/93
30 * ip.h,v 1.3 1994/08/21 05:27:30 paul Exp
31 */
32
Markus Armbruster2a6a4072016-06-29 13:47:03 +020033#ifndef IP_H
34#define IP_H
bellardf0cbd3e2004-04-22 00:10:48 +000035
Marc-André Lureaue429f292018-11-14 16:36:26 +040036#include <glib.h>
37
38#if G_BYTE_ORDER == G_BIG_ENDIAN
Andreas Färber9b24d8e2012-05-28 19:34:20 +020039# undef NTOHL
40# undef NTOHS
41# undef HTONL
42# undef HTONS
43# define NTOHL(d)
44# define NTOHS(d)
45# define HTONL(d)
46# define HTONS(d)
bellardf0cbd3e2004-04-22 00:10:48 +000047#else
48# ifndef NTOHL
49# define NTOHL(d) ((d) = ntohl((d)))
50# endif
51# ifndef NTOHS
Stefan Weilb6dce922010-07-22 22:15:23 +020052# define NTOHS(d) ((d) = ntohs((uint16_t)(d)))
bellardf0cbd3e2004-04-22 00:10:48 +000053# endif
54# ifndef HTONL
55# define HTONL(d) ((d) = htonl((d)))
56# endif
57# ifndef HTONS
Stefan Weilb6dce922010-07-22 22:15:23 +020058# define HTONS(d) ((d) = htons((uint16_t)(d)))
bellardf0cbd3e2004-04-22 00:10:48 +000059# endif
60#endif
61
Stefan Weilb6dce922010-07-22 22:15:23 +020062typedef uint32_t n_long; /* long as received from the net */
bellardf0cbd3e2004-04-22 00:10:48 +000063
64/*
65 * Definitions for internet protocol version 4.
66 * Per RFC 791, September 1981.
67 */
68#define IPVERSION 4
69
70/*
71 * Structure of an internet header, naked of options.
bellardf0cbd3e2004-04-22 00:10:48 +000072 */
73struct ip {
Marc-André Lureaue429f292018-11-14 16:36:26 +040074#if G_BYTE_ORDER == G_BIG_ENDIAN
Jan Kiszka1b930bf2011-08-06 14:23:29 +020075 uint8_t ip_v:4, /* version */
bellardf0cbd3e2004-04-22 00:10:48 +000076 ip_hl:4; /* header length */
77#else
Jan Kiszka1b930bf2011-08-06 14:23:29 +020078 uint8_t ip_hl:4, /* header length */
bellardf0cbd3e2004-04-22 00:10:48 +000079 ip_v:4; /* version */
80#endif
Stefan Weilb6dce922010-07-22 22:15:23 +020081 uint8_t ip_tos; /* type of service */
82 uint16_t ip_len; /* total length */
83 uint16_t ip_id; /* identification */
84 uint16_t ip_off; /* fragment offset field */
bellardf0cbd3e2004-04-22 00:10:48 +000085#define IP_DF 0x4000 /* don't fragment flag */
86#define IP_MF 0x2000 /* more fragments flag */
87#define IP_OFFMASK 0x1fff /* mask for fragmenting bits */
Stefan Weilb6dce922010-07-22 22:15:23 +020088 uint8_t ip_ttl; /* time to live */
89 uint8_t ip_p; /* protocol */
90 uint16_t ip_sum; /* checksum */
bellardf0cbd3e2004-04-22 00:10:48 +000091 struct in_addr ip_src,ip_dst; /* source and dest address */
Stefan Weil541dc0d2011-08-31 12:38:01 +020092} QEMU_PACKED;
bellardf0cbd3e2004-04-22 00:10:48 +000093
94#define IP_MAXPACKET 65535 /* maximum packet size */
95
96/*
97 * Definitions for IP type of service (ip_tos)
98 */
99#define IPTOS_LOWDELAY 0x10
100#define IPTOS_THROUGHPUT 0x08
101#define IPTOS_RELIABILITY 0x04
102
103/*
104 * Definitions for options.
105 */
106#define IPOPT_COPIED(o) ((o)&0x80)
107#define IPOPT_CLASS(o) ((o)&0x60)
108#define IPOPT_NUMBER(o) ((o)&0x1f)
109
110#define IPOPT_CONTROL 0x00
111#define IPOPT_RESERVED1 0x20
112#define IPOPT_DEBMEAS 0x40
113#define IPOPT_RESERVED2 0x60
114
115#define IPOPT_EOL 0 /* end of option list */
116#define IPOPT_NOP 1 /* no operation */
117
118#define IPOPT_RR 7 /* record packet route */
119#define IPOPT_TS 68 /* timestamp */
120#define IPOPT_SECURITY 130 /* provide s,c,h,tcc */
121#define IPOPT_LSRR 131 /* loose source route */
122#define IPOPT_SATID 136 /* satnet id */
123#define IPOPT_SSRR 137 /* strict source route */
124
125/*
126 * Offsets to fields in options other than EOL and NOP.
127 */
128#define IPOPT_OPTVAL 0 /* option ID */
129#define IPOPT_OLEN 1 /* option length */
130#define IPOPT_OFFSET 2 /* offset within option */
131#define IPOPT_MINOFF 4 /* min value of above */
132
133/*
134 * Time stamp option structure.
135 */
136struct ip_timestamp {
Stefan Weilb6dce922010-07-22 22:15:23 +0200137 uint8_t ipt_code; /* IPOPT_TS */
138 uint8_t ipt_len; /* size of structure (variable) */
139 uint8_t ipt_ptr; /* index of current entry */
Marc-André Lureaue429f292018-11-14 16:36:26 +0400140#if G_BYTE_ORDER == G_BIG_ENDIAN
Jan Kiszka1b930bf2011-08-06 14:23:29 +0200141 uint8_t ipt_oflw:4, /* overflow counter */
bellardf0cbd3e2004-04-22 00:10:48 +0000142 ipt_flg:4; /* flags, see below */
143#else
Jan Kiszka1b930bf2011-08-06 14:23:29 +0200144 uint8_t ipt_flg:4, /* flags, see below */
bellardf0cbd3e2004-04-22 00:10:48 +0000145 ipt_oflw:4; /* overflow counter */
146#endif
147 union ipt_timestamp {
148 n_long ipt_time[1];
149 struct ipt_ta {
150 struct in_addr ipt_addr;
151 n_long ipt_time;
152 } ipt_ta[1];
153 } ipt_timestamp;
Stefan Weil541dc0d2011-08-31 12:38:01 +0200154} QEMU_PACKED;
bellardf0cbd3e2004-04-22 00:10:48 +0000155
156/* flag bits for ipt_flg */
157#define IPOPT_TS_TSONLY 0 /* timestamps only */
158#define IPOPT_TS_TSANDADDR 1 /* timestamps and addresses */
159#define IPOPT_TS_PRESPEC 3 /* specified modules only */
160
161/* bits for security (not byte swapped) */
162#define IPOPT_SECUR_UNCLASS 0x0000
163#define IPOPT_SECUR_CONFID 0xf135
164#define IPOPT_SECUR_EFTO 0x789a
165#define IPOPT_SECUR_MMMM 0xbc4d
166#define IPOPT_SECUR_RESTR 0xaf13
167#define IPOPT_SECUR_SECRET 0xd788
168#define IPOPT_SECUR_TOPSECRET 0x6bc5
169
170/*
171 * Internet implementation parameters.
172 */
173#define MAXTTL 255 /* maximum time to live (seconds) */
174#define IPDEFTTL 64 /* default ttl, from RFC 1340 */
175#define IPFRAGTTL 60 /* time to live for frags, slowhz */
176#define IPTTLDEC 1 /* subtracted when forwarding */
177
178#define IP_MSS 576 /* default maximum segment size */
179
Marc-André Lureau0826c242018-11-14 16:36:27 +0400180#if GLIB_SIZEOF_VOID_P == 4
blueswir1429d0a32009-01-13 19:48:42 +0000181struct mbuf_ptr {
182 struct mbuf *mptr;
183 uint32_t dummy;
Stefan Weil541dc0d2011-08-31 12:38:01 +0200184} QEMU_PACKED;
bellardf0cbd3e2004-04-22 00:10:48 +0000185#else
blueswir1429d0a32009-01-13 19:48:42 +0000186struct mbuf_ptr {
187 struct mbuf *mptr;
Stefan Weil541dc0d2011-08-31 12:38:01 +0200188} QEMU_PACKED;
bellardf0cbd3e2004-04-22 00:10:48 +0000189#endif
blueswir1429d0a32009-01-13 19:48:42 +0000190struct qlink {
191 void *next, *prev;
192};
bellardf0cbd3e2004-04-22 00:10:48 +0000193
194/*
195 * Overlay for ip header used by other protocols (tcp, udp).
196 */
197struct ipovly {
blueswir1429d0a32009-01-13 19:48:42 +0000198 struct mbuf_ptr ih_mbuf; /* backpointer to mbuf */
Stefan Weilb6dce922010-07-22 22:15:23 +0200199 uint8_t ih_x1; /* (unused) */
200 uint8_t ih_pr; /* protocol */
201 uint16_t ih_len; /* protocol length */
bellardf0cbd3e2004-04-22 00:10:48 +0000202 struct in_addr ih_src; /* source internet address */
203 struct in_addr ih_dst; /* destination internet address */
Stefan Weil541dc0d2011-08-31 12:38:01 +0200204} QEMU_PACKED;
bellardf0cbd3e2004-04-22 00:10:48 +0000205
206/*
207 * Ip reassembly queue structure. Each fragment
208 * being reassembled is attached to one of these structures.
209 * They are timed out after ipq_ttl drops to 0, and may also
210 * be reclaimed if memory becomes tight.
211 * size 28 bytes
212 */
213struct ipq {
blueswir1429d0a32009-01-13 19:48:42 +0000214 struct qlink frag_link; /* to ip headers of fragments */
215 struct qlink ip_link; /* to other reass headers */
Stefan Weilb6dce922010-07-22 22:15:23 +0200216 uint8_t ipq_ttl; /* time for reass q to live */
217 uint8_t ipq_p; /* protocol of this fragment */
218 uint16_t ipq_id; /* sequence id for reassembly */
bellardf0cbd3e2004-04-22 00:10:48 +0000219 struct in_addr ipq_src,ipq_dst;
Stefan Weil541dc0d2011-08-31 12:38:01 +0200220} QEMU_PACKED;
bellardf0cbd3e2004-04-22 00:10:48 +0000221
222/*
223 * Ip header, when holding a fragment.
224 *
blueswir1429d0a32009-01-13 19:48:42 +0000225 * Note: ipf_link must be at same offset as frag_link above
bellardf0cbd3e2004-04-22 00:10:48 +0000226 */
227struct ipasfrag {
blueswir1429d0a32009-01-13 19:48:42 +0000228 struct qlink ipf_link;
229 struct ip ipf_ip;
Stefan Weil541dc0d2011-08-31 12:38:01 +0200230} QEMU_PACKED;
bellardf0cbd3e2004-04-22 00:10:48 +0000231
blueswir1429d0a32009-01-13 19:48:42 +0000232#define ipf_off ipf_ip.ip_off
233#define ipf_tos ipf_ip.ip_tos
234#define ipf_len ipf_ip.ip_len
235#define ipf_next ipf_link.next
Stefan Weilb6dce922010-07-22 22:15:23 +0200236#define ipf_prev ipf_link.prev
blueswir1429d0a32009-01-13 19:48:42 +0000237
bellardf0cbd3e2004-04-22 00:10:48 +0000238#endif