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