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