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