tcp_timer.c revision 1.5 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1982, 1986, 1988, 1990 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd *
33 1.2 cgd * from: @(#)tcp_timer.c 7.18 (Berkeley) 6/28/90
34 1.5 mycroft * $Id: tcp_timer.c,v 1.5 1994/01/08 21:22:02 mycroft Exp $
35 1.1 cgd */
36 1.1 cgd
37 1.4 mycroft #include <sys/param.h>
38 1.4 mycroft #include <sys/systm.h>
39 1.4 mycroft #include <sys/malloc.h>
40 1.4 mycroft #include <sys/mbuf.h>
41 1.4 mycroft #include <sys/socket.h>
42 1.4 mycroft #include <sys/socketvar.h>
43 1.4 mycroft #include <sys/protosw.h>
44 1.4 mycroft #include <sys/errno.h>
45 1.1 cgd
46 1.4 mycroft #include <net/if.h>
47 1.4 mycroft #include <net/route.h>
48 1.1 cgd
49 1.4 mycroft #include <netinet/in.h>
50 1.4 mycroft #include <netinet/in_systm.h>
51 1.4 mycroft #include <netinet/ip.h>
52 1.4 mycroft #include <netinet/in_pcb.h>
53 1.4 mycroft #include <netinet/ip_var.h>
54 1.4 mycroft #include <netinet/tcp.h>
55 1.4 mycroft #include <netinet/tcp_fsm.h>
56 1.4 mycroft #include <netinet/tcp_seq.h>
57 1.4 mycroft #include <netinet/tcp_timer.h>
58 1.4 mycroft #include <netinet/tcp_var.h>
59 1.4 mycroft #include <netinet/tcpip.h>
60 1.1 cgd
61 1.1 cgd int tcp_keepidle = TCPTV_KEEP_IDLE;
62 1.1 cgd int tcp_keepintvl = TCPTV_KEEPINTVL;
63 1.1 cgd int tcp_maxidle;
64 1.1 cgd /*
65 1.1 cgd * Fast timeout routine for processing delayed acks
66 1.1 cgd */
67 1.1 cgd tcp_fasttimo()
68 1.1 cgd {
69 1.1 cgd register struct inpcb *inp;
70 1.1 cgd register struct tcpcb *tp;
71 1.1 cgd int s = splnet();
72 1.1 cgd
73 1.1 cgd inp = tcb.inp_next;
74 1.1 cgd if (inp)
75 1.1 cgd for (; inp != &tcb; inp = inp->inp_next)
76 1.1 cgd if ((tp = (struct tcpcb *)inp->inp_ppcb) &&
77 1.1 cgd (tp->t_flags & TF_DELACK)) {
78 1.1 cgd tp->t_flags &= ~TF_DELACK;
79 1.1 cgd tp->t_flags |= TF_ACKNOW;
80 1.1 cgd tcpstat.tcps_delack++;
81 1.1 cgd (void) tcp_output(tp);
82 1.1 cgd }
83 1.1 cgd splx(s);
84 1.1 cgd }
85 1.1 cgd
86 1.1 cgd /*
87 1.1 cgd * Tcp protocol timeout routine called every 500 ms.
88 1.1 cgd * Updates the timers in all active tcb's and
89 1.1 cgd * causes finite state machine actions if timers expire.
90 1.1 cgd */
91 1.1 cgd tcp_slowtimo()
92 1.1 cgd {
93 1.1 cgd register struct inpcb *ip, *ipnxt;
94 1.1 cgd register struct tcpcb *tp;
95 1.1 cgd int s = splnet();
96 1.1 cgd register int i;
97 1.1 cgd
98 1.1 cgd tcp_maxidle = TCPTV_KEEPCNT * tcp_keepintvl;
99 1.1 cgd /*
100 1.1 cgd * Search through tcb's and update active timers.
101 1.1 cgd */
102 1.1 cgd ip = tcb.inp_next;
103 1.1 cgd if (ip == 0) {
104 1.1 cgd splx(s);
105 1.1 cgd return;
106 1.1 cgd }
107 1.1 cgd for (; ip != &tcb; ip = ipnxt) {
108 1.1 cgd ipnxt = ip->inp_next;
109 1.1 cgd tp = intotcpcb(ip);
110 1.1 cgd if (tp == 0)
111 1.1 cgd continue;
112 1.1 cgd for (i = 0; i < TCPT_NTIMERS; i++) {
113 1.1 cgd if (tp->t_timer[i] && --tp->t_timer[i] == 0) {
114 1.1 cgd (void) tcp_usrreq(tp->t_inpcb->inp_socket,
115 1.1 cgd PRU_SLOWTIMO, (struct mbuf *)0,
116 1.1 cgd (struct mbuf *)i, (struct mbuf *)0);
117 1.1 cgd if (ipnxt->inp_prev != ip)
118 1.1 cgd goto tpgone;
119 1.1 cgd }
120 1.1 cgd }
121 1.1 cgd tp->t_idle++;
122 1.1 cgd if (tp->t_rtt)
123 1.1 cgd tp->t_rtt++;
124 1.1 cgd tpgone:
125 1.1 cgd ;
126 1.1 cgd }
127 1.1 cgd tcp_iss += TCP_ISSINCR/PR_SLOWHZ; /* increment iss */
128 1.1 cgd #ifdef TCP_COMPAT_42
129 1.1 cgd if ((int)tcp_iss < 0)
130 1.1 cgd tcp_iss = 0; /* XXX */
131 1.1 cgd #endif
132 1.1 cgd splx(s);
133 1.1 cgd }
134 1.1 cgd
135 1.1 cgd /*
136 1.1 cgd * Cancel all timers for TCP tp.
137 1.1 cgd */
138 1.1 cgd tcp_canceltimers(tp)
139 1.1 cgd struct tcpcb *tp;
140 1.1 cgd {
141 1.1 cgd register int i;
142 1.1 cgd
143 1.1 cgd for (i = 0; i < TCPT_NTIMERS; i++)
144 1.1 cgd tp->t_timer[i] = 0;
145 1.1 cgd }
146 1.1 cgd
147 1.1 cgd int tcp_backoff[TCP_MAXRXTSHIFT + 1] =
148 1.1 cgd { 1, 2, 4, 8, 16, 32, 64, 64, 64, 64, 64, 64, 64 };
149 1.1 cgd
150 1.1 cgd /*
151 1.1 cgd * TCP timer processing.
152 1.1 cgd */
153 1.1 cgd struct tcpcb *
154 1.1 cgd tcp_timers(tp, timer)
155 1.1 cgd register struct tcpcb *tp;
156 1.1 cgd int timer;
157 1.1 cgd {
158 1.1 cgd register int rexmt;
159 1.1 cgd
160 1.1 cgd switch (timer) {
161 1.1 cgd
162 1.1 cgd /*
163 1.1 cgd * 2 MSL timeout in shutdown went off. If we're closed but
164 1.1 cgd * still waiting for peer to close and connection has been idle
165 1.1 cgd * too long, or if 2MSL time is up from TIME_WAIT, delete connection
166 1.1 cgd * control block. Otherwise, check again in a bit.
167 1.1 cgd */
168 1.1 cgd case TCPT_2MSL:
169 1.1 cgd if (tp->t_state != TCPS_TIME_WAIT &&
170 1.1 cgd tp->t_idle <= tcp_maxidle)
171 1.1 cgd tp->t_timer[TCPT_2MSL] = tcp_keepintvl;
172 1.1 cgd else
173 1.1 cgd tp = tcp_close(tp);
174 1.1 cgd break;
175 1.1 cgd
176 1.1 cgd /*
177 1.1 cgd * Retransmission timer went off. Message has not
178 1.1 cgd * been acked within retransmit interval. Back off
179 1.1 cgd * to a longer retransmit interval and retransmit one segment.
180 1.1 cgd */
181 1.1 cgd case TCPT_REXMT:
182 1.1 cgd if (++tp->t_rxtshift > TCP_MAXRXTSHIFT) {
183 1.1 cgd tp->t_rxtshift = TCP_MAXRXTSHIFT;
184 1.1 cgd tcpstat.tcps_timeoutdrop++;
185 1.1 cgd tp = tcp_drop(tp, tp->t_softerror ?
186 1.1 cgd tp->t_softerror : ETIMEDOUT);
187 1.1 cgd break;
188 1.1 cgd }
189 1.1 cgd tcpstat.tcps_rexmttimeo++;
190 1.1 cgd rexmt = TCP_REXMTVAL(tp) * tcp_backoff[tp->t_rxtshift];
191 1.1 cgd TCPT_RANGESET(tp->t_rxtcur, rexmt,
192 1.1 cgd tp->t_rttmin, TCPTV_REXMTMAX);
193 1.1 cgd tp->t_timer[TCPT_REXMT] = tp->t_rxtcur;
194 1.1 cgd /*
195 1.1 cgd * If losing, let the lower level know and try for
196 1.1 cgd * a better route. Also, if we backed off this far,
197 1.1 cgd * our srtt estimate is probably bogus. Clobber it
198 1.1 cgd * so we'll take the next rtt measurement as our srtt;
199 1.1 cgd * move the current srtt into rttvar to keep the current
200 1.1 cgd * retransmit times until then.
201 1.1 cgd */
202 1.1 cgd if (tp->t_rxtshift > TCP_MAXRXTSHIFT / 4) {
203 1.1 cgd in_losing(tp->t_inpcb);
204 1.1 cgd tp->t_rttvar += (tp->t_srtt >> TCP_RTT_SHIFT);
205 1.1 cgd tp->t_srtt = 0;
206 1.1 cgd }
207 1.1 cgd tp->snd_nxt = tp->snd_una;
208 1.1 cgd /*
209 1.1 cgd * If timing a segment in this window, stop the timer.
210 1.1 cgd */
211 1.1 cgd tp->t_rtt = 0;
212 1.1 cgd /*
213 1.1 cgd * Close the congestion window down to one segment
214 1.1 cgd * (we'll open it by one segment for each ack we get).
215 1.1 cgd * Since we probably have a window's worth of unacked
216 1.1 cgd * data accumulated, this "slow start" keeps us from
217 1.1 cgd * dumping all that data as back-to-back packets (which
218 1.1 cgd * might overwhelm an intermediate gateway).
219 1.1 cgd *
220 1.1 cgd * There are two phases to the opening: Initially we
221 1.1 cgd * open by one mss on each ack. This makes the window
222 1.1 cgd * size increase exponentially with time. If the
223 1.1 cgd * window is larger than the path can handle, this
224 1.1 cgd * exponential growth results in dropped packet(s)
225 1.5 mycroft * almost immediately. To get more time between
226 1.1 cgd * drops but still "push" the network to take advantage
227 1.1 cgd * of improving conditions, we switch from exponential
228 1.1 cgd * to linear window opening at some threshhold size.
229 1.1 cgd * For a threshhold, we use half the current window
230 1.1 cgd * size, truncated to a multiple of the mss.
231 1.1 cgd *
232 1.1 cgd * (the minimum cwnd that will give us exponential
233 1.1 cgd * growth is 2 mss. We don't allow the threshhold
234 1.1 cgd * to go below this.)
235 1.1 cgd */
236 1.1 cgd {
237 1.1 cgd u_int win = min(tp->snd_wnd, tp->snd_cwnd) / 2 / tp->t_maxseg;
238 1.1 cgd if (win < 2)
239 1.1 cgd win = 2;
240 1.1 cgd tp->snd_cwnd = tp->t_maxseg;
241 1.1 cgd tp->snd_ssthresh = win * tp->t_maxseg;
242 1.1 cgd tp->t_dupacks = 0;
243 1.1 cgd }
244 1.1 cgd (void) tcp_output(tp);
245 1.1 cgd break;
246 1.1 cgd
247 1.1 cgd /*
248 1.1 cgd * Persistance timer into zero window.
249 1.1 cgd * Force a byte to be output, if possible.
250 1.1 cgd */
251 1.1 cgd case TCPT_PERSIST:
252 1.1 cgd tcpstat.tcps_persisttimeo++;
253 1.1 cgd tcp_setpersist(tp);
254 1.1 cgd tp->t_force = 1;
255 1.1 cgd (void) tcp_output(tp);
256 1.1 cgd tp->t_force = 0;
257 1.1 cgd break;
258 1.1 cgd
259 1.1 cgd /*
260 1.1 cgd * Keep-alive timer went off; send something
261 1.1 cgd * or drop connection if idle for too long.
262 1.1 cgd */
263 1.1 cgd case TCPT_KEEP:
264 1.1 cgd tcpstat.tcps_keeptimeo++;
265 1.1 cgd if (tp->t_state < TCPS_ESTABLISHED)
266 1.1 cgd goto dropit;
267 1.1 cgd if (tp->t_inpcb->inp_socket->so_options & SO_KEEPALIVE &&
268 1.1 cgd tp->t_state <= TCPS_CLOSE_WAIT) {
269 1.1 cgd if (tp->t_idle >= tcp_keepidle + tcp_maxidle)
270 1.1 cgd goto dropit;
271 1.1 cgd /*
272 1.1 cgd * Send a packet designed to force a response
273 1.1 cgd * if the peer is up and reachable:
274 1.1 cgd * either an ACK if the connection is still alive,
275 1.1 cgd * or an RST if the peer has closed the connection
276 1.1 cgd * due to timeout or reboot.
277 1.1 cgd * Using sequence number tp->snd_una-1
278 1.1 cgd * causes the transmitted zero-length segment
279 1.1 cgd * to lie outside the receive window;
280 1.1 cgd * by the protocol spec, this requires the
281 1.1 cgd * correspondent TCP to respond.
282 1.1 cgd */
283 1.1 cgd tcpstat.tcps_keepprobe++;
284 1.1 cgd #ifdef TCP_COMPAT_42
285 1.1 cgd /*
286 1.1 cgd * The keepalive packet must have nonzero length
287 1.1 cgd * to get a 4.2 host to respond.
288 1.1 cgd */
289 1.1 cgd tcp_respond(tp, tp->t_template, (struct mbuf *)NULL,
290 1.1 cgd tp->rcv_nxt - 1, tp->snd_una - 1, 0);
291 1.1 cgd #else
292 1.1 cgd tcp_respond(tp, tp->t_template, (struct mbuf *)NULL,
293 1.1 cgd tp->rcv_nxt, tp->snd_una - 1, 0);
294 1.1 cgd #endif
295 1.1 cgd tp->t_timer[TCPT_KEEP] = tcp_keepintvl;
296 1.1 cgd } else
297 1.1 cgd tp->t_timer[TCPT_KEEP] = tcp_keepidle;
298 1.1 cgd break;
299 1.1 cgd dropit:
300 1.1 cgd tcpstat.tcps_keepdrops++;
301 1.1 cgd tp = tcp_drop(tp, ETIMEDOUT);
302 1.1 cgd break;
303 1.1 cgd }
304 1.1 cgd return (tp);
305 1.1 cgd }
306