1 | /* $Id: tcp_timer.c 69498 2017-10-28 15:07:25Z vboxsync $ */
|
---|
2 | /** @file
|
---|
3 | * NAT - TCP timers.
|
---|
4 | */
|
---|
5 |
|
---|
6 | /*
|
---|
7 | * Copyright (C) 2006-2016 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, 1988, 1990, 1993
|
---|
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. All advertising materials mentioning features or use of this software
|
---|
33 | * must display the following acknowledgement:
|
---|
34 | * This product includes software developed by the University of
|
---|
35 | * California, Berkeley and its contributors.
|
---|
36 | * 4. Neither the name of the University nor the names of its contributors
|
---|
37 | * may be used to endorse or promote products derived from this software
|
---|
38 | * without specific prior written permission.
|
---|
39 | *
|
---|
40 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
---|
41 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
---|
42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
---|
43 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
---|
44 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
---|
45 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
---|
46 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
---|
47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
---|
48 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
---|
49 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
---|
50 | * SUCH DAMAGE.
|
---|
51 | *
|
---|
52 | * @(#)tcp_timer.c 8.1 (Berkeley) 6/10/93
|
---|
53 | * tcp_timer.c,v 1.2 1994/08/02 07:49:10 davidg Exp
|
---|
54 | */
|
---|
55 |
|
---|
56 | #include <slirp.h>
|
---|
57 |
|
---|
58 |
|
---|
59 | static struct tcpcb *tcp_timers(PNATState pData, register struct tcpcb *tp, int timer);
|
---|
60 | /*
|
---|
61 | * Fast timeout routine for processing delayed acks
|
---|
62 | */
|
---|
63 | void
|
---|
64 | tcp_fasttimo(PNATState pData)
|
---|
65 | {
|
---|
66 | register struct socket *so, *so_next;
|
---|
67 | register struct tcpcb *tp;
|
---|
68 |
|
---|
69 | LogFlowFuncEnter();
|
---|
70 |
|
---|
71 | so = tcb.so_next;
|
---|
72 | if (so)
|
---|
73 | QSOCKET_FOREACH (so, so_next, tcp)
|
---|
74 | /* { */
|
---|
75 | if ( (tp = (struct tcpcb *)so->so_tcpcb)
|
---|
76 | && (tp->t_flags & TF_DELACK))
|
---|
77 | {
|
---|
78 | tp->t_flags &= ~TF_DELACK;
|
---|
79 | tp->t_flags |= TF_ACKNOW;
|
---|
80 | tcpstat.tcps_delack++;
|
---|
81 | TCP_OUTPUT(pData, tp);
|
---|
82 | }
|
---|
83 | LOOP_LABEL(tcp, so, so_next);
|
---|
84 | }
|
---|
85 | }
|
---|
86 |
|
---|
87 | /*
|
---|
88 | * Tcp protocol timeout routine called every 500 ms.
|
---|
89 | * Updates the timers in all active tcb's and
|
---|
90 | * causes finite state machine actions if timers expire.
|
---|
91 | */
|
---|
92 | void
|
---|
93 | tcp_slowtimo(PNATState pData)
|
---|
94 | {
|
---|
95 | register struct socket *ip, *ipnxt;
|
---|
96 | register struct tcpcb *tp;
|
---|
97 | register int i;
|
---|
98 |
|
---|
99 | LogFlowFuncEnter();
|
---|
100 |
|
---|
101 | /*
|
---|
102 | * Search through tcb's and update active timers.
|
---|
103 | */
|
---|
104 | ip = tcb.so_next;
|
---|
105 | if (ip == 0)
|
---|
106 | return;
|
---|
107 | QSOCKET_FOREACH(ip, ipnxt, tcp)
|
---|
108 | /* { */
|
---|
109 | ipnxt = ip->so_next;
|
---|
110 | tp = sototcpcb(ip);
|
---|
111 | if (tp == 0)
|
---|
112 | CONTINUE(tcp);
|
---|
113 | for (i = 0; i < TCPT_NTIMERS; i++)
|
---|
114 | {
|
---|
115 | if (tp->t_timer[i] && --tp->t_timer[i] == 0)
|
---|
116 | {
|
---|
117 | tcp_timers(pData, tp, i);
|
---|
118 | if (ipnxt->so_prev != ip)
|
---|
119 | goto tpgone;
|
---|
120 | }
|
---|
121 | }
|
---|
122 | tp->t_idle++;
|
---|
123 | if (tp->t_rtt)
|
---|
124 | tp->t_rtt++;
|
---|
125 | tpgone:
|
---|
126 | ;
|
---|
127 | LOOP_LABEL(tcp, ip, ipnxt);
|
---|
128 | }
|
---|
129 | tcp_iss += TCP_ISSINCR / PR_SLOWHZ; /* increment iss */
|
---|
130 | #ifdef TCP_COMPAT_42
|
---|
131 | if ((int)tcp_iss < 0)
|
---|
132 | tcp_iss = 0; /* XXX */
|
---|
133 | #endif
|
---|
134 | tcp_now++; /* for timestamps */
|
---|
135 | }
|
---|
136 |
|
---|
137 | /*
|
---|
138 | * Cancel all timers for TCP tp.
|
---|
139 | */
|
---|
140 | void
|
---|
141 | tcp_canceltimers(struct tcpcb *tp)
|
---|
142 | {
|
---|
143 | register int i;
|
---|
144 |
|
---|
145 | for (i = 0; i < TCPT_NTIMERS; i++)
|
---|
146 | tp->t_timer[i] = 0;
|
---|
147 | }
|
---|
148 |
|
---|
149 | const int tcp_backoff[TCP_MAXRXTSHIFT + 1] =
|
---|
150 | {
|
---|
151 | 1, 2, 4, 8, 16, 32, 64, 64, 64, 64, 64, 64, 64
|
---|
152 | };
|
---|
153 |
|
---|
154 | /*
|
---|
155 | * TCP timer processing.
|
---|
156 | */
|
---|
157 | static struct tcpcb *
|
---|
158 | tcp_timers(PNATState pData, register struct tcpcb *tp, int timer)
|
---|
159 | {
|
---|
160 | register int rexmt;
|
---|
161 | int fUninitializedTemplate = 0;
|
---|
162 |
|
---|
163 | LogFlowFunc(("ENTER: tp:%R[tcpcb793], timer:%d\n", tp, timer));
|
---|
164 | fUninitializedTemplate = RT_BOOL(( tp->t_template.ti_src.s_addr == INADDR_ANY
|
---|
165 | || tp->t_template.ti_dst.s_addr == INADDR_ANY));
|
---|
166 | if (fUninitializedTemplate)
|
---|
167 | {
|
---|
168 | tp = tcp_drop(pData, tp, 0);
|
---|
169 | return tp;
|
---|
170 | }
|
---|
171 |
|
---|
172 | switch (timer)
|
---|
173 | {
|
---|
174 | /*
|
---|
175 | * 2 MSL timeout in shutdown went off. If we're closed but
|
---|
176 | * still waiting for peer to close and connection has been idle
|
---|
177 | * too long, or if 2MSL time is up from TIME_WAIT, delete connection
|
---|
178 | * control block. Otherwise, check again in a bit.
|
---|
179 | */
|
---|
180 | case TCPT_2MSL:
|
---|
181 | if (tp->t_state != TCPS_TIME_WAIT &&
|
---|
182 | tp->t_idle <= tcp_maxidle)
|
---|
183 | tp->t_timer[TCPT_2MSL] = tcp_keepintvl;
|
---|
184 | else
|
---|
185 | tp = tcp_close(pData, tp);
|
---|
186 | break;
|
---|
187 |
|
---|
188 | /*
|
---|
189 | * Retransmission timer went off. Message has not
|
---|
190 | * been acked within retransmit interval. Back off
|
---|
191 | * to a longer retransmit interval and retransmit one segment.
|
---|
192 | */
|
---|
193 | case TCPT_REXMT:
|
---|
194 | STAM_COUNTER_INC(&pData->StatTCP_retransmit);
|
---|
195 | /*
|
---|
196 | * XXX If a packet has timed out, then remove all the queued
|
---|
197 | * packets for that session.
|
---|
198 | */
|
---|
199 | if (++tp->t_rxtshift > TCP_MAXRXTSHIFT)
|
---|
200 | {
|
---|
201 | /*
|
---|
202 | * This is a hack to suit our terminal server here at the uni of canberra
|
---|
203 | * since they have trouble with zeroes... It usually lets them through
|
---|
204 | * unharmed, but under some conditions, it'll eat the zeros. If we
|
---|
205 | * keep retransmitting it, it'll keep eating the zeroes, so we keep
|
---|
206 | * retransmitting, and eventually the connection dies...
|
---|
207 | * (this only happens on incoming data)
|
---|
208 | *
|
---|
209 | * So, if we were gonna drop the connection from too many retransmits,
|
---|
210 | * don't... instead halve the t_maxseg, which might break up the NULLs and
|
---|
211 | * let them through
|
---|
212 | *
|
---|
213 | * *sigh*
|
---|
214 | */
|
---|
215 | tp->t_maxseg >>= 1;
|
---|
216 | if (tp->t_maxseg < 32)
|
---|
217 | {
|
---|
218 | /*
|
---|
219 | * We tried our best, now the connection must die!
|
---|
220 | */
|
---|
221 | tp->t_rxtshift = TCP_MAXRXTSHIFT;
|
---|
222 | tcpstat.tcps_timeoutdrop++;
|
---|
223 | tp = tcp_drop(pData, tp, tp->t_softerror);
|
---|
224 | /* tp->t_softerror : ETIMEDOUT); */ /* XXX */
|
---|
225 | return (tp); /* XXX */
|
---|
226 | }
|
---|
227 |
|
---|
228 | /*
|
---|
229 | * Set rxtshift to 6, which is still at the maximum
|
---|
230 | * backoff time
|
---|
231 | */
|
---|
232 | tp->t_rxtshift = 6;
|
---|
233 | }
|
---|
234 | tcpstat.tcps_rexmttimeo++;
|
---|
235 | rexmt = TCP_REXMTVAL(tp) * tcp_backoff[tp->t_rxtshift];
|
---|
236 | TCPT_RANGESET(tp->t_rxtcur, rexmt,
|
---|
237 | (short)tp->t_rttmin, TCPTV_REXMTMAX); /* XXX */
|
---|
238 | tp->t_timer[TCPT_REXMT] = tp->t_rxtcur;
|
---|
239 | /*
|
---|
240 | * If losing, let the lower level know and try for
|
---|
241 | * a better route. Also, if we backed off this far,
|
---|
242 | * our srtt estimate is probably bogus. Clobber it
|
---|
243 | * so we'll take the next rtt measurement as our srtt;
|
---|
244 | * move the current srtt into rttvar to keep the current
|
---|
245 | * retransmit times until then.
|
---|
246 | */
|
---|
247 | if (tp->t_rxtshift > TCP_MAXRXTSHIFT / 4)
|
---|
248 | {
|
---|
249 | /* in_losing(tp->t_inpcb); */
|
---|
250 | tp->t_rttvar += (tp->t_srtt >> TCP_RTT_SHIFT);
|
---|
251 | tp->t_srtt = 0;
|
---|
252 | }
|
---|
253 | tp->snd_nxt = tp->snd_una;
|
---|
254 | /*
|
---|
255 | * If timing a segment in this window, stop the timer.
|
---|
256 | */
|
---|
257 | tp->t_rtt = 0;
|
---|
258 | /*
|
---|
259 | * Close the congestion window down to one segment
|
---|
260 | * (we'll open it by one segment for each ack we get).
|
---|
261 | * Since we probably have a window's worth of unacked
|
---|
262 | * data accumulated, this "slow start" keeps us from
|
---|
263 | * dumping all that data as back-to-back packets (which
|
---|
264 | * might overwhelm an intermediate gateway).
|
---|
265 | *
|
---|
266 | * There are two phases to the opening: Initially we
|
---|
267 | * open by one mss on each ack. This makes the window
|
---|
268 | * size increase exponentially with time. If the
|
---|
269 | * window is larger than the path can handle, this
|
---|
270 | * exponential growth results in dropped packet(s)
|
---|
271 | * almost immediately. To get more time between
|
---|
272 | * drops but still "push" the network to take advantage
|
---|
273 | * of improving conditions, we switch from exponential
|
---|
274 | * to linear window opening at some threshold size.
|
---|
275 | * For a threshold, we use half the current window
|
---|
276 | * size, truncated to a multiple of the mss.
|
---|
277 | *
|
---|
278 | * (the minimum cwnd that will give us exponential
|
---|
279 | * growth is 2 mss. We don't allow the threshold
|
---|
280 | * to go below this.)
|
---|
281 | */
|
---|
282 | {
|
---|
283 | u_int win = min(tp->snd_wnd, tp->snd_cwnd) / 2 / tp->t_maxseg;
|
---|
284 | if (win < 2)
|
---|
285 | win = 2;
|
---|
286 | tp->snd_cwnd = tp->t_maxseg;
|
---|
287 | tp->snd_ssthresh = win * tp->t_maxseg;
|
---|
288 | tp->t_dupacks = 0;
|
---|
289 | }
|
---|
290 | (void) tcp_output(pData, tp);
|
---|
291 | break;
|
---|
292 |
|
---|
293 | /*
|
---|
294 | * Persistence timer into zero window.
|
---|
295 | * Force a byte to be output, if possible.
|
---|
296 | */
|
---|
297 | case TCPT_PERSIST:
|
---|
298 | tcpstat.tcps_persisttimeo++;
|
---|
299 | tcp_setpersist(tp);
|
---|
300 | tp->t_force = 1;
|
---|
301 | (void) tcp_output(pData, tp);
|
---|
302 | tp->t_force = 0;
|
---|
303 | break;
|
---|
304 |
|
---|
305 | /*
|
---|
306 | * Keep-alive timer went off; send something
|
---|
307 | * or drop connection if idle for too long.
|
---|
308 | */
|
---|
309 | case TCPT_KEEP:
|
---|
310 | tcpstat.tcps_keeptimeo++;
|
---|
311 | if (tp->t_state < TCPS_ESTABLISHED)
|
---|
312 | goto dropit;
|
---|
313 | /* if (tp->t_socket->so_options & SO_KEEPALIVE && */
|
---|
314 | if ((so_options) && tp->t_state <= TCPS_CLOSE_WAIT)
|
---|
315 | {
|
---|
316 | if (tp->t_idle >= tcp_keepidle + tcp_maxidle)
|
---|
317 | goto dropit;
|
---|
318 | /*
|
---|
319 | * Send a packet designed to force a response
|
---|
320 | * if the peer is up and reachable:
|
---|
321 | * either an ACK if the connection is still alive,
|
---|
322 | * or an RST if the peer has closed the connection
|
---|
323 | * due to timeout or reboot.
|
---|
324 | * Using sequence number tp->snd_una-1
|
---|
325 | * causes the transmitted zero-length segment
|
---|
326 | * to lie outside the receive window;
|
---|
327 | * by the protocol spec, this requires the
|
---|
328 | * correspondent TCP to respond.
|
---|
329 | */
|
---|
330 | tcpstat.tcps_keepprobe++;
|
---|
331 | #ifdef TCP_COMPAT_42
|
---|
332 | /*
|
---|
333 | * The keepalive packet must have nonzero length
|
---|
334 | * to get a 4.2 host to respond.
|
---|
335 | */
|
---|
336 | tcp_respond(tp, &tp->t_template, (struct mbuf *)NULL,
|
---|
337 | tp->rcv_nxt - 1, tp->snd_una - 1, 0);
|
---|
338 | #else
|
---|
339 | tcp_respond(pData, tp, &tp->t_template, (struct mbuf *)NULL,
|
---|
340 | tp->rcv_nxt, tp->snd_una - 1, 0);
|
---|
341 | #endif
|
---|
342 | tp->t_timer[TCPT_KEEP] = tcp_keepintvl;
|
---|
343 | }
|
---|
344 | else
|
---|
345 | tp->t_timer[TCPT_KEEP] = tcp_keepidle;
|
---|
346 | break;
|
---|
347 |
|
---|
348 | dropit:
|
---|
349 | tcpstat.tcps_keepdrops++;
|
---|
350 | tp = tcp_drop(pData, tp, 0); /* ETIMEDOUT); */
|
---|
351 | break;
|
---|
352 | }
|
---|
353 |
|
---|
354 | return tp;
|
---|
355 | }
|
---|