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>
73 #include <net/inet_common.h>
74 #include <linux/ipsec.h>
75 #include <asm/unaligned.h>
76 #include <net/netdma.h>
78 int sysctl_tcp_timestamps __read_mostly
= 1;
79 int sysctl_tcp_window_scaling __read_mostly
= 1;
80 int sysctl_tcp_sack __read_mostly
= 1;
81 int sysctl_tcp_fack __read_mostly
= 1;
82 int sysctl_tcp_reordering __read_mostly
= TCP_FASTRETRANS_THRESH
;
83 EXPORT_SYMBOL(sysctl_tcp_reordering
);
84 int sysctl_tcp_dsack __read_mostly
= 1;
85 int sysctl_tcp_app_win __read_mostly
= 31;
86 int sysctl_tcp_adv_win_scale __read_mostly
= 1;
87 EXPORT_SYMBOL(sysctl_tcp_adv_win_scale
);
89 /* rfc5961 challenge ack rate limiting */
90 int sysctl_tcp_challenge_ack_limit
= 100;
92 int sysctl_tcp_stdurg __read_mostly
;
93 int sysctl_tcp_rfc1337 __read_mostly
;
94 int sysctl_tcp_max_orphans __read_mostly
= NR_FILE
;
95 int sysctl_tcp_frto __read_mostly
= 2;
97 int sysctl_tcp_thin_dupack __read_mostly
;
99 int sysctl_tcp_moderate_rcvbuf __read_mostly
= 1;
100 int sysctl_tcp_early_retrans __read_mostly
= 3;
102 #define FLAG_DATA 0x01 /* Incoming frame contained data. */
103 #define FLAG_WIN_UPDATE 0x02 /* Incoming ACK was a window update. */
104 #define FLAG_DATA_ACKED 0x04 /* This ACK acknowledged new data. */
105 #define FLAG_RETRANS_DATA_ACKED 0x08 /* "" "" some of which was retransmitted. */
106 #define FLAG_SYN_ACKED 0x10 /* This ACK acknowledged SYN. */
107 #define FLAG_DATA_SACKED 0x20 /* New SACK. */
108 #define FLAG_ECE 0x40 /* ECE in this ACK */
109 #define FLAG_SLOWPATH 0x100 /* Do not skip RFC checks for window update.*/
110 #define FLAG_ORIG_SACK_ACKED 0x200 /* Never retransmitted data are (s)acked */
111 #define FLAG_SND_UNA_ADVANCED 0x400 /* Snd_una was changed (!= FLAG_DATA_ACKED) */
112 #define FLAG_DSACKING_ACK 0x800 /* SACK blocks contained D-SACK info */
113 #define FLAG_SACK_RENEGING 0x2000 /* snd_una advanced to a sacked seq */
114 #define FLAG_UPDATE_TS_RECENT 0x4000 /* tcp_replace_ts_recent() */
116 #define FLAG_ACKED (FLAG_DATA_ACKED|FLAG_SYN_ACKED)
117 #define FLAG_NOT_DUP (FLAG_DATA|FLAG_WIN_UPDATE|FLAG_ACKED)
118 #define FLAG_CA_ALERT (FLAG_DATA_SACKED|FLAG_ECE)
119 #define FLAG_FORWARD_PROGRESS (FLAG_ACKED|FLAG_DATA_SACKED)
121 #define TCP_REMNANT (TCP_FLAG_FIN|TCP_FLAG_URG|TCP_FLAG_SYN|TCP_FLAG_PSH)
122 #define TCP_HP_BITS (~(TCP_RESERVED_BITS|TCP_FLAG_PSH))
124 /* Adapt the MSS value used to make delayed ack decision to the
127 static void tcp_measure_rcv_mss(struct sock
*sk
, const struct sk_buff
*skb
)
129 struct inet_connection_sock
*icsk
= inet_csk(sk
);
130 const unsigned int lss
= icsk
->icsk_ack
.last_seg_size
;
133 icsk
->icsk_ack
.last_seg_size
= 0;
135 /* skb->len may jitter because of SACKs, even if peer
136 * sends good full-sized frames.
138 len
= skb_shinfo(skb
)->gso_size
? : skb
->len
;
139 if (len
>= icsk
->icsk_ack
.rcv_mss
) {
140 icsk
->icsk_ack
.rcv_mss
= len
;
142 /* Otherwise, we make more careful check taking into account,
143 * that SACKs block is variable.
145 * "len" is invariant segment length, including TCP header.
147 len
+= skb
->data
- skb_transport_header(skb
);
148 if (len
>= TCP_MSS_DEFAULT
+ sizeof(struct tcphdr
) ||
149 /* If PSH is not set, packet should be
150 * full sized, provided peer TCP is not badly broken.
151 * This observation (if it is correct 8)) allows
152 * to handle super-low mtu links fairly.
154 (len
>= TCP_MIN_MSS
+ sizeof(struct tcphdr
) &&
155 !(tcp_flag_word(tcp_hdr(skb
)) & TCP_REMNANT
))) {
156 /* Subtract also invariant (if peer is RFC compliant),
157 * tcp header plus fixed timestamp option length.
158 * Resulting "len" is MSS free of SACK jitter.
160 len
-= tcp_sk(sk
)->tcp_header_len
;
161 icsk
->icsk_ack
.last_seg_size
= len
;
163 icsk
->icsk_ack
.rcv_mss
= len
;
167 if (icsk
->icsk_ack
.pending
& ICSK_ACK_PUSHED
)
168 icsk
->icsk_ack
.pending
|= ICSK_ACK_PUSHED2
;
169 icsk
->icsk_ack
.pending
|= ICSK_ACK_PUSHED
;
173 static void tcp_incr_quickack(struct sock
*sk
)
175 struct inet_connection_sock
*icsk
= inet_csk(sk
);
176 unsigned int quickacks
= tcp_sk(sk
)->rcv_wnd
/ (2 * icsk
->icsk_ack
.rcv_mss
);
180 if (quickacks
> icsk
->icsk_ack
.quick
)
181 icsk
->icsk_ack
.quick
= min(quickacks
, TCP_MAX_QUICKACKS
);
184 static void tcp_enter_quickack_mode(struct sock
*sk
)
186 struct inet_connection_sock
*icsk
= inet_csk(sk
);
187 tcp_incr_quickack(sk
);
188 icsk
->icsk_ack
.pingpong
= 0;
189 icsk
->icsk_ack
.ato
= TCP_ATO_MIN
;
192 /* Send ACKs quickly, if "quick" count is not exhausted
193 * and the session is not interactive.
196 static inline bool tcp_in_quickack_mode(const struct sock
*sk
)
198 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
200 return icsk
->icsk_ack
.quick
&& !icsk
->icsk_ack
.pingpong
;
203 static inline void TCP_ECN_queue_cwr(struct tcp_sock
*tp
)
205 if (tp
->ecn_flags
& TCP_ECN_OK
)
206 tp
->ecn_flags
|= TCP_ECN_QUEUE_CWR
;
209 static inline void TCP_ECN_accept_cwr(struct tcp_sock
*tp
, const struct sk_buff
*skb
)
211 if (tcp_hdr(skb
)->cwr
)
212 tp
->ecn_flags
&= ~TCP_ECN_DEMAND_CWR
;
215 static inline void TCP_ECN_withdraw_cwr(struct tcp_sock
*tp
)
217 tp
->ecn_flags
&= ~TCP_ECN_DEMAND_CWR
;
220 static inline void TCP_ECN_check_ce(struct tcp_sock
*tp
, const struct sk_buff
*skb
)
222 if (!(tp
->ecn_flags
& TCP_ECN_OK
))
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 (!(tp
->ecn_flags
& TCP_ECN_DEMAND_CWR
)) {
236 /* Better not delay acks, sender can have a very low cwnd */
237 tcp_enter_quickack_mode((struct sock
*)tp
);
238 tp
->ecn_flags
|= TCP_ECN_DEMAND_CWR
;
242 tp
->ecn_flags
|= TCP_ECN_SEEN
;
246 static inline void TCP_ECN_rcv_synack(struct tcp_sock
*tp
, const struct tcphdr
*th
)
248 if ((tp
->ecn_flags
& TCP_ECN_OK
) && (!th
->ece
|| th
->cwr
))
249 tp
->ecn_flags
&= ~TCP_ECN_OK
;
252 static inline void TCP_ECN_rcv_syn(struct tcp_sock
*tp
, const struct tcphdr
*th
)
254 if ((tp
->ecn_flags
& TCP_ECN_OK
) && (!th
->ece
|| !th
->cwr
))
255 tp
->ecn_flags
&= ~TCP_ECN_OK
;
258 static bool TCP_ECN_rcv_ecn_echo(const struct tcp_sock
*tp
, const struct tcphdr
*th
)
260 if (th
->ece
&& !th
->syn
&& (tp
->ecn_flags
& TCP_ECN_OK
))
265 /* Buffer size and advertised window tuning.
267 * 1. Tuning sk->sk_sndbuf, when connection enters established state.
270 static void tcp_fixup_sndbuf(struct sock
*sk
)
272 int sndmem
= SKB_TRUESIZE(tcp_sk(sk
)->rx_opt
.mss_clamp
+ MAX_TCP_HEADER
);
274 sndmem
*= TCP_INIT_CWND
;
275 if (sk
->sk_sndbuf
< sndmem
)
276 sk
->sk_sndbuf
= min(sndmem
, sysctl_tcp_wmem
[2]);
279 /* 2. Tuning advertised window (window_clamp, rcv_ssthresh)
281 * All tcp_full_space() is split to two parts: "network" buffer, allocated
282 * forward and advertised in receiver window (tp->rcv_wnd) and
283 * "application buffer", required to isolate scheduling/application
284 * latencies from network.
285 * window_clamp is maximal advertised window. It can be less than
286 * tcp_full_space(), in this case tcp_full_space() - window_clamp
287 * is reserved for "application" buffer. The less window_clamp is
288 * the smoother our behaviour from viewpoint of network, but the lower
289 * throughput and the higher sensitivity of the connection to losses. 8)
291 * rcv_ssthresh is more strict window_clamp used at "slow start"
292 * phase to predict further behaviour of this connection.
293 * It is used for two goals:
294 * - to enforce header prediction at sender, even when application
295 * requires some significant "application buffer". It is check #1.
296 * - to prevent pruning of receive queue because of misprediction
297 * of receiver window. Check #2.
299 * The scheme does not work when sender sends good segments opening
300 * window and then starts to feed us spaghetti. But it should work
301 * in common situations. Otherwise, we have to rely on queue collapsing.
304 /* Slow part of check#2. */
305 static int __tcp_grow_window(const struct sock
*sk
, const struct sk_buff
*skb
)
307 struct tcp_sock
*tp
= tcp_sk(sk
);
309 int truesize
= tcp_win_from_space(skb
->truesize
) >> 1;
310 int window
= tcp_win_from_space(sysctl_tcp_rmem
[2]) >> 1;
312 while (tp
->rcv_ssthresh
<= window
) {
313 if (truesize
<= skb
->len
)
314 return 2 * inet_csk(sk
)->icsk_ack
.rcv_mss
;
322 static void tcp_grow_window(struct sock
*sk
, const struct sk_buff
*skb
)
324 struct tcp_sock
*tp
= tcp_sk(sk
);
327 if (tp
->rcv_ssthresh
< tp
->window_clamp
&&
328 (int)tp
->rcv_ssthresh
< tcp_space(sk
) &&
329 !sk_under_memory_pressure(sk
)) {
332 /* Check #2. Increase window, if skb with such overhead
333 * will fit to rcvbuf in future.
335 if (tcp_win_from_space(skb
->truesize
) <= skb
->len
)
336 incr
= 2 * tp
->advmss
;
338 incr
= __tcp_grow_window(sk
, skb
);
341 incr
= max_t(int, incr
, 2 * skb
->len
);
342 tp
->rcv_ssthresh
= min(tp
->rcv_ssthresh
+ incr
,
344 inet_csk(sk
)->icsk_ack
.quick
|= 1;
349 /* 3. Tuning rcvbuf, when connection enters established state. */
351 static void tcp_fixup_rcvbuf(struct sock
*sk
)
353 u32 mss
= tcp_sk(sk
)->advmss
;
354 u32 icwnd
= TCP_DEFAULT_INIT_RCVWND
;
357 /* Limit to 10 segments if mss <= 1460,
358 * or 14600/mss segments, with a minimum of two segments.
361 icwnd
= max_t(u32
, (1460 * TCP_DEFAULT_INIT_RCVWND
) / mss
, 2);
363 rcvmem
= SKB_TRUESIZE(mss
+ MAX_TCP_HEADER
);
364 while (tcp_win_from_space(rcvmem
) < mss
)
369 if (sk
->sk_rcvbuf
< rcvmem
)
370 sk
->sk_rcvbuf
= min(rcvmem
, sysctl_tcp_rmem
[2]);
373 /* 4. Try to fixup all. It is made immediately after connection enters
376 void tcp_init_buffer_space(struct sock
*sk
)
378 struct tcp_sock
*tp
= tcp_sk(sk
);
381 if (!(sk
->sk_userlocks
& SOCK_RCVBUF_LOCK
))
382 tcp_fixup_rcvbuf(sk
);
383 if (!(sk
->sk_userlocks
& SOCK_SNDBUF_LOCK
))
384 tcp_fixup_sndbuf(sk
);
386 tp
->rcvq_space
.space
= tp
->rcv_wnd
;
388 maxwin
= tcp_full_space(sk
);
390 if (tp
->window_clamp
>= maxwin
) {
391 tp
->window_clamp
= maxwin
;
393 if (sysctl_tcp_app_win
&& maxwin
> 4 * tp
->advmss
)
394 tp
->window_clamp
= max(maxwin
-
395 (maxwin
>> sysctl_tcp_app_win
),
399 /* Force reservation of one segment. */
400 if (sysctl_tcp_app_win
&&
401 tp
->window_clamp
> 2 * tp
->advmss
&&
402 tp
->window_clamp
+ tp
->advmss
> maxwin
)
403 tp
->window_clamp
= max(2 * tp
->advmss
, maxwin
- tp
->advmss
);
405 tp
->rcv_ssthresh
= min(tp
->rcv_ssthresh
, tp
->window_clamp
);
406 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
409 /* 5. Recalculate window clamp after socket hit its memory bounds. */
410 static void tcp_clamp_window(struct sock
*sk
)
412 struct tcp_sock
*tp
= tcp_sk(sk
);
413 struct inet_connection_sock
*icsk
= inet_csk(sk
);
415 icsk
->icsk_ack
.quick
= 0;
417 if (sk
->sk_rcvbuf
< sysctl_tcp_rmem
[2] &&
418 !(sk
->sk_userlocks
& SOCK_RCVBUF_LOCK
) &&
419 !sk_under_memory_pressure(sk
) &&
420 sk_memory_allocated(sk
) < sk_prot_mem_limits(sk
, 0)) {
421 sk
->sk_rcvbuf
= min(atomic_read(&sk
->sk_rmem_alloc
),
424 if (atomic_read(&sk
->sk_rmem_alloc
) > sk
->sk_rcvbuf
)
425 tp
->rcv_ssthresh
= min(tp
->window_clamp
, 2U * tp
->advmss
);
428 /* Initialize RCV_MSS value.
429 * RCV_MSS is an our guess about MSS used by the peer.
430 * We haven't any direct information about the MSS.
431 * It's better to underestimate the RCV_MSS rather than overestimate.
432 * Overestimations make us ACKing less frequently than needed.
433 * Underestimations are more easy to detect and fix by tcp_measure_rcv_mss().
435 void tcp_initialize_rcv_mss(struct sock
*sk
)
437 const struct tcp_sock
*tp
= tcp_sk(sk
);
438 unsigned int hint
= min_t(unsigned int, tp
->advmss
, tp
->mss_cache
);
440 hint
= min(hint
, tp
->rcv_wnd
/ 2);
441 hint
= min(hint
, TCP_MSS_DEFAULT
);
442 hint
= max(hint
, TCP_MIN_MSS
);
444 inet_csk(sk
)->icsk_ack
.rcv_mss
= hint
;
446 EXPORT_SYMBOL(tcp_initialize_rcv_mss
);
448 /* Receiver "autotuning" code.
450 * The algorithm for RTT estimation w/o timestamps is based on
451 * Dynamic Right-Sizing (DRS) by Wu Feng and Mike Fisk of LANL.
452 * <http://public.lanl.gov/radiant/pubs.html#DRS>
454 * More detail on this code can be found at
455 * <http://staff.psc.edu/jheffner/>,
456 * though this reference is out of date. A new paper
459 static void tcp_rcv_rtt_update(struct tcp_sock
*tp
, u32 sample
, int win_dep
)
461 u32 new_sample
= tp
->rcv_rtt_est
.rtt
;
467 if (new_sample
!= 0) {
468 /* If we sample in larger samples in the non-timestamp
469 * case, we could grossly overestimate the RTT especially
470 * with chatty applications or bulk transfer apps which
471 * are stalled on filesystem I/O.
473 * Also, since we are only going for a minimum in the
474 * non-timestamp case, we do not smooth things out
475 * else with timestamps disabled convergence takes too
479 m
-= (new_sample
>> 3);
487 /* No previous measure. */
491 if (tp
->rcv_rtt_est
.rtt
!= new_sample
)
492 tp
->rcv_rtt_est
.rtt
= new_sample
;
495 static inline void tcp_rcv_rtt_measure(struct tcp_sock
*tp
)
497 if (tp
->rcv_rtt_est
.time
== 0)
499 if (before(tp
->rcv_nxt
, tp
->rcv_rtt_est
.seq
))
501 tcp_rcv_rtt_update(tp
, tcp_time_stamp
- tp
->rcv_rtt_est
.time
, 1);
504 tp
->rcv_rtt_est
.seq
= tp
->rcv_nxt
+ tp
->rcv_wnd
;
505 tp
->rcv_rtt_est
.time
= tcp_time_stamp
;
508 static inline void tcp_rcv_rtt_measure_ts(struct sock
*sk
,
509 const struct sk_buff
*skb
)
511 struct tcp_sock
*tp
= tcp_sk(sk
);
512 if (tp
->rx_opt
.rcv_tsecr
&&
513 (TCP_SKB_CB(skb
)->end_seq
-
514 TCP_SKB_CB(skb
)->seq
>= inet_csk(sk
)->icsk_ack
.rcv_mss
))
515 tcp_rcv_rtt_update(tp
, tcp_time_stamp
- tp
->rx_opt
.rcv_tsecr
, 0);
519 * This function should be called every time data is copied to user space.
520 * It calculates the appropriate TCP receive buffer space.
522 void tcp_rcv_space_adjust(struct sock
*sk
)
524 struct tcp_sock
*tp
= tcp_sk(sk
);
528 if (tp
->rcvq_space
.time
== 0)
531 time
= tcp_time_stamp
- tp
->rcvq_space
.time
;
532 if (time
< (tp
->rcv_rtt_est
.rtt
>> 3) || tp
->rcv_rtt_est
.rtt
== 0)
535 space
= 2 * (tp
->copied_seq
- tp
->rcvq_space
.seq
);
537 space
= max(tp
->rcvq_space
.space
, space
);
539 if (tp
->rcvq_space
.space
!= space
) {
542 tp
->rcvq_space
.space
= space
;
544 if (sysctl_tcp_moderate_rcvbuf
&&
545 !(sk
->sk_userlocks
& SOCK_RCVBUF_LOCK
)) {
546 int new_clamp
= space
;
548 /* Receive space grows, normalize in order to
549 * take into account packet headers and sk_buff
550 * structure overhead.
555 rcvmem
= SKB_TRUESIZE(tp
->advmss
+ MAX_TCP_HEADER
);
556 while (tcp_win_from_space(rcvmem
) < tp
->advmss
)
559 space
= min(space
, sysctl_tcp_rmem
[2]);
560 if (space
> sk
->sk_rcvbuf
) {
561 sk
->sk_rcvbuf
= space
;
563 /* Make the window clamp follow along. */
564 tp
->window_clamp
= new_clamp
;
570 tp
->rcvq_space
.seq
= tp
->copied_seq
;
571 tp
->rcvq_space
.time
= tcp_time_stamp
;
574 /* There is something which you must keep in mind when you analyze the
575 * behavior of the tp->ato delayed ack timeout interval. When a
576 * connection starts up, we want to ack as quickly as possible. The
577 * problem is that "good" TCP's do slow start at the beginning of data
578 * transmission. The means that until we send the first few ACK's the
579 * sender will sit on his end and only queue most of his data, because
580 * he can only send snd_cwnd unacked packets at any given time. For
581 * each ACK we send, he increments snd_cwnd and transmits more of his
584 static void tcp_event_data_recv(struct sock
*sk
, struct sk_buff
*skb
)
586 struct tcp_sock
*tp
= tcp_sk(sk
);
587 struct inet_connection_sock
*icsk
= inet_csk(sk
);
590 inet_csk_schedule_ack(sk
);
592 tcp_measure_rcv_mss(sk
, skb
);
594 tcp_rcv_rtt_measure(tp
);
596 now
= tcp_time_stamp
;
598 if (!icsk
->icsk_ack
.ato
) {
599 /* The _first_ data packet received, initialize
600 * delayed ACK engine.
602 tcp_incr_quickack(sk
);
603 icsk
->icsk_ack
.ato
= TCP_ATO_MIN
;
605 int m
= now
- icsk
->icsk_ack
.lrcvtime
;
607 if (m
<= TCP_ATO_MIN
/ 2) {
608 /* The fastest case is the first. */
609 icsk
->icsk_ack
.ato
= (icsk
->icsk_ack
.ato
>> 1) + TCP_ATO_MIN
/ 2;
610 } else if (m
< icsk
->icsk_ack
.ato
) {
611 icsk
->icsk_ack
.ato
= (icsk
->icsk_ack
.ato
>> 1) + m
;
612 if (icsk
->icsk_ack
.ato
> icsk
->icsk_rto
)
613 icsk
->icsk_ack
.ato
= icsk
->icsk_rto
;
614 } else if (m
> icsk
->icsk_rto
) {
615 /* Too long gap. Apparently sender failed to
616 * restart window, so that we send ACKs quickly.
618 tcp_incr_quickack(sk
);
622 icsk
->icsk_ack
.lrcvtime
= now
;
624 TCP_ECN_check_ce(tp
, skb
);
627 tcp_grow_window(sk
, skb
);
630 /* Called to compute a smoothed rtt estimate. The data fed to this
631 * routine either comes from timestamps, or from segments that were
632 * known _not_ to have been retransmitted [see Karn/Partridge
633 * Proceedings SIGCOMM 87]. The algorithm is from the SIGCOMM 88
634 * piece by Van Jacobson.
635 * NOTE: the next three routines used to be one big routine.
636 * To save cycles in the RFC 1323 implementation it was better to break
637 * it up into three procedures. -- erics
639 static void tcp_rtt_estimator(struct sock
*sk
, const __u32 mrtt
)
641 struct tcp_sock
*tp
= tcp_sk(sk
);
642 long m
= mrtt
; /* RTT */
644 /* The following amusing code comes from Jacobson's
645 * article in SIGCOMM '88. Note that rtt and mdev
646 * are scaled versions of rtt and mean deviation.
647 * This is designed to be as fast as possible
648 * m stands for "measurement".
650 * On a 1990 paper the rto value is changed to:
651 * RTO = rtt + 4 * mdev
653 * Funny. This algorithm seems to be very broken.
654 * These formulae increase RTO, when it should be decreased, increase
655 * too slowly, when it should be increased quickly, decrease too quickly
656 * etc. I guess in BSD RTO takes ONE value, so that it is absolutely
657 * does not matter how to _calculate_ it. Seems, it was trap
658 * that VJ failed to avoid. 8)
663 m
-= (tp
->srtt
>> 3); /* m is now error in rtt est */
664 tp
->srtt
+= m
; /* rtt = 7/8 rtt + 1/8 new */
666 m
= -m
; /* m is now abs(error) */
667 m
-= (tp
->mdev
>> 2); /* similar update on mdev */
668 /* This is similar to one of Eifel findings.
669 * Eifel blocks mdev updates when rtt decreases.
670 * This solution is a bit different: we use finer gain
671 * for mdev in this case (alpha*beta).
672 * Like Eifel it also prevents growth of rto,
673 * but also it limits too fast rto decreases,
674 * happening in pure Eifel.
679 m
-= (tp
->mdev
>> 2); /* similar update on mdev */
681 tp
->mdev
+= m
; /* mdev = 3/4 mdev + 1/4 new */
682 if (tp
->mdev
> tp
->mdev_max
) {
683 tp
->mdev_max
= tp
->mdev
;
684 if (tp
->mdev_max
> tp
->rttvar
)
685 tp
->rttvar
= tp
->mdev_max
;
687 if (after(tp
->snd_una
, tp
->rtt_seq
)) {
688 if (tp
->mdev_max
< tp
->rttvar
)
689 tp
->rttvar
-= (tp
->rttvar
- tp
->mdev_max
) >> 2;
690 tp
->rtt_seq
= tp
->snd_nxt
;
691 tp
->mdev_max
= tcp_rto_min(sk
);
694 /* no previous measure. */
695 tp
->srtt
= m
<< 3; /* take the measured time to be rtt */
696 tp
->mdev
= m
<< 1; /* make sure rto = 3*rtt */
697 tp
->mdev_max
= tp
->rttvar
= max(tp
->mdev
, tcp_rto_min(sk
));
698 tp
->rtt_seq
= tp
->snd_nxt
;
702 /* Set the sk_pacing_rate to allow proper sizing of TSO packets.
703 * Note: TCP stack does not yet implement pacing.
704 * FQ packet scheduler can be used to implement cheap but effective
705 * TCP pacing, to smooth the burst on large writes when packets
706 * in flight is significantly lower than cwnd (or rwin)
708 static void tcp_update_pacing_rate(struct sock
*sk
)
710 const struct tcp_sock
*tp
= tcp_sk(sk
);
713 /* set sk_pacing_rate to 200 % of current rate (mss * cwnd / srtt) */
714 rate
= (u64
)tp
->mss_cache
* 2 * (HZ
<< 3);
716 rate
*= max(tp
->snd_cwnd
, tp
->packets_out
);
718 /* Correction for small srtt : minimum srtt being 8 (1 jiffy << 3),
719 * be conservative and assume srtt = 1 (125 us instead of 1.25 ms)
720 * We probably need usec resolution in the future.
721 * Note: This also takes care of possible srtt=0 case,
722 * when tcp_rtt_estimator() was not yet called.
724 if (tp
->srtt
> 8 + 2)
725 do_div(rate
, tp
->srtt
);
727 sk
->sk_pacing_rate
= min_t(u64
, rate
, ~0U);
730 /* Calculate rto without backoff. This is the second half of Van Jacobson's
731 * routine referred to above.
733 void tcp_set_rto(struct sock
*sk
)
735 const struct tcp_sock
*tp
= tcp_sk(sk
);
736 /* Old crap is replaced with new one. 8)
739 * 1. If rtt variance happened to be less 50msec, it is hallucination.
740 * It cannot be less due to utterly erratic ACK generation made
741 * at least by solaris and freebsd. "Erratic ACKs" has _nothing_
742 * to do with delayed acks, because at cwnd>2 true delack timeout
743 * is invisible. Actually, Linux-2.4 also generates erratic
744 * ACKs in some circumstances.
746 inet_csk(sk
)->icsk_rto
= __tcp_set_rto(tp
);
748 /* 2. Fixups made earlier cannot be right.
749 * If we do not estimate RTO correctly without them,
750 * all the algo is pure shit and should be replaced
751 * with correct one. It is exactly, which we pretend to do.
754 /* NOTE: clamping at TCP_RTO_MIN is not required, current algo
755 * guarantees that rto is higher.
760 __u32
tcp_init_cwnd(const struct tcp_sock
*tp
, const struct dst_entry
*dst
)
762 __u32 cwnd
= (dst
? dst_metric(dst
, RTAX_INITCWND
) : 0);
765 cwnd
= TCP_INIT_CWND
;
766 return min_t(__u32
, cwnd
, tp
->snd_cwnd_clamp
);
770 * Packet counting of FACK is based on in-order assumptions, therefore TCP
771 * disables it when reordering is detected
773 void tcp_disable_fack(struct tcp_sock
*tp
)
775 /* RFC3517 uses different metric in lost marker => reset on change */
777 tp
->lost_skb_hint
= NULL
;
778 tp
->rx_opt
.sack_ok
&= ~TCP_FACK_ENABLED
;
781 /* Take a notice that peer is sending D-SACKs */
782 static void tcp_dsack_seen(struct tcp_sock
*tp
)
784 tp
->rx_opt
.sack_ok
|= TCP_DSACK_SEEN
;
787 static void tcp_update_reordering(struct sock
*sk
, const int metric
,
790 struct tcp_sock
*tp
= tcp_sk(sk
);
791 if (metric
> tp
->reordering
) {
794 tp
->reordering
= min(TCP_MAX_REORDERING
, metric
);
796 /* This exciting event is worth to be remembered. 8) */
798 mib_idx
= LINUX_MIB_TCPTSREORDER
;
799 else if (tcp_is_reno(tp
))
800 mib_idx
= LINUX_MIB_TCPRENOREORDER
;
801 else if (tcp_is_fack(tp
))
802 mib_idx
= LINUX_MIB_TCPFACKREORDER
;
804 mib_idx
= LINUX_MIB_TCPSACKREORDER
;
806 NET_INC_STATS_BH(sock_net(sk
), mib_idx
);
807 #if FASTRETRANS_DEBUG > 1
808 pr_debug("Disorder%d %d %u f%u s%u rr%d\n",
809 tp
->rx_opt
.sack_ok
, inet_csk(sk
)->icsk_ca_state
,
813 tp
->undo_marker
? tp
->undo_retrans
: 0);
815 tcp_disable_fack(tp
);
819 tcp_disable_early_retrans(tp
);
822 /* This must be called before lost_out is incremented */
823 static void tcp_verify_retransmit_hint(struct tcp_sock
*tp
, struct sk_buff
*skb
)
825 if ((tp
->retransmit_skb_hint
== NULL
) ||
826 before(TCP_SKB_CB(skb
)->seq
,
827 TCP_SKB_CB(tp
->retransmit_skb_hint
)->seq
))
828 tp
->retransmit_skb_hint
= skb
;
831 after(TCP_SKB_CB(skb
)->end_seq
, tp
->retransmit_high
))
832 tp
->retransmit_high
= TCP_SKB_CB(skb
)->end_seq
;
835 static void tcp_skb_mark_lost(struct tcp_sock
*tp
, struct sk_buff
*skb
)
837 if (!(TCP_SKB_CB(skb
)->sacked
& (TCPCB_LOST
|TCPCB_SACKED_ACKED
))) {
838 tcp_verify_retransmit_hint(tp
, skb
);
840 tp
->lost_out
+= tcp_skb_pcount(skb
);
841 TCP_SKB_CB(skb
)->sacked
|= TCPCB_LOST
;
845 static void tcp_skb_mark_lost_uncond_verify(struct tcp_sock
*tp
,
848 tcp_verify_retransmit_hint(tp
, skb
);
850 if (!(TCP_SKB_CB(skb
)->sacked
& (TCPCB_LOST
|TCPCB_SACKED_ACKED
))) {
851 tp
->lost_out
+= tcp_skb_pcount(skb
);
852 TCP_SKB_CB(skb
)->sacked
|= TCPCB_LOST
;
856 /* This procedure tags the retransmission queue when SACKs arrive.
858 * We have three tag bits: SACKED(S), RETRANS(R) and LOST(L).
859 * Packets in queue with these bits set are counted in variables
860 * sacked_out, retrans_out and lost_out, correspondingly.
862 * Valid combinations are:
863 * Tag InFlight Description
864 * 0 1 - orig segment is in flight.
865 * S 0 - nothing flies, orig reached receiver.
866 * L 0 - nothing flies, orig lost by net.
867 * R 2 - both orig and retransmit are in flight.
868 * L|R 1 - orig is lost, retransmit is in flight.
869 * S|R 1 - orig reached receiver, retrans is still in flight.
870 * (L|S|R is logically valid, it could occur when L|R is sacked,
871 * but it is equivalent to plain S and code short-curcuits it to S.
872 * L|S is logically invalid, it would mean -1 packet in flight 8))
874 * These 6 states form finite state machine, controlled by the following events:
875 * 1. New ACK (+SACK) arrives. (tcp_sacktag_write_queue())
876 * 2. Retransmission. (tcp_retransmit_skb(), tcp_xmit_retransmit_queue())
877 * 3. Loss detection event of two flavors:
878 * A. Scoreboard estimator decided the packet is lost.
879 * A'. Reno "three dupacks" marks head of queue lost.
880 * A''. Its FACK modification, head until snd.fack is lost.
881 * B. SACK arrives sacking SND.NXT at the moment, when the
882 * segment was retransmitted.
883 * 4. D-SACK added new rule: D-SACK changes any tag to S.
885 * It is pleasant to note, that state diagram turns out to be commutative,
886 * so that we are allowed not to be bothered by order of our actions,
887 * when multiple events arrive simultaneously. (see the function below).
889 * Reordering detection.
890 * --------------------
891 * Reordering metric is maximal distance, which a packet can be displaced
892 * in packet stream. With SACKs we can estimate it:
894 * 1. SACK fills old hole and the corresponding segment was not
895 * ever retransmitted -> reordering. Alas, we cannot use it
896 * when segment was retransmitted.
897 * 2. The last flaw is solved with D-SACK. D-SACK arrives
898 * for retransmitted and already SACKed segment -> reordering..
899 * Both of these heuristics are not used in Loss state, when we cannot
900 * account for retransmits accurately.
902 * SACK block validation.
903 * ----------------------
905 * SACK block range validation checks that the received SACK block fits to
906 * the expected sequence limits, i.e., it is between SND.UNA and SND.NXT.
907 * Note that SND.UNA is not included to the range though being valid because
908 * it means that the receiver is rather inconsistent with itself reporting
909 * SACK reneging when it should advance SND.UNA. Such SACK block this is
910 * perfectly valid, however, in light of RFC2018 which explicitly states
911 * that "SACK block MUST reflect the newest segment. Even if the newest
912 * segment is going to be discarded ...", not that it looks very clever
913 * in case of head skb. Due to potentional receiver driven attacks, we
914 * choose to avoid immediate execution of a walk in write queue due to
915 * reneging and defer head skb's loss recovery to standard loss recovery
916 * procedure that will eventually trigger (nothing forbids us doing this).
918 * Implements also blockage to start_seq wrap-around. Problem lies in the
919 * fact that though start_seq (s) is before end_seq (i.e., not reversed),
920 * there's no guarantee that it will be before snd_nxt (n). The problem
921 * happens when start_seq resides between end_seq wrap (e_w) and snd_nxt
924 * <- outs wnd -> <- wrapzone ->
925 * u e n u_w e_w s n_w
927 * |<------------+------+----- TCP seqno space --------------+---------->|
928 * ...-- <2^31 ->| |<--------...
929 * ...---- >2^31 ------>| |<--------...
931 * Current code wouldn't be vulnerable but it's better still to discard such
932 * crazy SACK blocks. Doing this check for start_seq alone closes somewhat
933 * similar case (end_seq after snd_nxt wrap) as earlier reversed check in
934 * snd_nxt wrap -> snd_una region will then become "well defined", i.e.,
935 * equal to the ideal case (infinite seqno space without wrap caused issues).
937 * With D-SACK the lower bound is extended to cover sequence space below
938 * SND.UNA down to undo_marker, which is the last point of interest. Yet
939 * again, D-SACK block must not to go across snd_una (for the same reason as
940 * for the normal SACK blocks, explained above). But there all simplicity
941 * ends, TCP might receive valid D-SACKs below that. As long as they reside
942 * fully below undo_marker they do not affect behavior in anyway and can
943 * therefore be safely ignored. In rare cases (which are more or less
944 * theoretical ones), the D-SACK will nicely cross that boundary due to skb
945 * fragmentation and packet reordering past skb's retransmission. To consider
946 * them correctly, the acceptable range must be extended even more though
947 * the exact amount is rather hard to quantify. However, tp->max_window can
948 * be used as an exaggerated estimate.
950 static bool tcp_is_sackblock_valid(struct tcp_sock
*tp
, bool is_dsack
,
951 u32 start_seq
, u32 end_seq
)
953 /* Too far in future, or reversed (interpretation is ambiguous) */
954 if (after(end_seq
, tp
->snd_nxt
) || !before(start_seq
, end_seq
))
957 /* Nasty start_seq wrap-around check (see comments above) */
958 if (!before(start_seq
, tp
->snd_nxt
))
961 /* In outstanding window? ...This is valid exit for D-SACKs too.
962 * start_seq == snd_una is non-sensical (see comments above)
964 if (after(start_seq
, tp
->snd_una
))
967 if (!is_dsack
|| !tp
->undo_marker
)
970 /* ...Then it's D-SACK, and must reside below snd_una completely */
971 if (after(end_seq
, tp
->snd_una
))
974 if (!before(start_seq
, tp
->undo_marker
))
978 if (!after(end_seq
, tp
->undo_marker
))
981 /* Undo_marker boundary crossing (overestimates a lot). Known already:
982 * start_seq < undo_marker and end_seq >= undo_marker.
984 return !before(start_seq
, end_seq
- tp
->max_window
);
987 /* Check for lost retransmit. This superb idea is borrowed from "ratehalving".
988 * Event "B". Later note: FACK people cheated me again 8), we have to account
989 * for reordering! Ugly, but should help.
991 * Search retransmitted skbs from write_queue that were sent when snd_nxt was
992 * less than what is now known to be received by the other end (derived from
993 * highest SACK block). Also calculate the lowest snd_nxt among the remaining
994 * retransmitted skbs to avoid some costly processing per ACKs.
996 static void tcp_mark_lost_retrans(struct sock
*sk
)
998 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
999 struct tcp_sock
*tp
= tcp_sk(sk
);
1000 struct sk_buff
*skb
;
1002 u32 new_low_seq
= tp
->snd_nxt
;
1003 u32 received_upto
= tcp_highest_sack_seq(tp
);
1005 if (!tcp_is_fack(tp
) || !tp
->retrans_out
||
1006 !after(received_upto
, tp
->lost_retrans_low
) ||
1007 icsk
->icsk_ca_state
!= TCP_CA_Recovery
)
1010 tcp_for_write_queue(skb
, sk
) {
1011 u32 ack_seq
= TCP_SKB_CB(skb
)->ack_seq
;
1013 if (skb
== tcp_send_head(sk
))
1015 if (cnt
== tp
->retrans_out
)
1017 if (!after(TCP_SKB_CB(skb
)->end_seq
, tp
->snd_una
))
1020 if (!(TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_RETRANS
))
1023 /* TODO: We would like to get rid of tcp_is_fack(tp) only
1024 * constraint here (see above) but figuring out that at
1025 * least tp->reordering SACK blocks reside between ack_seq
1026 * and received_upto is not easy task to do cheaply with
1027 * the available datastructures.
1029 * Whether FACK should check here for tp->reordering segs
1030 * in-between one could argue for either way (it would be
1031 * rather simple to implement as we could count fack_count
1032 * during the walk and do tp->fackets_out - fack_count).
1034 if (after(received_upto
, ack_seq
)) {
1035 TCP_SKB_CB(skb
)->sacked
&= ~TCPCB_SACKED_RETRANS
;
1036 tp
->retrans_out
-= tcp_skb_pcount(skb
);
1038 tcp_skb_mark_lost_uncond_verify(tp
, skb
);
1039 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPLOSTRETRANSMIT
);
1041 if (before(ack_seq
, new_low_seq
))
1042 new_low_seq
= ack_seq
;
1043 cnt
+= tcp_skb_pcount(skb
);
1047 if (tp
->retrans_out
)
1048 tp
->lost_retrans_low
= new_low_seq
;
1051 static bool tcp_check_dsack(struct sock
*sk
, const struct sk_buff
*ack_skb
,
1052 struct tcp_sack_block_wire
*sp
, int num_sacks
,
1055 struct tcp_sock
*tp
= tcp_sk(sk
);
1056 u32 start_seq_0
= get_unaligned_be32(&sp
[0].start_seq
);
1057 u32 end_seq_0
= get_unaligned_be32(&sp
[0].end_seq
);
1058 bool dup_sack
= false;
1060 if (before(start_seq_0
, TCP_SKB_CB(ack_skb
)->ack_seq
)) {
1063 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPDSACKRECV
);
1064 } else if (num_sacks
> 1) {
1065 u32 end_seq_1
= get_unaligned_be32(&sp
[1].end_seq
);
1066 u32 start_seq_1
= get_unaligned_be32(&sp
[1].start_seq
);
1068 if (!after(end_seq_0
, end_seq_1
) &&
1069 !before(start_seq_0
, start_seq_1
)) {
1072 NET_INC_STATS_BH(sock_net(sk
),
1073 LINUX_MIB_TCPDSACKOFORECV
);
1077 /* D-SACK for already forgotten data... Do dumb counting. */
1078 if (dup_sack
&& tp
->undo_marker
&& tp
->undo_retrans
> 0 &&
1079 !after(end_seq_0
, prior_snd_una
) &&
1080 after(end_seq_0
, tp
->undo_marker
))
1086 struct tcp_sacktag_state
{
1092 /* Check if skb is fully within the SACK block. In presence of GSO skbs,
1093 * the incoming SACK may not exactly match but we can find smaller MSS
1094 * aligned portion of it that matches. Therefore we might need to fragment
1095 * which may fail and creates some hassle (caller must handle error case
1098 * FIXME: this could be merged to shift decision code
1100 static int tcp_match_skb_to_sack(struct sock
*sk
, struct sk_buff
*skb
,
1101 u32 start_seq
, u32 end_seq
)
1105 unsigned int pkt_len
;
1108 in_sack
= !after(start_seq
, TCP_SKB_CB(skb
)->seq
) &&
1109 !before(end_seq
, TCP_SKB_CB(skb
)->end_seq
);
1111 if (tcp_skb_pcount(skb
) > 1 && !in_sack
&&
1112 after(TCP_SKB_CB(skb
)->end_seq
, start_seq
)) {
1113 mss
= tcp_skb_mss(skb
);
1114 in_sack
= !after(start_seq
, TCP_SKB_CB(skb
)->seq
);
1117 pkt_len
= start_seq
- TCP_SKB_CB(skb
)->seq
;
1121 pkt_len
= end_seq
- TCP_SKB_CB(skb
)->seq
;
1126 /* Round if necessary so that SACKs cover only full MSSes
1127 * and/or the remaining small portion (if present)
1129 if (pkt_len
> mss
) {
1130 unsigned int new_len
= (pkt_len
/ mss
) * mss
;
1131 if (!in_sack
&& new_len
< pkt_len
) {
1133 if (new_len
>= skb
->len
)
1138 err
= tcp_fragment(sk
, skb
, pkt_len
, mss
);
1146 /* Mark the given newly-SACKed range as such, adjusting counters and hints. */
1147 static u8
tcp_sacktag_one(struct sock
*sk
,
1148 struct tcp_sacktag_state
*state
, u8 sacked
,
1149 u32 start_seq
, u32 end_seq
,
1150 bool dup_sack
, int pcount
)
1152 struct tcp_sock
*tp
= tcp_sk(sk
);
1153 int fack_count
= state
->fack_count
;
1155 /* Account D-SACK for retransmitted packet. */
1156 if (dup_sack
&& (sacked
& TCPCB_RETRANS
)) {
1157 if (tp
->undo_marker
&& tp
->undo_retrans
> 0 &&
1158 after(end_seq
, tp
->undo_marker
))
1160 if (sacked
& TCPCB_SACKED_ACKED
)
1161 state
->reord
= min(fack_count
, state
->reord
);
1164 /* Nothing to do; acked frame is about to be dropped (was ACKed). */
1165 if (!after(end_seq
, tp
->snd_una
))
1168 if (!(sacked
& TCPCB_SACKED_ACKED
)) {
1169 if (sacked
& TCPCB_SACKED_RETRANS
) {
1170 /* If the segment is not tagged as lost,
1171 * we do not clear RETRANS, believing
1172 * that retransmission is still in flight.
1174 if (sacked
& TCPCB_LOST
) {
1175 sacked
&= ~(TCPCB_LOST
|TCPCB_SACKED_RETRANS
);
1176 tp
->lost_out
-= pcount
;
1177 tp
->retrans_out
-= pcount
;
1180 if (!(sacked
& TCPCB_RETRANS
)) {
1181 /* New sack for not retransmitted frame,
1182 * which was in hole. It is reordering.
1184 if (before(start_seq
,
1185 tcp_highest_sack_seq(tp
)))
1186 state
->reord
= min(fack_count
,
1188 if (!after(end_seq
, tp
->high_seq
))
1189 state
->flag
|= FLAG_ORIG_SACK_ACKED
;
1192 if (sacked
& TCPCB_LOST
) {
1193 sacked
&= ~TCPCB_LOST
;
1194 tp
->lost_out
-= pcount
;
1198 sacked
|= TCPCB_SACKED_ACKED
;
1199 state
->flag
|= FLAG_DATA_SACKED
;
1200 tp
->sacked_out
+= pcount
;
1202 fack_count
+= pcount
;
1204 /* Lost marker hint past SACKed? Tweak RFC3517 cnt */
1205 if (!tcp_is_fack(tp
) && (tp
->lost_skb_hint
!= NULL
) &&
1206 before(start_seq
, TCP_SKB_CB(tp
->lost_skb_hint
)->seq
))
1207 tp
->lost_cnt_hint
+= pcount
;
1209 if (fack_count
> tp
->fackets_out
)
1210 tp
->fackets_out
= fack_count
;
1213 /* D-SACK. We can detect redundant retransmission in S|R and plain R
1214 * frames and clear it. undo_retrans is decreased above, L|R frames
1215 * are accounted above as well.
1217 if (dup_sack
&& (sacked
& TCPCB_SACKED_RETRANS
)) {
1218 sacked
&= ~TCPCB_SACKED_RETRANS
;
1219 tp
->retrans_out
-= pcount
;
1225 /* Shift newly-SACKed bytes from this skb to the immediately previous
1226 * already-SACKed sk_buff. Mark the newly-SACKed bytes as such.
1228 static bool tcp_shifted_skb(struct sock
*sk
, struct sk_buff
*skb
,
1229 struct tcp_sacktag_state
*state
,
1230 unsigned int pcount
, int shifted
, int mss
,
1233 struct tcp_sock
*tp
= tcp_sk(sk
);
1234 struct sk_buff
*prev
= tcp_write_queue_prev(sk
, skb
);
1235 u32 start_seq
= TCP_SKB_CB(skb
)->seq
; /* start of newly-SACKed */
1236 u32 end_seq
= start_seq
+ shifted
; /* end of newly-SACKed */
1240 /* Adjust counters and hints for the newly sacked sequence
1241 * range but discard the return value since prev is already
1242 * marked. We must tag the range first because the seq
1243 * advancement below implicitly advances
1244 * tcp_highest_sack_seq() when skb is highest_sack.
1246 tcp_sacktag_one(sk
, state
, TCP_SKB_CB(skb
)->sacked
,
1247 start_seq
, end_seq
, dup_sack
, pcount
);
1249 if (skb
== tp
->lost_skb_hint
)
1250 tp
->lost_cnt_hint
+= pcount
;
1252 TCP_SKB_CB(prev
)->end_seq
+= shifted
;
1253 TCP_SKB_CB(skb
)->seq
+= shifted
;
1255 skb_shinfo(prev
)->gso_segs
+= pcount
;
1256 BUG_ON(skb_shinfo(skb
)->gso_segs
< pcount
);
1257 skb_shinfo(skb
)->gso_segs
-= pcount
;
1259 /* When we're adding to gso_segs == 1, gso_size will be zero,
1260 * in theory this shouldn't be necessary but as long as DSACK
1261 * code can come after this skb later on it's better to keep
1262 * setting gso_size to something.
1264 if (!skb_shinfo(prev
)->gso_size
) {
1265 skb_shinfo(prev
)->gso_size
= mss
;
1266 skb_shinfo(prev
)->gso_type
= sk
->sk_gso_type
;
1269 /* CHECKME: To clear or not to clear? Mimics normal skb currently */
1270 if (skb_shinfo(skb
)->gso_segs
<= 1) {
1271 skb_shinfo(skb
)->gso_size
= 0;
1272 skb_shinfo(skb
)->gso_type
= 0;
1275 /* Difference in this won't matter, both ACKed by the same cumul. ACK */
1276 TCP_SKB_CB(prev
)->sacked
|= (TCP_SKB_CB(skb
)->sacked
& TCPCB_EVER_RETRANS
);
1279 BUG_ON(!tcp_skb_pcount(skb
));
1280 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_SACKSHIFTED
);
1284 /* Whole SKB was eaten :-) */
1286 if (skb
== tp
->retransmit_skb_hint
)
1287 tp
->retransmit_skb_hint
= prev
;
1288 if (skb
== tp
->scoreboard_skb_hint
)
1289 tp
->scoreboard_skb_hint
= prev
;
1290 if (skb
== tp
->lost_skb_hint
) {
1291 tp
->lost_skb_hint
= prev
;
1292 tp
->lost_cnt_hint
-= tcp_skb_pcount(prev
);
1295 TCP_SKB_CB(prev
)->tcp_flags
|= TCP_SKB_CB(skb
)->tcp_flags
;
1296 if (TCP_SKB_CB(skb
)->tcp_flags
& TCPHDR_FIN
)
1297 TCP_SKB_CB(prev
)->end_seq
++;
1299 if (skb
== tcp_highest_sack(sk
))
1300 tcp_advance_highest_sack(sk
, skb
);
1302 tcp_unlink_write_queue(skb
, sk
);
1303 sk_wmem_free_skb(sk
, skb
);
1305 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_SACKMERGED
);
1310 /* I wish gso_size would have a bit more sane initialization than
1311 * something-or-zero which complicates things
1313 static int tcp_skb_seglen(const struct sk_buff
*skb
)
1315 return tcp_skb_pcount(skb
) == 1 ? skb
->len
: tcp_skb_mss(skb
);
1318 /* Shifting pages past head area doesn't work */
1319 static int skb_can_shift(const struct sk_buff
*skb
)
1321 return !skb_headlen(skb
) && skb_is_nonlinear(skb
);
1324 /* Try collapsing SACK blocks spanning across multiple skbs to a single
1327 static struct sk_buff
*tcp_shift_skb_data(struct sock
*sk
, struct sk_buff
*skb
,
1328 struct tcp_sacktag_state
*state
,
1329 u32 start_seq
, u32 end_seq
,
1332 struct tcp_sock
*tp
= tcp_sk(sk
);
1333 struct sk_buff
*prev
;
1339 if (!sk_can_gso(sk
))
1342 /* Normally R but no L won't result in plain S */
1344 (TCP_SKB_CB(skb
)->sacked
& (TCPCB_LOST
|TCPCB_SACKED_RETRANS
)) == TCPCB_SACKED_RETRANS
)
1346 if (!skb_can_shift(skb
))
1348 /* This frame is about to be dropped (was ACKed). */
1349 if (!after(TCP_SKB_CB(skb
)->end_seq
, tp
->snd_una
))
1352 /* Can only happen with delayed DSACK + discard craziness */
1353 if (unlikely(skb
== tcp_write_queue_head(sk
)))
1355 prev
= tcp_write_queue_prev(sk
, skb
);
1357 if ((TCP_SKB_CB(prev
)->sacked
& TCPCB_TAGBITS
) != TCPCB_SACKED_ACKED
)
1360 in_sack
= !after(start_seq
, TCP_SKB_CB(skb
)->seq
) &&
1361 !before(end_seq
, TCP_SKB_CB(skb
)->end_seq
);
1365 pcount
= tcp_skb_pcount(skb
);
1366 mss
= tcp_skb_seglen(skb
);
1368 /* TODO: Fix DSACKs to not fragment already SACKed and we can
1369 * drop this restriction as unnecessary
1371 if (mss
!= tcp_skb_seglen(prev
))
1374 if (!after(TCP_SKB_CB(skb
)->end_seq
, start_seq
))
1376 /* CHECKME: This is non-MSS split case only?, this will
1377 * cause skipped skbs due to advancing loop btw, original
1378 * has that feature too
1380 if (tcp_skb_pcount(skb
) <= 1)
1383 in_sack
= !after(start_seq
, TCP_SKB_CB(skb
)->seq
);
1385 /* TODO: head merge to next could be attempted here
1386 * if (!after(TCP_SKB_CB(skb)->end_seq, end_seq)),
1387 * though it might not be worth of the additional hassle
1389 * ...we can probably just fallback to what was done
1390 * previously. We could try merging non-SACKed ones
1391 * as well but it probably isn't going to buy off
1392 * because later SACKs might again split them, and
1393 * it would make skb timestamp tracking considerably
1399 len
= end_seq
- TCP_SKB_CB(skb
)->seq
;
1401 BUG_ON(len
> skb
->len
);
1403 /* MSS boundaries should be honoured or else pcount will
1404 * severely break even though it makes things bit trickier.
1405 * Optimize common case to avoid most of the divides
1407 mss
= tcp_skb_mss(skb
);
1409 /* TODO: Fix DSACKs to not fragment already SACKed and we can
1410 * drop this restriction as unnecessary
1412 if (mss
!= tcp_skb_seglen(prev
))
1417 } else if (len
< mss
) {
1425 /* tcp_sacktag_one() won't SACK-tag ranges below snd_una */
1426 if (!after(TCP_SKB_CB(skb
)->seq
+ len
, tp
->snd_una
))
1429 if (!skb_shift(prev
, skb
, len
))
1431 if (!tcp_shifted_skb(sk
, skb
, state
, pcount
, len
, mss
, dup_sack
))
1434 /* Hole filled allows collapsing with the next as well, this is very
1435 * useful when hole on every nth skb pattern happens
1437 if (prev
== tcp_write_queue_tail(sk
))
1439 skb
= tcp_write_queue_next(sk
, prev
);
1441 if (!skb_can_shift(skb
) ||
1442 (skb
== tcp_send_head(sk
)) ||
1443 ((TCP_SKB_CB(skb
)->sacked
& TCPCB_TAGBITS
) != TCPCB_SACKED_ACKED
) ||
1444 (mss
!= tcp_skb_seglen(skb
)))
1448 if (skb_shift(prev
, skb
, len
)) {
1449 pcount
+= tcp_skb_pcount(skb
);
1450 tcp_shifted_skb(sk
, skb
, state
, tcp_skb_pcount(skb
), len
, mss
, 0);
1454 state
->fack_count
+= pcount
;
1461 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_SACKSHIFTFALLBACK
);
1465 static struct sk_buff
*tcp_sacktag_walk(struct sk_buff
*skb
, struct sock
*sk
,
1466 struct tcp_sack_block
*next_dup
,
1467 struct tcp_sacktag_state
*state
,
1468 u32 start_seq
, u32 end_seq
,
1471 struct tcp_sock
*tp
= tcp_sk(sk
);
1472 struct sk_buff
*tmp
;
1474 tcp_for_write_queue_from(skb
, sk
) {
1476 bool dup_sack
= dup_sack_in
;
1478 if (skb
== tcp_send_head(sk
))
1481 /* queue is in-order => we can short-circuit the walk early */
1482 if (!before(TCP_SKB_CB(skb
)->seq
, end_seq
))
1485 if ((next_dup
!= NULL
) &&
1486 before(TCP_SKB_CB(skb
)->seq
, next_dup
->end_seq
)) {
1487 in_sack
= tcp_match_skb_to_sack(sk
, skb
,
1488 next_dup
->start_seq
,
1494 /* skb reference here is a bit tricky to get right, since
1495 * shifting can eat and free both this skb and the next,
1496 * so not even _safe variant of the loop is enough.
1499 tmp
= tcp_shift_skb_data(sk
, skb
, state
,
1500 start_seq
, end_seq
, dup_sack
);
1509 in_sack
= tcp_match_skb_to_sack(sk
, skb
,
1515 if (unlikely(in_sack
< 0))
1519 TCP_SKB_CB(skb
)->sacked
=
1522 TCP_SKB_CB(skb
)->sacked
,
1523 TCP_SKB_CB(skb
)->seq
,
1524 TCP_SKB_CB(skb
)->end_seq
,
1526 tcp_skb_pcount(skb
));
1528 if (!before(TCP_SKB_CB(skb
)->seq
,
1529 tcp_highest_sack_seq(tp
)))
1530 tcp_advance_highest_sack(sk
, skb
);
1533 state
->fack_count
+= tcp_skb_pcount(skb
);
1538 /* Avoid all extra work that is being done by sacktag while walking in
1541 static struct sk_buff
*tcp_sacktag_skip(struct sk_buff
*skb
, struct sock
*sk
,
1542 struct tcp_sacktag_state
*state
,
1545 tcp_for_write_queue_from(skb
, sk
) {
1546 if (skb
== tcp_send_head(sk
))
1549 if (after(TCP_SKB_CB(skb
)->end_seq
, skip_to_seq
))
1552 state
->fack_count
+= tcp_skb_pcount(skb
);
1557 static struct sk_buff
*tcp_maybe_skipping_dsack(struct sk_buff
*skb
,
1559 struct tcp_sack_block
*next_dup
,
1560 struct tcp_sacktag_state
*state
,
1563 if (next_dup
== NULL
)
1566 if (before(next_dup
->start_seq
, skip_to_seq
)) {
1567 skb
= tcp_sacktag_skip(skb
, sk
, state
, next_dup
->start_seq
);
1568 skb
= tcp_sacktag_walk(skb
, sk
, NULL
, state
,
1569 next_dup
->start_seq
, next_dup
->end_seq
,
1576 static int tcp_sack_cache_ok(const struct tcp_sock
*tp
, const struct tcp_sack_block
*cache
)
1578 return cache
< tp
->recv_sack_cache
+ ARRAY_SIZE(tp
->recv_sack_cache
);
1582 tcp_sacktag_write_queue(struct sock
*sk
, const struct sk_buff
*ack_skb
,
1585 struct tcp_sock
*tp
= tcp_sk(sk
);
1586 const unsigned char *ptr
= (skb_transport_header(ack_skb
) +
1587 TCP_SKB_CB(ack_skb
)->sacked
);
1588 struct tcp_sack_block_wire
*sp_wire
= (struct tcp_sack_block_wire
*)(ptr
+2);
1589 struct tcp_sack_block sp
[TCP_NUM_SACKS
];
1590 struct tcp_sack_block
*cache
;
1591 struct tcp_sacktag_state state
;
1592 struct sk_buff
*skb
;
1593 int num_sacks
= min(TCP_NUM_SACKS
, (ptr
[1] - TCPOLEN_SACK_BASE
) >> 3);
1595 bool found_dup_sack
= false;
1597 int first_sack_index
;
1600 state
.reord
= tp
->packets_out
;
1602 if (!tp
->sacked_out
) {
1603 if (WARN_ON(tp
->fackets_out
))
1604 tp
->fackets_out
= 0;
1605 tcp_highest_sack_reset(sk
);
1608 found_dup_sack
= tcp_check_dsack(sk
, ack_skb
, sp_wire
,
1609 num_sacks
, prior_snd_una
);
1611 state
.flag
|= FLAG_DSACKING_ACK
;
1613 /* Eliminate too old ACKs, but take into
1614 * account more or less fresh ones, they can
1615 * contain valid SACK info.
1617 if (before(TCP_SKB_CB(ack_skb
)->ack_seq
, prior_snd_una
- tp
->max_window
))
1620 if (!tp
->packets_out
)
1624 first_sack_index
= 0;
1625 for (i
= 0; i
< num_sacks
; i
++) {
1626 bool dup_sack
= !i
&& found_dup_sack
;
1628 sp
[used_sacks
].start_seq
= get_unaligned_be32(&sp_wire
[i
].start_seq
);
1629 sp
[used_sacks
].end_seq
= get_unaligned_be32(&sp_wire
[i
].end_seq
);
1631 if (!tcp_is_sackblock_valid(tp
, dup_sack
,
1632 sp
[used_sacks
].start_seq
,
1633 sp
[used_sacks
].end_seq
)) {
1637 if (!tp
->undo_marker
)
1638 mib_idx
= LINUX_MIB_TCPDSACKIGNOREDNOUNDO
;
1640 mib_idx
= LINUX_MIB_TCPDSACKIGNOREDOLD
;
1642 /* Don't count olds caused by ACK reordering */
1643 if ((TCP_SKB_CB(ack_skb
)->ack_seq
!= tp
->snd_una
) &&
1644 !after(sp
[used_sacks
].end_seq
, tp
->snd_una
))
1646 mib_idx
= LINUX_MIB_TCPSACKDISCARD
;
1649 NET_INC_STATS_BH(sock_net(sk
), mib_idx
);
1651 first_sack_index
= -1;
1655 /* Ignore very old stuff early */
1656 if (!after(sp
[used_sacks
].end_seq
, prior_snd_una
))
1662 /* order SACK blocks to allow in order walk of the retrans queue */
1663 for (i
= used_sacks
- 1; i
> 0; i
--) {
1664 for (j
= 0; j
< i
; j
++) {
1665 if (after(sp
[j
].start_seq
, sp
[j
+ 1].start_seq
)) {
1666 swap(sp
[j
], sp
[j
+ 1]);
1668 /* Track where the first SACK block goes to */
1669 if (j
== first_sack_index
)
1670 first_sack_index
= j
+ 1;
1675 skb
= tcp_write_queue_head(sk
);
1676 state
.fack_count
= 0;
1679 if (!tp
->sacked_out
) {
1680 /* It's already past, so skip checking against it */
1681 cache
= tp
->recv_sack_cache
+ ARRAY_SIZE(tp
->recv_sack_cache
);
1683 cache
= tp
->recv_sack_cache
;
1684 /* Skip empty blocks in at head of the cache */
1685 while (tcp_sack_cache_ok(tp
, cache
) && !cache
->start_seq
&&
1690 while (i
< used_sacks
) {
1691 u32 start_seq
= sp
[i
].start_seq
;
1692 u32 end_seq
= sp
[i
].end_seq
;
1693 bool dup_sack
= (found_dup_sack
&& (i
== first_sack_index
));
1694 struct tcp_sack_block
*next_dup
= NULL
;
1696 if (found_dup_sack
&& ((i
+ 1) == first_sack_index
))
1697 next_dup
= &sp
[i
+ 1];
1699 /* Skip too early cached blocks */
1700 while (tcp_sack_cache_ok(tp
, cache
) &&
1701 !before(start_seq
, cache
->end_seq
))
1704 /* Can skip some work by looking recv_sack_cache? */
1705 if (tcp_sack_cache_ok(tp
, cache
) && !dup_sack
&&
1706 after(end_seq
, cache
->start_seq
)) {
1709 if (before(start_seq
, cache
->start_seq
)) {
1710 skb
= tcp_sacktag_skip(skb
, sk
, &state
,
1712 skb
= tcp_sacktag_walk(skb
, sk
, next_dup
,
1719 /* Rest of the block already fully processed? */
1720 if (!after(end_seq
, cache
->end_seq
))
1723 skb
= tcp_maybe_skipping_dsack(skb
, sk
, next_dup
,
1727 /* ...tail remains todo... */
1728 if (tcp_highest_sack_seq(tp
) == cache
->end_seq
) {
1729 /* ...but better entrypoint exists! */
1730 skb
= tcp_highest_sack(sk
);
1733 state
.fack_count
= tp
->fackets_out
;
1738 skb
= tcp_sacktag_skip(skb
, sk
, &state
, cache
->end_seq
);
1739 /* Check overlap against next cached too (past this one already) */
1744 if (!before(start_seq
, tcp_highest_sack_seq(tp
))) {
1745 skb
= tcp_highest_sack(sk
);
1748 state
.fack_count
= tp
->fackets_out
;
1750 skb
= tcp_sacktag_skip(skb
, sk
, &state
, start_seq
);
1753 skb
= tcp_sacktag_walk(skb
, sk
, next_dup
, &state
,
1754 start_seq
, end_seq
, dup_sack
);
1760 /* Clear the head of the cache sack blocks so we can skip it next time */
1761 for (i
= 0; i
< ARRAY_SIZE(tp
->recv_sack_cache
) - used_sacks
; i
++) {
1762 tp
->recv_sack_cache
[i
].start_seq
= 0;
1763 tp
->recv_sack_cache
[i
].end_seq
= 0;
1765 for (j
= 0; j
< used_sacks
; j
++)
1766 tp
->recv_sack_cache
[i
++] = sp
[j
];
1768 tcp_mark_lost_retrans(sk
);
1770 tcp_verify_left_out(tp
);
1772 if ((state
.reord
< tp
->fackets_out
) &&
1773 ((inet_csk(sk
)->icsk_ca_state
!= TCP_CA_Loss
) || tp
->undo_marker
))
1774 tcp_update_reordering(sk
, tp
->fackets_out
- state
.reord
, 0);
1778 #if FASTRETRANS_DEBUG > 0
1779 WARN_ON((int)tp
->sacked_out
< 0);
1780 WARN_ON((int)tp
->lost_out
< 0);
1781 WARN_ON((int)tp
->retrans_out
< 0);
1782 WARN_ON((int)tcp_packets_in_flight(tp
) < 0);
1787 /* Limits sacked_out so that sum with lost_out isn't ever larger than
1788 * packets_out. Returns false if sacked_out adjustement wasn't necessary.
1790 static bool tcp_limit_reno_sacked(struct tcp_sock
*tp
)
1794 holes
= max(tp
->lost_out
, 1U);
1795 holes
= min(holes
, tp
->packets_out
);
1797 if ((tp
->sacked_out
+ holes
) > tp
->packets_out
) {
1798 tp
->sacked_out
= tp
->packets_out
- holes
;
1804 /* If we receive more dupacks than we expected counting segments
1805 * in assumption of absent reordering, interpret this as reordering.
1806 * The only another reason could be bug in receiver TCP.
1808 static void tcp_check_reno_reordering(struct sock
*sk
, const int addend
)
1810 struct tcp_sock
*tp
= tcp_sk(sk
);
1811 if (tcp_limit_reno_sacked(tp
))
1812 tcp_update_reordering(sk
, tp
->packets_out
+ addend
, 0);
1815 /* Emulate SACKs for SACKless connection: account for a new dupack. */
1817 static void tcp_add_reno_sack(struct sock
*sk
)
1819 struct tcp_sock
*tp
= tcp_sk(sk
);
1821 tcp_check_reno_reordering(sk
, 0);
1822 tcp_verify_left_out(tp
);
1825 /* Account for ACK, ACKing some data in Reno Recovery phase. */
1827 static void tcp_remove_reno_sacks(struct sock
*sk
, int acked
)
1829 struct tcp_sock
*tp
= tcp_sk(sk
);
1832 /* One ACK acked hole. The rest eat duplicate ACKs. */
1833 if (acked
- 1 >= tp
->sacked_out
)
1836 tp
->sacked_out
-= acked
- 1;
1838 tcp_check_reno_reordering(sk
, acked
);
1839 tcp_verify_left_out(tp
);
1842 static inline void tcp_reset_reno_sack(struct tcp_sock
*tp
)
1847 static void tcp_clear_retrans_partial(struct tcp_sock
*tp
)
1849 tp
->retrans_out
= 0;
1852 tp
->undo_marker
= 0;
1853 tp
->undo_retrans
= -1;
1856 void tcp_clear_retrans(struct tcp_sock
*tp
)
1858 tcp_clear_retrans_partial(tp
);
1860 tp
->fackets_out
= 0;
1864 /* Enter Loss state. If "how" is not zero, forget all SACK information
1865 * and reset tags completely, otherwise preserve SACKs. If receiver
1866 * dropped its ofo queue, we will know this due to reneging detection.
1868 void tcp_enter_loss(struct sock
*sk
, int how
)
1870 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
1871 struct tcp_sock
*tp
= tcp_sk(sk
);
1872 struct sk_buff
*skb
;
1873 bool new_recovery
= false;
1875 /* Reduce ssthresh if it has not yet been made inside this window. */
1876 if (icsk
->icsk_ca_state
<= TCP_CA_Disorder
||
1877 !after(tp
->high_seq
, tp
->snd_una
) ||
1878 (icsk
->icsk_ca_state
== TCP_CA_Loss
&& !icsk
->icsk_retransmits
)) {
1879 new_recovery
= true;
1880 tp
->prior_ssthresh
= tcp_current_ssthresh(sk
);
1881 tp
->snd_ssthresh
= icsk
->icsk_ca_ops
->ssthresh(sk
);
1882 tcp_ca_event(sk
, CA_EVENT_LOSS
);
1885 tp
->snd_cwnd_cnt
= 0;
1886 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
1888 tcp_clear_retrans_partial(tp
);
1890 if (tcp_is_reno(tp
))
1891 tcp_reset_reno_sack(tp
);
1893 tp
->undo_marker
= tp
->snd_una
;
1896 tp
->fackets_out
= 0;
1898 tcp_clear_all_retrans_hints(tp
);
1900 tcp_for_write_queue(skb
, sk
) {
1901 if (skb
== tcp_send_head(sk
))
1904 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_RETRANS
)
1905 tp
->undo_marker
= 0;
1906 TCP_SKB_CB(skb
)->sacked
&= (~TCPCB_TAGBITS
)|TCPCB_SACKED_ACKED
;
1907 if (!(TCP_SKB_CB(skb
)->sacked
&TCPCB_SACKED_ACKED
) || how
) {
1908 TCP_SKB_CB(skb
)->sacked
&= ~TCPCB_SACKED_ACKED
;
1909 TCP_SKB_CB(skb
)->sacked
|= TCPCB_LOST
;
1910 tp
->lost_out
+= tcp_skb_pcount(skb
);
1911 tp
->retransmit_high
= TCP_SKB_CB(skb
)->end_seq
;
1914 tcp_verify_left_out(tp
);
1916 tp
->reordering
= min_t(unsigned int, tp
->reordering
,
1917 sysctl_tcp_reordering
);
1918 tcp_set_ca_state(sk
, TCP_CA_Loss
);
1919 tp
->high_seq
= tp
->snd_nxt
;
1920 TCP_ECN_queue_cwr(tp
);
1922 /* F-RTO RFC5682 sec 3.1 step 1: retransmit SND.UNA if no previous
1923 * loss recovery is underway except recurring timeout(s) on
1924 * the same SND.UNA (sec 3.2). Disable F-RTO on path MTU probing
1926 tp
->frto
= sysctl_tcp_frto
&&
1927 (new_recovery
|| icsk
->icsk_retransmits
) &&
1928 !inet_csk(sk
)->icsk_mtup
.probe_size
;
1931 /* If ACK arrived pointing to a remembered SACK, it means that our
1932 * remembered SACKs do not reflect real state of receiver i.e.
1933 * receiver _host_ is heavily congested (or buggy).
1935 * Do processing similar to RTO timeout.
1937 static bool tcp_check_sack_reneging(struct sock
*sk
, int flag
)
1939 if (flag
& FLAG_SACK_RENEGING
) {
1940 struct inet_connection_sock
*icsk
= inet_csk(sk
);
1941 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPSACKRENEGING
);
1943 tcp_enter_loss(sk
, 1);
1944 icsk
->icsk_retransmits
++;
1945 tcp_retransmit_skb(sk
, tcp_write_queue_head(sk
));
1946 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_RETRANS
,
1947 icsk
->icsk_rto
, TCP_RTO_MAX
);
1953 static inline int tcp_fackets_out(const struct tcp_sock
*tp
)
1955 return tcp_is_reno(tp
) ? tp
->sacked_out
+ 1 : tp
->fackets_out
;
1958 /* Heurestics to calculate number of duplicate ACKs. There's no dupACKs
1959 * counter when SACK is enabled (without SACK, sacked_out is used for
1962 * Instead, with FACK TCP uses fackets_out that includes both SACKed
1963 * segments up to the highest received SACK block so far and holes in
1966 * With reordering, holes may still be in flight, so RFC3517 recovery
1967 * uses pure sacked_out (total number of SACKed segments) even though
1968 * it violates the RFC that uses duplicate ACKs, often these are equal
1969 * but when e.g. out-of-window ACKs or packet duplication occurs,
1970 * they differ. Since neither occurs due to loss, TCP should really
1973 static inline int tcp_dupack_heuristics(const struct tcp_sock
*tp
)
1975 return tcp_is_fack(tp
) ? tp
->fackets_out
: tp
->sacked_out
+ 1;
1978 static bool tcp_pause_early_retransmit(struct sock
*sk
, int flag
)
1980 struct tcp_sock
*tp
= tcp_sk(sk
);
1981 unsigned long delay
;
1983 /* Delay early retransmit and entering fast recovery for
1984 * max(RTT/4, 2msec) unless ack has ECE mark, no RTT samples
1985 * available, or RTO is scheduled to fire first.
1987 if (sysctl_tcp_early_retrans
< 2 || sysctl_tcp_early_retrans
> 3 ||
1988 (flag
& FLAG_ECE
) || !tp
->srtt
)
1991 delay
= max_t(unsigned long, (tp
->srtt
>> 5), msecs_to_jiffies(2));
1992 if (!time_after(inet_csk(sk
)->icsk_timeout
, (jiffies
+ delay
)))
1995 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_EARLY_RETRANS
, delay
,
2000 static inline int tcp_skb_timedout(const struct sock
*sk
,
2001 const struct sk_buff
*skb
)
2003 return tcp_time_stamp
- TCP_SKB_CB(skb
)->when
> inet_csk(sk
)->icsk_rto
;
2006 static inline int tcp_head_timedout(const struct sock
*sk
)
2008 const struct tcp_sock
*tp
= tcp_sk(sk
);
2010 return tp
->packets_out
&&
2011 tcp_skb_timedout(sk
, tcp_write_queue_head(sk
));
2014 /* Linux NewReno/SACK/FACK/ECN state machine.
2015 * --------------------------------------
2017 * "Open" Normal state, no dubious events, fast path.
2018 * "Disorder" In all the respects it is "Open",
2019 * but requires a bit more attention. It is entered when
2020 * we see some SACKs or dupacks. It is split of "Open"
2021 * mainly to move some processing from fast path to slow one.
2022 * "CWR" CWND was reduced due to some Congestion Notification event.
2023 * It can be ECN, ICMP source quench, local device congestion.
2024 * "Recovery" CWND was reduced, we are fast-retransmitting.
2025 * "Loss" CWND was reduced due to RTO timeout or SACK reneging.
2027 * tcp_fastretrans_alert() is entered:
2028 * - each incoming ACK, if state is not "Open"
2029 * - when arrived ACK is unusual, namely:
2034 * Counting packets in flight is pretty simple.
2036 * in_flight = packets_out - left_out + retrans_out
2038 * packets_out is SND.NXT-SND.UNA counted in packets.
2040 * retrans_out is number of retransmitted segments.
2042 * left_out is number of segments left network, but not ACKed yet.
2044 * left_out = sacked_out + lost_out
2046 * sacked_out: Packets, which arrived to receiver out of order
2047 * and hence not ACKed. With SACKs this number is simply
2048 * amount of SACKed data. Even without SACKs
2049 * it is easy to give pretty reliable estimate of this number,
2050 * counting duplicate ACKs.
2052 * lost_out: Packets lost by network. TCP has no explicit
2053 * "loss notification" feedback from network (for now).
2054 * It means that this number can be only _guessed_.
2055 * Actually, it is the heuristics to predict lossage that
2056 * distinguishes different algorithms.
2058 * F.e. after RTO, when all the queue is considered as lost,
2059 * lost_out = packets_out and in_flight = retrans_out.
2061 * Essentially, we have now two algorithms counting
2064 * FACK: It is the simplest heuristics. As soon as we decided
2065 * that something is lost, we decide that _all_ not SACKed
2066 * packets until the most forward SACK are lost. I.e.
2067 * lost_out = fackets_out - sacked_out and left_out = fackets_out.
2068 * It is absolutely correct estimate, if network does not reorder
2069 * packets. And it loses any connection to reality when reordering
2070 * takes place. We use FACK by default until reordering
2071 * is suspected on the path to this destination.
2073 * NewReno: when Recovery is entered, we assume that one segment
2074 * is lost (classic Reno). While we are in Recovery and
2075 * a partial ACK arrives, we assume that one more packet
2076 * is lost (NewReno). This heuristics are the same in NewReno
2079 * Imagine, that's all! Forget about all this shamanism about CWND inflation
2080 * deflation etc. CWND is real congestion window, never inflated, changes
2081 * only according to classic VJ rules.
2083 * Really tricky (and requiring careful tuning) part of algorithm
2084 * is hidden in functions tcp_time_to_recover() and tcp_xmit_retransmit_queue().
2085 * The first determines the moment _when_ we should reduce CWND and,
2086 * hence, slow down forward transmission. In fact, it determines the moment
2087 * when we decide that hole is caused by loss, rather than by a reorder.
2089 * tcp_xmit_retransmit_queue() decides, _what_ we should retransmit to fill
2090 * holes, caused by lost packets.
2092 * And the most logically complicated part of algorithm is undo
2093 * heuristics. We detect false retransmits due to both too early
2094 * fast retransmit (reordering) and underestimated RTO, analyzing
2095 * timestamps and D-SACKs. When we detect that some segments were
2096 * retransmitted by mistake and CWND reduction was wrong, we undo
2097 * window reduction and abort recovery phase. This logic is hidden
2098 * inside several functions named tcp_try_undo_<something>.
2101 /* This function decides, when we should leave Disordered state
2102 * and enter Recovery phase, reducing congestion window.
2104 * Main question: may we further continue forward transmission
2105 * with the same cwnd?
2107 static bool tcp_time_to_recover(struct sock
*sk
, int flag
)
2109 struct tcp_sock
*tp
= tcp_sk(sk
);
2112 /* Trick#1: The loss is proven. */
2116 /* Not-A-Trick#2 : Classic rule... */
2117 if (tcp_dupack_heuristics(tp
) > tp
->reordering
)
2120 /* Trick#3 : when we use RFC2988 timer restart, fast
2121 * retransmit can be triggered by timeout of queue head.
2123 if (tcp_is_fack(tp
) && tcp_head_timedout(sk
))
2126 /* Trick#4: It is still not OK... But will it be useful to delay
2129 packets_out
= tp
->packets_out
;
2130 if (packets_out
<= tp
->reordering
&&
2131 tp
->sacked_out
>= max_t(__u32
, packets_out
/2, sysctl_tcp_reordering
) &&
2132 !tcp_may_send_now(sk
)) {
2133 /* We have nothing to send. This connection is limited
2134 * either by receiver window or by application.
2139 /* If a thin stream is detected, retransmit after first
2140 * received dupack. Employ only if SACK is supported in order
2141 * to avoid possible corner-case series of spurious retransmissions
2142 * Use only if there are no unsent data.
2144 if ((tp
->thin_dupack
|| sysctl_tcp_thin_dupack
) &&
2145 tcp_stream_is_thin(tp
) && tcp_dupack_heuristics(tp
) > 1 &&
2146 tcp_is_sack(tp
) && !tcp_send_head(sk
))
2149 /* Trick#6: TCP early retransmit, per RFC5827. To avoid spurious
2150 * retransmissions due to small network reorderings, we implement
2151 * Mitigation A.3 in the RFC and delay the retransmission for a short
2152 * interval if appropriate.
2154 if (tp
->do_early_retrans
&& !tp
->retrans_out
&& tp
->sacked_out
&&
2155 (tp
->packets_out
>= (tp
->sacked_out
+ 1) && tp
->packets_out
< 4) &&
2156 !tcp_may_send_now(sk
))
2157 return !tcp_pause_early_retransmit(sk
, flag
);
2162 /* New heuristics: it is possible only after we switched to restart timer
2163 * each time when something is ACKed. Hence, we can detect timed out packets
2164 * during fast retransmit without falling to slow start.
2166 * Usefulness of this as is very questionable, since we should know which of
2167 * the segments is the next to timeout which is relatively expensive to find
2168 * in general case unless we add some data structure just for that. The
2169 * current approach certainly won't find the right one too often and when it
2170 * finally does find _something_ it usually marks large part of the window
2171 * right away (because a retransmission with a larger timestamp blocks the
2172 * loop from advancing). -ij
2174 static void tcp_timeout_skbs(struct sock
*sk
)
2176 struct tcp_sock
*tp
= tcp_sk(sk
);
2177 struct sk_buff
*skb
;
2179 if (!tcp_is_fack(tp
) || !tcp_head_timedout(sk
))
2182 skb
= tp
->scoreboard_skb_hint
;
2183 if (tp
->scoreboard_skb_hint
== NULL
)
2184 skb
= tcp_write_queue_head(sk
);
2186 tcp_for_write_queue_from(skb
, sk
) {
2187 if (skb
== tcp_send_head(sk
))
2189 if (!tcp_skb_timedout(sk
, skb
))
2192 tcp_skb_mark_lost(tp
, skb
);
2195 tp
->scoreboard_skb_hint
= skb
;
2197 tcp_verify_left_out(tp
);
2200 /* Detect loss in event "A" above by marking head of queue up as lost.
2201 * For FACK or non-SACK(Reno) senders, the first "packets" number of segments
2202 * are considered lost. For RFC3517 SACK, a segment is considered lost if it
2203 * has at least tp->reordering SACKed seqments above it; "packets" refers to
2204 * the maximum SACKed segments to pass before reaching this limit.
2206 static void tcp_mark_head_lost(struct sock
*sk
, int packets
, int mark_head
)
2208 struct tcp_sock
*tp
= tcp_sk(sk
);
2209 struct sk_buff
*skb
;
2213 /* Use SACK to deduce losses of new sequences sent during recovery */
2214 const u32 loss_high
= tcp_is_sack(tp
) ? tp
->snd_nxt
: tp
->high_seq
;
2216 WARN_ON(packets
> tp
->packets_out
);
2217 if (tp
->lost_skb_hint
) {
2218 skb
= tp
->lost_skb_hint
;
2219 cnt
= tp
->lost_cnt_hint
;
2220 /* Head already handled? */
2221 if (mark_head
&& skb
!= tcp_write_queue_head(sk
))
2224 skb
= tcp_write_queue_head(sk
);
2228 tcp_for_write_queue_from(skb
, sk
) {
2229 if (skb
== tcp_send_head(sk
))
2231 /* TODO: do this better */
2232 /* this is not the most efficient way to do this... */
2233 tp
->lost_skb_hint
= skb
;
2234 tp
->lost_cnt_hint
= cnt
;
2236 if (after(TCP_SKB_CB(skb
)->end_seq
, loss_high
))
2240 if (tcp_is_fack(tp
) || tcp_is_reno(tp
) ||
2241 (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
))
2242 cnt
+= tcp_skb_pcount(skb
);
2244 if (cnt
> packets
) {
2245 if ((tcp_is_sack(tp
) && !tcp_is_fack(tp
)) ||
2246 (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
) ||
2247 (oldcnt
>= packets
))
2250 mss
= skb_shinfo(skb
)->gso_size
;
2251 err
= tcp_fragment(sk
, skb
, (packets
- oldcnt
) * mss
, mss
);
2257 tcp_skb_mark_lost(tp
, skb
);
2262 tcp_verify_left_out(tp
);
2265 /* Account newly detected lost packet(s) */
2267 static void tcp_update_scoreboard(struct sock
*sk
, int fast_rexmit
)
2269 struct tcp_sock
*tp
= tcp_sk(sk
);
2271 if (tcp_is_reno(tp
)) {
2272 tcp_mark_head_lost(sk
, 1, 1);
2273 } else if (tcp_is_fack(tp
)) {
2274 int lost
= tp
->fackets_out
- tp
->reordering
;
2277 tcp_mark_head_lost(sk
, lost
, 0);
2279 int sacked_upto
= tp
->sacked_out
- tp
->reordering
;
2280 if (sacked_upto
>= 0)
2281 tcp_mark_head_lost(sk
, sacked_upto
, 0);
2282 else if (fast_rexmit
)
2283 tcp_mark_head_lost(sk
, 1, 1);
2286 tcp_timeout_skbs(sk
);
2289 /* CWND moderation, preventing bursts due to too big ACKs
2290 * in dubious situations.
2292 static inline void tcp_moderate_cwnd(struct tcp_sock
*tp
)
2294 tp
->snd_cwnd
= min(tp
->snd_cwnd
,
2295 tcp_packets_in_flight(tp
) + tcp_max_burst(tp
));
2296 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
2299 /* Nothing was retransmitted or returned timestamp is less
2300 * than timestamp of the first retransmission.
2302 static inline bool tcp_packet_delayed(const struct tcp_sock
*tp
)
2304 return !tp
->retrans_stamp
||
2305 (tp
->rx_opt
.saw_tstamp
&& tp
->rx_opt
.rcv_tsecr
&&
2306 before(tp
->rx_opt
.rcv_tsecr
, tp
->retrans_stamp
));
2309 /* Undo procedures. */
2311 #if FASTRETRANS_DEBUG > 1
2312 static void DBGUNDO(struct sock
*sk
, const char *msg
)
2314 struct tcp_sock
*tp
= tcp_sk(sk
);
2315 struct inet_sock
*inet
= inet_sk(sk
);
2317 if (sk
->sk_family
== AF_INET
) {
2318 pr_debug("Undo %s %pI4/%u c%u l%u ss%u/%u p%u\n",
2320 &inet
->inet_daddr
, ntohs(inet
->inet_dport
),
2321 tp
->snd_cwnd
, tcp_left_out(tp
),
2322 tp
->snd_ssthresh
, tp
->prior_ssthresh
,
2325 #if IS_ENABLED(CONFIG_IPV6)
2326 else if (sk
->sk_family
== AF_INET6
) {
2327 struct ipv6_pinfo
*np
= inet6_sk(sk
);
2328 pr_debug("Undo %s %pI6/%u c%u l%u ss%u/%u p%u\n",
2330 &np
->daddr
, ntohs(inet
->inet_dport
),
2331 tp
->snd_cwnd
, tcp_left_out(tp
),
2332 tp
->snd_ssthresh
, tp
->prior_ssthresh
,
2338 #define DBGUNDO(x...) do { } while (0)
2341 static void tcp_undo_cwr(struct sock
*sk
, const bool undo_ssthresh
)
2343 struct tcp_sock
*tp
= tcp_sk(sk
);
2345 if (tp
->prior_ssthresh
) {
2346 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
2348 if (icsk
->icsk_ca_ops
->undo_cwnd
)
2349 tp
->snd_cwnd
= icsk
->icsk_ca_ops
->undo_cwnd(sk
);
2351 tp
->snd_cwnd
= max(tp
->snd_cwnd
, tp
->snd_ssthresh
<< 1);
2353 if (undo_ssthresh
&& tp
->prior_ssthresh
> tp
->snd_ssthresh
) {
2354 tp
->snd_ssthresh
= tp
->prior_ssthresh
;
2355 TCP_ECN_withdraw_cwr(tp
);
2358 tp
->snd_cwnd
= max(tp
->snd_cwnd
, tp
->snd_ssthresh
);
2360 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
2363 static inline bool tcp_may_undo(const struct tcp_sock
*tp
)
2365 return tp
->undo_marker
&& (!tp
->undo_retrans
|| tcp_packet_delayed(tp
));
2368 /* People celebrate: "We love our President!" */
2369 static bool tcp_try_undo_recovery(struct sock
*sk
)
2371 struct tcp_sock
*tp
= tcp_sk(sk
);
2373 if (tcp_may_undo(tp
)) {
2376 /* Happy end! We did not retransmit anything
2377 * or our original transmission succeeded.
2379 DBGUNDO(sk
, inet_csk(sk
)->icsk_ca_state
== TCP_CA_Loss
? "loss" : "retrans");
2380 tcp_undo_cwr(sk
, true);
2381 if (inet_csk(sk
)->icsk_ca_state
== TCP_CA_Loss
)
2382 mib_idx
= LINUX_MIB_TCPLOSSUNDO
;
2384 mib_idx
= LINUX_MIB_TCPFULLUNDO
;
2386 NET_INC_STATS_BH(sock_net(sk
), mib_idx
);
2387 tp
->undo_marker
= 0;
2389 if (tp
->snd_una
== tp
->high_seq
&& tcp_is_reno(tp
)) {
2390 /* Hold old state until something *above* high_seq
2391 * is ACKed. For Reno it is MUST to prevent false
2392 * fast retransmits (RFC2582). SACK TCP is safe. */
2393 tcp_moderate_cwnd(tp
);
2396 tcp_set_ca_state(sk
, TCP_CA_Open
);
2400 /* Try to undo cwnd reduction, because D-SACKs acked all retransmitted data */
2401 static void tcp_try_undo_dsack(struct sock
*sk
)
2403 struct tcp_sock
*tp
= tcp_sk(sk
);
2405 if (tp
->undo_marker
&& !tp
->undo_retrans
) {
2406 DBGUNDO(sk
, "D-SACK");
2407 tcp_undo_cwr(sk
, true);
2408 tp
->undo_marker
= 0;
2409 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPDSACKUNDO
);
2413 /* We can clear retrans_stamp when there are no retransmissions in the
2414 * window. It would seem that it is trivially available for us in
2415 * tp->retrans_out, however, that kind of assumptions doesn't consider
2416 * what will happen if errors occur when sending retransmission for the
2417 * second time. ...It could the that such segment has only
2418 * TCPCB_EVER_RETRANS set at the present time. It seems that checking
2419 * the head skb is enough except for some reneging corner cases that
2420 * are not worth the effort.
2422 * Main reason for all this complexity is the fact that connection dying
2423 * time now depends on the validity of the retrans_stamp, in particular,
2424 * that successive retransmissions of a segment must not advance
2425 * retrans_stamp under any conditions.
2427 static bool tcp_any_retrans_done(const struct sock
*sk
)
2429 const struct tcp_sock
*tp
= tcp_sk(sk
);
2430 struct sk_buff
*skb
;
2432 if (tp
->retrans_out
)
2435 skb
= tcp_write_queue_head(sk
);
2436 if (unlikely(skb
&& TCP_SKB_CB(skb
)->sacked
& TCPCB_EVER_RETRANS
))
2442 /* Undo during fast recovery after partial ACK. */
2444 static int tcp_try_undo_partial(struct sock
*sk
, int acked
)
2446 struct tcp_sock
*tp
= tcp_sk(sk
);
2447 /* Partial ACK arrived. Force Hoe's retransmit. */
2448 int failed
= tcp_is_reno(tp
) || (tcp_fackets_out(tp
) > tp
->reordering
);
2450 if (tcp_may_undo(tp
)) {
2451 /* Plain luck! Hole if filled with delayed
2452 * packet, rather than with a retransmit.
2454 if (!tcp_any_retrans_done(sk
))
2455 tp
->retrans_stamp
= 0;
2457 tcp_update_reordering(sk
, tcp_fackets_out(tp
) + acked
, 1);
2460 tcp_undo_cwr(sk
, false);
2461 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPPARTIALUNDO
);
2463 /* So... Do not make Hoe's retransmit yet.
2464 * If the first packet was delayed, the rest
2465 * ones are most probably delayed as well.
2472 /* Undo during loss recovery after partial ACK or using F-RTO. */
2473 static bool tcp_try_undo_loss(struct sock
*sk
, bool frto_undo
)
2475 struct tcp_sock
*tp
= tcp_sk(sk
);
2477 if (frto_undo
|| tcp_may_undo(tp
)) {
2478 struct sk_buff
*skb
;
2479 tcp_for_write_queue(skb
, sk
) {
2480 if (skb
== tcp_send_head(sk
))
2482 TCP_SKB_CB(skb
)->sacked
&= ~TCPCB_LOST
;
2485 tcp_clear_all_retrans_hints(tp
);
2487 DBGUNDO(sk
, "partial loss");
2489 tcp_undo_cwr(sk
, true);
2490 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPLOSSUNDO
);
2492 NET_INC_STATS_BH(sock_net(sk
),
2493 LINUX_MIB_TCPSPURIOUSRTOS
);
2494 inet_csk(sk
)->icsk_retransmits
= 0;
2495 tp
->undo_marker
= 0;
2496 if (frto_undo
|| tcp_is_sack(tp
))
2497 tcp_set_ca_state(sk
, TCP_CA_Open
);
2503 /* The cwnd reduction in CWR and Recovery use the PRR algorithm
2504 * https://datatracker.ietf.org/doc/draft-ietf-tcpm-proportional-rate-reduction/
2505 * It computes the number of packets to send (sndcnt) based on packets newly
2507 * 1) If the packets in flight is larger than ssthresh, PRR spreads the
2508 * cwnd reductions across a full RTT.
2509 * 2) If packets in flight is lower than ssthresh (such as due to excess
2510 * losses and/or application stalls), do not perform any further cwnd
2511 * reductions, but instead slow start up to ssthresh.
2513 static void tcp_init_cwnd_reduction(struct sock
*sk
, const bool set_ssthresh
)
2515 struct tcp_sock
*tp
= tcp_sk(sk
);
2517 tp
->high_seq
= tp
->snd_nxt
;
2518 tp
->tlp_high_seq
= 0;
2519 tp
->snd_cwnd_cnt
= 0;
2520 tp
->prior_cwnd
= tp
->snd_cwnd
;
2521 tp
->prr_delivered
= 0;
2524 tp
->snd_ssthresh
= inet_csk(sk
)->icsk_ca_ops
->ssthresh(sk
);
2525 TCP_ECN_queue_cwr(tp
);
2528 static void tcp_cwnd_reduction(struct sock
*sk
, int newly_acked_sacked
,
2531 struct tcp_sock
*tp
= tcp_sk(sk
);
2533 int delta
= tp
->snd_ssthresh
- tcp_packets_in_flight(tp
);
2535 tp
->prr_delivered
+= newly_acked_sacked
;
2536 if (tcp_packets_in_flight(tp
) > tp
->snd_ssthresh
) {
2537 u64 dividend
= (u64
)tp
->snd_ssthresh
* tp
->prr_delivered
+
2539 sndcnt
= div_u64(dividend
, tp
->prior_cwnd
) - tp
->prr_out
;
2541 sndcnt
= min_t(int, delta
,
2542 max_t(int, tp
->prr_delivered
- tp
->prr_out
,
2543 newly_acked_sacked
) + 1);
2546 sndcnt
= max(sndcnt
, (fast_rexmit
? 1 : 0));
2547 tp
->snd_cwnd
= tcp_packets_in_flight(tp
) + sndcnt
;
2550 static inline void tcp_end_cwnd_reduction(struct sock
*sk
)
2552 struct tcp_sock
*tp
= tcp_sk(sk
);
2554 /* Reset cwnd to ssthresh in CWR or Recovery (unless it's undone) */
2555 if (inet_csk(sk
)->icsk_ca_state
== TCP_CA_CWR
||
2556 (tp
->undo_marker
&& tp
->snd_ssthresh
< TCP_INFINITE_SSTHRESH
)) {
2557 tp
->snd_cwnd
= tp
->snd_ssthresh
;
2558 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
2560 tcp_ca_event(sk
, CA_EVENT_COMPLETE_CWR
);
2563 /* Enter CWR state. Disable cwnd undo since congestion is proven with ECN */
2564 void tcp_enter_cwr(struct sock
*sk
, const int set_ssthresh
)
2566 struct tcp_sock
*tp
= tcp_sk(sk
);
2568 tp
->prior_ssthresh
= 0;
2569 if (inet_csk(sk
)->icsk_ca_state
< TCP_CA_CWR
) {
2570 tp
->undo_marker
= 0;
2571 tcp_init_cwnd_reduction(sk
, set_ssthresh
);
2572 tcp_set_ca_state(sk
, TCP_CA_CWR
);
2576 static void tcp_try_keep_open(struct sock
*sk
)
2578 struct tcp_sock
*tp
= tcp_sk(sk
);
2579 int state
= TCP_CA_Open
;
2581 if (tcp_left_out(tp
) || tcp_any_retrans_done(sk
))
2582 state
= TCP_CA_Disorder
;
2584 if (inet_csk(sk
)->icsk_ca_state
!= state
) {
2585 tcp_set_ca_state(sk
, state
);
2586 tp
->high_seq
= tp
->snd_nxt
;
2590 static void tcp_try_to_open(struct sock
*sk
, int flag
, int newly_acked_sacked
)
2592 struct tcp_sock
*tp
= tcp_sk(sk
);
2594 tcp_verify_left_out(tp
);
2596 if (!tcp_any_retrans_done(sk
))
2597 tp
->retrans_stamp
= 0;
2599 if (flag
& FLAG_ECE
)
2600 tcp_enter_cwr(sk
, 1);
2602 if (inet_csk(sk
)->icsk_ca_state
!= TCP_CA_CWR
) {
2603 tcp_try_keep_open(sk
);
2604 if (inet_csk(sk
)->icsk_ca_state
!= TCP_CA_Open
)
2605 tcp_moderate_cwnd(tp
);
2607 tcp_cwnd_reduction(sk
, newly_acked_sacked
, 0);
2611 static void tcp_mtup_probe_failed(struct sock
*sk
)
2613 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2615 icsk
->icsk_mtup
.search_high
= icsk
->icsk_mtup
.probe_size
- 1;
2616 icsk
->icsk_mtup
.probe_size
= 0;
2619 static void tcp_mtup_probe_success(struct sock
*sk
)
2621 struct tcp_sock
*tp
= tcp_sk(sk
);
2622 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2624 /* FIXME: breaks with very large cwnd */
2625 tp
->prior_ssthresh
= tcp_current_ssthresh(sk
);
2626 tp
->snd_cwnd
= tp
->snd_cwnd
*
2627 tcp_mss_to_mtu(sk
, tp
->mss_cache
) /
2628 icsk
->icsk_mtup
.probe_size
;
2629 tp
->snd_cwnd_cnt
= 0;
2630 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
2631 tp
->snd_ssthresh
= tcp_current_ssthresh(sk
);
2633 icsk
->icsk_mtup
.search_low
= icsk
->icsk_mtup
.probe_size
;
2634 icsk
->icsk_mtup
.probe_size
= 0;
2635 tcp_sync_mss(sk
, icsk
->icsk_pmtu_cookie
);
2638 /* Do a simple retransmit without using the backoff mechanisms in
2639 * tcp_timer. This is used for path mtu discovery.
2640 * The socket is already locked here.
2642 void tcp_simple_retransmit(struct sock
*sk
)
2644 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
2645 struct tcp_sock
*tp
= tcp_sk(sk
);
2646 struct sk_buff
*skb
;
2647 unsigned int mss
= tcp_current_mss(sk
);
2648 u32 prior_lost
= tp
->lost_out
;
2650 tcp_for_write_queue(skb
, sk
) {
2651 if (skb
== tcp_send_head(sk
))
2653 if (tcp_skb_seglen(skb
) > mss
&&
2654 !(TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
)) {
2655 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_RETRANS
) {
2656 TCP_SKB_CB(skb
)->sacked
&= ~TCPCB_SACKED_RETRANS
;
2657 tp
->retrans_out
-= tcp_skb_pcount(skb
);
2659 tcp_skb_mark_lost_uncond_verify(tp
, skb
);
2663 tcp_clear_retrans_hints_partial(tp
);
2665 if (prior_lost
== tp
->lost_out
)
2668 if (tcp_is_reno(tp
))
2669 tcp_limit_reno_sacked(tp
);
2671 tcp_verify_left_out(tp
);
2673 /* Don't muck with the congestion window here.
2674 * Reason is that we do not increase amount of _data_
2675 * in network, but units changed and effective
2676 * cwnd/ssthresh really reduced now.
2678 if (icsk
->icsk_ca_state
!= TCP_CA_Loss
) {
2679 tp
->high_seq
= tp
->snd_nxt
;
2680 tp
->snd_ssthresh
= tcp_current_ssthresh(sk
);
2681 tp
->prior_ssthresh
= 0;
2682 tp
->undo_marker
= 0;
2683 tcp_set_ca_state(sk
, TCP_CA_Loss
);
2685 tcp_xmit_retransmit_queue(sk
);
2687 EXPORT_SYMBOL(tcp_simple_retransmit
);
2689 static void tcp_enter_recovery(struct sock
*sk
, bool ece_ack
)
2691 struct tcp_sock
*tp
= tcp_sk(sk
);
2694 if (tcp_is_reno(tp
))
2695 mib_idx
= LINUX_MIB_TCPRENORECOVERY
;
2697 mib_idx
= LINUX_MIB_TCPSACKRECOVERY
;
2699 NET_INC_STATS_BH(sock_net(sk
), mib_idx
);
2701 tp
->prior_ssthresh
= 0;
2702 tp
->undo_marker
= tp
->snd_una
;
2703 tp
->undo_retrans
= tp
->retrans_out
? : -1;
2705 if (inet_csk(sk
)->icsk_ca_state
< TCP_CA_CWR
) {
2707 tp
->prior_ssthresh
= tcp_current_ssthresh(sk
);
2708 tcp_init_cwnd_reduction(sk
, true);
2710 tcp_set_ca_state(sk
, TCP_CA_Recovery
);
2713 /* Process an ACK in CA_Loss state. Move to CA_Open if lost data are
2714 * recovered or spurious. Otherwise retransmits more on partial ACKs.
2716 static void tcp_process_loss(struct sock
*sk
, int flag
, bool is_dupack
)
2718 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2719 struct tcp_sock
*tp
= tcp_sk(sk
);
2720 bool recovered
= !before(tp
->snd_una
, tp
->high_seq
);
2722 if (tp
->frto
) { /* F-RTO RFC5682 sec 3.1 (sack enhanced version). */
2723 /* Step 3.b. A timeout is spurious if not all data are
2724 * lost, i.e., never-retransmitted data are (s)acked.
2726 if (tcp_try_undo_loss(sk
, flag
& FLAG_ORIG_SACK_ACKED
))
2729 if (after(tp
->snd_nxt
, tp
->high_seq
) &&
2730 (flag
& FLAG_DATA_SACKED
|| is_dupack
)) {
2731 tp
->frto
= 0; /* Loss was real: 2nd part of step 3.a */
2732 } else if (flag
& FLAG_SND_UNA_ADVANCED
&& !recovered
) {
2733 tp
->high_seq
= tp
->snd_nxt
;
2734 __tcp_push_pending_frames(sk
, tcp_current_mss(sk
),
2736 if (after(tp
->snd_nxt
, tp
->high_seq
))
2737 return; /* Step 2.b */
2743 /* F-RTO RFC5682 sec 3.1 step 2.a and 1st part of step 3.a */
2744 icsk
->icsk_retransmits
= 0;
2745 tcp_try_undo_recovery(sk
);
2748 if (flag
& FLAG_DATA_ACKED
)
2749 icsk
->icsk_retransmits
= 0;
2750 if (tcp_is_reno(tp
)) {
2751 /* A Reno DUPACK means new data in F-RTO step 2.b above are
2752 * delivered. Lower inflight to clock out (re)tranmissions.
2754 if (after(tp
->snd_nxt
, tp
->high_seq
) && is_dupack
)
2755 tcp_add_reno_sack(sk
);
2756 else if (flag
& FLAG_SND_UNA_ADVANCED
)
2757 tcp_reset_reno_sack(tp
);
2759 if (tcp_try_undo_loss(sk
, false))
2761 tcp_xmit_retransmit_queue(sk
);
2764 /* Process an event, which can update packets-in-flight not trivially.
2765 * Main goal of this function is to calculate new estimate for left_out,
2766 * taking into account both packets sitting in receiver's buffer and
2767 * packets lost by network.
2769 * Besides that it does CWND reduction, when packet loss is detected
2770 * and changes state of machine.
2772 * It does _not_ decide what to send, it is made in function
2773 * tcp_xmit_retransmit_queue().
2775 static void tcp_fastretrans_alert(struct sock
*sk
, int pkts_acked
,
2776 int prior_sacked
, int prior_packets
,
2777 bool is_dupack
, int flag
)
2779 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2780 struct tcp_sock
*tp
= tcp_sk(sk
);
2781 int do_lost
= is_dupack
|| ((flag
& FLAG_DATA_SACKED
) &&
2782 (tcp_fackets_out(tp
) > tp
->reordering
));
2783 int newly_acked_sacked
= 0;
2784 int fast_rexmit
= 0;
2786 if (WARN_ON(!tp
->packets_out
&& tp
->sacked_out
))
2788 if (WARN_ON(!tp
->sacked_out
&& tp
->fackets_out
))
2789 tp
->fackets_out
= 0;
2791 /* Now state machine starts.
2792 * A. ECE, hence prohibit cwnd undoing, the reduction is required. */
2793 if (flag
& FLAG_ECE
)
2794 tp
->prior_ssthresh
= 0;
2796 /* B. In all the states check for reneging SACKs. */
2797 if (tcp_check_sack_reneging(sk
, flag
))
2800 /* C. Check consistency of the current state. */
2801 tcp_verify_left_out(tp
);
2803 /* D. Check state exit conditions. State can be terminated
2804 * when high_seq is ACKed. */
2805 if (icsk
->icsk_ca_state
== TCP_CA_Open
) {
2806 WARN_ON(tp
->retrans_out
!= 0);
2807 tp
->retrans_stamp
= 0;
2808 } else if (!before(tp
->snd_una
, tp
->high_seq
)) {
2809 switch (icsk
->icsk_ca_state
) {
2811 /* CWR is to be held something *above* high_seq
2812 * is ACKed for CWR bit to reach receiver. */
2813 if (tp
->snd_una
!= tp
->high_seq
) {
2814 tcp_end_cwnd_reduction(sk
);
2815 tcp_set_ca_state(sk
, TCP_CA_Open
);
2819 case TCP_CA_Recovery
:
2820 if (tcp_is_reno(tp
))
2821 tcp_reset_reno_sack(tp
);
2822 if (tcp_try_undo_recovery(sk
))
2824 tcp_end_cwnd_reduction(sk
);
2829 /* E. Process state. */
2830 switch (icsk
->icsk_ca_state
) {
2831 case TCP_CA_Recovery
:
2832 if (!(flag
& FLAG_SND_UNA_ADVANCED
)) {
2833 if (tcp_is_reno(tp
) && is_dupack
)
2834 tcp_add_reno_sack(sk
);
2836 do_lost
= tcp_try_undo_partial(sk
, pkts_acked
);
2837 newly_acked_sacked
= prior_packets
- tp
->packets_out
+
2838 tp
->sacked_out
- prior_sacked
;
2841 tcp_process_loss(sk
, flag
, is_dupack
);
2842 if (icsk
->icsk_ca_state
!= TCP_CA_Open
)
2844 /* Fall through to processing in Open state. */
2846 if (tcp_is_reno(tp
)) {
2847 if (flag
& FLAG_SND_UNA_ADVANCED
)
2848 tcp_reset_reno_sack(tp
);
2850 tcp_add_reno_sack(sk
);
2852 newly_acked_sacked
= prior_packets
- tp
->packets_out
+
2853 tp
->sacked_out
- prior_sacked
;
2855 if (icsk
->icsk_ca_state
<= TCP_CA_Disorder
)
2856 tcp_try_undo_dsack(sk
);
2858 if (!tcp_time_to_recover(sk
, flag
)) {
2859 tcp_try_to_open(sk
, flag
, newly_acked_sacked
);
2863 /* MTU probe failure: don't reduce cwnd */
2864 if (icsk
->icsk_ca_state
< TCP_CA_CWR
&&
2865 icsk
->icsk_mtup
.probe_size
&&
2866 tp
->snd_una
== tp
->mtu_probe
.probe_seq_start
) {
2867 tcp_mtup_probe_failed(sk
);
2868 /* Restores the reduction we did in tcp_mtup_probe() */
2870 tcp_simple_retransmit(sk
);
2874 /* Otherwise enter Recovery state */
2875 tcp_enter_recovery(sk
, (flag
& FLAG_ECE
));
2879 if (do_lost
|| (tcp_is_fack(tp
) && tcp_head_timedout(sk
)))
2880 tcp_update_scoreboard(sk
, fast_rexmit
);
2881 tcp_cwnd_reduction(sk
, newly_acked_sacked
, fast_rexmit
);
2882 tcp_xmit_retransmit_queue(sk
);
2885 void tcp_valid_rtt_meas(struct sock
*sk
, u32 seq_rtt
)
2887 tcp_rtt_estimator(sk
, seq_rtt
);
2889 inet_csk(sk
)->icsk_backoff
= 0;
2891 EXPORT_SYMBOL(tcp_valid_rtt_meas
);
2893 /* Read draft-ietf-tcplw-high-performance before mucking
2894 * with this code. (Supersedes RFC1323)
2896 static void tcp_ack_saw_tstamp(struct sock
*sk
, int flag
)
2898 /* RTTM Rule: A TSecr value received in a segment is used to
2899 * update the averaged RTT measurement only if the segment
2900 * acknowledges some new data, i.e., only if it advances the
2901 * left edge of the send window.
2903 * See draft-ietf-tcplw-high-performance-00, section 3.3.
2904 * 1998/04/10 Andrey V. Savochkin <saw@msu.ru>
2906 * Changed: reset backoff as soon as we see the first valid sample.
2907 * If we do not, we get strongly overestimated rto. With timestamps
2908 * samples are accepted even from very old segments: f.e., when rtt=1
2909 * increases to 8, we retransmit 5 times and after 8 seconds delayed
2910 * answer arrives rto becomes 120 seconds! If at least one of segments
2911 * in window is lost... Voila. --ANK (010210)
2913 struct tcp_sock
*tp
= tcp_sk(sk
);
2915 tcp_valid_rtt_meas(sk
, tcp_time_stamp
- tp
->rx_opt
.rcv_tsecr
);
2918 static void tcp_ack_no_tstamp(struct sock
*sk
, u32 seq_rtt
, int flag
)
2920 /* We don't have a timestamp. Can only use
2921 * packets that are not retransmitted to determine
2922 * rtt estimates. Also, we must not reset the
2923 * backoff for rto until we get a non-retransmitted
2924 * packet. This allows us to deal with a situation
2925 * where the network delay has increased suddenly.
2926 * I.e. Karn's algorithm. (SIGCOMM '87, p5.)
2929 if (flag
& FLAG_RETRANS_DATA_ACKED
)
2932 tcp_valid_rtt_meas(sk
, seq_rtt
);
2935 static inline void tcp_ack_update_rtt(struct sock
*sk
, const int flag
,
2938 const struct tcp_sock
*tp
= tcp_sk(sk
);
2939 /* Note that peer MAY send zero echo. In this case it is ignored. (rfc1323) */
2940 if (tp
->rx_opt
.saw_tstamp
&& tp
->rx_opt
.rcv_tsecr
)
2941 tcp_ack_saw_tstamp(sk
, flag
);
2942 else if (seq_rtt
>= 0)
2943 tcp_ack_no_tstamp(sk
, seq_rtt
, flag
);
2946 static void tcp_cong_avoid(struct sock
*sk
, u32 ack
, u32 in_flight
)
2948 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
2949 icsk
->icsk_ca_ops
->cong_avoid(sk
, ack
, in_flight
);
2950 tcp_sk(sk
)->snd_cwnd_stamp
= tcp_time_stamp
;
2953 /* Restart timer after forward progress on connection.
2954 * RFC2988 recommends to restart timer to now+rto.
2956 void tcp_rearm_rto(struct sock
*sk
)
2958 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
2959 struct tcp_sock
*tp
= tcp_sk(sk
);
2961 /* If the retrans timer is currently being used by Fast Open
2962 * for SYN-ACK retrans purpose, stay put.
2964 if (tp
->fastopen_rsk
)
2967 if (!tp
->packets_out
) {
2968 inet_csk_clear_xmit_timer(sk
, ICSK_TIME_RETRANS
);
2970 u32 rto
= inet_csk(sk
)->icsk_rto
;
2971 /* Offset the time elapsed after installing regular RTO */
2972 if (icsk
->icsk_pending
== ICSK_TIME_EARLY_RETRANS
||
2973 icsk
->icsk_pending
== ICSK_TIME_LOSS_PROBE
) {
2974 struct sk_buff
*skb
= tcp_write_queue_head(sk
);
2975 const u32 rto_time_stamp
= TCP_SKB_CB(skb
)->when
+ rto
;
2976 s32 delta
= (s32
)(rto_time_stamp
- tcp_time_stamp
);
2977 /* delta may not be positive if the socket is locked
2978 * when the retrans timer fires and is rescheduled.
2983 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_RETRANS
, rto
,
2988 /* This function is called when the delayed ER timer fires. TCP enters
2989 * fast recovery and performs fast-retransmit.
2991 void tcp_resume_early_retransmit(struct sock
*sk
)
2993 struct tcp_sock
*tp
= tcp_sk(sk
);
2997 /* Stop if ER is disabled after the delayed ER timer is scheduled */
2998 if (!tp
->do_early_retrans
)
3001 tcp_enter_recovery(sk
, false);
3002 tcp_update_scoreboard(sk
, 1);
3003 tcp_xmit_retransmit_queue(sk
);
3006 /* If we get here, the whole TSO packet has not been acked. */
3007 static u32
tcp_tso_acked(struct sock
*sk
, struct sk_buff
*skb
)
3009 struct tcp_sock
*tp
= tcp_sk(sk
);
3012 BUG_ON(!after(TCP_SKB_CB(skb
)->end_seq
, tp
->snd_una
));
3014 packets_acked
= tcp_skb_pcount(skb
);
3015 if (tcp_trim_head(sk
, skb
, tp
->snd_una
- TCP_SKB_CB(skb
)->seq
))
3017 packets_acked
-= tcp_skb_pcount(skb
);
3019 if (packets_acked
) {
3020 BUG_ON(tcp_skb_pcount(skb
) == 0);
3021 BUG_ON(!before(TCP_SKB_CB(skb
)->seq
, TCP_SKB_CB(skb
)->end_seq
));
3024 return packets_acked
;
3027 /* Remove acknowledged frames from the retransmission queue. If our packet
3028 * is before the ack sequence we can discard it as it's confirmed to have
3029 * arrived at the other end.
3031 static int tcp_clean_rtx_queue(struct sock
*sk
, int prior_fackets
,
3034 struct tcp_sock
*tp
= tcp_sk(sk
);
3035 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
3036 struct sk_buff
*skb
;
3037 u32 now
= tcp_time_stamp
;
3038 int fully_acked
= true;
3041 u32 reord
= tp
->packets_out
;
3042 u32 prior_sacked
= tp
->sacked_out
;
3044 s32 ca_seq_rtt
= -1;
3045 ktime_t last_ackt
= net_invalid_timestamp();
3047 while ((skb
= tcp_write_queue_head(sk
)) && skb
!= tcp_send_head(sk
)) {
3048 struct tcp_skb_cb
*scb
= TCP_SKB_CB(skb
);
3050 u8 sacked
= scb
->sacked
;
3052 /* Determine how many packets and what bytes were acked, tso and else */
3053 if (after(scb
->end_seq
, tp
->snd_una
)) {
3054 if (tcp_skb_pcount(skb
) == 1 ||
3055 !after(tp
->snd_una
, scb
->seq
))
3058 acked_pcount
= tcp_tso_acked(sk
, skb
);
3062 fully_acked
= false;
3064 acked_pcount
= tcp_skb_pcount(skb
);
3067 if (sacked
& TCPCB_RETRANS
) {
3068 if (sacked
& TCPCB_SACKED_RETRANS
)
3069 tp
->retrans_out
-= acked_pcount
;
3070 flag
|= FLAG_RETRANS_DATA_ACKED
;
3074 ca_seq_rtt
= now
- scb
->when
;
3075 last_ackt
= skb
->tstamp
;
3077 seq_rtt
= ca_seq_rtt
;
3079 if (!(sacked
& TCPCB_SACKED_ACKED
)) {
3080 reord
= min(pkts_acked
, reord
);
3081 if (!after(scb
->end_seq
, tp
->high_seq
))
3082 flag
|= FLAG_ORIG_SACK_ACKED
;
3086 if (sacked
& TCPCB_SACKED_ACKED
)
3087 tp
->sacked_out
-= acked_pcount
;
3088 if (sacked
& TCPCB_LOST
)
3089 tp
->lost_out
-= acked_pcount
;
3091 tp
->packets_out
-= acked_pcount
;
3092 pkts_acked
+= acked_pcount
;
3094 /* Initial outgoing SYN's get put onto the write_queue
3095 * just like anything else we transmit. It is not
3096 * true data, and if we misinform our callers that
3097 * this ACK acks real data, we will erroneously exit
3098 * connection startup slow start one packet too
3099 * quickly. This is severely frowned upon behavior.
3101 if (!(scb
->tcp_flags
& TCPHDR_SYN
)) {
3102 flag
|= FLAG_DATA_ACKED
;
3104 flag
|= FLAG_SYN_ACKED
;
3105 tp
->retrans_stamp
= 0;
3111 tcp_unlink_write_queue(skb
, sk
);
3112 sk_wmem_free_skb(sk
, skb
);
3113 tp
->scoreboard_skb_hint
= NULL
;
3114 if (skb
== tp
->retransmit_skb_hint
)
3115 tp
->retransmit_skb_hint
= NULL
;
3116 if (skb
== tp
->lost_skb_hint
)
3117 tp
->lost_skb_hint
= NULL
;
3120 if (likely(between(tp
->snd_up
, prior_snd_una
, tp
->snd_una
)))
3121 tp
->snd_up
= tp
->snd_una
;
3123 if (skb
&& (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
))
3124 flag
|= FLAG_SACK_RENEGING
;
3126 if (flag
& FLAG_ACKED
) {
3127 const struct tcp_congestion_ops
*ca_ops
3128 = inet_csk(sk
)->icsk_ca_ops
;
3130 if (unlikely(icsk
->icsk_mtup
.probe_size
&&
3131 !after(tp
->mtu_probe
.probe_seq_end
, tp
->snd_una
))) {
3132 tcp_mtup_probe_success(sk
);
3135 tcp_ack_update_rtt(sk
, flag
, seq_rtt
);
3138 if (tcp_is_reno(tp
)) {
3139 tcp_remove_reno_sacks(sk
, pkts_acked
);
3143 /* Non-retransmitted hole got filled? That's reordering */
3144 if (reord
< prior_fackets
)
3145 tcp_update_reordering(sk
, tp
->fackets_out
- reord
, 0);
3147 delta
= tcp_is_fack(tp
) ? pkts_acked
:
3148 prior_sacked
- tp
->sacked_out
;
3149 tp
->lost_cnt_hint
-= min(tp
->lost_cnt_hint
, delta
);
3152 tp
->fackets_out
-= min(pkts_acked
, tp
->fackets_out
);
3154 if (ca_ops
->pkts_acked
) {
3157 /* Is the ACK triggering packet unambiguous? */
3158 if (!(flag
& FLAG_RETRANS_DATA_ACKED
)) {
3159 /* High resolution needed and available? */
3160 if (ca_ops
->flags
& TCP_CONG_RTT_STAMP
&&
3161 !ktime_equal(last_ackt
,
3162 net_invalid_timestamp()))
3163 rtt_us
= ktime_us_delta(ktime_get_real(),
3165 else if (ca_seq_rtt
>= 0)
3166 rtt_us
= jiffies_to_usecs(ca_seq_rtt
);
3169 ca_ops
->pkts_acked(sk
, pkts_acked
, rtt_us
);
3173 #if FASTRETRANS_DEBUG > 0
3174 WARN_ON((int)tp
->sacked_out
< 0);
3175 WARN_ON((int)tp
->lost_out
< 0);
3176 WARN_ON((int)tp
->retrans_out
< 0);
3177 if (!tp
->packets_out
&& tcp_is_sack(tp
)) {
3178 icsk
= inet_csk(sk
);
3180 pr_debug("Leak l=%u %d\n",
3181 tp
->lost_out
, icsk
->icsk_ca_state
);
3184 if (tp
->sacked_out
) {
3185 pr_debug("Leak s=%u %d\n",
3186 tp
->sacked_out
, icsk
->icsk_ca_state
);
3189 if (tp
->retrans_out
) {
3190 pr_debug("Leak r=%u %d\n",
3191 tp
->retrans_out
, icsk
->icsk_ca_state
);
3192 tp
->retrans_out
= 0;
3199 static void tcp_ack_probe(struct sock
*sk
)
3201 const struct tcp_sock
*tp
= tcp_sk(sk
);
3202 struct inet_connection_sock
*icsk
= inet_csk(sk
);
3204 /* Was it a usable window open? */
3206 if (!after(TCP_SKB_CB(tcp_send_head(sk
))->end_seq
, tcp_wnd_end(tp
))) {
3207 icsk
->icsk_backoff
= 0;
3208 inet_csk_clear_xmit_timer(sk
, ICSK_TIME_PROBE0
);
3209 /* Socket must be waked up by subsequent tcp_data_snd_check().
3210 * This function is not for random using!
3213 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_PROBE0
,
3214 min(icsk
->icsk_rto
<< icsk
->icsk_backoff
, TCP_RTO_MAX
),
3219 static inline bool tcp_ack_is_dubious(const struct sock
*sk
, const int flag
)
3221 return !(flag
& FLAG_NOT_DUP
) || (flag
& FLAG_CA_ALERT
) ||
3222 inet_csk(sk
)->icsk_ca_state
!= TCP_CA_Open
;
3225 static inline bool tcp_may_raise_cwnd(const struct sock
*sk
, const int flag
)
3227 const struct tcp_sock
*tp
= tcp_sk(sk
);
3228 return (!(flag
& FLAG_ECE
) || tp
->snd_cwnd
< tp
->snd_ssthresh
) &&
3229 !tcp_in_cwnd_reduction(sk
);
3232 /* Check that window update is acceptable.
3233 * The function assumes that snd_una<=ack<=snd_next.
3235 static inline bool tcp_may_update_window(const struct tcp_sock
*tp
,
3236 const u32 ack
, const u32 ack_seq
,
3239 return after(ack
, tp
->snd_una
) ||
3240 after(ack_seq
, tp
->snd_wl1
) ||
3241 (ack_seq
== tp
->snd_wl1
&& nwin
> tp
->snd_wnd
);
3244 /* Update our send window.
3246 * Window update algorithm, described in RFC793/RFC1122 (used in linux-2.2
3247 * and in FreeBSD. NetBSD's one is even worse.) is wrong.
3249 static int tcp_ack_update_window(struct sock
*sk
, const struct sk_buff
*skb
, u32 ack
,
3252 struct tcp_sock
*tp
= tcp_sk(sk
);
3254 u32 nwin
= ntohs(tcp_hdr(skb
)->window
);
3256 if (likely(!tcp_hdr(skb
)->syn
))
3257 nwin
<<= tp
->rx_opt
.snd_wscale
;
3259 if (tcp_may_update_window(tp
, ack
, ack_seq
, nwin
)) {
3260 flag
|= FLAG_WIN_UPDATE
;
3261 tcp_update_wl(tp
, ack_seq
);
3263 if (tp
->snd_wnd
!= nwin
) {
3266 /* Note, it is the only place, where
3267 * fast path is recovered for sending TCP.
3270 tcp_fast_path_check(sk
);
3272 if (nwin
> tp
->max_window
) {
3273 tp
->max_window
= nwin
;
3274 tcp_sync_mss(sk
, inet_csk(sk
)->icsk_pmtu_cookie
);
3284 /* RFC 5961 7 [ACK Throttling] */
3285 static void tcp_send_challenge_ack(struct sock
*sk
)
3287 /* unprotected vars, we dont care of overwrites */
3288 static u32 challenge_timestamp
;
3289 static unsigned int challenge_count
;
3290 u32 now
= jiffies
/ HZ
;
3292 if (now
!= challenge_timestamp
) {
3293 challenge_timestamp
= now
;
3294 challenge_count
= 0;
3296 if (++challenge_count
<= sysctl_tcp_challenge_ack_limit
) {
3297 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPCHALLENGEACK
);
3302 static void tcp_store_ts_recent(struct tcp_sock
*tp
)
3304 tp
->rx_opt
.ts_recent
= tp
->rx_opt
.rcv_tsval
;
3305 tp
->rx_opt
.ts_recent_stamp
= get_seconds();
3308 static void tcp_replace_ts_recent(struct tcp_sock
*tp
, u32 seq
)
3310 if (tp
->rx_opt
.saw_tstamp
&& !after(seq
, tp
->rcv_wup
)) {
3311 /* PAWS bug workaround wrt. ACK frames, the PAWS discard
3312 * extra check below makes sure this can only happen
3313 * for pure ACK frames. -DaveM
3315 * Not only, also it occurs for expired timestamps.
3318 if (tcp_paws_check(&tp
->rx_opt
, 0))
3319 tcp_store_ts_recent(tp
);
3323 /* This routine deals with acks during a TLP episode.
3324 * Ref: loss detection algorithm in draft-dukkipati-tcpm-tcp-loss-probe.
3326 static void tcp_process_tlp_ack(struct sock
*sk
, u32 ack
, int flag
)
3328 struct tcp_sock
*tp
= tcp_sk(sk
);
3329 bool is_tlp_dupack
= (ack
== tp
->tlp_high_seq
) &&
3330 !(flag
& (FLAG_SND_UNA_ADVANCED
|
3331 FLAG_NOT_DUP
| FLAG_DATA_SACKED
));
3333 /* Mark the end of TLP episode on receiving TLP dupack or when
3334 * ack is after tlp_high_seq.
3336 if (is_tlp_dupack
) {
3337 tp
->tlp_high_seq
= 0;
3341 if (after(ack
, tp
->tlp_high_seq
)) {
3342 tp
->tlp_high_seq
= 0;
3343 /* Don't reduce cwnd if DSACK arrives for TLP retrans. */
3344 if (!(flag
& FLAG_DSACKING_ACK
)) {
3345 tcp_init_cwnd_reduction(sk
, true);
3346 tcp_set_ca_state(sk
, TCP_CA_CWR
);
3347 tcp_end_cwnd_reduction(sk
);
3348 tcp_try_keep_open(sk
);
3349 NET_INC_STATS_BH(sock_net(sk
),
3350 LINUX_MIB_TCPLOSSPROBERECOVERY
);
3355 /* This routine deals with incoming acks, but not outgoing ones. */
3356 static int tcp_ack(struct sock
*sk
, const struct sk_buff
*skb
, int flag
)
3358 struct inet_connection_sock
*icsk
= inet_csk(sk
);
3359 struct tcp_sock
*tp
= tcp_sk(sk
);
3360 u32 prior_snd_una
= tp
->snd_una
;
3361 u32 ack_seq
= TCP_SKB_CB(skb
)->seq
;
3362 u32 ack
= TCP_SKB_CB(skb
)->ack_seq
;
3363 bool is_dupack
= false;
3364 u32 prior_in_flight
, prior_cwnd
= tp
->snd_cwnd
, prior_rtt
= tp
->srtt
;
3366 int prior_packets
= tp
->packets_out
;
3367 int prior_sacked
= tp
->sacked_out
;
3369 int previous_packets_out
= 0;
3371 /* If the ack is older than previous acks
3372 * then we can probably ignore it.
3374 if (before(ack
, prior_snd_una
)) {
3375 /* RFC 5961 5.2 [Blind Data Injection Attack].[Mitigation] */
3376 if (before(ack
, prior_snd_una
- tp
->max_window
)) {
3377 tcp_send_challenge_ack(sk
);
3383 /* If the ack includes data we haven't sent yet, discard
3384 * this segment (RFC793 Section 3.9).
3386 if (after(ack
, tp
->snd_nxt
))
3389 if (icsk
->icsk_pending
== ICSK_TIME_EARLY_RETRANS
||
3390 icsk
->icsk_pending
== ICSK_TIME_LOSS_PROBE
)
3393 if (after(ack
, prior_snd_una
))
3394 flag
|= FLAG_SND_UNA_ADVANCED
;
3396 prior_fackets
= tp
->fackets_out
;
3397 prior_in_flight
= tcp_packets_in_flight(tp
);
3399 /* ts_recent update must be made after we are sure that the packet
3402 if (flag
& FLAG_UPDATE_TS_RECENT
)
3403 tcp_replace_ts_recent(tp
, TCP_SKB_CB(skb
)->seq
);
3405 if (!(flag
& FLAG_SLOWPATH
) && after(ack
, prior_snd_una
)) {
3406 /* Window is constant, pure forward advance.
3407 * No more checks are required.
3408 * Note, we use the fact that SND.UNA>=SND.WL2.
3410 tcp_update_wl(tp
, ack_seq
);
3412 flag
|= FLAG_WIN_UPDATE
;
3414 tcp_ca_event(sk
, CA_EVENT_FAST_ACK
);
3416 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPHPACKS
);
3418 if (ack_seq
!= TCP_SKB_CB(skb
)->end_seq
)
3421 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPPUREACKS
);
3423 flag
|= tcp_ack_update_window(sk
, skb
, ack
, ack_seq
);
3425 if (TCP_SKB_CB(skb
)->sacked
)
3426 flag
|= tcp_sacktag_write_queue(sk
, skb
, prior_snd_una
);
3428 if (TCP_ECN_rcv_ecn_echo(tp
, tcp_hdr(skb
)))
3431 tcp_ca_event(sk
, CA_EVENT_SLOW_ACK
);
3434 /* We passed data and got it acked, remove any soft error
3435 * log. Something worked...
3437 sk
->sk_err_soft
= 0;
3438 icsk
->icsk_probes_out
= 0;
3439 tp
->rcv_tstamp
= tcp_time_stamp
;
3443 /* See if we can take anything off of the retransmit queue. */
3444 previous_packets_out
= tp
->packets_out
;
3445 flag
|= tcp_clean_rtx_queue(sk
, prior_fackets
, prior_snd_una
);
3447 pkts_acked
= previous_packets_out
- tp
->packets_out
;
3449 if (tcp_ack_is_dubious(sk
, flag
)) {
3450 /* Advance CWND, if state allows this. */
3451 if ((flag
& FLAG_DATA_ACKED
) && tcp_may_raise_cwnd(sk
, flag
))
3452 tcp_cong_avoid(sk
, ack
, prior_in_flight
);
3453 is_dupack
= !(flag
& (FLAG_SND_UNA_ADVANCED
| FLAG_NOT_DUP
));
3454 tcp_fastretrans_alert(sk
, pkts_acked
, prior_sacked
,
3455 prior_packets
, is_dupack
, flag
);
3457 if (flag
& FLAG_DATA_ACKED
)
3458 tcp_cong_avoid(sk
, ack
, prior_in_flight
);
3461 if (tp
->tlp_high_seq
)
3462 tcp_process_tlp_ack(sk
, ack
, flag
);
3464 if ((flag
& FLAG_FORWARD_PROGRESS
) || !(flag
& FLAG_NOT_DUP
)) {
3465 struct dst_entry
*dst
= __sk_dst_get(sk
);
3470 if (icsk
->icsk_pending
== ICSK_TIME_RETRANS
)
3471 tcp_schedule_loss_probe(sk
);
3472 if (tp
->srtt
!= prior_rtt
|| tp
->snd_cwnd
!= prior_cwnd
)
3473 tcp_update_pacing_rate(sk
);
3477 /* If data was DSACKed, see if we can undo a cwnd reduction. */
3478 if (flag
& FLAG_DSACKING_ACK
)
3479 tcp_fastretrans_alert(sk
, pkts_acked
, prior_sacked
,
3480 prior_packets
, is_dupack
, flag
);
3481 /* If this ack opens up a zero window, clear backoff. It was
3482 * being used to time the probes, and is probably far higher than
3483 * it needs to be for normal retransmission.
3485 if (tcp_send_head(sk
))
3488 if (tp
->tlp_high_seq
)
3489 tcp_process_tlp_ack(sk
, ack
, flag
);
3493 SOCK_DEBUG(sk
, "Ack %u after %u:%u\n", ack
, tp
->snd_una
, tp
->snd_nxt
);
3497 /* If data was SACKed, tag it and see if we should send more data.
3498 * If data was DSACKed, see if we can undo a cwnd reduction.
3500 if (TCP_SKB_CB(skb
)->sacked
) {
3501 flag
|= tcp_sacktag_write_queue(sk
, skb
, prior_snd_una
);
3502 tcp_fastretrans_alert(sk
, pkts_acked
, prior_sacked
,
3503 prior_packets
, is_dupack
, flag
);
3506 SOCK_DEBUG(sk
, "Ack %u before %u:%u\n", ack
, tp
->snd_una
, tp
->snd_nxt
);
3510 /* Look for tcp options. Normally only called on SYN and SYNACK packets.
3511 * But, this can also be called on packets in the established flow when
3512 * the fast version below fails.
3514 void tcp_parse_options(const struct sk_buff
*skb
,
3515 struct tcp_options_received
*opt_rx
, int estab
,
3516 struct tcp_fastopen_cookie
*foc
)
3518 const unsigned char *ptr
;
3519 const struct tcphdr
*th
= tcp_hdr(skb
);
3520 int length
= (th
->doff
* 4) - sizeof(struct tcphdr
);
3522 ptr
= (const unsigned char *)(th
+ 1);
3523 opt_rx
->saw_tstamp
= 0;
3525 while (length
> 0) {
3526 int opcode
= *ptr
++;
3532 case TCPOPT_NOP
: /* Ref: RFC 793 section 3.1 */
3537 if (opsize
< 2) /* "silly options" */
3539 if (opsize
> length
)
3540 return; /* don't parse partial options */
3543 if (opsize
== TCPOLEN_MSS
&& th
->syn
&& !estab
) {
3544 u16 in_mss
= get_unaligned_be16(ptr
);
3546 if (opt_rx
->user_mss
&&
3547 opt_rx
->user_mss
< in_mss
)
3548 in_mss
= opt_rx
->user_mss
;
3549 opt_rx
->mss_clamp
= in_mss
;
3554 if (opsize
== TCPOLEN_WINDOW
&& th
->syn
&&
3555 !estab
&& sysctl_tcp_window_scaling
) {
3556 __u8 snd_wscale
= *(__u8
*)ptr
;
3557 opt_rx
->wscale_ok
= 1;
3558 if (snd_wscale
> 14) {
3559 net_info_ratelimited("%s: Illegal window scaling value %d >14 received\n",
3564 opt_rx
->snd_wscale
= snd_wscale
;
3567 case TCPOPT_TIMESTAMP
:
3568 if ((opsize
== TCPOLEN_TIMESTAMP
) &&
3569 ((estab
&& opt_rx
->tstamp_ok
) ||
3570 (!estab
&& sysctl_tcp_timestamps
))) {
3571 opt_rx
->saw_tstamp
= 1;
3572 opt_rx
->rcv_tsval
= get_unaligned_be32(ptr
);
3573 opt_rx
->rcv_tsecr
= get_unaligned_be32(ptr
+ 4);
3576 case TCPOPT_SACK_PERM
:
3577 if (opsize
== TCPOLEN_SACK_PERM
&& th
->syn
&&
3578 !estab
&& sysctl_tcp_sack
) {
3579 opt_rx
->sack_ok
= TCP_SACK_SEEN
;
3580 tcp_sack_reset(opt_rx
);
3585 if ((opsize
>= (TCPOLEN_SACK_BASE
+ TCPOLEN_SACK_PERBLOCK
)) &&
3586 !((opsize
- TCPOLEN_SACK_BASE
) % TCPOLEN_SACK_PERBLOCK
) &&
3588 TCP_SKB_CB(skb
)->sacked
= (ptr
- 2) - (unsigned char *)th
;
3591 #ifdef CONFIG_TCP_MD5SIG
3594 * The MD5 Hash has already been
3595 * checked (see tcp_v{4,6}_do_rcv()).
3600 /* Fast Open option shares code 254 using a
3601 * 16 bits magic number. It's valid only in
3602 * SYN or SYN-ACK with an even size.
3604 if (opsize
< TCPOLEN_EXP_FASTOPEN_BASE
||
3605 get_unaligned_be16(ptr
) != TCPOPT_FASTOPEN_MAGIC
||
3606 foc
== NULL
|| !th
->syn
|| (opsize
& 1))
3608 foc
->len
= opsize
- TCPOLEN_EXP_FASTOPEN_BASE
;
3609 if (foc
->len
>= TCP_FASTOPEN_COOKIE_MIN
&&
3610 foc
->len
<= TCP_FASTOPEN_COOKIE_MAX
)
3611 memcpy(foc
->val
, ptr
+ 2, foc
->len
);
3612 else if (foc
->len
!= 0)
3622 EXPORT_SYMBOL(tcp_parse_options
);
3624 static bool tcp_parse_aligned_timestamp(struct tcp_sock
*tp
, const struct tcphdr
*th
)
3626 const __be32
*ptr
= (const __be32
*)(th
+ 1);
3628 if (*ptr
== htonl((TCPOPT_NOP
<< 24) | (TCPOPT_NOP
<< 16)
3629 | (TCPOPT_TIMESTAMP
<< 8) | TCPOLEN_TIMESTAMP
)) {
3630 tp
->rx_opt
.saw_tstamp
= 1;
3632 tp
->rx_opt
.rcv_tsval
= ntohl(*ptr
);
3635 tp
->rx_opt
.rcv_tsecr
= ntohl(*ptr
) - tp
->tsoffset
;
3637 tp
->rx_opt
.rcv_tsecr
= 0;
3643 /* Fast parse options. This hopes to only see timestamps.
3644 * If it is wrong it falls back on tcp_parse_options().
3646 static bool tcp_fast_parse_options(const struct sk_buff
*skb
,
3647 const struct tcphdr
*th
, struct tcp_sock
*tp
)
3649 /* In the spirit of fast parsing, compare doff directly to constant
3650 * values. Because equality is used, short doff can be ignored here.
3652 if (th
->doff
== (sizeof(*th
) / 4)) {
3653 tp
->rx_opt
.saw_tstamp
= 0;
3655 } else if (tp
->rx_opt
.tstamp_ok
&&
3656 th
->doff
== ((sizeof(*th
) + TCPOLEN_TSTAMP_ALIGNED
) / 4)) {
3657 if (tcp_parse_aligned_timestamp(tp
, th
))
3661 tcp_parse_options(skb
, &tp
->rx_opt
, 1, NULL
);
3662 if (tp
->rx_opt
.saw_tstamp
&& tp
->rx_opt
.rcv_tsecr
)
3663 tp
->rx_opt
.rcv_tsecr
-= tp
->tsoffset
;
3668 #ifdef CONFIG_TCP_MD5SIG
3670 * Parse MD5 Signature option
3672 const u8
*tcp_parse_md5sig_option(const struct tcphdr
*th
)
3674 int length
= (th
->doff
<< 2) - sizeof(*th
);
3675 const u8
*ptr
= (const u8
*)(th
+ 1);
3677 /* If the TCP option is too short, we can short cut */
3678 if (length
< TCPOLEN_MD5SIG
)
3681 while (length
> 0) {
3682 int opcode
= *ptr
++;
3693 if (opsize
< 2 || opsize
> length
)
3695 if (opcode
== TCPOPT_MD5SIG
)
3696 return opsize
== TCPOLEN_MD5SIG
? ptr
: NULL
;
3703 EXPORT_SYMBOL(tcp_parse_md5sig_option
);
3706 /* Sorry, PAWS as specified is broken wrt. pure-ACKs -DaveM
3708 * It is not fatal. If this ACK does _not_ change critical state (seqs, window)
3709 * it can pass through stack. So, the following predicate verifies that
3710 * this segment is not used for anything but congestion avoidance or
3711 * fast retransmit. Moreover, we even are able to eliminate most of such
3712 * second order effects, if we apply some small "replay" window (~RTO)
3713 * to timestamp space.
3715 * All these measures still do not guarantee that we reject wrapped ACKs
3716 * on networks with high bandwidth, when sequence space is recycled fastly,
3717 * but it guarantees that such events will be very rare and do not affect
3718 * connection seriously. This doesn't look nice, but alas, PAWS is really
3721 * [ Later note. Even worse! It is buggy for segments _with_ data. RFC
3722 * states that events when retransmit arrives after original data are rare.
3723 * It is a blatant lie. VJ forgot about fast retransmit! 8)8) It is
3724 * the biggest problem on large power networks even with minor reordering.
3725 * OK, let's give it small replay window. If peer clock is even 1hz, it is safe
3726 * up to bandwidth of 18Gigabit/sec. 8) ]
3729 static int tcp_disordered_ack(const struct sock
*sk
, const struct sk_buff
*skb
)
3731 const struct tcp_sock
*tp
= tcp_sk(sk
);
3732 const struct tcphdr
*th
= tcp_hdr(skb
);
3733 u32 seq
= TCP_SKB_CB(skb
)->seq
;
3734 u32 ack
= TCP_SKB_CB(skb
)->ack_seq
;
3736 return (/* 1. Pure ACK with correct sequence number. */
3737 (th
->ack
&& seq
== TCP_SKB_CB(skb
)->end_seq
&& seq
== tp
->rcv_nxt
) &&
3739 /* 2. ... and duplicate ACK. */
3740 ack
== tp
->snd_una
&&
3742 /* 3. ... and does not update window. */
3743 !tcp_may_update_window(tp
, ack
, seq
, ntohs(th
->window
) << tp
->rx_opt
.snd_wscale
) &&
3745 /* 4. ... and sits in replay window. */
3746 (s32
)(tp
->rx_opt
.ts_recent
- tp
->rx_opt
.rcv_tsval
) <= (inet_csk(sk
)->icsk_rto
* 1024) / HZ
);
3749 static inline bool tcp_paws_discard(const struct sock
*sk
,
3750 const struct sk_buff
*skb
)
3752 const struct tcp_sock
*tp
= tcp_sk(sk
);
3754 return !tcp_paws_check(&tp
->rx_opt
, TCP_PAWS_WINDOW
) &&
3755 !tcp_disordered_ack(sk
, skb
);
3758 /* Check segment sequence number for validity.
3760 * Segment controls are considered valid, if the segment
3761 * fits to the window after truncation to the window. Acceptability
3762 * of data (and SYN, FIN, of course) is checked separately.
3763 * See tcp_data_queue(), for example.
3765 * Also, controls (RST is main one) are accepted using RCV.WUP instead
3766 * of RCV.NXT. Peer still did not advance his SND.UNA when we
3767 * delayed ACK, so that hisSND.UNA<=ourRCV.WUP.
3768 * (borrowed from freebsd)
3771 static inline bool tcp_sequence(const struct tcp_sock
*tp
, u32 seq
, u32 end_seq
)
3773 return !before(end_seq
, tp
->rcv_wup
) &&
3774 !after(seq
, tp
->rcv_nxt
+ tcp_receive_window(tp
));
3777 /* When we get a reset we do this. */
3778 void tcp_reset(struct sock
*sk
)
3780 /* We want the right error as BSD sees it (and indeed as we do). */
3781 switch (sk
->sk_state
) {
3783 sk
->sk_err
= ECONNREFUSED
;
3785 case TCP_CLOSE_WAIT
:
3791 sk
->sk_err
= ECONNRESET
;
3793 /* This barrier is coupled with smp_rmb() in tcp_poll() */
3796 if (!sock_flag(sk
, SOCK_DEAD
))
3797 sk
->sk_error_report(sk
);
3803 * Process the FIN bit. This now behaves as it is supposed to work
3804 * and the FIN takes effect when it is validly part of sequence
3805 * space. Not before when we get holes.
3807 * If we are ESTABLISHED, a received fin moves us to CLOSE-WAIT
3808 * (and thence onto LAST-ACK and finally, CLOSE, we never enter
3811 * If we are in FINWAIT-1, a received FIN indicates simultaneous
3812 * close and we go into CLOSING (and later onto TIME-WAIT)
3814 * If we are in FINWAIT-2, a received FIN moves us to TIME-WAIT.
3816 static void tcp_fin(struct sock
*sk
)
3818 struct tcp_sock
*tp
= tcp_sk(sk
);
3820 inet_csk_schedule_ack(sk
);
3822 sk
->sk_shutdown
|= RCV_SHUTDOWN
;
3823 sock_set_flag(sk
, SOCK_DONE
);
3825 switch (sk
->sk_state
) {
3827 case TCP_ESTABLISHED
:
3828 /* Move to CLOSE_WAIT */
3829 tcp_set_state(sk
, TCP_CLOSE_WAIT
);
3830 inet_csk(sk
)->icsk_ack
.pingpong
= 1;
3833 case TCP_CLOSE_WAIT
:
3835 /* Received a retransmission of the FIN, do
3840 /* RFC793: Remain in the LAST-ACK state. */
3844 /* This case occurs when a simultaneous close
3845 * happens, we must ack the received FIN and
3846 * enter the CLOSING state.
3849 tcp_set_state(sk
, TCP_CLOSING
);
3852 /* Received a FIN -- send ACK and enter TIME_WAIT. */
3854 tcp_time_wait(sk
, TCP_TIME_WAIT
, 0);
3857 /* Only TCP_LISTEN and TCP_CLOSE are left, in these
3858 * cases we should never reach this piece of code.
3860 pr_err("%s: Impossible, sk->sk_state=%d\n",
3861 __func__
, sk
->sk_state
);
3865 /* It _is_ possible, that we have something out-of-order _after_ FIN.
3866 * Probably, we should reset in this case. For now drop them.
3868 __skb_queue_purge(&tp
->out_of_order_queue
);
3869 if (tcp_is_sack(tp
))
3870 tcp_sack_reset(&tp
->rx_opt
);
3873 if (!sock_flag(sk
, SOCK_DEAD
)) {
3874 sk
->sk_state_change(sk
);
3876 /* Do not send POLL_HUP for half duplex close. */
3877 if (sk
->sk_shutdown
== SHUTDOWN_MASK
||
3878 sk
->sk_state
== TCP_CLOSE
)
3879 sk_wake_async(sk
, SOCK_WAKE_WAITD
, POLL_HUP
);
3881 sk_wake_async(sk
, SOCK_WAKE_WAITD
, POLL_IN
);
3885 static inline bool tcp_sack_extend(struct tcp_sack_block
*sp
, u32 seq
,
3888 if (!after(seq
, sp
->end_seq
) && !after(sp
->start_seq
, end_seq
)) {
3889 if (before(seq
, sp
->start_seq
))
3890 sp
->start_seq
= seq
;
3891 if (after(end_seq
, sp
->end_seq
))
3892 sp
->end_seq
= end_seq
;
3898 static void tcp_dsack_set(struct sock
*sk
, u32 seq
, u32 end_seq
)
3900 struct tcp_sock
*tp
= tcp_sk(sk
);
3902 if (tcp_is_sack(tp
) && sysctl_tcp_dsack
) {
3905 if (before(seq
, tp
->rcv_nxt
))
3906 mib_idx
= LINUX_MIB_TCPDSACKOLDSENT
;
3908 mib_idx
= LINUX_MIB_TCPDSACKOFOSENT
;
3910 NET_INC_STATS_BH(sock_net(sk
), mib_idx
);
3912 tp
->rx_opt
.dsack
= 1;
3913 tp
->duplicate_sack
[0].start_seq
= seq
;
3914 tp
->duplicate_sack
[0].end_seq
= end_seq
;
3918 static void tcp_dsack_extend(struct sock
*sk
, u32 seq
, u32 end_seq
)
3920 struct tcp_sock
*tp
= tcp_sk(sk
);
3922 if (!tp
->rx_opt
.dsack
)
3923 tcp_dsack_set(sk
, seq
, end_seq
);
3925 tcp_sack_extend(tp
->duplicate_sack
, seq
, end_seq
);
3928 static void tcp_send_dupack(struct sock
*sk
, const struct sk_buff
*skb
)
3930 struct tcp_sock
*tp
= tcp_sk(sk
);
3932 if (TCP_SKB_CB(skb
)->end_seq
!= TCP_SKB_CB(skb
)->seq
&&
3933 before(TCP_SKB_CB(skb
)->seq
, tp
->rcv_nxt
)) {
3934 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_DELAYEDACKLOST
);
3935 tcp_enter_quickack_mode(sk
);
3937 if (tcp_is_sack(tp
) && sysctl_tcp_dsack
) {
3938 u32 end_seq
= TCP_SKB_CB(skb
)->end_seq
;
3940 if (after(TCP_SKB_CB(skb
)->end_seq
, tp
->rcv_nxt
))
3941 end_seq
= tp
->rcv_nxt
;
3942 tcp_dsack_set(sk
, TCP_SKB_CB(skb
)->seq
, end_seq
);
3949 /* These routines update the SACK block as out-of-order packets arrive or
3950 * in-order packets close up the sequence space.
3952 static void tcp_sack_maybe_coalesce(struct tcp_sock
*tp
)
3955 struct tcp_sack_block
*sp
= &tp
->selective_acks
[0];
3956 struct tcp_sack_block
*swalk
= sp
+ 1;
3958 /* See if the recent change to the first SACK eats into
3959 * or hits the sequence space of other SACK blocks, if so coalesce.
3961 for (this_sack
= 1; this_sack
< tp
->rx_opt
.num_sacks
;) {
3962 if (tcp_sack_extend(sp
, swalk
->start_seq
, swalk
->end_seq
)) {
3965 /* Zap SWALK, by moving every further SACK up by one slot.
3966 * Decrease num_sacks.
3968 tp
->rx_opt
.num_sacks
--;
3969 for (i
= this_sack
; i
< tp
->rx_opt
.num_sacks
; i
++)
3973 this_sack
++, swalk
++;
3977 static void tcp_sack_new_ofo_skb(struct sock
*sk
, u32 seq
, u32 end_seq
)
3979 struct tcp_sock
*tp
= tcp_sk(sk
);
3980 struct tcp_sack_block
*sp
= &tp
->selective_acks
[0];
3981 int cur_sacks
= tp
->rx_opt
.num_sacks
;
3987 for (this_sack
= 0; this_sack
< cur_sacks
; this_sack
++, sp
++) {
3988 if (tcp_sack_extend(sp
, seq
, end_seq
)) {
3989 /* Rotate this_sack to the first one. */
3990 for (; this_sack
> 0; this_sack
--, sp
--)
3991 swap(*sp
, *(sp
- 1));
3993 tcp_sack_maybe_coalesce(tp
);
3998 /* Could not find an adjacent existing SACK, build a new one,
3999 * put it at the front, and shift everyone else down. We
4000 * always know there is at least one SACK present already here.
4002 * If the sack array is full, forget about the last one.
4004 if (this_sack
>= TCP_NUM_SACKS
) {
4006 tp
->rx_opt
.num_sacks
--;
4009 for (; this_sack
> 0; this_sack
--, sp
--)
4013 /* Build the new head SACK, and we're done. */
4014 sp
->start_seq
= seq
;
4015 sp
->end_seq
= end_seq
;
4016 tp
->rx_opt
.num_sacks
++;
4019 /* RCV.NXT advances, some SACKs should be eaten. */
4021 static void tcp_sack_remove(struct tcp_sock
*tp
)
4023 struct tcp_sack_block
*sp
= &tp
->selective_acks
[0];
4024 int num_sacks
= tp
->rx_opt
.num_sacks
;
4027 /* Empty ofo queue, hence, all the SACKs are eaten. Clear. */
4028 if (skb_queue_empty(&tp
->out_of_order_queue
)) {
4029 tp
->rx_opt
.num_sacks
= 0;
4033 for (this_sack
= 0; this_sack
< num_sacks
;) {
4034 /* Check if the start of the sack is covered by RCV.NXT. */
4035 if (!before(tp
->rcv_nxt
, sp
->start_seq
)) {
4038 /* RCV.NXT must cover all the block! */
4039 WARN_ON(before(tp
->rcv_nxt
, sp
->end_seq
));
4041 /* Zap this SACK, by moving forward any other SACKS. */
4042 for (i
=this_sack
+1; i
< num_sacks
; i
++)
4043 tp
->selective_acks
[i
-1] = tp
->selective_acks
[i
];
4050 tp
->rx_opt
.num_sacks
= num_sacks
;
4053 /* This one checks to see if we can put data from the
4054 * out_of_order queue into the receive_queue.
4056 static void tcp_ofo_queue(struct sock
*sk
)
4058 struct tcp_sock
*tp
= tcp_sk(sk
);
4059 __u32 dsack_high
= tp
->rcv_nxt
;
4060 struct sk_buff
*skb
;
4062 while ((skb
= skb_peek(&tp
->out_of_order_queue
)) != NULL
) {
4063 if (after(TCP_SKB_CB(skb
)->seq
, tp
->rcv_nxt
))
4066 if (before(TCP_SKB_CB(skb
)->seq
, dsack_high
)) {
4067 __u32 dsack
= dsack_high
;
4068 if (before(TCP_SKB_CB(skb
)->end_seq
, dsack_high
))
4069 dsack_high
= TCP_SKB_CB(skb
)->end_seq
;
4070 tcp_dsack_extend(sk
, TCP_SKB_CB(skb
)->seq
, dsack
);
4073 if (!after(TCP_SKB_CB(skb
)->end_seq
, tp
->rcv_nxt
)) {
4074 SOCK_DEBUG(sk
, "ofo packet was already received\n");
4075 __skb_unlink(skb
, &tp
->out_of_order_queue
);
4079 SOCK_DEBUG(sk
, "ofo requeuing : rcv_next %X seq %X - %X\n",
4080 tp
->rcv_nxt
, TCP_SKB_CB(skb
)->seq
,
4081 TCP_SKB_CB(skb
)->end_seq
);
4083 __skb_unlink(skb
, &tp
->out_of_order_queue
);
4084 __skb_queue_tail(&sk
->sk_receive_queue
, skb
);
4085 tp
->rcv_nxt
= TCP_SKB_CB(skb
)->end_seq
;
4086 if (tcp_hdr(skb
)->fin
)
4091 static bool tcp_prune_ofo_queue(struct sock
*sk
);
4092 static int tcp_prune_queue(struct sock
*sk
);
4094 static int tcp_try_rmem_schedule(struct sock
*sk
, struct sk_buff
*skb
,
4097 if (atomic_read(&sk
->sk_rmem_alloc
) > sk
->sk_rcvbuf
||
4098 !sk_rmem_schedule(sk
, skb
, size
)) {
4100 if (tcp_prune_queue(sk
) < 0)
4103 if (!sk_rmem_schedule(sk
, skb
, size
)) {
4104 if (!tcp_prune_ofo_queue(sk
))
4107 if (!sk_rmem_schedule(sk
, skb
, size
))
4115 * tcp_try_coalesce - try to merge skb to prior one
4118 * @from: buffer to add in queue
4119 * @fragstolen: pointer to boolean
4121 * Before queueing skb @from after @to, try to merge them
4122 * to reduce overall memory use and queue lengths, if cost is small.
4123 * Packets in ofo or receive queues can stay a long time.
4124 * Better try to coalesce them right now to avoid future collapses.
4125 * Returns true if caller should free @from instead of queueing it
4127 static bool tcp_try_coalesce(struct sock
*sk
,
4129 struct sk_buff
*from
,
4134 *fragstolen
= false;
4136 if (tcp_hdr(from
)->fin
)
4139 /* Its possible this segment overlaps with prior segment in queue */
4140 if (TCP_SKB_CB(from
)->seq
!= TCP_SKB_CB(to
)->end_seq
)
4143 if (!skb_try_coalesce(to
, from
, fragstolen
, &delta
))
4146 atomic_add(delta
, &sk
->sk_rmem_alloc
);
4147 sk_mem_charge(sk
, delta
);
4148 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPRCVCOALESCE
);
4149 TCP_SKB_CB(to
)->end_seq
= TCP_SKB_CB(from
)->end_seq
;
4150 TCP_SKB_CB(to
)->ack_seq
= TCP_SKB_CB(from
)->ack_seq
;
4154 static void tcp_data_queue_ofo(struct sock
*sk
, struct sk_buff
*skb
)
4156 struct tcp_sock
*tp
= tcp_sk(sk
);
4157 struct sk_buff
*skb1
;
4160 TCP_ECN_check_ce(tp
, skb
);
4162 if (unlikely(tcp_try_rmem_schedule(sk
, skb
, skb
->truesize
))) {
4163 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPOFODROP
);
4168 /* Disable header prediction. */
4170 inet_csk_schedule_ack(sk
);
4172 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPOFOQUEUE
);
4173 SOCK_DEBUG(sk
, "out of order segment: rcv_next %X seq %X - %X\n",
4174 tp
->rcv_nxt
, TCP_SKB_CB(skb
)->seq
, TCP_SKB_CB(skb
)->end_seq
);
4176 skb1
= skb_peek_tail(&tp
->out_of_order_queue
);
4178 /* Initial out of order segment, build 1 SACK. */
4179 if (tcp_is_sack(tp
)) {
4180 tp
->rx_opt
.num_sacks
= 1;
4181 tp
->selective_acks
[0].start_seq
= TCP_SKB_CB(skb
)->seq
;
4182 tp
->selective_acks
[0].end_seq
=
4183 TCP_SKB_CB(skb
)->end_seq
;
4185 __skb_queue_head(&tp
->out_of_order_queue
, skb
);
4189 seq
= TCP_SKB_CB(skb
)->seq
;
4190 end_seq
= TCP_SKB_CB(skb
)->end_seq
;
4192 if (seq
== TCP_SKB_CB(skb1
)->end_seq
) {
4195 if (!tcp_try_coalesce(sk
, skb1
, skb
, &fragstolen
)) {
4196 __skb_queue_after(&tp
->out_of_order_queue
, skb1
, skb
);
4198 kfree_skb_partial(skb
, fragstolen
);
4202 if (!tp
->rx_opt
.num_sacks
||
4203 tp
->selective_acks
[0].end_seq
!= seq
)
4206 /* Common case: data arrive in order after hole. */
4207 tp
->selective_acks
[0].end_seq
= end_seq
;
4211 /* Find place to insert this segment. */
4213 if (!after(TCP_SKB_CB(skb1
)->seq
, seq
))
4215 if (skb_queue_is_first(&tp
->out_of_order_queue
, skb1
)) {
4219 skb1
= skb_queue_prev(&tp
->out_of_order_queue
, skb1
);
4222 /* Do skb overlap to previous one? */
4223 if (skb1
&& before(seq
, TCP_SKB_CB(skb1
)->end_seq
)) {
4224 if (!after(end_seq
, TCP_SKB_CB(skb1
)->end_seq
)) {
4225 /* All the bits are present. Drop. */
4226 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPOFOMERGE
);
4229 tcp_dsack_set(sk
, seq
, end_seq
);
4232 if (after(seq
, TCP_SKB_CB(skb1
)->seq
)) {
4233 /* Partial overlap. */
4234 tcp_dsack_set(sk
, seq
,
4235 TCP_SKB_CB(skb1
)->end_seq
);
4237 if (skb_queue_is_first(&tp
->out_of_order_queue
,
4241 skb1
= skb_queue_prev(
4242 &tp
->out_of_order_queue
,
4247 __skb_queue_head(&tp
->out_of_order_queue
, skb
);
4249 __skb_queue_after(&tp
->out_of_order_queue
, skb1
, skb
);
4251 /* And clean segments covered by new one as whole. */
4252 while (!skb_queue_is_last(&tp
->out_of_order_queue
, skb
)) {
4253 skb1
= skb_queue_next(&tp
->out_of_order_queue
, skb
);
4255 if (!after(end_seq
, TCP_SKB_CB(skb1
)->seq
))
4257 if (before(end_seq
, TCP_SKB_CB(skb1
)->end_seq
)) {
4258 tcp_dsack_extend(sk
, TCP_SKB_CB(skb1
)->seq
,
4262 __skb_unlink(skb1
, &tp
->out_of_order_queue
);
4263 tcp_dsack_extend(sk
, TCP_SKB_CB(skb1
)->seq
,
4264 TCP_SKB_CB(skb1
)->end_seq
);
4265 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPOFOMERGE
);
4270 if (tcp_is_sack(tp
))
4271 tcp_sack_new_ofo_skb(sk
, seq
, end_seq
);
4274 skb_set_owner_r(skb
, sk
);
4277 static int __must_check
tcp_queue_rcv(struct sock
*sk
, struct sk_buff
*skb
, int hdrlen
,
4281 struct sk_buff
*tail
= skb_peek_tail(&sk
->sk_receive_queue
);
4283 __skb_pull(skb
, hdrlen
);
4285 tcp_try_coalesce(sk
, tail
, skb
, fragstolen
)) ? 1 : 0;
4286 tcp_sk(sk
)->rcv_nxt
= TCP_SKB_CB(skb
)->end_seq
;
4288 __skb_queue_tail(&sk
->sk_receive_queue
, skb
);
4289 skb_set_owner_r(skb
, sk
);
4294 int tcp_send_rcvq(struct sock
*sk
, struct msghdr
*msg
, size_t size
)
4296 struct sk_buff
*skb
= NULL
;
4303 skb
= alloc_skb(size
+ sizeof(*th
), sk
->sk_allocation
);
4307 if (tcp_try_rmem_schedule(sk
, skb
, size
+ sizeof(*th
)))
4310 th
= (struct tcphdr
*)skb_put(skb
, sizeof(*th
));
4311 skb_reset_transport_header(skb
);
4312 memset(th
, 0, sizeof(*th
));
4314 if (memcpy_fromiovec(skb_put(skb
, size
), msg
->msg_iov
, size
))
4317 TCP_SKB_CB(skb
)->seq
= tcp_sk(sk
)->rcv_nxt
;
4318 TCP_SKB_CB(skb
)->end_seq
= TCP_SKB_CB(skb
)->seq
+ size
;
4319 TCP_SKB_CB(skb
)->ack_seq
= tcp_sk(sk
)->snd_una
- 1;
4321 if (tcp_queue_rcv(sk
, skb
, sizeof(*th
), &fragstolen
)) {
4322 WARN_ON_ONCE(fragstolen
); /* should not happen */
4333 static void tcp_data_queue(struct sock
*sk
, struct sk_buff
*skb
)
4335 const struct tcphdr
*th
= tcp_hdr(skb
);
4336 struct tcp_sock
*tp
= tcp_sk(sk
);
4338 bool fragstolen
= false;
4340 if (TCP_SKB_CB(skb
)->seq
== TCP_SKB_CB(skb
)->end_seq
)
4344 __skb_pull(skb
, th
->doff
* 4);
4346 TCP_ECN_accept_cwr(tp
, skb
);
4348 tp
->rx_opt
.dsack
= 0;
4350 /* Queue data for delivery to the user.
4351 * Packets in sequence go to the receive queue.
4352 * Out of sequence packets to the out_of_order_queue.
4354 if (TCP_SKB_CB(skb
)->seq
== tp
->rcv_nxt
) {
4355 if (tcp_receive_window(tp
) == 0)
4358 /* Ok. In sequence. In window. */
4359 if (tp
->ucopy
.task
== current
&&
4360 tp
->copied_seq
== tp
->rcv_nxt
&& tp
->ucopy
.len
&&
4361 sock_owned_by_user(sk
) && !tp
->urg_data
) {
4362 int chunk
= min_t(unsigned int, skb
->len
,
4365 __set_current_state(TASK_RUNNING
);
4368 if (!skb_copy_datagram_iovec(skb
, 0, tp
->ucopy
.iov
, chunk
)) {
4369 tp
->ucopy
.len
-= chunk
;
4370 tp
->copied_seq
+= chunk
;
4371 eaten
= (chunk
== skb
->len
);
4372 tcp_rcv_space_adjust(sk
);
4380 tcp_try_rmem_schedule(sk
, skb
, skb
->truesize
))
4383 eaten
= tcp_queue_rcv(sk
, skb
, 0, &fragstolen
);
4385 tp
->rcv_nxt
= TCP_SKB_CB(skb
)->end_seq
;
4387 tcp_event_data_recv(sk
, skb
);
4391 if (!skb_queue_empty(&tp
->out_of_order_queue
)) {
4394 /* RFC2581. 4.2. SHOULD send immediate ACK, when
4395 * gap in queue is filled.
4397 if (skb_queue_empty(&tp
->out_of_order_queue
))
4398 inet_csk(sk
)->icsk_ack
.pingpong
= 0;
4401 if (tp
->rx_opt
.num_sacks
)
4402 tcp_sack_remove(tp
);
4404 tcp_fast_path_check(sk
);
4407 kfree_skb_partial(skb
, fragstolen
);
4408 if (!sock_flag(sk
, SOCK_DEAD
))
4409 sk
->sk_data_ready(sk
, 0);
4413 if (!after(TCP_SKB_CB(skb
)->end_seq
, tp
->rcv_nxt
)) {
4414 /* A retransmit, 2nd most common case. Force an immediate ack. */
4415 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_DELAYEDACKLOST
);
4416 tcp_dsack_set(sk
, TCP_SKB_CB(skb
)->seq
, TCP_SKB_CB(skb
)->end_seq
);
4419 tcp_enter_quickack_mode(sk
);
4420 inet_csk_schedule_ack(sk
);
4426 /* Out of window. F.e. zero window probe. */
4427 if (!before(TCP_SKB_CB(skb
)->seq
, tp
->rcv_nxt
+ tcp_receive_window(tp
)))
4430 tcp_enter_quickack_mode(sk
);
4432 if (before(TCP_SKB_CB(skb
)->seq
, tp
->rcv_nxt
)) {
4433 /* Partial packet, seq < rcv_next < end_seq */
4434 SOCK_DEBUG(sk
, "partial packet: rcv_next %X seq %X - %X\n",
4435 tp
->rcv_nxt
, TCP_SKB_CB(skb
)->seq
,
4436 TCP_SKB_CB(skb
)->end_seq
);
4438 tcp_dsack_set(sk
, TCP_SKB_CB(skb
)->seq
, tp
->rcv_nxt
);
4440 /* If window is closed, drop tail of packet. But after
4441 * remembering D-SACK for its head made in previous line.
4443 if (!tcp_receive_window(tp
))
4448 tcp_data_queue_ofo(sk
, skb
);
4451 static struct sk_buff
*tcp_collapse_one(struct sock
*sk
, struct sk_buff
*skb
,
4452 struct sk_buff_head
*list
)
4454 struct sk_buff
*next
= NULL
;
4456 if (!skb_queue_is_last(list
, skb
))
4457 next
= skb_queue_next(list
, skb
);
4459 __skb_unlink(skb
, list
);
4461 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPRCVCOLLAPSED
);
4466 /* Collapse contiguous sequence of skbs head..tail with
4467 * sequence numbers start..end.
4469 * If tail is NULL, this means until the end of the list.
4471 * Segments with FIN/SYN are not collapsed (only because this
4475 tcp_collapse(struct sock
*sk
, struct sk_buff_head
*list
,
4476 struct sk_buff
*head
, struct sk_buff
*tail
,
4479 struct sk_buff
*skb
, *n
;
4482 /* First, check that queue is collapsible and find
4483 * the point where collapsing can be useful. */
4487 skb_queue_walk_from_safe(list
, skb
, n
) {
4490 /* No new bits? It is possible on ofo queue. */
4491 if (!before(start
, TCP_SKB_CB(skb
)->end_seq
)) {
4492 skb
= tcp_collapse_one(sk
, skb
, list
);
4498 /* The first skb to collapse is:
4500 * - bloated or contains data before "start" or
4501 * overlaps to the next one.
4503 if (!tcp_hdr(skb
)->syn
&& !tcp_hdr(skb
)->fin
&&
4504 (tcp_win_from_space(skb
->truesize
) > skb
->len
||
4505 before(TCP_SKB_CB(skb
)->seq
, start
))) {
4506 end_of_skbs
= false;
4510 if (!skb_queue_is_last(list
, skb
)) {
4511 struct sk_buff
*next
= skb_queue_next(list
, skb
);
4513 TCP_SKB_CB(skb
)->end_seq
!= TCP_SKB_CB(next
)->seq
) {
4514 end_of_skbs
= false;
4519 /* Decided to skip this, advance start seq. */
4520 start
= TCP_SKB_CB(skb
)->end_seq
;
4522 if (end_of_skbs
|| tcp_hdr(skb
)->syn
|| tcp_hdr(skb
)->fin
)
4525 while (before(start
, end
)) {
4526 struct sk_buff
*nskb
;
4527 unsigned int header
= skb_headroom(skb
);
4528 int copy
= SKB_MAX_ORDER(header
, 0);
4530 /* Too big header? This can happen with IPv6. */
4533 if (end
- start
< copy
)
4535 nskb
= alloc_skb(copy
+ header
, GFP_ATOMIC
);
4539 skb_set_mac_header(nskb
, skb_mac_header(skb
) - skb
->head
);
4540 skb_set_network_header(nskb
, (skb_network_header(skb
) -
4542 skb_set_transport_header(nskb
, (skb_transport_header(skb
) -
4544 skb_reserve(nskb
, header
);
4545 memcpy(nskb
->head
, skb
->head
, header
);
4546 memcpy(nskb
->cb
, skb
->cb
, sizeof(skb
->cb
));
4547 TCP_SKB_CB(nskb
)->seq
= TCP_SKB_CB(nskb
)->end_seq
= start
;
4548 __skb_queue_before(list
, skb
, nskb
);
4549 skb_set_owner_r(nskb
, sk
);
4551 /* Copy data, releasing collapsed skbs. */
4553 int offset
= start
- TCP_SKB_CB(skb
)->seq
;
4554 int size
= TCP_SKB_CB(skb
)->end_seq
- start
;
4558 size
= min(copy
, size
);
4559 if (skb_copy_bits(skb
, offset
, skb_put(nskb
, size
), size
))
4561 TCP_SKB_CB(nskb
)->end_seq
+= size
;
4565 if (!before(start
, TCP_SKB_CB(skb
)->end_seq
)) {
4566 skb
= tcp_collapse_one(sk
, skb
, list
);
4569 tcp_hdr(skb
)->syn
||
4577 /* Collapse ofo queue. Algorithm: select contiguous sequence of skbs
4578 * and tcp_collapse() them until all the queue is collapsed.
4580 static void tcp_collapse_ofo_queue(struct sock
*sk
)
4582 struct tcp_sock
*tp
= tcp_sk(sk
);
4583 struct sk_buff
*skb
= skb_peek(&tp
->out_of_order_queue
);
4584 struct sk_buff
*head
;
4590 start
= TCP_SKB_CB(skb
)->seq
;
4591 end
= TCP_SKB_CB(skb
)->end_seq
;
4595 struct sk_buff
*next
= NULL
;
4597 if (!skb_queue_is_last(&tp
->out_of_order_queue
, skb
))
4598 next
= skb_queue_next(&tp
->out_of_order_queue
, skb
);
4601 /* Segment is terminated when we see gap or when
4602 * we are at the end of all the queue. */
4604 after(TCP_SKB_CB(skb
)->seq
, end
) ||
4605 before(TCP_SKB_CB(skb
)->end_seq
, start
)) {
4606 tcp_collapse(sk
, &tp
->out_of_order_queue
,
4607 head
, skb
, start
, end
);
4611 /* Start new segment */
4612 start
= TCP_SKB_CB(skb
)->seq
;
4613 end
= TCP_SKB_CB(skb
)->end_seq
;
4615 if (before(TCP_SKB_CB(skb
)->seq
, start
))
4616 start
= TCP_SKB_CB(skb
)->seq
;
4617 if (after(TCP_SKB_CB(skb
)->end_seq
, end
))
4618 end
= TCP_SKB_CB(skb
)->end_seq
;
4624 * Purge the out-of-order queue.
4625 * Return true if queue was pruned.
4627 static bool tcp_prune_ofo_queue(struct sock
*sk
)
4629 struct tcp_sock
*tp
= tcp_sk(sk
);
4632 if (!skb_queue_empty(&tp
->out_of_order_queue
)) {
4633 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_OFOPRUNED
);
4634 __skb_queue_purge(&tp
->out_of_order_queue
);
4636 /* Reset SACK state. A conforming SACK implementation will
4637 * do the same at a timeout based retransmit. When a connection
4638 * is in a sad state like this, we care only about integrity
4639 * of the connection not performance.
4641 if (tp
->rx_opt
.sack_ok
)
4642 tcp_sack_reset(&tp
->rx_opt
);
4649 /* Reduce allocated memory if we can, trying to get
4650 * the socket within its memory limits again.
4652 * Return less than zero if we should start dropping frames
4653 * until the socket owning process reads some of the data
4654 * to stabilize the situation.
4656 static int tcp_prune_queue(struct sock
*sk
)
4658 struct tcp_sock
*tp
= tcp_sk(sk
);
4660 SOCK_DEBUG(sk
, "prune_queue: c=%x\n", tp
->copied_seq
);
4662 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_PRUNECALLED
);
4664 if (atomic_read(&sk
->sk_rmem_alloc
) >= sk
->sk_rcvbuf
)
4665 tcp_clamp_window(sk
);
4666 else if (sk_under_memory_pressure(sk
))
4667 tp
->rcv_ssthresh
= min(tp
->rcv_ssthresh
, 4U * tp
->advmss
);
4669 tcp_collapse_ofo_queue(sk
);
4670 if (!skb_queue_empty(&sk
->sk_receive_queue
))
4671 tcp_collapse(sk
, &sk
->sk_receive_queue
,
4672 skb_peek(&sk
->sk_receive_queue
),
4674 tp
->copied_seq
, tp
->rcv_nxt
);
4677 if (atomic_read(&sk
->sk_rmem_alloc
) <= sk
->sk_rcvbuf
)
4680 /* Collapsing did not help, destructive actions follow.
4681 * This must not ever occur. */
4683 tcp_prune_ofo_queue(sk
);
4685 if (atomic_read(&sk
->sk_rmem_alloc
) <= sk
->sk_rcvbuf
)
4688 /* If we are really being abused, tell the caller to silently
4689 * drop receive data on the floor. It will get retransmitted
4690 * and hopefully then we'll have sufficient space.
4692 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_RCVPRUNED
);
4694 /* Massive buffer overcommit. */
4699 /* RFC2861, slow part. Adjust cwnd, after it was not full during one rto.
4700 * As additional protections, we do not touch cwnd in retransmission phases,
4701 * and if application hit its sndbuf limit recently.
4703 void tcp_cwnd_application_limited(struct sock
*sk
)
4705 struct tcp_sock
*tp
= tcp_sk(sk
);
4707 if (inet_csk(sk
)->icsk_ca_state
== TCP_CA_Open
&&
4708 sk
->sk_socket
&& !test_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
)) {
4709 /* Limited by application or receiver window. */
4710 u32 init_win
= tcp_init_cwnd(tp
, __sk_dst_get(sk
));
4711 u32 win_used
= max(tp
->snd_cwnd_used
, init_win
);
4712 if (win_used
< tp
->snd_cwnd
) {
4713 tp
->snd_ssthresh
= tcp_current_ssthresh(sk
);
4714 tp
->snd_cwnd
= (tp
->snd_cwnd
+ win_used
) >> 1;
4716 tp
->snd_cwnd_used
= 0;
4718 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
4721 static bool tcp_should_expand_sndbuf(const struct sock
*sk
)
4723 const struct tcp_sock
*tp
= tcp_sk(sk
);
4725 /* If the user specified a specific send buffer setting, do
4728 if (sk
->sk_userlocks
& SOCK_SNDBUF_LOCK
)
4731 /* If we are under global TCP memory pressure, do not expand. */
4732 if (sk_under_memory_pressure(sk
))
4735 /* If we are under soft global TCP memory pressure, do not expand. */
4736 if (sk_memory_allocated(sk
) >= sk_prot_mem_limits(sk
, 0))
4739 /* If we filled the congestion window, do not expand. */
4740 if (tp
->packets_out
>= tp
->snd_cwnd
)
4746 /* When incoming ACK allowed to free some skb from write_queue,
4747 * we remember this event in flag SOCK_QUEUE_SHRUNK and wake up socket
4748 * on the exit from tcp input handler.
4750 * PROBLEM: sndbuf expansion does not work well with largesend.
4752 static void tcp_new_space(struct sock
*sk
)
4754 struct tcp_sock
*tp
= tcp_sk(sk
);
4756 if (tcp_should_expand_sndbuf(sk
)) {
4757 int sndmem
= SKB_TRUESIZE(max_t(u32
,
4758 tp
->rx_opt
.mss_clamp
,
4761 int demanded
= max_t(unsigned int, tp
->snd_cwnd
,
4762 tp
->reordering
+ 1);
4763 sndmem
*= 2 * demanded
;
4764 if (sndmem
> sk
->sk_sndbuf
)
4765 sk
->sk_sndbuf
= min(sndmem
, sysctl_tcp_wmem
[2]);
4766 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
4769 sk
->sk_write_space(sk
);
4772 static void tcp_check_space(struct sock
*sk
)
4774 if (sock_flag(sk
, SOCK_QUEUE_SHRUNK
)) {
4775 sock_reset_flag(sk
, SOCK_QUEUE_SHRUNK
);
4776 if (sk
->sk_socket
&&
4777 test_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
))
4782 static inline void tcp_data_snd_check(struct sock
*sk
)
4784 tcp_push_pending_frames(sk
);
4785 tcp_check_space(sk
);
4789 * Check if sending an ack is needed.
4791 static void __tcp_ack_snd_check(struct sock
*sk
, int ofo_possible
)
4793 struct tcp_sock
*tp
= tcp_sk(sk
);
4795 /* More than one full frame received... */
4796 if (((tp
->rcv_nxt
- tp
->rcv_wup
) > inet_csk(sk
)->icsk_ack
.rcv_mss
&&
4797 /* ... and right edge of window advances far enough.
4798 * (tcp_recvmsg() will send ACK otherwise). Or...
4800 __tcp_select_window(sk
) >= tp
->rcv_wnd
) ||
4801 /* We ACK each frame or... */
4802 tcp_in_quickack_mode(sk
) ||
4803 /* We have out of order data. */
4804 (ofo_possible
&& skb_peek(&tp
->out_of_order_queue
))) {
4805 /* Then ack it now */
4808 /* Else, send delayed ack. */
4809 tcp_send_delayed_ack(sk
);
4813 static inline void tcp_ack_snd_check(struct sock
*sk
)
4815 if (!inet_csk_ack_scheduled(sk
)) {
4816 /* We sent a data segment already. */
4819 __tcp_ack_snd_check(sk
, 1);
4823 * This routine is only called when we have urgent data
4824 * signaled. Its the 'slow' part of tcp_urg. It could be
4825 * moved inline now as tcp_urg is only called from one
4826 * place. We handle URGent data wrong. We have to - as
4827 * BSD still doesn't use the correction from RFC961.
4828 * For 1003.1g we should support a new option TCP_STDURG to permit
4829 * either form (or just set the sysctl tcp_stdurg).
4832 static void tcp_check_urg(struct sock
*sk
, const struct tcphdr
*th
)
4834 struct tcp_sock
*tp
= tcp_sk(sk
);
4835 u32 ptr
= ntohs(th
->urg_ptr
);
4837 if (ptr
&& !sysctl_tcp_stdurg
)
4839 ptr
+= ntohl(th
->seq
);
4841 /* Ignore urgent data that we've already seen and read. */
4842 if (after(tp
->copied_seq
, ptr
))
4845 /* Do not replay urg ptr.
4847 * NOTE: interesting situation not covered by specs.
4848 * Misbehaving sender may send urg ptr, pointing to segment,
4849 * which we already have in ofo queue. We are not able to fetch
4850 * such data and will stay in TCP_URG_NOTYET until will be eaten
4851 * by recvmsg(). Seems, we are not obliged to handle such wicked
4852 * situations. But it is worth to think about possibility of some
4853 * DoSes using some hypothetical application level deadlock.
4855 if (before(ptr
, tp
->rcv_nxt
))
4858 /* Do we already have a newer (or duplicate) urgent pointer? */
4859 if (tp
->urg_data
&& !after(ptr
, tp
->urg_seq
))
4862 /* Tell the world about our new urgent pointer. */
4865 /* We may be adding urgent data when the last byte read was
4866 * urgent. To do this requires some care. We cannot just ignore
4867 * tp->copied_seq since we would read the last urgent byte again
4868 * as data, nor can we alter copied_seq until this data arrives
4869 * or we break the semantics of SIOCATMARK (and thus sockatmark())
4871 * NOTE. Double Dutch. Rendering to plain English: author of comment
4872 * above did something sort of send("A", MSG_OOB); send("B", MSG_OOB);
4873 * and expect that both A and B disappear from stream. This is _wrong_.
4874 * Though this happens in BSD with high probability, this is occasional.
4875 * Any application relying on this is buggy. Note also, that fix "works"
4876 * only in this artificial test. Insert some normal data between A and B and we will
4877 * decline of BSD again. Verdict: it is better to remove to trap
4880 if (tp
->urg_seq
== tp
->copied_seq
&& tp
->urg_data
&&
4881 !sock_flag(sk
, SOCK_URGINLINE
) && tp
->copied_seq
!= tp
->rcv_nxt
) {
4882 struct sk_buff
*skb
= skb_peek(&sk
->sk_receive_queue
);
4884 if (skb
&& !before(tp
->copied_seq
, TCP_SKB_CB(skb
)->end_seq
)) {
4885 __skb_unlink(skb
, &sk
->sk_receive_queue
);
4890 tp
->urg_data
= TCP_URG_NOTYET
;
4893 /* Disable header prediction. */
4897 /* This is the 'fast' part of urgent handling. */
4898 static void tcp_urg(struct sock
*sk
, struct sk_buff
*skb
, const struct tcphdr
*th
)
4900 struct tcp_sock
*tp
= tcp_sk(sk
);
4902 /* Check if we get a new urgent pointer - normally not. */
4904 tcp_check_urg(sk
, th
);
4906 /* Do we wait for any urgent data? - normally not... */
4907 if (tp
->urg_data
== TCP_URG_NOTYET
) {
4908 u32 ptr
= tp
->urg_seq
- ntohl(th
->seq
) + (th
->doff
* 4) -
4911 /* Is the urgent pointer pointing into this packet? */
4912 if (ptr
< skb
->len
) {
4914 if (skb_copy_bits(skb
, ptr
, &tmp
, 1))
4916 tp
->urg_data
= TCP_URG_VALID
| tmp
;
4917 if (!sock_flag(sk
, SOCK_DEAD
))
4918 sk
->sk_data_ready(sk
, 0);
4923 static int tcp_copy_to_iovec(struct sock
*sk
, struct sk_buff
*skb
, int hlen
)
4925 struct tcp_sock
*tp
= tcp_sk(sk
);
4926 int chunk
= skb
->len
- hlen
;
4930 if (skb_csum_unnecessary(skb
))
4931 err
= skb_copy_datagram_iovec(skb
, hlen
, tp
->ucopy
.iov
, chunk
);
4933 err
= skb_copy_and_csum_datagram_iovec(skb
, hlen
,
4937 tp
->ucopy
.len
-= chunk
;
4938 tp
->copied_seq
+= chunk
;
4939 tcp_rcv_space_adjust(sk
);
4946 static __sum16
__tcp_checksum_complete_user(struct sock
*sk
,
4947 struct sk_buff
*skb
)
4951 if (sock_owned_by_user(sk
)) {
4953 result
= __tcp_checksum_complete(skb
);
4956 result
= __tcp_checksum_complete(skb
);
4961 static inline bool tcp_checksum_complete_user(struct sock
*sk
,
4962 struct sk_buff
*skb
)
4964 return !skb_csum_unnecessary(skb
) &&
4965 __tcp_checksum_complete_user(sk
, skb
);
4968 #ifdef CONFIG_NET_DMA
4969 static bool tcp_dma_try_early_copy(struct sock
*sk
, struct sk_buff
*skb
,
4972 struct tcp_sock
*tp
= tcp_sk(sk
);
4973 int chunk
= skb
->len
- hlen
;
4975 bool copied_early
= false;
4977 if (tp
->ucopy
.wakeup
)
4980 if (!tp
->ucopy
.dma_chan
&& tp
->ucopy
.pinned_list
)
4981 tp
->ucopy
.dma_chan
= net_dma_find_channel();
4983 if (tp
->ucopy
.dma_chan
&& skb_csum_unnecessary(skb
)) {
4985 dma_cookie
= dma_skb_copy_datagram_iovec(tp
->ucopy
.dma_chan
,
4987 tp
->ucopy
.iov
, chunk
,
4988 tp
->ucopy
.pinned_list
);
4993 tp
->ucopy
.dma_cookie
= dma_cookie
;
4994 copied_early
= true;
4996 tp
->ucopy
.len
-= chunk
;
4997 tp
->copied_seq
+= chunk
;
4998 tcp_rcv_space_adjust(sk
);
5000 if ((tp
->ucopy
.len
== 0) ||
5001 (tcp_flag_word(tcp_hdr(skb
)) & TCP_FLAG_PSH
) ||
5002 (atomic_read(&sk
->sk_rmem_alloc
) > (sk
->sk_rcvbuf
>> 1))) {
5003 tp
->ucopy
.wakeup
= 1;
5004 sk
->sk_data_ready(sk
, 0);
5006 } else if (chunk
> 0) {
5007 tp
->ucopy
.wakeup
= 1;
5008 sk
->sk_data_ready(sk
, 0);
5011 return copied_early
;
5013 #endif /* CONFIG_NET_DMA */
5015 /* Does PAWS and seqno based validation of an incoming segment, flags will
5016 * play significant role here.
5018 static bool tcp_validate_incoming(struct sock
*sk
, struct sk_buff
*skb
,
5019 const struct tcphdr
*th
, int syn_inerr
)
5021 struct tcp_sock
*tp
= tcp_sk(sk
);
5023 /* RFC1323: H1. Apply PAWS check first. */
5024 if (tcp_fast_parse_options(skb
, th
, tp
) && tp
->rx_opt
.saw_tstamp
&&
5025 tcp_paws_discard(sk
, skb
)) {
5027 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_PAWSESTABREJECTED
);
5028 tcp_send_dupack(sk
, skb
);
5031 /* Reset is accepted even if it did not pass PAWS. */
5034 /* Step 1: check sequence number */
5035 if (!tcp_sequence(tp
, TCP_SKB_CB(skb
)->seq
, TCP_SKB_CB(skb
)->end_seq
)) {
5036 /* RFC793, page 37: "In all states except SYN-SENT, all reset
5037 * (RST) segments are validated by checking their SEQ-fields."
5038 * And page 69: "If an incoming segment is not acceptable,
5039 * an acknowledgment should be sent in reply (unless the RST
5040 * bit is set, if so drop the segment and return)".
5045 tcp_send_dupack(sk
, skb
);
5050 /* Step 2: check RST bit */
5053 * If sequence number exactly matches RCV.NXT, then
5054 * RESET the connection
5056 * Send a challenge ACK
5058 if (TCP_SKB_CB(skb
)->seq
== tp
->rcv_nxt
)
5061 tcp_send_challenge_ack(sk
);
5065 /* step 3: check security and precedence [ignored] */
5067 /* step 4: Check for a SYN
5068 * RFC 5691 4.2 : Send a challenge ack
5073 TCP_INC_STATS_BH(sock_net(sk
), TCP_MIB_INERRS
);
5074 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPSYNCHALLENGE
);
5075 tcp_send_challenge_ack(sk
);
5087 * TCP receive function for the ESTABLISHED state.
5089 * It is split into a fast path and a slow path. The fast path is
5091 * - A zero window was announced from us - zero window probing
5092 * is only handled properly in the slow path.
5093 * - Out of order segments arrived.
5094 * - Urgent data is expected.
5095 * - There is no buffer space left
5096 * - Unexpected TCP flags/window values/header lengths are received
5097 * (detected by checking the TCP header against pred_flags)
5098 * - Data is sent in both directions. Fast path only supports pure senders
5099 * or pure receivers (this means either the sequence number or the ack
5100 * value must stay constant)
5101 * - Unexpected TCP option.
5103 * When these conditions are not satisfied it drops into a standard
5104 * receive procedure patterned after RFC793 to handle all cases.
5105 * The first three cases are guaranteed by proper pred_flags setting,
5106 * the rest is checked inline. Fast processing is turned on in
5107 * tcp_data_queue when everything is OK.
5109 int tcp_rcv_established(struct sock
*sk
, struct sk_buff
*skb
,
5110 const struct tcphdr
*th
, unsigned int len
)
5112 struct tcp_sock
*tp
= tcp_sk(sk
);
5114 if (unlikely(sk
->sk_rx_dst
== NULL
))
5115 inet_csk(sk
)->icsk_af_ops
->sk_rx_dst_set(sk
, skb
);
5117 * Header prediction.
5118 * The code loosely follows the one in the famous
5119 * "30 instruction TCP receive" Van Jacobson mail.
5121 * Van's trick is to deposit buffers into socket queue
5122 * on a device interrupt, to call tcp_recv function
5123 * on the receive process context and checksum and copy
5124 * the buffer to user space. smart...
5126 * Our current scheme is not silly either but we take the
5127 * extra cost of the net_bh soft interrupt processing...
5128 * We do checksum and copy also but from device to kernel.
5131 tp
->rx_opt
.saw_tstamp
= 0;
5133 /* pred_flags is 0xS?10 << 16 + snd_wnd
5134 * if header_prediction is to be made
5135 * 'S' will always be tp->tcp_header_len >> 2
5136 * '?' will be 0 for the fast path, otherwise pred_flags is 0 to
5137 * turn it off (when there are holes in the receive
5138 * space for instance)
5139 * PSH flag is ignored.
5142 if ((tcp_flag_word(th
) & TCP_HP_BITS
) == tp
->pred_flags
&&
5143 TCP_SKB_CB(skb
)->seq
== tp
->rcv_nxt
&&
5144 !after(TCP_SKB_CB(skb
)->ack_seq
, tp
->snd_nxt
)) {
5145 int tcp_header_len
= tp
->tcp_header_len
;
5147 /* Timestamp header prediction: tcp_header_len
5148 * is automatically equal to th->doff*4 due to pred_flags
5152 /* Check timestamp */
5153 if (tcp_header_len
== sizeof(struct tcphdr
) + TCPOLEN_TSTAMP_ALIGNED
) {
5154 /* No? Slow path! */
5155 if (!tcp_parse_aligned_timestamp(tp
, th
))
5158 /* If PAWS failed, check it more carefully in slow path */
5159 if ((s32
)(tp
->rx_opt
.rcv_tsval
- tp
->rx_opt
.ts_recent
) < 0)
5162 /* DO NOT update ts_recent here, if checksum fails
5163 * and timestamp was corrupted part, it will result
5164 * in a hung connection since we will drop all
5165 * future packets due to the PAWS test.
5169 if (len
<= tcp_header_len
) {
5170 /* Bulk data transfer: sender */
5171 if (len
== tcp_header_len
) {
5172 /* Predicted packet is in window by definition.
5173 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
5174 * Hence, check seq<=rcv_wup reduces to:
5176 if (tcp_header_len
==
5177 (sizeof(struct tcphdr
) + TCPOLEN_TSTAMP_ALIGNED
) &&
5178 tp
->rcv_nxt
== tp
->rcv_wup
)
5179 tcp_store_ts_recent(tp
);
5181 /* We know that such packets are checksummed
5184 tcp_ack(sk
, skb
, 0);
5186 tcp_data_snd_check(sk
);
5188 } else { /* Header too small */
5189 TCP_INC_STATS_BH(sock_net(sk
), TCP_MIB_INERRS
);
5194 int copied_early
= 0;
5195 bool fragstolen
= false;
5197 if (tp
->copied_seq
== tp
->rcv_nxt
&&
5198 len
- tcp_header_len
<= tp
->ucopy
.len
) {
5199 #ifdef CONFIG_NET_DMA
5200 if (tp
->ucopy
.task
== current
&&
5201 sock_owned_by_user(sk
) &&
5202 tcp_dma_try_early_copy(sk
, skb
, tcp_header_len
)) {
5207 if (tp
->ucopy
.task
== current
&&
5208 sock_owned_by_user(sk
) && !copied_early
) {
5209 __set_current_state(TASK_RUNNING
);
5211 if (!tcp_copy_to_iovec(sk
, skb
, tcp_header_len
))
5215 /* Predicted packet is in window by definition.
5216 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
5217 * Hence, check seq<=rcv_wup reduces to:
5219 if (tcp_header_len
==
5220 (sizeof(struct tcphdr
) +
5221 TCPOLEN_TSTAMP_ALIGNED
) &&
5222 tp
->rcv_nxt
== tp
->rcv_wup
)
5223 tcp_store_ts_recent(tp
);
5225 tcp_rcv_rtt_measure_ts(sk
, skb
);
5227 __skb_pull(skb
, tcp_header_len
);
5228 tp
->rcv_nxt
= TCP_SKB_CB(skb
)->end_seq
;
5229 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPHPHITSTOUSER
);
5232 tcp_cleanup_rbuf(sk
, skb
->len
);
5235 if (tcp_checksum_complete_user(sk
, skb
))
5238 if ((int)skb
->truesize
> sk
->sk_forward_alloc
)
5241 /* Predicted packet is in window by definition.
5242 * seq == rcv_nxt and rcv_wup <= rcv_nxt.
5243 * Hence, check seq<=rcv_wup reduces to:
5245 if (tcp_header_len
==
5246 (sizeof(struct tcphdr
) + TCPOLEN_TSTAMP_ALIGNED
) &&
5247 tp
->rcv_nxt
== tp
->rcv_wup
)
5248 tcp_store_ts_recent(tp
);
5250 tcp_rcv_rtt_measure_ts(sk
, skb
);
5252 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPHPHITS
);
5254 /* Bulk data transfer: receiver */
5255 eaten
= tcp_queue_rcv(sk
, skb
, tcp_header_len
,
5259 tcp_event_data_recv(sk
, skb
);
5261 if (TCP_SKB_CB(skb
)->ack_seq
!= tp
->snd_una
) {
5262 /* Well, only one small jumplet in fast path... */
5263 tcp_ack(sk
, skb
, FLAG_DATA
);
5264 tcp_data_snd_check(sk
);
5265 if (!inet_csk_ack_scheduled(sk
))
5269 if (!copied_early
|| tp
->rcv_nxt
!= tp
->rcv_wup
)
5270 __tcp_ack_snd_check(sk
, 0);
5272 #ifdef CONFIG_NET_DMA
5274 __skb_queue_tail(&sk
->sk_async_wait_queue
, skb
);
5278 kfree_skb_partial(skb
, fragstolen
);
5279 sk
->sk_data_ready(sk
, 0);
5285 if (len
< (th
->doff
<< 2) || tcp_checksum_complete_user(sk
, skb
))
5288 if (!th
->ack
&& !th
->rst
)
5292 * Standard slow path.
5295 if (!tcp_validate_incoming(sk
, skb
, th
, 1))
5299 if (tcp_ack(sk
, skb
, FLAG_SLOWPATH
| FLAG_UPDATE_TS_RECENT
) < 0)
5302 tcp_rcv_rtt_measure_ts(sk
, skb
);
5304 /* Process urgent data. */
5305 tcp_urg(sk
, skb
, th
);
5307 /* step 7: process the segment text */
5308 tcp_data_queue(sk
, skb
);
5310 tcp_data_snd_check(sk
);
5311 tcp_ack_snd_check(sk
);
5315 TCP_INC_STATS_BH(sock_net(sk
), TCP_MIB_CSUMERRORS
);
5316 TCP_INC_STATS_BH(sock_net(sk
), TCP_MIB_INERRS
);
5322 EXPORT_SYMBOL(tcp_rcv_established
);
5324 void tcp_finish_connect(struct sock
*sk
, struct sk_buff
*skb
)
5326 struct tcp_sock
*tp
= tcp_sk(sk
);
5327 struct inet_connection_sock
*icsk
= inet_csk(sk
);
5329 tcp_set_state(sk
, TCP_ESTABLISHED
);
5332 icsk
->icsk_af_ops
->sk_rx_dst_set(sk
, skb
);
5333 security_inet_conn_established(sk
, skb
);
5336 /* Make sure socket is routed, for correct metrics. */
5337 icsk
->icsk_af_ops
->rebuild_header(sk
);
5339 tcp_init_metrics(sk
);
5341 tcp_init_congestion_control(sk
);
5343 /* Prevent spurious tcp_cwnd_restart() on first data
5346 tp
->lsndtime
= tcp_time_stamp
;
5348 tcp_init_buffer_space(sk
);
5350 if (sock_flag(sk
, SOCK_KEEPOPEN
))
5351 inet_csk_reset_keepalive_timer(sk
, keepalive_time_when(tp
));
5353 if (!tp
->rx_opt
.snd_wscale
)
5354 __tcp_fast_path_on(tp
, tp
->snd_wnd
);
5358 if (!sock_flag(sk
, SOCK_DEAD
)) {
5359 sk
->sk_state_change(sk
);
5360 sk_wake_async(sk
, SOCK_WAKE_IO
, POLL_OUT
);
5364 static bool tcp_rcv_fastopen_synack(struct sock
*sk
, struct sk_buff
*synack
,
5365 struct tcp_fastopen_cookie
*cookie
)
5367 struct tcp_sock
*tp
= tcp_sk(sk
);
5368 struct sk_buff
*data
= tp
->syn_data
? tcp_write_queue_head(sk
) : NULL
;
5369 u16 mss
= tp
->rx_opt
.mss_clamp
;
5372 if (mss
== tp
->rx_opt
.user_mss
) {
5373 struct tcp_options_received opt
;
5375 /* Get original SYNACK MSS value if user MSS sets mss_clamp */
5376 tcp_clear_options(&opt
);
5377 opt
.user_mss
= opt
.mss_clamp
= 0;
5378 tcp_parse_options(synack
, &opt
, 0, NULL
);
5379 mss
= opt
.mss_clamp
;
5382 if (!tp
->syn_fastopen
) /* Ignore an unsolicited cookie */
5385 /* The SYN-ACK neither has cookie nor acknowledges the data. Presumably
5386 * the remote receives only the retransmitted (regular) SYNs: either
5387 * the original SYN-data or the corresponding SYN-ACK is lost.
5389 syn_drop
= (cookie
->len
<= 0 && data
&& tp
->total_retrans
);
5391 tcp_fastopen_cache_set(sk
, mss
, cookie
, syn_drop
);
5393 if (data
) { /* Retransmit unacked data in SYN */
5394 tcp_for_write_queue_from(data
, sk
) {
5395 if (data
== tcp_send_head(sk
) ||
5396 __tcp_retransmit_skb(sk
, data
))
5402 tp
->syn_data_acked
= tp
->syn_data
;
5406 static int tcp_rcv_synsent_state_process(struct sock
*sk
, struct sk_buff
*skb
,
5407 const struct tcphdr
*th
, unsigned int len
)
5409 struct inet_connection_sock
*icsk
= inet_csk(sk
);
5410 struct tcp_sock
*tp
= tcp_sk(sk
);
5411 struct tcp_fastopen_cookie foc
= { .len
= -1 };
5412 int saved_clamp
= tp
->rx_opt
.mss_clamp
;
5414 tcp_parse_options(skb
, &tp
->rx_opt
, 0, &foc
);
5415 if (tp
->rx_opt
.saw_tstamp
&& tp
->rx_opt
.rcv_tsecr
)
5416 tp
->rx_opt
.rcv_tsecr
-= tp
->tsoffset
;
5420 * "If the state is SYN-SENT then
5421 * first check the ACK bit
5422 * If the ACK bit is set
5423 * If SEG.ACK =< ISS, or SEG.ACK > SND.NXT, send
5424 * a reset (unless the RST bit is set, if so drop
5425 * the segment and return)"
5427 if (!after(TCP_SKB_CB(skb
)->ack_seq
, tp
->snd_una
) ||
5428 after(TCP_SKB_CB(skb
)->ack_seq
, tp
->snd_nxt
))
5429 goto reset_and_undo
;
5431 if (tp
->rx_opt
.saw_tstamp
&& tp
->rx_opt
.rcv_tsecr
&&
5432 !between(tp
->rx_opt
.rcv_tsecr
, tp
->retrans_stamp
,
5434 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_PAWSACTIVEREJECTED
);
5435 goto reset_and_undo
;
5438 /* Now ACK is acceptable.
5440 * "If the RST bit is set
5441 * If the ACK was acceptable then signal the user "error:
5442 * connection reset", drop the segment, enter CLOSED state,
5443 * delete TCB, and return."
5452 * "fifth, if neither of the SYN or RST bits is set then
5453 * drop the segment and return."
5459 goto discard_and_undo
;
5462 * "If the SYN bit is on ...
5463 * are acceptable then ...
5464 * (our SYN has been ACKed), change the connection
5465 * state to ESTABLISHED..."
5468 TCP_ECN_rcv_synack(tp
, th
);
5470 tcp_init_wl(tp
, TCP_SKB_CB(skb
)->seq
);
5471 tcp_ack(sk
, skb
, FLAG_SLOWPATH
);
5473 /* Ok.. it's good. Set up sequence numbers and
5474 * move to established.
5476 tp
->rcv_nxt
= TCP_SKB_CB(skb
)->seq
+ 1;
5477 tp
->rcv_wup
= TCP_SKB_CB(skb
)->seq
+ 1;
5479 /* RFC1323: The window in SYN & SYN/ACK segments is
5482 tp
->snd_wnd
= ntohs(th
->window
);
5484 if (!tp
->rx_opt
.wscale_ok
) {
5485 tp
->rx_opt
.snd_wscale
= tp
->rx_opt
.rcv_wscale
= 0;
5486 tp
->window_clamp
= min(tp
->window_clamp
, 65535U);
5489 if (tp
->rx_opt
.saw_tstamp
) {
5490 tp
->rx_opt
.tstamp_ok
= 1;
5491 tp
->tcp_header_len
=
5492 sizeof(struct tcphdr
) + TCPOLEN_TSTAMP_ALIGNED
;
5493 tp
->advmss
-= TCPOLEN_TSTAMP_ALIGNED
;
5494 tcp_store_ts_recent(tp
);
5496 tp
->tcp_header_len
= sizeof(struct tcphdr
);
5499 if (tcp_is_sack(tp
) && sysctl_tcp_fack
)
5500 tcp_enable_fack(tp
);
5503 tcp_sync_mss(sk
, icsk
->icsk_pmtu_cookie
);
5504 tcp_initialize_rcv_mss(sk
);
5506 /* Remember, tcp_poll() does not lock socket!
5507 * Change state from SYN-SENT only after copied_seq
5508 * is initialized. */
5509 tp
->copied_seq
= tp
->rcv_nxt
;
5513 tcp_finish_connect(sk
, skb
);
5515 if ((tp
->syn_fastopen
|| tp
->syn_data
) &&
5516 tcp_rcv_fastopen_synack(sk
, skb
, &foc
))
5519 if (sk
->sk_write_pending
||
5520 icsk
->icsk_accept_queue
.rskq_defer_accept
||
5521 icsk
->icsk_ack
.pingpong
) {
5522 /* Save one ACK. Data will be ready after
5523 * several ticks, if write_pending is set.
5525 * It may be deleted, but with this feature tcpdumps
5526 * look so _wonderfully_ clever, that I was not able
5527 * to stand against the temptation 8) --ANK
5529 inet_csk_schedule_ack(sk
);
5530 icsk
->icsk_ack
.lrcvtime
= tcp_time_stamp
;
5531 tcp_enter_quickack_mode(sk
);
5532 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_DACK
,
5533 TCP_DELACK_MAX
, TCP_RTO_MAX
);
5544 /* No ACK in the segment */
5548 * "If the RST bit is set
5550 * Otherwise (no ACK) drop the segment and return."
5553 goto discard_and_undo
;
5557 if (tp
->rx_opt
.ts_recent_stamp
&& tp
->rx_opt
.saw_tstamp
&&
5558 tcp_paws_reject(&tp
->rx_opt
, 0))
5559 goto discard_and_undo
;
5562 /* We see SYN without ACK. It is attempt of
5563 * simultaneous connect with crossed SYNs.
5564 * Particularly, it can be connect to self.
5566 tcp_set_state(sk
, TCP_SYN_RECV
);
5568 if (tp
->rx_opt
.saw_tstamp
) {
5569 tp
->rx_opt
.tstamp_ok
= 1;
5570 tcp_store_ts_recent(tp
);
5571 tp
->tcp_header_len
=
5572 sizeof(struct tcphdr
) + TCPOLEN_TSTAMP_ALIGNED
;
5574 tp
->tcp_header_len
= sizeof(struct tcphdr
);
5577 tp
->rcv_nxt
= TCP_SKB_CB(skb
)->seq
+ 1;
5578 tp
->rcv_wup
= TCP_SKB_CB(skb
)->seq
+ 1;
5580 /* RFC1323: The window in SYN & SYN/ACK segments is
5583 tp
->snd_wnd
= ntohs(th
->window
);
5584 tp
->snd_wl1
= TCP_SKB_CB(skb
)->seq
;
5585 tp
->max_window
= tp
->snd_wnd
;
5587 TCP_ECN_rcv_syn(tp
, th
);
5590 tcp_sync_mss(sk
, icsk
->icsk_pmtu_cookie
);
5591 tcp_initialize_rcv_mss(sk
);
5593 tcp_send_synack(sk
);
5595 /* Note, we could accept data and URG from this segment.
5596 * There are no obstacles to make this (except that we must
5597 * either change tcp_recvmsg() to prevent it from returning data
5598 * before 3WHS completes per RFC793, or employ TCP Fast Open).
5600 * However, if we ignore data in ACKless segments sometimes,
5601 * we have no reasons to accept it sometimes.
5602 * Also, seems the code doing it in step6 of tcp_rcv_state_process
5603 * is not flawless. So, discard packet for sanity.
5604 * Uncomment this return to process the data.
5611 /* "fifth, if neither of the SYN or RST bits is set then
5612 * drop the segment and return."
5616 tcp_clear_options(&tp
->rx_opt
);
5617 tp
->rx_opt
.mss_clamp
= saved_clamp
;
5621 tcp_clear_options(&tp
->rx_opt
);
5622 tp
->rx_opt
.mss_clamp
= saved_clamp
;
5627 * This function implements the receiving procedure of RFC 793 for
5628 * all states except ESTABLISHED and TIME_WAIT.
5629 * It's called from both tcp_v4_rcv and tcp_v6_rcv and should be
5630 * address independent.
5633 int tcp_rcv_state_process(struct sock
*sk
, struct sk_buff
*skb
,
5634 const struct tcphdr
*th
, unsigned int len
)
5636 struct tcp_sock
*tp
= tcp_sk(sk
);
5637 struct inet_connection_sock
*icsk
= inet_csk(sk
);
5638 struct request_sock
*req
;
5641 tp
->rx_opt
.saw_tstamp
= 0;
5643 switch (sk
->sk_state
) {
5657 if (icsk
->icsk_af_ops
->conn_request(sk
, skb
) < 0)
5660 /* Now we have several options: In theory there is
5661 * nothing else in the frame. KA9Q has an option to
5662 * send data with the syn, BSD accepts data with the
5663 * syn up to the [to be] advertised window and
5664 * Solaris 2.1 gives you a protocol error. For now
5665 * we just ignore it, that fits the spec precisely
5666 * and avoids incompatibilities. It would be nice in
5667 * future to drop through and process the data.
5669 * Now that TTCP is starting to be used we ought to
5671 * But, this leaves one open to an easy denial of
5672 * service attack, and SYN cookies can't defend
5673 * against this problem. So, we drop the data
5674 * in the interest of security over speed unless
5675 * it's still in use.
5683 queued
= tcp_rcv_synsent_state_process(sk
, skb
, th
, len
);
5687 /* Do step6 onward by hand. */
5688 tcp_urg(sk
, skb
, th
);
5690 tcp_data_snd_check(sk
);
5694 req
= tp
->fastopen_rsk
;
5696 WARN_ON_ONCE(sk
->sk_state
!= TCP_SYN_RECV
&&
5697 sk
->sk_state
!= TCP_FIN_WAIT1
);
5699 if (tcp_check_req(sk
, skb
, req
, NULL
, true) == NULL
)
5703 if (!th
->ack
&& !th
->rst
)
5706 if (!tcp_validate_incoming(sk
, skb
, th
, 0))
5709 /* step 5: check the ACK field */
5711 int acceptable
= tcp_ack(sk
, skb
, FLAG_SLOWPATH
|
5712 FLAG_UPDATE_TS_RECENT
) > 0;
5714 switch (sk
->sk_state
) {
5717 /* Once we leave TCP_SYN_RECV, we no longer
5718 * need req so release it.
5721 tcp_synack_rtt_meas(sk
, req
);
5722 tp
->total_retrans
= req
->num_retrans
;
5724 reqsk_fastopen_remove(sk
, req
, false);
5726 /* Make sure socket is routed, for
5729 icsk
->icsk_af_ops
->rebuild_header(sk
);
5730 tcp_init_congestion_control(sk
);
5733 tcp_init_buffer_space(sk
);
5734 tp
->copied_seq
= tp
->rcv_nxt
;
5737 tcp_set_state(sk
, TCP_ESTABLISHED
);
5738 sk
->sk_state_change(sk
);
5740 /* Note, that this wakeup is only for marginal
5741 * crossed SYN case. Passively open sockets
5742 * are not waked up, because sk->sk_sleep ==
5743 * NULL and sk->sk_socket == NULL.
5747 SOCK_WAKE_IO
, POLL_OUT
);
5749 tp
->snd_una
= TCP_SKB_CB(skb
)->ack_seq
;
5750 tp
->snd_wnd
= ntohs(th
->window
) <<
5751 tp
->rx_opt
.snd_wscale
;
5752 tcp_init_wl(tp
, TCP_SKB_CB(skb
)->seq
);
5754 if (tp
->rx_opt
.tstamp_ok
)
5755 tp
->advmss
-= TCPOLEN_TSTAMP_ALIGNED
;
5758 /* Re-arm the timer because data may
5759 * have been sent out. This is similar
5760 * to the regular data transmission case
5761 * when new data has just been ack'ed.
5763 * (TFO) - we could try to be more
5764 * aggressive and retranmitting any data
5765 * sooner based on when they were sent
5770 tcp_init_metrics(sk
);
5772 tcp_update_pacing_rate(sk
);
5774 /* Prevent spurious tcp_cwnd_restart() on
5775 * first data packet.
5777 tp
->lsndtime
= tcp_time_stamp
;
5779 tcp_initialize_rcv_mss(sk
);
5780 tcp_fast_path_on(tp
);
5787 /* If we enter the TCP_FIN_WAIT1 state and we are a
5788 * Fast Open socket and this is the first acceptable
5789 * ACK we have received, this would have acknowledged
5790 * our SYNACK so stop the SYNACK timer.
5793 /* Return RST if ack_seq is invalid.
5794 * Note that RFC793 only says to generate a
5795 * DUPACK for it but for TCP Fast Open it seems
5796 * better to treat this case like TCP_SYN_RECV
5801 /* We no longer need the request sock. */
5802 reqsk_fastopen_remove(sk
, req
, false);
5805 if (tp
->snd_una
== tp
->write_seq
) {
5806 struct dst_entry
*dst
;
5808 tcp_set_state(sk
, TCP_FIN_WAIT2
);
5809 sk
->sk_shutdown
|= SEND_SHUTDOWN
;
5811 dst
= __sk_dst_get(sk
);
5815 if (!sock_flag(sk
, SOCK_DEAD
))
5816 /* Wake up lingering close() */
5817 sk
->sk_state_change(sk
);
5821 if (tp
->linger2
< 0 ||
5822 (TCP_SKB_CB(skb
)->end_seq
!= TCP_SKB_CB(skb
)->seq
&&
5823 after(TCP_SKB_CB(skb
)->end_seq
- th
->fin
, tp
->rcv_nxt
))) {
5825 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPABORTONDATA
);
5829 tmo
= tcp_fin_time(sk
);
5830 if (tmo
> TCP_TIMEWAIT_LEN
) {
5831 inet_csk_reset_keepalive_timer(sk
, tmo
- TCP_TIMEWAIT_LEN
);
5832 } else if (th
->fin
|| sock_owned_by_user(sk
)) {
5833 /* Bad case. We could lose such FIN otherwise.
5834 * It is not a big problem, but it looks confusing
5835 * and not so rare event. We still can lose it now,
5836 * if it spins in bh_lock_sock(), but it is really
5839 inet_csk_reset_keepalive_timer(sk
, tmo
);
5841 tcp_time_wait(sk
, TCP_FIN_WAIT2
, tmo
);
5849 if (tp
->snd_una
== tp
->write_seq
) {
5850 tcp_time_wait(sk
, TCP_TIME_WAIT
, 0);
5856 if (tp
->snd_una
== tp
->write_seq
) {
5857 tcp_update_metrics(sk
);
5865 /* step 6: check the URG bit */
5866 tcp_urg(sk
, skb
, th
);
5868 /* step 7: process the segment text */
5869 switch (sk
->sk_state
) {
5870 case TCP_CLOSE_WAIT
:
5873 if (!before(TCP_SKB_CB(skb
)->seq
, tp
->rcv_nxt
))
5877 /* RFC 793 says to queue data in these states,
5878 * RFC 1122 says we MUST send a reset.
5879 * BSD 4.4 also does reset.
5881 if (sk
->sk_shutdown
& RCV_SHUTDOWN
) {
5882 if (TCP_SKB_CB(skb
)->end_seq
!= TCP_SKB_CB(skb
)->seq
&&
5883 after(TCP_SKB_CB(skb
)->end_seq
- th
->fin
, tp
->rcv_nxt
)) {
5884 NET_INC_STATS_BH(sock_net(sk
), LINUX_MIB_TCPABORTONDATA
);
5890 case TCP_ESTABLISHED
:
5891 tcp_data_queue(sk
, skb
);
5896 /* tcp_data could move socket to TIME-WAIT */
5897 if (sk
->sk_state
!= TCP_CLOSE
) {
5898 tcp_data_snd_check(sk
);
5899 tcp_ack_snd_check(sk
);
5908 EXPORT_SYMBOL(tcp_rcv_state_process
);