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