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
39 #include <linux/compiler.h>
40 #include <linux/module.h>
42 /* People can turn this off for buggy TCP's found in printers etc. */
43 int sysctl_tcp_retrans_collapse __read_mostly
= 1;
45 /* People can turn this on to work with those rare, broken TCPs that
46 * interpret the window field as a signed quantity.
48 int sysctl_tcp_workaround_signed_windows __read_mostly
= 0;
50 /* This limits the percentage of the congestion window which we
51 * will allow a single TSO frame to consume. Building TSO frames
52 * which are too large can cause TCP streams to be bursty.
54 int sysctl_tcp_tso_win_divisor __read_mostly
= 3;
56 int sysctl_tcp_mtu_probing __read_mostly
= 0;
57 int sysctl_tcp_base_mss __read_mostly
= 512;
59 /* By default, RFC2861 behavior. */
60 int sysctl_tcp_slow_start_after_idle __read_mostly
= 1;
62 static void tcp_event_new_data_sent(struct sock
*sk
, struct sk_buff
*skb
)
64 struct tcp_sock
*tp
= tcp_sk(sk
);
65 unsigned int prior_packets
= tp
->packets_out
;
67 tcp_advance_send_head(sk
, skb
);
68 tp
->snd_nxt
= TCP_SKB_CB(skb
)->end_seq
;
70 /* Don't override Nagle indefinately with F-RTO */
71 if (tp
->frto_counter
== 2)
74 tp
->packets_out
+= tcp_skb_pcount(skb
);
76 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_RETRANS
,
77 inet_csk(sk
)->icsk_rto
, TCP_RTO_MAX
);
80 /* SND.NXT, if window was not shrunk.
81 * If window has been shrunk, what should we make? It is not clear at all.
82 * Using SND.UNA we will fail to open window, SND.NXT is out of window. :-(
83 * Anything in between SND.UNA...SND.UNA+SND.WND also can be already
84 * invalid. OK, let's make this for now:
86 static inline __u32
tcp_acceptable_seq(struct sock
*sk
)
88 struct tcp_sock
*tp
= tcp_sk(sk
);
90 if (!before(tcp_wnd_end(tp
), tp
->snd_nxt
))
93 return tcp_wnd_end(tp
);
96 /* Calculate mss to advertise in SYN segment.
97 * RFC1122, RFC1063, draft-ietf-tcpimpl-pmtud-01 state that:
99 * 1. It is independent of path mtu.
100 * 2. Ideally, it is maximal possible segment size i.e. 65535-40.
101 * 3. For IPv4 it is reasonable to calculate it from maximal MTU of
102 * attached devices, because some buggy hosts are confused by
104 * 4. We do not make 3, we advertise MSS, calculated from first
105 * hop device mtu, but allow to raise it to ip_rt_min_advmss.
106 * This may be overridden via information stored in routing table.
107 * 5. Value 65535 for MSS is valid in IPv6 and means "as large as possible,
108 * probably even Jumbo".
110 static __u16
tcp_advertise_mss(struct sock
*sk
)
112 struct tcp_sock
*tp
= tcp_sk(sk
);
113 struct dst_entry
*dst
= __sk_dst_get(sk
);
114 int mss
= tp
->advmss
;
116 if (dst
&& dst_metric(dst
, RTAX_ADVMSS
) < mss
) {
117 mss
= dst_metric(dst
, RTAX_ADVMSS
);
124 /* RFC2861. Reset CWND after idle period longer RTO to "restart window".
125 * This is the first part of cwnd validation mechanism. */
126 static void tcp_cwnd_restart(struct sock
*sk
, struct dst_entry
*dst
)
128 struct tcp_sock
*tp
= tcp_sk(sk
);
129 s32 delta
= tcp_time_stamp
- tp
->lsndtime
;
130 u32 restart_cwnd
= tcp_init_cwnd(tp
, dst
);
131 u32 cwnd
= tp
->snd_cwnd
;
133 tcp_ca_event(sk
, CA_EVENT_CWND_RESTART
);
135 tp
->snd_ssthresh
= tcp_current_ssthresh(sk
);
136 restart_cwnd
= min(restart_cwnd
, cwnd
);
138 while ((delta
-= inet_csk(sk
)->icsk_rto
) > 0 && cwnd
> restart_cwnd
)
140 tp
->snd_cwnd
= max(cwnd
, restart_cwnd
);
141 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
142 tp
->snd_cwnd_used
= 0;
145 static void tcp_event_data_sent(struct tcp_sock
*tp
,
146 struct sk_buff
*skb
, struct sock
*sk
)
148 struct inet_connection_sock
*icsk
= inet_csk(sk
);
149 const u32 now
= tcp_time_stamp
;
151 if (sysctl_tcp_slow_start_after_idle
&&
152 (!tp
->packets_out
&& (s32
)(now
- tp
->lsndtime
) > icsk
->icsk_rto
))
153 tcp_cwnd_restart(sk
, __sk_dst_get(sk
));
157 /* If it is a reply for ato after last received
158 * packet, enter pingpong mode.
160 if ((u32
)(now
- icsk
->icsk_ack
.lrcvtime
) < icsk
->icsk_ack
.ato
)
161 icsk
->icsk_ack
.pingpong
= 1;
164 static inline void tcp_event_ack_sent(struct sock
*sk
, unsigned int pkts
)
166 tcp_dec_quickack_mode(sk
, pkts
);
167 inet_csk_clear_xmit_timer(sk
, ICSK_TIME_DACK
);
170 /* Determine a window scaling and initial window to offer.
171 * Based on the assumption that the given amount of space
172 * will be offered. Store the results in the tp structure.
173 * NOTE: for smooth operation initial space offering should
174 * be a multiple of mss if possible. We assume here that mss >= 1.
175 * This MUST be enforced by all callers.
177 void tcp_select_initial_window(int __space
, __u32 mss
,
178 __u32
*rcv_wnd
, __u32
*window_clamp
,
179 int wscale_ok
, __u8
*rcv_wscale
)
181 unsigned int space
= (__space
< 0 ? 0 : __space
);
183 /* If no clamp set the clamp to the max possible scaled window */
184 if (*window_clamp
== 0)
185 (*window_clamp
) = (65535 << 14);
186 space
= min(*window_clamp
, space
);
188 /* Quantize space offering to a multiple of mss if possible. */
190 space
= (space
/ mss
) * mss
;
192 /* NOTE: offering an initial window larger than 32767
193 * will break some buggy TCP stacks. If the admin tells us
194 * it is likely we could be speaking with such a buggy stack
195 * we will truncate our initial window offering to 32K-1
196 * unless the remote has sent us a window scaling option,
197 * which we interpret as a sign the remote TCP is not
198 * misinterpreting the window field as a signed quantity.
200 if (sysctl_tcp_workaround_signed_windows
)
201 (*rcv_wnd
) = min(space
, MAX_TCP_WINDOW
);
207 /* Set window scaling on max possible window
208 * See RFC1323 for an explanation of the limit to 14
210 space
= max_t(u32
, sysctl_tcp_rmem
[2], sysctl_rmem_max
);
211 space
= min_t(u32
, space
, *window_clamp
);
212 while (space
> 65535 && (*rcv_wscale
) < 14) {
218 /* Set initial window to value enough for senders,
219 * following RFC2414. Senders, not following this RFC,
220 * will be satisfied with 2.
222 if (mss
> (1 << *rcv_wscale
)) {
228 if (*rcv_wnd
> init_cwnd
* mss
)
229 *rcv_wnd
= init_cwnd
* mss
;
232 /* Set the clamp no higher than max representable value */
233 (*window_clamp
) = min(65535U << (*rcv_wscale
), *window_clamp
);
236 /* Chose a new window to advertise, update state in tcp_sock for the
237 * socket, and return result with RFC1323 scaling applied. The return
238 * value can be stuffed directly into th->window for an outgoing
241 static u16
tcp_select_window(struct sock
*sk
)
243 struct tcp_sock
*tp
= tcp_sk(sk
);
244 u32 cur_win
= tcp_receive_window(tp
);
245 u32 new_win
= __tcp_select_window(sk
);
247 /* Never shrink the offered window */
248 if (new_win
< cur_win
) {
249 /* Danger Will Robinson!
250 * Don't update rcv_wup/rcv_wnd here or else
251 * we will not be able to advertise a zero
252 * window in time. --DaveM
254 * Relax Will Robinson.
256 new_win
= ALIGN(cur_win
, 1 << tp
->rx_opt
.rcv_wscale
);
258 tp
->rcv_wnd
= new_win
;
259 tp
->rcv_wup
= tp
->rcv_nxt
;
261 /* Make sure we do not exceed the maximum possible
264 if (!tp
->rx_opt
.rcv_wscale
&& sysctl_tcp_workaround_signed_windows
)
265 new_win
= min(new_win
, MAX_TCP_WINDOW
);
267 new_win
= min(new_win
, (65535U << tp
->rx_opt
.rcv_wscale
));
269 /* RFC1323 scaling applied */
270 new_win
>>= tp
->rx_opt
.rcv_wscale
;
272 /* If we advertise zero window, disable fast path. */
279 static inline void TCP_ECN_send_synack(struct tcp_sock
*tp
, struct sk_buff
*skb
)
281 TCP_SKB_CB(skb
)->flags
&= ~TCPCB_FLAG_CWR
;
282 if (!(tp
->ecn_flags
& TCP_ECN_OK
))
283 TCP_SKB_CB(skb
)->flags
&= ~TCPCB_FLAG_ECE
;
286 static inline void TCP_ECN_send_syn(struct sock
*sk
, struct sk_buff
*skb
)
288 struct tcp_sock
*tp
= tcp_sk(sk
);
291 if (sysctl_tcp_ecn
== 1) {
292 TCP_SKB_CB(skb
)->flags
|= TCPCB_FLAG_ECE
| TCPCB_FLAG_CWR
;
293 tp
->ecn_flags
= TCP_ECN_OK
;
297 static __inline__
void
298 TCP_ECN_make_synack(struct request_sock
*req
, struct tcphdr
*th
)
300 if (inet_rsk(req
)->ecn_ok
)
304 static inline void TCP_ECN_send(struct sock
*sk
, struct sk_buff
*skb
,
307 struct tcp_sock
*tp
= tcp_sk(sk
);
309 if (tp
->ecn_flags
& TCP_ECN_OK
) {
310 /* Not-retransmitted data segment: set ECT and inject CWR. */
311 if (skb
->len
!= tcp_header_len
&&
312 !before(TCP_SKB_CB(skb
)->seq
, tp
->snd_nxt
)) {
314 if (tp
->ecn_flags
& TCP_ECN_QUEUE_CWR
) {
315 tp
->ecn_flags
&= ~TCP_ECN_QUEUE_CWR
;
316 tcp_hdr(skb
)->cwr
= 1;
317 skb_shinfo(skb
)->gso_type
|= SKB_GSO_TCP_ECN
;
320 /* ACK or retransmitted segment: clear ECT|CE */
321 INET_ECN_dontxmit(sk
);
323 if (tp
->ecn_flags
& TCP_ECN_DEMAND_CWR
)
324 tcp_hdr(skb
)->ece
= 1;
328 /* Constructs common control bits of non-data skb. If SYN/FIN is present,
329 * auto increment end seqno.
331 static void tcp_init_nondata_skb(struct sk_buff
*skb
, u32 seq
, u8 flags
)
335 TCP_SKB_CB(skb
)->flags
= flags
;
336 TCP_SKB_CB(skb
)->sacked
= 0;
338 skb_shinfo(skb
)->gso_segs
= 1;
339 skb_shinfo(skb
)->gso_size
= 0;
340 skb_shinfo(skb
)->gso_type
= 0;
342 TCP_SKB_CB(skb
)->seq
= seq
;
343 if (flags
& (TCPCB_FLAG_SYN
| TCPCB_FLAG_FIN
))
345 TCP_SKB_CB(skb
)->end_seq
= seq
;
348 static inline int tcp_urg_mode(const struct tcp_sock
*tp
)
350 return tp
->snd_una
!= tp
->snd_up
;
353 #define OPTION_SACK_ADVERTISE (1 << 0)
354 #define OPTION_TS (1 << 1)
355 #define OPTION_MD5 (1 << 2)
357 struct tcp_out_options
{
358 u8 options
; /* bit field of OPTION_* */
359 u8 ws
; /* window scale, 0 to disable */
360 u8 num_sack_blocks
; /* number of SACK blocks to include */
361 u16 mss
; /* 0 to disable */
362 __u32 tsval
, tsecr
; /* need to include OPTION_TS */
365 /* Beware: Something in the Internet is very sensitive to the ordering of
366 * TCP options, we learned this through the hard way, so be careful here.
367 * Luckily we can at least blame others for their non-compliance but from
368 * inter-operatibility perspective it seems that we're somewhat stuck with
369 * the ordering which we have been using if we want to keep working with
370 * those broken things (not that it currently hurts anybody as there isn't
371 * particular reason why the ordering would need to be changed).
373 * At least SACK_PERM as the first option is known to lead to a disaster
374 * (but it may well be that other scenarios fail similarly).
376 static void tcp_options_write(__be32
*ptr
, struct tcp_sock
*tp
,
377 const struct tcp_out_options
*opts
,
379 if (unlikely(OPTION_MD5
& opts
->options
)) {
380 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
382 (TCPOPT_MD5SIG
<< 8) |
384 *md5_hash
= (__u8
*)ptr
;
390 if (unlikely(opts
->mss
)) {
391 *ptr
++ = htonl((TCPOPT_MSS
<< 24) |
392 (TCPOLEN_MSS
<< 16) |
396 if (likely(OPTION_TS
& opts
->options
)) {
397 if (unlikely(OPTION_SACK_ADVERTISE
& opts
->options
)) {
398 *ptr
++ = htonl((TCPOPT_SACK_PERM
<< 24) |
399 (TCPOLEN_SACK_PERM
<< 16) |
400 (TCPOPT_TIMESTAMP
<< 8) |
403 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
405 (TCPOPT_TIMESTAMP
<< 8) |
408 *ptr
++ = htonl(opts
->tsval
);
409 *ptr
++ = htonl(opts
->tsecr
);
412 if (unlikely(OPTION_SACK_ADVERTISE
& opts
->options
&&
413 !(OPTION_TS
& opts
->options
))) {
414 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
416 (TCPOPT_SACK_PERM
<< 8) |
420 if (unlikely(opts
->ws
)) {
421 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
422 (TCPOPT_WINDOW
<< 16) |
423 (TCPOLEN_WINDOW
<< 8) |
427 if (unlikely(opts
->num_sack_blocks
)) {
428 struct tcp_sack_block
*sp
= tp
->rx_opt
.dsack
?
429 tp
->duplicate_sack
: tp
->selective_acks
;
432 *ptr
++ = htonl((TCPOPT_NOP
<< 24) |
435 (TCPOLEN_SACK_BASE
+ (opts
->num_sack_blocks
*
436 TCPOLEN_SACK_PERBLOCK
)));
438 for (this_sack
= 0; this_sack
< opts
->num_sack_blocks
;
440 *ptr
++ = htonl(sp
[this_sack
].start_seq
);
441 *ptr
++ = htonl(sp
[this_sack
].end_seq
);
444 tp
->rx_opt
.dsack
= 0;
448 static unsigned tcp_syn_options(struct sock
*sk
, struct sk_buff
*skb
,
449 struct tcp_out_options
*opts
,
450 struct tcp_md5sig_key
**md5
) {
451 struct tcp_sock
*tp
= tcp_sk(sk
);
454 #ifdef CONFIG_TCP_MD5SIG
455 *md5
= tp
->af_specific
->md5_lookup(sk
, sk
);
457 opts
->options
|= OPTION_MD5
;
458 size
+= TCPOLEN_MD5SIG_ALIGNED
;
464 /* We always get an MSS option. The option bytes which will be seen in
465 * normal data packets should timestamps be used, must be in the MSS
466 * advertised. But we subtract them from tp->mss_cache so that
467 * calculations in tcp_sendmsg are simpler etc. So account for this
468 * fact here if necessary. If we don't do this correctly, as a
469 * receiver we won't recognize data packets as being full sized when we
470 * should, and thus we won't abide by the delayed ACK rules correctly.
471 * SACKs don't matter, we never delay an ACK when we have any of those
473 opts
->mss
= tcp_advertise_mss(sk
);
474 size
+= TCPOLEN_MSS_ALIGNED
;
476 if (likely(sysctl_tcp_timestamps
&& *md5
== NULL
)) {
477 opts
->options
|= OPTION_TS
;
478 opts
->tsval
= TCP_SKB_CB(skb
)->when
;
479 opts
->tsecr
= tp
->rx_opt
.ts_recent
;
480 size
+= TCPOLEN_TSTAMP_ALIGNED
;
482 if (likely(sysctl_tcp_window_scaling
)) {
483 opts
->ws
= tp
->rx_opt
.rcv_wscale
;
484 if (likely(opts
->ws
))
485 size
+= TCPOLEN_WSCALE_ALIGNED
;
487 if (likely(sysctl_tcp_sack
)) {
488 opts
->options
|= OPTION_SACK_ADVERTISE
;
489 if (unlikely(!(OPTION_TS
& opts
->options
)))
490 size
+= TCPOLEN_SACKPERM_ALIGNED
;
496 static unsigned tcp_synack_options(struct sock
*sk
,
497 struct request_sock
*req
,
498 unsigned mss
, struct sk_buff
*skb
,
499 struct tcp_out_options
*opts
,
500 struct tcp_md5sig_key
**md5
) {
502 struct inet_request_sock
*ireq
= inet_rsk(req
);
505 #ifdef CONFIG_TCP_MD5SIG
506 *md5
= tcp_rsk(req
)->af_specific
->md5_lookup(sk
, req
);
508 opts
->options
|= OPTION_MD5
;
509 size
+= TCPOLEN_MD5SIG_ALIGNED
;
515 /* we can't fit any SACK blocks in a packet with MD5 + TS
516 options. There was discussion about disabling SACK rather than TS in
517 order to fit in better with old, buggy kernels, but that was deemed
518 to be unnecessary. */
519 doing_ts
= ireq
->tstamp_ok
&& !(*md5
&& ireq
->sack_ok
);
522 size
+= TCPOLEN_MSS_ALIGNED
;
524 if (likely(ireq
->wscale_ok
)) {
525 opts
->ws
= ireq
->rcv_wscale
;
526 if (likely(opts
->ws
))
527 size
+= TCPOLEN_WSCALE_ALIGNED
;
529 if (likely(doing_ts
)) {
530 opts
->options
|= OPTION_TS
;
531 opts
->tsval
= TCP_SKB_CB(skb
)->when
;
532 opts
->tsecr
= req
->ts_recent
;
533 size
+= TCPOLEN_TSTAMP_ALIGNED
;
535 if (likely(ireq
->sack_ok
)) {
536 opts
->options
|= OPTION_SACK_ADVERTISE
;
537 if (unlikely(!doing_ts
))
538 size
+= TCPOLEN_SACKPERM_ALIGNED
;
544 static unsigned tcp_established_options(struct sock
*sk
, struct sk_buff
*skb
,
545 struct tcp_out_options
*opts
,
546 struct tcp_md5sig_key
**md5
) {
547 struct tcp_skb_cb
*tcb
= skb
? TCP_SKB_CB(skb
) : NULL
;
548 struct tcp_sock
*tp
= tcp_sk(sk
);
550 unsigned int eff_sacks
;
552 #ifdef CONFIG_TCP_MD5SIG
553 *md5
= tp
->af_specific
->md5_lookup(sk
, sk
);
554 if (unlikely(*md5
)) {
555 opts
->options
|= OPTION_MD5
;
556 size
+= TCPOLEN_MD5SIG_ALIGNED
;
562 if (likely(tp
->rx_opt
.tstamp_ok
)) {
563 opts
->options
|= OPTION_TS
;
564 opts
->tsval
= tcb
? tcb
->when
: 0;
565 opts
->tsecr
= tp
->rx_opt
.ts_recent
;
566 size
+= TCPOLEN_TSTAMP_ALIGNED
;
569 eff_sacks
= tp
->rx_opt
.num_sacks
+ tp
->rx_opt
.dsack
;
570 if (unlikely(eff_sacks
)) {
571 const unsigned remaining
= MAX_TCP_OPTION_SPACE
- size
;
572 opts
->num_sack_blocks
=
573 min_t(unsigned, eff_sacks
,
574 (remaining
- TCPOLEN_SACK_BASE_ALIGNED
) /
575 TCPOLEN_SACK_PERBLOCK
);
576 size
+= TCPOLEN_SACK_BASE_ALIGNED
+
577 opts
->num_sack_blocks
* TCPOLEN_SACK_PERBLOCK
;
583 /* This routine actually transmits TCP packets queued in by
584 * tcp_do_sendmsg(). This is used by both the initial
585 * transmission and possible later retransmissions.
586 * All SKB's seen here are completely headerless. It is our
587 * job to build the TCP header, and pass the packet down to
588 * IP so it can do the same plus pass the packet off to the
591 * We are working here with either a clone of the original
592 * SKB, or a fresh unique copy made by the retransmit engine.
594 static int tcp_transmit_skb(struct sock
*sk
, struct sk_buff
*skb
, int clone_it
,
597 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
598 struct inet_sock
*inet
;
600 struct tcp_skb_cb
*tcb
;
601 struct tcp_out_options opts
;
602 unsigned tcp_options_size
, tcp_header_size
;
603 struct tcp_md5sig_key
*md5
;
604 __u8
*md5_hash_location
;
608 BUG_ON(!skb
|| !tcp_skb_pcount(skb
));
610 /* If congestion control is doing timestamping, we must
611 * take such a timestamp before we potentially clone/copy.
613 if (icsk
->icsk_ca_ops
->flags
& TCP_CONG_RTT_STAMP
)
614 __net_timestamp(skb
);
616 if (likely(clone_it
)) {
617 if (unlikely(skb_cloned(skb
)))
618 skb
= pskb_copy(skb
, gfp_mask
);
620 skb
= skb_clone(skb
, gfp_mask
);
627 tcb
= TCP_SKB_CB(skb
);
628 memset(&opts
, 0, sizeof(opts
));
630 if (unlikely(tcb
->flags
& TCPCB_FLAG_SYN
))
631 tcp_options_size
= tcp_syn_options(sk
, skb
, &opts
, &md5
);
633 tcp_options_size
= tcp_established_options(sk
, skb
, &opts
,
635 tcp_header_size
= tcp_options_size
+ sizeof(struct tcphdr
);
637 if (tcp_packets_in_flight(tp
) == 0)
638 tcp_ca_event(sk
, CA_EVENT_TX_START
);
640 skb_push(skb
, tcp_header_size
);
641 skb_reset_transport_header(skb
);
642 skb_set_owner_w(skb
, sk
);
644 /* Build TCP header and checksum it. */
646 th
->source
= inet
->sport
;
647 th
->dest
= inet
->dport
;
648 th
->seq
= htonl(tcb
->seq
);
649 th
->ack_seq
= htonl(tp
->rcv_nxt
);
650 *(((__be16
*)th
) + 6) = htons(((tcp_header_size
>> 2) << 12) |
653 if (unlikely(tcb
->flags
& TCPCB_FLAG_SYN
)) {
654 /* RFC1323: The window in SYN & SYN/ACK segments
657 th
->window
= htons(min(tp
->rcv_wnd
, 65535U));
659 th
->window
= htons(tcp_select_window(sk
));
664 /* The urg_mode check is necessary during a below snd_una win probe */
665 if (unlikely(tcp_urg_mode(tp
) && before(tcb
->seq
, tp
->snd_up
))) {
666 if (before(tp
->snd_up
, tcb
->seq
+ 0x10000)) {
667 th
->urg_ptr
= htons(tp
->snd_up
- tcb
->seq
);
669 } else if (after(tcb
->seq
+ 0xFFFF, tp
->snd_nxt
)) {
670 th
->urg_ptr
= 0xFFFF;
675 tcp_options_write((__be32
*)(th
+ 1), tp
, &opts
, &md5_hash_location
);
676 if (likely((tcb
->flags
& TCPCB_FLAG_SYN
) == 0))
677 TCP_ECN_send(sk
, skb
, tcp_header_size
);
679 #ifdef CONFIG_TCP_MD5SIG
680 /* Calculate the MD5 hash, as we have all we need now */
682 sk
->sk_route_caps
&= ~NETIF_F_GSO_MASK
;
683 tp
->af_specific
->calc_md5_hash(md5_hash_location
,
688 icsk
->icsk_af_ops
->send_check(sk
, skb
->len
, skb
);
690 if (likely(tcb
->flags
& TCPCB_FLAG_ACK
))
691 tcp_event_ack_sent(sk
, tcp_skb_pcount(skb
));
693 if (skb
->len
!= tcp_header_size
)
694 tcp_event_data_sent(tp
, skb
, sk
);
696 if (after(tcb
->end_seq
, tp
->snd_nxt
) || tcb
->seq
== tcb
->end_seq
)
697 TCP_INC_STATS(sock_net(sk
), TCP_MIB_OUTSEGS
);
699 err
= icsk
->icsk_af_ops
->queue_xmit(skb
, 0);
700 if (likely(err
<= 0))
703 tcp_enter_cwr(sk
, 1);
705 return net_xmit_eval(err
);
708 /* This routine just queue's the buffer
710 * NOTE: probe0 timer is not checked, do not forget tcp_push_pending_frames,
711 * otherwise socket can stall.
713 static void tcp_queue_skb(struct sock
*sk
, struct sk_buff
*skb
)
715 struct tcp_sock
*tp
= tcp_sk(sk
);
717 /* Advance write_seq and place onto the write_queue. */
718 tp
->write_seq
= TCP_SKB_CB(skb
)->end_seq
;
719 skb_header_release(skb
);
720 tcp_add_write_queue_tail(sk
, skb
);
721 sk
->sk_wmem_queued
+= skb
->truesize
;
722 sk_mem_charge(sk
, skb
->truesize
);
725 static void tcp_set_skb_tso_segs(struct sock
*sk
, struct sk_buff
*skb
,
726 unsigned int mss_now
)
728 if (skb
->len
<= mss_now
|| !sk_can_gso(sk
) ||
729 skb
->ip_summed
== CHECKSUM_NONE
) {
730 /* Avoid the costly divide in the normal
733 skb_shinfo(skb
)->gso_segs
= 1;
734 skb_shinfo(skb
)->gso_size
= 0;
735 skb_shinfo(skb
)->gso_type
= 0;
737 skb_shinfo(skb
)->gso_segs
= DIV_ROUND_UP(skb
->len
, mss_now
);
738 skb_shinfo(skb
)->gso_size
= mss_now
;
739 skb_shinfo(skb
)->gso_type
= sk
->sk_gso_type
;
743 /* When a modification to fackets out becomes necessary, we need to check
744 * skb is counted to fackets_out or not.
746 static void tcp_adjust_fackets_out(struct sock
*sk
, struct sk_buff
*skb
,
749 struct tcp_sock
*tp
= tcp_sk(sk
);
751 if (!tp
->sacked_out
|| tcp_is_reno(tp
))
754 if (after(tcp_highest_sack_seq(tp
), TCP_SKB_CB(skb
)->seq
))
755 tp
->fackets_out
-= decr
;
758 /* Pcount in the middle of the write queue got changed, we need to do various
759 * tweaks to fix counters
761 static void tcp_adjust_pcount(struct sock
*sk
, struct sk_buff
*skb
, int decr
)
763 struct tcp_sock
*tp
= tcp_sk(sk
);
765 tp
->packets_out
-= decr
;
767 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
)
768 tp
->sacked_out
-= decr
;
769 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_RETRANS
)
770 tp
->retrans_out
-= decr
;
771 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_LOST
)
772 tp
->lost_out
-= decr
;
774 /* Reno case is special. Sigh... */
775 if (tcp_is_reno(tp
) && decr
> 0)
776 tp
->sacked_out
-= min_t(u32
, tp
->sacked_out
, decr
);
778 tcp_adjust_fackets_out(sk
, skb
, decr
);
780 if (tp
->lost_skb_hint
&&
781 before(TCP_SKB_CB(skb
)->seq
, TCP_SKB_CB(tp
->lost_skb_hint
)->seq
) &&
782 (tcp_is_fack(tp
) || (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
)))
783 tp
->lost_cnt_hint
-= decr
;
785 tcp_verify_left_out(tp
);
788 /* Function to create two new TCP segments. Shrinks the given segment
789 * to the specified size and appends a new segment with the rest of the
790 * packet to the list. This won't be called frequently, I hope.
791 * Remember, these are still headerless SKBs at this point.
793 int tcp_fragment(struct sock
*sk
, struct sk_buff
*skb
, u32 len
,
794 unsigned int mss_now
)
796 struct tcp_sock
*tp
= tcp_sk(sk
);
797 struct sk_buff
*buff
;
798 int nsize
, old_factor
;
802 BUG_ON(len
> skb
->len
);
804 nsize
= skb_headlen(skb
) - len
;
808 if (skb_cloned(skb
) &&
809 skb_is_nonlinear(skb
) &&
810 pskb_expand_head(skb
, 0, 0, GFP_ATOMIC
))
813 /* Get a new skb... force flag on. */
814 buff
= sk_stream_alloc_skb(sk
, nsize
, GFP_ATOMIC
);
816 return -ENOMEM
; /* We'll just try again later. */
818 sk
->sk_wmem_queued
+= buff
->truesize
;
819 sk_mem_charge(sk
, buff
->truesize
);
820 nlen
= skb
->len
- len
- nsize
;
821 buff
->truesize
+= nlen
;
822 skb
->truesize
-= nlen
;
824 /* Correct the sequence numbers. */
825 TCP_SKB_CB(buff
)->seq
= TCP_SKB_CB(skb
)->seq
+ len
;
826 TCP_SKB_CB(buff
)->end_seq
= TCP_SKB_CB(skb
)->end_seq
;
827 TCP_SKB_CB(skb
)->end_seq
= TCP_SKB_CB(buff
)->seq
;
829 /* PSH and FIN should only be set in the second packet. */
830 flags
= TCP_SKB_CB(skb
)->flags
;
831 TCP_SKB_CB(skb
)->flags
= flags
& ~(TCPCB_FLAG_FIN
| TCPCB_FLAG_PSH
);
832 TCP_SKB_CB(buff
)->flags
= flags
;
833 TCP_SKB_CB(buff
)->sacked
= TCP_SKB_CB(skb
)->sacked
;
835 if (!skb_shinfo(skb
)->nr_frags
&& skb
->ip_summed
!= CHECKSUM_PARTIAL
) {
836 /* Copy and checksum data tail into the new buffer. */
837 buff
->csum
= csum_partial_copy_nocheck(skb
->data
+ len
,
838 skb_put(buff
, nsize
),
843 skb
->csum
= csum_block_sub(skb
->csum
, buff
->csum
, len
);
845 skb
->ip_summed
= CHECKSUM_PARTIAL
;
846 skb_split(skb
, buff
, len
);
849 buff
->ip_summed
= skb
->ip_summed
;
851 /* Looks stupid, but our code really uses when of
852 * skbs, which it never sent before. --ANK
854 TCP_SKB_CB(buff
)->when
= TCP_SKB_CB(skb
)->when
;
855 buff
->tstamp
= skb
->tstamp
;
857 old_factor
= tcp_skb_pcount(skb
);
859 /* Fix up tso_factor for both original and new SKB. */
860 tcp_set_skb_tso_segs(sk
, skb
, mss_now
);
861 tcp_set_skb_tso_segs(sk
, buff
, mss_now
);
863 /* If this packet has been sent out already, we must
864 * adjust the various packet counters.
866 if (!before(tp
->snd_nxt
, TCP_SKB_CB(buff
)->end_seq
)) {
867 int diff
= old_factor
- tcp_skb_pcount(skb
) -
868 tcp_skb_pcount(buff
);
871 tcp_adjust_pcount(sk
, skb
, diff
);
874 /* Link BUFF into the send queue. */
875 skb_header_release(buff
);
876 tcp_insert_write_queue_after(skb
, buff
, sk
);
881 /* This is similar to __pskb_pull_head() (it will go to core/skbuff.c
882 * eventually). The difference is that pulled data not copied, but
883 * immediately discarded.
885 static void __pskb_trim_head(struct sk_buff
*skb
, int len
)
891 for (i
= 0; i
< skb_shinfo(skb
)->nr_frags
; i
++) {
892 if (skb_shinfo(skb
)->frags
[i
].size
<= eat
) {
893 put_page(skb_shinfo(skb
)->frags
[i
].page
);
894 eat
-= skb_shinfo(skb
)->frags
[i
].size
;
896 skb_shinfo(skb
)->frags
[k
] = skb_shinfo(skb
)->frags
[i
];
898 skb_shinfo(skb
)->frags
[k
].page_offset
+= eat
;
899 skb_shinfo(skb
)->frags
[k
].size
-= eat
;
905 skb_shinfo(skb
)->nr_frags
= k
;
907 skb_reset_tail_pointer(skb
);
908 skb
->data_len
-= len
;
909 skb
->len
= skb
->data_len
;
912 int tcp_trim_head(struct sock
*sk
, struct sk_buff
*skb
, u32 len
)
914 if (skb_cloned(skb
) && pskb_expand_head(skb
, 0, 0, GFP_ATOMIC
))
917 /* If len == headlen, we avoid __skb_pull to preserve alignment. */
918 if (unlikely(len
< skb_headlen(skb
)))
919 __skb_pull(skb
, len
);
921 __pskb_trim_head(skb
, len
- skb_headlen(skb
));
923 TCP_SKB_CB(skb
)->seq
+= len
;
924 skb
->ip_summed
= CHECKSUM_PARTIAL
;
926 skb
->truesize
-= len
;
927 sk
->sk_wmem_queued
-= len
;
928 sk_mem_uncharge(sk
, len
);
929 sock_set_flag(sk
, SOCK_QUEUE_SHRUNK
);
931 /* Any change of skb->len requires recalculation of tso
934 if (tcp_skb_pcount(skb
) > 1)
935 tcp_set_skb_tso_segs(sk
, skb
, tcp_current_mss(sk
));
940 /* Not accounting for SACKs here. */
941 int tcp_mtu_to_mss(struct sock
*sk
, int pmtu
)
943 struct tcp_sock
*tp
= tcp_sk(sk
);
944 struct inet_connection_sock
*icsk
= inet_csk(sk
);
947 /* Calculate base mss without TCP options:
948 It is MMS_S - sizeof(tcphdr) of rfc1122
950 mss_now
= pmtu
- icsk
->icsk_af_ops
->net_header_len
- sizeof(struct tcphdr
);
952 /* Clamp it (mss_clamp does not include tcp options) */
953 if (mss_now
> tp
->rx_opt
.mss_clamp
)
954 mss_now
= tp
->rx_opt
.mss_clamp
;
956 /* Now subtract optional transport overhead */
957 mss_now
-= icsk
->icsk_ext_hdr_len
;
959 /* Then reserve room for full set of TCP options and 8 bytes of data */
963 /* Now subtract TCP options size, not including SACKs */
964 mss_now
-= tp
->tcp_header_len
- sizeof(struct tcphdr
);
969 /* Inverse of above */
970 int tcp_mss_to_mtu(struct sock
*sk
, int mss
)
972 struct tcp_sock
*tp
= tcp_sk(sk
);
973 struct inet_connection_sock
*icsk
= inet_csk(sk
);
978 icsk
->icsk_ext_hdr_len
+
979 icsk
->icsk_af_ops
->net_header_len
;
984 void tcp_mtup_init(struct sock
*sk
)
986 struct tcp_sock
*tp
= tcp_sk(sk
);
987 struct inet_connection_sock
*icsk
= inet_csk(sk
);
989 icsk
->icsk_mtup
.enabled
= sysctl_tcp_mtu_probing
> 1;
990 icsk
->icsk_mtup
.search_high
= tp
->rx_opt
.mss_clamp
+ sizeof(struct tcphdr
) +
991 icsk
->icsk_af_ops
->net_header_len
;
992 icsk
->icsk_mtup
.search_low
= tcp_mss_to_mtu(sk
, sysctl_tcp_base_mss
);
993 icsk
->icsk_mtup
.probe_size
= 0;
996 /* This function synchronize snd mss to current pmtu/exthdr set.
998 tp->rx_opt.user_mss is mss set by user by TCP_MAXSEG. It does NOT counts
999 for TCP options, but includes only bare TCP header.
1001 tp->rx_opt.mss_clamp is mss negotiated at connection setup.
1002 It is minimum of user_mss and mss received with SYN.
1003 It also does not include TCP options.
1005 inet_csk(sk)->icsk_pmtu_cookie is last pmtu, seen by this function.
1007 tp->mss_cache is current effective sending mss, including
1008 all tcp options except for SACKs. It is evaluated,
1009 taking into account current pmtu, but never exceeds
1010 tp->rx_opt.mss_clamp.
1012 NOTE1. rfc1122 clearly states that advertised MSS
1013 DOES NOT include either tcp or ip options.
1015 NOTE2. inet_csk(sk)->icsk_pmtu_cookie and tp->mss_cache
1016 are READ ONLY outside this function. --ANK (980731)
1018 unsigned int tcp_sync_mss(struct sock
*sk
, u32 pmtu
)
1020 struct tcp_sock
*tp
= tcp_sk(sk
);
1021 struct inet_connection_sock
*icsk
= inet_csk(sk
);
1024 if (icsk
->icsk_mtup
.search_high
> pmtu
)
1025 icsk
->icsk_mtup
.search_high
= pmtu
;
1027 mss_now
= tcp_mtu_to_mss(sk
, pmtu
);
1028 mss_now
= tcp_bound_to_half_wnd(tp
, mss_now
);
1030 /* And store cached results */
1031 icsk
->icsk_pmtu_cookie
= pmtu
;
1032 if (icsk
->icsk_mtup
.enabled
)
1033 mss_now
= min(mss_now
, tcp_mtu_to_mss(sk
, icsk
->icsk_mtup
.search_low
));
1034 tp
->mss_cache
= mss_now
;
1039 /* Compute the current effective MSS, taking SACKs and IP options,
1040 * and even PMTU discovery events into account.
1042 unsigned int tcp_current_mss(struct sock
*sk
)
1044 struct tcp_sock
*tp
= tcp_sk(sk
);
1045 struct dst_entry
*dst
= __sk_dst_get(sk
);
1047 unsigned header_len
;
1048 struct tcp_out_options opts
;
1049 struct tcp_md5sig_key
*md5
;
1051 mss_now
= tp
->mss_cache
;
1054 u32 mtu
= dst_mtu(dst
);
1055 if (mtu
!= inet_csk(sk
)->icsk_pmtu_cookie
)
1056 mss_now
= tcp_sync_mss(sk
, mtu
);
1059 header_len
= tcp_established_options(sk
, NULL
, &opts
, &md5
) +
1060 sizeof(struct tcphdr
);
1061 /* The mss_cache is sized based on tp->tcp_header_len, which assumes
1062 * some common options. If this is an odd packet (because we have SACK
1063 * blocks etc) then our calculated header_len will be different, and
1064 * we have to adjust mss_now correspondingly */
1065 if (header_len
!= tp
->tcp_header_len
) {
1066 int delta
= (int) header_len
- tp
->tcp_header_len
;
1073 /* Congestion window validation. (RFC2861) */
1074 static void tcp_cwnd_validate(struct sock
*sk
)
1076 struct tcp_sock
*tp
= tcp_sk(sk
);
1078 if (tp
->packets_out
>= tp
->snd_cwnd
) {
1079 /* Network is feed fully. */
1080 tp
->snd_cwnd_used
= 0;
1081 tp
->snd_cwnd_stamp
= tcp_time_stamp
;
1083 /* Network starves. */
1084 if (tp
->packets_out
> tp
->snd_cwnd_used
)
1085 tp
->snd_cwnd_used
= tp
->packets_out
;
1087 if (sysctl_tcp_slow_start_after_idle
&&
1088 (s32
)(tcp_time_stamp
- tp
->snd_cwnd_stamp
) >= inet_csk(sk
)->icsk_rto
)
1089 tcp_cwnd_application_limited(sk
);
1093 /* Returns the portion of skb which can be sent right away without
1094 * introducing MSS oddities to segment boundaries. In rare cases where
1095 * mss_now != mss_cache, we will request caller to create a small skb
1096 * per input skb which could be mostly avoided here (if desired).
1098 * We explicitly want to create a request for splitting write queue tail
1099 * to a small skb for Nagle purposes while avoiding unnecessary modulos,
1100 * thus all the complexity (cwnd_len is always MSS multiple which we
1101 * return whenever allowed by the other factors). Basically we need the
1102 * modulo only when the receiver window alone is the limiting factor or
1103 * when we would be allowed to send the split-due-to-Nagle skb fully.
1105 static unsigned int tcp_mss_split_point(struct sock
*sk
, struct sk_buff
*skb
,
1106 unsigned int mss_now
, unsigned int cwnd
)
1108 struct tcp_sock
*tp
= tcp_sk(sk
);
1109 u32 needed
, window
, cwnd_len
;
1111 window
= tcp_wnd_end(tp
) - TCP_SKB_CB(skb
)->seq
;
1112 cwnd_len
= mss_now
* cwnd
;
1114 if (likely(cwnd_len
<= window
&& skb
!= tcp_write_queue_tail(sk
)))
1117 needed
= min(skb
->len
, window
);
1119 if (cwnd_len
<= needed
)
1122 return needed
- needed
% mss_now
;
1125 /* Can at least one segment of SKB be sent right now, according to the
1126 * congestion window rules? If so, return how many segments are allowed.
1128 static inline unsigned int tcp_cwnd_test(struct tcp_sock
*tp
,
1129 struct sk_buff
*skb
)
1131 u32 in_flight
, cwnd
;
1133 /* Don't be strict about the congestion window for the final FIN. */
1134 if ((TCP_SKB_CB(skb
)->flags
& TCPCB_FLAG_FIN
) &&
1135 tcp_skb_pcount(skb
) == 1)
1138 in_flight
= tcp_packets_in_flight(tp
);
1139 cwnd
= tp
->snd_cwnd
;
1140 if (in_flight
< cwnd
)
1141 return (cwnd
- in_flight
);
1146 /* This must be invoked the first time we consider transmitting
1147 * SKB onto the wire.
1149 static int tcp_init_tso_segs(struct sock
*sk
, struct sk_buff
*skb
,
1150 unsigned int mss_now
)
1152 int tso_segs
= tcp_skb_pcount(skb
);
1154 if (!tso_segs
|| (tso_segs
> 1 && tcp_skb_mss(skb
) != mss_now
)) {
1155 tcp_set_skb_tso_segs(sk
, skb
, mss_now
);
1156 tso_segs
= tcp_skb_pcount(skb
);
1161 static inline int tcp_minshall_check(const struct tcp_sock
*tp
)
1163 return after(tp
->snd_sml
, tp
->snd_una
) &&
1164 !after(tp
->snd_sml
, tp
->snd_nxt
);
1167 /* Return 0, if packet can be sent now without violation Nagle's rules:
1168 * 1. It is full sized.
1169 * 2. Or it contains FIN. (already checked by caller)
1170 * 3. Or TCP_NODELAY was set.
1171 * 4. Or TCP_CORK is not set, and all sent packets are ACKed.
1172 * With Minshall's modification: all sent small packets are ACKed.
1174 static inline int tcp_nagle_check(const struct tcp_sock
*tp
,
1175 const struct sk_buff
*skb
,
1176 unsigned mss_now
, int nonagle
)
1178 return (skb
->len
< mss_now
&&
1179 ((nonagle
& TCP_NAGLE_CORK
) ||
1180 (!nonagle
&& tp
->packets_out
&& tcp_minshall_check(tp
))));
1183 /* Return non-zero if the Nagle test allows this packet to be
1186 static inline int tcp_nagle_test(struct tcp_sock
*tp
, struct sk_buff
*skb
,
1187 unsigned int cur_mss
, int nonagle
)
1189 /* Nagle rule does not apply to frames, which sit in the middle of the
1190 * write_queue (they have no chances to get new data).
1192 * This is implemented in the callers, where they modify the 'nonagle'
1193 * argument based upon the location of SKB in the send queue.
1195 if (nonagle
& TCP_NAGLE_PUSH
)
1198 /* Don't use the nagle rule for urgent data (or for the final FIN).
1199 * Nagle can be ignored during F-RTO too (see RFC4138).
1201 if (tcp_urg_mode(tp
) || (tp
->frto_counter
== 2) ||
1202 (TCP_SKB_CB(skb
)->flags
& TCPCB_FLAG_FIN
))
1205 if (!tcp_nagle_check(tp
, skb
, cur_mss
, nonagle
))
1211 /* Does at least the first segment of SKB fit into the send window? */
1212 static inline int tcp_snd_wnd_test(struct tcp_sock
*tp
, struct sk_buff
*skb
,
1213 unsigned int cur_mss
)
1215 u32 end_seq
= TCP_SKB_CB(skb
)->end_seq
;
1217 if (skb
->len
> cur_mss
)
1218 end_seq
= TCP_SKB_CB(skb
)->seq
+ cur_mss
;
1220 return !after(end_seq
, tcp_wnd_end(tp
));
1223 /* This checks if the data bearing packet SKB (usually tcp_send_head(sk))
1224 * should be put on the wire right now. If so, it returns the number of
1225 * packets allowed by the congestion window.
1227 static unsigned int tcp_snd_test(struct sock
*sk
, struct sk_buff
*skb
,
1228 unsigned int cur_mss
, int nonagle
)
1230 struct tcp_sock
*tp
= tcp_sk(sk
);
1231 unsigned int cwnd_quota
;
1233 tcp_init_tso_segs(sk
, skb
, cur_mss
);
1235 if (!tcp_nagle_test(tp
, skb
, cur_mss
, nonagle
))
1238 cwnd_quota
= tcp_cwnd_test(tp
, skb
);
1239 if (cwnd_quota
&& !tcp_snd_wnd_test(tp
, skb
, cur_mss
))
1245 int tcp_may_send_now(struct sock
*sk
)
1247 struct tcp_sock
*tp
= tcp_sk(sk
);
1248 struct sk_buff
*skb
= tcp_send_head(sk
);
1251 tcp_snd_test(sk
, skb
, tcp_current_mss(sk
),
1252 (tcp_skb_is_last(sk
, skb
) ?
1253 tp
->nonagle
: TCP_NAGLE_PUSH
)));
1256 /* Trim TSO SKB to LEN bytes, put the remaining data into a new packet
1257 * which is put after SKB on the list. It is very much like
1258 * tcp_fragment() except that it may make several kinds of assumptions
1259 * in order to speed up the splitting operation. In particular, we
1260 * know that all the data is in scatter-gather pages, and that the
1261 * packet has never been sent out before (and thus is not cloned).
1263 static int tso_fragment(struct sock
*sk
, struct sk_buff
*skb
, unsigned int len
,
1264 unsigned int mss_now
)
1266 struct sk_buff
*buff
;
1267 int nlen
= skb
->len
- len
;
1270 /* All of a TSO frame must be composed of paged data. */
1271 if (skb
->len
!= skb
->data_len
)
1272 return tcp_fragment(sk
, skb
, len
, mss_now
);
1274 buff
= sk_stream_alloc_skb(sk
, 0, GFP_ATOMIC
);
1275 if (unlikely(buff
== NULL
))
1278 sk
->sk_wmem_queued
+= buff
->truesize
;
1279 sk_mem_charge(sk
, buff
->truesize
);
1280 buff
->truesize
+= nlen
;
1281 skb
->truesize
-= nlen
;
1283 /* Correct the sequence numbers. */
1284 TCP_SKB_CB(buff
)->seq
= TCP_SKB_CB(skb
)->seq
+ len
;
1285 TCP_SKB_CB(buff
)->end_seq
= TCP_SKB_CB(skb
)->end_seq
;
1286 TCP_SKB_CB(skb
)->end_seq
= TCP_SKB_CB(buff
)->seq
;
1288 /* PSH and FIN should only be set in the second packet. */
1289 flags
= TCP_SKB_CB(skb
)->flags
;
1290 TCP_SKB_CB(skb
)->flags
= flags
& ~(TCPCB_FLAG_FIN
| TCPCB_FLAG_PSH
);
1291 TCP_SKB_CB(buff
)->flags
= flags
;
1293 /* This packet was never sent out yet, so no SACK bits. */
1294 TCP_SKB_CB(buff
)->sacked
= 0;
1296 buff
->ip_summed
= skb
->ip_summed
= CHECKSUM_PARTIAL
;
1297 skb_split(skb
, buff
, len
);
1299 /* Fix up tso_factor for both original and new SKB. */
1300 tcp_set_skb_tso_segs(sk
, skb
, mss_now
);
1301 tcp_set_skb_tso_segs(sk
, buff
, mss_now
);
1303 /* Link BUFF into the send queue. */
1304 skb_header_release(buff
);
1305 tcp_insert_write_queue_after(skb
, buff
, sk
);
1310 /* Try to defer sending, if possible, in order to minimize the amount
1311 * of TSO splitting we do. View it as a kind of TSO Nagle test.
1313 * This algorithm is from John Heffner.
1315 static int tcp_tso_should_defer(struct sock
*sk
, struct sk_buff
*skb
)
1317 struct tcp_sock
*tp
= tcp_sk(sk
);
1318 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
1319 u32 send_win
, cong_win
, limit
, in_flight
;
1321 if (TCP_SKB_CB(skb
)->flags
& TCPCB_FLAG_FIN
)
1324 if (icsk
->icsk_ca_state
!= TCP_CA_Open
)
1327 /* Defer for less than two clock ticks. */
1328 if (tp
->tso_deferred
&&
1329 (((u32
)jiffies
<< 1) >> 1) - (tp
->tso_deferred
>> 1) > 1)
1332 in_flight
= tcp_packets_in_flight(tp
);
1334 BUG_ON(tcp_skb_pcount(skb
) <= 1 || (tp
->snd_cwnd
<= in_flight
));
1336 send_win
= tcp_wnd_end(tp
) - TCP_SKB_CB(skb
)->seq
;
1338 /* From in_flight test above, we know that cwnd > in_flight. */
1339 cong_win
= (tp
->snd_cwnd
- in_flight
) * tp
->mss_cache
;
1341 limit
= min(send_win
, cong_win
);
1343 /* If a full-sized TSO skb can be sent, do it. */
1344 if (limit
>= sk
->sk_gso_max_size
)
1347 /* Middle in queue won't get any more data, full sendable already? */
1348 if ((skb
!= tcp_write_queue_tail(sk
)) && (limit
>= skb
->len
))
1351 if (sysctl_tcp_tso_win_divisor
) {
1352 u32 chunk
= min(tp
->snd_wnd
, tp
->snd_cwnd
* tp
->mss_cache
);
1354 /* If at least some fraction of a window is available,
1357 chunk
/= sysctl_tcp_tso_win_divisor
;
1361 /* Different approach, try not to defer past a single
1362 * ACK. Receiver should ACK every other full sized
1363 * frame, so if we have space for more than 3 frames
1366 if (limit
> tcp_max_burst(tp
) * tp
->mss_cache
)
1370 /* Ok, it looks like it is advisable to defer. */
1371 tp
->tso_deferred
= 1 | (jiffies
<< 1);
1376 tp
->tso_deferred
= 0;
1380 /* Create a new MTU probe if we are ready.
1381 * Returns 0 if we should wait to probe (no cwnd available),
1382 * 1 if a probe was sent,
1385 static int tcp_mtu_probe(struct sock
*sk
)
1387 struct tcp_sock
*tp
= tcp_sk(sk
);
1388 struct inet_connection_sock
*icsk
= inet_csk(sk
);
1389 struct sk_buff
*skb
, *nskb
, *next
;
1396 /* Not currently probing/verifying,
1398 * have enough cwnd, and
1399 * not SACKing (the variable headers throw things off) */
1400 if (!icsk
->icsk_mtup
.enabled
||
1401 icsk
->icsk_mtup
.probe_size
||
1402 inet_csk(sk
)->icsk_ca_state
!= TCP_CA_Open
||
1403 tp
->snd_cwnd
< 11 ||
1404 tp
->rx_opt
.num_sacks
|| tp
->rx_opt
.dsack
)
1407 /* Very simple search strategy: just double the MSS. */
1408 mss_now
= tcp_current_mss(sk
);
1409 probe_size
= 2 * tp
->mss_cache
;
1410 size_needed
= probe_size
+ (tp
->reordering
+ 1) * tp
->mss_cache
;
1411 if (probe_size
> tcp_mtu_to_mss(sk
, icsk
->icsk_mtup
.search_high
)) {
1412 /* TODO: set timer for probe_converge_event */
1416 /* Have enough data in the send queue to probe? */
1417 if (tp
->write_seq
- tp
->snd_nxt
< size_needed
)
1420 if (tp
->snd_wnd
< size_needed
)
1422 if (after(tp
->snd_nxt
+ size_needed
, tcp_wnd_end(tp
)))
1425 /* Do we need to wait to drain cwnd? With none in flight, don't stall */
1426 if (tcp_packets_in_flight(tp
) + 2 > tp
->snd_cwnd
) {
1427 if (!tcp_packets_in_flight(tp
))
1433 /* We're allowed to probe. Build it now. */
1434 if ((nskb
= sk_stream_alloc_skb(sk
, probe_size
, GFP_ATOMIC
)) == NULL
)
1436 sk
->sk_wmem_queued
+= nskb
->truesize
;
1437 sk_mem_charge(sk
, nskb
->truesize
);
1439 skb
= tcp_send_head(sk
);
1441 TCP_SKB_CB(nskb
)->seq
= TCP_SKB_CB(skb
)->seq
;
1442 TCP_SKB_CB(nskb
)->end_seq
= TCP_SKB_CB(skb
)->seq
+ probe_size
;
1443 TCP_SKB_CB(nskb
)->flags
= TCPCB_FLAG_ACK
;
1444 TCP_SKB_CB(nskb
)->sacked
= 0;
1446 nskb
->ip_summed
= skb
->ip_summed
;
1448 tcp_insert_write_queue_before(nskb
, skb
, sk
);
1451 tcp_for_write_queue_from_safe(skb
, next
, sk
) {
1452 copy
= min_t(int, skb
->len
, probe_size
- len
);
1453 if (nskb
->ip_summed
)
1454 skb_copy_bits(skb
, 0, skb_put(nskb
, copy
), copy
);
1456 nskb
->csum
= skb_copy_and_csum_bits(skb
, 0,
1457 skb_put(nskb
, copy
),
1460 if (skb
->len
<= copy
) {
1461 /* We've eaten all the data from this skb.
1463 TCP_SKB_CB(nskb
)->flags
|= TCP_SKB_CB(skb
)->flags
;
1464 tcp_unlink_write_queue(skb
, sk
);
1465 sk_wmem_free_skb(sk
, skb
);
1467 TCP_SKB_CB(nskb
)->flags
|= TCP_SKB_CB(skb
)->flags
&
1468 ~(TCPCB_FLAG_FIN
|TCPCB_FLAG_PSH
);
1469 if (!skb_shinfo(skb
)->nr_frags
) {
1470 skb_pull(skb
, copy
);
1471 if (skb
->ip_summed
!= CHECKSUM_PARTIAL
)
1472 skb
->csum
= csum_partial(skb
->data
,
1475 __pskb_trim_head(skb
, copy
);
1476 tcp_set_skb_tso_segs(sk
, skb
, mss_now
);
1478 TCP_SKB_CB(skb
)->seq
+= copy
;
1483 if (len
>= probe_size
)
1486 tcp_init_tso_segs(sk
, nskb
, nskb
->len
);
1488 /* We're ready to send. If this fails, the probe will
1489 * be resegmented into mss-sized pieces by tcp_write_xmit(). */
1490 TCP_SKB_CB(nskb
)->when
= tcp_time_stamp
;
1491 if (!tcp_transmit_skb(sk
, nskb
, 1, GFP_ATOMIC
)) {
1492 /* Decrement cwnd here because we are sending
1493 * effectively two packets. */
1495 tcp_event_new_data_sent(sk
, nskb
);
1497 icsk
->icsk_mtup
.probe_size
= tcp_mss_to_mtu(sk
, nskb
->len
);
1498 tp
->mtu_probe
.probe_seq_start
= TCP_SKB_CB(nskb
)->seq
;
1499 tp
->mtu_probe
.probe_seq_end
= TCP_SKB_CB(nskb
)->end_seq
;
1507 /* This routine writes packets to the network. It advances the
1508 * send_head. This happens as incoming acks open up the remote
1511 * LARGESEND note: !tcp_urg_mode is overkill, only frames between
1512 * snd_up-64k-mss .. snd_up cannot be large. However, taking into
1513 * account rare use of URG, this is not a big flaw.
1515 * Returns 1, if no segments are in flight and we have queued segments, but
1516 * cannot send anything now because of SWS or another problem.
1518 static int tcp_write_xmit(struct sock
*sk
, unsigned int mss_now
, int nonagle
,
1519 int push_one
, gfp_t gfp
)
1521 struct tcp_sock
*tp
= tcp_sk(sk
);
1522 struct sk_buff
*skb
;
1523 unsigned int tso_segs
, sent_pkts
;
1530 /* Do MTU probing. */
1531 result
= tcp_mtu_probe(sk
);
1534 } else if (result
> 0) {
1539 while ((skb
= tcp_send_head(sk
))) {
1542 tso_segs
= tcp_init_tso_segs(sk
, skb
, mss_now
);
1545 cwnd_quota
= tcp_cwnd_test(tp
, skb
);
1549 if (unlikely(!tcp_snd_wnd_test(tp
, skb
, mss_now
)))
1552 if (tso_segs
== 1) {
1553 if (unlikely(!tcp_nagle_test(tp
, skb
, mss_now
,
1554 (tcp_skb_is_last(sk
, skb
) ?
1555 nonagle
: TCP_NAGLE_PUSH
))))
1558 if (!push_one
&& tcp_tso_should_defer(sk
, skb
))
1563 if (tso_segs
> 1 && !tcp_urg_mode(tp
))
1564 limit
= tcp_mss_split_point(sk
, skb
, mss_now
,
1567 if (skb
->len
> limit
&&
1568 unlikely(tso_fragment(sk
, skb
, limit
, mss_now
)))
1571 TCP_SKB_CB(skb
)->when
= tcp_time_stamp
;
1573 if (unlikely(tcp_transmit_skb(sk
, skb
, 1, gfp
)))
1576 /* Advance the send_head. This one is sent out.
1577 * This call will increment packets_out.
1579 tcp_event_new_data_sent(sk
, skb
);
1581 tcp_minshall_update(tp
, mss_now
, skb
);
1588 if (likely(sent_pkts
)) {
1589 tcp_cwnd_validate(sk
);
1592 return !tp
->packets_out
&& tcp_send_head(sk
);
1595 /* Push out any pending frames which were held back due to
1596 * TCP_CORK or attempt at coalescing tiny packets.
1597 * The socket must be locked by the caller.
1599 void __tcp_push_pending_frames(struct sock
*sk
, unsigned int cur_mss
,
1602 struct sk_buff
*skb
= tcp_send_head(sk
);
1607 /* If we are closed, the bytes will have to remain here.
1608 * In time closedown will finish, we empty the write queue and
1609 * all will be happy.
1611 if (unlikely(sk
->sk_state
== TCP_CLOSE
))
1614 if (tcp_write_xmit(sk
, cur_mss
, nonagle
, 0, GFP_ATOMIC
))
1615 tcp_check_probe_timer(sk
);
1618 /* Send _single_ skb sitting at the send head. This function requires
1619 * true push pending frames to setup probe timer etc.
1621 void tcp_push_one(struct sock
*sk
, unsigned int mss_now
)
1623 struct sk_buff
*skb
= tcp_send_head(sk
);
1625 BUG_ON(!skb
|| skb
->len
< mss_now
);
1627 tcp_write_xmit(sk
, mss_now
, TCP_NAGLE_PUSH
, 1, sk
->sk_allocation
);
1630 /* This function returns the amount that we can raise the
1631 * usable window based on the following constraints
1633 * 1. The window can never be shrunk once it is offered (RFC 793)
1634 * 2. We limit memory per socket
1637 * "the suggested [SWS] avoidance algorithm for the receiver is to keep
1638 * RECV.NEXT + RCV.WIN fixed until:
1639 * RCV.BUFF - RCV.USER - RCV.WINDOW >= min(1/2 RCV.BUFF, MSS)"
1641 * i.e. don't raise the right edge of the window until you can raise
1642 * it at least MSS bytes.
1644 * Unfortunately, the recommended algorithm breaks header prediction,
1645 * since header prediction assumes th->window stays fixed.
1647 * Strictly speaking, keeping th->window fixed violates the receiver
1648 * side SWS prevention criteria. The problem is that under this rule
1649 * a stream of single byte packets will cause the right side of the
1650 * window to always advance by a single byte.
1652 * Of course, if the sender implements sender side SWS prevention
1653 * then this will not be a problem.
1655 * BSD seems to make the following compromise:
1657 * If the free space is less than the 1/4 of the maximum
1658 * space available and the free space is less than 1/2 mss,
1659 * then set the window to 0.
1660 * [ Actually, bsd uses MSS and 1/4 of maximal _window_ ]
1661 * Otherwise, just prevent the window from shrinking
1662 * and from being larger than the largest representable value.
1664 * This prevents incremental opening of the window in the regime
1665 * where TCP is limited by the speed of the reader side taking
1666 * data out of the TCP receive queue. It does nothing about
1667 * those cases where the window is constrained on the sender side
1668 * because the pipeline is full.
1670 * BSD also seems to "accidentally" limit itself to windows that are a
1671 * multiple of MSS, at least until the free space gets quite small.
1672 * This would appear to be a side effect of the mbuf implementation.
1673 * Combining these two algorithms results in the observed behavior
1674 * of having a fixed window size at almost all times.
1676 * Below we obtain similar behavior by forcing the offered window to
1677 * a multiple of the mss when it is feasible to do so.
1679 * Note, we don't "adjust" for TIMESTAMP or SACK option bytes.
1680 * Regular options like TIMESTAMP are taken into account.
1682 u32
__tcp_select_window(struct sock
*sk
)
1684 struct inet_connection_sock
*icsk
= inet_csk(sk
);
1685 struct tcp_sock
*tp
= tcp_sk(sk
);
1686 /* MSS for the peer's data. Previous versions used mss_clamp
1687 * here. I don't know if the value based on our guesses
1688 * of peer's MSS is better for the performance. It's more correct
1689 * but may be worse for the performance because of rcv_mss
1690 * fluctuations. --SAW 1998/11/1
1692 int mss
= icsk
->icsk_ack
.rcv_mss
;
1693 int free_space
= tcp_space(sk
);
1694 int full_space
= min_t(int, tp
->window_clamp
, tcp_full_space(sk
));
1697 if (mss
> full_space
)
1700 if (free_space
< (full_space
>> 1)) {
1701 icsk
->icsk_ack
.quick
= 0;
1703 if (tcp_memory_pressure
)
1704 tp
->rcv_ssthresh
= min(tp
->rcv_ssthresh
,
1707 if (free_space
< mss
)
1711 if (free_space
> tp
->rcv_ssthresh
)
1712 free_space
= tp
->rcv_ssthresh
;
1714 /* Don't do rounding if we are using window scaling, since the
1715 * scaled window will not line up with the MSS boundary anyway.
1717 window
= tp
->rcv_wnd
;
1718 if (tp
->rx_opt
.rcv_wscale
) {
1719 window
= free_space
;
1721 /* Advertise enough space so that it won't get scaled away.
1722 * Import case: prevent zero window announcement if
1723 * 1<<rcv_wscale > mss.
1725 if (((window
>> tp
->rx_opt
.rcv_wscale
) << tp
->rx_opt
.rcv_wscale
) != window
)
1726 window
= (((window
>> tp
->rx_opt
.rcv_wscale
) + 1)
1727 << tp
->rx_opt
.rcv_wscale
);
1729 /* Get the largest window that is a nice multiple of mss.
1730 * Window clamp already applied above.
1731 * If our current window offering is within 1 mss of the
1732 * free space we just keep it. This prevents the divide
1733 * and multiply from happening most of the time.
1734 * We also don't do any window rounding when the free space
1737 if (window
<= free_space
- mss
|| window
> free_space
)
1738 window
= (free_space
/ mss
) * mss
;
1739 else if (mss
== full_space
&&
1740 free_space
> window
+ (full_space
>> 1))
1741 window
= free_space
;
1747 /* Collapses two adjacent SKB's during retransmission. */
1748 static void tcp_collapse_retrans(struct sock
*sk
, struct sk_buff
*skb
)
1750 struct tcp_sock
*tp
= tcp_sk(sk
);
1751 struct sk_buff
*next_skb
= tcp_write_queue_next(sk
, skb
);
1752 int skb_size
, next_skb_size
;
1754 skb_size
= skb
->len
;
1755 next_skb_size
= next_skb
->len
;
1757 BUG_ON(tcp_skb_pcount(skb
) != 1 || tcp_skb_pcount(next_skb
) != 1);
1759 tcp_highest_sack_combine(sk
, next_skb
, skb
);
1761 tcp_unlink_write_queue(next_skb
, sk
);
1763 skb_copy_from_linear_data(next_skb
, skb_put(skb
, next_skb_size
),
1766 if (next_skb
->ip_summed
== CHECKSUM_PARTIAL
)
1767 skb
->ip_summed
= CHECKSUM_PARTIAL
;
1769 if (skb
->ip_summed
!= CHECKSUM_PARTIAL
)
1770 skb
->csum
= csum_block_add(skb
->csum
, next_skb
->csum
, skb_size
);
1772 /* Update sequence range on original skb. */
1773 TCP_SKB_CB(skb
)->end_seq
= TCP_SKB_CB(next_skb
)->end_seq
;
1775 /* Merge over control information. This moves PSH/FIN etc. over */
1776 TCP_SKB_CB(skb
)->flags
|= TCP_SKB_CB(next_skb
)->flags
;
1778 /* All done, get rid of second SKB and account for it so
1779 * packet counting does not break.
1781 TCP_SKB_CB(skb
)->sacked
|= TCP_SKB_CB(next_skb
)->sacked
& TCPCB_EVER_RETRANS
;
1783 /* changed transmit queue under us so clear hints */
1784 tcp_clear_retrans_hints_partial(tp
);
1785 if (next_skb
== tp
->retransmit_skb_hint
)
1786 tp
->retransmit_skb_hint
= skb
;
1788 tcp_adjust_pcount(sk
, next_skb
, tcp_skb_pcount(next_skb
));
1790 sk_wmem_free_skb(sk
, next_skb
);
1793 static int tcp_can_collapse(struct sock
*sk
, struct sk_buff
*skb
)
1795 if (tcp_skb_pcount(skb
) > 1)
1797 /* TODO: SACK collapsing could be used to remove this condition */
1798 if (skb_shinfo(skb
)->nr_frags
!= 0)
1800 if (skb_cloned(skb
))
1802 if (skb
== tcp_send_head(sk
))
1804 /* Some heurestics for collapsing over SACK'd could be invented */
1805 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_ACKED
)
1811 static void tcp_retrans_try_collapse(struct sock
*sk
, struct sk_buff
*to
,
1814 struct tcp_sock
*tp
= tcp_sk(sk
);
1815 struct sk_buff
*skb
= to
, *tmp
;
1818 if (!sysctl_tcp_retrans_collapse
)
1820 if (TCP_SKB_CB(skb
)->flags
& TCPCB_FLAG_SYN
)
1823 tcp_for_write_queue_from_safe(skb
, tmp
, sk
) {
1824 if (!tcp_can_collapse(sk
, skb
))
1836 /* Punt if not enough space exists in the first SKB for
1837 * the data in the second
1839 if (skb
->len
> skb_tailroom(to
))
1842 if (after(TCP_SKB_CB(skb
)->end_seq
, tcp_wnd_end(tp
)))
1845 tcp_collapse_retrans(sk
, to
);
1849 /* This retransmits one SKB. Policy decisions and retransmit queue
1850 * state updates are done by the caller. Returns non-zero if an
1851 * error occurred which prevented the send.
1853 int tcp_retransmit_skb(struct sock
*sk
, struct sk_buff
*skb
)
1855 struct tcp_sock
*tp
= tcp_sk(sk
);
1856 struct inet_connection_sock
*icsk
= inet_csk(sk
);
1857 unsigned int cur_mss
;
1860 /* Inconslusive MTU probe */
1861 if (icsk
->icsk_mtup
.probe_size
) {
1862 icsk
->icsk_mtup
.probe_size
= 0;
1865 /* Do not sent more than we queued. 1/4 is reserved for possible
1866 * copying overhead: fragmentation, tunneling, mangling etc.
1868 if (atomic_read(&sk
->sk_wmem_alloc
) >
1869 min(sk
->sk_wmem_queued
+ (sk
->sk_wmem_queued
>> 2), sk
->sk_sndbuf
))
1872 if (before(TCP_SKB_CB(skb
)->seq
, tp
->snd_una
)) {
1873 if (before(TCP_SKB_CB(skb
)->end_seq
, tp
->snd_una
))
1875 if (tcp_trim_head(sk
, skb
, tp
->snd_una
- TCP_SKB_CB(skb
)->seq
))
1879 if (inet_csk(sk
)->icsk_af_ops
->rebuild_header(sk
))
1880 return -EHOSTUNREACH
; /* Routing failure or similar. */
1882 cur_mss
= tcp_current_mss(sk
);
1884 /* If receiver has shrunk his window, and skb is out of
1885 * new window, do not retransmit it. The exception is the
1886 * case, when window is shrunk to zero. In this case
1887 * our retransmit serves as a zero window probe.
1889 if (!before(TCP_SKB_CB(skb
)->seq
, tcp_wnd_end(tp
))
1890 && TCP_SKB_CB(skb
)->seq
!= tp
->snd_una
)
1893 if (skb
->len
> cur_mss
) {
1894 if (tcp_fragment(sk
, skb
, cur_mss
, cur_mss
))
1895 return -ENOMEM
; /* We'll try again later. */
1897 int oldpcount
= tcp_skb_pcount(skb
);
1899 if (unlikely(oldpcount
> 1)) {
1900 tcp_init_tso_segs(sk
, skb
, cur_mss
);
1901 tcp_adjust_pcount(sk
, skb
, oldpcount
- tcp_skb_pcount(skb
));
1905 tcp_retrans_try_collapse(sk
, skb
, cur_mss
);
1907 /* Some Solaris stacks overoptimize and ignore the FIN on a
1908 * retransmit when old data is attached. So strip it off
1909 * since it is cheap to do so and saves bytes on the network.
1912 (TCP_SKB_CB(skb
)->flags
& TCPCB_FLAG_FIN
) &&
1913 tp
->snd_una
== (TCP_SKB_CB(skb
)->end_seq
- 1)) {
1914 if (!pskb_trim(skb
, 0)) {
1915 /* Reuse, even though it does some unnecessary work */
1916 tcp_init_nondata_skb(skb
, TCP_SKB_CB(skb
)->end_seq
- 1,
1917 TCP_SKB_CB(skb
)->flags
);
1918 skb
->ip_summed
= CHECKSUM_NONE
;
1922 /* Make a copy, if the first transmission SKB clone we made
1923 * is still in somebody's hands, else make a clone.
1925 TCP_SKB_CB(skb
)->when
= tcp_time_stamp
;
1927 err
= tcp_transmit_skb(sk
, skb
, 1, GFP_ATOMIC
);
1930 /* Update global TCP statistics. */
1931 TCP_INC_STATS(sock_net(sk
), TCP_MIB_RETRANSSEGS
);
1933 tp
->total_retrans
++;
1935 #if FASTRETRANS_DEBUG > 0
1936 if (TCP_SKB_CB(skb
)->sacked
& TCPCB_SACKED_RETRANS
) {
1937 if (net_ratelimit())
1938 printk(KERN_DEBUG
"retrans_out leaked.\n");
1941 if (!tp
->retrans_out
)
1942 tp
->lost_retrans_low
= tp
->snd_nxt
;
1943 TCP_SKB_CB(skb
)->sacked
|= TCPCB_RETRANS
;
1944 tp
->retrans_out
+= tcp_skb_pcount(skb
);
1946 /* Save stamp of the first retransmit. */
1947 if (!tp
->retrans_stamp
)
1948 tp
->retrans_stamp
= TCP_SKB_CB(skb
)->when
;
1952 /* snd_nxt is stored to detect loss of retransmitted segment,
1953 * see tcp_input.c tcp_sacktag_write_queue().
1955 TCP_SKB_CB(skb
)->ack_seq
= tp
->snd_nxt
;
1960 static int tcp_can_forward_retransmit(struct sock
*sk
)
1962 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
1963 struct tcp_sock
*tp
= tcp_sk(sk
);
1965 /* Forward retransmissions are possible only during Recovery. */
1966 if (icsk
->icsk_ca_state
!= TCP_CA_Recovery
)
1969 /* No forward retransmissions in Reno are possible. */
1970 if (tcp_is_reno(tp
))
1973 /* Yeah, we have to make difficult choice between forward transmission
1974 * and retransmission... Both ways have their merits...
1976 * For now we do not retransmit anything, while we have some new
1977 * segments to send. In the other cases, follow rule 3 for
1978 * NextSeg() specified in RFC3517.
1981 if (tcp_may_send_now(sk
))
1987 /* This gets called after a retransmit timeout, and the initially
1988 * retransmitted data is acknowledged. It tries to continue
1989 * resending the rest of the retransmit queue, until either
1990 * we've sent it all or the congestion window limit is reached.
1991 * If doing SACK, the first ACK which comes back for a timeout
1992 * based retransmit packet might feed us FACK information again.
1993 * If so, we use it to avoid unnecessarily retransmissions.
1995 void tcp_xmit_retransmit_queue(struct sock
*sk
)
1997 const struct inet_connection_sock
*icsk
= inet_csk(sk
);
1998 struct tcp_sock
*tp
= tcp_sk(sk
);
1999 struct sk_buff
*skb
;
2000 struct sk_buff
*hole
= NULL
;
2003 int fwd_rexmitting
= 0;
2006 tp
->retransmit_high
= tp
->snd_una
;
2008 if (tp
->retransmit_skb_hint
) {
2009 skb
= tp
->retransmit_skb_hint
;
2010 last_lost
= TCP_SKB_CB(skb
)->end_seq
;
2011 if (after(last_lost
, tp
->retransmit_high
))
2012 last_lost
= tp
->retransmit_high
;
2014 skb
= tcp_write_queue_head(sk
);
2015 last_lost
= tp
->snd_una
;
2018 tcp_for_write_queue_from(skb
, sk
) {
2019 __u8 sacked
= TCP_SKB_CB(skb
)->sacked
;
2021 if (skb
== tcp_send_head(sk
))
2023 /* we could do better than to assign each time */
2025 tp
->retransmit_skb_hint
= skb
;
2027 /* Assume this retransmit will generate
2028 * only one packet for congestion window
2029 * calculation purposes. This works because
2030 * tcp_retransmit_skb() will chop up the
2031 * packet to be MSS sized and all the
2032 * packet counting works out.
2034 if (tcp_packets_in_flight(tp
) >= tp
->snd_cwnd
)
2037 if (fwd_rexmitting
) {
2039 if (!before(TCP_SKB_CB(skb
)->seq
, tcp_highest_sack_seq(tp
)))
2041 mib_idx
= LINUX_MIB_TCPFORWARDRETRANS
;
2043 } else if (!before(TCP_SKB_CB(skb
)->seq
, tp
->retransmit_high
)) {
2044 tp
->retransmit_high
= last_lost
;
2045 if (!tcp_can_forward_retransmit(sk
))
2047 /* Backtrack if necessary to non-L'ed skb */
2055 } else if (!(sacked
& TCPCB_LOST
)) {
2056 if (hole
== NULL
&& !(sacked
& (TCPCB_SACKED_RETRANS
|TCPCB_SACKED_ACKED
)))
2061 last_lost
= TCP_SKB_CB(skb
)->end_seq
;
2062 if (icsk
->icsk_ca_state
!= TCP_CA_Loss
)
2063 mib_idx
= LINUX_MIB_TCPFASTRETRANS
;
2065 mib_idx
= LINUX_MIB_TCPSLOWSTARTRETRANS
;
2068 if (sacked
& (TCPCB_SACKED_ACKED
|TCPCB_SACKED_RETRANS
))
2071 if (tcp_retransmit_skb(sk
, skb
))
2073 NET_INC_STATS_BH(sock_net(sk
), mib_idx
);
2075 if (skb
== tcp_write_queue_head(sk
))
2076 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_RETRANS
,
2077 inet_csk(sk
)->icsk_rto
,
2082 /* Send a fin. The caller locks the socket for us. This cannot be
2083 * allowed to fail queueing a FIN frame under any circumstances.
2085 void tcp_send_fin(struct sock
*sk
)
2087 struct tcp_sock
*tp
= tcp_sk(sk
);
2088 struct sk_buff
*skb
= tcp_write_queue_tail(sk
);
2091 /* Optimization, tack on the FIN if we have a queue of
2092 * unsent frames. But be careful about outgoing SACKS
2095 mss_now
= tcp_current_mss(sk
);
2097 if (tcp_send_head(sk
) != NULL
) {
2098 TCP_SKB_CB(skb
)->flags
|= TCPCB_FLAG_FIN
;
2099 TCP_SKB_CB(skb
)->end_seq
++;
2102 /* Socket is locked, keep trying until memory is available. */
2104 skb
= alloc_skb_fclone(MAX_TCP_HEADER
, GFP_KERNEL
);
2110 /* Reserve space for headers and prepare control bits. */
2111 skb_reserve(skb
, MAX_TCP_HEADER
);
2112 /* FIN eats a sequence byte, write_seq advanced by tcp_queue_skb(). */
2113 tcp_init_nondata_skb(skb
, tp
->write_seq
,
2114 TCPCB_FLAG_ACK
| TCPCB_FLAG_FIN
);
2115 tcp_queue_skb(sk
, skb
);
2117 __tcp_push_pending_frames(sk
, mss_now
, TCP_NAGLE_OFF
);
2120 /* We get here when a process closes a file descriptor (either due to
2121 * an explicit close() or as a byproduct of exit()'ing) and there
2122 * was unread data in the receive queue. This behavior is recommended
2123 * by RFC 2525, section 2.17. -DaveM
2125 void tcp_send_active_reset(struct sock
*sk
, gfp_t priority
)
2127 struct sk_buff
*skb
;
2129 /* NOTE: No TCP options attached and we never retransmit this. */
2130 skb
= alloc_skb(MAX_TCP_HEADER
, priority
);
2132 NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPABORTFAILED
);
2136 /* Reserve space for headers and prepare control bits. */
2137 skb_reserve(skb
, MAX_TCP_HEADER
);
2138 tcp_init_nondata_skb(skb
, tcp_acceptable_seq(sk
),
2139 TCPCB_FLAG_ACK
| TCPCB_FLAG_RST
);
2141 TCP_SKB_CB(skb
)->when
= tcp_time_stamp
;
2142 if (tcp_transmit_skb(sk
, skb
, 0, priority
))
2143 NET_INC_STATS(sock_net(sk
), LINUX_MIB_TCPABORTFAILED
);
2145 TCP_INC_STATS(sock_net(sk
), TCP_MIB_OUTRSTS
);
2148 /* WARNING: This routine must only be called when we have already sent
2149 * a SYN packet that crossed the incoming SYN that caused this routine
2150 * to get called. If this assumption fails then the initial rcv_wnd
2151 * and rcv_wscale values will not be correct.
2153 int tcp_send_synack(struct sock
*sk
)
2155 struct sk_buff
*skb
;
2157 skb
= tcp_write_queue_head(sk
);
2158 if (skb
== NULL
|| !(TCP_SKB_CB(skb
)->flags
& TCPCB_FLAG_SYN
)) {
2159 printk(KERN_DEBUG
"tcp_send_synack: wrong queue state\n");
2162 if (!(TCP_SKB_CB(skb
)->flags
& TCPCB_FLAG_ACK
)) {
2163 if (skb_cloned(skb
)) {
2164 struct sk_buff
*nskb
= skb_copy(skb
, GFP_ATOMIC
);
2167 tcp_unlink_write_queue(skb
, sk
);
2168 skb_header_release(nskb
);
2169 __tcp_add_write_queue_head(sk
, nskb
);
2170 sk_wmem_free_skb(sk
, skb
);
2171 sk
->sk_wmem_queued
+= nskb
->truesize
;
2172 sk_mem_charge(sk
, nskb
->truesize
);
2176 TCP_SKB_CB(skb
)->flags
|= TCPCB_FLAG_ACK
;
2177 TCP_ECN_send_synack(tcp_sk(sk
), skb
);
2179 TCP_SKB_CB(skb
)->when
= tcp_time_stamp
;
2180 return tcp_transmit_skb(sk
, skb
, 1, GFP_ATOMIC
);
2184 * Prepare a SYN-ACK.
2186 struct sk_buff
*tcp_make_synack(struct sock
*sk
, struct dst_entry
*dst
,
2187 struct request_sock
*req
)
2189 struct inet_request_sock
*ireq
= inet_rsk(req
);
2190 struct tcp_sock
*tp
= tcp_sk(sk
);
2192 int tcp_header_size
;
2193 struct tcp_out_options opts
;
2194 struct sk_buff
*skb
;
2195 struct tcp_md5sig_key
*md5
;
2196 __u8
*md5_hash_location
;
2199 skb
= sock_wmalloc(sk
, MAX_TCP_HEADER
+ 15, 1, GFP_ATOMIC
);
2203 /* Reserve space for headers. */
2204 skb_reserve(skb
, MAX_TCP_HEADER
);
2206 skb_dst_set(skb
, dst_clone(dst
));
2208 mss
= dst_metric(dst
, RTAX_ADVMSS
);
2209 if (tp
->rx_opt
.user_mss
&& tp
->rx_opt
.user_mss
< mss
)
2210 mss
= tp
->rx_opt
.user_mss
;
2212 if (req
->rcv_wnd
== 0) { /* ignored for retransmitted syns */
2214 /* Set this up on the first call only */
2215 req
->window_clamp
= tp
->window_clamp
? : dst_metric(dst
, RTAX_WINDOW
);
2216 /* tcp_full_space because it is guaranteed to be the first packet */
2217 tcp_select_initial_window(tcp_full_space(sk
),
2218 mss
- (ireq
->tstamp_ok
? TCPOLEN_TSTAMP_ALIGNED
: 0),
2223 ireq
->rcv_wscale
= rcv_wscale
;
2226 memset(&opts
, 0, sizeof(opts
));
2227 #ifdef CONFIG_SYN_COOKIES
2228 if (unlikely(req
->cookie_ts
))
2229 TCP_SKB_CB(skb
)->when
= cookie_init_timestamp(req
);
2232 TCP_SKB_CB(skb
)->when
= tcp_time_stamp
;
2233 tcp_header_size
= tcp_synack_options(sk
, req
, mss
,
2235 sizeof(struct tcphdr
);
2237 skb_push(skb
, tcp_header_size
);
2238 skb_reset_transport_header(skb
);
2241 memset(th
, 0, sizeof(struct tcphdr
));
2244 TCP_ECN_make_synack(req
, th
);
2245 th
->source
= ireq
->loc_port
;
2246 th
->dest
= ireq
->rmt_port
;
2247 /* Setting of flags are superfluous here for callers (and ECE is
2248 * not even correctly set)
2250 tcp_init_nondata_skb(skb
, tcp_rsk(req
)->snt_isn
,
2251 TCPCB_FLAG_SYN
| TCPCB_FLAG_ACK
);
2252 th
->seq
= htonl(TCP_SKB_CB(skb
)->seq
);
2253 th
->ack_seq
= htonl(tcp_rsk(req
)->rcv_isn
+ 1);
2255 /* RFC1323: The window in SYN & SYN/ACK segments is never scaled. */
2256 th
->window
= htons(min(req
->rcv_wnd
, 65535U));
2257 tcp_options_write((__be32
*)(th
+ 1), tp
, &opts
, &md5_hash_location
);
2258 th
->doff
= (tcp_header_size
>> 2);
2259 TCP_INC_STATS(sock_net(sk
), TCP_MIB_OUTSEGS
);
2261 #ifdef CONFIG_TCP_MD5SIG
2262 /* Okay, we have all we need - do the md5 hash if needed */
2264 tcp_rsk(req
)->af_specific
->calc_md5_hash(md5_hash_location
,
2265 md5
, NULL
, req
, skb
);
2273 * Do all connect socket setups that can be done AF independent.
2275 static void tcp_connect_init(struct sock
*sk
)
2277 struct dst_entry
*dst
= __sk_dst_get(sk
);
2278 struct tcp_sock
*tp
= tcp_sk(sk
);
2281 /* We'll fix this up when we get a response from the other end.
2282 * See tcp_input.c:tcp_rcv_state_process case TCP_SYN_SENT.
2284 tp
->tcp_header_len
= sizeof(struct tcphdr
) +
2285 (sysctl_tcp_timestamps
? TCPOLEN_TSTAMP_ALIGNED
: 0);
2287 #ifdef CONFIG_TCP_MD5SIG
2288 if (tp
->af_specific
->md5_lookup(sk
, sk
) != NULL
)
2289 tp
->tcp_header_len
+= TCPOLEN_MD5SIG_ALIGNED
;
2292 /* If user gave his TCP_MAXSEG, record it to clamp */
2293 if (tp
->rx_opt
.user_mss
)
2294 tp
->rx_opt
.mss_clamp
= tp
->rx_opt
.user_mss
;
2297 tcp_sync_mss(sk
, dst_mtu(dst
));
2299 if (!tp
->window_clamp
)
2300 tp
->window_clamp
= dst_metric(dst
, RTAX_WINDOW
);
2301 tp
->advmss
= dst_metric(dst
, RTAX_ADVMSS
);
2302 if (tp
->rx_opt
.user_mss
&& tp
->rx_opt
.user_mss
< tp
->advmss
)
2303 tp
->advmss
= tp
->rx_opt
.user_mss
;
2305 tcp_initialize_rcv_mss(sk
);
2307 tcp_select_initial_window(tcp_full_space(sk
),
2308 tp
->advmss
- (tp
->rx_opt
.ts_recent_stamp
? tp
->tcp_header_len
- sizeof(struct tcphdr
) : 0),
2311 sysctl_tcp_window_scaling
,
2314 tp
->rx_opt
.rcv_wscale
= rcv_wscale
;
2315 tp
->rcv_ssthresh
= tp
->rcv_wnd
;
2318 sock_reset_flag(sk
, SOCK_DONE
);
2321 tp
->snd_una
= tp
->write_seq
;
2322 tp
->snd_sml
= tp
->write_seq
;
2323 tp
->snd_up
= tp
->write_seq
;
2328 inet_csk(sk
)->icsk_rto
= TCP_TIMEOUT_INIT
;
2329 inet_csk(sk
)->icsk_retransmits
= 0;
2330 tcp_clear_retrans(tp
);
2334 * Build a SYN and send it off.
2336 int tcp_connect(struct sock
*sk
)
2338 struct tcp_sock
*tp
= tcp_sk(sk
);
2339 struct sk_buff
*buff
;
2341 tcp_connect_init(sk
);
2343 buff
= alloc_skb_fclone(MAX_TCP_HEADER
+ 15, sk
->sk_allocation
);
2344 if (unlikely(buff
== NULL
))
2347 /* Reserve space for headers. */
2348 skb_reserve(buff
, MAX_TCP_HEADER
);
2350 tp
->snd_nxt
= tp
->write_seq
;
2351 tcp_init_nondata_skb(buff
, tp
->write_seq
++, TCPCB_FLAG_SYN
);
2352 TCP_ECN_send_syn(sk
, buff
);
2355 TCP_SKB_CB(buff
)->when
= tcp_time_stamp
;
2356 tp
->retrans_stamp
= TCP_SKB_CB(buff
)->when
;
2357 skb_header_release(buff
);
2358 __tcp_add_write_queue_tail(sk
, buff
);
2359 sk
->sk_wmem_queued
+= buff
->truesize
;
2360 sk_mem_charge(sk
, buff
->truesize
);
2361 tp
->packets_out
+= tcp_skb_pcount(buff
);
2362 tcp_transmit_skb(sk
, buff
, 1, GFP_KERNEL
);
2364 /* We change tp->snd_nxt after the tcp_transmit_skb() call
2365 * in order to make this packet get counted in tcpOutSegs.
2367 tp
->snd_nxt
= tp
->write_seq
;
2368 tp
->pushed_seq
= tp
->write_seq
;
2369 TCP_INC_STATS(sock_net(sk
), TCP_MIB_ACTIVEOPENS
);
2371 /* Timer for repeating the SYN until an answer. */
2372 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_RETRANS
,
2373 inet_csk(sk
)->icsk_rto
, TCP_RTO_MAX
);
2377 /* Send out a delayed ack, the caller does the policy checking
2378 * to see if we should even be here. See tcp_input.c:tcp_ack_snd_check()
2381 void tcp_send_delayed_ack(struct sock
*sk
)
2383 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2384 int ato
= icsk
->icsk_ack
.ato
;
2385 unsigned long timeout
;
2387 if (ato
> TCP_DELACK_MIN
) {
2388 const struct tcp_sock
*tp
= tcp_sk(sk
);
2389 int max_ato
= HZ
/ 2;
2391 if (icsk
->icsk_ack
.pingpong
||
2392 (icsk
->icsk_ack
.pending
& ICSK_ACK_PUSHED
))
2393 max_ato
= TCP_DELACK_MAX
;
2395 /* Slow path, intersegment interval is "high". */
2397 /* If some rtt estimate is known, use it to bound delayed ack.
2398 * Do not use inet_csk(sk)->icsk_rto here, use results of rtt measurements
2402 int rtt
= max(tp
->srtt
>> 3, TCP_DELACK_MIN
);
2408 ato
= min(ato
, max_ato
);
2411 /* Stay within the limit we were given */
2412 timeout
= jiffies
+ ato
;
2414 /* Use new timeout only if there wasn't a older one earlier. */
2415 if (icsk
->icsk_ack
.pending
& ICSK_ACK_TIMER
) {
2416 /* If delack timer was blocked or is about to expire,
2419 if (icsk
->icsk_ack
.blocked
||
2420 time_before_eq(icsk
->icsk_ack
.timeout
, jiffies
+ (ato
>> 2))) {
2425 if (!time_before(timeout
, icsk
->icsk_ack
.timeout
))
2426 timeout
= icsk
->icsk_ack
.timeout
;
2428 icsk
->icsk_ack
.pending
|= ICSK_ACK_SCHED
| ICSK_ACK_TIMER
;
2429 icsk
->icsk_ack
.timeout
= timeout
;
2430 sk_reset_timer(sk
, &icsk
->icsk_delack_timer
, timeout
);
2433 /* This routine sends an ack and also updates the window. */
2434 void tcp_send_ack(struct sock
*sk
)
2436 struct sk_buff
*buff
;
2438 /* If we have been reset, we may not send again. */
2439 if (sk
->sk_state
== TCP_CLOSE
)
2442 /* We are not putting this on the write queue, so
2443 * tcp_transmit_skb() will set the ownership to this
2446 buff
= alloc_skb(MAX_TCP_HEADER
, GFP_ATOMIC
);
2448 inet_csk_schedule_ack(sk
);
2449 inet_csk(sk
)->icsk_ack
.ato
= TCP_ATO_MIN
;
2450 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_DACK
,
2451 TCP_DELACK_MAX
, TCP_RTO_MAX
);
2455 /* Reserve space for headers and prepare control bits. */
2456 skb_reserve(buff
, MAX_TCP_HEADER
);
2457 tcp_init_nondata_skb(buff
, tcp_acceptable_seq(sk
), TCPCB_FLAG_ACK
);
2459 /* Send it off, this clears delayed acks for us. */
2460 TCP_SKB_CB(buff
)->when
= tcp_time_stamp
;
2461 tcp_transmit_skb(sk
, buff
, 0, GFP_ATOMIC
);
2464 /* This routine sends a packet with an out of date sequence
2465 * number. It assumes the other end will try to ack it.
2467 * Question: what should we make while urgent mode?
2468 * 4.4BSD forces sending single byte of data. We cannot send
2469 * out of window data, because we have SND.NXT==SND.MAX...
2471 * Current solution: to send TWO zero-length segments in urgent mode:
2472 * one is with SEG.SEQ=SND.UNA to deliver urgent pointer, another is
2473 * out-of-date with SND.UNA-1 to probe window.
2475 static int tcp_xmit_probe_skb(struct sock
*sk
, int urgent
)
2477 struct tcp_sock
*tp
= tcp_sk(sk
);
2478 struct sk_buff
*skb
;
2480 /* We don't queue it, tcp_transmit_skb() sets ownership. */
2481 skb
= alloc_skb(MAX_TCP_HEADER
, GFP_ATOMIC
);
2485 /* Reserve space for headers and set control bits. */
2486 skb_reserve(skb
, MAX_TCP_HEADER
);
2487 /* Use a previous sequence. This should cause the other
2488 * end to send an ack. Don't queue or clone SKB, just
2491 tcp_init_nondata_skb(skb
, tp
->snd_una
- !urgent
, TCPCB_FLAG_ACK
);
2492 TCP_SKB_CB(skb
)->when
= tcp_time_stamp
;
2493 return tcp_transmit_skb(sk
, skb
, 0, GFP_ATOMIC
);
2496 int tcp_write_wakeup(struct sock
*sk
)
2498 struct tcp_sock
*tp
= tcp_sk(sk
);
2499 struct sk_buff
*skb
;
2501 if (sk
->sk_state
== TCP_CLOSE
)
2504 if ((skb
= tcp_send_head(sk
)) != NULL
&&
2505 before(TCP_SKB_CB(skb
)->seq
, tcp_wnd_end(tp
))) {
2507 unsigned int mss
= tcp_current_mss(sk
);
2508 unsigned int seg_size
= tcp_wnd_end(tp
) - TCP_SKB_CB(skb
)->seq
;
2510 if (before(tp
->pushed_seq
, TCP_SKB_CB(skb
)->end_seq
))
2511 tp
->pushed_seq
= TCP_SKB_CB(skb
)->end_seq
;
2513 /* We are probing the opening of a window
2514 * but the window size is != 0
2515 * must have been a result SWS avoidance ( sender )
2517 if (seg_size
< TCP_SKB_CB(skb
)->end_seq
- TCP_SKB_CB(skb
)->seq
||
2519 seg_size
= min(seg_size
, mss
);
2520 TCP_SKB_CB(skb
)->flags
|= TCPCB_FLAG_PSH
;
2521 if (tcp_fragment(sk
, skb
, seg_size
, mss
))
2523 } else if (!tcp_skb_pcount(skb
))
2524 tcp_set_skb_tso_segs(sk
, skb
, mss
);
2526 TCP_SKB_CB(skb
)->flags
|= TCPCB_FLAG_PSH
;
2527 TCP_SKB_CB(skb
)->when
= tcp_time_stamp
;
2528 err
= tcp_transmit_skb(sk
, skb
, 1, GFP_ATOMIC
);
2530 tcp_event_new_data_sent(sk
, skb
);
2533 if (between(tp
->snd_up
, tp
->snd_una
+ 1, tp
->snd_una
+ 0xFFFF))
2534 tcp_xmit_probe_skb(sk
, 1);
2535 return tcp_xmit_probe_skb(sk
, 0);
2539 /* A window probe timeout has occurred. If window is not closed send
2540 * a partial packet else a zero probe.
2542 void tcp_send_probe0(struct sock
*sk
)
2544 struct inet_connection_sock
*icsk
= inet_csk(sk
);
2545 struct tcp_sock
*tp
= tcp_sk(sk
);
2548 err
= tcp_write_wakeup(sk
);
2550 if (tp
->packets_out
|| !tcp_send_head(sk
)) {
2551 /* Cancel probe timer, if it is not required. */
2552 icsk
->icsk_probes_out
= 0;
2553 icsk
->icsk_backoff
= 0;
2558 if (icsk
->icsk_backoff
< sysctl_tcp_retries2
)
2559 icsk
->icsk_backoff
++;
2560 icsk
->icsk_probes_out
++;
2561 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_PROBE0
,
2562 min(icsk
->icsk_rto
<< icsk
->icsk_backoff
, TCP_RTO_MAX
),
2565 /* If packet was not sent due to local congestion,
2566 * do not backoff and do not remember icsk_probes_out.
2567 * Let local senders to fight for local resources.
2569 * Use accumulated backoff yet.
2571 if (!icsk
->icsk_probes_out
)
2572 icsk
->icsk_probes_out
= 1;
2573 inet_csk_reset_xmit_timer(sk
, ICSK_TIME_PROBE0
,
2574 min(icsk
->icsk_rto
<< icsk
->icsk_backoff
,
2575 TCP_RESOURCE_PROBE_INTERVAL
),
2580 EXPORT_SYMBOL(tcp_select_initial_window
);
2581 EXPORT_SYMBOL(tcp_connect
);
2582 EXPORT_SYMBOL(tcp_make_synack
);
2583 EXPORT_SYMBOL(tcp_simple_retransmit
);
2584 EXPORT_SYMBOL(tcp_sync_mss
);
2585 EXPORT_SYMBOL(tcp_mtup_init
);