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