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