VirtualBox

source: vbox/trunk/src/VBox/Devices/Network/slirp/tcp_var.h@ 95573

Last change on this file since 95573 was 95573, checked in by vboxsync, 3 years ago

Network/slirp: Advertising clause for Danny Gasparovsky was unintentional, should have always been 3-clause BSD. Replace 4-clause BSD license by 3-clause, see retroactive license change by UC Berkeley https://www.freebsd.org/copyright/license/

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 12.2 KB
Line 
1/* $Id: tcp_var.h 95573 2022-07-08 18:16:35Z vboxsync $ */
2/** @file
3 * NAT - TCP (declarations).
4 */
5
6/*
7 * Copyright (C) 2006-2022 Oracle Corporation
8 *
9 * This file is part of VirtualBox Open Source Edition (OSE), as
10 * available from http://www.virtualbox.org. This file is free software;
11 * you can redistribute it and/or modify it under the terms of the GNU
12 * General Public License (GPL) as published by the Free Software
13 * Foundation, in version 2 as it comes in the "COPYING" file of the
14 * VirtualBox OSE distribution. VirtualBox OSE is distributed in the
15 * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
16 */
17
18/*
19 * This code is based on:
20 *
21 * Copyright (c) 1982, 1986, 1993, 1994
22 * The Regents of the University of California. All rights reserved.
23 *
24 * Redistribution and use in source and binary forms, with or without
25 * modification, are permitted provided that the following conditions
26 * are met:
27 * 1. Redistributions of source code must retain the above copyright
28 * notice, this list of conditions and the following disclaimer.
29 * 2. Redistributions in binary form must reproduce the above copyright
30 * notice, this list of conditions and the following disclaimer in the
31 * documentation and/or other materials provided with the distribution.
32 * 3. Neither the name of the University nor the names of its contributors
33 * may be used to endorse or promote products derived from this software
34 * without specific prior written permission.
35 *
36 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
37 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
38 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
39 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
40 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
41 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
42 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
43 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
44 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
45 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
46 * SUCH DAMAGE.
47 *
48 * @(#)tcp_var.h 8.3 (Berkeley) 4/10/94
49 * tcp_var.h,v 1.3 1994/08/21 05:27:39 paul Exp
50 */
51
52#ifndef _TCP_VAR_H_
53#define _TCP_VAR_H_
54
55#include "queue.h"
56#include "tcpip.h"
57#include "tcp_timer.h"
58
59/* TCP segment queue entry */
60struct tseg_qent
61{
62 LIST_ENTRY(tseg_qent) tqe_q;
63 int tqe_len; /* TCP segment data length */
64 struct tcphdr *tqe_th; /* a pointer to tcp header */
65 struct mbuf *tqe_m; /* mbuf contains packet */
66};
67LIST_HEAD(tsegqe_head, tseg_qent);
68
69/*
70 * Tcp control block, one per tcp; fields:
71 */
72struct tcpcb
73{
74 LIST_ENTRY(tcpcb) t_list;
75 struct tsegqe_head t_segq; /* segment reassembly queue */
76 int t_segqlen; /* segment reassembly queue length */
77 int16_t t_state; /* state of this connection */
78 int16_t t_timer[TCPT_NTIMERS]; /* tcp timers */
79 int16_t t_rxtshift; /* log(2) of rexmt exp. backoff */
80 int16_t t_rxtcur; /* current retransmit value */
81 int16_t t_dupacks; /* consecutive dup acks recd */
82 uint16_t t_maxseg; /* maximum segment size */
83 char t_force; /* 1 if forcing out a byte */
84 uint16_t t_flags;
85#define TF_ACKNOW 0x0001 /* ack peer immediately */
86#define TF_DELACK 0x0002 /* ack, but try to delay it */
87#define TF_NODELAY 0x0004 /* don't delay packets to coalesce */
88#define TF_NOOPT 0x0008 /* don't use tcp options */
89#define TF_SENTFIN 0x0010 /* have sent FIN */
90#define TF_REQ_SCALE 0x0020 /* have/will request window scaling */
91#define TF_RCVD_SCALE 0x0040 /* other side has requested scaling */
92#define TF_REQ_TSTMP 0x0080 /* have/will request timestamps */
93#define TF_RCVD_TSTMP 0x0100 /* a timestamp was received in SYN */
94#define TF_SACK_PERMIT 0x0200 /* other side said I could SACK */
95
96 /* Make it static for now */
97/* struct tcpiphdr *t_template; / * skeletal packet for transmit */
98 struct tcpiphdr t_template;
99
100 struct socket *t_socket; /* back pointer to socket */
101/*
102 * The following fields are used as in the protocol specification.
103 * See RFC783, Dec. 1981, page 21.
104 */
105 /* send sequence variables */
106 tcp_seq snd_una; /* send unacknowledged */
107 tcp_seq snd_nxt; /* send next */
108 tcp_seq snd_up; /* send urgent pointer */
109 tcp_seq snd_wl1; /* window update seg seq number */
110 tcp_seq snd_wl2; /* window update seg ack number */
111 tcp_seq iss; /* initial send sequence number */
112 uint32_t snd_wnd; /* send window */
113 /* receive sequence variables */
114 uint32_t rcv_wnd; /* receive window */
115 tcp_seq rcv_nxt; /* receive next */
116 tcp_seq rcv_up; /* receive urgent pointer */
117 tcp_seq irs; /* initial receive sequence number */
118/*
119 * Additional variables for this implementation.
120 */
121 /* receive variables */
122 tcp_seq rcv_adv; /* advertised window */
123 /* retransmit variables */
124 tcp_seq snd_max; /* highest sequence number sent;
125 * used to recognize retransmits
126 */
127 /* congestion control (for slow start, source quench, retransmit after loss) */
128 uint32_t snd_cwnd; /* congestion-controlled window */
129 uint32_t snd_ssthresh; /* snd_cwnd size threshold for
130 * for slow start exponential to
131 * linear switch
132 */
133/*
134 * transmit timing stuff. See below for scale of srtt and rttvar.
135 * "Variance" is actually smoothed difference.
136 */
137 int16_t t_idle; /* inactivity time */
138 int16_t t_rtt; /* round trip time */
139 tcp_seq t_rtseq; /* sequence number being timed */
140 int16_t t_srtt; /* smoothed round-trip time */
141 int16_t t_rttvar; /* variance in round-trip time */
142 uint16_t t_rttmin; /* minimum rtt allowed */
143 uint32_t max_sndwnd; /* largest window peer has offered */
144
145/* out-of-band data */
146 char t_oobflags; /* have some */
147 char t_iobc; /* input character */
148#define TCPOOB_HAVEDATA 0x01
149#define TCPOOB_HADDATA 0x02
150 short t_softerror; /* possible error not yet reported */
151
152/* RFC 1323 variables */
153 uint8_t snd_scale; /* window scaling for send window */
154 uint8_t rcv_scale; /* window scaling for recv window */
155 uint8_t request_r_scale; /* pending window scaling */
156 uint8_t requested_s_scale;
157 uint32_t ts_recent; /* timestamp echo data */
158 uint32_t ts_recent_age; /* when last updated */
159 tcp_seq last_ack_sent;
160};
161
162LIST_HEAD(tcpcbhead, tcpcb);
163
164#define sototcpcb(so) ((so)->so_tcpcb)
165
166/*
167 * The smoothed round-trip time and estimated variance
168 * are stored as fixed point numbers scaled by the values below.
169 * For convenience, these scales are also used in smoothing the average
170 * (smoothed = (1/scale)sample + ((scale-1)/scale)smoothed).
171 * With these scales, srtt has 3 bits to the right of the binary point,
172 * and thus an "ALPHA" of 0.875. rttvar has 2 bits to the right of the
173 * binary point, and is smoothed with an ALPHA of 0.75.
174 */
175#define TCP_RTT_SCALE 8 /* multiplier for srtt; 3 bits frac. */
176#define TCP_RTT_SHIFT 3 /* shift for srtt; 3 bits frac. */
177#define TCP_RTTVAR_SCALE 4 /* multiplier for rttvar; 2 bits */
178#define TCP_RTTVAR_SHIFT 2 /* multiplier for rttvar; 2 bits */
179
180/*
181 * The initial retransmission should happen at rtt + 4 * rttvar.
182 * Because of the way we do the smoothing, srtt and rttvar
183 * will each average +1/2 tick of bias. When we compute
184 * the retransmit timer, we want 1/2 tick of rounding and
185 * 1 extra tick because of +-1/2 tick uncertainty in the
186 * firing of the timer. The bias will give us exactly the
187 * 1.5 tick we need. But, because the bias is
188 * statistical, we have to test that we don't drop below
189 * the minimum feasible timer (which is 2 ticks).
190 * This macro assumes that the value of TCP_RTTVAR_SCALE
191 * is the same as the multiplier for rttvar.
192 */
193#define TCP_REXMTVAL(tp) \
194 (((tp)->t_srtt >> TCP_RTT_SHIFT) + (tp)->t_rttvar)
195
196/*
197 * TCP statistics.
198 * Many of these should be kept per connection,
199 * but that's inconvenient at the moment.
200 */
201struct tcpstat_t
202{
203 u_long tcps_connattempt; /* connections initiated */
204 u_long tcps_accepts; /* connections accepted */
205 u_long tcps_connects; /* connections established */
206 u_long tcps_drops; /* connections dropped */
207 u_long tcps_conndrops; /* embryonic connections dropped */
208 u_long tcps_closed; /* conn. closed (includes drops) */
209 u_long tcps_segstimed; /* segs where we tried to get rtt */
210 u_long tcps_rttupdated; /* times we succeeded */
211 u_long tcps_delack; /* delayed acks sent */
212 u_long tcps_timeoutdrop; /* conn. dropped in rxmt timeout */
213 u_long tcps_rexmttimeo; /* retransmit timeouts */
214 u_long tcps_persisttimeo; /* persist timeouts */
215 u_long tcps_keeptimeo; /* keepalive timeouts */
216 u_long tcps_keepprobe; /* keepalive probes sent */
217 u_long tcps_keepdrops; /* connections dropped in keepalive */
218
219 u_long tcps_sndtotal; /* total packets sent */
220 u_long tcps_sndpack; /* data packets sent */
221 u_long tcps_sndbyte; /* data bytes sent */
222 u_long tcps_sndrexmitpack; /* data packets retransmitted */
223 u_long tcps_sndrexmitbyte; /* data bytes retransmitted */
224 u_long tcps_sndacks; /* ack-only packets sent */
225 u_long tcps_sndprobe; /* window probes sent */
226 u_long tcps_sndurg; /* packets sent with URG only */
227 u_long tcps_sndwinup; /* window update-only packets sent */
228 u_long tcps_sndctrl; /* control (SYN|FIN|RST) packets sent */
229
230 u_long tcps_rcvtotal; /* total packets received */
231 u_long tcps_rcvpack; /* packets received in sequence */
232 u_long tcps_rcvbyte; /* bytes received in sequence */
233 u_long tcps_rcvbadsum; /* packets received with ccksum errs */
234 u_long tcps_rcvbadoff; /* packets received with bad offset */
235/* u_long tcps_rcvshort; */ /* packets received too short */
236 u_long tcps_rcvduppack; /* duplicate-only packets received */
237 u_long tcps_rcvdupbyte; /* duplicate-only bytes received */
238 u_long tcps_rcvpartduppack; /* packets with some duplicate data */
239 u_long tcps_rcvpartdupbyte; /* dup. bytes in part-dup. packets */
240 u_long tcps_rcvoopack; /* out-of-order packets received */
241 u_long tcps_rcvoobyte; /* out-of-order bytes received */
242 u_long tcps_rcvpackafterwin; /* packets with data after window */
243 u_long tcps_rcvbyteafterwin; /* bytes rcvd after window */
244 u_long tcps_rcvafterclose; /* packets rcvd after "close" */
245 u_long tcps_rcvwinprobe; /* rcvd window probe packets */
246 u_long tcps_rcvdupack; /* rcvd duplicate acks */
247 u_long tcps_rcvacktoomuch; /* rcvd acks for unsent data */
248 u_long tcps_rcvackpack; /* rcvd ack packets */
249 u_long tcps_rcvackbyte; /* bytes acked by rcvd acks */
250 u_long tcps_rcvwinupd; /* rcvd window update packets */
251/* u_long tcps_pawsdrop; */ /* segments dropped due to PAWS */
252 u_long tcps_predack; /* times hdr predict ok for acks */
253 u_long tcps_preddat; /* times hdr predict ok for data pkts */
254 u_long tcps_socachemiss; /* tcp_last_so misses */
255 u_long tcps_didnuttin; /* Times tcp_output didn't do anything XXX */
256 u_long tcps_rcvmemdrop;
257};
258
259#endif
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette