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