Linux 3.12.28
[linux/fpc-iii.git] / net / ipv4 / tcp_output.c
blob0cce660cf7ddda3688343115a341398e0ac035b8
1 /*
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).
8 * Authors: Ross Biro
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
25 * : AF independence
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
39 #include <net/tcp.h>
41 #include <linux/compiler.h>
42 #include <linux/gfp.h>
43 #include <linux/module.h>
45 /* People can turn this off for buggy TCP's found in printers etc. */
46 int sysctl_tcp_retrans_collapse __read_mostly = 1;
48 /* People can turn this on to work with those rare, broken TCPs that
49 * interpret the window field as a signed quantity.
51 int sysctl_tcp_workaround_signed_windows __read_mostly = 0;
53 /* Default TSQ limit of two TSO segments */
54 int sysctl_tcp_limit_output_bytes __read_mostly = 131072;
56 /* This limits the percentage of the congestion window which we
57 * will allow a single TSO frame to consume. Building TSO frames
58 * which are too large can cause TCP streams to be bursty.
60 int sysctl_tcp_tso_win_divisor __read_mostly = 3;
62 int sysctl_tcp_mtu_probing __read_mostly = 0;
63 int sysctl_tcp_base_mss __read_mostly = TCP_BASE_MSS;
65 /* By default, RFC2861 behavior. */
66 int sysctl_tcp_slow_start_after_idle __read_mostly = 1;
68 unsigned int sysctl_tcp_notsent_lowat __read_mostly = UINT_MAX;
69 EXPORT_SYMBOL(sysctl_tcp_notsent_lowat);
71 static bool tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle,
72 int push_one, gfp_t gfp);
74 /* Account for new data that has been sent to the network. */
75 static void tcp_event_new_data_sent(struct sock *sk, const struct sk_buff *skb)
77 struct inet_connection_sock *icsk = inet_csk(sk);
78 struct tcp_sock *tp = tcp_sk(sk);
79 unsigned int prior_packets = tp->packets_out;
81 tcp_advance_send_head(sk, skb);
82 tp->snd_nxt = TCP_SKB_CB(skb)->end_seq;
84 tp->packets_out += tcp_skb_pcount(skb);
85 if (!prior_packets || icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS ||
86 icsk->icsk_pending == ICSK_TIME_LOSS_PROBE) {
87 tcp_rearm_rto(sk);
91 /* SND.NXT, if window was not shrunk.
92 * If window has been shrunk, what should we make? It is not clear at all.
93 * Using SND.UNA we will fail to open window, SND.NXT is out of window. :-(
94 * Anything in between SND.UNA...SND.UNA+SND.WND also can be already
95 * invalid. OK, let's make this for now:
97 static inline __u32 tcp_acceptable_seq(const struct sock *sk)
99 const struct tcp_sock *tp = tcp_sk(sk);
101 if (!before(tcp_wnd_end(tp), tp->snd_nxt))
102 return tp->snd_nxt;
103 else
104 return tcp_wnd_end(tp);
107 /* Calculate mss to advertise in SYN segment.
108 * RFC1122, RFC1063, draft-ietf-tcpimpl-pmtud-01 state that:
110 * 1. It is independent of path mtu.
111 * 2. Ideally, it is maximal possible segment size i.e. 65535-40.
112 * 3. For IPv4 it is reasonable to calculate it from maximal MTU of
113 * attached devices, because some buggy hosts are confused by
114 * large MSS.
115 * 4. We do not make 3, we advertise MSS, calculated from first
116 * hop device mtu, but allow to raise it to ip_rt_min_advmss.
117 * This may be overridden via information stored in routing table.
118 * 5. Value 65535 for MSS is valid in IPv6 and means "as large as possible,
119 * probably even Jumbo".
121 static __u16 tcp_advertise_mss(struct sock *sk)
123 struct tcp_sock *tp = tcp_sk(sk);
124 const struct dst_entry *dst = __sk_dst_get(sk);
125 int mss = tp->advmss;
127 if (dst) {
128 unsigned int metric = dst_metric_advmss(dst);
130 if (metric < mss) {
131 mss = metric;
132 tp->advmss = mss;
136 return (__u16)mss;
139 /* RFC2861. Reset CWND after idle period longer RTO to "restart window".
140 * This is the first part of cwnd validation mechanism. */
141 static void tcp_cwnd_restart(struct sock *sk, const struct dst_entry *dst)
143 struct tcp_sock *tp = tcp_sk(sk);
144 s32 delta = tcp_time_stamp - tp->lsndtime;
145 u32 restart_cwnd = tcp_init_cwnd(tp, dst);
146 u32 cwnd = tp->snd_cwnd;
148 tcp_ca_event(sk, CA_EVENT_CWND_RESTART);
150 tp->snd_ssthresh = tcp_current_ssthresh(sk);
151 restart_cwnd = min(restart_cwnd, cwnd);
153 while ((delta -= inet_csk(sk)->icsk_rto) > 0 && cwnd > restart_cwnd)
154 cwnd >>= 1;
155 tp->snd_cwnd = max(cwnd, restart_cwnd);
156 tp->snd_cwnd_stamp = tcp_time_stamp;
157 tp->snd_cwnd_used = 0;
160 /* Congestion state accounting after a packet has been sent. */
161 static void tcp_event_data_sent(struct tcp_sock *tp,
162 struct sock *sk)
164 struct inet_connection_sock *icsk = inet_csk(sk);
165 const u32 now = tcp_time_stamp;
166 const struct dst_entry *dst = __sk_dst_get(sk);
168 if (sysctl_tcp_slow_start_after_idle &&
169 (!tp->packets_out && (s32)(now - tp->lsndtime) > icsk->icsk_rto))
170 tcp_cwnd_restart(sk, __sk_dst_get(sk));
172 tp->lsndtime = now;
174 /* If it is a reply for ato after last received
175 * packet, enter pingpong mode.
177 if ((u32)(now - icsk->icsk_ack.lrcvtime) < icsk->icsk_ack.ato &&
178 (!dst || !dst_metric(dst, RTAX_QUICKACK)))
179 icsk->icsk_ack.pingpong = 1;
182 /* Account for an ACK we sent. */
183 static inline void tcp_event_ack_sent(struct sock *sk, unsigned int pkts)
185 tcp_dec_quickack_mode(sk, pkts);
186 inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK);
190 u32 tcp_default_init_rwnd(u32 mss)
192 /* Initial receive window should be twice of TCP_INIT_CWND to
193 * enable proper sending of new unsent data during fast recovery
194 * (RFC 3517, Section 4, NextSeg() rule (2)). Further place a
195 * limit when mss is larger than 1460.
197 u32 init_rwnd = TCP_INIT_CWND * 2;
199 if (mss > 1460)
200 init_rwnd = max((1460 * init_rwnd) / mss, 2U);
201 return init_rwnd;
204 /* Determine a window scaling and initial window to offer.
205 * Based on the assumption that the given amount of space
206 * will be offered. Store the results in the tp structure.
207 * NOTE: for smooth operation initial space offering should
208 * be a multiple of mss if possible. We assume here that mss >= 1.
209 * This MUST be enforced by all callers.
211 void tcp_select_initial_window(int __space, __u32 mss,
212 __u32 *rcv_wnd, __u32 *window_clamp,
213 int wscale_ok, __u8 *rcv_wscale,
214 __u32 init_rcv_wnd)
216 unsigned int space = (__space < 0 ? 0 : __space);
218 /* If no clamp set the clamp to the max possible scaled window */
219 if (*window_clamp == 0)
220 (*window_clamp) = (65535 << 14);
221 space = min(*window_clamp, space);
223 /* Quantize space offering to a multiple of mss if possible. */
224 if (space > mss)
225 space = (space / mss) * mss;
227 /* NOTE: offering an initial window larger than 32767
228 * will break some buggy TCP stacks. If the admin tells us
229 * it is likely we could be speaking with such a buggy stack
230 * we will truncate our initial window offering to 32K-1
231 * unless the remote has sent us a window scaling option,
232 * which we interpret as a sign the remote TCP is not
233 * misinterpreting the window field as a signed quantity.
235 if (sysctl_tcp_workaround_signed_windows)
236 (*rcv_wnd) = min(space, MAX_TCP_WINDOW);
237 else
238 (*rcv_wnd) = space;
240 (*rcv_wscale) = 0;
241 if (wscale_ok) {
242 /* Set window scaling on max possible window
243 * See RFC1323 for an explanation of the limit to 14
245 space = max_t(u32, sysctl_tcp_rmem[2], sysctl_rmem_max);
246 space = min_t(u32, space, *window_clamp);
247 while (space > 65535 && (*rcv_wscale) < 14) {
248 space >>= 1;
249 (*rcv_wscale)++;
253 if (mss > (1 << *rcv_wscale)) {
254 if (!init_rcv_wnd) /* Use default unless specified otherwise */
255 init_rcv_wnd = tcp_default_init_rwnd(mss);
256 *rcv_wnd = min(*rcv_wnd, init_rcv_wnd * mss);
259 /* Set the clamp no higher than max representable value */
260 (*window_clamp) = min(65535U << (*rcv_wscale), *window_clamp);
262 EXPORT_SYMBOL(tcp_select_initial_window);
264 /* Chose a new window to advertise, update state in tcp_sock for the
265 * socket, and return result with RFC1323 scaling applied. The return
266 * value can be stuffed directly into th->window for an outgoing
267 * frame.
269 static u16 tcp_select_window(struct sock *sk)
271 struct tcp_sock *tp = tcp_sk(sk);
272 u32 cur_win = tcp_receive_window(tp);
273 u32 new_win = __tcp_select_window(sk);
275 /* Never shrink the offered window */
276 if (new_win < cur_win) {
277 /* Danger Will Robinson!
278 * Don't update rcv_wup/rcv_wnd here or else
279 * we will not be able to advertise a zero
280 * window in time. --DaveM
282 * Relax Will Robinson.
284 new_win = ALIGN(cur_win, 1 << tp->rx_opt.rcv_wscale);
286 tp->rcv_wnd = new_win;
287 tp->rcv_wup = tp->rcv_nxt;
289 /* Make sure we do not exceed the maximum possible
290 * scaled window.
292 if (!tp->rx_opt.rcv_wscale && sysctl_tcp_workaround_signed_windows)
293 new_win = min(new_win, MAX_TCP_WINDOW);
294 else
295 new_win = min(new_win, (65535U << tp->rx_opt.rcv_wscale));
297 /* RFC1323 scaling applied */
298 new_win >>= tp->rx_opt.rcv_wscale;
300 /* If we advertise zero window, disable fast path. */
301 if (new_win == 0)
302 tp->pred_flags = 0;
304 return new_win;
307 /* Packet ECN state for a SYN-ACK */
308 static inline void TCP_ECN_send_synack(const struct tcp_sock *tp, struct sk_buff *skb)
310 TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_CWR;
311 if (!(tp->ecn_flags & TCP_ECN_OK))
312 TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_ECE;
315 /* Packet ECN state for a SYN. */
316 static inline void TCP_ECN_send_syn(struct sock *sk, struct sk_buff *skb)
318 struct tcp_sock *tp = tcp_sk(sk);
320 tp->ecn_flags = 0;
321 if (sock_net(sk)->ipv4.sysctl_tcp_ecn == 1) {
322 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_ECE | TCPHDR_CWR;
323 tp->ecn_flags = TCP_ECN_OK;
327 static __inline__ void
328 TCP_ECN_make_synack(const struct request_sock *req, struct tcphdr *th)
330 if (inet_rsk(req)->ecn_ok)
331 th->ece = 1;
334 /* Set up ECN state for a packet on a ESTABLISHED socket that is about to
335 * be sent.
337 static inline void TCP_ECN_send(struct sock *sk, struct sk_buff *skb,
338 int tcp_header_len)
340 struct tcp_sock *tp = tcp_sk(sk);
342 if (tp->ecn_flags & TCP_ECN_OK) {
343 /* Not-retransmitted data segment: set ECT and inject CWR. */
344 if (skb->len != tcp_header_len &&
345 !before(TCP_SKB_CB(skb)->seq, tp->snd_nxt)) {
346 INET_ECN_xmit(sk);
347 if (tp->ecn_flags & TCP_ECN_QUEUE_CWR) {
348 tp->ecn_flags &= ~TCP_ECN_QUEUE_CWR;
349 tcp_hdr(skb)->cwr = 1;
350 skb_shinfo(skb)->gso_type |= SKB_GSO_TCP_ECN;
352 } else {
353 /* ACK or retransmitted segment: clear ECT|CE */
354 INET_ECN_dontxmit(sk);
356 if (tp->ecn_flags & TCP_ECN_DEMAND_CWR)
357 tcp_hdr(skb)->ece = 1;
361 /* Constructs common control bits of non-data skb. If SYN/FIN is present,
362 * auto increment end seqno.
364 static void tcp_init_nondata_skb(struct sk_buff *skb, u32 seq, u8 flags)
366 skb->ip_summed = CHECKSUM_PARTIAL;
367 skb->csum = 0;
369 TCP_SKB_CB(skb)->tcp_flags = flags;
370 TCP_SKB_CB(skb)->sacked = 0;
372 skb_shinfo(skb)->gso_segs = 1;
373 skb_shinfo(skb)->gso_size = 0;
374 skb_shinfo(skb)->gso_type = 0;
376 TCP_SKB_CB(skb)->seq = seq;
377 if (flags & (TCPHDR_SYN | TCPHDR_FIN))
378 seq++;
379 TCP_SKB_CB(skb)->end_seq = seq;
382 static inline bool tcp_urg_mode(const struct tcp_sock *tp)
384 return tp->snd_una != tp->snd_up;
387 #define OPTION_SACK_ADVERTISE (1 << 0)
388 #define OPTION_TS (1 << 1)
389 #define OPTION_MD5 (1 << 2)
390 #define OPTION_WSCALE (1 << 3)
391 #define OPTION_FAST_OPEN_COOKIE (1 << 8)
393 struct tcp_out_options {
394 u16 options; /* bit field of OPTION_* */
395 u16 mss; /* 0 to disable */
396 u8 ws; /* window scale, 0 to disable */
397 u8 num_sack_blocks; /* number of SACK blocks to include */
398 u8 hash_size; /* bytes in hash_location */
399 __u8 *hash_location; /* temporary pointer, overloaded */
400 __u32 tsval, tsecr; /* need to include OPTION_TS */
401 struct tcp_fastopen_cookie *fastopen_cookie; /* Fast open cookie */
404 /* Write previously computed TCP options to the packet.
406 * Beware: Something in the Internet is very sensitive to the ordering of
407 * TCP options, we learned this through the hard way, so be careful here.
408 * Luckily we can at least blame others for their non-compliance but from
409 * inter-operatibility perspective it seems that we're somewhat stuck with
410 * the ordering which we have been using if we want to keep working with
411 * those broken things (not that it currently hurts anybody as there isn't
412 * particular reason why the ordering would need to be changed).
414 * At least SACK_PERM as the first option is known to lead to a disaster
415 * (but it may well be that other scenarios fail similarly).
417 static void tcp_options_write(__be32 *ptr, struct tcp_sock *tp,
418 struct tcp_out_options *opts)
420 u16 options = opts->options; /* mungable copy */
422 if (unlikely(OPTION_MD5 & options)) {
423 *ptr++ = htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16) |
424 (TCPOPT_MD5SIG << 8) | TCPOLEN_MD5SIG);
425 /* overload cookie hash location */
426 opts->hash_location = (__u8 *)ptr;
427 ptr += 4;
430 if (unlikely(opts->mss)) {
431 *ptr++ = htonl((TCPOPT_MSS << 24) |
432 (TCPOLEN_MSS << 16) |
433 opts->mss);
436 if (likely(OPTION_TS & options)) {
437 if (unlikely(OPTION_SACK_ADVERTISE & options)) {
438 *ptr++ = htonl((TCPOPT_SACK_PERM << 24) |
439 (TCPOLEN_SACK_PERM << 16) |
440 (TCPOPT_TIMESTAMP << 8) |
441 TCPOLEN_TIMESTAMP);
442 options &= ~OPTION_SACK_ADVERTISE;
443 } else {
444 *ptr++ = htonl((TCPOPT_NOP << 24) |
445 (TCPOPT_NOP << 16) |
446 (TCPOPT_TIMESTAMP << 8) |
447 TCPOLEN_TIMESTAMP);
449 *ptr++ = htonl(opts->tsval);
450 *ptr++ = htonl(opts->tsecr);
453 if (unlikely(OPTION_SACK_ADVERTISE & options)) {
454 *ptr++ = htonl((TCPOPT_NOP << 24) |
455 (TCPOPT_NOP << 16) |
456 (TCPOPT_SACK_PERM << 8) |
457 TCPOLEN_SACK_PERM);
460 if (unlikely(OPTION_WSCALE & options)) {
461 *ptr++ = htonl((TCPOPT_NOP << 24) |
462 (TCPOPT_WINDOW << 16) |
463 (TCPOLEN_WINDOW << 8) |
464 opts->ws);
467 if (unlikely(opts->num_sack_blocks)) {
468 struct tcp_sack_block *sp = tp->rx_opt.dsack ?
469 tp->duplicate_sack : tp->selective_acks;
470 int this_sack;
472 *ptr++ = htonl((TCPOPT_NOP << 24) |
473 (TCPOPT_NOP << 16) |
474 (TCPOPT_SACK << 8) |
475 (TCPOLEN_SACK_BASE + (opts->num_sack_blocks *
476 TCPOLEN_SACK_PERBLOCK)));
478 for (this_sack = 0; this_sack < opts->num_sack_blocks;
479 ++this_sack) {
480 *ptr++ = htonl(sp[this_sack].start_seq);
481 *ptr++ = htonl(sp[this_sack].end_seq);
484 tp->rx_opt.dsack = 0;
487 if (unlikely(OPTION_FAST_OPEN_COOKIE & options)) {
488 struct tcp_fastopen_cookie *foc = opts->fastopen_cookie;
490 *ptr++ = htonl((TCPOPT_EXP << 24) |
491 ((TCPOLEN_EXP_FASTOPEN_BASE + foc->len) << 16) |
492 TCPOPT_FASTOPEN_MAGIC);
494 memcpy(ptr, foc->val, foc->len);
495 if ((foc->len & 3) == 2) {
496 u8 *align = ((u8 *)ptr) + foc->len;
497 align[0] = align[1] = TCPOPT_NOP;
499 ptr += (foc->len + 3) >> 2;
503 /* Compute TCP options for SYN packets. This is not the final
504 * network wire format yet.
506 static unsigned int tcp_syn_options(struct sock *sk, struct sk_buff *skb,
507 struct tcp_out_options *opts,
508 struct tcp_md5sig_key **md5)
510 struct tcp_sock *tp = tcp_sk(sk);
511 unsigned int remaining = MAX_TCP_OPTION_SPACE;
512 struct tcp_fastopen_request *fastopen = tp->fastopen_req;
514 #ifdef CONFIG_TCP_MD5SIG
515 *md5 = tp->af_specific->md5_lookup(sk, sk);
516 if (*md5) {
517 opts->options |= OPTION_MD5;
518 remaining -= TCPOLEN_MD5SIG_ALIGNED;
520 #else
521 *md5 = NULL;
522 #endif
524 /* We always get an MSS option. The option bytes which will be seen in
525 * normal data packets should timestamps be used, must be in the MSS
526 * advertised. But we subtract them from tp->mss_cache so that
527 * calculations in tcp_sendmsg are simpler etc. So account for this
528 * fact here if necessary. If we don't do this correctly, as a
529 * receiver we won't recognize data packets as being full sized when we
530 * should, and thus we won't abide by the delayed ACK rules correctly.
531 * SACKs don't matter, we never delay an ACK when we have any of those
532 * going out. */
533 opts->mss = tcp_advertise_mss(sk);
534 remaining -= TCPOLEN_MSS_ALIGNED;
536 if (likely(sysctl_tcp_timestamps && *md5 == NULL)) {
537 opts->options |= OPTION_TS;
538 opts->tsval = TCP_SKB_CB(skb)->when + tp->tsoffset;
539 opts->tsecr = tp->rx_opt.ts_recent;
540 remaining -= TCPOLEN_TSTAMP_ALIGNED;
542 if (likely(sysctl_tcp_window_scaling)) {
543 opts->ws = tp->rx_opt.rcv_wscale;
544 opts->options |= OPTION_WSCALE;
545 remaining -= TCPOLEN_WSCALE_ALIGNED;
547 if (likely(sysctl_tcp_sack)) {
548 opts->options |= OPTION_SACK_ADVERTISE;
549 if (unlikely(!(OPTION_TS & opts->options)))
550 remaining -= TCPOLEN_SACKPERM_ALIGNED;
553 if (fastopen && fastopen->cookie.len >= 0) {
554 u32 need = TCPOLEN_EXP_FASTOPEN_BASE + fastopen->cookie.len;
555 need = (need + 3) & ~3U; /* Align to 32 bits */
556 if (remaining >= need) {
557 opts->options |= OPTION_FAST_OPEN_COOKIE;
558 opts->fastopen_cookie = &fastopen->cookie;
559 remaining -= need;
560 tp->syn_fastopen = 1;
564 return MAX_TCP_OPTION_SPACE - remaining;
567 /* Set up TCP options for SYN-ACKs. */
568 static unsigned int tcp_synack_options(struct sock *sk,
569 struct request_sock *req,
570 unsigned int mss, struct sk_buff *skb,
571 struct tcp_out_options *opts,
572 struct tcp_md5sig_key **md5,
573 struct tcp_fastopen_cookie *foc)
575 struct inet_request_sock *ireq = inet_rsk(req);
576 unsigned int remaining = MAX_TCP_OPTION_SPACE;
578 #ifdef CONFIG_TCP_MD5SIG
579 *md5 = tcp_rsk(req)->af_specific->md5_lookup(sk, req);
580 if (*md5) {
581 opts->options |= OPTION_MD5;
582 remaining -= TCPOLEN_MD5SIG_ALIGNED;
584 /* We can't fit any SACK blocks in a packet with MD5 + TS
585 * options. There was discussion about disabling SACK
586 * rather than TS in order to fit in better with old,
587 * buggy kernels, but that was deemed to be unnecessary.
589 ireq->tstamp_ok &= !ireq->sack_ok;
591 #else
592 *md5 = NULL;
593 #endif
595 /* We always send an MSS option. */
596 opts->mss = mss;
597 remaining -= TCPOLEN_MSS_ALIGNED;
599 if (likely(ireq->wscale_ok)) {
600 opts->ws = ireq->rcv_wscale;
601 opts->options |= OPTION_WSCALE;
602 remaining -= TCPOLEN_WSCALE_ALIGNED;
604 if (likely(ireq->tstamp_ok)) {
605 opts->options |= OPTION_TS;
606 opts->tsval = TCP_SKB_CB(skb)->when;
607 opts->tsecr = req->ts_recent;
608 remaining -= TCPOLEN_TSTAMP_ALIGNED;
610 if (likely(ireq->sack_ok)) {
611 opts->options |= OPTION_SACK_ADVERTISE;
612 if (unlikely(!ireq->tstamp_ok))
613 remaining -= TCPOLEN_SACKPERM_ALIGNED;
615 if (foc != NULL) {
616 u32 need = TCPOLEN_EXP_FASTOPEN_BASE + foc->len;
617 need = (need + 3) & ~3U; /* Align to 32 bits */
618 if (remaining >= need) {
619 opts->options |= OPTION_FAST_OPEN_COOKIE;
620 opts->fastopen_cookie = foc;
621 remaining -= need;
625 return MAX_TCP_OPTION_SPACE - remaining;
628 /* Compute TCP options for ESTABLISHED sockets. This is not the
629 * final wire format yet.
631 static unsigned int tcp_established_options(struct sock *sk, struct sk_buff *skb,
632 struct tcp_out_options *opts,
633 struct tcp_md5sig_key **md5)
635 struct tcp_skb_cb *tcb = skb ? TCP_SKB_CB(skb) : NULL;
636 struct tcp_sock *tp = tcp_sk(sk);
637 unsigned int size = 0;
638 unsigned int eff_sacks;
640 opts->options = 0;
642 #ifdef CONFIG_TCP_MD5SIG
643 *md5 = tp->af_specific->md5_lookup(sk, sk);
644 if (unlikely(*md5)) {
645 opts->options |= OPTION_MD5;
646 size += TCPOLEN_MD5SIG_ALIGNED;
648 #else
649 *md5 = NULL;
650 #endif
652 if (likely(tp->rx_opt.tstamp_ok)) {
653 opts->options |= OPTION_TS;
654 opts->tsval = tcb ? tcb->when + tp->tsoffset : 0;
655 opts->tsecr = tp->rx_opt.ts_recent;
656 size += TCPOLEN_TSTAMP_ALIGNED;
659 eff_sacks = tp->rx_opt.num_sacks + tp->rx_opt.dsack;
660 if (unlikely(eff_sacks)) {
661 const unsigned int remaining = MAX_TCP_OPTION_SPACE - size;
662 opts->num_sack_blocks =
663 min_t(unsigned int, eff_sacks,
664 (remaining - TCPOLEN_SACK_BASE_ALIGNED) /
665 TCPOLEN_SACK_PERBLOCK);
666 size += TCPOLEN_SACK_BASE_ALIGNED +
667 opts->num_sack_blocks * TCPOLEN_SACK_PERBLOCK;
670 return size;
674 /* TCP SMALL QUEUES (TSQ)
676 * TSQ goal is to keep small amount of skbs per tcp flow in tx queues (qdisc+dev)
677 * to reduce RTT and bufferbloat.
678 * We do this using a special skb destructor (tcp_wfree).
680 * Its important tcp_wfree() can be replaced by sock_wfree() in the event skb
681 * needs to be reallocated in a driver.
682 * The invariant being skb->truesize substracted from sk->sk_wmem_alloc
684 * Since transmit from skb destructor is forbidden, we use a tasklet
685 * to process all sockets that eventually need to send more skbs.
686 * We use one tasklet per cpu, with its own queue of sockets.
688 struct tsq_tasklet {
689 struct tasklet_struct tasklet;
690 struct list_head head; /* queue of tcp sockets */
692 static DEFINE_PER_CPU(struct tsq_tasklet, tsq_tasklet);
694 static void tcp_tsq_handler(struct sock *sk)
696 if ((1 << sk->sk_state) &
697 (TCPF_ESTABLISHED | TCPF_FIN_WAIT1 | TCPF_CLOSING |
698 TCPF_CLOSE_WAIT | TCPF_LAST_ACK))
699 tcp_write_xmit(sk, tcp_current_mss(sk), tcp_sk(sk)->nonagle,
700 0, GFP_ATOMIC);
703 * One tasklest per cpu tries to send more skbs.
704 * We run in tasklet context but need to disable irqs when
705 * transfering tsq->head because tcp_wfree() might
706 * interrupt us (non NAPI drivers)
708 static void tcp_tasklet_func(unsigned long data)
710 struct tsq_tasklet *tsq = (struct tsq_tasklet *)data;
711 LIST_HEAD(list);
712 unsigned long flags;
713 struct list_head *q, *n;
714 struct tcp_sock *tp;
715 struct sock *sk;
717 local_irq_save(flags);
718 list_splice_init(&tsq->head, &list);
719 local_irq_restore(flags);
721 list_for_each_safe(q, n, &list) {
722 tp = list_entry(q, struct tcp_sock, tsq_node);
723 list_del(&tp->tsq_node);
725 sk = (struct sock *)tp;
726 bh_lock_sock(sk);
728 if (!sock_owned_by_user(sk)) {
729 tcp_tsq_handler(sk);
730 } else {
731 /* defer the work to tcp_release_cb() */
732 set_bit(TCP_TSQ_DEFERRED, &tp->tsq_flags);
734 bh_unlock_sock(sk);
736 clear_bit(TSQ_QUEUED, &tp->tsq_flags);
737 sk_free(sk);
741 #define TCP_DEFERRED_ALL ((1UL << TCP_TSQ_DEFERRED) | \
742 (1UL << TCP_WRITE_TIMER_DEFERRED) | \
743 (1UL << TCP_DELACK_TIMER_DEFERRED) | \
744 (1UL << TCP_MTU_REDUCED_DEFERRED))
746 * tcp_release_cb - tcp release_sock() callback
747 * @sk: socket
749 * called from release_sock() to perform protocol dependent
750 * actions before socket release.
752 void tcp_release_cb(struct sock *sk)
754 struct tcp_sock *tp = tcp_sk(sk);
755 unsigned long flags, nflags;
757 /* perform an atomic operation only if at least one flag is set */
758 do {
759 flags = tp->tsq_flags;
760 if (!(flags & TCP_DEFERRED_ALL))
761 return;
762 nflags = flags & ~TCP_DEFERRED_ALL;
763 } while (cmpxchg(&tp->tsq_flags, flags, nflags) != flags);
765 if (flags & (1UL << TCP_TSQ_DEFERRED))
766 tcp_tsq_handler(sk);
768 /* Here begins the tricky part :
769 * We are called from release_sock() with :
770 * 1) BH disabled
771 * 2) sk_lock.slock spinlock held
772 * 3) socket owned by us (sk->sk_lock.owned == 1)
774 * But following code is meant to be called from BH handlers,
775 * so we should keep BH disabled, but early release socket ownership
777 sock_release_ownership(sk);
779 if (flags & (1UL << TCP_WRITE_TIMER_DEFERRED)) {
780 tcp_write_timer_handler(sk);
781 __sock_put(sk);
783 if (flags & (1UL << TCP_DELACK_TIMER_DEFERRED)) {
784 tcp_delack_timer_handler(sk);
785 __sock_put(sk);
787 if (flags & (1UL << TCP_MTU_REDUCED_DEFERRED)) {
788 sk->sk_prot->mtu_reduced(sk);
789 __sock_put(sk);
792 EXPORT_SYMBOL(tcp_release_cb);
794 void __init tcp_tasklet_init(void)
796 int i;
798 for_each_possible_cpu(i) {
799 struct tsq_tasklet *tsq = &per_cpu(tsq_tasklet, i);
801 INIT_LIST_HEAD(&tsq->head);
802 tasklet_init(&tsq->tasklet,
803 tcp_tasklet_func,
804 (unsigned long)tsq);
809 * Write buffer destructor automatically called from kfree_skb.
810 * We cant xmit new skbs from this context, as we might already
811 * hold qdisc lock.
813 void tcp_wfree(struct sk_buff *skb)
815 struct sock *sk = skb->sk;
816 struct tcp_sock *tp = tcp_sk(sk);
818 if (test_and_clear_bit(TSQ_THROTTLED, &tp->tsq_flags) &&
819 !test_and_set_bit(TSQ_QUEUED, &tp->tsq_flags)) {
820 unsigned long flags;
821 struct tsq_tasklet *tsq;
823 /* Keep a ref on socket.
824 * This last ref will be released in tcp_tasklet_func()
826 atomic_sub(skb->truesize - 1, &sk->sk_wmem_alloc);
828 /* queue this socket to tasklet queue */
829 local_irq_save(flags);
830 tsq = &__get_cpu_var(tsq_tasklet);
831 list_add(&tp->tsq_node, &tsq->head);
832 tasklet_schedule(&tsq->tasklet);
833 local_irq_restore(flags);
834 } else {
835 sock_wfree(skb);
839 /* This routine actually transmits TCP packets queued in by
840 * tcp_do_sendmsg(). This is used by both the initial
841 * transmission and possible later retransmissions.
842 * All SKB's seen here are completely headerless. It is our
843 * job to build the TCP header, and pass the packet down to
844 * IP so it can do the same plus pass the packet off to the
845 * device.
847 * We are working here with either a clone of the original
848 * SKB, or a fresh unique copy made by the retransmit engine.
850 static int tcp_transmit_skb(struct sock *sk, struct sk_buff *skb, int clone_it,
851 gfp_t gfp_mask)
853 const struct inet_connection_sock *icsk = inet_csk(sk);
854 struct inet_sock *inet;
855 struct tcp_sock *tp;
856 struct tcp_skb_cb *tcb;
857 struct tcp_out_options opts;
858 unsigned int tcp_options_size, tcp_header_size;
859 struct tcp_md5sig_key *md5;
860 struct tcphdr *th;
861 int err;
863 BUG_ON(!skb || !tcp_skb_pcount(skb));
865 /* If congestion control is doing timestamping, we must
866 * take such a timestamp before we potentially clone/copy.
868 if (icsk->icsk_ca_ops->flags & TCP_CONG_RTT_STAMP)
869 __net_timestamp(skb);
871 if (likely(clone_it)) {
872 const struct sk_buff *fclone = skb + 1;
874 if (unlikely(skb->fclone == SKB_FCLONE_ORIG &&
875 fclone->fclone == SKB_FCLONE_CLONE))
876 NET_INC_STATS_BH(sock_net(sk),
877 LINUX_MIB_TCPSPURIOUS_RTX_HOSTQUEUES);
879 if (unlikely(skb_cloned(skb)))
880 skb = pskb_copy(skb, gfp_mask);
881 else
882 skb = skb_clone(skb, gfp_mask);
883 if (unlikely(!skb))
884 return -ENOBUFS;
887 inet = inet_sk(sk);
888 tp = tcp_sk(sk);
889 tcb = TCP_SKB_CB(skb);
890 memset(&opts, 0, sizeof(opts));
892 if (unlikely(tcb->tcp_flags & TCPHDR_SYN))
893 tcp_options_size = tcp_syn_options(sk, skb, &opts, &md5);
894 else
895 tcp_options_size = tcp_established_options(sk, skb, &opts,
896 &md5);
897 tcp_header_size = tcp_options_size + sizeof(struct tcphdr);
899 if (tcp_packets_in_flight(tp) == 0)
900 tcp_ca_event(sk, CA_EVENT_TX_START);
902 /* if no packet is in qdisc/device queue, then allow XPS to select
903 * another queue.
905 skb->ooo_okay = sk_wmem_alloc_get(sk) == 0;
907 skb_push(skb, tcp_header_size);
908 skb_reset_transport_header(skb);
910 skb_orphan(skb);
911 skb->sk = sk;
912 skb->destructor = tcp_wfree;
913 atomic_add(skb->truesize, &sk->sk_wmem_alloc);
915 /* Build TCP header and checksum it. */
916 th = tcp_hdr(skb);
917 th->source = inet->inet_sport;
918 th->dest = inet->inet_dport;
919 th->seq = htonl(tcb->seq);
920 th->ack_seq = htonl(tp->rcv_nxt);
921 *(((__be16 *)th) + 6) = htons(((tcp_header_size >> 2) << 12) |
922 tcb->tcp_flags);
924 if (unlikely(tcb->tcp_flags & TCPHDR_SYN)) {
925 /* RFC1323: The window in SYN & SYN/ACK segments
926 * is never scaled.
928 th->window = htons(min(tp->rcv_wnd, 65535U));
929 } else {
930 th->window = htons(tcp_select_window(sk));
932 th->check = 0;
933 th->urg_ptr = 0;
935 /* The urg_mode check is necessary during a below snd_una win probe */
936 if (unlikely(tcp_urg_mode(tp) && before(tcb->seq, tp->snd_up))) {
937 if (before(tp->snd_up, tcb->seq + 0x10000)) {
938 th->urg_ptr = htons(tp->snd_up - tcb->seq);
939 th->urg = 1;
940 } else if (after(tcb->seq + 0xFFFF, tp->snd_nxt)) {
941 th->urg_ptr = htons(0xFFFF);
942 th->urg = 1;
946 tcp_options_write((__be32 *)(th + 1), tp, &opts);
947 if (likely((tcb->tcp_flags & TCPHDR_SYN) == 0))
948 TCP_ECN_send(sk, skb, tcp_header_size);
950 #ifdef CONFIG_TCP_MD5SIG
951 /* Calculate the MD5 hash, as we have all we need now */
952 if (md5) {
953 sk_nocaps_add(sk, NETIF_F_GSO_MASK);
954 tp->af_specific->calc_md5_hash(opts.hash_location,
955 md5, sk, NULL, skb);
957 #endif
959 icsk->icsk_af_ops->send_check(sk, skb);
961 if (likely(tcb->tcp_flags & TCPHDR_ACK))
962 tcp_event_ack_sent(sk, tcp_skb_pcount(skb));
964 if (skb->len != tcp_header_size)
965 tcp_event_data_sent(tp, sk);
967 if (after(tcb->end_seq, tp->snd_nxt) || tcb->seq == tcb->end_seq)
968 TCP_ADD_STATS(sock_net(sk), TCP_MIB_OUTSEGS,
969 tcp_skb_pcount(skb));
971 err = icsk->icsk_af_ops->queue_xmit(skb, &inet->cork.fl);
972 if (likely(err <= 0))
973 return err;
975 tcp_enter_cwr(sk, 1);
977 return net_xmit_eval(err);
980 /* This routine just queues the buffer for sending.
982 * NOTE: probe0 timer is not checked, do not forget tcp_push_pending_frames,
983 * otherwise socket can stall.
985 static void tcp_queue_skb(struct sock *sk, struct sk_buff *skb)
987 struct tcp_sock *tp = tcp_sk(sk);
989 /* Advance write_seq and place onto the write_queue. */
990 tp->write_seq = TCP_SKB_CB(skb)->end_seq;
991 skb_header_release(skb);
992 tcp_add_write_queue_tail(sk, skb);
993 sk->sk_wmem_queued += skb->truesize;
994 sk_mem_charge(sk, skb->truesize);
997 /* Initialize TSO segments for a packet. */
998 static void tcp_set_skb_tso_segs(const struct sock *sk, struct sk_buff *skb,
999 unsigned int mss_now)
1001 /* Make sure we own this skb before messing gso_size/gso_segs */
1002 WARN_ON_ONCE(skb_cloned(skb));
1004 if (skb->len <= mss_now || skb->ip_summed == CHECKSUM_NONE) {
1005 /* Avoid the costly divide in the normal
1006 * non-TSO case.
1008 skb_shinfo(skb)->gso_segs = 1;
1009 skb_shinfo(skb)->gso_size = 0;
1010 skb_shinfo(skb)->gso_type = 0;
1011 } else {
1012 skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(skb->len, mss_now);
1013 skb_shinfo(skb)->gso_size = mss_now;
1014 skb_shinfo(skb)->gso_type = sk->sk_gso_type;
1018 /* When a modification to fackets out becomes necessary, we need to check
1019 * skb is counted to fackets_out or not.
1021 static void tcp_adjust_fackets_out(struct sock *sk, const struct sk_buff *skb,
1022 int decr)
1024 struct tcp_sock *tp = tcp_sk(sk);
1026 if (!tp->sacked_out || tcp_is_reno(tp))
1027 return;
1029 if (after(tcp_highest_sack_seq(tp), TCP_SKB_CB(skb)->seq))
1030 tp->fackets_out -= decr;
1033 /* Pcount in the middle of the write queue got changed, we need to do various
1034 * tweaks to fix counters
1036 static void tcp_adjust_pcount(struct sock *sk, const struct sk_buff *skb, int decr)
1038 struct tcp_sock *tp = tcp_sk(sk);
1040 tp->packets_out -= decr;
1042 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)
1043 tp->sacked_out -= decr;
1044 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS)
1045 tp->retrans_out -= decr;
1046 if (TCP_SKB_CB(skb)->sacked & TCPCB_LOST)
1047 tp->lost_out -= decr;
1049 /* Reno case is special. Sigh... */
1050 if (tcp_is_reno(tp) && decr > 0)
1051 tp->sacked_out -= min_t(u32, tp->sacked_out, decr);
1053 tcp_adjust_fackets_out(sk, skb, decr);
1055 if (tp->lost_skb_hint &&
1056 before(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(tp->lost_skb_hint)->seq) &&
1057 (tcp_is_fack(tp) || (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)))
1058 tp->lost_cnt_hint -= decr;
1060 tcp_verify_left_out(tp);
1063 /* Function to create two new TCP segments. Shrinks the given segment
1064 * to the specified size and appends a new segment with the rest of the
1065 * packet to the list. This won't be called frequently, I hope.
1066 * Remember, these are still headerless SKBs at this point.
1068 int tcp_fragment(struct sock *sk, struct sk_buff *skb, u32 len,
1069 unsigned int mss_now)
1071 struct tcp_sock *tp = tcp_sk(sk);
1072 struct sk_buff *buff;
1073 int nsize, old_factor;
1074 int nlen;
1075 u8 flags;
1077 if (WARN_ON(len > skb->len))
1078 return -EINVAL;
1080 nsize = skb_headlen(skb) - len;
1081 if (nsize < 0)
1082 nsize = 0;
1084 if (skb_unclone(skb, GFP_ATOMIC))
1085 return -ENOMEM;
1087 /* Get a new skb... force flag on. */
1088 buff = sk_stream_alloc_skb(sk, nsize, GFP_ATOMIC);
1089 if (buff == NULL)
1090 return -ENOMEM; /* We'll just try again later. */
1092 sk->sk_wmem_queued += buff->truesize;
1093 sk_mem_charge(sk, buff->truesize);
1094 nlen = skb->len - len - nsize;
1095 buff->truesize += nlen;
1096 skb->truesize -= nlen;
1098 /* Correct the sequence numbers. */
1099 TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len;
1100 TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq;
1101 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq;
1103 /* PSH and FIN should only be set in the second packet. */
1104 flags = TCP_SKB_CB(skb)->tcp_flags;
1105 TCP_SKB_CB(skb)->tcp_flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH);
1106 TCP_SKB_CB(buff)->tcp_flags = flags;
1107 TCP_SKB_CB(buff)->sacked = TCP_SKB_CB(skb)->sacked;
1109 if (!skb_shinfo(skb)->nr_frags && skb->ip_summed != CHECKSUM_PARTIAL) {
1110 /* Copy and checksum data tail into the new buffer. */
1111 buff->csum = csum_partial_copy_nocheck(skb->data + len,
1112 skb_put(buff, nsize),
1113 nsize, 0);
1115 skb_trim(skb, len);
1117 skb->csum = csum_block_sub(skb->csum, buff->csum, len);
1118 } else {
1119 skb->ip_summed = CHECKSUM_PARTIAL;
1120 skb_split(skb, buff, len);
1123 buff->ip_summed = skb->ip_summed;
1125 /* Looks stupid, but our code really uses when of
1126 * skbs, which it never sent before. --ANK
1128 TCP_SKB_CB(buff)->when = TCP_SKB_CB(skb)->when;
1129 buff->tstamp = skb->tstamp;
1131 old_factor = tcp_skb_pcount(skb);
1133 /* Fix up tso_factor for both original and new SKB. */
1134 tcp_set_skb_tso_segs(sk, skb, mss_now);
1135 tcp_set_skb_tso_segs(sk, buff, mss_now);
1137 /* If this packet has been sent out already, we must
1138 * adjust the various packet counters.
1140 if (!before(tp->snd_nxt, TCP_SKB_CB(buff)->end_seq)) {
1141 int diff = old_factor - tcp_skb_pcount(skb) -
1142 tcp_skb_pcount(buff);
1144 if (diff)
1145 tcp_adjust_pcount(sk, skb, diff);
1148 /* Link BUFF into the send queue. */
1149 skb_header_release(buff);
1150 tcp_insert_write_queue_after(skb, buff, sk);
1152 return 0;
1155 /* This is similar to __pskb_pull_head() (it will go to core/skbuff.c
1156 * eventually). The difference is that pulled data not copied, but
1157 * immediately discarded.
1159 static void __pskb_trim_head(struct sk_buff *skb, int len)
1161 int i, k, eat;
1163 eat = min_t(int, len, skb_headlen(skb));
1164 if (eat) {
1165 __skb_pull(skb, eat);
1166 len -= eat;
1167 if (!len)
1168 return;
1170 eat = len;
1171 k = 0;
1172 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1173 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
1175 if (size <= eat) {
1176 skb_frag_unref(skb, i);
1177 eat -= size;
1178 } else {
1179 skb_shinfo(skb)->frags[k] = skb_shinfo(skb)->frags[i];
1180 if (eat) {
1181 skb_shinfo(skb)->frags[k].page_offset += eat;
1182 skb_frag_size_sub(&skb_shinfo(skb)->frags[k], eat);
1183 eat = 0;
1185 k++;
1188 skb_shinfo(skb)->nr_frags = k;
1190 skb_reset_tail_pointer(skb);
1191 skb->data_len -= len;
1192 skb->len = skb->data_len;
1195 /* Remove acked data from a packet in the transmit queue. */
1196 int tcp_trim_head(struct sock *sk, struct sk_buff *skb, u32 len)
1198 if (skb_unclone(skb, GFP_ATOMIC))
1199 return -ENOMEM;
1201 __pskb_trim_head(skb, len);
1203 TCP_SKB_CB(skb)->seq += len;
1204 skb->ip_summed = CHECKSUM_PARTIAL;
1206 skb->truesize -= len;
1207 sk->sk_wmem_queued -= len;
1208 sk_mem_uncharge(sk, len);
1209 sock_set_flag(sk, SOCK_QUEUE_SHRUNK);
1211 /* Any change of skb->len requires recalculation of tso factor. */
1212 if (tcp_skb_pcount(skb) > 1)
1213 tcp_set_skb_tso_segs(sk, skb, tcp_skb_mss(skb));
1215 return 0;
1218 /* Calculate MSS not accounting any TCP options. */
1219 static inline int __tcp_mtu_to_mss(struct sock *sk, int pmtu)
1221 const struct tcp_sock *tp = tcp_sk(sk);
1222 const struct inet_connection_sock *icsk = inet_csk(sk);
1223 int mss_now;
1225 /* Calculate base mss without TCP options:
1226 It is MMS_S - sizeof(tcphdr) of rfc1122
1228 mss_now = pmtu - icsk->icsk_af_ops->net_header_len - sizeof(struct tcphdr);
1230 /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */
1231 if (icsk->icsk_af_ops->net_frag_header_len) {
1232 const struct dst_entry *dst = __sk_dst_get(sk);
1234 if (dst && dst_allfrag(dst))
1235 mss_now -= icsk->icsk_af_ops->net_frag_header_len;
1238 /* Clamp it (mss_clamp does not include tcp options) */
1239 if (mss_now > tp->rx_opt.mss_clamp)
1240 mss_now = tp->rx_opt.mss_clamp;
1242 /* Now subtract optional transport overhead */
1243 mss_now -= icsk->icsk_ext_hdr_len;
1245 /* Then reserve room for full set of TCP options and 8 bytes of data */
1246 if (mss_now < 48)
1247 mss_now = 48;
1248 return mss_now;
1251 /* Calculate MSS. Not accounting for SACKs here. */
1252 int tcp_mtu_to_mss(struct sock *sk, int pmtu)
1254 /* Subtract TCP options size, not including SACKs */
1255 return __tcp_mtu_to_mss(sk, pmtu) -
1256 (tcp_sk(sk)->tcp_header_len - sizeof(struct tcphdr));
1259 /* Inverse of above */
1260 int tcp_mss_to_mtu(struct sock *sk, int mss)
1262 const struct tcp_sock *tp = tcp_sk(sk);
1263 const struct inet_connection_sock *icsk = inet_csk(sk);
1264 int mtu;
1266 mtu = mss +
1267 tp->tcp_header_len +
1268 icsk->icsk_ext_hdr_len +
1269 icsk->icsk_af_ops->net_header_len;
1271 /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */
1272 if (icsk->icsk_af_ops->net_frag_header_len) {
1273 const struct dst_entry *dst = __sk_dst_get(sk);
1275 if (dst && dst_allfrag(dst))
1276 mtu += icsk->icsk_af_ops->net_frag_header_len;
1278 return mtu;
1281 /* MTU probing init per socket */
1282 void tcp_mtup_init(struct sock *sk)
1284 struct tcp_sock *tp = tcp_sk(sk);
1285 struct inet_connection_sock *icsk = inet_csk(sk);
1287 icsk->icsk_mtup.enabled = sysctl_tcp_mtu_probing > 1;
1288 icsk->icsk_mtup.search_high = tp->rx_opt.mss_clamp + sizeof(struct tcphdr) +
1289 icsk->icsk_af_ops->net_header_len;
1290 icsk->icsk_mtup.search_low = tcp_mss_to_mtu(sk, sysctl_tcp_base_mss);
1291 icsk->icsk_mtup.probe_size = 0;
1293 EXPORT_SYMBOL(tcp_mtup_init);
1295 /* This function synchronize snd mss to current pmtu/exthdr set.
1297 tp->rx_opt.user_mss is mss set by user by TCP_MAXSEG. It does NOT counts
1298 for TCP options, but includes only bare TCP header.
1300 tp->rx_opt.mss_clamp is mss negotiated at connection setup.
1301 It is minimum of user_mss and mss received with SYN.
1302 It also does not include TCP options.
1304 inet_csk(sk)->icsk_pmtu_cookie is last pmtu, seen by this function.
1306 tp->mss_cache is current effective sending mss, including
1307 all tcp options except for SACKs. It is evaluated,
1308 taking into account current pmtu, but never exceeds
1309 tp->rx_opt.mss_clamp.
1311 NOTE1. rfc1122 clearly states that advertised MSS
1312 DOES NOT include either tcp or ip options.
1314 NOTE2. inet_csk(sk)->icsk_pmtu_cookie and tp->mss_cache
1315 are READ ONLY outside this function. --ANK (980731)
1317 unsigned int tcp_sync_mss(struct sock *sk, u32 pmtu)
1319 struct tcp_sock *tp = tcp_sk(sk);
1320 struct inet_connection_sock *icsk = inet_csk(sk);
1321 int mss_now;
1323 if (icsk->icsk_mtup.search_high > pmtu)
1324 icsk->icsk_mtup.search_high = pmtu;
1326 mss_now = tcp_mtu_to_mss(sk, pmtu);
1327 mss_now = tcp_bound_to_half_wnd(tp, mss_now);
1329 /* And store cached results */
1330 icsk->icsk_pmtu_cookie = pmtu;
1331 if (icsk->icsk_mtup.enabled)
1332 mss_now = min(mss_now, tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_low));
1333 tp->mss_cache = mss_now;
1335 return mss_now;
1337 EXPORT_SYMBOL(tcp_sync_mss);
1339 /* Compute the current effective MSS, taking SACKs and IP options,
1340 * and even PMTU discovery events into account.
1342 unsigned int tcp_current_mss(struct sock *sk)
1344 const struct tcp_sock *tp = tcp_sk(sk);
1345 const struct dst_entry *dst = __sk_dst_get(sk);
1346 u32 mss_now;
1347 unsigned int header_len;
1348 struct tcp_out_options opts;
1349 struct tcp_md5sig_key *md5;
1351 mss_now = tp->mss_cache;
1353 if (dst) {
1354 u32 mtu = dst_mtu(dst);
1355 if (mtu != inet_csk(sk)->icsk_pmtu_cookie)
1356 mss_now = tcp_sync_mss(sk, mtu);
1359 header_len = tcp_established_options(sk, NULL, &opts, &md5) +
1360 sizeof(struct tcphdr);
1361 /* The mss_cache is sized based on tp->tcp_header_len, which assumes
1362 * some common options. If this is an odd packet (because we have SACK
1363 * blocks etc) then our calculated header_len will be different, and
1364 * we have to adjust mss_now correspondingly */
1365 if (header_len != tp->tcp_header_len) {
1366 int delta = (int) header_len - tp->tcp_header_len;
1367 mss_now -= delta;
1370 return mss_now;
1373 /* Congestion window validation. (RFC2861) */
1374 static void tcp_cwnd_validate(struct sock *sk)
1376 struct tcp_sock *tp = tcp_sk(sk);
1378 if (tp->packets_out >= tp->snd_cwnd) {
1379 /* Network is feed fully. */
1380 tp->snd_cwnd_used = 0;
1381 tp->snd_cwnd_stamp = tcp_time_stamp;
1382 } else {
1383 /* Network starves. */
1384 if (tp->packets_out > tp->snd_cwnd_used)
1385 tp->snd_cwnd_used = tp->packets_out;
1387 if (sysctl_tcp_slow_start_after_idle &&
1388 (s32)(tcp_time_stamp - tp->snd_cwnd_stamp) >= inet_csk(sk)->icsk_rto)
1389 tcp_cwnd_application_limited(sk);
1393 /* Returns the portion of skb which can be sent right away without
1394 * introducing MSS oddities to segment boundaries. In rare cases where
1395 * mss_now != mss_cache, we will request caller to create a small skb
1396 * per input skb which could be mostly avoided here (if desired).
1398 * We explicitly want to create a request for splitting write queue tail
1399 * to a small skb for Nagle purposes while avoiding unnecessary modulos,
1400 * thus all the complexity (cwnd_len is always MSS multiple which we
1401 * return whenever allowed by the other factors). Basically we need the
1402 * modulo only when the receiver window alone is the limiting factor or
1403 * when we would be allowed to send the split-due-to-Nagle skb fully.
1405 static unsigned int tcp_mss_split_point(const struct sock *sk, const struct sk_buff *skb,
1406 unsigned int mss_now, unsigned int max_segs)
1408 const struct tcp_sock *tp = tcp_sk(sk);
1409 u32 needed, window, max_len;
1411 window = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq;
1412 max_len = mss_now * max_segs;
1414 if (likely(max_len <= window && skb != tcp_write_queue_tail(sk)))
1415 return max_len;
1417 needed = min(skb->len, window);
1419 if (max_len <= needed)
1420 return max_len;
1422 return needed - needed % mss_now;
1425 /* Can at least one segment of SKB be sent right now, according to the
1426 * congestion window rules? If so, return how many segments are allowed.
1428 static inline unsigned int tcp_cwnd_test(const struct tcp_sock *tp,
1429 const struct sk_buff *skb)
1431 u32 in_flight, cwnd;
1433 /* Don't be strict about the congestion window for the final FIN. */
1434 if ((TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN) &&
1435 tcp_skb_pcount(skb) == 1)
1436 return 1;
1438 in_flight = tcp_packets_in_flight(tp);
1439 cwnd = tp->snd_cwnd;
1440 if (in_flight < cwnd)
1441 return (cwnd - in_flight);
1443 return 0;
1446 /* Initialize TSO state of a skb.
1447 * This must be invoked the first time we consider transmitting
1448 * SKB onto the wire.
1450 static int tcp_init_tso_segs(const struct sock *sk, struct sk_buff *skb,
1451 unsigned int mss_now)
1453 int tso_segs = tcp_skb_pcount(skb);
1455 if (!tso_segs || (tso_segs > 1 && tcp_skb_mss(skb) != mss_now)) {
1456 tcp_set_skb_tso_segs(sk, skb, mss_now);
1457 tso_segs = tcp_skb_pcount(skb);
1459 return tso_segs;
1462 /* Minshall's variant of the Nagle send check. */
1463 static inline bool tcp_minshall_check(const struct tcp_sock *tp)
1465 return after(tp->snd_sml, tp->snd_una) &&
1466 !after(tp->snd_sml, tp->snd_nxt);
1469 /* Return false, if packet can be sent now without violation Nagle's rules:
1470 * 1. It is full sized.
1471 * 2. Or it contains FIN. (already checked by caller)
1472 * 3. Or TCP_CORK is not set, and TCP_NODELAY is set.
1473 * 4. Or TCP_CORK is not set, and all sent packets are ACKed.
1474 * With Minshall's modification: all sent small packets are ACKed.
1476 static inline bool tcp_nagle_check(const struct tcp_sock *tp,
1477 const struct sk_buff *skb,
1478 unsigned int mss_now, int nonagle)
1480 return skb->len < mss_now &&
1481 ((nonagle & TCP_NAGLE_CORK) ||
1482 (!nonagle && tp->packets_out && tcp_minshall_check(tp)));
1485 /* Return true if the Nagle test allows this packet to be
1486 * sent now.
1488 static inline bool tcp_nagle_test(const struct tcp_sock *tp, const struct sk_buff *skb,
1489 unsigned int cur_mss, int nonagle)
1491 /* Nagle rule does not apply to frames, which sit in the middle of the
1492 * write_queue (they have no chances to get new data).
1494 * This is implemented in the callers, where they modify the 'nonagle'
1495 * argument based upon the location of SKB in the send queue.
1497 if (nonagle & TCP_NAGLE_PUSH)
1498 return true;
1500 /* Don't use the nagle rule for urgent data (or for the final FIN). */
1501 if (tcp_urg_mode(tp) || (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN))
1502 return true;
1504 if (!tcp_nagle_check(tp, skb, cur_mss, nonagle))
1505 return true;
1507 return false;
1510 /* Does at least the first segment of SKB fit into the send window? */
1511 static bool tcp_snd_wnd_test(const struct tcp_sock *tp,
1512 const struct sk_buff *skb,
1513 unsigned int cur_mss)
1515 u32 end_seq = TCP_SKB_CB(skb)->end_seq;
1517 if (skb->len > cur_mss)
1518 end_seq = TCP_SKB_CB(skb)->seq + cur_mss;
1520 return !after(end_seq, tcp_wnd_end(tp));
1523 /* This checks if the data bearing packet SKB (usually tcp_send_head(sk))
1524 * should be put on the wire right now. If so, it returns the number of
1525 * packets allowed by the congestion window.
1527 static unsigned int tcp_snd_test(const struct sock *sk, struct sk_buff *skb,
1528 unsigned int cur_mss, int nonagle)
1530 const struct tcp_sock *tp = tcp_sk(sk);
1531 unsigned int cwnd_quota;
1533 tcp_init_tso_segs(sk, skb, cur_mss);
1535 if (!tcp_nagle_test(tp, skb, cur_mss, nonagle))
1536 return 0;
1538 cwnd_quota = tcp_cwnd_test(tp, skb);
1539 if (cwnd_quota && !tcp_snd_wnd_test(tp, skb, cur_mss))
1540 cwnd_quota = 0;
1542 return cwnd_quota;
1545 /* Test if sending is allowed right now. */
1546 bool tcp_may_send_now(struct sock *sk)
1548 const struct tcp_sock *tp = tcp_sk(sk);
1549 struct sk_buff *skb = tcp_send_head(sk);
1551 return skb &&
1552 tcp_snd_test(sk, skb, tcp_current_mss(sk),
1553 (tcp_skb_is_last(sk, skb) ?
1554 tp->nonagle : TCP_NAGLE_PUSH));
1557 /* Trim TSO SKB to LEN bytes, put the remaining data into a new packet
1558 * which is put after SKB on the list. It is very much like
1559 * tcp_fragment() except that it may make several kinds of assumptions
1560 * in order to speed up the splitting operation. In particular, we
1561 * know that all the data is in scatter-gather pages, and that the
1562 * packet has never been sent out before (and thus is not cloned).
1564 static int tso_fragment(struct sock *sk, struct sk_buff *skb, unsigned int len,
1565 unsigned int mss_now, gfp_t gfp)
1567 struct sk_buff *buff;
1568 int nlen = skb->len - len;
1569 u8 flags;
1571 /* All of a TSO frame must be composed of paged data. */
1572 if (skb->len != skb->data_len)
1573 return tcp_fragment(sk, skb, len, mss_now);
1575 buff = sk_stream_alloc_skb(sk, 0, gfp);
1576 if (unlikely(buff == NULL))
1577 return -ENOMEM;
1579 sk->sk_wmem_queued += buff->truesize;
1580 sk_mem_charge(sk, buff->truesize);
1581 buff->truesize += nlen;
1582 skb->truesize -= nlen;
1584 /* Correct the sequence numbers. */
1585 TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len;
1586 TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq;
1587 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq;
1589 /* PSH and FIN should only be set in the second packet. */
1590 flags = TCP_SKB_CB(skb)->tcp_flags;
1591 TCP_SKB_CB(skb)->tcp_flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH);
1592 TCP_SKB_CB(buff)->tcp_flags = flags;
1594 /* This packet was never sent out yet, so no SACK bits. */
1595 TCP_SKB_CB(buff)->sacked = 0;
1597 buff->ip_summed = skb->ip_summed = CHECKSUM_PARTIAL;
1598 skb_split(skb, buff, len);
1600 /* Fix up tso_factor for both original and new SKB. */
1601 tcp_set_skb_tso_segs(sk, skb, mss_now);
1602 tcp_set_skb_tso_segs(sk, buff, mss_now);
1604 /* Link BUFF into the send queue. */
1605 skb_header_release(buff);
1606 tcp_insert_write_queue_after(skb, buff, sk);
1608 return 0;
1611 /* Try to defer sending, if possible, in order to minimize the amount
1612 * of TSO splitting we do. View it as a kind of TSO Nagle test.
1614 * This algorithm is from John Heffner.
1616 static bool tcp_tso_should_defer(struct sock *sk, struct sk_buff *skb)
1618 struct tcp_sock *tp = tcp_sk(sk);
1619 const struct inet_connection_sock *icsk = inet_csk(sk);
1620 u32 send_win, cong_win, limit, in_flight;
1621 int win_divisor;
1623 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)
1624 goto send_now;
1626 if (icsk->icsk_ca_state != TCP_CA_Open)
1627 goto send_now;
1629 /* Defer for less than two clock ticks. */
1630 if (tp->tso_deferred &&
1631 (((u32)jiffies << 1) >> 1) - (tp->tso_deferred >> 1) > 1)
1632 goto send_now;
1634 in_flight = tcp_packets_in_flight(tp);
1636 BUG_ON(tcp_skb_pcount(skb) <= 1 || (tp->snd_cwnd <= in_flight));
1638 send_win = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq;
1640 /* From in_flight test above, we know that cwnd > in_flight. */
1641 cong_win = (tp->snd_cwnd - in_flight) * tp->mss_cache;
1643 limit = min(send_win, cong_win);
1645 /* If a full-sized TSO skb can be sent, do it. */
1646 if (limit >= min_t(unsigned int, sk->sk_gso_max_size,
1647 tp->xmit_size_goal_segs * tp->mss_cache))
1648 goto send_now;
1650 /* Middle in queue won't get any more data, full sendable already? */
1651 if ((skb != tcp_write_queue_tail(sk)) && (limit >= skb->len))
1652 goto send_now;
1654 win_divisor = ACCESS_ONCE(sysctl_tcp_tso_win_divisor);
1655 if (win_divisor) {
1656 u32 chunk = min(tp->snd_wnd, tp->snd_cwnd * tp->mss_cache);
1658 /* If at least some fraction of a window is available,
1659 * just use it.
1661 chunk /= win_divisor;
1662 if (limit >= chunk)
1663 goto send_now;
1664 } else {
1665 /* Different approach, try not to defer past a single
1666 * ACK. Receiver should ACK every other full sized
1667 * frame, so if we have space for more than 3 frames
1668 * then send now.
1670 if (limit > tcp_max_tso_deferred_mss(tp) * tp->mss_cache)
1671 goto send_now;
1674 /* Ok, it looks like it is advisable to defer.
1675 * Do not rearm the timer if already set to not break TCP ACK clocking.
1677 if (!tp->tso_deferred)
1678 tp->tso_deferred = 1 | (jiffies << 1);
1680 return true;
1682 send_now:
1683 tp->tso_deferred = 0;
1684 return false;
1687 /* Create a new MTU probe if we are ready.
1688 * MTU probe is regularly attempting to increase the path MTU by
1689 * deliberately sending larger packets. This discovers routing
1690 * changes resulting in larger path MTUs.
1692 * Returns 0 if we should wait to probe (no cwnd available),
1693 * 1 if a probe was sent,
1694 * -1 otherwise
1696 static int tcp_mtu_probe(struct sock *sk)
1698 struct tcp_sock *tp = tcp_sk(sk);
1699 struct inet_connection_sock *icsk = inet_csk(sk);
1700 struct sk_buff *skb, *nskb, *next;
1701 int len;
1702 int probe_size;
1703 int size_needed;
1704 int copy;
1705 int mss_now;
1707 /* Not currently probing/verifying,
1708 * not in recovery,
1709 * have enough cwnd, and
1710 * not SACKing (the variable headers throw things off) */
1711 if (!icsk->icsk_mtup.enabled ||
1712 icsk->icsk_mtup.probe_size ||
1713 inet_csk(sk)->icsk_ca_state != TCP_CA_Open ||
1714 tp->snd_cwnd < 11 ||
1715 tp->rx_opt.num_sacks || tp->rx_opt.dsack)
1716 return -1;
1718 /* Very simple search strategy: just double the MSS. */
1719 mss_now = tcp_current_mss(sk);
1720 probe_size = 2 * tp->mss_cache;
1721 size_needed = probe_size + (tp->reordering + 1) * tp->mss_cache;
1722 if (probe_size > tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_high)) {
1723 /* TODO: set timer for probe_converge_event */
1724 return -1;
1727 /* Have enough data in the send queue to probe? */
1728 if (tp->write_seq - tp->snd_nxt < size_needed)
1729 return -1;
1731 if (tp->snd_wnd < size_needed)
1732 return -1;
1733 if (after(tp->snd_nxt + size_needed, tcp_wnd_end(tp)))
1734 return 0;
1736 /* Do we need to wait to drain cwnd? With none in flight, don't stall */
1737 if (tcp_packets_in_flight(tp) + 2 > tp->snd_cwnd) {
1738 if (!tcp_packets_in_flight(tp))
1739 return -1;
1740 else
1741 return 0;
1744 /* We're allowed to probe. Build it now. */
1745 if ((nskb = sk_stream_alloc_skb(sk, probe_size, GFP_ATOMIC)) == NULL)
1746 return -1;
1747 sk->sk_wmem_queued += nskb->truesize;
1748 sk_mem_charge(sk, nskb->truesize);
1750 skb = tcp_send_head(sk);
1752 TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(skb)->seq;
1753 TCP_SKB_CB(nskb)->end_seq = TCP_SKB_CB(skb)->seq + probe_size;
1754 TCP_SKB_CB(nskb)->tcp_flags = TCPHDR_ACK;
1755 TCP_SKB_CB(nskb)->sacked = 0;
1756 nskb->csum = 0;
1757 nskb->ip_summed = skb->ip_summed;
1759 tcp_insert_write_queue_before(nskb, skb, sk);
1761 len = 0;
1762 tcp_for_write_queue_from_safe(skb, next, sk) {
1763 copy = min_t(int, skb->len, probe_size - len);
1764 if (nskb->ip_summed)
1765 skb_copy_bits(skb, 0, skb_put(nskb, copy), copy);
1766 else
1767 nskb->csum = skb_copy_and_csum_bits(skb, 0,
1768 skb_put(nskb, copy),
1769 copy, nskb->csum);
1771 if (skb->len <= copy) {
1772 /* We've eaten all the data from this skb.
1773 * Throw it away. */
1774 TCP_SKB_CB(nskb)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags;
1775 tcp_unlink_write_queue(skb, sk);
1776 sk_wmem_free_skb(sk, skb);
1777 } else {
1778 TCP_SKB_CB(nskb)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags &
1779 ~(TCPHDR_FIN|TCPHDR_PSH);
1780 if (!skb_shinfo(skb)->nr_frags) {
1781 skb_pull(skb, copy);
1782 if (skb->ip_summed != CHECKSUM_PARTIAL)
1783 skb->csum = csum_partial(skb->data,
1784 skb->len, 0);
1785 } else {
1786 __pskb_trim_head(skb, copy);
1787 tcp_set_skb_tso_segs(sk, skb, mss_now);
1789 TCP_SKB_CB(skb)->seq += copy;
1792 len += copy;
1794 if (len >= probe_size)
1795 break;
1797 tcp_init_tso_segs(sk, nskb, nskb->len);
1799 /* We're ready to send. If this fails, the probe will
1800 * be resegmented into mss-sized pieces by tcp_write_xmit(). */
1801 TCP_SKB_CB(nskb)->when = tcp_time_stamp;
1802 if (!tcp_transmit_skb(sk, nskb, 1, GFP_ATOMIC)) {
1803 /* Decrement cwnd here because we are sending
1804 * effectively two packets. */
1805 tp->snd_cwnd--;
1806 tcp_event_new_data_sent(sk, nskb);
1808 icsk->icsk_mtup.probe_size = tcp_mss_to_mtu(sk, nskb->len);
1809 tp->mtu_probe.probe_seq_start = TCP_SKB_CB(nskb)->seq;
1810 tp->mtu_probe.probe_seq_end = TCP_SKB_CB(nskb)->end_seq;
1812 return 1;
1815 return -1;
1818 /* This routine writes packets to the network. It advances the
1819 * send_head. This happens as incoming acks open up the remote
1820 * window for us.
1822 * LARGESEND note: !tcp_urg_mode is overkill, only frames between
1823 * snd_up-64k-mss .. snd_up cannot be large. However, taking into
1824 * account rare use of URG, this is not a big flaw.
1826 * Send at most one packet when push_one > 0. Temporarily ignore
1827 * cwnd limit to force at most one packet out when push_one == 2.
1829 * Returns true, if no segments are in flight and we have queued segments,
1830 * but cannot send anything now because of SWS or another problem.
1832 static bool tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle,
1833 int push_one, gfp_t gfp)
1835 struct tcp_sock *tp = tcp_sk(sk);
1836 struct sk_buff *skb;
1837 unsigned int tso_segs, sent_pkts;
1838 int cwnd_quota;
1839 int result;
1841 sent_pkts = 0;
1843 if (!push_one) {
1844 /* Do MTU probing. */
1845 result = tcp_mtu_probe(sk);
1846 if (!result) {
1847 return false;
1848 } else if (result > 0) {
1849 sent_pkts = 1;
1853 while ((skb = tcp_send_head(sk))) {
1854 unsigned int limit;
1856 tso_segs = tcp_init_tso_segs(sk, skb, mss_now);
1857 BUG_ON(!tso_segs);
1859 if (unlikely(tp->repair) && tp->repair_queue == TCP_SEND_QUEUE)
1860 goto repair; /* Skip network transmission */
1862 cwnd_quota = tcp_cwnd_test(tp, skb);
1863 if (!cwnd_quota) {
1864 if (push_one == 2)
1865 /* Force out a loss probe pkt. */
1866 cwnd_quota = 1;
1867 else
1868 break;
1871 if (unlikely(!tcp_snd_wnd_test(tp, skb, mss_now)))
1872 break;
1874 if (tso_segs == 1) {
1875 if (unlikely(!tcp_nagle_test(tp, skb, mss_now,
1876 (tcp_skb_is_last(sk, skb) ?
1877 nonagle : TCP_NAGLE_PUSH))))
1878 break;
1879 } else {
1880 if (!push_one && tcp_tso_should_defer(sk, skb))
1881 break;
1884 /* TCP Small Queues :
1885 * Control number of packets in qdisc/devices to two packets / or ~1 ms.
1886 * This allows for :
1887 * - better RTT estimation and ACK scheduling
1888 * - faster recovery
1889 * - high rates
1890 * Alas, some drivers / subsystems require a fair amount
1891 * of queued bytes to ensure line rate.
1892 * One example is wifi aggregation (802.11 AMPDU)
1894 limit = max_t(unsigned int, sysctl_tcp_limit_output_bytes,
1895 sk->sk_pacing_rate >> 10);
1897 if (atomic_read(&sk->sk_wmem_alloc) > limit) {
1898 set_bit(TSQ_THROTTLED, &tp->tsq_flags);
1899 /* It is possible TX completion already happened
1900 * before we set TSQ_THROTTLED, so we must
1901 * test again the condition.
1902 * We abuse smp_mb__after_clear_bit() because
1903 * there is no smp_mb__after_set_bit() yet
1905 smp_mb__after_clear_bit();
1906 if (atomic_read(&sk->sk_wmem_alloc) > limit)
1907 break;
1910 limit = mss_now;
1911 if (tso_segs > 1 && !tcp_urg_mode(tp))
1912 limit = tcp_mss_split_point(sk, skb, mss_now,
1913 min_t(unsigned int,
1914 cwnd_quota,
1915 sk->sk_gso_max_segs));
1917 if (skb->len > limit &&
1918 unlikely(tso_fragment(sk, skb, limit, mss_now, gfp)))
1919 break;
1921 TCP_SKB_CB(skb)->when = tcp_time_stamp;
1923 if (unlikely(tcp_transmit_skb(sk, skb, 1, gfp)))
1924 break;
1926 repair:
1927 /* Advance the send_head. This one is sent out.
1928 * This call will increment packets_out.
1930 tcp_event_new_data_sent(sk, skb);
1932 tcp_minshall_update(tp, mss_now, skb);
1933 sent_pkts += tcp_skb_pcount(skb);
1935 if (push_one)
1936 break;
1939 if (likely(sent_pkts)) {
1940 if (tcp_in_cwnd_reduction(sk))
1941 tp->prr_out += sent_pkts;
1943 /* Send one loss probe per tail loss episode. */
1944 if (push_one != 2)
1945 tcp_schedule_loss_probe(sk);
1946 tcp_cwnd_validate(sk);
1947 return false;
1949 return (push_one == 2) || (!tp->packets_out && tcp_send_head(sk));
1952 bool tcp_schedule_loss_probe(struct sock *sk)
1954 struct inet_connection_sock *icsk = inet_csk(sk);
1955 struct tcp_sock *tp = tcp_sk(sk);
1956 u32 timeout, tlp_time_stamp, rto_time_stamp;
1957 u32 rtt = tp->srtt >> 3;
1959 if (WARN_ON(icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS))
1960 return false;
1961 /* No consecutive loss probes. */
1962 if (WARN_ON(icsk->icsk_pending == ICSK_TIME_LOSS_PROBE)) {
1963 tcp_rearm_rto(sk);
1964 return false;
1966 /* Don't do any loss probe on a Fast Open connection before 3WHS
1967 * finishes.
1969 if (sk->sk_state == TCP_SYN_RECV)
1970 return false;
1972 /* TLP is only scheduled when next timer event is RTO. */
1973 if (icsk->icsk_pending != ICSK_TIME_RETRANS)
1974 return false;
1976 /* Schedule a loss probe in 2*RTT for SACK capable connections
1977 * in Open state, that are either limited by cwnd or application.
1979 if (sysctl_tcp_early_retrans < 3 || !rtt || !tp->packets_out ||
1980 !tcp_is_sack(tp) || inet_csk(sk)->icsk_ca_state != TCP_CA_Open)
1981 return false;
1983 if ((tp->snd_cwnd > tcp_packets_in_flight(tp)) &&
1984 tcp_send_head(sk))
1985 return false;
1987 /* Probe timeout is at least 1.5*rtt + TCP_DELACK_MAX to account
1988 * for delayed ack when there's one outstanding packet.
1990 timeout = rtt << 1;
1991 if (tp->packets_out == 1)
1992 timeout = max_t(u32, timeout,
1993 (rtt + (rtt >> 1) + TCP_DELACK_MAX));
1994 timeout = max_t(u32, timeout, msecs_to_jiffies(10));
1996 /* If RTO is shorter, just schedule TLP in its place. */
1997 tlp_time_stamp = tcp_time_stamp + timeout;
1998 rto_time_stamp = (u32)inet_csk(sk)->icsk_timeout;
1999 if ((s32)(tlp_time_stamp - rto_time_stamp) > 0) {
2000 s32 delta = rto_time_stamp - tcp_time_stamp;
2001 if (delta > 0)
2002 timeout = delta;
2005 inet_csk_reset_xmit_timer(sk, ICSK_TIME_LOSS_PROBE, timeout,
2006 TCP_RTO_MAX);
2007 return true;
2010 /* When probe timeout (PTO) fires, send a new segment if one exists, else
2011 * retransmit the last segment.
2013 void tcp_send_loss_probe(struct sock *sk)
2015 struct tcp_sock *tp = tcp_sk(sk);
2016 struct sk_buff *skb;
2017 int pcount;
2018 int mss = tcp_current_mss(sk);
2019 int err = -1;
2021 if (tcp_send_head(sk) != NULL) {
2022 err = tcp_write_xmit(sk, mss, TCP_NAGLE_OFF, 2, GFP_ATOMIC);
2023 goto rearm_timer;
2026 /* At most one outstanding TLP retransmission. */
2027 if (tp->tlp_high_seq)
2028 goto rearm_timer;
2030 /* Retransmit last segment. */
2031 skb = tcp_write_queue_tail(sk);
2032 if (WARN_ON(!skb))
2033 goto rearm_timer;
2035 pcount = tcp_skb_pcount(skb);
2036 if (WARN_ON(!pcount))
2037 goto rearm_timer;
2039 if ((pcount > 1) && (skb->len > (pcount - 1) * mss)) {
2040 if (unlikely(tcp_fragment(sk, skb, (pcount - 1) * mss, mss)))
2041 goto rearm_timer;
2042 skb = tcp_write_queue_tail(sk);
2045 if (WARN_ON(!skb || !tcp_skb_pcount(skb)))
2046 goto rearm_timer;
2048 /* Probe with zero data doesn't trigger fast recovery. */
2049 if (skb->len > 0)
2050 err = __tcp_retransmit_skb(sk, skb);
2052 /* Record snd_nxt for loss detection. */
2053 if (likely(!err))
2054 tp->tlp_high_seq = tp->snd_nxt;
2056 rearm_timer:
2057 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
2058 inet_csk(sk)->icsk_rto,
2059 TCP_RTO_MAX);
2061 if (likely(!err))
2062 NET_INC_STATS_BH(sock_net(sk),
2063 LINUX_MIB_TCPLOSSPROBES);
2064 return;
2067 /* Push out any pending frames which were held back due to
2068 * TCP_CORK or attempt at coalescing tiny packets.
2069 * The socket must be locked by the caller.
2071 void __tcp_push_pending_frames(struct sock *sk, unsigned int cur_mss,
2072 int nonagle)
2074 /* If we are closed, the bytes will have to remain here.
2075 * In time closedown will finish, we empty the write queue and
2076 * all will be happy.
2078 if (unlikely(sk->sk_state == TCP_CLOSE))
2079 return;
2081 if (tcp_write_xmit(sk, cur_mss, nonagle, 0,
2082 sk_gfp_atomic(sk, GFP_ATOMIC)))
2083 tcp_check_probe_timer(sk);
2086 /* Send _single_ skb sitting at the send head. This function requires
2087 * true push pending frames to setup probe timer etc.
2089 void tcp_push_one(struct sock *sk, unsigned int mss_now)
2091 struct sk_buff *skb = tcp_send_head(sk);
2093 BUG_ON(!skb || skb->len < mss_now);
2095 tcp_write_xmit(sk, mss_now, TCP_NAGLE_PUSH, 1, sk->sk_allocation);
2098 /* This function returns the amount that we can raise the
2099 * usable window based on the following constraints
2101 * 1. The window can never be shrunk once it is offered (RFC 793)
2102 * 2. We limit memory per socket
2104 * RFC 1122:
2105 * "the suggested [SWS] avoidance algorithm for the receiver is to keep
2106 * RECV.NEXT + RCV.WIN fixed until:
2107 * RCV.BUFF - RCV.USER - RCV.WINDOW >= min(1/2 RCV.BUFF, MSS)"
2109 * i.e. don't raise the right edge of the window until you can raise
2110 * it at least MSS bytes.
2112 * Unfortunately, the recommended algorithm breaks header prediction,
2113 * since header prediction assumes th->window stays fixed.
2115 * Strictly speaking, keeping th->window fixed violates the receiver
2116 * side SWS prevention criteria. The problem is that under this rule
2117 * a stream of single byte packets will cause the right side of the
2118 * window to always advance by a single byte.
2120 * Of course, if the sender implements sender side SWS prevention
2121 * then this will not be a problem.
2123 * BSD seems to make the following compromise:
2125 * If the free space is less than the 1/4 of the maximum
2126 * space available and the free space is less than 1/2 mss,
2127 * then set the window to 0.
2128 * [ Actually, bsd uses MSS and 1/4 of maximal _window_ ]
2129 * Otherwise, just prevent the window from shrinking
2130 * and from being larger than the largest representable value.
2132 * This prevents incremental opening of the window in the regime
2133 * where TCP is limited by the speed of the reader side taking
2134 * data out of the TCP receive queue. It does nothing about
2135 * those cases where the window is constrained on the sender side
2136 * because the pipeline is full.
2138 * BSD also seems to "accidentally" limit itself to windows that are a
2139 * multiple of MSS, at least until the free space gets quite small.
2140 * This would appear to be a side effect of the mbuf implementation.
2141 * Combining these two algorithms results in the observed behavior
2142 * of having a fixed window size at almost all times.
2144 * Below we obtain similar behavior by forcing the offered window to
2145 * a multiple of the mss when it is feasible to do so.
2147 * Note, we don't "adjust" for TIMESTAMP or SACK option bytes.
2148 * Regular options like TIMESTAMP are taken into account.
2150 u32 __tcp_select_window(struct sock *sk)
2152 struct inet_connection_sock *icsk = inet_csk(sk);
2153 struct tcp_sock *tp = tcp_sk(sk);
2154 /* MSS for the peer's data. Previous versions used mss_clamp
2155 * here. I don't know if the value based on our guesses
2156 * of peer's MSS is better for the performance. It's more correct
2157 * but may be worse for the performance because of rcv_mss
2158 * fluctuations. --SAW 1998/11/1
2160 int mss = icsk->icsk_ack.rcv_mss;
2161 int free_space = tcp_space(sk);
2162 int full_space = min_t(int, tp->window_clamp, tcp_full_space(sk));
2163 int window;
2165 if (mss > full_space)
2166 mss = full_space;
2168 if (free_space < (full_space >> 1)) {
2169 icsk->icsk_ack.quick = 0;
2171 if (sk_under_memory_pressure(sk))
2172 tp->rcv_ssthresh = min(tp->rcv_ssthresh,
2173 4U * tp->advmss);
2175 if (free_space < mss)
2176 return 0;
2179 if (free_space > tp->rcv_ssthresh)
2180 free_space = tp->rcv_ssthresh;
2182 /* Don't do rounding if we are using window scaling, since the
2183 * scaled window will not line up with the MSS boundary anyway.
2185 window = tp->rcv_wnd;
2186 if (tp->rx_opt.rcv_wscale) {
2187 window = free_space;
2189 /* Advertise enough space so that it won't get scaled away.
2190 * Import case: prevent zero window announcement if
2191 * 1<<rcv_wscale > mss.
2193 if (((window >> tp->rx_opt.rcv_wscale) << tp->rx_opt.rcv_wscale) != window)
2194 window = (((window >> tp->rx_opt.rcv_wscale) + 1)
2195 << tp->rx_opt.rcv_wscale);
2196 } else {
2197 /* Get the largest window that is a nice multiple of mss.
2198 * Window clamp already applied above.
2199 * If our current window offering is within 1 mss of the
2200 * free space we just keep it. This prevents the divide
2201 * and multiply from happening most of the time.
2202 * We also don't do any window rounding when the free space
2203 * is too small.
2205 if (window <= free_space - mss || window > free_space)
2206 window = (free_space / mss) * mss;
2207 else if (mss == full_space &&
2208 free_space > window + (full_space >> 1))
2209 window = free_space;
2212 return window;
2215 /* Collapses two adjacent SKB's during retransmission. */
2216 static void tcp_collapse_retrans(struct sock *sk, struct sk_buff *skb)
2218 struct tcp_sock *tp = tcp_sk(sk);
2219 struct sk_buff *next_skb = tcp_write_queue_next(sk, skb);
2220 int skb_size, next_skb_size;
2222 skb_size = skb->len;
2223 next_skb_size = next_skb->len;
2225 BUG_ON(tcp_skb_pcount(skb) != 1 || tcp_skb_pcount(next_skb) != 1);
2227 tcp_highest_sack_combine(sk, next_skb, skb);
2229 tcp_unlink_write_queue(next_skb, sk);
2231 skb_copy_from_linear_data(next_skb, skb_put(skb, next_skb_size),
2232 next_skb_size);
2234 if (next_skb->ip_summed == CHECKSUM_PARTIAL)
2235 skb->ip_summed = CHECKSUM_PARTIAL;
2237 if (skb->ip_summed != CHECKSUM_PARTIAL)
2238 skb->csum = csum_block_add(skb->csum, next_skb->csum, skb_size);
2240 /* Update sequence range on original skb. */
2241 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(next_skb)->end_seq;
2243 /* Merge over control information. This moves PSH/FIN etc. over */
2244 TCP_SKB_CB(skb)->tcp_flags |= TCP_SKB_CB(next_skb)->tcp_flags;
2246 /* All done, get rid of second SKB and account for it so
2247 * packet counting does not break.
2249 TCP_SKB_CB(skb)->sacked |= TCP_SKB_CB(next_skb)->sacked & TCPCB_EVER_RETRANS;
2251 /* changed transmit queue under us so clear hints */
2252 tcp_clear_retrans_hints_partial(tp);
2253 if (next_skb == tp->retransmit_skb_hint)
2254 tp->retransmit_skb_hint = skb;
2256 tcp_adjust_pcount(sk, next_skb, tcp_skb_pcount(next_skb));
2258 sk_wmem_free_skb(sk, next_skb);
2261 /* Check if coalescing SKBs is legal. */
2262 static bool tcp_can_collapse(const struct sock *sk, const struct sk_buff *skb)
2264 if (tcp_skb_pcount(skb) > 1)
2265 return false;
2266 /* TODO: SACK collapsing could be used to remove this condition */
2267 if (skb_shinfo(skb)->nr_frags != 0)
2268 return false;
2269 if (skb_cloned(skb))
2270 return false;
2271 if (skb == tcp_send_head(sk))
2272 return false;
2273 /* Some heurestics for collapsing over SACK'd could be invented */
2274 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)
2275 return false;
2277 return true;
2280 /* Collapse packets in the retransmit queue to make to create
2281 * less packets on the wire. This is only done on retransmission.
2283 static void tcp_retrans_try_collapse(struct sock *sk, struct sk_buff *to,
2284 int space)
2286 struct tcp_sock *tp = tcp_sk(sk);
2287 struct sk_buff *skb = to, *tmp;
2288 bool first = true;
2290 if (!sysctl_tcp_retrans_collapse)
2291 return;
2292 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN)
2293 return;
2295 tcp_for_write_queue_from_safe(skb, tmp, sk) {
2296 if (!tcp_can_collapse(sk, skb))
2297 break;
2299 space -= skb->len;
2301 if (first) {
2302 first = false;
2303 continue;
2306 if (space < 0)
2307 break;
2308 /* Punt if not enough space exists in the first SKB for
2309 * the data in the second
2311 if (skb->len > skb_availroom(to))
2312 break;
2314 if (after(TCP_SKB_CB(skb)->end_seq, tcp_wnd_end(tp)))
2315 break;
2317 tcp_collapse_retrans(sk, to);
2321 /* This retransmits one SKB. Policy decisions and retransmit queue
2322 * state updates are done by the caller. Returns non-zero if an
2323 * error occurred which prevented the send.
2325 int __tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb)
2327 struct tcp_sock *tp = tcp_sk(sk);
2328 struct inet_connection_sock *icsk = inet_csk(sk);
2329 unsigned int cur_mss;
2331 /* Inconslusive MTU probe */
2332 if (icsk->icsk_mtup.probe_size) {
2333 icsk->icsk_mtup.probe_size = 0;
2336 /* Do not sent more than we queued. 1/4 is reserved for possible
2337 * copying overhead: fragmentation, tunneling, mangling etc.
2339 if (atomic_read(&sk->sk_wmem_alloc) >
2340 min(sk->sk_wmem_queued + (sk->sk_wmem_queued >> 2), sk->sk_sndbuf))
2341 return -EAGAIN;
2343 if (before(TCP_SKB_CB(skb)->seq, tp->snd_una)) {
2344 if (before(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
2345 BUG();
2346 if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq))
2347 return -ENOMEM;
2350 if (inet_csk(sk)->icsk_af_ops->rebuild_header(sk))
2351 return -EHOSTUNREACH; /* Routing failure or similar. */
2353 cur_mss = tcp_current_mss(sk);
2355 /* If receiver has shrunk his window, and skb is out of
2356 * new window, do not retransmit it. The exception is the
2357 * case, when window is shrunk to zero. In this case
2358 * our retransmit serves as a zero window probe.
2360 if (!before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp)) &&
2361 TCP_SKB_CB(skb)->seq != tp->snd_una)
2362 return -EAGAIN;
2364 if (skb->len > cur_mss) {
2365 if (tcp_fragment(sk, skb, cur_mss, cur_mss))
2366 return -ENOMEM; /* We'll try again later. */
2367 } else {
2368 int oldpcount = tcp_skb_pcount(skb);
2370 if (unlikely(oldpcount > 1)) {
2371 if (skb_unclone(skb, GFP_ATOMIC))
2372 return -ENOMEM;
2373 tcp_init_tso_segs(sk, skb, cur_mss);
2374 tcp_adjust_pcount(sk, skb, oldpcount - tcp_skb_pcount(skb));
2378 tcp_retrans_try_collapse(sk, skb, cur_mss);
2380 /* Some Solaris stacks overoptimize and ignore the FIN on a
2381 * retransmit when old data is attached. So strip it off
2382 * since it is cheap to do so and saves bytes on the network.
2384 if (skb->len > 0 &&
2385 (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN) &&
2386 tp->snd_una == (TCP_SKB_CB(skb)->end_seq - 1)) {
2387 if (!pskb_trim(skb, 0)) {
2388 /* Reuse, even though it does some unnecessary work */
2389 tcp_init_nondata_skb(skb, TCP_SKB_CB(skb)->end_seq - 1,
2390 TCP_SKB_CB(skb)->tcp_flags);
2391 skb->ip_summed = CHECKSUM_NONE;
2395 /* Make a copy, if the first transmission SKB clone we made
2396 * is still in somebody's hands, else make a clone.
2398 TCP_SKB_CB(skb)->when = tcp_time_stamp;
2400 /* make sure skb->data is aligned on arches that require it
2401 * and check if ack-trimming & collapsing extended the headroom
2402 * beyond what csum_start can cover.
2404 if (unlikely((NET_IP_ALIGN && ((unsigned long)skb->data & 3)) ||
2405 skb_headroom(skb) >= 0xFFFF)) {
2406 struct sk_buff *nskb = __pskb_copy(skb, MAX_TCP_HEADER,
2407 GFP_ATOMIC);
2408 return nskb ? tcp_transmit_skb(sk, nskb, 0, GFP_ATOMIC) :
2409 -ENOBUFS;
2410 } else {
2411 return tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
2415 int tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb)
2417 struct tcp_sock *tp = tcp_sk(sk);
2418 int err = __tcp_retransmit_skb(sk, skb);
2420 if (err == 0) {
2421 /* Update global TCP statistics. */
2422 TCP_INC_STATS(sock_net(sk), TCP_MIB_RETRANSSEGS);
2424 tp->total_retrans++;
2426 #if FASTRETRANS_DEBUG > 0
2427 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) {
2428 net_dbg_ratelimited("retrans_out leaked\n");
2430 #endif
2431 if (!tp->retrans_out)
2432 tp->lost_retrans_low = tp->snd_nxt;
2433 TCP_SKB_CB(skb)->sacked |= TCPCB_RETRANS;
2434 tp->retrans_out += tcp_skb_pcount(skb);
2436 /* Save stamp of the first retransmit. */
2437 if (!tp->retrans_stamp)
2438 tp->retrans_stamp = TCP_SKB_CB(skb)->when;
2440 /* snd_nxt is stored to detect loss of retransmitted segment,
2441 * see tcp_input.c tcp_sacktag_write_queue().
2443 TCP_SKB_CB(skb)->ack_seq = tp->snd_nxt;
2444 } else {
2445 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPRETRANSFAIL);
2448 if (tp->undo_retrans < 0)
2449 tp->undo_retrans = 0;
2450 tp->undo_retrans += tcp_skb_pcount(skb);
2451 return err;
2454 /* Check if we forward retransmits are possible in the current
2455 * window/congestion state.
2457 static bool tcp_can_forward_retransmit(struct sock *sk)
2459 const struct inet_connection_sock *icsk = inet_csk(sk);
2460 const struct tcp_sock *tp = tcp_sk(sk);
2462 /* Forward retransmissions are possible only during Recovery. */
2463 if (icsk->icsk_ca_state != TCP_CA_Recovery)
2464 return false;
2466 /* No forward retransmissions in Reno are possible. */
2467 if (tcp_is_reno(tp))
2468 return false;
2470 /* Yeah, we have to make difficult choice between forward transmission
2471 * and retransmission... Both ways have their merits...
2473 * For now we do not retransmit anything, while we have some new
2474 * segments to send. In the other cases, follow rule 3 for
2475 * NextSeg() specified in RFC3517.
2478 if (tcp_may_send_now(sk))
2479 return false;
2481 return true;
2484 /* This gets called after a retransmit timeout, and the initially
2485 * retransmitted data is acknowledged. It tries to continue
2486 * resending the rest of the retransmit queue, until either
2487 * we've sent it all or the congestion window limit is reached.
2488 * If doing SACK, the first ACK which comes back for a timeout
2489 * based retransmit packet might feed us FACK information again.
2490 * If so, we use it to avoid unnecessarily retransmissions.
2492 void tcp_xmit_retransmit_queue(struct sock *sk)
2494 const struct inet_connection_sock *icsk = inet_csk(sk);
2495 struct tcp_sock *tp = tcp_sk(sk);
2496 struct sk_buff *skb;
2497 struct sk_buff *hole = NULL;
2498 u32 last_lost;
2499 int mib_idx;
2500 int fwd_rexmitting = 0;
2502 if (!tp->packets_out)
2503 return;
2505 if (!tp->lost_out)
2506 tp->retransmit_high = tp->snd_una;
2508 if (tp->retransmit_skb_hint) {
2509 skb = tp->retransmit_skb_hint;
2510 last_lost = TCP_SKB_CB(skb)->end_seq;
2511 if (after(last_lost, tp->retransmit_high))
2512 last_lost = tp->retransmit_high;
2513 } else {
2514 skb = tcp_write_queue_head(sk);
2515 last_lost = tp->snd_una;
2518 tcp_for_write_queue_from(skb, sk) {
2519 __u8 sacked = TCP_SKB_CB(skb)->sacked;
2521 if (skb == tcp_send_head(sk))
2522 break;
2523 /* we could do better than to assign each time */
2524 if (hole == NULL)
2525 tp->retransmit_skb_hint = skb;
2527 /* Assume this retransmit will generate
2528 * only one packet for congestion window
2529 * calculation purposes. This works because
2530 * tcp_retransmit_skb() will chop up the
2531 * packet to be MSS sized and all the
2532 * packet counting works out.
2534 if (tcp_packets_in_flight(tp) >= tp->snd_cwnd)
2535 return;
2537 if (fwd_rexmitting) {
2538 begin_fwd:
2539 if (!before(TCP_SKB_CB(skb)->seq, tcp_highest_sack_seq(tp)))
2540 break;
2541 mib_idx = LINUX_MIB_TCPFORWARDRETRANS;
2543 } else if (!before(TCP_SKB_CB(skb)->seq, tp->retransmit_high)) {
2544 tp->retransmit_high = last_lost;
2545 if (!tcp_can_forward_retransmit(sk))
2546 break;
2547 /* Backtrack if necessary to non-L'ed skb */
2548 if (hole != NULL) {
2549 skb = hole;
2550 hole = NULL;
2552 fwd_rexmitting = 1;
2553 goto begin_fwd;
2555 } else if (!(sacked & TCPCB_LOST)) {
2556 if (hole == NULL && !(sacked & (TCPCB_SACKED_RETRANS|TCPCB_SACKED_ACKED)))
2557 hole = skb;
2558 continue;
2560 } else {
2561 last_lost = TCP_SKB_CB(skb)->end_seq;
2562 if (icsk->icsk_ca_state != TCP_CA_Loss)
2563 mib_idx = LINUX_MIB_TCPFASTRETRANS;
2564 else
2565 mib_idx = LINUX_MIB_TCPSLOWSTARTRETRANS;
2568 if (sacked & (TCPCB_SACKED_ACKED|TCPCB_SACKED_RETRANS))
2569 continue;
2571 if (tcp_retransmit_skb(sk, skb))
2572 return;
2574 NET_INC_STATS_BH(sock_net(sk), mib_idx);
2576 if (tcp_in_cwnd_reduction(sk))
2577 tp->prr_out += tcp_skb_pcount(skb);
2579 if (skb == tcp_write_queue_head(sk))
2580 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
2581 inet_csk(sk)->icsk_rto,
2582 TCP_RTO_MAX);
2586 /* Send a fin. The caller locks the socket for us. This cannot be
2587 * allowed to fail queueing a FIN frame under any circumstances.
2589 void tcp_send_fin(struct sock *sk)
2591 struct tcp_sock *tp = tcp_sk(sk);
2592 struct sk_buff *skb = tcp_write_queue_tail(sk);
2593 int mss_now;
2595 /* Optimization, tack on the FIN if we have a queue of
2596 * unsent frames. But be careful about outgoing SACKS
2597 * and IP options.
2599 mss_now = tcp_current_mss(sk);
2601 if (tcp_send_head(sk) != NULL) {
2602 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_FIN;
2603 TCP_SKB_CB(skb)->end_seq++;
2604 tp->write_seq++;
2605 } else {
2606 /* Socket is locked, keep trying until memory is available. */
2607 for (;;) {
2608 skb = alloc_skb_fclone(MAX_TCP_HEADER,
2609 sk->sk_allocation);
2610 if (skb)
2611 break;
2612 yield();
2615 /* Reserve space for headers and prepare control bits. */
2616 skb_reserve(skb, MAX_TCP_HEADER);
2617 /* FIN eats a sequence byte, write_seq advanced by tcp_queue_skb(). */
2618 tcp_init_nondata_skb(skb, tp->write_seq,
2619 TCPHDR_ACK | TCPHDR_FIN);
2620 tcp_queue_skb(sk, skb);
2622 __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_OFF);
2625 /* We get here when a process closes a file descriptor (either due to
2626 * an explicit close() or as a byproduct of exit()'ing) and there
2627 * was unread data in the receive queue. This behavior is recommended
2628 * by RFC 2525, section 2.17. -DaveM
2630 void tcp_send_active_reset(struct sock *sk, gfp_t priority)
2632 struct sk_buff *skb;
2634 /* NOTE: No TCP options attached and we never retransmit this. */
2635 skb = alloc_skb(MAX_TCP_HEADER, priority);
2636 if (!skb) {
2637 NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED);
2638 return;
2641 /* Reserve space for headers and prepare control bits. */
2642 skb_reserve(skb, MAX_TCP_HEADER);
2643 tcp_init_nondata_skb(skb, tcp_acceptable_seq(sk),
2644 TCPHDR_ACK | TCPHDR_RST);
2645 /* Send it off. */
2646 TCP_SKB_CB(skb)->when = tcp_time_stamp;
2647 if (tcp_transmit_skb(sk, skb, 0, priority))
2648 NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED);
2650 TCP_INC_STATS(sock_net(sk), TCP_MIB_OUTRSTS);
2653 /* Send a crossed SYN-ACK during socket establishment.
2654 * WARNING: This routine must only be called when we have already sent
2655 * a SYN packet that crossed the incoming SYN that caused this routine
2656 * to get called. If this assumption fails then the initial rcv_wnd
2657 * and rcv_wscale values will not be correct.
2659 int tcp_send_synack(struct sock *sk)
2661 struct sk_buff *skb;
2663 skb = tcp_write_queue_head(sk);
2664 if (skb == NULL || !(TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN)) {
2665 pr_debug("%s: wrong queue state\n", __func__);
2666 return -EFAULT;
2668 if (!(TCP_SKB_CB(skb)->tcp_flags & TCPHDR_ACK)) {
2669 if (skb_cloned(skb)) {
2670 struct sk_buff *nskb = skb_copy(skb, GFP_ATOMIC);
2671 if (nskb == NULL)
2672 return -ENOMEM;
2673 tcp_unlink_write_queue(skb, sk);
2674 skb_header_release(nskb);
2675 __tcp_add_write_queue_head(sk, nskb);
2676 sk_wmem_free_skb(sk, skb);
2677 sk->sk_wmem_queued += nskb->truesize;
2678 sk_mem_charge(sk, nskb->truesize);
2679 skb = nskb;
2682 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_ACK;
2683 TCP_ECN_send_synack(tcp_sk(sk), skb);
2685 TCP_SKB_CB(skb)->when = tcp_time_stamp;
2686 return tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
2690 * tcp_make_synack - Prepare a SYN-ACK.
2691 * sk: listener socket
2692 * dst: dst entry attached to the SYNACK
2693 * req: request_sock pointer
2695 * Allocate one skb and build a SYNACK packet.
2696 * @dst is consumed : Caller should not use it again.
2698 struct sk_buff *tcp_make_synack(struct sock *sk, struct dst_entry *dst,
2699 struct request_sock *req,
2700 struct tcp_fastopen_cookie *foc)
2702 struct tcp_out_options opts;
2703 struct inet_request_sock *ireq = inet_rsk(req);
2704 struct tcp_sock *tp = tcp_sk(sk);
2705 struct tcphdr *th;
2706 struct sk_buff *skb;
2707 struct tcp_md5sig_key *md5;
2708 int tcp_header_size;
2709 int mss;
2711 skb = sock_wmalloc(sk, MAX_TCP_HEADER + 15, 1, GFP_ATOMIC);
2712 if (unlikely(!skb)) {
2713 dst_release(dst);
2714 return NULL;
2716 /* Reserve space for headers. */
2717 skb_reserve(skb, MAX_TCP_HEADER);
2719 skb_dst_set(skb, dst);
2720 security_skb_owned_by(skb, sk);
2722 mss = dst_metric_advmss(dst);
2723 if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < mss)
2724 mss = tp->rx_opt.user_mss;
2726 if (req->rcv_wnd == 0) { /* ignored for retransmitted syns */
2727 __u8 rcv_wscale;
2728 /* Set this up on the first call only */
2729 req->window_clamp = tp->window_clamp ? : dst_metric(dst, RTAX_WINDOW);
2731 /* limit the window selection if the user enforce a smaller rx buffer */
2732 if (sk->sk_userlocks & SOCK_RCVBUF_LOCK &&
2733 (req->window_clamp > tcp_full_space(sk) || req->window_clamp == 0))
2734 req->window_clamp = tcp_full_space(sk);
2736 /* tcp_full_space because it is guaranteed to be the first packet */
2737 tcp_select_initial_window(tcp_full_space(sk),
2738 mss - (ireq->tstamp_ok ? TCPOLEN_TSTAMP_ALIGNED : 0),
2739 &req->rcv_wnd,
2740 &req->window_clamp,
2741 ireq->wscale_ok,
2742 &rcv_wscale,
2743 dst_metric(dst, RTAX_INITRWND));
2744 ireq->rcv_wscale = rcv_wscale;
2747 memset(&opts, 0, sizeof(opts));
2748 #ifdef CONFIG_SYN_COOKIES
2749 if (unlikely(req->cookie_ts))
2750 TCP_SKB_CB(skb)->when = cookie_init_timestamp(req);
2751 else
2752 #endif
2753 TCP_SKB_CB(skb)->when = tcp_time_stamp;
2754 tcp_header_size = tcp_synack_options(sk, req, mss, skb, &opts, &md5,
2755 foc) + sizeof(*th);
2757 skb_push(skb, tcp_header_size);
2758 skb_reset_transport_header(skb);
2760 th = tcp_hdr(skb);
2761 memset(th, 0, sizeof(struct tcphdr));
2762 th->syn = 1;
2763 th->ack = 1;
2764 TCP_ECN_make_synack(req, th);
2765 th->source = ireq->loc_port;
2766 th->dest = ireq->rmt_port;
2767 /* Setting of flags are superfluous here for callers (and ECE is
2768 * not even correctly set)
2770 tcp_init_nondata_skb(skb, tcp_rsk(req)->snt_isn,
2771 TCPHDR_SYN | TCPHDR_ACK);
2773 th->seq = htonl(TCP_SKB_CB(skb)->seq);
2774 /* XXX data is queued and acked as is. No buffer/window check */
2775 th->ack_seq = htonl(tcp_rsk(req)->rcv_nxt);
2777 /* RFC1323: The window in SYN & SYN/ACK segments is never scaled. */
2778 th->window = htons(min(req->rcv_wnd, 65535U));
2779 tcp_options_write((__be32 *)(th + 1), tp, &opts);
2780 th->doff = (tcp_header_size >> 2);
2781 TCP_ADD_STATS(sock_net(sk), TCP_MIB_OUTSEGS, tcp_skb_pcount(skb));
2783 #ifdef CONFIG_TCP_MD5SIG
2784 /* Okay, we have all we need - do the md5 hash if needed */
2785 if (md5) {
2786 tcp_rsk(req)->af_specific->calc_md5_hash(opts.hash_location,
2787 md5, NULL, req, skb);
2789 #endif
2791 return skb;
2793 EXPORT_SYMBOL(tcp_make_synack);
2795 /* Do all connect socket setups that can be done AF independent. */
2796 void tcp_connect_init(struct sock *sk)
2798 const struct dst_entry *dst = __sk_dst_get(sk);
2799 struct tcp_sock *tp = tcp_sk(sk);
2800 __u8 rcv_wscale;
2802 /* We'll fix this up when we get a response from the other end.
2803 * See tcp_input.c:tcp_rcv_state_process case TCP_SYN_SENT.
2805 tp->tcp_header_len = sizeof(struct tcphdr) +
2806 (sysctl_tcp_timestamps ? TCPOLEN_TSTAMP_ALIGNED : 0);
2808 #ifdef CONFIG_TCP_MD5SIG
2809 if (tp->af_specific->md5_lookup(sk, sk) != NULL)
2810 tp->tcp_header_len += TCPOLEN_MD5SIG_ALIGNED;
2811 #endif
2813 /* If user gave his TCP_MAXSEG, record it to clamp */
2814 if (tp->rx_opt.user_mss)
2815 tp->rx_opt.mss_clamp = tp->rx_opt.user_mss;
2816 tp->max_window = 0;
2817 tcp_mtup_init(sk);
2818 tcp_sync_mss(sk, dst_mtu(dst));
2820 if (!tp->window_clamp)
2821 tp->window_clamp = dst_metric(dst, RTAX_WINDOW);
2822 tp->advmss = dst_metric_advmss(dst);
2823 if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < tp->advmss)
2824 tp->advmss = tp->rx_opt.user_mss;
2826 tcp_initialize_rcv_mss(sk);
2828 /* limit the window selection if the user enforce a smaller rx buffer */
2829 if (sk->sk_userlocks & SOCK_RCVBUF_LOCK &&
2830 (tp->window_clamp > tcp_full_space(sk) || tp->window_clamp == 0))
2831 tp->window_clamp = tcp_full_space(sk);
2833 tcp_select_initial_window(tcp_full_space(sk),
2834 tp->advmss - (tp->rx_opt.ts_recent_stamp ? tp->tcp_header_len - sizeof(struct tcphdr) : 0),
2835 &tp->rcv_wnd,
2836 &tp->window_clamp,
2837 sysctl_tcp_window_scaling,
2838 &rcv_wscale,
2839 dst_metric(dst, RTAX_INITRWND));
2841 tp->rx_opt.rcv_wscale = rcv_wscale;
2842 tp->rcv_ssthresh = tp->rcv_wnd;
2844 sk->sk_err = 0;
2845 sock_reset_flag(sk, SOCK_DONE);
2846 tp->snd_wnd = 0;
2847 tcp_init_wl(tp, 0);
2848 tp->snd_una = tp->write_seq;
2849 tp->snd_sml = tp->write_seq;
2850 tp->snd_up = tp->write_seq;
2851 tp->snd_nxt = tp->write_seq;
2853 if (likely(!tp->repair))
2854 tp->rcv_nxt = 0;
2855 else
2856 tp->rcv_tstamp = tcp_time_stamp;
2857 tp->rcv_wup = tp->rcv_nxt;
2858 tp->copied_seq = tp->rcv_nxt;
2860 inet_csk(sk)->icsk_rto = TCP_TIMEOUT_INIT;
2861 inet_csk(sk)->icsk_retransmits = 0;
2862 tcp_clear_retrans(tp);
2865 static void tcp_connect_queue_skb(struct sock *sk, struct sk_buff *skb)
2867 struct tcp_sock *tp = tcp_sk(sk);
2868 struct tcp_skb_cb *tcb = TCP_SKB_CB(skb);
2870 tcb->end_seq += skb->len;
2871 skb_header_release(skb);
2872 __tcp_add_write_queue_tail(sk, skb);
2873 sk->sk_wmem_queued += skb->truesize;
2874 sk_mem_charge(sk, skb->truesize);
2875 tp->write_seq = tcb->end_seq;
2876 tp->packets_out += tcp_skb_pcount(skb);
2879 /* Build and send a SYN with data and (cached) Fast Open cookie. However,
2880 * queue a data-only packet after the regular SYN, such that regular SYNs
2881 * are retransmitted on timeouts. Also if the remote SYN-ACK acknowledges
2882 * only the SYN sequence, the data are retransmitted in the first ACK.
2883 * If cookie is not cached or other error occurs, falls back to send a
2884 * regular SYN with Fast Open cookie request option.
2886 static int tcp_send_syn_data(struct sock *sk, struct sk_buff *syn)
2888 struct tcp_sock *tp = tcp_sk(sk);
2889 struct tcp_fastopen_request *fo = tp->fastopen_req;
2890 int syn_loss = 0, space, i, err = 0, iovlen = fo->data->msg_iovlen;
2891 struct sk_buff *syn_data = NULL, *data;
2892 unsigned long last_syn_loss = 0;
2894 tp->rx_opt.mss_clamp = tp->advmss; /* If MSS is not cached */
2895 tcp_fastopen_cache_get(sk, &tp->rx_opt.mss_clamp, &fo->cookie,
2896 &syn_loss, &last_syn_loss);
2897 /* Recurring FO SYN losses: revert to regular handshake temporarily */
2898 if (syn_loss > 1 &&
2899 time_before(jiffies, last_syn_loss + (60*HZ << syn_loss))) {
2900 fo->cookie.len = -1;
2901 goto fallback;
2904 if (sysctl_tcp_fastopen & TFO_CLIENT_NO_COOKIE)
2905 fo->cookie.len = -1;
2906 else if (fo->cookie.len <= 0)
2907 goto fallback;
2909 /* MSS for SYN-data is based on cached MSS and bounded by PMTU and
2910 * user-MSS. Reserve maximum option space for middleboxes that add
2911 * private TCP options. The cost is reduced data space in SYN :(
2913 if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < tp->rx_opt.mss_clamp)
2914 tp->rx_opt.mss_clamp = tp->rx_opt.user_mss;
2915 space = __tcp_mtu_to_mss(sk, inet_csk(sk)->icsk_pmtu_cookie) -
2916 MAX_TCP_OPTION_SPACE;
2918 space = min_t(size_t, space, fo->size);
2920 /* limit to order-0 allocations */
2921 space = min_t(size_t, space, SKB_MAX_HEAD(MAX_TCP_HEADER));
2923 syn_data = skb_copy_expand(syn, MAX_TCP_HEADER, space,
2924 sk->sk_allocation);
2925 if (syn_data == NULL)
2926 goto fallback;
2928 for (i = 0; i < iovlen && syn_data->len < space; ++i) {
2929 struct iovec *iov = &fo->data->msg_iov[i];
2930 unsigned char __user *from = iov->iov_base;
2931 int len = iov->iov_len;
2933 if (syn_data->len + len > space)
2934 len = space - syn_data->len;
2935 else if (i + 1 == iovlen)
2936 /* No more data pending in inet_wait_for_connect() */
2937 fo->data = NULL;
2939 if (skb_add_data(syn_data, from, len))
2940 goto fallback;
2943 /* Queue a data-only packet after the regular SYN for retransmission */
2944 data = pskb_copy(syn_data, sk->sk_allocation);
2945 if (data == NULL)
2946 goto fallback;
2947 TCP_SKB_CB(data)->seq++;
2948 TCP_SKB_CB(data)->tcp_flags &= ~TCPHDR_SYN;
2949 TCP_SKB_CB(data)->tcp_flags = (TCPHDR_ACK|TCPHDR_PSH);
2950 tcp_connect_queue_skb(sk, data);
2951 fo->copied = data->len;
2953 if (tcp_transmit_skb(sk, syn_data, 0, sk->sk_allocation) == 0) {
2954 tp->syn_data = (fo->copied > 0);
2955 NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPFASTOPENACTIVE);
2956 goto done;
2958 syn_data = NULL;
2960 fallback:
2961 /* Send a regular SYN with Fast Open cookie request option */
2962 if (fo->cookie.len > 0)
2963 fo->cookie.len = 0;
2964 err = tcp_transmit_skb(sk, syn, 1, sk->sk_allocation);
2965 if (err)
2966 tp->syn_fastopen = 0;
2967 kfree_skb(syn_data);
2968 done:
2969 fo->cookie.len = -1; /* Exclude Fast Open option for SYN retries */
2970 return err;
2973 /* Build a SYN and send it off. */
2974 int tcp_connect(struct sock *sk)
2976 struct tcp_sock *tp = tcp_sk(sk);
2977 struct sk_buff *buff;
2978 int err;
2980 tcp_connect_init(sk);
2982 if (unlikely(tp->repair)) {
2983 tcp_finish_connect(sk, NULL);
2984 return 0;
2987 buff = alloc_skb_fclone(MAX_TCP_HEADER + 15, sk->sk_allocation);
2988 if (unlikely(buff == NULL))
2989 return -ENOBUFS;
2991 /* Reserve space for headers. */
2992 skb_reserve(buff, MAX_TCP_HEADER);
2994 tcp_init_nondata_skb(buff, tp->write_seq++, TCPHDR_SYN);
2995 tp->retrans_stamp = TCP_SKB_CB(buff)->when = tcp_time_stamp;
2996 tcp_connect_queue_skb(sk, buff);
2997 TCP_ECN_send_syn(sk, buff);
2999 /* Send off SYN; include data in Fast Open. */
3000 err = tp->fastopen_req ? tcp_send_syn_data(sk, buff) :
3001 tcp_transmit_skb(sk, buff, 1, sk->sk_allocation);
3002 if (err == -ECONNREFUSED)
3003 return err;
3005 /* We change tp->snd_nxt after the tcp_transmit_skb() call
3006 * in order to make this packet get counted in tcpOutSegs.
3008 tp->snd_nxt = tp->write_seq;
3009 tp->pushed_seq = tp->write_seq;
3010 TCP_INC_STATS(sock_net(sk), TCP_MIB_ACTIVEOPENS);
3012 /* Timer for repeating the SYN until an answer. */
3013 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
3014 inet_csk(sk)->icsk_rto, TCP_RTO_MAX);
3015 return 0;
3017 EXPORT_SYMBOL(tcp_connect);
3019 /* Send out a delayed ack, the caller does the policy checking
3020 * to see if we should even be here. See tcp_input.c:tcp_ack_snd_check()
3021 * for details.
3023 void tcp_send_delayed_ack(struct sock *sk)
3025 struct inet_connection_sock *icsk = inet_csk(sk);
3026 int ato = icsk->icsk_ack.ato;
3027 unsigned long timeout;
3029 if (ato > TCP_DELACK_MIN) {
3030 const struct tcp_sock *tp = tcp_sk(sk);
3031 int max_ato = HZ / 2;
3033 if (icsk->icsk_ack.pingpong ||
3034 (icsk->icsk_ack.pending & ICSK_ACK_PUSHED))
3035 max_ato = TCP_DELACK_MAX;
3037 /* Slow path, intersegment interval is "high". */
3039 /* If some rtt estimate is known, use it to bound delayed ack.
3040 * Do not use inet_csk(sk)->icsk_rto here, use results of rtt measurements
3041 * directly.
3043 if (tp->srtt) {
3044 int rtt = max(tp->srtt >> 3, TCP_DELACK_MIN);
3046 if (rtt < max_ato)
3047 max_ato = rtt;
3050 ato = min(ato, max_ato);
3053 /* Stay within the limit we were given */
3054 timeout = jiffies + ato;
3056 /* Use new timeout only if there wasn't a older one earlier. */
3057 if (icsk->icsk_ack.pending & ICSK_ACK_TIMER) {
3058 /* If delack timer was blocked or is about to expire,
3059 * send ACK now.
3061 if (icsk->icsk_ack.blocked ||
3062 time_before_eq(icsk->icsk_ack.timeout, jiffies + (ato >> 2))) {
3063 tcp_send_ack(sk);
3064 return;
3067 if (!time_before(timeout, icsk->icsk_ack.timeout))
3068 timeout = icsk->icsk_ack.timeout;
3070 icsk->icsk_ack.pending |= ICSK_ACK_SCHED | ICSK_ACK_TIMER;
3071 icsk->icsk_ack.timeout = timeout;
3072 sk_reset_timer(sk, &icsk->icsk_delack_timer, timeout);
3075 /* This routine sends an ack and also updates the window. */
3076 void tcp_send_ack(struct sock *sk)
3078 struct sk_buff *buff;
3080 /* If we have been reset, we may not send again. */
3081 if (sk->sk_state == TCP_CLOSE)
3082 return;
3084 /* We are not putting this on the write queue, so
3085 * tcp_transmit_skb() will set the ownership to this
3086 * sock.
3088 buff = alloc_skb(MAX_TCP_HEADER, sk_gfp_atomic(sk, GFP_ATOMIC));
3089 if (buff == NULL) {
3090 inet_csk_schedule_ack(sk);
3091 inet_csk(sk)->icsk_ack.ato = TCP_ATO_MIN;
3092 inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK,
3093 TCP_DELACK_MAX, TCP_RTO_MAX);
3094 return;
3097 /* Reserve space for headers and prepare control bits. */
3098 skb_reserve(buff, MAX_TCP_HEADER);
3099 tcp_init_nondata_skb(buff, tcp_acceptable_seq(sk), TCPHDR_ACK);
3101 /* Send it off, this clears delayed acks for us. */
3102 TCP_SKB_CB(buff)->when = tcp_time_stamp;
3103 tcp_transmit_skb(sk, buff, 0, sk_gfp_atomic(sk, GFP_ATOMIC));
3106 /* This routine sends a packet with an out of date sequence
3107 * number. It assumes the other end will try to ack it.
3109 * Question: what should we make while urgent mode?
3110 * 4.4BSD forces sending single byte of data. We cannot send
3111 * out of window data, because we have SND.NXT==SND.MAX...
3113 * Current solution: to send TWO zero-length segments in urgent mode:
3114 * one is with SEG.SEQ=SND.UNA to deliver urgent pointer, another is
3115 * out-of-date with SND.UNA-1 to probe window.
3117 static int tcp_xmit_probe_skb(struct sock *sk, int urgent)
3119 struct tcp_sock *tp = tcp_sk(sk);
3120 struct sk_buff *skb;
3122 /* We don't queue it, tcp_transmit_skb() sets ownership. */
3123 skb = alloc_skb(MAX_TCP_HEADER, sk_gfp_atomic(sk, GFP_ATOMIC));
3124 if (skb == NULL)
3125 return -1;
3127 /* Reserve space for headers and set control bits. */
3128 skb_reserve(skb, MAX_TCP_HEADER);
3129 /* Use a previous sequence. This should cause the other
3130 * end to send an ack. Don't queue or clone SKB, just
3131 * send it.
3133 tcp_init_nondata_skb(skb, tp->snd_una - !urgent, TCPHDR_ACK);
3134 TCP_SKB_CB(skb)->when = tcp_time_stamp;
3135 return tcp_transmit_skb(sk, skb, 0, GFP_ATOMIC);
3138 void tcp_send_window_probe(struct sock *sk)
3140 if (sk->sk_state == TCP_ESTABLISHED) {
3141 tcp_sk(sk)->snd_wl1 = tcp_sk(sk)->rcv_nxt - 1;
3142 tcp_xmit_probe_skb(sk, 0);
3146 /* Initiate keepalive or window probe from timer. */
3147 int tcp_write_wakeup(struct sock *sk)
3149 struct tcp_sock *tp = tcp_sk(sk);
3150 struct sk_buff *skb;
3152 if (sk->sk_state == TCP_CLOSE)
3153 return -1;
3155 if ((skb = tcp_send_head(sk)) != NULL &&
3156 before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp))) {
3157 int err;
3158 unsigned int mss = tcp_current_mss(sk);
3159 unsigned int seg_size = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq;
3161 if (before(tp->pushed_seq, TCP_SKB_CB(skb)->end_seq))
3162 tp->pushed_seq = TCP_SKB_CB(skb)->end_seq;
3164 /* We are probing the opening of a window
3165 * but the window size is != 0
3166 * must have been a result SWS avoidance ( sender )
3168 if (seg_size < TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq ||
3169 skb->len > mss) {
3170 seg_size = min(seg_size, mss);
3171 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_PSH;
3172 if (tcp_fragment(sk, skb, seg_size, mss))
3173 return -1;
3174 } else if (!tcp_skb_pcount(skb))
3175 tcp_set_skb_tso_segs(sk, skb, mss);
3177 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_PSH;
3178 TCP_SKB_CB(skb)->when = tcp_time_stamp;
3179 err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
3180 if (!err)
3181 tcp_event_new_data_sent(sk, skb);
3182 return err;
3183 } else {
3184 if (between(tp->snd_up, tp->snd_una + 1, tp->snd_una + 0xFFFF))
3185 tcp_xmit_probe_skb(sk, 1);
3186 return tcp_xmit_probe_skb(sk, 0);
3190 /* A window probe timeout has occurred. If window is not closed send
3191 * a partial packet else a zero probe.
3193 void tcp_send_probe0(struct sock *sk)
3195 struct inet_connection_sock *icsk = inet_csk(sk);
3196 struct tcp_sock *tp = tcp_sk(sk);
3197 int err;
3199 err = tcp_write_wakeup(sk);
3201 if (tp->packets_out || !tcp_send_head(sk)) {
3202 /* Cancel probe timer, if it is not required. */
3203 icsk->icsk_probes_out = 0;
3204 icsk->icsk_backoff = 0;
3205 return;
3208 if (err <= 0) {
3209 if (icsk->icsk_backoff < sysctl_tcp_retries2)
3210 icsk->icsk_backoff++;
3211 icsk->icsk_probes_out++;
3212 inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
3213 min(icsk->icsk_rto << icsk->icsk_backoff, TCP_RTO_MAX),
3214 TCP_RTO_MAX);
3215 } else {
3216 /* If packet was not sent due to local congestion,
3217 * do not backoff and do not remember icsk_probes_out.
3218 * Let local senders to fight for local resources.
3220 * Use accumulated backoff yet.
3222 if (!icsk->icsk_probes_out)
3223 icsk->icsk_probes_out = 1;
3224 inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
3225 min(icsk->icsk_rto << icsk->icsk_backoff,
3226 TCP_RESOURCE_PROBE_INTERVAL),
3227 TCP_RTO_MAX);