Commit | Line | Data |
---|---|---|
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 | * | |
8 | * Version: $Id: tcp_output.c,v 1.146 2002/02/01 22:01:04 davem Exp $ | |
9 | * | |
02c30a84 | 10 | * Authors: Ross Biro |
1da177e4 LT |
11 | * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG> |
12 | * Mark Evans, <evansmp@uhura.aston.ac.uk> | |
13 | * Corey Minyard <wf-rch!minyard@relay.EU.net> | |
14 | * Florian La Roche, <flla@stud.uni-sb.de> | |
15 | * Charles Hedrick, <hedrick@klinzhai.rutgers.edu> | |
16 | * Linus Torvalds, <torvalds@cs.helsinki.fi> | |
17 | * Alan Cox, <gw4pts@gw4pts.ampr.org> | |
18 | * Matthew Dillon, <dillon@apollo.west.oic.com> | |
19 | * Arnt Gulbrandsen, <agulbra@nvg.unit.no> | |
20 | * Jorge Cwik, <jorge@laser.satlink.net> | |
21 | */ | |
22 | ||
23 | /* | |
24 | * Changes: Pedro Roque : Retransmit queue handled by TCP. | |
25 | * : Fragmentation on mtu decrease | |
26 | * : Segment collapse on retransmit | |
27 | * : AF independence | |
28 | * | |
29 | * Linus Torvalds : send_delayed_ack | |
30 | * David S. Miller : Charge memory using the right skb | |
31 | * during syn/ack processing. | |
32 | * David S. Miller : Output engine completely rewritten. | |
33 | * Andrea Arcangeli: SYNACK carry ts_recent in tsecr. | |
34 | * Cacophonix Gaul : draft-minshall-nagle-01 | |
35 | * J Hadi Salim : ECN support | |
36 | * | |
37 | */ | |
38 | ||
39 | #include <net/tcp.h> | |
40 | ||
41 | #include <linux/compiler.h> | |
42 | #include <linux/module.h> | |
43 | #include <linux/smp_lock.h> | |
44 | ||
45 | /* People can turn this off for buggy TCP's found in printers etc. */ | |
ab32ea5d | 46 | int sysctl_tcp_retrans_collapse __read_mostly = 1; |
1da177e4 | 47 | |
15d99e02 RJ |
48 | /* People can turn this on to work with those rare, broken TCPs that |
49 | * interpret the window field as a signed quantity. | |
50 | */ | |
ab32ea5d | 51 | int sysctl_tcp_workaround_signed_windows __read_mostly = 0; |
15d99e02 | 52 | |
1da177e4 LT |
53 | /* This limits the percentage of the congestion window which we |
54 | * will allow a single TSO frame to consume. Building TSO frames | |
55 | * which are too large can cause TCP streams to be bursty. | |
56 | */ | |
ab32ea5d | 57 | int sysctl_tcp_tso_win_divisor __read_mostly = 3; |
1da177e4 | 58 | |
ab32ea5d BH |
59 | int sysctl_tcp_mtu_probing __read_mostly = 0; |
60 | int sysctl_tcp_base_mss __read_mostly = 512; | |
5d424d5a | 61 | |
35089bb2 | 62 | /* By default, RFC2861 behavior. */ |
ab32ea5d | 63 | int sysctl_tcp_slow_start_after_idle __read_mostly = 1; |
35089bb2 | 64 | |
40efc6fa SH |
65 | static void update_send_head(struct sock *sk, struct tcp_sock *tp, |
66 | struct sk_buff *skb) | |
1da177e4 | 67 | { |
fe067e8a | 68 | tcp_advance_send_head(sk, skb); |
1da177e4 LT |
69 | tp->snd_nxt = TCP_SKB_CB(skb)->end_seq; |
70 | tcp_packets_out_inc(sk, tp, skb); | |
71 | } | |
72 | ||
73 | /* SND.NXT, if window was not shrunk. | |
74 | * If window has been shrunk, what should we make? It is not clear at all. | |
75 | * Using SND.UNA we will fail to open window, SND.NXT is out of window. :-( | |
76 | * Anything in between SND.UNA...SND.UNA+SND.WND also can be already | |
77 | * invalid. OK, let's make this for now: | |
78 | */ | |
79 | static inline __u32 tcp_acceptable_seq(struct sock *sk, struct tcp_sock *tp) | |
80 | { | |
81 | if (!before(tp->snd_una+tp->snd_wnd, tp->snd_nxt)) | |
82 | return tp->snd_nxt; | |
83 | else | |
84 | return tp->snd_una+tp->snd_wnd; | |
85 | } | |
86 | ||
87 | /* Calculate mss to advertise in SYN segment. | |
88 | * RFC1122, RFC1063, draft-ietf-tcpimpl-pmtud-01 state that: | |
89 | * | |
90 | * 1. It is independent of path mtu. | |
91 | * 2. Ideally, it is maximal possible segment size i.e. 65535-40. | |
92 | * 3. For IPv4 it is reasonable to calculate it from maximal MTU of | |
93 | * attached devices, because some buggy hosts are confused by | |
94 | * large MSS. | |
95 | * 4. We do not make 3, we advertise MSS, calculated from first | |
96 | * hop device mtu, but allow to raise it to ip_rt_min_advmss. | |
97 | * This may be overridden via information stored in routing table. | |
98 | * 5. Value 65535 for MSS is valid in IPv6 and means "as large as possible, | |
99 | * probably even Jumbo". | |
100 | */ | |
101 | static __u16 tcp_advertise_mss(struct sock *sk) | |
102 | { | |
103 | struct tcp_sock *tp = tcp_sk(sk); | |
104 | struct dst_entry *dst = __sk_dst_get(sk); | |
105 | int mss = tp->advmss; | |
106 | ||
107 | if (dst && dst_metric(dst, RTAX_ADVMSS) < mss) { | |
108 | mss = dst_metric(dst, RTAX_ADVMSS); | |
109 | tp->advmss = mss; | |
110 | } | |
111 | ||
112 | return (__u16)mss; | |
113 | } | |
114 | ||
115 | /* RFC2861. Reset CWND after idle period longer RTO to "restart window". | |
116 | * This is the first part of cwnd validation mechanism. */ | |
463c84b9 | 117 | static void tcp_cwnd_restart(struct sock *sk, struct dst_entry *dst) |
1da177e4 | 118 | { |
463c84b9 | 119 | struct tcp_sock *tp = tcp_sk(sk); |
1da177e4 LT |
120 | s32 delta = tcp_time_stamp - tp->lsndtime; |
121 | u32 restart_cwnd = tcp_init_cwnd(tp, dst); | |
122 | u32 cwnd = tp->snd_cwnd; | |
123 | ||
6687e988 | 124 | tcp_ca_event(sk, CA_EVENT_CWND_RESTART); |
1da177e4 | 125 | |
6687e988 | 126 | tp->snd_ssthresh = tcp_current_ssthresh(sk); |
1da177e4 LT |
127 | restart_cwnd = min(restart_cwnd, cwnd); |
128 | ||
463c84b9 | 129 | while ((delta -= inet_csk(sk)->icsk_rto) > 0 && cwnd > restart_cwnd) |
1da177e4 LT |
130 | cwnd >>= 1; |
131 | tp->snd_cwnd = max(cwnd, restart_cwnd); | |
132 | tp->snd_cwnd_stamp = tcp_time_stamp; | |
133 | tp->snd_cwnd_used = 0; | |
134 | } | |
135 | ||
40efc6fa SH |
136 | static void tcp_event_data_sent(struct tcp_sock *tp, |
137 | struct sk_buff *skb, struct sock *sk) | |
1da177e4 | 138 | { |
463c84b9 ACM |
139 | struct inet_connection_sock *icsk = inet_csk(sk); |
140 | const u32 now = tcp_time_stamp; | |
1da177e4 | 141 | |
35089bb2 DM |
142 | if (sysctl_tcp_slow_start_after_idle && |
143 | (!tp->packets_out && (s32)(now - tp->lsndtime) > icsk->icsk_rto)) | |
463c84b9 | 144 | tcp_cwnd_restart(sk, __sk_dst_get(sk)); |
1da177e4 LT |
145 | |
146 | tp->lsndtime = now; | |
147 | ||
148 | /* If it is a reply for ato after last received | |
149 | * packet, enter pingpong mode. | |
150 | */ | |
463c84b9 ACM |
151 | if ((u32)(now - icsk->icsk_ack.lrcvtime) < icsk->icsk_ack.ato) |
152 | icsk->icsk_ack.pingpong = 1; | |
1da177e4 LT |
153 | } |
154 | ||
40efc6fa | 155 | static inline void tcp_event_ack_sent(struct sock *sk, unsigned int pkts) |
1da177e4 | 156 | { |
463c84b9 ACM |
157 | tcp_dec_quickack_mode(sk, pkts); |
158 | inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK); | |
1da177e4 LT |
159 | } |
160 | ||
161 | /* Determine a window scaling and initial window to offer. | |
162 | * Based on the assumption that the given amount of space | |
163 | * will be offered. Store the results in the tp structure. | |
164 | * NOTE: for smooth operation initial space offering should | |
165 | * be a multiple of mss if possible. We assume here that mss >= 1. | |
166 | * This MUST be enforced by all callers. | |
167 | */ | |
168 | void tcp_select_initial_window(int __space, __u32 mss, | |
169 | __u32 *rcv_wnd, __u32 *window_clamp, | |
170 | int wscale_ok, __u8 *rcv_wscale) | |
171 | { | |
172 | unsigned int space = (__space < 0 ? 0 : __space); | |
173 | ||
174 | /* If no clamp set the clamp to the max possible scaled window */ | |
175 | if (*window_clamp == 0) | |
176 | (*window_clamp) = (65535 << 14); | |
177 | space = min(*window_clamp, space); | |
178 | ||
179 | /* Quantize space offering to a multiple of mss if possible. */ | |
180 | if (space > mss) | |
181 | space = (space / mss) * mss; | |
182 | ||
183 | /* NOTE: offering an initial window larger than 32767 | |
15d99e02 RJ |
184 | * will break some buggy TCP stacks. If the admin tells us |
185 | * it is likely we could be speaking with such a buggy stack | |
186 | * we will truncate our initial window offering to 32K-1 | |
187 | * unless the remote has sent us a window scaling option, | |
188 | * which we interpret as a sign the remote TCP is not | |
189 | * misinterpreting the window field as a signed quantity. | |
1da177e4 | 190 | */ |
15d99e02 RJ |
191 | if (sysctl_tcp_workaround_signed_windows) |
192 | (*rcv_wnd) = min(space, MAX_TCP_WINDOW); | |
193 | else | |
194 | (*rcv_wnd) = space; | |
195 | ||
1da177e4 LT |
196 | (*rcv_wscale) = 0; |
197 | if (wscale_ok) { | |
198 | /* Set window scaling on max possible window | |
e905a9ed | 199 | * See RFC1323 for an explanation of the limit to 14 |
1da177e4 LT |
200 | */ |
201 | space = max_t(u32, sysctl_tcp_rmem[2], sysctl_rmem_max); | |
316c1592 | 202 | space = min_t(u32, space, *window_clamp); |
1da177e4 LT |
203 | while (space > 65535 && (*rcv_wscale) < 14) { |
204 | space >>= 1; | |
205 | (*rcv_wscale)++; | |
206 | } | |
207 | } | |
208 | ||
209 | /* Set initial window to value enough for senders, | |
6b251858 | 210 | * following RFC2414. Senders, not following this RFC, |
1da177e4 LT |
211 | * will be satisfied with 2. |
212 | */ | |
213 | if (mss > (1<<*rcv_wscale)) { | |
01ff367e DM |
214 | int init_cwnd = 4; |
215 | if (mss > 1460*3) | |
1da177e4 | 216 | init_cwnd = 2; |
01ff367e DM |
217 | else if (mss > 1460) |
218 | init_cwnd = 3; | |
1da177e4 LT |
219 | if (*rcv_wnd > init_cwnd*mss) |
220 | *rcv_wnd = init_cwnd*mss; | |
221 | } | |
222 | ||
223 | /* Set the clamp no higher than max representable value */ | |
224 | (*window_clamp) = min(65535U << (*rcv_wscale), *window_clamp); | |
225 | } | |
226 | ||
227 | /* Chose a new window to advertise, update state in tcp_sock for the | |
228 | * socket, and return result with RFC1323 scaling applied. The return | |
229 | * value can be stuffed directly into th->window for an outgoing | |
230 | * frame. | |
231 | */ | |
40efc6fa | 232 | static u16 tcp_select_window(struct sock *sk) |
1da177e4 LT |
233 | { |
234 | struct tcp_sock *tp = tcp_sk(sk); | |
235 | u32 cur_win = tcp_receive_window(tp); | |
236 | u32 new_win = __tcp_select_window(sk); | |
237 | ||
238 | /* Never shrink the offered window */ | |
239 | if(new_win < cur_win) { | |
240 | /* Danger Will Robinson! | |
241 | * Don't update rcv_wup/rcv_wnd here or else | |
242 | * we will not be able to advertise a zero | |
243 | * window in time. --DaveM | |
244 | * | |
245 | * Relax Will Robinson. | |
246 | */ | |
247 | new_win = cur_win; | |
248 | } | |
249 | tp->rcv_wnd = new_win; | |
250 | tp->rcv_wup = tp->rcv_nxt; | |
251 | ||
252 | /* Make sure we do not exceed the maximum possible | |
253 | * scaled window. | |
254 | */ | |
15d99e02 | 255 | if (!tp->rx_opt.rcv_wscale && sysctl_tcp_workaround_signed_windows) |
1da177e4 LT |
256 | new_win = min(new_win, MAX_TCP_WINDOW); |
257 | else | |
258 | new_win = min(new_win, (65535U << tp->rx_opt.rcv_wscale)); | |
259 | ||
260 | /* RFC1323 scaling applied */ | |
261 | new_win >>= tp->rx_opt.rcv_wscale; | |
262 | ||
263 | /* If we advertise zero window, disable fast path. */ | |
264 | if (new_win == 0) | |
265 | tp->pred_flags = 0; | |
266 | ||
267 | return new_win; | |
268 | } | |
269 | ||
df7a3b07 | 270 | static void tcp_build_and_update_options(__be32 *ptr, struct tcp_sock *tp, |
cfb6eeb4 | 271 | __u32 tstamp, __u8 **md5_hash) |
40efc6fa SH |
272 | { |
273 | if (tp->rx_opt.tstamp_ok) { | |
496c98df YH |
274 | *ptr++ = htonl((TCPOPT_NOP << 24) | |
275 | (TCPOPT_NOP << 16) | | |
276 | (TCPOPT_TIMESTAMP << 8) | | |
277 | TCPOLEN_TIMESTAMP); | |
40efc6fa SH |
278 | *ptr++ = htonl(tstamp); |
279 | *ptr++ = htonl(tp->rx_opt.ts_recent); | |
280 | } | |
281 | if (tp->rx_opt.eff_sacks) { | |
282 | struct tcp_sack_block *sp = tp->rx_opt.dsack ? tp->duplicate_sack : tp->selective_acks; | |
283 | int this_sack; | |
284 | ||
285 | *ptr++ = htonl((TCPOPT_NOP << 24) | | |
286 | (TCPOPT_NOP << 16) | | |
287 | (TCPOPT_SACK << 8) | | |
288 | (TCPOLEN_SACK_BASE + (tp->rx_opt.eff_sacks * | |
289 | TCPOLEN_SACK_PERBLOCK))); | |
290 | for(this_sack = 0; this_sack < tp->rx_opt.eff_sacks; this_sack++) { | |
291 | *ptr++ = htonl(sp[this_sack].start_seq); | |
292 | *ptr++ = htonl(sp[this_sack].end_seq); | |
293 | } | |
294 | if (tp->rx_opt.dsack) { | |
295 | tp->rx_opt.dsack = 0; | |
296 | tp->rx_opt.eff_sacks--; | |
297 | } | |
298 | } | |
cfb6eeb4 YH |
299 | #ifdef CONFIG_TCP_MD5SIG |
300 | if (md5_hash) { | |
301 | *ptr++ = htonl((TCPOPT_NOP << 24) | | |
302 | (TCPOPT_NOP << 16) | | |
303 | (TCPOPT_MD5SIG << 8) | | |
304 | TCPOLEN_MD5SIG); | |
305 | *md5_hash = (__u8 *)ptr; | |
306 | } | |
307 | #endif | |
40efc6fa SH |
308 | } |
309 | ||
310 | /* Construct a tcp options header for a SYN or SYN_ACK packet. | |
311 | * If this is every changed make sure to change the definition of | |
312 | * MAX_SYN_SIZE to match the new maximum number of options that you | |
313 | * can generate. | |
cfb6eeb4 YH |
314 | * |
315 | * Note - that with the RFC2385 TCP option, we make room for the | |
316 | * 16 byte MD5 hash. This will be filled in later, so the pointer for the | |
317 | * location to be filled is passed back up. | |
40efc6fa | 318 | */ |
df7a3b07 | 319 | static void tcp_syn_build_options(__be32 *ptr, int mss, int ts, int sack, |
40efc6fa | 320 | int offer_wscale, int wscale, __u32 tstamp, |
cfb6eeb4 | 321 | __u32 ts_recent, __u8 **md5_hash) |
40efc6fa SH |
322 | { |
323 | /* We always get an MSS option. | |
324 | * The option bytes which will be seen in normal data | |
325 | * packets should timestamps be used, must be in the MSS | |
326 | * advertised. But we subtract them from tp->mss_cache so | |
327 | * that calculations in tcp_sendmsg are simpler etc. | |
328 | * So account for this fact here if necessary. If we | |
329 | * don't do this correctly, as a receiver we won't | |
330 | * recognize data packets as being full sized when we | |
331 | * should, and thus we won't abide by the delayed ACK | |
332 | * rules correctly. | |
333 | * SACKs don't matter, we never delay an ACK when we | |
334 | * have any of those going out. | |
335 | */ | |
336 | *ptr++ = htonl((TCPOPT_MSS << 24) | (TCPOLEN_MSS << 16) | mss); | |
337 | if (ts) { | |
338 | if(sack) | |
496c98df YH |
339 | *ptr++ = htonl((TCPOPT_SACK_PERM << 24) | |
340 | (TCPOLEN_SACK_PERM << 16) | | |
341 | (TCPOPT_TIMESTAMP << 8) | | |
342 | TCPOLEN_TIMESTAMP); | |
40efc6fa | 343 | else |
496c98df YH |
344 | *ptr++ = htonl((TCPOPT_NOP << 24) | |
345 | (TCPOPT_NOP << 16) | | |
346 | (TCPOPT_TIMESTAMP << 8) | | |
347 | TCPOLEN_TIMESTAMP); | |
40efc6fa SH |
348 | *ptr++ = htonl(tstamp); /* TSVAL */ |
349 | *ptr++ = htonl(ts_recent); /* TSECR */ | |
350 | } else if(sack) | |
496c98df YH |
351 | *ptr++ = htonl((TCPOPT_NOP << 24) | |
352 | (TCPOPT_NOP << 16) | | |
353 | (TCPOPT_SACK_PERM << 8) | | |
354 | TCPOLEN_SACK_PERM); | |
40efc6fa | 355 | if (offer_wscale) |
496c98df YH |
356 | *ptr++ = htonl((TCPOPT_NOP << 24) | |
357 | (TCPOPT_WINDOW << 16) | | |
358 | (TCPOLEN_WINDOW << 8) | | |
359 | (wscale)); | |
cfb6eeb4 YH |
360 | #ifdef CONFIG_TCP_MD5SIG |
361 | /* | |
362 | * If MD5 is enabled, then we set the option, and include the size | |
363 | * (always 18). The actual MD5 hash is added just before the | |
364 | * packet is sent. | |
365 | */ | |
366 | if (md5_hash) { | |
367 | *ptr++ = htonl((TCPOPT_NOP << 24) | | |
368 | (TCPOPT_NOP << 16) | | |
369 | (TCPOPT_MD5SIG << 8) | | |
370 | TCPOLEN_MD5SIG); | |
371 | *md5_hash = (__u8 *) ptr; | |
372 | } | |
373 | #endif | |
40efc6fa | 374 | } |
1da177e4 LT |
375 | |
376 | /* This routine actually transmits TCP packets queued in by | |
377 | * tcp_do_sendmsg(). This is used by both the initial | |
378 | * transmission and possible later retransmissions. | |
379 | * All SKB's seen here are completely headerless. It is our | |
380 | * job to build the TCP header, and pass the packet down to | |
381 | * IP so it can do the same plus pass the packet off to the | |
382 | * device. | |
383 | * | |
384 | * We are working here with either a clone of the original | |
385 | * SKB, or a fresh unique copy made by the retransmit engine. | |
386 | */ | |
dfb4b9dc | 387 | static int tcp_transmit_skb(struct sock *sk, struct sk_buff *skb, int clone_it, gfp_t gfp_mask) |
1da177e4 | 388 | { |
dfb4b9dc DM |
389 | const struct inet_connection_sock *icsk = inet_csk(sk); |
390 | struct inet_sock *inet; | |
391 | struct tcp_sock *tp; | |
392 | struct tcp_skb_cb *tcb; | |
393 | int tcp_header_size; | |
cfb6eeb4 YH |
394 | #ifdef CONFIG_TCP_MD5SIG |
395 | struct tcp_md5sig_key *md5; | |
396 | __u8 *md5_hash_location; | |
397 | #endif | |
dfb4b9dc DM |
398 | struct tcphdr *th; |
399 | int sysctl_flags; | |
400 | int err; | |
401 | ||
402 | BUG_ON(!skb || !tcp_skb_pcount(skb)); | |
403 | ||
404 | /* If congestion control is doing timestamping, we must | |
405 | * take such a timestamp before we potentially clone/copy. | |
406 | */ | |
407 | if (icsk->icsk_ca_ops->rtt_sample) | |
408 | __net_timestamp(skb); | |
409 | ||
410 | if (likely(clone_it)) { | |
411 | if (unlikely(skb_cloned(skb))) | |
412 | skb = pskb_copy(skb, gfp_mask); | |
413 | else | |
414 | skb = skb_clone(skb, gfp_mask); | |
415 | if (unlikely(!skb)) | |
416 | return -ENOBUFS; | |
417 | } | |
1da177e4 | 418 | |
dfb4b9dc DM |
419 | inet = inet_sk(sk); |
420 | tp = tcp_sk(sk); | |
421 | tcb = TCP_SKB_CB(skb); | |
422 | tcp_header_size = tp->tcp_header_len; | |
1da177e4 LT |
423 | |
424 | #define SYSCTL_FLAG_TSTAMPS 0x1 | |
425 | #define SYSCTL_FLAG_WSCALE 0x2 | |
426 | #define SYSCTL_FLAG_SACK 0x4 | |
427 | ||
dfb4b9dc DM |
428 | sysctl_flags = 0; |
429 | if (unlikely(tcb->flags & TCPCB_FLAG_SYN)) { | |
430 | tcp_header_size = sizeof(struct tcphdr) + TCPOLEN_MSS; | |
431 | if(sysctl_tcp_timestamps) { | |
432 | tcp_header_size += TCPOLEN_TSTAMP_ALIGNED; | |
433 | sysctl_flags |= SYSCTL_FLAG_TSTAMPS; | |
1da177e4 | 434 | } |
dfb4b9dc DM |
435 | if (sysctl_tcp_window_scaling) { |
436 | tcp_header_size += TCPOLEN_WSCALE_ALIGNED; | |
437 | sysctl_flags |= SYSCTL_FLAG_WSCALE; | |
1da177e4 | 438 | } |
dfb4b9dc DM |
439 | if (sysctl_tcp_sack) { |
440 | sysctl_flags |= SYSCTL_FLAG_SACK; | |
441 | if (!(sysctl_flags & SYSCTL_FLAG_TSTAMPS)) | |
442 | tcp_header_size += TCPOLEN_SACKPERM_ALIGNED; | |
1da177e4 | 443 | } |
dfb4b9dc DM |
444 | } else if (unlikely(tp->rx_opt.eff_sacks)) { |
445 | /* A SACK is 2 pad bytes, a 2 byte header, plus | |
446 | * 2 32-bit sequence numbers for each SACK block. | |
447 | */ | |
448 | tcp_header_size += (TCPOLEN_SACK_BASE_ALIGNED + | |
449 | (tp->rx_opt.eff_sacks * | |
450 | TCPOLEN_SACK_PERBLOCK)); | |
451 | } | |
e905a9ed | 452 | |
dfb4b9dc DM |
453 | if (tcp_packets_in_flight(tp) == 0) |
454 | tcp_ca_event(sk, CA_EVENT_TX_START); | |
455 | ||
cfb6eeb4 YH |
456 | #ifdef CONFIG_TCP_MD5SIG |
457 | /* | |
458 | * Are we doing MD5 on this segment? If so - make | |
459 | * room for it. | |
460 | */ | |
461 | md5 = tp->af_specific->md5_lookup(sk, sk); | |
462 | if (md5) | |
463 | tcp_header_size += TCPOLEN_MD5SIG_ALIGNED; | |
464 | #endif | |
465 | ||
dfb4b9dc DM |
466 | th = (struct tcphdr *) skb_push(skb, tcp_header_size); |
467 | skb->h.th = th; | |
e89862f4 | 468 | skb_set_owner_w(skb, sk); |
dfb4b9dc DM |
469 | |
470 | /* Build TCP header and checksum it. */ | |
471 | th->source = inet->sport; | |
472 | th->dest = inet->dport; | |
473 | th->seq = htonl(tcb->seq); | |
474 | th->ack_seq = htonl(tp->rcv_nxt); | |
df7a3b07 | 475 | *(((__be16 *)th) + 6) = htons(((tcp_header_size >> 2) << 12) | |
dfb4b9dc DM |
476 | tcb->flags); |
477 | ||
478 | if (unlikely(tcb->flags & TCPCB_FLAG_SYN)) { | |
479 | /* RFC1323: The window in SYN & SYN/ACK segments | |
480 | * is never scaled. | |
481 | */ | |
600ff0c2 | 482 | th->window = htons(min(tp->rcv_wnd, 65535U)); |
dfb4b9dc DM |
483 | } else { |
484 | th->window = htons(tcp_select_window(sk)); | |
485 | } | |
486 | th->check = 0; | |
487 | th->urg_ptr = 0; | |
1da177e4 | 488 | |
dfb4b9dc DM |
489 | if (unlikely(tp->urg_mode && |
490 | between(tp->snd_up, tcb->seq+1, tcb->seq+0xFFFF))) { | |
491 | th->urg_ptr = htons(tp->snd_up-tcb->seq); | |
492 | th->urg = 1; | |
493 | } | |
1da177e4 | 494 | |
dfb4b9dc | 495 | if (unlikely(tcb->flags & TCPCB_FLAG_SYN)) { |
df7a3b07 | 496 | tcp_syn_build_options((__be32 *)(th + 1), |
dfb4b9dc DM |
497 | tcp_advertise_mss(sk), |
498 | (sysctl_flags & SYSCTL_FLAG_TSTAMPS), | |
499 | (sysctl_flags & SYSCTL_FLAG_SACK), | |
500 | (sysctl_flags & SYSCTL_FLAG_WSCALE), | |
501 | tp->rx_opt.rcv_wscale, | |
502 | tcb->when, | |
cfb6eeb4 YH |
503 | tp->rx_opt.ts_recent, |
504 | ||
505 | #ifdef CONFIG_TCP_MD5SIG | |
506 | md5 ? &md5_hash_location : | |
507 | #endif | |
508 | NULL); | |
dfb4b9dc | 509 | } else { |
df7a3b07 | 510 | tcp_build_and_update_options((__be32 *)(th + 1), |
cfb6eeb4 YH |
511 | tp, tcb->when, |
512 | #ifdef CONFIG_TCP_MD5SIG | |
513 | md5 ? &md5_hash_location : | |
514 | #endif | |
515 | NULL); | |
dfb4b9dc DM |
516 | TCP_ECN_send(sk, tp, skb, tcp_header_size); |
517 | } | |
1da177e4 | 518 | |
cfb6eeb4 YH |
519 | #ifdef CONFIG_TCP_MD5SIG |
520 | /* Calculate the MD5 hash, as we have all we need now */ | |
521 | if (md5) { | |
522 | tp->af_specific->calc_md5_hash(md5_hash_location, | |
523 | md5, | |
524 | sk, NULL, NULL, | |
525 | skb->h.th, | |
526 | sk->sk_protocol, | |
527 | skb->len); | |
528 | } | |
529 | #endif | |
530 | ||
8292a17a | 531 | icsk->icsk_af_ops->send_check(sk, skb->len, skb); |
1da177e4 | 532 | |
dfb4b9dc DM |
533 | if (likely(tcb->flags & TCPCB_FLAG_ACK)) |
534 | tcp_event_ack_sent(sk, tcp_skb_pcount(skb)); | |
1da177e4 | 535 | |
dfb4b9dc DM |
536 | if (skb->len != tcp_header_size) |
537 | tcp_event_data_sent(tp, skb, sk); | |
1da177e4 | 538 | |
bd37a088 WY |
539 | if (after(tcb->end_seq, tp->snd_nxt) || tcb->seq == tcb->end_seq) |
540 | TCP_INC_STATS(TCP_MIB_OUTSEGS); | |
1da177e4 | 541 | |
e89862f4 | 542 | err = icsk->icsk_af_ops->queue_xmit(skb, 0); |
83de47cd | 543 | if (likely(err <= 0)) |
dfb4b9dc DM |
544 | return err; |
545 | ||
3cfe3baa | 546 | tcp_enter_cwr(sk, 1); |
dfb4b9dc | 547 | |
b9df3cb8 | 548 | return net_xmit_eval(err); |
1da177e4 | 549 | |
1da177e4 LT |
550 | #undef SYSCTL_FLAG_TSTAMPS |
551 | #undef SYSCTL_FLAG_WSCALE | |
552 | #undef SYSCTL_FLAG_SACK | |
553 | } | |
554 | ||
555 | ||
e905a9ed | 556 | /* This routine just queue's the buffer |
1da177e4 LT |
557 | * |
558 | * NOTE: probe0 timer is not checked, do not forget tcp_push_pending_frames, | |
559 | * otherwise socket can stall. | |
560 | */ | |
561 | static void tcp_queue_skb(struct sock *sk, struct sk_buff *skb) | |
562 | { | |
563 | struct tcp_sock *tp = tcp_sk(sk); | |
564 | ||
565 | /* Advance write_seq and place onto the write_queue. */ | |
566 | tp->write_seq = TCP_SKB_CB(skb)->end_seq; | |
567 | skb_header_release(skb); | |
fe067e8a | 568 | tcp_add_write_queue_tail(sk, skb); |
1da177e4 | 569 | sk_charge_skb(sk, skb); |
1da177e4 LT |
570 | } |
571 | ||
846998ae | 572 | static void tcp_set_skb_tso_segs(struct sock *sk, struct sk_buff *skb, unsigned int mss_now) |
f6302d1d | 573 | { |
bcd76111 | 574 | if (skb->len <= mss_now || !sk_can_gso(sk)) { |
f6302d1d DM |
575 | /* Avoid the costly divide in the normal |
576 | * non-TSO case. | |
577 | */ | |
7967168c HX |
578 | skb_shinfo(skb)->gso_segs = 1; |
579 | skb_shinfo(skb)->gso_size = 0; | |
580 | skb_shinfo(skb)->gso_type = 0; | |
f6302d1d DM |
581 | } else { |
582 | unsigned int factor; | |
583 | ||
846998ae DM |
584 | factor = skb->len + (mss_now - 1); |
585 | factor /= mss_now; | |
7967168c HX |
586 | skb_shinfo(skb)->gso_segs = factor; |
587 | skb_shinfo(skb)->gso_size = mss_now; | |
bcd76111 | 588 | skb_shinfo(skb)->gso_type = sk->sk_gso_type; |
1da177e4 LT |
589 | } |
590 | } | |
591 | ||
1da177e4 LT |
592 | /* Function to create two new TCP segments. Shrinks the given segment |
593 | * to the specified size and appends a new segment with the rest of the | |
e905a9ed | 594 | * packet to the list. This won't be called frequently, I hope. |
1da177e4 LT |
595 | * Remember, these are still headerless SKBs at this point. |
596 | */ | |
6475be16 | 597 | int tcp_fragment(struct sock *sk, struct sk_buff *skb, u32 len, unsigned int mss_now) |
1da177e4 LT |
598 | { |
599 | struct tcp_sock *tp = tcp_sk(sk); | |
600 | struct sk_buff *buff; | |
6475be16 | 601 | int nsize, old_factor; |
b60b49ea | 602 | int nlen; |
1da177e4 LT |
603 | u16 flags; |
604 | ||
b2cc99f0 | 605 | BUG_ON(len > skb->len); |
6a438bbe | 606 | |
e905a9ed | 607 | clear_all_retrans_hints(tp); |
1da177e4 LT |
608 | nsize = skb_headlen(skb) - len; |
609 | if (nsize < 0) | |
610 | nsize = 0; | |
611 | ||
612 | if (skb_cloned(skb) && | |
613 | skb_is_nonlinear(skb) && | |
614 | pskb_expand_head(skb, 0, 0, GFP_ATOMIC)) | |
615 | return -ENOMEM; | |
616 | ||
617 | /* Get a new skb... force flag on. */ | |
618 | buff = sk_stream_alloc_skb(sk, nsize, GFP_ATOMIC); | |
619 | if (buff == NULL) | |
620 | return -ENOMEM; /* We'll just try again later. */ | |
ef5cb973 | 621 | |
b60b49ea HX |
622 | sk_charge_skb(sk, buff); |
623 | nlen = skb->len - len - nsize; | |
624 | buff->truesize += nlen; | |
625 | skb->truesize -= nlen; | |
1da177e4 LT |
626 | |
627 | /* Correct the sequence numbers. */ | |
628 | TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len; | |
629 | TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq; | |
630 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq; | |
631 | ||
632 | /* PSH and FIN should only be set in the second packet. */ | |
633 | flags = TCP_SKB_CB(skb)->flags; | |
634 | TCP_SKB_CB(skb)->flags = flags & ~(TCPCB_FLAG_FIN|TCPCB_FLAG_PSH); | |
635 | TCP_SKB_CB(buff)->flags = flags; | |
e14c3caf | 636 | TCP_SKB_CB(buff)->sacked = TCP_SKB_CB(skb)->sacked; |
1da177e4 LT |
637 | TCP_SKB_CB(skb)->sacked &= ~TCPCB_AT_TAIL; |
638 | ||
84fa7933 | 639 | if (!skb_shinfo(skb)->nr_frags && skb->ip_summed != CHECKSUM_PARTIAL) { |
1da177e4 LT |
640 | /* Copy and checksum data tail into the new buffer. */ |
641 | buff->csum = csum_partial_copy_nocheck(skb->data + len, skb_put(buff, nsize), | |
642 | nsize, 0); | |
643 | ||
644 | skb_trim(skb, len); | |
645 | ||
646 | skb->csum = csum_block_sub(skb->csum, buff->csum, len); | |
647 | } else { | |
84fa7933 | 648 | skb->ip_summed = CHECKSUM_PARTIAL; |
1da177e4 LT |
649 | skb_split(skb, buff, len); |
650 | } | |
651 | ||
652 | buff->ip_summed = skb->ip_summed; | |
653 | ||
654 | /* Looks stupid, but our code really uses when of | |
655 | * skbs, which it never sent before. --ANK | |
656 | */ | |
657 | TCP_SKB_CB(buff)->when = TCP_SKB_CB(skb)->when; | |
a61bbcf2 | 658 | buff->tstamp = skb->tstamp; |
1da177e4 | 659 | |
6475be16 DM |
660 | old_factor = tcp_skb_pcount(skb); |
661 | ||
1da177e4 | 662 | /* Fix up tso_factor for both original and new SKB. */ |
846998ae DM |
663 | tcp_set_skb_tso_segs(sk, skb, mss_now); |
664 | tcp_set_skb_tso_segs(sk, buff, mss_now); | |
1da177e4 | 665 | |
6475be16 DM |
666 | /* If this packet has been sent out already, we must |
667 | * adjust the various packet counters. | |
668 | */ | |
cf0b450c | 669 | if (!before(tp->snd_nxt, TCP_SKB_CB(buff)->end_seq)) { |
6475be16 DM |
670 | int diff = old_factor - tcp_skb_pcount(skb) - |
671 | tcp_skb_pcount(buff); | |
1da177e4 | 672 | |
6475be16 | 673 | tp->packets_out -= diff; |
e14c3caf HX |
674 | |
675 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED) | |
676 | tp->sacked_out -= diff; | |
677 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) | |
678 | tp->retrans_out -= diff; | |
679 | ||
6475be16 DM |
680 | if (TCP_SKB_CB(skb)->sacked & TCPCB_LOST) { |
681 | tp->lost_out -= diff; | |
682 | tp->left_out -= diff; | |
683 | } | |
83ca28be | 684 | |
6475be16 | 685 | if (diff > 0) { |
83ca28be HX |
686 | /* Adjust Reno SACK estimate. */ |
687 | if (!tp->rx_opt.sack_ok) { | |
688 | tp->sacked_out -= diff; | |
689 | if ((int)tp->sacked_out < 0) | |
690 | tp->sacked_out = 0; | |
691 | tcp_sync_left_out(tp); | |
692 | } | |
693 | ||
6475be16 DM |
694 | tp->fackets_out -= diff; |
695 | if ((int)tp->fackets_out < 0) | |
696 | tp->fackets_out = 0; | |
697 | } | |
1da177e4 LT |
698 | } |
699 | ||
700 | /* Link BUFF into the send queue. */ | |
f44b5271 | 701 | skb_header_release(buff); |
fe067e8a | 702 | tcp_insert_write_queue_after(skb, buff, sk); |
1da177e4 LT |
703 | |
704 | return 0; | |
705 | } | |
706 | ||
707 | /* This is similar to __pskb_pull_head() (it will go to core/skbuff.c | |
708 | * eventually). The difference is that pulled data not copied, but | |
709 | * immediately discarded. | |
710 | */ | |
f2911969 | 711 | static void __pskb_trim_head(struct sk_buff *skb, int len) |
1da177e4 LT |
712 | { |
713 | int i, k, eat; | |
714 | ||
715 | eat = len; | |
716 | k = 0; | |
717 | for (i=0; i<skb_shinfo(skb)->nr_frags; i++) { | |
718 | if (skb_shinfo(skb)->frags[i].size <= eat) { | |
719 | put_page(skb_shinfo(skb)->frags[i].page); | |
720 | eat -= skb_shinfo(skb)->frags[i].size; | |
721 | } else { | |
722 | skb_shinfo(skb)->frags[k] = skb_shinfo(skb)->frags[i]; | |
723 | if (eat) { | |
724 | skb_shinfo(skb)->frags[k].page_offset += eat; | |
725 | skb_shinfo(skb)->frags[k].size -= eat; | |
726 | eat = 0; | |
727 | } | |
728 | k++; | |
729 | } | |
730 | } | |
731 | skb_shinfo(skb)->nr_frags = k; | |
732 | ||
733 | skb->tail = skb->data; | |
734 | skb->data_len -= len; | |
735 | skb->len = skb->data_len; | |
1da177e4 LT |
736 | } |
737 | ||
738 | int tcp_trim_head(struct sock *sk, struct sk_buff *skb, u32 len) | |
739 | { | |
740 | if (skb_cloned(skb) && | |
741 | pskb_expand_head(skb, 0, 0, GFP_ATOMIC)) | |
742 | return -ENOMEM; | |
743 | ||
f2911969 HXP |
744 | /* If len == headlen, we avoid __skb_pull to preserve alignment. */ |
745 | if (unlikely(len < skb_headlen(skb))) | |
1da177e4 | 746 | __skb_pull(skb, len); |
f2911969 HXP |
747 | else |
748 | __pskb_trim_head(skb, len - skb_headlen(skb)); | |
1da177e4 LT |
749 | |
750 | TCP_SKB_CB(skb)->seq += len; | |
84fa7933 | 751 | skb->ip_summed = CHECKSUM_PARTIAL; |
1da177e4 LT |
752 | |
753 | skb->truesize -= len; | |
754 | sk->sk_wmem_queued -= len; | |
755 | sk->sk_forward_alloc += len; | |
756 | sock_set_flag(sk, SOCK_QUEUE_SHRUNK); | |
757 | ||
758 | /* Any change of skb->len requires recalculation of tso | |
759 | * factor and mss. | |
760 | */ | |
761 | if (tcp_skb_pcount(skb) > 1) | |
846998ae | 762 | tcp_set_skb_tso_segs(sk, skb, tcp_current_mss(sk, 1)); |
1da177e4 LT |
763 | |
764 | return 0; | |
765 | } | |
766 | ||
5d424d5a JH |
767 | /* Not accounting for SACKs here. */ |
768 | int tcp_mtu_to_mss(struct sock *sk, int pmtu) | |
769 | { | |
770 | struct tcp_sock *tp = tcp_sk(sk); | |
771 | struct inet_connection_sock *icsk = inet_csk(sk); | |
772 | int mss_now; | |
773 | ||
774 | /* Calculate base mss without TCP options: | |
775 | It is MMS_S - sizeof(tcphdr) of rfc1122 | |
776 | */ | |
777 | mss_now = pmtu - icsk->icsk_af_ops->net_header_len - sizeof(struct tcphdr); | |
778 | ||
779 | /* Clamp it (mss_clamp does not include tcp options) */ | |
780 | if (mss_now > tp->rx_opt.mss_clamp) | |
781 | mss_now = tp->rx_opt.mss_clamp; | |
782 | ||
783 | /* Now subtract optional transport overhead */ | |
784 | mss_now -= icsk->icsk_ext_hdr_len; | |
785 | ||
786 | /* Then reserve room for full set of TCP options and 8 bytes of data */ | |
787 | if (mss_now < 48) | |
788 | mss_now = 48; | |
789 | ||
790 | /* Now subtract TCP options size, not including SACKs */ | |
791 | mss_now -= tp->tcp_header_len - sizeof(struct tcphdr); | |
792 | ||
793 | return mss_now; | |
794 | } | |
795 | ||
796 | /* Inverse of above */ | |
797 | int tcp_mss_to_mtu(struct sock *sk, int mss) | |
798 | { | |
799 | struct tcp_sock *tp = tcp_sk(sk); | |
800 | struct inet_connection_sock *icsk = inet_csk(sk); | |
801 | int mtu; | |
802 | ||
803 | mtu = mss + | |
804 | tp->tcp_header_len + | |
805 | icsk->icsk_ext_hdr_len + | |
806 | icsk->icsk_af_ops->net_header_len; | |
807 | ||
808 | return mtu; | |
809 | } | |
810 | ||
811 | void tcp_mtup_init(struct sock *sk) | |
812 | { | |
813 | struct tcp_sock *tp = tcp_sk(sk); | |
814 | struct inet_connection_sock *icsk = inet_csk(sk); | |
815 | ||
816 | icsk->icsk_mtup.enabled = sysctl_tcp_mtu_probing > 1; | |
817 | icsk->icsk_mtup.search_high = tp->rx_opt.mss_clamp + sizeof(struct tcphdr) + | |
e905a9ed | 818 | icsk->icsk_af_ops->net_header_len; |
5d424d5a JH |
819 | icsk->icsk_mtup.search_low = tcp_mss_to_mtu(sk, sysctl_tcp_base_mss); |
820 | icsk->icsk_mtup.probe_size = 0; | |
821 | } | |
822 | ||
1da177e4 LT |
823 | /* This function synchronize snd mss to current pmtu/exthdr set. |
824 | ||
825 | tp->rx_opt.user_mss is mss set by user by TCP_MAXSEG. It does NOT counts | |
826 | for TCP options, but includes only bare TCP header. | |
827 | ||
828 | tp->rx_opt.mss_clamp is mss negotiated at connection setup. | |
caa20d9a | 829 | It is minimum of user_mss and mss received with SYN. |
1da177e4 LT |
830 | It also does not include TCP options. |
831 | ||
d83d8461 | 832 | inet_csk(sk)->icsk_pmtu_cookie is last pmtu, seen by this function. |
1da177e4 LT |
833 | |
834 | tp->mss_cache is current effective sending mss, including | |
835 | all tcp options except for SACKs. It is evaluated, | |
836 | taking into account current pmtu, but never exceeds | |
837 | tp->rx_opt.mss_clamp. | |
838 | ||
839 | NOTE1. rfc1122 clearly states that advertised MSS | |
840 | DOES NOT include either tcp or ip options. | |
841 | ||
d83d8461 ACM |
842 | NOTE2. inet_csk(sk)->icsk_pmtu_cookie and tp->mss_cache |
843 | are READ ONLY outside this function. --ANK (980731) | |
1da177e4 LT |
844 | */ |
845 | ||
846 | unsigned int tcp_sync_mss(struct sock *sk, u32 pmtu) | |
847 | { | |
848 | struct tcp_sock *tp = tcp_sk(sk); | |
d83d8461 | 849 | struct inet_connection_sock *icsk = inet_csk(sk); |
5d424d5a | 850 | int mss_now; |
1da177e4 | 851 | |
5d424d5a JH |
852 | if (icsk->icsk_mtup.search_high > pmtu) |
853 | icsk->icsk_mtup.search_high = pmtu; | |
1da177e4 | 854 | |
5d424d5a | 855 | mss_now = tcp_mtu_to_mss(sk, pmtu); |
1da177e4 LT |
856 | |
857 | /* Bound mss with half of window */ | |
858 | if (tp->max_window && mss_now > (tp->max_window>>1)) | |
859 | mss_now = max((tp->max_window>>1), 68U - tp->tcp_header_len); | |
860 | ||
861 | /* And store cached results */ | |
d83d8461 | 862 | icsk->icsk_pmtu_cookie = pmtu; |
5d424d5a JH |
863 | if (icsk->icsk_mtup.enabled) |
864 | mss_now = min(mss_now, tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_low)); | |
c1b4a7e6 | 865 | tp->mss_cache = mss_now; |
1da177e4 LT |
866 | |
867 | return mss_now; | |
868 | } | |
869 | ||
870 | /* Compute the current effective MSS, taking SACKs and IP options, | |
871 | * and even PMTU discovery events into account. | |
872 | * | |
873 | * LARGESEND note: !urg_mode is overkill, only frames up to snd_up | |
874 | * cannot be large. However, taking into account rare use of URG, this | |
875 | * is not a big flaw. | |
876 | */ | |
c1b4a7e6 | 877 | unsigned int tcp_current_mss(struct sock *sk, int large_allowed) |
1da177e4 LT |
878 | { |
879 | struct tcp_sock *tp = tcp_sk(sk); | |
880 | struct dst_entry *dst = __sk_dst_get(sk); | |
c1b4a7e6 DM |
881 | u32 mss_now; |
882 | u16 xmit_size_goal; | |
883 | int doing_tso = 0; | |
884 | ||
885 | mss_now = tp->mss_cache; | |
886 | ||
bcd76111 | 887 | if (large_allowed && sk_can_gso(sk) && !tp->urg_mode) |
c1b4a7e6 | 888 | doing_tso = 1; |
1da177e4 | 889 | |
1da177e4 LT |
890 | if (dst) { |
891 | u32 mtu = dst_mtu(dst); | |
d83d8461 | 892 | if (mtu != inet_csk(sk)->icsk_pmtu_cookie) |
1da177e4 LT |
893 | mss_now = tcp_sync_mss(sk, mtu); |
894 | } | |
895 | ||
c1b4a7e6 DM |
896 | if (tp->rx_opt.eff_sacks) |
897 | mss_now -= (TCPOLEN_SACK_BASE_ALIGNED + | |
898 | (tp->rx_opt.eff_sacks * TCPOLEN_SACK_PERBLOCK)); | |
1da177e4 | 899 | |
cfb6eeb4 YH |
900 | #ifdef CONFIG_TCP_MD5SIG |
901 | if (tp->af_specific->md5_lookup(sk, sk)) | |
902 | mss_now -= TCPOLEN_MD5SIG_ALIGNED; | |
903 | #endif | |
904 | ||
c1b4a7e6 | 905 | xmit_size_goal = mss_now; |
1da177e4 | 906 | |
c1b4a7e6 | 907 | if (doing_tso) { |
8292a17a ACM |
908 | xmit_size_goal = (65535 - |
909 | inet_csk(sk)->icsk_af_ops->net_header_len - | |
d83d8461 ACM |
910 | inet_csk(sk)->icsk_ext_hdr_len - |
911 | tp->tcp_header_len); | |
1da177e4 | 912 | |
c1b4a7e6 DM |
913 | if (tp->max_window && |
914 | (xmit_size_goal > (tp->max_window >> 1))) | |
915 | xmit_size_goal = max((tp->max_window >> 1), | |
916 | 68U - tp->tcp_header_len); | |
1da177e4 | 917 | |
c1b4a7e6 | 918 | xmit_size_goal -= (xmit_size_goal % mss_now); |
1da177e4 | 919 | } |
c1b4a7e6 | 920 | tp->xmit_size_goal = xmit_size_goal; |
1da177e4 | 921 | |
1da177e4 LT |
922 | return mss_now; |
923 | } | |
924 | ||
a762a980 DM |
925 | /* Congestion window validation. (RFC2861) */ |
926 | ||
40efc6fa | 927 | static void tcp_cwnd_validate(struct sock *sk, struct tcp_sock *tp) |
a762a980 DM |
928 | { |
929 | __u32 packets_out = tp->packets_out; | |
930 | ||
931 | if (packets_out >= tp->snd_cwnd) { | |
932 | /* Network is feed fully. */ | |
933 | tp->snd_cwnd_used = 0; | |
934 | tp->snd_cwnd_stamp = tcp_time_stamp; | |
935 | } else { | |
936 | /* Network starves. */ | |
937 | if (tp->packets_out > tp->snd_cwnd_used) | |
938 | tp->snd_cwnd_used = tp->packets_out; | |
939 | ||
15d33c07 DM |
940 | if (sysctl_tcp_slow_start_after_idle && |
941 | (s32)(tcp_time_stamp - tp->snd_cwnd_stamp) >= inet_csk(sk)->icsk_rto) | |
a762a980 DM |
942 | tcp_cwnd_application_limited(sk); |
943 | } | |
944 | } | |
945 | ||
c1b4a7e6 DM |
946 | static unsigned int tcp_window_allows(struct tcp_sock *tp, struct sk_buff *skb, unsigned int mss_now, unsigned int cwnd) |
947 | { | |
948 | u32 window, cwnd_len; | |
949 | ||
950 | window = (tp->snd_una + tp->snd_wnd - TCP_SKB_CB(skb)->seq); | |
951 | cwnd_len = mss_now * cwnd; | |
952 | return min(window, cwnd_len); | |
953 | } | |
954 | ||
955 | /* Can at least one segment of SKB be sent right now, according to the | |
956 | * congestion window rules? If so, return how many segments are allowed. | |
957 | */ | |
958 | static inline unsigned int tcp_cwnd_test(struct tcp_sock *tp, struct sk_buff *skb) | |
959 | { | |
960 | u32 in_flight, cwnd; | |
961 | ||
962 | /* Don't be strict about the congestion window for the final FIN. */ | |
104439a8 JH |
963 | if ((TCP_SKB_CB(skb)->flags & TCPCB_FLAG_FIN) && |
964 | tcp_skb_pcount(skb) == 1) | |
c1b4a7e6 DM |
965 | return 1; |
966 | ||
967 | in_flight = tcp_packets_in_flight(tp); | |
968 | cwnd = tp->snd_cwnd; | |
969 | if (in_flight < cwnd) | |
970 | return (cwnd - in_flight); | |
971 | ||
972 | return 0; | |
973 | } | |
974 | ||
975 | /* This must be invoked the first time we consider transmitting | |
976 | * SKB onto the wire. | |
977 | */ | |
40efc6fa | 978 | static int tcp_init_tso_segs(struct sock *sk, struct sk_buff *skb, unsigned int mss_now) |
c1b4a7e6 DM |
979 | { |
980 | int tso_segs = tcp_skb_pcount(skb); | |
981 | ||
846998ae DM |
982 | if (!tso_segs || |
983 | (tso_segs > 1 && | |
7967168c | 984 | tcp_skb_mss(skb) != mss_now)) { |
846998ae | 985 | tcp_set_skb_tso_segs(sk, skb, mss_now); |
c1b4a7e6 DM |
986 | tso_segs = tcp_skb_pcount(skb); |
987 | } | |
988 | return tso_segs; | |
989 | } | |
990 | ||
991 | static inline int tcp_minshall_check(const struct tcp_sock *tp) | |
992 | { | |
993 | return after(tp->snd_sml,tp->snd_una) && | |
994 | !after(tp->snd_sml, tp->snd_nxt); | |
995 | } | |
996 | ||
997 | /* Return 0, if packet can be sent now without violation Nagle's rules: | |
998 | * 1. It is full sized. | |
999 | * 2. Or it contains FIN. (already checked by caller) | |
1000 | * 3. Or TCP_NODELAY was set. | |
1001 | * 4. Or TCP_CORK is not set, and all sent packets are ACKed. | |
1002 | * With Minshall's modification: all sent small packets are ACKed. | |
1003 | */ | |
1004 | ||
1005 | static inline int tcp_nagle_check(const struct tcp_sock *tp, | |
e905a9ed | 1006 | const struct sk_buff *skb, |
c1b4a7e6 DM |
1007 | unsigned mss_now, int nonagle) |
1008 | { | |
1009 | return (skb->len < mss_now && | |
1010 | ((nonagle&TCP_NAGLE_CORK) || | |
1011 | (!nonagle && | |
1012 | tp->packets_out && | |
1013 | tcp_minshall_check(tp)))); | |
1014 | } | |
1015 | ||
1016 | /* Return non-zero if the Nagle test allows this packet to be | |
1017 | * sent now. | |
1018 | */ | |
1019 | static inline int tcp_nagle_test(struct tcp_sock *tp, struct sk_buff *skb, | |
1020 | unsigned int cur_mss, int nonagle) | |
1021 | { | |
1022 | /* Nagle rule does not apply to frames, which sit in the middle of the | |
1023 | * write_queue (they have no chances to get new data). | |
1024 | * | |
1025 | * This is implemented in the callers, where they modify the 'nonagle' | |
1026 | * argument based upon the location of SKB in the send queue. | |
1027 | */ | |
1028 | if (nonagle & TCP_NAGLE_PUSH) | |
1029 | return 1; | |
1030 | ||
1031 | /* Don't use the nagle rule for urgent data (or for the final FIN). */ | |
1032 | if (tp->urg_mode || | |
1033 | (TCP_SKB_CB(skb)->flags & TCPCB_FLAG_FIN)) | |
1034 | return 1; | |
1035 | ||
1036 | if (!tcp_nagle_check(tp, skb, cur_mss, nonagle)) | |
1037 | return 1; | |
1038 | ||
1039 | return 0; | |
1040 | } | |
1041 | ||
1042 | /* Does at least the first segment of SKB fit into the send window? */ | |
1043 | static inline int tcp_snd_wnd_test(struct tcp_sock *tp, struct sk_buff *skb, unsigned int cur_mss) | |
1044 | { | |
1045 | u32 end_seq = TCP_SKB_CB(skb)->end_seq; | |
1046 | ||
1047 | if (skb->len > cur_mss) | |
1048 | end_seq = TCP_SKB_CB(skb)->seq + cur_mss; | |
1049 | ||
1050 | return !after(end_seq, tp->snd_una + tp->snd_wnd); | |
1051 | } | |
1052 | ||
fe067e8a | 1053 | /* This checks if the data bearing packet SKB (usually tcp_send_head(sk)) |
c1b4a7e6 DM |
1054 | * should be put on the wire right now. If so, it returns the number of |
1055 | * packets allowed by the congestion window. | |
1056 | */ | |
1057 | static unsigned int tcp_snd_test(struct sock *sk, struct sk_buff *skb, | |
1058 | unsigned int cur_mss, int nonagle) | |
1059 | { | |
1060 | struct tcp_sock *tp = tcp_sk(sk); | |
1061 | unsigned int cwnd_quota; | |
1062 | ||
846998ae | 1063 | tcp_init_tso_segs(sk, skb, cur_mss); |
c1b4a7e6 DM |
1064 | |
1065 | if (!tcp_nagle_test(tp, skb, cur_mss, nonagle)) | |
1066 | return 0; | |
1067 | ||
1068 | cwnd_quota = tcp_cwnd_test(tp, skb); | |
1069 | if (cwnd_quota && | |
1070 | !tcp_snd_wnd_test(tp, skb, cur_mss)) | |
1071 | cwnd_quota = 0; | |
1072 | ||
1073 | return cwnd_quota; | |
1074 | } | |
1075 | ||
c1b4a7e6 DM |
1076 | int tcp_may_send_now(struct sock *sk, struct tcp_sock *tp) |
1077 | { | |
fe067e8a | 1078 | struct sk_buff *skb = tcp_send_head(sk); |
c1b4a7e6 DM |
1079 | |
1080 | return (skb && | |
1081 | tcp_snd_test(sk, skb, tcp_current_mss(sk, 1), | |
1082 | (tcp_skb_is_last(sk, skb) ? | |
1083 | TCP_NAGLE_PUSH : | |
1084 | tp->nonagle))); | |
1085 | } | |
1086 | ||
1087 | /* Trim TSO SKB to LEN bytes, put the remaining data into a new packet | |
1088 | * which is put after SKB on the list. It is very much like | |
1089 | * tcp_fragment() except that it may make several kinds of assumptions | |
1090 | * in order to speed up the splitting operation. In particular, we | |
1091 | * know that all the data is in scatter-gather pages, and that the | |
1092 | * packet has never been sent out before (and thus is not cloned). | |
1093 | */ | |
846998ae | 1094 | static int tso_fragment(struct sock *sk, struct sk_buff *skb, unsigned int len, unsigned int mss_now) |
c1b4a7e6 DM |
1095 | { |
1096 | struct sk_buff *buff; | |
1097 | int nlen = skb->len - len; | |
1098 | u16 flags; | |
1099 | ||
1100 | /* All of a TSO frame must be composed of paged data. */ | |
c8ac3774 HX |
1101 | if (skb->len != skb->data_len) |
1102 | return tcp_fragment(sk, skb, len, mss_now); | |
c1b4a7e6 DM |
1103 | |
1104 | buff = sk_stream_alloc_pskb(sk, 0, 0, GFP_ATOMIC); | |
1105 | if (unlikely(buff == NULL)) | |
1106 | return -ENOMEM; | |
1107 | ||
b60b49ea HX |
1108 | sk_charge_skb(sk, buff); |
1109 | buff->truesize += nlen; | |
c1b4a7e6 DM |
1110 | skb->truesize -= nlen; |
1111 | ||
1112 | /* Correct the sequence numbers. */ | |
1113 | TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len; | |
1114 | TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq; | |
1115 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq; | |
1116 | ||
1117 | /* PSH and FIN should only be set in the second packet. */ | |
1118 | flags = TCP_SKB_CB(skb)->flags; | |
1119 | TCP_SKB_CB(skb)->flags = flags & ~(TCPCB_FLAG_FIN|TCPCB_FLAG_PSH); | |
1120 | TCP_SKB_CB(buff)->flags = flags; | |
1121 | ||
1122 | /* This packet was never sent out yet, so no SACK bits. */ | |
1123 | TCP_SKB_CB(buff)->sacked = 0; | |
1124 | ||
84fa7933 | 1125 | buff->ip_summed = skb->ip_summed = CHECKSUM_PARTIAL; |
c1b4a7e6 DM |
1126 | skb_split(skb, buff, len); |
1127 | ||
1128 | /* Fix up tso_factor for both original and new SKB. */ | |
846998ae DM |
1129 | tcp_set_skb_tso_segs(sk, skb, mss_now); |
1130 | tcp_set_skb_tso_segs(sk, buff, mss_now); | |
c1b4a7e6 DM |
1131 | |
1132 | /* Link BUFF into the send queue. */ | |
1133 | skb_header_release(buff); | |
fe067e8a | 1134 | tcp_insert_write_queue_after(skb, buff, sk); |
c1b4a7e6 DM |
1135 | |
1136 | return 0; | |
1137 | } | |
1138 | ||
1139 | /* Try to defer sending, if possible, in order to minimize the amount | |
1140 | * of TSO splitting we do. View it as a kind of TSO Nagle test. | |
1141 | * | |
1142 | * This algorithm is from John Heffner. | |
1143 | */ | |
1144 | static int tcp_tso_should_defer(struct sock *sk, struct tcp_sock *tp, struct sk_buff *skb) | |
1145 | { | |
6687e988 | 1146 | const struct inet_connection_sock *icsk = inet_csk(sk); |
c1b4a7e6 DM |
1147 | u32 send_win, cong_win, limit, in_flight; |
1148 | ||
1149 | if (TCP_SKB_CB(skb)->flags & TCPCB_FLAG_FIN) | |
ae8064ac | 1150 | goto send_now; |
c1b4a7e6 | 1151 | |
6687e988 | 1152 | if (icsk->icsk_ca_state != TCP_CA_Open) |
ae8064ac JH |
1153 | goto send_now; |
1154 | ||
1155 | /* Defer for less than two clock ticks. */ | |
1156 | if (!tp->tso_deferred && ((jiffies<<1)>>1) - (tp->tso_deferred>>1) > 1) | |
1157 | goto send_now; | |
908a75c1 | 1158 | |
c1b4a7e6 DM |
1159 | in_flight = tcp_packets_in_flight(tp); |
1160 | ||
1161 | BUG_ON(tcp_skb_pcount(skb) <= 1 || | |
1162 | (tp->snd_cwnd <= in_flight)); | |
1163 | ||
1164 | send_win = (tp->snd_una + tp->snd_wnd) - TCP_SKB_CB(skb)->seq; | |
1165 | ||
1166 | /* From in_flight test above, we know that cwnd > in_flight. */ | |
1167 | cong_win = (tp->snd_cwnd - in_flight) * tp->mss_cache; | |
1168 | ||
1169 | limit = min(send_win, cong_win); | |
1170 | ||
ba244fe9 DM |
1171 | /* If a full-sized TSO skb can be sent, do it. */ |
1172 | if (limit >= 65536) | |
ae8064ac | 1173 | goto send_now; |
ba244fe9 | 1174 | |
c1b4a7e6 DM |
1175 | if (sysctl_tcp_tso_win_divisor) { |
1176 | u32 chunk = min(tp->snd_wnd, tp->snd_cwnd * tp->mss_cache); | |
1177 | ||
1178 | /* If at least some fraction of a window is available, | |
1179 | * just use it. | |
1180 | */ | |
1181 | chunk /= sysctl_tcp_tso_win_divisor; | |
1182 | if (limit >= chunk) | |
ae8064ac | 1183 | goto send_now; |
c1b4a7e6 DM |
1184 | } else { |
1185 | /* Different approach, try not to defer past a single | |
1186 | * ACK. Receiver should ACK every other full sized | |
1187 | * frame, so if we have space for more than 3 frames | |
1188 | * then send now. | |
1189 | */ | |
1190 | if (limit > tcp_max_burst(tp) * tp->mss_cache) | |
ae8064ac | 1191 | goto send_now; |
c1b4a7e6 DM |
1192 | } |
1193 | ||
1194 | /* Ok, it looks like it is advisable to defer. */ | |
ae8064ac JH |
1195 | tp->tso_deferred = 1 | (jiffies<<1); |
1196 | ||
c1b4a7e6 | 1197 | return 1; |
ae8064ac JH |
1198 | |
1199 | send_now: | |
1200 | tp->tso_deferred = 0; | |
1201 | return 0; | |
c1b4a7e6 DM |
1202 | } |
1203 | ||
5d424d5a JH |
1204 | /* Create a new MTU probe if we are ready. |
1205 | * Returns 0 if we should wait to probe (no cwnd available), | |
1206 | * 1 if a probe was sent, | |
1207 | * -1 otherwise */ | |
1208 | static int tcp_mtu_probe(struct sock *sk) | |
1209 | { | |
1210 | struct tcp_sock *tp = tcp_sk(sk); | |
1211 | struct inet_connection_sock *icsk = inet_csk(sk); | |
1212 | struct sk_buff *skb, *nskb, *next; | |
1213 | int len; | |
1214 | int probe_size; | |
1215 | unsigned int pif; | |
1216 | int copy; | |
1217 | int mss_now; | |
1218 | ||
1219 | /* Not currently probing/verifying, | |
1220 | * not in recovery, | |
1221 | * have enough cwnd, and | |
1222 | * not SACKing (the variable headers throw things off) */ | |
1223 | if (!icsk->icsk_mtup.enabled || | |
1224 | icsk->icsk_mtup.probe_size || | |
1225 | inet_csk(sk)->icsk_ca_state != TCP_CA_Open || | |
1226 | tp->snd_cwnd < 11 || | |
1227 | tp->rx_opt.eff_sacks) | |
1228 | return -1; | |
1229 | ||
1230 | /* Very simple search strategy: just double the MSS. */ | |
1231 | mss_now = tcp_current_mss(sk, 0); | |
1232 | probe_size = 2*tp->mss_cache; | |
1233 | if (probe_size > tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_high)) { | |
1234 | /* TODO: set timer for probe_converge_event */ | |
1235 | return -1; | |
1236 | } | |
1237 | ||
1238 | /* Have enough data in the send queue to probe? */ | |
1239 | len = 0; | |
fe067e8a | 1240 | if ((skb = tcp_send_head(sk)) == NULL) |
5d424d5a JH |
1241 | return -1; |
1242 | while ((len += skb->len) < probe_size && !tcp_skb_is_last(sk, skb)) | |
fe067e8a | 1243 | skb = tcp_write_queue_next(sk, skb); |
5d424d5a JH |
1244 | if (len < probe_size) |
1245 | return -1; | |
1246 | ||
1247 | /* Receive window check. */ | |
1248 | if (after(TCP_SKB_CB(skb)->seq + probe_size, tp->snd_una + tp->snd_wnd)) { | |
1249 | if (tp->snd_wnd < probe_size) | |
1250 | return -1; | |
1251 | else | |
1252 | return 0; | |
1253 | } | |
1254 | ||
1255 | /* Do we need to wait to drain cwnd? */ | |
1256 | pif = tcp_packets_in_flight(tp); | |
1257 | if (pif + 2 > tp->snd_cwnd) { | |
1258 | /* With no packets in flight, don't stall. */ | |
1259 | if (pif == 0) | |
1260 | return -1; | |
1261 | else | |
1262 | return 0; | |
1263 | } | |
1264 | ||
1265 | /* We're allowed to probe. Build it now. */ | |
1266 | if ((nskb = sk_stream_alloc_skb(sk, probe_size, GFP_ATOMIC)) == NULL) | |
1267 | return -1; | |
1268 | sk_charge_skb(sk, nskb); | |
1269 | ||
fe067e8a DM |
1270 | skb = tcp_send_head(sk); |
1271 | tcp_insert_write_queue_before(nskb, skb, sk); | |
1272 | tcp_advance_send_head(sk, skb); | |
5d424d5a JH |
1273 | |
1274 | TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(skb)->seq; | |
1275 | TCP_SKB_CB(nskb)->end_seq = TCP_SKB_CB(skb)->seq + probe_size; | |
1276 | TCP_SKB_CB(nskb)->flags = TCPCB_FLAG_ACK; | |
1277 | TCP_SKB_CB(nskb)->sacked = 0; | |
1278 | nskb->csum = 0; | |
84fa7933 | 1279 | nskb->ip_summed = skb->ip_summed; |
5d424d5a JH |
1280 | |
1281 | len = 0; | |
1282 | while (len < probe_size) { | |
fe067e8a | 1283 | next = tcp_write_queue_next(sk, skb); |
5d424d5a JH |
1284 | |
1285 | copy = min_t(int, skb->len, probe_size - len); | |
1286 | if (nskb->ip_summed) | |
1287 | skb_copy_bits(skb, 0, skb_put(nskb, copy), copy); | |
1288 | else | |
1289 | nskb->csum = skb_copy_and_csum_bits(skb, 0, | |
e905a9ed | 1290 | skb_put(nskb, copy), copy, nskb->csum); |
5d424d5a JH |
1291 | |
1292 | if (skb->len <= copy) { | |
1293 | /* We've eaten all the data from this skb. | |
1294 | * Throw it away. */ | |
1295 | TCP_SKB_CB(nskb)->flags |= TCP_SKB_CB(skb)->flags; | |
fe067e8a | 1296 | tcp_unlink_write_queue(skb, sk); |
5d424d5a JH |
1297 | sk_stream_free_skb(sk, skb); |
1298 | } else { | |
1299 | TCP_SKB_CB(nskb)->flags |= TCP_SKB_CB(skb)->flags & | |
e905a9ed | 1300 | ~(TCPCB_FLAG_FIN|TCPCB_FLAG_PSH); |
5d424d5a JH |
1301 | if (!skb_shinfo(skb)->nr_frags) { |
1302 | skb_pull(skb, copy); | |
84fa7933 | 1303 | if (skb->ip_summed != CHECKSUM_PARTIAL) |
5d424d5a JH |
1304 | skb->csum = csum_partial(skb->data, skb->len, 0); |
1305 | } else { | |
1306 | __pskb_trim_head(skb, copy); | |
1307 | tcp_set_skb_tso_segs(sk, skb, mss_now); | |
1308 | } | |
1309 | TCP_SKB_CB(skb)->seq += copy; | |
1310 | } | |
1311 | ||
1312 | len += copy; | |
1313 | skb = next; | |
1314 | } | |
1315 | tcp_init_tso_segs(sk, nskb, nskb->len); | |
1316 | ||
1317 | /* We're ready to send. If this fails, the probe will | |
1318 | * be resegmented into mss-sized pieces by tcp_write_xmit(). */ | |
1319 | TCP_SKB_CB(nskb)->when = tcp_time_stamp; | |
1320 | if (!tcp_transmit_skb(sk, nskb, 1, GFP_ATOMIC)) { | |
1321 | /* Decrement cwnd here because we are sending | |
1322 | * effectively two packets. */ | |
1323 | tp->snd_cwnd--; | |
1324 | update_send_head(sk, tp, nskb); | |
1325 | ||
1326 | icsk->icsk_mtup.probe_size = tcp_mss_to_mtu(sk, nskb->len); | |
0e7b1368 JH |
1327 | tp->mtu_probe.probe_seq_start = TCP_SKB_CB(nskb)->seq; |
1328 | tp->mtu_probe.probe_seq_end = TCP_SKB_CB(nskb)->end_seq; | |
5d424d5a JH |
1329 | |
1330 | return 1; | |
1331 | } | |
1332 | ||
1333 | return -1; | |
1334 | } | |
1335 | ||
1336 | ||
1da177e4 LT |
1337 | /* This routine writes packets to the network. It advances the |
1338 | * send_head. This happens as incoming acks open up the remote | |
1339 | * window for us. | |
1340 | * | |
1341 | * Returns 1, if no segments are in flight and we have queued segments, but | |
1342 | * cannot send anything now because of SWS or another problem. | |
1343 | */ | |
a2e2a59c | 1344 | static int tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle) |
1da177e4 LT |
1345 | { |
1346 | struct tcp_sock *tp = tcp_sk(sk); | |
92df7b51 | 1347 | struct sk_buff *skb; |
c1b4a7e6 DM |
1348 | unsigned int tso_segs, sent_pkts; |
1349 | int cwnd_quota; | |
5d424d5a | 1350 | int result; |
1da177e4 LT |
1351 | |
1352 | /* If we are closed, the bytes will have to remain here. | |
1353 | * In time closedown will finish, we empty the write queue and all | |
1354 | * will be happy. | |
1355 | */ | |
92df7b51 DM |
1356 | if (unlikely(sk->sk_state == TCP_CLOSE)) |
1357 | return 0; | |
1da177e4 | 1358 | |
92df7b51 | 1359 | sent_pkts = 0; |
5d424d5a JH |
1360 | |
1361 | /* Do MTU probing. */ | |
1362 | if ((result = tcp_mtu_probe(sk)) == 0) { | |
1363 | return 0; | |
1364 | } else if (result > 0) { | |
1365 | sent_pkts = 1; | |
1366 | } | |
1367 | ||
fe067e8a | 1368 | while ((skb = tcp_send_head(sk))) { |
c8ac3774 HX |
1369 | unsigned int limit; |
1370 | ||
b68e9f85 | 1371 | tso_segs = tcp_init_tso_segs(sk, skb, mss_now); |
c1b4a7e6 | 1372 | BUG_ON(!tso_segs); |
aa93466b | 1373 | |
b68e9f85 HX |
1374 | cwnd_quota = tcp_cwnd_test(tp, skb); |
1375 | if (!cwnd_quota) | |
1376 | break; | |
1377 | ||
1378 | if (unlikely(!tcp_snd_wnd_test(tp, skb, mss_now))) | |
1379 | break; | |
1380 | ||
c1b4a7e6 DM |
1381 | if (tso_segs == 1) { |
1382 | if (unlikely(!tcp_nagle_test(tp, skb, mss_now, | |
1383 | (tcp_skb_is_last(sk, skb) ? | |
1384 | nonagle : TCP_NAGLE_PUSH)))) | |
1385 | break; | |
1386 | } else { | |
1387 | if (tcp_tso_should_defer(sk, tp, skb)) | |
1388 | break; | |
1389 | } | |
aa93466b | 1390 | |
c8ac3774 | 1391 | limit = mss_now; |
c1b4a7e6 | 1392 | if (tso_segs > 1) { |
c8ac3774 HX |
1393 | limit = tcp_window_allows(tp, skb, |
1394 | mss_now, cwnd_quota); | |
c1b4a7e6 DM |
1395 | |
1396 | if (skb->len < limit) { | |
1397 | unsigned int trim = skb->len % mss_now; | |
aa93466b | 1398 | |
c1b4a7e6 DM |
1399 | if (trim) |
1400 | limit = skb->len - trim; | |
1401 | } | |
92df7b51 | 1402 | } |
1da177e4 | 1403 | |
c8ac3774 HX |
1404 | if (skb->len > limit && |
1405 | unlikely(tso_fragment(sk, skb, limit, mss_now))) | |
1406 | break; | |
1407 | ||
92df7b51 | 1408 | TCP_SKB_CB(skb)->when = tcp_time_stamp; |
c1b4a7e6 | 1409 | |
dfb4b9dc | 1410 | if (unlikely(tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC))) |
92df7b51 | 1411 | break; |
1da177e4 | 1412 | |
92df7b51 DM |
1413 | /* Advance the send_head. This one is sent out. |
1414 | * This call will increment packets_out. | |
1415 | */ | |
1416 | update_send_head(sk, tp, skb); | |
1da177e4 | 1417 | |
92df7b51 | 1418 | tcp_minshall_update(tp, mss_now, skb); |
aa93466b | 1419 | sent_pkts++; |
92df7b51 | 1420 | } |
1da177e4 | 1421 | |
aa93466b | 1422 | if (likely(sent_pkts)) { |
92df7b51 DM |
1423 | tcp_cwnd_validate(sk, tp); |
1424 | return 0; | |
1da177e4 | 1425 | } |
fe067e8a | 1426 | return !tp->packets_out && tcp_send_head(sk); |
1da177e4 LT |
1427 | } |
1428 | ||
a762a980 DM |
1429 | /* Push out any pending frames which were held back due to |
1430 | * TCP_CORK or attempt at coalescing tiny packets. | |
1431 | * The socket must be locked by the caller. | |
1432 | */ | |
1433 | void __tcp_push_pending_frames(struct sock *sk, struct tcp_sock *tp, | |
a2e2a59c | 1434 | unsigned int cur_mss, int nonagle) |
a762a980 | 1435 | { |
fe067e8a | 1436 | struct sk_buff *skb = tcp_send_head(sk); |
a762a980 DM |
1437 | |
1438 | if (skb) { | |
55c97f3e | 1439 | if (tcp_write_xmit(sk, cur_mss, nonagle)) |
a762a980 DM |
1440 | tcp_check_probe_timer(sk, tp); |
1441 | } | |
1442 | } | |
1443 | ||
c1b4a7e6 DM |
1444 | /* Send _single_ skb sitting at the send head. This function requires |
1445 | * true push pending frames to setup probe timer etc. | |
1446 | */ | |
1447 | void tcp_push_one(struct sock *sk, unsigned int mss_now) | |
1448 | { | |
1449 | struct tcp_sock *tp = tcp_sk(sk); | |
fe067e8a | 1450 | struct sk_buff *skb = tcp_send_head(sk); |
c1b4a7e6 DM |
1451 | unsigned int tso_segs, cwnd_quota; |
1452 | ||
1453 | BUG_ON(!skb || skb->len < mss_now); | |
1454 | ||
846998ae | 1455 | tso_segs = tcp_init_tso_segs(sk, skb, mss_now); |
c1b4a7e6 DM |
1456 | cwnd_quota = tcp_snd_test(sk, skb, mss_now, TCP_NAGLE_PUSH); |
1457 | ||
1458 | if (likely(cwnd_quota)) { | |
c8ac3774 HX |
1459 | unsigned int limit; |
1460 | ||
c1b4a7e6 DM |
1461 | BUG_ON(!tso_segs); |
1462 | ||
c8ac3774 | 1463 | limit = mss_now; |
c1b4a7e6 | 1464 | if (tso_segs > 1) { |
c8ac3774 HX |
1465 | limit = tcp_window_allows(tp, skb, |
1466 | mss_now, cwnd_quota); | |
c1b4a7e6 DM |
1467 | |
1468 | if (skb->len < limit) { | |
1469 | unsigned int trim = skb->len % mss_now; | |
1470 | ||
1471 | if (trim) | |
1472 | limit = skb->len - trim; | |
1473 | } | |
c1b4a7e6 DM |
1474 | } |
1475 | ||
c8ac3774 HX |
1476 | if (skb->len > limit && |
1477 | unlikely(tso_fragment(sk, skb, limit, mss_now))) | |
1478 | return; | |
1479 | ||
c1b4a7e6 DM |
1480 | /* Send it out now. */ |
1481 | TCP_SKB_CB(skb)->when = tcp_time_stamp; | |
1482 | ||
dfb4b9dc | 1483 | if (likely(!tcp_transmit_skb(sk, skb, 1, sk->sk_allocation))) { |
c1b4a7e6 DM |
1484 | update_send_head(sk, tp, skb); |
1485 | tcp_cwnd_validate(sk, tp); | |
1486 | return; | |
1487 | } | |
1488 | } | |
1489 | } | |
1490 | ||
1da177e4 LT |
1491 | /* This function returns the amount that we can raise the |
1492 | * usable window based on the following constraints | |
e905a9ed | 1493 | * |
1da177e4 LT |
1494 | * 1. The window can never be shrunk once it is offered (RFC 793) |
1495 | * 2. We limit memory per socket | |
1496 | * | |
1497 | * RFC 1122: | |
1498 | * "the suggested [SWS] avoidance algorithm for the receiver is to keep | |
1499 | * RECV.NEXT + RCV.WIN fixed until: | |
1500 | * RCV.BUFF - RCV.USER - RCV.WINDOW >= min(1/2 RCV.BUFF, MSS)" | |
1501 | * | |
1502 | * i.e. don't raise the right edge of the window until you can raise | |
1503 | * it at least MSS bytes. | |
1504 | * | |
1505 | * Unfortunately, the recommended algorithm breaks header prediction, | |
1506 | * since header prediction assumes th->window stays fixed. | |
1507 | * | |
1508 | * Strictly speaking, keeping th->window fixed violates the receiver | |
1509 | * side SWS prevention criteria. The problem is that under this rule | |
1510 | * a stream of single byte packets will cause the right side of the | |
1511 | * window to always advance by a single byte. | |
e905a9ed | 1512 | * |
1da177e4 LT |
1513 | * Of course, if the sender implements sender side SWS prevention |
1514 | * then this will not be a problem. | |
e905a9ed | 1515 | * |
1da177e4 | 1516 | * BSD seems to make the following compromise: |
e905a9ed | 1517 | * |
1da177e4 LT |
1518 | * If the free space is less than the 1/4 of the maximum |
1519 | * space available and the free space is less than 1/2 mss, | |
1520 | * then set the window to 0. | |
1521 | * [ Actually, bsd uses MSS and 1/4 of maximal _window_ ] | |
1522 | * Otherwise, just prevent the window from shrinking | |
1523 | * and from being larger than the largest representable value. | |
1524 | * | |
1525 | * This prevents incremental opening of the window in the regime | |
1526 | * where TCP is limited by the speed of the reader side taking | |
1527 | * data out of the TCP receive queue. It does nothing about | |
1528 | * those cases where the window is constrained on the sender side | |
1529 | * because the pipeline is full. | |
1530 | * | |
1531 | * BSD also seems to "accidentally" limit itself to windows that are a | |
1532 | * multiple of MSS, at least until the free space gets quite small. | |
1533 | * This would appear to be a side effect of the mbuf implementation. | |
1534 | * Combining these two algorithms results in the observed behavior | |
1535 | * of having a fixed window size at almost all times. | |
1536 | * | |
1537 | * Below we obtain similar behavior by forcing the offered window to | |
1538 | * a multiple of the mss when it is feasible to do so. | |
1539 | * | |
1540 | * Note, we don't "adjust" for TIMESTAMP or SACK option bytes. | |
1541 | * Regular options like TIMESTAMP are taken into account. | |
1542 | */ | |
1543 | u32 __tcp_select_window(struct sock *sk) | |
1544 | { | |
463c84b9 | 1545 | struct inet_connection_sock *icsk = inet_csk(sk); |
1da177e4 | 1546 | struct tcp_sock *tp = tcp_sk(sk); |
caa20d9a | 1547 | /* MSS for the peer's data. Previous versions used mss_clamp |
1da177e4 LT |
1548 | * here. I don't know if the value based on our guesses |
1549 | * of peer's MSS is better for the performance. It's more correct | |
1550 | * but may be worse for the performance because of rcv_mss | |
1551 | * fluctuations. --SAW 1998/11/1 | |
1552 | */ | |
463c84b9 | 1553 | int mss = icsk->icsk_ack.rcv_mss; |
1da177e4 LT |
1554 | int free_space = tcp_space(sk); |
1555 | int full_space = min_t(int, tp->window_clamp, tcp_full_space(sk)); | |
1556 | int window; | |
1557 | ||
1558 | if (mss > full_space) | |
e905a9ed | 1559 | mss = full_space; |
1da177e4 LT |
1560 | |
1561 | if (free_space < full_space/2) { | |
463c84b9 | 1562 | icsk->icsk_ack.quick = 0; |
1da177e4 LT |
1563 | |
1564 | if (tcp_memory_pressure) | |
1565 | tp->rcv_ssthresh = min(tp->rcv_ssthresh, 4U*tp->advmss); | |
1566 | ||
1567 | if (free_space < mss) | |
1568 | return 0; | |
1569 | } | |
1570 | ||
1571 | if (free_space > tp->rcv_ssthresh) | |
1572 | free_space = tp->rcv_ssthresh; | |
1573 | ||
1574 | /* Don't do rounding if we are using window scaling, since the | |
1575 | * scaled window will not line up with the MSS boundary anyway. | |
1576 | */ | |
1577 | window = tp->rcv_wnd; | |
1578 | if (tp->rx_opt.rcv_wscale) { | |
1579 | window = free_space; | |
1580 | ||
1581 | /* Advertise enough space so that it won't get scaled away. | |
1582 | * Import case: prevent zero window announcement if | |
1583 | * 1<<rcv_wscale > mss. | |
1584 | */ | |
1585 | if (((window >> tp->rx_opt.rcv_wscale) << tp->rx_opt.rcv_wscale) != window) | |
1586 | window = (((window >> tp->rx_opt.rcv_wscale) + 1) | |
1587 | << tp->rx_opt.rcv_wscale); | |
1588 | } else { | |
1589 | /* Get the largest window that is a nice multiple of mss. | |
1590 | * Window clamp already applied above. | |
1591 | * If our current window offering is within 1 mss of the | |
1592 | * free space we just keep it. This prevents the divide | |
1593 | * and multiply from happening most of the time. | |
1594 | * We also don't do any window rounding when the free space | |
1595 | * is too small. | |
1596 | */ | |
1597 | if (window <= free_space - mss || window > free_space) | |
1598 | window = (free_space/mss)*mss; | |
84565070 JH |
1599 | else if (mss == full_space && |
1600 | free_space > window + full_space/2) | |
1601 | window = free_space; | |
1da177e4 LT |
1602 | } |
1603 | ||
1604 | return window; | |
1605 | } | |
1606 | ||
1607 | /* Attempt to collapse two adjacent SKB's during retransmission. */ | |
1608 | static void tcp_retrans_try_collapse(struct sock *sk, struct sk_buff *skb, int mss_now) | |
1609 | { | |
1610 | struct tcp_sock *tp = tcp_sk(sk); | |
fe067e8a | 1611 | struct sk_buff *next_skb = tcp_write_queue_next(sk, skb); |
1da177e4 LT |
1612 | |
1613 | /* The first test we must make is that neither of these two | |
1614 | * SKB's are still referenced by someone else. | |
1615 | */ | |
1616 | if (!skb_cloned(skb) && !skb_cloned(next_skb)) { | |
1617 | int skb_size = skb->len, next_skb_size = next_skb->len; | |
1618 | u16 flags = TCP_SKB_CB(skb)->flags; | |
1619 | ||
1620 | /* Also punt if next skb has been SACK'd. */ | |
1621 | if(TCP_SKB_CB(next_skb)->sacked & TCPCB_SACKED_ACKED) | |
1622 | return; | |
1623 | ||
1624 | /* Next skb is out of window. */ | |
1625 | if (after(TCP_SKB_CB(next_skb)->end_seq, tp->snd_una+tp->snd_wnd)) | |
1626 | return; | |
1627 | ||
1628 | /* Punt if not enough space exists in the first SKB for | |
1629 | * the data in the second, or the total combined payload | |
1630 | * would exceed the MSS. | |
1631 | */ | |
1632 | if ((next_skb_size > skb_tailroom(skb)) || | |
1633 | ((skb_size + next_skb_size) > mss_now)) | |
1634 | return; | |
1635 | ||
1636 | BUG_ON(tcp_skb_pcount(skb) != 1 || | |
1637 | tcp_skb_pcount(next_skb) != 1); | |
1638 | ||
6a438bbe SH |
1639 | /* changing transmit queue under us so clear hints */ |
1640 | clear_all_retrans_hints(tp); | |
1641 | ||
1642 | /* Ok. We will be able to collapse the packet. */ | |
fe067e8a | 1643 | tcp_unlink_write_queue(next_skb, sk); |
1da177e4 LT |
1644 | |
1645 | memcpy(skb_put(skb, next_skb_size), next_skb->data, next_skb_size); | |
1646 | ||
52d570aa JP |
1647 | if (next_skb->ip_summed == CHECKSUM_PARTIAL) |
1648 | skb->ip_summed = CHECKSUM_PARTIAL; | |
1da177e4 | 1649 | |
84fa7933 | 1650 | if (skb->ip_summed != CHECKSUM_PARTIAL) |
1da177e4 LT |
1651 | skb->csum = csum_block_add(skb->csum, next_skb->csum, skb_size); |
1652 | ||
1653 | /* Update sequence range on original skb. */ | |
1654 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(next_skb)->end_seq; | |
1655 | ||
1656 | /* Merge over control information. */ | |
1657 | flags |= TCP_SKB_CB(next_skb)->flags; /* This moves PSH/FIN etc. over */ | |
1658 | TCP_SKB_CB(skb)->flags = flags; | |
1659 | ||
1660 | /* All done, get rid of second SKB and account for it so | |
1661 | * packet counting does not break. | |
1662 | */ | |
1663 | TCP_SKB_CB(skb)->sacked |= TCP_SKB_CB(next_skb)->sacked&(TCPCB_EVER_RETRANS|TCPCB_AT_TAIL); | |
1664 | if (TCP_SKB_CB(next_skb)->sacked&TCPCB_SACKED_RETRANS) | |
1665 | tp->retrans_out -= tcp_skb_pcount(next_skb); | |
1666 | if (TCP_SKB_CB(next_skb)->sacked&TCPCB_LOST) { | |
1667 | tp->lost_out -= tcp_skb_pcount(next_skb); | |
1668 | tp->left_out -= tcp_skb_pcount(next_skb); | |
1669 | } | |
1670 | /* Reno case is special. Sigh... */ | |
1671 | if (!tp->rx_opt.sack_ok && tp->sacked_out) { | |
1672 | tcp_dec_pcount_approx(&tp->sacked_out, next_skb); | |
1673 | tp->left_out -= tcp_skb_pcount(next_skb); | |
1674 | } | |
1675 | ||
1676 | /* Not quite right: it can be > snd.fack, but | |
1677 | * it is better to underestimate fackets. | |
1678 | */ | |
1679 | tcp_dec_pcount_approx(&tp->fackets_out, next_skb); | |
1680 | tcp_packets_out_dec(tp, next_skb); | |
1681 | sk_stream_free_skb(sk, next_skb); | |
1682 | } | |
1683 | } | |
1684 | ||
1685 | /* Do a simple retransmit without using the backoff mechanisms in | |
e905a9ed | 1686 | * tcp_timer. This is used for path mtu discovery. |
1da177e4 | 1687 | * The socket is already locked here. |
e905a9ed | 1688 | */ |
1da177e4 LT |
1689 | void tcp_simple_retransmit(struct sock *sk) |
1690 | { | |
6687e988 | 1691 | const struct inet_connection_sock *icsk = inet_csk(sk); |
1da177e4 LT |
1692 | struct tcp_sock *tp = tcp_sk(sk); |
1693 | struct sk_buff *skb; | |
1694 | unsigned int mss = tcp_current_mss(sk, 0); | |
1695 | int lost = 0; | |
1696 | ||
fe067e8a DM |
1697 | tcp_for_write_queue(skb, sk) { |
1698 | if (skb == tcp_send_head(sk)) | |
1699 | break; | |
e905a9ed | 1700 | if (skb->len > mss && |
1da177e4 LT |
1701 | !(TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_ACKED)) { |
1702 | if (TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_RETRANS) { | |
1703 | TCP_SKB_CB(skb)->sacked &= ~TCPCB_SACKED_RETRANS; | |
1704 | tp->retrans_out -= tcp_skb_pcount(skb); | |
1705 | } | |
1706 | if (!(TCP_SKB_CB(skb)->sacked&TCPCB_LOST)) { | |
1707 | TCP_SKB_CB(skb)->sacked |= TCPCB_LOST; | |
1708 | tp->lost_out += tcp_skb_pcount(skb); | |
1709 | lost = 1; | |
1710 | } | |
1711 | } | |
1712 | } | |
1713 | ||
6a438bbe SH |
1714 | clear_all_retrans_hints(tp); |
1715 | ||
1da177e4 LT |
1716 | if (!lost) |
1717 | return; | |
1718 | ||
1719 | tcp_sync_left_out(tp); | |
1720 | ||
e905a9ed | 1721 | /* Don't muck with the congestion window here. |
1da177e4 LT |
1722 | * Reason is that we do not increase amount of _data_ |
1723 | * in network, but units changed and effective | |
1724 | * cwnd/ssthresh really reduced now. | |
1725 | */ | |
6687e988 | 1726 | if (icsk->icsk_ca_state != TCP_CA_Loss) { |
1da177e4 | 1727 | tp->high_seq = tp->snd_nxt; |
6687e988 | 1728 | tp->snd_ssthresh = tcp_current_ssthresh(sk); |
1da177e4 LT |
1729 | tp->prior_ssthresh = 0; |
1730 | tp->undo_marker = 0; | |
6687e988 | 1731 | tcp_set_ca_state(sk, TCP_CA_Loss); |
1da177e4 LT |
1732 | } |
1733 | tcp_xmit_retransmit_queue(sk); | |
1734 | } | |
1735 | ||
1736 | /* This retransmits one SKB. Policy decisions and retransmit queue | |
1737 | * state updates are done by the caller. Returns non-zero if an | |
1738 | * error occurred which prevented the send. | |
1739 | */ | |
1740 | int tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb) | |
1741 | { | |
1742 | struct tcp_sock *tp = tcp_sk(sk); | |
5d424d5a | 1743 | struct inet_connection_sock *icsk = inet_csk(sk); |
e905a9ed | 1744 | unsigned int cur_mss = tcp_current_mss(sk, 0); |
1da177e4 LT |
1745 | int err; |
1746 | ||
5d424d5a JH |
1747 | /* Inconslusive MTU probe */ |
1748 | if (icsk->icsk_mtup.probe_size) { | |
1749 | icsk->icsk_mtup.probe_size = 0; | |
1750 | } | |
1751 | ||
1da177e4 | 1752 | /* Do not sent more than we queued. 1/4 is reserved for possible |
caa20d9a | 1753 | * copying overhead: fragmentation, tunneling, mangling etc. |
1da177e4 LT |
1754 | */ |
1755 | if (atomic_read(&sk->sk_wmem_alloc) > | |
1756 | min(sk->sk_wmem_queued + (sk->sk_wmem_queued >> 2), sk->sk_sndbuf)) | |
1757 | return -EAGAIN; | |
1758 | ||
1759 | if (before(TCP_SKB_CB(skb)->seq, tp->snd_una)) { | |
1760 | if (before(TCP_SKB_CB(skb)->end_seq, tp->snd_una)) | |
1761 | BUG(); | |
1da177e4 LT |
1762 | if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq)) |
1763 | return -ENOMEM; | |
1764 | } | |
1765 | ||
1766 | /* If receiver has shrunk his window, and skb is out of | |
1767 | * new window, do not retransmit it. The exception is the | |
1768 | * case, when window is shrunk to zero. In this case | |
1769 | * our retransmit serves as a zero window probe. | |
1770 | */ | |
1771 | if (!before(TCP_SKB_CB(skb)->seq, tp->snd_una+tp->snd_wnd) | |
1772 | && TCP_SKB_CB(skb)->seq != tp->snd_una) | |
1773 | return -EAGAIN; | |
1774 | ||
1775 | if (skb->len > cur_mss) { | |
846998ae | 1776 | if (tcp_fragment(sk, skb, cur_mss, cur_mss)) |
1da177e4 | 1777 | return -ENOMEM; /* We'll try again later. */ |
1da177e4 LT |
1778 | } |
1779 | ||
1780 | /* Collapse two adjacent packets if worthwhile and we can. */ | |
1781 | if(!(TCP_SKB_CB(skb)->flags & TCPCB_FLAG_SYN) && | |
1782 | (skb->len < (cur_mss >> 1)) && | |
fe067e8a DM |
1783 | (tcp_write_queue_next(sk, skb) != tcp_send_head(sk)) && |
1784 | (!tcp_skb_is_last(sk, skb)) && | |
1785 | (skb_shinfo(skb)->nr_frags == 0 && skb_shinfo(tcp_write_queue_next(sk, skb))->nr_frags == 0) && | |
1786 | (tcp_skb_pcount(skb) == 1 && tcp_skb_pcount(tcp_write_queue_next(sk, skb)) == 1) && | |
1da177e4 LT |
1787 | (sysctl_tcp_retrans_collapse != 0)) |
1788 | tcp_retrans_try_collapse(sk, skb, cur_mss); | |
1789 | ||
8292a17a | 1790 | if (inet_csk(sk)->icsk_af_ops->rebuild_header(sk)) |
1da177e4 LT |
1791 | return -EHOSTUNREACH; /* Routing failure or similar. */ |
1792 | ||
1793 | /* Some Solaris stacks overoptimize and ignore the FIN on a | |
1794 | * retransmit when old data is attached. So strip it off | |
1795 | * since it is cheap to do so and saves bytes on the network. | |
1796 | */ | |
1797 | if(skb->len > 0 && | |
1798 | (TCP_SKB_CB(skb)->flags & TCPCB_FLAG_FIN) && | |
1799 | tp->snd_una == (TCP_SKB_CB(skb)->end_seq - 1)) { | |
1800 | if (!pskb_trim(skb, 0)) { | |
1801 | TCP_SKB_CB(skb)->seq = TCP_SKB_CB(skb)->end_seq - 1; | |
7967168c HX |
1802 | skb_shinfo(skb)->gso_segs = 1; |
1803 | skb_shinfo(skb)->gso_size = 0; | |
1804 | skb_shinfo(skb)->gso_type = 0; | |
1da177e4 LT |
1805 | skb->ip_summed = CHECKSUM_NONE; |
1806 | skb->csum = 0; | |
1807 | } | |
1808 | } | |
1809 | ||
1810 | /* Make a copy, if the first transmission SKB clone we made | |
1811 | * is still in somebody's hands, else make a clone. | |
1812 | */ | |
1813 | TCP_SKB_CB(skb)->when = tcp_time_stamp; | |
1da177e4 | 1814 | |
dfb4b9dc | 1815 | err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC); |
1da177e4 LT |
1816 | |
1817 | if (err == 0) { | |
1818 | /* Update global TCP statistics. */ | |
1819 | TCP_INC_STATS(TCP_MIB_RETRANSSEGS); | |
1820 | ||
1821 | tp->total_retrans++; | |
1822 | ||
1823 | #if FASTRETRANS_DEBUG > 0 | |
1824 | if (TCP_SKB_CB(skb)->sacked&TCPCB_SACKED_RETRANS) { | |
1825 | if (net_ratelimit()) | |
1826 | printk(KERN_DEBUG "retrans_out leaked.\n"); | |
1827 | } | |
1828 | #endif | |
1829 | TCP_SKB_CB(skb)->sacked |= TCPCB_RETRANS; | |
1830 | tp->retrans_out += tcp_skb_pcount(skb); | |
1831 | ||
1832 | /* Save stamp of the first retransmit. */ | |
1833 | if (!tp->retrans_stamp) | |
1834 | tp->retrans_stamp = TCP_SKB_CB(skb)->when; | |
1835 | ||
1836 | tp->undo_retrans++; | |
1837 | ||
1838 | /* snd_nxt is stored to detect loss of retransmitted segment, | |
1839 | * see tcp_input.c tcp_sacktag_write_queue(). | |
1840 | */ | |
1841 | TCP_SKB_CB(skb)->ack_seq = tp->snd_nxt; | |
1842 | } | |
1843 | return err; | |
1844 | } | |
1845 | ||
1846 | /* This gets called after a retransmit timeout, and the initially | |
1847 | * retransmitted data is acknowledged. It tries to continue | |
1848 | * resending the rest of the retransmit queue, until either | |
1849 | * we've sent it all or the congestion window limit is reached. | |
1850 | * If doing SACK, the first ACK which comes back for a timeout | |
1851 | * based retransmit packet might feed us FACK information again. | |
1852 | * If so, we use it to avoid unnecessarily retransmissions. | |
1853 | */ | |
1854 | void tcp_xmit_retransmit_queue(struct sock *sk) | |
1855 | { | |
6687e988 | 1856 | const struct inet_connection_sock *icsk = inet_csk(sk); |
1da177e4 LT |
1857 | struct tcp_sock *tp = tcp_sk(sk); |
1858 | struct sk_buff *skb; | |
6a438bbe SH |
1859 | int packet_cnt; |
1860 | ||
1861 | if (tp->retransmit_skb_hint) { | |
1862 | skb = tp->retransmit_skb_hint; | |
1863 | packet_cnt = tp->retransmit_cnt_hint; | |
1864 | }else{ | |
fe067e8a | 1865 | skb = tcp_write_queue_head(sk); |
6a438bbe SH |
1866 | packet_cnt = 0; |
1867 | } | |
1da177e4 LT |
1868 | |
1869 | /* First pass: retransmit lost packets. */ | |
6a438bbe | 1870 | if (tp->lost_out) { |
fe067e8a | 1871 | tcp_for_write_queue_from(skb, sk) { |
1da177e4 LT |
1872 | __u8 sacked = TCP_SKB_CB(skb)->sacked; |
1873 | ||
fe067e8a DM |
1874 | if (skb == tcp_send_head(sk)) |
1875 | break; | |
6a438bbe SH |
1876 | /* we could do better than to assign each time */ |
1877 | tp->retransmit_skb_hint = skb; | |
1878 | tp->retransmit_cnt_hint = packet_cnt; | |
1879 | ||
1da177e4 LT |
1880 | /* Assume this retransmit will generate |
1881 | * only one packet for congestion window | |
1882 | * calculation purposes. This works because | |
1883 | * tcp_retransmit_skb() will chop up the | |
1884 | * packet to be MSS sized and all the | |
1885 | * packet counting works out. | |
1886 | */ | |
1887 | if (tcp_packets_in_flight(tp) >= tp->snd_cwnd) | |
1888 | return; | |
1889 | ||
6a438bbe | 1890 | if (sacked & TCPCB_LOST) { |
1da177e4 | 1891 | if (!(sacked&(TCPCB_SACKED_ACKED|TCPCB_SACKED_RETRANS))) { |
6a438bbe SH |
1892 | if (tcp_retransmit_skb(sk, skb)) { |
1893 | tp->retransmit_skb_hint = NULL; | |
1da177e4 | 1894 | return; |
6a438bbe | 1895 | } |
6687e988 | 1896 | if (icsk->icsk_ca_state != TCP_CA_Loss) |
1da177e4 LT |
1897 | NET_INC_STATS_BH(LINUX_MIB_TCPFASTRETRANS); |
1898 | else | |
1899 | NET_INC_STATS_BH(LINUX_MIB_TCPSLOWSTARTRETRANS); | |
1900 | ||
fe067e8a | 1901 | if (skb == tcp_write_queue_head(sk)) |
463c84b9 | 1902 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, |
3f421baa ACM |
1903 | inet_csk(sk)->icsk_rto, |
1904 | TCP_RTO_MAX); | |
1da177e4 LT |
1905 | } |
1906 | ||
6a438bbe SH |
1907 | packet_cnt += tcp_skb_pcount(skb); |
1908 | if (packet_cnt >= tp->lost_out) | |
1da177e4 LT |
1909 | break; |
1910 | } | |
1911 | } | |
1912 | } | |
1913 | ||
1914 | /* OK, demanded retransmission is finished. */ | |
1915 | ||
1916 | /* Forward retransmissions are possible only during Recovery. */ | |
6687e988 | 1917 | if (icsk->icsk_ca_state != TCP_CA_Recovery) |
1da177e4 LT |
1918 | return; |
1919 | ||
1920 | /* No forward retransmissions in Reno are possible. */ | |
1921 | if (!tp->rx_opt.sack_ok) | |
1922 | return; | |
1923 | ||
1924 | /* Yeah, we have to make difficult choice between forward transmission | |
1925 | * and retransmission... Both ways have their merits... | |
1926 | * | |
1927 | * For now we do not retransmit anything, while we have some new | |
1928 | * segments to send. | |
1929 | */ | |
1930 | ||
1931 | if (tcp_may_send_now(sk, tp)) | |
1932 | return; | |
1933 | ||
6a438bbe SH |
1934 | if (tp->forward_skb_hint) { |
1935 | skb = tp->forward_skb_hint; | |
1936 | packet_cnt = tp->forward_cnt_hint; | |
1937 | } else{ | |
fe067e8a | 1938 | skb = tcp_write_queue_head(sk); |
6a438bbe SH |
1939 | packet_cnt = 0; |
1940 | } | |
1941 | ||
fe067e8a DM |
1942 | tcp_for_write_queue_from(skb, sk) { |
1943 | if (skb == tcp_send_head(sk)) | |
1944 | break; | |
6a438bbe SH |
1945 | tp->forward_cnt_hint = packet_cnt; |
1946 | tp->forward_skb_hint = skb; | |
1da177e4 | 1947 | |
1da177e4 LT |
1948 | /* Similar to the retransmit loop above we |
1949 | * can pretend that the retransmitted SKB | |
1950 | * we send out here will be composed of one | |
1951 | * real MSS sized packet because tcp_retransmit_skb() | |
1952 | * will fragment it if necessary. | |
1953 | */ | |
1954 | if (++packet_cnt > tp->fackets_out) | |
1955 | break; | |
1956 | ||
1957 | if (tcp_packets_in_flight(tp) >= tp->snd_cwnd) | |
1958 | break; | |
1959 | ||
1960 | if (TCP_SKB_CB(skb)->sacked & TCPCB_TAGBITS) | |
1961 | continue; | |
1962 | ||
1963 | /* Ok, retransmit it. */ | |
6a438bbe SH |
1964 | if (tcp_retransmit_skb(sk, skb)) { |
1965 | tp->forward_skb_hint = NULL; | |
1da177e4 | 1966 | break; |
6a438bbe | 1967 | } |
1da177e4 | 1968 | |
fe067e8a | 1969 | if (skb == tcp_write_queue_head(sk)) |
3f421baa ACM |
1970 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, |
1971 | inet_csk(sk)->icsk_rto, | |
1972 | TCP_RTO_MAX); | |
1da177e4 LT |
1973 | |
1974 | NET_INC_STATS_BH(LINUX_MIB_TCPFORWARDRETRANS); | |
1975 | } | |
1976 | } | |
1977 | ||
1978 | ||
1979 | /* Send a fin. The caller locks the socket for us. This cannot be | |
1980 | * allowed to fail queueing a FIN frame under any circumstances. | |
1981 | */ | |
1982 | void tcp_send_fin(struct sock *sk) | |
1983 | { | |
e905a9ed | 1984 | struct tcp_sock *tp = tcp_sk(sk); |
fe067e8a | 1985 | struct sk_buff *skb = tcp_write_queue_tail(sk); |
1da177e4 | 1986 | int mss_now; |
e905a9ed | 1987 | |
1da177e4 LT |
1988 | /* Optimization, tack on the FIN if we have a queue of |
1989 | * unsent frames. But be careful about outgoing SACKS | |
1990 | * and IP options. | |
1991 | */ | |
1992 | mss_now = tcp_current_mss(sk, 1); | |
1993 | ||
fe067e8a | 1994 | if (tcp_send_head(sk) != NULL) { |
1da177e4 LT |
1995 | TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_FIN; |
1996 | TCP_SKB_CB(skb)->end_seq++; | |
1997 | tp->write_seq++; | |
1998 | } else { | |
1999 | /* Socket is locked, keep trying until memory is available. */ | |
2000 | for (;;) { | |
d179cd12 | 2001 | skb = alloc_skb_fclone(MAX_TCP_HEADER, GFP_KERNEL); |
1da177e4 LT |
2002 | if (skb) |
2003 | break; | |
2004 | yield(); | |
2005 | } | |
2006 | ||
2007 | /* Reserve space for headers and prepare control bits. */ | |
2008 | skb_reserve(skb, MAX_TCP_HEADER); | |
2009 | skb->csum = 0; | |
2010 | TCP_SKB_CB(skb)->flags = (TCPCB_FLAG_ACK | TCPCB_FLAG_FIN); | |
2011 | TCP_SKB_CB(skb)->sacked = 0; | |
7967168c HX |
2012 | skb_shinfo(skb)->gso_segs = 1; |
2013 | skb_shinfo(skb)->gso_size = 0; | |
2014 | skb_shinfo(skb)->gso_type = 0; | |
1da177e4 LT |
2015 | |
2016 | /* FIN eats a sequence byte, write_seq advanced by tcp_queue_skb(). */ | |
2017 | TCP_SKB_CB(skb)->seq = tp->write_seq; | |
2018 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq + 1; | |
2019 | tcp_queue_skb(sk, skb); | |
2020 | } | |
2021 | __tcp_push_pending_frames(sk, tp, mss_now, TCP_NAGLE_OFF); | |
2022 | } | |
2023 | ||
2024 | /* We get here when a process closes a file descriptor (either due to | |
2025 | * an explicit close() or as a byproduct of exit()'ing) and there | |
2026 | * was unread data in the receive queue. This behavior is recommended | |
2027 | * by draft-ietf-tcpimpl-prob-03.txt section 3.10. -DaveM | |
2028 | */ | |
dd0fc66f | 2029 | void tcp_send_active_reset(struct sock *sk, gfp_t priority) |
1da177e4 LT |
2030 | { |
2031 | struct tcp_sock *tp = tcp_sk(sk); | |
2032 | struct sk_buff *skb; | |
2033 | ||
2034 | /* NOTE: No TCP options attached and we never retransmit this. */ | |
2035 | skb = alloc_skb(MAX_TCP_HEADER, priority); | |
2036 | if (!skb) { | |
2037 | NET_INC_STATS(LINUX_MIB_TCPABORTFAILED); | |
2038 | return; | |
2039 | } | |
2040 | ||
2041 | /* Reserve space for headers and prepare control bits. */ | |
2042 | skb_reserve(skb, MAX_TCP_HEADER); | |
2043 | skb->csum = 0; | |
2044 | TCP_SKB_CB(skb)->flags = (TCPCB_FLAG_ACK | TCPCB_FLAG_RST); | |
2045 | TCP_SKB_CB(skb)->sacked = 0; | |
7967168c HX |
2046 | skb_shinfo(skb)->gso_segs = 1; |
2047 | skb_shinfo(skb)->gso_size = 0; | |
2048 | skb_shinfo(skb)->gso_type = 0; | |
1da177e4 LT |
2049 | |
2050 | /* Send it off. */ | |
2051 | TCP_SKB_CB(skb)->seq = tcp_acceptable_seq(sk, tp); | |
2052 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq; | |
2053 | TCP_SKB_CB(skb)->when = tcp_time_stamp; | |
dfb4b9dc | 2054 | if (tcp_transmit_skb(sk, skb, 0, priority)) |
1da177e4 LT |
2055 | NET_INC_STATS(LINUX_MIB_TCPABORTFAILED); |
2056 | } | |
2057 | ||
2058 | /* WARNING: This routine must only be called when we have already sent | |
2059 | * a SYN packet that crossed the incoming SYN that caused this routine | |
2060 | * to get called. If this assumption fails then the initial rcv_wnd | |
2061 | * and rcv_wscale values will not be correct. | |
2062 | */ | |
2063 | int tcp_send_synack(struct sock *sk) | |
2064 | { | |
2065 | struct sk_buff* skb; | |
2066 | ||
fe067e8a | 2067 | skb = tcp_write_queue_head(sk); |
1da177e4 LT |
2068 | if (skb == NULL || !(TCP_SKB_CB(skb)->flags&TCPCB_FLAG_SYN)) { |
2069 | printk(KERN_DEBUG "tcp_send_synack: wrong queue state\n"); | |
2070 | return -EFAULT; | |
2071 | } | |
2072 | if (!(TCP_SKB_CB(skb)->flags&TCPCB_FLAG_ACK)) { | |
2073 | if (skb_cloned(skb)) { | |
2074 | struct sk_buff *nskb = skb_copy(skb, GFP_ATOMIC); | |
2075 | if (nskb == NULL) | |
2076 | return -ENOMEM; | |
fe067e8a | 2077 | tcp_unlink_write_queue(skb, sk); |
1da177e4 | 2078 | skb_header_release(nskb); |
fe067e8a | 2079 | __tcp_add_write_queue_head(sk, nskb); |
1da177e4 LT |
2080 | sk_stream_free_skb(sk, skb); |
2081 | sk_charge_skb(sk, nskb); | |
2082 | skb = nskb; | |
2083 | } | |
2084 | ||
2085 | TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_ACK; | |
2086 | TCP_ECN_send_synack(tcp_sk(sk), skb); | |
2087 | } | |
2088 | TCP_SKB_CB(skb)->when = tcp_time_stamp; | |
dfb4b9dc | 2089 | return tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC); |
1da177e4 LT |
2090 | } |
2091 | ||
2092 | /* | |
2093 | * Prepare a SYN-ACK. | |
2094 | */ | |
2095 | struct sk_buff * tcp_make_synack(struct sock *sk, struct dst_entry *dst, | |
60236fdd | 2096 | struct request_sock *req) |
1da177e4 | 2097 | { |
2e6599cb | 2098 | struct inet_request_sock *ireq = inet_rsk(req); |
1da177e4 LT |
2099 | struct tcp_sock *tp = tcp_sk(sk); |
2100 | struct tcphdr *th; | |
2101 | int tcp_header_size; | |
2102 | struct sk_buff *skb; | |
cfb6eeb4 YH |
2103 | #ifdef CONFIG_TCP_MD5SIG |
2104 | struct tcp_md5sig_key *md5; | |
2105 | __u8 *md5_hash_location; | |
2106 | #endif | |
1da177e4 LT |
2107 | |
2108 | skb = sock_wmalloc(sk, MAX_TCP_HEADER + 15, 1, GFP_ATOMIC); | |
2109 | if (skb == NULL) | |
2110 | return NULL; | |
2111 | ||
2112 | /* Reserve space for headers. */ | |
2113 | skb_reserve(skb, MAX_TCP_HEADER); | |
2114 | ||
2115 | skb->dst = dst_clone(dst); | |
2116 | ||
2117 | tcp_header_size = (sizeof(struct tcphdr) + TCPOLEN_MSS + | |
2e6599cb ACM |
2118 | (ireq->tstamp_ok ? TCPOLEN_TSTAMP_ALIGNED : 0) + |
2119 | (ireq->wscale_ok ? TCPOLEN_WSCALE_ALIGNED : 0) + | |
1da177e4 | 2120 | /* SACK_PERM is in the place of NOP NOP of TS */ |
2e6599cb | 2121 | ((ireq->sack_ok && !ireq->tstamp_ok) ? TCPOLEN_SACKPERM_ALIGNED : 0)); |
cfb6eeb4 YH |
2122 | |
2123 | #ifdef CONFIG_TCP_MD5SIG | |
2124 | /* Are we doing MD5 on this segment? If so - make room for it */ | |
2125 | md5 = tcp_rsk(req)->af_specific->md5_lookup(sk, req); | |
2126 | if (md5) | |
2127 | tcp_header_size += TCPOLEN_MD5SIG_ALIGNED; | |
2128 | #endif | |
1da177e4 LT |
2129 | skb->h.th = th = (struct tcphdr *) skb_push(skb, tcp_header_size); |
2130 | ||
2131 | memset(th, 0, sizeof(struct tcphdr)); | |
2132 | th->syn = 1; | |
2133 | th->ack = 1; | |
1da177e4 LT |
2134 | TCP_ECN_make_synack(req, th); |
2135 | th->source = inet_sk(sk)->sport; | |
2e6599cb ACM |
2136 | th->dest = ireq->rmt_port; |
2137 | TCP_SKB_CB(skb)->seq = tcp_rsk(req)->snt_isn; | |
1da177e4 LT |
2138 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq + 1; |
2139 | TCP_SKB_CB(skb)->sacked = 0; | |
7967168c HX |
2140 | skb_shinfo(skb)->gso_segs = 1; |
2141 | skb_shinfo(skb)->gso_size = 0; | |
2142 | skb_shinfo(skb)->gso_type = 0; | |
1da177e4 | 2143 | th->seq = htonl(TCP_SKB_CB(skb)->seq); |
2e6599cb | 2144 | th->ack_seq = htonl(tcp_rsk(req)->rcv_isn + 1); |
1da177e4 | 2145 | if (req->rcv_wnd == 0) { /* ignored for retransmitted syns */ |
e905a9ed | 2146 | __u8 rcv_wscale; |
1da177e4 LT |
2147 | /* Set this up on the first call only */ |
2148 | req->window_clamp = tp->window_clamp ? : dst_metric(dst, RTAX_WINDOW); | |
2149 | /* tcp_full_space because it is guaranteed to be the first packet */ | |
e905a9ed | 2150 | tcp_select_initial_window(tcp_full_space(sk), |
2e6599cb | 2151 | dst_metric(dst, RTAX_ADVMSS) - (ireq->tstamp_ok ? TCPOLEN_TSTAMP_ALIGNED : 0), |
1da177e4 LT |
2152 | &req->rcv_wnd, |
2153 | &req->window_clamp, | |
2e6599cb | 2154 | ireq->wscale_ok, |
1da177e4 | 2155 | &rcv_wscale); |
e905a9ed | 2156 | ireq->rcv_wscale = rcv_wscale; |
1da177e4 LT |
2157 | } |
2158 | ||
2159 | /* RFC1323: The window in SYN & SYN/ACK segments is never scaled. */ | |
600ff0c2 | 2160 | th->window = htons(min(req->rcv_wnd, 65535U)); |
1da177e4 LT |
2161 | |
2162 | TCP_SKB_CB(skb)->when = tcp_time_stamp; | |
df7a3b07 | 2163 | tcp_syn_build_options((__be32 *)(th + 1), dst_metric(dst, RTAX_ADVMSS), ireq->tstamp_ok, |
2e6599cb | 2164 | ireq->sack_ok, ireq->wscale_ok, ireq->rcv_wscale, |
1da177e4 | 2165 | TCP_SKB_CB(skb)->when, |
cfb6eeb4 YH |
2166 | req->ts_recent, |
2167 | ( | |
2168 | #ifdef CONFIG_TCP_MD5SIG | |
2169 | md5 ? &md5_hash_location : | |
2170 | #endif | |
2171 | NULL) | |
2172 | ); | |
1da177e4 LT |
2173 | |
2174 | skb->csum = 0; | |
2175 | th->doff = (tcp_header_size >> 2); | |
2176 | TCP_INC_STATS(TCP_MIB_OUTSEGS); | |
cfb6eeb4 YH |
2177 | |
2178 | #ifdef CONFIG_TCP_MD5SIG | |
2179 | /* Okay, we have all we need - do the md5 hash if needed */ | |
2180 | if (md5) { | |
2181 | tp->af_specific->calc_md5_hash(md5_hash_location, | |
2182 | md5, | |
2183 | NULL, dst, req, | |
2184 | skb->h.th, sk->sk_protocol, | |
2185 | skb->len); | |
2186 | } | |
2187 | #endif | |
2188 | ||
1da177e4 LT |
2189 | return skb; |
2190 | } | |
2191 | ||
e905a9ed | 2192 | /* |
1da177e4 | 2193 | * Do all connect socket setups that can be done AF independent. |
e905a9ed | 2194 | */ |
40efc6fa | 2195 | static void tcp_connect_init(struct sock *sk) |
1da177e4 LT |
2196 | { |
2197 | struct dst_entry *dst = __sk_dst_get(sk); | |
2198 | struct tcp_sock *tp = tcp_sk(sk); | |
2199 | __u8 rcv_wscale; | |
2200 | ||
2201 | /* We'll fix this up when we get a response from the other end. | |
2202 | * See tcp_input.c:tcp_rcv_state_process case TCP_SYN_SENT. | |
2203 | */ | |
2204 | tp->tcp_header_len = sizeof(struct tcphdr) + | |
2205 | (sysctl_tcp_timestamps ? TCPOLEN_TSTAMP_ALIGNED : 0); | |
2206 | ||
cfb6eeb4 YH |
2207 | #ifdef CONFIG_TCP_MD5SIG |
2208 | if (tp->af_specific->md5_lookup(sk, sk) != NULL) | |
2209 | tp->tcp_header_len += TCPOLEN_MD5SIG_ALIGNED; | |
2210 | #endif | |
2211 | ||
1da177e4 LT |
2212 | /* If user gave his TCP_MAXSEG, record it to clamp */ |
2213 | if (tp->rx_opt.user_mss) | |
2214 | tp->rx_opt.mss_clamp = tp->rx_opt.user_mss; | |
2215 | tp->max_window = 0; | |
5d424d5a | 2216 | tcp_mtup_init(sk); |
1da177e4 LT |
2217 | tcp_sync_mss(sk, dst_mtu(dst)); |
2218 | ||
2219 | if (!tp->window_clamp) | |
2220 | tp->window_clamp = dst_metric(dst, RTAX_WINDOW); | |
2221 | tp->advmss = dst_metric(dst, RTAX_ADVMSS); | |
2222 | tcp_initialize_rcv_mss(sk); | |
1da177e4 LT |
2223 | |
2224 | tcp_select_initial_window(tcp_full_space(sk), | |
2225 | tp->advmss - (tp->rx_opt.ts_recent_stamp ? tp->tcp_header_len - sizeof(struct tcphdr) : 0), | |
2226 | &tp->rcv_wnd, | |
2227 | &tp->window_clamp, | |
2228 | sysctl_tcp_window_scaling, | |
2229 | &rcv_wscale); | |
2230 | ||
2231 | tp->rx_opt.rcv_wscale = rcv_wscale; | |
2232 | tp->rcv_ssthresh = tp->rcv_wnd; | |
2233 | ||
2234 | sk->sk_err = 0; | |
2235 | sock_reset_flag(sk, SOCK_DONE); | |
2236 | tp->snd_wnd = 0; | |
2237 | tcp_init_wl(tp, tp->write_seq, 0); | |
2238 | tp->snd_una = tp->write_seq; | |
2239 | tp->snd_sml = tp->write_seq; | |
2240 | tp->rcv_nxt = 0; | |
2241 | tp->rcv_wup = 0; | |
2242 | tp->copied_seq = 0; | |
2243 | ||
463c84b9 ACM |
2244 | inet_csk(sk)->icsk_rto = TCP_TIMEOUT_INIT; |
2245 | inet_csk(sk)->icsk_retransmits = 0; | |
1da177e4 LT |
2246 | tcp_clear_retrans(tp); |
2247 | } | |
2248 | ||
2249 | /* | |
2250 | * Build a SYN and send it off. | |
e905a9ed | 2251 | */ |
1da177e4 LT |
2252 | int tcp_connect(struct sock *sk) |
2253 | { | |
2254 | struct tcp_sock *tp = tcp_sk(sk); | |
2255 | struct sk_buff *buff; | |
2256 | ||
2257 | tcp_connect_init(sk); | |
2258 | ||
d179cd12 | 2259 | buff = alloc_skb_fclone(MAX_TCP_HEADER + 15, sk->sk_allocation); |
1da177e4 LT |
2260 | if (unlikely(buff == NULL)) |
2261 | return -ENOBUFS; | |
2262 | ||
2263 | /* Reserve space for headers. */ | |
2264 | skb_reserve(buff, MAX_TCP_HEADER); | |
2265 | ||
2266 | TCP_SKB_CB(buff)->flags = TCPCB_FLAG_SYN; | |
2267 | TCP_ECN_send_syn(sk, tp, buff); | |
2268 | TCP_SKB_CB(buff)->sacked = 0; | |
7967168c HX |
2269 | skb_shinfo(buff)->gso_segs = 1; |
2270 | skb_shinfo(buff)->gso_size = 0; | |
2271 | skb_shinfo(buff)->gso_type = 0; | |
1da177e4 | 2272 | buff->csum = 0; |
bd37a088 | 2273 | tp->snd_nxt = tp->write_seq; |
1da177e4 LT |
2274 | TCP_SKB_CB(buff)->seq = tp->write_seq++; |
2275 | TCP_SKB_CB(buff)->end_seq = tp->write_seq; | |
1da177e4 LT |
2276 | |
2277 | /* Send it off. */ | |
2278 | TCP_SKB_CB(buff)->when = tcp_time_stamp; | |
2279 | tp->retrans_stamp = TCP_SKB_CB(buff)->when; | |
2280 | skb_header_release(buff); | |
fe067e8a | 2281 | __tcp_add_write_queue_tail(sk, buff); |
1da177e4 LT |
2282 | sk_charge_skb(sk, buff); |
2283 | tp->packets_out += tcp_skb_pcount(buff); | |
dfb4b9dc | 2284 | tcp_transmit_skb(sk, buff, 1, GFP_KERNEL); |
bd37a088 WY |
2285 | |
2286 | /* We change tp->snd_nxt after the tcp_transmit_skb() call | |
2287 | * in order to make this packet get counted in tcpOutSegs. | |
2288 | */ | |
2289 | tp->snd_nxt = tp->write_seq; | |
2290 | tp->pushed_seq = tp->write_seq; | |
1da177e4 LT |
2291 | TCP_INC_STATS(TCP_MIB_ACTIVEOPENS); |
2292 | ||
2293 | /* Timer for repeating the SYN until an answer. */ | |
3f421baa ACM |
2294 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, |
2295 | inet_csk(sk)->icsk_rto, TCP_RTO_MAX); | |
1da177e4 LT |
2296 | return 0; |
2297 | } | |
2298 | ||
2299 | /* Send out a delayed ack, the caller does the policy checking | |
2300 | * to see if we should even be here. See tcp_input.c:tcp_ack_snd_check() | |
2301 | * for details. | |
2302 | */ | |
2303 | void tcp_send_delayed_ack(struct sock *sk) | |
2304 | { | |
463c84b9 ACM |
2305 | struct inet_connection_sock *icsk = inet_csk(sk); |
2306 | int ato = icsk->icsk_ack.ato; | |
1da177e4 LT |
2307 | unsigned long timeout; |
2308 | ||
2309 | if (ato > TCP_DELACK_MIN) { | |
463c84b9 | 2310 | const struct tcp_sock *tp = tcp_sk(sk); |
1da177e4 LT |
2311 | int max_ato = HZ/2; |
2312 | ||
463c84b9 | 2313 | if (icsk->icsk_ack.pingpong || (icsk->icsk_ack.pending & ICSK_ACK_PUSHED)) |
1da177e4 LT |
2314 | max_ato = TCP_DELACK_MAX; |
2315 | ||
2316 | /* Slow path, intersegment interval is "high". */ | |
2317 | ||
2318 | /* If some rtt estimate is known, use it to bound delayed ack. | |
463c84b9 | 2319 | * Do not use inet_csk(sk)->icsk_rto here, use results of rtt measurements |
1da177e4 LT |
2320 | * directly. |
2321 | */ | |
2322 | if (tp->srtt) { | |
2323 | int rtt = max(tp->srtt>>3, TCP_DELACK_MIN); | |
2324 | ||
2325 | if (rtt < max_ato) | |
2326 | max_ato = rtt; | |
2327 | } | |
2328 | ||
2329 | ato = min(ato, max_ato); | |
2330 | } | |
2331 | ||
2332 | /* Stay within the limit we were given */ | |
2333 | timeout = jiffies + ato; | |
2334 | ||
2335 | /* Use new timeout only if there wasn't a older one earlier. */ | |
463c84b9 | 2336 | if (icsk->icsk_ack.pending & ICSK_ACK_TIMER) { |
1da177e4 LT |
2337 | /* If delack timer was blocked or is about to expire, |
2338 | * send ACK now. | |
2339 | */ | |
463c84b9 ACM |
2340 | if (icsk->icsk_ack.blocked || |
2341 | time_before_eq(icsk->icsk_ack.timeout, jiffies + (ato >> 2))) { | |
1da177e4 LT |
2342 | tcp_send_ack(sk); |
2343 | return; | |
2344 | } | |
2345 | ||
463c84b9 ACM |
2346 | if (!time_before(timeout, icsk->icsk_ack.timeout)) |
2347 | timeout = icsk->icsk_ack.timeout; | |
1da177e4 | 2348 | } |
463c84b9 ACM |
2349 | icsk->icsk_ack.pending |= ICSK_ACK_SCHED | ICSK_ACK_TIMER; |
2350 | icsk->icsk_ack.timeout = timeout; | |
2351 | sk_reset_timer(sk, &icsk->icsk_delack_timer, timeout); | |
1da177e4 LT |
2352 | } |
2353 | ||
2354 | /* This routine sends an ack and also updates the window. */ | |
2355 | void tcp_send_ack(struct sock *sk) | |
2356 | { | |
2357 | /* If we have been reset, we may not send again. */ | |
2358 | if (sk->sk_state != TCP_CLOSE) { | |
2359 | struct tcp_sock *tp = tcp_sk(sk); | |
2360 | struct sk_buff *buff; | |
2361 | ||
2362 | /* We are not putting this on the write queue, so | |
2363 | * tcp_transmit_skb() will set the ownership to this | |
2364 | * sock. | |
2365 | */ | |
2366 | buff = alloc_skb(MAX_TCP_HEADER, GFP_ATOMIC); | |
2367 | if (buff == NULL) { | |
463c84b9 ACM |
2368 | inet_csk_schedule_ack(sk); |
2369 | inet_csk(sk)->icsk_ack.ato = TCP_ATO_MIN; | |
3f421baa ACM |
2370 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK, |
2371 | TCP_DELACK_MAX, TCP_RTO_MAX); | |
1da177e4 LT |
2372 | return; |
2373 | } | |
2374 | ||
2375 | /* Reserve space for headers and prepare control bits. */ | |
2376 | skb_reserve(buff, MAX_TCP_HEADER); | |
2377 | buff->csum = 0; | |
2378 | TCP_SKB_CB(buff)->flags = TCPCB_FLAG_ACK; | |
2379 | TCP_SKB_CB(buff)->sacked = 0; | |
7967168c HX |
2380 | skb_shinfo(buff)->gso_segs = 1; |
2381 | skb_shinfo(buff)->gso_size = 0; | |
2382 | skb_shinfo(buff)->gso_type = 0; | |
1da177e4 LT |
2383 | |
2384 | /* Send it off, this clears delayed acks for us. */ | |
2385 | TCP_SKB_CB(buff)->seq = TCP_SKB_CB(buff)->end_seq = tcp_acceptable_seq(sk, tp); | |
2386 | TCP_SKB_CB(buff)->when = tcp_time_stamp; | |
dfb4b9dc | 2387 | tcp_transmit_skb(sk, buff, 0, GFP_ATOMIC); |
1da177e4 LT |
2388 | } |
2389 | } | |
2390 | ||
2391 | /* This routine sends a packet with an out of date sequence | |
2392 | * number. It assumes the other end will try to ack it. | |
2393 | * | |
2394 | * Question: what should we make while urgent mode? | |
2395 | * 4.4BSD forces sending single byte of data. We cannot send | |
2396 | * out of window data, because we have SND.NXT==SND.MAX... | |
2397 | * | |
2398 | * Current solution: to send TWO zero-length segments in urgent mode: | |
2399 | * one is with SEG.SEQ=SND.UNA to deliver urgent pointer, another is | |
2400 | * out-of-date with SND.UNA-1 to probe window. | |
2401 | */ | |
2402 | static int tcp_xmit_probe_skb(struct sock *sk, int urgent) | |
2403 | { | |
2404 | struct tcp_sock *tp = tcp_sk(sk); | |
2405 | struct sk_buff *skb; | |
2406 | ||
2407 | /* We don't queue it, tcp_transmit_skb() sets ownership. */ | |
2408 | skb = alloc_skb(MAX_TCP_HEADER, GFP_ATOMIC); | |
e905a9ed | 2409 | if (skb == NULL) |
1da177e4 LT |
2410 | return -1; |
2411 | ||
2412 | /* Reserve space for headers and set control bits. */ | |
2413 | skb_reserve(skb, MAX_TCP_HEADER); | |
2414 | skb->csum = 0; | |
2415 | TCP_SKB_CB(skb)->flags = TCPCB_FLAG_ACK; | |
2416 | TCP_SKB_CB(skb)->sacked = urgent; | |
7967168c HX |
2417 | skb_shinfo(skb)->gso_segs = 1; |
2418 | skb_shinfo(skb)->gso_size = 0; | |
2419 | skb_shinfo(skb)->gso_type = 0; | |
1da177e4 LT |
2420 | |
2421 | /* Use a previous sequence. This should cause the other | |
2422 | * end to send an ack. Don't queue or clone SKB, just | |
2423 | * send it. | |
2424 | */ | |
2425 | TCP_SKB_CB(skb)->seq = urgent ? tp->snd_una : tp->snd_una - 1; | |
2426 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(skb)->seq; | |
2427 | TCP_SKB_CB(skb)->when = tcp_time_stamp; | |
dfb4b9dc | 2428 | return tcp_transmit_skb(sk, skb, 0, GFP_ATOMIC); |
1da177e4 LT |
2429 | } |
2430 | ||
2431 | int tcp_write_wakeup(struct sock *sk) | |
2432 | { | |
2433 | if (sk->sk_state != TCP_CLOSE) { | |
2434 | struct tcp_sock *tp = tcp_sk(sk); | |
2435 | struct sk_buff *skb; | |
2436 | ||
fe067e8a | 2437 | if ((skb = tcp_send_head(sk)) != NULL && |
1da177e4 LT |
2438 | before(TCP_SKB_CB(skb)->seq, tp->snd_una+tp->snd_wnd)) { |
2439 | int err; | |
2440 | unsigned int mss = tcp_current_mss(sk, 0); | |
2441 | unsigned int seg_size = tp->snd_una+tp->snd_wnd-TCP_SKB_CB(skb)->seq; | |
2442 | ||
2443 | if (before(tp->pushed_seq, TCP_SKB_CB(skb)->end_seq)) | |
2444 | tp->pushed_seq = TCP_SKB_CB(skb)->end_seq; | |
2445 | ||
2446 | /* We are probing the opening of a window | |
2447 | * but the window size is != 0 | |
2448 | * must have been a result SWS avoidance ( sender ) | |
2449 | */ | |
2450 | if (seg_size < TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq || | |
2451 | skb->len > mss) { | |
2452 | seg_size = min(seg_size, mss); | |
2453 | TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_PSH; | |
846998ae | 2454 | if (tcp_fragment(sk, skb, seg_size, mss)) |
1da177e4 | 2455 | return -1; |
1da177e4 | 2456 | } else if (!tcp_skb_pcount(skb)) |
846998ae | 2457 | tcp_set_skb_tso_segs(sk, skb, mss); |
1da177e4 LT |
2458 | |
2459 | TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_PSH; | |
2460 | TCP_SKB_CB(skb)->when = tcp_time_stamp; | |
dfb4b9dc | 2461 | err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC); |
1da177e4 LT |
2462 | if (!err) { |
2463 | update_send_head(sk, tp, skb); | |
2464 | } | |
2465 | return err; | |
2466 | } else { | |
2467 | if (tp->urg_mode && | |
2468 | between(tp->snd_up, tp->snd_una+1, tp->snd_una+0xFFFF)) | |
2469 | tcp_xmit_probe_skb(sk, TCPCB_URG); | |
2470 | return tcp_xmit_probe_skb(sk, 0); | |
2471 | } | |
2472 | } | |
2473 | return -1; | |
2474 | } | |
2475 | ||
2476 | /* A window probe timeout has occurred. If window is not closed send | |
2477 | * a partial packet else a zero probe. | |
2478 | */ | |
2479 | void tcp_send_probe0(struct sock *sk) | |
2480 | { | |
463c84b9 | 2481 | struct inet_connection_sock *icsk = inet_csk(sk); |
1da177e4 LT |
2482 | struct tcp_sock *tp = tcp_sk(sk); |
2483 | int err; | |
2484 | ||
2485 | err = tcp_write_wakeup(sk); | |
2486 | ||
fe067e8a | 2487 | if (tp->packets_out || !tcp_send_head(sk)) { |
1da177e4 | 2488 | /* Cancel probe timer, if it is not required. */ |
6687e988 | 2489 | icsk->icsk_probes_out = 0; |
463c84b9 | 2490 | icsk->icsk_backoff = 0; |
1da177e4 LT |
2491 | return; |
2492 | } | |
2493 | ||
2494 | if (err <= 0) { | |
463c84b9 ACM |
2495 | if (icsk->icsk_backoff < sysctl_tcp_retries2) |
2496 | icsk->icsk_backoff++; | |
6687e988 | 2497 | icsk->icsk_probes_out++; |
e905a9ed | 2498 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0, |
3f421baa ACM |
2499 | min(icsk->icsk_rto << icsk->icsk_backoff, TCP_RTO_MAX), |
2500 | TCP_RTO_MAX); | |
1da177e4 LT |
2501 | } else { |
2502 | /* If packet was not sent due to local congestion, | |
6687e988 | 2503 | * do not backoff and do not remember icsk_probes_out. |
1da177e4 LT |
2504 | * Let local senders to fight for local resources. |
2505 | * | |
2506 | * Use accumulated backoff yet. | |
2507 | */ | |
6687e988 ACM |
2508 | if (!icsk->icsk_probes_out) |
2509 | icsk->icsk_probes_out = 1; | |
e905a9ed | 2510 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0, |
463c84b9 | 2511 | min(icsk->icsk_rto << icsk->icsk_backoff, |
3f421baa ACM |
2512 | TCP_RESOURCE_PROBE_INTERVAL), |
2513 | TCP_RTO_MAX); | |
1da177e4 LT |
2514 | } |
2515 | } | |
2516 | ||
2517 | EXPORT_SYMBOL(tcp_connect); | |
2518 | EXPORT_SYMBOL(tcp_make_synack); | |
2519 | EXPORT_SYMBOL(tcp_simple_retransmit); | |
2520 | EXPORT_SYMBOL(tcp_sync_mss); | |
f4805ede | 2521 | EXPORT_SYMBOL(sysctl_tcp_tso_win_divisor); |
5d424d5a | 2522 | EXPORT_SYMBOL(tcp_mtup_init); |