]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - net/ipv4/tcp_output.c
ipv4: Raise tcp PMTU probe mss base size
[mirror_ubuntu-artful-kernel.git] / net / ipv4 / tcp_output.c
CommitLineData
1da177e4
LT
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.
5 *
6 * Implementation of the Transmission Control Protocol(TCP).
7 *
02c30a84 8 * Authors: Ross Biro
1da177e4
LT
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>
19 */
20
21/*
22 * Changes: Pedro Roque : Retransmit queue handled by TCP.
23 * : Fragmentation on mtu decrease
24 * : Segment collapse on retransmit
25 * : AF independence
26 *
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
34 *
35 */
36
91df42be
JP
37#define pr_fmt(fmt) "TCP: " fmt
38
1da177e4
LT
39#include <net/tcp.h>
40
41#include <linux/compiler.h>
5a0e3ad6 42#include <linux/gfp.h>
1da177e4 43#include <linux/module.h>
1da177e4
LT
44
45/* People can turn this off for buggy TCP's found in printers etc. */
ab32ea5d 46int sysctl_tcp_retrans_collapse __read_mostly = 1;
1da177e4 47
09cb105e 48/* People can turn this on to work with those rare, broken TCPs that
15d99e02
RJ
49 * interpret the window field as a signed quantity.
50 */
ab32ea5d 51int sysctl_tcp_workaround_signed_windows __read_mostly = 0;
15d99e02 52
46d3ceab
ED
53/* Default TSQ limit of two TSO segments */
54int sysctl_tcp_limit_output_bytes __read_mostly = 131072;
55
1da177e4
LT
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.
59 */
ab32ea5d 60int sysctl_tcp_tso_win_divisor __read_mostly = 3;
1da177e4 61
35089bb2 62/* By default, RFC2861 behavior. */
ab32ea5d 63int sysctl_tcp_slow_start_after_idle __read_mostly = 1;
35089bb2 64
c9bee3b7
ED
65unsigned int sysctl_tcp_notsent_lowat __read_mostly = UINT_MAX;
66EXPORT_SYMBOL(sysctl_tcp_notsent_lowat);
67
46d3ceab
ED
68static bool tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle,
69 int push_one, gfp_t gfp);
519855c5 70
67edfef7 71/* Account for new data that has been sent to the network. */
cf533ea5 72static void tcp_event_new_data_sent(struct sock *sk, const struct sk_buff *skb)
1da177e4 73{
6ba8a3b1 74 struct inet_connection_sock *icsk = inet_csk(sk);
9e412ba7 75 struct tcp_sock *tp = tcp_sk(sk);
66f5fe62 76 unsigned int prior_packets = tp->packets_out;
9e412ba7 77
fe067e8a 78 tcp_advance_send_head(sk, skb);
1da177e4 79 tp->snd_nxt = TCP_SKB_CB(skb)->end_seq;
8512430e 80
66f5fe62 81 tp->packets_out += tcp_skb_pcount(skb);
6ba8a3b1 82 if (!prior_packets || icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS ||
6a5dc9e5 83 icsk->icsk_pending == ICSK_TIME_LOSS_PROBE) {
750ea2ba 84 tcp_rearm_rto(sk);
6a5dc9e5 85 }
f19c29e3 86
f7324acd
DM
87 NET_ADD_STATS(sock_net(sk), LINUX_MIB_TCPORIGDATASENT,
88 tcp_skb_pcount(skb));
1da177e4
LT
89}
90
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:
96 */
cf533ea5 97static inline __u32 tcp_acceptable_seq(const struct sock *sk)
1da177e4 98{
cf533ea5 99 const struct tcp_sock *tp = tcp_sk(sk);
9e412ba7 100
90840def 101 if (!before(tcp_wnd_end(tp), tp->snd_nxt))
1da177e4
LT
102 return tp->snd_nxt;
103 else
90840def 104 return tcp_wnd_end(tp);
1da177e4
LT
105}
106
107/* Calculate mss to advertise in SYN segment.
108 * RFC1122, RFC1063, draft-ietf-tcpimpl-pmtud-01 state that:
109 *
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".
120 */
121static __u16 tcp_advertise_mss(struct sock *sk)
122{
123 struct tcp_sock *tp = tcp_sk(sk);
cf533ea5 124 const struct dst_entry *dst = __sk_dst_get(sk);
1da177e4
LT
125 int mss = tp->advmss;
126
0dbaee3b
DM
127 if (dst) {
128 unsigned int metric = dst_metric_advmss(dst);
129
130 if (metric < mss) {
131 mss = metric;
132 tp->advmss = mss;
133 }
1da177e4
LT
134 }
135
136 return (__u16)mss;
137}
138
139/* RFC2861. Reset CWND after idle period longer RTO to "restart window".
140 * This is the first part of cwnd validation mechanism. */
cf533ea5 141static void tcp_cwnd_restart(struct sock *sk, const struct dst_entry *dst)
1da177e4 142{
463c84b9 143 struct tcp_sock *tp = tcp_sk(sk);
1da177e4
LT
144 s32 delta = tcp_time_stamp - tp->lsndtime;
145 u32 restart_cwnd = tcp_init_cwnd(tp, dst);
146 u32 cwnd = tp->snd_cwnd;
147
6687e988 148 tcp_ca_event(sk, CA_EVENT_CWND_RESTART);
1da177e4 149
6687e988 150 tp->snd_ssthresh = tcp_current_ssthresh(sk);
1da177e4
LT
151 restart_cwnd = min(restart_cwnd, cwnd);
152
463c84b9 153 while ((delta -= inet_csk(sk)->icsk_rto) > 0 && cwnd > restart_cwnd)
1da177e4
LT
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;
158}
159
67edfef7 160/* Congestion state accounting after a packet has been sent. */
40efc6fa 161static void tcp_event_data_sent(struct tcp_sock *tp,
cf533ea5 162 struct sock *sk)
1da177e4 163{
463c84b9
ACM
164 struct inet_connection_sock *icsk = inet_csk(sk);
165 const u32 now = tcp_time_stamp;
bcefe17c 166 const struct dst_entry *dst = __sk_dst_get(sk);
1da177e4 167
35089bb2
DM
168 if (sysctl_tcp_slow_start_after_idle &&
169 (!tp->packets_out && (s32)(now - tp->lsndtime) > icsk->icsk_rto))
463c84b9 170 tcp_cwnd_restart(sk, __sk_dst_get(sk));
1da177e4
LT
171
172 tp->lsndtime = now;
173
174 /* If it is a reply for ato after last received
175 * packet, enter pingpong mode.
176 */
bcefe17c
CW
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;
1da177e4
LT
180}
181
67edfef7 182/* Account for an ACK we sent. */
40efc6fa 183static inline void tcp_event_ack_sent(struct sock *sk, unsigned int pkts)
1da177e4 184{
463c84b9
ACM
185 tcp_dec_quickack_mode(sk, pkts);
186 inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK);
1da177e4
LT
187}
188
85f16525
YC
189
190u32 tcp_default_init_rwnd(u32 mss)
191{
192 /* Initial receive window should be twice of TCP_INIT_CWND to
9ef71e0c 193 * enable proper sending of new unsent data during fast recovery
85f16525
YC
194 * (RFC 3517, Section 4, NextSeg() rule (2)). Further place a
195 * limit when mss is larger than 1460.
196 */
197 u32 init_rwnd = TCP_INIT_CWND * 2;
198
199 if (mss > 1460)
200 init_rwnd = max((1460 * init_rwnd) / mss, 2U);
201 return init_rwnd;
202}
203
1da177e4
LT
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.
210 */
211void tcp_select_initial_window(int __space, __u32 mss,
212 __u32 *rcv_wnd, __u32 *window_clamp,
31d12926 213 int wscale_ok, __u8 *rcv_wscale,
214 __u32 init_rcv_wnd)
1da177e4
LT
215{
216 unsigned int space = (__space < 0 ? 0 : __space);
217
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);
222
223 /* Quantize space offering to a multiple of mss if possible. */
224 if (space > mss)
225 space = (space / mss) * mss;
226
227 /* NOTE: offering an initial window larger than 32767
15d99e02
RJ
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.
1da177e4 234 */
15d99e02
RJ
235 if (sysctl_tcp_workaround_signed_windows)
236 (*rcv_wnd) = min(space, MAX_TCP_WINDOW);
237 else
238 (*rcv_wnd) = space;
239
1da177e4
LT
240 (*rcv_wscale) = 0;
241 if (wscale_ok) {
242 /* Set window scaling on max possible window
e905a9ed 243 * See RFC1323 for an explanation of the limit to 14
1da177e4
LT
244 */
245 space = max_t(u32, sysctl_tcp_rmem[2], sysctl_rmem_max);
316c1592 246 space = min_t(u32, space, *window_clamp);
1da177e4
LT
247 while (space > 65535 && (*rcv_wscale) < 14) {
248 space >>= 1;
249 (*rcv_wscale)++;
250 }
251 }
252
056834d9 253 if (mss > (1 << *rcv_wscale)) {
85f16525
YC
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);
1da177e4
LT
257 }
258
259 /* Set the clamp no higher than max representable value */
260 (*window_clamp) = min(65535U << (*rcv_wscale), *window_clamp);
261}
4bc2f18b 262EXPORT_SYMBOL(tcp_select_initial_window);
1da177e4
LT
263
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.
268 */
40efc6fa 269static u16 tcp_select_window(struct sock *sk)
1da177e4
LT
270{
271 struct tcp_sock *tp = tcp_sk(sk);
8e165e20 272 u32 old_win = tp->rcv_wnd;
1da177e4
LT
273 u32 cur_win = tcp_receive_window(tp);
274 u32 new_win = __tcp_select_window(sk);
275
276 /* Never shrink the offered window */
2de979bd 277 if (new_win < cur_win) {
1da177e4
LT
278 /* Danger Will Robinson!
279 * Don't update rcv_wup/rcv_wnd here or else
280 * we will not be able to advertise a zero
281 * window in time. --DaveM
282 *
283 * Relax Will Robinson.
284 */
8e165e20
FW
285 if (new_win == 0)
286 NET_INC_STATS(sock_net(sk),
287 LINUX_MIB_TCPWANTZEROWINDOWADV);
607bfbf2 288 new_win = ALIGN(cur_win, 1 << tp->rx_opt.rcv_wscale);
1da177e4
LT
289 }
290 tp->rcv_wnd = new_win;
291 tp->rcv_wup = tp->rcv_nxt;
292
293 /* Make sure we do not exceed the maximum possible
294 * scaled window.
295 */
15d99e02 296 if (!tp->rx_opt.rcv_wscale && sysctl_tcp_workaround_signed_windows)
1da177e4
LT
297 new_win = min(new_win, MAX_TCP_WINDOW);
298 else
299 new_win = min(new_win, (65535U << tp->rx_opt.rcv_wscale));
300
301 /* RFC1323 scaling applied */
302 new_win >>= tp->rx_opt.rcv_wscale;
303
304 /* If we advertise zero window, disable fast path. */
8e165e20 305 if (new_win == 0) {
1da177e4 306 tp->pred_flags = 0;
8e165e20
FW
307 if (old_win)
308 NET_INC_STATS(sock_net(sk),
309 LINUX_MIB_TCPTOZEROWINDOWADV);
310 } else if (old_win == 0) {
311 NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPFROMZEROWINDOWADV);
312 }
1da177e4
LT
313
314 return new_win;
315}
316
67edfef7 317/* Packet ECN state for a SYN-ACK */
735d3831 318static void tcp_ecn_send_synack(struct sock *sk, struct sk_buff *skb)
bdf1ee5d 319{
30e502a3
DB
320 const struct tcp_sock *tp = tcp_sk(sk);
321
4de075e0 322 TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_CWR;
056834d9 323 if (!(tp->ecn_flags & TCP_ECN_OK))
4de075e0 324 TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_ECE;
30e502a3
DB
325 else if (tcp_ca_needs_ecn(sk))
326 INET_ECN_xmit(sk);
bdf1ee5d
IJ
327}
328
67edfef7 329/* Packet ECN state for a SYN. */
735d3831 330static void tcp_ecn_send_syn(struct sock *sk, struct sk_buff *skb)
bdf1ee5d
IJ
331{
332 struct tcp_sock *tp = tcp_sk(sk);
f7b3bec6
FW
333 bool use_ecn = sock_net(sk)->ipv4.sysctl_tcp_ecn == 1 ||
334 tcp_ca_needs_ecn(sk);
335
336 if (!use_ecn) {
337 const struct dst_entry *dst = __sk_dst_get(sk);
338
339 if (dst && dst_feature(dst, RTAX_FEATURE_ECN))
340 use_ecn = true;
341 }
bdf1ee5d
IJ
342
343 tp->ecn_flags = 0;
f7b3bec6
FW
344
345 if (use_ecn) {
4de075e0 346 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_ECE | TCPHDR_CWR;
bdf1ee5d 347 tp->ecn_flags = TCP_ECN_OK;
30e502a3
DB
348 if (tcp_ca_needs_ecn(sk))
349 INET_ECN_xmit(sk);
bdf1ee5d
IJ
350 }
351}
352
735d3831
FW
353static void
354tcp_ecn_make_synack(const struct request_sock *req, struct tcphdr *th,
30e502a3 355 struct sock *sk)
bdf1ee5d 356{
30e502a3 357 if (inet_rsk(req)->ecn_ok) {
bdf1ee5d 358 th->ece = 1;
30e502a3
DB
359 if (tcp_ca_needs_ecn(sk))
360 INET_ECN_xmit(sk);
361 }
bdf1ee5d
IJ
362}
363
67edfef7
AK
364/* Set up ECN state for a packet on a ESTABLISHED socket that is about to
365 * be sent.
366 */
735d3831 367static void tcp_ecn_send(struct sock *sk, struct sk_buff *skb,
bdf1ee5d
IJ
368 int tcp_header_len)
369{
370 struct tcp_sock *tp = tcp_sk(sk);
371
372 if (tp->ecn_flags & TCP_ECN_OK) {
373 /* Not-retransmitted data segment: set ECT and inject CWR. */
374 if (skb->len != tcp_header_len &&
375 !before(TCP_SKB_CB(skb)->seq, tp->snd_nxt)) {
376 INET_ECN_xmit(sk);
056834d9 377 if (tp->ecn_flags & TCP_ECN_QUEUE_CWR) {
bdf1ee5d
IJ
378 tp->ecn_flags &= ~TCP_ECN_QUEUE_CWR;
379 tcp_hdr(skb)->cwr = 1;
380 skb_shinfo(skb)->gso_type |= SKB_GSO_TCP_ECN;
381 }
30e502a3 382 } else if (!tcp_ca_needs_ecn(sk)) {
bdf1ee5d
IJ
383 /* ACK or retransmitted segment: clear ECT|CE */
384 INET_ECN_dontxmit(sk);
385 }
386 if (tp->ecn_flags & TCP_ECN_DEMAND_CWR)
387 tcp_hdr(skb)->ece = 1;
388 }
389}
390
e870a8ef
IJ
391/* Constructs common control bits of non-data skb. If SYN/FIN is present,
392 * auto increment end seqno.
393 */
394static void tcp_init_nondata_skb(struct sk_buff *skb, u32 seq, u8 flags)
395{
7b7fc97a
ED
396 struct skb_shared_info *shinfo = skb_shinfo(skb);
397
2e8e18ef 398 skb->ip_summed = CHECKSUM_PARTIAL;
e870a8ef
IJ
399 skb->csum = 0;
400
4de075e0 401 TCP_SKB_CB(skb)->tcp_flags = flags;
e870a8ef
IJ
402 TCP_SKB_CB(skb)->sacked = 0;
403
cd7d8498 404 tcp_skb_pcount_set(skb, 1);
7b7fc97a
ED
405 shinfo->gso_size = 0;
406 shinfo->gso_type = 0;
e870a8ef
IJ
407
408 TCP_SKB_CB(skb)->seq = seq;
a3433f35 409 if (flags & (TCPHDR_SYN | TCPHDR_FIN))
e870a8ef
IJ
410 seq++;
411 TCP_SKB_CB(skb)->end_seq = seq;
412}
413
a2a385d6 414static inline bool tcp_urg_mode(const struct tcp_sock *tp)
33f5f57e
IJ
415{
416 return tp->snd_una != tp->snd_up;
417}
418
33ad798c
AL
419#define OPTION_SACK_ADVERTISE (1 << 0)
420#define OPTION_TS (1 << 1)
421#define OPTION_MD5 (1 << 2)
89e95a61 422#define OPTION_WSCALE (1 << 3)
2100c8d2 423#define OPTION_FAST_OPEN_COOKIE (1 << 8)
33ad798c
AL
424
425struct tcp_out_options {
2100c8d2
YC
426 u16 options; /* bit field of OPTION_* */
427 u16 mss; /* 0 to disable */
33ad798c
AL
428 u8 ws; /* window scale, 0 to disable */
429 u8 num_sack_blocks; /* number of SACK blocks to include */
bd0388ae 430 u8 hash_size; /* bytes in hash_location */
bd0388ae 431 __u8 *hash_location; /* temporary pointer, overloaded */
2100c8d2
YC
432 __u32 tsval, tsecr; /* need to include OPTION_TS */
433 struct tcp_fastopen_cookie *fastopen_cookie; /* Fast open cookie */
33ad798c
AL
434};
435
67edfef7
AK
436/* Write previously computed TCP options to the packet.
437 *
438 * Beware: Something in the Internet is very sensitive to the ordering of
fd6149d3
IJ
439 * TCP options, we learned this through the hard way, so be careful here.
440 * Luckily we can at least blame others for their non-compliance but from
8e3bff96 441 * inter-operability perspective it seems that we're somewhat stuck with
fd6149d3
IJ
442 * the ordering which we have been using if we want to keep working with
443 * those broken things (not that it currently hurts anybody as there isn't
444 * particular reason why the ordering would need to be changed).
445 *
446 * At least SACK_PERM as the first option is known to lead to a disaster
447 * (but it may well be that other scenarios fail similarly).
448 */
33ad798c 449static void tcp_options_write(__be32 *ptr, struct tcp_sock *tp,
bd0388ae
WAS
450 struct tcp_out_options *opts)
451{
2100c8d2 452 u16 options = opts->options; /* mungable copy */
bd0388ae 453
bd0388ae 454 if (unlikely(OPTION_MD5 & options)) {
1a2c6181
CP
455 *ptr++ = htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16) |
456 (TCPOPT_MD5SIG << 8) | TCPOLEN_MD5SIG);
bd0388ae
WAS
457 /* overload cookie hash location */
458 opts->hash_location = (__u8 *)ptr;
33ad798c 459 ptr += 4;
40efc6fa 460 }
33ad798c 461
fd6149d3
IJ
462 if (unlikely(opts->mss)) {
463 *ptr++ = htonl((TCPOPT_MSS << 24) |
464 (TCPOLEN_MSS << 16) |
465 opts->mss);
466 }
467
bd0388ae
WAS
468 if (likely(OPTION_TS & options)) {
469 if (unlikely(OPTION_SACK_ADVERTISE & options)) {
33ad798c
AL
470 *ptr++ = htonl((TCPOPT_SACK_PERM << 24) |
471 (TCPOLEN_SACK_PERM << 16) |
472 (TCPOPT_TIMESTAMP << 8) |
473 TCPOLEN_TIMESTAMP);
bd0388ae 474 options &= ~OPTION_SACK_ADVERTISE;
33ad798c
AL
475 } else {
476 *ptr++ = htonl((TCPOPT_NOP << 24) |
477 (TCPOPT_NOP << 16) |
478 (TCPOPT_TIMESTAMP << 8) |
479 TCPOLEN_TIMESTAMP);
480 }
481 *ptr++ = htonl(opts->tsval);
482 *ptr++ = htonl(opts->tsecr);
483 }
484
bd0388ae 485 if (unlikely(OPTION_SACK_ADVERTISE & options)) {
33ad798c
AL
486 *ptr++ = htonl((TCPOPT_NOP << 24) |
487 (TCPOPT_NOP << 16) |
488 (TCPOPT_SACK_PERM << 8) |
489 TCPOLEN_SACK_PERM);
490 }
491
bd0388ae 492 if (unlikely(OPTION_WSCALE & options)) {
33ad798c
AL
493 *ptr++ = htonl((TCPOPT_NOP << 24) |
494 (TCPOPT_WINDOW << 16) |
495 (TCPOLEN_WINDOW << 8) |
496 opts->ws);
497 }
498
499 if (unlikely(opts->num_sack_blocks)) {
500 struct tcp_sack_block *sp = tp->rx_opt.dsack ?
501 tp->duplicate_sack : tp->selective_acks;
40efc6fa
SH
502 int this_sack;
503
504 *ptr++ = htonl((TCPOPT_NOP << 24) |
505 (TCPOPT_NOP << 16) |
506 (TCPOPT_SACK << 8) |
33ad798c 507 (TCPOLEN_SACK_BASE + (opts->num_sack_blocks *
40efc6fa 508 TCPOLEN_SACK_PERBLOCK)));
2de979bd 509
33ad798c
AL
510 for (this_sack = 0; this_sack < opts->num_sack_blocks;
511 ++this_sack) {
40efc6fa
SH
512 *ptr++ = htonl(sp[this_sack].start_seq);
513 *ptr++ = htonl(sp[this_sack].end_seq);
514 }
2de979bd 515
5861f8e5 516 tp->rx_opt.dsack = 0;
40efc6fa 517 }
2100c8d2
YC
518
519 if (unlikely(OPTION_FAST_OPEN_COOKIE & options)) {
520 struct tcp_fastopen_cookie *foc = opts->fastopen_cookie;
521
522 *ptr++ = htonl((TCPOPT_EXP << 24) |
523 ((TCPOLEN_EXP_FASTOPEN_BASE + foc->len) << 16) |
524 TCPOPT_FASTOPEN_MAGIC);
525
526 memcpy(ptr, foc->val, foc->len);
527 if ((foc->len & 3) == 2) {
528 u8 *align = ((u8 *)ptr) + foc->len;
529 align[0] = align[1] = TCPOPT_NOP;
530 }
531 ptr += (foc->len + 3) >> 2;
532 }
33ad798c
AL
533}
534
67edfef7
AK
535/* Compute TCP options for SYN packets. This is not the final
536 * network wire format yet.
537 */
95c96174 538static unsigned int tcp_syn_options(struct sock *sk, struct sk_buff *skb,
33ad798c 539 struct tcp_out_options *opts,
cf533ea5
ED
540 struct tcp_md5sig_key **md5)
541{
33ad798c 542 struct tcp_sock *tp = tcp_sk(sk);
95c96174 543 unsigned int remaining = MAX_TCP_OPTION_SPACE;
783237e8 544 struct tcp_fastopen_request *fastopen = tp->fastopen_req;
33ad798c 545
cfb6eeb4 546#ifdef CONFIG_TCP_MD5SIG
33ad798c
AL
547 *md5 = tp->af_specific->md5_lookup(sk, sk);
548 if (*md5) {
549 opts->options |= OPTION_MD5;
bd0388ae 550 remaining -= TCPOLEN_MD5SIG_ALIGNED;
cfb6eeb4 551 }
33ad798c
AL
552#else
553 *md5 = NULL;
cfb6eeb4 554#endif
33ad798c
AL
555
556 /* We always get an MSS option. The option bytes which will be seen in
557 * normal data packets should timestamps be used, must be in the MSS
558 * advertised. But we subtract them from tp->mss_cache so that
559 * calculations in tcp_sendmsg are simpler etc. So account for this
560 * fact here if necessary. If we don't do this correctly, as a
561 * receiver we won't recognize data packets as being full sized when we
562 * should, and thus we won't abide by the delayed ACK rules correctly.
563 * SACKs don't matter, we never delay an ACK when we have any of those
564 * going out. */
565 opts->mss = tcp_advertise_mss(sk);
bd0388ae 566 remaining -= TCPOLEN_MSS_ALIGNED;
33ad798c 567
bb5b7c11 568 if (likely(sysctl_tcp_timestamps && *md5 == NULL)) {
33ad798c 569 opts->options |= OPTION_TS;
7faee5c0 570 opts->tsval = tcp_skb_timestamp(skb) + tp->tsoffset;
33ad798c 571 opts->tsecr = tp->rx_opt.ts_recent;
bd0388ae 572 remaining -= TCPOLEN_TSTAMP_ALIGNED;
33ad798c 573 }
bb5b7c11 574 if (likely(sysctl_tcp_window_scaling)) {
33ad798c 575 opts->ws = tp->rx_opt.rcv_wscale;
89e95a61 576 opts->options |= OPTION_WSCALE;
bd0388ae 577 remaining -= TCPOLEN_WSCALE_ALIGNED;
33ad798c 578 }
bb5b7c11 579 if (likely(sysctl_tcp_sack)) {
33ad798c 580 opts->options |= OPTION_SACK_ADVERTISE;
b32d1310 581 if (unlikely(!(OPTION_TS & opts->options)))
bd0388ae 582 remaining -= TCPOLEN_SACKPERM_ALIGNED;
33ad798c
AL
583 }
584
783237e8
YC
585 if (fastopen && fastopen->cookie.len >= 0) {
586 u32 need = TCPOLEN_EXP_FASTOPEN_BASE + fastopen->cookie.len;
587 need = (need + 3) & ~3U; /* Align to 32 bits */
588 if (remaining >= need) {
589 opts->options |= OPTION_FAST_OPEN_COOKIE;
590 opts->fastopen_cookie = &fastopen->cookie;
591 remaining -= need;
592 tp->syn_fastopen = 1;
593 }
594 }
bd0388ae 595
bd0388ae 596 return MAX_TCP_OPTION_SPACE - remaining;
40efc6fa
SH
597}
598
67edfef7 599/* Set up TCP options for SYN-ACKs. */
95c96174 600static unsigned int tcp_synack_options(struct sock *sk,
33ad798c 601 struct request_sock *req,
95c96174 602 unsigned int mss, struct sk_buff *skb,
33ad798c 603 struct tcp_out_options *opts,
4957faad 604 struct tcp_md5sig_key **md5,
8336886f 605 struct tcp_fastopen_cookie *foc)
4957faad 606{
33ad798c 607 struct inet_request_sock *ireq = inet_rsk(req);
95c96174 608 unsigned int remaining = MAX_TCP_OPTION_SPACE;
33ad798c 609
cfb6eeb4 610#ifdef CONFIG_TCP_MD5SIG
33ad798c
AL
611 *md5 = tcp_rsk(req)->af_specific->md5_lookup(sk, req);
612 if (*md5) {
613 opts->options |= OPTION_MD5;
4957faad
WAS
614 remaining -= TCPOLEN_MD5SIG_ALIGNED;
615
616 /* We can't fit any SACK blocks in a packet with MD5 + TS
617 * options. There was discussion about disabling SACK
618 * rather than TS in order to fit in better with old,
619 * buggy kernels, but that was deemed to be unnecessary.
620 */
de213e5e 621 ireq->tstamp_ok &= !ireq->sack_ok;
cfb6eeb4 622 }
33ad798c
AL
623#else
624 *md5 = NULL;
cfb6eeb4 625#endif
33ad798c 626
4957faad 627 /* We always send an MSS option. */
33ad798c 628 opts->mss = mss;
4957faad 629 remaining -= TCPOLEN_MSS_ALIGNED;
33ad798c
AL
630
631 if (likely(ireq->wscale_ok)) {
632 opts->ws = ireq->rcv_wscale;
89e95a61 633 opts->options |= OPTION_WSCALE;
4957faad 634 remaining -= TCPOLEN_WSCALE_ALIGNED;
33ad798c 635 }
de213e5e 636 if (likely(ireq->tstamp_ok)) {
33ad798c 637 opts->options |= OPTION_TS;
7faee5c0 638 opts->tsval = tcp_skb_timestamp(skb);
33ad798c 639 opts->tsecr = req->ts_recent;
4957faad 640 remaining -= TCPOLEN_TSTAMP_ALIGNED;
33ad798c
AL
641 }
642 if (likely(ireq->sack_ok)) {
643 opts->options |= OPTION_SACK_ADVERTISE;
de213e5e 644 if (unlikely(!ireq->tstamp_ok))
4957faad 645 remaining -= TCPOLEN_SACKPERM_ALIGNED;
33ad798c 646 }
89278c9d 647 if (foc != NULL && foc->len >= 0) {
8336886f
JC
648 u32 need = TCPOLEN_EXP_FASTOPEN_BASE + foc->len;
649 need = (need + 3) & ~3U; /* Align to 32 bits */
650 if (remaining >= need) {
651 opts->options |= OPTION_FAST_OPEN_COOKIE;
652 opts->fastopen_cookie = foc;
653 remaining -= need;
654 }
655 }
1a2c6181 656
4957faad 657 return MAX_TCP_OPTION_SPACE - remaining;
33ad798c
AL
658}
659
67edfef7
AK
660/* Compute TCP options for ESTABLISHED sockets. This is not the
661 * final wire format yet.
662 */
95c96174 663static unsigned int tcp_established_options(struct sock *sk, struct sk_buff *skb,
33ad798c 664 struct tcp_out_options *opts,
cf533ea5
ED
665 struct tcp_md5sig_key **md5)
666{
33ad798c 667 struct tcp_sock *tp = tcp_sk(sk);
95c96174 668 unsigned int size = 0;
cabeccbd 669 unsigned int eff_sacks;
33ad798c 670
5843ef42
AK
671 opts->options = 0;
672
33ad798c
AL
673#ifdef CONFIG_TCP_MD5SIG
674 *md5 = tp->af_specific->md5_lookup(sk, sk);
675 if (unlikely(*md5)) {
676 opts->options |= OPTION_MD5;
677 size += TCPOLEN_MD5SIG_ALIGNED;
678 }
679#else
680 *md5 = NULL;
681#endif
682
683 if (likely(tp->rx_opt.tstamp_ok)) {
684 opts->options |= OPTION_TS;
7faee5c0 685 opts->tsval = skb ? tcp_skb_timestamp(skb) + tp->tsoffset : 0;
33ad798c
AL
686 opts->tsecr = tp->rx_opt.ts_recent;
687 size += TCPOLEN_TSTAMP_ALIGNED;
688 }
689
cabeccbd
IJ
690 eff_sacks = tp->rx_opt.num_sacks + tp->rx_opt.dsack;
691 if (unlikely(eff_sacks)) {
95c96174 692 const unsigned int remaining = MAX_TCP_OPTION_SPACE - size;
33ad798c 693 opts->num_sack_blocks =
95c96174 694 min_t(unsigned int, eff_sacks,
33ad798c
AL
695 (remaining - TCPOLEN_SACK_BASE_ALIGNED) /
696 TCPOLEN_SACK_PERBLOCK);
697 size += TCPOLEN_SACK_BASE_ALIGNED +
698 opts->num_sack_blocks * TCPOLEN_SACK_PERBLOCK;
699 }
700
701 return size;
40efc6fa 702}
1da177e4 703
46d3ceab
ED
704
705/* TCP SMALL QUEUES (TSQ)
706 *
707 * TSQ goal is to keep small amount of skbs per tcp flow in tx queues (qdisc+dev)
708 * to reduce RTT and bufferbloat.
709 * We do this using a special skb destructor (tcp_wfree).
710 *
711 * Its important tcp_wfree() can be replaced by sock_wfree() in the event skb
712 * needs to be reallocated in a driver.
8e3bff96 713 * The invariant being skb->truesize subtracted from sk->sk_wmem_alloc
46d3ceab
ED
714 *
715 * Since transmit from skb destructor is forbidden, we use a tasklet
716 * to process all sockets that eventually need to send more skbs.
717 * We use one tasklet per cpu, with its own queue of sockets.
718 */
719struct tsq_tasklet {
720 struct tasklet_struct tasklet;
721 struct list_head head; /* queue of tcp sockets */
722};
723static DEFINE_PER_CPU(struct tsq_tasklet, tsq_tasklet);
724
6f458dfb
ED
725static void tcp_tsq_handler(struct sock *sk)
726{
727 if ((1 << sk->sk_state) &
728 (TCPF_ESTABLISHED | TCPF_FIN_WAIT1 | TCPF_CLOSING |
729 TCPF_CLOSE_WAIT | TCPF_LAST_ACK))
bf06200e
JO
730 tcp_write_xmit(sk, tcp_current_mss(sk), tcp_sk(sk)->nonagle,
731 0, GFP_ATOMIC);
6f458dfb 732}
46d3ceab 733/*
8e3bff96 734 * One tasklet per cpu tries to send more skbs.
46d3ceab 735 * We run in tasklet context but need to disable irqs when
8e3bff96 736 * transferring tsq->head because tcp_wfree() might
46d3ceab
ED
737 * interrupt us (non NAPI drivers)
738 */
739static void tcp_tasklet_func(unsigned long data)
740{
741 struct tsq_tasklet *tsq = (struct tsq_tasklet *)data;
742 LIST_HEAD(list);
743 unsigned long flags;
744 struct list_head *q, *n;
745 struct tcp_sock *tp;
746 struct sock *sk;
747
748 local_irq_save(flags);
749 list_splice_init(&tsq->head, &list);
750 local_irq_restore(flags);
751
752 list_for_each_safe(q, n, &list) {
753 tp = list_entry(q, struct tcp_sock, tsq_node);
754 list_del(&tp->tsq_node);
755
756 sk = (struct sock *)tp;
757 bh_lock_sock(sk);
758
759 if (!sock_owned_by_user(sk)) {
6f458dfb 760 tcp_tsq_handler(sk);
46d3ceab
ED
761 } else {
762 /* defer the work to tcp_release_cb() */
6f458dfb 763 set_bit(TCP_TSQ_DEFERRED, &tp->tsq_flags);
46d3ceab
ED
764 }
765 bh_unlock_sock(sk);
766
767 clear_bit(TSQ_QUEUED, &tp->tsq_flags);
768 sk_free(sk);
769 }
770}
771
6f458dfb
ED
772#define TCP_DEFERRED_ALL ((1UL << TCP_TSQ_DEFERRED) | \
773 (1UL << TCP_WRITE_TIMER_DEFERRED) | \
563d34d0
ED
774 (1UL << TCP_DELACK_TIMER_DEFERRED) | \
775 (1UL << TCP_MTU_REDUCED_DEFERRED))
46d3ceab
ED
776/**
777 * tcp_release_cb - tcp release_sock() callback
778 * @sk: socket
779 *
780 * called from release_sock() to perform protocol dependent
781 * actions before socket release.
782 */
783void tcp_release_cb(struct sock *sk)
784{
785 struct tcp_sock *tp = tcp_sk(sk);
6f458dfb 786 unsigned long flags, nflags;
46d3ceab 787
6f458dfb
ED
788 /* perform an atomic operation only if at least one flag is set */
789 do {
790 flags = tp->tsq_flags;
791 if (!(flags & TCP_DEFERRED_ALL))
792 return;
793 nflags = flags & ~TCP_DEFERRED_ALL;
794 } while (cmpxchg(&tp->tsq_flags, flags, nflags) != flags);
795
796 if (flags & (1UL << TCP_TSQ_DEFERRED))
797 tcp_tsq_handler(sk);
798
c3f9b018
ED
799 /* Here begins the tricky part :
800 * We are called from release_sock() with :
801 * 1) BH disabled
802 * 2) sk_lock.slock spinlock held
803 * 3) socket owned by us (sk->sk_lock.owned == 1)
804 *
805 * But following code is meant to be called from BH handlers,
806 * so we should keep BH disabled, but early release socket ownership
807 */
808 sock_release_ownership(sk);
809
144d56e9 810 if (flags & (1UL << TCP_WRITE_TIMER_DEFERRED)) {
6f458dfb 811 tcp_write_timer_handler(sk);
144d56e9
ED
812 __sock_put(sk);
813 }
814 if (flags & (1UL << TCP_DELACK_TIMER_DEFERRED)) {
6f458dfb 815 tcp_delack_timer_handler(sk);
144d56e9
ED
816 __sock_put(sk);
817 }
818 if (flags & (1UL << TCP_MTU_REDUCED_DEFERRED)) {
4fab9071 819 inet_csk(sk)->icsk_af_ops->mtu_reduced(sk);
144d56e9
ED
820 __sock_put(sk);
821 }
46d3ceab
ED
822}
823EXPORT_SYMBOL(tcp_release_cb);
824
825void __init tcp_tasklet_init(void)
826{
827 int i;
828
829 for_each_possible_cpu(i) {
830 struct tsq_tasklet *tsq = &per_cpu(tsq_tasklet, i);
831
832 INIT_LIST_HEAD(&tsq->head);
833 tasklet_init(&tsq->tasklet,
834 tcp_tasklet_func,
835 (unsigned long)tsq);
836 }
837}
838
839/*
840 * Write buffer destructor automatically called from kfree_skb.
8e3bff96 841 * We can't xmit new skbs from this context, as we might already
46d3ceab
ED
842 * hold qdisc lock.
843 */
d6a4a104 844void tcp_wfree(struct sk_buff *skb)
46d3ceab
ED
845{
846 struct sock *sk = skb->sk;
847 struct tcp_sock *tp = tcp_sk(sk);
9b462d02
ED
848 int wmem;
849
850 /* Keep one reference on sk_wmem_alloc.
851 * Will be released by sk_free() from here or tcp_tasklet_func()
852 */
853 wmem = atomic_sub_return(skb->truesize - 1, &sk->sk_wmem_alloc);
854
855 /* If this softirq is serviced by ksoftirqd, we are likely under stress.
856 * Wait until our queues (qdisc + devices) are drained.
857 * This gives :
858 * - less callbacks to tcp_write_xmit(), reducing stress (batches)
859 * - chance for incoming ACK (processed by another cpu maybe)
860 * to migrate this flow (skb->ooo_okay will be eventually set)
861 */
862 if (wmem >= SKB_TRUESIZE(1) && this_cpu_ksoftirqd() == current)
863 goto out;
46d3ceab
ED
864
865 if (test_and_clear_bit(TSQ_THROTTLED, &tp->tsq_flags) &&
866 !test_and_set_bit(TSQ_QUEUED, &tp->tsq_flags)) {
867 unsigned long flags;
868 struct tsq_tasklet *tsq;
869
46d3ceab
ED
870 /* queue this socket to tasklet queue */
871 local_irq_save(flags);
903ceff7 872 tsq = this_cpu_ptr(&tsq_tasklet);
46d3ceab
ED
873 list_add(&tp->tsq_node, &tsq->head);
874 tasklet_schedule(&tsq->tasklet);
875 local_irq_restore(flags);
9b462d02 876 return;
46d3ceab 877 }
9b462d02
ED
878out:
879 sk_free(sk);
46d3ceab
ED
880}
881
1da177e4
LT
882/* This routine actually transmits TCP packets queued in by
883 * tcp_do_sendmsg(). This is used by both the initial
884 * transmission and possible later retransmissions.
885 * All SKB's seen here are completely headerless. It is our
886 * job to build the TCP header, and pass the packet down to
887 * IP so it can do the same plus pass the packet off to the
888 * device.
889 *
890 * We are working here with either a clone of the original
891 * SKB, or a fresh unique copy made by the retransmit engine.
892 */
056834d9
IJ
893static int tcp_transmit_skb(struct sock *sk, struct sk_buff *skb, int clone_it,
894 gfp_t gfp_mask)
1da177e4 895{
dfb4b9dc
DM
896 const struct inet_connection_sock *icsk = inet_csk(sk);
897 struct inet_sock *inet;
898 struct tcp_sock *tp;
899 struct tcp_skb_cb *tcb;
33ad798c 900 struct tcp_out_options opts;
95c96174 901 unsigned int tcp_options_size, tcp_header_size;
cfb6eeb4 902 struct tcp_md5sig_key *md5;
dfb4b9dc 903 struct tcphdr *th;
dfb4b9dc
DM
904 int err;
905
906 BUG_ON(!skb || !tcp_skb_pcount(skb));
907
ccdbb6e9 908 if (clone_it) {
740b0f18 909 skb_mstamp_get(&skb->skb_mstamp);
ccdbb6e9 910
dfb4b9dc
DM
911 if (unlikely(skb_cloned(skb)))
912 skb = pskb_copy(skb, gfp_mask);
913 else
914 skb = skb_clone(skb, gfp_mask);
915 if (unlikely(!skb))
916 return -ENOBUFS;
917 }
1da177e4 918
dfb4b9dc
DM
919 inet = inet_sk(sk);
920 tp = tcp_sk(sk);
921 tcb = TCP_SKB_CB(skb);
33ad798c 922 memset(&opts, 0, sizeof(opts));
1da177e4 923
4de075e0 924 if (unlikely(tcb->tcp_flags & TCPHDR_SYN))
33ad798c
AL
925 tcp_options_size = tcp_syn_options(sk, skb, &opts, &md5);
926 else
927 tcp_options_size = tcp_established_options(sk, skb, &opts,
928 &md5);
929 tcp_header_size = tcp_options_size + sizeof(struct tcphdr);
e905a9ed 930
547669d4 931 if (tcp_packets_in_flight(tp) == 0)
dfb4b9dc 932 tcp_ca_event(sk, CA_EVENT_TX_START);
547669d4
ED
933
934 /* if no packet is in qdisc/device queue, then allow XPS to select
b2532eb9
ED
935 * another queue. We can be called from tcp_tsq_handler()
936 * which holds one reference to sk_wmem_alloc.
937 *
938 * TODO: Ideally, in-flight pure ACK packets should not matter here.
939 * One way to get this would be to set skb->truesize = 2 on them.
547669d4 940 */
b2532eb9 941 skb->ooo_okay = sk_wmem_alloc_get(sk) < SKB_TRUESIZE(1);
dfb4b9dc 942
aa8223c7
ACM
943 skb_push(skb, tcp_header_size);
944 skb_reset_transport_header(skb);
46d3ceab
ED
945
946 skb_orphan(skb);
947 skb->sk = sk;
98781965 948 skb->destructor = skb_is_tcp_pure_ack(skb) ? sock_wfree : tcp_wfree;
b73c3d0e 949 skb_set_hash_from_sk(skb, sk);
46d3ceab 950 atomic_add(skb->truesize, &sk->sk_wmem_alloc);
dfb4b9dc
DM
951
952 /* Build TCP header and checksum it. */
aa8223c7 953 th = tcp_hdr(skb);
c720c7e8
ED
954 th->source = inet->inet_sport;
955 th->dest = inet->inet_dport;
dfb4b9dc
DM
956 th->seq = htonl(tcb->seq);
957 th->ack_seq = htonl(tp->rcv_nxt);
df7a3b07 958 *(((__be16 *)th) + 6) = htons(((tcp_header_size >> 2) << 12) |
4de075e0 959 tcb->tcp_flags);
dfb4b9dc 960
4de075e0 961 if (unlikely(tcb->tcp_flags & TCPHDR_SYN)) {
dfb4b9dc
DM
962 /* RFC1323: The window in SYN & SYN/ACK segments
963 * is never scaled.
964 */
600ff0c2 965 th->window = htons(min(tp->rcv_wnd, 65535U));
dfb4b9dc
DM
966 } else {
967 th->window = htons(tcp_select_window(sk));
968 }
969 th->check = 0;
970 th->urg_ptr = 0;
1da177e4 971
33f5f57e 972 /* The urg_mode check is necessary during a below snd_una win probe */
7691367d
HX
973 if (unlikely(tcp_urg_mode(tp) && before(tcb->seq, tp->snd_up))) {
974 if (before(tp->snd_up, tcb->seq + 0x10000)) {
975 th->urg_ptr = htons(tp->snd_up - tcb->seq);
976 th->urg = 1;
977 } else if (after(tcb->seq + 0xFFFF, tp->snd_nxt)) {
0eae88f3 978 th->urg_ptr = htons(0xFFFF);
7691367d
HX
979 th->urg = 1;
980 }
dfb4b9dc 981 }
1da177e4 982
bd0388ae 983 tcp_options_write((__be32 *)(th + 1), tp, &opts);
4de075e0 984 if (likely((tcb->tcp_flags & TCPHDR_SYN) == 0))
735d3831 985 tcp_ecn_send(sk, skb, tcp_header_size);
1da177e4 986
cfb6eeb4
YH
987#ifdef CONFIG_TCP_MD5SIG
988 /* Calculate the MD5 hash, as we have all we need now */
989 if (md5) {
a465419b 990 sk_nocaps_add(sk, NETIF_F_GSO_MASK);
bd0388ae 991 tp->af_specific->calc_md5_hash(opts.hash_location,
49a72dfb 992 md5, sk, NULL, skb);
cfb6eeb4
YH
993 }
994#endif
995
bb296246 996 icsk->icsk_af_ops->send_check(sk, skb);
1da177e4 997
4de075e0 998 if (likely(tcb->tcp_flags & TCPHDR_ACK))
dfb4b9dc 999 tcp_event_ack_sent(sk, tcp_skb_pcount(skb));
1da177e4 1000
dfb4b9dc 1001 if (skb->len != tcp_header_size)
cf533ea5 1002 tcp_event_data_sent(tp, sk);
1da177e4 1003
bd37a088 1004 if (after(tcb->end_seq, tp->snd_nxt) || tcb->seq == tcb->end_seq)
aa2ea058
TH
1005 TCP_ADD_STATS(sock_net(sk), TCP_MIB_OUTSEGS,
1006 tcp_skb_pcount(skb));
1da177e4 1007
cd7d8498
ED
1008 /* OK, its time to fill skb_shinfo(skb)->gso_segs */
1009 skb_shinfo(skb)->gso_segs = tcp_skb_pcount(skb);
1010
7faee5c0
ED
1011 /* Our usage of tstamp should remain private */
1012 skb->tstamp.tv64 = 0;
971f10ec
ED
1013
1014 /* Cleanup our debris for IP stacks */
1015 memset(skb->cb, 0, max(sizeof(struct inet_skb_parm),
1016 sizeof(struct inet6_skb_parm)));
1017
b0270e91 1018 err = icsk->icsk_af_ops->queue_xmit(sk, skb, &inet->cork.fl);
7faee5c0 1019
83de47cd 1020 if (likely(err <= 0))
dfb4b9dc
DM
1021 return err;
1022
5ee2c941 1023 tcp_enter_cwr(sk);
dfb4b9dc 1024
b9df3cb8 1025 return net_xmit_eval(err);
1da177e4
LT
1026}
1027
67edfef7 1028/* This routine just queues the buffer for sending.
1da177e4
LT
1029 *
1030 * NOTE: probe0 timer is not checked, do not forget tcp_push_pending_frames,
1031 * otherwise socket can stall.
1032 */
1033static void tcp_queue_skb(struct sock *sk, struct sk_buff *skb)
1034{
1035 struct tcp_sock *tp = tcp_sk(sk);
1036
1037 /* Advance write_seq and place onto the write_queue. */
1038 tp->write_seq = TCP_SKB_CB(skb)->end_seq;
f4a775d1 1039 __skb_header_release(skb);
fe067e8a 1040 tcp_add_write_queue_tail(sk, skb);
3ab224be
HA
1041 sk->sk_wmem_queued += skb->truesize;
1042 sk_mem_charge(sk, skb->truesize);
1da177e4
LT
1043}
1044
67edfef7 1045/* Initialize TSO segments for a packet. */
cf533ea5 1046static void tcp_set_skb_tso_segs(const struct sock *sk, struct sk_buff *skb,
056834d9 1047 unsigned int mss_now)
f6302d1d 1048{
7b7fc97a
ED
1049 struct skb_shared_info *shinfo = skb_shinfo(skb);
1050
c52e2421
ED
1051 /* Make sure we own this skb before messing gso_size/gso_segs */
1052 WARN_ON_ONCE(skb_cloned(skb));
1053
8f26fb1c 1054 if (skb->len <= mss_now || skb->ip_summed == CHECKSUM_NONE) {
f6302d1d
DM
1055 /* Avoid the costly divide in the normal
1056 * non-TSO case.
1057 */
cd7d8498 1058 tcp_skb_pcount_set(skb, 1);
7b7fc97a
ED
1059 shinfo->gso_size = 0;
1060 shinfo->gso_type = 0;
f6302d1d 1061 } else {
cd7d8498 1062 tcp_skb_pcount_set(skb, DIV_ROUND_UP(skb->len, mss_now));
7b7fc97a
ED
1063 shinfo->gso_size = mss_now;
1064 shinfo->gso_type = sk->sk_gso_type;
1da177e4
LT
1065 }
1066}
1067
91fed7a1 1068/* When a modification to fackets out becomes necessary, we need to check
68f8353b 1069 * skb is counted to fackets_out or not.
91fed7a1 1070 */
cf533ea5 1071static void tcp_adjust_fackets_out(struct sock *sk, const struct sk_buff *skb,
91fed7a1
IJ
1072 int decr)
1073{
a47e5a98
IJ
1074 struct tcp_sock *tp = tcp_sk(sk);
1075
dc86967b 1076 if (!tp->sacked_out || tcp_is_reno(tp))
91fed7a1
IJ
1077 return;
1078
6859d494 1079 if (after(tcp_highest_sack_seq(tp), TCP_SKB_CB(skb)->seq))
91fed7a1 1080 tp->fackets_out -= decr;
91fed7a1
IJ
1081}
1082
797108d1
IJ
1083/* Pcount in the middle of the write queue got changed, we need to do various
1084 * tweaks to fix counters
1085 */
cf533ea5 1086static void tcp_adjust_pcount(struct sock *sk, const struct sk_buff *skb, int decr)
797108d1
IJ
1087{
1088 struct tcp_sock *tp = tcp_sk(sk);
1089
1090 tp->packets_out -= decr;
1091
1092 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)
1093 tp->sacked_out -= decr;
1094 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS)
1095 tp->retrans_out -= decr;
1096 if (TCP_SKB_CB(skb)->sacked & TCPCB_LOST)
1097 tp->lost_out -= decr;
1098
1099 /* Reno case is special. Sigh... */
1100 if (tcp_is_reno(tp) && decr > 0)
1101 tp->sacked_out -= min_t(u32, tp->sacked_out, decr);
1102
1103 tcp_adjust_fackets_out(sk, skb, decr);
1104
1105 if (tp->lost_skb_hint &&
1106 before(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(tp->lost_skb_hint)->seq) &&
52cf3cc8 1107 (tcp_is_fack(tp) || (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)))
797108d1
IJ
1108 tp->lost_cnt_hint -= decr;
1109
1110 tcp_verify_left_out(tp);
1111}
1112
490cc7d0
WB
1113static void tcp_fragment_tstamp(struct sk_buff *skb, struct sk_buff *skb2)
1114{
1115 struct skb_shared_info *shinfo = skb_shinfo(skb);
1116
1117 if (unlikely(shinfo->tx_flags & SKBTX_ANY_TSTAMP) &&
1118 !before(shinfo->tskey, TCP_SKB_CB(skb2)->seq)) {
1119 struct skb_shared_info *shinfo2 = skb_shinfo(skb2);
1120 u8 tsflags = shinfo->tx_flags & SKBTX_ANY_TSTAMP;
1121
1122 shinfo->tx_flags &= ~tsflags;
1123 shinfo2->tx_flags |= tsflags;
1124 swap(shinfo->tskey, shinfo2->tskey);
1125 }
1126}
1127
1da177e4
LT
1128/* Function to create two new TCP segments. Shrinks the given segment
1129 * to the specified size and appends a new segment with the rest of the
e905a9ed 1130 * packet to the list. This won't be called frequently, I hope.
1da177e4
LT
1131 * Remember, these are still headerless SKBs at this point.
1132 */
056834d9 1133int tcp_fragment(struct sock *sk, struct sk_buff *skb, u32 len,
6cc55e09 1134 unsigned int mss_now, gfp_t gfp)
1da177e4
LT
1135{
1136 struct tcp_sock *tp = tcp_sk(sk);
1137 struct sk_buff *buff;
6475be16 1138 int nsize, old_factor;
b60b49ea 1139 int nlen;
9ce01461 1140 u8 flags;
1da177e4 1141
2fceec13
IJ
1142 if (WARN_ON(len > skb->len))
1143 return -EINVAL;
6a438bbe 1144
1da177e4
LT
1145 nsize = skb_headlen(skb) - len;
1146 if (nsize < 0)
1147 nsize = 0;
1148
6cc55e09 1149 if (skb_unclone(skb, gfp))
1da177e4
LT
1150 return -ENOMEM;
1151
1152 /* Get a new skb... force flag on. */
6cc55e09 1153 buff = sk_stream_alloc_skb(sk, nsize, gfp);
1da177e4
LT
1154 if (buff == NULL)
1155 return -ENOMEM; /* We'll just try again later. */
ef5cb973 1156
3ab224be
HA
1157 sk->sk_wmem_queued += buff->truesize;
1158 sk_mem_charge(sk, buff->truesize);
b60b49ea
HX
1159 nlen = skb->len - len - nsize;
1160 buff->truesize += nlen;
1161 skb->truesize -= nlen;
1da177e4
LT
1162
1163 /* Correct the sequence numbers. */
1164 TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len;
1165 TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq;
1166 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq;
1167
1168 /* PSH and FIN should only be set in the second packet. */
4de075e0
ED
1169 flags = TCP_SKB_CB(skb)->tcp_flags;
1170 TCP_SKB_CB(skb)->tcp_flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH);
1171 TCP_SKB_CB(buff)->tcp_flags = flags;
e14c3caf 1172 TCP_SKB_CB(buff)->sacked = TCP_SKB_CB(skb)->sacked;
1da177e4 1173
84fa7933 1174 if (!skb_shinfo(skb)->nr_frags && skb->ip_summed != CHECKSUM_PARTIAL) {
1da177e4 1175 /* Copy and checksum data tail into the new buffer. */
056834d9
IJ
1176 buff->csum = csum_partial_copy_nocheck(skb->data + len,
1177 skb_put(buff, nsize),
1da177e4
LT
1178 nsize, 0);
1179
1180 skb_trim(skb, len);
1181
1182 skb->csum = csum_block_sub(skb->csum, buff->csum, len);
1183 } else {
84fa7933 1184 skb->ip_summed = CHECKSUM_PARTIAL;
1da177e4
LT
1185 skb_split(skb, buff, len);
1186 }
1187
1188 buff->ip_summed = skb->ip_summed;
1189
a61bbcf2 1190 buff->tstamp = skb->tstamp;
490cc7d0 1191 tcp_fragment_tstamp(skb, buff);
1da177e4 1192
6475be16
DM
1193 old_factor = tcp_skb_pcount(skb);
1194
1da177e4 1195 /* Fix up tso_factor for both original and new SKB. */
846998ae
DM
1196 tcp_set_skb_tso_segs(sk, skb, mss_now);
1197 tcp_set_skb_tso_segs(sk, buff, mss_now);
1da177e4 1198
6475be16
DM
1199 /* If this packet has been sent out already, we must
1200 * adjust the various packet counters.
1201 */
cf0b450c 1202 if (!before(tp->snd_nxt, TCP_SKB_CB(buff)->end_seq)) {
6475be16
DM
1203 int diff = old_factor - tcp_skb_pcount(skb) -
1204 tcp_skb_pcount(buff);
1da177e4 1205
797108d1
IJ
1206 if (diff)
1207 tcp_adjust_pcount(sk, skb, diff);
1da177e4
LT
1208 }
1209
1210 /* Link BUFF into the send queue. */
f4a775d1 1211 __skb_header_release(buff);
fe067e8a 1212 tcp_insert_write_queue_after(skb, buff, sk);
1da177e4
LT
1213
1214 return 0;
1215}
1216
1217/* This is similar to __pskb_pull_head() (it will go to core/skbuff.c
1218 * eventually). The difference is that pulled data not copied, but
1219 * immediately discarded.
1220 */
f2911969 1221static void __pskb_trim_head(struct sk_buff *skb, int len)
1da177e4 1222{
7b7fc97a 1223 struct skb_shared_info *shinfo;
1da177e4
LT
1224 int i, k, eat;
1225
4fa48bf3
ED
1226 eat = min_t(int, len, skb_headlen(skb));
1227 if (eat) {
1228 __skb_pull(skb, eat);
1229 len -= eat;
1230 if (!len)
1231 return;
1232 }
1da177e4
LT
1233 eat = len;
1234 k = 0;
7b7fc97a
ED
1235 shinfo = skb_shinfo(skb);
1236 for (i = 0; i < shinfo->nr_frags; i++) {
1237 int size = skb_frag_size(&shinfo->frags[i]);
9e903e08
ED
1238
1239 if (size <= eat) {
aff65da0 1240 skb_frag_unref(skb, i);
9e903e08 1241 eat -= size;
1da177e4 1242 } else {
7b7fc97a 1243 shinfo->frags[k] = shinfo->frags[i];
1da177e4 1244 if (eat) {
7b7fc97a
ED
1245 shinfo->frags[k].page_offset += eat;
1246 skb_frag_size_sub(&shinfo->frags[k], eat);
1da177e4
LT
1247 eat = 0;
1248 }
1249 k++;
1250 }
1251 }
7b7fc97a 1252 shinfo->nr_frags = k;
1da177e4 1253
27a884dc 1254 skb_reset_tail_pointer(skb);
1da177e4
LT
1255 skb->data_len -= len;
1256 skb->len = skb->data_len;
1da177e4
LT
1257}
1258
67edfef7 1259/* Remove acked data from a packet in the transmit queue. */
1da177e4
LT
1260int tcp_trim_head(struct sock *sk, struct sk_buff *skb, u32 len)
1261{
14bbd6a5 1262 if (skb_unclone(skb, GFP_ATOMIC))
1da177e4
LT
1263 return -ENOMEM;
1264
4fa48bf3 1265 __pskb_trim_head(skb, len);
1da177e4
LT
1266
1267 TCP_SKB_CB(skb)->seq += len;
84fa7933 1268 skb->ip_summed = CHECKSUM_PARTIAL;
1da177e4
LT
1269
1270 skb->truesize -= len;
1271 sk->sk_wmem_queued -= len;
3ab224be 1272 sk_mem_uncharge(sk, len);
1da177e4
LT
1273 sock_set_flag(sk, SOCK_QUEUE_SHRUNK);
1274
5b35e1e6 1275 /* Any change of skb->len requires recalculation of tso factor. */
1da177e4 1276 if (tcp_skb_pcount(skb) > 1)
5b35e1e6 1277 tcp_set_skb_tso_segs(sk, skb, tcp_skb_mss(skb));
1da177e4
LT
1278
1279 return 0;
1280}
1281
1b63edd6
YC
1282/* Calculate MSS not accounting any TCP options. */
1283static inline int __tcp_mtu_to_mss(struct sock *sk, int pmtu)
5d424d5a 1284{
cf533ea5
ED
1285 const struct tcp_sock *tp = tcp_sk(sk);
1286 const struct inet_connection_sock *icsk = inet_csk(sk);
5d424d5a
JH
1287 int mss_now;
1288
1289 /* Calculate base mss without TCP options:
1290 It is MMS_S - sizeof(tcphdr) of rfc1122
1291 */
1292 mss_now = pmtu - icsk->icsk_af_ops->net_header_len - sizeof(struct tcphdr);
1293
67469601
ED
1294 /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */
1295 if (icsk->icsk_af_ops->net_frag_header_len) {
1296 const struct dst_entry *dst = __sk_dst_get(sk);
1297
1298 if (dst && dst_allfrag(dst))
1299 mss_now -= icsk->icsk_af_ops->net_frag_header_len;
1300 }
1301
5d424d5a
JH
1302 /* Clamp it (mss_clamp does not include tcp options) */
1303 if (mss_now > tp->rx_opt.mss_clamp)
1304 mss_now = tp->rx_opt.mss_clamp;
1305
1306 /* Now subtract optional transport overhead */
1307 mss_now -= icsk->icsk_ext_hdr_len;
1308
1309 /* Then reserve room for full set of TCP options and 8 bytes of data */
1310 if (mss_now < 48)
1311 mss_now = 48;
5d424d5a
JH
1312 return mss_now;
1313}
1314
1b63edd6
YC
1315/* Calculate MSS. Not accounting for SACKs here. */
1316int tcp_mtu_to_mss(struct sock *sk, int pmtu)
1317{
1318 /* Subtract TCP options size, not including SACKs */
1319 return __tcp_mtu_to_mss(sk, pmtu) -
1320 (tcp_sk(sk)->tcp_header_len - sizeof(struct tcphdr));
1321}
1322
5d424d5a 1323/* Inverse of above */
67469601 1324int tcp_mss_to_mtu(struct sock *sk, int mss)
5d424d5a 1325{
cf533ea5
ED
1326 const struct tcp_sock *tp = tcp_sk(sk);
1327 const struct inet_connection_sock *icsk = inet_csk(sk);
5d424d5a
JH
1328 int mtu;
1329
1330 mtu = mss +
1331 tp->tcp_header_len +
1332 icsk->icsk_ext_hdr_len +
1333 icsk->icsk_af_ops->net_header_len;
1334
67469601
ED
1335 /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */
1336 if (icsk->icsk_af_ops->net_frag_header_len) {
1337 const struct dst_entry *dst = __sk_dst_get(sk);
1338
1339 if (dst && dst_allfrag(dst))
1340 mtu += icsk->icsk_af_ops->net_frag_header_len;
1341 }
5d424d5a
JH
1342 return mtu;
1343}
1344
67edfef7 1345/* MTU probing init per socket */
5d424d5a
JH
1346void tcp_mtup_init(struct sock *sk)
1347{
1348 struct tcp_sock *tp = tcp_sk(sk);
1349 struct inet_connection_sock *icsk = inet_csk(sk);
b0f9ca53 1350 struct net *net = sock_net(sk);
5d424d5a 1351
b0f9ca53 1352 icsk->icsk_mtup.enabled = net->ipv4.sysctl_tcp_mtu_probing > 1;
5d424d5a 1353 icsk->icsk_mtup.search_high = tp->rx_opt.mss_clamp + sizeof(struct tcphdr) +
e905a9ed 1354 icsk->icsk_af_ops->net_header_len;
b0f9ca53 1355 icsk->icsk_mtup.search_low = tcp_mss_to_mtu(sk, net->ipv4.sysctl_tcp_base_mss);
5d424d5a
JH
1356 icsk->icsk_mtup.probe_size = 0;
1357}
4bc2f18b 1358EXPORT_SYMBOL(tcp_mtup_init);
5d424d5a 1359
1da177e4
LT
1360/* This function synchronize snd mss to current pmtu/exthdr set.
1361
1362 tp->rx_opt.user_mss is mss set by user by TCP_MAXSEG. It does NOT counts
1363 for TCP options, but includes only bare TCP header.
1364
1365 tp->rx_opt.mss_clamp is mss negotiated at connection setup.
caa20d9a 1366 It is minimum of user_mss and mss received with SYN.
1da177e4
LT
1367 It also does not include TCP options.
1368
d83d8461 1369 inet_csk(sk)->icsk_pmtu_cookie is last pmtu, seen by this function.
1da177e4
LT
1370
1371 tp->mss_cache is current effective sending mss, including
1372 all tcp options except for SACKs. It is evaluated,
1373 taking into account current pmtu, but never exceeds
1374 tp->rx_opt.mss_clamp.
1375
1376 NOTE1. rfc1122 clearly states that advertised MSS
1377 DOES NOT include either tcp or ip options.
1378
d83d8461
ACM
1379 NOTE2. inet_csk(sk)->icsk_pmtu_cookie and tp->mss_cache
1380 are READ ONLY outside this function. --ANK (980731)
1da177e4 1381 */
1da177e4
LT
1382unsigned int tcp_sync_mss(struct sock *sk, u32 pmtu)
1383{
1384 struct tcp_sock *tp = tcp_sk(sk);
d83d8461 1385 struct inet_connection_sock *icsk = inet_csk(sk);
5d424d5a 1386 int mss_now;
1da177e4 1387
5d424d5a
JH
1388 if (icsk->icsk_mtup.search_high > pmtu)
1389 icsk->icsk_mtup.search_high = pmtu;
1da177e4 1390
5d424d5a 1391 mss_now = tcp_mtu_to_mss(sk, pmtu);
409d22b4 1392 mss_now = tcp_bound_to_half_wnd(tp, mss_now);
1da177e4
LT
1393
1394 /* And store cached results */
d83d8461 1395 icsk->icsk_pmtu_cookie = pmtu;
5d424d5a
JH
1396 if (icsk->icsk_mtup.enabled)
1397 mss_now = min(mss_now, tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_low));
c1b4a7e6 1398 tp->mss_cache = mss_now;
1da177e4
LT
1399
1400 return mss_now;
1401}
4bc2f18b 1402EXPORT_SYMBOL(tcp_sync_mss);
1da177e4
LT
1403
1404/* Compute the current effective MSS, taking SACKs and IP options,
1405 * and even PMTU discovery events into account.
1da177e4 1406 */
0c54b85f 1407unsigned int tcp_current_mss(struct sock *sk)
1da177e4 1408{
cf533ea5
ED
1409 const struct tcp_sock *tp = tcp_sk(sk);
1410 const struct dst_entry *dst = __sk_dst_get(sk);
c1b4a7e6 1411 u32 mss_now;
95c96174 1412 unsigned int header_len;
33ad798c
AL
1413 struct tcp_out_options opts;
1414 struct tcp_md5sig_key *md5;
c1b4a7e6
DM
1415
1416 mss_now = tp->mss_cache;
1417
1da177e4
LT
1418 if (dst) {
1419 u32 mtu = dst_mtu(dst);
d83d8461 1420 if (mtu != inet_csk(sk)->icsk_pmtu_cookie)
1da177e4
LT
1421 mss_now = tcp_sync_mss(sk, mtu);
1422 }
1423
33ad798c
AL
1424 header_len = tcp_established_options(sk, NULL, &opts, &md5) +
1425 sizeof(struct tcphdr);
1426 /* The mss_cache is sized based on tp->tcp_header_len, which assumes
1427 * some common options. If this is an odd packet (because we have SACK
1428 * blocks etc) then our calculated header_len will be different, and
1429 * we have to adjust mss_now correspondingly */
1430 if (header_len != tp->tcp_header_len) {
1431 int delta = (int) header_len - tp->tcp_header_len;
1432 mss_now -= delta;
1433 }
cfb6eeb4 1434
1da177e4
LT
1435 return mss_now;
1436}
1437
86fd14ad
WP
1438/* RFC2861, slow part. Adjust cwnd, after it was not full during one rto.
1439 * As additional protections, we do not touch cwnd in retransmission phases,
1440 * and if application hit its sndbuf limit recently.
1441 */
1442static void tcp_cwnd_application_limited(struct sock *sk)
1443{
1444 struct tcp_sock *tp = tcp_sk(sk);
1445
1446 if (inet_csk(sk)->icsk_ca_state == TCP_CA_Open &&
1447 sk->sk_socket && !test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
1448 /* Limited by application or receiver window. */
1449 u32 init_win = tcp_init_cwnd(tp, __sk_dst_get(sk));
1450 u32 win_used = max(tp->snd_cwnd_used, init_win);
1451 if (win_used < tp->snd_cwnd) {
1452 tp->snd_ssthresh = tcp_current_ssthresh(sk);
1453 tp->snd_cwnd = (tp->snd_cwnd + win_used) >> 1;
1454 }
1455 tp->snd_cwnd_used = 0;
1456 }
1457 tp->snd_cwnd_stamp = tcp_time_stamp;
1458}
1459
ca8a2263 1460static void tcp_cwnd_validate(struct sock *sk, bool is_cwnd_limited)
a762a980 1461{
9e412ba7 1462 struct tcp_sock *tp = tcp_sk(sk);
a762a980 1463
ca8a2263
NC
1464 /* Track the maximum number of outstanding packets in each
1465 * window, and remember whether we were cwnd-limited then.
1466 */
1467 if (!before(tp->snd_una, tp->max_packets_seq) ||
1468 tp->packets_out > tp->max_packets_out) {
1469 tp->max_packets_out = tp->packets_out;
1470 tp->max_packets_seq = tp->snd_nxt;
1471 tp->is_cwnd_limited = is_cwnd_limited;
1472 }
e114a710 1473
24901551 1474 if (tcp_is_cwnd_limited(sk)) {
a762a980
DM
1475 /* Network is feed fully. */
1476 tp->snd_cwnd_used = 0;
1477 tp->snd_cwnd_stamp = tcp_time_stamp;
1478 } else {
1479 /* Network starves. */
1480 if (tp->packets_out > tp->snd_cwnd_used)
1481 tp->snd_cwnd_used = tp->packets_out;
1482
15d33c07
DM
1483 if (sysctl_tcp_slow_start_after_idle &&
1484 (s32)(tcp_time_stamp - tp->snd_cwnd_stamp) >= inet_csk(sk)->icsk_rto)
a762a980
DM
1485 tcp_cwnd_application_limited(sk);
1486 }
1487}
1488
d4589926
ED
1489/* Minshall's variant of the Nagle send check. */
1490static bool tcp_minshall_check(const struct tcp_sock *tp)
1491{
1492 return after(tp->snd_sml, tp->snd_una) &&
1493 !after(tp->snd_sml, tp->snd_nxt);
1494}
1495
1496/* Update snd_sml if this skb is under mss
1497 * Note that a TSO packet might end with a sub-mss segment
1498 * The test is really :
1499 * if ((skb->len % mss) != 0)
1500 * tp->snd_sml = TCP_SKB_CB(skb)->end_seq;
1501 * But we can avoid doing the divide again given we already have
1502 * skb_pcount = skb->len / mss_now
0e3a4803 1503 */
d4589926
ED
1504static void tcp_minshall_update(struct tcp_sock *tp, unsigned int mss_now,
1505 const struct sk_buff *skb)
1506{
1507 if (skb->len < tcp_skb_pcount(skb) * mss_now)
1508 tp->snd_sml = TCP_SKB_CB(skb)->end_seq;
1509}
1510
1511/* Return false, if packet can be sent now without violation Nagle's rules:
1512 * 1. It is full sized. (provided by caller in %partial bool)
1513 * 2. Or it contains FIN. (already checked by caller)
1514 * 3. Or TCP_CORK is not set, and TCP_NODELAY is set.
1515 * 4. Or TCP_CORK is not set, and all sent packets are ACKed.
1516 * With Minshall's modification: all sent small packets are ACKed.
1517 */
1518static bool tcp_nagle_check(bool partial, const struct tcp_sock *tp,
cc93fc51 1519 int nonagle)
d4589926
ED
1520{
1521 return partial &&
1522 ((nonagle & TCP_NAGLE_CORK) ||
1523 (!nonagle && tp->packets_out && tcp_minshall_check(tp)));
1524}
605ad7f1
ED
1525
1526/* Return how many segs we'd like on a TSO packet,
1527 * to send one TSO packet per ms
1528 */
1529static u32 tcp_tso_autosize(const struct sock *sk, unsigned int mss_now)
1530{
1531 u32 bytes, segs;
1532
1533 bytes = min(sk->sk_pacing_rate >> 10,
1534 sk->sk_gso_max_size - 1 - MAX_TCP_HEADER);
1535
1536 /* Goal is to send at least one packet per ms,
1537 * not one big TSO packet every 100 ms.
1538 * This preserves ACK clocking and is consistent
1539 * with tcp_tso_should_defer() heuristic.
1540 */
1541 segs = max_t(u32, bytes / mss_now, sysctl_tcp_min_tso_segs);
1542
1543 return min_t(u32, segs, sk->sk_gso_max_segs);
1544}
1545
d4589926
ED
1546/* Returns the portion of skb which can be sent right away */
1547static unsigned int tcp_mss_split_point(const struct sock *sk,
1548 const struct sk_buff *skb,
1549 unsigned int mss_now,
1550 unsigned int max_segs,
1551 int nonagle)
c1b4a7e6 1552{
cf533ea5 1553 const struct tcp_sock *tp = tcp_sk(sk);
d4589926 1554 u32 partial, needed, window, max_len;
c1b4a7e6 1555
90840def 1556 window = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq;
1485348d 1557 max_len = mss_now * max_segs;
0e3a4803 1558
1485348d
BH
1559 if (likely(max_len <= window && skb != tcp_write_queue_tail(sk)))
1560 return max_len;
0e3a4803 1561
5ea3a748
IJ
1562 needed = min(skb->len, window);
1563
1485348d
BH
1564 if (max_len <= needed)
1565 return max_len;
0e3a4803 1566
d4589926
ED
1567 partial = needed % mss_now;
1568 /* If last segment is not a full MSS, check if Nagle rules allow us
1569 * to include this last segment in this skb.
1570 * Otherwise, we'll split the skb at last MSS boundary
1571 */
cc93fc51 1572 if (tcp_nagle_check(partial != 0, tp, nonagle))
d4589926
ED
1573 return needed - partial;
1574
1575 return needed;
c1b4a7e6
DM
1576}
1577
1578/* Can at least one segment of SKB be sent right now, according to the
1579 * congestion window rules? If so, return how many segments are allowed.
1580 */
cf533ea5
ED
1581static inline unsigned int tcp_cwnd_test(const struct tcp_sock *tp,
1582 const struct sk_buff *skb)
c1b4a7e6 1583{
d649a7a8 1584 u32 in_flight, cwnd, halfcwnd;
c1b4a7e6
DM
1585
1586 /* Don't be strict about the congestion window for the final FIN. */
4de075e0
ED
1587 if ((TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN) &&
1588 tcp_skb_pcount(skb) == 1)
c1b4a7e6
DM
1589 return 1;
1590
1591 in_flight = tcp_packets_in_flight(tp);
1592 cwnd = tp->snd_cwnd;
d649a7a8
ED
1593 if (in_flight >= cwnd)
1594 return 0;
c1b4a7e6 1595
d649a7a8
ED
1596 /* For better scheduling, ensure we have at least
1597 * 2 GSO packets in flight.
1598 */
1599 halfcwnd = max(cwnd >> 1, 1U);
1600 return min(halfcwnd, cwnd - in_flight);
c1b4a7e6
DM
1601}
1602
b595076a 1603/* Initialize TSO state of a skb.
67edfef7 1604 * This must be invoked the first time we consider transmitting
c1b4a7e6
DM
1605 * SKB onto the wire.
1606 */
cf533ea5 1607static int tcp_init_tso_segs(const struct sock *sk, struct sk_buff *skb,
056834d9 1608 unsigned int mss_now)
c1b4a7e6
DM
1609{
1610 int tso_segs = tcp_skb_pcount(skb);
1611
f8269a49 1612 if (!tso_segs || (tso_segs > 1 && tcp_skb_mss(skb) != mss_now)) {
846998ae 1613 tcp_set_skb_tso_segs(sk, skb, mss_now);
c1b4a7e6
DM
1614 tso_segs = tcp_skb_pcount(skb);
1615 }
1616 return tso_segs;
1617}
1618
c1b4a7e6 1619
a2a385d6 1620/* Return true if the Nagle test allows this packet to be
c1b4a7e6
DM
1621 * sent now.
1622 */
a2a385d6
ED
1623static inline bool tcp_nagle_test(const struct tcp_sock *tp, const struct sk_buff *skb,
1624 unsigned int cur_mss, int nonagle)
c1b4a7e6
DM
1625{
1626 /* Nagle rule does not apply to frames, which sit in the middle of the
1627 * write_queue (they have no chances to get new data).
1628 *
1629 * This is implemented in the callers, where they modify the 'nonagle'
1630 * argument based upon the location of SKB in the send queue.
1631 */
1632 if (nonagle & TCP_NAGLE_PUSH)
a2a385d6 1633 return true;
c1b4a7e6 1634
9b44190d
YC
1635 /* Don't use the nagle rule for urgent data (or for the final FIN). */
1636 if (tcp_urg_mode(tp) || (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN))
a2a385d6 1637 return true;
c1b4a7e6 1638
cc93fc51 1639 if (!tcp_nagle_check(skb->len < cur_mss, tp, nonagle))
a2a385d6 1640 return true;
c1b4a7e6 1641
a2a385d6 1642 return false;
c1b4a7e6
DM
1643}
1644
1645/* Does at least the first segment of SKB fit into the send window? */
a2a385d6
ED
1646static bool tcp_snd_wnd_test(const struct tcp_sock *tp,
1647 const struct sk_buff *skb,
1648 unsigned int cur_mss)
c1b4a7e6
DM
1649{
1650 u32 end_seq = TCP_SKB_CB(skb)->end_seq;
1651
1652 if (skb->len > cur_mss)
1653 end_seq = TCP_SKB_CB(skb)->seq + cur_mss;
1654
90840def 1655 return !after(end_seq, tcp_wnd_end(tp));
c1b4a7e6
DM
1656}
1657
fe067e8a 1658/* This checks if the data bearing packet SKB (usually tcp_send_head(sk))
c1b4a7e6
DM
1659 * should be put on the wire right now. If so, it returns the number of
1660 * packets allowed by the congestion window.
1661 */
cf533ea5 1662static unsigned int tcp_snd_test(const struct sock *sk, struct sk_buff *skb,
c1b4a7e6
DM
1663 unsigned int cur_mss, int nonagle)
1664{
cf533ea5 1665 const struct tcp_sock *tp = tcp_sk(sk);
c1b4a7e6
DM
1666 unsigned int cwnd_quota;
1667
846998ae 1668 tcp_init_tso_segs(sk, skb, cur_mss);
c1b4a7e6
DM
1669
1670 if (!tcp_nagle_test(tp, skb, cur_mss, nonagle))
1671 return 0;
1672
1673 cwnd_quota = tcp_cwnd_test(tp, skb);
056834d9 1674 if (cwnd_quota && !tcp_snd_wnd_test(tp, skb, cur_mss))
c1b4a7e6
DM
1675 cwnd_quota = 0;
1676
1677 return cwnd_quota;
1678}
1679
67edfef7 1680/* Test if sending is allowed right now. */
a2a385d6 1681bool tcp_may_send_now(struct sock *sk)
c1b4a7e6 1682{
cf533ea5 1683 const struct tcp_sock *tp = tcp_sk(sk);
fe067e8a 1684 struct sk_buff *skb = tcp_send_head(sk);
c1b4a7e6 1685
a02cec21 1686 return skb &&
0c54b85f 1687 tcp_snd_test(sk, skb, tcp_current_mss(sk),
c1b4a7e6 1688 (tcp_skb_is_last(sk, skb) ?
a02cec21 1689 tp->nonagle : TCP_NAGLE_PUSH));
c1b4a7e6
DM
1690}
1691
1692/* Trim TSO SKB to LEN bytes, put the remaining data into a new packet
1693 * which is put after SKB on the list. It is very much like
1694 * tcp_fragment() except that it may make several kinds of assumptions
1695 * in order to speed up the splitting operation. In particular, we
1696 * know that all the data is in scatter-gather pages, and that the
1697 * packet has never been sent out before (and thus is not cloned).
1698 */
056834d9 1699static int tso_fragment(struct sock *sk, struct sk_buff *skb, unsigned int len,
c4ead4c5 1700 unsigned int mss_now, gfp_t gfp)
c1b4a7e6
DM
1701{
1702 struct sk_buff *buff;
1703 int nlen = skb->len - len;
9ce01461 1704 u8 flags;
c1b4a7e6
DM
1705
1706 /* All of a TSO frame must be composed of paged data. */
c8ac3774 1707 if (skb->len != skb->data_len)
6cc55e09 1708 return tcp_fragment(sk, skb, len, mss_now, gfp);
c1b4a7e6 1709
c4ead4c5 1710 buff = sk_stream_alloc_skb(sk, 0, gfp);
c1b4a7e6
DM
1711 if (unlikely(buff == NULL))
1712 return -ENOMEM;
1713
3ab224be
HA
1714 sk->sk_wmem_queued += buff->truesize;
1715 sk_mem_charge(sk, buff->truesize);
b60b49ea 1716 buff->truesize += nlen;
c1b4a7e6
DM
1717 skb->truesize -= nlen;
1718
1719 /* Correct the sequence numbers. */
1720 TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len;
1721 TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq;
1722 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq;
1723
1724 /* PSH and FIN should only be set in the second packet. */
4de075e0
ED
1725 flags = TCP_SKB_CB(skb)->tcp_flags;
1726 TCP_SKB_CB(skb)->tcp_flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH);
1727 TCP_SKB_CB(buff)->tcp_flags = flags;
c1b4a7e6
DM
1728
1729 /* This packet was never sent out yet, so no SACK bits. */
1730 TCP_SKB_CB(buff)->sacked = 0;
1731
84fa7933 1732 buff->ip_summed = skb->ip_summed = CHECKSUM_PARTIAL;
c1b4a7e6 1733 skb_split(skb, buff, len);
490cc7d0 1734 tcp_fragment_tstamp(skb, buff);
c1b4a7e6
DM
1735
1736 /* Fix up tso_factor for both original and new SKB. */
846998ae
DM
1737 tcp_set_skb_tso_segs(sk, skb, mss_now);
1738 tcp_set_skb_tso_segs(sk, buff, mss_now);
c1b4a7e6
DM
1739
1740 /* Link BUFF into the send queue. */
f4a775d1 1741 __skb_header_release(buff);
fe067e8a 1742 tcp_insert_write_queue_after(skb, buff, sk);
c1b4a7e6
DM
1743
1744 return 0;
1745}
1746
1747/* Try to defer sending, if possible, in order to minimize the amount
1748 * of TSO splitting we do. View it as a kind of TSO Nagle test.
1749 *
1750 * This algorithm is from John Heffner.
1751 */
ca8a2263 1752static bool tcp_tso_should_defer(struct sock *sk, struct sk_buff *skb,
605ad7f1 1753 bool *is_cwnd_limited, u32 max_segs)
c1b4a7e6 1754{
6687e988 1755 const struct inet_connection_sock *icsk = inet_csk(sk);
50c8339e
ED
1756 u32 age, send_win, cong_win, limit, in_flight;
1757 struct tcp_sock *tp = tcp_sk(sk);
1758 struct skb_mstamp now;
1759 struct sk_buff *head;
ad9f4f50 1760 int win_divisor;
c1b4a7e6 1761
4de075e0 1762 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)
ae8064ac 1763 goto send_now;
c1b4a7e6 1764
a0ea700e 1765 if (!((1 << icsk->icsk_ca_state) & (TCPF_CA_Open | TCPF_CA_CWR)))
ae8064ac
JH
1766 goto send_now;
1767
5f852eb5
ED
1768 /* Avoid bursty behavior by allowing defer
1769 * only if the last write was recent.
1770 */
1771 if ((s32)(tcp_time_stamp - tp->lsndtime) > 0)
ae8064ac 1772 goto send_now;
908a75c1 1773
c1b4a7e6
DM
1774 in_flight = tcp_packets_in_flight(tp);
1775
056834d9 1776 BUG_ON(tcp_skb_pcount(skb) <= 1 || (tp->snd_cwnd <= in_flight));
c1b4a7e6 1777
90840def 1778 send_win = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq;
c1b4a7e6
DM
1779
1780 /* From in_flight test above, we know that cwnd > in_flight. */
1781 cong_win = (tp->snd_cwnd - in_flight) * tp->mss_cache;
1782
1783 limit = min(send_win, cong_win);
1784
ba244fe9 1785 /* If a full-sized TSO skb can be sent, do it. */
605ad7f1 1786 if (limit >= max_segs * tp->mss_cache)
ae8064ac 1787 goto send_now;
ba244fe9 1788
62ad2761
IJ
1789 /* Middle in queue won't get any more data, full sendable already? */
1790 if ((skb != tcp_write_queue_tail(sk)) && (limit >= skb->len))
1791 goto send_now;
1792
ad9f4f50
ED
1793 win_divisor = ACCESS_ONCE(sysctl_tcp_tso_win_divisor);
1794 if (win_divisor) {
c1b4a7e6
DM
1795 u32 chunk = min(tp->snd_wnd, tp->snd_cwnd * tp->mss_cache);
1796
1797 /* If at least some fraction of a window is available,
1798 * just use it.
1799 */
ad9f4f50 1800 chunk /= win_divisor;
c1b4a7e6 1801 if (limit >= chunk)
ae8064ac 1802 goto send_now;
c1b4a7e6
DM
1803 } else {
1804 /* Different approach, try not to defer past a single
1805 * ACK. Receiver should ACK every other full sized
1806 * frame, so if we have space for more than 3 frames
1807 * then send now.
1808 */
6b5a5c0d 1809 if (limit > tcp_max_tso_deferred_mss(tp) * tp->mss_cache)
ae8064ac 1810 goto send_now;
c1b4a7e6
DM
1811 }
1812
50c8339e
ED
1813 head = tcp_write_queue_head(sk);
1814 skb_mstamp_get(&now);
1815 age = skb_mstamp_us_delta(&now, &head->skb_mstamp);
1816 /* If next ACK is likely to come too late (half srtt), do not defer */
1817 if (age < (tp->srtt_us >> 4))
1818 goto send_now;
1819
5f852eb5 1820 /* Ok, it looks like it is advisable to defer. */
ae8064ac 1821
ca8a2263
NC
1822 if (cong_win < send_win && cong_win < skb->len)
1823 *is_cwnd_limited = true;
1824
a2a385d6 1825 return true;
ae8064ac
JH
1826
1827send_now:
a2a385d6 1828 return false;
c1b4a7e6
DM
1829}
1830
5d424d5a 1831/* Create a new MTU probe if we are ready.
67edfef7
AK
1832 * MTU probe is regularly attempting to increase the path MTU by
1833 * deliberately sending larger packets. This discovers routing
1834 * changes resulting in larger path MTUs.
1835 *
5d424d5a
JH
1836 * Returns 0 if we should wait to probe (no cwnd available),
1837 * 1 if a probe was sent,
056834d9
IJ
1838 * -1 otherwise
1839 */
5d424d5a
JH
1840static int tcp_mtu_probe(struct sock *sk)
1841{
1842 struct tcp_sock *tp = tcp_sk(sk);
1843 struct inet_connection_sock *icsk = inet_csk(sk);
1844 struct sk_buff *skb, *nskb, *next;
1845 int len;
1846 int probe_size;
91cc17c0 1847 int size_needed;
5d424d5a
JH
1848 int copy;
1849 int mss_now;
1850
1851 /* Not currently probing/verifying,
1852 * not in recovery,
1853 * have enough cwnd, and
1854 * not SACKing (the variable headers throw things off) */
1855 if (!icsk->icsk_mtup.enabled ||
1856 icsk->icsk_mtup.probe_size ||
1857 inet_csk(sk)->icsk_ca_state != TCP_CA_Open ||
1858 tp->snd_cwnd < 11 ||
cabeccbd 1859 tp->rx_opt.num_sacks || tp->rx_opt.dsack)
5d424d5a
JH
1860 return -1;
1861
1862 /* Very simple search strategy: just double the MSS. */
0c54b85f 1863 mss_now = tcp_current_mss(sk);
056834d9 1864 probe_size = 2 * tp->mss_cache;
91cc17c0 1865 size_needed = probe_size + (tp->reordering + 1) * tp->mss_cache;
5d424d5a
JH
1866 if (probe_size > tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_high)) {
1867 /* TODO: set timer for probe_converge_event */
1868 return -1;
1869 }
1870
1871 /* Have enough data in the send queue to probe? */
7f9c33e5 1872 if (tp->write_seq - tp->snd_nxt < size_needed)
5d424d5a
JH
1873 return -1;
1874
91cc17c0
IJ
1875 if (tp->snd_wnd < size_needed)
1876 return -1;
90840def 1877 if (after(tp->snd_nxt + size_needed, tcp_wnd_end(tp)))
91cc17c0 1878 return 0;
5d424d5a 1879
d67c58e9
IJ
1880 /* Do we need to wait to drain cwnd? With none in flight, don't stall */
1881 if (tcp_packets_in_flight(tp) + 2 > tp->snd_cwnd) {
1882 if (!tcp_packets_in_flight(tp))
5d424d5a
JH
1883 return -1;
1884 else
1885 return 0;
1886 }
1887
1888 /* We're allowed to probe. Build it now. */
1889 if ((nskb = sk_stream_alloc_skb(sk, probe_size, GFP_ATOMIC)) == NULL)
1890 return -1;
3ab224be
HA
1891 sk->sk_wmem_queued += nskb->truesize;
1892 sk_mem_charge(sk, nskb->truesize);
5d424d5a 1893
fe067e8a 1894 skb = tcp_send_head(sk);
5d424d5a
JH
1895
1896 TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(skb)->seq;
1897 TCP_SKB_CB(nskb)->end_seq = TCP_SKB_CB(skb)->seq + probe_size;
4de075e0 1898 TCP_SKB_CB(nskb)->tcp_flags = TCPHDR_ACK;
5d424d5a
JH
1899 TCP_SKB_CB(nskb)->sacked = 0;
1900 nskb->csum = 0;
84fa7933 1901 nskb->ip_summed = skb->ip_summed;
5d424d5a 1902
50c4817e
IJ
1903 tcp_insert_write_queue_before(nskb, skb, sk);
1904
5d424d5a 1905 len = 0;
234b6860 1906 tcp_for_write_queue_from_safe(skb, next, sk) {
5d424d5a
JH
1907 copy = min_t(int, skb->len, probe_size - len);
1908 if (nskb->ip_summed)
1909 skb_copy_bits(skb, 0, skb_put(nskb, copy), copy);
1910 else
1911 nskb->csum = skb_copy_and_csum_bits(skb, 0,
056834d9
IJ
1912 skb_put(nskb, copy),
1913 copy, nskb->csum);
5d424d5a
JH
1914
1915 if (skb->len <= copy) {
1916 /* We've eaten all the data from this skb.
1917 * Throw it away. */
4de075e0 1918 TCP_SKB_CB(nskb)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags;
fe067e8a 1919 tcp_unlink_write_queue(skb, sk);
3ab224be 1920 sk_wmem_free_skb(sk, skb);
5d424d5a 1921 } else {
4de075e0 1922 TCP_SKB_CB(nskb)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags &
a3433f35 1923 ~(TCPHDR_FIN|TCPHDR_PSH);
5d424d5a
JH
1924 if (!skb_shinfo(skb)->nr_frags) {
1925 skb_pull(skb, copy);
84fa7933 1926 if (skb->ip_summed != CHECKSUM_PARTIAL)
056834d9
IJ
1927 skb->csum = csum_partial(skb->data,
1928 skb->len, 0);
5d424d5a
JH
1929 } else {
1930 __pskb_trim_head(skb, copy);
1931 tcp_set_skb_tso_segs(sk, skb, mss_now);
1932 }
1933 TCP_SKB_CB(skb)->seq += copy;
1934 }
1935
1936 len += copy;
234b6860
IJ
1937
1938 if (len >= probe_size)
1939 break;
5d424d5a
JH
1940 }
1941 tcp_init_tso_segs(sk, nskb, nskb->len);
1942
1943 /* We're ready to send. If this fails, the probe will
7faee5c0
ED
1944 * be resegmented into mss-sized pieces by tcp_write_xmit().
1945 */
5d424d5a
JH
1946 if (!tcp_transmit_skb(sk, nskb, 1, GFP_ATOMIC)) {
1947 /* Decrement cwnd here because we are sending
056834d9 1948 * effectively two packets. */
5d424d5a 1949 tp->snd_cwnd--;
66f5fe62 1950 tcp_event_new_data_sent(sk, nskb);
5d424d5a
JH
1951
1952 icsk->icsk_mtup.probe_size = tcp_mss_to_mtu(sk, nskb->len);
0e7b1368
JH
1953 tp->mtu_probe.probe_seq_start = TCP_SKB_CB(nskb)->seq;
1954 tp->mtu_probe.probe_seq_end = TCP_SKB_CB(nskb)->end_seq;
5d424d5a
JH
1955
1956 return 1;
1957 }
1958
1959 return -1;
1960}
1961
1da177e4
LT
1962/* This routine writes packets to the network. It advances the
1963 * send_head. This happens as incoming acks open up the remote
1964 * window for us.
1965 *
f8269a49
IJ
1966 * LARGESEND note: !tcp_urg_mode is overkill, only frames between
1967 * snd_up-64k-mss .. snd_up cannot be large. However, taking into
1968 * account rare use of URG, this is not a big flaw.
1969 *
6ba8a3b1
ND
1970 * Send at most one packet when push_one > 0. Temporarily ignore
1971 * cwnd limit to force at most one packet out when push_one == 2.
1972
a2a385d6
ED
1973 * Returns true, if no segments are in flight and we have queued segments,
1974 * but cannot send anything now because of SWS or another problem.
1da177e4 1975 */
a2a385d6
ED
1976static bool tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle,
1977 int push_one, gfp_t gfp)
1da177e4
LT
1978{
1979 struct tcp_sock *tp = tcp_sk(sk);
92df7b51 1980 struct sk_buff *skb;
c1b4a7e6
DM
1981 unsigned int tso_segs, sent_pkts;
1982 int cwnd_quota;
5d424d5a 1983 int result;
ca8a2263 1984 bool is_cwnd_limited = false;
605ad7f1 1985 u32 max_segs;
1da177e4 1986
92df7b51 1987 sent_pkts = 0;
5d424d5a 1988
d5dd9175
IJ
1989 if (!push_one) {
1990 /* Do MTU probing. */
1991 result = tcp_mtu_probe(sk);
1992 if (!result) {
a2a385d6 1993 return false;
d5dd9175
IJ
1994 } else if (result > 0) {
1995 sent_pkts = 1;
1996 }
5d424d5a
JH
1997 }
1998
605ad7f1 1999 max_segs = tcp_tso_autosize(sk, mss_now);
fe067e8a 2000 while ((skb = tcp_send_head(sk))) {
c8ac3774
HX
2001 unsigned int limit;
2002
b68e9f85 2003 tso_segs = tcp_init_tso_segs(sk, skb, mss_now);
c1b4a7e6 2004 BUG_ON(!tso_segs);
aa93466b 2005
9d186cac 2006 if (unlikely(tp->repair) && tp->repair_queue == TCP_SEND_QUEUE) {
7faee5c0
ED
2007 /* "skb_mstamp" is used as a start point for the retransmit timer */
2008 skb_mstamp_get(&skb->skb_mstamp);
ec342325 2009 goto repair; /* Skip network transmission */
9d186cac 2010 }
ec342325 2011
b68e9f85 2012 cwnd_quota = tcp_cwnd_test(tp, skb);
6ba8a3b1 2013 if (!cwnd_quota) {
ca8a2263 2014 is_cwnd_limited = true;
6ba8a3b1
ND
2015 if (push_one == 2)
2016 /* Force out a loss probe pkt. */
2017 cwnd_quota = 1;
2018 else
2019 break;
2020 }
b68e9f85
HX
2021
2022 if (unlikely(!tcp_snd_wnd_test(tp, skb, mss_now)))
2023 break;
2024
843925f3 2025 if (tso_segs == 1 || !max_segs) {
c1b4a7e6
DM
2026 if (unlikely(!tcp_nagle_test(tp, skb, mss_now,
2027 (tcp_skb_is_last(sk, skb) ?
2028 nonagle : TCP_NAGLE_PUSH))))
2029 break;
2030 } else {
ca8a2263 2031 if (!push_one &&
605ad7f1
ED
2032 tcp_tso_should_defer(sk, skb, &is_cwnd_limited,
2033 max_segs))
c1b4a7e6
DM
2034 break;
2035 }
aa93466b 2036
605ad7f1 2037 limit = mss_now;
843925f3 2038 if (tso_segs > 1 && max_segs && !tcp_urg_mode(tp))
605ad7f1
ED
2039 limit = tcp_mss_split_point(sk, skb, mss_now,
2040 min_t(unsigned int,
2041 cwnd_quota,
2042 max_segs),
2043 nonagle);
2044
2045 if (skb->len > limit &&
2046 unlikely(tso_fragment(sk, skb, limit, mss_now, gfp)))
2047 break;
2048
c9eeec26
ED
2049 /* TCP Small Queues :
2050 * Control number of packets in qdisc/devices to two packets / or ~1 ms.
2051 * This allows for :
2052 * - better RTT estimation and ACK scheduling
2053 * - faster recovery
2054 * - high rates
98e09386
ED
2055 * Alas, some drivers / subsystems require a fair amount
2056 * of queued bytes to ensure line rate.
2057 * One example is wifi aggregation (802.11 AMPDU)
46d3ceab 2058 */
605ad7f1
ED
2059 limit = max(2 * skb->truesize, sk->sk_pacing_rate >> 10);
2060 limit = min_t(u32, limit, sysctl_tcp_limit_output_bytes);
c9eeec26
ED
2061
2062 if (atomic_read(&sk->sk_wmem_alloc) > limit) {
46d3ceab 2063 set_bit(TSQ_THROTTLED, &tp->tsq_flags);
bf06200e
JO
2064 /* It is possible TX completion already happened
2065 * before we set TSQ_THROTTLED, so we must
2066 * test again the condition.
bf06200e 2067 */
4e857c58 2068 smp_mb__after_atomic();
bf06200e
JO
2069 if (atomic_read(&sk->sk_wmem_alloc) > limit)
2070 break;
46d3ceab 2071 }
c9eeec26 2072
d5dd9175 2073 if (unlikely(tcp_transmit_skb(sk, skb, 1, gfp)))
92df7b51 2074 break;
1da177e4 2075
ec342325 2076repair:
92df7b51
DM
2077 /* Advance the send_head. This one is sent out.
2078 * This call will increment packets_out.
2079 */
66f5fe62 2080 tcp_event_new_data_sent(sk, skb);
1da177e4 2081
92df7b51 2082 tcp_minshall_update(tp, mss_now, skb);
a262f0cd 2083 sent_pkts += tcp_skb_pcount(skb);
d5dd9175
IJ
2084
2085 if (push_one)
2086 break;
92df7b51 2087 }
1da177e4 2088
aa93466b 2089 if (likely(sent_pkts)) {
684bad11
YC
2090 if (tcp_in_cwnd_reduction(sk))
2091 tp->prr_out += sent_pkts;
6ba8a3b1
ND
2092
2093 /* Send one loss probe per tail loss episode. */
2094 if (push_one != 2)
2095 tcp_schedule_loss_probe(sk);
ca8a2263 2096 tcp_cwnd_validate(sk, is_cwnd_limited);
a2a385d6 2097 return false;
1da177e4 2098 }
6ba8a3b1
ND
2099 return (push_one == 2) || (!tp->packets_out && tcp_send_head(sk));
2100}
2101
2102bool tcp_schedule_loss_probe(struct sock *sk)
2103{
2104 struct inet_connection_sock *icsk = inet_csk(sk);
2105 struct tcp_sock *tp = tcp_sk(sk);
2106 u32 timeout, tlp_time_stamp, rto_time_stamp;
740b0f18 2107 u32 rtt = usecs_to_jiffies(tp->srtt_us >> 3);
6ba8a3b1
ND
2108
2109 if (WARN_ON(icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS))
2110 return false;
2111 /* No consecutive loss probes. */
2112 if (WARN_ON(icsk->icsk_pending == ICSK_TIME_LOSS_PROBE)) {
2113 tcp_rearm_rto(sk);
2114 return false;
2115 }
2116 /* Don't do any loss probe on a Fast Open connection before 3WHS
2117 * finishes.
2118 */
2119 if (sk->sk_state == TCP_SYN_RECV)
2120 return false;
2121
2122 /* TLP is only scheduled when next timer event is RTO. */
2123 if (icsk->icsk_pending != ICSK_TIME_RETRANS)
2124 return false;
2125
2126 /* Schedule a loss probe in 2*RTT for SACK capable connections
2127 * in Open state, that are either limited by cwnd or application.
2128 */
740b0f18 2129 if (sysctl_tcp_early_retrans < 3 || !tp->srtt_us || !tp->packets_out ||
6ba8a3b1
ND
2130 !tcp_is_sack(tp) || inet_csk(sk)->icsk_ca_state != TCP_CA_Open)
2131 return false;
2132
2133 if ((tp->snd_cwnd > tcp_packets_in_flight(tp)) &&
2134 tcp_send_head(sk))
2135 return false;
2136
2137 /* Probe timeout is at least 1.5*rtt + TCP_DELACK_MAX to account
2138 * for delayed ack when there's one outstanding packet.
2139 */
2140 timeout = rtt << 1;
2141 if (tp->packets_out == 1)
2142 timeout = max_t(u32, timeout,
2143 (rtt + (rtt >> 1) + TCP_DELACK_MAX));
2144 timeout = max_t(u32, timeout, msecs_to_jiffies(10));
2145
2146 /* If RTO is shorter, just schedule TLP in its place. */
2147 tlp_time_stamp = tcp_time_stamp + timeout;
2148 rto_time_stamp = (u32)inet_csk(sk)->icsk_timeout;
2149 if ((s32)(tlp_time_stamp - rto_time_stamp) > 0) {
2150 s32 delta = rto_time_stamp - tcp_time_stamp;
2151 if (delta > 0)
2152 timeout = delta;
2153 }
2154
2155 inet_csk_reset_xmit_timer(sk, ICSK_TIME_LOSS_PROBE, timeout,
2156 TCP_RTO_MAX);
2157 return true;
2158}
2159
1f3279ae
ED
2160/* Thanks to skb fast clones, we can detect if a prior transmit of
2161 * a packet is still in a qdisc or driver queue.
2162 * In this case, there is very little point doing a retransmit !
2163 * Note: This is called from BH context only.
2164 */
2165static bool skb_still_in_host_queue(const struct sock *sk,
2166 const struct sk_buff *skb)
2167{
39bb5e62 2168 if (unlikely(skb_fclone_busy(sk, skb))) {
1f3279ae
ED
2169 NET_INC_STATS_BH(sock_net(sk),
2170 LINUX_MIB_TCPSPURIOUS_RTX_HOSTQUEUES);
2171 return true;
2172 }
2173 return false;
2174}
2175
6ba8a3b1
ND
2176/* When probe timeout (PTO) fires, send a new segment if one exists, else
2177 * retransmit the last segment.
2178 */
2179void tcp_send_loss_probe(struct sock *sk)
2180{
9b717a8d 2181 struct tcp_sock *tp = tcp_sk(sk);
6ba8a3b1
ND
2182 struct sk_buff *skb;
2183 int pcount;
2184 int mss = tcp_current_mss(sk);
2185 int err = -1;
2186
2187 if (tcp_send_head(sk) != NULL) {
2188 err = tcp_write_xmit(sk, mss, TCP_NAGLE_OFF, 2, GFP_ATOMIC);
2189 goto rearm_timer;
2190 }
2191
9b717a8d
ND
2192 /* At most one outstanding TLP retransmission. */
2193 if (tp->tlp_high_seq)
2194 goto rearm_timer;
2195
6ba8a3b1
ND
2196 /* Retransmit last segment. */
2197 skb = tcp_write_queue_tail(sk);
2198 if (WARN_ON(!skb))
2199 goto rearm_timer;
2200
1f3279ae
ED
2201 if (skb_still_in_host_queue(sk, skb))
2202 goto rearm_timer;
2203
6ba8a3b1
ND
2204 pcount = tcp_skb_pcount(skb);
2205 if (WARN_ON(!pcount))
2206 goto rearm_timer;
2207
2208 if ((pcount > 1) && (skb->len > (pcount - 1) * mss)) {
6cc55e09
OP
2209 if (unlikely(tcp_fragment(sk, skb, (pcount - 1) * mss, mss,
2210 GFP_ATOMIC)))
6ba8a3b1
ND
2211 goto rearm_timer;
2212 skb = tcp_write_queue_tail(sk);
2213 }
2214
2215 if (WARN_ON(!skb || !tcp_skb_pcount(skb)))
2216 goto rearm_timer;
2217
bef1909e 2218 err = __tcp_retransmit_skb(sk, skb);
6ba8a3b1 2219
9b717a8d
ND
2220 /* Record snd_nxt for loss detection. */
2221 if (likely(!err))
2222 tp->tlp_high_seq = tp->snd_nxt;
2223
6ba8a3b1
ND
2224rearm_timer:
2225 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
2226 inet_csk(sk)->icsk_rto,
2227 TCP_RTO_MAX);
2228
2229 if (likely(!err))
2230 NET_INC_STATS_BH(sock_net(sk),
2231 LINUX_MIB_TCPLOSSPROBES);
1da177e4
LT
2232}
2233
a762a980
DM
2234/* Push out any pending frames which were held back due to
2235 * TCP_CORK or attempt at coalescing tiny packets.
2236 * The socket must be locked by the caller.
2237 */
9e412ba7
IJ
2238void __tcp_push_pending_frames(struct sock *sk, unsigned int cur_mss,
2239 int nonagle)
a762a980 2240{
726e07a8
IJ
2241 /* If we are closed, the bytes will have to remain here.
2242 * In time closedown will finish, we empty the write queue and
2243 * all will be happy.
2244 */
2245 if (unlikely(sk->sk_state == TCP_CLOSE))
2246 return;
2247
99a1dec7
MG
2248 if (tcp_write_xmit(sk, cur_mss, nonagle, 0,
2249 sk_gfp_atomic(sk, GFP_ATOMIC)))
726e07a8 2250 tcp_check_probe_timer(sk);
a762a980
DM
2251}
2252
c1b4a7e6
DM
2253/* Send _single_ skb sitting at the send head. This function requires
2254 * true push pending frames to setup probe timer etc.
2255 */
2256void tcp_push_one(struct sock *sk, unsigned int mss_now)
2257{
fe067e8a 2258 struct sk_buff *skb = tcp_send_head(sk);
c1b4a7e6
DM
2259
2260 BUG_ON(!skb || skb->len < mss_now);
2261
d5dd9175 2262 tcp_write_xmit(sk, mss_now, TCP_NAGLE_PUSH, 1, sk->sk_allocation);
c1b4a7e6
DM
2263}
2264
1da177e4
LT
2265/* This function returns the amount that we can raise the
2266 * usable window based on the following constraints
e905a9ed 2267 *
1da177e4
LT
2268 * 1. The window can never be shrunk once it is offered (RFC 793)
2269 * 2. We limit memory per socket
2270 *
2271 * RFC 1122:
2272 * "the suggested [SWS] avoidance algorithm for the receiver is to keep
2273 * RECV.NEXT + RCV.WIN fixed until:
2274 * RCV.BUFF - RCV.USER - RCV.WINDOW >= min(1/2 RCV.BUFF, MSS)"
2275 *
2276 * i.e. don't raise the right edge of the window until you can raise
2277 * it at least MSS bytes.
2278 *
2279 * Unfortunately, the recommended algorithm breaks header prediction,
2280 * since header prediction assumes th->window stays fixed.
2281 *
2282 * Strictly speaking, keeping th->window fixed violates the receiver
2283 * side SWS prevention criteria. The problem is that under this rule
2284 * a stream of single byte packets will cause the right side of the
2285 * window to always advance by a single byte.
e905a9ed 2286 *
1da177e4
LT
2287 * Of course, if the sender implements sender side SWS prevention
2288 * then this will not be a problem.
e905a9ed 2289 *
1da177e4 2290 * BSD seems to make the following compromise:
e905a9ed 2291 *
1da177e4
LT
2292 * If the free space is less than the 1/4 of the maximum
2293 * space available and the free space is less than 1/2 mss,
2294 * then set the window to 0.
2295 * [ Actually, bsd uses MSS and 1/4 of maximal _window_ ]
2296 * Otherwise, just prevent the window from shrinking
2297 * and from being larger than the largest representable value.
2298 *
2299 * This prevents incremental opening of the window in the regime
2300 * where TCP is limited by the speed of the reader side taking
2301 * data out of the TCP receive queue. It does nothing about
2302 * those cases where the window is constrained on the sender side
2303 * because the pipeline is full.
2304 *
2305 * BSD also seems to "accidentally" limit itself to windows that are a
2306 * multiple of MSS, at least until the free space gets quite small.
2307 * This would appear to be a side effect of the mbuf implementation.
2308 * Combining these two algorithms results in the observed behavior
2309 * of having a fixed window size at almost all times.
2310 *
2311 * Below we obtain similar behavior by forcing the offered window to
2312 * a multiple of the mss when it is feasible to do so.
2313 *
2314 * Note, we don't "adjust" for TIMESTAMP or SACK option bytes.
2315 * Regular options like TIMESTAMP are taken into account.
2316 */
2317u32 __tcp_select_window(struct sock *sk)
2318{
463c84b9 2319 struct inet_connection_sock *icsk = inet_csk(sk);
1da177e4 2320 struct tcp_sock *tp = tcp_sk(sk);
caa20d9a 2321 /* MSS for the peer's data. Previous versions used mss_clamp
1da177e4
LT
2322 * here. I don't know if the value based on our guesses
2323 * of peer's MSS is better for the performance. It's more correct
2324 * but may be worse for the performance because of rcv_mss
2325 * fluctuations. --SAW 1998/11/1
2326 */
463c84b9 2327 int mss = icsk->icsk_ack.rcv_mss;
1da177e4 2328 int free_space = tcp_space(sk);
86c1a045
FW
2329 int allowed_space = tcp_full_space(sk);
2330 int full_space = min_t(int, tp->window_clamp, allowed_space);
1da177e4
LT
2331 int window;
2332
2333 if (mss > full_space)
e905a9ed 2334 mss = full_space;
1da177e4 2335
b92edbe0 2336 if (free_space < (full_space >> 1)) {
463c84b9 2337 icsk->icsk_ack.quick = 0;
1da177e4 2338
180d8cd9 2339 if (sk_under_memory_pressure(sk))
056834d9
IJ
2340 tp->rcv_ssthresh = min(tp->rcv_ssthresh,
2341 4U * tp->advmss);
1da177e4 2342
86c1a045
FW
2343 /* free_space might become our new window, make sure we don't
2344 * increase it due to wscale.
2345 */
2346 free_space = round_down(free_space, 1 << tp->rx_opt.rcv_wscale);
2347
2348 /* if free space is less than mss estimate, or is below 1/16th
2349 * of the maximum allowed, try to move to zero-window, else
2350 * tcp_clamp_window() will grow rcv buf up to tcp_rmem[2], and
2351 * new incoming data is dropped due to memory limits.
2352 * With large window, mss test triggers way too late in order
2353 * to announce zero window in time before rmem limit kicks in.
2354 */
2355 if (free_space < (allowed_space >> 4) || free_space < mss)
1da177e4
LT
2356 return 0;
2357 }
2358
2359 if (free_space > tp->rcv_ssthresh)
2360 free_space = tp->rcv_ssthresh;
2361
2362 /* Don't do rounding if we are using window scaling, since the
2363 * scaled window will not line up with the MSS boundary anyway.
2364 */
2365 window = tp->rcv_wnd;
2366 if (tp->rx_opt.rcv_wscale) {
2367 window = free_space;
2368
2369 /* Advertise enough space so that it won't get scaled away.
2370 * Import case: prevent zero window announcement if
2371 * 1<<rcv_wscale > mss.
2372 */
2373 if (((window >> tp->rx_opt.rcv_wscale) << tp->rx_opt.rcv_wscale) != window)
2374 window = (((window >> tp->rx_opt.rcv_wscale) + 1)
2375 << tp->rx_opt.rcv_wscale);
2376 } else {
2377 /* Get the largest window that is a nice multiple of mss.
2378 * Window clamp already applied above.
2379 * If our current window offering is within 1 mss of the
2380 * free space we just keep it. This prevents the divide
2381 * and multiply from happening most of the time.
2382 * We also don't do any window rounding when the free space
2383 * is too small.
2384 */
2385 if (window <= free_space - mss || window > free_space)
056834d9 2386 window = (free_space / mss) * mss;
84565070 2387 else if (mss == full_space &&
b92edbe0 2388 free_space > window + (full_space >> 1))
84565070 2389 window = free_space;
1da177e4
LT
2390 }
2391
2392 return window;
2393}
2394
4a17fc3a
IJ
2395/* Collapses two adjacent SKB's during retransmission. */
2396static void tcp_collapse_retrans(struct sock *sk, struct sk_buff *skb)
1da177e4
LT
2397{
2398 struct tcp_sock *tp = tcp_sk(sk);
fe067e8a 2399 struct sk_buff *next_skb = tcp_write_queue_next(sk, skb);
058dc334 2400 int skb_size, next_skb_size;
1da177e4 2401
058dc334
IJ
2402 skb_size = skb->len;
2403 next_skb_size = next_skb->len;
1da177e4 2404
058dc334 2405 BUG_ON(tcp_skb_pcount(skb) != 1 || tcp_skb_pcount(next_skb) != 1);
a6963a6b 2406
058dc334 2407 tcp_highest_sack_combine(sk, next_skb, skb);
1da177e4 2408
058dc334 2409 tcp_unlink_write_queue(next_skb, sk);
1da177e4 2410
058dc334
IJ
2411 skb_copy_from_linear_data(next_skb, skb_put(skb, next_skb_size),
2412 next_skb_size);
1da177e4 2413
058dc334
IJ
2414 if (next_skb->ip_summed == CHECKSUM_PARTIAL)
2415 skb->ip_summed = CHECKSUM_PARTIAL;
1da177e4 2416
058dc334
IJ
2417 if (skb->ip_summed != CHECKSUM_PARTIAL)
2418 skb->csum = csum_block_add(skb->csum, next_skb->csum, skb_size);
1da177e4 2419
058dc334
IJ
2420 /* Update sequence range on original skb. */
2421 TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(next_skb)->end_seq;
1da177e4 2422
e6c7d085 2423 /* Merge over control information. This moves PSH/FIN etc. over */
4de075e0 2424 TCP_SKB_CB(skb)->tcp_flags |= TCP_SKB_CB(next_skb)->tcp_flags;
058dc334
IJ
2425
2426 /* All done, get rid of second SKB and account for it so
2427 * packet counting does not break.
2428 */
2429 TCP_SKB_CB(skb)->sacked |= TCP_SKB_CB(next_skb)->sacked & TCPCB_EVER_RETRANS;
058dc334
IJ
2430
2431 /* changed transmit queue under us so clear hints */
ef9da47c
IJ
2432 tcp_clear_retrans_hints_partial(tp);
2433 if (next_skb == tp->retransmit_skb_hint)
2434 tp->retransmit_skb_hint = skb;
058dc334 2435
797108d1
IJ
2436 tcp_adjust_pcount(sk, next_skb, tcp_skb_pcount(next_skb));
2437
058dc334 2438 sk_wmem_free_skb(sk, next_skb);
1da177e4
LT
2439}
2440
67edfef7 2441/* Check if coalescing SKBs is legal. */
a2a385d6 2442static bool tcp_can_collapse(const struct sock *sk, const struct sk_buff *skb)
4a17fc3a
IJ
2443{
2444 if (tcp_skb_pcount(skb) > 1)
a2a385d6 2445 return false;
4a17fc3a
IJ
2446 /* TODO: SACK collapsing could be used to remove this condition */
2447 if (skb_shinfo(skb)->nr_frags != 0)
a2a385d6 2448 return false;
4a17fc3a 2449 if (skb_cloned(skb))
a2a385d6 2450 return false;
4a17fc3a 2451 if (skb == tcp_send_head(sk))
a2a385d6 2452 return false;
4a17fc3a
IJ
2453 /* Some heurestics for collapsing over SACK'd could be invented */
2454 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)
a2a385d6 2455 return false;
4a17fc3a 2456
a2a385d6 2457 return true;
4a17fc3a
IJ
2458}
2459
67edfef7
AK
2460/* Collapse packets in the retransmit queue to make to create
2461 * less packets on the wire. This is only done on retransmission.
2462 */
4a17fc3a
IJ
2463static void tcp_retrans_try_collapse(struct sock *sk, struct sk_buff *to,
2464 int space)
2465{
2466 struct tcp_sock *tp = tcp_sk(sk);
2467 struct sk_buff *skb = to, *tmp;
a2a385d6 2468 bool first = true;
4a17fc3a
IJ
2469
2470 if (!sysctl_tcp_retrans_collapse)
2471 return;
4de075e0 2472 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN)
4a17fc3a
IJ
2473 return;
2474
2475 tcp_for_write_queue_from_safe(skb, tmp, sk) {
2476 if (!tcp_can_collapse(sk, skb))
2477 break;
2478
2479 space -= skb->len;
2480
2481 if (first) {
a2a385d6 2482 first = false;
4a17fc3a
IJ
2483 continue;
2484 }
2485
2486 if (space < 0)
2487 break;
2488 /* Punt if not enough space exists in the first SKB for
2489 * the data in the second
2490 */
a21d4572 2491 if (skb->len > skb_availroom(to))
4a17fc3a
IJ
2492 break;
2493
2494 if (after(TCP_SKB_CB(skb)->end_seq, tcp_wnd_end(tp)))
2495 break;
2496
2497 tcp_collapse_retrans(sk, to);
2498 }
2499}
2500
1da177e4
LT
2501/* This retransmits one SKB. Policy decisions and retransmit queue
2502 * state updates are done by the caller. Returns non-zero if an
2503 * error occurred which prevented the send.
2504 */
93b174ad 2505int __tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb)
1da177e4
LT
2506{
2507 struct tcp_sock *tp = tcp_sk(sk);
5d424d5a 2508 struct inet_connection_sock *icsk = inet_csk(sk);
7d227cd2 2509 unsigned int cur_mss;
c84a5711 2510 int err;
1da177e4 2511
5d424d5a
JH
2512 /* Inconslusive MTU probe */
2513 if (icsk->icsk_mtup.probe_size) {
2514 icsk->icsk_mtup.probe_size = 0;
2515 }
2516
1da177e4 2517 /* Do not sent more than we queued. 1/4 is reserved for possible
caa20d9a 2518 * copying overhead: fragmentation, tunneling, mangling etc.
1da177e4
LT
2519 */
2520 if (atomic_read(&sk->sk_wmem_alloc) >
2521 min(sk->sk_wmem_queued + (sk->sk_wmem_queued >> 2), sk->sk_sndbuf))
2522 return -EAGAIN;
2523
1f3279ae
ED
2524 if (skb_still_in_host_queue(sk, skb))
2525 return -EBUSY;
2526
1da177e4
LT
2527 if (before(TCP_SKB_CB(skb)->seq, tp->snd_una)) {
2528 if (before(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
2529 BUG();
1da177e4
LT
2530 if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq))
2531 return -ENOMEM;
2532 }
2533
7d227cd2
SS
2534 if (inet_csk(sk)->icsk_af_ops->rebuild_header(sk))
2535 return -EHOSTUNREACH; /* Routing failure or similar. */
2536
0c54b85f 2537 cur_mss = tcp_current_mss(sk);
7d227cd2 2538
1da177e4
LT
2539 /* If receiver has shrunk his window, and skb is out of
2540 * new window, do not retransmit it. The exception is the
2541 * case, when window is shrunk to zero. In this case
2542 * our retransmit serves as a zero window probe.
2543 */
9d4fb27d
JP
2544 if (!before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp)) &&
2545 TCP_SKB_CB(skb)->seq != tp->snd_una)
1da177e4
LT
2546 return -EAGAIN;
2547
2548 if (skb->len > cur_mss) {
6cc55e09 2549 if (tcp_fragment(sk, skb, cur_mss, cur_mss, GFP_ATOMIC))
1da177e4 2550 return -ENOMEM; /* We'll try again later. */
02276f3c 2551 } else {
9eb9362e
IJ
2552 int oldpcount = tcp_skb_pcount(skb);
2553
2554 if (unlikely(oldpcount > 1)) {
c52e2421
ED
2555 if (skb_unclone(skb, GFP_ATOMIC))
2556 return -ENOMEM;
9eb9362e
IJ
2557 tcp_init_tso_segs(sk, skb, cur_mss);
2558 tcp_adjust_pcount(sk, skb, oldpcount - tcp_skb_pcount(skb));
2559 }
1da177e4
LT
2560 }
2561
4a17fc3a 2562 tcp_retrans_try_collapse(sk, skb, cur_mss);
1da177e4 2563
1da177e4
LT
2564 /* Make a copy, if the first transmission SKB clone we made
2565 * is still in somebody's hands, else make a clone.
2566 */
1da177e4 2567
50bceae9
TG
2568 /* make sure skb->data is aligned on arches that require it
2569 * and check if ack-trimming & collapsing extended the headroom
2570 * beyond what csum_start can cover.
2571 */
2572 if (unlikely((NET_IP_ALIGN && ((unsigned long)skb->data & 3)) ||
2573 skb_headroom(skb) >= 0xFFFF)) {
117632e6
ED
2574 struct sk_buff *nskb = __pskb_copy(skb, MAX_TCP_HEADER,
2575 GFP_ATOMIC);
c84a5711
YC
2576 err = nskb ? tcp_transmit_skb(sk, nskb, 0, GFP_ATOMIC) :
2577 -ENOBUFS;
117632e6 2578 } else {
c84a5711 2579 err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
117632e6 2580 }
c84a5711 2581
fc9f3501 2582 if (likely(!err)) {
c84a5711 2583 TCP_SKB_CB(skb)->sacked |= TCPCB_EVER_RETRANS;
fc9f3501
ED
2584 /* Update global TCP statistics. */
2585 TCP_INC_STATS(sock_net(sk), TCP_MIB_RETRANSSEGS);
2586 if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN)
2587 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPSYNRETRANS);
2588 tp->total_retrans++;
2589 }
c84a5711 2590 return err;
93b174ad
YC
2591}
2592
2593int tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb)
2594{
2595 struct tcp_sock *tp = tcp_sk(sk);
2596 int err = __tcp_retransmit_skb(sk, skb);
1da177e4
LT
2597
2598 if (err == 0) {
1da177e4 2599#if FASTRETRANS_DEBUG > 0
056834d9 2600 if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) {
e87cc472 2601 net_dbg_ratelimited("retrans_out leaked\n");
1da177e4
LT
2602 }
2603#endif
b08d6cb2
IJ
2604 if (!tp->retrans_out)
2605 tp->lost_retrans_low = tp->snd_nxt;
1da177e4
LT
2606 TCP_SKB_CB(skb)->sacked |= TCPCB_RETRANS;
2607 tp->retrans_out += tcp_skb_pcount(skb);
2608
2609 /* Save stamp of the first retransmit. */
2610 if (!tp->retrans_stamp)
7faee5c0 2611 tp->retrans_stamp = tcp_skb_timestamp(skb);
1da177e4 2612
1da177e4
LT
2613 /* snd_nxt is stored to detect loss of retransmitted segment,
2614 * see tcp_input.c tcp_sacktag_write_queue().
2615 */
2616 TCP_SKB_CB(skb)->ack_seq = tp->snd_nxt;
1f3279ae 2617 } else if (err != -EBUSY) {
24ab6bec 2618 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPRETRANSFAIL);
1da177e4 2619 }
6e08d5e3
YC
2620
2621 if (tp->undo_retrans < 0)
2622 tp->undo_retrans = 0;
2623 tp->undo_retrans += tcp_skb_pcount(skb);
1da177e4
LT
2624 return err;
2625}
2626
67edfef7
AK
2627/* Check if we forward retransmits are possible in the current
2628 * window/congestion state.
2629 */
a2a385d6 2630static bool tcp_can_forward_retransmit(struct sock *sk)
b5afe7bc
IJ
2631{
2632 const struct inet_connection_sock *icsk = inet_csk(sk);
cf533ea5 2633 const struct tcp_sock *tp = tcp_sk(sk);
b5afe7bc
IJ
2634
2635 /* Forward retransmissions are possible only during Recovery. */
2636 if (icsk->icsk_ca_state != TCP_CA_Recovery)
a2a385d6 2637 return false;
b5afe7bc
IJ
2638
2639 /* No forward retransmissions in Reno are possible. */
2640 if (tcp_is_reno(tp))
a2a385d6 2641 return false;
b5afe7bc
IJ
2642
2643 /* Yeah, we have to make difficult choice between forward transmission
2644 * and retransmission... Both ways have their merits...
2645 *
2646 * For now we do not retransmit anything, while we have some new
2647 * segments to send. In the other cases, follow rule 3 for
2648 * NextSeg() specified in RFC3517.
2649 */
2650
2651 if (tcp_may_send_now(sk))
a2a385d6 2652 return false;
b5afe7bc 2653
a2a385d6 2654 return true;
b5afe7bc
IJ
2655}
2656
1da177e4
LT
2657/* This gets called after a retransmit timeout, and the initially
2658 * retransmitted data is acknowledged. It tries to continue
2659 * resending the rest of the retransmit queue, until either
2660 * we've sent it all or the congestion window limit is reached.
2661 * If doing SACK, the first ACK which comes back for a timeout
2662 * based retransmit packet might feed us FACK information again.
2663 * If so, we use it to avoid unnecessarily retransmissions.
2664 */
2665void tcp_xmit_retransmit_queue(struct sock *sk)
2666{
6687e988 2667 const struct inet_connection_sock *icsk = inet_csk(sk);
1da177e4
LT
2668 struct tcp_sock *tp = tcp_sk(sk);
2669 struct sk_buff *skb;
0e1c54c2 2670 struct sk_buff *hole = NULL;
618d9f25 2671 u32 last_lost;
61eb55f4 2672 int mib_idx;
0e1c54c2 2673 int fwd_rexmitting = 0;
6a438bbe 2674
45e77d31
IJ
2675 if (!tp->packets_out)
2676 return;
2677
08ebd172
IJ
2678 if (!tp->lost_out)
2679 tp->retransmit_high = tp->snd_una;
2680
618d9f25 2681 if (tp->retransmit_skb_hint) {
6a438bbe 2682 skb = tp->retransmit_skb_hint;
618d9f25
IJ
2683 last_lost = TCP_SKB_CB(skb)->end_seq;
2684 if (after(last_lost, tp->retransmit_high))
2685 last_lost = tp->retransmit_high;
2686 } else {
fe067e8a 2687 skb = tcp_write_queue_head(sk);
618d9f25
IJ
2688 last_lost = tp->snd_una;
2689 }
1da177e4 2690
08ebd172
IJ
2691 tcp_for_write_queue_from(skb, sk) {
2692 __u8 sacked = TCP_SKB_CB(skb)->sacked;
1da177e4 2693
08ebd172
IJ
2694 if (skb == tcp_send_head(sk))
2695 break;
2696 /* we could do better than to assign each time */
0e1c54c2
IJ
2697 if (hole == NULL)
2698 tp->retransmit_skb_hint = skb;
08ebd172
IJ
2699
2700 /* Assume this retransmit will generate
2701 * only one packet for congestion window
2702 * calculation purposes. This works because
2703 * tcp_retransmit_skb() will chop up the
2704 * packet to be MSS sized and all the
2705 * packet counting works out.
2706 */
2707 if (tcp_packets_in_flight(tp) >= tp->snd_cwnd)
2708 return;
1da177e4 2709
0e1c54c2
IJ
2710 if (fwd_rexmitting) {
2711begin_fwd:
2712 if (!before(TCP_SKB_CB(skb)->seq, tcp_highest_sack_seq(tp)))
2713 break;
2714 mib_idx = LINUX_MIB_TCPFORWARDRETRANS;
6a438bbe 2715
0e1c54c2 2716 } else if (!before(TCP_SKB_CB(skb)->seq, tp->retransmit_high)) {
618d9f25 2717 tp->retransmit_high = last_lost;
0e1c54c2
IJ
2718 if (!tcp_can_forward_retransmit(sk))
2719 break;
2720 /* Backtrack if necessary to non-L'ed skb */
2721 if (hole != NULL) {
2722 skb = hole;
2723 hole = NULL;
2724 }
2725 fwd_rexmitting = 1;
2726 goto begin_fwd;
1da177e4 2727
0e1c54c2 2728 } else if (!(sacked & TCPCB_LOST)) {
ac11ba75 2729 if (hole == NULL && !(sacked & (TCPCB_SACKED_RETRANS|TCPCB_SACKED_ACKED)))
0e1c54c2
IJ
2730 hole = skb;
2731 continue;
1da177e4 2732
0e1c54c2 2733 } else {
618d9f25 2734 last_lost = TCP_SKB_CB(skb)->end_seq;
0e1c54c2
IJ
2735 if (icsk->icsk_ca_state != TCP_CA_Loss)
2736 mib_idx = LINUX_MIB_TCPFASTRETRANS;
2737 else
2738 mib_idx = LINUX_MIB_TCPSLOWSTARTRETRANS;
2739 }
1da177e4 2740
0e1c54c2 2741 if (sacked & (TCPCB_SACKED_ACKED|TCPCB_SACKED_RETRANS))
1da177e4
LT
2742 continue;
2743
24ab6bec 2744 if (tcp_retransmit_skb(sk, skb))
0e1c54c2 2745 return;
24ab6bec 2746
0e1c54c2 2747 NET_INC_STATS_BH(sock_net(sk), mib_idx);
1da177e4 2748
684bad11 2749 if (tcp_in_cwnd_reduction(sk))
a262f0cd
ND
2750 tp->prr_out += tcp_skb_pcount(skb);
2751
fe067e8a 2752 if (skb == tcp_write_queue_head(sk))
3f421baa
ACM
2753 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
2754 inet_csk(sk)->icsk_rto,
2755 TCP_RTO_MAX);
1da177e4
LT
2756 }
2757}
2758
1da177e4
LT
2759/* Send a fin. The caller locks the socket for us. This cannot be
2760 * allowed to fail queueing a FIN frame under any circumstances.
2761 */
2762void tcp_send_fin(struct sock *sk)
2763{
e905a9ed 2764 struct tcp_sock *tp = tcp_sk(sk);
fe067e8a 2765 struct sk_buff *skb = tcp_write_queue_tail(sk);
1da177e4 2766 int mss_now;
e905a9ed 2767
1da177e4
LT
2768 /* Optimization, tack on the FIN if we have a queue of
2769 * unsent frames. But be careful about outgoing SACKS
2770 * and IP options.
2771 */
0c54b85f 2772 mss_now = tcp_current_mss(sk);
1da177e4 2773
fe067e8a 2774 if (tcp_send_head(sk) != NULL) {
4de075e0 2775 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_FIN;
1da177e4
LT
2776 TCP_SKB_CB(skb)->end_seq++;
2777 tp->write_seq++;
2778 } else {
2779 /* Socket is locked, keep trying until memory is available. */
2780 for (;;) {
aa133076
WF
2781 skb = alloc_skb_fclone(MAX_TCP_HEADER,
2782 sk->sk_allocation);
1da177e4
LT
2783 if (skb)
2784 break;
2785 yield();
2786 }
2787
2788 /* Reserve space for headers and prepare control bits. */
2789 skb_reserve(skb, MAX_TCP_HEADER);
1da177e4 2790 /* FIN eats a sequence byte, write_seq advanced by tcp_queue_skb(). */
e870a8ef 2791 tcp_init_nondata_skb(skb, tp->write_seq,
a3433f35 2792 TCPHDR_ACK | TCPHDR_FIN);
1da177e4
LT
2793 tcp_queue_skb(sk, skb);
2794 }
9e412ba7 2795 __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_OFF);
1da177e4
LT
2796}
2797
2798/* We get here when a process closes a file descriptor (either due to
2799 * an explicit close() or as a byproduct of exit()'ing) and there
2800 * was unread data in the receive queue. This behavior is recommended
65bb723c 2801 * by RFC 2525, section 2.17. -DaveM
1da177e4 2802 */
dd0fc66f 2803void tcp_send_active_reset(struct sock *sk, gfp_t priority)
1da177e4 2804{
1da177e4
LT
2805 struct sk_buff *skb;
2806
2807 /* NOTE: No TCP options attached and we never retransmit this. */
2808 skb = alloc_skb(MAX_TCP_HEADER, priority);
2809 if (!skb) {
4e673444 2810 NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED);
1da177e4
LT
2811 return;
2812 }
2813
2814 /* Reserve space for headers and prepare control bits. */
2815 skb_reserve(skb, MAX_TCP_HEADER);
e870a8ef 2816 tcp_init_nondata_skb(skb, tcp_acceptable_seq(sk),
a3433f35 2817 TCPHDR_ACK | TCPHDR_RST);
1da177e4 2818 /* Send it off. */
dfb4b9dc 2819 if (tcp_transmit_skb(sk, skb, 0, priority))
4e673444 2820 NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED);
26af65cb 2821
81cc8a75 2822 TCP_INC_STATS(sock_net(sk), TCP_MIB_OUTRSTS);
1da177e4
LT
2823}
2824
67edfef7
AK
2825/* Send a crossed SYN-ACK during socket establishment.
2826 * WARNING: This routine must only be called when we have already sent
1da177e4
LT
2827 * a SYN packet that crossed the incoming SYN that caused this routine
2828 * to get called. If this assumption fails then the initial rcv_wnd
2829 * and rcv_wscale values will not be correct.
2830 */
2831int tcp_send_synack(struct sock *sk)
2832{
056834d9 2833 struct sk_buff *skb;
1da177e4 2834
fe067e8a 2835 skb = tcp_write_queue_head(sk);
4de075e0 2836 if (skb == NULL || !(TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN)) {
91df42be 2837 pr_debug("%s: wrong queue state\n", __func__);
1da177e4
LT
2838 return -EFAULT;
2839 }
4de075e0 2840 if (!(TCP_SKB_CB(skb)->tcp_flags & TCPHDR_ACK)) {
1da177e4
LT
2841 if (skb_cloned(skb)) {
2842 struct sk_buff *nskb = skb_copy(skb, GFP_ATOMIC);
2843 if (nskb == NULL)
2844 return -ENOMEM;
fe067e8a 2845 tcp_unlink_write_queue(skb, sk);
f4a775d1 2846 __skb_header_release(nskb);
fe067e8a 2847 __tcp_add_write_queue_head(sk, nskb);
3ab224be
HA
2848 sk_wmem_free_skb(sk, skb);
2849 sk->sk_wmem_queued += nskb->truesize;
2850 sk_mem_charge(sk, nskb->truesize);
1da177e4
LT
2851 skb = nskb;
2852 }
2853
4de075e0 2854 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_ACK;
735d3831 2855 tcp_ecn_send_synack(sk, skb);
1da177e4 2856 }
dfb4b9dc 2857 return tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
1da177e4
LT
2858}
2859
4aea39c1
ED
2860/**
2861 * tcp_make_synack - Prepare a SYN-ACK.
2862 * sk: listener socket
2863 * dst: dst entry attached to the SYNACK
2864 * req: request_sock pointer
4aea39c1
ED
2865 *
2866 * Allocate one skb and build a SYNACK packet.
2867 * @dst is consumed : Caller should not use it again.
2868 */
056834d9 2869struct sk_buff *tcp_make_synack(struct sock *sk, struct dst_entry *dst,
e6b4d113 2870 struct request_sock *req,
8336886f 2871 struct tcp_fastopen_cookie *foc)
1da177e4 2872{
bd0388ae 2873 struct tcp_out_options opts;
2e6599cb 2874 struct inet_request_sock *ireq = inet_rsk(req);
1da177e4
LT
2875 struct tcp_sock *tp = tcp_sk(sk);
2876 struct tcphdr *th;
1da177e4 2877 struct sk_buff *skb;
cfb6eeb4 2878 struct tcp_md5sig_key *md5;
bd0388ae 2879 int tcp_header_size;
f5fff5dc 2880 int mss;
1da177e4 2881
a0b8486c 2882 skb = sock_wmalloc(sk, MAX_TCP_HEADER, 1, GFP_ATOMIC);
4aea39c1
ED
2883 if (unlikely(!skb)) {
2884 dst_release(dst);
1da177e4 2885 return NULL;
4aea39c1 2886 }
1da177e4
LT
2887 /* Reserve space for headers. */
2888 skb_reserve(skb, MAX_TCP_HEADER);
2889
4aea39c1 2890 skb_dst_set(skb, dst);
ca10b9e9 2891 security_skb_owned_by(skb, sk);
1da177e4 2892
0dbaee3b 2893 mss = dst_metric_advmss(dst);
f5fff5dc
TQ
2894 if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < mss)
2895 mss = tp->rx_opt.user_mss;
2896
33ad798c 2897 memset(&opts, 0, sizeof(opts));
8b5f12d0
FW
2898#ifdef CONFIG_SYN_COOKIES
2899 if (unlikely(req->cookie_ts))
7faee5c0 2900 skb->skb_mstamp.stamp_jiffies = cookie_init_timestamp(req);
8b5f12d0
FW
2901 else
2902#endif
7faee5c0 2903 skb_mstamp_get(&skb->skb_mstamp);
1a2c6181
CP
2904 tcp_header_size = tcp_synack_options(sk, req, mss, skb, &opts, &md5,
2905 foc) + sizeof(*th);
cfb6eeb4 2906
aa8223c7
ACM
2907 skb_push(skb, tcp_header_size);
2908 skb_reset_transport_header(skb);
1da177e4 2909
aa8223c7 2910 th = tcp_hdr(skb);
1da177e4
LT
2911 memset(th, 0, sizeof(struct tcphdr));
2912 th->syn = 1;
2913 th->ack = 1;
735d3831 2914 tcp_ecn_make_synack(req, th, sk);
b44084c2 2915 th->source = htons(ireq->ir_num);
634fb979 2916 th->dest = ireq->ir_rmt_port;
e870a8ef
IJ
2917 /* Setting of flags are superfluous here for callers (and ECE is
2918 * not even correctly set)
2919 */
2920 tcp_init_nondata_skb(skb, tcp_rsk(req)->snt_isn,
a3433f35 2921 TCPHDR_SYN | TCPHDR_ACK);
4957faad 2922
1da177e4 2923 th->seq = htonl(TCP_SKB_CB(skb)->seq);
8336886f
JC
2924 /* XXX data is queued and acked as is. No buffer/window check */
2925 th->ack_seq = htonl(tcp_rsk(req)->rcv_nxt);
1da177e4
LT
2926
2927 /* RFC1323: The window in SYN & SYN/ACK segments is never scaled. */
600ff0c2 2928 th->window = htons(min(req->rcv_wnd, 65535U));
bd0388ae 2929 tcp_options_write((__be32 *)(th + 1), tp, &opts);
1da177e4 2930 th->doff = (tcp_header_size >> 2);
a0b8486c 2931 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_OUTSEGS);
cfb6eeb4
YH
2932
2933#ifdef CONFIG_TCP_MD5SIG
2934 /* Okay, we have all we need - do the md5 hash if needed */
2935 if (md5) {
bd0388ae 2936 tcp_rsk(req)->af_specific->calc_md5_hash(opts.hash_location,
49a72dfb 2937 md5, NULL, req, skb);
cfb6eeb4
YH
2938 }
2939#endif
2940
1da177e4
LT
2941 return skb;
2942}
4bc2f18b 2943EXPORT_SYMBOL(tcp_make_synack);
1da177e4 2944
81164413
DB
2945static void tcp_ca_dst_init(struct sock *sk, const struct dst_entry *dst)
2946{
2947 struct inet_connection_sock *icsk = inet_csk(sk);
2948 const struct tcp_congestion_ops *ca;
2949 u32 ca_key = dst_metric(dst, RTAX_CC_ALGO);
2950
2951 if (ca_key == TCP_CA_UNSPEC)
2952 return;
2953
2954 rcu_read_lock();
2955 ca = tcp_ca_find_key(ca_key);
2956 if (likely(ca && try_module_get(ca->owner))) {
2957 module_put(icsk->icsk_ca_ops->owner);
2958 icsk->icsk_ca_dst_locked = tcp_ca_dst_locked(dst);
2959 icsk->icsk_ca_ops = ca;
2960 }
2961 rcu_read_unlock();
2962}
2963
67edfef7 2964/* Do all connect socket setups that can be done AF independent. */
f7e56a76 2965static void tcp_connect_init(struct sock *sk)
1da177e4 2966{
cf533ea5 2967 const struct dst_entry *dst = __sk_dst_get(sk);
1da177e4
LT
2968 struct tcp_sock *tp = tcp_sk(sk);
2969 __u8 rcv_wscale;
2970
2971 /* We'll fix this up when we get a response from the other end.
2972 * See tcp_input.c:tcp_rcv_state_process case TCP_SYN_SENT.
2973 */
2974 tp->tcp_header_len = sizeof(struct tcphdr) +
bb5b7c11 2975 (sysctl_tcp_timestamps ? TCPOLEN_TSTAMP_ALIGNED : 0);
1da177e4 2976
cfb6eeb4
YH
2977#ifdef CONFIG_TCP_MD5SIG
2978 if (tp->af_specific->md5_lookup(sk, sk) != NULL)
2979 tp->tcp_header_len += TCPOLEN_MD5SIG_ALIGNED;
2980#endif
2981
1da177e4
LT
2982 /* If user gave his TCP_MAXSEG, record it to clamp */
2983 if (tp->rx_opt.user_mss)
2984 tp->rx_opt.mss_clamp = tp->rx_opt.user_mss;
2985 tp->max_window = 0;
5d424d5a 2986 tcp_mtup_init(sk);
1da177e4
LT
2987 tcp_sync_mss(sk, dst_mtu(dst));
2988
81164413
DB
2989 tcp_ca_dst_init(sk, dst);
2990
1da177e4
LT
2991 if (!tp->window_clamp)
2992 tp->window_clamp = dst_metric(dst, RTAX_WINDOW);
0dbaee3b 2993 tp->advmss = dst_metric_advmss(dst);
f5fff5dc
TQ
2994 if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < tp->advmss)
2995 tp->advmss = tp->rx_opt.user_mss;
2996
1da177e4 2997 tcp_initialize_rcv_mss(sk);
1da177e4 2998
e88c64f0
HPP
2999 /* limit the window selection if the user enforce a smaller rx buffer */
3000 if (sk->sk_userlocks & SOCK_RCVBUF_LOCK &&
3001 (tp->window_clamp > tcp_full_space(sk) || tp->window_clamp == 0))
3002 tp->window_clamp = tcp_full_space(sk);
3003
1da177e4
LT
3004 tcp_select_initial_window(tcp_full_space(sk),
3005 tp->advmss - (tp->rx_opt.ts_recent_stamp ? tp->tcp_header_len - sizeof(struct tcphdr) : 0),
3006 &tp->rcv_wnd,
3007 &tp->window_clamp,
bb5b7c11 3008 sysctl_tcp_window_scaling,
31d12926 3009 &rcv_wscale,
3010 dst_metric(dst, RTAX_INITRWND));
1da177e4
LT
3011
3012 tp->rx_opt.rcv_wscale = rcv_wscale;
3013 tp->rcv_ssthresh = tp->rcv_wnd;
3014
3015 sk->sk_err = 0;
3016 sock_reset_flag(sk, SOCK_DONE);
3017 tp->snd_wnd = 0;
ee7537b6 3018 tcp_init_wl(tp, 0);
1da177e4
LT
3019 tp->snd_una = tp->write_seq;
3020 tp->snd_sml = tp->write_seq;
33f5f57e 3021 tp->snd_up = tp->write_seq;
370816ae 3022 tp->snd_nxt = tp->write_seq;
ee995283
PE
3023
3024 if (likely(!tp->repair))
3025 tp->rcv_nxt = 0;
c7781a6e
AV
3026 else
3027 tp->rcv_tstamp = tcp_time_stamp;
ee995283
PE
3028 tp->rcv_wup = tp->rcv_nxt;
3029 tp->copied_seq = tp->rcv_nxt;
1da177e4 3030
463c84b9
ACM
3031 inet_csk(sk)->icsk_rto = TCP_TIMEOUT_INIT;
3032 inet_csk(sk)->icsk_retransmits = 0;
1da177e4
LT
3033 tcp_clear_retrans(tp);
3034}
3035
783237e8
YC
3036static void tcp_connect_queue_skb(struct sock *sk, struct sk_buff *skb)
3037{
3038 struct tcp_sock *tp = tcp_sk(sk);
3039 struct tcp_skb_cb *tcb = TCP_SKB_CB(skb);
3040
3041 tcb->end_seq += skb->len;
f4a775d1 3042 __skb_header_release(skb);
783237e8
YC
3043 __tcp_add_write_queue_tail(sk, skb);
3044 sk->sk_wmem_queued += skb->truesize;
3045 sk_mem_charge(sk, skb->truesize);
3046 tp->write_seq = tcb->end_seq;
3047 tp->packets_out += tcp_skb_pcount(skb);
3048}
3049
3050/* Build and send a SYN with data and (cached) Fast Open cookie. However,
3051 * queue a data-only packet after the regular SYN, such that regular SYNs
3052 * are retransmitted on timeouts. Also if the remote SYN-ACK acknowledges
3053 * only the SYN sequence, the data are retransmitted in the first ACK.
3054 * If cookie is not cached or other error occurs, falls back to send a
3055 * regular SYN with Fast Open cookie request option.
3056 */
3057static int tcp_send_syn_data(struct sock *sk, struct sk_buff *syn)
3058{
3059 struct tcp_sock *tp = tcp_sk(sk);
3060 struct tcp_fastopen_request *fo = tp->fastopen_req;
57be5bda 3061 int syn_loss = 0, space, err = 0, copied;
aab48743 3062 unsigned long last_syn_loss = 0;
355a901e 3063 struct sk_buff *syn_data;
aab48743 3064
67da22d2 3065 tp->rx_opt.mss_clamp = tp->advmss; /* If MSS is not cached */
aab48743
YC
3066 tcp_fastopen_cache_get(sk, &tp->rx_opt.mss_clamp, &fo->cookie,
3067 &syn_loss, &last_syn_loss);
3068 /* Recurring FO SYN losses: revert to regular handshake temporarily */
3069 if (syn_loss > 1 &&
3070 time_before(jiffies, last_syn_loss + (60*HZ << syn_loss))) {
3071 fo->cookie.len = -1;
3072 goto fallback;
3073 }
783237e8 3074
67da22d2
YC
3075 if (sysctl_tcp_fastopen & TFO_CLIENT_NO_COOKIE)
3076 fo->cookie.len = -1;
3077 else if (fo->cookie.len <= 0)
783237e8
YC
3078 goto fallback;
3079
3080 /* MSS for SYN-data is based on cached MSS and bounded by PMTU and
3081 * user-MSS. Reserve maximum option space for middleboxes that add
3082 * private TCP options. The cost is reduced data space in SYN :(
3083 */
3084 if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < tp->rx_opt.mss_clamp)
3085 tp->rx_opt.mss_clamp = tp->rx_opt.user_mss;
1b63edd6 3086 space = __tcp_mtu_to_mss(sk, inet_csk(sk)->icsk_pmtu_cookie) -
783237e8
YC
3087 MAX_TCP_OPTION_SPACE;
3088
f5ddcbbb
ED
3089 space = min_t(size_t, space, fo->size);
3090
3091 /* limit to order-0 allocations */
3092 space = min_t(size_t, space, SKB_MAX_HEAD(MAX_TCP_HEADER));
3093
355a901e
ED
3094 syn_data = sk_stream_alloc_skb(sk, space, sk->sk_allocation);
3095 if (!syn_data)
783237e8 3096 goto fallback;
355a901e
ED
3097 syn_data->ip_summed = CHECKSUM_PARTIAL;
3098 memcpy(syn_data->cb, syn->cb, sizeof(syn->cb));
57be5bda
AV
3099 copied = copy_from_iter(skb_put(syn_data, space), space,
3100 &fo->data->msg_iter);
3101 if (unlikely(!copied)) {
355a901e
ED
3102 kfree_skb(syn_data);
3103 goto fallback;
3104 }
57be5bda
AV
3105 if (copied != space) {
3106 skb_trim(syn_data, copied);
3107 space = copied;
3108 }
783237e8 3109
355a901e
ED
3110 /* No more data pending in inet_wait_for_connect() */
3111 if (space == fo->size)
3112 fo->data = NULL;
3113 fo->copied = space;
783237e8 3114
355a901e 3115 tcp_connect_queue_skb(sk, syn_data);
783237e8 3116
355a901e 3117 err = tcp_transmit_skb(sk, syn_data, 1, sk->sk_allocation);
783237e8 3118
355a901e 3119 syn->skb_mstamp = syn_data->skb_mstamp;
431a9124 3120
355a901e
ED
3121 /* Now full SYN+DATA was cloned and sent (or not),
3122 * remove the SYN from the original skb (syn_data)
3123 * we keep in write queue in case of a retransmit, as we
3124 * also have the SYN packet (with no data) in the same queue.
3125 */
3126 TCP_SKB_CB(syn_data)->seq++;
3127 TCP_SKB_CB(syn_data)->tcp_flags = TCPHDR_ACK | TCPHDR_PSH;
3128 if (!err) {
67da22d2 3129 tp->syn_data = (fo->copied > 0);
f19c29e3 3130 NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPORIGDATASENT);
783237e8
YC
3131 goto done;
3132 }
783237e8
YC
3133
3134fallback:
3135 /* Send a regular SYN with Fast Open cookie request option */
3136 if (fo->cookie.len > 0)
3137 fo->cookie.len = 0;
3138 err = tcp_transmit_skb(sk, syn, 1, sk->sk_allocation);
3139 if (err)
3140 tp->syn_fastopen = 0;
783237e8
YC
3141done:
3142 fo->cookie.len = -1; /* Exclude Fast Open option for SYN retries */
3143 return err;
3144}
3145
67edfef7 3146/* Build a SYN and send it off. */
1da177e4
LT
3147int tcp_connect(struct sock *sk)
3148{
3149 struct tcp_sock *tp = tcp_sk(sk);
3150 struct sk_buff *buff;
ee586811 3151 int err;
1da177e4
LT
3152
3153 tcp_connect_init(sk);
3154
2b916477
AV
3155 if (unlikely(tp->repair)) {
3156 tcp_finish_connect(sk, NULL);
3157 return 0;
3158 }
3159
355a901e
ED
3160 buff = sk_stream_alloc_skb(sk, 0, sk->sk_allocation);
3161 if (unlikely(!buff))
1da177e4
LT
3162 return -ENOBUFS;
3163
a3433f35 3164 tcp_init_nondata_skb(buff, tp->write_seq++, TCPHDR_SYN);
7faee5c0 3165 tp->retrans_stamp = tcp_time_stamp;
783237e8 3166 tcp_connect_queue_skb(sk, buff);
735d3831 3167 tcp_ecn_send_syn(sk, buff);
1da177e4 3168
783237e8
YC
3169 /* Send off SYN; include data in Fast Open. */
3170 err = tp->fastopen_req ? tcp_send_syn_data(sk, buff) :
3171 tcp_transmit_skb(sk, buff, 1, sk->sk_allocation);
ee586811
EP
3172 if (err == -ECONNREFUSED)
3173 return err;
bd37a088
WY
3174
3175 /* We change tp->snd_nxt after the tcp_transmit_skb() call
3176 * in order to make this packet get counted in tcpOutSegs.
3177 */
3178 tp->snd_nxt = tp->write_seq;
3179 tp->pushed_seq = tp->write_seq;
81cc8a75 3180 TCP_INC_STATS(sock_net(sk), TCP_MIB_ACTIVEOPENS);
1da177e4
LT
3181
3182 /* Timer for repeating the SYN until an answer. */
3f421baa
ACM
3183 inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
3184 inet_csk(sk)->icsk_rto, TCP_RTO_MAX);
1da177e4
LT
3185 return 0;
3186}
4bc2f18b 3187EXPORT_SYMBOL(tcp_connect);
1da177e4
LT
3188
3189/* Send out a delayed ack, the caller does the policy checking
3190 * to see if we should even be here. See tcp_input.c:tcp_ack_snd_check()
3191 * for details.
3192 */
3193void tcp_send_delayed_ack(struct sock *sk)
3194{
463c84b9
ACM
3195 struct inet_connection_sock *icsk = inet_csk(sk);
3196 int ato = icsk->icsk_ack.ato;
1da177e4
LT
3197 unsigned long timeout;
3198
9890092e
FW
3199 tcp_ca_event(sk, CA_EVENT_DELAYED_ACK);
3200
1da177e4 3201 if (ato > TCP_DELACK_MIN) {
463c84b9 3202 const struct tcp_sock *tp = tcp_sk(sk);
056834d9 3203 int max_ato = HZ / 2;
1da177e4 3204
056834d9
IJ
3205 if (icsk->icsk_ack.pingpong ||
3206 (icsk->icsk_ack.pending & ICSK_ACK_PUSHED))
1da177e4
LT
3207 max_ato = TCP_DELACK_MAX;
3208
3209 /* Slow path, intersegment interval is "high". */
3210
3211 /* If some rtt estimate is known, use it to bound delayed ack.
463c84b9 3212 * Do not use inet_csk(sk)->icsk_rto here, use results of rtt measurements
1da177e4
LT
3213 * directly.
3214 */
740b0f18
ED
3215 if (tp->srtt_us) {
3216 int rtt = max_t(int, usecs_to_jiffies(tp->srtt_us >> 3),
3217 TCP_DELACK_MIN);
1da177e4
LT
3218
3219 if (rtt < max_ato)
3220 max_ato = rtt;
3221 }
3222
3223 ato = min(ato, max_ato);
3224 }
3225
3226 /* Stay within the limit we were given */
3227 timeout = jiffies + ato;
3228
3229 /* Use new timeout only if there wasn't a older one earlier. */
463c84b9 3230 if (icsk->icsk_ack.pending & ICSK_ACK_TIMER) {
1da177e4
LT
3231 /* If delack timer was blocked or is about to expire,
3232 * send ACK now.
3233 */
463c84b9
ACM
3234 if (icsk->icsk_ack.blocked ||
3235 time_before_eq(icsk->icsk_ack.timeout, jiffies + (ato >> 2))) {
1da177e4
LT
3236 tcp_send_ack(sk);
3237 return;
3238 }
3239
463c84b9
ACM
3240 if (!time_before(timeout, icsk->icsk_ack.timeout))
3241 timeout = icsk->icsk_ack.timeout;
1da177e4 3242 }
463c84b9
ACM
3243 icsk->icsk_ack.pending |= ICSK_ACK_SCHED | ICSK_ACK_TIMER;
3244 icsk->icsk_ack.timeout = timeout;
3245 sk_reset_timer(sk, &icsk->icsk_delack_timer, timeout);
1da177e4
LT
3246}
3247
3248/* This routine sends an ack and also updates the window. */
3249void tcp_send_ack(struct sock *sk)
3250{
058dc334 3251 struct sk_buff *buff;
1da177e4 3252
058dc334
IJ
3253 /* If we have been reset, we may not send again. */
3254 if (sk->sk_state == TCP_CLOSE)
3255 return;
1da177e4 3256
9890092e
FW
3257 tcp_ca_event(sk, CA_EVENT_NON_DELAYED_ACK);
3258
058dc334
IJ
3259 /* We are not putting this on the write queue, so
3260 * tcp_transmit_skb() will set the ownership to this
3261 * sock.
3262 */
99a1dec7 3263 buff = alloc_skb(MAX_TCP_HEADER, sk_gfp_atomic(sk, GFP_ATOMIC));
058dc334
IJ
3264 if (buff == NULL) {
3265 inet_csk_schedule_ack(sk);
3266 inet_csk(sk)->icsk_ack.ato = TCP_ATO_MIN;
3267 inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK,
3268 TCP_DELACK_MAX, TCP_RTO_MAX);
3269 return;
1da177e4 3270 }
058dc334
IJ
3271
3272 /* Reserve space for headers and prepare control bits. */
3273 skb_reserve(buff, MAX_TCP_HEADER);
a3433f35 3274 tcp_init_nondata_skb(buff, tcp_acceptable_seq(sk), TCPHDR_ACK);
058dc334 3275
98781965
ED
3276 /* We do not want pure acks influencing TCP Small Queues or fq/pacing
3277 * too much.
3278 * SKB_TRUESIZE(max(1 .. 66, MAX_TCP_HEADER)) is unfortunately ~784
3279 * We also avoid tcp_wfree() overhead (cache line miss accessing
3280 * tp->tsq_flags) by using regular sock_wfree()
3281 */
3282 skb_set_tcp_pure_ack(buff);
3283
058dc334 3284 /* Send it off, this clears delayed acks for us. */
7faee5c0 3285 skb_mstamp_get(&buff->skb_mstamp);
99a1dec7 3286 tcp_transmit_skb(sk, buff, 0, sk_gfp_atomic(sk, GFP_ATOMIC));
1da177e4 3287}
e3118e83 3288EXPORT_SYMBOL_GPL(tcp_send_ack);
1da177e4
LT
3289
3290/* This routine sends a packet with an out of date sequence
3291 * number. It assumes the other end will try to ack it.
3292 *
3293 * Question: what should we make while urgent mode?
3294 * 4.4BSD forces sending single byte of data. We cannot send
3295 * out of window data, because we have SND.NXT==SND.MAX...
3296 *
3297 * Current solution: to send TWO zero-length segments in urgent mode:
3298 * one is with SEG.SEQ=SND.UNA to deliver urgent pointer, another is
3299 * out-of-date with SND.UNA-1 to probe window.
3300 */
3301static int tcp_xmit_probe_skb(struct sock *sk, int urgent)
3302{
3303 struct tcp_sock *tp = tcp_sk(sk);
3304 struct sk_buff *skb;
3305
3306 /* We don't queue it, tcp_transmit_skb() sets ownership. */
99a1dec7 3307 skb = alloc_skb(MAX_TCP_HEADER, sk_gfp_atomic(sk, GFP_ATOMIC));
e905a9ed 3308 if (skb == NULL)
1da177e4
LT
3309 return -1;
3310
3311 /* Reserve space for headers and set control bits. */
3312 skb_reserve(skb, MAX_TCP_HEADER);
1da177e4
LT
3313 /* Use a previous sequence. This should cause the other
3314 * end to send an ack. Don't queue or clone SKB, just
3315 * send it.
3316 */
a3433f35 3317 tcp_init_nondata_skb(skb, tp->snd_una - !urgent, TCPHDR_ACK);
7faee5c0 3318 skb_mstamp_get(&skb->skb_mstamp);
dfb4b9dc 3319 return tcp_transmit_skb(sk, skb, 0, GFP_ATOMIC);
1da177e4
LT
3320}
3321
ee995283
PE
3322void tcp_send_window_probe(struct sock *sk)
3323{
3324 if (sk->sk_state == TCP_ESTABLISHED) {
3325 tcp_sk(sk)->snd_wl1 = tcp_sk(sk)->rcv_nxt - 1;
3326 tcp_xmit_probe_skb(sk, 0);
3327 }
3328}
3329
67edfef7 3330/* Initiate keepalive or window probe from timer. */
1da177e4
LT
3331int tcp_write_wakeup(struct sock *sk)
3332{
058dc334
IJ
3333 struct tcp_sock *tp = tcp_sk(sk);
3334 struct sk_buff *skb;
1da177e4 3335
058dc334
IJ
3336 if (sk->sk_state == TCP_CLOSE)
3337 return -1;
3338
3339 if ((skb = tcp_send_head(sk)) != NULL &&
3340 before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp))) {
3341 int err;
0c54b85f 3342 unsigned int mss = tcp_current_mss(sk);
058dc334
IJ
3343 unsigned int seg_size = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq;
3344
3345 if (before(tp->pushed_seq, TCP_SKB_CB(skb)->end_seq))
3346 tp->pushed_seq = TCP_SKB_CB(skb)->end_seq;
3347
3348 /* We are probing the opening of a window
3349 * but the window size is != 0
3350 * must have been a result SWS avoidance ( sender )
3351 */
3352 if (seg_size < TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq ||
3353 skb->len > mss) {
3354 seg_size = min(seg_size, mss);
4de075e0 3355 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_PSH;
6cc55e09 3356 if (tcp_fragment(sk, skb, seg_size, mss, GFP_ATOMIC))
058dc334
IJ
3357 return -1;
3358 } else if (!tcp_skb_pcount(skb))
3359 tcp_set_skb_tso_segs(sk, skb, mss);
3360
4de075e0 3361 TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_PSH;
058dc334
IJ
3362 err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
3363 if (!err)
3364 tcp_event_new_data_sent(sk, skb);
3365 return err;
3366 } else {
33f5f57e 3367 if (between(tp->snd_up, tp->snd_una + 1, tp->snd_una + 0xFFFF))
058dc334
IJ
3368 tcp_xmit_probe_skb(sk, 1);
3369 return tcp_xmit_probe_skb(sk, 0);
1da177e4 3370 }
1da177e4
LT
3371}
3372
3373/* A window probe timeout has occurred. If window is not closed send
3374 * a partial packet else a zero probe.
3375 */
3376void tcp_send_probe0(struct sock *sk)
3377{
463c84b9 3378 struct inet_connection_sock *icsk = inet_csk(sk);
1da177e4 3379 struct tcp_sock *tp = tcp_sk(sk);
fcdd1cf4 3380 unsigned long probe_max;
1da177e4
LT
3381 int err;
3382
3383 err = tcp_write_wakeup(sk);
3384
fe067e8a 3385 if (tp->packets_out || !tcp_send_head(sk)) {
1da177e4 3386 /* Cancel probe timer, if it is not required. */
6687e988 3387 icsk->icsk_probes_out = 0;
463c84b9 3388 icsk->icsk_backoff = 0;
1da177e4
LT
3389 return;
3390 }
3391
3392 if (err <= 0) {
463c84b9
ACM
3393 if (icsk->icsk_backoff < sysctl_tcp_retries2)
3394 icsk->icsk_backoff++;
6687e988 3395 icsk->icsk_probes_out++;
fcdd1cf4 3396 probe_max = TCP_RTO_MAX;
1da177e4
LT
3397 } else {
3398 /* If packet was not sent due to local congestion,
6687e988 3399 * do not backoff and do not remember icsk_probes_out.
1da177e4
LT
3400 * Let local senders to fight for local resources.
3401 *
3402 * Use accumulated backoff yet.
3403 */
6687e988
ACM
3404 if (!icsk->icsk_probes_out)
3405 icsk->icsk_probes_out = 1;
fcdd1cf4 3406 probe_max = TCP_RESOURCE_PROBE_INTERVAL;
1da177e4 3407 }
fcdd1cf4
ED
3408 inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
3409 inet_csk_rto_backoff(icsk, probe_max),
3410 TCP_RTO_MAX);
1da177e4 3411}
5db92c99
OP
3412
3413int tcp_rtx_synack(struct sock *sk, struct request_sock *req)
3414{
3415 const struct tcp_request_sock_ops *af_ops = tcp_rsk(req)->af_specific;
3416 struct flowi fl;
3417 int res;
3418
3419 res = af_ops->send_synack(sk, NULL, &fl, req, 0, NULL);
3420 if (!res) {
3421 TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_RETRANSSEGS);
3422 NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPSYNRETRANS);
3423 }
3424 return res;
3425}
3426EXPORT_SYMBOL(tcp_rtx_synack);