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