2 * INET An implementation of the TCP/IP protocol suite for the LINUX
3 * operating system. INET is implemented using the BSD Socket
4 * interface as the means of communication with the user level.
6 * Implementation of the Transmission Control Protocol(TCP).
8 * Version: $Id: tcp_input.c,v 1.243 2002/02/01 22:01:04 davem Exp $
11 * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
12 * Mark Evans, <evansmp@uhura.aston.ac.uk>
13 * Corey Minyard <wf-rch!minyard@relay.EU.net>
14 * Florian La Roche, <flla@stud.uni-sb.de>
15 * Charles Hedrick, <hedrick@klinzhai.rutgers.edu>
16 * Linus Torvalds, <torvalds@cs.helsinki.fi>
17 * Alan Cox, <gw4pts@gw4pts.ampr.org>
18 * Matthew Dillon, <dillon@apollo.west.oic.com>
19 * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
20 * Jorge Cwik, <jorge@laser.satlink.net>
25 * Pedro Roque : Fast Retransmit/Recovery.
27 * Retransmit queue handled by TCP.
28 * Better retransmit timer handling.
29 * New congestion avoidance.
33 * Eric : Fast Retransmit.
34 * Randy Scott : MSS option defines.
35 * Eric Schenk : Fixes to slow start algorithm.
36 * Eric Schenk : Yet another double ACK bug.
37 * Eric Schenk : Delayed ACK bug fixes.
38 * Eric Schenk : Floyd style fast retrans war avoidance.
39 * David S. Miller : Don't allow zero congestion window.
40 * Eric Schenk : Fix retransmitter so that it sends
41 * next packet on ack of previous packet.
42 * Andi Kleen : Moved open_request checking here
43 * and process RSTs for open_requests.
44 * Andi Kleen : Better prune_queue, and other fixes.
45 * Andrey Savochkin: Fix RTT measurements in the presence of
47 * Andrey Savochkin: Check sequence numbers correctly when
48 * removing SACKs due to in sequence incoming
50 * Andi Kleen: Make sure we never ack data there is not
51 * enough room for. Also make this condition
52 * a fatal error if it might still happen.
53 * Andi Kleen: Add tcp_measure_rcv_mss to make
54 * connections with MSS<min(MTU,ann. MSS)
55 * work without delayed acks.
56 * Andi Kleen: Process packets with PSH set in the
58 * J Hadi Salim: ECN support
61 * Panu Kuhlberg: Experimental audit of TCP (re)transmission
62 * engine. Lots of bugs are found.
63 * Pasi Sarolahti: F-RTO for dealing with spurious RTOs
67 #include <linux/module.h>
68 #include <linux/sysctl.h>
70 #include <net/inet_common.h>
71 #include <linux/ipsec.h>
72 #include <asm/unaligned.h>
73 #include <net/netdma.h>
75 int sysctl_tcp_timestamps __read_mostly = 1;
76 int sysctl_tcp_window_scaling __read_mostly = 1;
77 int sysctl_tcp_sack __read_mostly = 1;
78 int sysctl_tcp_fack __read_mostly = 1;
79 int sysctl_tcp_reordering __read_mostly = TCP_FASTRETRANS_THRESH;
80 int sysctl_tcp_ecn __read_mostly;
81 int sysctl_tcp_dsack __read_mostly = 1;
82 int sysctl_tcp_app_win __read_mostly = 31;
83 int sysctl_tcp_adv_win_scale __read_mostly = 2;
85 int sysctl_tcp_stdurg __read_mostly;
86 int sysctl_tcp_rfc1337 __read_mostly;
87 int sysctl_tcp_max_orphans __read_mostly = NR_FILE;
88 int sysctl_tcp_frto __read_mostly;
89 int sysctl_tcp_frto_response __read_mostly;
90 int sysctl_tcp_nometrics_save __read_mostly;
92 int sysctl_tcp_moderate_rcvbuf __read_mostly = 1;
93 int sysctl_tcp_abc __read_mostly;
95 #define FLAG_DATA 0x01 /* Incoming frame contained data. */
96 #define FLAG_WIN_UPDATE 0x02 /* Incoming ACK was a window update. */
97 #define FLAG_DATA_ACKED 0x04 /* This ACK acknowledged new data. */
98 #define FLAG_RETRANS_DATA_ACKED 0x08 /* "" "" some of which was retransmitted. */
99 #define FLAG_SYN_ACKED 0x10 /* This ACK acknowledged SYN. */
100 #define FLAG_DATA_SACKED 0x20 /* New SACK. */
101 #define FLAG_ECE 0x40 /* ECE in this ACK */
102 #define FLAG_DATA_LOST 0x80 /* SACK detected data lossage. */
103 #define FLAG_SLOWPATH 0x100 /* Do not skip RFC checks for window update.*/
104 #define FLAG_ONLY_ORIG_SACKED 0x200 /* SACKs only non-rexmit sent before RTO */
105 #define FLAG_SND_UNA_ADVANCED 0x400 /* Snd_una was changed (!= FLAG_DATA_ACKED) */
106 #define FLAG_DSACKING_ACK 0x800 /* SACK blocks contained DSACK info */
108 #define FLAG_ACKED (FLAG_DATA_ACKED|FLAG_SYN_ACKED)
109 #define FLAG_NOT_DUP (FLAG_DATA|FLAG_WIN_UPDATE|FLAG_ACKED)
110 #define FLAG_CA_ALERT (FLAG_DATA_SACKED|FLAG_ECE)
111 #define FLAG_FORWARD_PROGRESS (FLAG_ACKED|FLAG_DATA_SACKED)
112 #define FLAG_ANY_PROGRESS (FLAG_FORWARD_PROGRESS|FLAG_SND_UNA_ADVANCED)
114 #define IsReno(tp) ((tp)->rx_opt.sack_ok == 0)
115 #define IsFack(tp) ((tp)->rx_opt.sack_ok & 2)
116 #define IsDSack(tp) ((tp)->rx_opt.sack_ok & 4)
118 #define IsSackFrto() (sysctl_tcp_frto == 0x2)
120 #define TCP_REMNANT (TCP_FLAG_FIN|TCP_FLAG_URG|TCP_FLAG_SYN|TCP_FLAG_PSH)
121 #define TCP_HP_BITS (~(TCP_RESERVED_BITS|TCP_FLAG_PSH))
123 /* Adapt the MSS value used to make delayed ack decision to the
126 static void tcp_measure_rcv_mss(struct sock *sk,
127 const struct sk_buff *skb)
129 struct inet_connection_sock *icsk = inet_csk(sk);
130 const unsigned int lss = icsk->icsk_ack.last_seg_size;
133 icsk->icsk_ack.last_seg_size = 0;
135 /* skb->len may jitter because of SACKs, even if peer
136 * sends good full-sized frames.
138 len = skb_shinfo(skb)->gso_size ?: skb->len;
139 if (len >= icsk->icsk_ack.rcv_mss) {
140 icsk->icsk_ack.rcv_mss = len;
142 /* Otherwise, we make more careful check taking into account,
143 * that SACKs block is variable.
145 * "len" is invariant segment length, including TCP header.
147 len += skb->data - skb_transport_header(skb);
148 if (len >= TCP_MIN_RCVMSS + sizeof(struct tcphdr) ||
149 /* If PSH is not set, packet should be
150 * full sized, provided peer TCP is not badly broken.
151 * This observation (if it is correct 8)) allows
152 * to handle super-low mtu links fairly.
154 (len >= TCP_MIN_MSS + sizeof(struct tcphdr) &&
155 !(tcp_flag_word(tcp_hdr(skb)) & TCP_REMNANT))) {
156 /* Subtract also invariant (if peer is RFC compliant),
157 * tcp header plus fixed timestamp option length.
158 * Resulting "len" is MSS free of SACK jitter.
160 len -= tcp_sk(sk)->tcp_header_len;
161 icsk->icsk_ack.last_seg_size = len;
163 icsk->icsk_ack.rcv_mss = len;
167 if (icsk->icsk_ack.pending & ICSK_ACK_PUSHED)
168 icsk->icsk_ack.pending |= ICSK_ACK_PUSHED2;
169 icsk->icsk_ack.pending |= ICSK_ACK_PUSHED;
173 static void tcp_incr_quickack(struct sock *sk)
175 struct inet_connection_sock *icsk = inet_csk(sk);
176 unsigned quickacks = tcp_sk(sk)->rcv_wnd / (2 * icsk->icsk_ack.rcv_mss);
180 if (quickacks > icsk->icsk_ack.quick)
181 icsk->icsk_ack.quick = min(quickacks, TCP_MAX_QUICKACKS);
184 void tcp_enter_quickack_mode(struct sock *sk)
186 struct inet_connection_sock *icsk = inet_csk(sk);
187 tcp_incr_quickack(sk);
188 icsk->icsk_ack.pingpong = 0;
189 icsk->icsk_ack.ato = TCP_ATO_MIN;
192 /* Send ACKs quickly, if "quick" count is not exhausted
193 * and the session is not interactive.
196 static inline int tcp_in_quickack_mode(const struct sock *sk)
198 const struct inet_connection_sock *icsk = inet_csk(sk);
199 return icsk->icsk_ack.quick && !icsk->icsk_ack.pingpong;
202 static inline void TCP_ECN_queue_cwr(struct tcp_sock *tp)
204 if (tp->ecn_flags&TCP_ECN_OK)
205 tp->ecn_flags |= TCP_ECN_QUEUE_CWR;
208 static inline void TCP_ECN_accept_cwr(struct tcp_sock *tp, struct sk_buff *skb)
210 if (tcp_hdr(skb)->cwr)
211 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR;
214 static inline void TCP_ECN_withdraw_cwr(struct tcp_sock *tp)
216 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR;
219 static inline void TCP_ECN_check_ce(struct tcp_sock *tp, struct sk_buff *skb)
221 if (tp->ecn_flags&TCP_ECN_OK) {
222 if (INET_ECN_is_ce(TCP_SKB_CB(skb)->flags))
223 tp->ecn_flags |= TCP_ECN_DEMAND_CWR;
224 /* Funny extension: if ECT is not set on a segment,
225 * it is surely retransmit. It is not in ECN RFC,
226 * but Linux follows this rule. */
227 else if (INET_ECN_is_not_ect((TCP_SKB_CB(skb)->flags)))
228 tcp_enter_quickack_mode((struct sock *)tp);
232 static inline void TCP_ECN_rcv_synack(struct tcp_sock *tp, struct tcphdr *th)
234 if ((tp->ecn_flags&TCP_ECN_OK) && (!th->ece || th->cwr))
235 tp->ecn_flags &= ~TCP_ECN_OK;
238 static inline void TCP_ECN_rcv_syn(struct tcp_sock *tp, struct tcphdr *th)
240 if ((tp->ecn_flags&TCP_ECN_OK) && (!th->ece || !th->cwr))
241 tp->ecn_flags &= ~TCP_ECN_OK;
244 static inline int TCP_ECN_rcv_ecn_echo(struct tcp_sock *tp, struct tcphdr *th)
246 if (th->ece && !th->syn && (tp->ecn_flags&TCP_ECN_OK))
251 /* Buffer size and advertised window tuning.
253 * 1. Tuning sk->sk_sndbuf, when connection enters established state.
256 static void tcp_fixup_sndbuf(struct sock *sk)
258 int sndmem = tcp_sk(sk)->rx_opt.mss_clamp + MAX_TCP_HEADER + 16 +
259 sizeof(struct sk_buff);
261 if (sk->sk_sndbuf < 3 * sndmem)
262 sk->sk_sndbuf = min(3 * sndmem, sysctl_tcp_wmem[2]);
265 /* 2. Tuning advertised window (window_clamp, rcv_ssthresh)
267 * All tcp_full_space() is split to two parts: "network" buffer, allocated
268 * forward and advertised in receiver window (tp->rcv_wnd) and
269 * "application buffer", required to isolate scheduling/application
270 * latencies from network.
271 * window_clamp is maximal advertised window. It can be less than
272 * tcp_full_space(), in this case tcp_full_space() - window_clamp
273 * is reserved for "application" buffer. The less window_clamp is
274 * the smoother our behaviour from viewpoint of network, but the lower
275 * throughput and the higher sensitivity of the connection to losses. 8)
277 * rcv_ssthresh is more strict window_clamp used at "slow start"
278 * phase to predict further behaviour of this connection.
279 * It is used for two goals:
280 * - to enforce header prediction at sender, even when application
281 * requires some significant "application buffer". It is check #1.
282 * - to prevent pruning of receive queue because of misprediction
283 * of receiver window. Check #2.
285 * The scheme does not work when sender sends good segments opening
286 * window and then starts to feed us spaghetti. But it should work
287 * in common situations. Otherwise, we have to rely on queue collapsing.
290 /* Slow part of check#2. */
291 static int __tcp_grow_window(const struct sock *sk, const struct sk_buff *skb)
293 struct tcp_sock *tp = tcp_sk(sk);
295 int truesize = tcp_win_from_space(skb->truesize)/2;
296 int window = tcp_win_from_space(sysctl_tcp_rmem[2])/2;
298 while (tp->rcv_ssthresh <= window) {
299 if (truesize <= skb->len)
300 return 2 * inet_csk(sk)->icsk_ack.rcv_mss;
308 static void tcp_grow_window(struct sock *sk,
311 struct tcp_sock *tp = tcp_sk(sk);
314 if (tp->rcv_ssthresh < tp->window_clamp &&
315 (int)tp->rcv_ssthresh < tcp_space(sk) &&
316 !tcp_memory_pressure) {
319 /* Check #2. Increase window, if skb with such overhead
320 * will fit to rcvbuf in future.
322 if (tcp_win_from_space(skb->truesize) <= skb->len)
325 incr = __tcp_grow_window(sk, skb);
328 tp->rcv_ssthresh = min(tp->rcv_ssthresh + incr, tp->window_clamp);
329 inet_csk(sk)->icsk_ack.quick |= 1;
334 /* 3. Tuning rcvbuf, when connection enters established state. */
336 static void tcp_fixup_rcvbuf(struct sock *sk)
338 struct tcp_sock *tp = tcp_sk(sk);
339 int rcvmem = tp->advmss + MAX_TCP_HEADER + 16 + sizeof(struct sk_buff);
341 /* Try to select rcvbuf so that 4 mss-sized segments
342 * will fit to window and corresponding skbs will fit to our rcvbuf.
343 * (was 3; 4 is minimum to allow fast retransmit to work.)
345 while (tcp_win_from_space(rcvmem) < tp->advmss)
347 if (sk->sk_rcvbuf < 4 * rcvmem)
348 sk->sk_rcvbuf = min(4 * rcvmem, sysctl_tcp_rmem[2]);
351 /* 4. Try to fixup all. It is made immediately after connection enters
354 static void tcp_init_buffer_space(struct sock *sk)
356 struct tcp_sock *tp = tcp_sk(sk);
359 if (!(sk->sk_userlocks & SOCK_RCVBUF_LOCK))
360 tcp_fixup_rcvbuf(sk);
361 if (!(sk->sk_userlocks & SOCK_SNDBUF_LOCK))
362 tcp_fixup_sndbuf(sk);
364 tp->rcvq_space.space = tp->rcv_wnd;
366 maxwin = tcp_full_space(sk);
368 if (tp->window_clamp >= maxwin) {
369 tp->window_clamp = maxwin;
371 if (sysctl_tcp_app_win && maxwin > 4 * tp->advmss)
372 tp->window_clamp = max(maxwin -
373 (maxwin >> sysctl_tcp_app_win),
377 /* Force reservation of one segment. */
378 if (sysctl_tcp_app_win &&
379 tp->window_clamp > 2 * tp->advmss &&
380 tp->window_clamp + tp->advmss > maxwin)
381 tp->window_clamp = max(2 * tp->advmss, maxwin - tp->advmss);
383 tp->rcv_ssthresh = min(tp->rcv_ssthresh, tp->window_clamp);
384 tp->snd_cwnd_stamp = tcp_time_stamp;
387 /* 5. Recalculate window clamp after socket hit its memory bounds. */
388 static void tcp_clamp_window(struct sock *sk)
390 struct tcp_sock *tp = tcp_sk(sk);
391 struct inet_connection_sock *icsk = inet_csk(sk);
393 icsk->icsk_ack.quick = 0;
395 if (sk->sk_rcvbuf < sysctl_tcp_rmem[2] &&
396 !(sk->sk_userlocks & SOCK_RCVBUF_LOCK) &&
397 !tcp_memory_pressure &&
398 atomic_read(&tcp_memory_allocated) < sysctl_tcp_mem[0]) {
399 sk->sk_rcvbuf = min(atomic_read(&sk->sk_rmem_alloc),
402 if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf)
403 tp->rcv_ssthresh = min(tp->window_clamp, 2U*tp->advmss);
407 /* Initialize RCV_MSS value.
408 * RCV_MSS is an our guess about MSS used by the peer.
409 * We haven't any direct information about the MSS.
410 * It's better to underestimate the RCV_MSS rather than overestimate.
411 * Overestimations make us ACKing less frequently than needed.
412 * Underestimations are more easy to detect and fix by tcp_measure_rcv_mss().
414 void tcp_initialize_rcv_mss(struct sock *sk)
416 struct tcp_sock *tp = tcp_sk(sk);
417 unsigned int hint = min_t(unsigned int, tp->advmss, tp->mss_cache);
419 hint = min(hint, tp->rcv_wnd/2);
420 hint = min(hint, TCP_MIN_RCVMSS);
421 hint = max(hint, TCP_MIN_MSS);
423 inet_csk(sk)->icsk_ack.rcv_mss = hint;
426 /* Receiver "autotuning" code.
428 * The algorithm for RTT estimation w/o timestamps is based on
429 * Dynamic Right-Sizing (DRS) by Wu Feng and Mike Fisk of LANL.
430 * <http://www.lanl.gov/radiant/website/pubs/drs/lacsi2001.ps>
432 * More detail on this code can be found at
433 * <http://www.psc.edu/~jheffner/senior_thesis.ps>,
434 * though this reference is out of date. A new paper
437 static void tcp_rcv_rtt_update(struct tcp_sock *tp, u32 sample, int win_dep)
439 u32 new_sample = tp->rcv_rtt_est.rtt;
445 if (new_sample != 0) {
446 /* If we sample in larger samples in the non-timestamp
447 * case, we could grossly overestimate the RTT especially
448 * with chatty applications or bulk transfer apps which
449 * are stalled on filesystem I/O.
451 * Also, since we are only going for a minimum in the
452 * non-timestamp case, we do not smooth things out
453 * else with timestamps disabled convergence takes too
457 m -= (new_sample >> 3);
459 } else if (m < new_sample)
462 /* No previous measure. */
466 if (tp->rcv_rtt_est.rtt != new_sample)
467 tp->rcv_rtt_est.rtt = new_sample;
470 static inline void tcp_rcv_rtt_measure(struct tcp_sock *tp)
472 if (tp->rcv_rtt_est.time == 0)
474 if (before(tp->rcv_nxt, tp->rcv_rtt_est.seq))
476 tcp_rcv_rtt_update(tp,
477 jiffies - tp->rcv_rtt_est.time,
481 tp->rcv_rtt_est.seq = tp->rcv_nxt + tp->rcv_wnd;
482 tp->rcv_rtt_est.time = tcp_time_stamp;
485 static inline void tcp_rcv_rtt_measure_ts(struct sock *sk, const struct sk_buff *skb)
487 struct tcp_sock *tp = tcp_sk(sk);
488 if (tp->rx_opt.rcv_tsecr &&
489 (TCP_SKB_CB(skb)->end_seq -
490 TCP_SKB_CB(skb)->seq >= inet_csk(sk)->icsk_ack.rcv_mss))
491 tcp_rcv_rtt_update(tp, tcp_time_stamp - tp->rx_opt.rcv_tsecr, 0);
495 * This function should be called every time data is copied to user space.
496 * It calculates the appropriate TCP receive buffer space.
498 void tcp_rcv_space_adjust(struct sock *sk)
500 struct tcp_sock *tp = tcp_sk(sk);
504 if (tp->rcvq_space.time == 0)
507 time = tcp_time_stamp - tp->rcvq_space.time;
508 if (time < (tp->rcv_rtt_est.rtt >> 3) ||
509 tp->rcv_rtt_est.rtt == 0)
512 space = 2 * (tp->copied_seq - tp->rcvq_space.seq);
514 space = max(tp->rcvq_space.space, space);
516 if (tp->rcvq_space.space != space) {
519 tp->rcvq_space.space = space;
521 if (sysctl_tcp_moderate_rcvbuf &&
522 !(sk->sk_userlocks & SOCK_RCVBUF_LOCK)) {
523 int new_clamp = space;
525 /* Receive space grows, normalize in order to
526 * take into account packet headers and sk_buff
527 * structure overhead.
532 rcvmem = (tp->advmss + MAX_TCP_HEADER +
533 16 + sizeof(struct sk_buff));
534 while (tcp_win_from_space(rcvmem) < tp->advmss)
537 space = min(space, sysctl_tcp_rmem[2]);
538 if (space > sk->sk_rcvbuf) {
539 sk->sk_rcvbuf = space;
541 /* Make the window clamp follow along. */
542 tp->window_clamp = new_clamp;
548 tp->rcvq_space.seq = tp->copied_seq;
549 tp->rcvq_space.time = tcp_time_stamp;
552 /* There is something which you must keep in mind when you analyze the
553 * behavior of the tp->ato delayed ack timeout interval. When a
554 * connection starts up, we want to ack as quickly as possible. The
555 * problem is that "good" TCP's do slow start at the beginning of data
556 * transmission. The means that until we send the first few ACK's the
557 * sender will sit on his end and only queue most of his data, because
558 * he can only send snd_cwnd unacked packets at any given time. For
559 * each ACK we send, he increments snd_cwnd and transmits more of his
562 static void tcp_event_data_recv(struct sock *sk, struct sk_buff *skb)
564 struct tcp_sock *tp = tcp_sk(sk);
565 struct inet_connection_sock *icsk = inet_csk(sk);
568 inet_csk_schedule_ack(sk);
570 tcp_measure_rcv_mss(sk, skb);
572 tcp_rcv_rtt_measure(tp);
574 now = tcp_time_stamp;
576 if (!icsk->icsk_ack.ato) {
577 /* The _first_ data packet received, initialize
578 * delayed ACK engine.
580 tcp_incr_quickack(sk);
581 icsk->icsk_ack.ato = TCP_ATO_MIN;
583 int m = now - icsk->icsk_ack.lrcvtime;
585 if (m <= TCP_ATO_MIN/2) {
586 /* The fastest case is the first. */
587 icsk->icsk_ack.ato = (icsk->icsk_ack.ato >> 1) + TCP_ATO_MIN / 2;
588 } else if (m < icsk->icsk_ack.ato) {
589 icsk->icsk_ack.ato = (icsk->icsk_ack.ato >> 1) + m;
590 if (icsk->icsk_ack.ato > icsk->icsk_rto)
591 icsk->icsk_ack.ato = icsk->icsk_rto;
592 } else if (m > icsk->icsk_rto) {
593 /* Too long gap. Apparently sender failed to
594 * restart window, so that we send ACKs quickly.
596 tcp_incr_quickack(sk);
597 sk_stream_mem_reclaim(sk);
600 icsk->icsk_ack.lrcvtime = now;
602 TCP_ECN_check_ce(tp, skb);
605 tcp_grow_window(sk, skb);
608 static u32 tcp_rto_min(struct sock *sk)
610 struct dst_entry *dst = __sk_dst_get(sk);
611 u32 rto_min = TCP_RTO_MIN;
613 if (dst && dst_metric_locked(dst, RTAX_RTO_MIN))
614 rto_min = dst->metrics[RTAX_RTO_MIN-1];
618 /* Called to compute a smoothed rtt estimate. The data fed to this
619 * routine either comes from timestamps, or from segments that were
620 * known _not_ to have been retransmitted [see Karn/Partridge
621 * Proceedings SIGCOMM 87]. The algorithm is from the SIGCOMM 88
622 * piece by Van Jacobson.
623 * NOTE: the next three routines used to be one big routine.
624 * To save cycles in the RFC 1323 implementation it was better to break
625 * it up into three procedures. -- erics
627 static void tcp_rtt_estimator(struct sock *sk, const __u32 mrtt)
629 struct tcp_sock *tp = tcp_sk(sk);
630 long m = mrtt; /* RTT */
632 /* The following amusing code comes from Jacobson's
633 * article in SIGCOMM '88. Note that rtt and mdev
634 * are scaled versions of rtt and mean deviation.
635 * This is designed to be as fast as possible
636 * m stands for "measurement".
638 * On a 1990 paper the rto value is changed to:
639 * RTO = rtt + 4 * mdev
641 * Funny. This algorithm seems to be very broken.
642 * These formulae increase RTO, when it should be decreased, increase
643 * too slowly, when it should be increased quickly, decrease too quickly
644 * etc. I guess in BSD RTO takes ONE value, so that it is absolutely
645 * does not matter how to _calculate_ it. Seems, it was trap
646 * that VJ failed to avoid. 8)
651 m -= (tp->srtt >> 3); /* m is now error in rtt est */
652 tp->srtt += m; /* rtt = 7/8 rtt + 1/8 new */
654 m = -m; /* m is now abs(error) */
655 m -= (tp->mdev >> 2); /* similar update on mdev */
656 /* This is similar to one of Eifel findings.
657 * Eifel blocks mdev updates when rtt decreases.
658 * This solution is a bit different: we use finer gain
659 * for mdev in this case (alpha*beta).
660 * Like Eifel it also prevents growth of rto,
661 * but also it limits too fast rto decreases,
662 * happening in pure Eifel.
667 m -= (tp->mdev >> 2); /* similar update on mdev */
669 tp->mdev += m; /* mdev = 3/4 mdev + 1/4 new */
670 if (tp->mdev > tp->mdev_max) {
671 tp->mdev_max = tp->mdev;
672 if (tp->mdev_max > tp->rttvar)
673 tp->rttvar = tp->mdev_max;
675 if (after(tp->snd_una, tp->rtt_seq)) {
676 if (tp->mdev_max < tp->rttvar)
677 tp->rttvar -= (tp->rttvar-tp->mdev_max)>>2;
678 tp->rtt_seq = tp->snd_nxt;
679 tp->mdev_max = tcp_rto_min(sk);
682 /* no previous measure. */
683 tp->srtt = m<<3; /* take the measured time to be rtt */
684 tp->mdev = m<<1; /* make sure rto = 3*rtt */
685 tp->mdev_max = tp->rttvar = max(tp->mdev, tcp_rto_min(sk));
686 tp->rtt_seq = tp->snd_nxt;
690 /* Calculate rto without backoff. This is the second half of Van Jacobson's
691 * routine referred to above.
693 static inline void tcp_set_rto(struct sock *sk)
695 const struct tcp_sock *tp = tcp_sk(sk);
696 /* Old crap is replaced with new one. 8)
699 * 1. If rtt variance happened to be less 50msec, it is hallucination.
700 * It cannot be less due to utterly erratic ACK generation made
701 * at least by solaris and freebsd. "Erratic ACKs" has _nothing_
702 * to do with delayed acks, because at cwnd>2 true delack timeout
703 * is invisible. Actually, Linux-2.4 also generates erratic
704 * ACKs in some circumstances.
706 inet_csk(sk)->icsk_rto = (tp->srtt >> 3) + tp->rttvar;
708 /* 2. Fixups made earlier cannot be right.
709 * If we do not estimate RTO correctly without them,
710 * all the algo is pure shit and should be replaced
711 * with correct one. It is exactly, which we pretend to do.
715 /* NOTE: clamping at TCP_RTO_MIN is not required, current algo
716 * guarantees that rto is higher.
718 static inline void tcp_bound_rto(struct sock *sk)
720 if (inet_csk(sk)->icsk_rto > TCP_RTO_MAX)
721 inet_csk(sk)->icsk_rto = TCP_RTO_MAX;
724 /* Save metrics learned by this TCP session.
725 This function is called only, when TCP finishes successfully
726 i.e. when it enters TIME-WAIT or goes from LAST-ACK to CLOSE.
728 void tcp_update_metrics(struct sock *sk)
730 struct tcp_sock *tp = tcp_sk(sk);
731 struct dst_entry *dst = __sk_dst_get(sk);
733 if (sysctl_tcp_nometrics_save)
738 if (dst && (dst->flags&DST_HOST)) {
739 const struct inet_connection_sock *icsk = inet_csk(sk);
742 if (icsk->icsk_backoff || !tp->srtt) {
743 /* This session failed to estimate rtt. Why?
744 * Probably, no packets returned in time.
747 if (!(dst_metric_locked(dst, RTAX_RTT)))
748 dst->metrics[RTAX_RTT-1] = 0;
752 m = dst_metric(dst, RTAX_RTT) - tp->srtt;
754 /* If newly calculated rtt larger than stored one,
755 * store new one. Otherwise, use EWMA. Remember,
756 * rtt overestimation is always better than underestimation.
758 if (!(dst_metric_locked(dst, RTAX_RTT))) {
760 dst->metrics[RTAX_RTT-1] = tp->srtt;
762 dst->metrics[RTAX_RTT-1] -= (m>>3);
765 if (!(dst_metric_locked(dst, RTAX_RTTVAR))) {
769 /* Scale deviation to rttvar fixed point */
774 if (m >= dst_metric(dst, RTAX_RTTVAR))
775 dst->metrics[RTAX_RTTVAR-1] = m;
777 dst->metrics[RTAX_RTTVAR-1] -=
778 (dst->metrics[RTAX_RTTVAR-1] - m)>>2;
781 if (tp->snd_ssthresh >= 0xFFFF) {
782 /* Slow start still did not finish. */
783 if (dst_metric(dst, RTAX_SSTHRESH) &&
784 !dst_metric_locked(dst, RTAX_SSTHRESH) &&
785 (tp->snd_cwnd >> 1) > dst_metric(dst, RTAX_SSTHRESH))
786 dst->metrics[RTAX_SSTHRESH-1] = tp->snd_cwnd >> 1;
787 if (!dst_metric_locked(dst, RTAX_CWND) &&
788 tp->snd_cwnd > dst_metric(dst, RTAX_CWND))
789 dst->metrics[RTAX_CWND-1] = tp->snd_cwnd;
790 } else if (tp->snd_cwnd > tp->snd_ssthresh &&
791 icsk->icsk_ca_state == TCP_CA_Open) {
792 /* Cong. avoidance phase, cwnd is reliable. */
793 if (!dst_metric_locked(dst, RTAX_SSTHRESH))
794 dst->metrics[RTAX_SSTHRESH-1] =
795 max(tp->snd_cwnd >> 1, tp->snd_ssthresh);
796 if (!dst_metric_locked(dst, RTAX_CWND))
797 dst->metrics[RTAX_CWND-1] = (dst->metrics[RTAX_CWND-1] + tp->snd_cwnd) >> 1;
799 /* Else slow start did not finish, cwnd is non-sense,
800 ssthresh may be also invalid.
802 if (!dst_metric_locked(dst, RTAX_CWND))
803 dst->metrics[RTAX_CWND-1] = (dst->metrics[RTAX_CWND-1] + tp->snd_ssthresh) >> 1;
804 if (dst->metrics[RTAX_SSTHRESH-1] &&
805 !dst_metric_locked(dst, RTAX_SSTHRESH) &&
806 tp->snd_ssthresh > dst->metrics[RTAX_SSTHRESH-1])
807 dst->metrics[RTAX_SSTHRESH-1] = tp->snd_ssthresh;
810 if (!dst_metric_locked(dst, RTAX_REORDERING)) {
811 if (dst->metrics[RTAX_REORDERING-1] < tp->reordering &&
812 tp->reordering != sysctl_tcp_reordering)
813 dst->metrics[RTAX_REORDERING-1] = tp->reordering;
818 /* Numbers are taken from RFC3390.
820 * John Heffner states:
822 * The RFC specifies a window of no more than 4380 bytes
823 * unless 2*MSS > 4380. Reading the pseudocode in the RFC
824 * is a bit misleading because they use a clamp at 4380 bytes
825 * rather than use a multiplier in the relevant range.
827 __u32 tcp_init_cwnd(struct tcp_sock *tp, struct dst_entry *dst)
829 __u32 cwnd = (dst ? dst_metric(dst, RTAX_INITCWND) : 0);
832 if (tp->mss_cache > 1460)
835 cwnd = (tp->mss_cache > 1095) ? 3 : 4;
837 return min_t(__u32, cwnd, tp->snd_cwnd_clamp);
840 /* Set slow start threshold and cwnd not falling to slow start */
841 void tcp_enter_cwr(struct sock *sk, const int set_ssthresh)
843 struct tcp_sock *tp = tcp_sk(sk);
844 const struct inet_connection_sock *icsk = inet_csk(sk);
846 tp->prior_ssthresh = 0;
848 if (icsk->icsk_ca_state < TCP_CA_CWR) {
851 tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
852 tp->snd_cwnd = min(tp->snd_cwnd,
853 tcp_packets_in_flight(tp) + 1U);
854 tp->snd_cwnd_cnt = 0;
855 tp->high_seq = tp->snd_nxt;
856 tp->snd_cwnd_stamp = tcp_time_stamp;
857 TCP_ECN_queue_cwr(tp);
859 tcp_set_ca_state(sk, TCP_CA_CWR);
863 /* Initialize metrics on socket. */
865 static void tcp_init_metrics(struct sock *sk)
867 struct tcp_sock *tp = tcp_sk(sk);
868 struct dst_entry *dst = __sk_dst_get(sk);
875 if (dst_metric_locked(dst, RTAX_CWND))
876 tp->snd_cwnd_clamp = dst_metric(dst, RTAX_CWND);
877 if (dst_metric(dst, RTAX_SSTHRESH)) {
878 tp->snd_ssthresh = dst_metric(dst, RTAX_SSTHRESH);
879 if (tp->snd_ssthresh > tp->snd_cwnd_clamp)
880 tp->snd_ssthresh = tp->snd_cwnd_clamp;
882 if (dst_metric(dst, RTAX_REORDERING) &&
883 tp->reordering != dst_metric(dst, RTAX_REORDERING)) {
884 tp->rx_opt.sack_ok &= ~2;
885 tp->reordering = dst_metric(dst, RTAX_REORDERING);
888 if (dst_metric(dst, RTAX_RTT) == 0)
891 if (!tp->srtt && dst_metric(dst, RTAX_RTT) < (TCP_TIMEOUT_INIT << 3))
894 /* Initial rtt is determined from SYN,SYN-ACK.
895 * The segment is small and rtt may appear much
896 * less than real one. Use per-dst memory
897 * to make it more realistic.
899 * A bit of theory. RTT is time passed after "normal" sized packet
900 * is sent until it is ACKed. In normal circumstances sending small
901 * packets force peer to delay ACKs and calculation is correct too.
902 * The algorithm is adaptive and, provided we follow specs, it
903 * NEVER underestimate RTT. BUT! If peer tries to make some clever
904 * tricks sort of "quick acks" for time long enough to decrease RTT
905 * to low value, and then abruptly stops to do it and starts to delay
906 * ACKs, wait for troubles.
908 if (dst_metric(dst, RTAX_RTT) > tp->srtt) {
909 tp->srtt = dst_metric(dst, RTAX_RTT);
910 tp->rtt_seq = tp->snd_nxt;
912 if (dst_metric(dst, RTAX_RTTVAR) > tp->mdev) {
913 tp->mdev = dst_metric(dst, RTAX_RTTVAR);
914 tp->mdev_max = tp->rttvar = max(tp->mdev, TCP_RTO_MIN);
918 if (inet_csk(sk)->icsk_rto < TCP_TIMEOUT_INIT && !tp->rx_opt.saw_tstamp)
920 tp->snd_cwnd = tcp_init_cwnd(tp, dst);
921 tp->snd_cwnd_stamp = tcp_time_stamp;
925 /* Play conservative. If timestamps are not
926 * supported, TCP will fail to recalculate correct
927 * rtt, if initial rto is too small. FORGET ALL AND RESET!
929 if (!tp->rx_opt.saw_tstamp && tp->srtt) {
931 tp->mdev = tp->mdev_max = tp->rttvar = TCP_TIMEOUT_INIT;
932 inet_csk(sk)->icsk_rto = TCP_TIMEOUT_INIT;
936 static void tcp_update_reordering(struct sock *sk, const int metric,
939 struct tcp_sock *tp = tcp_sk(sk);
940 if (metric > tp->reordering) {
941 tp->reordering = min(TCP_MAX_REORDERING, metric);
943 /* This exciting event is worth to be remembered. 8) */
945 NET_INC_STATS_BH(LINUX_MIB_TCPTSREORDER);
947 NET_INC_STATS_BH(LINUX_MIB_TCPRENOREORDER);
949 NET_INC_STATS_BH(LINUX_MIB_TCPFACKREORDER);
951 NET_INC_STATS_BH(LINUX_MIB_TCPSACKREORDER);
952 #if FASTRETRANS_DEBUG > 1
953 printk(KERN_DEBUG "Disorder%d %d %u f%u s%u rr%d\n",
954 tp->rx_opt.sack_ok, inet_csk(sk)->icsk_ca_state,
958 tp->undo_marker ? tp->undo_retrans : 0);
960 /* Disable FACK yet. */
961 tp->rx_opt.sack_ok &= ~2;
965 /* This procedure tags the retransmission queue when SACKs arrive.
967 * We have three tag bits: SACKED(S), RETRANS(R) and LOST(L).
968 * Packets in queue with these bits set are counted in variables
969 * sacked_out, retrans_out and lost_out, correspondingly.
971 * Valid combinations are:
972 * Tag InFlight Description
973 * 0 1 - orig segment is in flight.
974 * S 0 - nothing flies, orig reached receiver.
975 * L 0 - nothing flies, orig lost by net.
976 * R 2 - both orig and retransmit are in flight.
977 * L|R 1 - orig is lost, retransmit is in flight.
978 * S|R 1 - orig reached receiver, retrans is still in flight.
979 * (L|S|R is logically valid, it could occur when L|R is sacked,
980 * but it is equivalent to plain S and code short-curcuits it to S.
981 * L|S is logically invalid, it would mean -1 packet in flight 8))
983 * These 6 states form finite state machine, controlled by the following events:
984 * 1. New ACK (+SACK) arrives. (tcp_sacktag_write_queue())
985 * 2. Retransmission. (tcp_retransmit_skb(), tcp_xmit_retransmit_queue())
986 * 3. Loss detection event of one of three flavors:
987 * A. Scoreboard estimator decided the packet is lost.
988 * A'. Reno "three dupacks" marks head of queue lost.
989 * A''. Its FACK modfication, head until snd.fack is lost.
990 * B. SACK arrives sacking data transmitted after never retransmitted
992 * C. SACK arrives sacking SND.NXT at the moment, when the
993 * segment was retransmitted.
994 * 4. D-SACK added new rule: D-SACK changes any tag to S.
996 * It is pleasant to note, that state diagram turns out to be commutative,
997 * so that we are allowed not to be bothered by order of our actions,
998 * when multiple events arrive simultaneously. (see the function below).
1000 * Reordering detection.
1001 * --------------------
1002 * Reordering metric is maximal distance, which a packet can be displaced
1003 * in packet stream. With SACKs we can estimate it:
1005 * 1. SACK fills old hole and the corresponding segment was not
1006 * ever retransmitted -> reordering. Alas, we cannot use it
1007 * when segment was retransmitted.
1008 * 2. The last flaw is solved with D-SACK. D-SACK arrives
1009 * for retransmitted and already SACKed segment -> reordering..
1010 * Both of these heuristics are not used in Loss state, when we cannot
1011 * account for retransmits accurately.
1013 static int tcp_check_dsack(struct tcp_sock *tp, struct sk_buff *ack_skb,
1014 struct tcp_sack_block_wire *sp, int num_sacks,
1017 u32 start_seq_0 = ntohl(get_unaligned(&sp[0].start_seq));
1018 u32 end_seq_0 = ntohl(get_unaligned(&sp[0].end_seq));
1021 if (before(start_seq_0, TCP_SKB_CB(ack_skb)->ack_seq)) {
1023 tp->rx_opt.sack_ok |= 4;
1024 NET_INC_STATS_BH(LINUX_MIB_TCPDSACKRECV);
1025 } else if (num_sacks > 1) {
1026 u32 end_seq_1 = ntohl(get_unaligned(&sp[1].end_seq));
1027 u32 start_seq_1 = ntohl(get_unaligned(&sp[1].start_seq));
1029 if (!after(end_seq_0, end_seq_1) &&
1030 !before(start_seq_0, start_seq_1)) {
1032 tp->rx_opt.sack_ok |= 4;
1033 NET_INC_STATS_BH(LINUX_MIB_TCPDSACKOFORECV);
1037 /* D-SACK for already forgotten data... Do dumb counting. */
1039 !after(end_seq_0, prior_snd_una) &&
1040 after(end_seq_0, tp->undo_marker))
1047 tcp_sacktag_write_queue(struct sock *sk, struct sk_buff *ack_skb, u32 prior_snd_una)
1049 const struct inet_connection_sock *icsk = inet_csk(sk);
1050 struct tcp_sock *tp = tcp_sk(sk);
1051 unsigned char *ptr = (skb_transport_header(ack_skb) +
1052 TCP_SKB_CB(ack_skb)->sacked);
1053 struct tcp_sack_block_wire *sp = (struct tcp_sack_block_wire *)(ptr+2);
1054 struct sk_buff *cached_skb;
1055 int num_sacks = (ptr[1] - TCPOLEN_SACK_BASE)>>3;
1056 int reord = tp->packets_out;
1058 u32 lost_retrans = 0;
1060 int found_dup_sack = 0;
1061 int cached_fack_count;
1063 int first_sack_index;
1065 if (!tp->sacked_out) {
1066 tp->fackets_out = 0;
1067 tp->highest_sack = tp->snd_una;
1069 prior_fackets = tp->fackets_out;
1071 found_dup_sack = tcp_check_dsack(tp, ack_skb, sp,
1072 num_sacks, prior_snd_una);
1074 flag |= FLAG_DSACKING_ACK;
1076 /* Eliminate too old ACKs, but take into
1077 * account more or less fresh ones, they can
1078 * contain valid SACK info.
1080 if (before(TCP_SKB_CB(ack_skb)->ack_seq, prior_snd_una - tp->max_window))
1084 * if the only SACK change is the increase of the end_seq of
1085 * the first block then only apply that SACK block
1086 * and use retrans queue hinting otherwise slowpath */
1088 for (i = 0; i < num_sacks; i++) {
1089 __be32 start_seq = sp[i].start_seq;
1090 __be32 end_seq = sp[i].end_seq;
1093 if (tp->recv_sack_cache[i].start_seq != start_seq)
1096 if ((tp->recv_sack_cache[i].start_seq != start_seq) ||
1097 (tp->recv_sack_cache[i].end_seq != end_seq))
1100 tp->recv_sack_cache[i].start_seq = start_seq;
1101 tp->recv_sack_cache[i].end_seq = end_seq;
1103 /* Clear the rest of the cache sack blocks so they won't match mistakenly. */
1104 for (; i < ARRAY_SIZE(tp->recv_sack_cache); i++) {
1105 tp->recv_sack_cache[i].start_seq = 0;
1106 tp->recv_sack_cache[i].end_seq = 0;
1109 first_sack_index = 0;
1114 tp->fastpath_skb_hint = NULL;
1116 /* order SACK blocks to allow in order walk of the retrans queue */
1117 for (i = num_sacks-1; i > 0; i--) {
1118 for (j = 0; j < i; j++){
1119 if (after(ntohl(sp[j].start_seq),
1120 ntohl(sp[j+1].start_seq))){
1121 struct tcp_sack_block_wire tmp;
1127 /* Track where the first SACK block goes to */
1128 if (j == first_sack_index)
1129 first_sack_index = j+1;
1136 /* clear flag as used for different purpose in following code */
1139 /* Use SACK fastpath hint if valid */
1140 cached_skb = tp->fastpath_skb_hint;
1141 cached_fack_count = tp->fastpath_cnt_hint;
1143 cached_skb = tcp_write_queue_head(sk);
1144 cached_fack_count = 0;
1147 for (i=0; i<num_sacks; i++, sp++) {
1148 struct sk_buff *skb;
1149 __u32 start_seq = ntohl(sp->start_seq);
1150 __u32 end_seq = ntohl(sp->end_seq);
1152 int dup_sack = (found_dup_sack && (i == first_sack_index));
1155 fack_count = cached_fack_count;
1157 /* Event "B" in the comment above. */
1158 if (after(end_seq, tp->high_seq))
1159 flag |= FLAG_DATA_LOST;
1161 tcp_for_write_queue_from(skb, sk) {
1162 int in_sack, pcount;
1165 if (skb == tcp_send_head(sk))
1169 cached_fack_count = fack_count;
1170 if (i == first_sack_index) {
1171 tp->fastpath_skb_hint = skb;
1172 tp->fastpath_cnt_hint = fack_count;
1175 /* The retransmission queue is always in order, so
1176 * we can short-circuit the walk early.
1178 if (!before(TCP_SKB_CB(skb)->seq, end_seq))
1181 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq) &&
1182 !before(end_seq, TCP_SKB_CB(skb)->end_seq);
1184 pcount = tcp_skb_pcount(skb);
1186 if (pcount > 1 && !in_sack &&
1187 after(TCP_SKB_CB(skb)->end_seq, start_seq)) {
1188 unsigned int pkt_len;
1190 in_sack = !after(start_seq,
1191 TCP_SKB_CB(skb)->seq);
1194 pkt_len = (start_seq -
1195 TCP_SKB_CB(skb)->seq);
1197 pkt_len = (end_seq -
1198 TCP_SKB_CB(skb)->seq);
1199 if (tcp_fragment(sk, skb, pkt_len, skb_shinfo(skb)->gso_size))
1201 pcount = tcp_skb_pcount(skb);
1204 fack_count += pcount;
1206 sacked = TCP_SKB_CB(skb)->sacked;
1208 /* Account D-SACK for retransmitted packet. */
1209 if ((dup_sack && in_sack) &&
1210 (sacked & TCPCB_RETRANS) &&
1211 after(TCP_SKB_CB(skb)->end_seq, tp->undo_marker))
1214 /* The frame is ACKed. */
1215 if (!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una)) {
1216 if (sacked&TCPCB_RETRANS) {
1217 if ((dup_sack && in_sack) &&
1218 (sacked&TCPCB_SACKED_ACKED))
1219 reord = min(fack_count, reord);
1221 /* If it was in a hole, we detected reordering. */
1222 if (fack_count < prior_fackets &&
1223 !(sacked&TCPCB_SACKED_ACKED))
1224 reord = min(fack_count, reord);
1227 /* Nothing to do; acked frame is about to be dropped. */
1231 if ((sacked&TCPCB_SACKED_RETRANS) &&
1232 after(end_seq, TCP_SKB_CB(skb)->ack_seq) &&
1233 (!lost_retrans || after(end_seq, lost_retrans)))
1234 lost_retrans = end_seq;
1239 if (!(sacked&TCPCB_SACKED_ACKED)) {
1240 if (sacked & TCPCB_SACKED_RETRANS) {
1241 /* If the segment is not tagged as lost,
1242 * we do not clear RETRANS, believing
1243 * that retransmission is still in flight.
1245 if (sacked & TCPCB_LOST) {
1246 TCP_SKB_CB(skb)->sacked &= ~(TCPCB_LOST|TCPCB_SACKED_RETRANS);
1247 tp->lost_out -= tcp_skb_pcount(skb);
1248 tp->retrans_out -= tcp_skb_pcount(skb);
1250 /* clear lost hint */
1251 tp->retransmit_skb_hint = NULL;
1254 /* New sack for not retransmitted frame,
1255 * which was in hole. It is reordering.
1257 if (!(sacked & TCPCB_RETRANS) &&
1258 fack_count < prior_fackets)
1259 reord = min(fack_count, reord);
1261 if (sacked & TCPCB_LOST) {
1262 TCP_SKB_CB(skb)->sacked &= ~TCPCB_LOST;
1263 tp->lost_out -= tcp_skb_pcount(skb);
1265 /* clear lost hint */
1266 tp->retransmit_skb_hint = NULL;
1268 /* SACK enhanced F-RTO detection.
1269 * Set flag if and only if non-rexmitted
1270 * segments below frto_highmark are
1271 * SACKed (RFC4138; Appendix B).
1272 * Clearing correct due to in-order walk
1274 if (after(end_seq, tp->frto_highmark)) {
1275 flag &= ~FLAG_ONLY_ORIG_SACKED;
1277 if (!(sacked & TCPCB_RETRANS))
1278 flag |= FLAG_ONLY_ORIG_SACKED;
1282 TCP_SKB_CB(skb)->sacked |= TCPCB_SACKED_ACKED;
1283 flag |= FLAG_DATA_SACKED;
1284 tp->sacked_out += tcp_skb_pcount(skb);
1286 if (fack_count > tp->fackets_out)
1287 tp->fackets_out = fack_count;
1289 if (after(TCP_SKB_CB(skb)->seq,
1291 tp->highest_sack = TCP_SKB_CB(skb)->seq;
1293 if (dup_sack && (sacked&TCPCB_RETRANS))
1294 reord = min(fack_count, reord);
1297 /* D-SACK. We can detect redundant retransmission
1298 * in S|R and plain R frames and clear it.
1299 * undo_retrans is decreased above, L|R frames
1300 * are accounted above as well.
1303 (TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_RETRANS)) {
1304 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1305 tp->retrans_out -= tcp_skb_pcount(skb);
1306 tp->retransmit_skb_hint = NULL;
1311 /* Check for lost retransmit. This superb idea is
1312 * borrowed from "ratehalving". Event "C".
1313 * Later note: FACK people cheated me again 8),
1314 * we have to account for reordering! Ugly,
1317 if (lost_retrans && icsk->icsk_ca_state == TCP_CA_Recovery) {
1318 struct sk_buff *skb;
1320 tcp_for_write_queue(skb, sk) {
1321 if (skb == tcp_send_head(sk))
1323 if (after(TCP_SKB_CB(skb)->seq, lost_retrans))
1325 if (!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
1327 if ((TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_RETRANS) &&
1328 after(lost_retrans, TCP_SKB_CB(skb)->ack_seq) &&
1330 !before(lost_retrans,
1331 TCP_SKB_CB(skb)->ack_seq + tp->reordering *
1333 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1334 tp->retrans_out -= tcp_skb_pcount(skb);
1336 /* clear lost hint */
1337 tp->retransmit_skb_hint = NULL;
1339 if (!(TCP_SKB_CB(skb)->sacked&(TCPCB_LOST|TCPCB_SACKED_ACKED))) {
1340 tp->lost_out += tcp_skb_pcount(skb);
1341 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1342 flag |= FLAG_DATA_SACKED;
1343 NET_INC_STATS_BH(LINUX_MIB_TCPLOSTRETRANSMIT);
1349 tcp_verify_left_out(tp);
1351 if ((reord < tp->fackets_out) && icsk->icsk_ca_state != TCP_CA_Loss &&
1352 (!tp->frto_highmark || after(tp->snd_una, tp->frto_highmark)))
1353 tcp_update_reordering(sk, ((tp->fackets_out + 1) - reord), 0);
1355 #if FASTRETRANS_DEBUG > 0
1356 BUG_TRAP((int)tp->sacked_out >= 0);
1357 BUG_TRAP((int)tp->lost_out >= 0);
1358 BUG_TRAP((int)tp->retrans_out >= 0);
1359 BUG_TRAP((int)tcp_packets_in_flight(tp) >= 0);
1364 /* F-RTO can only be used if TCP has never retransmitted anything other than
1365 * head (SACK enhanced variant from Appendix B of RFC4138 is more robust here)
1367 static void tcp_check_reno_reordering(struct sock *sk, const int addend)
1369 struct tcp_sock *tp = tcp_sk(sk);
1372 holes = max(tp->lost_out, 1U);
1373 holes = min(holes, tp->packets_out);
1375 if ((tp->sacked_out + holes) > tp->packets_out) {
1376 tp->sacked_out = tp->packets_out - holes;
1377 tcp_update_reordering(sk, tp->packets_out + addend, 0);
1381 /* Emulate SACKs for SACKless connection: account for a new dupack. */
1383 static void tcp_add_reno_sack(struct sock *sk)
1385 struct tcp_sock *tp = tcp_sk(sk);
1387 tcp_check_reno_reordering(sk, 0);
1388 tcp_verify_left_out(tp);
1391 /* Account for ACK, ACKing some data in Reno Recovery phase. */
1393 static void tcp_remove_reno_sacks(struct sock *sk, int acked)
1395 struct tcp_sock *tp = tcp_sk(sk);
1398 /* One ACK acked hole. The rest eat duplicate ACKs. */
1399 if (acked-1 >= tp->sacked_out)
1402 tp->sacked_out -= acked-1;
1404 tcp_check_reno_reordering(sk, acked);
1405 tcp_verify_left_out(tp);
1408 static inline void tcp_reset_reno_sack(struct tcp_sock *tp)
1413 int tcp_use_frto(struct sock *sk)
1415 const struct tcp_sock *tp = tcp_sk(sk);
1416 struct sk_buff *skb;
1418 if (!sysctl_tcp_frto)
1424 /* Avoid expensive walking of rexmit queue if possible */
1425 if (tp->retrans_out > 1)
1428 skb = tcp_write_queue_head(sk);
1429 skb = tcp_write_queue_next(sk, skb); /* Skips head */
1430 tcp_for_write_queue_from(skb, sk) {
1431 if (skb == tcp_send_head(sk))
1433 if (TCP_SKB_CB(skb)->sacked&TCPCB_RETRANS)
1435 /* Short-circuit when first non-SACKed skb has been checked */
1436 if (!(TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_ACKED))
1442 /* RTO occurred, but do not yet enter Loss state. Instead, defer RTO
1443 * recovery a bit and use heuristics in tcp_process_frto() to detect if
1444 * the RTO was spurious. Only clear SACKED_RETRANS of the head here to
1445 * keep retrans_out counting accurate (with SACK F-RTO, other than head
1446 * may still have that bit set); TCPCB_LOST and remaining SACKED_RETRANS
1447 * bits are handled if the Loss state is really to be entered (in
1448 * tcp_enter_frto_loss).
1450 * Do like tcp_enter_loss() would; when RTO expires the second time it
1452 * "Reduce ssthresh if it has not yet been made inside this window."
1454 void tcp_enter_frto(struct sock *sk)
1456 const struct inet_connection_sock *icsk = inet_csk(sk);
1457 struct tcp_sock *tp = tcp_sk(sk);
1458 struct sk_buff *skb;
1460 if ((!tp->frto_counter && icsk->icsk_ca_state <= TCP_CA_Disorder) ||
1461 tp->snd_una == tp->high_seq ||
1462 ((icsk->icsk_ca_state == TCP_CA_Loss || tp->frto_counter) &&
1463 !icsk->icsk_retransmits)) {
1464 tp->prior_ssthresh = tcp_current_ssthresh(sk);
1465 /* Our state is too optimistic in ssthresh() call because cwnd
1466 * is not reduced until tcp_enter_frto_loss() when previous FRTO
1467 * recovery has not yet completed. Pattern would be this: RTO,
1468 * Cumulative ACK, RTO (2xRTO for the same segment does not end
1470 * RFC4138 should be more specific on what to do, even though
1471 * RTO is quite unlikely to occur after the first Cumulative ACK
1472 * due to back-off and complexity of triggering events ...
1474 if (tp->frto_counter) {
1476 stored_cwnd = tp->snd_cwnd;
1478 tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
1479 tp->snd_cwnd = stored_cwnd;
1481 tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
1483 /* ... in theory, cong.control module could do "any tricks" in
1484 * ssthresh(), which means that ca_state, lost bits and lost_out
1485 * counter would have to be faked before the call occurs. We
1486 * consider that too expensive, unlikely and hacky, so modules
1487 * using these in ssthresh() must deal these incompatibility
1488 * issues if they receives CA_EVENT_FRTO and frto_counter != 0
1490 tcp_ca_event(sk, CA_EVENT_FRTO);
1493 tp->undo_marker = tp->snd_una;
1494 tp->undo_retrans = 0;
1496 skb = tcp_write_queue_head(sk);
1497 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) {
1498 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1499 tp->retrans_out -= tcp_skb_pcount(skb);
1501 tcp_verify_left_out(tp);
1503 /* Earlier loss recovery underway (see RFC4138; Appendix B).
1504 * The last condition is necessary at least in tp->frto_counter case.
1506 if (IsSackFrto() && (tp->frto_counter ||
1507 ((1 << icsk->icsk_ca_state) & (TCPF_CA_Recovery|TCPF_CA_Loss))) &&
1508 after(tp->high_seq, tp->snd_una)) {
1509 tp->frto_highmark = tp->high_seq;
1511 tp->frto_highmark = tp->snd_nxt;
1513 tcp_set_ca_state(sk, TCP_CA_Disorder);
1514 tp->high_seq = tp->snd_nxt;
1515 tp->frto_counter = 1;
1518 /* Enter Loss state after F-RTO was applied. Dupack arrived after RTO,
1519 * which indicates that we should follow the traditional RTO recovery,
1520 * i.e. mark everything lost and do go-back-N retransmission.
1522 static void tcp_enter_frto_loss(struct sock *sk, int allowed_segments, int flag)
1524 struct tcp_sock *tp = tcp_sk(sk);
1525 struct sk_buff *skb;
1528 tp->retrans_out = 0;
1530 tcp_reset_reno_sack(tp);
1532 tcp_for_write_queue(skb, sk) {
1533 if (skb == tcp_send_head(sk))
1536 * Count the retransmission made on RTO correctly (only when
1537 * waiting for the first ACK and did not get it)...
1539 if ((tp->frto_counter == 1) && !(flag&FLAG_DATA_ACKED)) {
1540 /* For some reason this R-bit might get cleared? */
1541 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS)
1542 tp->retrans_out += tcp_skb_pcount(skb);
1543 /* ...enter this if branch just for the first segment */
1544 flag |= FLAG_DATA_ACKED;
1546 TCP_SKB_CB(skb)->sacked &= ~(TCPCB_LOST|TCPCB_SACKED_RETRANS);
1549 /* Don't lost mark skbs that were fwd transmitted after RTO */
1550 if (!(TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_ACKED) &&
1551 !after(TCP_SKB_CB(skb)->end_seq, tp->frto_highmark)) {
1552 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1553 tp->lost_out += tcp_skb_pcount(skb);
1556 tcp_verify_left_out(tp);
1558 tp->snd_cwnd = tcp_packets_in_flight(tp) + allowed_segments;
1559 tp->snd_cwnd_cnt = 0;
1560 tp->snd_cwnd_stamp = tcp_time_stamp;
1561 tp->undo_marker = 0;
1562 tp->frto_counter = 0;
1564 tp->reordering = min_t(unsigned int, tp->reordering,
1565 sysctl_tcp_reordering);
1566 tcp_set_ca_state(sk, TCP_CA_Loss);
1567 tp->high_seq = tp->frto_highmark;
1568 TCP_ECN_queue_cwr(tp);
1570 clear_all_retrans_hints(tp);
1573 void tcp_clear_retrans(struct tcp_sock *tp)
1575 tp->retrans_out = 0;
1577 tp->fackets_out = 0;
1581 tp->undo_marker = 0;
1582 tp->undo_retrans = 0;
1585 /* Enter Loss state. If "how" is not zero, forget all SACK information
1586 * and reset tags completely, otherwise preserve SACKs. If receiver
1587 * dropped its ofo queue, we will know this due to reneging detection.
1589 void tcp_enter_loss(struct sock *sk, int how)
1591 const struct inet_connection_sock *icsk = inet_csk(sk);
1592 struct tcp_sock *tp = tcp_sk(sk);
1593 struct sk_buff *skb;
1596 /* Reduce ssthresh if it has not yet been made inside this window. */
1597 if (icsk->icsk_ca_state <= TCP_CA_Disorder || tp->snd_una == tp->high_seq ||
1598 (icsk->icsk_ca_state == TCP_CA_Loss && !icsk->icsk_retransmits)) {
1599 tp->prior_ssthresh = tcp_current_ssthresh(sk);
1600 tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
1601 tcp_ca_event(sk, CA_EVENT_LOSS);
1604 tp->snd_cwnd_cnt = 0;
1605 tp->snd_cwnd_stamp = tcp_time_stamp;
1607 tp->bytes_acked = 0;
1608 tcp_clear_retrans(tp);
1610 /* Push undo marker, if it was plain RTO and nothing
1611 * was retransmitted. */
1613 tp->undo_marker = tp->snd_una;
1615 tcp_for_write_queue(skb, sk) {
1616 if (skb == tcp_send_head(sk))
1618 cnt += tcp_skb_pcount(skb);
1619 if (TCP_SKB_CB(skb)->sacked&TCPCB_RETRANS)
1620 tp->undo_marker = 0;
1621 TCP_SKB_CB(skb)->sacked &= (~TCPCB_TAGBITS)|TCPCB_SACKED_ACKED;
1622 if (!(TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_ACKED) || how) {
1623 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_ACKED;
1624 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1625 tp->lost_out += tcp_skb_pcount(skb);
1627 tp->sacked_out += tcp_skb_pcount(skb);
1628 tp->fackets_out = cnt;
1631 tcp_verify_left_out(tp);
1633 tp->reordering = min_t(unsigned int, tp->reordering,
1634 sysctl_tcp_reordering);
1635 tcp_set_ca_state(sk, TCP_CA_Loss);
1636 tp->high_seq = tp->snd_nxt;
1637 TCP_ECN_queue_cwr(tp);
1638 /* Abort FRTO algorithm if one is in progress */
1639 tp->frto_counter = 0;
1641 clear_all_retrans_hints(tp);
1644 static int tcp_check_sack_reneging(struct sock *sk)
1646 struct sk_buff *skb;
1648 /* If ACK arrived pointing to a remembered SACK,
1649 * it means that our remembered SACKs do not reflect
1650 * real state of receiver i.e.
1651 * receiver _host_ is heavily congested (or buggy).
1652 * Do processing similar to RTO timeout.
1654 if ((skb = tcp_write_queue_head(sk)) != NULL &&
1655 (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)) {
1656 struct inet_connection_sock *icsk = inet_csk(sk);
1657 NET_INC_STATS_BH(LINUX_MIB_TCPSACKRENEGING);
1659 tcp_enter_loss(sk, 1);
1660 icsk->icsk_retransmits++;
1661 tcp_retransmit_skb(sk, tcp_write_queue_head(sk));
1662 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
1663 icsk->icsk_rto, TCP_RTO_MAX);
1669 static inline int tcp_fackets_out(struct tcp_sock *tp)
1671 return IsReno(tp) ? tp->sacked_out+1 : tp->fackets_out;
1674 static inline int tcp_skb_timedout(struct sock *sk, struct sk_buff *skb)
1676 return (tcp_time_stamp - TCP_SKB_CB(skb)->when > inet_csk(sk)->icsk_rto);
1679 static inline int tcp_head_timedout(struct sock *sk)
1681 struct tcp_sock *tp = tcp_sk(sk);
1683 return tp->packets_out &&
1684 tcp_skb_timedout(sk, tcp_write_queue_head(sk));
1687 /* Linux NewReno/SACK/FACK/ECN state machine.
1688 * --------------------------------------
1690 * "Open" Normal state, no dubious events, fast path.
1691 * "Disorder" In all the respects it is "Open",
1692 * but requires a bit more attention. It is entered when
1693 * we see some SACKs or dupacks. It is split of "Open"
1694 * mainly to move some processing from fast path to slow one.
1695 * "CWR" CWND was reduced due to some Congestion Notification event.
1696 * It can be ECN, ICMP source quench, local device congestion.
1697 * "Recovery" CWND was reduced, we are fast-retransmitting.
1698 * "Loss" CWND was reduced due to RTO timeout or SACK reneging.
1700 * tcp_fastretrans_alert() is entered:
1701 * - each incoming ACK, if state is not "Open"
1702 * - when arrived ACK is unusual, namely:
1707 * Counting packets in flight is pretty simple.
1709 * in_flight = packets_out - left_out + retrans_out
1711 * packets_out is SND.NXT-SND.UNA counted in packets.
1713 * retrans_out is number of retransmitted segments.
1715 * left_out is number of segments left network, but not ACKed yet.
1717 * left_out = sacked_out + lost_out
1719 * sacked_out: Packets, which arrived to receiver out of order
1720 * and hence not ACKed. With SACKs this number is simply
1721 * amount of SACKed data. Even without SACKs
1722 * it is easy to give pretty reliable estimate of this number,
1723 * counting duplicate ACKs.
1725 * lost_out: Packets lost by network. TCP has no explicit
1726 * "loss notification" feedback from network (for now).
1727 * It means that this number can be only _guessed_.
1728 * Actually, it is the heuristics to predict lossage that
1729 * distinguishes different algorithms.
1731 * F.e. after RTO, when all the queue is considered as lost,
1732 * lost_out = packets_out and in_flight = retrans_out.
1734 * Essentially, we have now two algorithms counting
1737 * FACK: It is the simplest heuristics. As soon as we decided
1738 * that something is lost, we decide that _all_ not SACKed
1739 * packets until the most forward SACK are lost. I.e.
1740 * lost_out = fackets_out - sacked_out and left_out = fackets_out.
1741 * It is absolutely correct estimate, if network does not reorder
1742 * packets. And it loses any connection to reality when reordering
1743 * takes place. We use FACK by default until reordering
1744 * is suspected on the path to this destination.
1746 * NewReno: when Recovery is entered, we assume that one segment
1747 * is lost (classic Reno). While we are in Recovery and
1748 * a partial ACK arrives, we assume that one more packet
1749 * is lost (NewReno). This heuristics are the same in NewReno
1752 * Imagine, that's all! Forget about all this shamanism about CWND inflation
1753 * deflation etc. CWND is real congestion window, never inflated, changes
1754 * only according to classic VJ rules.
1756 * Really tricky (and requiring careful tuning) part of algorithm
1757 * is hidden in functions tcp_time_to_recover() and tcp_xmit_retransmit_queue().
1758 * The first determines the moment _when_ we should reduce CWND and,
1759 * hence, slow down forward transmission. In fact, it determines the moment
1760 * when we decide that hole is caused by loss, rather than by a reorder.
1762 * tcp_xmit_retransmit_queue() decides, _what_ we should retransmit to fill
1763 * holes, caused by lost packets.
1765 * And the most logically complicated part of algorithm is undo
1766 * heuristics. We detect false retransmits due to both too early
1767 * fast retransmit (reordering) and underestimated RTO, analyzing
1768 * timestamps and D-SACKs. When we detect that some segments were
1769 * retransmitted by mistake and CWND reduction was wrong, we undo
1770 * window reduction and abort recovery phase. This logic is hidden
1771 * inside several functions named tcp_try_undo_<something>.
1774 /* This function decides, when we should leave Disordered state
1775 * and enter Recovery phase, reducing congestion window.
1777 * Main question: may we further continue forward transmission
1778 * with the same cwnd?
1780 static int tcp_time_to_recover(struct sock *sk)
1782 struct tcp_sock *tp = tcp_sk(sk);
1785 /* Do not perform any recovery during FRTO algorithm */
1786 if (tp->frto_counter)
1789 /* Trick#1: The loss is proven. */
1793 /* Not-A-Trick#2 : Classic rule... */
1794 if (tcp_fackets_out(tp) > tp->reordering)
1797 /* Trick#3 : when we use RFC2988 timer restart, fast
1798 * retransmit can be triggered by timeout of queue head.
1800 if (tcp_head_timedout(sk))
1803 /* Trick#4: It is still not OK... But will it be useful to delay
1806 packets_out = tp->packets_out;
1807 if (packets_out <= tp->reordering &&
1808 tp->sacked_out >= max_t(__u32, packets_out/2, sysctl_tcp_reordering) &&
1809 !tcp_may_send_now(sk)) {
1810 /* We have nothing to send. This connection is limited
1811 * either by receiver window or by application.
1819 /* RFC: This is from the original, I doubt that this is necessary at all:
1820 * clear xmit_retrans hint if seq of this skb is beyond hint. How could we
1821 * retransmitted past LOST markings in the first place? I'm not fully sure
1822 * about undo and end of connection cases, which can cause R without L?
1824 static void tcp_verify_retransmit_hint(struct tcp_sock *tp,
1825 struct sk_buff *skb)
1827 if ((tp->retransmit_skb_hint != NULL) &&
1828 before(TCP_SKB_CB(skb)->seq,
1829 TCP_SKB_CB(tp->retransmit_skb_hint)->seq))
1830 tp->retransmit_skb_hint = NULL;
1833 /* Mark head of queue up as lost. */
1834 static void tcp_mark_head_lost(struct sock *sk,
1835 int packets, u32 high_seq)
1837 struct tcp_sock *tp = tcp_sk(sk);
1838 struct sk_buff *skb;
1841 BUG_TRAP(packets <= tp->packets_out);
1842 if (tp->lost_skb_hint) {
1843 skb = tp->lost_skb_hint;
1844 cnt = tp->lost_cnt_hint;
1846 skb = tcp_write_queue_head(sk);
1850 tcp_for_write_queue_from(skb, sk) {
1851 if (skb == tcp_send_head(sk))
1853 /* TODO: do this better */
1854 /* this is not the most efficient way to do this... */
1855 tp->lost_skb_hint = skb;
1856 tp->lost_cnt_hint = cnt;
1857 cnt += tcp_skb_pcount(skb);
1858 if (cnt > packets || after(TCP_SKB_CB(skb)->end_seq, high_seq))
1860 if (!(TCP_SKB_CB(skb)->sacked&TCPCB_TAGBITS)) {
1861 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1862 tp->lost_out += tcp_skb_pcount(skb);
1863 tcp_verify_retransmit_hint(tp, skb);
1866 tcp_verify_left_out(tp);
1869 /* Account newly detected lost packet(s) */
1871 static void tcp_update_scoreboard(struct sock *sk)
1873 struct tcp_sock *tp = tcp_sk(sk);
1876 int lost = tp->fackets_out - tp->reordering;
1879 tcp_mark_head_lost(sk, lost, tp->high_seq);
1881 tcp_mark_head_lost(sk, 1, tp->high_seq);
1884 /* New heuristics: it is possible only after we switched
1885 * to restart timer each time when something is ACKed.
1886 * Hence, we can detect timed out packets during fast
1887 * retransmit without falling to slow start.
1889 if (!IsReno(tp) && tcp_head_timedout(sk)) {
1890 struct sk_buff *skb;
1892 skb = tp->scoreboard_skb_hint ? tp->scoreboard_skb_hint
1893 : tcp_write_queue_head(sk);
1895 tcp_for_write_queue_from(skb, sk) {
1896 if (skb == tcp_send_head(sk))
1898 if (!tcp_skb_timedout(sk, skb))
1901 if (!(TCP_SKB_CB(skb)->sacked&TCPCB_TAGBITS)) {
1902 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1903 tp->lost_out += tcp_skb_pcount(skb);
1904 tcp_verify_retransmit_hint(tp, skb);
1908 tp->scoreboard_skb_hint = skb;
1910 tcp_verify_left_out(tp);
1914 /* CWND moderation, preventing bursts due to too big ACKs
1915 * in dubious situations.
1917 static inline void tcp_moderate_cwnd(struct tcp_sock *tp)
1919 tp->snd_cwnd = min(tp->snd_cwnd,
1920 tcp_packets_in_flight(tp)+tcp_max_burst(tp));
1921 tp->snd_cwnd_stamp = tcp_time_stamp;
1924 /* Lower bound on congestion window is slow start threshold
1925 * unless congestion avoidance choice decides to overide it.
1927 static inline u32 tcp_cwnd_min(const struct sock *sk)
1929 const struct tcp_congestion_ops *ca_ops = inet_csk(sk)->icsk_ca_ops;
1931 return ca_ops->min_cwnd ? ca_ops->min_cwnd(sk) : tcp_sk(sk)->snd_ssthresh;
1934 /* Decrease cwnd each second ack. */
1935 static void tcp_cwnd_down(struct sock *sk, int flag)
1937 struct tcp_sock *tp = tcp_sk(sk);
1938 int decr = tp->snd_cwnd_cnt + 1;
1940 if ((flag&(FLAG_ANY_PROGRESS|FLAG_DSACKING_ACK)) ||
1941 (IsReno(tp) && !(flag&FLAG_NOT_DUP))) {
1942 tp->snd_cwnd_cnt = decr&1;
1945 if (decr && tp->snd_cwnd > tcp_cwnd_min(sk))
1946 tp->snd_cwnd -= decr;
1948 tp->snd_cwnd = min(tp->snd_cwnd, tcp_packets_in_flight(tp)+1);
1949 tp->snd_cwnd_stamp = tcp_time_stamp;
1953 /* Nothing was retransmitted or returned timestamp is less
1954 * than timestamp of the first retransmission.
1956 static inline int tcp_packet_delayed(struct tcp_sock *tp)
1958 return !tp->retrans_stamp ||
1959 (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
1960 (__s32)(tp->rx_opt.rcv_tsecr - tp->retrans_stamp) < 0);
1963 /* Undo procedures. */
1965 #if FASTRETRANS_DEBUG > 1
1966 static void DBGUNDO(struct sock *sk, const char *msg)
1968 struct tcp_sock *tp = tcp_sk(sk);
1969 struct inet_sock *inet = inet_sk(sk);
1971 printk(KERN_DEBUG "Undo %s %u.%u.%u.%u/%u c%u l%u ss%u/%u p%u\n",
1973 NIPQUAD(inet->daddr), ntohs(inet->dport),
1974 tp->snd_cwnd, tcp_left_out(tp),
1975 tp->snd_ssthresh, tp->prior_ssthresh,
1979 #define DBGUNDO(x...) do { } while (0)
1982 static void tcp_undo_cwr(struct sock *sk, const int undo)
1984 struct tcp_sock *tp = tcp_sk(sk);
1986 if (tp->prior_ssthresh) {
1987 const struct inet_connection_sock *icsk = inet_csk(sk);
1989 if (icsk->icsk_ca_ops->undo_cwnd)
1990 tp->snd_cwnd = icsk->icsk_ca_ops->undo_cwnd(sk);
1992 tp->snd_cwnd = max(tp->snd_cwnd, tp->snd_ssthresh<<1);
1994 if (undo && tp->prior_ssthresh > tp->snd_ssthresh) {
1995 tp->snd_ssthresh = tp->prior_ssthresh;
1996 TCP_ECN_withdraw_cwr(tp);
1999 tp->snd_cwnd = max(tp->snd_cwnd, tp->snd_ssthresh);
2001 tcp_moderate_cwnd(tp);
2002 tp->snd_cwnd_stamp = tcp_time_stamp;
2004 /* There is something screwy going on with the retrans hints after
2006 clear_all_retrans_hints(tp);
2009 static inline int tcp_may_undo(struct tcp_sock *tp)
2011 return tp->undo_marker &&
2012 (!tp->undo_retrans || tcp_packet_delayed(tp));
2015 /* People celebrate: "We love our President!" */
2016 static int tcp_try_undo_recovery(struct sock *sk)
2018 struct tcp_sock *tp = tcp_sk(sk);
2020 if (tcp_may_undo(tp)) {
2021 /* Happy end! We did not retransmit anything
2022 * or our original transmission succeeded.
2024 DBGUNDO(sk, inet_csk(sk)->icsk_ca_state == TCP_CA_Loss ? "loss" : "retrans");
2025 tcp_undo_cwr(sk, 1);
2026 if (inet_csk(sk)->icsk_ca_state == TCP_CA_Loss)
2027 NET_INC_STATS_BH(LINUX_MIB_TCPLOSSUNDO);
2029 NET_INC_STATS_BH(LINUX_MIB_TCPFULLUNDO);
2030 tp->undo_marker = 0;
2032 if (tp->snd_una == tp->high_seq && IsReno(tp)) {
2033 /* Hold old state until something *above* high_seq
2034 * is ACKed. For Reno it is MUST to prevent false
2035 * fast retransmits (RFC2582). SACK TCP is safe. */
2036 tcp_moderate_cwnd(tp);
2039 tcp_set_ca_state(sk, TCP_CA_Open);
2043 /* Try to undo cwnd reduction, because D-SACKs acked all retransmitted data */
2044 static void tcp_try_undo_dsack(struct sock *sk)
2046 struct tcp_sock *tp = tcp_sk(sk);
2048 if (tp->undo_marker && !tp->undo_retrans) {
2049 DBGUNDO(sk, "D-SACK");
2050 tcp_undo_cwr(sk, 1);
2051 tp->undo_marker = 0;
2052 NET_INC_STATS_BH(LINUX_MIB_TCPDSACKUNDO);
2056 /* Undo during fast recovery after partial ACK. */
2058 static int tcp_try_undo_partial(struct sock *sk, int acked)
2060 struct tcp_sock *tp = tcp_sk(sk);
2061 /* Partial ACK arrived. Force Hoe's retransmit. */
2062 int failed = IsReno(tp) || tp->fackets_out>tp->reordering;
2064 if (tcp_may_undo(tp)) {
2065 /* Plain luck! Hole if filled with delayed
2066 * packet, rather than with a retransmit.
2068 if (tp->retrans_out == 0)
2069 tp->retrans_stamp = 0;
2071 tcp_update_reordering(sk, tcp_fackets_out(tp) + acked, 1);
2074 tcp_undo_cwr(sk, 0);
2075 NET_INC_STATS_BH(LINUX_MIB_TCPPARTIALUNDO);
2077 /* So... Do not make Hoe's retransmit yet.
2078 * If the first packet was delayed, the rest
2079 * ones are most probably delayed as well.
2086 /* Undo during loss recovery after partial ACK. */
2087 static int tcp_try_undo_loss(struct sock *sk)
2089 struct tcp_sock *tp = tcp_sk(sk);
2091 if (tcp_may_undo(tp)) {
2092 struct sk_buff *skb;
2093 tcp_for_write_queue(skb, sk) {
2094 if (skb == tcp_send_head(sk))
2096 TCP_SKB_CB(skb)->sacked &= ~TCPCB_LOST;
2099 clear_all_retrans_hints(tp);
2101 DBGUNDO(sk, "partial loss");
2103 tcp_undo_cwr(sk, 1);
2104 NET_INC_STATS_BH(LINUX_MIB_TCPLOSSUNDO);
2105 inet_csk(sk)->icsk_retransmits = 0;
2106 tp->undo_marker = 0;
2108 tcp_set_ca_state(sk, TCP_CA_Open);
2114 static inline void tcp_complete_cwr(struct sock *sk)
2116 struct tcp_sock *tp = tcp_sk(sk);
2117 tp->snd_cwnd = min(tp->snd_cwnd, tp->snd_ssthresh);
2118 tp->snd_cwnd_stamp = tcp_time_stamp;
2119 tcp_ca_event(sk, CA_EVENT_COMPLETE_CWR);
2122 static void tcp_try_to_open(struct sock *sk, int flag)
2124 struct tcp_sock *tp = tcp_sk(sk);
2126 tcp_verify_left_out(tp);
2128 if (tp->retrans_out == 0)
2129 tp->retrans_stamp = 0;
2132 tcp_enter_cwr(sk, 1);
2134 if (inet_csk(sk)->icsk_ca_state != TCP_CA_CWR) {
2135 int state = TCP_CA_Open;
2137 if (tp->sacked_out || tp->retrans_out || tp->undo_marker)
2138 state = TCP_CA_Disorder;
2140 if (inet_csk(sk)->icsk_ca_state != state) {
2141 tcp_set_ca_state(sk, state);
2142 tp->high_seq = tp->snd_nxt;
2144 tcp_moderate_cwnd(tp);
2146 tcp_cwnd_down(sk, flag);
2150 static void tcp_mtup_probe_failed(struct sock *sk)
2152 struct inet_connection_sock *icsk = inet_csk(sk);
2154 icsk->icsk_mtup.search_high = icsk->icsk_mtup.probe_size - 1;
2155 icsk->icsk_mtup.probe_size = 0;
2158 static void tcp_mtup_probe_success(struct sock *sk, struct sk_buff *skb)
2160 struct tcp_sock *tp = tcp_sk(sk);
2161 struct inet_connection_sock *icsk = inet_csk(sk);
2163 /* FIXME: breaks with very large cwnd */
2164 tp->prior_ssthresh = tcp_current_ssthresh(sk);
2165 tp->snd_cwnd = tp->snd_cwnd *
2166 tcp_mss_to_mtu(sk, tp->mss_cache) /
2167 icsk->icsk_mtup.probe_size;
2168 tp->snd_cwnd_cnt = 0;
2169 tp->snd_cwnd_stamp = tcp_time_stamp;
2170 tp->rcv_ssthresh = tcp_current_ssthresh(sk);
2172 icsk->icsk_mtup.search_low = icsk->icsk_mtup.probe_size;
2173 icsk->icsk_mtup.probe_size = 0;
2174 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
2178 /* Process an event, which can update packets-in-flight not trivially.
2179 * Main goal of this function is to calculate new estimate for left_out,
2180 * taking into account both packets sitting in receiver's buffer and
2181 * packets lost by network.
2183 * Besides that it does CWND reduction, when packet loss is detected
2184 * and changes state of machine.
2186 * It does _not_ decide what to send, it is made in function
2187 * tcp_xmit_retransmit_queue().
2190 tcp_fastretrans_alert(struct sock *sk, int prior_packets, int flag)
2192 struct inet_connection_sock *icsk = inet_csk(sk);
2193 struct tcp_sock *tp = tcp_sk(sk);
2194 int is_dupack = !(flag&(FLAG_SND_UNA_ADVANCED|FLAG_NOT_DUP));
2195 int do_lost = is_dupack || ((flag&FLAG_DATA_SACKED) &&
2196 (tp->fackets_out > tp->reordering));
2198 /* Some technical things:
2199 * 1. Reno does not count dupacks (sacked_out) automatically. */
2200 if (!tp->packets_out)
2202 /* 2. SACK counts snd_fack in packets inaccurately. */
2203 if (tp->sacked_out == 0)
2204 tp->fackets_out = 0;
2206 /* Now state machine starts.
2207 * A. ECE, hence prohibit cwnd undoing, the reduction is required. */
2209 tp->prior_ssthresh = 0;
2211 /* B. In all the states check for reneging SACKs. */
2212 if (tp->sacked_out && tcp_check_sack_reneging(sk))
2215 /* C. Process data loss notification, provided it is valid. */
2216 if ((flag&FLAG_DATA_LOST) &&
2217 before(tp->snd_una, tp->high_seq) &&
2218 icsk->icsk_ca_state != TCP_CA_Open &&
2219 tp->fackets_out > tp->reordering) {
2220 tcp_mark_head_lost(sk, tp->fackets_out-tp->reordering, tp->high_seq);
2221 NET_INC_STATS_BH(LINUX_MIB_TCPLOSS);
2224 /* D. Check consistency of the current state. */
2225 tcp_verify_left_out(tp);
2227 /* E. Check state exit conditions. State can be terminated
2228 * when high_seq is ACKed. */
2229 if (icsk->icsk_ca_state == TCP_CA_Open) {
2230 BUG_TRAP(tp->retrans_out == 0);
2231 tp->retrans_stamp = 0;
2232 } else if (!before(tp->snd_una, tp->high_seq)) {
2233 switch (icsk->icsk_ca_state) {
2235 icsk->icsk_retransmits = 0;
2236 if (tcp_try_undo_recovery(sk))
2241 /* CWR is to be held something *above* high_seq
2242 * is ACKed for CWR bit to reach receiver. */
2243 if (tp->snd_una != tp->high_seq) {
2244 tcp_complete_cwr(sk);
2245 tcp_set_ca_state(sk, TCP_CA_Open);
2249 case TCP_CA_Disorder:
2250 tcp_try_undo_dsack(sk);
2251 if (!tp->undo_marker ||
2252 /* For SACK case do not Open to allow to undo
2253 * catching for all duplicate ACKs. */
2254 IsReno(tp) || tp->snd_una != tp->high_seq) {
2255 tp->undo_marker = 0;
2256 tcp_set_ca_state(sk, TCP_CA_Open);
2260 case TCP_CA_Recovery:
2262 tcp_reset_reno_sack(tp);
2263 if (tcp_try_undo_recovery(sk))
2265 tcp_complete_cwr(sk);
2270 /* F. Process state. */
2271 switch (icsk->icsk_ca_state) {
2272 case TCP_CA_Recovery:
2273 if (!(flag & FLAG_SND_UNA_ADVANCED)) {
2274 if (IsReno(tp) && is_dupack)
2275 tcp_add_reno_sack(sk);
2277 int acked = prior_packets - tp->packets_out;
2279 tcp_remove_reno_sacks(sk, acked);
2280 do_lost = tcp_try_undo_partial(sk, acked);
2284 if (flag&FLAG_DATA_ACKED)
2285 icsk->icsk_retransmits = 0;
2286 if (!tcp_try_undo_loss(sk)) {
2287 tcp_moderate_cwnd(tp);
2288 tcp_xmit_retransmit_queue(sk);
2291 if (icsk->icsk_ca_state != TCP_CA_Open)
2293 /* Loss is undone; fall through to processing in Open state. */
2296 if (flag & FLAG_SND_UNA_ADVANCED)
2297 tcp_reset_reno_sack(tp);
2299 tcp_add_reno_sack(sk);
2302 if (icsk->icsk_ca_state == TCP_CA_Disorder)
2303 tcp_try_undo_dsack(sk);
2305 if (!tcp_time_to_recover(sk)) {
2306 tcp_try_to_open(sk, flag);
2310 /* MTU probe failure: don't reduce cwnd */
2311 if (icsk->icsk_ca_state < TCP_CA_CWR &&
2312 icsk->icsk_mtup.probe_size &&
2313 tp->snd_una == tp->mtu_probe.probe_seq_start) {
2314 tcp_mtup_probe_failed(sk);
2315 /* Restores the reduction we did in tcp_mtup_probe() */
2317 tcp_simple_retransmit(sk);
2321 /* Otherwise enter Recovery state */
2324 NET_INC_STATS_BH(LINUX_MIB_TCPRENORECOVERY);
2326 NET_INC_STATS_BH(LINUX_MIB_TCPSACKRECOVERY);
2328 tp->high_seq = tp->snd_nxt;
2329 tp->prior_ssthresh = 0;
2330 tp->undo_marker = tp->snd_una;
2331 tp->undo_retrans = tp->retrans_out;
2333 if (icsk->icsk_ca_state < TCP_CA_CWR) {
2334 if (!(flag&FLAG_ECE))
2335 tp->prior_ssthresh = tcp_current_ssthresh(sk);
2336 tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
2337 TCP_ECN_queue_cwr(tp);
2340 tp->bytes_acked = 0;
2341 tp->snd_cwnd_cnt = 0;
2342 tcp_set_ca_state(sk, TCP_CA_Recovery);
2345 if (do_lost || tcp_head_timedout(sk))
2346 tcp_update_scoreboard(sk);
2347 tcp_cwnd_down(sk, flag);
2348 tcp_xmit_retransmit_queue(sk);
2351 /* Read draft-ietf-tcplw-high-performance before mucking
2352 * with this code. (Supersedes RFC1323)
2354 static void tcp_ack_saw_tstamp(struct sock *sk, int flag)
2356 /* RTTM Rule: A TSecr value received in a segment is used to
2357 * update the averaged RTT measurement only if the segment
2358 * acknowledges some new data, i.e., only if it advances the
2359 * left edge of the send window.
2361 * See draft-ietf-tcplw-high-performance-00, section 3.3.
2362 * 1998/04/10 Andrey V. Savochkin <saw@msu.ru>
2364 * Changed: reset backoff as soon as we see the first valid sample.
2365 * If we do not, we get strongly overestimated rto. With timestamps
2366 * samples are accepted even from very old segments: f.e., when rtt=1
2367 * increases to 8, we retransmit 5 times and after 8 seconds delayed
2368 * answer arrives rto becomes 120 seconds! If at least one of segments
2369 * in window is lost... Voila. --ANK (010210)
2371 struct tcp_sock *tp = tcp_sk(sk);
2372 const __u32 seq_rtt = tcp_time_stamp - tp->rx_opt.rcv_tsecr;
2373 tcp_rtt_estimator(sk, seq_rtt);
2375 inet_csk(sk)->icsk_backoff = 0;
2379 static void tcp_ack_no_tstamp(struct sock *sk, u32 seq_rtt, int flag)
2381 /* We don't have a timestamp. Can only use
2382 * packets that are not retransmitted to determine
2383 * rtt estimates. Also, we must not reset the
2384 * backoff for rto until we get a non-retransmitted
2385 * packet. This allows us to deal with a situation
2386 * where the network delay has increased suddenly.
2387 * I.e. Karn's algorithm. (SIGCOMM '87, p5.)
2390 if (flag & FLAG_RETRANS_DATA_ACKED)
2393 tcp_rtt_estimator(sk, seq_rtt);
2395 inet_csk(sk)->icsk_backoff = 0;
2399 static inline void tcp_ack_update_rtt(struct sock *sk, const int flag,
2402 const struct tcp_sock *tp = tcp_sk(sk);
2403 /* Note that peer MAY send zero echo. In this case it is ignored. (rfc1323) */
2404 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr)
2405 tcp_ack_saw_tstamp(sk, flag);
2406 else if (seq_rtt >= 0)
2407 tcp_ack_no_tstamp(sk, seq_rtt, flag);
2410 static void tcp_cong_avoid(struct sock *sk, u32 ack,
2411 u32 in_flight, int good)
2413 const struct inet_connection_sock *icsk = inet_csk(sk);
2414 icsk->icsk_ca_ops->cong_avoid(sk, ack, in_flight, good);
2415 tcp_sk(sk)->snd_cwnd_stamp = tcp_time_stamp;
2418 /* Restart timer after forward progress on connection.
2419 * RFC2988 recommends to restart timer to now+rto.
2422 static void tcp_ack_packets_out(struct sock *sk)
2424 struct tcp_sock *tp = tcp_sk(sk);
2426 if (!tp->packets_out) {
2427 inet_csk_clear_xmit_timer(sk, ICSK_TIME_RETRANS);
2429 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, inet_csk(sk)->icsk_rto, TCP_RTO_MAX);
2433 static int tcp_tso_acked(struct sock *sk, struct sk_buff *skb,
2434 __u32 now, __s32 *seq_rtt)
2436 struct tcp_sock *tp = tcp_sk(sk);
2437 struct tcp_skb_cb *scb = TCP_SKB_CB(skb);
2438 __u32 seq = tp->snd_una;
2439 __u32 packets_acked;
2442 /* If we get here, the whole TSO packet has not been
2445 BUG_ON(!after(scb->end_seq, seq));
2447 packets_acked = tcp_skb_pcount(skb);
2448 if (tcp_trim_head(sk, skb, seq - scb->seq))
2450 packets_acked -= tcp_skb_pcount(skb);
2452 if (packets_acked) {
2453 __u8 sacked = scb->sacked;
2455 acked |= FLAG_DATA_ACKED;
2457 if (sacked & TCPCB_RETRANS) {
2458 if (sacked & TCPCB_SACKED_RETRANS)
2459 tp->retrans_out -= packets_acked;
2460 acked |= FLAG_RETRANS_DATA_ACKED;
2462 } else if (*seq_rtt < 0)
2463 *seq_rtt = now - scb->when;
2464 if (sacked & TCPCB_SACKED_ACKED)
2465 tp->sacked_out -= packets_acked;
2466 if (sacked & TCPCB_LOST)
2467 tp->lost_out -= packets_acked;
2468 if (sacked & TCPCB_URG) {
2470 !before(seq, tp->snd_up))
2473 } else if (*seq_rtt < 0)
2474 *seq_rtt = now - scb->when;
2476 if (tp->fackets_out) {
2477 __u32 dval = min(tp->fackets_out, packets_acked);
2478 tp->fackets_out -= dval;
2480 /* hint's skb might be NULL but we don't need to care */
2481 tp->fastpath_cnt_hint -= min_t(u32, packets_acked,
2482 tp->fastpath_cnt_hint);
2483 tp->packets_out -= packets_acked;
2485 BUG_ON(tcp_skb_pcount(skb) == 0);
2486 BUG_ON(!before(scb->seq, scb->end_seq));
2492 /* Remove acknowledged frames from the retransmission queue. */
2493 static int tcp_clean_rtx_queue(struct sock *sk, __s32 *seq_rtt_p)
2495 struct tcp_sock *tp = tcp_sk(sk);
2496 const struct inet_connection_sock *icsk = inet_csk(sk);
2497 struct sk_buff *skb;
2498 __u32 now = tcp_time_stamp;
2500 int prior_packets = tp->packets_out;
2502 ktime_t last_ackt = net_invalid_timestamp();
2504 while ((skb = tcp_write_queue_head(sk)) &&
2505 skb != tcp_send_head(sk)) {
2506 struct tcp_skb_cb *scb = TCP_SKB_CB(skb);
2507 __u8 sacked = scb->sacked;
2509 /* If our packet is before the ack sequence we can
2510 * discard it as it's confirmed to have arrived at
2513 if (after(scb->end_seq, tp->snd_una)) {
2514 if (tcp_skb_pcount(skb) > 1 &&
2515 after(tp->snd_una, scb->seq))
2516 acked |= tcp_tso_acked(sk, skb,
2521 /* Initial outgoing SYN's get put onto the write_queue
2522 * just like anything else we transmit. It is not
2523 * true data, and if we misinform our callers that
2524 * this ACK acks real data, we will erroneously exit
2525 * connection startup slow start one packet too
2526 * quickly. This is severely frowned upon behavior.
2528 if (!(scb->flags & TCPCB_FLAG_SYN)) {
2529 acked |= FLAG_DATA_ACKED;
2531 acked |= FLAG_SYN_ACKED;
2532 tp->retrans_stamp = 0;
2535 /* MTU probing checks */
2536 if (icsk->icsk_mtup.probe_size) {
2537 if (!after(tp->mtu_probe.probe_seq_end, TCP_SKB_CB(skb)->end_seq)) {
2538 tcp_mtup_probe_success(sk, skb);
2543 if (sacked & TCPCB_RETRANS) {
2544 if (sacked & TCPCB_SACKED_RETRANS)
2545 tp->retrans_out -= tcp_skb_pcount(skb);
2546 acked |= FLAG_RETRANS_DATA_ACKED;
2548 } else if (seq_rtt < 0) {
2549 seq_rtt = now - scb->when;
2550 last_ackt = skb->tstamp;
2552 if (sacked & TCPCB_SACKED_ACKED)
2553 tp->sacked_out -= tcp_skb_pcount(skb);
2554 if (sacked & TCPCB_LOST)
2555 tp->lost_out -= tcp_skb_pcount(skb);
2556 if (sacked & TCPCB_URG) {
2558 !before(scb->end_seq, tp->snd_up))
2561 } else if (seq_rtt < 0) {
2562 seq_rtt = now - scb->when;
2563 last_ackt = skb->tstamp;
2565 tcp_dec_pcount_approx(&tp->fackets_out, skb);
2566 tcp_packets_out_dec(tp, skb);
2567 tcp_unlink_write_queue(skb, sk);
2568 sk_stream_free_skb(sk, skb);
2569 clear_all_retrans_hints(tp);
2572 if (acked&FLAG_ACKED) {
2573 u32 pkts_acked = prior_packets - tp->packets_out;
2574 const struct tcp_congestion_ops *ca_ops
2575 = inet_csk(sk)->icsk_ca_ops;
2577 tcp_ack_update_rtt(sk, acked, seq_rtt);
2578 tcp_ack_packets_out(sk);
2580 if (ca_ops->pkts_acked) {
2583 /* Is the ACK triggering packet unambiguous? */
2584 if (!(acked & FLAG_RETRANS_DATA_ACKED)) {
2585 /* High resolution needed and available? */
2586 if (ca_ops->flags & TCP_CONG_RTT_STAMP &&
2587 !ktime_equal(last_ackt,
2588 net_invalid_timestamp()))
2589 rtt_us = ktime_us_delta(ktime_get_real(),
2591 else if (seq_rtt > 0)
2592 rtt_us = jiffies_to_usecs(seq_rtt);
2595 ca_ops->pkts_acked(sk, pkts_acked, rtt_us);
2599 #if FASTRETRANS_DEBUG > 0
2600 BUG_TRAP((int)tp->sacked_out >= 0);
2601 BUG_TRAP((int)tp->lost_out >= 0);
2602 BUG_TRAP((int)tp->retrans_out >= 0);
2603 if (!tp->packets_out && tp->rx_opt.sack_ok) {
2604 const struct inet_connection_sock *icsk = inet_csk(sk);
2606 printk(KERN_DEBUG "Leak l=%u %d\n",
2607 tp->lost_out, icsk->icsk_ca_state);
2610 if (tp->sacked_out) {
2611 printk(KERN_DEBUG "Leak s=%u %d\n",
2612 tp->sacked_out, icsk->icsk_ca_state);
2615 if (tp->retrans_out) {
2616 printk(KERN_DEBUG "Leak r=%u %d\n",
2617 tp->retrans_out, icsk->icsk_ca_state);
2618 tp->retrans_out = 0;
2622 *seq_rtt_p = seq_rtt;
2626 static void tcp_ack_probe(struct sock *sk)
2628 const struct tcp_sock *tp = tcp_sk(sk);
2629 struct inet_connection_sock *icsk = inet_csk(sk);
2631 /* Was it a usable window open? */
2633 if (!after(TCP_SKB_CB(tcp_send_head(sk))->end_seq,
2634 tp->snd_una + tp->snd_wnd)) {
2635 icsk->icsk_backoff = 0;
2636 inet_csk_clear_xmit_timer(sk, ICSK_TIME_PROBE0);
2637 /* Socket must be waked up by subsequent tcp_data_snd_check().
2638 * This function is not for random using!
2641 inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
2642 min(icsk->icsk_rto << icsk->icsk_backoff, TCP_RTO_MAX),
2647 static inline int tcp_ack_is_dubious(const struct sock *sk, const int flag)
2649 return (!(flag & FLAG_NOT_DUP) || (flag & FLAG_CA_ALERT) ||
2650 inet_csk(sk)->icsk_ca_state != TCP_CA_Open);
2653 static inline int tcp_may_raise_cwnd(const struct sock *sk, const int flag)
2655 const struct tcp_sock *tp = tcp_sk(sk);
2656 return (!(flag & FLAG_ECE) || tp->snd_cwnd < tp->snd_ssthresh) &&
2657 !((1 << inet_csk(sk)->icsk_ca_state) & (TCPF_CA_Recovery | TCPF_CA_CWR));
2660 /* Check that window update is acceptable.
2661 * The function assumes that snd_una<=ack<=snd_next.
2663 static inline int tcp_may_update_window(const struct tcp_sock *tp, const u32 ack,
2664 const u32 ack_seq, const u32 nwin)
2666 return (after(ack, tp->snd_una) ||
2667 after(ack_seq, tp->snd_wl1) ||
2668 (ack_seq == tp->snd_wl1 && nwin > tp->snd_wnd));
2671 /* Update our send window.
2673 * Window update algorithm, described in RFC793/RFC1122 (used in linux-2.2
2674 * and in FreeBSD. NetBSD's one is even worse.) is wrong.
2676 static int tcp_ack_update_window(struct sock *sk, struct sk_buff *skb, u32 ack,
2679 struct tcp_sock *tp = tcp_sk(sk);
2681 u32 nwin = ntohs(tcp_hdr(skb)->window);
2683 if (likely(!tcp_hdr(skb)->syn))
2684 nwin <<= tp->rx_opt.snd_wscale;
2686 if (tcp_may_update_window(tp, ack, ack_seq, nwin)) {
2687 flag |= FLAG_WIN_UPDATE;
2688 tcp_update_wl(tp, ack, ack_seq);
2690 if (tp->snd_wnd != nwin) {
2693 /* Note, it is the only place, where
2694 * fast path is recovered for sending TCP.
2697 tcp_fast_path_check(sk);
2699 if (nwin > tp->max_window) {
2700 tp->max_window = nwin;
2701 tcp_sync_mss(sk, inet_csk(sk)->icsk_pmtu_cookie);
2711 /* A very conservative spurious RTO response algorithm: reduce cwnd and
2712 * continue in congestion avoidance.
2714 static void tcp_conservative_spur_to_response(struct tcp_sock *tp)
2716 tp->snd_cwnd = min(tp->snd_cwnd, tp->snd_ssthresh);
2717 tp->snd_cwnd_cnt = 0;
2718 TCP_ECN_queue_cwr(tp);
2719 tcp_moderate_cwnd(tp);
2722 /* A conservative spurious RTO response algorithm: reduce cwnd using
2723 * rate halving and continue in congestion avoidance.
2725 static void tcp_ratehalving_spur_to_response(struct sock *sk)
2727 tcp_enter_cwr(sk, 0);
2730 static void tcp_undo_spur_to_response(struct sock *sk, int flag)
2733 tcp_ratehalving_spur_to_response(sk);
2735 tcp_undo_cwr(sk, 1);
2738 /* F-RTO spurious RTO detection algorithm (RFC4138)
2740 * F-RTO affects during two new ACKs following RTO (well, almost, see inline
2741 * comments). State (ACK number) is kept in frto_counter. When ACK advances
2742 * window (but not to or beyond highest sequence sent before RTO):
2743 * On First ACK, send two new segments out.
2744 * On Second ACK, RTO was likely spurious. Do spurious response (response
2745 * algorithm is not part of the F-RTO detection algorithm
2746 * given in RFC4138 but can be selected separately).
2747 * Otherwise (basically on duplicate ACK), RTO was (likely) caused by a loss
2748 * and TCP falls back to conventional RTO recovery. F-RTO allows overriding
2749 * of Nagle, this is done using frto_counter states 2 and 3, when a new data
2750 * segment of any size sent during F-RTO, state 2 is upgraded to 3.
2752 * Rationale: if the RTO was spurious, new ACKs should arrive from the
2753 * original window even after we transmit two new data segments.
2756 * on first step, wait until first cumulative ACK arrives, then move to
2757 * the second step. In second step, the next ACK decides.
2759 * F-RTO is implemented (mainly) in four functions:
2760 * - tcp_use_frto() is used to determine if TCP is can use F-RTO
2761 * - tcp_enter_frto() prepares TCP state on RTO if F-RTO is used, it is
2762 * called when tcp_use_frto() showed green light
2763 * - tcp_process_frto() handles incoming ACKs during F-RTO algorithm
2764 * - tcp_enter_frto_loss() is called if there is not enough evidence
2765 * to prove that the RTO is indeed spurious. It transfers the control
2766 * from F-RTO to the conventional RTO recovery
2768 static int tcp_process_frto(struct sock *sk, int flag)
2770 struct tcp_sock *tp = tcp_sk(sk);
2772 tcp_verify_left_out(tp);
2774 /* Duplicate the behavior from Loss state (fastretrans_alert) */
2775 if (flag&FLAG_DATA_ACKED)
2776 inet_csk(sk)->icsk_retransmits = 0;
2778 if (!before(tp->snd_una, tp->frto_highmark)) {
2779 tcp_enter_frto_loss(sk, (tp->frto_counter == 1 ? 2 : 3), flag);
2783 if (!IsSackFrto() || IsReno(tp)) {
2784 /* RFC4138 shortcoming in step 2; should also have case c):
2785 * ACK isn't duplicate nor advances window, e.g., opposite dir
2788 if (!(flag&FLAG_ANY_PROGRESS) && (flag&FLAG_NOT_DUP))
2791 if (!(flag&FLAG_DATA_ACKED)) {
2792 tcp_enter_frto_loss(sk, (tp->frto_counter == 1 ? 0 : 3),
2797 if (!(flag&FLAG_DATA_ACKED) && (tp->frto_counter == 1)) {
2798 /* Prevent sending of new data. */
2799 tp->snd_cwnd = min(tp->snd_cwnd,
2800 tcp_packets_in_flight(tp));
2804 if ((tp->frto_counter >= 2) &&
2805 (!(flag&FLAG_FORWARD_PROGRESS) ||
2806 ((flag&FLAG_DATA_SACKED) && !(flag&FLAG_ONLY_ORIG_SACKED)))) {
2807 /* RFC4138 shortcoming (see comment above) */
2808 if (!(flag&FLAG_FORWARD_PROGRESS) && (flag&FLAG_NOT_DUP))
2811 tcp_enter_frto_loss(sk, 3, flag);
2816 if (tp->frto_counter == 1) {
2817 /* Sending of the next skb must be allowed or no FRTO */
2818 if (!tcp_send_head(sk) ||
2819 after(TCP_SKB_CB(tcp_send_head(sk))->end_seq,
2820 tp->snd_una + tp->snd_wnd)) {
2821 tcp_enter_frto_loss(sk, (tp->frto_counter == 1 ? 2 : 3),
2826 tp->snd_cwnd = tcp_packets_in_flight(tp) + 2;
2827 tp->frto_counter = 2;
2830 switch (sysctl_tcp_frto_response) {
2832 tcp_undo_spur_to_response(sk, flag);
2835 tcp_conservative_spur_to_response(tp);
2838 tcp_ratehalving_spur_to_response(sk);
2841 tp->frto_counter = 0;
2846 /* This routine deals with incoming acks, but not outgoing ones. */
2847 static int tcp_ack(struct sock *sk, struct sk_buff *skb, int flag)
2849 struct inet_connection_sock *icsk = inet_csk(sk);
2850 struct tcp_sock *tp = tcp_sk(sk);
2851 u32 prior_snd_una = tp->snd_una;
2852 u32 ack_seq = TCP_SKB_CB(skb)->seq;
2853 u32 ack = TCP_SKB_CB(skb)->ack_seq;
2854 u32 prior_in_flight;
2859 /* If the ack is newer than sent or older than previous acks
2860 * then we can probably ignore it.
2862 if (after(ack, tp->snd_nxt))
2863 goto uninteresting_ack;
2865 if (before(ack, prior_snd_una))
2868 if (after(ack, prior_snd_una))
2869 flag |= FLAG_SND_UNA_ADVANCED;
2871 if (sysctl_tcp_abc) {
2872 if (icsk->icsk_ca_state < TCP_CA_CWR)
2873 tp->bytes_acked += ack - prior_snd_una;
2874 else if (icsk->icsk_ca_state == TCP_CA_Loss)
2875 /* we assume just one segment left network */
2876 tp->bytes_acked += min(ack - prior_snd_una, tp->mss_cache);
2879 if (!(flag&FLAG_SLOWPATH) && after(ack, prior_snd_una)) {
2880 /* Window is constant, pure forward advance.
2881 * No more checks are required.
2882 * Note, we use the fact that SND.UNA>=SND.WL2.
2884 tcp_update_wl(tp, ack, ack_seq);
2886 flag |= FLAG_WIN_UPDATE;
2888 tcp_ca_event(sk, CA_EVENT_FAST_ACK);
2890 NET_INC_STATS_BH(LINUX_MIB_TCPHPACKS);
2892 if (ack_seq != TCP_SKB_CB(skb)->end_seq)
2895 NET_INC_STATS_BH(LINUX_MIB_TCPPUREACKS);
2897 flag |= tcp_ack_update_window(sk, skb, ack, ack_seq);
2899 if (TCP_SKB_CB(skb)->sacked)
2900 flag |= tcp_sacktag_write_queue(sk, skb, prior_snd_una);
2902 if (TCP_ECN_rcv_ecn_echo(tp, tcp_hdr(skb)))
2905 tcp_ca_event(sk, CA_EVENT_SLOW_ACK);
2908 /* We passed data and got it acked, remove any soft error
2909 * log. Something worked...
2911 sk->sk_err_soft = 0;
2912 tp->rcv_tstamp = tcp_time_stamp;
2913 prior_packets = tp->packets_out;
2917 prior_in_flight = tcp_packets_in_flight(tp);
2919 /* See if we can take anything off of the retransmit queue. */
2920 flag |= tcp_clean_rtx_queue(sk, &seq_rtt);
2922 if (tp->frto_counter)
2923 frto_cwnd = tcp_process_frto(sk, flag);
2925 if (tcp_ack_is_dubious(sk, flag)) {
2926 /* Advance CWND, if state allows this. */
2927 if ((flag & FLAG_DATA_ACKED) && !frto_cwnd &&
2928 tcp_may_raise_cwnd(sk, flag))
2929 tcp_cong_avoid(sk, ack, prior_in_flight, 0);
2930 tcp_fastretrans_alert(sk, prior_packets, flag);
2932 if ((flag & FLAG_DATA_ACKED) && !frto_cwnd)
2933 tcp_cong_avoid(sk, ack, prior_in_flight, 1);
2936 if ((flag & FLAG_FORWARD_PROGRESS) || !(flag&FLAG_NOT_DUP))
2937 dst_confirm(sk->sk_dst_cache);
2942 icsk->icsk_probes_out = 0;
2944 /* If this ack opens up a zero window, clear backoff. It was
2945 * being used to time the probes, and is probably far higher than
2946 * it needs to be for normal retransmission.
2948 if (tcp_send_head(sk))
2953 if (TCP_SKB_CB(skb)->sacked)
2954 tcp_sacktag_write_queue(sk, skb, prior_snd_una);
2957 SOCK_DEBUG(sk, "Ack %u out of %u:%u\n", ack, tp->snd_una, tp->snd_nxt);
2962 /* Look for tcp options. Normally only called on SYN and SYNACK packets.
2963 * But, this can also be called on packets in the established flow when
2964 * the fast version below fails.
2966 void tcp_parse_options(struct sk_buff *skb, struct tcp_options_received *opt_rx, int estab)
2969 struct tcphdr *th = tcp_hdr(skb);
2970 int length=(th->doff*4)-sizeof(struct tcphdr);
2972 ptr = (unsigned char *)(th + 1);
2973 opt_rx->saw_tstamp = 0;
2975 while (length > 0) {
2982 case TCPOPT_NOP: /* Ref: RFC 793 section 3.1 */
2987 if (opsize < 2) /* "silly options" */
2989 if (opsize > length)
2990 return; /* don't parse partial options */
2993 if (opsize==TCPOLEN_MSS && th->syn && !estab) {
2994 u16 in_mss = ntohs(get_unaligned((__be16 *)ptr));
2996 if (opt_rx->user_mss && opt_rx->user_mss < in_mss)
2997 in_mss = opt_rx->user_mss;
2998 opt_rx->mss_clamp = in_mss;
3003 if (opsize==TCPOLEN_WINDOW && th->syn && !estab)
3004 if (sysctl_tcp_window_scaling) {
3005 __u8 snd_wscale = *(__u8 *) ptr;
3006 opt_rx->wscale_ok = 1;
3007 if (snd_wscale > 14) {
3008 if (net_ratelimit())
3009 printk(KERN_INFO "tcp_parse_options: Illegal window "
3010 "scaling value %d >14 received.\n",
3014 opt_rx->snd_wscale = snd_wscale;
3017 case TCPOPT_TIMESTAMP:
3018 if (opsize==TCPOLEN_TIMESTAMP) {
3019 if ((estab && opt_rx->tstamp_ok) ||
3020 (!estab && sysctl_tcp_timestamps)) {
3021 opt_rx->saw_tstamp = 1;
3022 opt_rx->rcv_tsval = ntohl(get_unaligned((__be32 *)ptr));
3023 opt_rx->rcv_tsecr = ntohl(get_unaligned((__be32 *)(ptr+4)));
3027 case TCPOPT_SACK_PERM:
3028 if (opsize==TCPOLEN_SACK_PERM && th->syn && !estab) {
3029 if (sysctl_tcp_sack) {
3030 opt_rx->sack_ok = 1;
3031 tcp_sack_reset(opt_rx);
3037 if ((opsize >= (TCPOLEN_SACK_BASE + TCPOLEN_SACK_PERBLOCK)) &&
3038 !((opsize - TCPOLEN_SACK_BASE) % TCPOLEN_SACK_PERBLOCK) &&
3040 TCP_SKB_CB(skb)->sacked = (ptr - 2) - (unsigned char *)th;
3043 #ifdef CONFIG_TCP_MD5SIG
3046 * The MD5 Hash has already been
3047 * checked (see tcp_v{4,6}_do_rcv()).
3059 /* Fast parse options. This hopes to only see timestamps.
3060 * If it is wrong it falls back on tcp_parse_options().
3062 static int tcp_fast_parse_options(struct sk_buff *skb, struct tcphdr *th,
3063 struct tcp_sock *tp)
3065 if (th->doff == sizeof(struct tcphdr)>>2) {
3066 tp->rx_opt.saw_tstamp = 0;
3068 } else if (tp->rx_opt.tstamp_ok &&
3069 th->doff == (sizeof(struct tcphdr)>>2)+(TCPOLEN_TSTAMP_ALIGNED>>2)) {
3070 __be32 *ptr = (__be32 *)(th + 1);
3071 if (*ptr == htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16)
3072 | (TCPOPT_TIMESTAMP << 8) | TCPOLEN_TIMESTAMP)) {
3073 tp->rx_opt.saw_tstamp = 1;
3075 tp->rx_opt.rcv_tsval = ntohl(*ptr);
3077 tp->rx_opt.rcv_tsecr = ntohl(*ptr);
3081 tcp_parse_options(skb, &tp->rx_opt, 1);
3085 static inline void tcp_store_ts_recent(struct tcp_sock *tp)
3087 tp->rx_opt.ts_recent = tp->rx_opt.rcv_tsval;
3088 tp->rx_opt.ts_recent_stamp = get_seconds();
3091 static inline void tcp_replace_ts_recent(struct tcp_sock *tp, u32 seq)
3093 if (tp->rx_opt.saw_tstamp && !after(seq, tp->rcv_wup)) {
3094 /* PAWS bug workaround wrt. ACK frames, the PAWS discard
3095 * extra check below makes sure this can only happen
3096 * for pure ACK frames. -DaveM
3098 * Not only, also it occurs for expired timestamps.
3101 if ((s32)(tp->rx_opt.rcv_tsval - tp->rx_opt.ts_recent) >= 0 ||
3102 get_seconds() >= tp->rx_opt.ts_recent_stamp + TCP_PAWS_24DAYS)
3103 tcp_store_ts_recent(tp);
3107 /* Sorry, PAWS as specified is broken wrt. pure-ACKs -DaveM
3109 * It is not fatal. If this ACK does _not_ change critical state (seqs, window)
3110 * it can pass through stack. So, the following predicate verifies that
3111 * this segment is not used for anything but congestion avoidance or
3112 * fast retransmit. Moreover, we even are able to eliminate most of such
3113 * second order effects, if we apply some small "replay" window (~RTO)
3114 * to timestamp space.
3116 * All these measures still do not guarantee that we reject wrapped ACKs
3117 * on networks with high bandwidth, when sequence space is recycled fastly,
3118 * but it guarantees that such events will be very rare and do not affect
3119 * connection seriously. This doesn't look nice, but alas, PAWS is really
3122 * [ Later note. Even worse! It is buggy for segments _with_ data. RFC
3123 * states that events when retransmit arrives after original data are rare.
3124 * It is a blatant lie. VJ forgot about fast retransmit! 8)8) It is
3125 * the biggest problem on large power networks even with minor reordering.
3126 * OK, let's give it small replay window. If peer clock is even 1hz, it is safe
3127 * up to bandwidth of 18Gigabit/sec. 8) ]
3130 static int tcp_disordered_ack(const struct sock *sk, const struct sk_buff *skb)
3132 struct tcp_sock *tp = tcp_sk(sk);
3133 struct tcphdr *th = tcp_hdr(skb);
3134 u32 seq = TCP_SKB_CB(skb)->seq;
3135 u32 ack = TCP_SKB_CB(skb)->ack_seq;
3137 return (/* 1. Pure ACK with correct sequence number. */
3138 (th->ack && seq == TCP_SKB_CB(skb)->end_seq && seq == tp->rcv_nxt) &&
3140 /* 2. ... and duplicate ACK. */
3141 ack == tp->snd_una &&
3143 /* 3. ... and does not update window. */
3144 !tcp_may_update_window(tp, ack, seq, ntohs(th->window) << tp->rx_opt.snd_wscale) &&
3146 /* 4. ... and sits in replay window. */
3147 (s32)(tp->rx_opt.ts_recent - tp->rx_opt.rcv_tsval) <= (inet_csk(sk)->icsk_rto * 1024) / HZ);
3150 static inline int tcp_paws_discard(const struct sock *sk, const struct sk_buff *skb)
3152 const struct tcp_sock *tp = tcp_sk(sk);
3153 return ((s32)(tp->rx_opt.ts_recent - tp->rx_opt.rcv_tsval) > TCP_PAWS_WINDOW &&
3154 get_seconds() < tp->rx_opt.ts_recent_stamp + TCP_PAWS_24DAYS &&
3155 !tcp_disordered_ack(sk, skb));
3158 /* Check segment sequence number for validity.
3160 * Segment controls are considered valid, if the segment
3161 * fits to the window after truncation to the window. Acceptability
3162 * of data (and SYN, FIN, of course) is checked separately.
3163 * See tcp_data_queue(), for example.
3165 * Also, controls (RST is main one) are accepted using RCV.WUP instead
3166 * of RCV.NXT. Peer still did not advance his SND.UNA when we
3167 * delayed ACK, so that hisSND.UNA<=ourRCV.WUP.
3168 * (borrowed from freebsd)
3171 static inline int tcp_sequence(struct tcp_sock *tp, u32 seq, u32 end_seq)
3173 return !before(end_seq, tp->rcv_wup) &&
3174 !after(seq, tp->rcv_nxt + tcp_receive_window(tp));
3177 /* When we get a reset we do this. */
3178 static void tcp_reset(struct sock *sk)
3180 /* We want the right error as BSD sees it (and indeed as we do). */
3181 switch (sk->sk_state) {
3183 sk->sk_err = ECONNREFUSED;
3185 case TCP_CLOSE_WAIT:
3191 sk->sk_err = ECONNRESET;
3194 if (!sock_flag(sk, SOCK_DEAD))
3195 sk->sk_error_report(sk);
3201 * Process the FIN bit. This now behaves as it is supposed to work
3202 * and the FIN takes effect when it is validly part of sequence
3203 * space. Not before when we get holes.
3205 * If we are ESTABLISHED, a received fin moves us to CLOSE-WAIT
3206 * (and thence onto LAST-ACK and finally, CLOSE, we never enter
3209 * If we are in FINWAIT-1, a received FIN indicates simultaneous
3210 * close and we go into CLOSING (and later onto TIME-WAIT)
3212 * If we are in FINWAIT-2, a received FIN moves us to TIME-WAIT.
3214 static void tcp_fin(struct sk_buff *skb, struct sock *sk, struct tcphdr *th)
3216 struct tcp_sock *tp = tcp_sk(sk);
3218 inet_csk_schedule_ack(sk);
3220 sk->sk_shutdown |= RCV_SHUTDOWN;
3221 sock_set_flag(sk, SOCK_DONE);
3223 switch (sk->sk_state) {
3225 case TCP_ESTABLISHED:
3226 /* Move to CLOSE_WAIT */
3227 tcp_set_state(sk, TCP_CLOSE_WAIT);
3228 inet_csk(sk)->icsk_ack.pingpong = 1;
3231 case TCP_CLOSE_WAIT:
3233 /* Received a retransmission of the FIN, do
3238 /* RFC793: Remain in the LAST-ACK state. */
3242 /* This case occurs when a simultaneous close
3243 * happens, we must ack the received FIN and
3244 * enter the CLOSING state.
3247 tcp_set_state(sk, TCP_CLOSING);
3250 /* Received a FIN -- send ACK and enter TIME_WAIT. */
3252 tcp_time_wait(sk, TCP_TIME_WAIT, 0);
3255 /* Only TCP_LISTEN and TCP_CLOSE are left, in these
3256 * cases we should never reach this piece of code.
3258 printk(KERN_ERR "%s: Impossible, sk->sk_state=%d\n",
3259 __FUNCTION__, sk->sk_state);
3263 /* It _is_ possible, that we have something out-of-order _after_ FIN.
3264 * Probably, we should reset in this case. For now drop them.
3266 __skb_queue_purge(&tp->out_of_order_queue);
3267 if (tp->rx_opt.sack_ok)
3268 tcp_sack_reset(&tp->rx_opt);
3269 sk_stream_mem_reclaim(sk);
3271 if (!sock_flag(sk, SOCK_DEAD)) {
3272 sk->sk_state_change(sk);
3274 /* Do not send POLL_HUP for half duplex close. */
3275 if (sk->sk_shutdown == SHUTDOWN_MASK ||
3276 sk->sk_state == TCP_CLOSE)
3277 sk_wake_async(sk, 1, POLL_HUP);
3279 sk_wake_async(sk, 1, POLL_IN);
3283 static inline int tcp_sack_extend(struct tcp_sack_block *sp, u32 seq, u32 end_seq)
3285 if (!after(seq, sp->end_seq) && !after(sp->start_seq, end_seq)) {
3286 if (before(seq, sp->start_seq))
3287 sp->start_seq = seq;
3288 if (after(end_seq, sp->end_seq))
3289 sp->end_seq = end_seq;
3295 static void tcp_dsack_set(struct tcp_sock *tp, u32 seq, u32 end_seq)
3297 if (tp->rx_opt.sack_ok && sysctl_tcp_dsack) {
3298 if (before(seq, tp->rcv_nxt))
3299 NET_INC_STATS_BH(LINUX_MIB_TCPDSACKOLDSENT);
3301 NET_INC_STATS_BH(LINUX_MIB_TCPDSACKOFOSENT);
3303 tp->rx_opt.dsack = 1;
3304 tp->duplicate_sack[0].start_seq = seq;
3305 tp->duplicate_sack[0].end_seq = end_seq;
3306 tp->rx_opt.eff_sacks = min(tp->rx_opt.num_sacks + 1, 4 - tp->rx_opt.tstamp_ok);
3310 static void tcp_dsack_extend(struct tcp_sock *tp, u32 seq, u32 end_seq)
3312 if (!tp->rx_opt.dsack)
3313 tcp_dsack_set(tp, seq, end_seq);
3315 tcp_sack_extend(tp->duplicate_sack, seq, end_seq);
3318 static void tcp_send_dupack(struct sock *sk, struct sk_buff *skb)
3320 struct tcp_sock *tp = tcp_sk(sk);
3322 if (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
3323 before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
3324 NET_INC_STATS_BH(LINUX_MIB_DELAYEDACKLOST);
3325 tcp_enter_quickack_mode(sk);
3327 if (tp->rx_opt.sack_ok && sysctl_tcp_dsack) {
3328 u32 end_seq = TCP_SKB_CB(skb)->end_seq;
3330 if (after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt))
3331 end_seq = tp->rcv_nxt;
3332 tcp_dsack_set(tp, TCP_SKB_CB(skb)->seq, end_seq);
3339 /* These routines update the SACK block as out-of-order packets arrive or
3340 * in-order packets close up the sequence space.
3342 static void tcp_sack_maybe_coalesce(struct tcp_sock *tp)
3345 struct tcp_sack_block *sp = &tp->selective_acks[0];
3346 struct tcp_sack_block *swalk = sp+1;
3348 /* See if the recent change to the first SACK eats into
3349 * or hits the sequence space of other SACK blocks, if so coalesce.
3351 for (this_sack = 1; this_sack < tp->rx_opt.num_sacks; ) {
3352 if (tcp_sack_extend(sp, swalk->start_seq, swalk->end_seq)) {
3355 /* Zap SWALK, by moving every further SACK up by one slot.
3356 * Decrease num_sacks.
3358 tp->rx_opt.num_sacks--;
3359 tp->rx_opt.eff_sacks = min(tp->rx_opt.num_sacks + tp->rx_opt.dsack, 4 - tp->rx_opt.tstamp_ok);
3360 for (i=this_sack; i < tp->rx_opt.num_sacks; i++)
3364 this_sack++, swalk++;
3368 static inline void tcp_sack_swap(struct tcp_sack_block *sack1, struct tcp_sack_block *sack2)
3372 tmp = sack1->start_seq;
3373 sack1->start_seq = sack2->start_seq;
3374 sack2->start_seq = tmp;
3376 tmp = sack1->end_seq;
3377 sack1->end_seq = sack2->end_seq;
3378 sack2->end_seq = tmp;
3381 static void tcp_sack_new_ofo_skb(struct sock *sk, u32 seq, u32 end_seq)
3383 struct tcp_sock *tp = tcp_sk(sk);
3384 struct tcp_sack_block *sp = &tp->selective_acks[0];
3385 int cur_sacks = tp->rx_opt.num_sacks;
3391 for (this_sack=0; this_sack<cur_sacks; this_sack++, sp++) {
3392 if (tcp_sack_extend(sp, seq, end_seq)) {
3393 /* Rotate this_sack to the first one. */
3394 for (; this_sack>0; this_sack--, sp--)
3395 tcp_sack_swap(sp, sp-1);
3397 tcp_sack_maybe_coalesce(tp);
3402 /* Could not find an adjacent existing SACK, build a new one,
3403 * put it at the front, and shift everyone else down. We
3404 * always know there is at least one SACK present already here.
3406 * If the sack array is full, forget about the last one.
3408 if (this_sack >= 4) {
3410 tp->rx_opt.num_sacks--;
3413 for (; this_sack > 0; this_sack--, sp--)
3417 /* Build the new head SACK, and we're done. */
3418 sp->start_seq = seq;
3419 sp->end_seq = end_seq;
3420 tp->rx_opt.num_sacks++;
3421 tp->rx_opt.eff_sacks = min(tp->rx_opt.num_sacks + tp->rx_opt.dsack, 4 - tp->rx_opt.tstamp_ok);
3424 /* RCV.NXT advances, some SACKs should be eaten. */
3426 static void tcp_sack_remove(struct tcp_sock *tp)
3428 struct tcp_sack_block *sp = &tp->selective_acks[0];
3429 int num_sacks = tp->rx_opt.num_sacks;
3432 /* Empty ofo queue, hence, all the SACKs are eaten. Clear. */
3433 if (skb_queue_empty(&tp->out_of_order_queue)) {
3434 tp->rx_opt.num_sacks = 0;
3435 tp->rx_opt.eff_sacks = tp->rx_opt.dsack;
3439 for (this_sack = 0; this_sack < num_sacks; ) {
3440 /* Check if the start of the sack is covered by RCV.NXT. */
3441 if (!before(tp->rcv_nxt, sp->start_seq)) {
3444 /* RCV.NXT must cover all the block! */
3445 BUG_TRAP(!before(tp->rcv_nxt, sp->end_seq));
3447 /* Zap this SACK, by moving forward any other SACKS. */
3448 for (i=this_sack+1; i < num_sacks; i++)
3449 tp->selective_acks[i-1] = tp->selective_acks[i];
3456 if (num_sacks != tp->rx_opt.num_sacks) {
3457 tp->rx_opt.num_sacks = num_sacks;
3458 tp->rx_opt.eff_sacks = min(tp->rx_opt.num_sacks + tp->rx_opt.dsack, 4 - tp->rx_opt.tstamp_ok);
3462 /* This one checks to see if we can put data from the
3463 * out_of_order queue into the receive_queue.
3465 static void tcp_ofo_queue(struct sock *sk)
3467 struct tcp_sock *tp = tcp_sk(sk);
3468 __u32 dsack_high = tp->rcv_nxt;
3469 struct sk_buff *skb;
3471 while ((skb = skb_peek(&tp->out_of_order_queue)) != NULL) {
3472 if (after(TCP_SKB_CB(skb)->seq, tp->rcv_nxt))
3475 if (before(TCP_SKB_CB(skb)->seq, dsack_high)) {
3476 __u32 dsack = dsack_high;
3477 if (before(TCP_SKB_CB(skb)->end_seq, dsack_high))
3478 dsack_high = TCP_SKB_CB(skb)->end_seq;
3479 tcp_dsack_extend(tp, TCP_SKB_CB(skb)->seq, dsack);
3482 if (!after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt)) {
3483 SOCK_DEBUG(sk, "ofo packet was already received \n");
3484 __skb_unlink(skb, &tp->out_of_order_queue);
3488 SOCK_DEBUG(sk, "ofo requeuing : rcv_next %X seq %X - %X\n",
3489 tp->rcv_nxt, TCP_SKB_CB(skb)->seq,
3490 TCP_SKB_CB(skb)->end_seq);
3492 __skb_unlink(skb, &tp->out_of_order_queue);
3493 __skb_queue_tail(&sk->sk_receive_queue, skb);
3494 tp->rcv_nxt = TCP_SKB_CB(skb)->end_seq;
3495 if (tcp_hdr(skb)->fin)
3496 tcp_fin(skb, sk, tcp_hdr(skb));
3500 static int tcp_prune_queue(struct sock *sk);
3502 static void tcp_data_queue(struct sock *sk, struct sk_buff *skb)
3504 struct tcphdr *th = tcp_hdr(skb);
3505 struct tcp_sock *tp = tcp_sk(sk);
3508 if (TCP_SKB_CB(skb)->seq == TCP_SKB_CB(skb)->end_seq)
3511 __skb_pull(skb, th->doff*4);
3513 TCP_ECN_accept_cwr(tp, skb);
3515 if (tp->rx_opt.dsack) {
3516 tp->rx_opt.dsack = 0;
3517 tp->rx_opt.eff_sacks = min_t(unsigned int, tp->rx_opt.num_sacks,
3518 4 - tp->rx_opt.tstamp_ok);
3521 /* Queue data for delivery to the user.
3522 * Packets in sequence go to the receive queue.
3523 * Out of sequence packets to the out_of_order_queue.
3525 if (TCP_SKB_CB(skb)->seq == tp->rcv_nxt) {
3526 if (tcp_receive_window(tp) == 0)
3529 /* Ok. In sequence. In window. */
3530 if (tp->ucopy.task == current &&
3531 tp->copied_seq == tp->rcv_nxt && tp->ucopy.len &&
3532 sock_owned_by_user(sk) && !tp->urg_data) {
3533 int chunk = min_t(unsigned int, skb->len,
3536 __set_current_state(TASK_RUNNING);
3539 if (!skb_copy_datagram_iovec(skb, 0, tp->ucopy.iov, chunk)) {
3540 tp->ucopy.len -= chunk;
3541 tp->copied_seq += chunk;
3542 eaten = (chunk == skb->len && !th->fin);
3543 tcp_rcv_space_adjust(sk);
3551 (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf ||
3552 !sk_stream_rmem_schedule(sk, skb))) {
3553 if (tcp_prune_queue(sk) < 0 ||
3554 !sk_stream_rmem_schedule(sk, skb))
3557 sk_stream_set_owner_r(skb, sk);
3558 __skb_queue_tail(&sk->sk_receive_queue, skb);
3560 tp->rcv_nxt = TCP_SKB_CB(skb)->end_seq;
3562 tcp_event_data_recv(sk, skb);
3564 tcp_fin(skb, sk, th);
3566 if (!skb_queue_empty(&tp->out_of_order_queue)) {
3569 /* RFC2581. 4.2. SHOULD send immediate ACK, when
3570 * gap in queue is filled.
3572 if (skb_queue_empty(&tp->out_of_order_queue))
3573 inet_csk(sk)->icsk_ack.pingpong = 0;
3576 if (tp->rx_opt.num_sacks)
3577 tcp_sack_remove(tp);
3579 tcp_fast_path_check(sk);
3583 else if (!sock_flag(sk, SOCK_DEAD))
3584 sk->sk_data_ready(sk, 0);
3588 if (!after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt)) {
3589 /* A retransmit, 2nd most common case. Force an immediate ack. */
3590 NET_INC_STATS_BH(LINUX_MIB_DELAYEDACKLOST);
3591 tcp_dsack_set(tp, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq);
3594 tcp_enter_quickack_mode(sk);
3595 inet_csk_schedule_ack(sk);
3601 /* Out of window. F.e. zero window probe. */
3602 if (!before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt + tcp_receive_window(tp)))
3605 tcp_enter_quickack_mode(sk);
3607 if (before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
3608 /* Partial packet, seq < rcv_next < end_seq */
3609 SOCK_DEBUG(sk, "partial packet: rcv_next %X seq %X - %X\n",
3610 tp->rcv_nxt, TCP_SKB_CB(skb)->seq,
3611 TCP_SKB_CB(skb)->end_seq);
3613 tcp_dsack_set(tp, TCP_SKB_CB(skb)->seq, tp->rcv_nxt);
3615 /* If window is closed, drop tail of packet. But after
3616 * remembering D-SACK for its head made in previous line.
3618 if (!tcp_receive_window(tp))
3623 TCP_ECN_check_ce(tp, skb);
3625 if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf ||
3626 !sk_stream_rmem_schedule(sk, skb)) {
3627 if (tcp_prune_queue(sk) < 0 ||
3628 !sk_stream_rmem_schedule(sk, skb))
3632 /* Disable header prediction. */
3634 inet_csk_schedule_ack(sk);
3636 SOCK_DEBUG(sk, "out of order segment: rcv_next %X seq %X - %X\n",
3637 tp->rcv_nxt, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq);
3639 sk_stream_set_owner_r(skb, sk);
3641 if (!skb_peek(&tp->out_of_order_queue)) {
3642 /* Initial out of order segment, build 1 SACK. */
3643 if (tp->rx_opt.sack_ok) {
3644 tp->rx_opt.num_sacks = 1;
3645 tp->rx_opt.dsack = 0;
3646 tp->rx_opt.eff_sacks = 1;
3647 tp->selective_acks[0].start_seq = TCP_SKB_CB(skb)->seq;
3648 tp->selective_acks[0].end_seq =
3649 TCP_SKB_CB(skb)->end_seq;
3651 __skb_queue_head(&tp->out_of_order_queue,skb);
3653 struct sk_buff *skb1 = tp->out_of_order_queue.prev;
3654 u32 seq = TCP_SKB_CB(skb)->seq;
3655 u32 end_seq = TCP_SKB_CB(skb)->end_seq;
3657 if (seq == TCP_SKB_CB(skb1)->end_seq) {
3658 __skb_append(skb1, skb, &tp->out_of_order_queue);
3660 if (!tp->rx_opt.num_sacks ||
3661 tp->selective_acks[0].end_seq != seq)
3664 /* Common case: data arrive in order after hole. */
3665 tp->selective_acks[0].end_seq = end_seq;
3669 /* Find place to insert this segment. */
3671 if (!after(TCP_SKB_CB(skb1)->seq, seq))
3673 } while ((skb1 = skb1->prev) !=
3674 (struct sk_buff*)&tp->out_of_order_queue);
3676 /* Do skb overlap to previous one? */
3677 if (skb1 != (struct sk_buff*)&tp->out_of_order_queue &&
3678 before(seq, TCP_SKB_CB(skb1)->end_seq)) {
3679 if (!after(end_seq, TCP_SKB_CB(skb1)->end_seq)) {
3680 /* All the bits are present. Drop. */
3682 tcp_dsack_set(tp, seq, end_seq);
3685 if (after(seq, TCP_SKB_CB(skb1)->seq)) {
3686 /* Partial overlap. */
3687 tcp_dsack_set(tp, seq, TCP_SKB_CB(skb1)->end_seq);
3692 __skb_insert(skb, skb1, skb1->next, &tp->out_of_order_queue);
3694 /* And clean segments covered by new one as whole. */
3695 while ((skb1 = skb->next) !=
3696 (struct sk_buff*)&tp->out_of_order_queue &&
3697 after(end_seq, TCP_SKB_CB(skb1)->seq)) {
3698 if (before(end_seq, TCP_SKB_CB(skb1)->end_seq)) {
3699 tcp_dsack_extend(tp, TCP_SKB_CB(skb1)->seq, end_seq);
3702 __skb_unlink(skb1, &tp->out_of_order_queue);
3703 tcp_dsack_extend(tp, TCP_SKB_CB(skb1)->seq, TCP_SKB_CB(skb1)->end_seq);
3708 if (tp->rx_opt.sack_ok)
3709 tcp_sack_new_ofo_skb(sk, seq, end_seq);
3713 /* Collapse contiguous sequence of skbs head..tail with
3714 * sequence numbers start..end.
3715 * Segments with FIN/SYN are not collapsed (only because this
3719 tcp_collapse(struct sock *sk, struct sk_buff_head *list,
3720 struct sk_buff *head, struct sk_buff *tail,
3723 struct sk_buff *skb;
3725 /* First, check that queue is collapsible and find
3726 * the point where collapsing can be useful. */
3727 for (skb = head; skb != tail; ) {
3728 /* No new bits? It is possible on ofo queue. */
3729 if (!before(start, TCP_SKB_CB(skb)->end_seq)) {
3730 struct sk_buff *next = skb->next;
3731 __skb_unlink(skb, list);
3733 NET_INC_STATS_BH(LINUX_MIB_TCPRCVCOLLAPSED);
3738 /* The first skb to collapse is:
3740 * - bloated or contains data before "start" or
3741 * overlaps to the next one.
3743 if (!tcp_hdr(skb)->syn && !tcp_hdr(skb)->fin &&
3744 (tcp_win_from_space(skb->truesize) > skb->len ||
3745 before(TCP_SKB_CB(skb)->seq, start) ||
3746 (skb->next != tail &&
3747 TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb->next)->seq)))
3750 /* Decided to skip this, advance start seq. */
3751 start = TCP_SKB_CB(skb)->end_seq;
3754 if (skb == tail || tcp_hdr(skb)->syn || tcp_hdr(skb)->fin)
3757 while (before(start, end)) {
3758 struct sk_buff *nskb;
3759 int header = skb_headroom(skb);
3760 int copy = SKB_MAX_ORDER(header, 0);
3762 /* Too big header? This can happen with IPv6. */
3765 if (end-start < copy)
3767 nskb = alloc_skb(copy+header, GFP_ATOMIC);
3771 skb_set_mac_header(nskb, skb_mac_header(skb) - skb->head);
3772 skb_set_network_header(nskb, (skb_network_header(skb) -
3774 skb_set_transport_header(nskb, (skb_transport_header(skb) -
3776 skb_reserve(nskb, header);
3777 memcpy(nskb->head, skb->head, header);
3778 memcpy(nskb->cb, skb->cb, sizeof(skb->cb));
3779 TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(nskb)->end_seq = start;
3780 __skb_insert(nskb, skb->prev, skb, list);
3781 sk_stream_set_owner_r(nskb, sk);
3783 /* Copy data, releasing collapsed skbs. */
3785 int offset = start - TCP_SKB_CB(skb)->seq;
3786 int size = TCP_SKB_CB(skb)->end_seq - start;
3790 size = min(copy, size);
3791 if (skb_copy_bits(skb, offset, skb_put(nskb, size), size))
3793 TCP_SKB_CB(nskb)->end_seq += size;
3797 if (!before(start, TCP_SKB_CB(skb)->end_seq)) {
3798 struct sk_buff *next = skb->next;
3799 __skb_unlink(skb, list);
3801 NET_INC_STATS_BH(LINUX_MIB_TCPRCVCOLLAPSED);
3804 tcp_hdr(skb)->syn ||
3812 /* Collapse ofo queue. Algorithm: select contiguous sequence of skbs
3813 * and tcp_collapse() them until all the queue is collapsed.
3815 static void tcp_collapse_ofo_queue(struct sock *sk)
3817 struct tcp_sock *tp = tcp_sk(sk);
3818 struct sk_buff *skb = skb_peek(&tp->out_of_order_queue);
3819 struct sk_buff *head;
3825 start = TCP_SKB_CB(skb)->seq;
3826 end = TCP_SKB_CB(skb)->end_seq;
3832 /* Segment is terminated when we see gap or when
3833 * we are at the end of all the queue. */
3834 if (skb == (struct sk_buff *)&tp->out_of_order_queue ||
3835 after(TCP_SKB_CB(skb)->seq, end) ||
3836 before(TCP_SKB_CB(skb)->end_seq, start)) {
3837 tcp_collapse(sk, &tp->out_of_order_queue,
3838 head, skb, start, end);
3840 if (skb == (struct sk_buff *)&tp->out_of_order_queue)
3842 /* Start new segment */
3843 start = TCP_SKB_CB(skb)->seq;
3844 end = TCP_SKB_CB(skb)->end_seq;
3846 if (before(TCP_SKB_CB(skb)->seq, start))
3847 start = TCP_SKB_CB(skb)->seq;
3848 if (after(TCP_SKB_CB(skb)->end_seq, end))
3849 end = TCP_SKB_CB(skb)->end_seq;
3854 /* Reduce allocated memory if we can, trying to get
3855 * the socket within its memory limits again.
3857 * Return less than zero if we should start dropping frames
3858 * until the socket owning process reads some of the data
3859 * to stabilize the situation.
3861 static int tcp_prune_queue(struct sock *sk)
3863 struct tcp_sock *tp = tcp_sk(sk);
3865 SOCK_DEBUG(sk, "prune_queue: c=%x\n", tp->copied_seq);
3867 NET_INC_STATS_BH(LINUX_MIB_PRUNECALLED);
3869 if (atomic_read(&sk->sk_rmem_alloc) >= sk->sk_rcvbuf)
3870 tcp_clamp_window(sk);
3871 else if (tcp_memory_pressure)
3872 tp->rcv_ssthresh = min(tp->rcv_ssthresh, 4U * tp->advmss);
3874 tcp_collapse_ofo_queue(sk);
3875 tcp_collapse(sk, &sk->sk_receive_queue,
3876 sk->sk_receive_queue.next,
3877 (struct sk_buff*)&sk->sk_receive_queue,
3878 tp->copied_seq, tp->rcv_nxt);
3879 sk_stream_mem_reclaim(sk);
3881 if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf)
3884 /* Collapsing did not help, destructive actions follow.
3885 * This must not ever occur. */
3887 /* First, purge the out_of_order queue. */
3888 if (!skb_queue_empty(&tp->out_of_order_queue)) {
3889 NET_INC_STATS_BH(LINUX_MIB_OFOPRUNED);
3890 __skb_queue_purge(&tp->out_of_order_queue);
3892 /* Reset SACK state. A conforming SACK implementation will
3893 * do the same at a timeout based retransmit. When a connection
3894 * is in a sad state like this, we care only about integrity
3895 * of the connection not performance.
3897 if (tp->rx_opt.sack_ok)
3898 tcp_sack_reset(&tp->rx_opt);
3899 sk_stream_mem_reclaim(sk);
3902 if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf)
3905 /* If we are really being abused, tell the caller to silently
3906 * drop receive data on the floor. It will get retransmitted
3907 * and hopefully then we'll have sufficient space.
3909 NET_INC_STATS_BH(LINUX_MIB_RCVPRUNED);
3911 /* Massive buffer overcommit. */
3917 /* RFC2861, slow part. Adjust cwnd, after it was not full during one rto.
3918 * As additional protections, we do not touch cwnd in retransmission phases,
3919 * and if application hit its sndbuf limit recently.
3921 void tcp_cwnd_application_limited(struct sock *sk)
3923 struct tcp_sock *tp = tcp_sk(sk);
3925 if (inet_csk(sk)->icsk_ca_state == TCP_CA_Open &&
3926 sk->sk_socket && !test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
3927 /* Limited by application or receiver window. */
3928 u32 init_win = tcp_init_cwnd(tp, __sk_dst_get(sk));
3929 u32 win_used = max(tp->snd_cwnd_used, init_win);
3930 if (win_used < tp->snd_cwnd) {
3931 tp->snd_ssthresh = tcp_current_ssthresh(sk);
3932 tp->snd_cwnd = (tp->snd_cwnd + win_used) >> 1;
3934 tp->snd_cwnd_used = 0;
3936 tp->snd_cwnd_stamp = tcp_time_stamp;
3939 static int tcp_should_expand_sndbuf(struct sock *sk)
3941 struct tcp_sock *tp = tcp_sk(sk);
3943 /* If the user specified a specific send buffer setting, do
3946 if (sk->sk_userlocks & SOCK_SNDBUF_LOCK)
3949 /* If we are under global TCP memory pressure, do not expand. */
3950 if (tcp_memory_pressure)
3953 /* If we are under soft global TCP memory pressure, do not expand. */
3954 if (atomic_read(&tcp_memory_allocated) >= sysctl_tcp_mem[0])
3957 /* If we filled the congestion window, do not expand. */
3958 if (tp->packets_out >= tp->snd_cwnd)
3964 /* When incoming ACK allowed to free some skb from write_queue,
3965 * we remember this event in flag SOCK_QUEUE_SHRUNK and wake up socket
3966 * on the exit from tcp input handler.
3968 * PROBLEM: sndbuf expansion does not work well with largesend.
3970 static void tcp_new_space(struct sock *sk)
3972 struct tcp_sock *tp = tcp_sk(sk);
3974 if (tcp_should_expand_sndbuf(sk)) {
3975 int sndmem = max_t(u32, tp->rx_opt.mss_clamp, tp->mss_cache) +
3976 MAX_TCP_HEADER + 16 + sizeof(struct sk_buff),
3977 demanded = max_t(unsigned int, tp->snd_cwnd,
3978 tp->reordering + 1);
3979 sndmem *= 2*demanded;
3980 if (sndmem > sk->sk_sndbuf)
3981 sk->sk_sndbuf = min(sndmem, sysctl_tcp_wmem[2]);
3982 tp->snd_cwnd_stamp = tcp_time_stamp;
3985 sk->sk_write_space(sk);
3988 static void tcp_check_space(struct sock *sk)
3990 if (sock_flag(sk, SOCK_QUEUE_SHRUNK)) {
3991 sock_reset_flag(sk, SOCK_QUEUE_SHRUNK);
3992 if (sk->sk_socket &&
3993 test_bit(SOCK_NOSPACE, &sk->sk_socket->flags))
3998 static inline void tcp_data_snd_check(struct sock *sk)
4000 tcp_push_pending_frames(sk);
4001 tcp_check_space(sk);
4005 * Check if sending an ack is needed.
4007 static void __tcp_ack_snd_check(struct sock *sk, int ofo_possible)
4009 struct tcp_sock *tp = tcp_sk(sk);
4011 /* More than one full frame received... */
4012 if (((tp->rcv_nxt - tp->rcv_wup) > inet_csk(sk)->icsk_ack.rcv_mss
4013 /* ... and right edge of window advances far enough.
4014 * (tcp_recvmsg() will send ACK otherwise). Or...
4016 && __tcp_select_window(sk) >= tp->rcv_wnd) ||
4017 /* We ACK each frame or... */
4018 tcp_in_quickack_mode(sk) ||
4019 /* We have out of order data. */
4021 skb_peek(&tp->out_of_order_queue))) {
4022 /* Then ack it now */
4025 /* Else, send delayed ack. */
4026 tcp_send_delayed_ack(sk);
4030 static inline void tcp_ack_snd_check(struct sock *sk)
4032 if (!inet_csk_ack_scheduled(sk)) {
4033 /* We sent a data segment already. */
4036 __tcp_ack_snd_check(sk, 1);
4040 * This routine is only called when we have urgent data
4041 * signaled. Its the 'slow' part of tcp_urg. It could be
4042 * moved inline now as tcp_urg is only called from one
4043 * place. We handle URGent data wrong. We have to - as
4044 * BSD still doesn't use the correction from RFC961.
4045 * For 1003.1g we should support a new option TCP_STDURG to permit
4046 * either form (or just set the sysctl tcp_stdurg).
4049 static void tcp_check_urg(struct sock * sk, struct tcphdr * th)
4051 struct tcp_sock *tp = tcp_sk(sk);
4052 u32 ptr = ntohs(th->urg_ptr);
4054 if (ptr && !sysctl_tcp_stdurg)
4056 ptr += ntohl(th->seq);
4058 /* Ignore urgent data that we've already seen and read. */
4059 if (after(tp->copied_seq, ptr))
4062 /* Do not replay urg ptr.
4064 * NOTE: interesting situation not covered by specs.
4065 * Misbehaving sender may send urg ptr, pointing to segment,
4066 * which we already have in ofo queue. We are not able to fetch
4067 * such data and will stay in TCP_URG_NOTYET until will be eaten
4068 * by recvmsg(). Seems, we are not obliged to handle such wicked
4069 * situations. But it is worth to think about possibility of some
4070 * DoSes using some hypothetical application level deadlock.
4072 if (before(ptr, tp->rcv_nxt))
4075 /* Do we already have a newer (or duplicate) urgent pointer? */
4076 if (tp->urg_data && !after(ptr, tp->urg_seq))
4079 /* Tell the world about our new urgent pointer. */
4082 /* We may be adding urgent data when the last byte read was
4083 * urgent. To do this requires some care. We cannot just ignore
4084 * tp->copied_seq since we would read the last urgent byte again
4085 * as data, nor can we alter copied_seq until this data arrives
4086 * or we break the semantics of SIOCATMARK (and thus sockatmark())
4088 * NOTE. Double Dutch. Rendering to plain English: author of comment
4089 * above did something sort of send("A", MSG_OOB); send("B", MSG_OOB);
4090 * and expect that both A and B disappear from stream. This is _wrong_.
4091 * Though this happens in BSD with high probability, this is occasional.
4092 * Any application relying on this is buggy. Note also, that fix "works"
4093 * only in this artificial test. Insert some normal data between A and B and we will
4094 * decline of BSD again. Verdict: it is better to remove to trap
4097 if (tp->urg_seq == tp->copied_seq && tp->urg_data &&
4098 !sock_flag(sk, SOCK_URGINLINE) &&
4099 tp->copied_seq != tp->rcv_nxt) {
4100 struct sk_buff *skb = skb_peek(&sk->sk_receive_queue);
4102 if (skb && !before(tp->copied_seq, TCP_SKB_CB(skb)->end_seq)) {
4103 __skb_unlink(skb, &sk->sk_receive_queue);
4108 tp->urg_data = TCP_URG_NOTYET;
4111 /* Disable header prediction. */
4115 /* This is the 'fast' part of urgent handling. */
4116 static void tcp_urg(struct sock *sk, struct sk_buff *skb, struct tcphdr *th)
4118 struct tcp_sock *tp = tcp_sk(sk);
4120 /* Check if we get a new urgent pointer - normally not. */
4122 tcp_check_urg(sk,th);
4124 /* Do we wait for any urgent data? - normally not... */
4125 if (tp->urg_data == TCP_URG_NOTYET) {
4126 u32 ptr = tp->urg_seq - ntohl(th->seq) + (th->doff * 4) -
4129 /* Is the urgent pointer pointing into this packet? */
4130 if (ptr < skb->len) {
4132 if (skb_copy_bits(skb, ptr, &tmp, 1))
4134 tp->urg_data = TCP_URG_VALID | tmp;
4135 if (!sock_flag(sk, SOCK_DEAD))
4136 sk->sk_data_ready(sk, 0);
4141 static int tcp_copy_to_iovec(struct sock *sk, struct sk_buff *skb, int hlen)
4143 struct tcp_sock *tp = tcp_sk(sk);
4144 int chunk = skb->len - hlen;
4148 if (skb_csum_unnecessary(skb))
4149 err = skb_copy_datagram_iovec(skb, hlen, tp->ucopy.iov, chunk);
4151 err = skb_copy_and_csum_datagram_iovec(skb, hlen,
4155 tp->ucopy.len -= chunk;
4156 tp->copied_seq += chunk;
4157 tcp_rcv_space_adjust(sk);
4164 static __sum16 __tcp_checksum_complete_user(struct sock *sk, struct sk_buff *skb)
4168 if (sock_owned_by_user(sk)) {
4170 result = __tcp_checksum_complete(skb);
4173 result = __tcp_checksum_complete(skb);
4178 static inline int tcp_checksum_complete_user(struct sock *sk, struct sk_buff *skb)
4180 return !skb_csum_unnecessary(skb) &&
4181 __tcp_checksum_complete_user(sk, skb);
4184 #ifdef CONFIG_NET_DMA
4185 static int tcp_dma_try_early_copy(struct sock *sk, struct sk_buff *skb, int hlen)
4187 struct tcp_sock *tp = tcp_sk(sk);
4188 int chunk = skb->len - hlen;
4190 int copied_early = 0;
4192 if (tp->ucopy.wakeup)
4195 if (!tp->ucopy.dma_chan && tp->ucopy.pinned_list)
4196 tp->ucopy.dma_chan = get_softnet_dma();
4198 if (tp->ucopy.dma_chan && skb_csum_unnecessary(skb)) {
4200 dma_cookie = dma_skb_copy_datagram_iovec(tp->ucopy.dma_chan,
4201 skb, hlen, tp->ucopy.iov, chunk, tp->ucopy.pinned_list);
4206 tp->ucopy.dma_cookie = dma_cookie;
4209 tp->ucopy.len -= chunk;
4210 tp->copied_seq += chunk;
4211 tcp_rcv_space_adjust(sk);
4213 if ((tp->ucopy.len == 0) ||
4214 (tcp_flag_word(tcp_hdr(skb)) & TCP_FLAG_PSH) ||
4215 (atomic_read(&sk->sk_rmem_alloc) > (sk->sk_rcvbuf >> 1))) {
4216 tp->ucopy.wakeup = 1;
4217 sk->sk_data_ready(sk, 0);
4219 } else if (chunk > 0) {
4220 tp->ucopy.wakeup = 1;
4221 sk->sk_data_ready(sk, 0);
4224 return copied_early;
4226 #endif /* CONFIG_NET_DMA */
4229 * TCP receive function for the ESTABLISHED state.
4231 * It is split into a fast path and a slow path. The fast path is
4233 * - A zero window was announced from us - zero window probing
4234 * is only handled properly in the slow path.
4235 * - Out of order segments arrived.
4236 * - Urgent data is expected.
4237 * - There is no buffer space left
4238 * - Unexpected TCP flags/window values/header lengths are received
4239 * (detected by checking the TCP header against pred_flags)
4240 * - Data is sent in both directions. Fast path only supports pure senders
4241 * or pure receivers (this means either the sequence number or the ack
4242 * value must stay constant)
4243 * - Unexpected TCP option.
4245 * When these conditions are not satisfied it drops into a standard
4246 * receive procedure patterned after RFC793 to handle all cases.
4247 * The first three cases are guaranteed by proper pred_flags setting,
4248 * the rest is checked inline. Fast processing is turned on in
4249 * tcp_data_queue when everything is OK.
4251 int tcp_rcv_established(struct sock *sk, struct sk_buff *skb,
4252 struct tcphdr *th, unsigned len)
4254 struct tcp_sock *tp = tcp_sk(sk);
4257 * Header prediction.
4258 * The code loosely follows the one in the famous
4259 * "30 instruction TCP receive" Van Jacobson mail.
4261 * Van's trick is to deposit buffers into socket queue
4262 * on a device interrupt, to call tcp_recv function
4263 * on the receive process context and checksum and copy
4264 * the buffer to user space. smart...
4266 * Our current scheme is not silly either but we take the
4267 * extra cost of the net_bh soft interrupt processing...
4268 * We do checksum and copy also but from device to kernel.
4271 tp->rx_opt.saw_tstamp = 0;
4273 /* pred_flags is 0xS?10 << 16 + snd_wnd
4274 * if header_prediction is to be made
4275 * 'S' will always be tp->tcp_header_len >> 2
4276 * '?' will be 0 for the fast path, otherwise pred_flags is 0 to
4277 * turn it off (when there are holes in the receive
4278 * space for instance)
4279 * PSH flag is ignored.
4282 if ((tcp_flag_word(th) & TCP_HP_BITS) == tp->pred_flags &&
4283 TCP_SKB_CB(skb)->seq == tp->rcv_nxt) {
4284 int tcp_header_len = tp->tcp_header_len;
4286 /* Timestamp header prediction: tcp_header_len
4287 * is automatically equal to th->doff*4 due to pred_flags
4291 /* Check timestamp */
4292 if (tcp_header_len == sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) {
4293 __be32 *ptr = (__be32 *)(th + 1);
4295 /* No? Slow path! */
4296 if (*ptr != htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16)
4297 | (TCPOPT_TIMESTAMP << 8) | TCPOLEN_TIMESTAMP))
4300 tp->rx_opt.saw_tstamp = 1;
4302 tp->rx_opt.rcv_tsval = ntohl(*ptr);
4304 tp->rx_opt.rcv_tsecr = ntohl(*ptr);
4306 /* If PAWS failed, check it more carefully in slow path */
4307 if ((s32)(tp->rx_opt.rcv_tsval - tp->rx_opt.ts_recent) < 0)
4310 /* DO NOT update ts_recent here, if checksum fails
4311 * and timestamp was corrupted part, it will result
4312 * in a hung connection since we will drop all
4313 * future packets due to the PAWS test.
4317 if (len <= tcp_header_len) {
4318 /* Bulk data transfer: sender */
4319 if (len == tcp_header_len) {
4320 /* Predicted packet is in window by definition.
4321 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
4322 * Hence, check seq<=rcv_wup reduces to:
4324 if (tcp_header_len ==
4325 (sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) &&
4326 tp->rcv_nxt == tp->rcv_wup)
4327 tcp_store_ts_recent(tp);
4329 /* We know that such packets are checksummed
4332 tcp_ack(sk, skb, 0);
4334 tcp_data_snd_check(sk);
4336 } else { /* Header too small */
4337 TCP_INC_STATS_BH(TCP_MIB_INERRS);
4342 int copied_early = 0;
4344 if (tp->copied_seq == tp->rcv_nxt &&
4345 len - tcp_header_len <= tp->ucopy.len) {
4346 #ifdef CONFIG_NET_DMA
4347 if (tcp_dma_try_early_copy(sk, skb, tcp_header_len)) {
4352 if (tp->ucopy.task == current && sock_owned_by_user(sk) && !copied_early) {
4353 __set_current_state(TASK_RUNNING);
4355 if (!tcp_copy_to_iovec(sk, skb, tcp_header_len))
4359 /* Predicted packet is in window by definition.
4360 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
4361 * Hence, check seq<=rcv_wup reduces to:
4363 if (tcp_header_len ==
4364 (sizeof(struct tcphdr) +
4365 TCPOLEN_TSTAMP_ALIGNED) &&
4366 tp->rcv_nxt == tp->rcv_wup)
4367 tcp_store_ts_recent(tp);
4369 tcp_rcv_rtt_measure_ts(sk, skb);
4371 __skb_pull(skb, tcp_header_len);
4372 tp->rcv_nxt = TCP_SKB_CB(skb)->end_seq;
4373 NET_INC_STATS_BH(LINUX_MIB_TCPHPHITSTOUSER);
4376 tcp_cleanup_rbuf(sk, skb->len);
4379 if (tcp_checksum_complete_user(sk, skb))
4382 /* Predicted packet is in window by definition.
4383 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
4384 * Hence, check seq<=rcv_wup reduces to:
4386 if (tcp_header_len ==
4387 (sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) &&
4388 tp->rcv_nxt == tp->rcv_wup)
4389 tcp_store_ts_recent(tp);
4391 tcp_rcv_rtt_measure_ts(sk, skb);
4393 if ((int)skb->truesize > sk->sk_forward_alloc)
4396 NET_INC_STATS_BH(LINUX_MIB_TCPHPHITS);
4398 /* Bulk data transfer: receiver */
4399 __skb_pull(skb,tcp_header_len);
4400 __skb_queue_tail(&sk->sk_receive_queue, skb);
4401 sk_stream_set_owner_r(skb, sk);
4402 tp->rcv_nxt = TCP_SKB_CB(skb)->end_seq;
4405 tcp_event_data_recv(sk, skb);
4407 if (TCP_SKB_CB(skb)->ack_seq != tp->snd_una) {
4408 /* Well, only one small jumplet in fast path... */
4409 tcp_ack(sk, skb, FLAG_DATA);
4410 tcp_data_snd_check(sk);
4411 if (!inet_csk_ack_scheduled(sk))
4415 __tcp_ack_snd_check(sk, 0);
4417 #ifdef CONFIG_NET_DMA
4419 __skb_queue_tail(&sk->sk_async_wait_queue, skb);
4425 sk->sk_data_ready(sk, 0);
4431 if (len < (th->doff<<2) || tcp_checksum_complete_user(sk, skb))
4435 * RFC1323: H1. Apply PAWS check first.
4437 if (tcp_fast_parse_options(skb, th, tp) && tp->rx_opt.saw_tstamp &&
4438 tcp_paws_discard(sk, skb)) {
4440 NET_INC_STATS_BH(LINUX_MIB_PAWSESTABREJECTED);
4441 tcp_send_dupack(sk, skb);
4444 /* Resets are accepted even if PAWS failed.
4446 ts_recent update must be made after we are sure
4447 that the packet is in window.
4452 * Standard slow path.
4455 if (!tcp_sequence(tp, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq)) {
4456 /* RFC793, page 37: "In all states except SYN-SENT, all reset
4457 * (RST) segments are validated by checking their SEQ-fields."
4458 * And page 69: "If an incoming segment is not acceptable,
4459 * an acknowledgment should be sent in reply (unless the RST bit
4460 * is set, if so drop the segment and return)".
4463 tcp_send_dupack(sk, skb);
4472 tcp_replace_ts_recent(tp, TCP_SKB_CB(skb)->seq);
4474 if (th->syn && !before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
4475 TCP_INC_STATS_BH(TCP_MIB_INERRS);
4476 NET_INC_STATS_BH(LINUX_MIB_TCPABORTONSYN);
4483 tcp_ack(sk, skb, FLAG_SLOWPATH);
4485 tcp_rcv_rtt_measure_ts(sk, skb);
4487 /* Process urgent data. */
4488 tcp_urg(sk, skb, th);
4490 /* step 7: process the segment text */
4491 tcp_data_queue(sk, skb);
4493 tcp_data_snd_check(sk);
4494 tcp_ack_snd_check(sk);
4498 TCP_INC_STATS_BH(TCP_MIB_INERRS);
4505 static int tcp_rcv_synsent_state_process(struct sock *sk, struct sk_buff *skb,
4506 struct tcphdr *th, unsigned len)
4508 struct tcp_sock *tp = tcp_sk(sk);
4509 struct inet_connection_sock *icsk = inet_csk(sk);
4510 int saved_clamp = tp->rx_opt.mss_clamp;
4512 tcp_parse_options(skb, &tp->rx_opt, 0);
4516 * "If the state is SYN-SENT then
4517 * first check the ACK bit
4518 * If the ACK bit is set
4519 * If SEG.ACK =< ISS, or SEG.ACK > SND.NXT, send
4520 * a reset (unless the RST bit is set, if so drop
4521 * the segment and return)"
4523 * We do not send data with SYN, so that RFC-correct
4526 if (TCP_SKB_CB(skb)->ack_seq != tp->snd_nxt)
4527 goto reset_and_undo;
4529 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
4530 !between(tp->rx_opt.rcv_tsecr, tp->retrans_stamp,
4532 NET_INC_STATS_BH(LINUX_MIB_PAWSACTIVEREJECTED);
4533 goto reset_and_undo;
4536 /* Now ACK is acceptable.
4538 * "If the RST bit is set
4539 * If the ACK was acceptable then signal the user "error:
4540 * connection reset", drop the segment, enter CLOSED state,
4541 * delete TCB, and return."
4550 * "fifth, if neither of the SYN or RST bits is set then
4551 * drop the segment and return."
4557 goto discard_and_undo;
4560 * "If the SYN bit is on ...
4561 * are acceptable then ...
4562 * (our SYN has been ACKed), change the connection
4563 * state to ESTABLISHED..."
4566 TCP_ECN_rcv_synack(tp, th);
4568 tp->snd_wl1 = TCP_SKB_CB(skb)->seq;
4569 tcp_ack(sk, skb, FLAG_SLOWPATH);
4571 /* Ok.. it's good. Set up sequence numbers and
4572 * move to established.
4574 tp->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
4575 tp->rcv_wup = TCP_SKB_CB(skb)->seq + 1;
4577 /* RFC1323: The window in SYN & SYN/ACK segments is
4580 tp->snd_wnd = ntohs(th->window);
4581 tcp_init_wl(tp, TCP_SKB_CB(skb)->ack_seq, TCP_SKB_CB(skb)->seq);
4583 if (!tp->rx_opt.wscale_ok) {
4584 tp->rx_opt.snd_wscale = tp->rx_opt.rcv_wscale = 0;
4585 tp->window_clamp = min(tp->window_clamp, 65535U);
4588 if (tp->rx_opt.saw_tstamp) {
4589 tp->rx_opt.tstamp_ok = 1;
4590 tp->tcp_header_len =
4591 sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED;
4592 tp->advmss -= TCPOLEN_TSTAMP_ALIGNED;
4593 tcp_store_ts_recent(tp);
4595 tp->tcp_header_len = sizeof(struct tcphdr);
4598 if (tp->rx_opt.sack_ok && sysctl_tcp_fack)
4599 tp->rx_opt.sack_ok |= 2;
4602 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
4603 tcp_initialize_rcv_mss(sk);
4605 /* Remember, tcp_poll() does not lock socket!
4606 * Change state from SYN-SENT only after copied_seq
4607 * is initialized. */
4608 tp->copied_seq = tp->rcv_nxt;
4610 tcp_set_state(sk, TCP_ESTABLISHED);
4612 security_inet_conn_established(sk, skb);
4614 /* Make sure socket is routed, for correct metrics. */
4615 icsk->icsk_af_ops->rebuild_header(sk);
4617 tcp_init_metrics(sk);
4619 tcp_init_congestion_control(sk);
4621 /* Prevent spurious tcp_cwnd_restart() on first data
4624 tp->lsndtime = tcp_time_stamp;
4626 tcp_init_buffer_space(sk);
4628 if (sock_flag(sk, SOCK_KEEPOPEN))
4629 inet_csk_reset_keepalive_timer(sk, keepalive_time_when(tp));
4631 if (!tp->rx_opt.snd_wscale)
4632 __tcp_fast_path_on(tp, tp->snd_wnd);
4636 if (!sock_flag(sk, SOCK_DEAD)) {
4637 sk->sk_state_change(sk);
4638 sk_wake_async(sk, 0, POLL_OUT);
4641 if (sk->sk_write_pending ||
4642 icsk->icsk_accept_queue.rskq_defer_accept ||
4643 icsk->icsk_ack.pingpong) {
4644 /* Save one ACK. Data will be ready after
4645 * several ticks, if write_pending is set.
4647 * It may be deleted, but with this feature tcpdumps
4648 * look so _wonderfully_ clever, that I was not able
4649 * to stand against the temptation 8) --ANK
4651 inet_csk_schedule_ack(sk);
4652 icsk->icsk_ack.lrcvtime = tcp_time_stamp;
4653 icsk->icsk_ack.ato = TCP_ATO_MIN;
4654 tcp_incr_quickack(sk);
4655 tcp_enter_quickack_mode(sk);
4656 inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK,
4657 TCP_DELACK_MAX, TCP_RTO_MAX);
4668 /* No ACK in the segment */
4672 * "If the RST bit is set
4674 * Otherwise (no ACK) drop the segment and return."
4677 goto discard_and_undo;
4681 if (tp->rx_opt.ts_recent_stamp && tp->rx_opt.saw_tstamp && tcp_paws_check(&tp->rx_opt, 0))
4682 goto discard_and_undo;
4685 /* We see SYN without ACK. It is attempt of
4686 * simultaneous connect with crossed SYNs.
4687 * Particularly, it can be connect to self.
4689 tcp_set_state(sk, TCP_SYN_RECV);
4691 if (tp->rx_opt.saw_tstamp) {
4692 tp->rx_opt.tstamp_ok = 1;
4693 tcp_store_ts_recent(tp);
4694 tp->tcp_header_len =
4695 sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED;
4697 tp->tcp_header_len = sizeof(struct tcphdr);
4700 tp->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
4701 tp->rcv_wup = TCP_SKB_CB(skb)->seq + 1;
4703 /* RFC1323: The window in SYN & SYN/ACK segments is
4706 tp->snd_wnd = ntohs(th->window);
4707 tp->snd_wl1 = TCP_SKB_CB(skb)->seq;
4708 tp->max_window = tp->snd_wnd;
4710 TCP_ECN_rcv_syn(tp, th);
4713 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
4714 tcp_initialize_rcv_mss(sk);
4717 tcp_send_synack(sk);
4719 /* Note, we could accept data and URG from this segment.
4720 * There are no obstacles to make this.
4722 * However, if we ignore data in ACKless segments sometimes,
4723 * we have no reasons to accept it sometimes.
4724 * Also, seems the code doing it in step6 of tcp_rcv_state_process
4725 * is not flawless. So, discard packet for sanity.
4726 * Uncomment this return to process the data.
4733 /* "fifth, if neither of the SYN or RST bits is set then
4734 * drop the segment and return."
4738 tcp_clear_options(&tp->rx_opt);
4739 tp->rx_opt.mss_clamp = saved_clamp;
4743 tcp_clear_options(&tp->rx_opt);
4744 tp->rx_opt.mss_clamp = saved_clamp;
4750 * This function implements the receiving procedure of RFC 793 for
4751 * all states except ESTABLISHED and TIME_WAIT.
4752 * It's called from both tcp_v4_rcv and tcp_v6_rcv and should be
4753 * address independent.
4756 int tcp_rcv_state_process(struct sock *sk, struct sk_buff *skb,
4757 struct tcphdr *th, unsigned len)
4759 struct tcp_sock *tp = tcp_sk(sk);
4760 struct inet_connection_sock *icsk = inet_csk(sk);
4763 tp->rx_opt.saw_tstamp = 0;
4765 switch (sk->sk_state) {
4777 if (icsk->icsk_af_ops->conn_request(sk, skb) < 0)
4780 /* Now we have several options: In theory there is
4781 * nothing else in the frame. KA9Q has an option to
4782 * send data with the syn, BSD accepts data with the
4783 * syn up to the [to be] advertised window and
4784 * Solaris 2.1 gives you a protocol error. For now
4785 * we just ignore it, that fits the spec precisely
4786 * and avoids incompatibilities. It would be nice in
4787 * future to drop through and process the data.
4789 * Now that TTCP is starting to be used we ought to
4791 * But, this leaves one open to an easy denial of
4792 * service attack, and SYN cookies can't defend
4793 * against this problem. So, we drop the data
4794 * in the interest of security over speed unless
4795 * it's still in use.
4803 queued = tcp_rcv_synsent_state_process(sk, skb, th, len);
4807 /* Do step6 onward by hand. */
4808 tcp_urg(sk, skb, th);
4810 tcp_data_snd_check(sk);
4814 if (tcp_fast_parse_options(skb, th, tp) && tp->rx_opt.saw_tstamp &&
4815 tcp_paws_discard(sk, skb)) {
4817 NET_INC_STATS_BH(LINUX_MIB_PAWSESTABREJECTED);
4818 tcp_send_dupack(sk, skb);
4821 /* Reset is accepted even if it did not pass PAWS. */
4824 /* step 1: check sequence number */
4825 if (!tcp_sequence(tp, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq)) {
4827 tcp_send_dupack(sk, skb);
4831 /* step 2: check RST bit */
4837 tcp_replace_ts_recent(tp, TCP_SKB_CB(skb)->seq);
4839 /* step 3: check security and precedence [ignored] */
4843 * Check for a SYN in window.
4845 if (th->syn && !before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
4846 NET_INC_STATS_BH(LINUX_MIB_TCPABORTONSYN);
4851 /* step 5: check the ACK field */
4853 int acceptable = tcp_ack(sk, skb, FLAG_SLOWPATH);
4855 switch (sk->sk_state) {
4858 tp->copied_seq = tp->rcv_nxt;
4860 tcp_set_state(sk, TCP_ESTABLISHED);
4861 sk->sk_state_change(sk);
4863 /* Note, that this wakeup is only for marginal
4864 * crossed SYN case. Passively open sockets
4865 * are not waked up, because sk->sk_sleep ==
4866 * NULL and sk->sk_socket == NULL.
4868 if (sk->sk_socket) {
4869 sk_wake_async(sk,0,POLL_OUT);
4872 tp->snd_una = TCP_SKB_CB(skb)->ack_seq;
4873 tp->snd_wnd = ntohs(th->window) <<
4874 tp->rx_opt.snd_wscale;
4875 tcp_init_wl(tp, TCP_SKB_CB(skb)->ack_seq,
4876 TCP_SKB_CB(skb)->seq);
4878 /* tcp_ack considers this ACK as duplicate
4879 * and does not calculate rtt.
4880 * Fix it at least with timestamps.
4882 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
4884 tcp_ack_saw_tstamp(sk, 0);
4886 if (tp->rx_opt.tstamp_ok)
4887 tp->advmss -= TCPOLEN_TSTAMP_ALIGNED;
4889 /* Make sure socket is routed, for
4892 icsk->icsk_af_ops->rebuild_header(sk);
4894 tcp_init_metrics(sk);
4896 tcp_init_congestion_control(sk);
4898 /* Prevent spurious tcp_cwnd_restart() on
4899 * first data packet.
4901 tp->lsndtime = tcp_time_stamp;
4904 tcp_initialize_rcv_mss(sk);
4905 tcp_init_buffer_space(sk);
4906 tcp_fast_path_on(tp);
4913 if (tp->snd_una == tp->write_seq) {
4914 tcp_set_state(sk, TCP_FIN_WAIT2);
4915 sk->sk_shutdown |= SEND_SHUTDOWN;
4916 dst_confirm(sk->sk_dst_cache);
4918 if (!sock_flag(sk, SOCK_DEAD))
4919 /* Wake up lingering close() */
4920 sk->sk_state_change(sk);
4924 if (tp->linger2 < 0 ||
4925 (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
4926 after(TCP_SKB_CB(skb)->end_seq - th->fin, tp->rcv_nxt))) {
4928 NET_INC_STATS_BH(LINUX_MIB_TCPABORTONDATA);
4932 tmo = tcp_fin_time(sk);
4933 if (tmo > TCP_TIMEWAIT_LEN) {
4934 inet_csk_reset_keepalive_timer(sk, tmo - TCP_TIMEWAIT_LEN);
4935 } else if (th->fin || sock_owned_by_user(sk)) {
4936 /* Bad case. We could lose such FIN otherwise.
4937 * It is not a big problem, but it looks confusing
4938 * and not so rare event. We still can lose it now,
4939 * if it spins in bh_lock_sock(), but it is really
4942 inet_csk_reset_keepalive_timer(sk, tmo);
4944 tcp_time_wait(sk, TCP_FIN_WAIT2, tmo);
4952 if (tp->snd_una == tp->write_seq) {
4953 tcp_time_wait(sk, TCP_TIME_WAIT, 0);
4959 if (tp->snd_una == tp->write_seq) {
4960 tcp_update_metrics(sk);
4969 /* step 6: check the URG bit */
4970 tcp_urg(sk, skb, th);
4972 /* step 7: process the segment text */
4973 switch (sk->sk_state) {
4974 case TCP_CLOSE_WAIT:
4977 if (!before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt))
4981 /* RFC 793 says to queue data in these states,
4982 * RFC 1122 says we MUST send a reset.
4983 * BSD 4.4 also does reset.
4985 if (sk->sk_shutdown & RCV_SHUTDOWN) {
4986 if (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
4987 after(TCP_SKB_CB(skb)->end_seq - th->fin, tp->rcv_nxt)) {
4988 NET_INC_STATS_BH(LINUX_MIB_TCPABORTONDATA);
4994 case TCP_ESTABLISHED:
4995 tcp_data_queue(sk, skb);
5000 /* tcp_data could move socket to TIME-WAIT */
5001 if (sk->sk_state != TCP_CLOSE) {
5002 tcp_data_snd_check(sk);
5003 tcp_ack_snd_check(sk);
5013 EXPORT_SYMBOL(sysctl_tcp_ecn);
5014 EXPORT_SYMBOL(sysctl_tcp_reordering);
5015 EXPORT_SYMBOL(tcp_parse_options);
5016 EXPORT_SYMBOL(tcp_rcv_established);
5017 EXPORT_SYMBOL(tcp_rcv_state_process);
5018 EXPORT_SYMBOL(tcp_initialize_rcv_mss);