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>
22 * Changes: Pedro Roque : Retransmit queue handled by TCP.
23 * : Fragmentation on mtu decrease
24 * : Segment collapse on retransmit
27 * Linus Torvalds : send_delayed_ack
28 * David S. Miller : Charge memory using the right skb
29 * during syn/ack processing.
30 * David S. Miller : Output engine completely rewritten.
31 * Andrea Arcangeli: SYNACK carry ts_recent in tsecr.
32 * Cacophonix Gaul : draft-minshall-nagle-01
33 * J Hadi Salim : ECN support
37 #define pr_fmt(fmt) "TCP: " fmt
41 #include <linux/compiler.h>
42 #include <linux/gfp.h>
43 #include <linux/module.h>
44 #include <linux/static_key.h>
46 #include <trace/events/tcp.h>
48 /* Refresh clocks of a TCP socket,
49 * ensuring monotically increasing values.
51 void tcp_mstamp_refresh(struct tcp_sock
*tp
)
53 u64 val
= tcp_clock_ns();
55 if (val
> tp
->tcp_clock_cache
)
56 tp
->tcp_clock_cache
= val
;
58 val
= div_u64(val
, NSEC_PER_USEC
);
59 if (val
> tp
->tcp_mstamp
)
63 static bool tcp_write_xmit(struct sock
*sk
, unsigned int mss_now
, int nonagle
,
64 int push_one
, gfp_t gfp
);
66 /* Account for new data that has been sent to the network. */
67 static void tcp_event_new_data_sent(struct sock
*sk
, struct sk_buff
*skb
)
69 struct inet_connection_sock
*icsk
= inet_csk(sk
);
70 struct tcp_sock
*tp
= tcp_sk(sk
);
71 unsigned int prior_packets
= tp
->packets_out
;
73 tp
->snd_nxt
= TCP_SKB_CB(skb
)->end_seq
;
75 __skb_unlink(skb
, &sk
->sk_write_queue
);
76 tcp_rbtree_insert(&sk
->tcp_rtx_queue
, skb
);
78 tp
->packets_out
+= tcp_skb_pcount(skb
);
79 if (!prior_packets
|| icsk
->icsk_pending
== ICSK_TIME_LOSS_PROBE
)
82 NET_ADD_STATS(sock_net(sk
), LINUX_MIB_TCPORIGDATASENT
,
86 /* SND.NXT, if window was not shrunk or the amount of shrunk was less than one
87 * window scaling factor due to loss of precision.
88 * If window has been shrunk, what should we make? It is not clear at all.
89 * Using SND.UNA we will fail to open window, SND.NXT is out of window. :-(
90 * Anything in between SND.UNA...SND.UNA+SND.WND also can be already
91 * invalid. OK, let's make this for now:
93 static inline __u32
tcp_acceptable_seq(const struct sock
*sk
)
95 const struct tcp_sock
*tp
= tcp_sk(sk
);
97 if (!before(tcp_wnd_end(tp
), tp
->snd_nxt
) ||
98 (tp
->rx_opt
.wscale_ok
&&
99 ((tp
->snd_nxt
- tcp_wnd_end(tp
)) < (1 << tp
->rx_opt
.rcv_wscale
))))
102 return tcp_wnd_end(tp
);
105 /* Calculate mss to advertise in SYN segment.
106 * RFC1122, RFC1063, draft-ietf-tcpimpl-pmtud-01 state that:
108 * 1. It is independent of path mtu.
109 * 2. Ideally, it is maximal possible segment size i.e. 65535-40.
110 * 3. For IPv4 it is reasonable to calculate it from maximal MTU of
111 * attached devices, because some buggy hosts are confused by
113 * 4. We do not make 3, we advertise MSS, calculated from first
114 * hop device mtu, but allow to raise it to ip_rt_min_advmss.
115 * This may be overridden via information stored in routing table.
116 * 5. Value 65535 for MSS is valid in IPv6 and means "as large as possible,
117 * probably even Jumbo".
119 static __u16
tcp_advertise_mss(struct sock
*sk
)
121 struct tcp_sock
*tp
= tcp_sk(sk
);
122 const struct dst_entry
*dst
= __sk_dst_get(sk
);
123 int mss
= tp
->advmss
;
126 unsigned int metric
= dst_metric_advmss(dst
);
137 /* RFC2861. Reset CWND after idle period longer RTO to "restart window".
138 * This is the first part of cwnd validation mechanism.
140 void tcp_cwnd_restart(struct sock
*sk
, s32 delta
)
142 struct tcp_sock
*tp
= tcp_sk(sk
);
143 u32 restart_cwnd
= tcp_init_cwnd(tp
, __sk_dst_get(sk
));
144 u32 cwnd
= tp
->snd_cwnd
;
146 tcp_ca_event(sk
, CA_EVENT_CWND_RESTART
);
148 tp
->snd_ssthresh
= tcp_current_ssthresh(sk
);
149 restart_cwnd
= min(restart_cwnd
, cwnd
);
151 while ((delta
-= inet_csk(sk
)->icsk_rto
) > 0 && cwnd
> restart_cwnd
)
153 tp
->snd_cwnd
= max(cwnd
, restart_cwnd
);
154 tp
->snd_cwnd_stamp
= tcp_jiffies32
;
155 tp
->snd_cwnd_used
= 0;
158 /* Congestion state accounting after a packet has been sent. */
159 static void tcp_event_data_sent(struct tcp_sock
*tp
,
162 struct inet_connection_sock
*icsk
= inet_csk(sk
);
163 const u32 now
= tcp_jiffies32
;
165 if (tcp_packets_in_flight(tp
) == 0)
166 tcp_ca_event(sk
, CA_EVENT_TX_START
);
170 /* If it is a reply for ato after last received
171 * packet, enter pingpong mode.
173 if ((u32
)(now
- icsk
->icsk_ack
.lrcvtime
) < icsk
->icsk_ack
.ato
)
174 icsk
->icsk_ack
.pingpong
= 1;
177 /* Account for an ACK we sent. */
178 static inline void tcp_event_ack_sent(struct sock
*sk
, unsigned int pkts
,
181 struct tcp_sock
*tp
= tcp_sk(sk
);
183 if (unlikely(tp
->compressed_ack
)) {
184 NET_ADD_STATS(sock_net(sk
), LINUX_MIB_TCPACKCOMPRESSED
,
186 tp
->compressed_ack
= 0;
187 if (hrtimer_try_to_cancel(&tp
->compressed_ack_timer
) == 1)
191 if (unlikely(rcv_nxt
!= tp
->rcv_nxt
))
192 return; /* Special ACK sent by DCTCP to reflect ECN */
193 tcp_dec_quickack_mode(sk
, pkts
);
194 inet_csk_clear_xmit_timer(sk
, ICSK_TIME_DACK
);
197 /* Determine a window scaling and initial window to offer.
198 * Based on the assumption that the given amount of space
199 * will be offered. Store the results in the tp structure.
200 * NOTE: for smooth operation initial space offering should
201 * be a multiple of mss if possible. We assume here that mss >= 1.
202 * This MUST be enforced by all callers.
204 void tcp_select_initial_window(const struct sock
*sk
, int __space
, __u32 mss
,
205 __u32
*rcv_wnd
, __u32
*window_clamp
,
206 int wscale_ok
, __u8
*rcv_wscale
,
209 unsigned int space
= (__space
< 0 ? 0 : __space
);
211 /* If no clamp set the clamp to the max possible scaled window */
212 if (*window_clamp
== 0)
213 (*window_clamp
) = (U16_MAX
<< TCP_MAX_WSCALE
);
214 space
= min(*window_clamp
, space
);
216 /* Quantize space offering to a multiple of mss if possible. */
218 space
= rounddown(space
, mss
);
220 /* NOTE: offering an initial window larger than 32767
221 * will break some buggy TCP stacks. If the admin tells us
222 * it is likely we could be speaking with such a buggy stack
223 * we will truncate our initial window offering to 32K-1
224 * unless the remote has sent us a window scaling option,
225 * which we interpret as a sign the remote TCP is not
226 * misinterpreting the window field as a signed quantity.
228 if (sock_net(sk
)->ipv4
.sysctl_tcp_workaround_signed_windows
)
229 (*rcv_wnd
) = min(space
, MAX_TCP_WINDOW
);
231 (*rcv_wnd
) = min_t(u32
, space
, U16_MAX
);
234 *rcv_wnd
= min(*rcv_wnd
, init_rcv_wnd
* mss
);
238 /* Set window scaling on max possible window */
239 space
= max_t(u32
, space
, sock_net(sk
)->ipv4
.sysctl_tcp_rmem
[2]);
240 space
= max_t(u32
, space
, sysctl_rmem_max
);
241 space
= min_t(u32
, space
, *window_clamp
);
242 while (space
> U16_MAX
&& (*rcv_wscale
) < TCP_MAX_WSCALE
) {
247 /* Set the clamp no higher than max representable value */
248 (*window_clamp
) = min_t(__u32
, U16_MAX
<< (*rcv_wscale
), *window_clamp
);
250 EXPORT_SYMBOL(tcp_select_initial_window
);
252 /* Chose a new window to advertise, update state in tcp_sock for the
253 * socket, and return result with RFC1323 scaling applied. The return
254 * value can be stuffed directly into th->window for an outgoing
257 static u16
tcp_select_window(struct sock
*sk
)
259 struct tcp_sock
*tp
= tcp_sk(sk
);
260 u32 old_win
= tp
->rcv_wnd
;
261 u32 cur_win
= tcp_receive_window(tp
);
262 u32 new_win
= __tcp_select_window(sk
);
264 /* Never shrink the offered window */
265 if (new_win
< cur_win
) {
266 /* Danger Will Robinson!
267 * Don't update rcv_wup/rcv_wnd here or else
268 * we will not be able to advertise a zero
269 * window in time. --DaveM
271 * Relax Will Robinson.
274 NET_INC_STATS(sock_net(sk
),
275 LINUX_MIB_TCPWANTZEROWINDOWADV
);
276 new_win
= ALIGN(cur_win
, 1 << tp
->rx_opt
.rcv_wscale
);
278 tp
->rcv_wnd
= new_win
;
279 tp
->rcv_wup
= tp
->rcv_nxt
;
281 /* Make sure we do not exceed the maximum possible
284 if (!tp
->rx_opt
.rcv_wscale
&&
285 sock_net(sk
)->ipv4
.sysctl_tcp_workaround_signed_windows
)
286 new_win
= min(new_win
, MAX_TCP_WINDOW
);
288 new_win
= min(new_win
, (65535U << tp
->rx_opt
.rcv_wscale
));
290 /* RFC1323 scaling applied */
291 new_win
>>= tp
->rx_opt
.rcv_wscale
;
293 /* If we advertise zero window, disable fast path. */
297 NET_INC_STATS(sock_net(sk
),
298 LINUX_MIB_TCPTOZEROWINDOWADV
);
299 } else if (old_win
== 0) {
300 NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPFROMZEROWINDOWADV
);
306 /* Packet ECN state for a SYN-ACK */
307 static void tcp_ecn_send_synack(struct sock
*sk
, struct sk_buff
*skb
)
309 const struct tcp_sock
*tp
= tcp_sk(sk
);
311 TCP_SKB_CB(skb
)->tcp_flags
&= ~TCPHDR_CWR
;
312 if (!(tp
->ecn_flags
& TCP_ECN_OK
))
313 TCP_SKB_CB(skb
)->tcp_flags
&= ~TCPHDR_ECE
;
314 else if (tcp_ca_needs_ecn(sk
) ||
315 tcp_bpf_ca_needs_ecn(sk
))
319 /* Packet ECN state for a SYN. */
320 static void tcp_ecn_send_syn(struct sock
*sk
, struct sk_buff
*skb
)
322 struct tcp_sock
*tp
= tcp_sk(sk
);
323 bool bpf_needs_ecn
= tcp_bpf_ca_needs_ecn(sk
);
324 bool use_ecn
= sock_net(sk
)->ipv4
.sysctl_tcp_ecn
== 1 ||
325 tcp_ca_needs_ecn(sk
) || bpf_needs_ecn
;
328 const struct dst_entry
*dst
= __sk_dst_get(sk
);
330 if (dst
&& dst_feature(dst
, RTAX_FEATURE_ECN
))
337 TCP_SKB_CB(skb
)->tcp_flags
|= TCPHDR_ECE
| TCPHDR_CWR
;
338 tp
->ecn_flags
= TCP_ECN_OK
;
339 if (tcp_ca_needs_ecn(sk
) || bpf_needs_ecn
)
344 static void tcp_ecn_clear_syn(struct sock
*sk
, struct sk_buff
*skb
)
346 if (sock_net(sk
)->ipv4
.sysctl_tcp_ecn_fallback
)
347 /* tp->ecn_flags are cleared at a later point in time when
348 * SYN ACK is ultimatively being received.
350 TCP_SKB_CB(skb
)->tcp_flags
&= ~(TCPHDR_ECE
| TCPHDR_CWR
);
354 tcp_ecn_make_synack(const struct request_sock
*req
, struct tcphdr
*th
)
356 if (inet_rsk(req
)->ecn_ok
)
360 /* Set up ECN state for a packet on a ESTABLISHED socket that is about to
363 static void tcp_ecn_send(struct sock
*sk
, struct sk_buff
*skb
,
364 struct tcphdr
*th
, int tcp_header_len
)
366 struct tcp_sock
*tp
= tcp_sk(sk
);
368 if (tp
->ecn_flags
& TCP_ECN_OK
) {
369 /* Not-retransmitted data segment: set ECT and inject CWR. */
370 if (skb
->len
!= tcp_header_len
&&
371 !before(TCP_SKB_CB(skb
)->seq
, tp
->snd_nxt
)) {
373 if (tp
->ecn_flags
& TCP_ECN_QUEUE_CWR
) {
374 tp
->ecn_flags
&= ~TCP_ECN_QUEUE_CWR
;
376 skb_shinfo(skb
)->gso_type
|= SKB_GSO_TCP_ECN
;
378 } else if (!tcp_ca_needs_ecn(sk
)) {
379 /* ACK or retransmitted segment: clear ECT|CE */
380 INET_ECN_dontxmit(sk
);
382 if (tp
->ecn_flags
& TCP_ECN_DEMAND_CWR
)
387 /* Constructs common control bits of non-data skb. If SYN/FIN is present,
388 * auto increment end seqno.
390 static void tcp_init_nondata_skb(struct sk_buff
*skb
, u32 seq
, u8 flags
)
392 skb
->ip_summed
= CHECKSUM_PARTIAL
;
394 TCP_SKB_CB(skb
)->tcp_flags
= flags
;
395 TCP_SKB_CB(skb
)->sacked
= 0;
397 tcp_skb_pcount_set(skb
, 1);
399 TCP_SKB_CB(skb
)->seq
= seq
;
400 if (flags
& (TCPHDR_SYN
| TCPHDR_FIN
))
402 TCP_SKB_CB(skb
)->end_seq
= seq
;
405 static inline bool tcp_urg_mode(const struct tcp_sock
*tp
)
407 return tp
->snd_una
!= tp
->snd_up
;
410 #define OPTION_SACK_ADVERTISE (1 << 0)
411 #define OPTION_TS (1 << 1)
412 #define OPTION_MD5 (1 << 2)
413 #define OPTION_WSCALE (1 << 3)
414 #define OPTION_FAST_OPEN_COOKIE (1 << 8)
415 #define OPTION_SMC (1 << 9)
417 static void smc_options_write(__be32
*ptr
, u16
*options
)
419 #if IS_ENABLED(CONFIG_SMC)
420 if (static_branch_unlikely(&tcp_have_smc
)) {
421 if (unlikely(OPTION_SMC
& *options
)) {
422 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
425 (TCPOLEN_EXP_SMC_BASE
));
426 *ptr
++ = htonl(TCPOPT_SMC_MAGIC
);
432 struct tcp_out_options
{
433 u16 options
; /* bit field of OPTION_* */
434 u16 mss
; /* 0 to disable */
435 u8 ws
; /* window scale, 0 to disable */
436 u8 num_sack_blocks
; /* number of SACK blocks to include */
437 u8 hash_size
; /* bytes in hash_location */
438 __u8
*hash_location
; /* temporary pointer, overloaded */
439 __u32 tsval
, tsecr
; /* need to include OPTION_TS */
440 struct tcp_fastopen_cookie
*fastopen_cookie
; /* Fast open cookie */
443 /* Write previously computed TCP options to the packet.
445 * Beware: Something in the Internet is very sensitive to the ordering of
446 * TCP options, we learned this through the hard way, so be careful here.
447 * Luckily we can at least blame others for their non-compliance but from
448 * inter-operability perspective it seems that we're somewhat stuck with
449 * the ordering which we have been using if we want to keep working with
450 * those broken things (not that it currently hurts anybody as there isn't
451 * particular reason why the ordering would need to be changed).
453 * At least SACK_PERM as the first option is known to lead to a disaster
454 * (but it may well be that other scenarios fail similarly).
456 static void tcp_options_write(__be32
*ptr
, struct tcp_sock
*tp
,
457 struct tcp_out_options
*opts
)
459 u16 options
= opts
->options
; /* mungable copy */
461 if (unlikely(OPTION_MD5
& options
)) {
462 *ptr
++ = htonl((TCPOPT_NOP
<< 24) | (TCPOPT_NOP
<< 16) |
463 (TCPOPT_MD5SIG
<< 8) | TCPOLEN_MD5SIG
);
464 /* overload cookie hash location */
465 opts
->hash_location
= (__u8
*)ptr
;
469 if (unlikely(opts
->mss
)) {
470 *ptr
++ = htonl((TCPOPT_MSS
<< 24) |
471 (TCPOLEN_MSS
<< 16) |
475 if (likely(OPTION_TS
& options
)) {
476 if (unlikely(OPTION_SACK_ADVERTISE
& options
)) {
477 *ptr
++ = htonl((TCPOPT_SACK_PERM
<< 24) |
478 (TCPOLEN_SACK_PERM
<< 16) |
479 (TCPOPT_TIMESTAMP
<< 8) |
481 options
&= ~OPTION_SACK_ADVERTISE
;
483 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
485 (TCPOPT_TIMESTAMP
<< 8) |
488 *ptr
++ = htonl(opts
->tsval
);
489 *ptr
++ = htonl(opts
->tsecr
);
492 if (unlikely(OPTION_SACK_ADVERTISE
& options
)) {
493 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
495 (TCPOPT_SACK_PERM
<< 8) |
499 if (unlikely(OPTION_WSCALE
& options
)) {
500 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
501 (TCPOPT_WINDOW
<< 16) |
502 (TCPOLEN_WINDOW
<< 8) |
506 if (unlikely(opts
->num_sack_blocks
)) {
507 struct tcp_sack_block
*sp
= tp
->rx_opt
.dsack
?
508 tp
->duplicate_sack
: tp
->selective_acks
;
511 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
514 (TCPOLEN_SACK_BASE
+ (opts
->num_sack_blocks
*
515 TCPOLEN_SACK_PERBLOCK
)));
517 for (this_sack
= 0; this_sack
< opts
->num_sack_blocks
;
519 *ptr
++ = htonl(sp
[this_sack
].start_seq
);
520 *ptr
++ = htonl(sp
[this_sack
].end_seq
);
523 tp
->rx_opt
.dsack
= 0;
526 if (unlikely(OPTION_FAST_OPEN_COOKIE
& options
)) {
527 struct tcp_fastopen_cookie
*foc
= opts
->fastopen_cookie
;
529 u32 len
; /* Fast Open option length */
532 len
= TCPOLEN_EXP_FASTOPEN_BASE
+ foc
->len
;
533 *ptr
= htonl((TCPOPT_EXP
<< 24) | (len
<< 16) |
534 TCPOPT_FASTOPEN_MAGIC
);
535 p
+= TCPOLEN_EXP_FASTOPEN_BASE
;
537 len
= TCPOLEN_FASTOPEN_BASE
+ foc
->len
;
538 *p
++ = TCPOPT_FASTOPEN
;
542 memcpy(p
, foc
->val
, foc
->len
);
543 if ((len
& 3) == 2) {
544 p
[foc
->len
] = TCPOPT_NOP
;
545 p
[foc
->len
+ 1] = TCPOPT_NOP
;
547 ptr
+= (len
+ 3) >> 2;
550 smc_options_write(ptr
, &options
);
553 static void smc_set_option(const struct tcp_sock
*tp
,
554 struct tcp_out_options
*opts
,
555 unsigned int *remaining
)
557 #if IS_ENABLED(CONFIG_SMC)
558 if (static_branch_unlikely(&tcp_have_smc
)) {
560 if (*remaining
>= TCPOLEN_EXP_SMC_BASE_ALIGNED
) {
561 opts
->options
|= OPTION_SMC
;
562 *remaining
-= TCPOLEN_EXP_SMC_BASE_ALIGNED
;
569 static void smc_set_option_cond(const struct tcp_sock
*tp
,
570 const struct inet_request_sock
*ireq
,
571 struct tcp_out_options
*opts
,
572 unsigned int *remaining
)
574 #if IS_ENABLED(CONFIG_SMC)
575 if (static_branch_unlikely(&tcp_have_smc
)) {
576 if (tp
->syn_smc
&& ireq
->smc_ok
) {
577 if (*remaining
>= TCPOLEN_EXP_SMC_BASE_ALIGNED
) {
578 opts
->options
|= OPTION_SMC
;
579 *remaining
-= TCPOLEN_EXP_SMC_BASE_ALIGNED
;
586 /* Compute TCP options for SYN packets. This is not the final
587 * network wire format yet.
589 static unsigned int tcp_syn_options(struct sock
*sk
, struct sk_buff
*skb
,
590 struct tcp_out_options
*opts
,
591 struct tcp_md5sig_key
**md5
)
593 struct tcp_sock
*tp
= tcp_sk(sk
);
594 unsigned int remaining
= MAX_TCP_OPTION_SPACE
;
595 struct tcp_fastopen_request
*fastopen
= tp
->fastopen_req
;
598 #ifdef CONFIG_TCP_MD5SIG
599 if (unlikely(rcu_access_pointer(tp
->md5sig_info
))) {
600 *md5
= tp
->af_specific
->md5_lookup(sk
, sk
);
602 opts
->options
|= OPTION_MD5
;
603 remaining
-= TCPOLEN_MD5SIG_ALIGNED
;
608 /* We always get an MSS option. The option bytes which will be seen in
609 * normal data packets should timestamps be used, must be in the MSS
610 * advertised. But we subtract them from tp->mss_cache so that
611 * calculations in tcp_sendmsg are simpler etc. So account for this
612 * fact here if necessary. If we don't do this correctly, as a
613 * receiver we won't recognize data packets as being full sized when we
614 * should, and thus we won't abide by the delayed ACK rules correctly.
615 * SACKs don't matter, we never delay an ACK when we have any of those
617 opts
->mss
= tcp_advertise_mss(sk
);
618 remaining
-= TCPOLEN_MSS_ALIGNED
;
620 if (likely(sock_net(sk
)->ipv4
.sysctl_tcp_timestamps
&& !*md5
)) {
621 opts
->options
|= OPTION_TS
;
622 opts
->tsval
= tcp_skb_timestamp(skb
) + tp
->tsoffset
;
623 opts
->tsecr
= tp
->rx_opt
.ts_recent
;
624 remaining
-= TCPOLEN_TSTAMP_ALIGNED
;
626 if (likely(sock_net(sk
)->ipv4
.sysctl_tcp_window_scaling
)) {
627 opts
->ws
= tp
->rx_opt
.rcv_wscale
;
628 opts
->options
|= OPTION_WSCALE
;
629 remaining
-= TCPOLEN_WSCALE_ALIGNED
;
631 if (likely(sock_net(sk
)->ipv4
.sysctl_tcp_sack
)) {
632 opts
->options
|= OPTION_SACK_ADVERTISE
;
633 if (unlikely(!(OPTION_TS
& opts
->options
)))
634 remaining
-= TCPOLEN_SACKPERM_ALIGNED
;
637 if (fastopen
&& fastopen
->cookie
.len
>= 0) {
638 u32 need
= fastopen
->cookie
.len
;
640 need
+= fastopen
->cookie
.exp
? TCPOLEN_EXP_FASTOPEN_BASE
:
641 TCPOLEN_FASTOPEN_BASE
;
642 need
= (need
+ 3) & ~3U; /* Align to 32 bits */
643 if (remaining
>= need
) {
644 opts
->options
|= OPTION_FAST_OPEN_COOKIE
;
645 opts
->fastopen_cookie
= &fastopen
->cookie
;
647 tp
->syn_fastopen
= 1;
648 tp
->syn_fastopen_exp
= fastopen
->cookie
.exp
? 1 : 0;
652 smc_set_option(tp
, opts
, &remaining
);
654 return MAX_TCP_OPTION_SPACE
- remaining
;
657 /* Set up TCP options for SYN-ACKs. */
658 static unsigned int tcp_synack_options(const struct sock
*sk
,
659 struct request_sock
*req
,
660 unsigned int mss
, struct sk_buff
*skb
,
661 struct tcp_out_options
*opts
,
662 const struct tcp_md5sig_key
*md5
,
663 struct tcp_fastopen_cookie
*foc
)
665 struct inet_request_sock
*ireq
= inet_rsk(req
);
666 unsigned int remaining
= MAX_TCP_OPTION_SPACE
;
668 #ifdef CONFIG_TCP_MD5SIG
670 opts
->options
|= OPTION_MD5
;
671 remaining
-= TCPOLEN_MD5SIG_ALIGNED
;
673 /* We can't fit any SACK blocks in a packet with MD5 + TS
674 * options. There was discussion about disabling SACK
675 * rather than TS in order to fit in better with old,
676 * buggy kernels, but that was deemed to be unnecessary.
678 ireq
->tstamp_ok
&= !ireq
->sack_ok
;
682 /* We always send an MSS option. */
684 remaining
-= TCPOLEN_MSS_ALIGNED
;
686 if (likely(ireq
->wscale_ok
)) {
687 opts
->ws
= ireq
->rcv_wscale
;
688 opts
->options
|= OPTION_WSCALE
;
689 remaining
-= TCPOLEN_WSCALE_ALIGNED
;
691 if (likely(ireq
->tstamp_ok
)) {
692 opts
->options
|= OPTION_TS
;
693 opts
->tsval
= tcp_skb_timestamp(skb
) + tcp_rsk(req
)->ts_off
;
694 opts
->tsecr
= req
->ts_recent
;
695 remaining
-= TCPOLEN_TSTAMP_ALIGNED
;
697 if (likely(ireq
->sack_ok
)) {
698 opts
->options
|= OPTION_SACK_ADVERTISE
;
699 if (unlikely(!ireq
->tstamp_ok
))
700 remaining
-= TCPOLEN_SACKPERM_ALIGNED
;
702 if (foc
!= NULL
&& foc
->len
>= 0) {
705 need
+= foc
->exp
? TCPOLEN_EXP_FASTOPEN_BASE
:
706 TCPOLEN_FASTOPEN_BASE
;
707 need
= (need
+ 3) & ~3U; /* Align to 32 bits */
708 if (remaining
>= need
) {
709 opts
->options
|= OPTION_FAST_OPEN_COOKIE
;
710 opts
->fastopen_cookie
= foc
;
715 smc_set_option_cond(tcp_sk(sk
), ireq
, opts
, &remaining
);
717 return MAX_TCP_OPTION_SPACE
- remaining
;
720 /* Compute TCP options for ESTABLISHED sockets. This is not the
721 * final wire format yet.
723 static unsigned int tcp_established_options(struct sock
*sk
, struct sk_buff
*skb
,
724 struct tcp_out_options
*opts
,
725 struct tcp_md5sig_key
**md5
)
727 struct tcp_sock
*tp
= tcp_sk(sk
);
728 unsigned int size
= 0;
729 unsigned int eff_sacks
;
734 #ifdef CONFIG_TCP_MD5SIG
735 if (unlikely(rcu_access_pointer(tp
->md5sig_info
))) {
736 *md5
= tp
->af_specific
->md5_lookup(sk
, sk
);
738 opts
->options
|= OPTION_MD5
;
739 size
+= TCPOLEN_MD5SIG_ALIGNED
;
744 if (likely(tp
->rx_opt
.tstamp_ok
)) {
745 opts
->options
|= OPTION_TS
;
746 opts
->tsval
= skb
? tcp_skb_timestamp(skb
) + tp
->tsoffset
: 0;
747 opts
->tsecr
= tp
->rx_opt
.ts_recent
;
748 size
+= TCPOLEN_TSTAMP_ALIGNED
;
751 eff_sacks
= tp
->rx_opt
.num_sacks
+ tp
->rx_opt
.dsack
;
752 if (unlikely(eff_sacks
)) {
753 const unsigned int remaining
= MAX_TCP_OPTION_SPACE
- size
;
754 opts
->num_sack_blocks
=
755 min_t(unsigned int, eff_sacks
,
756 (remaining
- TCPOLEN_SACK_BASE_ALIGNED
) /
757 TCPOLEN_SACK_PERBLOCK
);
758 size
+= TCPOLEN_SACK_BASE_ALIGNED
+
759 opts
->num_sack_blocks
* TCPOLEN_SACK_PERBLOCK
;
766 /* TCP SMALL QUEUES (TSQ)
768 * TSQ goal is to keep small amount of skbs per tcp flow in tx queues (qdisc+dev)
769 * to reduce RTT and bufferbloat.
770 * We do this using a special skb destructor (tcp_wfree).
772 * Its important tcp_wfree() can be replaced by sock_wfree() in the event skb
773 * needs to be reallocated in a driver.
774 * The invariant being skb->truesize subtracted from sk->sk_wmem_alloc
776 * Since transmit from skb destructor is forbidden, we use a tasklet
777 * to process all sockets that eventually need to send more skbs.
778 * We use one tasklet per cpu, with its own queue of sockets.
781 struct tasklet_struct tasklet
;
782 struct list_head head
; /* queue of tcp sockets */
784 static DEFINE_PER_CPU(struct tsq_tasklet
, tsq_tasklet
);
786 static void tcp_tsq_write(struct sock
*sk
)
788 if ((1 << sk
->sk_state
) &
789 (TCPF_ESTABLISHED
| TCPF_FIN_WAIT1
| TCPF_CLOSING
|
790 TCPF_CLOSE_WAIT
| TCPF_LAST_ACK
)) {
791 struct tcp_sock
*tp
= tcp_sk(sk
);
793 if (tp
->lost_out
> tp
->retrans_out
&&
794 tp
->snd_cwnd
> tcp_packets_in_flight(tp
)) {
795 tcp_mstamp_refresh(tp
);
796 tcp_xmit_retransmit_queue(sk
);
799 tcp_write_xmit(sk
, tcp_current_mss(sk
), tp
->nonagle
,
804 static void tcp_tsq_handler(struct sock
*sk
)
807 if (!sock_owned_by_user(sk
))
809 else if (!test_and_set_bit(TCP_TSQ_DEFERRED
, &sk
->sk_tsq_flags
))
814 * One tasklet per cpu tries to send more skbs.
815 * We run in tasklet context but need to disable irqs when
816 * transferring tsq->head because tcp_wfree() might
817 * interrupt us (non NAPI drivers)
819 static void tcp_tasklet_func(unsigned long data
)
821 struct tsq_tasklet
*tsq
= (struct tsq_tasklet
*)data
;
824 struct list_head
*q
, *n
;
828 local_irq_save(flags
);
829 list_splice_init(&tsq
->head
, &list
);
830 local_irq_restore(flags
);
832 list_for_each_safe(q
, n
, &list
) {
833 tp
= list_entry(q
, struct tcp_sock
, tsq_node
);
834 list_del(&tp
->tsq_node
);
836 sk
= (struct sock
*)tp
;
837 smp_mb__before_atomic();
838 clear_bit(TSQ_QUEUED
, &sk
->sk_tsq_flags
);
845 #define TCP_DEFERRED_ALL (TCPF_TSQ_DEFERRED | \
846 TCPF_WRITE_TIMER_DEFERRED | \
847 TCPF_DELACK_TIMER_DEFERRED | \
848 TCPF_MTU_REDUCED_DEFERRED)
850 * tcp_release_cb - tcp release_sock() callback
853 * called from release_sock() to perform protocol dependent
854 * actions before socket release.
856 void tcp_release_cb(struct sock
*sk
)
858 unsigned long flags
, nflags
;
860 /* perform an atomic operation only if at least one flag is set */
862 flags
= sk
->sk_tsq_flags
;
863 if (!(flags
& TCP_DEFERRED_ALL
))
865 nflags
= flags
& ~TCP_DEFERRED_ALL
;
866 } while (cmpxchg(&sk
->sk_tsq_flags
, flags
, nflags
) != flags
);
868 if (flags
& TCPF_TSQ_DEFERRED
) {
872 /* Here begins the tricky part :
873 * We are called from release_sock() with :
875 * 2) sk_lock.slock spinlock held
876 * 3) socket owned by us (sk->sk_lock.owned == 1)
878 * But following code is meant to be called from BH handlers,
879 * so we should keep BH disabled, but early release socket ownership
881 sock_release_ownership(sk
);
883 if (flags
& TCPF_WRITE_TIMER_DEFERRED
) {
884 tcp_write_timer_handler(sk
);
887 if (flags
& TCPF_DELACK_TIMER_DEFERRED
) {
888 tcp_delack_timer_handler(sk
);
891 if (flags
& TCPF_MTU_REDUCED_DEFERRED
) {
892 inet_csk(sk
)->icsk_af_ops
->mtu_reduced(sk
);
896 EXPORT_SYMBOL(tcp_release_cb
);
898 void __init
tcp_tasklet_init(void)
902 for_each_possible_cpu(i
) {
903 struct tsq_tasklet
*tsq
= &per_cpu(tsq_tasklet
, i
);
905 INIT_LIST_HEAD(&tsq
->head
);
906 tasklet_init(&tsq
->tasklet
,
913 * Write buffer destructor automatically called from kfree_skb.
914 * We can't xmit new skbs from this context, as we might already
917 void tcp_wfree(struct sk_buff
*skb
)
919 struct sock
*sk
= skb
->sk
;
920 struct tcp_sock
*tp
= tcp_sk(sk
);
921 unsigned long flags
, nval
, oval
;
923 /* Keep one reference on sk_wmem_alloc.
924 * Will be released by sk_free() from here or tcp_tasklet_func()
926 WARN_ON(refcount_sub_and_test(skb
->truesize
- 1, &sk
->sk_wmem_alloc
));
928 /* If this softirq is serviced by ksoftirqd, we are likely under stress.
929 * Wait until our queues (qdisc + devices) are drained.
931 * - less callbacks to tcp_write_xmit(), reducing stress (batches)
932 * - chance for incoming ACK (processed by another cpu maybe)
933 * to migrate this flow (skb->ooo_okay will be eventually set)
935 if (refcount_read(&sk
->sk_wmem_alloc
) >= SKB_TRUESIZE(1) && this_cpu_ksoftirqd() == current
)
938 for (oval
= READ_ONCE(sk
->sk_tsq_flags
);; oval
= nval
) {
939 struct tsq_tasklet
*tsq
;
942 if (!(oval
& TSQF_THROTTLED
) || (oval
& TSQF_QUEUED
))
945 nval
= (oval
& ~TSQF_THROTTLED
) | TSQF_QUEUED
;
946 nval
= cmpxchg(&sk
->sk_tsq_flags
, oval
, nval
);
950 /* queue this socket to tasklet queue */
951 local_irq_save(flags
);
952 tsq
= this_cpu_ptr(&tsq_tasklet
);
953 empty
= list_empty(&tsq
->head
);
954 list_add(&tp
->tsq_node
, &tsq
->head
);
956 tasklet_schedule(&tsq
->tasklet
);
957 local_irq_restore(flags
);
964 /* Note: Called under soft irq.
965 * We can call TCP stack right away, unless socket is owned by user.
967 enum hrtimer_restart
tcp_pace_kick(struct hrtimer
*timer
)
969 struct tcp_sock
*tp
= container_of(timer
, struct tcp_sock
, pacing_timer
);
970 struct sock
*sk
= (struct sock
*)tp
;
975 return HRTIMER_NORESTART
;
978 static void tcp_internal_pacing(struct sock
*sk
)
980 if (!tcp_needs_internal_pacing(sk
))
982 hrtimer_start(&tcp_sk(sk
)->pacing_timer
,
983 ns_to_ktime(tcp_sk(sk
)->tcp_wstamp_ns
),
984 HRTIMER_MODE_ABS_PINNED_SOFT
);
988 static void tcp_update_skb_after_send(struct sock
*sk
, struct sk_buff
*skb
)
990 struct tcp_sock
*tp
= tcp_sk(sk
);
992 skb
->skb_mstamp_ns
= tp
->tcp_wstamp_ns
;
993 if (sk
->sk_pacing_status
!= SK_PACING_NONE
) {
994 u32 rate
= sk
->sk_pacing_rate
;
996 /* Original sch_fq does not pace first 10 MSS
997 * Note that tp->data_segs_out overflows after 2^32 packets,
998 * this is a minor annoyance.
1000 if (rate
!= ~0U && rate
&& tp
->data_segs_out
>= 10) {
1001 tp
->tcp_wstamp_ns
+= div_u64((u64
)skb
->len
* NSEC_PER_SEC
, rate
);
1003 tcp_internal_pacing(sk
);
1006 list_move_tail(&skb
->tcp_tsorted_anchor
, &tp
->tsorted_sent_queue
);
1009 /* This routine actually transmits TCP packets queued in by
1010 * tcp_do_sendmsg(). This is used by both the initial
1011 * transmission and possible later retransmissions.
1012 * All SKB's seen here are completely headerless. It is our
1013 * job to build the TCP header, and pass the packet down to
1014 * IP so it can do the same plus pass the packet off to the
1017 * We are working here with either a clone of the original
1018 * SKB, or a fresh unique copy made by the retransmit engine.
1020 static int __tcp_transmit_skb(struct sock
*sk
, struct sk_buff
*skb
,
1021 int clone_it
, gfp_t gfp_mask
, u32 rcv_nxt
)
1023 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
1024 struct inet_sock
*inet
;
1025 struct tcp_sock
*tp
;
1026 struct tcp_skb_cb
*tcb
;
1027 struct tcp_out_options opts
;
1028 unsigned int tcp_options_size
, tcp_header_size
;
1029 struct sk_buff
*oskb
= NULL
;
1030 struct tcp_md5sig_key
*md5
;
1034 BUG_ON(!skb
|| !tcp_skb_pcount(skb
));
1038 TCP_SKB_CB(skb
)->tx
.in_flight
= TCP_SKB_CB(skb
)->end_seq
1042 tcp_skb_tsorted_save(oskb
) {
1043 if (unlikely(skb_cloned(oskb
)))
1044 skb
= pskb_copy(oskb
, gfp_mask
);
1046 skb
= skb_clone(oskb
, gfp_mask
);
1047 } tcp_skb_tsorted_restore(oskb
);
1053 /* TODO: might take care of jitter here */
1054 tp
->tcp_wstamp_ns
= max(tp
->tcp_wstamp_ns
, tp
->tcp_clock_cache
);
1056 skb
->skb_mstamp_ns
= tp
->tcp_wstamp_ns
;
1059 tcb
= TCP_SKB_CB(skb
);
1060 memset(&opts
, 0, sizeof(opts
));
1062 if (unlikely(tcb
->tcp_flags
& TCPHDR_SYN
))
1063 tcp_options_size
= tcp_syn_options(sk
, skb
, &opts
, &md5
);
1065 tcp_options_size
= tcp_established_options(sk
, skb
, &opts
,
1067 tcp_header_size
= tcp_options_size
+ sizeof(struct tcphdr
);
1069 /* if no packet is in qdisc/device queue, then allow XPS to select
1070 * another queue. We can be called from tcp_tsq_handler()
1071 * which holds one reference to sk.
1073 * TODO: Ideally, in-flight pure ACK packets should not matter here.
1074 * One way to get this would be to set skb->truesize = 2 on them.
1076 skb
->ooo_okay
= sk_wmem_alloc_get(sk
) < SKB_TRUESIZE(1);
1078 /* If we had to use memory reserve to allocate this skb,
1079 * this might cause drops if packet is looped back :
1080 * Other socket might not have SOCK_MEMALLOC.
1081 * Packets not looped back do not care about pfmemalloc.
1083 skb
->pfmemalloc
= 0;
1085 skb_push(skb
, tcp_header_size
);
1086 skb_reset_transport_header(skb
);
1090 skb
->destructor
= skb_is_tcp_pure_ack(skb
) ? __sock_wfree
: tcp_wfree
;
1091 skb_set_hash_from_sk(skb
, sk
);
1092 refcount_add(skb
->truesize
, &sk
->sk_wmem_alloc
);
1094 skb_set_dst_pending_confirm(skb
, sk
->sk_dst_pending_confirm
);
1096 /* Build TCP header and checksum it. */
1097 th
= (struct tcphdr
*)skb
->data
;
1098 th
->source
= inet
->inet_sport
;
1099 th
->dest
= inet
->inet_dport
;
1100 th
->seq
= htonl(tcb
->seq
);
1101 th
->ack_seq
= htonl(rcv_nxt
);
1102 *(((__be16
*)th
) + 6) = htons(((tcp_header_size
>> 2) << 12) |
1108 /* The urg_mode check is necessary during a below snd_una win probe */
1109 if (unlikely(tcp_urg_mode(tp
) && before(tcb
->seq
, tp
->snd_up
))) {
1110 if (before(tp
->snd_up
, tcb
->seq
+ 0x10000)) {
1111 th
->urg_ptr
= htons(tp
->snd_up
- tcb
->seq
);
1113 } else if (after(tcb
->seq
+ 0xFFFF, tp
->snd_nxt
)) {
1114 th
->urg_ptr
= htons(0xFFFF);
1119 tcp_options_write((__be32
*)(th
+ 1), tp
, &opts
);
1120 skb_shinfo(skb
)->gso_type
= sk
->sk_gso_type
;
1121 if (likely(!(tcb
->tcp_flags
& TCPHDR_SYN
))) {
1122 th
->window
= htons(tcp_select_window(sk
));
1123 tcp_ecn_send(sk
, skb
, th
, tcp_header_size
);
1125 /* RFC1323: The window in SYN & SYN/ACK segments
1128 th
->window
= htons(min(tp
->rcv_wnd
, 65535U));
1130 #ifdef CONFIG_TCP_MD5SIG
1131 /* Calculate the MD5 hash, as we have all we need now */
1133 sk_nocaps_add(sk
, NETIF_F_GSO_MASK
);
1134 tp
->af_specific
->calc_md5_hash(opts
.hash_location
,
1139 icsk
->icsk_af_ops
->send_check(sk
, skb
);
1141 if (likely(tcb
->tcp_flags
& TCPHDR_ACK
))
1142 tcp_event_ack_sent(sk
, tcp_skb_pcount(skb
), rcv_nxt
);
1144 if (skb
->len
!= tcp_header_size
) {
1145 tcp_event_data_sent(tp
, sk
);
1146 tp
->data_segs_out
+= tcp_skb_pcount(skb
);
1147 tp
->bytes_sent
+= skb
->len
- tcp_header_size
;
1150 if (after(tcb
->end_seq
, tp
->snd_nxt
) || tcb
->seq
== tcb
->end_seq
)
1151 TCP_ADD_STATS(sock_net(sk
), TCP_MIB_OUTSEGS
,
1152 tcp_skb_pcount(skb
));
1154 tp
->segs_out
+= tcp_skb_pcount(skb
);
1155 /* OK, its time to fill skb_shinfo(skb)->gso_{segs|size} */
1156 skb_shinfo(skb
)->gso_segs
= tcp_skb_pcount(skb
);
1157 skb_shinfo(skb
)->gso_size
= tcp_skb_mss(skb
);
1159 /* Leave earliest departure time in skb->tstamp (skb->skb_mstamp_ns) */
1161 /* Cleanup our debris for IP stacks */
1162 memset(skb
->cb
, 0, max(sizeof(struct inet_skb_parm
),
1163 sizeof(struct inet6_skb_parm
)));
1165 err
= icsk
->icsk_af_ops
->queue_xmit(sk
, skb
, &inet
->cork
.fl
);
1167 if (unlikely(err
> 0)) {
1169 err
= net_xmit_eval(err
);
1172 tcp_update_skb_after_send(sk
, oskb
);
1173 tcp_rate_skb_sent(sk
, oskb
);
1178 static int tcp_transmit_skb(struct sock
*sk
, struct sk_buff
*skb
, int clone_it
,
1181 return __tcp_transmit_skb(sk
, skb
, clone_it
, gfp_mask
,
1182 tcp_sk(sk
)->rcv_nxt
);
1185 /* This routine just queues the buffer for sending.
1187 * NOTE: probe0 timer is not checked, do not forget tcp_push_pending_frames,
1188 * otherwise socket can stall.
1190 static void tcp_queue_skb(struct sock
*sk
, struct sk_buff
*skb
)
1192 struct tcp_sock
*tp
= tcp_sk(sk
);
1194 /* Advance write_seq and place onto the write_queue. */
1195 tp
->write_seq
= TCP_SKB_CB(skb
)->end_seq
;
1196 __skb_header_release(skb
);
1197 tcp_add_write_queue_tail(sk
, skb
);
1198 sk
->sk_wmem_queued
+= skb
->truesize
;
1199 sk_mem_charge(sk
, skb
->truesize
);
1202 /* Initialize TSO segments for a packet. */
1203 static void tcp_set_skb_tso_segs(struct sk_buff
*skb
, unsigned int mss_now
)
1205 if (skb
->len
<= mss_now
) {
1206 /* Avoid the costly divide in the normal
1209 tcp_skb_pcount_set(skb
, 1);
1210 TCP_SKB_CB(skb
)->tcp_gso_size
= 0;
1212 tcp_skb_pcount_set(skb
, DIV_ROUND_UP(skb
->len
, mss_now
));
1213 TCP_SKB_CB(skb
)->tcp_gso_size
= mss_now
;
1217 /* Pcount in the middle of the write queue got changed, we need to do various
1218 * tweaks to fix counters
1220 static void tcp_adjust_pcount(struct sock
*sk
, const struct sk_buff
*skb
, int decr
)
1222 struct tcp_sock
*tp
= tcp_sk(sk
);
1224 tp
->packets_out
-= decr
;
1226 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
)
1227 tp
->sacked_out
-= decr
;
1228 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_RETRANS
)
1229 tp
->retrans_out
-= decr
;
1230 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_LOST
)
1231 tp
->lost_out
-= decr
;
1233 /* Reno case is special. Sigh... */
1234 if (tcp_is_reno(tp
) && decr
> 0)
1235 tp
->sacked_out
-= min_t(u32
, tp
->sacked_out
, decr
);
1237 if (tp
->lost_skb_hint
&&
1238 before(TCP_SKB_CB(skb
)->seq
, TCP_SKB_CB(tp
->lost_skb_hint
)->seq
) &&
1239 (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
))
1240 tp
->lost_cnt_hint
-= decr
;
1242 tcp_verify_left_out(tp
);
1245 static bool tcp_has_tx_tstamp(const struct sk_buff
*skb
)
1247 return TCP_SKB_CB(skb
)->txstamp_ack
||
1248 (skb_shinfo(skb
)->tx_flags
& SKBTX_ANY_TSTAMP
);
1251 static void tcp_fragment_tstamp(struct sk_buff
*skb
, struct sk_buff
*skb2
)
1253 struct skb_shared_info
*shinfo
= skb_shinfo(skb
);
1255 if (unlikely(tcp_has_tx_tstamp(skb
)) &&
1256 !before(shinfo
->tskey
, TCP_SKB_CB(skb2
)->seq
)) {
1257 struct skb_shared_info
*shinfo2
= skb_shinfo(skb2
);
1258 u8 tsflags
= shinfo
->tx_flags
& SKBTX_ANY_TSTAMP
;
1260 shinfo
->tx_flags
&= ~tsflags
;
1261 shinfo2
->tx_flags
|= tsflags
;
1262 swap(shinfo
->tskey
, shinfo2
->tskey
);
1263 TCP_SKB_CB(skb2
)->txstamp_ack
= TCP_SKB_CB(skb
)->txstamp_ack
;
1264 TCP_SKB_CB(skb
)->txstamp_ack
= 0;
1268 static void tcp_skb_fragment_eor(struct sk_buff
*skb
, struct sk_buff
*skb2
)
1270 TCP_SKB_CB(skb2
)->eor
= TCP_SKB_CB(skb
)->eor
;
1271 TCP_SKB_CB(skb
)->eor
= 0;
1274 /* Insert buff after skb on the write or rtx queue of sk. */
1275 static void tcp_insert_write_queue_after(struct sk_buff
*skb
,
1276 struct sk_buff
*buff
,
1278 enum tcp_queue tcp_queue
)
1280 if (tcp_queue
== TCP_FRAG_IN_WRITE_QUEUE
)
1281 __skb_queue_after(&sk
->sk_write_queue
, skb
, buff
);
1283 tcp_rbtree_insert(&sk
->tcp_rtx_queue
, buff
);
1286 /* Function to create two new TCP segments. Shrinks the given segment
1287 * to the specified size and appends a new segment with the rest of the
1288 * packet to the list. This won't be called frequently, I hope.
1289 * Remember, these are still headerless SKBs at this point.
1291 int tcp_fragment(struct sock
*sk
, enum tcp_queue tcp_queue
,
1292 struct sk_buff
*skb
, u32 len
,
1293 unsigned int mss_now
, gfp_t gfp
)
1295 struct tcp_sock
*tp
= tcp_sk(sk
);
1296 struct sk_buff
*buff
;
1297 int nsize
, old_factor
;
1301 if (WARN_ON(len
> skb
->len
))
1304 nsize
= skb_headlen(skb
) - len
;
1308 if (skb_unclone(skb
, gfp
))
1311 /* Get a new skb... force flag on. */
1312 buff
= sk_stream_alloc_skb(sk
, nsize
, gfp
, true);
1314 return -ENOMEM
; /* We'll just try again later. */
1316 sk
->sk_wmem_queued
+= buff
->truesize
;
1317 sk_mem_charge(sk
, buff
->truesize
);
1318 nlen
= skb
->len
- len
- nsize
;
1319 buff
->truesize
+= nlen
;
1320 skb
->truesize
-= nlen
;
1322 /* Correct the sequence numbers. */
1323 TCP_SKB_CB(buff
)->seq
= TCP_SKB_CB(skb
)->seq
+ len
;
1324 TCP_SKB_CB(buff
)->end_seq
= TCP_SKB_CB(skb
)->end_seq
;
1325 TCP_SKB_CB(skb
)->end_seq
= TCP_SKB_CB(buff
)->seq
;
1327 /* PSH and FIN should only be set in the second packet. */
1328 flags
= TCP_SKB_CB(skb
)->tcp_flags
;
1329 TCP_SKB_CB(skb
)->tcp_flags
= flags
& ~(TCPHDR_FIN
| TCPHDR_PSH
);
1330 TCP_SKB_CB(buff
)->tcp_flags
= flags
;
1331 TCP_SKB_CB(buff
)->sacked
= TCP_SKB_CB(skb
)->sacked
;
1332 tcp_skb_fragment_eor(skb
, buff
);
1334 skb_split(skb
, buff
, len
);
1336 buff
->ip_summed
= CHECKSUM_PARTIAL
;
1338 buff
->tstamp
= skb
->tstamp
;
1339 tcp_fragment_tstamp(skb
, buff
);
1341 old_factor
= tcp_skb_pcount(skb
);
1343 /* Fix up tso_factor for both original and new SKB. */
1344 tcp_set_skb_tso_segs(skb
, mss_now
);
1345 tcp_set_skb_tso_segs(buff
, mss_now
);
1347 /* Update delivered info for the new segment */
1348 TCP_SKB_CB(buff
)->tx
= TCP_SKB_CB(skb
)->tx
;
1350 /* If this packet has been sent out already, we must
1351 * adjust the various packet counters.
1353 if (!before(tp
->snd_nxt
, TCP_SKB_CB(buff
)->end_seq
)) {
1354 int diff
= old_factor
- tcp_skb_pcount(skb
) -
1355 tcp_skb_pcount(buff
);
1358 tcp_adjust_pcount(sk
, skb
, diff
);
1361 /* Link BUFF into the send queue. */
1362 __skb_header_release(buff
);
1363 tcp_insert_write_queue_after(skb
, buff
, sk
, tcp_queue
);
1364 if (tcp_queue
== TCP_FRAG_IN_RTX_QUEUE
)
1365 list_add(&buff
->tcp_tsorted_anchor
, &skb
->tcp_tsorted_anchor
);
1370 /* This is similar to __pskb_pull_tail(). The difference is that pulled
1371 * data is not copied, but immediately discarded.
1373 static int __pskb_trim_head(struct sk_buff
*skb
, int len
)
1375 struct skb_shared_info
*shinfo
;
1378 eat
= min_t(int, len
, skb_headlen(skb
));
1380 __skb_pull(skb
, eat
);
1387 shinfo
= skb_shinfo(skb
);
1388 for (i
= 0; i
< shinfo
->nr_frags
; i
++) {
1389 int size
= skb_frag_size(&shinfo
->frags
[i
]);
1392 skb_frag_unref(skb
, i
);
1395 shinfo
->frags
[k
] = shinfo
->frags
[i
];
1397 shinfo
->frags
[k
].page_offset
+= eat
;
1398 skb_frag_size_sub(&shinfo
->frags
[k
], eat
);
1404 shinfo
->nr_frags
= k
;
1406 skb
->data_len
-= len
;
1407 skb
->len
= skb
->data_len
;
1411 /* Remove acked data from a packet in the transmit queue. */
1412 int tcp_trim_head(struct sock
*sk
, struct sk_buff
*skb
, u32 len
)
1416 if (skb_unclone(skb
, GFP_ATOMIC
))
1419 delta_truesize
= __pskb_trim_head(skb
, len
);
1421 TCP_SKB_CB(skb
)->seq
+= len
;
1422 skb
->ip_summed
= CHECKSUM_PARTIAL
;
1424 if (delta_truesize
) {
1425 skb
->truesize
-= delta_truesize
;
1426 sk
->sk_wmem_queued
-= delta_truesize
;
1427 sk_mem_uncharge(sk
, delta_truesize
);
1428 sock_set_flag(sk
, SOCK_QUEUE_SHRUNK
);
1431 /* Any change of skb->len requires recalculation of tso factor. */
1432 if (tcp_skb_pcount(skb
) > 1)
1433 tcp_set_skb_tso_segs(skb
, tcp_skb_mss(skb
));
1438 /* Calculate MSS not accounting any TCP options. */
1439 static inline int __tcp_mtu_to_mss(struct sock
*sk
, int pmtu
)
1441 const struct tcp_sock
*tp
= tcp_sk(sk
);
1442 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
1445 /* Calculate base mss without TCP options:
1446 It is MMS_S - sizeof(tcphdr) of rfc1122
1448 mss_now
= pmtu
- icsk
->icsk_af_ops
->net_header_len
- sizeof(struct tcphdr
);
1450 /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */
1451 if (icsk
->icsk_af_ops
->net_frag_header_len
) {
1452 const struct dst_entry
*dst
= __sk_dst_get(sk
);
1454 if (dst
&& dst_allfrag(dst
))
1455 mss_now
-= icsk
->icsk_af_ops
->net_frag_header_len
;
1458 /* Clamp it (mss_clamp does not include tcp options) */
1459 if (mss_now
> tp
->rx_opt
.mss_clamp
)
1460 mss_now
= tp
->rx_opt
.mss_clamp
;
1462 /* Now subtract optional transport overhead */
1463 mss_now
-= icsk
->icsk_ext_hdr_len
;
1465 /* Then reserve room for full set of TCP options and 8 bytes of data */
1471 /* Calculate MSS. Not accounting for SACKs here. */
1472 int tcp_mtu_to_mss(struct sock
*sk
, int pmtu
)
1474 /* Subtract TCP options size, not including SACKs */
1475 return __tcp_mtu_to_mss(sk
, pmtu
) -
1476 (tcp_sk(sk
)->tcp_header_len
- sizeof(struct tcphdr
));
1479 /* Inverse of above */
1480 int tcp_mss_to_mtu(struct sock
*sk
, int mss
)
1482 const struct tcp_sock
*tp
= tcp_sk(sk
);
1483 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
1487 tp
->tcp_header_len
+
1488 icsk
->icsk_ext_hdr_len
+
1489 icsk
->icsk_af_ops
->net_header_len
;
1491 /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */
1492 if (icsk
->icsk_af_ops
->net_frag_header_len
) {
1493 const struct dst_entry
*dst
= __sk_dst_get(sk
);
1495 if (dst
&& dst_allfrag(dst
))
1496 mtu
+= icsk
->icsk_af_ops
->net_frag_header_len
;
1500 EXPORT_SYMBOL(tcp_mss_to_mtu
);
1502 /* MTU probing init per socket */
1503 void tcp_mtup_init(struct sock
*sk
)
1505 struct tcp_sock
*tp
= tcp_sk(sk
);
1506 struct inet_connection_sock
*icsk
= inet_csk(sk
);
1507 struct net
*net
= sock_net(sk
);
1509 icsk
->icsk_mtup
.enabled
= net
->ipv4
.sysctl_tcp_mtu_probing
> 1;
1510 icsk
->icsk_mtup
.search_high
= tp
->rx_opt
.mss_clamp
+ sizeof(struct tcphdr
) +
1511 icsk
->icsk_af_ops
->net_header_len
;
1512 icsk
->icsk_mtup
.search_low
= tcp_mss_to_mtu(sk
, net
->ipv4
.sysctl_tcp_base_mss
);
1513 icsk
->icsk_mtup
.probe_size
= 0;
1514 if (icsk
->icsk_mtup
.enabled
)
1515 icsk
->icsk_mtup
.probe_timestamp
= tcp_jiffies32
;
1517 EXPORT_SYMBOL(tcp_mtup_init
);
1519 /* This function synchronize snd mss to current pmtu/exthdr set.
1521 tp->rx_opt.user_mss is mss set by user by TCP_MAXSEG. It does NOT counts
1522 for TCP options, but includes only bare TCP header.
1524 tp->rx_opt.mss_clamp is mss negotiated at connection setup.
1525 It is minimum of user_mss and mss received with SYN.
1526 It also does not include TCP options.
1528 inet_csk(sk)->icsk_pmtu_cookie is last pmtu, seen by this function.
1530 tp->mss_cache is current effective sending mss, including
1531 all tcp options except for SACKs. It is evaluated,
1532 taking into account current pmtu, but never exceeds
1533 tp->rx_opt.mss_clamp.
1535 NOTE1. rfc1122 clearly states that advertised MSS
1536 DOES NOT include either tcp or ip options.
1538 NOTE2. inet_csk(sk)->icsk_pmtu_cookie and tp->mss_cache
1539 are READ ONLY outside this function. --ANK (980731)
1541 unsigned int tcp_sync_mss(struct sock
*sk
, u32 pmtu
)
1543 struct tcp_sock
*tp
= tcp_sk(sk
);
1544 struct inet_connection_sock
*icsk
= inet_csk(sk
);
1547 if (icsk
->icsk_mtup
.search_high
> pmtu
)
1548 icsk
->icsk_mtup
.search_high
= pmtu
;
1550 mss_now
= tcp_mtu_to_mss(sk
, pmtu
);
1551 mss_now
= tcp_bound_to_half_wnd(tp
, mss_now
);
1553 /* And store cached results */
1554 icsk
->icsk_pmtu_cookie
= pmtu
;
1555 if (icsk
->icsk_mtup
.enabled
)
1556 mss_now
= min(mss_now
, tcp_mtu_to_mss(sk
, icsk
->icsk_mtup
.search_low
));
1557 tp
->mss_cache
= mss_now
;
1561 EXPORT_SYMBOL(tcp_sync_mss
);
1563 /* Compute the current effective MSS, taking SACKs and IP options,
1564 * and even PMTU discovery events into account.
1566 unsigned int tcp_current_mss(struct sock
*sk
)
1568 const struct tcp_sock
*tp
= tcp_sk(sk
);
1569 const struct dst_entry
*dst
= __sk_dst_get(sk
);
1571 unsigned int header_len
;
1572 struct tcp_out_options opts
;
1573 struct tcp_md5sig_key
*md5
;
1575 mss_now
= tp
->mss_cache
;
1578 u32 mtu
= dst_mtu(dst
);
1579 if (mtu
!= inet_csk(sk
)->icsk_pmtu_cookie
)
1580 mss_now
= tcp_sync_mss(sk
, mtu
);
1583 header_len
= tcp_established_options(sk
, NULL
, &opts
, &md5
) +
1584 sizeof(struct tcphdr
);
1585 /* The mss_cache is sized based on tp->tcp_header_len, which assumes
1586 * some common options. If this is an odd packet (because we have SACK
1587 * blocks etc) then our calculated header_len will be different, and
1588 * we have to adjust mss_now correspondingly */
1589 if (header_len
!= tp
->tcp_header_len
) {
1590 int delta
= (int) header_len
- tp
->tcp_header_len
;
1597 /* RFC2861, slow part. Adjust cwnd, after it was not full during one rto.
1598 * As additional protections, we do not touch cwnd in retransmission phases,
1599 * and if application hit its sndbuf limit recently.
1601 static void tcp_cwnd_application_limited(struct sock
*sk
)
1603 struct tcp_sock
*tp
= tcp_sk(sk
);
1605 if (inet_csk(sk
)->icsk_ca_state
== TCP_CA_Open
&&
1606 sk
->sk_socket
&& !test_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
)) {
1607 /* Limited by application or receiver window. */
1608 u32 init_win
= tcp_init_cwnd(tp
, __sk_dst_get(sk
));
1609 u32 win_used
= max(tp
->snd_cwnd_used
, init_win
);
1610 if (win_used
< tp
->snd_cwnd
) {
1611 tp
->snd_ssthresh
= tcp_current_ssthresh(sk
);
1612 tp
->snd_cwnd
= (tp
->snd_cwnd
+ win_used
) >> 1;
1614 tp
->snd_cwnd_used
= 0;
1616 tp
->snd_cwnd_stamp
= tcp_jiffies32
;
1619 static void tcp_cwnd_validate(struct sock
*sk
, bool is_cwnd_limited
)
1621 const struct tcp_congestion_ops
*ca_ops
= inet_csk(sk
)->icsk_ca_ops
;
1622 struct tcp_sock
*tp
= tcp_sk(sk
);
1624 /* Track the maximum number of outstanding packets in each
1625 * window, and remember whether we were cwnd-limited then.
1627 if (!before(tp
->snd_una
, tp
->max_packets_seq
) ||
1628 tp
->packets_out
> tp
->max_packets_out
) {
1629 tp
->max_packets_out
= tp
->packets_out
;
1630 tp
->max_packets_seq
= tp
->snd_nxt
;
1631 tp
->is_cwnd_limited
= is_cwnd_limited
;
1634 if (tcp_is_cwnd_limited(sk
)) {
1635 /* Network is feed fully. */
1636 tp
->snd_cwnd_used
= 0;
1637 tp
->snd_cwnd_stamp
= tcp_jiffies32
;
1639 /* Network starves. */
1640 if (tp
->packets_out
> tp
->snd_cwnd_used
)
1641 tp
->snd_cwnd_used
= tp
->packets_out
;
1643 if (sock_net(sk
)->ipv4
.sysctl_tcp_slow_start_after_idle
&&
1644 (s32
)(tcp_jiffies32
- tp
->snd_cwnd_stamp
) >= inet_csk(sk
)->icsk_rto
&&
1645 !ca_ops
->cong_control
)
1646 tcp_cwnd_application_limited(sk
);
1648 /* The following conditions together indicate the starvation
1649 * is caused by insufficient sender buffer:
1650 * 1) just sent some data (see tcp_write_xmit)
1651 * 2) not cwnd limited (this else condition)
1652 * 3) no more data to send (tcp_write_queue_empty())
1653 * 4) application is hitting buffer limit (SOCK_NOSPACE)
1655 if (tcp_write_queue_empty(sk
) && sk
->sk_socket
&&
1656 test_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
) &&
1657 (1 << sk
->sk_state
) & (TCPF_ESTABLISHED
| TCPF_CLOSE_WAIT
))
1658 tcp_chrono_start(sk
, TCP_CHRONO_SNDBUF_LIMITED
);
1662 /* Minshall's variant of the Nagle send check. */
1663 static bool tcp_minshall_check(const struct tcp_sock
*tp
)
1665 return after(tp
->snd_sml
, tp
->snd_una
) &&
1666 !after(tp
->snd_sml
, tp
->snd_nxt
);
1669 /* Update snd_sml if this skb is under mss
1670 * Note that a TSO packet might end with a sub-mss segment
1671 * The test is really :
1672 * if ((skb->len % mss) != 0)
1673 * tp->snd_sml = TCP_SKB_CB(skb)->end_seq;
1674 * But we can avoid doing the divide again given we already have
1675 * skb_pcount = skb->len / mss_now
1677 static void tcp_minshall_update(struct tcp_sock
*tp
, unsigned int mss_now
,
1678 const struct sk_buff
*skb
)
1680 if (skb
->len
< tcp_skb_pcount(skb
) * mss_now
)
1681 tp
->snd_sml
= TCP_SKB_CB(skb
)->end_seq
;
1684 /* Return false, if packet can be sent now without violation Nagle's rules:
1685 * 1. It is full sized. (provided by caller in %partial bool)
1686 * 2. Or it contains FIN. (already checked by caller)
1687 * 3. Or TCP_CORK is not set, and TCP_NODELAY is set.
1688 * 4. Or TCP_CORK is not set, and all sent packets are ACKed.
1689 * With Minshall's modification: all sent small packets are ACKed.
1691 static bool tcp_nagle_check(bool partial
, const struct tcp_sock
*tp
,
1695 ((nonagle
& TCP_NAGLE_CORK
) ||
1696 (!nonagle
&& tp
->packets_out
&& tcp_minshall_check(tp
)));
1699 /* Return how many segs we'd like on a TSO packet,
1700 * to send one TSO packet per ms
1702 static u32
tcp_tso_autosize(const struct sock
*sk
, unsigned int mss_now
,
1707 bytes
= min(sk
->sk_pacing_rate
>> sk
->sk_pacing_shift
,
1708 sk
->sk_gso_max_size
- 1 - MAX_TCP_HEADER
);
1710 /* Goal is to send at least one packet per ms,
1711 * not one big TSO packet every 100 ms.
1712 * This preserves ACK clocking and is consistent
1713 * with tcp_tso_should_defer() heuristic.
1715 segs
= max_t(u32
, bytes
/ mss_now
, min_tso_segs
);
1720 /* Return the number of segments we want in the skb we are transmitting.
1721 * See if congestion control module wants to decide; otherwise, autosize.
1723 static u32
tcp_tso_segs(struct sock
*sk
, unsigned int mss_now
)
1725 const struct tcp_congestion_ops
*ca_ops
= inet_csk(sk
)->icsk_ca_ops
;
1726 u32 min_tso
, tso_segs
;
1728 min_tso
= ca_ops
->min_tso_segs
?
1729 ca_ops
->min_tso_segs(sk
) :
1730 sock_net(sk
)->ipv4
.sysctl_tcp_min_tso_segs
;
1732 tso_segs
= tcp_tso_autosize(sk
, mss_now
, min_tso
);
1733 return min_t(u32
, tso_segs
, sk
->sk_gso_max_segs
);
1736 /* Returns the portion of skb which can be sent right away */
1737 static unsigned int tcp_mss_split_point(const struct sock
*sk
,
1738 const struct sk_buff
*skb
,
1739 unsigned int mss_now
,
1740 unsigned int max_segs
,
1743 const struct tcp_sock
*tp
= tcp_sk(sk
);
1744 u32 partial
, needed
, window
, max_len
;
1746 window
= tcp_wnd_end(tp
) - TCP_SKB_CB(skb
)->seq
;
1747 max_len
= mss_now
* max_segs
;
1749 if (likely(max_len
<= window
&& skb
!= tcp_write_queue_tail(sk
)))
1752 needed
= min(skb
->len
, window
);
1754 if (max_len
<= needed
)
1757 partial
= needed
% mss_now
;
1758 /* If last segment is not a full MSS, check if Nagle rules allow us
1759 * to include this last segment in this skb.
1760 * Otherwise, we'll split the skb at last MSS boundary
1762 if (tcp_nagle_check(partial
!= 0, tp
, nonagle
))
1763 return needed
- partial
;
1768 /* Can at least one segment of SKB be sent right now, according to the
1769 * congestion window rules? If so, return how many segments are allowed.
1771 static inline unsigned int tcp_cwnd_test(const struct tcp_sock
*tp
,
1772 const struct sk_buff
*skb
)
1774 u32 in_flight
, cwnd
, halfcwnd
;
1776 /* Don't be strict about the congestion window for the final FIN. */
1777 if ((TCP_SKB_CB(skb
)->tcp_flags
& TCPHDR_FIN
) &&
1778 tcp_skb_pcount(skb
) == 1)
1781 in_flight
= tcp_packets_in_flight(tp
);
1782 cwnd
= tp
->snd_cwnd
;
1783 if (in_flight
>= cwnd
)
1786 /* For better scheduling, ensure we have at least
1787 * 2 GSO packets in flight.
1789 halfcwnd
= max(cwnd
>> 1, 1U);
1790 return min(halfcwnd
, cwnd
- in_flight
);
1793 /* Initialize TSO state of a skb.
1794 * This must be invoked the first time we consider transmitting
1795 * SKB onto the wire.
1797 static int tcp_init_tso_segs(struct sk_buff
*skb
, unsigned int mss_now
)
1799 int tso_segs
= tcp_skb_pcount(skb
);
1801 if (!tso_segs
|| (tso_segs
> 1 && tcp_skb_mss(skb
) != mss_now
)) {
1802 tcp_set_skb_tso_segs(skb
, mss_now
);
1803 tso_segs
= tcp_skb_pcount(skb
);
1809 /* Return true if the Nagle test allows this packet to be
1812 static inline bool tcp_nagle_test(const struct tcp_sock
*tp
, const struct sk_buff
*skb
,
1813 unsigned int cur_mss
, int nonagle
)
1815 /* Nagle rule does not apply to frames, which sit in the middle of the
1816 * write_queue (they have no chances to get new data).
1818 * This is implemented in the callers, where they modify the 'nonagle'
1819 * argument based upon the location of SKB in the send queue.
1821 if (nonagle
& TCP_NAGLE_PUSH
)
1824 /* Don't use the nagle rule for urgent data (or for the final FIN). */
1825 if (tcp_urg_mode(tp
) || (TCP_SKB_CB(skb
)->tcp_flags
& TCPHDR_FIN
))
1828 if (!tcp_nagle_check(skb
->len
< cur_mss
, tp
, nonagle
))
1834 /* Does at least the first segment of SKB fit into the send window? */
1835 static bool tcp_snd_wnd_test(const struct tcp_sock
*tp
,
1836 const struct sk_buff
*skb
,
1837 unsigned int cur_mss
)
1839 u32 end_seq
= TCP_SKB_CB(skb
)->end_seq
;
1841 if (skb
->len
> cur_mss
)
1842 end_seq
= TCP_SKB_CB(skb
)->seq
+ cur_mss
;
1844 return !after(end_seq
, tcp_wnd_end(tp
));
1847 /* Trim TSO SKB to LEN bytes, put the remaining data into a new packet
1848 * which is put after SKB on the list. It is very much like
1849 * tcp_fragment() except that it may make several kinds of assumptions
1850 * in order to speed up the splitting operation. In particular, we
1851 * know that all the data is in scatter-gather pages, and that the
1852 * packet has never been sent out before (and thus is not cloned).
1854 static int tso_fragment(struct sock
*sk
, enum tcp_queue tcp_queue
,
1855 struct sk_buff
*skb
, unsigned int len
,
1856 unsigned int mss_now
, gfp_t gfp
)
1858 struct sk_buff
*buff
;
1859 int nlen
= skb
->len
- len
;
1862 /* All of a TSO frame must be composed of paged data. */
1863 if (skb
->len
!= skb
->data_len
)
1864 return tcp_fragment(sk
, tcp_queue
, skb
, len
, mss_now
, gfp
);
1866 buff
= sk_stream_alloc_skb(sk
, 0, gfp
, true);
1867 if (unlikely(!buff
))
1870 sk
->sk_wmem_queued
+= buff
->truesize
;
1871 sk_mem_charge(sk
, buff
->truesize
);
1872 buff
->truesize
+= nlen
;
1873 skb
->truesize
-= nlen
;
1875 /* Correct the sequence numbers. */
1876 TCP_SKB_CB(buff
)->seq
= TCP_SKB_CB(skb
)->seq
+ len
;
1877 TCP_SKB_CB(buff
)->end_seq
= TCP_SKB_CB(skb
)->end_seq
;
1878 TCP_SKB_CB(skb
)->end_seq
= TCP_SKB_CB(buff
)->seq
;
1880 /* PSH and FIN should only be set in the second packet. */
1881 flags
= TCP_SKB_CB(skb
)->tcp_flags
;
1882 TCP_SKB_CB(skb
)->tcp_flags
= flags
& ~(TCPHDR_FIN
| TCPHDR_PSH
);
1883 TCP_SKB_CB(buff
)->tcp_flags
= flags
;
1885 /* This packet was never sent out yet, so no SACK bits. */
1886 TCP_SKB_CB(buff
)->sacked
= 0;
1888 tcp_skb_fragment_eor(skb
, buff
);
1890 buff
->ip_summed
= CHECKSUM_PARTIAL
;
1891 skb_split(skb
, buff
, len
);
1892 tcp_fragment_tstamp(skb
, buff
);
1894 /* Fix up tso_factor for both original and new SKB. */
1895 tcp_set_skb_tso_segs(skb
, mss_now
);
1896 tcp_set_skb_tso_segs(buff
, mss_now
);
1898 /* Link BUFF into the send queue. */
1899 __skb_header_release(buff
);
1900 tcp_insert_write_queue_after(skb
, buff
, sk
, tcp_queue
);
1905 /* Try to defer sending, if possible, in order to minimize the amount
1906 * of TSO splitting we do. View it as a kind of TSO Nagle test.
1908 * This algorithm is from John Heffner.
1910 static bool tcp_tso_should_defer(struct sock
*sk
, struct sk_buff
*skb
,
1911 bool *is_cwnd_limited
, u32 max_segs
)
1913 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
1914 u32 age
, send_win
, cong_win
, limit
, in_flight
;
1915 struct tcp_sock
*tp
= tcp_sk(sk
);
1916 struct sk_buff
*head
;
1919 if (TCP_SKB_CB(skb
)->tcp_flags
& TCPHDR_FIN
)
1922 if (icsk
->icsk_ca_state
>= TCP_CA_Recovery
)
1925 /* Avoid bursty behavior by allowing defer
1926 * only if the last write was recent.
1928 if ((s32
)(tcp_jiffies32
- tp
->lsndtime
) > 0)
1931 in_flight
= tcp_packets_in_flight(tp
);
1933 BUG_ON(tcp_skb_pcount(skb
) <= 1);
1934 BUG_ON(tp
->snd_cwnd
<= in_flight
);
1936 send_win
= tcp_wnd_end(tp
) - TCP_SKB_CB(skb
)->seq
;
1938 /* From in_flight test above, we know that cwnd > in_flight. */
1939 cong_win
= (tp
->snd_cwnd
- in_flight
) * tp
->mss_cache
;
1941 limit
= min(send_win
, cong_win
);
1943 /* If a full-sized TSO skb can be sent, do it. */
1944 if (limit
>= max_segs
* tp
->mss_cache
)
1947 /* Middle in queue won't get any more data, full sendable already? */
1948 if ((skb
!= tcp_write_queue_tail(sk
)) && (limit
>= skb
->len
))
1951 win_divisor
= READ_ONCE(sock_net(sk
)->ipv4
.sysctl_tcp_tso_win_divisor
);
1953 u32 chunk
= min(tp
->snd_wnd
, tp
->snd_cwnd
* tp
->mss_cache
);
1955 /* If at least some fraction of a window is available,
1958 chunk
/= win_divisor
;
1962 /* Different approach, try not to defer past a single
1963 * ACK. Receiver should ACK every other full sized
1964 * frame, so if we have space for more than 3 frames
1967 if (limit
> tcp_max_tso_deferred_mss(tp
) * tp
->mss_cache
)
1971 /* TODO : use tsorted_sent_queue ? */
1972 head
= tcp_rtx_queue_head(sk
);
1975 age
= tcp_stamp_us_delta(tp
->tcp_mstamp
, tcp_skb_timestamp_us(head
));
1976 /* If next ACK is likely to come too late (half srtt), do not defer */
1977 if (age
< (tp
->srtt_us
>> 4))
1980 /* Ok, it looks like it is advisable to defer. */
1982 if (cong_win
< send_win
&& cong_win
<= skb
->len
)
1983 *is_cwnd_limited
= true;
1991 static inline void tcp_mtu_check_reprobe(struct sock
*sk
)
1993 struct inet_connection_sock
*icsk
= inet_csk(sk
);
1994 struct tcp_sock
*tp
= tcp_sk(sk
);
1995 struct net
*net
= sock_net(sk
);
1999 interval
= net
->ipv4
.sysctl_tcp_probe_interval
;
2000 delta
= tcp_jiffies32
- icsk
->icsk_mtup
.probe_timestamp
;
2001 if (unlikely(delta
>= interval
* HZ
)) {
2002 int mss
= tcp_current_mss(sk
);
2004 /* Update current search range */
2005 icsk
->icsk_mtup
.probe_size
= 0;
2006 icsk
->icsk_mtup
.search_high
= tp
->rx_opt
.mss_clamp
+
2007 sizeof(struct tcphdr
) +
2008 icsk
->icsk_af_ops
->net_header_len
;
2009 icsk
->icsk_mtup
.search_low
= tcp_mss_to_mtu(sk
, mss
);
2011 /* Update probe time stamp */
2012 icsk
->icsk_mtup
.probe_timestamp
= tcp_jiffies32
;
2016 static bool tcp_can_coalesce_send_queue_head(struct sock
*sk
, int len
)
2018 struct sk_buff
*skb
, *next
;
2020 skb
= tcp_send_head(sk
);
2021 tcp_for_write_queue_from_safe(skb
, next
, sk
) {
2022 if (len
<= skb
->len
)
2025 if (unlikely(TCP_SKB_CB(skb
)->eor
))
2034 /* Create a new MTU probe if we are ready.
2035 * MTU probe is regularly attempting to increase the path MTU by
2036 * deliberately sending larger packets. This discovers routing
2037 * changes resulting in larger path MTUs.
2039 * Returns 0 if we should wait to probe (no cwnd available),
2040 * 1 if a probe was sent,
2043 static int tcp_mtu_probe(struct sock
*sk
)
2045 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2046 struct tcp_sock
*tp
= tcp_sk(sk
);
2047 struct sk_buff
*skb
, *nskb
, *next
;
2048 struct net
*net
= sock_net(sk
);
2055 /* Not currently probing/verifying,
2057 * have enough cwnd, and
2058 * not SACKing (the variable headers throw things off)
2060 if (likely(!icsk
->icsk_mtup
.enabled
||
2061 icsk
->icsk_mtup
.probe_size
||
2062 inet_csk(sk
)->icsk_ca_state
!= TCP_CA_Open
||
2063 tp
->snd_cwnd
< 11 ||
2064 tp
->rx_opt
.num_sacks
|| tp
->rx_opt
.dsack
))
2067 /* Use binary search for probe_size between tcp_mss_base,
2068 * and current mss_clamp. if (search_high - search_low)
2069 * smaller than a threshold, backoff from probing.
2071 mss_now
= tcp_current_mss(sk
);
2072 probe_size
= tcp_mtu_to_mss(sk
, (icsk
->icsk_mtup
.search_high
+
2073 icsk
->icsk_mtup
.search_low
) >> 1);
2074 size_needed
= probe_size
+ (tp
->reordering
+ 1) * tp
->mss_cache
;
2075 interval
= icsk
->icsk_mtup
.search_high
- icsk
->icsk_mtup
.search_low
;
2076 /* When misfortune happens, we are reprobing actively,
2077 * and then reprobe timer has expired. We stick with current
2078 * probing process by not resetting search range to its orignal.
2080 if (probe_size
> tcp_mtu_to_mss(sk
, icsk
->icsk_mtup
.search_high
) ||
2081 interval
< net
->ipv4
.sysctl_tcp_probe_threshold
) {
2082 /* Check whether enough time has elaplased for
2083 * another round of probing.
2085 tcp_mtu_check_reprobe(sk
);
2089 /* Have enough data in the send queue to probe? */
2090 if (tp
->write_seq
- tp
->snd_nxt
< size_needed
)
2093 if (tp
->snd_wnd
< size_needed
)
2095 if (after(tp
->snd_nxt
+ size_needed
, tcp_wnd_end(tp
)))
2098 /* Do we need to wait to drain cwnd? With none in flight, don't stall */
2099 if (tcp_packets_in_flight(tp
) + 2 > tp
->snd_cwnd
) {
2100 if (!tcp_packets_in_flight(tp
))
2106 if (!tcp_can_coalesce_send_queue_head(sk
, probe_size
))
2109 /* We're allowed to probe. Build it now. */
2110 nskb
= sk_stream_alloc_skb(sk
, probe_size
, GFP_ATOMIC
, false);
2113 sk
->sk_wmem_queued
+= nskb
->truesize
;
2114 sk_mem_charge(sk
, nskb
->truesize
);
2116 skb
= tcp_send_head(sk
);
2118 TCP_SKB_CB(nskb
)->seq
= TCP_SKB_CB(skb
)->seq
;
2119 TCP_SKB_CB(nskb
)->end_seq
= TCP_SKB_CB(skb
)->seq
+ probe_size
;
2120 TCP_SKB_CB(nskb
)->tcp_flags
= TCPHDR_ACK
;
2121 TCP_SKB_CB(nskb
)->sacked
= 0;
2123 nskb
->ip_summed
= CHECKSUM_PARTIAL
;
2125 tcp_insert_write_queue_before(nskb
, skb
, sk
);
2126 tcp_highest_sack_replace(sk
, skb
, nskb
);
2129 tcp_for_write_queue_from_safe(skb
, next
, sk
) {
2130 copy
= min_t(int, skb
->len
, probe_size
- len
);
2131 skb_copy_bits(skb
, 0, skb_put(nskb
, copy
), copy
);
2133 if (skb
->len
<= copy
) {
2134 /* We've eaten all the data from this skb.
2136 TCP_SKB_CB(nskb
)->tcp_flags
|= TCP_SKB_CB(skb
)->tcp_flags
;
2137 /* If this is the last SKB we copy and eor is set
2138 * we need to propagate it to the new skb.
2140 TCP_SKB_CB(nskb
)->eor
= TCP_SKB_CB(skb
)->eor
;
2141 tcp_unlink_write_queue(skb
, sk
);
2142 sk_wmem_free_skb(sk
, skb
);
2144 TCP_SKB_CB(nskb
)->tcp_flags
|= TCP_SKB_CB(skb
)->tcp_flags
&
2145 ~(TCPHDR_FIN
|TCPHDR_PSH
);
2146 if (!skb_shinfo(skb
)->nr_frags
) {
2147 skb_pull(skb
, copy
);
2149 __pskb_trim_head(skb
, copy
);
2150 tcp_set_skb_tso_segs(skb
, mss_now
);
2152 TCP_SKB_CB(skb
)->seq
+= copy
;
2157 if (len
>= probe_size
)
2160 tcp_init_tso_segs(nskb
, nskb
->len
);
2162 /* We're ready to send. If this fails, the probe will
2163 * be resegmented into mss-sized pieces by tcp_write_xmit().
2165 if (!tcp_transmit_skb(sk
, nskb
, 1, GFP_ATOMIC
)) {
2166 /* Decrement cwnd here because we are sending
2167 * effectively two packets. */
2169 tcp_event_new_data_sent(sk
, nskb
);
2171 icsk
->icsk_mtup
.probe_size
= tcp_mss_to_mtu(sk
, nskb
->len
);
2172 tp
->mtu_probe
.probe_seq_start
= TCP_SKB_CB(nskb
)->seq
;
2173 tp
->mtu_probe
.probe_seq_end
= TCP_SKB_CB(nskb
)->end_seq
;
2181 static bool tcp_pacing_check(const struct sock
*sk
)
2183 return tcp_needs_internal_pacing(sk
) &&
2184 hrtimer_is_queued(&tcp_sk(sk
)->pacing_timer
);
2187 /* TCP Small Queues :
2188 * Control number of packets in qdisc/devices to two packets / or ~1 ms.
2189 * (These limits are doubled for retransmits)
2191 * - better RTT estimation and ACK scheduling
2194 * Alas, some drivers / subsystems require a fair amount
2195 * of queued bytes to ensure line rate.
2196 * One example is wifi aggregation (802.11 AMPDU)
2198 static bool tcp_small_queue_check(struct sock
*sk
, const struct sk_buff
*skb
,
2199 unsigned int factor
)
2203 limit
= max(2 * skb
->truesize
, sk
->sk_pacing_rate
>> sk
->sk_pacing_shift
);
2204 limit
= min_t(u32
, limit
,
2205 sock_net(sk
)->ipv4
.sysctl_tcp_limit_output_bytes
);
2208 if (refcount_read(&sk
->sk_wmem_alloc
) > limit
) {
2209 /* Always send skb if rtx queue is empty.
2210 * No need to wait for TX completion to call us back,
2211 * after softirq/tasklet schedule.
2212 * This helps when TX completions are delayed too much.
2214 if (tcp_rtx_queue_empty(sk
))
2217 set_bit(TSQ_THROTTLED
, &sk
->sk_tsq_flags
);
2218 /* It is possible TX completion already happened
2219 * before we set TSQ_THROTTLED, so we must
2220 * test again the condition.
2222 smp_mb__after_atomic();
2223 if (refcount_read(&sk
->sk_wmem_alloc
) > limit
)
2229 static void tcp_chrono_set(struct tcp_sock
*tp
, const enum tcp_chrono
new)
2231 const u32 now
= tcp_jiffies32
;
2232 enum tcp_chrono old
= tp
->chrono_type
;
2234 if (old
> TCP_CHRONO_UNSPEC
)
2235 tp
->chrono_stat
[old
- 1] += now
- tp
->chrono_start
;
2236 tp
->chrono_start
= now
;
2237 tp
->chrono_type
= new;
2240 void tcp_chrono_start(struct sock
*sk
, const enum tcp_chrono type
)
2242 struct tcp_sock
*tp
= tcp_sk(sk
);
2244 /* If there are multiple conditions worthy of tracking in a
2245 * chronograph then the highest priority enum takes precedence
2246 * over the other conditions. So that if something "more interesting"
2247 * starts happening, stop the previous chrono and start a new one.
2249 if (type
> tp
->chrono_type
)
2250 tcp_chrono_set(tp
, type
);
2253 void tcp_chrono_stop(struct sock
*sk
, const enum tcp_chrono type
)
2255 struct tcp_sock
*tp
= tcp_sk(sk
);
2258 /* There are multiple conditions worthy of tracking in a
2259 * chronograph, so that the highest priority enum takes
2260 * precedence over the other conditions (see tcp_chrono_start).
2261 * If a condition stops, we only stop chrono tracking if
2262 * it's the "most interesting" or current chrono we are
2263 * tracking and starts busy chrono if we have pending data.
2265 if (tcp_rtx_and_write_queues_empty(sk
))
2266 tcp_chrono_set(tp
, TCP_CHRONO_UNSPEC
);
2267 else if (type
== tp
->chrono_type
)
2268 tcp_chrono_set(tp
, TCP_CHRONO_BUSY
);
2271 /* This routine writes packets to the network. It advances the
2272 * send_head. This happens as incoming acks open up the remote
2275 * LARGESEND note: !tcp_urg_mode is overkill, only frames between
2276 * snd_up-64k-mss .. snd_up cannot be large. However, taking into
2277 * account rare use of URG, this is not a big flaw.
2279 * Send at most one packet when push_one > 0. Temporarily ignore
2280 * cwnd limit to force at most one packet out when push_one == 2.
2282 * Returns true, if no segments are in flight and we have queued segments,
2283 * but cannot send anything now because of SWS or another problem.
2285 static bool tcp_write_xmit(struct sock
*sk
, unsigned int mss_now
, int nonagle
,
2286 int push_one
, gfp_t gfp
)
2288 struct tcp_sock
*tp
= tcp_sk(sk
);
2289 struct sk_buff
*skb
;
2290 unsigned int tso_segs
, sent_pkts
;
2293 bool is_cwnd_limited
= false, is_rwnd_limited
= false;
2298 tcp_mstamp_refresh(tp
);
2300 /* Do MTU probing. */
2301 result
= tcp_mtu_probe(sk
);
2304 } else if (result
> 0) {
2309 max_segs
= tcp_tso_segs(sk
, mss_now
);
2310 while ((skb
= tcp_send_head(sk
))) {
2313 if (tcp_pacing_check(sk
))
2316 tso_segs
= tcp_init_tso_segs(skb
, mss_now
);
2319 if (unlikely(tp
->repair
) && tp
->repair_queue
== TCP_SEND_QUEUE
) {
2320 /* "skb_mstamp" is used as a start point for the retransmit timer */
2321 tcp_update_skb_after_send(sk
, skb
);
2322 goto repair
; /* Skip network transmission */
2325 cwnd_quota
= tcp_cwnd_test(tp
, skb
);
2328 /* Force out a loss probe pkt. */
2334 if (unlikely(!tcp_snd_wnd_test(tp
, skb
, mss_now
))) {
2335 is_rwnd_limited
= true;
2339 if (tso_segs
== 1) {
2340 if (unlikely(!tcp_nagle_test(tp
, skb
, mss_now
,
2341 (tcp_skb_is_last(sk
, skb
) ?
2342 nonagle
: TCP_NAGLE_PUSH
))))
2346 tcp_tso_should_defer(sk
, skb
, &is_cwnd_limited
,
2352 if (tso_segs
> 1 && !tcp_urg_mode(tp
))
2353 limit
= tcp_mss_split_point(sk
, skb
, mss_now
,
2359 if (skb
->len
> limit
&&
2360 unlikely(tso_fragment(sk
, TCP_FRAG_IN_WRITE_QUEUE
,
2361 skb
, limit
, mss_now
, gfp
)))
2364 if (tcp_small_queue_check(sk
, skb
, 0))
2367 if (unlikely(tcp_transmit_skb(sk
, skb
, 1, gfp
)))
2371 /* Advance the send_head. This one is sent out.
2372 * This call will increment packets_out.
2374 tcp_event_new_data_sent(sk
, skb
);
2376 tcp_minshall_update(tp
, mss_now
, skb
);
2377 sent_pkts
+= tcp_skb_pcount(skb
);
2383 if (is_rwnd_limited
)
2384 tcp_chrono_start(sk
, TCP_CHRONO_RWND_LIMITED
);
2386 tcp_chrono_stop(sk
, TCP_CHRONO_RWND_LIMITED
);
2388 if (likely(sent_pkts
)) {
2389 if (tcp_in_cwnd_reduction(sk
))
2390 tp
->prr_out
+= sent_pkts
;
2392 /* Send one loss probe per tail loss episode. */
2394 tcp_schedule_loss_probe(sk
, false);
2395 is_cwnd_limited
|= (tcp_packets_in_flight(tp
) >= tp
->snd_cwnd
);
2396 tcp_cwnd_validate(sk
, is_cwnd_limited
);
2399 return !tp
->packets_out
&& !tcp_write_queue_empty(sk
);
2402 bool tcp_schedule_loss_probe(struct sock
*sk
, bool advancing_rto
)
2404 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2405 struct tcp_sock
*tp
= tcp_sk(sk
);
2406 u32 timeout
, rto_delta_us
;
2409 /* Don't do any loss probe on a Fast Open connection before 3WHS
2412 if (tp
->fastopen_rsk
)
2415 early_retrans
= sock_net(sk
)->ipv4
.sysctl_tcp_early_retrans
;
2416 /* Schedule a loss probe in 2*RTT for SACK capable connections
2417 * not in loss recovery, that are either limited by cwnd or application.
2419 if ((early_retrans
!= 3 && early_retrans
!= 4) ||
2420 !tp
->packets_out
|| !tcp_is_sack(tp
) ||
2421 (icsk
->icsk_ca_state
!= TCP_CA_Open
&&
2422 icsk
->icsk_ca_state
!= TCP_CA_CWR
))
2425 /* Probe timeout is 2*rtt. Add minimum RTO to account
2426 * for delayed ack when there's one outstanding packet. If no RTT
2427 * sample is available then probe after TCP_TIMEOUT_INIT.
2430 timeout
= usecs_to_jiffies(tp
->srtt_us
>> 2);
2431 if (tp
->packets_out
== 1)
2432 timeout
+= TCP_RTO_MIN
;
2434 timeout
+= TCP_TIMEOUT_MIN
;
2436 timeout
= TCP_TIMEOUT_INIT
;
2439 /* If the RTO formula yields an earlier time, then use that time. */
2440 rto_delta_us
= advancing_rto
?
2441 jiffies_to_usecs(inet_csk(sk
)->icsk_rto
) :
2442 tcp_rto_delta_us(sk
); /* How far in future is RTO? */
2443 if (rto_delta_us
> 0)
2444 timeout
= min_t(u32
, timeout
, usecs_to_jiffies(rto_delta_us
));
2446 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_LOSS_PROBE
, timeout
,
2451 /* Thanks to skb fast clones, we can detect if a prior transmit of
2452 * a packet is still in a qdisc or driver queue.
2453 * In this case, there is very little point doing a retransmit !
2455 static bool skb_still_in_host_queue(const struct sock
*sk
,
2456 const struct sk_buff
*skb
)
2458 if (unlikely(skb_fclone_busy(sk
, skb
))) {
2459 NET_INC_STATS(sock_net(sk
),
2460 LINUX_MIB_TCPSPURIOUS_RTX_HOSTQUEUES
);
2466 /* When probe timeout (PTO) fires, try send a new segment if possible, else
2467 * retransmit the last segment.
2469 void tcp_send_loss_probe(struct sock
*sk
)
2471 struct tcp_sock
*tp
= tcp_sk(sk
);
2472 struct sk_buff
*skb
;
2474 int mss
= tcp_current_mss(sk
);
2476 skb
= tcp_send_head(sk
);
2477 if (skb
&& tcp_snd_wnd_test(tp
, skb
, mss
)) {
2478 pcount
= tp
->packets_out
;
2479 tcp_write_xmit(sk
, mss
, TCP_NAGLE_OFF
, 2, GFP_ATOMIC
);
2480 if (tp
->packets_out
> pcount
)
2484 skb
= skb_rb_last(&sk
->tcp_rtx_queue
);
2486 /* At most one outstanding TLP retransmission. */
2487 if (tp
->tlp_high_seq
)
2490 /* Retransmit last segment. */
2494 if (skb_still_in_host_queue(sk
, skb
))
2497 pcount
= tcp_skb_pcount(skb
);
2498 if (WARN_ON(!pcount
))
2501 if ((pcount
> 1) && (skb
->len
> (pcount
- 1) * mss
)) {
2502 if (unlikely(tcp_fragment(sk
, TCP_FRAG_IN_RTX_QUEUE
, skb
,
2503 (pcount
- 1) * mss
, mss
,
2506 skb
= skb_rb_next(skb
);
2509 if (WARN_ON(!skb
|| !tcp_skb_pcount(skb
)))
2512 if (__tcp_retransmit_skb(sk
, skb
, 1))
2515 /* Record snd_nxt for loss detection. */
2516 tp
->tlp_high_seq
= tp
->snd_nxt
;
2519 NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPLOSSPROBES
);
2520 /* Reset s.t. tcp_rearm_rto will restart timer from now */
2521 inet_csk(sk
)->icsk_pending
= 0;
2526 /* Push out any pending frames which were held back due to
2527 * TCP_CORK or attempt at coalescing tiny packets.
2528 * The socket must be locked by the caller.
2530 void __tcp_push_pending_frames(struct sock
*sk
, unsigned int cur_mss
,
2533 /* If we are closed, the bytes will have to remain here.
2534 * In time closedown will finish, we empty the write queue and
2535 * all will be happy.
2537 if (unlikely(sk
->sk_state
== TCP_CLOSE
))
2540 if (tcp_write_xmit(sk
, cur_mss
, nonagle
, 0,
2541 sk_gfp_mask(sk
, GFP_ATOMIC
)))
2542 tcp_check_probe_timer(sk
);
2545 /* Send _single_ skb sitting at the send head. This function requires
2546 * true push pending frames to setup probe timer etc.
2548 void tcp_push_one(struct sock
*sk
, unsigned int mss_now
)
2550 struct sk_buff
*skb
= tcp_send_head(sk
);
2552 BUG_ON(!skb
|| skb
->len
< mss_now
);
2554 tcp_write_xmit(sk
, mss_now
, TCP_NAGLE_PUSH
, 1, sk
->sk_allocation
);
2557 /* This function returns the amount that we can raise the
2558 * usable window based on the following constraints
2560 * 1. The window can never be shrunk once it is offered (RFC 793)
2561 * 2. We limit memory per socket
2564 * "the suggested [SWS] avoidance algorithm for the receiver is to keep
2565 * RECV.NEXT + RCV.WIN fixed until:
2566 * RCV.BUFF - RCV.USER - RCV.WINDOW >= min(1/2 RCV.BUFF, MSS)"
2568 * i.e. don't raise the right edge of the window until you can raise
2569 * it at least MSS bytes.
2571 * Unfortunately, the recommended algorithm breaks header prediction,
2572 * since header prediction assumes th->window stays fixed.
2574 * Strictly speaking, keeping th->window fixed violates the receiver
2575 * side SWS prevention criteria. The problem is that under this rule
2576 * a stream of single byte packets will cause the right side of the
2577 * window to always advance by a single byte.
2579 * Of course, if the sender implements sender side SWS prevention
2580 * then this will not be a problem.
2582 * BSD seems to make the following compromise:
2584 * If the free space is less than the 1/4 of the maximum
2585 * space available and the free space is less than 1/2 mss,
2586 * then set the window to 0.
2587 * [ Actually, bsd uses MSS and 1/4 of maximal _window_ ]
2588 * Otherwise, just prevent the window from shrinking
2589 * and from being larger than the largest representable value.
2591 * This prevents incremental opening of the window in the regime
2592 * where TCP is limited by the speed of the reader side taking
2593 * data out of the TCP receive queue. It does nothing about
2594 * those cases where the window is constrained on the sender side
2595 * because the pipeline is full.
2597 * BSD also seems to "accidentally" limit itself to windows that are a
2598 * multiple of MSS, at least until the free space gets quite small.
2599 * This would appear to be a side effect of the mbuf implementation.
2600 * Combining these two algorithms results in the observed behavior
2601 * of having a fixed window size at almost all times.
2603 * Below we obtain similar behavior by forcing the offered window to
2604 * a multiple of the mss when it is feasible to do so.
2606 * Note, we don't "adjust" for TIMESTAMP or SACK option bytes.
2607 * Regular options like TIMESTAMP are taken into account.
2609 u32
__tcp_select_window(struct sock
*sk
)
2611 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2612 struct tcp_sock
*tp
= tcp_sk(sk
);
2613 /* MSS for the peer's data. Previous versions used mss_clamp
2614 * here. I don't know if the value based on our guesses
2615 * of peer's MSS is better for the performance. It's more correct
2616 * but may be worse for the performance because of rcv_mss
2617 * fluctuations. --SAW 1998/11/1
2619 int mss
= icsk
->icsk_ack
.rcv_mss
;
2620 int free_space
= tcp_space(sk
);
2621 int allowed_space
= tcp_full_space(sk
);
2622 int full_space
= min_t(int, tp
->window_clamp
, allowed_space
);
2625 if (unlikely(mss
> full_space
)) {
2630 if (free_space
< (full_space
>> 1)) {
2631 icsk
->icsk_ack
.quick
= 0;
2633 if (tcp_under_memory_pressure(sk
))
2634 tp
->rcv_ssthresh
= min(tp
->rcv_ssthresh
,
2637 /* free_space might become our new window, make sure we don't
2638 * increase it due to wscale.
2640 free_space
= round_down(free_space
, 1 << tp
->rx_opt
.rcv_wscale
);
2642 /* if free space is less than mss estimate, or is below 1/16th
2643 * of the maximum allowed, try to move to zero-window, else
2644 * tcp_clamp_window() will grow rcv buf up to tcp_rmem[2], and
2645 * new incoming data is dropped due to memory limits.
2646 * With large window, mss test triggers way too late in order
2647 * to announce zero window in time before rmem limit kicks in.
2649 if (free_space
< (allowed_space
>> 4) || free_space
< mss
)
2653 if (free_space
> tp
->rcv_ssthresh
)
2654 free_space
= tp
->rcv_ssthresh
;
2656 /* Don't do rounding if we are using window scaling, since the
2657 * scaled window will not line up with the MSS boundary anyway.
2659 if (tp
->rx_opt
.rcv_wscale
) {
2660 window
= free_space
;
2662 /* Advertise enough space so that it won't get scaled away.
2663 * Import case: prevent zero window announcement if
2664 * 1<<rcv_wscale > mss.
2666 window
= ALIGN(window
, (1 << tp
->rx_opt
.rcv_wscale
));
2668 window
= tp
->rcv_wnd
;
2669 /* Get the largest window that is a nice multiple of mss.
2670 * Window clamp already applied above.
2671 * If our current window offering is within 1 mss of the
2672 * free space we just keep it. This prevents the divide
2673 * and multiply from happening most of the time.
2674 * We also don't do any window rounding when the free space
2677 if (window
<= free_space
- mss
|| window
> free_space
)
2678 window
= rounddown(free_space
, mss
);
2679 else if (mss
== full_space
&&
2680 free_space
> window
+ (full_space
>> 1))
2681 window
= free_space
;
2687 void tcp_skb_collapse_tstamp(struct sk_buff
*skb
,
2688 const struct sk_buff
*next_skb
)
2690 if (unlikely(tcp_has_tx_tstamp(next_skb
))) {
2691 const struct skb_shared_info
*next_shinfo
=
2692 skb_shinfo(next_skb
);
2693 struct skb_shared_info
*shinfo
= skb_shinfo(skb
);
2695 shinfo
->tx_flags
|= next_shinfo
->tx_flags
& SKBTX_ANY_TSTAMP
;
2696 shinfo
->tskey
= next_shinfo
->tskey
;
2697 TCP_SKB_CB(skb
)->txstamp_ack
|=
2698 TCP_SKB_CB(next_skb
)->txstamp_ack
;
2702 /* Collapses two adjacent SKB's during retransmission. */
2703 static bool tcp_collapse_retrans(struct sock
*sk
, struct sk_buff
*skb
)
2705 struct tcp_sock
*tp
= tcp_sk(sk
);
2706 struct sk_buff
*next_skb
= skb_rb_next(skb
);
2709 next_skb_size
= next_skb
->len
;
2711 BUG_ON(tcp_skb_pcount(skb
) != 1 || tcp_skb_pcount(next_skb
) != 1);
2713 if (next_skb_size
) {
2714 if (next_skb_size
<= skb_availroom(skb
))
2715 skb_copy_bits(next_skb
, 0, skb_put(skb
, next_skb_size
),
2717 else if (!skb_shift(skb
, next_skb
, next_skb_size
))
2720 tcp_highest_sack_replace(sk
, next_skb
, skb
);
2722 /* Update sequence range on original skb. */
2723 TCP_SKB_CB(skb
)->end_seq
= TCP_SKB_CB(next_skb
)->end_seq
;
2725 /* Merge over control information. This moves PSH/FIN etc. over */
2726 TCP_SKB_CB(skb
)->tcp_flags
|= TCP_SKB_CB(next_skb
)->tcp_flags
;
2728 /* All done, get rid of second SKB and account for it so
2729 * packet counting does not break.
2731 TCP_SKB_CB(skb
)->sacked
|= TCP_SKB_CB(next_skb
)->sacked
& TCPCB_EVER_RETRANS
;
2732 TCP_SKB_CB(skb
)->eor
= TCP_SKB_CB(next_skb
)->eor
;
2734 /* changed transmit queue under us so clear hints */
2735 tcp_clear_retrans_hints_partial(tp
);
2736 if (next_skb
== tp
->retransmit_skb_hint
)
2737 tp
->retransmit_skb_hint
= skb
;
2739 tcp_adjust_pcount(sk
, next_skb
, tcp_skb_pcount(next_skb
));
2741 tcp_skb_collapse_tstamp(skb
, next_skb
);
2743 tcp_rtx_queue_unlink_and_free(next_skb
, sk
);
2747 /* Check if coalescing SKBs is legal. */
2748 static bool tcp_can_collapse(const struct sock
*sk
, const struct sk_buff
*skb
)
2750 if (tcp_skb_pcount(skb
) > 1)
2752 if (skb_cloned(skb
))
2754 /* Some heuristics for collapsing over SACK'd could be invented */
2755 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
)
2761 /* Collapse packets in the retransmit queue to make to create
2762 * less packets on the wire. This is only done on retransmission.
2764 static void tcp_retrans_try_collapse(struct sock
*sk
, struct sk_buff
*to
,
2767 struct tcp_sock
*tp
= tcp_sk(sk
);
2768 struct sk_buff
*skb
= to
, *tmp
;
2771 if (!sock_net(sk
)->ipv4
.sysctl_tcp_retrans_collapse
)
2773 if (TCP_SKB_CB(skb
)->tcp_flags
& TCPHDR_SYN
)
2776 skb_rbtree_walk_from_safe(skb
, tmp
) {
2777 if (!tcp_can_collapse(sk
, skb
))
2780 if (!tcp_skb_can_collapse_to(to
))
2793 if (after(TCP_SKB_CB(skb
)->end_seq
, tcp_wnd_end(tp
)))
2796 if (!tcp_collapse_retrans(sk
, to
))
2801 /* This retransmits one SKB. Policy decisions and retransmit queue
2802 * state updates are done by the caller. Returns non-zero if an
2803 * error occurred which prevented the send.
2805 int __tcp_retransmit_skb(struct sock
*sk
, struct sk_buff
*skb
, int segs
)
2807 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2808 struct tcp_sock
*tp
= tcp_sk(sk
);
2809 unsigned int cur_mss
;
2813 /* Inconclusive MTU probe */
2814 if (icsk
->icsk_mtup
.probe_size
)
2815 icsk
->icsk_mtup
.probe_size
= 0;
2817 /* Do not sent more than we queued. 1/4 is reserved for possible
2818 * copying overhead: fragmentation, tunneling, mangling etc.
2820 if (refcount_read(&sk
->sk_wmem_alloc
) >
2821 min_t(u32
, sk
->sk_wmem_queued
+ (sk
->sk_wmem_queued
>> 2),
2825 if (skb_still_in_host_queue(sk
, skb
))
2828 if (before(TCP_SKB_CB(skb
)->seq
, tp
->snd_una
)) {
2829 if (unlikely(before(TCP_SKB_CB(skb
)->end_seq
, tp
->snd_una
))) {
2833 if (tcp_trim_head(sk
, skb
, tp
->snd_una
- TCP_SKB_CB(skb
)->seq
))
2837 if (inet_csk(sk
)->icsk_af_ops
->rebuild_header(sk
))
2838 return -EHOSTUNREACH
; /* Routing failure or similar. */
2840 cur_mss
= tcp_current_mss(sk
);
2842 /* If receiver has shrunk his window, and skb is out of
2843 * new window, do not retransmit it. The exception is the
2844 * case, when window is shrunk to zero. In this case
2845 * our retransmit serves as a zero window probe.
2847 if (!before(TCP_SKB_CB(skb
)->seq
, tcp_wnd_end(tp
)) &&
2848 TCP_SKB_CB(skb
)->seq
!= tp
->snd_una
)
2851 len
= cur_mss
* segs
;
2852 if (skb
->len
> len
) {
2853 if (tcp_fragment(sk
, TCP_FRAG_IN_RTX_QUEUE
, skb
, len
,
2854 cur_mss
, GFP_ATOMIC
))
2855 return -ENOMEM
; /* We'll try again later. */
2857 if (skb_unclone(skb
, GFP_ATOMIC
))
2860 diff
= tcp_skb_pcount(skb
);
2861 tcp_set_skb_tso_segs(skb
, cur_mss
);
2862 diff
-= tcp_skb_pcount(skb
);
2864 tcp_adjust_pcount(sk
, skb
, diff
);
2865 if (skb
->len
< cur_mss
)
2866 tcp_retrans_try_collapse(sk
, skb
, cur_mss
);
2869 /* RFC3168, section 6.1.1.1. ECN fallback */
2870 if ((TCP_SKB_CB(skb
)->tcp_flags
& TCPHDR_SYN_ECN
) == TCPHDR_SYN_ECN
)
2871 tcp_ecn_clear_syn(sk
, skb
);
2873 /* Update global and local TCP statistics. */
2874 segs
= tcp_skb_pcount(skb
);
2875 TCP_ADD_STATS(sock_net(sk
), TCP_MIB_RETRANSSEGS
, segs
);
2876 if (TCP_SKB_CB(skb
)->tcp_flags
& TCPHDR_SYN
)
2877 __NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPSYNRETRANS
);
2878 tp
->total_retrans
+= segs
;
2879 tp
->bytes_retrans
+= skb
->len
;
2881 /* make sure skb->data is aligned on arches that require it
2882 * and check if ack-trimming & collapsing extended the headroom
2883 * beyond what csum_start can cover.
2885 if (unlikely((NET_IP_ALIGN
&& ((unsigned long)skb
->data
& 3)) ||
2886 skb_headroom(skb
) >= 0xFFFF)) {
2887 struct sk_buff
*nskb
;
2889 tcp_skb_tsorted_save(skb
) {
2890 nskb
= __pskb_copy(skb
, MAX_TCP_HEADER
, GFP_ATOMIC
);
2891 err
= nskb
? tcp_transmit_skb(sk
, nskb
, 0, GFP_ATOMIC
) :
2893 } tcp_skb_tsorted_restore(skb
);
2896 tcp_update_skb_after_send(sk
, skb
);
2897 tcp_rate_skb_sent(sk
, skb
);
2900 err
= tcp_transmit_skb(sk
, skb
, 1, GFP_ATOMIC
);
2903 if (BPF_SOCK_OPS_TEST_FLAG(tp
, BPF_SOCK_OPS_RETRANS_CB_FLAG
))
2904 tcp_call_bpf_3arg(sk
, BPF_SOCK_OPS_RETRANS_CB
,
2905 TCP_SKB_CB(skb
)->seq
, segs
, err
);
2908 TCP_SKB_CB(skb
)->sacked
|= TCPCB_EVER_RETRANS
;
2909 trace_tcp_retransmit_skb(sk
, skb
);
2910 } else if (err
!= -EBUSY
) {
2911 NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPRETRANSFAIL
);
2916 int tcp_retransmit_skb(struct sock
*sk
, struct sk_buff
*skb
, int segs
)
2918 struct tcp_sock
*tp
= tcp_sk(sk
);
2919 int err
= __tcp_retransmit_skb(sk
, skb
, segs
);
2922 #if FASTRETRANS_DEBUG > 0
2923 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_RETRANS
) {
2924 net_dbg_ratelimited("retrans_out leaked\n");
2927 TCP_SKB_CB(skb
)->sacked
|= TCPCB_RETRANS
;
2928 tp
->retrans_out
+= tcp_skb_pcount(skb
);
2930 /* Save stamp of the first retransmit. */
2931 if (!tp
->retrans_stamp
)
2932 tp
->retrans_stamp
= tcp_skb_timestamp(skb
);
2936 if (tp
->undo_retrans
< 0)
2937 tp
->undo_retrans
= 0;
2938 tp
->undo_retrans
+= tcp_skb_pcount(skb
);
2942 /* This gets called after a retransmit timeout, and the initially
2943 * retransmitted data is acknowledged. It tries to continue
2944 * resending the rest of the retransmit queue, until either
2945 * we've sent it all or the congestion window limit is reached.
2947 void tcp_xmit_retransmit_queue(struct sock
*sk
)
2949 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
2950 struct sk_buff
*skb
, *rtx_head
, *hole
= NULL
;
2951 struct tcp_sock
*tp
= tcp_sk(sk
);
2955 if (!tp
->packets_out
)
2958 rtx_head
= tcp_rtx_queue_head(sk
);
2959 skb
= tp
->retransmit_skb_hint
?: rtx_head
;
2960 max_segs
= tcp_tso_segs(sk
, tcp_current_mss(sk
));
2961 skb_rbtree_walk_from(skb
) {
2965 if (tcp_pacing_check(sk
))
2968 /* we could do better than to assign each time */
2970 tp
->retransmit_skb_hint
= skb
;
2972 segs
= tp
->snd_cwnd
- tcp_packets_in_flight(tp
);
2975 sacked
= TCP_SKB_CB(skb
)->sacked
;
2976 /* In case tcp_shift_skb_data() have aggregated large skbs,
2977 * we need to make sure not sending too bigs TSO packets
2979 segs
= min_t(int, segs
, max_segs
);
2981 if (tp
->retrans_out
>= tp
->lost_out
) {
2983 } else if (!(sacked
& TCPCB_LOST
)) {
2984 if (!hole
&& !(sacked
& (TCPCB_SACKED_RETRANS
|TCPCB_SACKED_ACKED
)))
2989 if (icsk
->icsk_ca_state
!= TCP_CA_Loss
)
2990 mib_idx
= LINUX_MIB_TCPFASTRETRANS
;
2992 mib_idx
= LINUX_MIB_TCPSLOWSTARTRETRANS
;
2995 if (sacked
& (TCPCB_SACKED_ACKED
|TCPCB_SACKED_RETRANS
))
2998 if (tcp_small_queue_check(sk
, skb
, 1))
3001 if (tcp_retransmit_skb(sk
, skb
, segs
))
3004 NET_ADD_STATS(sock_net(sk
), mib_idx
, tcp_skb_pcount(skb
));
3006 if (tcp_in_cwnd_reduction(sk
))
3007 tp
->prr_out
+= tcp_skb_pcount(skb
);
3009 if (skb
== rtx_head
&&
3010 icsk
->icsk_pending
!= ICSK_TIME_REO_TIMEOUT
)
3011 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_RETRANS
,
3012 inet_csk(sk
)->icsk_rto
,
3017 /* We allow to exceed memory limits for FIN packets to expedite
3018 * connection tear down and (memory) recovery.
3019 * Otherwise tcp_send_fin() could be tempted to either delay FIN
3020 * or even be forced to close flow without any FIN.
3021 * In general, we want to allow one skb per socket to avoid hangs
3022 * with edge trigger epoll()
3024 void sk_forced_mem_schedule(struct sock
*sk
, int size
)
3028 if (size
<= sk
->sk_forward_alloc
)
3030 amt
= sk_mem_pages(size
);
3031 sk
->sk_forward_alloc
+= amt
* SK_MEM_QUANTUM
;
3032 sk_memory_allocated_add(sk
, amt
);
3034 if (mem_cgroup_sockets_enabled
&& sk
->sk_memcg
)
3035 mem_cgroup_charge_skmem(sk
->sk_memcg
, amt
);
3038 /* Send a FIN. The caller locks the socket for us.
3039 * We should try to send a FIN packet really hard, but eventually give up.
3041 void tcp_send_fin(struct sock
*sk
)
3043 struct sk_buff
*skb
, *tskb
= tcp_write_queue_tail(sk
);
3044 struct tcp_sock
*tp
= tcp_sk(sk
);
3046 /* Optimization, tack on the FIN if we have one skb in write queue and
3047 * this skb was not yet sent, or we are under memory pressure.
3048 * Note: in the latter case, FIN packet will be sent after a timeout,
3049 * as TCP stack thinks it has already been transmitted.
3051 if (!tskb
&& tcp_under_memory_pressure(sk
))
3052 tskb
= skb_rb_last(&sk
->tcp_rtx_queue
);
3056 TCP_SKB_CB(tskb
)->tcp_flags
|= TCPHDR_FIN
;
3057 TCP_SKB_CB(tskb
)->end_seq
++;
3059 if (tcp_write_queue_empty(sk
)) {
3060 /* This means tskb was already sent.
3061 * Pretend we included the FIN on previous transmit.
3062 * We need to set tp->snd_nxt to the value it would have
3063 * if FIN had been sent. This is because retransmit path
3064 * does not change tp->snd_nxt.
3070 skb
= alloc_skb_fclone(MAX_TCP_HEADER
, sk
->sk_allocation
);
3071 if (unlikely(!skb
)) {
3076 INIT_LIST_HEAD(&skb
->tcp_tsorted_anchor
);
3077 skb_reserve(skb
, MAX_TCP_HEADER
);
3078 sk_forced_mem_schedule(sk
, skb
->truesize
);
3079 /* FIN eats a sequence byte, write_seq advanced by tcp_queue_skb(). */
3080 tcp_init_nondata_skb(skb
, tp
->write_seq
,
3081 TCPHDR_ACK
| TCPHDR_FIN
);
3082 tcp_queue_skb(sk
, skb
);
3084 __tcp_push_pending_frames(sk
, tcp_current_mss(sk
), TCP_NAGLE_OFF
);
3087 /* We get here when a process closes a file descriptor (either due to
3088 * an explicit close() or as a byproduct of exit()'ing) and there
3089 * was unread data in the receive queue. This behavior is recommended
3090 * by RFC 2525, section 2.17. -DaveM
3092 void tcp_send_active_reset(struct sock
*sk
, gfp_t priority
)
3094 struct sk_buff
*skb
;
3096 TCP_INC_STATS(sock_net(sk
), TCP_MIB_OUTRSTS
);
3098 /* NOTE: No TCP options attached and we never retransmit this. */
3099 skb
= alloc_skb(MAX_TCP_HEADER
, priority
);
3101 NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPABORTFAILED
);
3105 /* Reserve space for headers and prepare control bits. */
3106 skb_reserve(skb
, MAX_TCP_HEADER
);
3107 tcp_init_nondata_skb(skb
, tcp_acceptable_seq(sk
),
3108 TCPHDR_ACK
| TCPHDR_RST
);
3109 tcp_mstamp_refresh(tcp_sk(sk
));
3111 if (tcp_transmit_skb(sk
, skb
, 0, priority
))
3112 NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPABORTFAILED
);
3114 /* skb of trace_tcp_send_reset() keeps the skb that caused RST,
3115 * skb here is different to the troublesome skb, so use NULL
3117 trace_tcp_send_reset(sk
, NULL
);
3120 /* Send a crossed SYN-ACK during socket establishment.
3121 * WARNING: This routine must only be called when we have already sent
3122 * a SYN packet that crossed the incoming SYN that caused this routine
3123 * to get called. If this assumption fails then the initial rcv_wnd
3124 * and rcv_wscale values will not be correct.
3126 int tcp_send_synack(struct sock
*sk
)
3128 struct sk_buff
*skb
;
3130 skb
= tcp_rtx_queue_head(sk
);
3131 if (!skb
|| !(TCP_SKB_CB(skb
)->tcp_flags
& TCPHDR_SYN
)) {
3132 pr_err("%s: wrong queue state\n", __func__
);
3135 if (!(TCP_SKB_CB(skb
)->tcp_flags
& TCPHDR_ACK
)) {
3136 if (skb_cloned(skb
)) {
3137 struct sk_buff
*nskb
;
3139 tcp_skb_tsorted_save(skb
) {
3140 nskb
= skb_copy(skb
, GFP_ATOMIC
);
3141 } tcp_skb_tsorted_restore(skb
);
3144 INIT_LIST_HEAD(&nskb
->tcp_tsorted_anchor
);
3145 tcp_rtx_queue_unlink_and_free(skb
, sk
);
3146 __skb_header_release(nskb
);
3147 tcp_rbtree_insert(&sk
->tcp_rtx_queue
, nskb
);
3148 sk
->sk_wmem_queued
+= nskb
->truesize
;
3149 sk_mem_charge(sk
, nskb
->truesize
);
3153 TCP_SKB_CB(skb
)->tcp_flags
|= TCPHDR_ACK
;
3154 tcp_ecn_send_synack(sk
, skb
);
3156 return tcp_transmit_skb(sk
, skb
, 1, GFP_ATOMIC
);
3160 * tcp_make_synack - Prepare a SYN-ACK.
3161 * sk: listener socket
3162 * dst: dst entry attached to the SYNACK
3163 * req: request_sock pointer
3165 * Allocate one skb and build a SYNACK packet.
3166 * @dst is consumed : Caller should not use it again.
3168 struct sk_buff
*tcp_make_synack(const struct sock
*sk
, struct dst_entry
*dst
,
3169 struct request_sock
*req
,
3170 struct tcp_fastopen_cookie
*foc
,
3171 enum tcp_synack_type synack_type
)
3173 struct inet_request_sock
*ireq
= inet_rsk(req
);
3174 const struct tcp_sock
*tp
= tcp_sk(sk
);
3175 struct tcp_md5sig_key
*md5
= NULL
;
3176 struct tcp_out_options opts
;
3177 struct sk_buff
*skb
;
3178 int tcp_header_size
;
3182 skb
= alloc_skb(MAX_TCP_HEADER
, GFP_ATOMIC
);
3183 if (unlikely(!skb
)) {
3187 /* Reserve space for headers. */
3188 skb_reserve(skb
, MAX_TCP_HEADER
);
3190 switch (synack_type
) {
3191 case TCP_SYNACK_NORMAL
:
3192 skb_set_owner_w(skb
, req_to_sk(req
));
3194 case TCP_SYNACK_COOKIE
:
3195 /* Under synflood, we do not attach skb to a socket,
3196 * to avoid false sharing.
3199 case TCP_SYNACK_FASTOPEN
:
3200 /* sk is a const pointer, because we want to express multiple
3201 * cpu might call us concurrently.
3202 * sk->sk_wmem_alloc in an atomic, we can promote to rw.
3204 skb_set_owner_w(skb
, (struct sock
*)sk
);
3207 skb_dst_set(skb
, dst
);
3209 mss
= tcp_mss_clamp(tp
, dst_metric_advmss(dst
));
3211 memset(&opts
, 0, sizeof(opts
));
3212 #ifdef CONFIG_SYN_COOKIES
3213 if (unlikely(req
->cookie_ts
))
3214 skb
->skb_mstamp_ns
= cookie_init_timestamp(req
);
3217 skb
->skb_mstamp_ns
= tcp_clock_ns();
3219 #ifdef CONFIG_TCP_MD5SIG
3221 md5
= tcp_rsk(req
)->af_specific
->req_md5_lookup(sk
, req_to_sk(req
));
3223 skb_set_hash(skb
, tcp_rsk(req
)->txhash
, PKT_HASH_TYPE_L4
);
3224 tcp_header_size
= tcp_synack_options(sk
, req
, mss
, skb
, &opts
, md5
,
3227 skb_push(skb
, tcp_header_size
);
3228 skb_reset_transport_header(skb
);
3230 th
= (struct tcphdr
*)skb
->data
;
3231 memset(th
, 0, sizeof(struct tcphdr
));
3234 tcp_ecn_make_synack(req
, th
);
3235 th
->source
= htons(ireq
->ir_num
);
3236 th
->dest
= ireq
->ir_rmt_port
;
3237 skb
->mark
= ireq
->ir_mark
;
3238 skb
->ip_summed
= CHECKSUM_PARTIAL
;
3239 th
->seq
= htonl(tcp_rsk(req
)->snt_isn
);
3240 /* XXX data is queued and acked as is. No buffer/window check */
3241 th
->ack_seq
= htonl(tcp_rsk(req
)->rcv_nxt
);
3243 /* RFC1323: The window in SYN & SYN/ACK segments is never scaled. */
3244 th
->window
= htons(min(req
->rsk_rcv_wnd
, 65535U));
3245 tcp_options_write((__be32
*)(th
+ 1), NULL
, &opts
);
3246 th
->doff
= (tcp_header_size
>> 2);
3247 __TCP_INC_STATS(sock_net(sk
), TCP_MIB_OUTSEGS
);
3249 #ifdef CONFIG_TCP_MD5SIG
3250 /* Okay, we have all we need - do the md5 hash if needed */
3252 tcp_rsk(req
)->af_specific
->calc_md5_hash(opts
.hash_location
,
3253 md5
, req_to_sk(req
), skb
);
3257 /* Do not fool tcpdump (if any), clean our debris */
3261 EXPORT_SYMBOL(tcp_make_synack
);
3263 static void tcp_ca_dst_init(struct sock
*sk
, const struct dst_entry
*dst
)
3265 struct inet_connection_sock
*icsk
= inet_csk(sk
);
3266 const struct tcp_congestion_ops
*ca
;
3267 u32 ca_key
= dst_metric(dst
, RTAX_CC_ALGO
);
3269 if (ca_key
== TCP_CA_UNSPEC
)
3273 ca
= tcp_ca_find_key(ca_key
);
3274 if (likely(ca
&& try_module_get(ca
->owner
))) {
3275 module_put(icsk
->icsk_ca_ops
->owner
);
3276 icsk
->icsk_ca_dst_locked
= tcp_ca_dst_locked(dst
);
3277 icsk
->icsk_ca_ops
= ca
;
3282 /* Do all connect socket setups that can be done AF independent. */
3283 static void tcp_connect_init(struct sock
*sk
)
3285 const struct dst_entry
*dst
= __sk_dst_get(sk
);
3286 struct tcp_sock
*tp
= tcp_sk(sk
);
3290 /* We'll fix this up when we get a response from the other end.
3291 * See tcp_input.c:tcp_rcv_state_process case TCP_SYN_SENT.
3293 tp
->tcp_header_len
= sizeof(struct tcphdr
);
3294 if (sock_net(sk
)->ipv4
.sysctl_tcp_timestamps
)
3295 tp
->tcp_header_len
+= TCPOLEN_TSTAMP_ALIGNED
;
3297 #ifdef CONFIG_TCP_MD5SIG
3298 if (tp
->af_specific
->md5_lookup(sk
, sk
))
3299 tp
->tcp_header_len
+= TCPOLEN_MD5SIG_ALIGNED
;
3302 /* If user gave his TCP_MAXSEG, record it to clamp */
3303 if (tp
->rx_opt
.user_mss
)
3304 tp
->rx_opt
.mss_clamp
= tp
->rx_opt
.user_mss
;
3307 tcp_sync_mss(sk
, dst_mtu(dst
));
3309 tcp_ca_dst_init(sk
, dst
);
3311 if (!tp
->window_clamp
)
3312 tp
->window_clamp
= dst_metric(dst
, RTAX_WINDOW
);
3313 tp
->advmss
= tcp_mss_clamp(tp
, dst_metric_advmss(dst
));
3315 tcp_initialize_rcv_mss(sk
);
3317 /* limit the window selection if the user enforce a smaller rx buffer */
3318 if (sk
->sk_userlocks
& SOCK_RCVBUF_LOCK
&&
3319 (tp
->window_clamp
> tcp_full_space(sk
) || tp
->window_clamp
== 0))
3320 tp
->window_clamp
= tcp_full_space(sk
);
3322 rcv_wnd
= tcp_rwnd_init_bpf(sk
);
3324 rcv_wnd
= dst_metric(dst
, RTAX_INITRWND
);
3326 tcp_select_initial_window(sk
, tcp_full_space(sk
),
3327 tp
->advmss
- (tp
->rx_opt
.ts_recent_stamp
? tp
->tcp_header_len
- sizeof(struct tcphdr
) : 0),
3330 sock_net(sk
)->ipv4
.sysctl_tcp_window_scaling
,
3334 tp
->rx_opt
.rcv_wscale
= rcv_wscale
;
3335 tp
->rcv_ssthresh
= tp
->rcv_wnd
;
3338 sock_reset_flag(sk
, SOCK_DONE
);
3341 tcp_write_queue_purge(sk
);
3342 tp
->snd_una
= tp
->write_seq
;
3343 tp
->snd_sml
= tp
->write_seq
;
3344 tp
->snd_up
= tp
->write_seq
;
3345 tp
->snd_nxt
= tp
->write_seq
;
3347 if (likely(!tp
->repair
))
3350 tp
->rcv_tstamp
= tcp_jiffies32
;
3351 tp
->rcv_wup
= tp
->rcv_nxt
;
3352 tp
->copied_seq
= tp
->rcv_nxt
;
3354 inet_csk(sk
)->icsk_rto
= tcp_timeout_init(sk
);
3355 inet_csk(sk
)->icsk_retransmits
= 0;
3356 tcp_clear_retrans(tp
);
3359 static void tcp_connect_queue_skb(struct sock
*sk
, struct sk_buff
*skb
)
3361 struct tcp_sock
*tp
= tcp_sk(sk
);
3362 struct tcp_skb_cb
*tcb
= TCP_SKB_CB(skb
);
3364 tcb
->end_seq
+= skb
->len
;
3365 __skb_header_release(skb
);
3366 sk
->sk_wmem_queued
+= skb
->truesize
;
3367 sk_mem_charge(sk
, skb
->truesize
);
3368 tp
->write_seq
= tcb
->end_seq
;
3369 tp
->packets_out
+= tcp_skb_pcount(skb
);
3372 /* Build and send a SYN with data and (cached) Fast Open cookie. However,
3373 * queue a data-only packet after the regular SYN, such that regular SYNs
3374 * are retransmitted on timeouts. Also if the remote SYN-ACK acknowledges
3375 * only the SYN sequence, the data are retransmitted in the first ACK.
3376 * If cookie is not cached or other error occurs, falls back to send a
3377 * regular SYN with Fast Open cookie request option.
3379 static int tcp_send_syn_data(struct sock
*sk
, struct sk_buff
*syn
)
3381 struct tcp_sock
*tp
= tcp_sk(sk
);
3382 struct tcp_fastopen_request
*fo
= tp
->fastopen_req
;
3384 struct sk_buff
*syn_data
;
3386 tp
->rx_opt
.mss_clamp
= tp
->advmss
; /* If MSS is not cached */
3387 if (!tcp_fastopen_cookie_check(sk
, &tp
->rx_opt
.mss_clamp
, &fo
->cookie
))
3390 /* MSS for SYN-data is based on cached MSS and bounded by PMTU and
3391 * user-MSS. Reserve maximum option space for middleboxes that add
3392 * private TCP options. The cost is reduced data space in SYN :(
3394 tp
->rx_opt
.mss_clamp
= tcp_mss_clamp(tp
, tp
->rx_opt
.mss_clamp
);
3396 space
= __tcp_mtu_to_mss(sk
, inet_csk(sk
)->icsk_pmtu_cookie
) -
3397 MAX_TCP_OPTION_SPACE
;
3399 space
= min_t(size_t, space
, fo
->size
);
3401 /* limit to order-0 allocations */
3402 space
= min_t(size_t, space
, SKB_MAX_HEAD(MAX_TCP_HEADER
));
3404 syn_data
= sk_stream_alloc_skb(sk
, space
, sk
->sk_allocation
, false);
3407 syn_data
->ip_summed
= CHECKSUM_PARTIAL
;
3408 memcpy(syn_data
->cb
, syn
->cb
, sizeof(syn
->cb
));
3410 int copied
= copy_from_iter(skb_put(syn_data
, space
), space
,
3411 &fo
->data
->msg_iter
);
3412 if (unlikely(!copied
)) {
3413 tcp_skb_tsorted_anchor_cleanup(syn_data
);
3414 kfree_skb(syn_data
);
3417 if (copied
!= space
) {
3418 skb_trim(syn_data
, copied
);
3422 /* No more data pending in inet_wait_for_connect() */
3423 if (space
== fo
->size
)
3427 tcp_connect_queue_skb(sk
, syn_data
);
3429 tcp_chrono_start(sk
, TCP_CHRONO_BUSY
);
3431 err
= tcp_transmit_skb(sk
, syn_data
, 1, sk
->sk_allocation
);
3433 syn
->skb_mstamp_ns
= syn_data
->skb_mstamp_ns
;
3435 /* Now full SYN+DATA was cloned and sent (or not),
3436 * remove the SYN from the original skb (syn_data)
3437 * we keep in write queue in case of a retransmit, as we
3438 * also have the SYN packet (with no data) in the same queue.
3440 TCP_SKB_CB(syn_data
)->seq
++;
3441 TCP_SKB_CB(syn_data
)->tcp_flags
= TCPHDR_ACK
| TCPHDR_PSH
;
3443 tp
->syn_data
= (fo
->copied
> 0);
3444 tcp_rbtree_insert(&sk
->tcp_rtx_queue
, syn_data
);
3445 NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPORIGDATASENT
);
3449 /* data was not sent, put it in write_queue */
3450 __skb_queue_tail(&sk
->sk_write_queue
, syn_data
);
3451 tp
->packets_out
-= tcp_skb_pcount(syn_data
);
3454 /* Send a regular SYN with Fast Open cookie request option */
3455 if (fo
->cookie
.len
> 0)
3457 err
= tcp_transmit_skb(sk
, syn
, 1, sk
->sk_allocation
);
3459 tp
->syn_fastopen
= 0;
3461 fo
->cookie
.len
= -1; /* Exclude Fast Open option for SYN retries */
3465 /* Build a SYN and send it off. */
3466 int tcp_connect(struct sock
*sk
)
3468 struct tcp_sock
*tp
= tcp_sk(sk
);
3469 struct sk_buff
*buff
;
3472 tcp_call_bpf(sk
, BPF_SOCK_OPS_TCP_CONNECT_CB
, 0, NULL
);
3474 if (inet_csk(sk
)->icsk_af_ops
->rebuild_header(sk
))
3475 return -EHOSTUNREACH
; /* Routing failure or similar. */
3477 tcp_connect_init(sk
);
3479 if (unlikely(tp
->repair
)) {
3480 tcp_finish_connect(sk
, NULL
);
3484 buff
= sk_stream_alloc_skb(sk
, 0, sk
->sk_allocation
, true);
3485 if (unlikely(!buff
))
3488 tcp_init_nondata_skb(buff
, tp
->write_seq
++, TCPHDR_SYN
);
3489 tcp_mstamp_refresh(tp
);
3490 tp
->retrans_stamp
= tcp_time_stamp(tp
);
3491 tcp_connect_queue_skb(sk
, buff
);
3492 tcp_ecn_send_syn(sk
, buff
);
3493 tcp_rbtree_insert(&sk
->tcp_rtx_queue
, buff
);
3495 /* Send off SYN; include data in Fast Open. */
3496 err
= tp
->fastopen_req
? tcp_send_syn_data(sk
, buff
) :
3497 tcp_transmit_skb(sk
, buff
, 1, sk
->sk_allocation
);
3498 if (err
== -ECONNREFUSED
)
3501 /* We change tp->snd_nxt after the tcp_transmit_skb() call
3502 * in order to make this packet get counted in tcpOutSegs.
3504 tp
->snd_nxt
= tp
->write_seq
;
3505 tp
->pushed_seq
= tp
->write_seq
;
3506 buff
= tcp_send_head(sk
);
3507 if (unlikely(buff
)) {
3508 tp
->snd_nxt
= TCP_SKB_CB(buff
)->seq
;
3509 tp
->pushed_seq
= TCP_SKB_CB(buff
)->seq
;
3511 TCP_INC_STATS(sock_net(sk
), TCP_MIB_ACTIVEOPENS
);
3513 /* Timer for repeating the SYN until an answer. */
3514 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_RETRANS
,
3515 inet_csk(sk
)->icsk_rto
, TCP_RTO_MAX
);
3518 EXPORT_SYMBOL(tcp_connect
);
3520 /* Send out a delayed ack, the caller does the policy checking
3521 * to see if we should even be here. See tcp_input.c:tcp_ack_snd_check()
3524 void tcp_send_delayed_ack(struct sock
*sk
)
3526 struct inet_connection_sock
*icsk
= inet_csk(sk
);
3527 int ato
= icsk
->icsk_ack
.ato
;
3528 unsigned long timeout
;
3530 if (ato
> TCP_DELACK_MIN
) {
3531 const struct tcp_sock
*tp
= tcp_sk(sk
);
3532 int max_ato
= HZ
/ 2;
3534 if (icsk
->icsk_ack
.pingpong
||
3535 (icsk
->icsk_ack
.pending
& ICSK_ACK_PUSHED
))
3536 max_ato
= TCP_DELACK_MAX
;
3538 /* Slow path, intersegment interval is "high". */
3540 /* If some rtt estimate is known, use it to bound delayed ack.
3541 * Do not use inet_csk(sk)->icsk_rto here, use results of rtt measurements
3545 int rtt
= max_t(int, usecs_to_jiffies(tp
->srtt_us
>> 3),
3552 ato
= min(ato
, max_ato
);
3555 /* Stay within the limit we were given */
3556 timeout
= jiffies
+ ato
;
3558 /* Use new timeout only if there wasn't a older one earlier. */
3559 if (icsk
->icsk_ack
.pending
& ICSK_ACK_TIMER
) {
3560 /* If delack timer was blocked or is about to expire,
3563 if (icsk
->icsk_ack
.blocked
||
3564 time_before_eq(icsk
->icsk_ack
.timeout
, jiffies
+ (ato
>> 2))) {
3569 if (!time_before(timeout
, icsk
->icsk_ack
.timeout
))
3570 timeout
= icsk
->icsk_ack
.timeout
;
3572 icsk
->icsk_ack
.pending
|= ICSK_ACK_SCHED
| ICSK_ACK_TIMER
;
3573 icsk
->icsk_ack
.timeout
= timeout
;
3574 sk_reset_timer(sk
, &icsk
->icsk_delack_timer
, timeout
);
3577 /* This routine sends an ack and also updates the window. */
3578 void __tcp_send_ack(struct sock
*sk
, u32 rcv_nxt
)
3580 struct sk_buff
*buff
;
3582 /* If we have been reset, we may not send again. */
3583 if (sk
->sk_state
== TCP_CLOSE
)
3586 /* We are not putting this on the write queue, so
3587 * tcp_transmit_skb() will set the ownership to this
3590 buff
= alloc_skb(MAX_TCP_HEADER
,
3591 sk_gfp_mask(sk
, GFP_ATOMIC
| __GFP_NOWARN
));
3592 if (unlikely(!buff
)) {
3593 inet_csk_schedule_ack(sk
);
3594 inet_csk(sk
)->icsk_ack
.ato
= TCP_ATO_MIN
;
3595 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_DACK
,
3596 TCP_DELACK_MAX
, TCP_RTO_MAX
);
3600 /* Reserve space for headers and prepare control bits. */
3601 skb_reserve(buff
, MAX_TCP_HEADER
);
3602 tcp_init_nondata_skb(buff
, tcp_acceptable_seq(sk
), TCPHDR_ACK
);
3604 /* We do not want pure acks influencing TCP Small Queues or fq/pacing
3606 * SKB_TRUESIZE(max(1 .. 66, MAX_TCP_HEADER)) is unfortunately ~784
3608 skb_set_tcp_pure_ack(buff
);
3610 /* Send it off, this clears delayed acks for us. */
3611 __tcp_transmit_skb(sk
, buff
, 0, (__force gfp_t
)0, rcv_nxt
);
3613 EXPORT_SYMBOL_GPL(__tcp_send_ack
);
3615 void tcp_send_ack(struct sock
*sk
)
3617 __tcp_send_ack(sk
, tcp_sk(sk
)->rcv_nxt
);
3620 /* This routine sends a packet with an out of date sequence
3621 * number. It assumes the other end will try to ack it.
3623 * Question: what should we make while urgent mode?
3624 * 4.4BSD forces sending single byte of data. We cannot send
3625 * out of window data, because we have SND.NXT==SND.MAX...
3627 * Current solution: to send TWO zero-length segments in urgent mode:
3628 * one is with SEG.SEQ=SND.UNA to deliver urgent pointer, another is
3629 * out-of-date with SND.UNA-1 to probe window.
3631 static int tcp_xmit_probe_skb(struct sock
*sk
, int urgent
, int mib
)
3633 struct tcp_sock
*tp
= tcp_sk(sk
);
3634 struct sk_buff
*skb
;
3636 /* We don't queue it, tcp_transmit_skb() sets ownership. */
3637 skb
= alloc_skb(MAX_TCP_HEADER
,
3638 sk_gfp_mask(sk
, GFP_ATOMIC
| __GFP_NOWARN
));
3642 /* Reserve space for headers and set control bits. */
3643 skb_reserve(skb
, MAX_TCP_HEADER
);
3644 /* Use a previous sequence. This should cause the other
3645 * end to send an ack. Don't queue or clone SKB, just
3648 tcp_init_nondata_skb(skb
, tp
->snd_una
- !urgent
, TCPHDR_ACK
);
3649 NET_INC_STATS(sock_net(sk
), mib
);
3650 return tcp_transmit_skb(sk
, skb
, 0, (__force gfp_t
)0);
3653 /* Called from setsockopt( ... TCP_REPAIR ) */
3654 void tcp_send_window_probe(struct sock
*sk
)
3656 if (sk
->sk_state
== TCP_ESTABLISHED
) {
3657 tcp_sk(sk
)->snd_wl1
= tcp_sk(sk
)->rcv_nxt
- 1;
3658 tcp_mstamp_refresh(tcp_sk(sk
));
3659 tcp_xmit_probe_skb(sk
, 0, LINUX_MIB_TCPWINPROBE
);
3663 /* Initiate keepalive or window probe from timer. */
3664 int tcp_write_wakeup(struct sock
*sk
, int mib
)
3666 struct tcp_sock
*tp
= tcp_sk(sk
);
3667 struct sk_buff
*skb
;
3669 if (sk
->sk_state
== TCP_CLOSE
)
3672 skb
= tcp_send_head(sk
);
3673 if (skb
&& before(TCP_SKB_CB(skb
)->seq
, tcp_wnd_end(tp
))) {
3675 unsigned int mss
= tcp_current_mss(sk
);
3676 unsigned int seg_size
= tcp_wnd_end(tp
) - TCP_SKB_CB(skb
)->seq
;
3678 if (before(tp
->pushed_seq
, TCP_SKB_CB(skb
)->end_seq
))
3679 tp
->pushed_seq
= TCP_SKB_CB(skb
)->end_seq
;
3681 /* We are probing the opening of a window
3682 * but the window size is != 0
3683 * must have been a result SWS avoidance ( sender )
3685 if (seg_size
< TCP_SKB_CB(skb
)->end_seq
- TCP_SKB_CB(skb
)->seq
||
3687 seg_size
= min(seg_size
, mss
);
3688 TCP_SKB_CB(skb
)->tcp_flags
|= TCPHDR_PSH
;
3689 if (tcp_fragment(sk
, TCP_FRAG_IN_WRITE_QUEUE
,
3690 skb
, seg_size
, mss
, GFP_ATOMIC
))
3692 } else if (!tcp_skb_pcount(skb
))
3693 tcp_set_skb_tso_segs(skb
, mss
);
3695 TCP_SKB_CB(skb
)->tcp_flags
|= TCPHDR_PSH
;
3696 err
= tcp_transmit_skb(sk
, skb
, 1, GFP_ATOMIC
);
3698 tcp_event_new_data_sent(sk
, skb
);
3701 if (between(tp
->snd_up
, tp
->snd_una
+ 1, tp
->snd_una
+ 0xFFFF))
3702 tcp_xmit_probe_skb(sk
, 1, mib
);
3703 return tcp_xmit_probe_skb(sk
, 0, mib
);
3707 /* A window probe timeout has occurred. If window is not closed send
3708 * a partial packet else a zero probe.
3710 void tcp_send_probe0(struct sock
*sk
)
3712 struct inet_connection_sock
*icsk
= inet_csk(sk
);
3713 struct tcp_sock
*tp
= tcp_sk(sk
);
3714 struct net
*net
= sock_net(sk
);
3715 unsigned long probe_max
;
3718 err
= tcp_write_wakeup(sk
, LINUX_MIB_TCPWINPROBE
);
3720 if (tp
->packets_out
|| tcp_write_queue_empty(sk
)) {
3721 /* Cancel probe timer, if it is not required. */
3722 icsk
->icsk_probes_out
= 0;
3723 icsk
->icsk_backoff
= 0;
3728 if (icsk
->icsk_backoff
< net
->ipv4
.sysctl_tcp_retries2
)
3729 icsk
->icsk_backoff
++;
3730 icsk
->icsk_probes_out
++;
3731 probe_max
= TCP_RTO_MAX
;
3733 /* If packet was not sent due to local congestion,
3734 * do not backoff and do not remember icsk_probes_out.
3735 * Let local senders to fight for local resources.
3737 * Use accumulated backoff yet.
3739 if (!icsk
->icsk_probes_out
)
3740 icsk
->icsk_probes_out
= 1;
3741 probe_max
= TCP_RESOURCE_PROBE_INTERVAL
;
3743 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_PROBE0
,
3744 tcp_probe0_when(sk
, probe_max
),
3748 int tcp_rtx_synack(const struct sock
*sk
, struct request_sock
*req
)
3750 const struct tcp_request_sock_ops
*af_ops
= tcp_rsk(req
)->af_specific
;
3754 tcp_rsk(req
)->txhash
= net_tx_rndhash();
3755 res
= af_ops
->send_synack(sk
, NULL
, &fl
, req
, NULL
, TCP_SYNACK_NORMAL
);
3757 __TCP_INC_STATS(sock_net(sk
), TCP_MIB_RETRANSSEGS
);
3758 __NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPSYNRETRANS
);
3759 if (unlikely(tcp_passive_fastopen(sk
)))
3760 tcp_sk(sk
)->total_retrans
++;
3761 trace_tcp_retransmit_synack(sk
, req
);
3765 EXPORT_SYMBOL(tcp_rtx_synack
);