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