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).
9 * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
10 * Mark Evans, <evansmp@uhura.aston.ac.uk>
11 * Corey Minyard <wf-rch!minyard@relay.EU.net>
12 * Florian La Roche, <flla@stud.uni-sb.de>
13 * Charles Hedrick, <hedrick@klinzhai.rutgers.edu>
14 * Linus Torvalds, <torvalds@cs.helsinki.fi>
15 * Alan Cox, <gw4pts@gw4pts.ampr.org>
16 * Matthew Dillon, <dillon@apollo.west.oic.com>
17 * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
18 * Jorge Cwik, <jorge@laser.satlink.net>
23 * Pedro Roque : Fast Retransmit/Recovery.
25 * Retransmit queue handled by TCP.
26 * Better retransmit timer handling.
27 * New congestion avoidance.
31 * Eric : Fast Retransmit.
32 * Randy Scott : MSS option defines.
33 * Eric Schenk : Fixes to slow start algorithm.
34 * Eric Schenk : Yet another double ACK bug.
35 * Eric Schenk : Delayed ACK bug fixes.
36 * Eric Schenk : Floyd style fast retrans war avoidance.
37 * David S. Miller : Don't allow zero congestion window.
38 * Eric Schenk : Fix retransmitter so that it sends
39 * next packet on ack of previous packet.
40 * Andi Kleen : Moved open_request checking here
41 * and process RSTs for open_requests.
42 * Andi Kleen : Better prune_queue, and other fixes.
43 * Andrey Savochkin: Fix RTT measurements in the presence of
45 * Andrey Savochkin: Check sequence numbers correctly when
46 * removing SACKs due to in sequence incoming
48 * Andi Kleen: Make sure we never ack data there is not
49 * enough room for. Also make this condition
50 * a fatal error if it might still happen.
51 * Andi Kleen: Add tcp_measure_rcv_mss to make
52 * connections with MSS<min(MTU,ann. MSS)
53 * work without delayed acks.
54 * Andi Kleen: Process packets with PSH set in the
56 * J Hadi Salim: ECN support
59 * Panu Kuhlberg: Experimental audit of TCP (re)transmission
60 * engine. Lots of bugs are found.
61 * Pasi Sarolahti: F-RTO for dealing with spurious RTOs
64 #define pr_fmt(fmt) "TCP: " fmt
67 #include <linux/slab.h>
68 #include <linux/module.h>
69 #include <linux/sysctl.h>
70 #include <linux/kernel.h>
71 #include <linux/prefetch.h>
74 #include <net/inet_common.h>
75 #include <linux/ipsec.h>
76 #include <asm/unaligned.h>
77 #include <linux/errqueue.h>
79 int sysctl_tcp_timestamps __read_mostly = 1;
80 int sysctl_tcp_window_scaling __read_mostly = 1;
81 int sysctl_tcp_sack __read_mostly = 1;
82 int sysctl_tcp_fack __read_mostly = 1;
83 int sysctl_tcp_reordering __read_mostly = TCP_FASTRETRANS_THRESH;
84 int sysctl_tcp_max_reordering __read_mostly = 300;
85 EXPORT_SYMBOL(sysctl_tcp_reordering);
86 int sysctl_tcp_dsack __read_mostly = 1;
87 int sysctl_tcp_app_win __read_mostly = 31;
88 int sysctl_tcp_adv_win_scale __read_mostly = 1;
89 EXPORT_SYMBOL(sysctl_tcp_adv_win_scale);
91 /* rfc5961 challenge ack rate limiting */
92 int sysctl_tcp_challenge_ack_limit = 100;
94 int sysctl_tcp_stdurg __read_mostly;
95 int sysctl_tcp_rfc1337 __read_mostly;
96 int sysctl_tcp_max_orphans __read_mostly = NR_FILE;
97 int sysctl_tcp_frto __read_mostly = 2;
99 int sysctl_tcp_thin_dupack __read_mostly;
101 int sysctl_tcp_moderate_rcvbuf __read_mostly = 1;
102 int sysctl_tcp_early_retrans __read_mostly = 3;
103 int sysctl_tcp_invalid_ratelimit __read_mostly = HZ/2;
105 #define FLAG_DATA 0x01 /* Incoming frame contained data. */
106 #define FLAG_WIN_UPDATE 0x02 /* Incoming ACK was a window update. */
107 #define FLAG_DATA_ACKED 0x04 /* This ACK acknowledged new data. */
108 #define FLAG_RETRANS_DATA_ACKED 0x08 /* "" "" some of which was retransmitted. */
109 #define FLAG_SYN_ACKED 0x10 /* This ACK acknowledged SYN. */
110 #define FLAG_DATA_SACKED 0x20 /* New SACK. */
111 #define FLAG_ECE 0x40 /* ECE in this ACK */
112 #define FLAG_LOST_RETRANS 0x80 /* This ACK marks some retransmission lost */
113 #define FLAG_SLOWPATH 0x100 /* Do not skip RFC checks for window update.*/
114 #define FLAG_ORIG_SACK_ACKED 0x200 /* Never retransmitted data are (s)acked */
115 #define FLAG_SND_UNA_ADVANCED 0x400 /* Snd_una was changed (!= FLAG_DATA_ACKED) */
116 #define FLAG_DSACKING_ACK 0x800 /* SACK blocks contained D-SACK info */
117 #define FLAG_SACK_RENEGING 0x2000 /* snd_una advanced to a sacked seq */
118 #define FLAG_UPDATE_TS_RECENT 0x4000 /* tcp_replace_ts_recent() */
120 #define FLAG_ACKED (FLAG_DATA_ACKED|FLAG_SYN_ACKED)
121 #define FLAG_NOT_DUP (FLAG_DATA|FLAG_WIN_UPDATE|FLAG_ACKED)
122 #define FLAG_CA_ALERT (FLAG_DATA_SACKED|FLAG_ECE)
123 #define FLAG_FORWARD_PROGRESS (FLAG_ACKED|FLAG_DATA_SACKED)
125 #define TCP_REMNANT (TCP_FLAG_FIN|TCP_FLAG_URG|TCP_FLAG_SYN|TCP_FLAG_PSH)
126 #define TCP_HP_BITS (~(TCP_RESERVED_BITS|TCP_FLAG_PSH))
128 /* Adapt the MSS value used to make delayed ack decision to the
131 static void tcp_measure_rcv_mss(struct sock *sk, const struct sk_buff *skb)
133 struct inet_connection_sock *icsk = inet_csk(sk);
134 const unsigned int lss = icsk->icsk_ack.last_seg_size;
137 icsk->icsk_ack.last_seg_size = 0;
139 /* skb->len may jitter because of SACKs, even if peer
140 * sends good full-sized frames.
142 len = skb_shinfo(skb)->gso_size ? : skb->len;
143 if (len >= icsk->icsk_ack.rcv_mss) {
144 icsk->icsk_ack.rcv_mss = len;
146 /* Otherwise, we make more careful check taking into account,
147 * that SACKs block is variable.
149 * "len" is invariant segment length, including TCP header.
151 len += skb->data - skb_transport_header(skb);
152 if (len >= TCP_MSS_DEFAULT + sizeof(struct tcphdr) ||
153 /* If PSH is not set, packet should be
154 * full sized, provided peer TCP is not badly broken.
155 * This observation (if it is correct 8)) allows
156 * to handle super-low mtu links fairly.
158 (len >= TCP_MIN_MSS + sizeof(struct tcphdr) &&
159 !(tcp_flag_word(tcp_hdr(skb)) & TCP_REMNANT))) {
160 /* Subtract also invariant (if peer is RFC compliant),
161 * tcp header plus fixed timestamp option length.
162 * Resulting "len" is MSS free of SACK jitter.
164 len -= tcp_sk(sk)->tcp_header_len;
165 icsk->icsk_ack.last_seg_size = len;
167 icsk->icsk_ack.rcv_mss = len;
171 if (icsk->icsk_ack.pending & ICSK_ACK_PUSHED)
172 icsk->icsk_ack.pending |= ICSK_ACK_PUSHED2;
173 icsk->icsk_ack.pending |= ICSK_ACK_PUSHED;
177 static void tcp_incr_quickack(struct sock *sk)
179 struct inet_connection_sock *icsk = inet_csk(sk);
180 unsigned int quickacks = tcp_sk(sk)->rcv_wnd / (2 * icsk->icsk_ack.rcv_mss);
184 if (quickacks > icsk->icsk_ack.quick)
185 icsk->icsk_ack.quick = min(quickacks, TCP_MAX_QUICKACKS);
188 static void tcp_enter_quickack_mode(struct sock *sk)
190 struct inet_connection_sock *icsk = inet_csk(sk);
191 tcp_incr_quickack(sk);
192 icsk->icsk_ack.pingpong = 0;
193 icsk->icsk_ack.ato = TCP_ATO_MIN;
196 /* Send ACKs quickly, if "quick" count is not exhausted
197 * and the session is not interactive.
200 static inline bool tcp_in_quickack_mode(const struct sock *sk)
202 const struct inet_connection_sock *icsk = inet_csk(sk);
204 return icsk->icsk_ack.quick && !icsk->icsk_ack.pingpong;
207 static void tcp_ecn_queue_cwr(struct tcp_sock *tp)
209 if (tp->ecn_flags & TCP_ECN_OK)
210 tp->ecn_flags |= TCP_ECN_QUEUE_CWR;
213 static void tcp_ecn_accept_cwr(struct tcp_sock *tp, const struct sk_buff *skb)
215 if (tcp_hdr(skb)->cwr)
216 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR;
219 static void tcp_ecn_withdraw_cwr(struct tcp_sock *tp)
221 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR;
224 static void __tcp_ecn_check_ce(struct tcp_sock *tp, const struct sk_buff *skb)
226 switch (TCP_SKB_CB(skb)->ip_dsfield & INET_ECN_MASK) {
227 case INET_ECN_NOT_ECT:
228 /* Funny extension: if ECT is not set on a segment,
229 * and we already seen ECT on a previous segment,
230 * it is probably a retransmit.
232 if (tp->ecn_flags & TCP_ECN_SEEN)
233 tcp_enter_quickack_mode((struct sock *)tp);
236 if (tcp_ca_needs_ecn((struct sock *)tp))
237 tcp_ca_event((struct sock *)tp, CA_EVENT_ECN_IS_CE);
239 if (!(tp->ecn_flags & TCP_ECN_DEMAND_CWR)) {
240 /* Better not delay acks, sender can have a very low cwnd */
241 tcp_enter_quickack_mode((struct sock *)tp);
242 tp->ecn_flags |= TCP_ECN_DEMAND_CWR;
244 tp->ecn_flags |= TCP_ECN_SEEN;
247 if (tcp_ca_needs_ecn((struct sock *)tp))
248 tcp_ca_event((struct sock *)tp, CA_EVENT_ECN_NO_CE);
249 tp->ecn_flags |= TCP_ECN_SEEN;
254 static void tcp_ecn_check_ce(struct tcp_sock *tp, const struct sk_buff *skb)
256 if (tp->ecn_flags & TCP_ECN_OK)
257 __tcp_ecn_check_ce(tp, skb);
260 static void tcp_ecn_rcv_synack(struct tcp_sock *tp, const struct tcphdr *th)
262 if ((tp->ecn_flags & TCP_ECN_OK) && (!th->ece || th->cwr))
263 tp->ecn_flags &= ~TCP_ECN_OK;
266 static void tcp_ecn_rcv_syn(struct tcp_sock *tp, const struct tcphdr *th)
268 if ((tp->ecn_flags & TCP_ECN_OK) && (!th->ece || !th->cwr))
269 tp->ecn_flags &= ~TCP_ECN_OK;
272 static bool tcp_ecn_rcv_ecn_echo(const struct tcp_sock *tp, const struct tcphdr *th)
274 if (th->ece && !th->syn && (tp->ecn_flags & TCP_ECN_OK))
279 /* Buffer size and advertised window tuning.
281 * 1. Tuning sk->sk_sndbuf, when connection enters established state.
284 static void tcp_sndbuf_expand(struct sock *sk)
286 const struct tcp_sock *tp = tcp_sk(sk);
290 /* Worst case is non GSO/TSO : each frame consumes one skb
291 * and skb->head is kmalloced using power of two area of memory
293 per_mss = max_t(u32, tp->rx_opt.mss_clamp, tp->mss_cache) +
295 SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
297 per_mss = roundup_pow_of_two(per_mss) +
298 SKB_DATA_ALIGN(sizeof(struct sk_buff));
300 nr_segs = max_t(u32, TCP_INIT_CWND, tp->snd_cwnd);
301 nr_segs = max_t(u32, nr_segs, tp->reordering + 1);
303 /* Fast Recovery (RFC 5681 3.2) :
304 * Cubic needs 1.7 factor, rounded to 2 to include
305 * extra cushion (application might react slowly to POLLOUT)
307 sndmem = 2 * nr_segs * per_mss;
309 if (sk->sk_sndbuf < sndmem)
310 sk->sk_sndbuf = min(sndmem, sysctl_tcp_wmem[2]);
313 /* 2. Tuning advertised window (window_clamp, rcv_ssthresh)
315 * All tcp_full_space() is split to two parts: "network" buffer, allocated
316 * forward and advertised in receiver window (tp->rcv_wnd) and
317 * "application buffer", required to isolate scheduling/application
318 * latencies from network.
319 * window_clamp is maximal advertised window. It can be less than
320 * tcp_full_space(), in this case tcp_full_space() - window_clamp
321 * is reserved for "application" buffer. The less window_clamp is
322 * the smoother our behaviour from viewpoint of network, but the lower
323 * throughput and the higher sensitivity of the connection to losses. 8)
325 * rcv_ssthresh is more strict window_clamp used at "slow start"
326 * phase to predict further behaviour of this connection.
327 * It is used for two goals:
328 * - to enforce header prediction at sender, even when application
329 * requires some significant "application buffer". It is check #1.
330 * - to prevent pruning of receive queue because of misprediction
331 * of receiver window. Check #2.
333 * The scheme does not work when sender sends good segments opening
334 * window and then starts to feed us spaghetti. But it should work
335 * in common situations. Otherwise, we have to rely on queue collapsing.
338 /* Slow part of check#2. */
339 static int __tcp_grow_window(const struct sock *sk, const struct sk_buff *skb)
341 struct tcp_sock *tp = tcp_sk(sk);
343 int truesize = tcp_win_from_space(skb->truesize) >> 1;
344 int window = tcp_win_from_space(sysctl_tcp_rmem[2]) >> 1;
346 while (tp->rcv_ssthresh <= window) {
347 if (truesize <= skb->len)
348 return 2 * inet_csk(sk)->icsk_ack.rcv_mss;
356 static void tcp_grow_window(struct sock *sk, const struct sk_buff *skb)
358 struct tcp_sock *tp = tcp_sk(sk);
361 if (tp->rcv_ssthresh < tp->window_clamp &&
362 (int)tp->rcv_ssthresh < tcp_space(sk) &&
363 !tcp_under_memory_pressure(sk)) {
366 /* Check #2. Increase window, if skb with such overhead
367 * will fit to rcvbuf in future.
369 if (tcp_win_from_space(skb->truesize) <= skb->len)
370 incr = 2 * tp->advmss;
372 incr = __tcp_grow_window(sk, skb);
375 incr = max_t(int, incr, 2 * skb->len);
376 tp->rcv_ssthresh = min(tp->rcv_ssthresh + incr,
378 inet_csk(sk)->icsk_ack.quick |= 1;
383 /* 3. Tuning rcvbuf, when connection enters established state. */
384 static void tcp_fixup_rcvbuf(struct sock *sk)
386 u32 mss = tcp_sk(sk)->advmss;
389 rcvmem = 2 * SKB_TRUESIZE(mss + MAX_TCP_HEADER) *
390 tcp_default_init_rwnd(mss);
392 /* Dynamic Right Sizing (DRS) has 2 to 3 RTT latency
393 * Allow enough cushion so that sender is not limited by our window
395 if (sysctl_tcp_moderate_rcvbuf)
398 if (sk->sk_rcvbuf < rcvmem)
399 sk->sk_rcvbuf = min(rcvmem, sysctl_tcp_rmem[2]);
402 /* 4. Try to fixup all. It is made immediately after connection enters
405 void tcp_init_buffer_space(struct sock *sk)
407 struct tcp_sock *tp = tcp_sk(sk);
410 if (!(sk->sk_userlocks & SOCK_RCVBUF_LOCK))
411 tcp_fixup_rcvbuf(sk);
412 if (!(sk->sk_userlocks & SOCK_SNDBUF_LOCK))
413 tcp_sndbuf_expand(sk);
415 tp->rcvq_space.space = tp->rcv_wnd;
416 tp->rcvq_space.time = tcp_time_stamp;
417 tp->rcvq_space.seq = tp->copied_seq;
419 maxwin = tcp_full_space(sk);
421 if (tp->window_clamp >= maxwin) {
422 tp->window_clamp = maxwin;
424 if (sysctl_tcp_app_win && maxwin > 4 * tp->advmss)
425 tp->window_clamp = max(maxwin -
426 (maxwin >> sysctl_tcp_app_win),
430 /* Force reservation of one segment. */
431 if (sysctl_tcp_app_win &&
432 tp->window_clamp > 2 * tp->advmss &&
433 tp->window_clamp + tp->advmss > maxwin)
434 tp->window_clamp = max(2 * tp->advmss, maxwin - tp->advmss);
436 tp->rcv_ssthresh = min(tp->rcv_ssthresh, tp->window_clamp);
437 tp->snd_cwnd_stamp = tcp_time_stamp;
440 /* 5. Recalculate window clamp after socket hit its memory bounds. */
441 static void tcp_clamp_window(struct sock *sk)
443 struct tcp_sock *tp = tcp_sk(sk);
444 struct inet_connection_sock *icsk = inet_csk(sk);
446 icsk->icsk_ack.quick = 0;
448 if (sk->sk_rcvbuf < sysctl_tcp_rmem[2] &&
449 !(sk->sk_userlocks & SOCK_RCVBUF_LOCK) &&
450 !tcp_under_memory_pressure(sk) &&
451 sk_memory_allocated(sk) < sk_prot_mem_limits(sk, 0)) {
452 sk->sk_rcvbuf = min(atomic_read(&sk->sk_rmem_alloc),
455 if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf)
456 tp->rcv_ssthresh = min(tp->window_clamp, 2U * tp->advmss);
459 /* Initialize RCV_MSS value.
460 * RCV_MSS is an our guess about MSS used by the peer.
461 * We haven't any direct information about the MSS.
462 * It's better to underestimate the RCV_MSS rather than overestimate.
463 * Overestimations make us ACKing less frequently than needed.
464 * Underestimations are more easy to detect and fix by tcp_measure_rcv_mss().
466 void tcp_initialize_rcv_mss(struct sock *sk)
468 const struct tcp_sock *tp = tcp_sk(sk);
469 unsigned int hint = min_t(unsigned int, tp->advmss, tp->mss_cache);
471 hint = min(hint, tp->rcv_wnd / 2);
472 hint = min(hint, TCP_MSS_DEFAULT);
473 hint = max(hint, TCP_MIN_MSS);
475 inet_csk(sk)->icsk_ack.rcv_mss = hint;
477 EXPORT_SYMBOL(tcp_initialize_rcv_mss);
479 /* Receiver "autotuning" code.
481 * The algorithm for RTT estimation w/o timestamps is based on
482 * Dynamic Right-Sizing (DRS) by Wu Feng and Mike Fisk of LANL.
483 * <http://public.lanl.gov/radiant/pubs.html#DRS>
485 * More detail on this code can be found at
486 * <http://staff.psc.edu/jheffner/>,
487 * though this reference is out of date. A new paper
490 static void tcp_rcv_rtt_update(struct tcp_sock *tp, u32 sample, int win_dep)
492 u32 new_sample = tp->rcv_rtt_est.rtt;
498 if (new_sample != 0) {
499 /* If we sample in larger samples in the non-timestamp
500 * case, we could grossly overestimate the RTT especially
501 * with chatty applications or bulk transfer apps which
502 * are stalled on filesystem I/O.
504 * Also, since we are only going for a minimum in the
505 * non-timestamp case, we do not smooth things out
506 * else with timestamps disabled convergence takes too
510 m -= (new_sample >> 3);
518 /* No previous measure. */
522 if (tp->rcv_rtt_est.rtt != new_sample)
523 tp->rcv_rtt_est.rtt = new_sample;
526 static inline void tcp_rcv_rtt_measure(struct tcp_sock *tp)
528 if (tp->rcv_rtt_est.time == 0)
530 if (before(tp->rcv_nxt, tp->rcv_rtt_est.seq))
532 tcp_rcv_rtt_update(tp, tcp_time_stamp - tp->rcv_rtt_est.time, 1);
535 tp->rcv_rtt_est.seq = tp->rcv_nxt + tp->rcv_wnd;
536 tp->rcv_rtt_est.time = tcp_time_stamp;
539 static inline void tcp_rcv_rtt_measure_ts(struct sock *sk,
540 const struct sk_buff *skb)
542 struct tcp_sock *tp = tcp_sk(sk);
543 if (tp->rx_opt.rcv_tsecr &&
544 (TCP_SKB_CB(skb)->end_seq -
545 TCP_SKB_CB(skb)->seq >= inet_csk(sk)->icsk_ack.rcv_mss))
546 tcp_rcv_rtt_update(tp, tcp_time_stamp - tp->rx_opt.rcv_tsecr, 0);
550 * This function should be called every time data is copied to user space.
551 * It calculates the appropriate TCP receive buffer space.
553 void tcp_rcv_space_adjust(struct sock *sk)
555 struct tcp_sock *tp = tcp_sk(sk);
559 time = tcp_time_stamp - tp->rcvq_space.time;
560 if (time < (tp->rcv_rtt_est.rtt >> 3) || tp->rcv_rtt_est.rtt == 0)
563 /* Number of bytes copied to user in last RTT */
564 copied = tp->copied_seq - tp->rcvq_space.seq;
565 if (copied <= tp->rcvq_space.space)
569 * copied = bytes received in previous RTT, our base window
570 * To cope with packet losses, we need a 2x factor
571 * To cope with slow start, and sender growing its cwin by 100 %
572 * every RTT, we need a 4x factor, because the ACK we are sending
573 * now is for the next RTT, not the current one :
574 * <prev RTT . ><current RTT .. ><next RTT .... >
577 if (sysctl_tcp_moderate_rcvbuf &&
578 !(sk->sk_userlocks & SOCK_RCVBUF_LOCK)) {
579 int rcvwin, rcvmem, rcvbuf;
581 /* minimal window to cope with packet losses, assuming
582 * steady state. Add some cushion because of small variations.
584 rcvwin = (copied << 1) + 16 * tp->advmss;
586 /* If rate increased by 25%,
587 * assume slow start, rcvwin = 3 * copied
588 * If rate increased by 50%,
589 * assume sender can use 2x growth, rcvwin = 4 * copied
592 tp->rcvq_space.space + (tp->rcvq_space.space >> 2)) {
594 tp->rcvq_space.space + (tp->rcvq_space.space >> 1))
597 rcvwin += (rcvwin >> 1);
600 rcvmem = SKB_TRUESIZE(tp->advmss + MAX_TCP_HEADER);
601 while (tcp_win_from_space(rcvmem) < tp->advmss)
604 rcvbuf = min(rcvwin / tp->advmss * rcvmem, sysctl_tcp_rmem[2]);
605 if (rcvbuf > sk->sk_rcvbuf) {
606 sk->sk_rcvbuf = rcvbuf;
608 /* Make the window clamp follow along. */
609 tp->window_clamp = rcvwin;
612 tp->rcvq_space.space = copied;
615 tp->rcvq_space.seq = tp->copied_seq;
616 tp->rcvq_space.time = tcp_time_stamp;
619 /* There is something which you must keep in mind when you analyze the
620 * behavior of the tp->ato delayed ack timeout interval. When a
621 * connection starts up, we want to ack as quickly as possible. The
622 * problem is that "good" TCP's do slow start at the beginning of data
623 * transmission. The means that until we send the first few ACK's the
624 * sender will sit on his end and only queue most of his data, because
625 * he can only send snd_cwnd unacked packets at any given time. For
626 * each ACK we send, he increments snd_cwnd and transmits more of his
629 static void tcp_event_data_recv(struct sock *sk, struct sk_buff *skb)
631 struct tcp_sock *tp = tcp_sk(sk);
632 struct inet_connection_sock *icsk = inet_csk(sk);
635 inet_csk_schedule_ack(sk);
637 tcp_measure_rcv_mss(sk, skb);
639 tcp_rcv_rtt_measure(tp);
641 now = tcp_time_stamp;
643 if (!icsk->icsk_ack.ato) {
644 /* The _first_ data packet received, initialize
645 * delayed ACK engine.
647 tcp_incr_quickack(sk);
648 icsk->icsk_ack.ato = TCP_ATO_MIN;
650 int m = now - icsk->icsk_ack.lrcvtime;
652 if (m <= TCP_ATO_MIN / 2) {
653 /* The fastest case is the first. */
654 icsk->icsk_ack.ato = (icsk->icsk_ack.ato >> 1) + TCP_ATO_MIN / 2;
655 } else if (m < icsk->icsk_ack.ato) {
656 icsk->icsk_ack.ato = (icsk->icsk_ack.ato >> 1) + m;
657 if (icsk->icsk_ack.ato > icsk->icsk_rto)
658 icsk->icsk_ack.ato = icsk->icsk_rto;
659 } else if (m > icsk->icsk_rto) {
660 /* Too long gap. Apparently sender failed to
661 * restart window, so that we send ACKs quickly.
663 tcp_incr_quickack(sk);
667 icsk->icsk_ack.lrcvtime = now;
669 tcp_ecn_check_ce(tp, skb);
672 tcp_grow_window(sk, skb);
675 /* Called to compute a smoothed rtt estimate. The data fed to this
676 * routine either comes from timestamps, or from segments that were
677 * known _not_ to have been retransmitted [see Karn/Partridge
678 * Proceedings SIGCOMM 87]. The algorithm is from the SIGCOMM 88
679 * piece by Van Jacobson.
680 * NOTE: the next three routines used to be one big routine.
681 * To save cycles in the RFC 1323 implementation it was better to break
682 * it up into three procedures. -- erics
684 static void tcp_rtt_estimator(struct sock *sk, long mrtt_us)
686 struct tcp_sock *tp = tcp_sk(sk);
687 long m = mrtt_us; /* RTT */
688 u32 srtt = tp->srtt_us;
690 /* The following amusing code comes from Jacobson's
691 * article in SIGCOMM '88. Note that rtt and mdev
692 * are scaled versions of rtt and mean deviation.
693 * This is designed to be as fast as possible
694 * m stands for "measurement".
696 * On a 1990 paper the rto value is changed to:
697 * RTO = rtt + 4 * mdev
699 * Funny. This algorithm seems to be very broken.
700 * These formulae increase RTO, when it should be decreased, increase
701 * too slowly, when it should be increased quickly, decrease too quickly
702 * etc. I guess in BSD RTO takes ONE value, so that it is absolutely
703 * does not matter how to _calculate_ it. Seems, it was trap
704 * that VJ failed to avoid. 8)
707 m -= (srtt >> 3); /* m is now error in rtt est */
708 srtt += m; /* rtt = 7/8 rtt + 1/8 new */
710 m = -m; /* m is now abs(error) */
711 m -= (tp->mdev_us >> 2); /* similar update on mdev */
712 /* This is similar to one of Eifel findings.
713 * Eifel blocks mdev updates when rtt decreases.
714 * This solution is a bit different: we use finer gain
715 * for mdev in this case (alpha*beta).
716 * Like Eifel it also prevents growth of rto,
717 * but also it limits too fast rto decreases,
718 * happening in pure Eifel.
723 m -= (tp->mdev_us >> 2); /* similar update on mdev */
725 tp->mdev_us += m; /* mdev = 3/4 mdev + 1/4 new */
726 if (tp->mdev_us > tp->mdev_max_us) {
727 tp->mdev_max_us = tp->mdev_us;
728 if (tp->mdev_max_us > tp->rttvar_us)
729 tp->rttvar_us = tp->mdev_max_us;
731 if (after(tp->snd_una, tp->rtt_seq)) {
732 if (tp->mdev_max_us < tp->rttvar_us)
733 tp->rttvar_us -= (tp->rttvar_us - tp->mdev_max_us) >> 2;
734 tp->rtt_seq = tp->snd_nxt;
735 tp->mdev_max_us = tcp_rto_min_us(sk);
738 /* no previous measure. */
739 srtt = m << 3; /* take the measured time to be rtt */
740 tp->mdev_us = m << 1; /* make sure rto = 3*rtt */
741 tp->rttvar_us = max(tp->mdev_us, tcp_rto_min_us(sk));
742 tp->mdev_max_us = tp->rttvar_us;
743 tp->rtt_seq = tp->snd_nxt;
745 tp->srtt_us = max(1U, srtt);
748 /* Set the sk_pacing_rate to allow proper sizing of TSO packets.
749 * Note: TCP stack does not yet implement pacing.
750 * FQ packet scheduler can be used to implement cheap but effective
751 * TCP pacing, to smooth the burst on large writes when packets
752 * in flight is significantly lower than cwnd (or rwin)
754 static void tcp_update_pacing_rate(struct sock *sk)
756 const struct tcp_sock *tp = tcp_sk(sk);
759 /* set sk_pacing_rate to 200 % of current rate (mss * cwnd / srtt) */
760 rate = (u64)tp->mss_cache * 2 * (USEC_PER_SEC << 3);
762 rate *= max(tp->snd_cwnd, tp->packets_out);
764 if (likely(tp->srtt_us))
765 do_div(rate, tp->srtt_us);
767 /* ACCESS_ONCE() is needed because sch_fq fetches sk_pacing_rate
768 * without any lock. We want to make sure compiler wont store
769 * intermediate values in this location.
771 ACCESS_ONCE(sk->sk_pacing_rate) = min_t(u64, rate,
772 sk->sk_max_pacing_rate);
775 /* Calculate rto without backoff. This is the second half of Van Jacobson's
776 * routine referred to above.
778 static void tcp_set_rto(struct sock *sk)
780 const struct tcp_sock *tp = tcp_sk(sk);
781 /* Old crap is replaced with new one. 8)
784 * 1. If rtt variance happened to be less 50msec, it is hallucination.
785 * It cannot be less due to utterly erratic ACK generation made
786 * at least by solaris and freebsd. "Erratic ACKs" has _nothing_
787 * to do with delayed acks, because at cwnd>2 true delack timeout
788 * is invisible. Actually, Linux-2.4 also generates erratic
789 * ACKs in some circumstances.
791 inet_csk(sk)->icsk_rto = __tcp_set_rto(tp);
793 /* 2. Fixups made earlier cannot be right.
794 * If we do not estimate RTO correctly without them,
795 * all the algo is pure shit and should be replaced
796 * with correct one. It is exactly, which we pretend to do.
799 /* NOTE: clamping at TCP_RTO_MIN is not required, current algo
800 * guarantees that rto is higher.
805 __u32 tcp_init_cwnd(const struct tcp_sock *tp, const struct dst_entry *dst)
807 __u32 cwnd = (dst ? dst_metric(dst, RTAX_INITCWND) : 0);
810 cwnd = TCP_INIT_CWND;
811 return min_t(__u32, cwnd, tp->snd_cwnd_clamp);
815 * Packet counting of FACK is based on in-order assumptions, therefore TCP
816 * disables it when reordering is detected
818 void tcp_disable_fack(struct tcp_sock *tp)
820 /* RFC3517 uses different metric in lost marker => reset on change */
822 tp->lost_skb_hint = NULL;
823 tp->rx_opt.sack_ok &= ~TCP_FACK_ENABLED;
826 /* Take a notice that peer is sending D-SACKs */
827 static void tcp_dsack_seen(struct tcp_sock *tp)
829 tp->rx_opt.sack_ok |= TCP_DSACK_SEEN;
832 static void tcp_update_reordering(struct sock *sk, const int metric,
835 struct tcp_sock *tp = tcp_sk(sk);
836 if (metric > tp->reordering) {
839 tp->reordering = min(sysctl_tcp_max_reordering, metric);
841 /* This exciting event is worth to be remembered. 8) */
843 mib_idx = LINUX_MIB_TCPTSREORDER;
844 else if (tcp_is_reno(tp))
845 mib_idx = LINUX_MIB_TCPRENOREORDER;
846 else if (tcp_is_fack(tp))
847 mib_idx = LINUX_MIB_TCPFACKREORDER;
849 mib_idx = LINUX_MIB_TCPSACKREORDER;
851 NET_INC_STATS_BH(sock_net(sk), mib_idx);
852 #if FASTRETRANS_DEBUG > 1
853 pr_debug("Disorder%d %d %u f%u s%u rr%d\n",
854 tp->rx_opt.sack_ok, inet_csk(sk)->icsk_ca_state,
858 tp->undo_marker ? tp->undo_retrans : 0);
860 tcp_disable_fack(tp);
864 tcp_disable_early_retrans(tp);
867 /* This must be called before lost_out is incremented */
868 static void tcp_verify_retransmit_hint(struct tcp_sock *tp, struct sk_buff *skb)
870 if (!tp->retransmit_skb_hint ||
871 before(TCP_SKB_CB(skb)->seq,
872 TCP_SKB_CB(tp->retransmit_skb_hint)->seq))
873 tp->retransmit_skb_hint = skb;
876 after(TCP_SKB_CB(skb)->end_seq, tp->retransmit_high))
877 tp->retransmit_high = TCP_SKB_CB(skb)->end_seq;
880 static void tcp_skb_mark_lost(struct tcp_sock *tp, struct sk_buff *skb)
882 if (!(TCP_SKB_CB(skb)->sacked & (TCPCB_LOST|TCPCB_SACKED_ACKED))) {
883 tcp_verify_retransmit_hint(tp, skb);
885 tp->lost_out += tcp_skb_pcount(skb);
886 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
890 static void tcp_skb_mark_lost_uncond_verify(struct tcp_sock *tp,
893 tcp_verify_retransmit_hint(tp, skb);
895 if (!(TCP_SKB_CB(skb)->sacked & (TCPCB_LOST|TCPCB_SACKED_ACKED))) {
896 tp->lost_out += tcp_skb_pcount(skb);
897 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
901 /* This procedure tags the retransmission queue when SACKs arrive.
903 * We have three tag bits: SACKED(S), RETRANS(R) and LOST(L).
904 * Packets in queue with these bits set are counted in variables
905 * sacked_out, retrans_out and lost_out, correspondingly.
907 * Valid combinations are:
908 * Tag InFlight Description
909 * 0 1 - orig segment is in flight.
910 * S 0 - nothing flies, orig reached receiver.
911 * L 0 - nothing flies, orig lost by net.
912 * R 2 - both orig and retransmit are in flight.
913 * L|R 1 - orig is lost, retransmit is in flight.
914 * S|R 1 - orig reached receiver, retrans is still in flight.
915 * (L|S|R is logically valid, it could occur when L|R is sacked,
916 * but it is equivalent to plain S and code short-curcuits it to S.
917 * L|S is logically invalid, it would mean -1 packet in flight 8))
919 * These 6 states form finite state machine, controlled by the following events:
920 * 1. New ACK (+SACK) arrives. (tcp_sacktag_write_queue())
921 * 2. Retransmission. (tcp_retransmit_skb(), tcp_xmit_retransmit_queue())
922 * 3. Loss detection event of two flavors:
923 * A. Scoreboard estimator decided the packet is lost.
924 * A'. Reno "three dupacks" marks head of queue lost.
925 * A''. Its FACK modification, head until snd.fack is lost.
926 * B. SACK arrives sacking SND.NXT at the moment, when the
927 * segment was retransmitted.
928 * 4. D-SACK added new rule: D-SACK changes any tag to S.
930 * It is pleasant to note, that state diagram turns out to be commutative,
931 * so that we are allowed not to be bothered by order of our actions,
932 * when multiple events arrive simultaneously. (see the function below).
934 * Reordering detection.
935 * --------------------
936 * Reordering metric is maximal distance, which a packet can be displaced
937 * in packet stream. With SACKs we can estimate it:
939 * 1. SACK fills old hole and the corresponding segment was not
940 * ever retransmitted -> reordering. Alas, we cannot use it
941 * when segment was retransmitted.
942 * 2. The last flaw is solved with D-SACK. D-SACK arrives
943 * for retransmitted and already SACKed segment -> reordering..
944 * Both of these heuristics are not used in Loss state, when we cannot
945 * account for retransmits accurately.
947 * SACK block validation.
948 * ----------------------
950 * SACK block range validation checks that the received SACK block fits to
951 * the expected sequence limits, i.e., it is between SND.UNA and SND.NXT.
952 * Note that SND.UNA is not included to the range though being valid because
953 * it means that the receiver is rather inconsistent with itself reporting
954 * SACK reneging when it should advance SND.UNA. Such SACK block this is
955 * perfectly valid, however, in light of RFC2018 which explicitly states
956 * that "SACK block MUST reflect the newest segment. Even if the newest
957 * segment is going to be discarded ...", not that it looks very clever
958 * in case of head skb. Due to potentional receiver driven attacks, we
959 * choose to avoid immediate execution of a walk in write queue due to
960 * reneging and defer head skb's loss recovery to standard loss recovery
961 * procedure that will eventually trigger (nothing forbids us doing this).
963 * Implements also blockage to start_seq wrap-around. Problem lies in the
964 * fact that though start_seq (s) is before end_seq (i.e., not reversed),
965 * there's no guarantee that it will be before snd_nxt (n). The problem
966 * happens when start_seq resides between end_seq wrap (e_w) and snd_nxt
969 * <- outs wnd -> <- wrapzone ->
970 * u e n u_w e_w s n_w
972 * |<------------+------+----- TCP seqno space --------------+---------->|
973 * ...-- <2^31 ->| |<--------...
974 * ...---- >2^31 ------>| |<--------...
976 * Current code wouldn't be vulnerable but it's better still to discard such
977 * crazy SACK blocks. Doing this check for start_seq alone closes somewhat
978 * similar case (end_seq after snd_nxt wrap) as earlier reversed check in
979 * snd_nxt wrap -> snd_una region will then become "well defined", i.e.,
980 * equal to the ideal case (infinite seqno space without wrap caused issues).
982 * With D-SACK the lower bound is extended to cover sequence space below
983 * SND.UNA down to undo_marker, which is the last point of interest. Yet
984 * again, D-SACK block must not to go across snd_una (for the same reason as
985 * for the normal SACK blocks, explained above). But there all simplicity
986 * ends, TCP might receive valid D-SACKs below that. As long as they reside
987 * fully below undo_marker they do not affect behavior in anyway and can
988 * therefore be safely ignored. In rare cases (which are more or less
989 * theoretical ones), the D-SACK will nicely cross that boundary due to skb
990 * fragmentation and packet reordering past skb's retransmission. To consider
991 * them correctly, the acceptable range must be extended even more though
992 * the exact amount is rather hard to quantify. However, tp->max_window can
993 * be used as an exaggerated estimate.
995 static bool tcp_is_sackblock_valid(struct tcp_sock *tp, bool is_dsack,
996 u32 start_seq, u32 end_seq)
998 /* Too far in future, or reversed (interpretation is ambiguous) */
999 if (after(end_seq, tp->snd_nxt) || !before(start_seq, end_seq))
1002 /* Nasty start_seq wrap-around check (see comments above) */
1003 if (!before(start_seq, tp->snd_nxt))
1006 /* In outstanding window? ...This is valid exit for D-SACKs too.
1007 * start_seq == snd_una is non-sensical (see comments above)
1009 if (after(start_seq, tp->snd_una))
1012 if (!is_dsack || !tp->undo_marker)
1015 /* ...Then it's D-SACK, and must reside below snd_una completely */
1016 if (after(end_seq, tp->snd_una))
1019 if (!before(start_seq, tp->undo_marker))
1023 if (!after(end_seq, tp->undo_marker))
1026 /* Undo_marker boundary crossing (overestimates a lot). Known already:
1027 * start_seq < undo_marker and end_seq >= undo_marker.
1029 return !before(start_seq, end_seq - tp->max_window);
1032 /* Check for lost retransmit. This superb idea is borrowed from "ratehalving".
1033 * Event "B". Later note: FACK people cheated me again 8), we have to account
1034 * for reordering! Ugly, but should help.
1036 * Search retransmitted skbs from write_queue that were sent when snd_nxt was
1037 * less than what is now known to be received by the other end (derived from
1038 * highest SACK block). Also calculate the lowest snd_nxt among the remaining
1039 * retransmitted skbs to avoid some costly processing per ACKs.
1041 static void tcp_mark_lost_retrans(struct sock *sk, int *flag)
1043 const struct inet_connection_sock *icsk = inet_csk(sk);
1044 struct tcp_sock *tp = tcp_sk(sk);
1045 struct sk_buff *skb;
1047 u32 new_low_seq = tp->snd_nxt;
1048 u32 received_upto = tcp_highest_sack_seq(tp);
1050 if (!tcp_is_fack(tp) || !tp->retrans_out ||
1051 !after(received_upto, tp->lost_retrans_low) ||
1052 icsk->icsk_ca_state != TCP_CA_Recovery)
1055 tcp_for_write_queue(skb, sk) {
1056 u32 ack_seq = TCP_SKB_CB(skb)->ack_seq;
1058 if (skb == tcp_send_head(sk))
1060 if (cnt == tp->retrans_out)
1062 if (!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
1065 if (!(TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS))
1068 /* TODO: We would like to get rid of tcp_is_fack(tp) only
1069 * constraint here (see above) but figuring out that at
1070 * least tp->reordering SACK blocks reside between ack_seq
1071 * and received_upto is not easy task to do cheaply with
1072 * the available datastructures.
1074 * Whether FACK should check here for tp->reordering segs
1075 * in-between one could argue for either way (it would be
1076 * rather simple to implement as we could count fack_count
1077 * during the walk and do tp->fackets_out - fack_count).
1079 if (after(received_upto, ack_seq)) {
1080 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1081 tp->retrans_out -= tcp_skb_pcount(skb);
1082 *flag |= FLAG_LOST_RETRANS;
1083 tcp_skb_mark_lost_uncond_verify(tp, skb);
1084 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPLOSTRETRANSMIT);
1086 if (before(ack_seq, new_low_seq))
1087 new_low_seq = ack_seq;
1088 cnt += tcp_skb_pcount(skb);
1092 if (tp->retrans_out)
1093 tp->lost_retrans_low = new_low_seq;
1096 static bool tcp_check_dsack(struct sock *sk, const struct sk_buff *ack_skb,
1097 struct tcp_sack_block_wire *sp, int num_sacks,
1100 struct tcp_sock *tp = tcp_sk(sk);
1101 u32 start_seq_0 = get_unaligned_be32(&sp[0].start_seq);
1102 u32 end_seq_0 = get_unaligned_be32(&sp[0].end_seq);
1103 bool dup_sack = false;
1105 if (before(start_seq_0, TCP_SKB_CB(ack_skb)->ack_seq)) {
1108 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPDSACKRECV);
1109 } else if (num_sacks > 1) {
1110 u32 end_seq_1 = get_unaligned_be32(&sp[1].end_seq);
1111 u32 start_seq_1 = get_unaligned_be32(&sp[1].start_seq);
1113 if (!after(end_seq_0, end_seq_1) &&
1114 !before(start_seq_0, start_seq_1)) {
1117 NET_INC_STATS_BH(sock_net(sk),
1118 LINUX_MIB_TCPDSACKOFORECV);
1122 /* D-SACK for already forgotten data... Do dumb counting. */
1123 if (dup_sack && tp->undo_marker && tp->undo_retrans > 0 &&
1124 !after(end_seq_0, prior_snd_una) &&
1125 after(end_seq_0, tp->undo_marker))
1131 struct tcp_sacktag_state {
1134 /* Timestamps for earliest and latest never-retransmitted segment
1135 * that was SACKed. RTO needs the earliest RTT to stay conservative,
1136 * but congestion control should still get an accurate delay signal.
1138 struct skb_mstamp first_sackt;
1139 struct skb_mstamp last_sackt;
1143 /* Check if skb is fully within the SACK block. In presence of GSO skbs,
1144 * the incoming SACK may not exactly match but we can find smaller MSS
1145 * aligned portion of it that matches. Therefore we might need to fragment
1146 * which may fail and creates some hassle (caller must handle error case
1149 * FIXME: this could be merged to shift decision code
1151 static int tcp_match_skb_to_sack(struct sock *sk, struct sk_buff *skb,
1152 u32 start_seq, u32 end_seq)
1156 unsigned int pkt_len;
1159 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq) &&
1160 !before(end_seq, TCP_SKB_CB(skb)->end_seq);
1162 if (tcp_skb_pcount(skb) > 1 && !in_sack &&
1163 after(TCP_SKB_CB(skb)->end_seq, start_seq)) {
1164 mss = tcp_skb_mss(skb);
1165 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq);
1168 pkt_len = start_seq - TCP_SKB_CB(skb)->seq;
1172 pkt_len = end_seq - TCP_SKB_CB(skb)->seq;
1177 /* Round if necessary so that SACKs cover only full MSSes
1178 * and/or the remaining small portion (if present)
1180 if (pkt_len > mss) {
1181 unsigned int new_len = (pkt_len / mss) * mss;
1182 if (!in_sack && new_len < pkt_len) {
1184 if (new_len >= skb->len)
1189 err = tcp_fragment(sk, skb, pkt_len, mss, GFP_ATOMIC);
1197 /* Mark the given newly-SACKed range as such, adjusting counters and hints. */
1198 static u8 tcp_sacktag_one(struct sock *sk,
1199 struct tcp_sacktag_state *state, u8 sacked,
1200 u32 start_seq, u32 end_seq,
1201 int dup_sack, int pcount,
1202 const struct skb_mstamp *xmit_time)
1204 struct tcp_sock *tp = tcp_sk(sk);
1205 int fack_count = state->fack_count;
1207 /* Account D-SACK for retransmitted packet. */
1208 if (dup_sack && (sacked & TCPCB_RETRANS)) {
1209 if (tp->undo_marker && tp->undo_retrans > 0 &&
1210 after(end_seq, tp->undo_marker))
1212 if (sacked & TCPCB_SACKED_ACKED)
1213 state->reord = min(fack_count, state->reord);
1216 /* Nothing to do; acked frame is about to be dropped (was ACKed). */
1217 if (!after(end_seq, tp->snd_una))
1220 if (!(sacked & TCPCB_SACKED_ACKED)) {
1221 if (sacked & TCPCB_SACKED_RETRANS) {
1222 /* If the segment is not tagged as lost,
1223 * we do not clear RETRANS, believing
1224 * that retransmission is still in flight.
1226 if (sacked & TCPCB_LOST) {
1227 sacked &= ~(TCPCB_LOST|TCPCB_SACKED_RETRANS);
1228 tp->lost_out -= pcount;
1229 tp->retrans_out -= pcount;
1232 if (!(sacked & TCPCB_RETRANS)) {
1233 /* New sack for not retransmitted frame,
1234 * which was in hole. It is reordering.
1236 if (before(start_seq,
1237 tcp_highest_sack_seq(tp)))
1238 state->reord = min(fack_count,
1240 if (!after(end_seq, tp->high_seq))
1241 state->flag |= FLAG_ORIG_SACK_ACKED;
1242 if (state->first_sackt.v64 == 0)
1243 state->first_sackt = *xmit_time;
1244 state->last_sackt = *xmit_time;
1247 if (sacked & TCPCB_LOST) {
1248 sacked &= ~TCPCB_LOST;
1249 tp->lost_out -= pcount;
1253 sacked |= TCPCB_SACKED_ACKED;
1254 state->flag |= FLAG_DATA_SACKED;
1255 tp->sacked_out += pcount;
1257 fack_count += pcount;
1259 /* Lost marker hint past SACKed? Tweak RFC3517 cnt */
1260 if (!tcp_is_fack(tp) && tp->lost_skb_hint &&
1261 before(start_seq, TCP_SKB_CB(tp->lost_skb_hint)->seq))
1262 tp->lost_cnt_hint += pcount;
1264 if (fack_count > tp->fackets_out)
1265 tp->fackets_out = fack_count;
1268 /* D-SACK. We can detect redundant retransmission in S|R and plain R
1269 * frames and clear it. undo_retrans is decreased above, L|R frames
1270 * are accounted above as well.
1272 if (dup_sack && (sacked & TCPCB_SACKED_RETRANS)) {
1273 sacked &= ~TCPCB_SACKED_RETRANS;
1274 tp->retrans_out -= pcount;
1280 /* Shift newly-SACKed bytes from this skb to the immediately previous
1281 * already-SACKed sk_buff. Mark the newly-SACKed bytes as such.
1283 static bool tcp_shifted_skb(struct sock *sk, struct sk_buff *skb,
1284 struct tcp_sacktag_state *state,
1285 unsigned int pcount, int shifted, int mss,
1288 struct tcp_sock *tp = tcp_sk(sk);
1289 struct sk_buff *prev = tcp_write_queue_prev(sk, skb);
1290 u32 start_seq = TCP_SKB_CB(skb)->seq; /* start of newly-SACKed */
1291 u32 end_seq = start_seq + shifted; /* end of newly-SACKed */
1295 /* Adjust counters and hints for the newly sacked sequence
1296 * range but discard the return value since prev is already
1297 * marked. We must tag the range first because the seq
1298 * advancement below implicitly advances
1299 * tcp_highest_sack_seq() when skb is highest_sack.
1301 tcp_sacktag_one(sk, state, TCP_SKB_CB(skb)->sacked,
1302 start_seq, end_seq, dup_sack, pcount,
1305 if (skb == tp->lost_skb_hint)
1306 tp->lost_cnt_hint += pcount;
1308 TCP_SKB_CB(prev)->end_seq += shifted;
1309 TCP_SKB_CB(skb)->seq += shifted;
1311 tcp_skb_pcount_add(prev, pcount);
1312 BUG_ON(tcp_skb_pcount(skb) < pcount);
1313 tcp_skb_pcount_add(skb, -pcount);
1315 /* When we're adding to gso_segs == 1, gso_size will be zero,
1316 * in theory this shouldn't be necessary but as long as DSACK
1317 * code can come after this skb later on it's better to keep
1318 * setting gso_size to something.
1320 if (!TCP_SKB_CB(prev)->tcp_gso_size)
1321 TCP_SKB_CB(prev)->tcp_gso_size = mss;
1323 /* CHECKME: To clear or not to clear? Mimics normal skb currently */
1324 if (tcp_skb_pcount(skb) <= 1)
1325 TCP_SKB_CB(skb)->tcp_gso_size = 0;
1327 /* Difference in this won't matter, both ACKed by the same cumul. ACK */
1328 TCP_SKB_CB(prev)->sacked |= (TCP_SKB_CB(skb)->sacked & TCPCB_EVER_RETRANS);
1331 BUG_ON(!tcp_skb_pcount(skb));
1332 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_SACKSHIFTED);
1336 /* Whole SKB was eaten :-) */
1338 if (skb == tp->retransmit_skb_hint)
1339 tp->retransmit_skb_hint = prev;
1340 if (skb == tp->lost_skb_hint) {
1341 tp->lost_skb_hint = prev;
1342 tp->lost_cnt_hint -= tcp_skb_pcount(prev);
1345 TCP_SKB_CB(prev)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags;
1346 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)
1347 TCP_SKB_CB(prev)->end_seq++;
1349 if (skb == tcp_highest_sack(sk))
1350 tcp_advance_highest_sack(sk, skb);
1352 tcp_unlink_write_queue(skb, sk);
1353 sk_wmem_free_skb(sk, skb);
1355 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_SACKMERGED);
1360 /* I wish gso_size would have a bit more sane initialization than
1361 * something-or-zero which complicates things
1363 static int tcp_skb_seglen(const struct sk_buff *skb)
1365 return tcp_skb_pcount(skb) == 1 ? skb->len : tcp_skb_mss(skb);
1368 /* Shifting pages past head area doesn't work */
1369 static int skb_can_shift(const struct sk_buff *skb)
1371 return !skb_headlen(skb) && skb_is_nonlinear(skb);
1374 /* Try collapsing SACK blocks spanning across multiple skbs to a single
1377 static struct sk_buff *tcp_shift_skb_data(struct sock *sk, struct sk_buff *skb,
1378 struct tcp_sacktag_state *state,
1379 u32 start_seq, u32 end_seq,
1382 struct tcp_sock *tp = tcp_sk(sk);
1383 struct sk_buff *prev;
1389 if (!sk_can_gso(sk))
1392 /* Normally R but no L won't result in plain S */
1394 (TCP_SKB_CB(skb)->sacked & (TCPCB_LOST|TCPCB_SACKED_RETRANS)) == TCPCB_SACKED_RETRANS)
1396 if (!skb_can_shift(skb))
1398 /* This frame is about to be dropped (was ACKed). */
1399 if (!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
1402 /* Can only happen with delayed DSACK + discard craziness */
1403 if (unlikely(skb == tcp_write_queue_head(sk)))
1405 prev = tcp_write_queue_prev(sk, skb);
1407 if ((TCP_SKB_CB(prev)->sacked & TCPCB_TAGBITS) != TCPCB_SACKED_ACKED)
1410 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq) &&
1411 !before(end_seq, TCP_SKB_CB(skb)->end_seq);
1415 pcount = tcp_skb_pcount(skb);
1416 mss = tcp_skb_seglen(skb);
1418 /* TODO: Fix DSACKs to not fragment already SACKed and we can
1419 * drop this restriction as unnecessary
1421 if (mss != tcp_skb_seglen(prev))
1424 if (!after(TCP_SKB_CB(skb)->end_seq, start_seq))
1426 /* CHECKME: This is non-MSS split case only?, this will
1427 * cause skipped skbs due to advancing loop btw, original
1428 * has that feature too
1430 if (tcp_skb_pcount(skb) <= 1)
1433 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq);
1435 /* TODO: head merge to next could be attempted here
1436 * if (!after(TCP_SKB_CB(skb)->end_seq, end_seq)),
1437 * though it might not be worth of the additional hassle
1439 * ...we can probably just fallback to what was done
1440 * previously. We could try merging non-SACKed ones
1441 * as well but it probably isn't going to buy off
1442 * because later SACKs might again split them, and
1443 * it would make skb timestamp tracking considerably
1449 len = end_seq - TCP_SKB_CB(skb)->seq;
1451 BUG_ON(len > skb->len);
1453 /* MSS boundaries should be honoured or else pcount will
1454 * severely break even though it makes things bit trickier.
1455 * Optimize common case to avoid most of the divides
1457 mss = tcp_skb_mss(skb);
1459 /* TODO: Fix DSACKs to not fragment already SACKed and we can
1460 * drop this restriction as unnecessary
1462 if (mss != tcp_skb_seglen(prev))
1467 } else if (len < mss) {
1475 /* tcp_sacktag_one() won't SACK-tag ranges below snd_una */
1476 if (!after(TCP_SKB_CB(skb)->seq + len, tp->snd_una))
1479 if (!skb_shift(prev, skb, len))
1481 if (!tcp_shifted_skb(sk, skb, state, pcount, len, mss, dup_sack))
1484 /* Hole filled allows collapsing with the next as well, this is very
1485 * useful when hole on every nth skb pattern happens
1487 if (prev == tcp_write_queue_tail(sk))
1489 skb = tcp_write_queue_next(sk, prev);
1491 if (!skb_can_shift(skb) ||
1492 (skb == tcp_send_head(sk)) ||
1493 ((TCP_SKB_CB(skb)->sacked & TCPCB_TAGBITS) != TCPCB_SACKED_ACKED) ||
1494 (mss != tcp_skb_seglen(skb)))
1498 if (skb_shift(prev, skb, len)) {
1499 pcount += tcp_skb_pcount(skb);
1500 tcp_shifted_skb(sk, skb, state, tcp_skb_pcount(skb), len, mss, 0);
1504 state->fack_count += pcount;
1511 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_SACKSHIFTFALLBACK);
1515 static struct sk_buff *tcp_sacktag_walk(struct sk_buff *skb, struct sock *sk,
1516 struct tcp_sack_block *next_dup,
1517 struct tcp_sacktag_state *state,
1518 u32 start_seq, u32 end_seq,
1521 struct tcp_sock *tp = tcp_sk(sk);
1522 struct sk_buff *tmp;
1524 tcp_for_write_queue_from(skb, sk) {
1526 bool dup_sack = dup_sack_in;
1528 if (skb == tcp_send_head(sk))
1531 /* queue is in-order => we can short-circuit the walk early */
1532 if (!before(TCP_SKB_CB(skb)->seq, end_seq))
1536 before(TCP_SKB_CB(skb)->seq, next_dup->end_seq)) {
1537 in_sack = tcp_match_skb_to_sack(sk, skb,
1538 next_dup->start_seq,
1544 /* skb reference here is a bit tricky to get right, since
1545 * shifting can eat and free both this skb and the next,
1546 * so not even _safe variant of the loop is enough.
1549 tmp = tcp_shift_skb_data(sk, skb, state,
1550 start_seq, end_seq, dup_sack);
1559 in_sack = tcp_match_skb_to_sack(sk, skb,
1565 if (unlikely(in_sack < 0))
1569 TCP_SKB_CB(skb)->sacked =
1572 TCP_SKB_CB(skb)->sacked,
1573 TCP_SKB_CB(skb)->seq,
1574 TCP_SKB_CB(skb)->end_seq,
1576 tcp_skb_pcount(skb),
1579 if (!before(TCP_SKB_CB(skb)->seq,
1580 tcp_highest_sack_seq(tp)))
1581 tcp_advance_highest_sack(sk, skb);
1584 state->fack_count += tcp_skb_pcount(skb);
1589 /* Avoid all extra work that is being done by sacktag while walking in
1592 static struct sk_buff *tcp_sacktag_skip(struct sk_buff *skb, struct sock *sk,
1593 struct tcp_sacktag_state *state,
1596 tcp_for_write_queue_from(skb, sk) {
1597 if (skb == tcp_send_head(sk))
1600 if (after(TCP_SKB_CB(skb)->end_seq, skip_to_seq))
1603 state->fack_count += tcp_skb_pcount(skb);
1608 static struct sk_buff *tcp_maybe_skipping_dsack(struct sk_buff *skb,
1610 struct tcp_sack_block *next_dup,
1611 struct tcp_sacktag_state *state,
1617 if (before(next_dup->start_seq, skip_to_seq)) {
1618 skb = tcp_sacktag_skip(skb, sk, state, next_dup->start_seq);
1619 skb = tcp_sacktag_walk(skb, sk, NULL, state,
1620 next_dup->start_seq, next_dup->end_seq,
1627 static int tcp_sack_cache_ok(const struct tcp_sock *tp, const struct tcp_sack_block *cache)
1629 return cache < tp->recv_sack_cache + ARRAY_SIZE(tp->recv_sack_cache);
1633 tcp_sacktag_write_queue(struct sock *sk, const struct sk_buff *ack_skb,
1634 u32 prior_snd_una, struct tcp_sacktag_state *state)
1636 struct tcp_sock *tp = tcp_sk(sk);
1637 const unsigned char *ptr = (skb_transport_header(ack_skb) +
1638 TCP_SKB_CB(ack_skb)->sacked);
1639 struct tcp_sack_block_wire *sp_wire = (struct tcp_sack_block_wire *)(ptr+2);
1640 struct tcp_sack_block sp[TCP_NUM_SACKS];
1641 struct tcp_sack_block *cache;
1642 struct sk_buff *skb;
1643 int num_sacks = min(TCP_NUM_SACKS, (ptr[1] - TCPOLEN_SACK_BASE) >> 3);
1645 bool found_dup_sack = false;
1647 int first_sack_index;
1650 state->reord = tp->packets_out;
1652 if (!tp->sacked_out) {
1653 if (WARN_ON(tp->fackets_out))
1654 tp->fackets_out = 0;
1655 tcp_highest_sack_reset(sk);
1658 found_dup_sack = tcp_check_dsack(sk, ack_skb, sp_wire,
1659 num_sacks, prior_snd_una);
1661 state->flag |= FLAG_DSACKING_ACK;
1663 /* Eliminate too old ACKs, but take into
1664 * account more or less fresh ones, they can
1665 * contain valid SACK info.
1667 if (before(TCP_SKB_CB(ack_skb)->ack_seq, prior_snd_una - tp->max_window))
1670 if (!tp->packets_out)
1674 first_sack_index = 0;
1675 for (i = 0; i < num_sacks; i++) {
1676 bool dup_sack = !i && found_dup_sack;
1678 sp[used_sacks].start_seq = get_unaligned_be32(&sp_wire[i].start_seq);
1679 sp[used_sacks].end_seq = get_unaligned_be32(&sp_wire[i].end_seq);
1681 if (!tcp_is_sackblock_valid(tp, dup_sack,
1682 sp[used_sacks].start_seq,
1683 sp[used_sacks].end_seq)) {
1687 if (!tp->undo_marker)
1688 mib_idx = LINUX_MIB_TCPDSACKIGNOREDNOUNDO;
1690 mib_idx = LINUX_MIB_TCPDSACKIGNOREDOLD;
1692 /* Don't count olds caused by ACK reordering */
1693 if ((TCP_SKB_CB(ack_skb)->ack_seq != tp->snd_una) &&
1694 !after(sp[used_sacks].end_seq, tp->snd_una))
1696 mib_idx = LINUX_MIB_TCPSACKDISCARD;
1699 NET_INC_STATS_BH(sock_net(sk), mib_idx);
1701 first_sack_index = -1;
1705 /* Ignore very old stuff early */
1706 if (!after(sp[used_sacks].end_seq, prior_snd_una))
1712 /* order SACK blocks to allow in order walk of the retrans queue */
1713 for (i = used_sacks - 1; i > 0; i--) {
1714 for (j = 0; j < i; j++) {
1715 if (after(sp[j].start_seq, sp[j + 1].start_seq)) {
1716 swap(sp[j], sp[j + 1]);
1718 /* Track where the first SACK block goes to */
1719 if (j == first_sack_index)
1720 first_sack_index = j + 1;
1725 skb = tcp_write_queue_head(sk);
1726 state->fack_count = 0;
1729 if (!tp->sacked_out) {
1730 /* It's already past, so skip checking against it */
1731 cache = tp->recv_sack_cache + ARRAY_SIZE(tp->recv_sack_cache);
1733 cache = tp->recv_sack_cache;
1734 /* Skip empty blocks in at head of the cache */
1735 while (tcp_sack_cache_ok(tp, cache) && !cache->start_seq &&
1740 while (i < used_sacks) {
1741 u32 start_seq = sp[i].start_seq;
1742 u32 end_seq = sp[i].end_seq;
1743 bool dup_sack = (found_dup_sack && (i == first_sack_index));
1744 struct tcp_sack_block *next_dup = NULL;
1746 if (found_dup_sack && ((i + 1) == first_sack_index))
1747 next_dup = &sp[i + 1];
1749 /* Skip too early cached blocks */
1750 while (tcp_sack_cache_ok(tp, cache) &&
1751 !before(start_seq, cache->end_seq))
1754 /* Can skip some work by looking recv_sack_cache? */
1755 if (tcp_sack_cache_ok(tp, cache) && !dup_sack &&
1756 after(end_seq, cache->start_seq)) {
1759 if (before(start_seq, cache->start_seq)) {
1760 skb = tcp_sacktag_skip(skb, sk, state,
1762 skb = tcp_sacktag_walk(skb, sk, next_dup,
1769 /* Rest of the block already fully processed? */
1770 if (!after(end_seq, cache->end_seq))
1773 skb = tcp_maybe_skipping_dsack(skb, sk, next_dup,
1777 /* ...tail remains todo... */
1778 if (tcp_highest_sack_seq(tp) == cache->end_seq) {
1779 /* ...but better entrypoint exists! */
1780 skb = tcp_highest_sack(sk);
1783 state->fack_count = tp->fackets_out;
1788 skb = tcp_sacktag_skip(skb, sk, state, cache->end_seq);
1789 /* Check overlap against next cached too (past this one already) */
1794 if (!before(start_seq, tcp_highest_sack_seq(tp))) {
1795 skb = tcp_highest_sack(sk);
1798 state->fack_count = tp->fackets_out;
1800 skb = tcp_sacktag_skip(skb, sk, state, start_seq);
1803 skb = tcp_sacktag_walk(skb, sk, next_dup, state,
1804 start_seq, end_seq, dup_sack);
1810 /* Clear the head of the cache sack blocks so we can skip it next time */
1811 for (i = 0; i < ARRAY_SIZE(tp->recv_sack_cache) - used_sacks; i++) {
1812 tp->recv_sack_cache[i].start_seq = 0;
1813 tp->recv_sack_cache[i].end_seq = 0;
1815 for (j = 0; j < used_sacks; j++)
1816 tp->recv_sack_cache[i++] = sp[j];
1818 if ((state->reord < tp->fackets_out) &&
1819 ((inet_csk(sk)->icsk_ca_state != TCP_CA_Loss) || tp->undo_marker))
1820 tcp_update_reordering(sk, tp->fackets_out - state->reord, 0);
1822 tcp_mark_lost_retrans(sk, &state->flag);
1823 tcp_verify_left_out(tp);
1826 #if FASTRETRANS_DEBUG > 0
1827 WARN_ON((int)tp->sacked_out < 0);
1828 WARN_ON((int)tp->lost_out < 0);
1829 WARN_ON((int)tp->retrans_out < 0);
1830 WARN_ON((int)tcp_packets_in_flight(tp) < 0);
1835 /* Limits sacked_out so that sum with lost_out isn't ever larger than
1836 * packets_out. Returns false if sacked_out adjustement wasn't necessary.
1838 static bool tcp_limit_reno_sacked(struct tcp_sock *tp)
1842 holes = max(tp->lost_out, 1U);
1843 holes = min(holes, tp->packets_out);
1845 if ((tp->sacked_out + holes) > tp->packets_out) {
1846 tp->sacked_out = tp->packets_out - holes;
1852 /* If we receive more dupacks than we expected counting segments
1853 * in assumption of absent reordering, interpret this as reordering.
1854 * The only another reason could be bug in receiver TCP.
1856 static void tcp_check_reno_reordering(struct sock *sk, const int addend)
1858 struct tcp_sock *tp = tcp_sk(sk);
1859 if (tcp_limit_reno_sacked(tp))
1860 tcp_update_reordering(sk, tp->packets_out + addend, 0);
1863 /* Emulate SACKs for SACKless connection: account for a new dupack. */
1865 static void tcp_add_reno_sack(struct sock *sk)
1867 struct tcp_sock *tp = tcp_sk(sk);
1869 tcp_check_reno_reordering(sk, 0);
1870 tcp_verify_left_out(tp);
1873 /* Account for ACK, ACKing some data in Reno Recovery phase. */
1875 static void tcp_remove_reno_sacks(struct sock *sk, int acked)
1877 struct tcp_sock *tp = tcp_sk(sk);
1880 /* One ACK acked hole. The rest eat duplicate ACKs. */
1881 if (acked - 1 >= tp->sacked_out)
1884 tp->sacked_out -= acked - 1;
1886 tcp_check_reno_reordering(sk, acked);
1887 tcp_verify_left_out(tp);
1890 static inline void tcp_reset_reno_sack(struct tcp_sock *tp)
1895 void tcp_clear_retrans(struct tcp_sock *tp)
1897 tp->retrans_out = 0;
1899 tp->undo_marker = 0;
1900 tp->undo_retrans = -1;
1901 tp->fackets_out = 0;
1905 static inline void tcp_init_undo(struct tcp_sock *tp)
1907 tp->undo_marker = tp->snd_una;
1908 /* Retransmission still in flight may cause DSACKs later. */
1909 tp->undo_retrans = tp->retrans_out ? : -1;
1912 /* Enter Loss state. If we detect SACK reneging, forget all SACK information
1913 * and reset tags completely, otherwise preserve SACKs. If receiver
1914 * dropped its ofo queue, we will know this due to reneging detection.
1916 void tcp_enter_loss(struct sock *sk)
1918 const struct inet_connection_sock *icsk = inet_csk(sk);
1919 struct tcp_sock *tp = tcp_sk(sk);
1920 struct sk_buff *skb;
1921 bool new_recovery = false;
1922 bool is_reneg; /* is receiver reneging on SACKs? */
1924 /* Reduce ssthresh if it has not yet been made inside this window. */
1925 if (icsk->icsk_ca_state <= TCP_CA_Disorder ||
1926 !after(tp->high_seq, tp->snd_una) ||
1927 (icsk->icsk_ca_state == TCP_CA_Loss && !icsk->icsk_retransmits)) {
1928 new_recovery = true;
1929 tp->prior_ssthresh = tcp_current_ssthresh(sk);
1930 tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
1931 tcp_ca_event(sk, CA_EVENT_LOSS);
1935 tp->snd_cwnd_cnt = 0;
1936 tp->snd_cwnd_stamp = tcp_time_stamp;
1938 tp->retrans_out = 0;
1941 if (tcp_is_reno(tp))
1942 tcp_reset_reno_sack(tp);
1944 skb = tcp_write_queue_head(sk);
1945 is_reneg = skb && (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED);
1947 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPSACKRENEGING);
1949 tp->fackets_out = 0;
1951 tcp_clear_all_retrans_hints(tp);
1953 tcp_for_write_queue(skb, sk) {
1954 if (skb == tcp_send_head(sk))
1957 TCP_SKB_CB(skb)->sacked &= (~TCPCB_TAGBITS)|TCPCB_SACKED_ACKED;
1958 if (!(TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_ACKED) || is_reneg) {
1959 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_ACKED;
1960 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1961 tp->lost_out += tcp_skb_pcount(skb);
1962 tp->retransmit_high = TCP_SKB_CB(skb)->end_seq;
1965 tcp_verify_left_out(tp);
1967 /* Timeout in disordered state after receiving substantial DUPACKs
1968 * suggests that the degree of reordering is over-estimated.
1970 if (icsk->icsk_ca_state <= TCP_CA_Disorder &&
1971 tp->sacked_out >= sysctl_tcp_reordering)
1972 tp->reordering = min_t(unsigned int, tp->reordering,
1973 sysctl_tcp_reordering);
1974 tcp_set_ca_state(sk, TCP_CA_Loss);
1975 tp->high_seq = tp->snd_nxt;
1976 tcp_ecn_queue_cwr(tp);
1978 /* F-RTO RFC5682 sec 3.1 step 1: retransmit SND.UNA if no previous
1979 * loss recovery is underway except recurring timeout(s) on
1980 * the same SND.UNA (sec 3.2). Disable F-RTO on path MTU probing
1982 tp->frto = sysctl_tcp_frto &&
1983 (new_recovery || icsk->icsk_retransmits) &&
1984 !inet_csk(sk)->icsk_mtup.probe_size;
1987 /* If ACK arrived pointing to a remembered SACK, it means that our
1988 * remembered SACKs do not reflect real state of receiver i.e.
1989 * receiver _host_ is heavily congested (or buggy).
1991 * To avoid big spurious retransmission bursts due to transient SACK
1992 * scoreboard oddities that look like reneging, we give the receiver a
1993 * little time (max(RTT/2, 10ms)) to send us some more ACKs that will
1994 * restore sanity to the SACK scoreboard. If the apparent reneging
1995 * persists until this RTO then we'll clear the SACK scoreboard.
1997 static bool tcp_check_sack_reneging(struct sock *sk, int flag)
1999 if (flag & FLAG_SACK_RENEGING) {
2000 struct tcp_sock *tp = tcp_sk(sk);
2001 unsigned long delay = max(usecs_to_jiffies(tp->srtt_us >> 4),
2002 msecs_to_jiffies(10));
2004 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
2005 delay, TCP_RTO_MAX);
2011 static inline int tcp_fackets_out(const struct tcp_sock *tp)
2013 return tcp_is_reno(tp) ? tp->sacked_out + 1 : tp->fackets_out;
2016 /* Heurestics to calculate number of duplicate ACKs. There's no dupACKs
2017 * counter when SACK is enabled (without SACK, sacked_out is used for
2020 * Instead, with FACK TCP uses fackets_out that includes both SACKed
2021 * segments up to the highest received SACK block so far and holes in
2024 * With reordering, holes may still be in flight, so RFC3517 recovery
2025 * uses pure sacked_out (total number of SACKed segments) even though
2026 * it violates the RFC that uses duplicate ACKs, often these are equal
2027 * but when e.g. out-of-window ACKs or packet duplication occurs,
2028 * they differ. Since neither occurs due to loss, TCP should really
2031 static inline int tcp_dupack_heuristics(const struct tcp_sock *tp)
2033 return tcp_is_fack(tp) ? tp->fackets_out : tp->sacked_out + 1;
2036 static bool tcp_pause_early_retransmit(struct sock *sk, int flag)
2038 struct tcp_sock *tp = tcp_sk(sk);
2039 unsigned long delay;
2041 /* Delay early retransmit and entering fast recovery for
2042 * max(RTT/4, 2msec) unless ack has ECE mark, no RTT samples
2043 * available, or RTO is scheduled to fire first.
2045 if (sysctl_tcp_early_retrans < 2 || sysctl_tcp_early_retrans > 3 ||
2046 (flag & FLAG_ECE) || !tp->srtt_us)
2049 delay = max(usecs_to_jiffies(tp->srtt_us >> 5),
2050 msecs_to_jiffies(2));
2052 if (!time_after(inet_csk(sk)->icsk_timeout, (jiffies + delay)))
2055 inet_csk_reset_xmit_timer(sk, ICSK_TIME_EARLY_RETRANS, delay,
2060 /* Linux NewReno/SACK/FACK/ECN state machine.
2061 * --------------------------------------
2063 * "Open" Normal state, no dubious events, fast path.
2064 * "Disorder" In all the respects it is "Open",
2065 * but requires a bit more attention. It is entered when
2066 * we see some SACKs or dupacks. It is split of "Open"
2067 * mainly to move some processing from fast path to slow one.
2068 * "CWR" CWND was reduced due to some Congestion Notification event.
2069 * It can be ECN, ICMP source quench, local device congestion.
2070 * "Recovery" CWND was reduced, we are fast-retransmitting.
2071 * "Loss" CWND was reduced due to RTO timeout or SACK reneging.
2073 * tcp_fastretrans_alert() is entered:
2074 * - each incoming ACK, if state is not "Open"
2075 * - when arrived ACK is unusual, namely:
2080 * Counting packets in flight is pretty simple.
2082 * in_flight = packets_out - left_out + retrans_out
2084 * packets_out is SND.NXT-SND.UNA counted in packets.
2086 * retrans_out is number of retransmitted segments.
2088 * left_out is number of segments left network, but not ACKed yet.
2090 * left_out = sacked_out + lost_out
2092 * sacked_out: Packets, which arrived to receiver out of order
2093 * and hence not ACKed. With SACKs this number is simply
2094 * amount of SACKed data. Even without SACKs
2095 * it is easy to give pretty reliable estimate of this number,
2096 * counting duplicate ACKs.
2098 * lost_out: Packets lost by network. TCP has no explicit
2099 * "loss notification" feedback from network (for now).
2100 * It means that this number can be only _guessed_.
2101 * Actually, it is the heuristics to predict lossage that
2102 * distinguishes different algorithms.
2104 * F.e. after RTO, when all the queue is considered as lost,
2105 * lost_out = packets_out and in_flight = retrans_out.
2107 * Essentially, we have now two algorithms counting
2110 * FACK: It is the simplest heuristics. As soon as we decided
2111 * that something is lost, we decide that _all_ not SACKed
2112 * packets until the most forward SACK are lost. I.e.
2113 * lost_out = fackets_out - sacked_out and left_out = fackets_out.
2114 * It is absolutely correct estimate, if network does not reorder
2115 * packets. And it loses any connection to reality when reordering
2116 * takes place. We use FACK by default until reordering
2117 * is suspected on the path to this destination.
2119 * NewReno: when Recovery is entered, we assume that one segment
2120 * is lost (classic Reno). While we are in Recovery and
2121 * a partial ACK arrives, we assume that one more packet
2122 * is lost (NewReno). This heuristics are the same in NewReno
2125 * Imagine, that's all! Forget about all this shamanism about CWND inflation
2126 * deflation etc. CWND is real congestion window, never inflated, changes
2127 * only according to classic VJ rules.
2129 * Really tricky (and requiring careful tuning) part of algorithm
2130 * is hidden in functions tcp_time_to_recover() and tcp_xmit_retransmit_queue().
2131 * The first determines the moment _when_ we should reduce CWND and,
2132 * hence, slow down forward transmission. In fact, it determines the moment
2133 * when we decide that hole is caused by loss, rather than by a reorder.
2135 * tcp_xmit_retransmit_queue() decides, _what_ we should retransmit to fill
2136 * holes, caused by lost packets.
2138 * And the most logically complicated part of algorithm is undo
2139 * heuristics. We detect false retransmits due to both too early
2140 * fast retransmit (reordering) and underestimated RTO, analyzing
2141 * timestamps and D-SACKs. When we detect that some segments were
2142 * retransmitted by mistake and CWND reduction was wrong, we undo
2143 * window reduction and abort recovery phase. This logic is hidden
2144 * inside several functions named tcp_try_undo_<something>.
2147 /* This function decides, when we should leave Disordered state
2148 * and enter Recovery phase, reducing congestion window.
2150 * Main question: may we further continue forward transmission
2151 * with the same cwnd?
2153 static bool tcp_time_to_recover(struct sock *sk, int flag)
2155 struct tcp_sock *tp = tcp_sk(sk);
2158 /* Trick#1: The loss is proven. */
2162 /* Not-A-Trick#2 : Classic rule... */
2163 if (tcp_dupack_heuristics(tp) > tp->reordering)
2166 /* Trick#4: It is still not OK... But will it be useful to delay
2169 packets_out = tp->packets_out;
2170 if (packets_out <= tp->reordering &&
2171 tp->sacked_out >= max_t(__u32, packets_out/2, sysctl_tcp_reordering) &&
2172 !tcp_may_send_now(sk)) {
2173 /* We have nothing to send. This connection is limited
2174 * either by receiver window or by application.
2179 /* If a thin stream is detected, retransmit after first
2180 * received dupack. Employ only if SACK is supported in order
2181 * to avoid possible corner-case series of spurious retransmissions
2182 * Use only if there are no unsent data.
2184 if ((tp->thin_dupack || sysctl_tcp_thin_dupack) &&
2185 tcp_stream_is_thin(tp) && tcp_dupack_heuristics(tp) > 1 &&
2186 tcp_is_sack(tp) && !tcp_send_head(sk))
2189 /* Trick#6: TCP early retransmit, per RFC5827. To avoid spurious
2190 * retransmissions due to small network reorderings, we implement
2191 * Mitigation A.3 in the RFC and delay the retransmission for a short
2192 * interval if appropriate.
2194 if (tp->do_early_retrans && !tp->retrans_out && tp->sacked_out &&
2195 (tp->packets_out >= (tp->sacked_out + 1) && tp->packets_out < 4) &&
2196 !tcp_may_send_now(sk))
2197 return !tcp_pause_early_retransmit(sk, flag);
2202 /* Detect loss in event "A" above by marking head of queue up as lost.
2203 * For FACK or non-SACK(Reno) senders, the first "packets" number of segments
2204 * are considered lost. For RFC3517 SACK, a segment is considered lost if it
2205 * has at least tp->reordering SACKed seqments above it; "packets" refers to
2206 * the maximum SACKed segments to pass before reaching this limit.
2208 static void tcp_mark_head_lost(struct sock *sk, int packets, int mark_head)
2210 struct tcp_sock *tp = tcp_sk(sk);
2211 struct sk_buff *skb;
2215 /* Use SACK to deduce losses of new sequences sent during recovery */
2216 const u32 loss_high = tcp_is_sack(tp) ? tp->snd_nxt : tp->high_seq;
2218 WARN_ON(packets > tp->packets_out);
2219 if (tp->lost_skb_hint) {
2220 skb = tp->lost_skb_hint;
2221 cnt = tp->lost_cnt_hint;
2222 /* Head already handled? */
2223 if (mark_head && skb != tcp_write_queue_head(sk))
2226 skb = tcp_write_queue_head(sk);
2230 tcp_for_write_queue_from(skb, sk) {
2231 if (skb == tcp_send_head(sk))
2233 /* TODO: do this better */
2234 /* this is not the most efficient way to do this... */
2235 tp->lost_skb_hint = skb;
2236 tp->lost_cnt_hint = cnt;
2238 if (after(TCP_SKB_CB(skb)->end_seq, loss_high))
2242 if (tcp_is_fack(tp) || tcp_is_reno(tp) ||
2243 (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED))
2244 cnt += tcp_skb_pcount(skb);
2246 if (cnt > packets) {
2247 if ((tcp_is_sack(tp) && !tcp_is_fack(tp)) ||
2248 (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED) ||
2249 (oldcnt >= packets))
2252 mss = tcp_skb_mss(skb);
2253 err = tcp_fragment(sk, skb, (packets - oldcnt) * mss,
2260 tcp_skb_mark_lost(tp, skb);
2265 tcp_verify_left_out(tp);
2268 /* Account newly detected lost packet(s) */
2270 static void tcp_update_scoreboard(struct sock *sk, int fast_rexmit)
2272 struct tcp_sock *tp = tcp_sk(sk);
2274 if (tcp_is_reno(tp)) {
2275 tcp_mark_head_lost(sk, 1, 1);
2276 } else if (tcp_is_fack(tp)) {
2277 int lost = tp->fackets_out - tp->reordering;
2280 tcp_mark_head_lost(sk, lost, 0);
2282 int sacked_upto = tp->sacked_out - tp->reordering;
2283 if (sacked_upto >= 0)
2284 tcp_mark_head_lost(sk, sacked_upto, 0);
2285 else if (fast_rexmit)
2286 tcp_mark_head_lost(sk, 1, 1);
2290 /* CWND moderation, preventing bursts due to too big ACKs
2291 * in dubious situations.
2293 static inline void tcp_moderate_cwnd(struct tcp_sock *tp)
2295 tp->snd_cwnd = min(tp->snd_cwnd,
2296 tcp_packets_in_flight(tp) + tcp_max_burst(tp));
2297 tp->snd_cwnd_stamp = tcp_time_stamp;
2300 /* Nothing was retransmitted or returned timestamp is less
2301 * than timestamp of the first retransmission.
2303 static inline bool tcp_packet_delayed(const struct tcp_sock *tp)
2305 return !tp->retrans_stamp ||
2306 (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
2307 before(tp->rx_opt.rcv_tsecr, tp->retrans_stamp));
2310 /* Undo procedures. */
2312 /* We can clear retrans_stamp when there are no retransmissions in the
2313 * window. It would seem that it is trivially available for us in
2314 * tp->retrans_out, however, that kind of assumptions doesn't consider
2315 * what will happen if errors occur when sending retransmission for the
2316 * second time. ...It could the that such segment has only
2317 * TCPCB_EVER_RETRANS set at the present time. It seems that checking
2318 * the head skb is enough except for some reneging corner cases that
2319 * are not worth the effort.
2321 * Main reason for all this complexity is the fact that connection dying
2322 * time now depends on the validity of the retrans_stamp, in particular,
2323 * that successive retransmissions of a segment must not advance
2324 * retrans_stamp under any conditions.
2326 static bool tcp_any_retrans_done(const struct sock *sk)
2328 const struct tcp_sock *tp = tcp_sk(sk);
2329 struct sk_buff *skb;
2331 if (tp->retrans_out)
2334 skb = tcp_write_queue_head(sk);
2335 if (unlikely(skb && TCP_SKB_CB(skb)->sacked & TCPCB_EVER_RETRANS))
2341 #if FASTRETRANS_DEBUG > 1
2342 static void DBGUNDO(struct sock *sk, const char *msg)
2344 struct tcp_sock *tp = tcp_sk(sk);
2345 struct inet_sock *inet = inet_sk(sk);
2347 if (sk->sk_family == AF_INET) {
2348 pr_debug("Undo %s %pI4/%u c%u l%u ss%u/%u p%u\n",
2350 &inet->inet_daddr, ntohs(inet->inet_dport),
2351 tp->snd_cwnd, tcp_left_out(tp),
2352 tp->snd_ssthresh, tp->prior_ssthresh,
2355 #if IS_ENABLED(CONFIG_IPV6)
2356 else if (sk->sk_family == AF_INET6) {
2357 struct ipv6_pinfo *np = inet6_sk(sk);
2358 pr_debug("Undo %s %pI6/%u c%u l%u ss%u/%u p%u\n",
2360 &np->daddr, ntohs(inet->inet_dport),
2361 tp->snd_cwnd, tcp_left_out(tp),
2362 tp->snd_ssthresh, tp->prior_ssthresh,
2368 #define DBGUNDO(x...) do { } while (0)
2371 static void tcp_undo_cwnd_reduction(struct sock *sk, bool unmark_loss)
2373 struct tcp_sock *tp = tcp_sk(sk);
2376 struct sk_buff *skb;
2378 tcp_for_write_queue(skb, sk) {
2379 if (skb == tcp_send_head(sk))
2381 TCP_SKB_CB(skb)->sacked &= ~TCPCB_LOST;
2384 tcp_clear_all_retrans_hints(tp);
2387 if (tp->prior_ssthresh) {
2388 const struct inet_connection_sock *icsk = inet_csk(sk);
2390 if (icsk->icsk_ca_ops->undo_cwnd)
2391 tp->snd_cwnd = icsk->icsk_ca_ops->undo_cwnd(sk);
2393 tp->snd_cwnd = max(tp->snd_cwnd, tp->snd_ssthresh << 1);
2395 if (tp->prior_ssthresh > tp->snd_ssthresh) {
2396 tp->snd_ssthresh = tp->prior_ssthresh;
2397 tcp_ecn_withdraw_cwr(tp);
2400 tp->snd_cwnd = max(tp->snd_cwnd, tp->snd_ssthresh);
2402 tp->snd_cwnd_stamp = tcp_time_stamp;
2403 tp->undo_marker = 0;
2406 static inline bool tcp_may_undo(const struct tcp_sock *tp)
2408 return tp->undo_marker && (!tp->undo_retrans || tcp_packet_delayed(tp));
2411 /* People celebrate: "We love our President!" */
2412 static bool tcp_try_undo_recovery(struct sock *sk)
2414 struct tcp_sock *tp = tcp_sk(sk);
2416 if (tcp_may_undo(tp)) {
2419 /* Happy end! We did not retransmit anything
2420 * or our original transmission succeeded.
2422 DBGUNDO(sk, inet_csk(sk)->icsk_ca_state == TCP_CA_Loss ? "loss" : "retrans");
2423 tcp_undo_cwnd_reduction(sk, false);
2424 if (inet_csk(sk)->icsk_ca_state == TCP_CA_Loss)
2425 mib_idx = LINUX_MIB_TCPLOSSUNDO;
2427 mib_idx = LINUX_MIB_TCPFULLUNDO;
2429 NET_INC_STATS_BH(sock_net(sk), mib_idx);
2431 if (tp->snd_una == tp->high_seq && tcp_is_reno(tp)) {
2432 /* Hold old state until something *above* high_seq
2433 * is ACKed. For Reno it is MUST to prevent false
2434 * fast retransmits (RFC2582). SACK TCP is safe. */
2435 tcp_moderate_cwnd(tp);
2436 if (!tcp_any_retrans_done(sk))
2437 tp->retrans_stamp = 0;
2440 tcp_set_ca_state(sk, TCP_CA_Open);
2444 /* Try to undo cwnd reduction, because D-SACKs acked all retransmitted data */
2445 static bool tcp_try_undo_dsack(struct sock *sk)
2447 struct tcp_sock *tp = tcp_sk(sk);
2449 if (tp->undo_marker && !tp->undo_retrans) {
2450 DBGUNDO(sk, "D-SACK");
2451 tcp_undo_cwnd_reduction(sk, false);
2452 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPDSACKUNDO);
2458 /* Undo during loss recovery after partial ACK or using F-RTO. */
2459 static bool tcp_try_undo_loss(struct sock *sk, bool frto_undo)
2461 struct tcp_sock *tp = tcp_sk(sk);
2463 if (frto_undo || tcp_may_undo(tp)) {
2464 tcp_undo_cwnd_reduction(sk, true);
2466 DBGUNDO(sk, "partial loss");
2467 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPLOSSUNDO);
2469 NET_INC_STATS_BH(sock_net(sk),
2470 LINUX_MIB_TCPSPURIOUSRTOS);
2471 inet_csk(sk)->icsk_retransmits = 0;
2472 if (frto_undo || tcp_is_sack(tp))
2473 tcp_set_ca_state(sk, TCP_CA_Open);
2479 /* The cwnd reduction in CWR and Recovery uses the PRR algorithm in RFC 6937.
2480 * It computes the number of packets to send (sndcnt) based on packets newly
2482 * 1) If the packets in flight is larger than ssthresh, PRR spreads the
2483 * cwnd reductions across a full RTT.
2484 * 2) Otherwise PRR uses packet conservation to send as much as delivered.
2485 * But when the retransmits are acked without further losses, PRR
2486 * slow starts cwnd up to ssthresh to speed up the recovery.
2488 static void tcp_init_cwnd_reduction(struct sock *sk)
2490 struct tcp_sock *tp = tcp_sk(sk);
2492 tp->high_seq = tp->snd_nxt;
2493 tp->tlp_high_seq = 0;
2494 tp->snd_cwnd_cnt = 0;
2495 tp->prior_cwnd = tp->snd_cwnd;
2496 tp->prr_delivered = 0;
2498 tp->snd_ssthresh = inet_csk(sk)->icsk_ca_ops->ssthresh(sk);
2499 tcp_ecn_queue_cwr(tp);
2502 static void tcp_cwnd_reduction(struct sock *sk, const int prior_unsacked,
2503 int fast_rexmit, int flag)
2505 struct tcp_sock *tp = tcp_sk(sk);
2507 int delta = tp->snd_ssthresh - tcp_packets_in_flight(tp);
2508 int newly_acked_sacked = prior_unsacked -
2509 (tp->packets_out - tp->sacked_out);
2511 tp->prr_delivered += newly_acked_sacked;
2513 u64 dividend = (u64)tp->snd_ssthresh * tp->prr_delivered +
2515 sndcnt = div_u64(dividend, tp->prior_cwnd) - tp->prr_out;
2516 } else if ((flag & FLAG_RETRANS_DATA_ACKED) &&
2517 !(flag & FLAG_LOST_RETRANS)) {
2518 sndcnt = min_t(int, delta,
2519 max_t(int, tp->prr_delivered - tp->prr_out,
2520 newly_acked_sacked) + 1);
2522 sndcnt = min(delta, newly_acked_sacked);
2524 sndcnt = max(sndcnt, (fast_rexmit ? 1 : 0));
2525 tp->snd_cwnd = tcp_packets_in_flight(tp) + sndcnt;
2528 static inline void tcp_end_cwnd_reduction(struct sock *sk)
2530 struct tcp_sock *tp = tcp_sk(sk);
2532 /* Reset cwnd to ssthresh in CWR or Recovery (unless it's undone) */
2533 if (inet_csk(sk)->icsk_ca_state == TCP_CA_CWR ||
2534 (tp->undo_marker && tp->snd_ssthresh < TCP_INFINITE_SSTHRESH)) {
2535 tp->snd_cwnd = tp->snd_ssthresh;
2536 tp->snd_cwnd_stamp = tcp_time_stamp;
2538 tcp_ca_event(sk, CA_EVENT_COMPLETE_CWR);
2541 /* Enter CWR state. Disable cwnd undo since congestion is proven with ECN */
2542 void tcp_enter_cwr(struct sock *sk)
2544 struct tcp_sock *tp = tcp_sk(sk);
2546 tp->prior_ssthresh = 0;
2547 if (inet_csk(sk)->icsk_ca_state < TCP_CA_CWR) {
2548 tp->undo_marker = 0;
2549 tcp_init_cwnd_reduction(sk);
2550 tcp_set_ca_state(sk, TCP_CA_CWR);
2553 EXPORT_SYMBOL(tcp_enter_cwr);
2555 static void tcp_try_keep_open(struct sock *sk)
2557 struct tcp_sock *tp = tcp_sk(sk);
2558 int state = TCP_CA_Open;
2560 if (tcp_left_out(tp) || tcp_any_retrans_done(sk))
2561 state = TCP_CA_Disorder;
2563 if (inet_csk(sk)->icsk_ca_state != state) {
2564 tcp_set_ca_state(sk, state);
2565 tp->high_seq = tp->snd_nxt;
2569 static void tcp_try_to_open(struct sock *sk, int flag, const int prior_unsacked)
2571 struct tcp_sock *tp = tcp_sk(sk);
2573 tcp_verify_left_out(tp);
2575 if (!tcp_any_retrans_done(sk))
2576 tp->retrans_stamp = 0;
2578 if (flag & FLAG_ECE)
2581 if (inet_csk(sk)->icsk_ca_state != TCP_CA_CWR) {
2582 tcp_try_keep_open(sk);
2584 tcp_cwnd_reduction(sk, prior_unsacked, 0, flag);
2588 static void tcp_mtup_probe_failed(struct sock *sk)
2590 struct inet_connection_sock *icsk = inet_csk(sk);
2592 icsk->icsk_mtup.search_high = icsk->icsk_mtup.probe_size - 1;
2593 icsk->icsk_mtup.probe_size = 0;
2596 static void tcp_mtup_probe_success(struct sock *sk)
2598 struct tcp_sock *tp = tcp_sk(sk);
2599 struct inet_connection_sock *icsk = inet_csk(sk);
2601 /* FIXME: breaks with very large cwnd */
2602 tp->prior_ssthresh = tcp_current_ssthresh(sk);
2603 tp->snd_cwnd = tp->snd_cwnd *
2604 tcp_mss_to_mtu(sk, tp->mss_cache) /
2605 icsk->icsk_mtup.probe_size;
2606 tp->snd_cwnd_cnt = 0;
2607 tp->snd_cwnd_stamp = tcp_time_stamp;
2608 tp->snd_ssthresh = tcp_current_ssthresh(sk);
2610 icsk->icsk_mtup.search_low = icsk->icsk_mtup.probe_size;
2611 icsk->icsk_mtup.probe_size = 0;
2612 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
2615 /* Do a simple retransmit without using the backoff mechanisms in
2616 * tcp_timer. This is used for path mtu discovery.
2617 * The socket is already locked here.
2619 void tcp_simple_retransmit(struct sock *sk)
2621 const struct inet_connection_sock *icsk = inet_csk(sk);
2622 struct tcp_sock *tp = tcp_sk(sk);
2623 struct sk_buff *skb;
2624 unsigned int mss = tcp_current_mss(sk);
2625 u32 prior_lost = tp->lost_out;
2627 tcp_for_write_queue(skb, sk) {
2628 if (skb == tcp_send_head(sk))
2630 if (tcp_skb_seglen(skb) > mss &&
2631 !(TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)) {
2632 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) {
2633 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
2634 tp->retrans_out -= tcp_skb_pcount(skb);
2636 tcp_skb_mark_lost_uncond_verify(tp, skb);
2640 tcp_clear_retrans_hints_partial(tp);
2642 if (prior_lost == tp->lost_out)
2645 if (tcp_is_reno(tp))
2646 tcp_limit_reno_sacked(tp);
2648 tcp_verify_left_out(tp);
2650 /* Don't muck with the congestion window here.
2651 * Reason is that we do not increase amount of _data_
2652 * in network, but units changed and effective
2653 * cwnd/ssthresh really reduced now.
2655 if (icsk->icsk_ca_state != TCP_CA_Loss) {
2656 tp->high_seq = tp->snd_nxt;
2657 tp->snd_ssthresh = tcp_current_ssthresh(sk);
2658 tp->prior_ssthresh = 0;
2659 tp->undo_marker = 0;
2660 tcp_set_ca_state(sk, TCP_CA_Loss);
2662 tcp_xmit_retransmit_queue(sk);
2664 EXPORT_SYMBOL(tcp_simple_retransmit);
2666 static void tcp_enter_recovery(struct sock *sk, bool ece_ack)
2668 struct tcp_sock *tp = tcp_sk(sk);
2671 if (tcp_is_reno(tp))
2672 mib_idx = LINUX_MIB_TCPRENORECOVERY;
2674 mib_idx = LINUX_MIB_TCPSACKRECOVERY;
2676 NET_INC_STATS_BH(sock_net(sk), mib_idx);
2678 tp->prior_ssthresh = 0;
2681 if (!tcp_in_cwnd_reduction(sk)) {
2683 tp->prior_ssthresh = tcp_current_ssthresh(sk);
2684 tcp_init_cwnd_reduction(sk);
2686 tcp_set_ca_state(sk, TCP_CA_Recovery);
2689 /* Process an ACK in CA_Loss state. Move to CA_Open if lost data are
2690 * recovered or spurious. Otherwise retransmits more on partial ACKs.
2692 static void tcp_process_loss(struct sock *sk, int flag, bool is_dupack)
2694 struct tcp_sock *tp = tcp_sk(sk);
2695 bool recovered = !before(tp->snd_una, tp->high_seq);
2697 if ((flag & FLAG_SND_UNA_ADVANCED) &&
2698 tcp_try_undo_loss(sk, false))
2701 if (tp->frto) { /* F-RTO RFC5682 sec 3.1 (sack enhanced version). */
2702 /* Step 3.b. A timeout is spurious if not all data are
2703 * lost, i.e., never-retransmitted data are (s)acked.
2705 if ((flag & FLAG_ORIG_SACK_ACKED) &&
2706 tcp_try_undo_loss(sk, true))
2709 if (after(tp->snd_nxt, tp->high_seq)) {
2710 if (flag & FLAG_DATA_SACKED || is_dupack)
2711 tp->frto = 0; /* Step 3.a. loss was real */
2712 } else if (flag & FLAG_SND_UNA_ADVANCED && !recovered) {
2713 tp->high_seq = tp->snd_nxt;
2714 __tcp_push_pending_frames(sk, tcp_current_mss(sk),
2716 if (after(tp->snd_nxt, tp->high_seq))
2717 return; /* Step 2.b */
2723 /* F-RTO RFC5682 sec 3.1 step 2.a and 1st part of step 3.a */
2724 tcp_try_undo_recovery(sk);
2727 if (tcp_is_reno(tp)) {
2728 /* A Reno DUPACK means new data in F-RTO step 2.b above are
2729 * delivered. Lower inflight to clock out (re)tranmissions.
2731 if (after(tp->snd_nxt, tp->high_seq) && is_dupack)
2732 tcp_add_reno_sack(sk);
2733 else if (flag & FLAG_SND_UNA_ADVANCED)
2734 tcp_reset_reno_sack(tp);
2736 tcp_xmit_retransmit_queue(sk);
2739 /* Undo during fast recovery after partial ACK. */
2740 static bool tcp_try_undo_partial(struct sock *sk, const int acked,
2741 const int prior_unsacked, int flag)
2743 struct tcp_sock *tp = tcp_sk(sk);
2745 if (tp->undo_marker && tcp_packet_delayed(tp)) {
2746 /* Plain luck! Hole if filled with delayed
2747 * packet, rather than with a retransmit.
2749 tcp_update_reordering(sk, tcp_fackets_out(tp) + acked, 1);
2751 /* We are getting evidence that the reordering degree is higher
2752 * than we realized. If there are no retransmits out then we
2753 * can undo. Otherwise we clock out new packets but do not
2754 * mark more packets lost or retransmit more.
2756 if (tp->retrans_out) {
2757 tcp_cwnd_reduction(sk, prior_unsacked, 0, flag);
2761 if (!tcp_any_retrans_done(sk))
2762 tp->retrans_stamp = 0;
2764 DBGUNDO(sk, "partial recovery");
2765 tcp_undo_cwnd_reduction(sk, true);
2766 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPPARTIALUNDO);
2767 tcp_try_keep_open(sk);
2773 /* Process an event, which can update packets-in-flight not trivially.
2774 * Main goal of this function is to calculate new estimate for left_out,
2775 * taking into account both packets sitting in receiver's buffer and
2776 * packets lost by network.
2778 * Besides that it does CWND reduction, when packet loss is detected
2779 * and changes state of machine.
2781 * It does _not_ decide what to send, it is made in function
2782 * tcp_xmit_retransmit_queue().
2784 static void tcp_fastretrans_alert(struct sock *sk, const int acked,
2785 const int prior_unsacked,
2786 bool is_dupack, int flag)
2788 struct inet_connection_sock *icsk = inet_csk(sk);
2789 struct tcp_sock *tp = tcp_sk(sk);
2790 bool do_lost = is_dupack || ((flag & FLAG_DATA_SACKED) &&
2791 (tcp_fackets_out(tp) > tp->reordering));
2792 int fast_rexmit = 0;
2794 if (WARN_ON(!tp->packets_out && tp->sacked_out))
2796 if (WARN_ON(!tp->sacked_out && tp->fackets_out))
2797 tp->fackets_out = 0;
2799 /* Now state machine starts.
2800 * A. ECE, hence prohibit cwnd undoing, the reduction is required. */
2801 if (flag & FLAG_ECE)
2802 tp->prior_ssthresh = 0;
2804 /* B. In all the states check for reneging SACKs. */
2805 if (tcp_check_sack_reneging(sk, flag))
2808 /* C. Check consistency of the current state. */
2809 tcp_verify_left_out(tp);
2811 /* D. Check state exit conditions. State can be terminated
2812 * when high_seq is ACKed. */
2813 if (icsk->icsk_ca_state == TCP_CA_Open) {
2814 WARN_ON(tp->retrans_out != 0);
2815 tp->retrans_stamp = 0;
2816 } else if (!before(tp->snd_una, tp->high_seq)) {
2817 switch (icsk->icsk_ca_state) {
2819 /* CWR is to be held something *above* high_seq
2820 * is ACKed for CWR bit to reach receiver. */
2821 if (tp->snd_una != tp->high_seq) {
2822 tcp_end_cwnd_reduction(sk);
2823 tcp_set_ca_state(sk, TCP_CA_Open);
2827 case TCP_CA_Recovery:
2828 if (tcp_is_reno(tp))
2829 tcp_reset_reno_sack(tp);
2830 if (tcp_try_undo_recovery(sk))
2832 tcp_end_cwnd_reduction(sk);
2837 /* E. Process state. */
2838 switch (icsk->icsk_ca_state) {
2839 case TCP_CA_Recovery:
2840 if (!(flag & FLAG_SND_UNA_ADVANCED)) {
2841 if (tcp_is_reno(tp) && is_dupack)
2842 tcp_add_reno_sack(sk);
2844 if (tcp_try_undo_partial(sk, acked, prior_unsacked, flag))
2846 /* Partial ACK arrived. Force fast retransmit. */
2847 do_lost = tcp_is_reno(tp) ||
2848 tcp_fackets_out(tp) > tp->reordering;
2850 if (tcp_try_undo_dsack(sk)) {
2851 tcp_try_keep_open(sk);
2856 tcp_process_loss(sk, flag, is_dupack);
2857 if (icsk->icsk_ca_state != TCP_CA_Open &&
2858 !(flag & FLAG_LOST_RETRANS))
2860 /* Change state if cwnd is undone or retransmits are lost */
2862 if (tcp_is_reno(tp)) {
2863 if (flag & FLAG_SND_UNA_ADVANCED)
2864 tcp_reset_reno_sack(tp);
2866 tcp_add_reno_sack(sk);
2869 if (icsk->icsk_ca_state <= TCP_CA_Disorder)
2870 tcp_try_undo_dsack(sk);
2872 if (!tcp_time_to_recover(sk, flag)) {
2873 tcp_try_to_open(sk, flag, prior_unsacked);
2877 /* MTU probe failure: don't reduce cwnd */
2878 if (icsk->icsk_ca_state < TCP_CA_CWR &&
2879 icsk->icsk_mtup.probe_size &&
2880 tp->snd_una == tp->mtu_probe.probe_seq_start) {
2881 tcp_mtup_probe_failed(sk);
2882 /* Restores the reduction we did in tcp_mtup_probe() */
2884 tcp_simple_retransmit(sk);
2888 /* Otherwise enter Recovery state */
2889 tcp_enter_recovery(sk, (flag & FLAG_ECE));
2894 tcp_update_scoreboard(sk, fast_rexmit);
2895 tcp_cwnd_reduction(sk, prior_unsacked, fast_rexmit, flag);
2896 tcp_xmit_retransmit_queue(sk);
2899 static inline bool tcp_ack_update_rtt(struct sock *sk, const int flag,
2900 long seq_rtt_us, long sack_rtt_us)
2902 const struct tcp_sock *tp = tcp_sk(sk);
2904 /* Prefer RTT measured from ACK's timing to TS-ECR. This is because
2905 * broken middle-boxes or peers may corrupt TS-ECR fields. But
2906 * Karn's algorithm forbids taking RTT if some retransmitted data
2907 * is acked (RFC6298).
2909 if (flag & FLAG_RETRANS_DATA_ACKED)
2913 seq_rtt_us = sack_rtt_us;
2915 /* RTTM Rule: A TSecr value received in a segment is used to
2916 * update the averaged RTT measurement only if the segment
2917 * acknowledges some new data, i.e., only if it advances the
2918 * left edge of the send window.
2919 * See draft-ietf-tcplw-high-performance-00, section 3.3.
2921 if (seq_rtt_us < 0 && tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
2923 seq_rtt_us = jiffies_to_usecs(tcp_time_stamp - tp->rx_opt.rcv_tsecr);
2928 tcp_rtt_estimator(sk, seq_rtt_us);
2931 /* RFC6298: only reset backoff on valid RTT measurement. */
2932 inet_csk(sk)->icsk_backoff = 0;
2936 /* Compute time elapsed between (last) SYNACK and the ACK completing 3WHS. */
2937 static void tcp_synack_rtt_meas(struct sock *sk, const u32 synack_stamp)
2939 struct tcp_sock *tp = tcp_sk(sk);
2940 long seq_rtt_us = -1L;
2942 if (synack_stamp && !tp->total_retrans)
2943 seq_rtt_us = jiffies_to_usecs(tcp_time_stamp - synack_stamp);
2945 /* If the ACK acks both the SYNACK and the (Fast Open'd) data packets
2946 * sent in SYN_RECV, SYNACK RTT is the smooth RTT computed in tcp_ack()
2949 tcp_ack_update_rtt(sk, FLAG_SYN_ACKED, seq_rtt_us, -1L);
2952 static void tcp_cong_avoid(struct sock *sk, u32 ack, u32 acked)
2954 const struct inet_connection_sock *icsk = inet_csk(sk);
2956 icsk->icsk_ca_ops->cong_avoid(sk, ack, acked);
2957 tcp_sk(sk)->snd_cwnd_stamp = tcp_time_stamp;
2960 /* Restart timer after forward progress on connection.
2961 * RFC2988 recommends to restart timer to now+rto.
2963 void tcp_rearm_rto(struct sock *sk)
2965 const struct inet_connection_sock *icsk = inet_csk(sk);
2966 struct tcp_sock *tp = tcp_sk(sk);
2968 /* If the retrans timer is currently being used by Fast Open
2969 * for SYN-ACK retrans purpose, stay put.
2971 if (tp->fastopen_rsk)
2974 if (!tp->packets_out) {
2975 inet_csk_clear_xmit_timer(sk, ICSK_TIME_RETRANS);
2977 u32 rto = inet_csk(sk)->icsk_rto;
2978 /* Offset the time elapsed after installing regular RTO */
2979 if (icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS ||
2980 icsk->icsk_pending == ICSK_TIME_LOSS_PROBE) {
2981 struct sk_buff *skb = tcp_write_queue_head(sk);
2982 const u32 rto_time_stamp =
2983 tcp_skb_timestamp(skb) + rto;
2984 s32 delta = (s32)(rto_time_stamp - tcp_time_stamp);
2985 /* delta may not be positive if the socket is locked
2986 * when the retrans timer fires and is rescheduled.
2991 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, rto,
2996 /* This function is called when the delayed ER timer fires. TCP enters
2997 * fast recovery and performs fast-retransmit.
2999 void tcp_resume_early_retransmit(struct sock *sk)
3001 struct tcp_sock *tp = tcp_sk(sk);
3005 /* Stop if ER is disabled after the delayed ER timer is scheduled */
3006 if (!tp->do_early_retrans)
3009 tcp_enter_recovery(sk, false);
3010 tcp_update_scoreboard(sk, 1);
3011 tcp_xmit_retransmit_queue(sk);
3014 /* If we get here, the whole TSO packet has not been acked. */
3015 static u32 tcp_tso_acked(struct sock *sk, struct sk_buff *skb)
3017 struct tcp_sock *tp = tcp_sk(sk);
3020 BUG_ON(!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una));
3022 packets_acked = tcp_skb_pcount(skb);
3023 if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq))
3025 packets_acked -= tcp_skb_pcount(skb);
3027 if (packets_acked) {
3028 BUG_ON(tcp_skb_pcount(skb) == 0);
3029 BUG_ON(!before(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq));
3032 return packets_acked;
3035 static void tcp_ack_tstamp(struct sock *sk, struct sk_buff *skb,
3038 const struct skb_shared_info *shinfo;
3040 /* Avoid cache line misses to get skb_shinfo() and shinfo->tx_flags */
3041 if (likely(!(sk->sk_tsflags & SOF_TIMESTAMPING_TX_ACK)))
3044 shinfo = skb_shinfo(skb);
3045 if ((shinfo->tx_flags & SKBTX_ACK_TSTAMP) &&
3046 between(shinfo->tskey, prior_snd_una, tcp_sk(sk)->snd_una - 1))
3047 __skb_tstamp_tx(skb, NULL, sk, SCM_TSTAMP_ACK);
3050 /* Remove acknowledged frames from the retransmission queue. If our packet
3051 * is before the ack sequence we can discard it as it's confirmed to have
3052 * arrived at the other end.
3054 static int tcp_clean_rtx_queue(struct sock *sk, int prior_fackets,
3056 struct tcp_sacktag_state *sack)
3058 const struct inet_connection_sock *icsk = inet_csk(sk);
3059 struct skb_mstamp first_ackt, last_ackt, now;
3060 struct tcp_sock *tp = tcp_sk(sk);
3061 u32 prior_sacked = tp->sacked_out;
3062 u32 reord = tp->packets_out;
3063 bool fully_acked = true;
3064 long sack_rtt_us = -1L;
3065 long seq_rtt_us = -1L;
3066 long ca_rtt_us = -1L;
3067 struct sk_buff *skb;
3074 while ((skb = tcp_write_queue_head(sk)) && skb != tcp_send_head(sk)) {
3075 struct tcp_skb_cb *scb = TCP_SKB_CB(skb);
3076 u8 sacked = scb->sacked;
3079 tcp_ack_tstamp(sk, skb, prior_snd_una);
3081 /* Determine how many packets and what bytes were acked, tso and else */
3082 if (after(scb->end_seq, tp->snd_una)) {
3083 if (tcp_skb_pcount(skb) == 1 ||
3084 !after(tp->snd_una, scb->seq))
3087 acked_pcount = tcp_tso_acked(sk, skb);
3091 fully_acked = false;
3093 /* Speedup tcp_unlink_write_queue() and next loop */
3094 prefetchw(skb->next);
3095 acked_pcount = tcp_skb_pcount(skb);
3098 if (unlikely(sacked & TCPCB_RETRANS)) {
3099 if (sacked & TCPCB_SACKED_RETRANS)
3100 tp->retrans_out -= acked_pcount;
3101 flag |= FLAG_RETRANS_DATA_ACKED;
3102 } else if (!(sacked & TCPCB_SACKED_ACKED)) {
3103 last_ackt = skb->skb_mstamp;
3104 WARN_ON_ONCE(last_ackt.v64 == 0);
3105 if (!first_ackt.v64)
3106 first_ackt = last_ackt;
3108 reord = min(pkts_acked, reord);
3109 if (!after(scb->end_seq, tp->high_seq))
3110 flag |= FLAG_ORIG_SACK_ACKED;
3113 if (sacked & TCPCB_SACKED_ACKED)
3114 tp->sacked_out -= acked_pcount;
3115 if (sacked & TCPCB_LOST)
3116 tp->lost_out -= acked_pcount;
3118 tp->packets_out -= acked_pcount;
3119 pkts_acked += acked_pcount;
3121 /* Initial outgoing SYN's get put onto the write_queue
3122 * just like anything else we transmit. It is not
3123 * true data, and if we misinform our callers that
3124 * this ACK acks real data, we will erroneously exit
3125 * connection startup slow start one packet too
3126 * quickly. This is severely frowned upon behavior.
3128 if (likely(!(scb->tcp_flags & TCPHDR_SYN))) {
3129 flag |= FLAG_DATA_ACKED;
3131 flag |= FLAG_SYN_ACKED;
3132 tp->retrans_stamp = 0;
3138 tcp_unlink_write_queue(skb, sk);
3139 sk_wmem_free_skb(sk, skb);
3140 if (unlikely(skb == tp->retransmit_skb_hint))
3141 tp->retransmit_skb_hint = NULL;
3142 if (unlikely(skb == tp->lost_skb_hint))
3143 tp->lost_skb_hint = NULL;
3146 if (likely(between(tp->snd_up, prior_snd_una, tp->snd_una)))
3147 tp->snd_up = tp->snd_una;
3149 if (skb && (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED))
3150 flag |= FLAG_SACK_RENEGING;
3152 skb_mstamp_get(&now);
3153 if (likely(first_ackt.v64)) {
3154 seq_rtt_us = skb_mstamp_us_delta(&now, &first_ackt);
3155 ca_rtt_us = skb_mstamp_us_delta(&now, &last_ackt);
3157 if (sack->first_sackt.v64) {
3158 sack_rtt_us = skb_mstamp_us_delta(&now, &sack->first_sackt);
3159 ca_rtt_us = skb_mstamp_us_delta(&now, &sack->last_sackt);
3162 rtt_update = tcp_ack_update_rtt(sk, flag, seq_rtt_us, sack_rtt_us);
3164 if (flag & FLAG_ACKED) {
3166 if (unlikely(icsk->icsk_mtup.probe_size &&
3167 !after(tp->mtu_probe.probe_seq_end, tp->snd_una))) {
3168 tcp_mtup_probe_success(sk);
3171 if (tcp_is_reno(tp)) {
3172 tcp_remove_reno_sacks(sk, pkts_acked);
3176 /* Non-retransmitted hole got filled? That's reordering */
3177 if (reord < prior_fackets)
3178 tcp_update_reordering(sk, tp->fackets_out - reord, 0);
3180 delta = tcp_is_fack(tp) ? pkts_acked :
3181 prior_sacked - tp->sacked_out;
3182 tp->lost_cnt_hint -= min(tp->lost_cnt_hint, delta);
3185 tp->fackets_out -= min(pkts_acked, tp->fackets_out);
3187 } else if (skb && rtt_update && sack_rtt_us >= 0 &&
3188 sack_rtt_us > skb_mstamp_us_delta(&now, &skb->skb_mstamp)) {
3189 /* Do not re-arm RTO if the sack RTT is measured from data sent
3190 * after when the head was last (re)transmitted. Otherwise the
3191 * timeout may continue to extend in loss recovery.
3196 if (icsk->icsk_ca_ops->pkts_acked)
3197 icsk->icsk_ca_ops->pkts_acked(sk, pkts_acked, ca_rtt_us);
3199 #if FASTRETRANS_DEBUG > 0
3200 WARN_ON((int)tp->sacked_out < 0);
3201 WARN_ON((int)tp->lost_out < 0);
3202 WARN_ON((int)tp->retrans_out < 0);
3203 if (!tp->packets_out && tcp_is_sack(tp)) {
3204 icsk = inet_csk(sk);
3206 pr_debug("Leak l=%u %d\n",
3207 tp->lost_out, icsk->icsk_ca_state);
3210 if (tp->sacked_out) {
3211 pr_debug("Leak s=%u %d\n",
3212 tp->sacked_out, icsk->icsk_ca_state);
3215 if (tp->retrans_out) {
3216 pr_debug("Leak r=%u %d\n",
3217 tp->retrans_out, icsk->icsk_ca_state);
3218 tp->retrans_out = 0;
3225 static void tcp_ack_probe(struct sock *sk)
3227 const struct tcp_sock *tp = tcp_sk(sk);
3228 struct inet_connection_sock *icsk = inet_csk(sk);
3230 /* Was it a usable window open? */
3232 if (!after(TCP_SKB_CB(tcp_send_head(sk))->end_seq, tcp_wnd_end(tp))) {
3233 icsk->icsk_backoff = 0;
3234 inet_csk_clear_xmit_timer(sk, ICSK_TIME_PROBE0);
3235 /* Socket must be waked up by subsequent tcp_data_snd_check().
3236 * This function is not for random using!
3239 unsigned long when = tcp_probe0_when(sk, TCP_RTO_MAX);
3241 inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
3246 static inline bool tcp_ack_is_dubious(const struct sock *sk, const int flag)
3248 return !(flag & FLAG_NOT_DUP) || (flag & FLAG_CA_ALERT) ||
3249 inet_csk(sk)->icsk_ca_state != TCP_CA_Open;
3252 /* Decide wheather to run the increase function of congestion control. */
3253 static inline bool tcp_may_raise_cwnd(const struct sock *sk, const int flag)
3255 if (tcp_in_cwnd_reduction(sk))
3258 /* If reordering is high then always grow cwnd whenever data is
3259 * delivered regardless of its ordering. Otherwise stay conservative
3260 * and only grow cwnd on in-order delivery (RFC5681). A stretched ACK w/
3261 * new SACK or ECE mark may first advance cwnd here and later reduce
3262 * cwnd in tcp_fastretrans_alert() based on more states.
3264 if (tcp_sk(sk)->reordering > sysctl_tcp_reordering)
3265 return flag & FLAG_FORWARD_PROGRESS;
3267 return flag & FLAG_DATA_ACKED;
3270 /* Check that window update is acceptable.
3271 * The function assumes that snd_una<=ack<=snd_next.
3273 static inline bool tcp_may_update_window(const struct tcp_sock *tp,
3274 const u32 ack, const u32 ack_seq,
3277 return after(ack, tp->snd_una) ||
3278 after(ack_seq, tp->snd_wl1) ||
3279 (ack_seq == tp->snd_wl1 && nwin > tp->snd_wnd);
3282 /* If we update tp->snd_una, also update tp->bytes_acked */
3283 static void tcp_snd_una_update(struct tcp_sock *tp, u32 ack)
3285 u32 delta = ack - tp->snd_una;
3287 u64_stats_update_begin(&tp->syncp);
3288 tp->bytes_acked += delta;
3289 u64_stats_update_end(&tp->syncp);
3293 /* If we update tp->rcv_nxt, also update tp->bytes_received */
3294 static void tcp_rcv_nxt_update(struct tcp_sock *tp, u32 seq)
3296 u32 delta = seq - tp->rcv_nxt;
3298 u64_stats_update_begin(&tp->syncp);
3299 tp->bytes_received += delta;
3300 u64_stats_update_end(&tp->syncp);
3304 /* Update our send window.
3306 * Window update algorithm, described in RFC793/RFC1122 (used in linux-2.2
3307 * and in FreeBSD. NetBSD's one is even worse.) is wrong.
3309 static int tcp_ack_update_window(struct sock *sk, const struct sk_buff *skb, u32 ack,
3312 struct tcp_sock *tp = tcp_sk(sk);
3314 u32 nwin = ntohs(tcp_hdr(skb)->window);
3316 if (likely(!tcp_hdr(skb)->syn))
3317 nwin <<= tp->rx_opt.snd_wscale;
3319 if (tcp_may_update_window(tp, ack, ack_seq, nwin)) {
3320 flag |= FLAG_WIN_UPDATE;
3321 tcp_update_wl(tp, ack_seq);
3323 if (tp->snd_wnd != nwin) {
3326 /* Note, it is the only place, where
3327 * fast path is recovered for sending TCP.
3330 tcp_fast_path_check(sk);
3332 if (nwin > tp->max_window) {
3333 tp->max_window = nwin;
3334 tcp_sync_mss(sk, inet_csk(sk)->icsk_pmtu_cookie);
3339 tcp_snd_una_update(tp, ack);
3344 /* Return true if we're currently rate-limiting out-of-window ACKs and
3345 * thus shouldn't send a dupack right now. We rate-limit dupacks in
3346 * response to out-of-window SYNs or ACKs to mitigate ACK loops or DoS
3347 * attacks that send repeated SYNs or ACKs for the same connection. To
3348 * do this, we do not send a duplicate SYNACK or ACK if the remote
3349 * endpoint is sending out-of-window SYNs or pure ACKs at a high rate.
3351 bool tcp_oow_rate_limited(struct net *net, const struct sk_buff *skb,
3352 int mib_idx, u32 *last_oow_ack_time)
3354 /* Data packets without SYNs are not likely part of an ACK loop. */
3355 if ((TCP_SKB_CB(skb)->seq != TCP_SKB_CB(skb)->end_seq) &&
3357 goto not_rate_limited;
3359 if (*last_oow_ack_time) {
3360 s32 elapsed = (s32)(tcp_time_stamp - *last_oow_ack_time);
3362 if (0 <= elapsed && elapsed < sysctl_tcp_invalid_ratelimit) {
3363 NET_INC_STATS_BH(net, mib_idx);
3364 return true; /* rate-limited: don't send yet! */
3368 *last_oow_ack_time = tcp_time_stamp;
3371 return false; /* not rate-limited: go ahead, send dupack now! */
3374 /* RFC 5961 7 [ACK Throttling] */
3375 static void tcp_send_challenge_ack(struct sock *sk, const struct sk_buff *skb)
3377 /* unprotected vars, we dont care of overwrites */
3378 static u32 challenge_timestamp;
3379 static unsigned int challenge_count;
3380 struct tcp_sock *tp = tcp_sk(sk);
3383 /* First check our per-socket dupack rate limit. */
3384 if (tcp_oow_rate_limited(sock_net(sk), skb,
3385 LINUX_MIB_TCPACKSKIPPEDCHALLENGE,
3386 &tp->last_oow_ack_time))
3389 /* Then check the check host-wide RFC 5961 rate limit. */
3391 if (now != challenge_timestamp) {
3392 challenge_timestamp = now;
3393 challenge_count = 0;
3395 if (++challenge_count <= sysctl_tcp_challenge_ack_limit) {
3396 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPCHALLENGEACK);
3401 static void tcp_store_ts_recent(struct tcp_sock *tp)
3403 tp->rx_opt.ts_recent = tp->rx_opt.rcv_tsval;
3404 tp->rx_opt.ts_recent_stamp = get_seconds();
3407 static void tcp_replace_ts_recent(struct tcp_sock *tp, u32 seq)
3409 if (tp->rx_opt.saw_tstamp && !after(seq, tp->rcv_wup)) {
3410 /* PAWS bug workaround wrt. ACK frames, the PAWS discard
3411 * extra check below makes sure this can only happen
3412 * for pure ACK frames. -DaveM
3414 * Not only, also it occurs for expired timestamps.
3417 if (tcp_paws_check(&tp->rx_opt, 0))
3418 tcp_store_ts_recent(tp);
3422 /* This routine deals with acks during a TLP episode.
3423 * We mark the end of a TLP episode on receiving TLP dupack or when
3424 * ack is after tlp_high_seq.
3425 * Ref: loss detection algorithm in draft-dukkipati-tcpm-tcp-loss-probe.
3427 static void tcp_process_tlp_ack(struct sock *sk, u32 ack, int flag)
3429 struct tcp_sock *tp = tcp_sk(sk);
3431 if (before(ack, tp->tlp_high_seq))
3434 if (flag & FLAG_DSACKING_ACK) {
3435 /* This DSACK means original and TLP probe arrived; no loss */
3436 tp->tlp_high_seq = 0;
3437 } else if (after(ack, tp->tlp_high_seq)) {
3438 /* ACK advances: there was a loss, so reduce cwnd. Reset
3439 * tlp_high_seq in tcp_init_cwnd_reduction()
3441 tcp_init_cwnd_reduction(sk);
3442 tcp_set_ca_state(sk, TCP_CA_CWR);
3443 tcp_end_cwnd_reduction(sk);
3444 tcp_try_keep_open(sk);
3445 NET_INC_STATS_BH(sock_net(sk),
3446 LINUX_MIB_TCPLOSSPROBERECOVERY);
3447 } else if (!(flag & (FLAG_SND_UNA_ADVANCED |
3448 FLAG_NOT_DUP | FLAG_DATA_SACKED))) {
3449 /* Pure dupack: original and TLP probe arrived; no loss */
3450 tp->tlp_high_seq = 0;
3454 static inline void tcp_in_ack_event(struct sock *sk, u32 flags)
3456 const struct inet_connection_sock *icsk = inet_csk(sk);
3458 if (icsk->icsk_ca_ops->in_ack_event)
3459 icsk->icsk_ca_ops->in_ack_event(sk, flags);
3462 /* This routine deals with incoming acks, but not outgoing ones. */
3463 static int tcp_ack(struct sock *sk, const struct sk_buff *skb, int flag)
3465 struct inet_connection_sock *icsk = inet_csk(sk);
3466 struct tcp_sock *tp = tcp_sk(sk);
3467 struct tcp_sacktag_state sack_state;
3468 u32 prior_snd_una = tp->snd_una;
3469 u32 ack_seq = TCP_SKB_CB(skb)->seq;
3470 u32 ack = TCP_SKB_CB(skb)->ack_seq;
3471 bool is_dupack = false;
3473 int prior_packets = tp->packets_out;
3474 const int prior_unsacked = tp->packets_out - tp->sacked_out;
3475 int acked = 0; /* Number of packets newly acked */
3477 sack_state.first_sackt.v64 = 0;
3479 /* We very likely will need to access write queue head. */
3480 prefetchw(sk->sk_write_queue.next);
3482 /* If the ack is older than previous acks
3483 * then we can probably ignore it.
3485 if (before(ack, prior_snd_una)) {
3486 /* RFC 5961 5.2 [Blind Data Injection Attack].[Mitigation] */
3487 if (before(ack, prior_snd_una - tp->max_window)) {
3488 tcp_send_challenge_ack(sk, skb);
3494 /* If the ack includes data we haven't sent yet, discard
3495 * this segment (RFC793 Section 3.9).
3497 if (after(ack, tp->snd_nxt))
3500 if (icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS ||
3501 icsk->icsk_pending == ICSK_TIME_LOSS_PROBE)
3504 if (after(ack, prior_snd_una)) {
3505 flag |= FLAG_SND_UNA_ADVANCED;
3506 icsk->icsk_retransmits = 0;
3509 prior_fackets = tp->fackets_out;
3511 /* ts_recent update must be made after we are sure that the packet
3514 if (flag & FLAG_UPDATE_TS_RECENT)
3515 tcp_replace_ts_recent(tp, TCP_SKB_CB(skb)->seq);
3517 if (!(flag & FLAG_SLOWPATH) && after(ack, prior_snd_una)) {
3518 /* Window is constant, pure forward advance.
3519 * No more checks are required.
3520 * Note, we use the fact that SND.UNA>=SND.WL2.
3522 tcp_update_wl(tp, ack_seq);
3523 tcp_snd_una_update(tp, ack);
3524 flag |= FLAG_WIN_UPDATE;
3526 tcp_in_ack_event(sk, CA_ACK_WIN_UPDATE);
3528 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPHPACKS);
3530 u32 ack_ev_flags = CA_ACK_SLOWPATH;
3532 if (ack_seq != TCP_SKB_CB(skb)->end_seq)
3535 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPPUREACKS);
3537 flag |= tcp_ack_update_window(sk, skb, ack, ack_seq);
3539 if (TCP_SKB_CB(skb)->sacked)
3540 flag |= tcp_sacktag_write_queue(sk, skb, prior_snd_una,
3543 if (tcp_ecn_rcv_ecn_echo(tp, tcp_hdr(skb))) {
3545 ack_ev_flags |= CA_ACK_ECE;
3548 if (flag & FLAG_WIN_UPDATE)
3549 ack_ev_flags |= CA_ACK_WIN_UPDATE;
3551 tcp_in_ack_event(sk, ack_ev_flags);
3554 /* We passed data and got it acked, remove any soft error
3555 * log. Something worked...
3557 sk->sk_err_soft = 0;
3558 icsk->icsk_probes_out = 0;
3559 tp->rcv_tstamp = tcp_time_stamp;
3563 /* See if we can take anything off of the retransmit queue. */
3564 acked = tp->packets_out;
3565 flag |= tcp_clean_rtx_queue(sk, prior_fackets, prior_snd_una,
3567 acked -= tp->packets_out;
3569 /* Advance cwnd if state allows */
3570 if (tcp_may_raise_cwnd(sk, flag))
3571 tcp_cong_avoid(sk, ack, acked);
3573 if (tcp_ack_is_dubious(sk, flag)) {
3574 is_dupack = !(flag & (FLAG_SND_UNA_ADVANCED | FLAG_NOT_DUP));
3575 tcp_fastretrans_alert(sk, acked, prior_unsacked,
3578 if (tp->tlp_high_seq)
3579 tcp_process_tlp_ack(sk, ack, flag);
3581 if ((flag & FLAG_FORWARD_PROGRESS) || !(flag & FLAG_NOT_DUP)) {
3582 struct dst_entry *dst = __sk_dst_get(sk);
3587 if (icsk->icsk_pending == ICSK_TIME_RETRANS)
3588 tcp_schedule_loss_probe(sk);
3589 tcp_update_pacing_rate(sk);
3593 /* If data was DSACKed, see if we can undo a cwnd reduction. */
3594 if (flag & FLAG_DSACKING_ACK)
3595 tcp_fastretrans_alert(sk, acked, prior_unsacked,
3597 /* If this ack opens up a zero window, clear backoff. It was
3598 * being used to time the probes, and is probably far higher than
3599 * it needs to be for normal retransmission.
3601 if (tcp_send_head(sk))
3604 if (tp->tlp_high_seq)
3605 tcp_process_tlp_ack(sk, ack, flag);
3609 SOCK_DEBUG(sk, "Ack %u after %u:%u\n", ack, tp->snd_una, tp->snd_nxt);
3613 /* If data was SACKed, tag it and see if we should send more data.
3614 * If data was DSACKed, see if we can undo a cwnd reduction.
3616 if (TCP_SKB_CB(skb)->sacked) {
3617 flag |= tcp_sacktag_write_queue(sk, skb, prior_snd_una,
3619 tcp_fastretrans_alert(sk, acked, prior_unsacked,
3623 SOCK_DEBUG(sk, "Ack %u before %u:%u\n", ack, tp->snd_una, tp->snd_nxt);
3627 static void tcp_parse_fastopen_option(int len, const unsigned char *cookie,
3628 bool syn, struct tcp_fastopen_cookie *foc,
3631 /* Valid only in SYN or SYN-ACK with an even length. */
3632 if (!foc || !syn || len < 0 || (len & 1))
3635 if (len >= TCP_FASTOPEN_COOKIE_MIN &&
3636 len <= TCP_FASTOPEN_COOKIE_MAX)
3637 memcpy(foc->val, cookie, len);
3644 /* Look for tcp options. Normally only called on SYN and SYNACK packets.
3645 * But, this can also be called on packets in the established flow when
3646 * the fast version below fails.
3648 void tcp_parse_options(const struct sk_buff *skb,
3649 struct tcp_options_received *opt_rx, int estab,
3650 struct tcp_fastopen_cookie *foc)
3652 const unsigned char *ptr;
3653 const struct tcphdr *th = tcp_hdr(skb);
3654 int length = (th->doff * 4) - sizeof(struct tcphdr);
3656 ptr = (const unsigned char *)(th + 1);
3657 opt_rx->saw_tstamp = 0;
3659 while (length > 0) {
3660 int opcode = *ptr++;
3666 case TCPOPT_NOP: /* Ref: RFC 793 section 3.1 */
3671 if (opsize < 2) /* "silly options" */
3673 if (opsize > length)
3674 return; /* don't parse partial options */
3677 if (opsize == TCPOLEN_MSS && th->syn && !estab) {
3678 u16 in_mss = get_unaligned_be16(ptr);
3680 if (opt_rx->user_mss &&
3681 opt_rx->user_mss < in_mss)
3682 in_mss = opt_rx->user_mss;
3683 opt_rx->mss_clamp = in_mss;
3688 if (opsize == TCPOLEN_WINDOW && th->syn &&
3689 !estab && sysctl_tcp_window_scaling) {
3690 __u8 snd_wscale = *(__u8 *)ptr;
3691 opt_rx->wscale_ok = 1;
3692 if (snd_wscale > 14) {
3693 net_info_ratelimited("%s: Illegal window scaling value %d >14 received\n",
3698 opt_rx->snd_wscale = snd_wscale;
3701 case TCPOPT_TIMESTAMP:
3702 if ((opsize == TCPOLEN_TIMESTAMP) &&
3703 ((estab && opt_rx->tstamp_ok) ||
3704 (!estab && sysctl_tcp_timestamps))) {
3705 opt_rx->saw_tstamp = 1;
3706 opt_rx->rcv_tsval = get_unaligned_be32(ptr);
3707 opt_rx->rcv_tsecr = get_unaligned_be32(ptr + 4);
3710 case TCPOPT_SACK_PERM:
3711 if (opsize == TCPOLEN_SACK_PERM && th->syn &&
3712 !estab && sysctl_tcp_sack) {
3713 opt_rx->sack_ok = TCP_SACK_SEEN;
3714 tcp_sack_reset(opt_rx);
3719 if ((opsize >= (TCPOLEN_SACK_BASE + TCPOLEN_SACK_PERBLOCK)) &&
3720 !((opsize - TCPOLEN_SACK_BASE) % TCPOLEN_SACK_PERBLOCK) &&
3722 TCP_SKB_CB(skb)->sacked = (ptr - 2) - (unsigned char *)th;
3725 #ifdef CONFIG_TCP_MD5SIG
3728 * The MD5 Hash has already been
3729 * checked (see tcp_v{4,6}_do_rcv()).
3733 case TCPOPT_FASTOPEN:
3734 tcp_parse_fastopen_option(
3735 opsize - TCPOLEN_FASTOPEN_BASE,
3736 ptr, th->syn, foc, false);
3740 /* Fast Open option shares code 254 using a
3741 * 16 bits magic number.
3743 if (opsize >= TCPOLEN_EXP_FASTOPEN_BASE &&
3744 get_unaligned_be16(ptr) ==
3745 TCPOPT_FASTOPEN_MAGIC)
3746 tcp_parse_fastopen_option(opsize -
3747 TCPOLEN_EXP_FASTOPEN_BASE,
3748 ptr + 2, th->syn, foc, true);
3757 EXPORT_SYMBOL(tcp_parse_options);
3759 static bool tcp_parse_aligned_timestamp(struct tcp_sock *tp, const struct tcphdr *th)
3761 const __be32 *ptr = (const __be32 *)(th + 1);
3763 if (*ptr == htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16)
3764 | (TCPOPT_TIMESTAMP << 8) | TCPOLEN_TIMESTAMP)) {
3765 tp->rx_opt.saw_tstamp = 1;
3767 tp->rx_opt.rcv_tsval = ntohl(*ptr);
3770 tp->rx_opt.rcv_tsecr = ntohl(*ptr) - tp->tsoffset;
3772 tp->rx_opt.rcv_tsecr = 0;
3778 /* Fast parse options. This hopes to only see timestamps.
3779 * If it is wrong it falls back on tcp_parse_options().
3781 static bool tcp_fast_parse_options(const struct sk_buff *skb,
3782 const struct tcphdr *th, struct tcp_sock *tp)
3784 /* In the spirit of fast parsing, compare doff directly to constant
3785 * values. Because equality is used, short doff can be ignored here.
3787 if (th->doff == (sizeof(*th) / 4)) {
3788 tp->rx_opt.saw_tstamp = 0;
3790 } else if (tp->rx_opt.tstamp_ok &&
3791 th->doff == ((sizeof(*th) + TCPOLEN_TSTAMP_ALIGNED) / 4)) {
3792 if (tcp_parse_aligned_timestamp(tp, th))
3796 tcp_parse_options(skb, &tp->rx_opt, 1, NULL);
3797 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr)
3798 tp->rx_opt.rcv_tsecr -= tp->tsoffset;
3803 #ifdef CONFIG_TCP_MD5SIG
3805 * Parse MD5 Signature option
3807 const u8 *tcp_parse_md5sig_option(const struct tcphdr *th)
3809 int length = (th->doff << 2) - sizeof(*th);
3810 const u8 *ptr = (const u8 *)(th + 1);
3812 /* If the TCP option is too short, we can short cut */
3813 if (length < TCPOLEN_MD5SIG)
3816 while (length > 0) {
3817 int opcode = *ptr++;
3828 if (opsize < 2 || opsize > length)
3830 if (opcode == TCPOPT_MD5SIG)
3831 return opsize == TCPOLEN_MD5SIG ? ptr : NULL;
3838 EXPORT_SYMBOL(tcp_parse_md5sig_option);
3841 /* Sorry, PAWS as specified is broken wrt. pure-ACKs -DaveM
3843 * It is not fatal. If this ACK does _not_ change critical state (seqs, window)
3844 * it can pass through stack. So, the following predicate verifies that
3845 * this segment is not used for anything but congestion avoidance or
3846 * fast retransmit. Moreover, we even are able to eliminate most of such
3847 * second order effects, if we apply some small "replay" window (~RTO)
3848 * to timestamp space.
3850 * All these measures still do not guarantee that we reject wrapped ACKs
3851 * on networks with high bandwidth, when sequence space is recycled fastly,
3852 * but it guarantees that such events will be very rare and do not affect
3853 * connection seriously. This doesn't look nice, but alas, PAWS is really
3856 * [ Later note. Even worse! It is buggy for segments _with_ data. RFC
3857 * states that events when retransmit arrives after original data are rare.
3858 * It is a blatant lie. VJ forgot about fast retransmit! 8)8) It is
3859 * the biggest problem on large power networks even with minor reordering.
3860 * OK, let's give it small replay window. If peer clock is even 1hz, it is safe
3861 * up to bandwidth of 18Gigabit/sec. 8) ]
3864 static int tcp_disordered_ack(const struct sock *sk, const struct sk_buff *skb)
3866 const struct tcp_sock *tp = tcp_sk(sk);
3867 const struct tcphdr *th = tcp_hdr(skb);
3868 u32 seq = TCP_SKB_CB(skb)->seq;
3869 u32 ack = TCP_SKB_CB(skb)->ack_seq;
3871 return (/* 1. Pure ACK with correct sequence number. */
3872 (th->ack && seq == TCP_SKB_CB(skb)->end_seq && seq == tp->rcv_nxt) &&
3874 /* 2. ... and duplicate ACK. */
3875 ack == tp->snd_una &&
3877 /* 3. ... and does not update window. */
3878 !tcp_may_update_window(tp, ack, seq, ntohs(th->window) << tp->rx_opt.snd_wscale) &&
3880 /* 4. ... and sits in replay window. */
3881 (s32)(tp->rx_opt.ts_recent - tp->rx_opt.rcv_tsval) <= (inet_csk(sk)->icsk_rto * 1024) / HZ);
3884 static inline bool tcp_paws_discard(const struct sock *sk,
3885 const struct sk_buff *skb)
3887 const struct tcp_sock *tp = tcp_sk(sk);
3889 return !tcp_paws_check(&tp->rx_opt, TCP_PAWS_WINDOW) &&
3890 !tcp_disordered_ack(sk, skb);
3893 /* Check segment sequence number for validity.
3895 * Segment controls are considered valid, if the segment
3896 * fits to the window after truncation to the window. Acceptability
3897 * of data (and SYN, FIN, of course) is checked separately.
3898 * See tcp_data_queue(), for example.
3900 * Also, controls (RST is main one) are accepted using RCV.WUP instead
3901 * of RCV.NXT. Peer still did not advance his SND.UNA when we
3902 * delayed ACK, so that hisSND.UNA<=ourRCV.WUP.
3903 * (borrowed from freebsd)
3906 static inline bool tcp_sequence(const struct tcp_sock *tp, u32 seq, u32 end_seq)
3908 return !before(end_seq, tp->rcv_wup) &&
3909 !after(seq, tp->rcv_nxt + tcp_receive_window(tp));
3912 /* When we get a reset we do this. */
3913 void tcp_reset(struct sock *sk)
3915 /* We want the right error as BSD sees it (and indeed as we do). */
3916 switch (sk->sk_state) {
3918 sk->sk_err = ECONNREFUSED;
3920 case TCP_CLOSE_WAIT:
3926 sk->sk_err = ECONNRESET;
3928 /* This barrier is coupled with smp_rmb() in tcp_poll() */
3931 if (!sock_flag(sk, SOCK_DEAD))
3932 sk->sk_error_report(sk);
3938 * Process the FIN bit. This now behaves as it is supposed to work
3939 * and the FIN takes effect when it is validly part of sequence
3940 * space. Not before when we get holes.
3942 * If we are ESTABLISHED, a received fin moves us to CLOSE-WAIT
3943 * (and thence onto LAST-ACK and finally, CLOSE, we never enter
3946 * If we are in FINWAIT-1, a received FIN indicates simultaneous
3947 * close and we go into CLOSING (and later onto TIME-WAIT)
3949 * If we are in FINWAIT-2, a received FIN moves us to TIME-WAIT.
3951 static void tcp_fin(struct sock *sk)
3953 struct tcp_sock *tp = tcp_sk(sk);
3954 const struct dst_entry *dst;
3956 inet_csk_schedule_ack(sk);
3958 sk->sk_shutdown |= RCV_SHUTDOWN;
3959 sock_set_flag(sk, SOCK_DONE);
3961 switch (sk->sk_state) {
3963 case TCP_ESTABLISHED:
3964 /* Move to CLOSE_WAIT */
3965 tcp_set_state(sk, TCP_CLOSE_WAIT);
3966 dst = __sk_dst_get(sk);
3967 if (!dst || !dst_metric(dst, RTAX_QUICKACK))
3968 inet_csk(sk)->icsk_ack.pingpong = 1;
3971 case TCP_CLOSE_WAIT:
3973 /* Received a retransmission of the FIN, do
3978 /* RFC793: Remain in the LAST-ACK state. */
3982 /* This case occurs when a simultaneous close
3983 * happens, we must ack the received FIN and
3984 * enter the CLOSING state.
3987 tcp_set_state(sk, TCP_CLOSING);
3990 /* Received a FIN -- send ACK and enter TIME_WAIT. */
3992 tcp_time_wait(sk, TCP_TIME_WAIT, 0);
3995 /* Only TCP_LISTEN and TCP_CLOSE are left, in these
3996 * cases we should never reach this piece of code.
3998 pr_err("%s: Impossible, sk->sk_state=%d\n",
3999 __func__, sk->sk_state);
4003 /* It _is_ possible, that we have something out-of-order _after_ FIN.
4004 * Probably, we should reset in this case. For now drop them.
4006 __skb_queue_purge(&tp->out_of_order_queue);
4007 if (tcp_is_sack(tp))
4008 tcp_sack_reset(&tp->rx_opt);
4011 if (!sock_flag(sk, SOCK_DEAD)) {
4012 sk->sk_state_change(sk);
4014 /* Do not send POLL_HUP for half duplex close. */
4015 if (sk->sk_shutdown == SHUTDOWN_MASK ||
4016 sk->sk_state == TCP_CLOSE)
4017 sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_HUP);
4019 sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_IN);
4023 static inline bool tcp_sack_extend(struct tcp_sack_block *sp, u32 seq,
4026 if (!after(seq, sp->end_seq) && !after(sp->start_seq, end_seq)) {
4027 if (before(seq, sp->start_seq))
4028 sp->start_seq = seq;
4029 if (after(end_seq, sp->end_seq))
4030 sp->end_seq = end_seq;
4036 static void tcp_dsack_set(struct sock *sk, u32 seq, u32 end_seq)
4038 struct tcp_sock *tp = tcp_sk(sk);
4040 if (tcp_is_sack(tp) && sysctl_tcp_dsack) {
4043 if (before(seq, tp->rcv_nxt))
4044 mib_idx = LINUX_MIB_TCPDSACKOLDSENT;
4046 mib_idx = LINUX_MIB_TCPDSACKOFOSENT;
4048 NET_INC_STATS_BH(sock_net(sk), mib_idx);
4050 tp->rx_opt.dsack = 1;
4051 tp->duplicate_sack[0].start_seq = seq;
4052 tp->duplicate_sack[0].end_seq = end_seq;
4056 static void tcp_dsack_extend(struct sock *sk, u32 seq, u32 end_seq)
4058 struct tcp_sock *tp = tcp_sk(sk);
4060 if (!tp->rx_opt.dsack)
4061 tcp_dsack_set(sk, seq, end_seq);
4063 tcp_sack_extend(tp->duplicate_sack, seq, end_seq);
4066 static void tcp_send_dupack(struct sock *sk, const struct sk_buff *skb)
4068 struct tcp_sock *tp = tcp_sk(sk);
4070 if (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
4071 before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
4072 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_DELAYEDACKLOST);
4073 tcp_enter_quickack_mode(sk);
4075 if (tcp_is_sack(tp) && sysctl_tcp_dsack) {
4076 u32 end_seq = TCP_SKB_CB(skb)->end_seq;
4078 if (after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt))
4079 end_seq = tp->rcv_nxt;
4080 tcp_dsack_set(sk, TCP_SKB_CB(skb)->seq, end_seq);
4087 /* These routines update the SACK block as out-of-order packets arrive or
4088 * in-order packets close up the sequence space.
4090 static void tcp_sack_maybe_coalesce(struct tcp_sock *tp)
4093 struct tcp_sack_block *sp = &tp->selective_acks[0];
4094 struct tcp_sack_block *swalk = sp + 1;
4096 /* See if the recent change to the first SACK eats into
4097 * or hits the sequence space of other SACK blocks, if so coalesce.
4099 for (this_sack = 1; this_sack < tp->rx_opt.num_sacks;) {
4100 if (tcp_sack_extend(sp, swalk->start_seq, swalk->end_seq)) {
4103 /* Zap SWALK, by moving every further SACK up by one slot.
4104 * Decrease num_sacks.
4106 tp->rx_opt.num_sacks--;
4107 for (i = this_sack; i < tp->rx_opt.num_sacks; i++)
4111 this_sack++, swalk++;
4115 static void tcp_sack_new_ofo_skb(struct sock *sk, u32 seq, u32 end_seq)
4117 struct tcp_sock *tp = tcp_sk(sk);
4118 struct tcp_sack_block *sp = &tp->selective_acks[0];
4119 int cur_sacks = tp->rx_opt.num_sacks;
4125 for (this_sack = 0; this_sack < cur_sacks; this_sack++, sp++) {
4126 if (tcp_sack_extend(sp, seq, end_seq)) {
4127 /* Rotate this_sack to the first one. */
4128 for (; this_sack > 0; this_sack--, sp--)
4129 swap(*sp, *(sp - 1));
4131 tcp_sack_maybe_coalesce(tp);
4136 /* Could not find an adjacent existing SACK, build a new one,
4137 * put it at the front, and shift everyone else down. We
4138 * always know there is at least one SACK present already here.
4140 * If the sack array is full, forget about the last one.
4142 if (this_sack >= TCP_NUM_SACKS) {
4144 tp->rx_opt.num_sacks--;
4147 for (; this_sack > 0; this_sack--, sp--)
4151 /* Build the new head SACK, and we're done. */
4152 sp->start_seq = seq;
4153 sp->end_seq = end_seq;
4154 tp->rx_opt.num_sacks++;
4157 /* RCV.NXT advances, some SACKs should be eaten. */
4159 static void tcp_sack_remove(struct tcp_sock *tp)
4161 struct tcp_sack_block *sp = &tp->selective_acks[0];
4162 int num_sacks = tp->rx_opt.num_sacks;
4165 /* Empty ofo queue, hence, all the SACKs are eaten. Clear. */
4166 if (skb_queue_empty(&tp->out_of_order_queue)) {
4167 tp->rx_opt.num_sacks = 0;
4171 for (this_sack = 0; this_sack < num_sacks;) {
4172 /* Check if the start of the sack is covered by RCV.NXT. */
4173 if (!before(tp->rcv_nxt, sp->start_seq)) {
4176 /* RCV.NXT must cover all the block! */
4177 WARN_ON(before(tp->rcv_nxt, sp->end_seq));
4179 /* Zap this SACK, by moving forward any other SACKS. */
4180 for (i = this_sack+1; i < num_sacks; i++)
4181 tp->selective_acks[i-1] = tp->selective_acks[i];
4188 tp->rx_opt.num_sacks = num_sacks;
4192 * tcp_try_coalesce - try to merge skb to prior one
4195 * @from: buffer to add in queue
4196 * @fragstolen: pointer to boolean
4198 * Before queueing skb @from after @to, try to merge them
4199 * to reduce overall memory use and queue lengths, if cost is small.
4200 * Packets in ofo or receive queues can stay a long time.
4201 * Better try to coalesce them right now to avoid future collapses.
4202 * Returns true if caller should free @from instead of queueing it
4204 static bool tcp_try_coalesce(struct sock *sk,
4206 struct sk_buff *from,
4211 *fragstolen = false;
4213 /* Its possible this segment overlaps with prior segment in queue */
4214 if (TCP_SKB_CB(from)->seq != TCP_SKB_CB(to)->end_seq)
4217 if (!skb_try_coalesce(to, from, fragstolen, &delta))
4220 atomic_add(delta, &sk->sk_rmem_alloc);
4221 sk_mem_charge(sk, delta);
4222 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPRCVCOALESCE);
4223 TCP_SKB_CB(to)->end_seq = TCP_SKB_CB(from)->end_seq;
4224 TCP_SKB_CB(to)->ack_seq = TCP_SKB_CB(from)->ack_seq;
4225 TCP_SKB_CB(to)->tcp_flags |= TCP_SKB_CB(from)->tcp_flags;
4229 /* This one checks to see if we can put data from the
4230 * out_of_order queue into the receive_queue.
4232 static void tcp_ofo_queue(struct sock *sk)
4234 struct tcp_sock *tp = tcp_sk(sk);
4235 __u32 dsack_high = tp->rcv_nxt;
4236 struct sk_buff *skb, *tail;
4237 bool fragstolen, eaten;
4239 while ((skb = skb_peek(&tp->out_of_order_queue)) != NULL) {
4240 if (after(TCP_SKB_CB(skb)->seq, tp->rcv_nxt))
4243 if (before(TCP_SKB_CB(skb)->seq, dsack_high)) {
4244 __u32 dsack = dsack_high;
4245 if (before(TCP_SKB_CB(skb)->end_seq, dsack_high))
4246 dsack_high = TCP_SKB_CB(skb)->end_seq;
4247 tcp_dsack_extend(sk, TCP_SKB_CB(skb)->seq, dsack);
4250 __skb_unlink(skb, &tp->out_of_order_queue);
4251 if (!after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt)) {
4252 SOCK_DEBUG(sk, "ofo packet was already received\n");
4256 SOCK_DEBUG(sk, "ofo requeuing : rcv_next %X seq %X - %X\n",
4257 tp->rcv_nxt, TCP_SKB_CB(skb)->seq,
4258 TCP_SKB_CB(skb)->end_seq);
4260 tail = skb_peek_tail(&sk->sk_receive_queue);
4261 eaten = tail && tcp_try_coalesce(sk, tail, skb, &fragstolen);
4262 tcp_rcv_nxt_update(tp, TCP_SKB_CB(skb)->end_seq);
4264 __skb_queue_tail(&sk->sk_receive_queue, skb);
4265 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)
4268 kfree_skb_partial(skb, fragstolen);
4272 static bool tcp_prune_ofo_queue(struct sock *sk);
4273 static int tcp_prune_queue(struct sock *sk);
4275 static int tcp_try_rmem_schedule(struct sock *sk, struct sk_buff *skb,
4278 if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf ||
4279 !sk_rmem_schedule(sk, skb, size)) {
4281 if (tcp_prune_queue(sk) < 0)
4284 if (!sk_rmem_schedule(sk, skb, size)) {
4285 if (!tcp_prune_ofo_queue(sk))
4288 if (!sk_rmem_schedule(sk, skb, size))
4295 static void tcp_data_queue_ofo(struct sock *sk, struct sk_buff *skb)
4297 struct tcp_sock *tp = tcp_sk(sk);
4298 struct sk_buff *skb1;
4301 tcp_ecn_check_ce(tp, skb);
4303 if (unlikely(tcp_try_rmem_schedule(sk, skb, skb->truesize))) {
4304 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPOFODROP);
4309 /* Disable header prediction. */
4311 inet_csk_schedule_ack(sk);
4313 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPOFOQUEUE);
4314 SOCK_DEBUG(sk, "out of order segment: rcv_next %X seq %X - %X\n",
4315 tp->rcv_nxt, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq);
4317 skb1 = skb_peek_tail(&tp->out_of_order_queue);
4319 /* Initial out of order segment, build 1 SACK. */
4320 if (tcp_is_sack(tp)) {
4321 tp->rx_opt.num_sacks = 1;
4322 tp->selective_acks[0].start_seq = TCP_SKB_CB(skb)->seq;
4323 tp->selective_acks[0].end_seq =
4324 TCP_SKB_CB(skb)->end_seq;
4326 __skb_queue_head(&tp->out_of_order_queue, skb);
4330 seq = TCP_SKB_CB(skb)->seq;
4331 end_seq = TCP_SKB_CB(skb)->end_seq;
4333 if (seq == TCP_SKB_CB(skb1)->end_seq) {
4336 if (!tcp_try_coalesce(sk, skb1, skb, &fragstolen)) {
4337 __skb_queue_after(&tp->out_of_order_queue, skb1, skb);
4339 tcp_grow_window(sk, skb);
4340 kfree_skb_partial(skb, fragstolen);
4344 if (!tp->rx_opt.num_sacks ||
4345 tp->selective_acks[0].end_seq != seq)
4348 /* Common case: data arrive in order after hole. */
4349 tp->selective_acks[0].end_seq = end_seq;
4353 /* Find place to insert this segment. */
4355 if (!after(TCP_SKB_CB(skb1)->seq, seq))
4357 if (skb_queue_is_first(&tp->out_of_order_queue, skb1)) {
4361 skb1 = skb_queue_prev(&tp->out_of_order_queue, skb1);
4364 /* Do skb overlap to previous one? */
4365 if (skb1 && before(seq, TCP_SKB_CB(skb1)->end_seq)) {
4366 if (!after(end_seq, TCP_SKB_CB(skb1)->end_seq)) {
4367 /* All the bits are present. Drop. */
4368 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPOFOMERGE);
4371 tcp_dsack_set(sk, seq, end_seq);
4374 if (after(seq, TCP_SKB_CB(skb1)->seq)) {
4375 /* Partial overlap. */
4376 tcp_dsack_set(sk, seq,
4377 TCP_SKB_CB(skb1)->end_seq);
4379 if (skb_queue_is_first(&tp->out_of_order_queue,
4383 skb1 = skb_queue_prev(
4384 &tp->out_of_order_queue,
4389 __skb_queue_head(&tp->out_of_order_queue, skb);
4391 __skb_queue_after(&tp->out_of_order_queue, skb1, skb);
4393 /* And clean segments covered by new one as whole. */
4394 while (!skb_queue_is_last(&tp->out_of_order_queue, skb)) {
4395 skb1 = skb_queue_next(&tp->out_of_order_queue, skb);
4397 if (!after(end_seq, TCP_SKB_CB(skb1)->seq))
4399 if (before(end_seq, TCP_SKB_CB(skb1)->end_seq)) {
4400 tcp_dsack_extend(sk, TCP_SKB_CB(skb1)->seq,
4404 __skb_unlink(skb1, &tp->out_of_order_queue);
4405 tcp_dsack_extend(sk, TCP_SKB_CB(skb1)->seq,
4406 TCP_SKB_CB(skb1)->end_seq);
4407 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPOFOMERGE);
4412 if (tcp_is_sack(tp))
4413 tcp_sack_new_ofo_skb(sk, seq, end_seq);
4416 tcp_grow_window(sk, skb);
4417 skb_set_owner_r(skb, sk);
4421 static int __must_check tcp_queue_rcv(struct sock *sk, struct sk_buff *skb, int hdrlen,
4425 struct sk_buff *tail = skb_peek_tail(&sk->sk_receive_queue);
4427 __skb_pull(skb, hdrlen);
4429 tcp_try_coalesce(sk, tail, skb, fragstolen)) ? 1 : 0;
4430 tcp_rcv_nxt_update(tcp_sk(sk), TCP_SKB_CB(skb)->end_seq);
4432 __skb_queue_tail(&sk->sk_receive_queue, skb);
4433 skb_set_owner_r(skb, sk);
4438 int tcp_send_rcvq(struct sock *sk, struct msghdr *msg, size_t size)
4440 struct sk_buff *skb;
4446 skb = alloc_skb(size, sk->sk_allocation);
4450 if (tcp_try_rmem_schedule(sk, skb, skb->truesize))
4453 if (memcpy_from_msg(skb_put(skb, size), msg, size))
4456 TCP_SKB_CB(skb)->seq = tcp_sk(sk)->rcv_nxt;
4457 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq + size;
4458 TCP_SKB_CB(skb)->ack_seq = tcp_sk(sk)->snd_una - 1;
4460 if (tcp_queue_rcv(sk, skb, 0, &fragstolen)) {
4461 WARN_ON_ONCE(fragstolen); /* should not happen */
4472 static void tcp_data_queue(struct sock *sk, struct sk_buff *skb)
4474 struct tcp_sock *tp = tcp_sk(sk);
4476 bool fragstolen = false;
4478 if (TCP_SKB_CB(skb)->seq == TCP_SKB_CB(skb)->end_seq)
4482 __skb_pull(skb, tcp_hdr(skb)->doff * 4);
4484 tcp_ecn_accept_cwr(tp, skb);
4486 tp->rx_opt.dsack = 0;
4488 /* Queue data for delivery to the user.
4489 * Packets in sequence go to the receive queue.
4490 * Out of sequence packets to the out_of_order_queue.
4492 if (TCP_SKB_CB(skb)->seq == tp->rcv_nxt) {
4493 if (tcp_receive_window(tp) == 0)
4496 /* Ok. In sequence. In window. */
4497 if (tp->ucopy.task == current &&
4498 tp->copied_seq == tp->rcv_nxt && tp->ucopy.len &&
4499 sock_owned_by_user(sk) && !tp->urg_data) {
4500 int chunk = min_t(unsigned int, skb->len,
4503 __set_current_state(TASK_RUNNING);
4506 if (!skb_copy_datagram_msg(skb, 0, tp->ucopy.msg, chunk)) {
4507 tp->ucopy.len -= chunk;
4508 tp->copied_seq += chunk;
4509 eaten = (chunk == skb->len);
4510 tcp_rcv_space_adjust(sk);
4518 if (skb_queue_len(&sk->sk_receive_queue) == 0)
4519 sk_forced_mem_schedule(sk, skb->truesize);
4520 else if (tcp_try_rmem_schedule(sk, skb, skb->truesize))
4523 eaten = tcp_queue_rcv(sk, skb, 0, &fragstolen);
4525 tcp_rcv_nxt_update(tp, TCP_SKB_CB(skb)->end_seq);
4527 tcp_event_data_recv(sk, skb);
4528 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)
4531 if (!skb_queue_empty(&tp->out_of_order_queue)) {
4534 /* RFC2581. 4.2. SHOULD send immediate ACK, when
4535 * gap in queue is filled.
4537 if (skb_queue_empty(&tp->out_of_order_queue))
4538 inet_csk(sk)->icsk_ack.pingpong = 0;
4541 if (tp->rx_opt.num_sacks)
4542 tcp_sack_remove(tp);
4544 tcp_fast_path_check(sk);
4547 kfree_skb_partial(skb, fragstolen);
4548 if (!sock_flag(sk, SOCK_DEAD))
4549 sk->sk_data_ready(sk);
4553 if (!after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt)) {
4554 /* A retransmit, 2nd most common case. Force an immediate ack. */
4555 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_DELAYEDACKLOST);
4556 tcp_dsack_set(sk, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq);
4559 tcp_enter_quickack_mode(sk);
4560 inet_csk_schedule_ack(sk);
4566 /* Out of window. F.e. zero window probe. */
4567 if (!before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt + tcp_receive_window(tp)))
4570 tcp_enter_quickack_mode(sk);
4572 if (before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
4573 /* Partial packet, seq < rcv_next < end_seq */
4574 SOCK_DEBUG(sk, "partial packet: rcv_next %X seq %X - %X\n",
4575 tp->rcv_nxt, TCP_SKB_CB(skb)->seq,
4576 TCP_SKB_CB(skb)->end_seq);
4578 tcp_dsack_set(sk, TCP_SKB_CB(skb)->seq, tp->rcv_nxt);
4580 /* If window is closed, drop tail of packet. But after
4581 * remembering D-SACK for its head made in previous line.
4583 if (!tcp_receive_window(tp))
4588 tcp_data_queue_ofo(sk, skb);
4591 static struct sk_buff *tcp_collapse_one(struct sock *sk, struct sk_buff *skb,
4592 struct sk_buff_head *list)
4594 struct sk_buff *next = NULL;
4596 if (!skb_queue_is_last(list, skb))
4597 next = skb_queue_next(list, skb);
4599 __skb_unlink(skb, list);
4601 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPRCVCOLLAPSED);
4606 /* Collapse contiguous sequence of skbs head..tail with
4607 * sequence numbers start..end.
4609 * If tail is NULL, this means until the end of the list.
4611 * Segments with FIN/SYN are not collapsed (only because this
4615 tcp_collapse(struct sock *sk, struct sk_buff_head *list,
4616 struct sk_buff *head, struct sk_buff *tail,
4619 struct sk_buff *skb, *n;
4622 /* First, check that queue is collapsible and find
4623 * the point where collapsing can be useful. */
4627 skb_queue_walk_from_safe(list, skb, n) {
4630 /* No new bits? It is possible on ofo queue. */
4631 if (!before(start, TCP_SKB_CB(skb)->end_seq)) {
4632 skb = tcp_collapse_one(sk, skb, list);
4638 /* The first skb to collapse is:
4640 * - bloated or contains data before "start" or
4641 * overlaps to the next one.
4643 if (!(TCP_SKB_CB(skb)->tcp_flags & (TCPHDR_SYN | TCPHDR_FIN)) &&
4644 (tcp_win_from_space(skb->truesize) > skb->len ||
4645 before(TCP_SKB_CB(skb)->seq, start))) {
4646 end_of_skbs = false;
4650 if (!skb_queue_is_last(list, skb)) {
4651 struct sk_buff *next = skb_queue_next(list, skb);
4653 TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(next)->seq) {
4654 end_of_skbs = false;
4659 /* Decided to skip this, advance start seq. */
4660 start = TCP_SKB_CB(skb)->end_seq;
4663 (TCP_SKB_CB(skb)->tcp_flags & (TCPHDR_SYN | TCPHDR_FIN)))
4666 while (before(start, end)) {
4667 int copy = min_t(int, SKB_MAX_ORDER(0, 0), end - start);
4668 struct sk_buff *nskb;
4670 nskb = alloc_skb(copy, GFP_ATOMIC);
4674 memcpy(nskb->cb, skb->cb, sizeof(skb->cb));
4675 TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(nskb)->end_seq = start;
4676 __skb_queue_before(list, skb, nskb);
4677 skb_set_owner_r(nskb, sk);
4679 /* Copy data, releasing collapsed skbs. */
4681 int offset = start - TCP_SKB_CB(skb)->seq;
4682 int size = TCP_SKB_CB(skb)->end_seq - start;
4686 size = min(copy, size);
4687 if (skb_copy_bits(skb, offset, skb_put(nskb, size), size))
4689 TCP_SKB_CB(nskb)->end_seq += size;
4693 if (!before(start, TCP_SKB_CB(skb)->end_seq)) {
4694 skb = tcp_collapse_one(sk, skb, list);
4697 (TCP_SKB_CB(skb)->tcp_flags & (TCPHDR_SYN | TCPHDR_FIN)))
4704 /* Collapse ofo queue. Algorithm: select contiguous sequence of skbs
4705 * and tcp_collapse() them until all the queue is collapsed.
4707 static void tcp_collapse_ofo_queue(struct sock *sk)
4709 struct tcp_sock *tp = tcp_sk(sk);
4710 struct sk_buff *skb = skb_peek(&tp->out_of_order_queue);
4711 struct sk_buff *head;
4717 start = TCP_SKB_CB(skb)->seq;
4718 end = TCP_SKB_CB(skb)->end_seq;
4722 struct sk_buff *next = NULL;
4724 if (!skb_queue_is_last(&tp->out_of_order_queue, skb))
4725 next = skb_queue_next(&tp->out_of_order_queue, skb);
4728 /* Segment is terminated when we see gap or when
4729 * we are at the end of all the queue. */
4731 after(TCP_SKB_CB(skb)->seq, end) ||
4732 before(TCP_SKB_CB(skb)->end_seq, start)) {
4733 tcp_collapse(sk, &tp->out_of_order_queue,
4734 head, skb, start, end);
4738 /* Start new segment */
4739 start = TCP_SKB_CB(skb)->seq;
4740 end = TCP_SKB_CB(skb)->end_seq;
4742 if (before(TCP_SKB_CB(skb)->seq, start))
4743 start = TCP_SKB_CB(skb)->seq;
4744 if (after(TCP_SKB_CB(skb)->end_seq, end))
4745 end = TCP_SKB_CB(skb)->end_seq;
4751 * Purge the out-of-order queue.
4752 * Return true if queue was pruned.
4754 static bool tcp_prune_ofo_queue(struct sock *sk)
4756 struct tcp_sock *tp = tcp_sk(sk);
4759 if (!skb_queue_empty(&tp->out_of_order_queue)) {
4760 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_OFOPRUNED);
4761 __skb_queue_purge(&tp->out_of_order_queue);
4763 /* Reset SACK state. A conforming SACK implementation will
4764 * do the same at a timeout based retransmit. When a connection
4765 * is in a sad state like this, we care only about integrity
4766 * of the connection not performance.
4768 if (tp->rx_opt.sack_ok)
4769 tcp_sack_reset(&tp->rx_opt);
4776 /* Reduce allocated memory if we can, trying to get
4777 * the socket within its memory limits again.
4779 * Return less than zero if we should start dropping frames
4780 * until the socket owning process reads some of the data
4781 * to stabilize the situation.
4783 static int tcp_prune_queue(struct sock *sk)
4785 struct tcp_sock *tp = tcp_sk(sk);
4787 SOCK_DEBUG(sk, "prune_queue: c=%x\n", tp->copied_seq);
4789 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_PRUNECALLED);
4791 if (atomic_read(&sk->sk_rmem_alloc) >= sk->sk_rcvbuf)
4792 tcp_clamp_window(sk);
4793 else if (tcp_under_memory_pressure(sk))
4794 tp->rcv_ssthresh = min(tp->rcv_ssthresh, 4U * tp->advmss);
4796 tcp_collapse_ofo_queue(sk);
4797 if (!skb_queue_empty(&sk->sk_receive_queue))
4798 tcp_collapse(sk, &sk->sk_receive_queue,
4799 skb_peek(&sk->sk_receive_queue),
4801 tp->copied_seq, tp->rcv_nxt);
4804 if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf)
4807 /* Collapsing did not help, destructive actions follow.
4808 * This must not ever occur. */
4810 tcp_prune_ofo_queue(sk);
4812 if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf)
4815 /* If we are really being abused, tell the caller to silently
4816 * drop receive data on the floor. It will get retransmitted
4817 * and hopefully then we'll have sufficient space.
4819 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_RCVPRUNED);
4821 /* Massive buffer overcommit. */
4826 static bool tcp_should_expand_sndbuf(const struct sock *sk)
4828 const struct tcp_sock *tp = tcp_sk(sk);
4830 /* If the user specified a specific send buffer setting, do
4833 if (sk->sk_userlocks & SOCK_SNDBUF_LOCK)
4836 /* If we are under global TCP memory pressure, do not expand. */
4837 if (tcp_under_memory_pressure(sk))
4840 /* If we are under soft global TCP memory pressure, do not expand. */
4841 if (sk_memory_allocated(sk) >= sk_prot_mem_limits(sk, 0))
4844 /* If we filled the congestion window, do not expand. */
4845 if (tcp_packets_in_flight(tp) >= tp->snd_cwnd)
4851 /* When incoming ACK allowed to free some skb from write_queue,
4852 * we remember this event in flag SOCK_QUEUE_SHRUNK and wake up socket
4853 * on the exit from tcp input handler.
4855 * PROBLEM: sndbuf expansion does not work well with largesend.
4857 static void tcp_new_space(struct sock *sk)
4859 struct tcp_sock *tp = tcp_sk(sk);
4861 if (tcp_should_expand_sndbuf(sk)) {
4862 tcp_sndbuf_expand(sk);
4863 tp->snd_cwnd_stamp = tcp_time_stamp;
4866 sk->sk_write_space(sk);
4869 static void tcp_check_space(struct sock *sk)
4871 if (sock_flag(sk, SOCK_QUEUE_SHRUNK)) {
4872 sock_reset_flag(sk, SOCK_QUEUE_SHRUNK);
4873 /* pairs with tcp_poll() */
4874 smp_mb__after_atomic();
4875 if (sk->sk_socket &&
4876 test_bit(SOCK_NOSPACE, &sk->sk_socket->flags))
4881 static inline void tcp_data_snd_check(struct sock *sk)
4883 tcp_push_pending_frames(sk);
4884 tcp_check_space(sk);
4888 * Check if sending an ack is needed.
4890 static void __tcp_ack_snd_check(struct sock *sk, int ofo_possible)
4892 struct tcp_sock *tp = tcp_sk(sk);
4894 /* More than one full frame received... */
4895 if (((tp->rcv_nxt - tp->rcv_wup) > inet_csk(sk)->icsk_ack.rcv_mss &&
4896 /* ... and right edge of window advances far enough.
4897 * (tcp_recvmsg() will send ACK otherwise). Or...
4899 __tcp_select_window(sk) >= tp->rcv_wnd) ||
4900 /* We ACK each frame or... */
4901 tcp_in_quickack_mode(sk) ||
4902 /* We have out of order data. */
4903 (ofo_possible && skb_peek(&tp->out_of_order_queue))) {
4904 /* Then ack it now */
4907 /* Else, send delayed ack. */
4908 tcp_send_delayed_ack(sk);
4912 static inline void tcp_ack_snd_check(struct sock *sk)
4914 if (!inet_csk_ack_scheduled(sk)) {
4915 /* We sent a data segment already. */
4918 __tcp_ack_snd_check(sk, 1);
4922 * This routine is only called when we have urgent data
4923 * signaled. Its the 'slow' part of tcp_urg. It could be
4924 * moved inline now as tcp_urg is only called from one
4925 * place. We handle URGent data wrong. We have to - as
4926 * BSD still doesn't use the correction from RFC961.
4927 * For 1003.1g we should support a new option TCP_STDURG to permit
4928 * either form (or just set the sysctl tcp_stdurg).
4931 static void tcp_check_urg(struct sock *sk, const struct tcphdr *th)
4933 struct tcp_sock *tp = tcp_sk(sk);
4934 u32 ptr = ntohs(th->urg_ptr);
4936 if (ptr && !sysctl_tcp_stdurg)
4938 ptr += ntohl(th->seq);
4940 /* Ignore urgent data that we've already seen and read. */
4941 if (after(tp->copied_seq, ptr))
4944 /* Do not replay urg ptr.
4946 * NOTE: interesting situation not covered by specs.
4947 * Misbehaving sender may send urg ptr, pointing to segment,
4948 * which we already have in ofo queue. We are not able to fetch
4949 * such data and will stay in TCP_URG_NOTYET until will be eaten
4950 * by recvmsg(). Seems, we are not obliged to handle such wicked
4951 * situations. But it is worth to think about possibility of some
4952 * DoSes using some hypothetical application level deadlock.
4954 if (before(ptr, tp->rcv_nxt))
4957 /* Do we already have a newer (or duplicate) urgent pointer? */
4958 if (tp->urg_data && !after(ptr, tp->urg_seq))
4961 /* Tell the world about our new urgent pointer. */
4964 /* We may be adding urgent data when the last byte read was
4965 * urgent. To do this requires some care. We cannot just ignore
4966 * tp->copied_seq since we would read the last urgent byte again
4967 * as data, nor can we alter copied_seq until this data arrives
4968 * or we break the semantics of SIOCATMARK (and thus sockatmark())
4970 * NOTE. Double Dutch. Rendering to plain English: author of comment
4971 * above did something sort of send("A", MSG_OOB); send("B", MSG_OOB);
4972 * and expect that both A and B disappear from stream. This is _wrong_.
4973 * Though this happens in BSD with high probability, this is occasional.
4974 * Any application relying on this is buggy. Note also, that fix "works"
4975 * only in this artificial test. Insert some normal data between A and B and we will
4976 * decline of BSD again. Verdict: it is better to remove to trap
4979 if (tp->urg_seq == tp->copied_seq && tp->urg_data &&
4980 !sock_flag(sk, SOCK_URGINLINE) && tp->copied_seq != tp->rcv_nxt) {
4981 struct sk_buff *skb = skb_peek(&sk->sk_receive_queue);
4983 if (skb && !before(tp->copied_seq, TCP_SKB_CB(skb)->end_seq)) {
4984 __skb_unlink(skb, &sk->sk_receive_queue);
4989 tp->urg_data = TCP_URG_NOTYET;
4992 /* Disable header prediction. */
4996 /* This is the 'fast' part of urgent handling. */
4997 static void tcp_urg(struct sock *sk, struct sk_buff *skb, const struct tcphdr *th)
4999 struct tcp_sock *tp = tcp_sk(sk);
5001 /* Check if we get a new urgent pointer - normally not. */
5003 tcp_check_urg(sk, th);
5005 /* Do we wait for any urgent data? - normally not... */
5006 if (tp->urg_data == TCP_URG_NOTYET) {
5007 u32 ptr = tp->urg_seq - ntohl(th->seq) + (th->doff * 4) -
5010 /* Is the urgent pointer pointing into this packet? */
5011 if (ptr < skb->len) {
5013 if (skb_copy_bits(skb, ptr, &tmp, 1))
5015 tp->urg_data = TCP_URG_VALID | tmp;
5016 if (!sock_flag(sk, SOCK_DEAD))
5017 sk->sk_data_ready(sk);
5022 static int tcp_copy_to_iovec(struct sock *sk, struct sk_buff *skb, int hlen)
5024 struct tcp_sock *tp = tcp_sk(sk);
5025 int chunk = skb->len - hlen;
5029 if (skb_csum_unnecessary(skb))
5030 err = skb_copy_datagram_msg(skb, hlen, tp->ucopy.msg, chunk);
5032 err = skb_copy_and_csum_datagram_msg(skb, hlen, tp->ucopy.msg);
5035 tp->ucopy.len -= chunk;
5036 tp->copied_seq += chunk;
5037 tcp_rcv_space_adjust(sk);
5044 static __sum16 __tcp_checksum_complete_user(struct sock *sk,
5045 struct sk_buff *skb)
5049 if (sock_owned_by_user(sk)) {
5051 result = __tcp_checksum_complete(skb);
5054 result = __tcp_checksum_complete(skb);
5059 static inline bool tcp_checksum_complete_user(struct sock *sk,
5060 struct sk_buff *skb)
5062 return !skb_csum_unnecessary(skb) &&
5063 __tcp_checksum_complete_user(sk, skb);
5066 /* Does PAWS and seqno based validation of an incoming segment, flags will
5067 * play significant role here.
5069 static bool tcp_validate_incoming(struct sock *sk, struct sk_buff *skb,
5070 const struct tcphdr *th, int syn_inerr)
5072 struct tcp_sock *tp = tcp_sk(sk);
5074 /* RFC1323: H1. Apply PAWS check first. */
5075 if (tcp_fast_parse_options(skb, th, tp) && tp->rx_opt.saw_tstamp &&
5076 tcp_paws_discard(sk, skb)) {
5078 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_PAWSESTABREJECTED);
5079 if (!tcp_oow_rate_limited(sock_net(sk), skb,
5080 LINUX_MIB_TCPACKSKIPPEDPAWS,
5081 &tp->last_oow_ack_time))
5082 tcp_send_dupack(sk, skb);
5085 /* Reset is accepted even if it did not pass PAWS. */
5088 /* Step 1: check sequence number */
5089 if (!tcp_sequence(tp, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq)) {
5090 /* RFC793, page 37: "In all states except SYN-SENT, all reset
5091 * (RST) segments are validated by checking their SEQ-fields."
5092 * And page 69: "If an incoming segment is not acceptable,
5093 * an acknowledgment should be sent in reply (unless the RST
5094 * bit is set, if so drop the segment and return)".
5099 if (!tcp_oow_rate_limited(sock_net(sk), skb,
5100 LINUX_MIB_TCPACKSKIPPEDSEQ,
5101 &tp->last_oow_ack_time))
5102 tcp_send_dupack(sk, skb);
5107 /* Step 2: check RST bit */
5110 * If sequence number exactly matches RCV.NXT, then
5111 * RESET the connection
5113 * Send a challenge ACK
5115 if (TCP_SKB_CB(skb)->seq == tp->rcv_nxt)
5118 tcp_send_challenge_ack(sk, skb);
5122 /* step 3: check security and precedence [ignored] */
5124 /* step 4: Check for a SYN
5125 * RFC 5961 4.2 : Send a challenge ack
5130 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_INERRS);
5131 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPSYNCHALLENGE);
5132 tcp_send_challenge_ack(sk, skb);
5144 * TCP receive function for the ESTABLISHED state.
5146 * It is split into a fast path and a slow path. The fast path is
5148 * - A zero window was announced from us - zero window probing
5149 * is only handled properly in the slow path.
5150 * - Out of order segments arrived.
5151 * - Urgent data is expected.
5152 * - There is no buffer space left
5153 * - Unexpected TCP flags/window values/header lengths are received
5154 * (detected by checking the TCP header against pred_flags)
5155 * - Data is sent in both directions. Fast path only supports pure senders
5156 * or pure receivers (this means either the sequence number or the ack
5157 * value must stay constant)
5158 * - Unexpected TCP option.
5160 * When these conditions are not satisfied it drops into a standard
5161 * receive procedure patterned after RFC793 to handle all cases.
5162 * The first three cases are guaranteed by proper pred_flags setting,
5163 * the rest is checked inline. Fast processing is turned on in
5164 * tcp_data_queue when everything is OK.
5166 void tcp_rcv_established(struct sock *sk, struct sk_buff *skb,
5167 const struct tcphdr *th, unsigned int len)
5169 struct tcp_sock *tp = tcp_sk(sk);
5171 if (unlikely(!sk->sk_rx_dst))
5172 inet_csk(sk)->icsk_af_ops->sk_rx_dst_set(sk, skb);
5174 * Header prediction.
5175 * The code loosely follows the one in the famous
5176 * "30 instruction TCP receive" Van Jacobson mail.
5178 * Van's trick is to deposit buffers into socket queue
5179 * on a device interrupt, to call tcp_recv function
5180 * on the receive process context and checksum and copy
5181 * the buffer to user space. smart...
5183 * Our current scheme is not silly either but we take the
5184 * extra cost of the net_bh soft interrupt processing...
5185 * We do checksum and copy also but from device to kernel.
5188 tp->rx_opt.saw_tstamp = 0;
5190 /* pred_flags is 0xS?10 << 16 + snd_wnd
5191 * if header_prediction is to be made
5192 * 'S' will always be tp->tcp_header_len >> 2
5193 * '?' will be 0 for the fast path, otherwise pred_flags is 0 to
5194 * turn it off (when there are holes in the receive
5195 * space for instance)
5196 * PSH flag is ignored.
5199 if ((tcp_flag_word(th) & TCP_HP_BITS) == tp->pred_flags &&
5200 TCP_SKB_CB(skb)->seq == tp->rcv_nxt &&
5201 !after(TCP_SKB_CB(skb)->ack_seq, tp->snd_nxt)) {
5202 int tcp_header_len = tp->tcp_header_len;
5204 /* Timestamp header prediction: tcp_header_len
5205 * is automatically equal to th->doff*4 due to pred_flags
5209 /* Check timestamp */
5210 if (tcp_header_len == sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) {
5211 /* No? Slow path! */
5212 if (!tcp_parse_aligned_timestamp(tp, th))
5215 /* If PAWS failed, check it more carefully in slow path */
5216 if ((s32)(tp->rx_opt.rcv_tsval - tp->rx_opt.ts_recent) < 0)
5219 /* DO NOT update ts_recent here, if checksum fails
5220 * and timestamp was corrupted part, it will result
5221 * in a hung connection since we will drop all
5222 * future packets due to the PAWS test.
5226 if (len <= tcp_header_len) {
5227 /* Bulk data transfer: sender */
5228 if (len == tcp_header_len) {
5229 /* Predicted packet is in window by definition.
5230 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
5231 * Hence, check seq<=rcv_wup reduces to:
5233 if (tcp_header_len ==
5234 (sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) &&
5235 tp->rcv_nxt == tp->rcv_wup)
5236 tcp_store_ts_recent(tp);
5238 /* We know that such packets are checksummed
5241 tcp_ack(sk, skb, 0);
5243 tcp_data_snd_check(sk);
5245 } else { /* Header too small */
5246 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_INERRS);
5251 bool fragstolen = false;
5253 if (tp->ucopy.task == current &&
5254 tp->copied_seq == tp->rcv_nxt &&
5255 len - tcp_header_len <= tp->ucopy.len &&
5256 sock_owned_by_user(sk)) {
5257 __set_current_state(TASK_RUNNING);
5259 if (!tcp_copy_to_iovec(sk, skb, tcp_header_len)) {
5260 /* Predicted packet is in window by definition.
5261 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
5262 * Hence, check seq<=rcv_wup reduces to:
5264 if (tcp_header_len ==
5265 (sizeof(struct tcphdr) +
5266 TCPOLEN_TSTAMP_ALIGNED) &&
5267 tp->rcv_nxt == tp->rcv_wup)
5268 tcp_store_ts_recent(tp);
5270 tcp_rcv_rtt_measure_ts(sk, skb);
5272 __skb_pull(skb, tcp_header_len);
5273 tcp_rcv_nxt_update(tp, TCP_SKB_CB(skb)->end_seq);
5274 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPHPHITSTOUSER);
5279 if (tcp_checksum_complete_user(sk, skb))
5282 if ((int)skb->truesize > sk->sk_forward_alloc)
5285 /* Predicted packet is in window by definition.
5286 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
5287 * Hence, check seq<=rcv_wup reduces to:
5289 if (tcp_header_len ==
5290 (sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) &&
5291 tp->rcv_nxt == tp->rcv_wup)
5292 tcp_store_ts_recent(tp);
5294 tcp_rcv_rtt_measure_ts(sk, skb);
5296 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPHPHITS);
5298 /* Bulk data transfer: receiver */
5299 eaten = tcp_queue_rcv(sk, skb, tcp_header_len,
5303 tcp_event_data_recv(sk, skb);
5305 if (TCP_SKB_CB(skb)->ack_seq != tp->snd_una) {
5306 /* Well, only one small jumplet in fast path... */
5307 tcp_ack(sk, skb, FLAG_DATA);
5308 tcp_data_snd_check(sk);
5309 if (!inet_csk_ack_scheduled(sk))
5313 __tcp_ack_snd_check(sk, 0);
5316 kfree_skb_partial(skb, fragstolen);
5317 sk->sk_data_ready(sk);
5323 if (len < (th->doff << 2) || tcp_checksum_complete_user(sk, skb))
5326 if (!th->ack && !th->rst && !th->syn)
5330 * Standard slow path.
5333 if (!tcp_validate_incoming(sk, skb, th, 1))
5337 if (tcp_ack(sk, skb, FLAG_SLOWPATH | FLAG_UPDATE_TS_RECENT) < 0)
5340 tcp_rcv_rtt_measure_ts(sk, skb);
5342 /* Process urgent data. */
5343 tcp_urg(sk, skb, th);
5345 /* step 7: process the segment text */
5346 tcp_data_queue(sk, skb);
5348 tcp_data_snd_check(sk);
5349 tcp_ack_snd_check(sk);
5353 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_CSUMERRORS);
5354 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_INERRS);
5359 EXPORT_SYMBOL(tcp_rcv_established);
5361 void tcp_finish_connect(struct sock *sk, struct sk_buff *skb)
5363 struct tcp_sock *tp = tcp_sk(sk);
5364 struct inet_connection_sock *icsk = inet_csk(sk);
5366 tcp_set_state(sk, TCP_ESTABLISHED);
5369 icsk->icsk_af_ops->sk_rx_dst_set(sk, skb);
5370 security_inet_conn_established(sk, skb);
5373 /* Make sure socket is routed, for correct metrics. */
5374 icsk->icsk_af_ops->rebuild_header(sk);
5376 tcp_init_metrics(sk);
5378 tcp_init_congestion_control(sk);
5380 /* Prevent spurious tcp_cwnd_restart() on first data
5383 tp->lsndtime = tcp_time_stamp;
5385 tcp_init_buffer_space(sk);
5387 if (sock_flag(sk, SOCK_KEEPOPEN))
5388 inet_csk_reset_keepalive_timer(sk, keepalive_time_when(tp));
5390 if (!tp->rx_opt.snd_wscale)
5391 __tcp_fast_path_on(tp, tp->snd_wnd);
5395 if (!sock_flag(sk, SOCK_DEAD)) {
5396 sk->sk_state_change(sk);
5397 sk_wake_async(sk, SOCK_WAKE_IO, POLL_OUT);
5401 static bool tcp_rcv_fastopen_synack(struct sock *sk, struct sk_buff *synack,
5402 struct tcp_fastopen_cookie *cookie)
5404 struct tcp_sock *tp = tcp_sk(sk);
5405 struct sk_buff *data = tp->syn_data ? tcp_write_queue_head(sk) : NULL;
5406 u16 mss = tp->rx_opt.mss_clamp, try_exp = 0;
5407 bool syn_drop = false;
5409 if (mss == tp->rx_opt.user_mss) {
5410 struct tcp_options_received opt;
5412 /* Get original SYNACK MSS value if user MSS sets mss_clamp */
5413 tcp_clear_options(&opt);
5414 opt.user_mss = opt.mss_clamp = 0;
5415 tcp_parse_options(synack, &opt, 0, NULL);
5416 mss = opt.mss_clamp;
5419 if (!tp->syn_fastopen) {
5420 /* Ignore an unsolicited cookie */
5422 } else if (tp->total_retrans) {
5423 /* SYN timed out and the SYN-ACK neither has a cookie nor
5424 * acknowledges data. Presumably the remote received only
5425 * the retransmitted (regular) SYNs: either the original
5426 * SYN-data or the corresponding SYN-ACK was dropped.
5428 syn_drop = (cookie->len < 0 && data);
5429 } else if (cookie->len < 0 && !tp->syn_data) {
5430 /* We requested a cookie but didn't get it. If we did not use
5431 * the (old) exp opt format then try so next time (try_exp=1).
5432 * Otherwise we go back to use the RFC7413 opt (try_exp=2).
5434 try_exp = tp->syn_fastopen_exp ? 2 : 1;
5437 tcp_fastopen_cache_set(sk, mss, cookie, syn_drop, try_exp);
5439 if (data) { /* Retransmit unacked data in SYN */
5440 tcp_for_write_queue_from(data, sk) {
5441 if (data == tcp_send_head(sk) ||
5442 __tcp_retransmit_skb(sk, data))
5446 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPFASTOPENACTIVEFAIL);
5449 tp->syn_data_acked = tp->syn_data;
5450 if (tp->syn_data_acked)
5451 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPFASTOPENACTIVE);
5455 static int tcp_rcv_synsent_state_process(struct sock *sk, struct sk_buff *skb,
5456 const struct tcphdr *th, unsigned int len)
5458 struct inet_connection_sock *icsk = inet_csk(sk);
5459 struct tcp_sock *tp = tcp_sk(sk);
5460 struct tcp_fastopen_cookie foc = { .len = -1 };
5461 int saved_clamp = tp->rx_opt.mss_clamp;
5463 tcp_parse_options(skb, &tp->rx_opt, 0, &foc);
5464 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr)
5465 tp->rx_opt.rcv_tsecr -= tp->tsoffset;
5469 * "If the state is SYN-SENT then
5470 * first check the ACK bit
5471 * If the ACK bit is set
5472 * If SEG.ACK =< ISS, or SEG.ACK > SND.NXT, send
5473 * a reset (unless the RST bit is set, if so drop
5474 * the segment and return)"
5476 if (!after(TCP_SKB_CB(skb)->ack_seq, tp->snd_una) ||
5477 after(TCP_SKB_CB(skb)->ack_seq, tp->snd_nxt))
5478 goto reset_and_undo;
5480 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
5481 !between(tp->rx_opt.rcv_tsecr, tp->retrans_stamp,
5483 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_PAWSACTIVEREJECTED);
5484 goto reset_and_undo;
5487 /* Now ACK is acceptable.
5489 * "If the RST bit is set
5490 * If the ACK was acceptable then signal the user "error:
5491 * connection reset", drop the segment, enter CLOSED state,
5492 * delete TCB, and return."
5501 * "fifth, if neither of the SYN or RST bits is set then
5502 * drop the segment and return."
5508 goto discard_and_undo;
5511 * "If the SYN bit is on ...
5512 * are acceptable then ...
5513 * (our SYN has been ACKed), change the connection
5514 * state to ESTABLISHED..."
5517 tcp_ecn_rcv_synack(tp, th);
5519 tcp_init_wl(tp, TCP_SKB_CB(skb)->seq);
5520 tcp_ack(sk, skb, FLAG_SLOWPATH);
5522 /* Ok.. it's good. Set up sequence numbers and
5523 * move to established.
5525 tp->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
5526 tp->rcv_wup = TCP_SKB_CB(skb)->seq + 1;
5528 /* RFC1323: The window in SYN & SYN/ACK segments is
5531 tp->snd_wnd = ntohs(th->window);
5533 if (!tp->rx_opt.wscale_ok) {
5534 tp->rx_opt.snd_wscale = tp->rx_opt.rcv_wscale = 0;
5535 tp->window_clamp = min(tp->window_clamp, 65535U);
5538 if (tp->rx_opt.saw_tstamp) {
5539 tp->rx_opt.tstamp_ok = 1;
5540 tp->tcp_header_len =
5541 sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED;
5542 tp->advmss -= TCPOLEN_TSTAMP_ALIGNED;
5543 tcp_store_ts_recent(tp);
5545 tp->tcp_header_len = sizeof(struct tcphdr);
5548 if (tcp_is_sack(tp) && sysctl_tcp_fack)
5549 tcp_enable_fack(tp);
5552 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
5553 tcp_initialize_rcv_mss(sk);
5555 /* Remember, tcp_poll() does not lock socket!
5556 * Change state from SYN-SENT only after copied_seq
5557 * is initialized. */
5558 tp->copied_seq = tp->rcv_nxt;
5562 tcp_finish_connect(sk, skb);
5564 if ((tp->syn_fastopen || tp->syn_data) &&
5565 tcp_rcv_fastopen_synack(sk, skb, &foc))
5568 if (sk->sk_write_pending ||
5569 icsk->icsk_accept_queue.rskq_defer_accept ||
5570 icsk->icsk_ack.pingpong) {
5571 /* Save one ACK. Data will be ready after
5572 * several ticks, if write_pending is set.
5574 * It may be deleted, but with this feature tcpdumps
5575 * look so _wonderfully_ clever, that I was not able
5576 * to stand against the temptation 8) --ANK
5578 inet_csk_schedule_ack(sk);
5579 icsk->icsk_ack.lrcvtime = tcp_time_stamp;
5580 tcp_enter_quickack_mode(sk);
5581 inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK,
5582 TCP_DELACK_MAX, TCP_RTO_MAX);
5593 /* No ACK in the segment */
5597 * "If the RST bit is set
5599 * Otherwise (no ACK) drop the segment and return."
5602 goto discard_and_undo;
5606 if (tp->rx_opt.ts_recent_stamp && tp->rx_opt.saw_tstamp &&
5607 tcp_paws_reject(&tp->rx_opt, 0))
5608 goto discard_and_undo;
5611 /* We see SYN without ACK. It is attempt of
5612 * simultaneous connect with crossed SYNs.
5613 * Particularly, it can be connect to self.
5615 tcp_set_state(sk, TCP_SYN_RECV);
5617 if (tp->rx_opt.saw_tstamp) {
5618 tp->rx_opt.tstamp_ok = 1;
5619 tcp_store_ts_recent(tp);
5620 tp->tcp_header_len =
5621 sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED;
5623 tp->tcp_header_len = sizeof(struct tcphdr);
5626 tp->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
5627 tp->rcv_wup = TCP_SKB_CB(skb)->seq + 1;
5629 /* RFC1323: The window in SYN & SYN/ACK segments is
5632 tp->snd_wnd = ntohs(th->window);
5633 tp->snd_wl1 = TCP_SKB_CB(skb)->seq;
5634 tp->max_window = tp->snd_wnd;
5636 tcp_ecn_rcv_syn(tp, th);
5639 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
5640 tcp_initialize_rcv_mss(sk);
5642 tcp_send_synack(sk);
5644 /* Note, we could accept data and URG from this segment.
5645 * There are no obstacles to make this (except that we must
5646 * either change tcp_recvmsg() to prevent it from returning data
5647 * before 3WHS completes per RFC793, or employ TCP Fast Open).
5649 * However, if we ignore data in ACKless segments sometimes,
5650 * we have no reasons to accept it sometimes.
5651 * Also, seems the code doing it in step6 of tcp_rcv_state_process
5652 * is not flawless. So, discard packet for sanity.
5653 * Uncomment this return to process the data.
5660 /* "fifth, if neither of the SYN or RST bits is set then
5661 * drop the segment and return."
5665 tcp_clear_options(&tp->rx_opt);
5666 tp->rx_opt.mss_clamp = saved_clamp;
5670 tcp_clear_options(&tp->rx_opt);
5671 tp->rx_opt.mss_clamp = saved_clamp;
5676 * This function implements the receiving procedure of RFC 793 for
5677 * all states except ESTABLISHED and TIME_WAIT.
5678 * It's called from both tcp_v4_rcv and tcp_v6_rcv and should be
5679 * address independent.
5682 int tcp_rcv_state_process(struct sock *sk, struct sk_buff *skb,
5683 const struct tcphdr *th, unsigned int len)
5685 struct tcp_sock *tp = tcp_sk(sk);
5686 struct inet_connection_sock *icsk = inet_csk(sk);
5687 struct request_sock *req;
5692 tp->rx_opt.saw_tstamp = 0;
5694 switch (sk->sk_state) {
5708 if (icsk->icsk_af_ops->conn_request(sk, skb) < 0)
5711 /* Now we have several options: In theory there is
5712 * nothing else in the frame. KA9Q has an option to
5713 * send data with the syn, BSD accepts data with the
5714 * syn up to the [to be] advertised window and
5715 * Solaris 2.1 gives you a protocol error. For now
5716 * we just ignore it, that fits the spec precisely
5717 * and avoids incompatibilities. It would be nice in
5718 * future to drop through and process the data.
5720 * Now that TTCP is starting to be used we ought to
5722 * But, this leaves one open to an easy denial of
5723 * service attack, and SYN cookies can't defend
5724 * against this problem. So, we drop the data
5725 * in the interest of security over speed unless
5726 * it's still in use.
5734 queued = tcp_rcv_synsent_state_process(sk, skb, th, len);
5738 /* Do step6 onward by hand. */
5739 tcp_urg(sk, skb, th);
5741 tcp_data_snd_check(sk);
5745 req = tp->fastopen_rsk;
5747 WARN_ON_ONCE(sk->sk_state != TCP_SYN_RECV &&
5748 sk->sk_state != TCP_FIN_WAIT1);
5750 if (!tcp_check_req(sk, skb, req, true))
5754 if (!th->ack && !th->rst && !th->syn)
5757 if (!tcp_validate_incoming(sk, skb, th, 0))
5760 /* step 5: check the ACK field */
5761 acceptable = tcp_ack(sk, skb, FLAG_SLOWPATH |
5762 FLAG_UPDATE_TS_RECENT) > 0;
5764 switch (sk->sk_state) {
5769 /* Once we leave TCP_SYN_RECV, we no longer need req
5773 synack_stamp = tcp_rsk(req)->snt_synack;
5774 tp->total_retrans = req->num_retrans;
5775 reqsk_fastopen_remove(sk, req, false);
5777 synack_stamp = tp->lsndtime;
5778 /* Make sure socket is routed, for correct metrics. */
5779 icsk->icsk_af_ops->rebuild_header(sk);
5780 tcp_init_congestion_control(sk);
5783 tp->copied_seq = tp->rcv_nxt;
5784 tcp_init_buffer_space(sk);
5787 tcp_set_state(sk, TCP_ESTABLISHED);
5788 sk->sk_state_change(sk);
5790 /* Note, that this wakeup is only for marginal crossed SYN case.
5791 * Passively open sockets are not waked up, because
5792 * sk->sk_sleep == NULL and sk->sk_socket == NULL.
5795 sk_wake_async(sk, SOCK_WAKE_IO, POLL_OUT);
5797 tp->snd_una = TCP_SKB_CB(skb)->ack_seq;
5798 tp->snd_wnd = ntohs(th->window) << tp->rx_opt.snd_wscale;
5799 tcp_init_wl(tp, TCP_SKB_CB(skb)->seq);
5800 tcp_synack_rtt_meas(sk, synack_stamp);
5802 if (tp->rx_opt.tstamp_ok)
5803 tp->advmss -= TCPOLEN_TSTAMP_ALIGNED;
5806 /* Re-arm the timer because data may have been sent out.
5807 * This is similar to the regular data transmission case
5808 * when new data has just been ack'ed.
5810 * (TFO) - we could try to be more aggressive and
5811 * retransmitting any data sooner based on when they
5816 tcp_init_metrics(sk);
5818 tcp_update_pacing_rate(sk);
5820 /* Prevent spurious tcp_cwnd_restart() on first data packet */
5821 tp->lsndtime = tcp_time_stamp;
5823 tcp_initialize_rcv_mss(sk);
5824 tcp_fast_path_on(tp);
5827 case TCP_FIN_WAIT1: {
5828 struct dst_entry *dst;
5831 /* If we enter the TCP_FIN_WAIT1 state and we are a
5832 * Fast Open socket and this is the first acceptable
5833 * ACK we have received, this would have acknowledged
5834 * our SYNACK so stop the SYNACK timer.
5837 /* Return RST if ack_seq is invalid.
5838 * Note that RFC793 only says to generate a
5839 * DUPACK for it but for TCP Fast Open it seems
5840 * better to treat this case like TCP_SYN_RECV
5845 /* We no longer need the request sock. */
5846 reqsk_fastopen_remove(sk, req, false);
5849 if (tp->snd_una != tp->write_seq)
5852 tcp_set_state(sk, TCP_FIN_WAIT2);
5853 sk->sk_shutdown |= SEND_SHUTDOWN;
5855 dst = __sk_dst_get(sk);
5859 if (!sock_flag(sk, SOCK_DEAD)) {
5860 /* Wake up lingering close() */
5861 sk->sk_state_change(sk);
5865 if (tp->linger2 < 0 ||
5866 (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
5867 after(TCP_SKB_CB(skb)->end_seq - th->fin, tp->rcv_nxt))) {
5869 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPABORTONDATA);
5873 tmo = tcp_fin_time(sk);
5874 if (tmo > TCP_TIMEWAIT_LEN) {
5875 inet_csk_reset_keepalive_timer(sk, tmo - TCP_TIMEWAIT_LEN);
5876 } else if (th->fin || sock_owned_by_user(sk)) {
5877 /* Bad case. We could lose such FIN otherwise.
5878 * It is not a big problem, but it looks confusing
5879 * and not so rare event. We still can lose it now,
5880 * if it spins in bh_lock_sock(), but it is really
5883 inet_csk_reset_keepalive_timer(sk, tmo);
5885 tcp_time_wait(sk, TCP_FIN_WAIT2, tmo);
5892 if (tp->snd_una == tp->write_seq) {
5893 tcp_time_wait(sk, TCP_TIME_WAIT, 0);
5899 if (tp->snd_una == tp->write_seq) {
5900 tcp_update_metrics(sk);
5907 /* step 6: check the URG bit */
5908 tcp_urg(sk, skb, th);
5910 /* step 7: process the segment text */
5911 switch (sk->sk_state) {
5912 case TCP_CLOSE_WAIT:
5915 if (!before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt))
5919 /* RFC 793 says to queue data in these states,
5920 * RFC 1122 says we MUST send a reset.
5921 * BSD 4.4 also does reset.
5923 if (sk->sk_shutdown & RCV_SHUTDOWN) {
5924 if (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
5925 after(TCP_SKB_CB(skb)->end_seq - th->fin, tp->rcv_nxt)) {
5926 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPABORTONDATA);
5932 case TCP_ESTABLISHED:
5933 tcp_data_queue(sk, skb);
5938 /* tcp_data could move socket to TIME-WAIT */
5939 if (sk->sk_state != TCP_CLOSE) {
5940 tcp_data_snd_check(sk);
5941 tcp_ack_snd_check(sk);
5950 EXPORT_SYMBOL(tcp_rcv_state_process);
5952 static inline void pr_drop_req(struct request_sock *req, __u16 port, int family)
5954 struct inet_request_sock *ireq = inet_rsk(req);
5956 if (family == AF_INET)
5957 net_dbg_ratelimited("drop open request from %pI4/%u\n",
5958 &ireq->ir_rmt_addr, port);
5959 #if IS_ENABLED(CONFIG_IPV6)
5960 else if (family == AF_INET6)
5961 net_dbg_ratelimited("drop open request from %pI6/%u\n",
5962 &ireq->ir_v6_rmt_addr, port);
5966 /* RFC3168 : 6.1.1 SYN packets must not have ECT/ECN bits set
5968 * If we receive a SYN packet with these bits set, it means a
5969 * network is playing bad games with TOS bits. In order to
5970 * avoid possible false congestion notifications, we disable
5971 * TCP ECN negotiation.
5973 * Exception: tcp_ca wants ECN. This is required for DCTCP
5974 * congestion control: Linux DCTCP asserts ECT on all packets,
5975 * including SYN, which is most optimal solution; however,
5976 * others, such as FreeBSD do not.
5978 static void tcp_ecn_create_request(struct request_sock *req,
5979 const struct sk_buff *skb,
5980 const struct sock *listen_sk,
5981 const struct dst_entry *dst)
5983 const struct tcphdr *th = tcp_hdr(skb);
5984 const struct net *net = sock_net(listen_sk);
5985 bool th_ecn = th->ece && th->cwr;
5991 ect = !INET_ECN_is_not_ect(TCP_SKB_CB(skb)->ip_dsfield);
5992 ecn_ok = net->ipv4.sysctl_tcp_ecn || dst_feature(dst, RTAX_FEATURE_ECN);
5994 if ((!ect && ecn_ok) || tcp_ca_needs_ecn(listen_sk))
5995 inet_rsk(req)->ecn_ok = 1;
5998 static void tcp_openreq_init(struct request_sock *req,
5999 const struct tcp_options_received *rx_opt,
6000 struct sk_buff *skb, const struct sock *sk)
6002 struct inet_request_sock *ireq = inet_rsk(req);
6004 req->rcv_wnd = 0; /* So that tcp_send_synack() knows! */
6006 tcp_rsk(req)->rcv_isn = TCP_SKB_CB(skb)->seq;
6007 tcp_rsk(req)->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
6008 tcp_rsk(req)->snt_synack = tcp_time_stamp;
6009 tcp_rsk(req)->last_oow_ack_time = 0;
6010 req->mss = rx_opt->mss_clamp;
6011 req->ts_recent = rx_opt->saw_tstamp ? rx_opt->rcv_tsval : 0;
6012 ireq->tstamp_ok = rx_opt->tstamp_ok;
6013 ireq->sack_ok = rx_opt->sack_ok;
6014 ireq->snd_wscale = rx_opt->snd_wscale;
6015 ireq->wscale_ok = rx_opt->wscale_ok;
6018 ireq->ir_rmt_port = tcp_hdr(skb)->source;
6019 ireq->ir_num = ntohs(tcp_hdr(skb)->dest);
6020 ireq->ir_mark = inet_request_mark(sk, skb);
6023 struct request_sock *inet_reqsk_alloc(const struct request_sock_ops *ops,
6024 struct sock *sk_listener)
6026 struct request_sock *req = reqsk_alloc(ops, sk_listener);
6029 struct inet_request_sock *ireq = inet_rsk(req);
6031 kmemcheck_annotate_bitfield(ireq, flags);
6033 atomic64_set(&ireq->ir_cookie, 0);
6034 ireq->ireq_state = TCP_NEW_SYN_RECV;
6035 write_pnet(&ireq->ireq_net, sock_net(sk_listener));
6036 ireq->ireq_family = sk_listener->sk_family;
6041 EXPORT_SYMBOL(inet_reqsk_alloc);
6044 * Return true if a syncookie should be sent
6046 static bool tcp_syn_flood_action(struct sock *sk,
6047 const struct sk_buff *skb,
6050 const char *msg = "Dropping request";
6051 bool want_cookie = false;
6052 struct listen_sock *lopt;
6054 #ifdef CONFIG_SYN_COOKIES
6055 if (sysctl_tcp_syncookies) {
6056 msg = "Sending cookies";
6058 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPREQQFULLDOCOOKIES);
6061 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPREQQFULLDROP);
6063 lopt = inet_csk(sk)->icsk_accept_queue.listen_opt;
6064 if (!lopt->synflood_warned && sysctl_tcp_syncookies != 2) {
6065 lopt->synflood_warned = 1;
6066 pr_info("%s: Possible SYN flooding on port %d. %s. Check SNMP counters.\n",
6067 proto, ntohs(tcp_hdr(skb)->dest), msg);
6072 static void tcp_reqsk_record_syn(const struct sock *sk,
6073 struct request_sock *req,
6074 const struct sk_buff *skb)
6076 if (tcp_sk(sk)->save_syn) {
6077 u32 len = skb_network_header_len(skb) + tcp_hdrlen(skb);
6080 copy = kmalloc(len + sizeof(u32), GFP_ATOMIC);
6083 memcpy(©[1], skb_network_header(skb), len);
6084 req->saved_syn = copy;
6089 int tcp_conn_request(struct request_sock_ops *rsk_ops,
6090 const struct tcp_request_sock_ops *af_ops,
6091 struct sock *sk, struct sk_buff *skb)
6093 struct tcp_options_received tmp_opt;
6094 struct request_sock *req;
6095 struct tcp_sock *tp = tcp_sk(sk);
6096 struct dst_entry *dst = NULL;
6097 __u32 isn = TCP_SKB_CB(skb)->tcp_tw_isn;
6098 bool want_cookie = false, fastopen;
6100 struct tcp_fastopen_cookie foc = { .len = -1 };
6104 /* TW buckets are converted to open requests without
6105 * limitations, they conserve resources and peer is
6106 * evidently real one.
6108 if ((sysctl_tcp_syncookies == 2 ||
6109 inet_csk_reqsk_queue_is_full(sk)) && !isn) {
6110 want_cookie = tcp_syn_flood_action(sk, skb, rsk_ops->slab_name);
6116 /* Accept backlog is full. If we have already queued enough
6117 * of warm entries in syn queue, drop request. It is better than
6118 * clogging syn queue with openreqs with exponentially increasing
6121 if (sk_acceptq_is_full(sk) && inet_csk_reqsk_queue_young(sk) > 1) {
6122 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_LISTENOVERFLOWS);
6126 req = inet_reqsk_alloc(rsk_ops, sk);
6130 tcp_rsk(req)->af_specific = af_ops;
6132 tcp_clear_options(&tmp_opt);
6133 tmp_opt.mss_clamp = af_ops->mss_clamp;
6134 tmp_opt.user_mss = tp->rx_opt.user_mss;
6135 tcp_parse_options(skb, &tmp_opt, 0, want_cookie ? NULL : &foc);
6137 if (want_cookie && !tmp_opt.saw_tstamp)
6138 tcp_clear_options(&tmp_opt);
6140 tmp_opt.tstamp_ok = tmp_opt.saw_tstamp;
6141 tcp_openreq_init(req, &tmp_opt, skb, sk);
6143 /* Note: tcp_v6_init_req() might override ir_iif for link locals */
6144 inet_rsk(req)->ir_iif = sk->sk_bound_dev_if;
6146 af_ops->init_req(req, sk, skb);
6148 if (security_inet_conn_request(sk, skb, req))
6151 if (!want_cookie && !isn) {
6152 /* VJ's idea. We save last timestamp seen
6153 * from the destination in peer table, when entering
6154 * state TIME-WAIT, and check against it before
6155 * accepting new connection request.
6157 * If "isn" is not zero, this request hit alive
6158 * timewait bucket, so that all the necessary checks
6159 * are made in the function processing timewait state.
6161 if (tcp_death_row.sysctl_tw_recycle) {
6164 dst = af_ops->route_req(sk, &fl, req, &strict);
6166 if (dst && strict &&
6167 !tcp_peer_is_proven(req, dst, true,
6168 tmp_opt.saw_tstamp)) {
6169 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_PAWSPASSIVEREJECTED);
6170 goto drop_and_release;
6173 /* Kill the following clause, if you dislike this way. */
6174 else if (!sysctl_tcp_syncookies &&
6175 (sysctl_max_syn_backlog - inet_csk_reqsk_queue_len(sk) <
6176 (sysctl_max_syn_backlog >> 2)) &&
6177 !tcp_peer_is_proven(req, dst, false,
6178 tmp_opt.saw_tstamp)) {
6179 /* Without syncookies last quarter of
6180 * backlog is filled with destinations,
6181 * proven to be alive.
6182 * It means that we continue to communicate
6183 * to destinations, already remembered
6184 * to the moment of synflood.
6186 pr_drop_req(req, ntohs(tcp_hdr(skb)->source),
6188 goto drop_and_release;
6191 isn = af_ops->init_seq(skb);
6194 dst = af_ops->route_req(sk, &fl, req, NULL);
6199 tcp_ecn_create_request(req, skb, sk, dst);
6202 isn = cookie_init_sequence(af_ops, sk, skb, &req->mss);
6203 req->cookie_ts = tmp_opt.tstamp_ok;
6204 if (!tmp_opt.tstamp_ok)
6205 inet_rsk(req)->ecn_ok = 0;
6208 tcp_rsk(req)->snt_isn = isn;
6209 tcp_openreq_init_rwin(req, sk, dst);
6210 fastopen = !want_cookie &&
6211 tcp_try_fastopen(sk, skb, req, &foc, dst);
6212 err = af_ops->send_synack(sk, dst, &fl, req,
6213 skb_get_queue_mapping(skb), &foc);
6215 if (err || want_cookie)
6218 tcp_rsk(req)->tfo_listener = false;
6219 af_ops->queue_hash_add(sk, req, TCP_TIMEOUT_INIT);
6221 tcp_reqsk_record_syn(sk, req, skb);
6230 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_LISTENDROPS);
6233 EXPORT_SYMBOL(tcp_conn_request);