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