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_SLOWPATH 0x100 /* Do not skip RFC checks for window update.*/
113 #define FLAG_ORIG_SACK_ACKED 0x200 /* Never retransmitted data are (s)acked */
114 #define FLAG_SND_UNA_ADVANCED 0x400 /* Snd_una was changed (!= FLAG_DATA_ACKED) */
115 #define FLAG_DSACKING_ACK 0x800 /* SACK blocks contained D-SACK info */
116 #define FLAG_SACK_RENEGING 0x2000 /* snd_una advanced to a sacked seq */
117 #define FLAG_UPDATE_TS_RECENT 0x4000 /* tcp_replace_ts_recent() */
119 #define FLAG_ACKED (FLAG_DATA_ACKED|FLAG_SYN_ACKED)
120 #define FLAG_NOT_DUP (FLAG_DATA|FLAG_WIN_UPDATE|FLAG_ACKED)
121 #define FLAG_CA_ALERT (FLAG_DATA_SACKED|FLAG_ECE)
122 #define FLAG_FORWARD_PROGRESS (FLAG_ACKED|FLAG_DATA_SACKED)
124 #define TCP_REMNANT (TCP_FLAG_FIN|TCP_FLAG_URG|TCP_FLAG_SYN|TCP_FLAG_PSH)
125 #define TCP_HP_BITS (~(TCP_RESERVED_BITS|TCP_FLAG_PSH))
127 /* Adapt the MSS value used to make delayed ack decision to the
130 static void tcp_measure_rcv_mss(struct sock *sk, const struct sk_buff *skb)
132 struct inet_connection_sock *icsk = inet_csk(sk);
133 const unsigned int lss = icsk->icsk_ack.last_seg_size;
136 icsk->icsk_ack.last_seg_size = 0;
138 /* skb->len may jitter because of SACKs, even if peer
139 * sends good full-sized frames.
141 len = skb_shinfo(skb)->gso_size ? : skb->len;
142 if (len >= icsk->icsk_ack.rcv_mss) {
143 icsk->icsk_ack.rcv_mss = len;
145 /* Otherwise, we make more careful check taking into account,
146 * that SACKs block is variable.
148 * "len" is invariant segment length, including TCP header.
150 len += skb->data - skb_transport_header(skb);
151 if (len >= TCP_MSS_DEFAULT + sizeof(struct tcphdr) ||
152 /* If PSH is not set, packet should be
153 * full sized, provided peer TCP is not badly broken.
154 * This observation (if it is correct 8)) allows
155 * to handle super-low mtu links fairly.
157 (len >= TCP_MIN_MSS + sizeof(struct tcphdr) &&
158 !(tcp_flag_word(tcp_hdr(skb)) & TCP_REMNANT))) {
159 /* Subtract also invariant (if peer is RFC compliant),
160 * tcp header plus fixed timestamp option length.
161 * Resulting "len" is MSS free of SACK jitter.
163 len -= tcp_sk(sk)->tcp_header_len;
164 icsk->icsk_ack.last_seg_size = len;
166 icsk->icsk_ack.rcv_mss = len;
170 if (icsk->icsk_ack.pending & ICSK_ACK_PUSHED)
171 icsk->icsk_ack.pending |= ICSK_ACK_PUSHED2;
172 icsk->icsk_ack.pending |= ICSK_ACK_PUSHED;
176 static void tcp_incr_quickack(struct sock *sk)
178 struct inet_connection_sock *icsk = inet_csk(sk);
179 unsigned int quickacks = tcp_sk(sk)->rcv_wnd / (2 * icsk->icsk_ack.rcv_mss);
183 if (quickacks > icsk->icsk_ack.quick)
184 icsk->icsk_ack.quick = min(quickacks, TCP_MAX_QUICKACKS);
187 static void tcp_enter_quickack_mode(struct sock *sk)
189 struct inet_connection_sock *icsk = inet_csk(sk);
190 tcp_incr_quickack(sk);
191 icsk->icsk_ack.pingpong = 0;
192 icsk->icsk_ack.ato = TCP_ATO_MIN;
195 /* Send ACKs quickly, if "quick" count is not exhausted
196 * and the session is not interactive.
199 static inline bool tcp_in_quickack_mode(const struct sock *sk)
201 const struct inet_connection_sock *icsk = inet_csk(sk);
203 return icsk->icsk_ack.quick && !icsk->icsk_ack.pingpong;
206 static void tcp_ecn_queue_cwr(struct tcp_sock *tp)
208 if (tp->ecn_flags & TCP_ECN_OK)
209 tp->ecn_flags |= TCP_ECN_QUEUE_CWR;
212 static void tcp_ecn_accept_cwr(struct tcp_sock *tp, const struct sk_buff *skb)
214 if (tcp_hdr(skb)->cwr)
215 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR;
218 static void tcp_ecn_withdraw_cwr(struct tcp_sock *tp)
220 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR;
223 static void __tcp_ecn_check_ce(struct tcp_sock *tp, const struct sk_buff *skb)
225 switch (TCP_SKB_CB(skb)->ip_dsfield & INET_ECN_MASK) {
226 case INET_ECN_NOT_ECT:
227 /* Funny extension: if ECT is not set on a segment,
228 * and we already seen ECT on a previous segment,
229 * it is probably a retransmit.
231 if (tp->ecn_flags & TCP_ECN_SEEN)
232 tcp_enter_quickack_mode((struct sock *)tp);
235 if (tcp_ca_needs_ecn((struct sock *)tp))
236 tcp_ca_event((struct sock *)tp, CA_EVENT_ECN_IS_CE);
238 if (!(tp->ecn_flags & TCP_ECN_DEMAND_CWR)) {
239 /* Better not delay acks, sender can have a very low cwnd */
240 tcp_enter_quickack_mode((struct sock *)tp);
241 tp->ecn_flags |= TCP_ECN_DEMAND_CWR;
243 tp->ecn_flags |= TCP_ECN_SEEN;
246 if (tcp_ca_needs_ecn((struct sock *)tp))
247 tcp_ca_event((struct sock *)tp, CA_EVENT_ECN_NO_CE);
248 tp->ecn_flags |= TCP_ECN_SEEN;
253 static void tcp_ecn_check_ce(struct tcp_sock *tp, const struct sk_buff *skb)
255 if (tp->ecn_flags & TCP_ECN_OK)
256 __tcp_ecn_check_ce(tp, skb);
259 static void tcp_ecn_rcv_synack(struct tcp_sock *tp, const struct tcphdr *th)
261 if ((tp->ecn_flags & TCP_ECN_OK) && (!th->ece || th->cwr))
262 tp->ecn_flags &= ~TCP_ECN_OK;
265 static void tcp_ecn_rcv_syn(struct tcp_sock *tp, const struct tcphdr *th)
267 if ((tp->ecn_flags & TCP_ECN_OK) && (!th->ece || !th->cwr))
268 tp->ecn_flags &= ~TCP_ECN_OK;
271 static bool tcp_ecn_rcv_ecn_echo(const struct tcp_sock *tp, const struct tcphdr *th)
273 if (th->ece && !th->syn && (tp->ecn_flags & TCP_ECN_OK))
278 /* Buffer size and advertised window tuning.
280 * 1. Tuning sk->sk_sndbuf, when connection enters established state.
283 static void tcp_sndbuf_expand(struct sock *sk)
285 const struct tcp_sock *tp = tcp_sk(sk);
289 /* Worst case is non GSO/TSO : each frame consumes one skb
290 * and skb->head is kmalloced using power of two area of memory
292 per_mss = max_t(u32, tp->rx_opt.mss_clamp, tp->mss_cache) +
294 SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
296 per_mss = roundup_pow_of_two(per_mss) +
297 SKB_DATA_ALIGN(sizeof(struct sk_buff));
299 nr_segs = max_t(u32, TCP_INIT_CWND, tp->snd_cwnd);
300 nr_segs = max_t(u32, nr_segs, tp->reordering + 1);
302 /* Fast Recovery (RFC 5681 3.2) :
303 * Cubic needs 1.7 factor, rounded to 2 to include
304 * extra cushion (application might react slowly to POLLOUT)
306 sndmem = 2 * nr_segs * per_mss;
308 if (sk->sk_sndbuf < sndmem)
309 sk->sk_sndbuf = min(sndmem, sysctl_tcp_wmem[2]);
312 /* 2. Tuning advertised window (window_clamp, rcv_ssthresh)
314 * All tcp_full_space() is split to two parts: "network" buffer, allocated
315 * forward and advertised in receiver window (tp->rcv_wnd) and
316 * "application buffer", required to isolate scheduling/application
317 * latencies from network.
318 * window_clamp is maximal advertised window. It can be less than
319 * tcp_full_space(), in this case tcp_full_space() - window_clamp
320 * is reserved for "application" buffer. The less window_clamp is
321 * the smoother our behaviour from viewpoint of network, but the lower
322 * throughput and the higher sensitivity of the connection to losses. 8)
324 * rcv_ssthresh is more strict window_clamp used at "slow start"
325 * phase to predict further behaviour of this connection.
326 * It is used for two goals:
327 * - to enforce header prediction at sender, even when application
328 * requires some significant "application buffer". It is check #1.
329 * - to prevent pruning of receive queue because of misprediction
330 * of receiver window. Check #2.
332 * The scheme does not work when sender sends good segments opening
333 * window and then starts to feed us spaghetti. But it should work
334 * in common situations. Otherwise, we have to rely on queue collapsing.
337 /* Slow part of check#2. */
338 static int __tcp_grow_window(const struct sock *sk, const struct sk_buff *skb)
340 struct tcp_sock *tp = tcp_sk(sk);
342 int truesize = tcp_win_from_space(skb->truesize) >> 1;
343 int window = tcp_win_from_space(sysctl_tcp_rmem[2]) >> 1;
345 while (tp->rcv_ssthresh <= window) {
346 if (truesize <= skb->len)
347 return 2 * inet_csk(sk)->icsk_ack.rcv_mss;
355 static void tcp_grow_window(struct sock *sk, const struct sk_buff *skb)
357 struct tcp_sock *tp = tcp_sk(sk);
360 if (tp->rcv_ssthresh < tp->window_clamp &&
361 (int)tp->rcv_ssthresh < tcp_space(sk) &&
362 !tcp_under_memory_pressure(sk)) {
365 /* Check #2. Increase window, if skb with such overhead
366 * will fit to rcvbuf in future.
368 if (tcp_win_from_space(skb->truesize) <= skb->len)
369 incr = 2 * tp->advmss;
371 incr = __tcp_grow_window(sk, skb);
374 incr = max_t(int, incr, 2 * skb->len);
375 tp->rcv_ssthresh = min(tp->rcv_ssthresh + incr,
377 inet_csk(sk)->icsk_ack.quick |= 1;
382 /* 3. Tuning rcvbuf, when connection enters established state. */
383 static void tcp_fixup_rcvbuf(struct sock *sk)
385 u32 mss = tcp_sk(sk)->advmss;
388 rcvmem = 2 * SKB_TRUESIZE(mss + MAX_TCP_HEADER) *
389 tcp_default_init_rwnd(mss);
391 /* Dynamic Right Sizing (DRS) has 2 to 3 RTT latency
392 * Allow enough cushion so that sender is not limited by our window
394 if (sysctl_tcp_moderate_rcvbuf)
397 if (sk->sk_rcvbuf < rcvmem)
398 sk->sk_rcvbuf = min(rcvmem, sysctl_tcp_rmem[2]);
401 /* 4. Try to fixup all. It is made immediately after connection enters
404 void tcp_init_buffer_space(struct sock *sk)
406 struct tcp_sock *tp = tcp_sk(sk);
409 if (!(sk->sk_userlocks & SOCK_RCVBUF_LOCK))
410 tcp_fixup_rcvbuf(sk);
411 if (!(sk->sk_userlocks & SOCK_SNDBUF_LOCK))
412 tcp_sndbuf_expand(sk);
414 tp->rcvq_space.space = tp->rcv_wnd;
415 tp->rcvq_space.time = tcp_time_stamp;
416 tp->rcvq_space.seq = tp->copied_seq;
418 maxwin = tcp_full_space(sk);
420 if (tp->window_clamp >= maxwin) {
421 tp->window_clamp = maxwin;
423 if (sysctl_tcp_app_win && maxwin > 4 * tp->advmss)
424 tp->window_clamp = max(maxwin -
425 (maxwin >> sysctl_tcp_app_win),
429 /* Force reservation of one segment. */
430 if (sysctl_tcp_app_win &&
431 tp->window_clamp > 2 * tp->advmss &&
432 tp->window_clamp + tp->advmss > maxwin)
433 tp->window_clamp = max(2 * tp->advmss, maxwin - tp->advmss);
435 tp->rcv_ssthresh = min(tp->rcv_ssthresh, tp->window_clamp);
436 tp->snd_cwnd_stamp = tcp_time_stamp;
439 /* 5. Recalculate window clamp after socket hit its memory bounds. */
440 static void tcp_clamp_window(struct sock *sk)
442 struct tcp_sock *tp = tcp_sk(sk);
443 struct inet_connection_sock *icsk = inet_csk(sk);
445 icsk->icsk_ack.quick = 0;
447 if (sk->sk_rcvbuf < sysctl_tcp_rmem[2] &&
448 !(sk->sk_userlocks & SOCK_RCVBUF_LOCK) &&
449 !tcp_under_memory_pressure(sk) &&
450 sk_memory_allocated(sk) < sk_prot_mem_limits(sk, 0)) {
451 sk->sk_rcvbuf = min(atomic_read(&sk->sk_rmem_alloc),
454 if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf)
455 tp->rcv_ssthresh = min(tp->window_clamp, 2U * tp->advmss);
458 /* Initialize RCV_MSS value.
459 * RCV_MSS is an our guess about MSS used by the peer.
460 * We haven't any direct information about the MSS.
461 * It's better to underestimate the RCV_MSS rather than overestimate.
462 * Overestimations make us ACKing less frequently than needed.
463 * Underestimations are more easy to detect and fix by tcp_measure_rcv_mss().
465 void tcp_initialize_rcv_mss(struct sock *sk)
467 const struct tcp_sock *tp = tcp_sk(sk);
468 unsigned int hint = min_t(unsigned int, tp->advmss, tp->mss_cache);
470 hint = min(hint, tp->rcv_wnd / 2);
471 hint = min(hint, TCP_MSS_DEFAULT);
472 hint = max(hint, TCP_MIN_MSS);
474 inet_csk(sk)->icsk_ack.rcv_mss = hint;
476 EXPORT_SYMBOL(tcp_initialize_rcv_mss);
478 /* Receiver "autotuning" code.
480 * The algorithm for RTT estimation w/o timestamps is based on
481 * Dynamic Right-Sizing (DRS) by Wu Feng and Mike Fisk of LANL.
482 * <http://public.lanl.gov/radiant/pubs.html#DRS>
484 * More detail on this code can be found at
485 * <http://staff.psc.edu/jheffner/>,
486 * though this reference is out of date. A new paper
489 static void tcp_rcv_rtt_update(struct tcp_sock *tp, u32 sample, int win_dep)
491 u32 new_sample = tp->rcv_rtt_est.rtt;
497 if (new_sample != 0) {
498 /* If we sample in larger samples in the non-timestamp
499 * case, we could grossly overestimate the RTT especially
500 * with chatty applications or bulk transfer apps which
501 * are stalled on filesystem I/O.
503 * Also, since we are only going for a minimum in the
504 * non-timestamp case, we do not smooth things out
505 * else with timestamps disabled convergence takes too
509 m -= (new_sample >> 3);
517 /* No previous measure. */
521 if (tp->rcv_rtt_est.rtt != new_sample)
522 tp->rcv_rtt_est.rtt = new_sample;
525 static inline void tcp_rcv_rtt_measure(struct tcp_sock *tp)
527 if (tp->rcv_rtt_est.time == 0)
529 if (before(tp->rcv_nxt, tp->rcv_rtt_est.seq))
531 tcp_rcv_rtt_update(tp, tcp_time_stamp - tp->rcv_rtt_est.time, 1);
534 tp->rcv_rtt_est.seq = tp->rcv_nxt + tp->rcv_wnd;
535 tp->rcv_rtt_est.time = tcp_time_stamp;
538 static inline void tcp_rcv_rtt_measure_ts(struct sock *sk,
539 const struct sk_buff *skb)
541 struct tcp_sock *tp = tcp_sk(sk);
542 if (tp->rx_opt.rcv_tsecr &&
543 (TCP_SKB_CB(skb)->end_seq -
544 TCP_SKB_CB(skb)->seq >= inet_csk(sk)->icsk_ack.rcv_mss))
545 tcp_rcv_rtt_update(tp, tcp_time_stamp - tp->rx_opt.rcv_tsecr, 0);
549 * This function should be called every time data is copied to user space.
550 * It calculates the appropriate TCP receive buffer space.
552 void tcp_rcv_space_adjust(struct sock *sk)
554 struct tcp_sock *tp = tcp_sk(sk);
558 time = tcp_time_stamp - tp->rcvq_space.time;
559 if (time < (tp->rcv_rtt_est.rtt >> 3) || tp->rcv_rtt_est.rtt == 0)
562 /* Number of bytes copied to user in last RTT */
563 copied = tp->copied_seq - tp->rcvq_space.seq;
564 if (copied <= tp->rcvq_space.space)
568 * copied = bytes received in previous RTT, our base window
569 * To cope with packet losses, we need a 2x factor
570 * To cope with slow start, and sender growing its cwin by 100 %
571 * every RTT, we need a 4x factor, because the ACK we are sending
572 * now is for the next RTT, not the current one :
573 * <prev RTT . ><current RTT .. ><next RTT .... >
576 if (sysctl_tcp_moderate_rcvbuf &&
577 !(sk->sk_userlocks & SOCK_RCVBUF_LOCK)) {
578 int rcvwin, rcvmem, rcvbuf;
580 /* minimal window to cope with packet losses, assuming
581 * steady state. Add some cushion because of small variations.
583 rcvwin = (copied << 1) + 16 * tp->advmss;
585 /* If rate increased by 25%,
586 * assume slow start, rcvwin = 3 * copied
587 * If rate increased by 50%,
588 * assume sender can use 2x growth, rcvwin = 4 * copied
591 tp->rcvq_space.space + (tp->rcvq_space.space >> 2)) {
593 tp->rcvq_space.space + (tp->rcvq_space.space >> 1))
596 rcvwin += (rcvwin >> 1);
599 rcvmem = SKB_TRUESIZE(tp->advmss + MAX_TCP_HEADER);
600 while (tcp_win_from_space(rcvmem) < tp->advmss)
603 rcvbuf = min(rcvwin / tp->advmss * rcvmem, sysctl_tcp_rmem[2]);
604 if (rcvbuf > sk->sk_rcvbuf) {
605 sk->sk_rcvbuf = rcvbuf;
607 /* Make the window clamp follow along. */
608 tp->window_clamp = rcvwin;
611 tp->rcvq_space.space = copied;
614 tp->rcvq_space.seq = tp->copied_seq;
615 tp->rcvq_space.time = tcp_time_stamp;
618 /* There is something which you must keep in mind when you analyze the
619 * behavior of the tp->ato delayed ack timeout interval. When a
620 * connection starts up, we want to ack as quickly as possible. The
621 * problem is that "good" TCP's do slow start at the beginning of data
622 * transmission. The means that until we send the first few ACK's the
623 * sender will sit on his end and only queue most of his data, because
624 * he can only send snd_cwnd unacked packets at any given time. For
625 * each ACK we send, he increments snd_cwnd and transmits more of his
628 static void tcp_event_data_recv(struct sock *sk, struct sk_buff *skb)
630 struct tcp_sock *tp = tcp_sk(sk);
631 struct inet_connection_sock *icsk = inet_csk(sk);
634 inet_csk_schedule_ack(sk);
636 tcp_measure_rcv_mss(sk, skb);
638 tcp_rcv_rtt_measure(tp);
640 now = tcp_time_stamp;
642 if (!icsk->icsk_ack.ato) {
643 /* The _first_ data packet received, initialize
644 * delayed ACK engine.
646 tcp_incr_quickack(sk);
647 icsk->icsk_ack.ato = TCP_ATO_MIN;
649 int m = now - icsk->icsk_ack.lrcvtime;
651 if (m <= TCP_ATO_MIN / 2) {
652 /* The fastest case is the first. */
653 icsk->icsk_ack.ato = (icsk->icsk_ack.ato >> 1) + TCP_ATO_MIN / 2;
654 } else if (m < icsk->icsk_ack.ato) {
655 icsk->icsk_ack.ato = (icsk->icsk_ack.ato >> 1) + m;
656 if (icsk->icsk_ack.ato > icsk->icsk_rto)
657 icsk->icsk_ack.ato = icsk->icsk_rto;
658 } else if (m > icsk->icsk_rto) {
659 /* Too long gap. Apparently sender failed to
660 * restart window, so that we send ACKs quickly.
662 tcp_incr_quickack(sk);
666 icsk->icsk_ack.lrcvtime = now;
668 tcp_ecn_check_ce(tp, skb);
671 tcp_grow_window(sk, skb);
674 /* Called to compute a smoothed rtt estimate. The data fed to this
675 * routine either comes from timestamps, or from segments that were
676 * known _not_ to have been retransmitted [see Karn/Partridge
677 * Proceedings SIGCOMM 87]. The algorithm is from the SIGCOMM 88
678 * piece by Van Jacobson.
679 * NOTE: the next three routines used to be one big routine.
680 * To save cycles in the RFC 1323 implementation it was better to break
681 * it up into three procedures. -- erics
683 static void tcp_rtt_estimator(struct sock *sk, long mrtt_us)
685 struct tcp_sock *tp = tcp_sk(sk);
686 long m = mrtt_us; /* RTT */
687 u32 srtt = tp->srtt_us;
689 /* The following amusing code comes from Jacobson's
690 * article in SIGCOMM '88. Note that rtt and mdev
691 * are scaled versions of rtt and mean deviation.
692 * This is designed to be as fast as possible
693 * m stands for "measurement".
695 * On a 1990 paper the rto value is changed to:
696 * RTO = rtt + 4 * mdev
698 * Funny. This algorithm seems to be very broken.
699 * These formulae increase RTO, when it should be decreased, increase
700 * too slowly, when it should be increased quickly, decrease too quickly
701 * etc. I guess in BSD RTO takes ONE value, so that it is absolutely
702 * does not matter how to _calculate_ it. Seems, it was trap
703 * that VJ failed to avoid. 8)
706 m -= (srtt >> 3); /* m is now error in rtt est */
707 srtt += m; /* rtt = 7/8 rtt + 1/8 new */
709 m = -m; /* m is now abs(error) */
710 m -= (tp->mdev_us >> 2); /* similar update on mdev */
711 /* This is similar to one of Eifel findings.
712 * Eifel blocks mdev updates when rtt decreases.
713 * This solution is a bit different: we use finer gain
714 * for mdev in this case (alpha*beta).
715 * Like Eifel it also prevents growth of rto,
716 * but also it limits too fast rto decreases,
717 * happening in pure Eifel.
722 m -= (tp->mdev_us >> 2); /* similar update on mdev */
724 tp->mdev_us += m; /* mdev = 3/4 mdev + 1/4 new */
725 if (tp->mdev_us > tp->mdev_max_us) {
726 tp->mdev_max_us = tp->mdev_us;
727 if (tp->mdev_max_us > tp->rttvar_us)
728 tp->rttvar_us = tp->mdev_max_us;
730 if (after(tp->snd_una, tp->rtt_seq)) {
731 if (tp->mdev_max_us < tp->rttvar_us)
732 tp->rttvar_us -= (tp->rttvar_us - tp->mdev_max_us) >> 2;
733 tp->rtt_seq = tp->snd_nxt;
734 tp->mdev_max_us = tcp_rto_min_us(sk);
737 /* no previous measure. */
738 srtt = m << 3; /* take the measured time to be rtt */
739 tp->mdev_us = m << 1; /* make sure rto = 3*rtt */
740 tp->rttvar_us = max(tp->mdev_us, tcp_rto_min_us(sk));
741 tp->mdev_max_us = tp->rttvar_us;
742 tp->rtt_seq = tp->snd_nxt;
744 tp->srtt_us = max(1U, srtt);
747 /* Set the sk_pacing_rate to allow proper sizing of TSO packets.
748 * Note: TCP stack does not yet implement pacing.
749 * FQ packet scheduler can be used to implement cheap but effective
750 * TCP pacing, to smooth the burst on large writes when packets
751 * in flight is significantly lower than cwnd (or rwin)
753 static void tcp_update_pacing_rate(struct sock *sk)
755 const struct tcp_sock *tp = tcp_sk(sk);
758 /* set sk_pacing_rate to 200 % of current rate (mss * cwnd / srtt) */
759 rate = (u64)tp->mss_cache * 2 * (USEC_PER_SEC << 3);
761 rate *= max(tp->snd_cwnd, tp->packets_out);
763 if (likely(tp->srtt_us))
764 do_div(rate, tp->srtt_us);
766 /* ACCESS_ONCE() is needed because sch_fq fetches sk_pacing_rate
767 * without any lock. We want to make sure compiler wont store
768 * intermediate values in this location.
770 ACCESS_ONCE(sk->sk_pacing_rate) = min_t(u64, rate,
771 sk->sk_max_pacing_rate);
774 /* Calculate rto without backoff. This is the second half of Van Jacobson's
775 * routine referred to above.
777 static void tcp_set_rto(struct sock *sk)
779 const struct tcp_sock *tp = tcp_sk(sk);
780 /* Old crap is replaced with new one. 8)
783 * 1. If rtt variance happened to be less 50msec, it is hallucination.
784 * It cannot be less due to utterly erratic ACK generation made
785 * at least by solaris and freebsd. "Erratic ACKs" has _nothing_
786 * to do with delayed acks, because at cwnd>2 true delack timeout
787 * is invisible. Actually, Linux-2.4 also generates erratic
788 * ACKs in some circumstances.
790 inet_csk(sk)->icsk_rto = __tcp_set_rto(tp);
792 /* 2. Fixups made earlier cannot be right.
793 * If we do not estimate RTO correctly without them,
794 * all the algo is pure shit and should be replaced
795 * with correct one. It is exactly, which we pretend to do.
798 /* NOTE: clamping at TCP_RTO_MIN is not required, current algo
799 * guarantees that rto is higher.
804 __u32 tcp_init_cwnd(const struct tcp_sock *tp, const struct dst_entry *dst)
806 __u32 cwnd = (dst ? dst_metric(dst, RTAX_INITCWND) : 0);
809 cwnd = TCP_INIT_CWND;
810 return min_t(__u32, cwnd, tp->snd_cwnd_clamp);
814 * Packet counting of FACK is based on in-order assumptions, therefore TCP
815 * disables it when reordering is detected
817 void tcp_disable_fack(struct tcp_sock *tp)
819 /* RFC3517 uses different metric in lost marker => reset on change */
821 tp->lost_skb_hint = NULL;
822 tp->rx_opt.sack_ok &= ~TCP_FACK_ENABLED;
825 /* Take a notice that peer is sending D-SACKs */
826 static void tcp_dsack_seen(struct tcp_sock *tp)
828 tp->rx_opt.sack_ok |= TCP_DSACK_SEEN;
831 static void tcp_update_reordering(struct sock *sk, const int metric,
834 struct tcp_sock *tp = tcp_sk(sk);
835 if (metric > tp->reordering) {
838 tp->reordering = min(sysctl_tcp_max_reordering, metric);
840 /* This exciting event is worth to be remembered. 8) */
842 mib_idx = LINUX_MIB_TCPTSREORDER;
843 else if (tcp_is_reno(tp))
844 mib_idx = LINUX_MIB_TCPRENOREORDER;
845 else if (tcp_is_fack(tp))
846 mib_idx = LINUX_MIB_TCPFACKREORDER;
848 mib_idx = LINUX_MIB_TCPSACKREORDER;
850 NET_INC_STATS_BH(sock_net(sk), mib_idx);
851 #if FASTRETRANS_DEBUG > 1
852 pr_debug("Disorder%d %d %u f%u s%u rr%d\n",
853 tp->rx_opt.sack_ok, inet_csk(sk)->icsk_ca_state,
857 tp->undo_marker ? tp->undo_retrans : 0);
859 tcp_disable_fack(tp);
863 tcp_disable_early_retrans(tp);
866 /* This must be called before lost_out is incremented */
867 static void tcp_verify_retransmit_hint(struct tcp_sock *tp, struct sk_buff *skb)
869 if (!tp->retransmit_skb_hint ||
870 before(TCP_SKB_CB(skb)->seq,
871 TCP_SKB_CB(tp->retransmit_skb_hint)->seq))
872 tp->retransmit_skb_hint = skb;
875 after(TCP_SKB_CB(skb)->end_seq, tp->retransmit_high))
876 tp->retransmit_high = TCP_SKB_CB(skb)->end_seq;
879 static void tcp_skb_mark_lost(struct tcp_sock *tp, struct sk_buff *skb)
881 if (!(TCP_SKB_CB(skb)->sacked & (TCPCB_LOST|TCPCB_SACKED_ACKED))) {
882 tcp_verify_retransmit_hint(tp, skb);
884 tp->lost_out += tcp_skb_pcount(skb);
885 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
889 static void tcp_skb_mark_lost_uncond_verify(struct tcp_sock *tp,
892 tcp_verify_retransmit_hint(tp, skb);
894 if (!(TCP_SKB_CB(skb)->sacked & (TCPCB_LOST|TCPCB_SACKED_ACKED))) {
895 tp->lost_out += tcp_skb_pcount(skb);
896 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
900 /* This procedure tags the retransmission queue when SACKs arrive.
902 * We have three tag bits: SACKED(S), RETRANS(R) and LOST(L).
903 * Packets in queue with these bits set are counted in variables
904 * sacked_out, retrans_out and lost_out, correspondingly.
906 * Valid combinations are:
907 * Tag InFlight Description
908 * 0 1 - orig segment is in flight.
909 * S 0 - nothing flies, orig reached receiver.
910 * L 0 - nothing flies, orig lost by net.
911 * R 2 - both orig and retransmit are in flight.
912 * L|R 1 - orig is lost, retransmit is in flight.
913 * S|R 1 - orig reached receiver, retrans is still in flight.
914 * (L|S|R is logically valid, it could occur when L|R is sacked,
915 * but it is equivalent to plain S and code short-curcuits it to S.
916 * L|S is logically invalid, it would mean -1 packet in flight 8))
918 * These 6 states form finite state machine, controlled by the following events:
919 * 1. New ACK (+SACK) arrives. (tcp_sacktag_write_queue())
920 * 2. Retransmission. (tcp_retransmit_skb(), tcp_xmit_retransmit_queue())
921 * 3. Loss detection event of two flavors:
922 * A. Scoreboard estimator decided the packet is lost.
923 * A'. Reno "three dupacks" marks head of queue lost.
924 * A''. Its FACK modification, head until snd.fack is lost.
925 * B. SACK arrives sacking SND.NXT at the moment, when the
926 * segment was retransmitted.
927 * 4. D-SACK added new rule: D-SACK changes any tag to S.
929 * It is pleasant to note, that state diagram turns out to be commutative,
930 * so that we are allowed not to be bothered by order of our actions,
931 * when multiple events arrive simultaneously. (see the function below).
933 * Reordering detection.
934 * --------------------
935 * Reordering metric is maximal distance, which a packet can be displaced
936 * in packet stream. With SACKs we can estimate it:
938 * 1. SACK fills old hole and the corresponding segment was not
939 * ever retransmitted -> reordering. Alas, we cannot use it
940 * when segment was retransmitted.
941 * 2. The last flaw is solved with D-SACK. D-SACK arrives
942 * for retransmitted and already SACKed segment -> reordering..
943 * Both of these heuristics are not used in Loss state, when we cannot
944 * account for retransmits accurately.
946 * SACK block validation.
947 * ----------------------
949 * SACK block range validation checks that the received SACK block fits to
950 * the expected sequence limits, i.e., it is between SND.UNA and SND.NXT.
951 * Note that SND.UNA is not included to the range though being valid because
952 * it means that the receiver is rather inconsistent with itself reporting
953 * SACK reneging when it should advance SND.UNA. Such SACK block this is
954 * perfectly valid, however, in light of RFC2018 which explicitly states
955 * that "SACK block MUST reflect the newest segment. Even if the newest
956 * segment is going to be discarded ...", not that it looks very clever
957 * in case of head skb. Due to potentional receiver driven attacks, we
958 * choose to avoid immediate execution of a walk in write queue due to
959 * reneging and defer head skb's loss recovery to standard loss recovery
960 * procedure that will eventually trigger (nothing forbids us doing this).
962 * Implements also blockage to start_seq wrap-around. Problem lies in the
963 * fact that though start_seq (s) is before end_seq (i.e., not reversed),
964 * there's no guarantee that it will be before snd_nxt (n). The problem
965 * happens when start_seq resides between end_seq wrap (e_w) and snd_nxt
968 * <- outs wnd -> <- wrapzone ->
969 * u e n u_w e_w s n_w
971 * |<------------+------+----- TCP seqno space --------------+---------->|
972 * ...-- <2^31 ->| |<--------...
973 * ...---- >2^31 ------>| |<--------...
975 * Current code wouldn't be vulnerable but it's better still to discard such
976 * crazy SACK blocks. Doing this check for start_seq alone closes somewhat
977 * similar case (end_seq after snd_nxt wrap) as earlier reversed check in
978 * snd_nxt wrap -> snd_una region will then become "well defined", i.e.,
979 * equal to the ideal case (infinite seqno space without wrap caused issues).
981 * With D-SACK the lower bound is extended to cover sequence space below
982 * SND.UNA down to undo_marker, which is the last point of interest. Yet
983 * again, D-SACK block must not to go across snd_una (for the same reason as
984 * for the normal SACK blocks, explained above). But there all simplicity
985 * ends, TCP might receive valid D-SACKs below that. As long as they reside
986 * fully below undo_marker they do not affect behavior in anyway and can
987 * therefore be safely ignored. In rare cases (which are more or less
988 * theoretical ones), the D-SACK will nicely cross that boundary due to skb
989 * fragmentation and packet reordering past skb's retransmission. To consider
990 * them correctly, the acceptable range must be extended even more though
991 * the exact amount is rather hard to quantify. However, tp->max_window can
992 * be used as an exaggerated estimate.
994 static bool tcp_is_sackblock_valid(struct tcp_sock *tp, bool is_dsack,
995 u32 start_seq, u32 end_seq)
997 /* Too far in future, or reversed (interpretation is ambiguous) */
998 if (after(end_seq, tp->snd_nxt) || !before(start_seq, end_seq))
1001 /* Nasty start_seq wrap-around check (see comments above) */
1002 if (!before(start_seq, tp->snd_nxt))
1005 /* In outstanding window? ...This is valid exit for D-SACKs too.
1006 * start_seq == snd_una is non-sensical (see comments above)
1008 if (after(start_seq, tp->snd_una))
1011 if (!is_dsack || !tp->undo_marker)
1014 /* ...Then it's D-SACK, and must reside below snd_una completely */
1015 if (after(end_seq, tp->snd_una))
1018 if (!before(start_seq, tp->undo_marker))
1022 if (!after(end_seq, tp->undo_marker))
1025 /* Undo_marker boundary crossing (overestimates a lot). Known already:
1026 * start_seq < undo_marker and end_seq >= undo_marker.
1028 return !before(start_seq, end_seq - tp->max_window);
1031 /* Check for lost retransmit. This superb idea is borrowed from "ratehalving".
1032 * Event "B". Later note: FACK people cheated me again 8), we have to account
1033 * for reordering! Ugly, but should help.
1035 * Search retransmitted skbs from write_queue that were sent when snd_nxt was
1036 * less than what is now known to be received by the other end (derived from
1037 * highest SACK block). Also calculate the lowest snd_nxt among the remaining
1038 * retransmitted skbs to avoid some costly processing per ACKs.
1040 static void tcp_mark_lost_retrans(struct sock *sk)
1042 const struct inet_connection_sock *icsk = inet_csk(sk);
1043 struct tcp_sock *tp = tcp_sk(sk);
1044 struct sk_buff *skb;
1046 u32 new_low_seq = tp->snd_nxt;
1047 u32 received_upto = tcp_highest_sack_seq(tp);
1049 if (!tcp_is_fack(tp) || !tp->retrans_out ||
1050 !after(received_upto, tp->lost_retrans_low) ||
1051 icsk->icsk_ca_state != TCP_CA_Recovery)
1054 tcp_for_write_queue(skb, sk) {
1055 u32 ack_seq = TCP_SKB_CB(skb)->ack_seq;
1057 if (skb == tcp_send_head(sk))
1059 if (cnt == tp->retrans_out)
1061 if (!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
1064 if (!(TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS))
1067 /* TODO: We would like to get rid of tcp_is_fack(tp) only
1068 * constraint here (see above) but figuring out that at
1069 * least tp->reordering SACK blocks reside between ack_seq
1070 * and received_upto is not easy task to do cheaply with
1071 * the available datastructures.
1073 * Whether FACK should check here for tp->reordering segs
1074 * in-between one could argue for either way (it would be
1075 * rather simple to implement as we could count fack_count
1076 * during the walk and do tp->fackets_out - fack_count).
1078 if (after(received_upto, ack_seq)) {
1079 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
1080 tp->retrans_out -= tcp_skb_pcount(skb);
1082 tcp_skb_mark_lost_uncond_verify(tp, skb);
1083 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPLOSTRETRANSMIT);
1085 if (before(ack_seq, new_low_seq))
1086 new_low_seq = ack_seq;
1087 cnt += tcp_skb_pcount(skb);
1091 if (tp->retrans_out)
1092 tp->lost_retrans_low = new_low_seq;
1095 static bool tcp_check_dsack(struct sock *sk, const struct sk_buff *ack_skb,
1096 struct tcp_sack_block_wire *sp, int num_sacks,
1099 struct tcp_sock *tp = tcp_sk(sk);
1100 u32 start_seq_0 = get_unaligned_be32(&sp[0].start_seq);
1101 u32 end_seq_0 = get_unaligned_be32(&sp[0].end_seq);
1102 bool dup_sack = false;
1104 if (before(start_seq_0, TCP_SKB_CB(ack_skb)->ack_seq)) {
1107 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPDSACKRECV);
1108 } else if (num_sacks > 1) {
1109 u32 end_seq_1 = get_unaligned_be32(&sp[1].end_seq);
1110 u32 start_seq_1 = get_unaligned_be32(&sp[1].start_seq);
1112 if (!after(end_seq_0, end_seq_1) &&
1113 !before(start_seq_0, start_seq_1)) {
1116 NET_INC_STATS_BH(sock_net(sk),
1117 LINUX_MIB_TCPDSACKOFORECV);
1121 /* D-SACK for already forgotten data... Do dumb counting. */
1122 if (dup_sack && tp->undo_marker && tp->undo_retrans > 0 &&
1123 !after(end_seq_0, prior_snd_una) &&
1124 after(end_seq_0, tp->undo_marker))
1130 struct tcp_sacktag_state {
1133 /* Timestamps for earliest and latest never-retransmitted segment
1134 * that was SACKed. RTO needs the earliest RTT to stay conservative,
1135 * but congestion control should still get an accurate delay signal.
1137 struct skb_mstamp first_sackt;
1138 struct skb_mstamp last_sackt;
1142 /* Check if skb is fully within the SACK block. In presence of GSO skbs,
1143 * the incoming SACK may not exactly match but we can find smaller MSS
1144 * aligned portion of it that matches. Therefore we might need to fragment
1145 * which may fail and creates some hassle (caller must handle error case
1148 * FIXME: this could be merged to shift decision code
1150 static int tcp_match_skb_to_sack(struct sock *sk, struct sk_buff *skb,
1151 u32 start_seq, u32 end_seq)
1155 unsigned int pkt_len;
1158 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq) &&
1159 !before(end_seq, TCP_SKB_CB(skb)->end_seq);
1161 if (tcp_skb_pcount(skb) > 1 && !in_sack &&
1162 after(TCP_SKB_CB(skb)->end_seq, start_seq)) {
1163 mss = tcp_skb_mss(skb);
1164 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq);
1167 pkt_len = start_seq - TCP_SKB_CB(skb)->seq;
1171 pkt_len = end_seq - TCP_SKB_CB(skb)->seq;
1176 /* Round if necessary so that SACKs cover only full MSSes
1177 * and/or the remaining small portion (if present)
1179 if (pkt_len > mss) {
1180 unsigned int new_len = (pkt_len / mss) * mss;
1181 if (!in_sack && new_len < pkt_len) {
1183 if (new_len >= skb->len)
1188 err = tcp_fragment(sk, skb, pkt_len, mss, GFP_ATOMIC);
1196 /* Mark the given newly-SACKed range as such, adjusting counters and hints. */
1197 static u8 tcp_sacktag_one(struct sock *sk,
1198 struct tcp_sacktag_state *state, u8 sacked,
1199 u32 start_seq, u32 end_seq,
1200 int dup_sack, int pcount,
1201 const struct skb_mstamp *xmit_time)
1203 struct tcp_sock *tp = tcp_sk(sk);
1204 int fack_count = state->fack_count;
1206 /* Account D-SACK for retransmitted packet. */
1207 if (dup_sack && (sacked & TCPCB_RETRANS)) {
1208 if (tp->undo_marker && tp->undo_retrans > 0 &&
1209 after(end_seq, tp->undo_marker))
1211 if (sacked & TCPCB_SACKED_ACKED)
1212 state->reord = min(fack_count, state->reord);
1215 /* Nothing to do; acked frame is about to be dropped (was ACKed). */
1216 if (!after(end_seq, tp->snd_una))
1219 if (!(sacked & TCPCB_SACKED_ACKED)) {
1220 if (sacked & TCPCB_SACKED_RETRANS) {
1221 /* If the segment is not tagged as lost,
1222 * we do not clear RETRANS, believing
1223 * that retransmission is still in flight.
1225 if (sacked & TCPCB_LOST) {
1226 sacked &= ~(TCPCB_LOST|TCPCB_SACKED_RETRANS);
1227 tp->lost_out -= pcount;
1228 tp->retrans_out -= pcount;
1231 if (!(sacked & TCPCB_RETRANS)) {
1232 /* New sack for not retransmitted frame,
1233 * which was in hole. It is reordering.
1235 if (before(start_seq,
1236 tcp_highest_sack_seq(tp)))
1237 state->reord = min(fack_count,
1239 if (!after(end_seq, tp->high_seq))
1240 state->flag |= FLAG_ORIG_SACK_ACKED;
1241 if (state->first_sackt.v64 == 0)
1242 state->first_sackt = *xmit_time;
1243 state->last_sackt = *xmit_time;
1246 if (sacked & TCPCB_LOST) {
1247 sacked &= ~TCPCB_LOST;
1248 tp->lost_out -= pcount;
1252 sacked |= TCPCB_SACKED_ACKED;
1253 state->flag |= FLAG_DATA_SACKED;
1254 tp->sacked_out += pcount;
1256 fack_count += pcount;
1258 /* Lost marker hint past SACKed? Tweak RFC3517 cnt */
1259 if (!tcp_is_fack(tp) && tp->lost_skb_hint &&
1260 before(start_seq, TCP_SKB_CB(tp->lost_skb_hint)->seq))
1261 tp->lost_cnt_hint += pcount;
1263 if (fack_count > tp->fackets_out)
1264 tp->fackets_out = fack_count;
1267 /* D-SACK. We can detect redundant retransmission in S|R and plain R
1268 * frames and clear it. undo_retrans is decreased above, L|R frames
1269 * are accounted above as well.
1271 if (dup_sack && (sacked & TCPCB_SACKED_RETRANS)) {
1272 sacked &= ~TCPCB_SACKED_RETRANS;
1273 tp->retrans_out -= pcount;
1279 /* Shift newly-SACKed bytes from this skb to the immediately previous
1280 * already-SACKed sk_buff. Mark the newly-SACKed bytes as such.
1282 static bool tcp_shifted_skb(struct sock *sk, struct sk_buff *skb,
1283 struct tcp_sacktag_state *state,
1284 unsigned int pcount, int shifted, int mss,
1287 struct tcp_sock *tp = tcp_sk(sk);
1288 struct sk_buff *prev = tcp_write_queue_prev(sk, skb);
1289 u32 start_seq = TCP_SKB_CB(skb)->seq; /* start of newly-SACKed */
1290 u32 end_seq = start_seq + shifted; /* end of newly-SACKed */
1294 /* Adjust counters and hints for the newly sacked sequence
1295 * range but discard the return value since prev is already
1296 * marked. We must tag the range first because the seq
1297 * advancement below implicitly advances
1298 * tcp_highest_sack_seq() when skb is highest_sack.
1300 tcp_sacktag_one(sk, state, TCP_SKB_CB(skb)->sacked,
1301 start_seq, end_seq, dup_sack, pcount,
1304 if (skb == tp->lost_skb_hint)
1305 tp->lost_cnt_hint += pcount;
1307 TCP_SKB_CB(prev)->end_seq += shifted;
1308 TCP_SKB_CB(skb)->seq += shifted;
1310 tcp_skb_pcount_add(prev, pcount);
1311 BUG_ON(tcp_skb_pcount(skb) < pcount);
1312 tcp_skb_pcount_add(skb, -pcount);
1314 /* When we're adding to gso_segs == 1, gso_size will be zero,
1315 * in theory this shouldn't be necessary but as long as DSACK
1316 * code can come after this skb later on it's better to keep
1317 * setting gso_size to something.
1319 if (!skb_shinfo(prev)->gso_size) {
1320 skb_shinfo(prev)->gso_size = mss;
1321 skb_shinfo(prev)->gso_type = sk->sk_gso_type;
1324 /* CHECKME: To clear or not to clear? Mimics normal skb currently */
1325 if (tcp_skb_pcount(skb) <= 1) {
1326 skb_shinfo(skb)->gso_size = 0;
1327 skb_shinfo(skb)->gso_type = 0;
1330 /* Difference in this won't matter, both ACKed by the same cumul. ACK */
1331 TCP_SKB_CB(prev)->sacked |= (TCP_SKB_CB(skb)->sacked & TCPCB_EVER_RETRANS);
1334 BUG_ON(!tcp_skb_pcount(skb));
1335 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_SACKSHIFTED);
1339 /* Whole SKB was eaten :-) */
1341 if (skb == tp->retransmit_skb_hint)
1342 tp->retransmit_skb_hint = prev;
1343 if (skb == tp->lost_skb_hint) {
1344 tp->lost_skb_hint = prev;
1345 tp->lost_cnt_hint -= tcp_skb_pcount(prev);
1348 TCP_SKB_CB(prev)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags;
1349 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)
1350 TCP_SKB_CB(prev)->end_seq++;
1352 if (skb == tcp_highest_sack(sk))
1353 tcp_advance_highest_sack(sk, skb);
1355 tcp_unlink_write_queue(skb, sk);
1356 sk_wmem_free_skb(sk, skb);
1358 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_SACKMERGED);
1363 /* I wish gso_size would have a bit more sane initialization than
1364 * something-or-zero which complicates things
1366 static int tcp_skb_seglen(const struct sk_buff *skb)
1368 return tcp_skb_pcount(skb) == 1 ? skb->len : tcp_skb_mss(skb);
1371 /* Shifting pages past head area doesn't work */
1372 static int skb_can_shift(const struct sk_buff *skb)
1374 return !skb_headlen(skb) && skb_is_nonlinear(skb);
1377 /* Try collapsing SACK blocks spanning across multiple skbs to a single
1380 static struct sk_buff *tcp_shift_skb_data(struct sock *sk, struct sk_buff *skb,
1381 struct tcp_sacktag_state *state,
1382 u32 start_seq, u32 end_seq,
1385 struct tcp_sock *tp = tcp_sk(sk);
1386 struct sk_buff *prev;
1392 if (!sk_can_gso(sk))
1395 /* Normally R but no L won't result in plain S */
1397 (TCP_SKB_CB(skb)->sacked & (TCPCB_LOST|TCPCB_SACKED_RETRANS)) == TCPCB_SACKED_RETRANS)
1399 if (!skb_can_shift(skb))
1401 /* This frame is about to be dropped (was ACKed). */
1402 if (!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
1405 /* Can only happen with delayed DSACK + discard craziness */
1406 if (unlikely(skb == tcp_write_queue_head(sk)))
1408 prev = tcp_write_queue_prev(sk, skb);
1410 if ((TCP_SKB_CB(prev)->sacked & TCPCB_TAGBITS) != TCPCB_SACKED_ACKED)
1413 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq) &&
1414 !before(end_seq, TCP_SKB_CB(skb)->end_seq);
1418 pcount = tcp_skb_pcount(skb);
1419 mss = tcp_skb_seglen(skb);
1421 /* TODO: Fix DSACKs to not fragment already SACKed and we can
1422 * drop this restriction as unnecessary
1424 if (mss != tcp_skb_seglen(prev))
1427 if (!after(TCP_SKB_CB(skb)->end_seq, start_seq))
1429 /* CHECKME: This is non-MSS split case only?, this will
1430 * cause skipped skbs due to advancing loop btw, original
1431 * has that feature too
1433 if (tcp_skb_pcount(skb) <= 1)
1436 in_sack = !after(start_seq, TCP_SKB_CB(skb)->seq);
1438 /* TODO: head merge to next could be attempted here
1439 * if (!after(TCP_SKB_CB(skb)->end_seq, end_seq)),
1440 * though it might not be worth of the additional hassle
1442 * ...we can probably just fallback to what was done
1443 * previously. We could try merging non-SACKed ones
1444 * as well but it probably isn't going to buy off
1445 * because later SACKs might again split them, and
1446 * it would make skb timestamp tracking considerably
1452 len = end_seq - TCP_SKB_CB(skb)->seq;
1454 BUG_ON(len > skb->len);
1456 /* MSS boundaries should be honoured or else pcount will
1457 * severely break even though it makes things bit trickier.
1458 * Optimize common case to avoid most of the divides
1460 mss = tcp_skb_mss(skb);
1462 /* TODO: Fix DSACKs to not fragment already SACKed and we can
1463 * drop this restriction as unnecessary
1465 if (mss != tcp_skb_seglen(prev))
1470 } else if (len < mss) {
1478 /* tcp_sacktag_one() won't SACK-tag ranges below snd_una */
1479 if (!after(TCP_SKB_CB(skb)->seq + len, tp->snd_una))
1482 if (!skb_shift(prev, skb, len))
1484 if (!tcp_shifted_skb(sk, skb, state, pcount, len, mss, dup_sack))
1487 /* Hole filled allows collapsing with the next as well, this is very
1488 * useful when hole on every nth skb pattern happens
1490 if (prev == tcp_write_queue_tail(sk))
1492 skb = tcp_write_queue_next(sk, prev);
1494 if (!skb_can_shift(skb) ||
1495 (skb == tcp_send_head(sk)) ||
1496 ((TCP_SKB_CB(skb)->sacked & TCPCB_TAGBITS) != TCPCB_SACKED_ACKED) ||
1497 (mss != tcp_skb_seglen(skb)))
1501 if (skb_shift(prev, skb, len)) {
1502 pcount += tcp_skb_pcount(skb);
1503 tcp_shifted_skb(sk, skb, state, tcp_skb_pcount(skb), len, mss, 0);
1507 state->fack_count += pcount;
1514 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_SACKSHIFTFALLBACK);
1518 static struct sk_buff *tcp_sacktag_walk(struct sk_buff *skb, struct sock *sk,
1519 struct tcp_sack_block *next_dup,
1520 struct tcp_sacktag_state *state,
1521 u32 start_seq, u32 end_seq,
1524 struct tcp_sock *tp = tcp_sk(sk);
1525 struct sk_buff *tmp;
1527 tcp_for_write_queue_from(skb, sk) {
1529 bool dup_sack = dup_sack_in;
1531 if (skb == tcp_send_head(sk))
1534 /* queue is in-order => we can short-circuit the walk early */
1535 if (!before(TCP_SKB_CB(skb)->seq, end_seq))
1539 before(TCP_SKB_CB(skb)->seq, next_dup->end_seq)) {
1540 in_sack = tcp_match_skb_to_sack(sk, skb,
1541 next_dup->start_seq,
1547 /* skb reference here is a bit tricky to get right, since
1548 * shifting can eat and free both this skb and the next,
1549 * so not even _safe variant of the loop is enough.
1552 tmp = tcp_shift_skb_data(sk, skb, state,
1553 start_seq, end_seq, dup_sack);
1562 in_sack = tcp_match_skb_to_sack(sk, skb,
1568 if (unlikely(in_sack < 0))
1572 TCP_SKB_CB(skb)->sacked =
1575 TCP_SKB_CB(skb)->sacked,
1576 TCP_SKB_CB(skb)->seq,
1577 TCP_SKB_CB(skb)->end_seq,
1579 tcp_skb_pcount(skb),
1582 if (!before(TCP_SKB_CB(skb)->seq,
1583 tcp_highest_sack_seq(tp)))
1584 tcp_advance_highest_sack(sk, skb);
1587 state->fack_count += tcp_skb_pcount(skb);
1592 /* Avoid all extra work that is being done by sacktag while walking in
1595 static struct sk_buff *tcp_sacktag_skip(struct sk_buff *skb, struct sock *sk,
1596 struct tcp_sacktag_state *state,
1599 tcp_for_write_queue_from(skb, sk) {
1600 if (skb == tcp_send_head(sk))
1603 if (after(TCP_SKB_CB(skb)->end_seq, skip_to_seq))
1606 state->fack_count += tcp_skb_pcount(skb);
1611 static struct sk_buff *tcp_maybe_skipping_dsack(struct sk_buff *skb,
1613 struct tcp_sack_block *next_dup,
1614 struct tcp_sacktag_state *state,
1620 if (before(next_dup->start_seq, skip_to_seq)) {
1621 skb = tcp_sacktag_skip(skb, sk, state, next_dup->start_seq);
1622 skb = tcp_sacktag_walk(skb, sk, NULL, state,
1623 next_dup->start_seq, next_dup->end_seq,
1630 static int tcp_sack_cache_ok(const struct tcp_sock *tp, const struct tcp_sack_block *cache)
1632 return cache < tp->recv_sack_cache + ARRAY_SIZE(tp->recv_sack_cache);
1636 tcp_sacktag_write_queue(struct sock *sk, const struct sk_buff *ack_skb,
1637 u32 prior_snd_una, struct tcp_sacktag_state *state)
1639 struct tcp_sock *tp = tcp_sk(sk);
1640 const unsigned char *ptr = (skb_transport_header(ack_skb) +
1641 TCP_SKB_CB(ack_skb)->sacked);
1642 struct tcp_sack_block_wire *sp_wire = (struct tcp_sack_block_wire *)(ptr+2);
1643 struct tcp_sack_block sp[TCP_NUM_SACKS];
1644 struct tcp_sack_block *cache;
1645 struct sk_buff *skb;
1646 int num_sacks = min(TCP_NUM_SACKS, (ptr[1] - TCPOLEN_SACK_BASE) >> 3);
1648 bool found_dup_sack = false;
1650 int first_sack_index;
1653 state->reord = tp->packets_out;
1655 if (!tp->sacked_out) {
1656 if (WARN_ON(tp->fackets_out))
1657 tp->fackets_out = 0;
1658 tcp_highest_sack_reset(sk);
1661 found_dup_sack = tcp_check_dsack(sk, ack_skb, sp_wire,
1662 num_sacks, prior_snd_una);
1664 state->flag |= FLAG_DSACKING_ACK;
1666 /* Eliminate too old ACKs, but take into
1667 * account more or less fresh ones, they can
1668 * contain valid SACK info.
1670 if (before(TCP_SKB_CB(ack_skb)->ack_seq, prior_snd_una - tp->max_window))
1673 if (!tp->packets_out)
1677 first_sack_index = 0;
1678 for (i = 0; i < num_sacks; i++) {
1679 bool dup_sack = !i && found_dup_sack;
1681 sp[used_sacks].start_seq = get_unaligned_be32(&sp_wire[i].start_seq);
1682 sp[used_sacks].end_seq = get_unaligned_be32(&sp_wire[i].end_seq);
1684 if (!tcp_is_sackblock_valid(tp, dup_sack,
1685 sp[used_sacks].start_seq,
1686 sp[used_sacks].end_seq)) {
1690 if (!tp->undo_marker)
1691 mib_idx = LINUX_MIB_TCPDSACKIGNOREDNOUNDO;
1693 mib_idx = LINUX_MIB_TCPDSACKIGNOREDOLD;
1695 /* Don't count olds caused by ACK reordering */
1696 if ((TCP_SKB_CB(ack_skb)->ack_seq != tp->snd_una) &&
1697 !after(sp[used_sacks].end_seq, tp->snd_una))
1699 mib_idx = LINUX_MIB_TCPSACKDISCARD;
1702 NET_INC_STATS_BH(sock_net(sk), mib_idx);
1704 first_sack_index = -1;
1708 /* Ignore very old stuff early */
1709 if (!after(sp[used_sacks].end_seq, prior_snd_una))
1715 /* order SACK blocks to allow in order walk of the retrans queue */
1716 for (i = used_sacks - 1; i > 0; i--) {
1717 for (j = 0; j < i; j++) {
1718 if (after(sp[j].start_seq, sp[j + 1].start_seq)) {
1719 swap(sp[j], sp[j + 1]);
1721 /* Track where the first SACK block goes to */
1722 if (j == first_sack_index)
1723 first_sack_index = j + 1;
1728 skb = tcp_write_queue_head(sk);
1729 state->fack_count = 0;
1732 if (!tp->sacked_out) {
1733 /* It's already past, so skip checking against it */
1734 cache = tp->recv_sack_cache + ARRAY_SIZE(tp->recv_sack_cache);
1736 cache = tp->recv_sack_cache;
1737 /* Skip empty blocks in at head of the cache */
1738 while (tcp_sack_cache_ok(tp, cache) && !cache->start_seq &&
1743 while (i < used_sacks) {
1744 u32 start_seq = sp[i].start_seq;
1745 u32 end_seq = sp[i].end_seq;
1746 bool dup_sack = (found_dup_sack && (i == first_sack_index));
1747 struct tcp_sack_block *next_dup = NULL;
1749 if (found_dup_sack && ((i + 1) == first_sack_index))
1750 next_dup = &sp[i + 1];
1752 /* Skip too early cached blocks */
1753 while (tcp_sack_cache_ok(tp, cache) &&
1754 !before(start_seq, cache->end_seq))
1757 /* Can skip some work by looking recv_sack_cache? */
1758 if (tcp_sack_cache_ok(tp, cache) && !dup_sack &&
1759 after(end_seq, cache->start_seq)) {
1762 if (before(start_seq, cache->start_seq)) {
1763 skb = tcp_sacktag_skip(skb, sk, state,
1765 skb = tcp_sacktag_walk(skb, sk, next_dup,
1772 /* Rest of the block already fully processed? */
1773 if (!after(end_seq, cache->end_seq))
1776 skb = tcp_maybe_skipping_dsack(skb, sk, next_dup,
1780 /* ...tail remains todo... */
1781 if (tcp_highest_sack_seq(tp) == cache->end_seq) {
1782 /* ...but better entrypoint exists! */
1783 skb = tcp_highest_sack(sk);
1786 state->fack_count = tp->fackets_out;
1791 skb = tcp_sacktag_skip(skb, sk, state, cache->end_seq);
1792 /* Check overlap against next cached too (past this one already) */
1797 if (!before(start_seq, tcp_highest_sack_seq(tp))) {
1798 skb = tcp_highest_sack(sk);
1801 state->fack_count = tp->fackets_out;
1803 skb = tcp_sacktag_skip(skb, sk, state, start_seq);
1806 skb = tcp_sacktag_walk(skb, sk, next_dup, state,
1807 start_seq, end_seq, dup_sack);
1813 /* Clear the head of the cache sack blocks so we can skip it next time */
1814 for (i = 0; i < ARRAY_SIZE(tp->recv_sack_cache) - used_sacks; i++) {
1815 tp->recv_sack_cache[i].start_seq = 0;
1816 tp->recv_sack_cache[i].end_seq = 0;
1818 for (j = 0; j < used_sacks; j++)
1819 tp->recv_sack_cache[i++] = sp[j];
1821 if ((state->reord < tp->fackets_out) &&
1822 ((inet_csk(sk)->icsk_ca_state != TCP_CA_Loss) || tp->undo_marker))
1823 tcp_update_reordering(sk, tp->fackets_out - state->reord, 0);
1825 tcp_mark_lost_retrans(sk);
1826 tcp_verify_left_out(tp);
1829 #if FASTRETRANS_DEBUG > 0
1830 WARN_ON((int)tp->sacked_out < 0);
1831 WARN_ON((int)tp->lost_out < 0);
1832 WARN_ON((int)tp->retrans_out < 0);
1833 WARN_ON((int)tcp_packets_in_flight(tp) < 0);
1838 /* Limits sacked_out so that sum with lost_out isn't ever larger than
1839 * packets_out. Returns false if sacked_out adjustement wasn't necessary.
1841 static bool tcp_limit_reno_sacked(struct tcp_sock *tp)
1845 holes = max(tp->lost_out, 1U);
1846 holes = min(holes, tp->packets_out);
1848 if ((tp->sacked_out + holes) > tp->packets_out) {
1849 tp->sacked_out = tp->packets_out - holes;
1855 /* If we receive more dupacks than we expected counting segments
1856 * in assumption of absent reordering, interpret this as reordering.
1857 * The only another reason could be bug in receiver TCP.
1859 static void tcp_check_reno_reordering(struct sock *sk, const int addend)
1861 struct tcp_sock *tp = tcp_sk(sk);
1862 if (tcp_limit_reno_sacked(tp))
1863 tcp_update_reordering(sk, tp->packets_out + addend, 0);
1866 /* Emulate SACKs for SACKless connection: account for a new dupack. */
1868 static void tcp_add_reno_sack(struct sock *sk)
1870 struct tcp_sock *tp = tcp_sk(sk);
1872 tcp_check_reno_reordering(sk, 0);
1873 tcp_verify_left_out(tp);
1876 /* Account for ACK, ACKing some data in Reno Recovery phase. */
1878 static void tcp_remove_reno_sacks(struct sock *sk, int acked)
1880 struct tcp_sock *tp = tcp_sk(sk);
1883 /* One ACK acked hole. The rest eat duplicate ACKs. */
1884 if (acked - 1 >= tp->sacked_out)
1887 tp->sacked_out -= acked - 1;
1889 tcp_check_reno_reordering(sk, acked);
1890 tcp_verify_left_out(tp);
1893 static inline void tcp_reset_reno_sack(struct tcp_sock *tp)
1898 void tcp_clear_retrans(struct tcp_sock *tp)
1900 tp->retrans_out = 0;
1902 tp->undo_marker = 0;
1903 tp->undo_retrans = -1;
1904 tp->fackets_out = 0;
1908 static inline void tcp_init_undo(struct tcp_sock *tp)
1910 tp->undo_marker = tp->snd_una;
1911 /* Retransmission still in flight may cause DSACKs later. */
1912 tp->undo_retrans = tp->retrans_out ? : -1;
1915 /* Enter Loss state. If we detect SACK reneging, forget all SACK information
1916 * and reset tags completely, otherwise preserve SACKs. If receiver
1917 * dropped its ofo queue, we will know this due to reneging detection.
1919 void tcp_enter_loss(struct sock *sk)
1921 const struct inet_connection_sock *icsk = inet_csk(sk);
1922 struct tcp_sock *tp = tcp_sk(sk);
1923 struct sk_buff *skb;
1924 bool new_recovery = false;
1925 bool is_reneg; /* is receiver reneging on SACKs? */
1927 /* Reduce ssthresh if it has not yet been made inside this window. */
1928 if (icsk->icsk_ca_state <= TCP_CA_Disorder ||
1929 !after(tp->high_seq, tp->snd_una) ||
1930 (icsk->icsk_ca_state == TCP_CA_Loss && !icsk->icsk_retransmits)) {
1931 new_recovery = true;
1932 tp->prior_ssthresh = tcp_current_ssthresh(sk);
1933 tp->snd_ssthresh = icsk->icsk_ca_ops->ssthresh(sk);
1934 tcp_ca_event(sk, CA_EVENT_LOSS);
1938 tp->snd_cwnd_cnt = 0;
1939 tp->snd_cwnd_stamp = tcp_time_stamp;
1941 tp->retrans_out = 0;
1944 if (tcp_is_reno(tp))
1945 tcp_reset_reno_sack(tp);
1947 skb = tcp_write_queue_head(sk);
1948 is_reneg = skb && (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED);
1950 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPSACKRENEGING);
1952 tp->fackets_out = 0;
1954 tcp_clear_all_retrans_hints(tp);
1956 tcp_for_write_queue(skb, sk) {
1957 if (skb == tcp_send_head(sk))
1960 TCP_SKB_CB(skb)->sacked &= (~TCPCB_TAGBITS)|TCPCB_SACKED_ACKED;
1961 if (!(TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_ACKED) || is_reneg) {
1962 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_ACKED;
1963 TCP_SKB_CB(skb)->sacked |= TCPCB_LOST;
1964 tp->lost_out += tcp_skb_pcount(skb);
1965 tp->retransmit_high = TCP_SKB_CB(skb)->end_seq;
1968 tcp_verify_left_out(tp);
1970 /* Timeout in disordered state after receiving substantial DUPACKs
1971 * suggests that the degree of reordering is over-estimated.
1973 if (icsk->icsk_ca_state <= TCP_CA_Disorder &&
1974 tp->sacked_out >= sysctl_tcp_reordering)
1975 tp->reordering = min_t(unsigned int, tp->reordering,
1976 sysctl_tcp_reordering);
1977 tcp_set_ca_state(sk, TCP_CA_Loss);
1978 tp->high_seq = tp->snd_nxt;
1979 tcp_ecn_queue_cwr(tp);
1981 /* F-RTO RFC5682 sec 3.1 step 1: retransmit SND.UNA if no previous
1982 * loss recovery is underway except recurring timeout(s) on
1983 * the same SND.UNA (sec 3.2). Disable F-RTO on path MTU probing
1985 tp->frto = sysctl_tcp_frto &&
1986 (new_recovery || icsk->icsk_retransmits) &&
1987 !inet_csk(sk)->icsk_mtup.probe_size;
1990 /* If ACK arrived pointing to a remembered SACK, it means that our
1991 * remembered SACKs do not reflect real state of receiver i.e.
1992 * receiver _host_ is heavily congested (or buggy).
1994 * To avoid big spurious retransmission bursts due to transient SACK
1995 * scoreboard oddities that look like reneging, we give the receiver a
1996 * little time (max(RTT/2, 10ms)) to send us some more ACKs that will
1997 * restore sanity to the SACK scoreboard. If the apparent reneging
1998 * persists until this RTO then we'll clear the SACK scoreboard.
2000 static bool tcp_check_sack_reneging(struct sock *sk, int flag)
2002 if (flag & FLAG_SACK_RENEGING) {
2003 struct tcp_sock *tp = tcp_sk(sk);
2004 unsigned long delay = max(usecs_to_jiffies(tp->srtt_us >> 4),
2005 msecs_to_jiffies(10));
2007 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
2008 delay, TCP_RTO_MAX);
2014 static inline int tcp_fackets_out(const struct tcp_sock *tp)
2016 return tcp_is_reno(tp) ? tp->sacked_out + 1 : tp->fackets_out;
2019 /* Heurestics to calculate number of duplicate ACKs. There's no dupACKs
2020 * counter when SACK is enabled (without SACK, sacked_out is used for
2023 * Instead, with FACK TCP uses fackets_out that includes both SACKed
2024 * segments up to the highest received SACK block so far and holes in
2027 * With reordering, holes may still be in flight, so RFC3517 recovery
2028 * uses pure sacked_out (total number of SACKed segments) even though
2029 * it violates the RFC that uses duplicate ACKs, often these are equal
2030 * but when e.g. out-of-window ACKs or packet duplication occurs,
2031 * they differ. Since neither occurs due to loss, TCP should really
2034 static inline int tcp_dupack_heuristics(const struct tcp_sock *tp)
2036 return tcp_is_fack(tp) ? tp->fackets_out : tp->sacked_out + 1;
2039 static bool tcp_pause_early_retransmit(struct sock *sk, int flag)
2041 struct tcp_sock *tp = tcp_sk(sk);
2042 unsigned long delay;
2044 /* Delay early retransmit and entering fast recovery for
2045 * max(RTT/4, 2msec) unless ack has ECE mark, no RTT samples
2046 * available, or RTO is scheduled to fire first.
2048 if (sysctl_tcp_early_retrans < 2 || sysctl_tcp_early_retrans > 3 ||
2049 (flag & FLAG_ECE) || !tp->srtt_us)
2052 delay = max(usecs_to_jiffies(tp->srtt_us >> 5),
2053 msecs_to_jiffies(2));
2055 if (!time_after(inet_csk(sk)->icsk_timeout, (jiffies + delay)))
2058 inet_csk_reset_xmit_timer(sk, ICSK_TIME_EARLY_RETRANS, delay,
2063 /* Linux NewReno/SACK/FACK/ECN state machine.
2064 * --------------------------------------
2066 * "Open" Normal state, no dubious events, fast path.
2067 * "Disorder" In all the respects it is "Open",
2068 * but requires a bit more attention. It is entered when
2069 * we see some SACKs or dupacks. It is split of "Open"
2070 * mainly to move some processing from fast path to slow one.
2071 * "CWR" CWND was reduced due to some Congestion Notification event.
2072 * It can be ECN, ICMP source quench, local device congestion.
2073 * "Recovery" CWND was reduced, we are fast-retransmitting.
2074 * "Loss" CWND was reduced due to RTO timeout or SACK reneging.
2076 * tcp_fastretrans_alert() is entered:
2077 * - each incoming ACK, if state is not "Open"
2078 * - when arrived ACK is unusual, namely:
2083 * Counting packets in flight is pretty simple.
2085 * in_flight = packets_out - left_out + retrans_out
2087 * packets_out is SND.NXT-SND.UNA counted in packets.
2089 * retrans_out is number of retransmitted segments.
2091 * left_out is number of segments left network, but not ACKed yet.
2093 * left_out = sacked_out + lost_out
2095 * sacked_out: Packets, which arrived to receiver out of order
2096 * and hence not ACKed. With SACKs this number is simply
2097 * amount of SACKed data. Even without SACKs
2098 * it is easy to give pretty reliable estimate of this number,
2099 * counting duplicate ACKs.
2101 * lost_out: Packets lost by network. TCP has no explicit
2102 * "loss notification" feedback from network (for now).
2103 * It means that this number can be only _guessed_.
2104 * Actually, it is the heuristics to predict lossage that
2105 * distinguishes different algorithms.
2107 * F.e. after RTO, when all the queue is considered as lost,
2108 * lost_out = packets_out and in_flight = retrans_out.
2110 * Essentially, we have now two algorithms counting
2113 * FACK: It is the simplest heuristics. As soon as we decided
2114 * that something is lost, we decide that _all_ not SACKed
2115 * packets until the most forward SACK are lost. I.e.
2116 * lost_out = fackets_out - sacked_out and left_out = fackets_out.
2117 * It is absolutely correct estimate, if network does not reorder
2118 * packets. And it loses any connection to reality when reordering
2119 * takes place. We use FACK by default until reordering
2120 * is suspected on the path to this destination.
2122 * NewReno: when Recovery is entered, we assume that one segment
2123 * is lost (classic Reno). While we are in Recovery and
2124 * a partial ACK arrives, we assume that one more packet
2125 * is lost (NewReno). This heuristics are the same in NewReno
2128 * Imagine, that's all! Forget about all this shamanism about CWND inflation
2129 * deflation etc. CWND is real congestion window, never inflated, changes
2130 * only according to classic VJ rules.
2132 * Really tricky (and requiring careful tuning) part of algorithm
2133 * is hidden in functions tcp_time_to_recover() and tcp_xmit_retransmit_queue().
2134 * The first determines the moment _when_ we should reduce CWND and,
2135 * hence, slow down forward transmission. In fact, it determines the moment
2136 * when we decide that hole is caused by loss, rather than by a reorder.
2138 * tcp_xmit_retransmit_queue() decides, _what_ we should retransmit to fill
2139 * holes, caused by lost packets.
2141 * And the most logically complicated part of algorithm is undo
2142 * heuristics. We detect false retransmits due to both too early
2143 * fast retransmit (reordering) and underestimated RTO, analyzing
2144 * timestamps and D-SACKs. When we detect that some segments were
2145 * retransmitted by mistake and CWND reduction was wrong, we undo
2146 * window reduction and abort recovery phase. This logic is hidden
2147 * inside several functions named tcp_try_undo_<something>.
2150 /* This function decides, when we should leave Disordered state
2151 * and enter Recovery phase, reducing congestion window.
2153 * Main question: may we further continue forward transmission
2154 * with the same cwnd?
2156 static bool tcp_time_to_recover(struct sock *sk, int flag)
2158 struct tcp_sock *tp = tcp_sk(sk);
2161 /* Trick#1: The loss is proven. */
2165 /* Not-A-Trick#2 : Classic rule... */
2166 if (tcp_dupack_heuristics(tp) > tp->reordering)
2169 /* Trick#4: It is still not OK... But will it be useful to delay
2172 packets_out = tp->packets_out;
2173 if (packets_out <= tp->reordering &&
2174 tp->sacked_out >= max_t(__u32, packets_out/2, sysctl_tcp_reordering) &&
2175 !tcp_may_send_now(sk)) {
2176 /* We have nothing to send. This connection is limited
2177 * either by receiver window or by application.
2182 /* If a thin stream is detected, retransmit after first
2183 * received dupack. Employ only if SACK is supported in order
2184 * to avoid possible corner-case series of spurious retransmissions
2185 * Use only if there are no unsent data.
2187 if ((tp->thin_dupack || sysctl_tcp_thin_dupack) &&
2188 tcp_stream_is_thin(tp) && tcp_dupack_heuristics(tp) > 1 &&
2189 tcp_is_sack(tp) && !tcp_send_head(sk))
2192 /* Trick#6: TCP early retransmit, per RFC5827. To avoid spurious
2193 * retransmissions due to small network reorderings, we implement
2194 * Mitigation A.3 in the RFC and delay the retransmission for a short
2195 * interval if appropriate.
2197 if (tp->do_early_retrans && !tp->retrans_out && tp->sacked_out &&
2198 (tp->packets_out >= (tp->sacked_out + 1) && tp->packets_out < 4) &&
2199 !tcp_may_send_now(sk))
2200 return !tcp_pause_early_retransmit(sk, flag);
2205 /* Detect loss in event "A" above by marking head of queue up as lost.
2206 * For FACK or non-SACK(Reno) senders, the first "packets" number of segments
2207 * are considered lost. For RFC3517 SACK, a segment is considered lost if it
2208 * has at least tp->reordering SACKed seqments above it; "packets" refers to
2209 * the maximum SACKed segments to pass before reaching this limit.
2211 static void tcp_mark_head_lost(struct sock *sk, int packets, int mark_head)
2213 struct tcp_sock *tp = tcp_sk(sk);
2214 struct sk_buff *skb;
2218 /* Use SACK to deduce losses of new sequences sent during recovery */
2219 const u32 loss_high = tcp_is_sack(tp) ? tp->snd_nxt : tp->high_seq;
2221 WARN_ON(packets > tp->packets_out);
2222 if (tp->lost_skb_hint) {
2223 skb = tp->lost_skb_hint;
2224 cnt = tp->lost_cnt_hint;
2225 /* Head already handled? */
2226 if (mark_head && skb != tcp_write_queue_head(sk))
2229 skb = tcp_write_queue_head(sk);
2233 tcp_for_write_queue_from(skb, sk) {
2234 if (skb == tcp_send_head(sk))
2236 /* TODO: do this better */
2237 /* this is not the most efficient way to do this... */
2238 tp->lost_skb_hint = skb;
2239 tp->lost_cnt_hint = cnt;
2241 if (after(TCP_SKB_CB(skb)->end_seq, loss_high))
2245 if (tcp_is_fack(tp) || tcp_is_reno(tp) ||
2246 (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED))
2247 cnt += tcp_skb_pcount(skb);
2249 if (cnt > packets) {
2250 if ((tcp_is_sack(tp) && !tcp_is_fack(tp)) ||
2251 (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED) ||
2252 (oldcnt >= packets))
2255 mss = skb_shinfo(skb)->gso_size;
2256 err = tcp_fragment(sk, skb, (packets - oldcnt) * mss,
2263 tcp_skb_mark_lost(tp, skb);
2268 tcp_verify_left_out(tp);
2271 /* Account newly detected lost packet(s) */
2273 static void tcp_update_scoreboard(struct sock *sk, int fast_rexmit)
2275 struct tcp_sock *tp = tcp_sk(sk);
2277 if (tcp_is_reno(tp)) {
2278 tcp_mark_head_lost(sk, 1, 1);
2279 } else if (tcp_is_fack(tp)) {
2280 int lost = tp->fackets_out - tp->reordering;
2283 tcp_mark_head_lost(sk, lost, 0);
2285 int sacked_upto = tp->sacked_out - tp->reordering;
2286 if (sacked_upto >= 0)
2287 tcp_mark_head_lost(sk, sacked_upto, 0);
2288 else if (fast_rexmit)
2289 tcp_mark_head_lost(sk, 1, 1);
2293 /* CWND moderation, preventing bursts due to too big ACKs
2294 * in dubious situations.
2296 static inline void tcp_moderate_cwnd(struct tcp_sock *tp)
2298 tp->snd_cwnd = min(tp->snd_cwnd,
2299 tcp_packets_in_flight(tp) + tcp_max_burst(tp));
2300 tp->snd_cwnd_stamp = tcp_time_stamp;
2303 /* Nothing was retransmitted or returned timestamp is less
2304 * than timestamp of the first retransmission.
2306 static inline bool tcp_packet_delayed(const struct tcp_sock *tp)
2308 return !tp->retrans_stamp ||
2309 (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
2310 before(tp->rx_opt.rcv_tsecr, tp->retrans_stamp));
2313 /* Undo procedures. */
2315 /* We can clear retrans_stamp when there are no retransmissions in the
2316 * window. It would seem that it is trivially available for us in
2317 * tp->retrans_out, however, that kind of assumptions doesn't consider
2318 * what will happen if errors occur when sending retransmission for the
2319 * second time. ...It could the that such segment has only
2320 * TCPCB_EVER_RETRANS set at the present time. It seems that checking
2321 * the head skb is enough except for some reneging corner cases that
2322 * are not worth the effort.
2324 * Main reason for all this complexity is the fact that connection dying
2325 * time now depends on the validity of the retrans_stamp, in particular,
2326 * that successive retransmissions of a segment must not advance
2327 * retrans_stamp under any conditions.
2329 static bool tcp_any_retrans_done(const struct sock *sk)
2331 const struct tcp_sock *tp = tcp_sk(sk);
2332 struct sk_buff *skb;
2334 if (tp->retrans_out)
2337 skb = tcp_write_queue_head(sk);
2338 if (unlikely(skb && TCP_SKB_CB(skb)->sacked & TCPCB_EVER_RETRANS))
2344 #if FASTRETRANS_DEBUG > 1
2345 static void DBGUNDO(struct sock *sk, const char *msg)
2347 struct tcp_sock *tp = tcp_sk(sk);
2348 struct inet_sock *inet = inet_sk(sk);
2350 if (sk->sk_family == AF_INET) {
2351 pr_debug("Undo %s %pI4/%u c%u l%u ss%u/%u p%u\n",
2353 &inet->inet_daddr, ntohs(inet->inet_dport),
2354 tp->snd_cwnd, tcp_left_out(tp),
2355 tp->snd_ssthresh, tp->prior_ssthresh,
2358 #if IS_ENABLED(CONFIG_IPV6)
2359 else if (sk->sk_family == AF_INET6) {
2360 struct ipv6_pinfo *np = inet6_sk(sk);
2361 pr_debug("Undo %s %pI6/%u c%u l%u ss%u/%u p%u\n",
2363 &np->daddr, ntohs(inet->inet_dport),
2364 tp->snd_cwnd, tcp_left_out(tp),
2365 tp->snd_ssthresh, tp->prior_ssthresh,
2371 #define DBGUNDO(x...) do { } while (0)
2374 static void tcp_undo_cwnd_reduction(struct sock *sk, bool unmark_loss)
2376 struct tcp_sock *tp = tcp_sk(sk);
2379 struct sk_buff *skb;
2381 tcp_for_write_queue(skb, sk) {
2382 if (skb == tcp_send_head(sk))
2384 TCP_SKB_CB(skb)->sacked &= ~TCPCB_LOST;
2387 tcp_clear_all_retrans_hints(tp);
2390 if (tp->prior_ssthresh) {
2391 const struct inet_connection_sock *icsk = inet_csk(sk);
2393 if (icsk->icsk_ca_ops->undo_cwnd)
2394 tp->snd_cwnd = icsk->icsk_ca_ops->undo_cwnd(sk);
2396 tp->snd_cwnd = max(tp->snd_cwnd, tp->snd_ssthresh << 1);
2398 if (tp->prior_ssthresh > tp->snd_ssthresh) {
2399 tp->snd_ssthresh = tp->prior_ssthresh;
2400 tcp_ecn_withdraw_cwr(tp);
2403 tp->snd_cwnd = max(tp->snd_cwnd, tp->snd_ssthresh);
2405 tp->snd_cwnd_stamp = tcp_time_stamp;
2406 tp->undo_marker = 0;
2409 static inline bool tcp_may_undo(const struct tcp_sock *tp)
2411 return tp->undo_marker && (!tp->undo_retrans || tcp_packet_delayed(tp));
2414 /* People celebrate: "We love our President!" */
2415 static bool tcp_try_undo_recovery(struct sock *sk)
2417 struct tcp_sock *tp = tcp_sk(sk);
2419 if (tcp_may_undo(tp)) {
2422 /* Happy end! We did not retransmit anything
2423 * or our original transmission succeeded.
2425 DBGUNDO(sk, inet_csk(sk)->icsk_ca_state == TCP_CA_Loss ? "loss" : "retrans");
2426 tcp_undo_cwnd_reduction(sk, false);
2427 if (inet_csk(sk)->icsk_ca_state == TCP_CA_Loss)
2428 mib_idx = LINUX_MIB_TCPLOSSUNDO;
2430 mib_idx = LINUX_MIB_TCPFULLUNDO;
2432 NET_INC_STATS_BH(sock_net(sk), mib_idx);
2434 if (tp->snd_una == tp->high_seq && tcp_is_reno(tp)) {
2435 /* Hold old state until something *above* high_seq
2436 * is ACKed. For Reno it is MUST to prevent false
2437 * fast retransmits (RFC2582). SACK TCP is safe. */
2438 tcp_moderate_cwnd(tp);
2439 if (!tcp_any_retrans_done(sk))
2440 tp->retrans_stamp = 0;
2443 tcp_set_ca_state(sk, TCP_CA_Open);
2447 /* Try to undo cwnd reduction, because D-SACKs acked all retransmitted data */
2448 static bool tcp_try_undo_dsack(struct sock *sk)
2450 struct tcp_sock *tp = tcp_sk(sk);
2452 if (tp->undo_marker && !tp->undo_retrans) {
2453 DBGUNDO(sk, "D-SACK");
2454 tcp_undo_cwnd_reduction(sk, false);
2455 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPDSACKUNDO);
2461 /* Undo during loss recovery after partial ACK or using F-RTO. */
2462 static bool tcp_try_undo_loss(struct sock *sk, bool frto_undo)
2464 struct tcp_sock *tp = tcp_sk(sk);
2466 if (frto_undo || tcp_may_undo(tp)) {
2467 tcp_undo_cwnd_reduction(sk, true);
2469 DBGUNDO(sk, "partial loss");
2470 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPLOSSUNDO);
2472 NET_INC_STATS_BH(sock_net(sk),
2473 LINUX_MIB_TCPSPURIOUSRTOS);
2474 inet_csk(sk)->icsk_retransmits = 0;
2475 if (frto_undo || tcp_is_sack(tp))
2476 tcp_set_ca_state(sk, TCP_CA_Open);
2482 /* The cwnd reduction in CWR and Recovery use the PRR algorithm
2483 * https://datatracker.ietf.org/doc/draft-ietf-tcpm-proportional-rate-reduction/
2484 * It computes the number of packets to send (sndcnt) based on packets newly
2486 * 1) If the packets in flight is larger than ssthresh, PRR spreads the
2487 * cwnd reductions across a full RTT.
2488 * 2) If packets in flight is lower than ssthresh (such as due to excess
2489 * losses and/or application stalls), do not perform any further cwnd
2490 * reductions, but instead slow start up to ssthresh.
2492 static void tcp_init_cwnd_reduction(struct sock *sk)
2494 struct tcp_sock *tp = tcp_sk(sk);
2496 tp->high_seq = tp->snd_nxt;
2497 tp->tlp_high_seq = 0;
2498 tp->snd_cwnd_cnt = 0;
2499 tp->prior_cwnd = tp->snd_cwnd;
2500 tp->prr_delivered = 0;
2502 tp->snd_ssthresh = inet_csk(sk)->icsk_ca_ops->ssthresh(sk);
2503 tcp_ecn_queue_cwr(tp);
2506 static void tcp_cwnd_reduction(struct sock *sk, const int prior_unsacked,
2509 struct tcp_sock *tp = tcp_sk(sk);
2511 int delta = tp->snd_ssthresh - tcp_packets_in_flight(tp);
2512 int newly_acked_sacked = prior_unsacked -
2513 (tp->packets_out - tp->sacked_out);
2515 tp->prr_delivered += newly_acked_sacked;
2516 if (tcp_packets_in_flight(tp) > tp->snd_ssthresh) {
2517 u64 dividend = (u64)tp->snd_ssthresh * tp->prr_delivered +
2519 sndcnt = div_u64(dividend, tp->prior_cwnd) - tp->prr_out;
2521 sndcnt = min_t(int, delta,
2522 max_t(int, tp->prr_delivered - tp->prr_out,
2523 newly_acked_sacked) + 1);
2526 sndcnt = max(sndcnt, (fast_rexmit ? 1 : 0));
2527 tp->snd_cwnd = tcp_packets_in_flight(tp) + sndcnt;
2530 static inline void tcp_end_cwnd_reduction(struct sock *sk)
2532 struct tcp_sock *tp = tcp_sk(sk);
2534 /* Reset cwnd to ssthresh in CWR or Recovery (unless it's undone) */
2535 if (inet_csk(sk)->icsk_ca_state == TCP_CA_CWR ||
2536 (tp->undo_marker && tp->snd_ssthresh < TCP_INFINITE_SSTHRESH)) {
2537 tp->snd_cwnd = tp->snd_ssthresh;
2538 tp->snd_cwnd_stamp = tcp_time_stamp;
2540 tcp_ca_event(sk, CA_EVENT_COMPLETE_CWR);
2543 /* Enter CWR state. Disable cwnd undo since congestion is proven with ECN */
2544 void tcp_enter_cwr(struct sock *sk)
2546 struct tcp_sock *tp = tcp_sk(sk);
2548 tp->prior_ssthresh = 0;
2549 if (inet_csk(sk)->icsk_ca_state < TCP_CA_CWR) {
2550 tp->undo_marker = 0;
2551 tcp_init_cwnd_reduction(sk);
2552 tcp_set_ca_state(sk, TCP_CA_CWR);
2556 static void tcp_try_keep_open(struct sock *sk)
2558 struct tcp_sock *tp = tcp_sk(sk);
2559 int state = TCP_CA_Open;
2561 if (tcp_left_out(tp) || tcp_any_retrans_done(sk))
2562 state = TCP_CA_Disorder;
2564 if (inet_csk(sk)->icsk_ca_state != state) {
2565 tcp_set_ca_state(sk, state);
2566 tp->high_seq = tp->snd_nxt;
2570 static void tcp_try_to_open(struct sock *sk, int flag, const int prior_unsacked)
2572 struct tcp_sock *tp = tcp_sk(sk);
2574 tcp_verify_left_out(tp);
2576 if (!tcp_any_retrans_done(sk))
2577 tp->retrans_stamp = 0;
2579 if (flag & FLAG_ECE)
2582 if (inet_csk(sk)->icsk_ca_state != TCP_CA_CWR) {
2583 tcp_try_keep_open(sk);
2585 tcp_cwnd_reduction(sk, prior_unsacked, 0);
2589 static void tcp_mtup_probe_failed(struct sock *sk)
2591 struct inet_connection_sock *icsk = inet_csk(sk);
2593 icsk->icsk_mtup.search_high = icsk->icsk_mtup.probe_size - 1;
2594 icsk->icsk_mtup.probe_size = 0;
2597 static void tcp_mtup_probe_success(struct sock *sk)
2599 struct tcp_sock *tp = tcp_sk(sk);
2600 struct inet_connection_sock *icsk = inet_csk(sk);
2602 /* FIXME: breaks with very large cwnd */
2603 tp->prior_ssthresh = tcp_current_ssthresh(sk);
2604 tp->snd_cwnd = tp->snd_cwnd *
2605 tcp_mss_to_mtu(sk, tp->mss_cache) /
2606 icsk->icsk_mtup.probe_size;
2607 tp->snd_cwnd_cnt = 0;
2608 tp->snd_cwnd_stamp = tcp_time_stamp;
2609 tp->snd_ssthresh = tcp_current_ssthresh(sk);
2611 icsk->icsk_mtup.search_low = icsk->icsk_mtup.probe_size;
2612 icsk->icsk_mtup.probe_size = 0;
2613 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
2616 /* Do a simple retransmit without using the backoff mechanisms in
2617 * tcp_timer. This is used for path mtu discovery.
2618 * The socket is already locked here.
2620 void tcp_simple_retransmit(struct sock *sk)
2622 const struct inet_connection_sock *icsk = inet_csk(sk);
2623 struct tcp_sock *tp = tcp_sk(sk);
2624 struct sk_buff *skb;
2625 unsigned int mss = tcp_current_mss(sk);
2626 u32 prior_lost = tp->lost_out;
2628 tcp_for_write_queue(skb, sk) {
2629 if (skb == tcp_send_head(sk))
2631 if (tcp_skb_seglen(skb) > mss &&
2632 !(TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)) {
2633 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) {
2634 TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS;
2635 tp->retrans_out -= tcp_skb_pcount(skb);
2637 tcp_skb_mark_lost_uncond_verify(tp, skb);
2641 tcp_clear_retrans_hints_partial(tp);
2643 if (prior_lost == tp->lost_out)
2646 if (tcp_is_reno(tp))
2647 tcp_limit_reno_sacked(tp);
2649 tcp_verify_left_out(tp);
2651 /* Don't muck with the congestion window here.
2652 * Reason is that we do not increase amount of _data_
2653 * in network, but units changed and effective
2654 * cwnd/ssthresh really reduced now.
2656 if (icsk->icsk_ca_state != TCP_CA_Loss) {
2657 tp->high_seq = tp->snd_nxt;
2658 tp->snd_ssthresh = tcp_current_ssthresh(sk);
2659 tp->prior_ssthresh = 0;
2660 tp->undo_marker = 0;
2661 tcp_set_ca_state(sk, TCP_CA_Loss);
2663 tcp_xmit_retransmit_queue(sk);
2665 EXPORT_SYMBOL(tcp_simple_retransmit);
2667 static void tcp_enter_recovery(struct sock *sk, bool ece_ack)
2669 struct tcp_sock *tp = tcp_sk(sk);
2672 if (tcp_is_reno(tp))
2673 mib_idx = LINUX_MIB_TCPRENORECOVERY;
2675 mib_idx = LINUX_MIB_TCPSACKRECOVERY;
2677 NET_INC_STATS_BH(sock_net(sk), mib_idx);
2679 tp->prior_ssthresh = 0;
2682 if (inet_csk(sk)->icsk_ca_state < TCP_CA_CWR) {
2684 tp->prior_ssthresh = tcp_current_ssthresh(sk);
2685 tcp_init_cwnd_reduction(sk);
2687 tcp_set_ca_state(sk, TCP_CA_Recovery);
2690 /* Process an ACK in CA_Loss state. Move to CA_Open if lost data are
2691 * recovered or spurious. Otherwise retransmits more on partial ACKs.
2693 static void tcp_process_loss(struct sock *sk, int flag, bool is_dupack)
2695 struct tcp_sock *tp = tcp_sk(sk);
2696 bool recovered = !before(tp->snd_una, tp->high_seq);
2698 if (tp->frto) { /* F-RTO RFC5682 sec 3.1 (sack enhanced version). */
2699 /* Step 3.b. A timeout is spurious if not all data are
2700 * lost, i.e., never-retransmitted data are (s)acked.
2702 if (tcp_try_undo_loss(sk, flag & FLAG_ORIG_SACK_ACKED))
2705 if (after(tp->snd_nxt, tp->high_seq) &&
2706 (flag & FLAG_DATA_SACKED || is_dupack)) {
2707 tp->frto = 0; /* Loss was real: 2nd part of step 3.a */
2708 } else if (flag & FLAG_SND_UNA_ADVANCED && !recovered) {
2709 tp->high_seq = tp->snd_nxt;
2710 __tcp_push_pending_frames(sk, tcp_current_mss(sk),
2712 if (after(tp->snd_nxt, tp->high_seq))
2713 return; /* Step 2.b */
2719 /* F-RTO RFC5682 sec 3.1 step 2.a and 1st part of step 3.a */
2720 tcp_try_undo_recovery(sk);
2723 if (tcp_is_reno(tp)) {
2724 /* A Reno DUPACK means new data in F-RTO step 2.b above are
2725 * delivered. Lower inflight to clock out (re)tranmissions.
2727 if (after(tp->snd_nxt, tp->high_seq) && is_dupack)
2728 tcp_add_reno_sack(sk);
2729 else if (flag & FLAG_SND_UNA_ADVANCED)
2730 tcp_reset_reno_sack(tp);
2732 if (tcp_try_undo_loss(sk, false))
2734 tcp_xmit_retransmit_queue(sk);
2737 /* Undo during fast recovery after partial ACK. */
2738 static bool tcp_try_undo_partial(struct sock *sk, const int acked,
2739 const int prior_unsacked)
2741 struct tcp_sock *tp = tcp_sk(sk);
2743 if (tp->undo_marker && tcp_packet_delayed(tp)) {
2744 /* Plain luck! Hole if filled with delayed
2745 * packet, rather than with a retransmit.
2747 tcp_update_reordering(sk, tcp_fackets_out(tp) + acked, 1);
2749 /* We are getting evidence that the reordering degree is higher
2750 * than we realized. If there are no retransmits out then we
2751 * can undo. Otherwise we clock out new packets but do not
2752 * mark more packets lost or retransmit more.
2754 if (tp->retrans_out) {
2755 tcp_cwnd_reduction(sk, prior_unsacked, 0);
2759 if (!tcp_any_retrans_done(sk))
2760 tp->retrans_stamp = 0;
2762 DBGUNDO(sk, "partial recovery");
2763 tcp_undo_cwnd_reduction(sk, true);
2764 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPPARTIALUNDO);
2765 tcp_try_keep_open(sk);
2771 /* Process an event, which can update packets-in-flight not trivially.
2772 * Main goal of this function is to calculate new estimate for left_out,
2773 * taking into account both packets sitting in receiver's buffer and
2774 * packets lost by network.
2776 * Besides that it does CWND reduction, when packet loss is detected
2777 * and changes state of machine.
2779 * It does _not_ decide what to send, it is made in function
2780 * tcp_xmit_retransmit_queue().
2782 static void tcp_fastretrans_alert(struct sock *sk, const int acked,
2783 const int prior_unsacked,
2784 bool is_dupack, int flag)
2786 struct inet_connection_sock *icsk = inet_csk(sk);
2787 struct tcp_sock *tp = tcp_sk(sk);
2788 bool do_lost = is_dupack || ((flag & FLAG_DATA_SACKED) &&
2789 (tcp_fackets_out(tp) > tp->reordering));
2790 int fast_rexmit = 0;
2792 if (WARN_ON(!tp->packets_out && tp->sacked_out))
2794 if (WARN_ON(!tp->sacked_out && tp->fackets_out))
2795 tp->fackets_out = 0;
2797 /* Now state machine starts.
2798 * A. ECE, hence prohibit cwnd undoing, the reduction is required. */
2799 if (flag & FLAG_ECE)
2800 tp->prior_ssthresh = 0;
2802 /* B. In all the states check for reneging SACKs. */
2803 if (tcp_check_sack_reneging(sk, flag))
2806 /* C. Check consistency of the current state. */
2807 tcp_verify_left_out(tp);
2809 /* D. Check state exit conditions. State can be terminated
2810 * when high_seq is ACKed. */
2811 if (icsk->icsk_ca_state == TCP_CA_Open) {
2812 WARN_ON(tp->retrans_out != 0);
2813 tp->retrans_stamp = 0;
2814 } else if (!before(tp->snd_una, tp->high_seq)) {
2815 switch (icsk->icsk_ca_state) {
2817 /* CWR is to be held something *above* high_seq
2818 * is ACKed for CWR bit to reach receiver. */
2819 if (tp->snd_una != tp->high_seq) {
2820 tcp_end_cwnd_reduction(sk);
2821 tcp_set_ca_state(sk, TCP_CA_Open);
2825 case TCP_CA_Recovery:
2826 if (tcp_is_reno(tp))
2827 tcp_reset_reno_sack(tp);
2828 if (tcp_try_undo_recovery(sk))
2830 tcp_end_cwnd_reduction(sk);
2835 /* E. Process state. */
2836 switch (icsk->icsk_ca_state) {
2837 case TCP_CA_Recovery:
2838 if (!(flag & FLAG_SND_UNA_ADVANCED)) {
2839 if (tcp_is_reno(tp) && is_dupack)
2840 tcp_add_reno_sack(sk);
2842 if (tcp_try_undo_partial(sk, acked, prior_unsacked))
2844 /* Partial ACK arrived. Force fast retransmit. */
2845 do_lost = tcp_is_reno(tp) ||
2846 tcp_fackets_out(tp) > tp->reordering;
2848 if (tcp_try_undo_dsack(sk)) {
2849 tcp_try_keep_open(sk);
2854 tcp_process_loss(sk, flag, is_dupack);
2855 if (icsk->icsk_ca_state != TCP_CA_Open)
2857 /* Fall through to processing in Open state. */
2859 if (tcp_is_reno(tp)) {
2860 if (flag & FLAG_SND_UNA_ADVANCED)
2861 tcp_reset_reno_sack(tp);
2863 tcp_add_reno_sack(sk);
2866 if (icsk->icsk_ca_state <= TCP_CA_Disorder)
2867 tcp_try_undo_dsack(sk);
2869 if (!tcp_time_to_recover(sk, flag)) {
2870 tcp_try_to_open(sk, flag, prior_unsacked);
2874 /* MTU probe failure: don't reduce cwnd */
2875 if (icsk->icsk_ca_state < TCP_CA_CWR &&
2876 icsk->icsk_mtup.probe_size &&
2877 tp->snd_una == tp->mtu_probe.probe_seq_start) {
2878 tcp_mtup_probe_failed(sk);
2879 /* Restores the reduction we did in tcp_mtup_probe() */
2881 tcp_simple_retransmit(sk);
2885 /* Otherwise enter Recovery state */
2886 tcp_enter_recovery(sk, (flag & FLAG_ECE));
2891 tcp_update_scoreboard(sk, fast_rexmit);
2892 tcp_cwnd_reduction(sk, prior_unsacked, fast_rexmit);
2893 tcp_xmit_retransmit_queue(sk);
2896 static inline bool tcp_ack_update_rtt(struct sock *sk, const int flag,
2897 long seq_rtt_us, long sack_rtt_us)
2899 const struct tcp_sock *tp = tcp_sk(sk);
2901 /* Prefer RTT measured from ACK's timing to TS-ECR. This is because
2902 * broken middle-boxes or peers may corrupt TS-ECR fields. But
2903 * Karn's algorithm forbids taking RTT if some retransmitted data
2904 * is acked (RFC6298).
2906 if (flag & FLAG_RETRANS_DATA_ACKED)
2910 seq_rtt_us = sack_rtt_us;
2912 /* RTTM Rule: A TSecr value received in a segment is used to
2913 * update the averaged RTT measurement only if the segment
2914 * acknowledges some new data, i.e., only if it advances the
2915 * left edge of the send window.
2916 * See draft-ietf-tcplw-high-performance-00, section 3.3.
2918 if (seq_rtt_us < 0 && tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
2920 seq_rtt_us = jiffies_to_usecs(tcp_time_stamp - tp->rx_opt.rcv_tsecr);
2925 tcp_rtt_estimator(sk, seq_rtt_us);
2928 /* RFC6298: only reset backoff on valid RTT measurement. */
2929 inet_csk(sk)->icsk_backoff = 0;
2933 /* Compute time elapsed between (last) SYNACK and the ACK completing 3WHS. */
2934 static void tcp_synack_rtt_meas(struct sock *sk, const u32 synack_stamp)
2936 struct tcp_sock *tp = tcp_sk(sk);
2937 long seq_rtt_us = -1L;
2939 if (synack_stamp && !tp->total_retrans)
2940 seq_rtt_us = jiffies_to_usecs(tcp_time_stamp - synack_stamp);
2942 /* If the ACK acks both the SYNACK and the (Fast Open'd) data packets
2943 * sent in SYN_RECV, SYNACK RTT is the smooth RTT computed in tcp_ack()
2946 tcp_ack_update_rtt(sk, FLAG_SYN_ACKED, seq_rtt_us, -1L);
2949 static void tcp_cong_avoid(struct sock *sk, u32 ack, u32 acked)
2951 const struct inet_connection_sock *icsk = inet_csk(sk);
2953 icsk->icsk_ca_ops->cong_avoid(sk, ack, acked);
2954 tcp_sk(sk)->snd_cwnd_stamp = tcp_time_stamp;
2957 /* Restart timer after forward progress on connection.
2958 * RFC2988 recommends to restart timer to now+rto.
2960 void tcp_rearm_rto(struct sock *sk)
2962 const struct inet_connection_sock *icsk = inet_csk(sk);
2963 struct tcp_sock *tp = tcp_sk(sk);
2965 /* If the retrans timer is currently being used by Fast Open
2966 * for SYN-ACK retrans purpose, stay put.
2968 if (tp->fastopen_rsk)
2971 if (!tp->packets_out) {
2972 inet_csk_clear_xmit_timer(sk, ICSK_TIME_RETRANS);
2974 u32 rto = inet_csk(sk)->icsk_rto;
2975 /* Offset the time elapsed after installing regular RTO */
2976 if (icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS ||
2977 icsk->icsk_pending == ICSK_TIME_LOSS_PROBE) {
2978 struct sk_buff *skb = tcp_write_queue_head(sk);
2979 const u32 rto_time_stamp =
2980 tcp_skb_timestamp(skb) + rto;
2981 s32 delta = (s32)(rto_time_stamp - tcp_time_stamp);
2982 /* delta may not be positive if the socket is locked
2983 * when the retrans timer fires and is rescheduled.
2988 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, rto,
2993 /* This function is called when the delayed ER timer fires. TCP enters
2994 * fast recovery and performs fast-retransmit.
2996 void tcp_resume_early_retransmit(struct sock *sk)
2998 struct tcp_sock *tp = tcp_sk(sk);
3002 /* Stop if ER is disabled after the delayed ER timer is scheduled */
3003 if (!tp->do_early_retrans)
3006 tcp_enter_recovery(sk, false);
3007 tcp_update_scoreboard(sk, 1);
3008 tcp_xmit_retransmit_queue(sk);
3011 /* If we get here, the whole TSO packet has not been acked. */
3012 static u32 tcp_tso_acked(struct sock *sk, struct sk_buff *skb)
3014 struct tcp_sock *tp = tcp_sk(sk);
3017 BUG_ON(!after(TCP_SKB_CB(skb)->end_seq, tp->snd_una));
3019 packets_acked = tcp_skb_pcount(skb);
3020 if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq))
3022 packets_acked -= tcp_skb_pcount(skb);
3024 if (packets_acked) {
3025 BUG_ON(tcp_skb_pcount(skb) == 0);
3026 BUG_ON(!before(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq));
3029 return packets_acked;
3032 static void tcp_ack_tstamp(struct sock *sk, struct sk_buff *skb,
3035 const struct skb_shared_info *shinfo;
3037 /* Avoid cache line misses to get skb_shinfo() and shinfo->tx_flags */
3038 if (likely(!(sk->sk_tsflags & SOF_TIMESTAMPING_TX_ACK)))
3041 shinfo = skb_shinfo(skb);
3042 if ((shinfo->tx_flags & SKBTX_ACK_TSTAMP) &&
3043 between(shinfo->tskey, prior_snd_una, tcp_sk(sk)->snd_una - 1))
3044 __skb_tstamp_tx(skb, NULL, sk, SCM_TSTAMP_ACK);
3047 /* Remove acknowledged frames from the retransmission queue. If our packet
3048 * is before the ack sequence we can discard it as it's confirmed to have
3049 * arrived at the other end.
3051 static int tcp_clean_rtx_queue(struct sock *sk, int prior_fackets,
3053 struct tcp_sacktag_state *sack)
3055 const struct inet_connection_sock *icsk = inet_csk(sk);
3056 struct skb_mstamp first_ackt, last_ackt, now;
3057 struct tcp_sock *tp = tcp_sk(sk);
3058 u32 prior_sacked = tp->sacked_out;
3059 u32 reord = tp->packets_out;
3060 bool fully_acked = true;
3061 long sack_rtt_us = -1L;
3062 long seq_rtt_us = -1L;
3063 long ca_rtt_us = -1L;
3064 struct sk_buff *skb;
3071 while ((skb = tcp_write_queue_head(sk)) && skb != tcp_send_head(sk)) {
3072 struct tcp_skb_cb *scb = TCP_SKB_CB(skb);
3073 u8 sacked = scb->sacked;
3076 tcp_ack_tstamp(sk, skb, prior_snd_una);
3078 /* Determine how many packets and what bytes were acked, tso and else */
3079 if (after(scb->end_seq, tp->snd_una)) {
3080 if (tcp_skb_pcount(skb) == 1 ||
3081 !after(tp->snd_una, scb->seq))
3084 acked_pcount = tcp_tso_acked(sk, skb);
3088 fully_acked = false;
3090 /* Speedup tcp_unlink_write_queue() and next loop */
3091 prefetchw(skb->next);
3092 acked_pcount = tcp_skb_pcount(skb);
3095 if (unlikely(sacked & TCPCB_RETRANS)) {
3096 if (sacked & TCPCB_SACKED_RETRANS)
3097 tp->retrans_out -= acked_pcount;
3098 flag |= FLAG_RETRANS_DATA_ACKED;
3099 } else if (!(sacked & TCPCB_SACKED_ACKED)) {
3100 last_ackt = skb->skb_mstamp;
3101 WARN_ON_ONCE(last_ackt.v64 == 0);
3102 if (!first_ackt.v64)
3103 first_ackt = last_ackt;
3105 reord = min(pkts_acked, reord);
3106 if (!after(scb->end_seq, tp->high_seq))
3107 flag |= FLAG_ORIG_SACK_ACKED;
3110 if (sacked & TCPCB_SACKED_ACKED)
3111 tp->sacked_out -= acked_pcount;
3112 if (sacked & TCPCB_LOST)
3113 tp->lost_out -= acked_pcount;
3115 tp->packets_out -= acked_pcount;
3116 pkts_acked += acked_pcount;
3118 /* Initial outgoing SYN's get put onto the write_queue
3119 * just like anything else we transmit. It is not
3120 * true data, and if we misinform our callers that
3121 * this ACK acks real data, we will erroneously exit
3122 * connection startup slow start one packet too
3123 * quickly. This is severely frowned upon behavior.
3125 if (likely(!(scb->tcp_flags & TCPHDR_SYN))) {
3126 flag |= FLAG_DATA_ACKED;
3128 flag |= FLAG_SYN_ACKED;
3129 tp->retrans_stamp = 0;
3135 tcp_unlink_write_queue(skb, sk);
3136 sk_wmem_free_skb(sk, skb);
3137 if (unlikely(skb == tp->retransmit_skb_hint))
3138 tp->retransmit_skb_hint = NULL;
3139 if (unlikely(skb == tp->lost_skb_hint))
3140 tp->lost_skb_hint = NULL;
3143 if (likely(between(tp->snd_up, prior_snd_una, tp->snd_una)))
3144 tp->snd_up = tp->snd_una;
3146 if (skb && (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED))
3147 flag |= FLAG_SACK_RENEGING;
3149 skb_mstamp_get(&now);
3150 if (likely(first_ackt.v64)) {
3151 seq_rtt_us = skb_mstamp_us_delta(&now, &first_ackt);
3152 ca_rtt_us = skb_mstamp_us_delta(&now, &last_ackt);
3154 if (sack->first_sackt.v64) {
3155 sack_rtt_us = skb_mstamp_us_delta(&now, &sack->first_sackt);
3156 ca_rtt_us = skb_mstamp_us_delta(&now, &sack->last_sackt);
3159 rtt_update = tcp_ack_update_rtt(sk, flag, seq_rtt_us, sack_rtt_us);
3161 if (flag & FLAG_ACKED) {
3163 if (unlikely(icsk->icsk_mtup.probe_size &&
3164 !after(tp->mtu_probe.probe_seq_end, tp->snd_una))) {
3165 tcp_mtup_probe_success(sk);
3168 if (tcp_is_reno(tp)) {
3169 tcp_remove_reno_sacks(sk, pkts_acked);
3173 /* Non-retransmitted hole got filled? That's reordering */
3174 if (reord < prior_fackets)
3175 tcp_update_reordering(sk, tp->fackets_out - reord, 0);
3177 delta = tcp_is_fack(tp) ? pkts_acked :
3178 prior_sacked - tp->sacked_out;
3179 tp->lost_cnt_hint -= min(tp->lost_cnt_hint, delta);
3182 tp->fackets_out -= min(pkts_acked, tp->fackets_out);
3184 } else if (skb && rtt_update && sack_rtt_us >= 0 &&
3185 sack_rtt_us > skb_mstamp_us_delta(&now, &skb->skb_mstamp)) {
3186 /* Do not re-arm RTO if the sack RTT is measured from data sent
3187 * after when the head was last (re)transmitted. Otherwise the
3188 * timeout may continue to extend in loss recovery.
3193 if (icsk->icsk_ca_ops->pkts_acked)
3194 icsk->icsk_ca_ops->pkts_acked(sk, pkts_acked, ca_rtt_us);
3196 #if FASTRETRANS_DEBUG > 0
3197 WARN_ON((int)tp->sacked_out < 0);
3198 WARN_ON((int)tp->lost_out < 0);
3199 WARN_ON((int)tp->retrans_out < 0);
3200 if (!tp->packets_out && tcp_is_sack(tp)) {
3201 icsk = inet_csk(sk);
3203 pr_debug("Leak l=%u %d\n",
3204 tp->lost_out, icsk->icsk_ca_state);
3207 if (tp->sacked_out) {
3208 pr_debug("Leak s=%u %d\n",
3209 tp->sacked_out, icsk->icsk_ca_state);
3212 if (tp->retrans_out) {
3213 pr_debug("Leak r=%u %d\n",
3214 tp->retrans_out, icsk->icsk_ca_state);
3215 tp->retrans_out = 0;
3222 static void tcp_ack_probe(struct sock *sk)
3224 const struct tcp_sock *tp = tcp_sk(sk);
3225 struct inet_connection_sock *icsk = inet_csk(sk);
3227 /* Was it a usable window open? */
3229 if (!after(TCP_SKB_CB(tcp_send_head(sk))->end_seq, tcp_wnd_end(tp))) {
3230 icsk->icsk_backoff = 0;
3231 inet_csk_clear_xmit_timer(sk, ICSK_TIME_PROBE0);
3232 /* Socket must be waked up by subsequent tcp_data_snd_check().
3233 * This function is not for random using!
3236 unsigned long when = tcp_probe0_when(sk, TCP_RTO_MAX);
3238 inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
3243 static inline bool tcp_ack_is_dubious(const struct sock *sk, const int flag)
3245 return !(flag & FLAG_NOT_DUP) || (flag & FLAG_CA_ALERT) ||
3246 inet_csk(sk)->icsk_ca_state != TCP_CA_Open;
3249 /* Decide wheather to run the increase function of congestion control. */
3250 static inline bool tcp_may_raise_cwnd(const struct sock *sk, const int flag)
3252 if (tcp_in_cwnd_reduction(sk))
3255 /* If reordering is high then always grow cwnd whenever data is
3256 * delivered regardless of its ordering. Otherwise stay conservative
3257 * and only grow cwnd on in-order delivery (RFC5681). A stretched ACK w/
3258 * new SACK or ECE mark may first advance cwnd here and later reduce
3259 * cwnd in tcp_fastretrans_alert() based on more states.
3261 if (tcp_sk(sk)->reordering > sysctl_tcp_reordering)
3262 return flag & FLAG_FORWARD_PROGRESS;
3264 return flag & FLAG_DATA_ACKED;
3267 /* Check that window update is acceptable.
3268 * The function assumes that snd_una<=ack<=snd_next.
3270 static inline bool tcp_may_update_window(const struct tcp_sock *tp,
3271 const u32 ack, const u32 ack_seq,
3274 return after(ack, tp->snd_una) ||
3275 after(ack_seq, tp->snd_wl1) ||
3276 (ack_seq == tp->snd_wl1 && nwin > tp->snd_wnd);
3279 /* If we update tp->snd_una, also update tp->bytes_acked */
3280 static void tcp_snd_una_update(struct tcp_sock *tp, u32 ack)
3282 u32 delta = ack - tp->snd_una;
3284 tp->bytes_acked += delta;
3288 /* If we update tp->rcv_nxt, also update tp->bytes_received */
3289 static void tcp_rcv_nxt_update(struct tcp_sock *tp, u32 seq)
3291 u32 delta = seq - tp->rcv_nxt;
3293 tp->bytes_received += delta;
3297 /* Update our send window.
3299 * Window update algorithm, described in RFC793/RFC1122 (used in linux-2.2
3300 * and in FreeBSD. NetBSD's one is even worse.) is wrong.
3302 static int tcp_ack_update_window(struct sock *sk, const struct sk_buff *skb, u32 ack,
3305 struct tcp_sock *tp = tcp_sk(sk);
3307 u32 nwin = ntohs(tcp_hdr(skb)->window);
3309 if (likely(!tcp_hdr(skb)->syn))
3310 nwin <<= tp->rx_opt.snd_wscale;
3312 if (tcp_may_update_window(tp, ack, ack_seq, nwin)) {
3313 flag |= FLAG_WIN_UPDATE;
3314 tcp_update_wl(tp, ack_seq);
3316 if (tp->snd_wnd != nwin) {
3319 /* Note, it is the only place, where
3320 * fast path is recovered for sending TCP.
3323 tcp_fast_path_check(sk);
3325 if (nwin > tp->max_window) {
3326 tp->max_window = nwin;
3327 tcp_sync_mss(sk, inet_csk(sk)->icsk_pmtu_cookie);
3332 tcp_snd_una_update(tp, ack);
3337 /* Return true if we're currently rate-limiting out-of-window ACKs and
3338 * thus shouldn't send a dupack right now. We rate-limit dupacks in
3339 * response to out-of-window SYNs or ACKs to mitigate ACK loops or DoS
3340 * attacks that send repeated SYNs or ACKs for the same connection. To
3341 * do this, we do not send a duplicate SYNACK or ACK if the remote
3342 * endpoint is sending out-of-window SYNs or pure ACKs at a high rate.
3344 bool tcp_oow_rate_limited(struct net *net, const struct sk_buff *skb,
3345 int mib_idx, u32 *last_oow_ack_time)
3347 /* Data packets without SYNs are not likely part of an ACK loop. */
3348 if ((TCP_SKB_CB(skb)->seq != TCP_SKB_CB(skb)->end_seq) &&
3350 goto not_rate_limited;
3352 if (*last_oow_ack_time) {
3353 s32 elapsed = (s32)(tcp_time_stamp - *last_oow_ack_time);
3355 if (0 <= elapsed && elapsed < sysctl_tcp_invalid_ratelimit) {
3356 NET_INC_STATS_BH(net, mib_idx);
3357 return true; /* rate-limited: don't send yet! */
3361 *last_oow_ack_time = tcp_time_stamp;
3364 return false; /* not rate-limited: go ahead, send dupack now! */
3367 /* RFC 5961 7 [ACK Throttling] */
3368 static void tcp_send_challenge_ack(struct sock *sk, const struct sk_buff *skb)
3370 /* unprotected vars, we dont care of overwrites */
3371 static u32 challenge_timestamp;
3372 static unsigned int challenge_count;
3373 struct tcp_sock *tp = tcp_sk(sk);
3376 /* First check our per-socket dupack rate limit. */
3377 if (tcp_oow_rate_limited(sock_net(sk), skb,
3378 LINUX_MIB_TCPACKSKIPPEDCHALLENGE,
3379 &tp->last_oow_ack_time))
3382 /* Then check the check host-wide RFC 5961 rate limit. */
3384 if (now != challenge_timestamp) {
3385 challenge_timestamp = now;
3386 challenge_count = 0;
3388 if (++challenge_count <= sysctl_tcp_challenge_ack_limit) {
3389 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPCHALLENGEACK);
3394 static void tcp_store_ts_recent(struct tcp_sock *tp)
3396 tp->rx_opt.ts_recent = tp->rx_opt.rcv_tsval;
3397 tp->rx_opt.ts_recent_stamp = get_seconds();
3400 static void tcp_replace_ts_recent(struct tcp_sock *tp, u32 seq)
3402 if (tp->rx_opt.saw_tstamp && !after(seq, tp->rcv_wup)) {
3403 /* PAWS bug workaround wrt. ACK frames, the PAWS discard
3404 * extra check below makes sure this can only happen
3405 * for pure ACK frames. -DaveM
3407 * Not only, also it occurs for expired timestamps.
3410 if (tcp_paws_check(&tp->rx_opt, 0))
3411 tcp_store_ts_recent(tp);
3415 /* This routine deals with acks during a TLP episode.
3416 * We mark the end of a TLP episode on receiving TLP dupack or when
3417 * ack is after tlp_high_seq.
3418 * Ref: loss detection algorithm in draft-dukkipati-tcpm-tcp-loss-probe.
3420 static void tcp_process_tlp_ack(struct sock *sk, u32 ack, int flag)
3422 struct tcp_sock *tp = tcp_sk(sk);
3424 if (before(ack, tp->tlp_high_seq))
3427 if (flag & FLAG_DSACKING_ACK) {
3428 /* This DSACK means original and TLP probe arrived; no loss */
3429 tp->tlp_high_seq = 0;
3430 } else if (after(ack, tp->tlp_high_seq)) {
3431 /* ACK advances: there was a loss, so reduce cwnd. Reset
3432 * tlp_high_seq in tcp_init_cwnd_reduction()
3434 tcp_init_cwnd_reduction(sk);
3435 tcp_set_ca_state(sk, TCP_CA_CWR);
3436 tcp_end_cwnd_reduction(sk);
3437 tcp_try_keep_open(sk);
3438 NET_INC_STATS_BH(sock_net(sk),
3439 LINUX_MIB_TCPLOSSPROBERECOVERY);
3440 } else if (!(flag & (FLAG_SND_UNA_ADVANCED |
3441 FLAG_NOT_DUP | FLAG_DATA_SACKED))) {
3442 /* Pure dupack: original and TLP probe arrived; no loss */
3443 tp->tlp_high_seq = 0;
3447 static inline void tcp_in_ack_event(struct sock *sk, u32 flags)
3449 const struct inet_connection_sock *icsk = inet_csk(sk);
3451 if (icsk->icsk_ca_ops->in_ack_event)
3452 icsk->icsk_ca_ops->in_ack_event(sk, flags);
3455 /* This routine deals with incoming acks, but not outgoing ones. */
3456 static int tcp_ack(struct sock *sk, const struct sk_buff *skb, int flag)
3458 struct inet_connection_sock *icsk = inet_csk(sk);
3459 struct tcp_sock *tp = tcp_sk(sk);
3460 struct tcp_sacktag_state sack_state;
3461 u32 prior_snd_una = tp->snd_una;
3462 u32 ack_seq = TCP_SKB_CB(skb)->seq;
3463 u32 ack = TCP_SKB_CB(skb)->ack_seq;
3464 bool is_dupack = false;
3466 int prior_packets = tp->packets_out;
3467 const int prior_unsacked = tp->packets_out - tp->sacked_out;
3468 int acked = 0; /* Number of packets newly acked */
3470 sack_state.first_sackt.v64 = 0;
3472 /* We very likely will need to access write queue head. */
3473 prefetchw(sk->sk_write_queue.next);
3475 /* If the ack is older than previous acks
3476 * then we can probably ignore it.
3478 if (before(ack, prior_snd_una)) {
3479 /* RFC 5961 5.2 [Blind Data Injection Attack].[Mitigation] */
3480 if (before(ack, prior_snd_una - tp->max_window)) {
3481 tcp_send_challenge_ack(sk, skb);
3487 /* If the ack includes data we haven't sent yet, discard
3488 * this segment (RFC793 Section 3.9).
3490 if (after(ack, tp->snd_nxt))
3493 if (icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS ||
3494 icsk->icsk_pending == ICSK_TIME_LOSS_PROBE)
3497 if (after(ack, prior_snd_una)) {
3498 flag |= FLAG_SND_UNA_ADVANCED;
3499 icsk->icsk_retransmits = 0;
3502 prior_fackets = tp->fackets_out;
3504 /* ts_recent update must be made after we are sure that the packet
3507 if (flag & FLAG_UPDATE_TS_RECENT)
3508 tcp_replace_ts_recent(tp, TCP_SKB_CB(skb)->seq);
3510 if (!(flag & FLAG_SLOWPATH) && after(ack, prior_snd_una)) {
3511 /* Window is constant, pure forward advance.
3512 * No more checks are required.
3513 * Note, we use the fact that SND.UNA>=SND.WL2.
3515 tcp_update_wl(tp, ack_seq);
3516 tcp_snd_una_update(tp, ack);
3517 flag |= FLAG_WIN_UPDATE;
3519 tcp_in_ack_event(sk, CA_ACK_WIN_UPDATE);
3521 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPHPACKS);
3523 u32 ack_ev_flags = CA_ACK_SLOWPATH;
3525 if (ack_seq != TCP_SKB_CB(skb)->end_seq)
3528 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPPUREACKS);
3530 flag |= tcp_ack_update_window(sk, skb, ack, ack_seq);
3532 if (TCP_SKB_CB(skb)->sacked)
3533 flag |= tcp_sacktag_write_queue(sk, skb, prior_snd_una,
3536 if (tcp_ecn_rcv_ecn_echo(tp, tcp_hdr(skb))) {
3538 ack_ev_flags |= CA_ACK_ECE;
3541 if (flag & FLAG_WIN_UPDATE)
3542 ack_ev_flags |= CA_ACK_WIN_UPDATE;
3544 tcp_in_ack_event(sk, ack_ev_flags);
3547 /* We passed data and got it acked, remove any soft error
3548 * log. Something worked...
3550 sk->sk_err_soft = 0;
3551 icsk->icsk_probes_out = 0;
3552 tp->rcv_tstamp = tcp_time_stamp;
3556 /* See if we can take anything off of the retransmit queue. */
3557 acked = tp->packets_out;
3558 flag |= tcp_clean_rtx_queue(sk, prior_fackets, prior_snd_una,
3560 acked -= tp->packets_out;
3562 /* Advance cwnd if state allows */
3563 if (tcp_may_raise_cwnd(sk, flag))
3564 tcp_cong_avoid(sk, ack, acked);
3566 if (tcp_ack_is_dubious(sk, flag)) {
3567 is_dupack = !(flag & (FLAG_SND_UNA_ADVANCED | FLAG_NOT_DUP));
3568 tcp_fastretrans_alert(sk, acked, prior_unsacked,
3571 if (tp->tlp_high_seq)
3572 tcp_process_tlp_ack(sk, ack, flag);
3574 if ((flag & FLAG_FORWARD_PROGRESS) || !(flag & FLAG_NOT_DUP)) {
3575 struct dst_entry *dst = __sk_dst_get(sk);
3580 if (icsk->icsk_pending == ICSK_TIME_RETRANS)
3581 tcp_schedule_loss_probe(sk);
3582 tcp_update_pacing_rate(sk);
3586 /* If data was DSACKed, see if we can undo a cwnd reduction. */
3587 if (flag & FLAG_DSACKING_ACK)
3588 tcp_fastretrans_alert(sk, acked, prior_unsacked,
3590 /* If this ack opens up a zero window, clear backoff. It was
3591 * being used to time the probes, and is probably far higher than
3592 * it needs to be for normal retransmission.
3594 if (tcp_send_head(sk))
3597 if (tp->tlp_high_seq)
3598 tcp_process_tlp_ack(sk, ack, flag);
3602 SOCK_DEBUG(sk, "Ack %u after %u:%u\n", ack, tp->snd_una, tp->snd_nxt);
3606 /* If data was SACKed, tag it and see if we should send more data.
3607 * If data was DSACKed, see if we can undo a cwnd reduction.
3609 if (TCP_SKB_CB(skb)->sacked) {
3610 flag |= tcp_sacktag_write_queue(sk, skb, prior_snd_una,
3612 tcp_fastretrans_alert(sk, acked, prior_unsacked,
3616 SOCK_DEBUG(sk, "Ack %u before %u:%u\n", ack, tp->snd_una, tp->snd_nxt);
3620 static void tcp_parse_fastopen_option(int len, const unsigned char *cookie,
3621 bool syn, struct tcp_fastopen_cookie *foc,
3624 /* Valid only in SYN or SYN-ACK with an even length. */
3625 if (!foc || !syn || len < 0 || (len & 1))
3628 if (len >= TCP_FASTOPEN_COOKIE_MIN &&
3629 len <= TCP_FASTOPEN_COOKIE_MAX)
3630 memcpy(foc->val, cookie, len);
3637 /* Look for tcp options. Normally only called on SYN and SYNACK packets.
3638 * But, this can also be called on packets in the established flow when
3639 * the fast version below fails.
3641 void tcp_parse_options(const struct sk_buff *skb,
3642 struct tcp_options_received *opt_rx, int estab,
3643 struct tcp_fastopen_cookie *foc)
3645 const unsigned char *ptr;
3646 const struct tcphdr *th = tcp_hdr(skb);
3647 int length = (th->doff * 4) - sizeof(struct tcphdr);
3649 ptr = (const unsigned char *)(th + 1);
3650 opt_rx->saw_tstamp = 0;
3652 while (length > 0) {
3653 int opcode = *ptr++;
3659 case TCPOPT_NOP: /* Ref: RFC 793 section 3.1 */
3664 if (opsize < 2) /* "silly options" */
3666 if (opsize > length)
3667 return; /* don't parse partial options */
3670 if (opsize == TCPOLEN_MSS && th->syn && !estab) {
3671 u16 in_mss = get_unaligned_be16(ptr);
3673 if (opt_rx->user_mss &&
3674 opt_rx->user_mss < in_mss)
3675 in_mss = opt_rx->user_mss;
3676 opt_rx->mss_clamp = in_mss;
3681 if (opsize == TCPOLEN_WINDOW && th->syn &&
3682 !estab && sysctl_tcp_window_scaling) {
3683 __u8 snd_wscale = *(__u8 *)ptr;
3684 opt_rx->wscale_ok = 1;
3685 if (snd_wscale > 14) {
3686 net_info_ratelimited("%s: Illegal window scaling value %d >14 received\n",
3691 opt_rx->snd_wscale = snd_wscale;
3694 case TCPOPT_TIMESTAMP:
3695 if ((opsize == TCPOLEN_TIMESTAMP) &&
3696 ((estab && opt_rx->tstamp_ok) ||
3697 (!estab && sysctl_tcp_timestamps))) {
3698 opt_rx->saw_tstamp = 1;
3699 opt_rx->rcv_tsval = get_unaligned_be32(ptr);
3700 opt_rx->rcv_tsecr = get_unaligned_be32(ptr + 4);
3703 case TCPOPT_SACK_PERM:
3704 if (opsize == TCPOLEN_SACK_PERM && th->syn &&
3705 !estab && sysctl_tcp_sack) {
3706 opt_rx->sack_ok = TCP_SACK_SEEN;
3707 tcp_sack_reset(opt_rx);
3712 if ((opsize >= (TCPOLEN_SACK_BASE + TCPOLEN_SACK_PERBLOCK)) &&
3713 !((opsize - TCPOLEN_SACK_BASE) % TCPOLEN_SACK_PERBLOCK) &&
3715 TCP_SKB_CB(skb)->sacked = (ptr - 2) - (unsigned char *)th;
3718 #ifdef CONFIG_TCP_MD5SIG
3721 * The MD5 Hash has already been
3722 * checked (see tcp_v{4,6}_do_rcv()).
3726 case TCPOPT_FASTOPEN:
3727 tcp_parse_fastopen_option(
3728 opsize - TCPOLEN_FASTOPEN_BASE,
3729 ptr, th->syn, foc, false);
3733 /* Fast Open option shares code 254 using a
3734 * 16 bits magic number.
3736 if (opsize >= TCPOLEN_EXP_FASTOPEN_BASE &&
3737 get_unaligned_be16(ptr) ==
3738 TCPOPT_FASTOPEN_MAGIC)
3739 tcp_parse_fastopen_option(opsize -
3740 TCPOLEN_EXP_FASTOPEN_BASE,
3741 ptr + 2, th->syn, foc, true);
3750 EXPORT_SYMBOL(tcp_parse_options);
3752 static bool tcp_parse_aligned_timestamp(struct tcp_sock *tp, const struct tcphdr *th)
3754 const __be32 *ptr = (const __be32 *)(th + 1);
3756 if (*ptr == htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16)
3757 | (TCPOPT_TIMESTAMP << 8) | TCPOLEN_TIMESTAMP)) {
3758 tp->rx_opt.saw_tstamp = 1;
3760 tp->rx_opt.rcv_tsval = ntohl(*ptr);
3763 tp->rx_opt.rcv_tsecr = ntohl(*ptr) - tp->tsoffset;
3765 tp->rx_opt.rcv_tsecr = 0;
3771 /* Fast parse options. This hopes to only see timestamps.
3772 * If it is wrong it falls back on tcp_parse_options().
3774 static bool tcp_fast_parse_options(const struct sk_buff *skb,
3775 const struct tcphdr *th, struct tcp_sock *tp)
3777 /* In the spirit of fast parsing, compare doff directly to constant
3778 * values. Because equality is used, short doff can be ignored here.
3780 if (th->doff == (sizeof(*th) / 4)) {
3781 tp->rx_opt.saw_tstamp = 0;
3783 } else if (tp->rx_opt.tstamp_ok &&
3784 th->doff == ((sizeof(*th) + TCPOLEN_TSTAMP_ALIGNED) / 4)) {
3785 if (tcp_parse_aligned_timestamp(tp, th))
3789 tcp_parse_options(skb, &tp->rx_opt, 1, NULL);
3790 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr)
3791 tp->rx_opt.rcv_tsecr -= tp->tsoffset;
3796 #ifdef CONFIG_TCP_MD5SIG
3798 * Parse MD5 Signature option
3800 const u8 *tcp_parse_md5sig_option(const struct tcphdr *th)
3802 int length = (th->doff << 2) - sizeof(*th);
3803 const u8 *ptr = (const u8 *)(th + 1);
3805 /* If the TCP option is too short, we can short cut */
3806 if (length < TCPOLEN_MD5SIG)
3809 while (length > 0) {
3810 int opcode = *ptr++;
3821 if (opsize < 2 || opsize > length)
3823 if (opcode == TCPOPT_MD5SIG)
3824 return opsize == TCPOLEN_MD5SIG ? ptr : NULL;
3831 EXPORT_SYMBOL(tcp_parse_md5sig_option);
3834 /* Sorry, PAWS as specified is broken wrt. pure-ACKs -DaveM
3836 * It is not fatal. If this ACK does _not_ change critical state (seqs, window)
3837 * it can pass through stack. So, the following predicate verifies that
3838 * this segment is not used for anything but congestion avoidance or
3839 * fast retransmit. Moreover, we even are able to eliminate most of such
3840 * second order effects, if we apply some small "replay" window (~RTO)
3841 * to timestamp space.
3843 * All these measures still do not guarantee that we reject wrapped ACKs
3844 * on networks with high bandwidth, when sequence space is recycled fastly,
3845 * but it guarantees that such events will be very rare and do not affect
3846 * connection seriously. This doesn't look nice, but alas, PAWS is really
3849 * [ Later note. Even worse! It is buggy for segments _with_ data. RFC
3850 * states that events when retransmit arrives after original data are rare.
3851 * It is a blatant lie. VJ forgot about fast retransmit! 8)8) It is
3852 * the biggest problem on large power networks even with minor reordering.
3853 * OK, let's give it small replay window. If peer clock is even 1hz, it is safe
3854 * up to bandwidth of 18Gigabit/sec. 8) ]
3857 static int tcp_disordered_ack(const struct sock *sk, const struct sk_buff *skb)
3859 const struct tcp_sock *tp = tcp_sk(sk);
3860 const struct tcphdr *th = tcp_hdr(skb);
3861 u32 seq = TCP_SKB_CB(skb)->seq;
3862 u32 ack = TCP_SKB_CB(skb)->ack_seq;
3864 return (/* 1. Pure ACK with correct sequence number. */
3865 (th->ack && seq == TCP_SKB_CB(skb)->end_seq && seq == tp->rcv_nxt) &&
3867 /* 2. ... and duplicate ACK. */
3868 ack == tp->snd_una &&
3870 /* 3. ... and does not update window. */
3871 !tcp_may_update_window(tp, ack, seq, ntohs(th->window) << tp->rx_opt.snd_wscale) &&
3873 /* 4. ... and sits in replay window. */
3874 (s32)(tp->rx_opt.ts_recent - tp->rx_opt.rcv_tsval) <= (inet_csk(sk)->icsk_rto * 1024) / HZ);
3877 static inline bool tcp_paws_discard(const struct sock *sk,
3878 const struct sk_buff *skb)
3880 const struct tcp_sock *tp = tcp_sk(sk);
3882 return !tcp_paws_check(&tp->rx_opt, TCP_PAWS_WINDOW) &&
3883 !tcp_disordered_ack(sk, skb);
3886 /* Check segment sequence number for validity.
3888 * Segment controls are considered valid, if the segment
3889 * fits to the window after truncation to the window. Acceptability
3890 * of data (and SYN, FIN, of course) is checked separately.
3891 * See tcp_data_queue(), for example.
3893 * Also, controls (RST is main one) are accepted using RCV.WUP instead
3894 * of RCV.NXT. Peer still did not advance his SND.UNA when we
3895 * delayed ACK, so that hisSND.UNA<=ourRCV.WUP.
3896 * (borrowed from freebsd)
3899 static inline bool tcp_sequence(const struct tcp_sock *tp, u32 seq, u32 end_seq)
3901 return !before(end_seq, tp->rcv_wup) &&
3902 !after(seq, tp->rcv_nxt + tcp_receive_window(tp));
3905 /* When we get a reset we do this. */
3906 void tcp_reset(struct sock *sk)
3908 /* We want the right error as BSD sees it (and indeed as we do). */
3909 switch (sk->sk_state) {
3911 sk->sk_err = ECONNREFUSED;
3913 case TCP_CLOSE_WAIT:
3919 sk->sk_err = ECONNRESET;
3921 /* This barrier is coupled with smp_rmb() in tcp_poll() */
3924 if (!sock_flag(sk, SOCK_DEAD))
3925 sk->sk_error_report(sk);
3931 * Process the FIN bit. This now behaves as it is supposed to work
3932 * and the FIN takes effect when it is validly part of sequence
3933 * space. Not before when we get holes.
3935 * If we are ESTABLISHED, a received fin moves us to CLOSE-WAIT
3936 * (and thence onto LAST-ACK and finally, CLOSE, we never enter
3939 * If we are in FINWAIT-1, a received FIN indicates simultaneous
3940 * close and we go into CLOSING (and later onto TIME-WAIT)
3942 * If we are in FINWAIT-2, a received FIN moves us to TIME-WAIT.
3944 static void tcp_fin(struct sock *sk)
3946 struct tcp_sock *tp = tcp_sk(sk);
3947 const struct dst_entry *dst;
3949 inet_csk_schedule_ack(sk);
3951 sk->sk_shutdown |= RCV_SHUTDOWN;
3952 sock_set_flag(sk, SOCK_DONE);
3954 switch (sk->sk_state) {
3956 case TCP_ESTABLISHED:
3957 /* Move to CLOSE_WAIT */
3958 tcp_set_state(sk, TCP_CLOSE_WAIT);
3959 dst = __sk_dst_get(sk);
3960 if (!dst || !dst_metric(dst, RTAX_QUICKACK))
3961 inet_csk(sk)->icsk_ack.pingpong = 1;
3964 case TCP_CLOSE_WAIT:
3966 /* Received a retransmission of the FIN, do
3971 /* RFC793: Remain in the LAST-ACK state. */
3975 /* This case occurs when a simultaneous close
3976 * happens, we must ack the received FIN and
3977 * enter the CLOSING state.
3980 tcp_set_state(sk, TCP_CLOSING);
3983 /* Received a FIN -- send ACK and enter TIME_WAIT. */
3985 tcp_time_wait(sk, TCP_TIME_WAIT, 0);
3988 /* Only TCP_LISTEN and TCP_CLOSE are left, in these
3989 * cases we should never reach this piece of code.
3991 pr_err("%s: Impossible, sk->sk_state=%d\n",
3992 __func__, sk->sk_state);
3996 /* It _is_ possible, that we have something out-of-order _after_ FIN.
3997 * Probably, we should reset in this case. For now drop them.
3999 __skb_queue_purge(&tp->out_of_order_queue);
4000 if (tcp_is_sack(tp))
4001 tcp_sack_reset(&tp->rx_opt);
4004 if (!sock_flag(sk, SOCK_DEAD)) {
4005 sk->sk_state_change(sk);
4007 /* Do not send POLL_HUP for half duplex close. */
4008 if (sk->sk_shutdown == SHUTDOWN_MASK ||
4009 sk->sk_state == TCP_CLOSE)
4010 sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_HUP);
4012 sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_IN);
4016 static inline bool tcp_sack_extend(struct tcp_sack_block *sp, u32 seq,
4019 if (!after(seq, sp->end_seq) && !after(sp->start_seq, end_seq)) {
4020 if (before(seq, sp->start_seq))
4021 sp->start_seq = seq;
4022 if (after(end_seq, sp->end_seq))
4023 sp->end_seq = end_seq;
4029 static void tcp_dsack_set(struct sock *sk, u32 seq, u32 end_seq)
4031 struct tcp_sock *tp = tcp_sk(sk);
4033 if (tcp_is_sack(tp) && sysctl_tcp_dsack) {
4036 if (before(seq, tp->rcv_nxt))
4037 mib_idx = LINUX_MIB_TCPDSACKOLDSENT;
4039 mib_idx = LINUX_MIB_TCPDSACKOFOSENT;
4041 NET_INC_STATS_BH(sock_net(sk), mib_idx);
4043 tp->rx_opt.dsack = 1;
4044 tp->duplicate_sack[0].start_seq = seq;
4045 tp->duplicate_sack[0].end_seq = end_seq;
4049 static void tcp_dsack_extend(struct sock *sk, u32 seq, u32 end_seq)
4051 struct tcp_sock *tp = tcp_sk(sk);
4053 if (!tp->rx_opt.dsack)
4054 tcp_dsack_set(sk, seq, end_seq);
4056 tcp_sack_extend(tp->duplicate_sack, seq, end_seq);
4059 static void tcp_send_dupack(struct sock *sk, const struct sk_buff *skb)
4061 struct tcp_sock *tp = tcp_sk(sk);
4063 if (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
4064 before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
4065 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_DELAYEDACKLOST);
4066 tcp_enter_quickack_mode(sk);
4068 if (tcp_is_sack(tp) && sysctl_tcp_dsack) {
4069 u32 end_seq = TCP_SKB_CB(skb)->end_seq;
4071 if (after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt))
4072 end_seq = tp->rcv_nxt;
4073 tcp_dsack_set(sk, TCP_SKB_CB(skb)->seq, end_seq);
4080 /* These routines update the SACK block as out-of-order packets arrive or
4081 * in-order packets close up the sequence space.
4083 static void tcp_sack_maybe_coalesce(struct tcp_sock *tp)
4086 struct tcp_sack_block *sp = &tp->selective_acks[0];
4087 struct tcp_sack_block *swalk = sp + 1;
4089 /* See if the recent change to the first SACK eats into
4090 * or hits the sequence space of other SACK blocks, if so coalesce.
4092 for (this_sack = 1; this_sack < tp->rx_opt.num_sacks;) {
4093 if (tcp_sack_extend(sp, swalk->start_seq, swalk->end_seq)) {
4096 /* Zap SWALK, by moving every further SACK up by one slot.
4097 * Decrease num_sacks.
4099 tp->rx_opt.num_sacks--;
4100 for (i = this_sack; i < tp->rx_opt.num_sacks; i++)
4104 this_sack++, swalk++;
4108 static void tcp_sack_new_ofo_skb(struct sock *sk, u32 seq, u32 end_seq)
4110 struct tcp_sock *tp = tcp_sk(sk);
4111 struct tcp_sack_block *sp = &tp->selective_acks[0];
4112 int cur_sacks = tp->rx_opt.num_sacks;
4118 for (this_sack = 0; this_sack < cur_sacks; this_sack++, sp++) {
4119 if (tcp_sack_extend(sp, seq, end_seq)) {
4120 /* Rotate this_sack to the first one. */
4121 for (; this_sack > 0; this_sack--, sp--)
4122 swap(*sp, *(sp - 1));
4124 tcp_sack_maybe_coalesce(tp);
4129 /* Could not find an adjacent existing SACK, build a new one,
4130 * put it at the front, and shift everyone else down. We
4131 * always know there is at least one SACK present already here.
4133 * If the sack array is full, forget about the last one.
4135 if (this_sack >= TCP_NUM_SACKS) {
4137 tp->rx_opt.num_sacks--;
4140 for (; this_sack > 0; this_sack--, sp--)
4144 /* Build the new head SACK, and we're done. */
4145 sp->start_seq = seq;
4146 sp->end_seq = end_seq;
4147 tp->rx_opt.num_sacks++;
4150 /* RCV.NXT advances, some SACKs should be eaten. */
4152 static void tcp_sack_remove(struct tcp_sock *tp)
4154 struct tcp_sack_block *sp = &tp->selective_acks[0];
4155 int num_sacks = tp->rx_opt.num_sacks;
4158 /* Empty ofo queue, hence, all the SACKs are eaten. Clear. */
4159 if (skb_queue_empty(&tp->out_of_order_queue)) {
4160 tp->rx_opt.num_sacks = 0;
4164 for (this_sack = 0; this_sack < num_sacks;) {
4165 /* Check if the start of the sack is covered by RCV.NXT. */
4166 if (!before(tp->rcv_nxt, sp->start_seq)) {
4169 /* RCV.NXT must cover all the block! */
4170 WARN_ON(before(tp->rcv_nxt, sp->end_seq));
4172 /* Zap this SACK, by moving forward any other SACKS. */
4173 for (i = this_sack+1; i < num_sacks; i++)
4174 tp->selective_acks[i-1] = tp->selective_acks[i];
4181 tp->rx_opt.num_sacks = num_sacks;
4185 * tcp_try_coalesce - try to merge skb to prior one
4188 * @from: buffer to add in queue
4189 * @fragstolen: pointer to boolean
4191 * Before queueing skb @from after @to, try to merge them
4192 * to reduce overall memory use and queue lengths, if cost is small.
4193 * Packets in ofo or receive queues can stay a long time.
4194 * Better try to coalesce them right now to avoid future collapses.
4195 * Returns true if caller should free @from instead of queueing it
4197 static bool tcp_try_coalesce(struct sock *sk,
4199 struct sk_buff *from,
4204 *fragstolen = false;
4206 /* Its possible this segment overlaps with prior segment in queue */
4207 if (TCP_SKB_CB(from)->seq != TCP_SKB_CB(to)->end_seq)
4210 if (!skb_try_coalesce(to, from, fragstolen, &delta))
4213 atomic_add(delta, &sk->sk_rmem_alloc);
4214 sk_mem_charge(sk, delta);
4215 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPRCVCOALESCE);
4216 TCP_SKB_CB(to)->end_seq = TCP_SKB_CB(from)->end_seq;
4217 TCP_SKB_CB(to)->ack_seq = TCP_SKB_CB(from)->ack_seq;
4218 TCP_SKB_CB(to)->tcp_flags |= TCP_SKB_CB(from)->tcp_flags;
4222 /* This one checks to see if we can put data from the
4223 * out_of_order queue into the receive_queue.
4225 static void tcp_ofo_queue(struct sock *sk)
4227 struct tcp_sock *tp = tcp_sk(sk);
4228 __u32 dsack_high = tp->rcv_nxt;
4229 struct sk_buff *skb, *tail;
4230 bool fragstolen, eaten;
4232 while ((skb = skb_peek(&tp->out_of_order_queue)) != NULL) {
4233 if (after(TCP_SKB_CB(skb)->seq, tp->rcv_nxt))
4236 if (before(TCP_SKB_CB(skb)->seq, dsack_high)) {
4237 __u32 dsack = dsack_high;
4238 if (before(TCP_SKB_CB(skb)->end_seq, dsack_high))
4239 dsack_high = TCP_SKB_CB(skb)->end_seq;
4240 tcp_dsack_extend(sk, TCP_SKB_CB(skb)->seq, dsack);
4243 __skb_unlink(skb, &tp->out_of_order_queue);
4244 if (!after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt)) {
4245 SOCK_DEBUG(sk, "ofo packet was already received\n");
4249 SOCK_DEBUG(sk, "ofo requeuing : rcv_next %X seq %X - %X\n",
4250 tp->rcv_nxt, TCP_SKB_CB(skb)->seq,
4251 TCP_SKB_CB(skb)->end_seq);
4253 tail = skb_peek_tail(&sk->sk_receive_queue);
4254 eaten = tail && tcp_try_coalesce(sk, tail, skb, &fragstolen);
4255 tcp_rcv_nxt_update(tp, TCP_SKB_CB(skb)->end_seq);
4257 __skb_queue_tail(&sk->sk_receive_queue, skb);
4258 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)
4261 kfree_skb_partial(skb, fragstolen);
4265 static bool tcp_prune_ofo_queue(struct sock *sk);
4266 static int tcp_prune_queue(struct sock *sk);
4268 static int tcp_try_rmem_schedule(struct sock *sk, struct sk_buff *skb,
4271 if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf ||
4272 !sk_rmem_schedule(sk, skb, size)) {
4274 if (tcp_prune_queue(sk) < 0)
4277 if (!sk_rmem_schedule(sk, skb, size)) {
4278 if (!tcp_prune_ofo_queue(sk))
4281 if (!sk_rmem_schedule(sk, skb, size))
4288 static void tcp_data_queue_ofo(struct sock *sk, struct sk_buff *skb)
4290 struct tcp_sock *tp = tcp_sk(sk);
4291 struct sk_buff *skb1;
4294 tcp_ecn_check_ce(tp, skb);
4296 if (unlikely(tcp_try_rmem_schedule(sk, skb, skb->truesize))) {
4297 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPOFODROP);
4302 /* Disable header prediction. */
4304 inet_csk_schedule_ack(sk);
4306 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPOFOQUEUE);
4307 SOCK_DEBUG(sk, "out of order segment: rcv_next %X seq %X - %X\n",
4308 tp->rcv_nxt, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq);
4310 skb1 = skb_peek_tail(&tp->out_of_order_queue);
4312 /* Initial out of order segment, build 1 SACK. */
4313 if (tcp_is_sack(tp)) {
4314 tp->rx_opt.num_sacks = 1;
4315 tp->selective_acks[0].start_seq = TCP_SKB_CB(skb)->seq;
4316 tp->selective_acks[0].end_seq =
4317 TCP_SKB_CB(skb)->end_seq;
4319 __skb_queue_head(&tp->out_of_order_queue, skb);
4323 seq = TCP_SKB_CB(skb)->seq;
4324 end_seq = TCP_SKB_CB(skb)->end_seq;
4326 if (seq == TCP_SKB_CB(skb1)->end_seq) {
4329 if (!tcp_try_coalesce(sk, skb1, skb, &fragstolen)) {
4330 __skb_queue_after(&tp->out_of_order_queue, skb1, skb);
4332 tcp_grow_window(sk, skb);
4333 kfree_skb_partial(skb, fragstolen);
4337 if (!tp->rx_opt.num_sacks ||
4338 tp->selective_acks[0].end_seq != seq)
4341 /* Common case: data arrive in order after hole. */
4342 tp->selective_acks[0].end_seq = end_seq;
4346 /* Find place to insert this segment. */
4348 if (!after(TCP_SKB_CB(skb1)->seq, seq))
4350 if (skb_queue_is_first(&tp->out_of_order_queue, skb1)) {
4354 skb1 = skb_queue_prev(&tp->out_of_order_queue, skb1);
4357 /* Do skb overlap to previous one? */
4358 if (skb1 && before(seq, TCP_SKB_CB(skb1)->end_seq)) {
4359 if (!after(end_seq, TCP_SKB_CB(skb1)->end_seq)) {
4360 /* All the bits are present. Drop. */
4361 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPOFOMERGE);
4364 tcp_dsack_set(sk, seq, end_seq);
4367 if (after(seq, TCP_SKB_CB(skb1)->seq)) {
4368 /* Partial overlap. */
4369 tcp_dsack_set(sk, seq,
4370 TCP_SKB_CB(skb1)->end_seq);
4372 if (skb_queue_is_first(&tp->out_of_order_queue,
4376 skb1 = skb_queue_prev(
4377 &tp->out_of_order_queue,
4382 __skb_queue_head(&tp->out_of_order_queue, skb);
4384 __skb_queue_after(&tp->out_of_order_queue, skb1, skb);
4386 /* And clean segments covered by new one as whole. */
4387 while (!skb_queue_is_last(&tp->out_of_order_queue, skb)) {
4388 skb1 = skb_queue_next(&tp->out_of_order_queue, skb);
4390 if (!after(end_seq, TCP_SKB_CB(skb1)->seq))
4392 if (before(end_seq, TCP_SKB_CB(skb1)->end_seq)) {
4393 tcp_dsack_extend(sk, TCP_SKB_CB(skb1)->seq,
4397 __skb_unlink(skb1, &tp->out_of_order_queue);
4398 tcp_dsack_extend(sk, TCP_SKB_CB(skb1)->seq,
4399 TCP_SKB_CB(skb1)->end_seq);
4400 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPOFOMERGE);
4405 if (tcp_is_sack(tp))
4406 tcp_sack_new_ofo_skb(sk, seq, end_seq);
4409 tcp_grow_window(sk, skb);
4410 skb_set_owner_r(skb, sk);
4414 static int __must_check tcp_queue_rcv(struct sock *sk, struct sk_buff *skb, int hdrlen,
4418 struct sk_buff *tail = skb_peek_tail(&sk->sk_receive_queue);
4420 __skb_pull(skb, hdrlen);
4422 tcp_try_coalesce(sk, tail, skb, fragstolen)) ? 1 : 0;
4423 tcp_rcv_nxt_update(tcp_sk(sk), TCP_SKB_CB(skb)->end_seq);
4425 __skb_queue_tail(&sk->sk_receive_queue, skb);
4426 skb_set_owner_r(skb, sk);
4431 int tcp_send_rcvq(struct sock *sk, struct msghdr *msg, size_t size)
4433 struct sk_buff *skb;
4439 skb = alloc_skb(size, sk->sk_allocation);
4443 if (tcp_try_rmem_schedule(sk, skb, skb->truesize))
4446 if (memcpy_from_msg(skb_put(skb, size), msg, size))
4449 TCP_SKB_CB(skb)->seq = tcp_sk(sk)->rcv_nxt;
4450 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq + size;
4451 TCP_SKB_CB(skb)->ack_seq = tcp_sk(sk)->snd_una - 1;
4453 if (tcp_queue_rcv(sk, skb, 0, &fragstolen)) {
4454 WARN_ON_ONCE(fragstolen); /* should not happen */
4465 static void tcp_data_queue(struct sock *sk, struct sk_buff *skb)
4467 struct tcp_sock *tp = tcp_sk(sk);
4469 bool fragstolen = false;
4471 if (TCP_SKB_CB(skb)->seq == TCP_SKB_CB(skb)->end_seq)
4475 __skb_pull(skb, tcp_hdr(skb)->doff * 4);
4477 tcp_ecn_accept_cwr(tp, skb);
4479 tp->rx_opt.dsack = 0;
4481 /* Queue data for delivery to the user.
4482 * Packets in sequence go to the receive queue.
4483 * Out of sequence packets to the out_of_order_queue.
4485 if (TCP_SKB_CB(skb)->seq == tp->rcv_nxt) {
4486 if (tcp_receive_window(tp) == 0)
4489 /* Ok. In sequence. In window. */
4490 if (tp->ucopy.task == current &&
4491 tp->copied_seq == tp->rcv_nxt && tp->ucopy.len &&
4492 sock_owned_by_user(sk) && !tp->urg_data) {
4493 int chunk = min_t(unsigned int, skb->len,
4496 __set_current_state(TASK_RUNNING);
4499 if (!skb_copy_datagram_msg(skb, 0, tp->ucopy.msg, chunk)) {
4500 tp->ucopy.len -= chunk;
4501 tp->copied_seq += chunk;
4502 eaten = (chunk == skb->len);
4503 tcp_rcv_space_adjust(sk);
4511 if (skb_queue_len(&sk->sk_receive_queue) == 0)
4512 sk_forced_mem_schedule(sk, skb->truesize);
4513 else if (tcp_try_rmem_schedule(sk, skb, skb->truesize))
4516 eaten = tcp_queue_rcv(sk, skb, 0, &fragstolen);
4518 tcp_rcv_nxt_update(tp, TCP_SKB_CB(skb)->end_seq);
4520 tcp_event_data_recv(sk, skb);
4521 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)
4524 if (!skb_queue_empty(&tp->out_of_order_queue)) {
4527 /* RFC2581. 4.2. SHOULD send immediate ACK, when
4528 * gap in queue is filled.
4530 if (skb_queue_empty(&tp->out_of_order_queue))
4531 inet_csk(sk)->icsk_ack.pingpong = 0;
4534 if (tp->rx_opt.num_sacks)
4535 tcp_sack_remove(tp);
4537 tcp_fast_path_check(sk);
4540 kfree_skb_partial(skb, fragstolen);
4541 if (!sock_flag(sk, SOCK_DEAD))
4542 sk->sk_data_ready(sk);
4546 if (!after(TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt)) {
4547 /* A retransmit, 2nd most common case. Force an immediate ack. */
4548 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_DELAYEDACKLOST);
4549 tcp_dsack_set(sk, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq);
4552 tcp_enter_quickack_mode(sk);
4553 inet_csk_schedule_ack(sk);
4559 /* Out of window. F.e. zero window probe. */
4560 if (!before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt + tcp_receive_window(tp)))
4563 tcp_enter_quickack_mode(sk);
4565 if (before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt)) {
4566 /* Partial packet, seq < rcv_next < end_seq */
4567 SOCK_DEBUG(sk, "partial packet: rcv_next %X seq %X - %X\n",
4568 tp->rcv_nxt, TCP_SKB_CB(skb)->seq,
4569 TCP_SKB_CB(skb)->end_seq);
4571 tcp_dsack_set(sk, TCP_SKB_CB(skb)->seq, tp->rcv_nxt);
4573 /* If window is closed, drop tail of packet. But after
4574 * remembering D-SACK for its head made in previous line.
4576 if (!tcp_receive_window(tp))
4581 tcp_data_queue_ofo(sk, skb);
4584 static struct sk_buff *tcp_collapse_one(struct sock *sk, struct sk_buff *skb,
4585 struct sk_buff_head *list)
4587 struct sk_buff *next = NULL;
4589 if (!skb_queue_is_last(list, skb))
4590 next = skb_queue_next(list, skb);
4592 __skb_unlink(skb, list);
4594 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPRCVCOLLAPSED);
4599 /* Collapse contiguous sequence of skbs head..tail with
4600 * sequence numbers start..end.
4602 * If tail is NULL, this means until the end of the list.
4604 * Segments with FIN/SYN are not collapsed (only because this
4608 tcp_collapse(struct sock *sk, struct sk_buff_head *list,
4609 struct sk_buff *head, struct sk_buff *tail,
4612 struct sk_buff *skb, *n;
4615 /* First, check that queue is collapsible and find
4616 * the point where collapsing can be useful. */
4620 skb_queue_walk_from_safe(list, skb, n) {
4623 /* No new bits? It is possible on ofo queue. */
4624 if (!before(start, TCP_SKB_CB(skb)->end_seq)) {
4625 skb = tcp_collapse_one(sk, skb, list);
4631 /* The first skb to collapse is:
4633 * - bloated or contains data before "start" or
4634 * overlaps to the next one.
4636 if (!(TCP_SKB_CB(skb)->tcp_flags & (TCPHDR_SYN | TCPHDR_FIN)) &&
4637 (tcp_win_from_space(skb->truesize) > skb->len ||
4638 before(TCP_SKB_CB(skb)->seq, start))) {
4639 end_of_skbs = false;
4643 if (!skb_queue_is_last(list, skb)) {
4644 struct sk_buff *next = skb_queue_next(list, skb);
4646 TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(next)->seq) {
4647 end_of_skbs = false;
4652 /* Decided to skip this, advance start seq. */
4653 start = TCP_SKB_CB(skb)->end_seq;
4656 (TCP_SKB_CB(skb)->tcp_flags & (TCPHDR_SYN | TCPHDR_FIN)))
4659 while (before(start, end)) {
4660 int copy = min_t(int, SKB_MAX_ORDER(0, 0), end - start);
4661 struct sk_buff *nskb;
4663 nskb = alloc_skb(copy, GFP_ATOMIC);
4667 memcpy(nskb->cb, skb->cb, sizeof(skb->cb));
4668 TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(nskb)->end_seq = start;
4669 __skb_queue_before(list, skb, nskb);
4670 skb_set_owner_r(nskb, sk);
4672 /* Copy data, releasing collapsed skbs. */
4674 int offset = start - TCP_SKB_CB(skb)->seq;
4675 int size = TCP_SKB_CB(skb)->end_seq - start;
4679 size = min(copy, size);
4680 if (skb_copy_bits(skb, offset, skb_put(nskb, size), size))
4682 TCP_SKB_CB(nskb)->end_seq += size;
4686 if (!before(start, TCP_SKB_CB(skb)->end_seq)) {
4687 skb = tcp_collapse_one(sk, skb, list);
4690 (TCP_SKB_CB(skb)->tcp_flags & (TCPHDR_SYN | TCPHDR_FIN)))
4697 /* Collapse ofo queue. Algorithm: select contiguous sequence of skbs
4698 * and tcp_collapse() them until all the queue is collapsed.
4700 static void tcp_collapse_ofo_queue(struct sock *sk)
4702 struct tcp_sock *tp = tcp_sk(sk);
4703 struct sk_buff *skb = skb_peek(&tp->out_of_order_queue);
4704 struct sk_buff *head;
4710 start = TCP_SKB_CB(skb)->seq;
4711 end = TCP_SKB_CB(skb)->end_seq;
4715 struct sk_buff *next = NULL;
4717 if (!skb_queue_is_last(&tp->out_of_order_queue, skb))
4718 next = skb_queue_next(&tp->out_of_order_queue, skb);
4721 /* Segment is terminated when we see gap or when
4722 * we are at the end of all the queue. */
4724 after(TCP_SKB_CB(skb)->seq, end) ||
4725 before(TCP_SKB_CB(skb)->end_seq, start)) {
4726 tcp_collapse(sk, &tp->out_of_order_queue,
4727 head, skb, start, end);
4731 /* Start new segment */
4732 start = TCP_SKB_CB(skb)->seq;
4733 end = TCP_SKB_CB(skb)->end_seq;
4735 if (before(TCP_SKB_CB(skb)->seq, start))
4736 start = TCP_SKB_CB(skb)->seq;
4737 if (after(TCP_SKB_CB(skb)->end_seq, end))
4738 end = TCP_SKB_CB(skb)->end_seq;
4744 * Purge the out-of-order queue.
4745 * Return true if queue was pruned.
4747 static bool tcp_prune_ofo_queue(struct sock *sk)
4749 struct tcp_sock *tp = tcp_sk(sk);
4752 if (!skb_queue_empty(&tp->out_of_order_queue)) {
4753 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_OFOPRUNED);
4754 __skb_queue_purge(&tp->out_of_order_queue);
4756 /* Reset SACK state. A conforming SACK implementation will
4757 * do the same at a timeout based retransmit. When a connection
4758 * is in a sad state like this, we care only about integrity
4759 * of the connection not performance.
4761 if (tp->rx_opt.sack_ok)
4762 tcp_sack_reset(&tp->rx_opt);
4769 /* Reduce allocated memory if we can, trying to get
4770 * the socket within its memory limits again.
4772 * Return less than zero if we should start dropping frames
4773 * until the socket owning process reads some of the data
4774 * to stabilize the situation.
4776 static int tcp_prune_queue(struct sock *sk)
4778 struct tcp_sock *tp = tcp_sk(sk);
4780 SOCK_DEBUG(sk, "prune_queue: c=%x\n", tp->copied_seq);
4782 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_PRUNECALLED);
4784 if (atomic_read(&sk->sk_rmem_alloc) >= sk->sk_rcvbuf)
4785 tcp_clamp_window(sk);
4786 else if (tcp_under_memory_pressure(sk))
4787 tp->rcv_ssthresh = min(tp->rcv_ssthresh, 4U * tp->advmss);
4789 tcp_collapse_ofo_queue(sk);
4790 if (!skb_queue_empty(&sk->sk_receive_queue))
4791 tcp_collapse(sk, &sk->sk_receive_queue,
4792 skb_peek(&sk->sk_receive_queue),
4794 tp->copied_seq, tp->rcv_nxt);
4797 if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf)
4800 /* Collapsing did not help, destructive actions follow.
4801 * This must not ever occur. */
4803 tcp_prune_ofo_queue(sk);
4805 if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf)
4808 /* If we are really being abused, tell the caller to silently
4809 * drop receive data on the floor. It will get retransmitted
4810 * and hopefully then we'll have sufficient space.
4812 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_RCVPRUNED);
4814 /* Massive buffer overcommit. */
4819 static bool tcp_should_expand_sndbuf(const struct sock *sk)
4821 const struct tcp_sock *tp = tcp_sk(sk);
4823 /* If the user specified a specific send buffer setting, do
4826 if (sk->sk_userlocks & SOCK_SNDBUF_LOCK)
4829 /* If we are under global TCP memory pressure, do not expand. */
4830 if (tcp_under_memory_pressure(sk))
4833 /* If we are under soft global TCP memory pressure, do not expand. */
4834 if (sk_memory_allocated(sk) >= sk_prot_mem_limits(sk, 0))
4837 /* If we filled the congestion window, do not expand. */
4838 if (tcp_packets_in_flight(tp) >= tp->snd_cwnd)
4844 /* When incoming ACK allowed to free some skb from write_queue,
4845 * we remember this event in flag SOCK_QUEUE_SHRUNK and wake up socket
4846 * on the exit from tcp input handler.
4848 * PROBLEM: sndbuf expansion does not work well with largesend.
4850 static void tcp_new_space(struct sock *sk)
4852 struct tcp_sock *tp = tcp_sk(sk);
4854 if (tcp_should_expand_sndbuf(sk)) {
4855 tcp_sndbuf_expand(sk);
4856 tp->snd_cwnd_stamp = tcp_time_stamp;
4859 sk->sk_write_space(sk);
4862 static void tcp_check_space(struct sock *sk)
4864 if (sock_flag(sk, SOCK_QUEUE_SHRUNK)) {
4865 sock_reset_flag(sk, SOCK_QUEUE_SHRUNK);
4866 /* pairs with tcp_poll() */
4867 smp_mb__after_atomic();
4868 if (sk->sk_socket &&
4869 test_bit(SOCK_NOSPACE, &sk->sk_socket->flags))
4874 static inline void tcp_data_snd_check(struct sock *sk)
4876 tcp_push_pending_frames(sk);
4877 tcp_check_space(sk);
4881 * Check if sending an ack is needed.
4883 static void __tcp_ack_snd_check(struct sock *sk, int ofo_possible)
4885 struct tcp_sock *tp = tcp_sk(sk);
4887 /* More than one full frame received... */
4888 if (((tp->rcv_nxt - tp->rcv_wup) > inet_csk(sk)->icsk_ack.rcv_mss &&
4889 /* ... and right edge of window advances far enough.
4890 * (tcp_recvmsg() will send ACK otherwise). Or...
4892 __tcp_select_window(sk) >= tp->rcv_wnd) ||
4893 /* We ACK each frame or... */
4894 tcp_in_quickack_mode(sk) ||
4895 /* We have out of order data. */
4896 (ofo_possible && skb_peek(&tp->out_of_order_queue))) {
4897 /* Then ack it now */
4900 /* Else, send delayed ack. */
4901 tcp_send_delayed_ack(sk);
4905 static inline void tcp_ack_snd_check(struct sock *sk)
4907 if (!inet_csk_ack_scheduled(sk)) {
4908 /* We sent a data segment already. */
4911 __tcp_ack_snd_check(sk, 1);
4915 * This routine is only called when we have urgent data
4916 * signaled. Its the 'slow' part of tcp_urg. It could be
4917 * moved inline now as tcp_urg is only called from one
4918 * place. We handle URGent data wrong. We have to - as
4919 * BSD still doesn't use the correction from RFC961.
4920 * For 1003.1g we should support a new option TCP_STDURG to permit
4921 * either form (or just set the sysctl tcp_stdurg).
4924 static void tcp_check_urg(struct sock *sk, const struct tcphdr *th)
4926 struct tcp_sock *tp = tcp_sk(sk);
4927 u32 ptr = ntohs(th->urg_ptr);
4929 if (ptr && !sysctl_tcp_stdurg)
4931 ptr += ntohl(th->seq);
4933 /* Ignore urgent data that we've already seen and read. */
4934 if (after(tp->copied_seq, ptr))
4937 /* Do not replay urg ptr.
4939 * NOTE: interesting situation not covered by specs.
4940 * Misbehaving sender may send urg ptr, pointing to segment,
4941 * which we already have in ofo queue. We are not able to fetch
4942 * such data and will stay in TCP_URG_NOTYET until will be eaten
4943 * by recvmsg(). Seems, we are not obliged to handle such wicked
4944 * situations. But it is worth to think about possibility of some
4945 * DoSes using some hypothetical application level deadlock.
4947 if (before(ptr, tp->rcv_nxt))
4950 /* Do we already have a newer (or duplicate) urgent pointer? */
4951 if (tp->urg_data && !after(ptr, tp->urg_seq))
4954 /* Tell the world about our new urgent pointer. */
4957 /* We may be adding urgent data when the last byte read was
4958 * urgent. To do this requires some care. We cannot just ignore
4959 * tp->copied_seq since we would read the last urgent byte again
4960 * as data, nor can we alter copied_seq until this data arrives
4961 * or we break the semantics of SIOCATMARK (and thus sockatmark())
4963 * NOTE. Double Dutch. Rendering to plain English: author of comment
4964 * above did something sort of send("A", MSG_OOB); send("B", MSG_OOB);
4965 * and expect that both A and B disappear from stream. This is _wrong_.
4966 * Though this happens in BSD with high probability, this is occasional.
4967 * Any application relying on this is buggy. Note also, that fix "works"
4968 * only in this artificial test. Insert some normal data between A and B and we will
4969 * decline of BSD again. Verdict: it is better to remove to trap
4972 if (tp->urg_seq == tp->copied_seq && tp->urg_data &&
4973 !sock_flag(sk, SOCK_URGINLINE) && tp->copied_seq != tp->rcv_nxt) {
4974 struct sk_buff *skb = skb_peek(&sk->sk_receive_queue);
4976 if (skb && !before(tp->copied_seq, TCP_SKB_CB(skb)->end_seq)) {
4977 __skb_unlink(skb, &sk->sk_receive_queue);
4982 tp->urg_data = TCP_URG_NOTYET;
4985 /* Disable header prediction. */
4989 /* This is the 'fast' part of urgent handling. */
4990 static void tcp_urg(struct sock *sk, struct sk_buff *skb, const struct tcphdr *th)
4992 struct tcp_sock *tp = tcp_sk(sk);
4994 /* Check if we get a new urgent pointer - normally not. */
4996 tcp_check_urg(sk, th);
4998 /* Do we wait for any urgent data? - normally not... */
4999 if (tp->urg_data == TCP_URG_NOTYET) {
5000 u32 ptr = tp->urg_seq - ntohl(th->seq) + (th->doff * 4) -
5003 /* Is the urgent pointer pointing into this packet? */
5004 if (ptr < skb->len) {
5006 if (skb_copy_bits(skb, ptr, &tmp, 1))
5008 tp->urg_data = TCP_URG_VALID | tmp;
5009 if (!sock_flag(sk, SOCK_DEAD))
5010 sk->sk_data_ready(sk);
5015 static int tcp_copy_to_iovec(struct sock *sk, struct sk_buff *skb, int hlen)
5017 struct tcp_sock *tp = tcp_sk(sk);
5018 int chunk = skb->len - hlen;
5022 if (skb_csum_unnecessary(skb))
5023 err = skb_copy_datagram_msg(skb, hlen, tp->ucopy.msg, chunk);
5025 err = skb_copy_and_csum_datagram_msg(skb, hlen, tp->ucopy.msg);
5028 tp->ucopy.len -= chunk;
5029 tp->copied_seq += chunk;
5030 tcp_rcv_space_adjust(sk);
5037 static __sum16 __tcp_checksum_complete_user(struct sock *sk,
5038 struct sk_buff *skb)
5042 if (sock_owned_by_user(sk)) {
5044 result = __tcp_checksum_complete(skb);
5047 result = __tcp_checksum_complete(skb);
5052 static inline bool tcp_checksum_complete_user(struct sock *sk,
5053 struct sk_buff *skb)
5055 return !skb_csum_unnecessary(skb) &&
5056 __tcp_checksum_complete_user(sk, skb);
5059 /* Does PAWS and seqno based validation of an incoming segment, flags will
5060 * play significant role here.
5062 static bool tcp_validate_incoming(struct sock *sk, struct sk_buff *skb,
5063 const struct tcphdr *th, int syn_inerr)
5065 struct tcp_sock *tp = tcp_sk(sk);
5067 /* RFC1323: H1. Apply PAWS check first. */
5068 if (tcp_fast_parse_options(skb, th, tp) && tp->rx_opt.saw_tstamp &&
5069 tcp_paws_discard(sk, skb)) {
5071 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_PAWSESTABREJECTED);
5072 if (!tcp_oow_rate_limited(sock_net(sk), skb,
5073 LINUX_MIB_TCPACKSKIPPEDPAWS,
5074 &tp->last_oow_ack_time))
5075 tcp_send_dupack(sk, skb);
5078 /* Reset is accepted even if it did not pass PAWS. */
5081 /* Step 1: check sequence number */
5082 if (!tcp_sequence(tp, TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq)) {
5083 /* RFC793, page 37: "In all states except SYN-SENT, all reset
5084 * (RST) segments are validated by checking their SEQ-fields."
5085 * And page 69: "If an incoming segment is not acceptable,
5086 * an acknowledgment should be sent in reply (unless the RST
5087 * bit is set, if so drop the segment and return)".
5092 if (!tcp_oow_rate_limited(sock_net(sk), skb,
5093 LINUX_MIB_TCPACKSKIPPEDSEQ,
5094 &tp->last_oow_ack_time))
5095 tcp_send_dupack(sk, skb);
5100 /* Step 2: check RST bit */
5103 * If sequence number exactly matches RCV.NXT, then
5104 * RESET the connection
5106 * Send a challenge ACK
5108 if (TCP_SKB_CB(skb)->seq == tp->rcv_nxt)
5111 tcp_send_challenge_ack(sk, skb);
5115 /* step 3: check security and precedence [ignored] */
5117 /* step 4: Check for a SYN
5118 * RFC 5961 4.2 : Send a challenge ack
5123 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_INERRS);
5124 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPSYNCHALLENGE);
5125 tcp_send_challenge_ack(sk, skb);
5137 * TCP receive function for the ESTABLISHED state.
5139 * It is split into a fast path and a slow path. The fast path is
5141 * - A zero window was announced from us - zero window probing
5142 * is only handled properly in the slow path.
5143 * - Out of order segments arrived.
5144 * - Urgent data is expected.
5145 * - There is no buffer space left
5146 * - Unexpected TCP flags/window values/header lengths are received
5147 * (detected by checking the TCP header against pred_flags)
5148 * - Data is sent in both directions. Fast path only supports pure senders
5149 * or pure receivers (this means either the sequence number or the ack
5150 * value must stay constant)
5151 * - Unexpected TCP option.
5153 * When these conditions are not satisfied it drops into a standard
5154 * receive procedure patterned after RFC793 to handle all cases.
5155 * The first three cases are guaranteed by proper pred_flags setting,
5156 * the rest is checked inline. Fast processing is turned on in
5157 * tcp_data_queue when everything is OK.
5159 void tcp_rcv_established(struct sock *sk, struct sk_buff *skb,
5160 const struct tcphdr *th, unsigned int len)
5162 struct tcp_sock *tp = tcp_sk(sk);
5164 if (unlikely(!sk->sk_rx_dst))
5165 inet_csk(sk)->icsk_af_ops->sk_rx_dst_set(sk, skb);
5167 * Header prediction.
5168 * The code loosely follows the one in the famous
5169 * "30 instruction TCP receive" Van Jacobson mail.
5171 * Van's trick is to deposit buffers into socket queue
5172 * on a device interrupt, to call tcp_recv function
5173 * on the receive process context and checksum and copy
5174 * the buffer to user space. smart...
5176 * Our current scheme is not silly either but we take the
5177 * extra cost of the net_bh soft interrupt processing...
5178 * We do checksum and copy also but from device to kernel.
5181 tp->rx_opt.saw_tstamp = 0;
5183 /* pred_flags is 0xS?10 << 16 + snd_wnd
5184 * if header_prediction is to be made
5185 * 'S' will always be tp->tcp_header_len >> 2
5186 * '?' will be 0 for the fast path, otherwise pred_flags is 0 to
5187 * turn it off (when there are holes in the receive
5188 * space for instance)
5189 * PSH flag is ignored.
5192 if ((tcp_flag_word(th) & TCP_HP_BITS) == tp->pred_flags &&
5193 TCP_SKB_CB(skb)->seq == tp->rcv_nxt &&
5194 !after(TCP_SKB_CB(skb)->ack_seq, tp->snd_nxt)) {
5195 int tcp_header_len = tp->tcp_header_len;
5197 /* Timestamp header prediction: tcp_header_len
5198 * is automatically equal to th->doff*4 due to pred_flags
5202 /* Check timestamp */
5203 if (tcp_header_len == sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) {
5204 /* No? Slow path! */
5205 if (!tcp_parse_aligned_timestamp(tp, th))
5208 /* If PAWS failed, check it more carefully in slow path */
5209 if ((s32)(tp->rx_opt.rcv_tsval - tp->rx_opt.ts_recent) < 0)
5212 /* DO NOT update ts_recent here, if checksum fails
5213 * and timestamp was corrupted part, it will result
5214 * in a hung connection since we will drop all
5215 * future packets due to the PAWS test.
5219 if (len <= tcp_header_len) {
5220 /* Bulk data transfer: sender */
5221 if (len == tcp_header_len) {
5222 /* Predicted packet is in window by definition.
5223 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
5224 * Hence, check seq<=rcv_wup reduces to:
5226 if (tcp_header_len ==
5227 (sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) &&
5228 tp->rcv_nxt == tp->rcv_wup)
5229 tcp_store_ts_recent(tp);
5231 /* We know that such packets are checksummed
5234 tcp_ack(sk, skb, 0);
5236 tcp_data_snd_check(sk);
5238 } else { /* Header too small */
5239 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_INERRS);
5244 bool fragstolen = false;
5246 if (tp->ucopy.task == current &&
5247 tp->copied_seq == tp->rcv_nxt &&
5248 len - tcp_header_len <= tp->ucopy.len &&
5249 sock_owned_by_user(sk)) {
5250 __set_current_state(TASK_RUNNING);
5252 if (!tcp_copy_to_iovec(sk, skb, tcp_header_len)) {
5253 /* Predicted packet is in window by definition.
5254 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
5255 * Hence, check seq<=rcv_wup reduces to:
5257 if (tcp_header_len ==
5258 (sizeof(struct tcphdr) +
5259 TCPOLEN_TSTAMP_ALIGNED) &&
5260 tp->rcv_nxt == tp->rcv_wup)
5261 tcp_store_ts_recent(tp);
5263 tcp_rcv_rtt_measure_ts(sk, skb);
5265 __skb_pull(skb, tcp_header_len);
5266 tcp_rcv_nxt_update(tp, TCP_SKB_CB(skb)->end_seq);
5267 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPHPHITSTOUSER);
5272 if (tcp_checksum_complete_user(sk, skb))
5275 if ((int)skb->truesize > sk->sk_forward_alloc)
5278 /* Predicted packet is in window by definition.
5279 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
5280 * Hence, check seq<=rcv_wup reduces to:
5282 if (tcp_header_len ==
5283 (sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED) &&
5284 tp->rcv_nxt == tp->rcv_wup)
5285 tcp_store_ts_recent(tp);
5287 tcp_rcv_rtt_measure_ts(sk, skb);
5289 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPHPHITS);
5291 /* Bulk data transfer: receiver */
5292 eaten = tcp_queue_rcv(sk, skb, tcp_header_len,
5296 tcp_event_data_recv(sk, skb);
5298 if (TCP_SKB_CB(skb)->ack_seq != tp->snd_una) {
5299 /* Well, only one small jumplet in fast path... */
5300 tcp_ack(sk, skb, FLAG_DATA);
5301 tcp_data_snd_check(sk);
5302 if (!inet_csk_ack_scheduled(sk))
5306 __tcp_ack_snd_check(sk, 0);
5309 kfree_skb_partial(skb, fragstolen);
5310 sk->sk_data_ready(sk);
5316 if (len < (th->doff << 2) || tcp_checksum_complete_user(sk, skb))
5319 if (!th->ack && !th->rst && !th->syn)
5323 * Standard slow path.
5326 if (!tcp_validate_incoming(sk, skb, th, 1))
5330 if (tcp_ack(sk, skb, FLAG_SLOWPATH | FLAG_UPDATE_TS_RECENT) < 0)
5333 tcp_rcv_rtt_measure_ts(sk, skb);
5335 /* Process urgent data. */
5336 tcp_urg(sk, skb, th);
5338 /* step 7: process the segment text */
5339 tcp_data_queue(sk, skb);
5341 tcp_data_snd_check(sk);
5342 tcp_ack_snd_check(sk);
5346 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_CSUMERRORS);
5347 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_INERRS);
5352 EXPORT_SYMBOL(tcp_rcv_established);
5354 void tcp_finish_connect(struct sock *sk, struct sk_buff *skb)
5356 struct tcp_sock *tp = tcp_sk(sk);
5357 struct inet_connection_sock *icsk = inet_csk(sk);
5359 tcp_set_state(sk, TCP_ESTABLISHED);
5362 icsk->icsk_af_ops->sk_rx_dst_set(sk, skb);
5363 security_inet_conn_established(sk, skb);
5366 /* Make sure socket is routed, for correct metrics. */
5367 icsk->icsk_af_ops->rebuild_header(sk);
5369 tcp_init_metrics(sk);
5371 tcp_init_congestion_control(sk);
5373 /* Prevent spurious tcp_cwnd_restart() on first data
5376 tp->lsndtime = tcp_time_stamp;
5378 tcp_init_buffer_space(sk);
5380 if (sock_flag(sk, SOCK_KEEPOPEN))
5381 inet_csk_reset_keepalive_timer(sk, keepalive_time_when(tp));
5383 if (!tp->rx_opt.snd_wscale)
5384 __tcp_fast_path_on(tp, tp->snd_wnd);
5388 if (!sock_flag(sk, SOCK_DEAD)) {
5389 sk->sk_state_change(sk);
5390 sk_wake_async(sk, SOCK_WAKE_IO, POLL_OUT);
5394 static bool tcp_rcv_fastopen_synack(struct sock *sk, struct sk_buff *synack,
5395 struct tcp_fastopen_cookie *cookie)
5397 struct tcp_sock *tp = tcp_sk(sk);
5398 struct sk_buff *data = tp->syn_data ? tcp_write_queue_head(sk) : NULL;
5399 u16 mss = tp->rx_opt.mss_clamp, try_exp = 0;
5400 bool syn_drop = false;
5402 if (mss == tp->rx_opt.user_mss) {
5403 struct tcp_options_received opt;
5405 /* Get original SYNACK MSS value if user MSS sets mss_clamp */
5406 tcp_clear_options(&opt);
5407 opt.user_mss = opt.mss_clamp = 0;
5408 tcp_parse_options(synack, &opt, 0, NULL);
5409 mss = opt.mss_clamp;
5412 if (!tp->syn_fastopen) {
5413 /* Ignore an unsolicited cookie */
5415 } else if (tp->total_retrans) {
5416 /* SYN timed out and the SYN-ACK neither has a cookie nor
5417 * acknowledges data. Presumably the remote received only
5418 * the retransmitted (regular) SYNs: either the original
5419 * SYN-data or the corresponding SYN-ACK was dropped.
5421 syn_drop = (cookie->len < 0 && data);
5422 } else if (cookie->len < 0 && !tp->syn_data) {
5423 /* We requested a cookie but didn't get it. If we did not use
5424 * the (old) exp opt format then try so next time (try_exp=1).
5425 * Otherwise we go back to use the RFC7413 opt (try_exp=2).
5427 try_exp = tp->syn_fastopen_exp ? 2 : 1;
5430 tcp_fastopen_cache_set(sk, mss, cookie, syn_drop, try_exp);
5432 if (data) { /* Retransmit unacked data in SYN */
5433 tcp_for_write_queue_from(data, sk) {
5434 if (data == tcp_send_head(sk) ||
5435 __tcp_retransmit_skb(sk, data))
5439 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPFASTOPENACTIVEFAIL);
5442 tp->syn_data_acked = tp->syn_data;
5443 if (tp->syn_data_acked)
5444 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPFASTOPENACTIVE);
5448 static int tcp_rcv_synsent_state_process(struct sock *sk, struct sk_buff *skb,
5449 const struct tcphdr *th, unsigned int len)
5451 struct inet_connection_sock *icsk = inet_csk(sk);
5452 struct tcp_sock *tp = tcp_sk(sk);
5453 struct tcp_fastopen_cookie foc = { .len = -1 };
5454 int saved_clamp = tp->rx_opt.mss_clamp;
5456 tcp_parse_options(skb, &tp->rx_opt, 0, &foc);
5457 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr)
5458 tp->rx_opt.rcv_tsecr -= tp->tsoffset;
5462 * "If the state is SYN-SENT then
5463 * first check the ACK bit
5464 * If the ACK bit is set
5465 * If SEG.ACK =< ISS, or SEG.ACK > SND.NXT, send
5466 * a reset (unless the RST bit is set, if so drop
5467 * the segment and return)"
5469 if (!after(TCP_SKB_CB(skb)->ack_seq, tp->snd_una) ||
5470 after(TCP_SKB_CB(skb)->ack_seq, tp->snd_nxt))
5471 goto reset_and_undo;
5473 if (tp->rx_opt.saw_tstamp && tp->rx_opt.rcv_tsecr &&
5474 !between(tp->rx_opt.rcv_tsecr, tp->retrans_stamp,
5476 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_PAWSACTIVEREJECTED);
5477 goto reset_and_undo;
5480 /* Now ACK is acceptable.
5482 * "If the RST bit is set
5483 * If the ACK was acceptable then signal the user "error:
5484 * connection reset", drop the segment, enter CLOSED state,
5485 * delete TCB, and return."
5494 * "fifth, if neither of the SYN or RST bits is set then
5495 * drop the segment and return."
5501 goto discard_and_undo;
5504 * "If the SYN bit is on ...
5505 * are acceptable then ...
5506 * (our SYN has been ACKed), change the connection
5507 * state to ESTABLISHED..."
5510 tcp_ecn_rcv_synack(tp, th);
5512 tcp_init_wl(tp, TCP_SKB_CB(skb)->seq);
5513 tcp_ack(sk, skb, FLAG_SLOWPATH);
5515 /* Ok.. it's good. Set up sequence numbers and
5516 * move to established.
5518 tp->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
5519 tp->rcv_wup = TCP_SKB_CB(skb)->seq + 1;
5521 /* RFC1323: The window in SYN & SYN/ACK segments is
5524 tp->snd_wnd = ntohs(th->window);
5526 if (!tp->rx_opt.wscale_ok) {
5527 tp->rx_opt.snd_wscale = tp->rx_opt.rcv_wscale = 0;
5528 tp->window_clamp = min(tp->window_clamp, 65535U);
5531 if (tp->rx_opt.saw_tstamp) {
5532 tp->rx_opt.tstamp_ok = 1;
5533 tp->tcp_header_len =
5534 sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED;
5535 tp->advmss -= TCPOLEN_TSTAMP_ALIGNED;
5536 tcp_store_ts_recent(tp);
5538 tp->tcp_header_len = sizeof(struct tcphdr);
5541 if (tcp_is_sack(tp) && sysctl_tcp_fack)
5542 tcp_enable_fack(tp);
5545 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
5546 tcp_initialize_rcv_mss(sk);
5548 /* Remember, tcp_poll() does not lock socket!
5549 * Change state from SYN-SENT only after copied_seq
5550 * is initialized. */
5551 tp->copied_seq = tp->rcv_nxt;
5555 tcp_finish_connect(sk, skb);
5557 if ((tp->syn_fastopen || tp->syn_data) &&
5558 tcp_rcv_fastopen_synack(sk, skb, &foc))
5561 if (sk->sk_write_pending ||
5562 icsk->icsk_accept_queue.rskq_defer_accept ||
5563 icsk->icsk_ack.pingpong) {
5564 /* Save one ACK. Data will be ready after
5565 * several ticks, if write_pending is set.
5567 * It may be deleted, but with this feature tcpdumps
5568 * look so _wonderfully_ clever, that I was not able
5569 * to stand against the temptation 8) --ANK
5571 inet_csk_schedule_ack(sk);
5572 icsk->icsk_ack.lrcvtime = tcp_time_stamp;
5573 tcp_enter_quickack_mode(sk);
5574 inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK,
5575 TCP_DELACK_MAX, TCP_RTO_MAX);
5586 /* No ACK in the segment */
5590 * "If the RST bit is set
5592 * Otherwise (no ACK) drop the segment and return."
5595 goto discard_and_undo;
5599 if (tp->rx_opt.ts_recent_stamp && tp->rx_opt.saw_tstamp &&
5600 tcp_paws_reject(&tp->rx_opt, 0))
5601 goto discard_and_undo;
5604 /* We see SYN without ACK. It is attempt of
5605 * simultaneous connect with crossed SYNs.
5606 * Particularly, it can be connect to self.
5608 tcp_set_state(sk, TCP_SYN_RECV);
5610 if (tp->rx_opt.saw_tstamp) {
5611 tp->rx_opt.tstamp_ok = 1;
5612 tcp_store_ts_recent(tp);
5613 tp->tcp_header_len =
5614 sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED;
5616 tp->tcp_header_len = sizeof(struct tcphdr);
5619 tp->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
5620 tp->rcv_wup = TCP_SKB_CB(skb)->seq + 1;
5622 /* RFC1323: The window in SYN & SYN/ACK segments is
5625 tp->snd_wnd = ntohs(th->window);
5626 tp->snd_wl1 = TCP_SKB_CB(skb)->seq;
5627 tp->max_window = tp->snd_wnd;
5629 tcp_ecn_rcv_syn(tp, th);
5632 tcp_sync_mss(sk, icsk->icsk_pmtu_cookie);
5633 tcp_initialize_rcv_mss(sk);
5635 tcp_send_synack(sk);
5637 /* Note, we could accept data and URG from this segment.
5638 * There are no obstacles to make this (except that we must
5639 * either change tcp_recvmsg() to prevent it from returning data
5640 * before 3WHS completes per RFC793, or employ TCP Fast Open).
5642 * However, if we ignore data in ACKless segments sometimes,
5643 * we have no reasons to accept it sometimes.
5644 * Also, seems the code doing it in step6 of tcp_rcv_state_process
5645 * is not flawless. So, discard packet for sanity.
5646 * Uncomment this return to process the data.
5653 /* "fifth, if neither of the SYN or RST bits is set then
5654 * drop the segment and return."
5658 tcp_clear_options(&tp->rx_opt);
5659 tp->rx_opt.mss_clamp = saved_clamp;
5663 tcp_clear_options(&tp->rx_opt);
5664 tp->rx_opt.mss_clamp = saved_clamp;
5669 * This function implements the receiving procedure of RFC 793 for
5670 * all states except ESTABLISHED and TIME_WAIT.
5671 * It's called from both tcp_v4_rcv and tcp_v6_rcv and should be
5672 * address independent.
5675 int tcp_rcv_state_process(struct sock *sk, struct sk_buff *skb,
5676 const struct tcphdr *th, unsigned int len)
5678 struct tcp_sock *tp = tcp_sk(sk);
5679 struct inet_connection_sock *icsk = inet_csk(sk);
5680 struct request_sock *req;
5685 tp->rx_opt.saw_tstamp = 0;
5687 switch (sk->sk_state) {
5701 if (icsk->icsk_af_ops->conn_request(sk, skb) < 0)
5704 /* Now we have several options: In theory there is
5705 * nothing else in the frame. KA9Q has an option to
5706 * send data with the syn, BSD accepts data with the
5707 * syn up to the [to be] advertised window and
5708 * Solaris 2.1 gives you a protocol error. For now
5709 * we just ignore it, that fits the spec precisely
5710 * and avoids incompatibilities. It would be nice in
5711 * future to drop through and process the data.
5713 * Now that TTCP is starting to be used we ought to
5715 * But, this leaves one open to an easy denial of
5716 * service attack, and SYN cookies can't defend
5717 * against this problem. So, we drop the data
5718 * in the interest of security over speed unless
5719 * it's still in use.
5727 queued = tcp_rcv_synsent_state_process(sk, skb, th, len);
5731 /* Do step6 onward by hand. */
5732 tcp_urg(sk, skb, th);
5734 tcp_data_snd_check(sk);
5738 req = tp->fastopen_rsk;
5740 WARN_ON_ONCE(sk->sk_state != TCP_SYN_RECV &&
5741 sk->sk_state != TCP_FIN_WAIT1);
5743 if (!tcp_check_req(sk, skb, req, true))
5747 if (!th->ack && !th->rst && !th->syn)
5750 if (!tcp_validate_incoming(sk, skb, th, 0))
5753 /* step 5: check the ACK field */
5754 acceptable = tcp_ack(sk, skb, FLAG_SLOWPATH |
5755 FLAG_UPDATE_TS_RECENT) > 0;
5757 switch (sk->sk_state) {
5762 /* Once we leave TCP_SYN_RECV, we no longer need req
5766 synack_stamp = tcp_rsk(req)->snt_synack;
5767 tp->total_retrans = req->num_retrans;
5768 reqsk_fastopen_remove(sk, req, false);
5770 synack_stamp = tp->lsndtime;
5771 /* Make sure socket is routed, for correct metrics. */
5772 icsk->icsk_af_ops->rebuild_header(sk);
5773 tcp_init_congestion_control(sk);
5776 tp->copied_seq = tp->rcv_nxt;
5777 tcp_init_buffer_space(sk);
5780 tcp_set_state(sk, TCP_ESTABLISHED);
5781 sk->sk_state_change(sk);
5783 /* Note, that this wakeup is only for marginal crossed SYN case.
5784 * Passively open sockets are not waked up, because
5785 * sk->sk_sleep == NULL and sk->sk_socket == NULL.
5788 sk_wake_async(sk, SOCK_WAKE_IO, POLL_OUT);
5790 tp->snd_una = TCP_SKB_CB(skb)->ack_seq;
5791 tp->snd_wnd = ntohs(th->window) << tp->rx_opt.snd_wscale;
5792 tcp_init_wl(tp, TCP_SKB_CB(skb)->seq);
5793 tcp_synack_rtt_meas(sk, synack_stamp);
5795 if (tp->rx_opt.tstamp_ok)
5796 tp->advmss -= TCPOLEN_TSTAMP_ALIGNED;
5799 /* Re-arm the timer because data may have been sent out.
5800 * This is similar to the regular data transmission case
5801 * when new data has just been ack'ed.
5803 * (TFO) - we could try to be more aggressive and
5804 * retransmitting any data sooner based on when they
5809 tcp_init_metrics(sk);
5811 tcp_update_pacing_rate(sk);
5813 /* Prevent spurious tcp_cwnd_restart() on first data packet */
5814 tp->lsndtime = tcp_time_stamp;
5816 tcp_initialize_rcv_mss(sk);
5817 tcp_fast_path_on(tp);
5820 case TCP_FIN_WAIT1: {
5821 struct dst_entry *dst;
5824 /* If we enter the TCP_FIN_WAIT1 state and we are a
5825 * Fast Open socket and this is the first acceptable
5826 * ACK we have received, this would have acknowledged
5827 * our SYNACK so stop the SYNACK timer.
5830 /* Return RST if ack_seq is invalid.
5831 * Note that RFC793 only says to generate a
5832 * DUPACK for it but for TCP Fast Open it seems
5833 * better to treat this case like TCP_SYN_RECV
5838 /* We no longer need the request sock. */
5839 reqsk_fastopen_remove(sk, req, false);
5842 if (tp->snd_una != tp->write_seq)
5845 tcp_set_state(sk, TCP_FIN_WAIT2);
5846 sk->sk_shutdown |= SEND_SHUTDOWN;
5848 dst = __sk_dst_get(sk);
5852 if (!sock_flag(sk, SOCK_DEAD)) {
5853 /* Wake up lingering close() */
5854 sk->sk_state_change(sk);
5858 if (tp->linger2 < 0 ||
5859 (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
5860 after(TCP_SKB_CB(skb)->end_seq - th->fin, tp->rcv_nxt))) {
5862 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPABORTONDATA);
5866 tmo = tcp_fin_time(sk);
5867 if (tmo > TCP_TIMEWAIT_LEN) {
5868 inet_csk_reset_keepalive_timer(sk, tmo - TCP_TIMEWAIT_LEN);
5869 } else if (th->fin || sock_owned_by_user(sk)) {
5870 /* Bad case. We could lose such FIN otherwise.
5871 * It is not a big problem, but it looks confusing
5872 * and not so rare event. We still can lose it now,
5873 * if it spins in bh_lock_sock(), but it is really
5876 inet_csk_reset_keepalive_timer(sk, tmo);
5878 tcp_time_wait(sk, TCP_FIN_WAIT2, tmo);
5885 if (tp->snd_una == tp->write_seq) {
5886 tcp_time_wait(sk, TCP_TIME_WAIT, 0);
5892 if (tp->snd_una == tp->write_seq) {
5893 tcp_update_metrics(sk);
5900 /* step 6: check the URG bit */
5901 tcp_urg(sk, skb, th);
5903 /* step 7: process the segment text */
5904 switch (sk->sk_state) {
5905 case TCP_CLOSE_WAIT:
5908 if (!before(TCP_SKB_CB(skb)->seq, tp->rcv_nxt))
5912 /* RFC 793 says to queue data in these states,
5913 * RFC 1122 says we MUST send a reset.
5914 * BSD 4.4 also does reset.
5916 if (sk->sk_shutdown & RCV_SHUTDOWN) {
5917 if (TCP_SKB_CB(skb)->end_seq != TCP_SKB_CB(skb)->seq &&
5918 after(TCP_SKB_CB(skb)->end_seq - th->fin, tp->rcv_nxt)) {
5919 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPABORTONDATA);
5925 case TCP_ESTABLISHED:
5926 tcp_data_queue(sk, skb);
5931 /* tcp_data could move socket to TIME-WAIT */
5932 if (sk->sk_state != TCP_CLOSE) {
5933 tcp_data_snd_check(sk);
5934 tcp_ack_snd_check(sk);
5943 EXPORT_SYMBOL(tcp_rcv_state_process);
5945 static inline void pr_drop_req(struct request_sock *req, __u16 port, int family)
5947 struct inet_request_sock *ireq = inet_rsk(req);
5949 if (family == AF_INET)
5950 net_dbg_ratelimited("drop open request from %pI4/%u\n",
5951 &ireq->ir_rmt_addr, port);
5952 #if IS_ENABLED(CONFIG_IPV6)
5953 else if (family == AF_INET6)
5954 net_dbg_ratelimited("drop open request from %pI6/%u\n",
5955 &ireq->ir_v6_rmt_addr, port);
5959 /* RFC3168 : 6.1.1 SYN packets must not have ECT/ECN bits set
5961 * If we receive a SYN packet with these bits set, it means a
5962 * network is playing bad games with TOS bits. In order to
5963 * avoid possible false congestion notifications, we disable
5964 * TCP ECN negotiation.
5966 * Exception: tcp_ca wants ECN. This is required for DCTCP
5967 * congestion control: Linux DCTCP asserts ECT on all packets,
5968 * including SYN, which is most optimal solution; however,
5969 * others, such as FreeBSD do not.
5971 static void tcp_ecn_create_request(struct request_sock *req,
5972 const struct sk_buff *skb,
5973 const struct sock *listen_sk,
5974 const struct dst_entry *dst)
5976 const struct tcphdr *th = tcp_hdr(skb);
5977 const struct net *net = sock_net(listen_sk);
5978 bool th_ecn = th->ece && th->cwr;
5984 ect = !INET_ECN_is_not_ect(TCP_SKB_CB(skb)->ip_dsfield);
5985 ecn_ok = net->ipv4.sysctl_tcp_ecn || dst_feature(dst, RTAX_FEATURE_ECN);
5987 if ((!ect && ecn_ok) || tcp_ca_needs_ecn(listen_sk))
5988 inet_rsk(req)->ecn_ok = 1;
5991 static void tcp_openreq_init(struct request_sock *req,
5992 const struct tcp_options_received *rx_opt,
5993 struct sk_buff *skb, const struct sock *sk)
5995 struct inet_request_sock *ireq = inet_rsk(req);
5997 req->rcv_wnd = 0; /* So that tcp_send_synack() knows! */
5999 tcp_rsk(req)->rcv_isn = TCP_SKB_CB(skb)->seq;
6000 tcp_rsk(req)->rcv_nxt = TCP_SKB_CB(skb)->seq + 1;
6001 tcp_rsk(req)->snt_synack = tcp_time_stamp;
6002 tcp_rsk(req)->last_oow_ack_time = 0;
6003 req->mss = rx_opt->mss_clamp;
6004 req->ts_recent = rx_opt->saw_tstamp ? rx_opt->rcv_tsval : 0;
6005 ireq->tstamp_ok = rx_opt->tstamp_ok;
6006 ireq->sack_ok = rx_opt->sack_ok;
6007 ireq->snd_wscale = rx_opt->snd_wscale;
6008 ireq->wscale_ok = rx_opt->wscale_ok;
6011 ireq->ir_rmt_port = tcp_hdr(skb)->source;
6012 ireq->ir_num = ntohs(tcp_hdr(skb)->dest);
6013 ireq->ir_mark = inet_request_mark(sk, skb);
6016 struct request_sock *inet_reqsk_alloc(const struct request_sock_ops *ops,
6017 struct sock *sk_listener)
6019 struct request_sock *req = reqsk_alloc(ops, sk_listener);
6022 struct inet_request_sock *ireq = inet_rsk(req);
6024 kmemcheck_annotate_bitfield(ireq, flags);
6026 atomic64_set(&ireq->ir_cookie, 0);
6027 ireq->ireq_state = TCP_NEW_SYN_RECV;
6028 write_pnet(&ireq->ireq_net, sock_net(sk_listener));
6029 ireq->ireq_family = sk_listener->sk_family;
6034 EXPORT_SYMBOL(inet_reqsk_alloc);
6037 * Return true if a syncookie should be sent
6039 static bool tcp_syn_flood_action(struct sock *sk,
6040 const struct sk_buff *skb,
6043 const char *msg = "Dropping request";
6044 bool want_cookie = false;
6045 struct listen_sock *lopt;
6047 #ifdef CONFIG_SYN_COOKIES
6048 if (sysctl_tcp_syncookies) {
6049 msg = "Sending cookies";
6051 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPREQQFULLDOCOOKIES);
6054 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPREQQFULLDROP);
6056 lopt = inet_csk(sk)->icsk_accept_queue.listen_opt;
6057 if (!lopt->synflood_warned && sysctl_tcp_syncookies != 2) {
6058 lopt->synflood_warned = 1;
6059 pr_info("%s: Possible SYN flooding on port %d. %s. Check SNMP counters.\n",
6060 proto, ntohs(tcp_hdr(skb)->dest), msg);
6065 static void tcp_reqsk_record_syn(const struct sock *sk,
6066 struct request_sock *req,
6067 const struct sk_buff *skb)
6069 if (tcp_sk(sk)->save_syn) {
6070 u32 len = skb_network_header_len(skb) + tcp_hdrlen(skb);
6073 copy = kmalloc(len + sizeof(u32), GFP_ATOMIC);
6076 memcpy(©[1], skb_network_header(skb), len);
6077 req->saved_syn = copy;
6082 int tcp_conn_request(struct request_sock_ops *rsk_ops,
6083 const struct tcp_request_sock_ops *af_ops,
6084 struct sock *sk, struct sk_buff *skb)
6086 struct tcp_options_received tmp_opt;
6087 struct request_sock *req;
6088 struct tcp_sock *tp = tcp_sk(sk);
6089 struct dst_entry *dst = NULL;
6090 __u32 isn = TCP_SKB_CB(skb)->tcp_tw_isn;
6091 bool want_cookie = false, fastopen;
6093 struct tcp_fastopen_cookie foc = { .len = -1 };
6097 /* TW buckets are converted to open requests without
6098 * limitations, they conserve resources and peer is
6099 * evidently real one.
6101 if ((sysctl_tcp_syncookies == 2 ||
6102 inet_csk_reqsk_queue_is_full(sk)) && !isn) {
6103 want_cookie = tcp_syn_flood_action(sk, skb, rsk_ops->slab_name);
6109 /* Accept backlog is full. If we have already queued enough
6110 * of warm entries in syn queue, drop request. It is better than
6111 * clogging syn queue with openreqs with exponentially increasing
6114 if (sk_acceptq_is_full(sk) && inet_csk_reqsk_queue_young(sk) > 1) {
6115 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_LISTENOVERFLOWS);
6119 req = inet_reqsk_alloc(rsk_ops, sk);
6123 tcp_rsk(req)->af_specific = af_ops;
6125 tcp_clear_options(&tmp_opt);
6126 tmp_opt.mss_clamp = af_ops->mss_clamp;
6127 tmp_opt.user_mss = tp->rx_opt.user_mss;
6128 tcp_parse_options(skb, &tmp_opt, 0, want_cookie ? NULL : &foc);
6130 if (want_cookie && !tmp_opt.saw_tstamp)
6131 tcp_clear_options(&tmp_opt);
6133 tmp_opt.tstamp_ok = tmp_opt.saw_tstamp;
6134 tcp_openreq_init(req, &tmp_opt, skb, sk);
6136 /* Note: tcp_v6_init_req() might override ir_iif for link locals */
6137 inet_rsk(req)->ir_iif = sk->sk_bound_dev_if;
6139 af_ops->init_req(req, sk, skb);
6141 if (security_inet_conn_request(sk, skb, req))
6144 if (!want_cookie && !isn) {
6145 /* VJ's idea. We save last timestamp seen
6146 * from the destination in peer table, when entering
6147 * state TIME-WAIT, and check against it before
6148 * accepting new connection request.
6150 * If "isn" is not zero, this request hit alive
6151 * timewait bucket, so that all the necessary checks
6152 * are made in the function processing timewait state.
6154 if (tcp_death_row.sysctl_tw_recycle) {
6157 dst = af_ops->route_req(sk, &fl, req, &strict);
6159 if (dst && strict &&
6160 !tcp_peer_is_proven(req, dst, true,
6161 tmp_opt.saw_tstamp)) {
6162 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_PAWSPASSIVEREJECTED);
6163 goto drop_and_release;
6166 /* Kill the following clause, if you dislike this way. */
6167 else if (!sysctl_tcp_syncookies &&
6168 (sysctl_max_syn_backlog - inet_csk_reqsk_queue_len(sk) <
6169 (sysctl_max_syn_backlog >> 2)) &&
6170 !tcp_peer_is_proven(req, dst, false,
6171 tmp_opt.saw_tstamp)) {
6172 /* Without syncookies last quarter of
6173 * backlog is filled with destinations,
6174 * proven to be alive.
6175 * It means that we continue to communicate
6176 * to destinations, already remembered
6177 * to the moment of synflood.
6179 pr_drop_req(req, ntohs(tcp_hdr(skb)->source),
6181 goto drop_and_release;
6184 isn = af_ops->init_seq(skb);
6187 dst = af_ops->route_req(sk, &fl, req, NULL);
6192 tcp_ecn_create_request(req, skb, sk, dst);
6195 isn = cookie_init_sequence(af_ops, sk, skb, &req->mss);
6196 req->cookie_ts = tmp_opt.tstamp_ok;
6197 if (!tmp_opt.tstamp_ok)
6198 inet_rsk(req)->ecn_ok = 0;
6201 tcp_rsk(req)->snt_isn = isn;
6202 tcp_openreq_init_rwin(req, sk, dst);
6203 fastopen = !want_cookie &&
6204 tcp_try_fastopen(sk, skb, req, &foc, dst);
6205 err = af_ops->send_synack(sk, dst, &fl, req,
6206 skb_get_queue_mapping(skb), &foc);
6208 if (err || want_cookie)
6211 tcp_rsk(req)->tfo_listener = false;
6212 af_ops->queue_hash_add(sk, req, TCP_TIMEOUT_INIT);
6214 tcp_reqsk_record_syn(sk, req, skb);
6223 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_LISTENDROPS);
6226 EXPORT_SYMBOL(tcp_conn_request);