Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
folium-app
GitHub Repository: folium-app/Folium
Path: blob/a-new-beginning/SharedDependencies/Sources/libslirp/tcp_timer.c
2 views
1
/* SPDX-License-Identifier: BSD-3-Clause */
2
/*
3
* Copyright (c) 1982, 1986, 1988, 1990, 1993
4
* The Regents of the University of California. All rights reserved.
5
*
6
* Redistribution and use in source and binary forms, with or without
7
* modification, are permitted provided that the following conditions
8
* are met:
9
* 1. Redistributions of source code must retain the above copyright
10
* notice, this list of conditions and the following disclaimer.
11
* 2. Redistributions in binary form must reproduce the above copyright
12
* notice, this list of conditions and the following disclaimer in the
13
* documentation and/or other materials provided with the distribution.
14
* 3. Neither the name of the University nor the names of its contributors
15
* may be used to endorse or promote products derived from this software
16
* without specific prior written permission.
17
*
18
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28
* SUCH DAMAGE.
29
*
30
* @(#)tcp_timer.c 8.1 (Berkeley) 6/10/93
31
* tcp_timer.c,v 1.2 1994/08/02 07:49:10 davidg Exp
32
*/
33
34
#include "slirp.h"
35
36
static struct tcpcb *tcp_timers(register struct tcpcb *tp, int timer);
37
38
/*
39
* Fast timeout routine for processing delayed acks
40
*/
41
void tcp_fasttimo(Slirp *slirp)
42
{
43
register struct socket *so;
44
register struct tcpcb *tp;
45
46
DEBUG_CALL("tcp_fasttimo");
47
48
so = slirp->tcb.so_next;
49
if (so)
50
for (; so != &slirp->tcb; so = so->so_next)
51
if ((tp = (struct tcpcb *)so->so_tcpcb) &&
52
(tp->t_flags & TF_DELACK)) {
53
tp->t_flags &= ~TF_DELACK;
54
tp->t_flags |= TF_ACKNOW;
55
tcp_output(tp);
56
}
57
}
58
59
/*
60
* Tcp protocol timeout routine called every 500 ms.
61
* Updates the timers in all active tcb's and
62
* causes finite state machine actions if timers expire.
63
*/
64
void tcp_slowtimo(Slirp *slirp)
65
{
66
register struct socket *ip, *ipnxt;
67
register struct tcpcb *tp;
68
register int i;
69
70
DEBUG_CALL("tcp_slowtimo");
71
72
/*
73
* Search through tcb's and update active timers.
74
*/
75
ip = slirp->tcb.so_next;
76
if (ip == NULL) {
77
return;
78
}
79
for (; ip != &slirp->tcb; ip = ipnxt) {
80
ipnxt = ip->so_next;
81
tp = sototcpcb(ip);
82
if (tp == NULL) {
83
continue;
84
}
85
for (i = 0; i < TCPT_NTIMERS; i++) {
86
if (tp->t_timer[i] && --tp->t_timer[i] == 0) {
87
tcp_timers(tp, i);
88
if (ipnxt->so_prev != ip)
89
goto tpgone;
90
}
91
}
92
tp->t_idle++;
93
if (tp->t_rtt)
94
tp->t_rtt++;
95
tpgone:;
96
}
97
slirp->tcp_iss += TCP_ISSINCR / PR_SLOWHZ; /* increment iss */
98
slirp->tcp_now++; /* for timestamps */
99
}
100
101
void tcp_canceltimers(struct tcpcb *tp)
102
{
103
register int i;
104
105
for (i = 0; i < TCPT_NTIMERS; i++)
106
tp->t_timer[i] = 0;
107
}
108
109
const int tcp_backoff[TCP_MAXRXTSHIFT + 1] = { 1, 2, 4, 8, 16, 32, 64,
110
64, 64, 64, 64, 64, 64 };
111
112
/*
113
* TCP timer processing.
114
*/
115
static struct tcpcb *tcp_timers(register struct tcpcb *tp, int timer)
116
{
117
register int rexmt;
118
119
DEBUG_CALL("tcp_timers");
120
121
switch (timer) {
122
/*
123
* 2 MSL timeout in shutdown went off. If we're closed but
124
* still waiting for peer to close and connection has been idle
125
* too long, or if 2MSL time is up from TIME_WAIT, delete connection
126
* control block. Otherwise, check again in a bit.
127
*/
128
case TCPT_2MSL:
129
if (tp->t_state != TCPS_TIME_WAIT && tp->t_idle <= TCP_MAXIDLE)
130
tp->t_timer[TCPT_2MSL] = TCPTV_KEEPINTVL;
131
else
132
tp = tcp_close(tp);
133
break;
134
135
/*
136
* Retransmission timer went off. Message has not
137
* been acked within retransmit interval. Back off
138
* to a longer retransmit interval and retransmit one segment.
139
*/
140
case TCPT_REXMT:
141
142
/*
143
* XXXXX If a packet has timed out, then remove all the queued
144
* packets for that session.
145
*/
146
147
if (++tp->t_rxtshift > TCP_MAXRXTSHIFT) {
148
/*
149
* This is a hack to suit our terminal server here at the uni of
150
* canberra since they have trouble with zeroes... It usually lets
151
* them through unharmed, but under some conditions, it'll eat the
152
* zeros. If we keep retransmitting it, it'll keep eating the
153
* zeroes, so we keep retransmitting, and eventually the connection
154
* dies... (this only happens on incoming data)
155
*
156
* So, if we were gonna drop the connection from too many
157
* retransmits, don't... instead halve the t_maxseg, which might
158
* break up the NULLs and let them through
159
*
160
* *sigh*
161
*/
162
163
tp->t_maxseg >>= 1;
164
if (tp->t_maxseg < 32) {
165
/*
166
* We tried our best, now the connection must die!
167
*/
168
tp->t_rxtshift = TCP_MAXRXTSHIFT;
169
tp = tcp_drop(tp, tp->t_softerror);
170
/* tp->t_softerror : ETIMEDOUT); */ /* XXX */
171
return (tp); /* XXX */
172
}
173
174
/*
175
* Set rxtshift to 6, which is still at the maximum
176
* backoff time
177
*/
178
tp->t_rxtshift = 6;
179
}
180
rexmt = TCP_REXMTVAL(tp) * tcp_backoff[tp->t_rxtshift];
181
TCPT_RANGESET(tp->t_rxtcur, rexmt, (short)tp->t_rttmin,
182
TCPTV_REXMTMAX); /* XXX */
183
tp->t_timer[TCPT_REXMT] = tp->t_rxtcur;
184
/*
185
* If losing, let the lower level know and try for
186
* a better route. Also, if we backed off this far,
187
* our srtt estimate is probably bogus. Clobber it
188
* so we'll take the next rtt measurement as our srtt;
189
* move the current srtt into rttvar to keep the current
190
* retransmit times until then.
191
*/
192
if (tp->t_rxtshift > TCP_MAXRXTSHIFT / 4) {
193
tp->t_rttvar += (tp->t_srtt >> TCP_RTT_SHIFT);
194
tp->t_srtt = 0;
195
}
196
tp->snd_nxt = tp->snd_una;
197
/*
198
* If timing a segment in this window, stop the timer.
199
*/
200
tp->t_rtt = 0;
201
/*
202
* Close the congestion window down to one segment
203
* (we'll open it by one segment for each ack we get).
204
* Since we probably have a window's worth of unacked
205
* data accumulated, this "slow start" keeps us from
206
* dumping all that data as back-to-back packets (which
207
* might overwhelm an intermediate gateway).
208
*
209
* There are two phases to the opening: Initially we
210
* open by one mss on each ack. This makes the window
211
* size increase exponentially with time. If the
212
* window is larger than the path can handle, this
213
* exponential growth results in dropped packet(s)
214
* almost immediately. To get more time between
215
* drops but still "push" the network to take advantage
216
* of improving conditions, we switch from exponential
217
* to linear window opening at some threshold size.
218
* For a threshold, we use half the current window
219
* size, truncated to a multiple of the mss.
220
*
221
* (the minimum cwnd that will give us exponential
222
* growth is 2 mss. We don't allow the threshold
223
* to go below this.)
224
*/
225
{
226
unsigned win = MIN(tp->snd_wnd, tp->snd_cwnd) / 2 / tp->t_maxseg;
227
if (win < 2)
228
win = 2;
229
tp->snd_cwnd = tp->t_maxseg;
230
tp->snd_ssthresh = win * tp->t_maxseg;
231
tp->t_dupacks = 0;
232
}
233
tcp_output(tp);
234
break;
235
236
/*
237
* Persistence timer into zero window.
238
* Force a byte to be output, if possible.
239
*/
240
case TCPT_PERSIST:
241
tcp_setpersist(tp);
242
tp->t_force = 1;
243
tcp_output(tp);
244
tp->t_force = 0;
245
break;
246
247
/*
248
* Keep-alive timer went off; send something
249
* or drop connection if idle for too long.
250
*/
251
case TCPT_KEEP:
252
if (tp->t_state < TCPS_ESTABLISHED)
253
goto dropit;
254
255
if (slirp_do_keepalive && tp->t_state <= TCPS_CLOSE_WAIT) {
256
if (tp->t_idle >= TCPTV_KEEP_IDLE + TCP_MAXIDLE)
257
goto dropit;
258
/*
259
* Send a packet designed to force a response
260
* if the peer is up and reachable:
261
* either an ACK if the connection is still alive,
262
* or an RST if the peer has closed the connection
263
* due to timeout or reboot.
264
* Using sequence number tp->snd_una-1
265
* causes the transmitted zero-length segment
266
* to lie outside the receive window;
267
* by the protocol spec, this requires the
268
* correspondent TCP to respond.
269
*/
270
tcp_respond(tp, &tp->t_template, (struct mbuf *)NULL, tp->rcv_nxt,
271
tp->snd_una - 1, 0, tp->t_socket->so_ffamily);
272
tp->t_timer[TCPT_KEEP] = TCPTV_KEEPINTVL;
273
} else
274
tp->t_timer[TCPT_KEEP] = TCPTV_KEEP_IDLE;
275
break;
276
277
dropit:
278
tp = tcp_drop(tp, 0);
279
break;
280
}
281
282
return (tp);
283
}
284
285