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 | * | |
02c30a84 | 8 | * Authors: Ross Biro |
1da177e4 LT |
9 | * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG> |
10 | * Mark Evans, <evansmp@uhura.aston.ac.uk> | |
11 | * Corey Minyard <wf-rch!minyard@relay.EU.net> | |
12 | * Florian La Roche, <flla@stud.uni-sb.de> | |
13 | * Charles Hedrick, <hedrick@klinzhai.rutgers.edu> | |
14 | * Linus Torvalds, <torvalds@cs.helsinki.fi> | |
15 | * Alan Cox, <gw4pts@gw4pts.ampr.org> | |
16 | * Matthew Dillon, <dillon@apollo.west.oic.com> | |
17 | * Arnt Gulbrandsen, <agulbra@nvg.unit.no> | |
18 | * Jorge Cwik, <jorge@laser.satlink.net> | |
19 | */ | |
20 | ||
21 | /* | |
22 | * Changes: Pedro Roque : Retransmit queue handled by TCP. | |
23 | * : Fragmentation on mtu decrease | |
24 | * : Segment collapse on retransmit | |
25 | * : AF independence | |
26 | * | |
27 | * Linus Torvalds : send_delayed_ack | |
28 | * David S. Miller : Charge memory using the right skb | |
29 | * during syn/ack processing. | |
30 | * David S. Miller : Output engine completely rewritten. | |
31 | * Andrea Arcangeli: SYNACK carry ts_recent in tsecr. | |
32 | * Cacophonix Gaul : draft-minshall-nagle-01 | |
33 | * J Hadi Salim : ECN support | |
34 | * | |
35 | */ | |
36 | ||
91df42be JP |
37 | #define pr_fmt(fmt) "TCP: " fmt |
38 | ||
1da177e4 LT |
39 | #include <net/tcp.h> |
40 | ||
41 | #include <linux/compiler.h> | |
5a0e3ad6 | 42 | #include <linux/gfp.h> |
1da177e4 | 43 | #include <linux/module.h> |
1da177e4 LT |
44 | |
45 | /* People can turn this off for buggy TCP's found in printers etc. */ | |
ab32ea5d | 46 | int sysctl_tcp_retrans_collapse __read_mostly = 1; |
1da177e4 | 47 | |
09cb105e | 48 | /* People can turn this on to work with those rare, broken TCPs that |
15d99e02 RJ |
49 | * interpret the window field as a signed quantity. |
50 | */ | |
ab32ea5d | 51 | int sysctl_tcp_workaround_signed_windows __read_mostly = 0; |
15d99e02 | 52 | |
46d3ceab ED |
53 | /* Default TSQ limit of two TSO segments */ |
54 | int sysctl_tcp_limit_output_bytes __read_mostly = 131072; | |
55 | ||
1da177e4 LT |
56 | /* This limits the percentage of the congestion window which we |
57 | * will allow a single TSO frame to consume. Building TSO frames | |
58 | * which are too large can cause TCP streams to be bursty. | |
59 | */ | |
ab32ea5d | 60 | int sysctl_tcp_tso_win_divisor __read_mostly = 3; |
1da177e4 | 61 | |
ab32ea5d | 62 | int sysctl_tcp_mtu_probing __read_mostly = 0; |
97b1ce25 | 63 | int sysctl_tcp_base_mss __read_mostly = TCP_BASE_MSS; |
5d424d5a | 64 | |
35089bb2 | 65 | /* By default, RFC2861 behavior. */ |
ab32ea5d | 66 | int sysctl_tcp_slow_start_after_idle __read_mostly = 1; |
35089bb2 | 67 | |
c9bee3b7 ED |
68 | unsigned int sysctl_tcp_notsent_lowat __read_mostly = UINT_MAX; |
69 | EXPORT_SYMBOL(sysctl_tcp_notsent_lowat); | |
70 | ||
46d3ceab ED |
71 | static bool tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle, |
72 | int push_one, gfp_t gfp); | |
519855c5 | 73 | |
67edfef7 | 74 | /* Account for new data that has been sent to the network. */ |
cf533ea5 | 75 | static void tcp_event_new_data_sent(struct sock *sk, const struct sk_buff *skb) |
1da177e4 | 76 | { |
6ba8a3b1 | 77 | struct inet_connection_sock *icsk = inet_csk(sk); |
9e412ba7 | 78 | struct tcp_sock *tp = tcp_sk(sk); |
66f5fe62 | 79 | unsigned int prior_packets = tp->packets_out; |
9e412ba7 | 80 | |
fe067e8a | 81 | tcp_advance_send_head(sk, skb); |
1da177e4 | 82 | tp->snd_nxt = TCP_SKB_CB(skb)->end_seq; |
8512430e | 83 | |
66f5fe62 | 84 | tp->packets_out += tcp_skb_pcount(skb); |
6ba8a3b1 | 85 | if (!prior_packets || icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS || |
6a5dc9e5 | 86 | icsk->icsk_pending == ICSK_TIME_LOSS_PROBE) { |
750ea2ba | 87 | tcp_rearm_rto(sk); |
6a5dc9e5 | 88 | } |
f19c29e3 | 89 | |
f7324acd DM |
90 | NET_ADD_STATS(sock_net(sk), LINUX_MIB_TCPORIGDATASENT, |
91 | tcp_skb_pcount(skb)); | |
1da177e4 LT |
92 | } |
93 | ||
94 | /* SND.NXT, if window was not shrunk. | |
95 | * If window has been shrunk, what should we make? It is not clear at all. | |
96 | * Using SND.UNA we will fail to open window, SND.NXT is out of window. :-( | |
97 | * Anything in between SND.UNA...SND.UNA+SND.WND also can be already | |
98 | * invalid. OK, let's make this for now: | |
99 | */ | |
cf533ea5 | 100 | static inline __u32 tcp_acceptable_seq(const struct sock *sk) |
1da177e4 | 101 | { |
cf533ea5 | 102 | const struct tcp_sock *tp = tcp_sk(sk); |
9e412ba7 | 103 | |
90840def | 104 | if (!before(tcp_wnd_end(tp), tp->snd_nxt)) |
1da177e4 LT |
105 | return tp->snd_nxt; |
106 | else | |
90840def | 107 | return tcp_wnd_end(tp); |
1da177e4 LT |
108 | } |
109 | ||
110 | /* Calculate mss to advertise in SYN segment. | |
111 | * RFC1122, RFC1063, draft-ietf-tcpimpl-pmtud-01 state that: | |
112 | * | |
113 | * 1. It is independent of path mtu. | |
114 | * 2. Ideally, it is maximal possible segment size i.e. 65535-40. | |
115 | * 3. For IPv4 it is reasonable to calculate it from maximal MTU of | |
116 | * attached devices, because some buggy hosts are confused by | |
117 | * large MSS. | |
118 | * 4. We do not make 3, we advertise MSS, calculated from first | |
119 | * hop device mtu, but allow to raise it to ip_rt_min_advmss. | |
120 | * This may be overridden via information stored in routing table. | |
121 | * 5. Value 65535 for MSS is valid in IPv6 and means "as large as possible, | |
122 | * probably even Jumbo". | |
123 | */ | |
124 | static __u16 tcp_advertise_mss(struct sock *sk) | |
125 | { | |
126 | struct tcp_sock *tp = tcp_sk(sk); | |
cf533ea5 | 127 | const struct dst_entry *dst = __sk_dst_get(sk); |
1da177e4 LT |
128 | int mss = tp->advmss; |
129 | ||
0dbaee3b DM |
130 | if (dst) { |
131 | unsigned int metric = dst_metric_advmss(dst); | |
132 | ||
133 | if (metric < mss) { | |
134 | mss = metric; | |
135 | tp->advmss = mss; | |
136 | } | |
1da177e4 LT |
137 | } |
138 | ||
139 | return (__u16)mss; | |
140 | } | |
141 | ||
142 | /* RFC2861. Reset CWND after idle period longer RTO to "restart window". | |
143 | * This is the first part of cwnd validation mechanism. */ | |
cf533ea5 | 144 | static void tcp_cwnd_restart(struct sock *sk, const struct dst_entry *dst) |
1da177e4 | 145 | { |
463c84b9 | 146 | struct tcp_sock *tp = tcp_sk(sk); |
1da177e4 LT |
147 | s32 delta = tcp_time_stamp - tp->lsndtime; |
148 | u32 restart_cwnd = tcp_init_cwnd(tp, dst); | |
149 | u32 cwnd = tp->snd_cwnd; | |
150 | ||
6687e988 | 151 | tcp_ca_event(sk, CA_EVENT_CWND_RESTART); |
1da177e4 | 152 | |
6687e988 | 153 | tp->snd_ssthresh = tcp_current_ssthresh(sk); |
1da177e4 LT |
154 | restart_cwnd = min(restart_cwnd, cwnd); |
155 | ||
463c84b9 | 156 | while ((delta -= inet_csk(sk)->icsk_rto) > 0 && cwnd > restart_cwnd) |
1da177e4 LT |
157 | cwnd >>= 1; |
158 | tp->snd_cwnd = max(cwnd, restart_cwnd); | |
159 | tp->snd_cwnd_stamp = tcp_time_stamp; | |
160 | tp->snd_cwnd_used = 0; | |
161 | } | |
162 | ||
67edfef7 | 163 | /* Congestion state accounting after a packet has been sent. */ |
40efc6fa | 164 | static void tcp_event_data_sent(struct tcp_sock *tp, |
cf533ea5 | 165 | struct sock *sk) |
1da177e4 | 166 | { |
463c84b9 ACM |
167 | struct inet_connection_sock *icsk = inet_csk(sk); |
168 | const u32 now = tcp_time_stamp; | |
bcefe17c | 169 | const struct dst_entry *dst = __sk_dst_get(sk); |
1da177e4 | 170 | |
35089bb2 DM |
171 | if (sysctl_tcp_slow_start_after_idle && |
172 | (!tp->packets_out && (s32)(now - tp->lsndtime) > icsk->icsk_rto)) | |
463c84b9 | 173 | tcp_cwnd_restart(sk, __sk_dst_get(sk)); |
1da177e4 LT |
174 | |
175 | tp->lsndtime = now; | |
176 | ||
177 | /* If it is a reply for ato after last received | |
178 | * packet, enter pingpong mode. | |
179 | */ | |
bcefe17c CW |
180 | if ((u32)(now - icsk->icsk_ack.lrcvtime) < icsk->icsk_ack.ato && |
181 | (!dst || !dst_metric(dst, RTAX_QUICKACK))) | |
182 | icsk->icsk_ack.pingpong = 1; | |
1da177e4 LT |
183 | } |
184 | ||
67edfef7 | 185 | /* Account for an ACK we sent. */ |
40efc6fa | 186 | static inline void tcp_event_ack_sent(struct sock *sk, unsigned int pkts) |
1da177e4 | 187 | { |
463c84b9 ACM |
188 | tcp_dec_quickack_mode(sk, pkts); |
189 | inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK); | |
1da177e4 LT |
190 | } |
191 | ||
85f16525 YC |
192 | |
193 | u32 tcp_default_init_rwnd(u32 mss) | |
194 | { | |
195 | /* Initial receive window should be twice of TCP_INIT_CWND to | |
9ef71e0c | 196 | * enable proper sending of new unsent data during fast recovery |
85f16525 YC |
197 | * (RFC 3517, Section 4, NextSeg() rule (2)). Further place a |
198 | * limit when mss is larger than 1460. | |
199 | */ | |
200 | u32 init_rwnd = TCP_INIT_CWND * 2; | |
201 | ||
202 | if (mss > 1460) | |
203 | init_rwnd = max((1460 * init_rwnd) / mss, 2U); | |
204 | return init_rwnd; | |
205 | } | |
206 | ||
1da177e4 LT |
207 | /* Determine a window scaling and initial window to offer. |
208 | * Based on the assumption that the given amount of space | |
209 | * will be offered. Store the results in the tp structure. | |
210 | * NOTE: for smooth operation initial space offering should | |
211 | * be a multiple of mss if possible. We assume here that mss >= 1. | |
212 | * This MUST be enforced by all callers. | |
213 | */ | |
214 | void tcp_select_initial_window(int __space, __u32 mss, | |
215 | __u32 *rcv_wnd, __u32 *window_clamp, | |
31d12926 | 216 | int wscale_ok, __u8 *rcv_wscale, |
217 | __u32 init_rcv_wnd) | |
1da177e4 LT |
218 | { |
219 | unsigned int space = (__space < 0 ? 0 : __space); | |
220 | ||
221 | /* If no clamp set the clamp to the max possible scaled window */ | |
222 | if (*window_clamp == 0) | |
223 | (*window_clamp) = (65535 << 14); | |
224 | space = min(*window_clamp, space); | |
225 | ||
226 | /* Quantize space offering to a multiple of mss if possible. */ | |
227 | if (space > mss) | |
228 | space = (space / mss) * mss; | |
229 | ||
230 | /* NOTE: offering an initial window larger than 32767 | |
15d99e02 RJ |
231 | * will break some buggy TCP stacks. If the admin tells us |
232 | * it is likely we could be speaking with such a buggy stack | |
233 | * we will truncate our initial window offering to 32K-1 | |
234 | * unless the remote has sent us a window scaling option, | |
235 | * which we interpret as a sign the remote TCP is not | |
236 | * misinterpreting the window field as a signed quantity. | |
1da177e4 | 237 | */ |
15d99e02 RJ |
238 | if (sysctl_tcp_workaround_signed_windows) |
239 | (*rcv_wnd) = min(space, MAX_TCP_WINDOW); | |
240 | else | |
241 | (*rcv_wnd) = space; | |
242 | ||
1da177e4 LT |
243 | (*rcv_wscale) = 0; |
244 | if (wscale_ok) { | |
245 | /* Set window scaling on max possible window | |
e905a9ed | 246 | * See RFC1323 for an explanation of the limit to 14 |
1da177e4 LT |
247 | */ |
248 | space = max_t(u32, sysctl_tcp_rmem[2], sysctl_rmem_max); | |
316c1592 | 249 | space = min_t(u32, space, *window_clamp); |
1da177e4 LT |
250 | while (space > 65535 && (*rcv_wscale) < 14) { |
251 | space >>= 1; | |
252 | (*rcv_wscale)++; | |
253 | } | |
254 | } | |
255 | ||
056834d9 | 256 | if (mss > (1 << *rcv_wscale)) { |
85f16525 YC |
257 | if (!init_rcv_wnd) /* Use default unless specified otherwise */ |
258 | init_rcv_wnd = tcp_default_init_rwnd(mss); | |
259 | *rcv_wnd = min(*rcv_wnd, init_rcv_wnd * mss); | |
1da177e4 LT |
260 | } |
261 | ||
262 | /* Set the clamp no higher than max representable value */ | |
263 | (*window_clamp) = min(65535U << (*rcv_wscale), *window_clamp); | |
264 | } | |
4bc2f18b | 265 | EXPORT_SYMBOL(tcp_select_initial_window); |
1da177e4 LT |
266 | |
267 | /* Chose a new window to advertise, update state in tcp_sock for the | |
268 | * socket, and return result with RFC1323 scaling applied. The return | |
269 | * value can be stuffed directly into th->window for an outgoing | |
270 | * frame. | |
271 | */ | |
40efc6fa | 272 | static u16 tcp_select_window(struct sock *sk) |
1da177e4 LT |
273 | { |
274 | struct tcp_sock *tp = tcp_sk(sk); | |
8e165e20 | 275 | u32 old_win = tp->rcv_wnd; |
1da177e4 LT |
276 | u32 cur_win = tcp_receive_window(tp); |
277 | u32 new_win = __tcp_select_window(sk); | |
278 | ||
279 | /* Never shrink the offered window */ | |
2de979bd | 280 | if (new_win < cur_win) { |
1da177e4 LT |
281 | /* Danger Will Robinson! |
282 | * Don't update rcv_wup/rcv_wnd here or else | |
283 | * we will not be able to advertise a zero | |
284 | * window in time. --DaveM | |
285 | * | |
286 | * Relax Will Robinson. | |
287 | */ | |
8e165e20 FW |
288 | if (new_win == 0) |
289 | NET_INC_STATS(sock_net(sk), | |
290 | LINUX_MIB_TCPWANTZEROWINDOWADV); | |
607bfbf2 | 291 | new_win = ALIGN(cur_win, 1 << tp->rx_opt.rcv_wscale); |
1da177e4 LT |
292 | } |
293 | tp->rcv_wnd = new_win; | |
294 | tp->rcv_wup = tp->rcv_nxt; | |
295 | ||
296 | /* Make sure we do not exceed the maximum possible | |
297 | * scaled window. | |
298 | */ | |
15d99e02 | 299 | if (!tp->rx_opt.rcv_wscale && sysctl_tcp_workaround_signed_windows) |
1da177e4 LT |
300 | new_win = min(new_win, MAX_TCP_WINDOW); |
301 | else | |
302 | new_win = min(new_win, (65535U << tp->rx_opt.rcv_wscale)); | |
303 | ||
304 | /* RFC1323 scaling applied */ | |
305 | new_win >>= tp->rx_opt.rcv_wscale; | |
306 | ||
307 | /* If we advertise zero window, disable fast path. */ | |
8e165e20 | 308 | if (new_win == 0) { |
1da177e4 | 309 | tp->pred_flags = 0; |
8e165e20 FW |
310 | if (old_win) |
311 | NET_INC_STATS(sock_net(sk), | |
312 | LINUX_MIB_TCPTOZEROWINDOWADV); | |
313 | } else if (old_win == 0) { | |
314 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPFROMZEROWINDOWADV); | |
315 | } | |
1da177e4 LT |
316 | |
317 | return new_win; | |
318 | } | |
319 | ||
67edfef7 | 320 | /* Packet ECN state for a SYN-ACK */ |
cf533ea5 | 321 | static inline void TCP_ECN_send_synack(const struct tcp_sock *tp, struct sk_buff *skb) |
bdf1ee5d | 322 | { |
4de075e0 | 323 | TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_CWR; |
056834d9 | 324 | if (!(tp->ecn_flags & TCP_ECN_OK)) |
4de075e0 | 325 | TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_ECE; |
bdf1ee5d IJ |
326 | } |
327 | ||
67edfef7 | 328 | /* Packet ECN state for a SYN. */ |
bdf1ee5d IJ |
329 | static inline void TCP_ECN_send_syn(struct sock *sk, struct sk_buff *skb) |
330 | { | |
331 | struct tcp_sock *tp = tcp_sk(sk); | |
332 | ||
333 | tp->ecn_flags = 0; | |
5d134f1c | 334 | if (sock_net(sk)->ipv4.sysctl_tcp_ecn == 1) { |
4de075e0 | 335 | TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_ECE | TCPHDR_CWR; |
bdf1ee5d IJ |
336 | tp->ecn_flags = TCP_ECN_OK; |
337 | } | |
338 | } | |
339 | ||
340 | static __inline__ void | |
cf533ea5 | 341 | TCP_ECN_make_synack(const struct request_sock *req, struct tcphdr *th) |
bdf1ee5d IJ |
342 | { |
343 | if (inet_rsk(req)->ecn_ok) | |
344 | th->ece = 1; | |
345 | } | |
346 | ||
67edfef7 AK |
347 | /* Set up ECN state for a packet on a ESTABLISHED socket that is about to |
348 | * be sent. | |
349 | */ | |
bdf1ee5d IJ |
350 | static inline void TCP_ECN_send(struct sock *sk, struct sk_buff *skb, |
351 | int tcp_header_len) | |
352 | { | |
353 | struct tcp_sock *tp = tcp_sk(sk); | |
354 | ||
355 | if (tp->ecn_flags & TCP_ECN_OK) { | |
356 | /* Not-retransmitted data segment: set ECT and inject CWR. */ | |
357 | if (skb->len != tcp_header_len && | |
358 | !before(TCP_SKB_CB(skb)->seq, tp->snd_nxt)) { | |
359 | INET_ECN_xmit(sk); | |
056834d9 | 360 | if (tp->ecn_flags & TCP_ECN_QUEUE_CWR) { |
bdf1ee5d IJ |
361 | tp->ecn_flags &= ~TCP_ECN_QUEUE_CWR; |
362 | tcp_hdr(skb)->cwr = 1; | |
363 | skb_shinfo(skb)->gso_type |= SKB_GSO_TCP_ECN; | |
364 | } | |
365 | } else { | |
366 | /* ACK or retransmitted segment: clear ECT|CE */ | |
367 | INET_ECN_dontxmit(sk); | |
368 | } | |
369 | if (tp->ecn_flags & TCP_ECN_DEMAND_CWR) | |
370 | tcp_hdr(skb)->ece = 1; | |
371 | } | |
372 | } | |
373 | ||
e870a8ef IJ |
374 | /* Constructs common control bits of non-data skb. If SYN/FIN is present, |
375 | * auto increment end seqno. | |
376 | */ | |
377 | static void tcp_init_nondata_skb(struct sk_buff *skb, u32 seq, u8 flags) | |
378 | { | |
7b7fc97a ED |
379 | struct skb_shared_info *shinfo = skb_shinfo(skb); |
380 | ||
2e8e18ef | 381 | skb->ip_summed = CHECKSUM_PARTIAL; |
e870a8ef IJ |
382 | skb->csum = 0; |
383 | ||
4de075e0 | 384 | TCP_SKB_CB(skb)->tcp_flags = flags; |
e870a8ef IJ |
385 | TCP_SKB_CB(skb)->sacked = 0; |
386 | ||
7b7fc97a ED |
387 | shinfo->gso_segs = 1; |
388 | shinfo->gso_size = 0; | |
389 | shinfo->gso_type = 0; | |
e870a8ef IJ |
390 | |
391 | TCP_SKB_CB(skb)->seq = seq; | |
a3433f35 | 392 | if (flags & (TCPHDR_SYN | TCPHDR_FIN)) |
e870a8ef IJ |
393 | seq++; |
394 | TCP_SKB_CB(skb)->end_seq = seq; | |
395 | } | |
396 | ||
a2a385d6 | 397 | static inline bool tcp_urg_mode(const struct tcp_sock *tp) |
33f5f57e IJ |
398 | { |
399 | return tp->snd_una != tp->snd_up; | |
400 | } | |
401 | ||
33ad798c AL |
402 | #define OPTION_SACK_ADVERTISE (1 << 0) |
403 | #define OPTION_TS (1 << 1) | |
404 | #define OPTION_MD5 (1 << 2) | |
89e95a61 | 405 | #define OPTION_WSCALE (1 << 3) |
2100c8d2 | 406 | #define OPTION_FAST_OPEN_COOKIE (1 << 8) |
33ad798c AL |
407 | |
408 | struct tcp_out_options { | |
2100c8d2 YC |
409 | u16 options; /* bit field of OPTION_* */ |
410 | u16 mss; /* 0 to disable */ | |
33ad798c AL |
411 | u8 ws; /* window scale, 0 to disable */ |
412 | u8 num_sack_blocks; /* number of SACK blocks to include */ | |
bd0388ae | 413 | u8 hash_size; /* bytes in hash_location */ |
bd0388ae | 414 | __u8 *hash_location; /* temporary pointer, overloaded */ |
2100c8d2 YC |
415 | __u32 tsval, tsecr; /* need to include OPTION_TS */ |
416 | struct tcp_fastopen_cookie *fastopen_cookie; /* Fast open cookie */ | |
33ad798c AL |
417 | }; |
418 | ||
67edfef7 AK |
419 | /* Write previously computed TCP options to the packet. |
420 | * | |
421 | * Beware: Something in the Internet is very sensitive to the ordering of | |
fd6149d3 IJ |
422 | * TCP options, we learned this through the hard way, so be careful here. |
423 | * Luckily we can at least blame others for their non-compliance but from | |
8e3bff96 | 424 | * inter-operability perspective it seems that we're somewhat stuck with |
fd6149d3 IJ |
425 | * the ordering which we have been using if we want to keep working with |
426 | * those broken things (not that it currently hurts anybody as there isn't | |
427 | * particular reason why the ordering would need to be changed). | |
428 | * | |
429 | * At least SACK_PERM as the first option is known to lead to a disaster | |
430 | * (but it may well be that other scenarios fail similarly). | |
431 | */ | |
33ad798c | 432 | static void tcp_options_write(__be32 *ptr, struct tcp_sock *tp, |
bd0388ae WAS |
433 | struct tcp_out_options *opts) |
434 | { | |
2100c8d2 | 435 | u16 options = opts->options; /* mungable copy */ |
bd0388ae | 436 | |
bd0388ae | 437 | if (unlikely(OPTION_MD5 & options)) { |
1a2c6181 CP |
438 | *ptr++ = htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16) | |
439 | (TCPOPT_MD5SIG << 8) | TCPOLEN_MD5SIG); | |
bd0388ae WAS |
440 | /* overload cookie hash location */ |
441 | opts->hash_location = (__u8 *)ptr; | |
33ad798c | 442 | ptr += 4; |
40efc6fa | 443 | } |
33ad798c | 444 | |
fd6149d3 IJ |
445 | if (unlikely(opts->mss)) { |
446 | *ptr++ = htonl((TCPOPT_MSS << 24) | | |
447 | (TCPOLEN_MSS << 16) | | |
448 | opts->mss); | |
449 | } | |
450 | ||
bd0388ae WAS |
451 | if (likely(OPTION_TS & options)) { |
452 | if (unlikely(OPTION_SACK_ADVERTISE & options)) { | |
33ad798c AL |
453 | *ptr++ = htonl((TCPOPT_SACK_PERM << 24) | |
454 | (TCPOLEN_SACK_PERM << 16) | | |
455 | (TCPOPT_TIMESTAMP << 8) | | |
456 | TCPOLEN_TIMESTAMP); | |
bd0388ae | 457 | options &= ~OPTION_SACK_ADVERTISE; |
33ad798c AL |
458 | } else { |
459 | *ptr++ = htonl((TCPOPT_NOP << 24) | | |
460 | (TCPOPT_NOP << 16) | | |
461 | (TCPOPT_TIMESTAMP << 8) | | |
462 | TCPOLEN_TIMESTAMP); | |
463 | } | |
464 | *ptr++ = htonl(opts->tsval); | |
465 | *ptr++ = htonl(opts->tsecr); | |
466 | } | |
467 | ||
bd0388ae | 468 | if (unlikely(OPTION_SACK_ADVERTISE & options)) { |
33ad798c AL |
469 | *ptr++ = htonl((TCPOPT_NOP << 24) | |
470 | (TCPOPT_NOP << 16) | | |
471 | (TCPOPT_SACK_PERM << 8) | | |
472 | TCPOLEN_SACK_PERM); | |
473 | } | |
474 | ||
bd0388ae | 475 | if (unlikely(OPTION_WSCALE & options)) { |
33ad798c AL |
476 | *ptr++ = htonl((TCPOPT_NOP << 24) | |
477 | (TCPOPT_WINDOW << 16) | | |
478 | (TCPOLEN_WINDOW << 8) | | |
479 | opts->ws); | |
480 | } | |
481 | ||
482 | if (unlikely(opts->num_sack_blocks)) { | |
483 | struct tcp_sack_block *sp = tp->rx_opt.dsack ? | |
484 | tp->duplicate_sack : tp->selective_acks; | |
40efc6fa SH |
485 | int this_sack; |
486 | ||
487 | *ptr++ = htonl((TCPOPT_NOP << 24) | | |
488 | (TCPOPT_NOP << 16) | | |
489 | (TCPOPT_SACK << 8) | | |
33ad798c | 490 | (TCPOLEN_SACK_BASE + (opts->num_sack_blocks * |
40efc6fa | 491 | TCPOLEN_SACK_PERBLOCK))); |
2de979bd | 492 | |
33ad798c AL |
493 | for (this_sack = 0; this_sack < opts->num_sack_blocks; |
494 | ++this_sack) { | |
40efc6fa SH |
495 | *ptr++ = htonl(sp[this_sack].start_seq); |
496 | *ptr++ = htonl(sp[this_sack].end_seq); | |
497 | } | |
2de979bd | 498 | |
5861f8e5 | 499 | tp->rx_opt.dsack = 0; |
40efc6fa | 500 | } |
2100c8d2 YC |
501 | |
502 | if (unlikely(OPTION_FAST_OPEN_COOKIE & options)) { | |
503 | struct tcp_fastopen_cookie *foc = opts->fastopen_cookie; | |
504 | ||
505 | *ptr++ = htonl((TCPOPT_EXP << 24) | | |
506 | ((TCPOLEN_EXP_FASTOPEN_BASE + foc->len) << 16) | | |
507 | TCPOPT_FASTOPEN_MAGIC); | |
508 | ||
509 | memcpy(ptr, foc->val, foc->len); | |
510 | if ((foc->len & 3) == 2) { | |
511 | u8 *align = ((u8 *)ptr) + foc->len; | |
512 | align[0] = align[1] = TCPOPT_NOP; | |
513 | } | |
514 | ptr += (foc->len + 3) >> 2; | |
515 | } | |
33ad798c AL |
516 | } |
517 | ||
67edfef7 AK |
518 | /* Compute TCP options for SYN packets. This is not the final |
519 | * network wire format yet. | |
520 | */ | |
95c96174 | 521 | static unsigned int tcp_syn_options(struct sock *sk, struct sk_buff *skb, |
33ad798c | 522 | struct tcp_out_options *opts, |
cf533ea5 ED |
523 | struct tcp_md5sig_key **md5) |
524 | { | |
33ad798c | 525 | struct tcp_sock *tp = tcp_sk(sk); |
95c96174 | 526 | unsigned int remaining = MAX_TCP_OPTION_SPACE; |
783237e8 | 527 | struct tcp_fastopen_request *fastopen = tp->fastopen_req; |
33ad798c | 528 | |
cfb6eeb4 | 529 | #ifdef CONFIG_TCP_MD5SIG |
33ad798c AL |
530 | *md5 = tp->af_specific->md5_lookup(sk, sk); |
531 | if (*md5) { | |
532 | opts->options |= OPTION_MD5; | |
bd0388ae | 533 | remaining -= TCPOLEN_MD5SIG_ALIGNED; |
cfb6eeb4 | 534 | } |
33ad798c AL |
535 | #else |
536 | *md5 = NULL; | |
cfb6eeb4 | 537 | #endif |
33ad798c AL |
538 | |
539 | /* We always get an MSS option. The option bytes which will be seen in | |
540 | * normal data packets should timestamps be used, must be in the MSS | |
541 | * advertised. But we subtract them from tp->mss_cache so that | |
542 | * calculations in tcp_sendmsg are simpler etc. So account for this | |
543 | * fact here if necessary. If we don't do this correctly, as a | |
544 | * receiver we won't recognize data packets as being full sized when we | |
545 | * should, and thus we won't abide by the delayed ACK rules correctly. | |
546 | * SACKs don't matter, we never delay an ACK when we have any of those | |
547 | * going out. */ | |
548 | opts->mss = tcp_advertise_mss(sk); | |
bd0388ae | 549 | remaining -= TCPOLEN_MSS_ALIGNED; |
33ad798c | 550 | |
bb5b7c11 | 551 | if (likely(sysctl_tcp_timestamps && *md5 == NULL)) { |
33ad798c | 552 | opts->options |= OPTION_TS; |
7faee5c0 | 553 | opts->tsval = tcp_skb_timestamp(skb) + tp->tsoffset; |
33ad798c | 554 | opts->tsecr = tp->rx_opt.ts_recent; |
bd0388ae | 555 | remaining -= TCPOLEN_TSTAMP_ALIGNED; |
33ad798c | 556 | } |
bb5b7c11 | 557 | if (likely(sysctl_tcp_window_scaling)) { |
33ad798c | 558 | opts->ws = tp->rx_opt.rcv_wscale; |
89e95a61 | 559 | opts->options |= OPTION_WSCALE; |
bd0388ae | 560 | remaining -= TCPOLEN_WSCALE_ALIGNED; |
33ad798c | 561 | } |
bb5b7c11 | 562 | if (likely(sysctl_tcp_sack)) { |
33ad798c | 563 | opts->options |= OPTION_SACK_ADVERTISE; |
b32d1310 | 564 | if (unlikely(!(OPTION_TS & opts->options))) |
bd0388ae | 565 | remaining -= TCPOLEN_SACKPERM_ALIGNED; |
33ad798c AL |
566 | } |
567 | ||
783237e8 YC |
568 | if (fastopen && fastopen->cookie.len >= 0) { |
569 | u32 need = TCPOLEN_EXP_FASTOPEN_BASE + fastopen->cookie.len; | |
570 | need = (need + 3) & ~3U; /* Align to 32 bits */ | |
571 | if (remaining >= need) { | |
572 | opts->options |= OPTION_FAST_OPEN_COOKIE; | |
573 | opts->fastopen_cookie = &fastopen->cookie; | |
574 | remaining -= need; | |
575 | tp->syn_fastopen = 1; | |
576 | } | |
577 | } | |
bd0388ae | 578 | |
bd0388ae | 579 | return MAX_TCP_OPTION_SPACE - remaining; |
40efc6fa SH |
580 | } |
581 | ||
67edfef7 | 582 | /* Set up TCP options for SYN-ACKs. */ |
95c96174 | 583 | static unsigned int tcp_synack_options(struct sock *sk, |
33ad798c | 584 | struct request_sock *req, |
95c96174 | 585 | unsigned int mss, struct sk_buff *skb, |
33ad798c | 586 | struct tcp_out_options *opts, |
4957faad | 587 | struct tcp_md5sig_key **md5, |
8336886f | 588 | struct tcp_fastopen_cookie *foc) |
4957faad | 589 | { |
33ad798c | 590 | struct inet_request_sock *ireq = inet_rsk(req); |
95c96174 | 591 | unsigned int remaining = MAX_TCP_OPTION_SPACE; |
33ad798c | 592 | |
cfb6eeb4 | 593 | #ifdef CONFIG_TCP_MD5SIG |
33ad798c AL |
594 | *md5 = tcp_rsk(req)->af_specific->md5_lookup(sk, req); |
595 | if (*md5) { | |
596 | opts->options |= OPTION_MD5; | |
4957faad WAS |
597 | remaining -= TCPOLEN_MD5SIG_ALIGNED; |
598 | ||
599 | /* We can't fit any SACK blocks in a packet with MD5 + TS | |
600 | * options. There was discussion about disabling SACK | |
601 | * rather than TS in order to fit in better with old, | |
602 | * buggy kernels, but that was deemed to be unnecessary. | |
603 | */ | |
de213e5e | 604 | ireq->tstamp_ok &= !ireq->sack_ok; |
cfb6eeb4 | 605 | } |
33ad798c AL |
606 | #else |
607 | *md5 = NULL; | |
cfb6eeb4 | 608 | #endif |
33ad798c | 609 | |
4957faad | 610 | /* We always send an MSS option. */ |
33ad798c | 611 | opts->mss = mss; |
4957faad | 612 | remaining -= TCPOLEN_MSS_ALIGNED; |
33ad798c AL |
613 | |
614 | if (likely(ireq->wscale_ok)) { | |
615 | opts->ws = ireq->rcv_wscale; | |
89e95a61 | 616 | opts->options |= OPTION_WSCALE; |
4957faad | 617 | remaining -= TCPOLEN_WSCALE_ALIGNED; |
33ad798c | 618 | } |
de213e5e | 619 | if (likely(ireq->tstamp_ok)) { |
33ad798c | 620 | opts->options |= OPTION_TS; |
7faee5c0 | 621 | opts->tsval = tcp_skb_timestamp(skb); |
33ad798c | 622 | opts->tsecr = req->ts_recent; |
4957faad | 623 | remaining -= TCPOLEN_TSTAMP_ALIGNED; |
33ad798c AL |
624 | } |
625 | if (likely(ireq->sack_ok)) { | |
626 | opts->options |= OPTION_SACK_ADVERTISE; | |
de213e5e | 627 | if (unlikely(!ireq->tstamp_ok)) |
4957faad | 628 | remaining -= TCPOLEN_SACKPERM_ALIGNED; |
33ad798c | 629 | } |
89278c9d | 630 | if (foc != NULL && foc->len >= 0) { |
8336886f JC |
631 | u32 need = TCPOLEN_EXP_FASTOPEN_BASE + foc->len; |
632 | need = (need + 3) & ~3U; /* Align to 32 bits */ | |
633 | if (remaining >= need) { | |
634 | opts->options |= OPTION_FAST_OPEN_COOKIE; | |
635 | opts->fastopen_cookie = foc; | |
636 | remaining -= need; | |
637 | } | |
638 | } | |
1a2c6181 | 639 | |
4957faad | 640 | return MAX_TCP_OPTION_SPACE - remaining; |
33ad798c AL |
641 | } |
642 | ||
67edfef7 AK |
643 | /* Compute TCP options for ESTABLISHED sockets. This is not the |
644 | * final wire format yet. | |
645 | */ | |
95c96174 | 646 | static unsigned int tcp_established_options(struct sock *sk, struct sk_buff *skb, |
33ad798c | 647 | struct tcp_out_options *opts, |
cf533ea5 ED |
648 | struct tcp_md5sig_key **md5) |
649 | { | |
33ad798c | 650 | struct tcp_sock *tp = tcp_sk(sk); |
95c96174 | 651 | unsigned int size = 0; |
cabeccbd | 652 | unsigned int eff_sacks; |
33ad798c | 653 | |
5843ef42 AK |
654 | opts->options = 0; |
655 | ||
33ad798c AL |
656 | #ifdef CONFIG_TCP_MD5SIG |
657 | *md5 = tp->af_specific->md5_lookup(sk, sk); | |
658 | if (unlikely(*md5)) { | |
659 | opts->options |= OPTION_MD5; | |
660 | size += TCPOLEN_MD5SIG_ALIGNED; | |
661 | } | |
662 | #else | |
663 | *md5 = NULL; | |
664 | #endif | |
665 | ||
666 | if (likely(tp->rx_opt.tstamp_ok)) { | |
667 | opts->options |= OPTION_TS; | |
7faee5c0 | 668 | opts->tsval = skb ? tcp_skb_timestamp(skb) + tp->tsoffset : 0; |
33ad798c AL |
669 | opts->tsecr = tp->rx_opt.ts_recent; |
670 | size += TCPOLEN_TSTAMP_ALIGNED; | |
671 | } | |
672 | ||
cabeccbd IJ |
673 | eff_sacks = tp->rx_opt.num_sacks + tp->rx_opt.dsack; |
674 | if (unlikely(eff_sacks)) { | |
95c96174 | 675 | const unsigned int remaining = MAX_TCP_OPTION_SPACE - size; |
33ad798c | 676 | opts->num_sack_blocks = |
95c96174 | 677 | min_t(unsigned int, eff_sacks, |
33ad798c AL |
678 | (remaining - TCPOLEN_SACK_BASE_ALIGNED) / |
679 | TCPOLEN_SACK_PERBLOCK); | |
680 | size += TCPOLEN_SACK_BASE_ALIGNED + | |
681 | opts->num_sack_blocks * TCPOLEN_SACK_PERBLOCK; | |
682 | } | |
683 | ||
684 | return size; | |
40efc6fa | 685 | } |
1da177e4 | 686 | |
46d3ceab ED |
687 | |
688 | /* TCP SMALL QUEUES (TSQ) | |
689 | * | |
690 | * TSQ goal is to keep small amount of skbs per tcp flow in tx queues (qdisc+dev) | |
691 | * to reduce RTT and bufferbloat. | |
692 | * We do this using a special skb destructor (tcp_wfree). | |
693 | * | |
694 | * Its important tcp_wfree() can be replaced by sock_wfree() in the event skb | |
695 | * needs to be reallocated in a driver. | |
8e3bff96 | 696 | * The invariant being skb->truesize subtracted from sk->sk_wmem_alloc |
46d3ceab ED |
697 | * |
698 | * Since transmit from skb destructor is forbidden, we use a tasklet | |
699 | * to process all sockets that eventually need to send more skbs. | |
700 | * We use one tasklet per cpu, with its own queue of sockets. | |
701 | */ | |
702 | struct tsq_tasklet { | |
703 | struct tasklet_struct tasklet; | |
704 | struct list_head head; /* queue of tcp sockets */ | |
705 | }; | |
706 | static DEFINE_PER_CPU(struct tsq_tasklet, tsq_tasklet); | |
707 | ||
6f458dfb ED |
708 | static void tcp_tsq_handler(struct sock *sk) |
709 | { | |
710 | if ((1 << sk->sk_state) & | |
711 | (TCPF_ESTABLISHED | TCPF_FIN_WAIT1 | TCPF_CLOSING | | |
712 | TCPF_CLOSE_WAIT | TCPF_LAST_ACK)) | |
bf06200e JO |
713 | tcp_write_xmit(sk, tcp_current_mss(sk), tcp_sk(sk)->nonagle, |
714 | 0, GFP_ATOMIC); | |
6f458dfb | 715 | } |
46d3ceab | 716 | /* |
8e3bff96 | 717 | * One tasklet per cpu tries to send more skbs. |
46d3ceab | 718 | * We run in tasklet context but need to disable irqs when |
8e3bff96 | 719 | * transferring tsq->head because tcp_wfree() might |
46d3ceab ED |
720 | * interrupt us (non NAPI drivers) |
721 | */ | |
722 | static void tcp_tasklet_func(unsigned long data) | |
723 | { | |
724 | struct tsq_tasklet *tsq = (struct tsq_tasklet *)data; | |
725 | LIST_HEAD(list); | |
726 | unsigned long flags; | |
727 | struct list_head *q, *n; | |
728 | struct tcp_sock *tp; | |
729 | struct sock *sk; | |
730 | ||
731 | local_irq_save(flags); | |
732 | list_splice_init(&tsq->head, &list); | |
733 | local_irq_restore(flags); | |
734 | ||
735 | list_for_each_safe(q, n, &list) { | |
736 | tp = list_entry(q, struct tcp_sock, tsq_node); | |
737 | list_del(&tp->tsq_node); | |
738 | ||
739 | sk = (struct sock *)tp; | |
740 | bh_lock_sock(sk); | |
741 | ||
742 | if (!sock_owned_by_user(sk)) { | |
6f458dfb | 743 | tcp_tsq_handler(sk); |
46d3ceab ED |
744 | } else { |
745 | /* defer the work to tcp_release_cb() */ | |
6f458dfb | 746 | set_bit(TCP_TSQ_DEFERRED, &tp->tsq_flags); |
46d3ceab ED |
747 | } |
748 | bh_unlock_sock(sk); | |
749 | ||
750 | clear_bit(TSQ_QUEUED, &tp->tsq_flags); | |
751 | sk_free(sk); | |
752 | } | |
753 | } | |
754 | ||
6f458dfb ED |
755 | #define TCP_DEFERRED_ALL ((1UL << TCP_TSQ_DEFERRED) | \ |
756 | (1UL << TCP_WRITE_TIMER_DEFERRED) | \ | |
563d34d0 ED |
757 | (1UL << TCP_DELACK_TIMER_DEFERRED) | \ |
758 | (1UL << TCP_MTU_REDUCED_DEFERRED)) | |
46d3ceab ED |
759 | /** |
760 | * tcp_release_cb - tcp release_sock() callback | |
761 | * @sk: socket | |
762 | * | |
763 | * called from release_sock() to perform protocol dependent | |
764 | * actions before socket release. | |
765 | */ | |
766 | void tcp_release_cb(struct sock *sk) | |
767 | { | |
768 | struct tcp_sock *tp = tcp_sk(sk); | |
6f458dfb | 769 | unsigned long flags, nflags; |
46d3ceab | 770 | |
6f458dfb ED |
771 | /* perform an atomic operation only if at least one flag is set */ |
772 | do { | |
773 | flags = tp->tsq_flags; | |
774 | if (!(flags & TCP_DEFERRED_ALL)) | |
775 | return; | |
776 | nflags = flags & ~TCP_DEFERRED_ALL; | |
777 | } while (cmpxchg(&tp->tsq_flags, flags, nflags) != flags); | |
778 | ||
779 | if (flags & (1UL << TCP_TSQ_DEFERRED)) | |
780 | tcp_tsq_handler(sk); | |
781 | ||
c3f9b018 ED |
782 | /* Here begins the tricky part : |
783 | * We are called from release_sock() with : | |
784 | * 1) BH disabled | |
785 | * 2) sk_lock.slock spinlock held | |
786 | * 3) socket owned by us (sk->sk_lock.owned == 1) | |
787 | * | |
788 | * But following code is meant to be called from BH handlers, | |
789 | * so we should keep BH disabled, but early release socket ownership | |
790 | */ | |
791 | sock_release_ownership(sk); | |
792 | ||
144d56e9 | 793 | if (flags & (1UL << TCP_WRITE_TIMER_DEFERRED)) { |
6f458dfb | 794 | tcp_write_timer_handler(sk); |
144d56e9 ED |
795 | __sock_put(sk); |
796 | } | |
797 | if (flags & (1UL << TCP_DELACK_TIMER_DEFERRED)) { | |
6f458dfb | 798 | tcp_delack_timer_handler(sk); |
144d56e9 ED |
799 | __sock_put(sk); |
800 | } | |
801 | if (flags & (1UL << TCP_MTU_REDUCED_DEFERRED)) { | |
4fab9071 | 802 | inet_csk(sk)->icsk_af_ops->mtu_reduced(sk); |
144d56e9 ED |
803 | __sock_put(sk); |
804 | } | |
46d3ceab ED |
805 | } |
806 | EXPORT_SYMBOL(tcp_release_cb); | |
807 | ||
808 | void __init tcp_tasklet_init(void) | |
809 | { | |
810 | int i; | |
811 | ||
812 | for_each_possible_cpu(i) { | |
813 | struct tsq_tasklet *tsq = &per_cpu(tsq_tasklet, i); | |
814 | ||
815 | INIT_LIST_HEAD(&tsq->head); | |
816 | tasklet_init(&tsq->tasklet, | |
817 | tcp_tasklet_func, | |
818 | (unsigned long)tsq); | |
819 | } | |
820 | } | |
821 | ||
822 | /* | |
823 | * Write buffer destructor automatically called from kfree_skb. | |
8e3bff96 | 824 | * We can't xmit new skbs from this context, as we might already |
46d3ceab ED |
825 | * hold qdisc lock. |
826 | */ | |
d6a4a104 | 827 | void tcp_wfree(struct sk_buff *skb) |
46d3ceab ED |
828 | { |
829 | struct sock *sk = skb->sk; | |
830 | struct tcp_sock *tp = tcp_sk(sk); | |
831 | ||
832 | if (test_and_clear_bit(TSQ_THROTTLED, &tp->tsq_flags) && | |
833 | !test_and_set_bit(TSQ_QUEUED, &tp->tsq_flags)) { | |
834 | unsigned long flags; | |
835 | struct tsq_tasklet *tsq; | |
836 | ||
837 | /* Keep a ref on socket. | |
838 | * This last ref will be released in tcp_tasklet_func() | |
839 | */ | |
840 | atomic_sub(skb->truesize - 1, &sk->sk_wmem_alloc); | |
841 | ||
842 | /* queue this socket to tasklet queue */ | |
843 | local_irq_save(flags); | |
844 | tsq = &__get_cpu_var(tsq_tasklet); | |
845 | list_add(&tp->tsq_node, &tsq->head); | |
846 | tasklet_schedule(&tsq->tasklet); | |
847 | local_irq_restore(flags); | |
848 | } else { | |
849 | sock_wfree(skb); | |
850 | } | |
851 | } | |
852 | ||
1da177e4 LT |
853 | /* This routine actually transmits TCP packets queued in by |
854 | * tcp_do_sendmsg(). This is used by both the initial | |
855 | * transmission and possible later retransmissions. | |
856 | * All SKB's seen here are completely headerless. It is our | |
857 | * job to build the TCP header, and pass the packet down to | |
858 | * IP so it can do the same plus pass the packet off to the | |
859 | * device. | |
860 | * | |
861 | * We are working here with either a clone of the original | |
862 | * SKB, or a fresh unique copy made by the retransmit engine. | |
863 | */ | |
056834d9 IJ |
864 | static int tcp_transmit_skb(struct sock *sk, struct sk_buff *skb, int clone_it, |
865 | gfp_t gfp_mask) | |
1da177e4 | 866 | { |
dfb4b9dc DM |
867 | const struct inet_connection_sock *icsk = inet_csk(sk); |
868 | struct inet_sock *inet; | |
869 | struct tcp_sock *tp; | |
870 | struct tcp_skb_cb *tcb; | |
33ad798c | 871 | struct tcp_out_options opts; |
95c96174 | 872 | unsigned int tcp_options_size, tcp_header_size; |
cfb6eeb4 | 873 | struct tcp_md5sig_key *md5; |
dfb4b9dc | 874 | struct tcphdr *th; |
dfb4b9dc DM |
875 | int err; |
876 | ||
877 | BUG_ON(!skb || !tcp_skb_pcount(skb)); | |
878 | ||
ccdbb6e9 | 879 | if (clone_it) { |
740b0f18 | 880 | skb_mstamp_get(&skb->skb_mstamp); |
ccdbb6e9 | 881 | |
dfb4b9dc DM |
882 | if (unlikely(skb_cloned(skb))) |
883 | skb = pskb_copy(skb, gfp_mask); | |
884 | else | |
885 | skb = skb_clone(skb, gfp_mask); | |
886 | if (unlikely(!skb)) | |
887 | return -ENOBUFS; | |
888 | } | |
1da177e4 | 889 | |
dfb4b9dc DM |
890 | inet = inet_sk(sk); |
891 | tp = tcp_sk(sk); | |
892 | tcb = TCP_SKB_CB(skb); | |
33ad798c | 893 | memset(&opts, 0, sizeof(opts)); |
1da177e4 | 894 | |
4de075e0 | 895 | if (unlikely(tcb->tcp_flags & TCPHDR_SYN)) |
33ad798c AL |
896 | tcp_options_size = tcp_syn_options(sk, skb, &opts, &md5); |
897 | else | |
898 | tcp_options_size = tcp_established_options(sk, skb, &opts, | |
899 | &md5); | |
900 | tcp_header_size = tcp_options_size + sizeof(struct tcphdr); | |
e905a9ed | 901 | |
547669d4 | 902 | if (tcp_packets_in_flight(tp) == 0) |
dfb4b9dc | 903 | tcp_ca_event(sk, CA_EVENT_TX_START); |
547669d4 ED |
904 | |
905 | /* if no packet is in qdisc/device queue, then allow XPS to select | |
906 | * another queue. | |
907 | */ | |
908 | skb->ooo_okay = sk_wmem_alloc_get(sk) == 0; | |
dfb4b9dc | 909 | |
aa8223c7 ACM |
910 | skb_push(skb, tcp_header_size); |
911 | skb_reset_transport_header(skb); | |
46d3ceab ED |
912 | |
913 | skb_orphan(skb); | |
914 | skb->sk = sk; | |
c9eeec26 | 915 | skb->destructor = tcp_wfree; |
b73c3d0e | 916 | skb_set_hash_from_sk(skb, sk); |
46d3ceab | 917 | atomic_add(skb->truesize, &sk->sk_wmem_alloc); |
dfb4b9dc DM |
918 | |
919 | /* Build TCP header and checksum it. */ | |
aa8223c7 | 920 | th = tcp_hdr(skb); |
c720c7e8 ED |
921 | th->source = inet->inet_sport; |
922 | th->dest = inet->inet_dport; | |
dfb4b9dc DM |
923 | th->seq = htonl(tcb->seq); |
924 | th->ack_seq = htonl(tp->rcv_nxt); | |
df7a3b07 | 925 | *(((__be16 *)th) + 6) = htons(((tcp_header_size >> 2) << 12) | |
4de075e0 | 926 | tcb->tcp_flags); |
dfb4b9dc | 927 | |
4de075e0 | 928 | if (unlikely(tcb->tcp_flags & TCPHDR_SYN)) { |
dfb4b9dc DM |
929 | /* RFC1323: The window in SYN & SYN/ACK segments |
930 | * is never scaled. | |
931 | */ | |
600ff0c2 | 932 | th->window = htons(min(tp->rcv_wnd, 65535U)); |
dfb4b9dc DM |
933 | } else { |
934 | th->window = htons(tcp_select_window(sk)); | |
935 | } | |
936 | th->check = 0; | |
937 | th->urg_ptr = 0; | |
1da177e4 | 938 | |
33f5f57e | 939 | /* The urg_mode check is necessary during a below snd_una win probe */ |
7691367d HX |
940 | if (unlikely(tcp_urg_mode(tp) && before(tcb->seq, tp->snd_up))) { |
941 | if (before(tp->snd_up, tcb->seq + 0x10000)) { | |
942 | th->urg_ptr = htons(tp->snd_up - tcb->seq); | |
943 | th->urg = 1; | |
944 | } else if (after(tcb->seq + 0xFFFF, tp->snd_nxt)) { | |
0eae88f3 | 945 | th->urg_ptr = htons(0xFFFF); |
7691367d HX |
946 | th->urg = 1; |
947 | } | |
dfb4b9dc | 948 | } |
1da177e4 | 949 | |
bd0388ae | 950 | tcp_options_write((__be32 *)(th + 1), tp, &opts); |
4de075e0 | 951 | if (likely((tcb->tcp_flags & TCPHDR_SYN) == 0)) |
9e412ba7 | 952 | TCP_ECN_send(sk, skb, tcp_header_size); |
1da177e4 | 953 | |
cfb6eeb4 YH |
954 | #ifdef CONFIG_TCP_MD5SIG |
955 | /* Calculate the MD5 hash, as we have all we need now */ | |
956 | if (md5) { | |
a465419b | 957 | sk_nocaps_add(sk, NETIF_F_GSO_MASK); |
bd0388ae | 958 | tp->af_specific->calc_md5_hash(opts.hash_location, |
49a72dfb | 959 | md5, sk, NULL, skb); |
cfb6eeb4 YH |
960 | } |
961 | #endif | |
962 | ||
bb296246 | 963 | icsk->icsk_af_ops->send_check(sk, skb); |
1da177e4 | 964 | |
4de075e0 | 965 | if (likely(tcb->tcp_flags & TCPHDR_ACK)) |
dfb4b9dc | 966 | tcp_event_ack_sent(sk, tcp_skb_pcount(skb)); |
1da177e4 | 967 | |
dfb4b9dc | 968 | if (skb->len != tcp_header_size) |
cf533ea5 | 969 | tcp_event_data_sent(tp, sk); |
1da177e4 | 970 | |
bd37a088 | 971 | if (after(tcb->end_seq, tp->snd_nxt) || tcb->seq == tcb->end_seq) |
aa2ea058 TH |
972 | TCP_ADD_STATS(sock_net(sk), TCP_MIB_OUTSEGS, |
973 | tcp_skb_pcount(skb)); | |
1da177e4 | 974 | |
7faee5c0 ED |
975 | /* Our usage of tstamp should remain private */ |
976 | skb->tstamp.tv64 = 0; | |
b0270e91 | 977 | err = icsk->icsk_af_ops->queue_xmit(sk, skb, &inet->cork.fl); |
7faee5c0 | 978 | |
83de47cd | 979 | if (likely(err <= 0)) |
dfb4b9dc DM |
980 | return err; |
981 | ||
5ee2c941 | 982 | tcp_enter_cwr(sk); |
dfb4b9dc | 983 | |
b9df3cb8 | 984 | return net_xmit_eval(err); |
1da177e4 LT |
985 | } |
986 | ||
67edfef7 | 987 | /* This routine just queues the buffer for sending. |
1da177e4 LT |
988 | * |
989 | * NOTE: probe0 timer is not checked, do not forget tcp_push_pending_frames, | |
990 | * otherwise socket can stall. | |
991 | */ | |
992 | static void tcp_queue_skb(struct sock *sk, struct sk_buff *skb) | |
993 | { | |
994 | struct tcp_sock *tp = tcp_sk(sk); | |
995 | ||
996 | /* Advance write_seq and place onto the write_queue. */ | |
997 | tp->write_seq = TCP_SKB_CB(skb)->end_seq; | |
998 | skb_header_release(skb); | |
fe067e8a | 999 | tcp_add_write_queue_tail(sk, skb); |
3ab224be HA |
1000 | sk->sk_wmem_queued += skb->truesize; |
1001 | sk_mem_charge(sk, skb->truesize); | |
1da177e4 LT |
1002 | } |
1003 | ||
67edfef7 | 1004 | /* Initialize TSO segments for a packet. */ |
cf533ea5 | 1005 | static void tcp_set_skb_tso_segs(const struct sock *sk, struct sk_buff *skb, |
056834d9 | 1006 | unsigned int mss_now) |
f6302d1d | 1007 | { |
7b7fc97a ED |
1008 | struct skb_shared_info *shinfo = skb_shinfo(skb); |
1009 | ||
c52e2421 ED |
1010 | /* Make sure we own this skb before messing gso_size/gso_segs */ |
1011 | WARN_ON_ONCE(skb_cloned(skb)); | |
1012 | ||
8f26fb1c | 1013 | if (skb->len <= mss_now || skb->ip_summed == CHECKSUM_NONE) { |
f6302d1d DM |
1014 | /* Avoid the costly divide in the normal |
1015 | * non-TSO case. | |
1016 | */ | |
7b7fc97a ED |
1017 | shinfo->gso_segs = 1; |
1018 | shinfo->gso_size = 0; | |
1019 | shinfo->gso_type = 0; | |
f6302d1d | 1020 | } else { |
7b7fc97a ED |
1021 | shinfo->gso_segs = DIV_ROUND_UP(skb->len, mss_now); |
1022 | shinfo->gso_size = mss_now; | |
1023 | shinfo->gso_type = sk->sk_gso_type; | |
1da177e4 LT |
1024 | } |
1025 | } | |
1026 | ||
91fed7a1 | 1027 | /* When a modification to fackets out becomes necessary, we need to check |
68f8353b | 1028 | * skb is counted to fackets_out or not. |
91fed7a1 | 1029 | */ |
cf533ea5 | 1030 | static void tcp_adjust_fackets_out(struct sock *sk, const struct sk_buff *skb, |
91fed7a1 IJ |
1031 | int decr) |
1032 | { | |
a47e5a98 IJ |
1033 | struct tcp_sock *tp = tcp_sk(sk); |
1034 | ||
dc86967b | 1035 | if (!tp->sacked_out || tcp_is_reno(tp)) |
91fed7a1 IJ |
1036 | return; |
1037 | ||
6859d494 | 1038 | if (after(tcp_highest_sack_seq(tp), TCP_SKB_CB(skb)->seq)) |
91fed7a1 | 1039 | tp->fackets_out -= decr; |
91fed7a1 IJ |
1040 | } |
1041 | ||
797108d1 IJ |
1042 | /* Pcount in the middle of the write queue got changed, we need to do various |
1043 | * tweaks to fix counters | |
1044 | */ | |
cf533ea5 | 1045 | static void tcp_adjust_pcount(struct sock *sk, const struct sk_buff *skb, int decr) |
797108d1 IJ |
1046 | { |
1047 | struct tcp_sock *tp = tcp_sk(sk); | |
1048 | ||
1049 | tp->packets_out -= decr; | |
1050 | ||
1051 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED) | |
1052 | tp->sacked_out -= decr; | |
1053 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) | |
1054 | tp->retrans_out -= decr; | |
1055 | if (TCP_SKB_CB(skb)->sacked & TCPCB_LOST) | |
1056 | tp->lost_out -= decr; | |
1057 | ||
1058 | /* Reno case is special. Sigh... */ | |
1059 | if (tcp_is_reno(tp) && decr > 0) | |
1060 | tp->sacked_out -= min_t(u32, tp->sacked_out, decr); | |
1061 | ||
1062 | tcp_adjust_fackets_out(sk, skb, decr); | |
1063 | ||
1064 | if (tp->lost_skb_hint && | |
1065 | before(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(tp->lost_skb_hint)->seq) && | |
52cf3cc8 | 1066 | (tcp_is_fack(tp) || (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED))) |
797108d1 IJ |
1067 | tp->lost_cnt_hint -= decr; |
1068 | ||
1069 | tcp_verify_left_out(tp); | |
1070 | } | |
1071 | ||
490cc7d0 WB |
1072 | static void tcp_fragment_tstamp(struct sk_buff *skb, struct sk_buff *skb2) |
1073 | { | |
1074 | struct skb_shared_info *shinfo = skb_shinfo(skb); | |
1075 | ||
1076 | if (unlikely(shinfo->tx_flags & SKBTX_ANY_TSTAMP) && | |
1077 | !before(shinfo->tskey, TCP_SKB_CB(skb2)->seq)) { | |
1078 | struct skb_shared_info *shinfo2 = skb_shinfo(skb2); | |
1079 | u8 tsflags = shinfo->tx_flags & SKBTX_ANY_TSTAMP; | |
1080 | ||
1081 | shinfo->tx_flags &= ~tsflags; | |
1082 | shinfo2->tx_flags |= tsflags; | |
1083 | swap(shinfo->tskey, shinfo2->tskey); | |
1084 | } | |
1085 | } | |
1086 | ||
1da177e4 LT |
1087 | /* Function to create two new TCP segments. Shrinks the given segment |
1088 | * to the specified size and appends a new segment with the rest of the | |
e905a9ed | 1089 | * packet to the list. This won't be called frequently, I hope. |
1da177e4 LT |
1090 | * Remember, these are still headerless SKBs at this point. |
1091 | */ | |
056834d9 | 1092 | int tcp_fragment(struct sock *sk, struct sk_buff *skb, u32 len, |
6cc55e09 | 1093 | unsigned int mss_now, gfp_t gfp) |
1da177e4 LT |
1094 | { |
1095 | struct tcp_sock *tp = tcp_sk(sk); | |
1096 | struct sk_buff *buff; | |
6475be16 | 1097 | int nsize, old_factor; |
b60b49ea | 1098 | int nlen; |
9ce01461 | 1099 | u8 flags; |
1da177e4 | 1100 | |
2fceec13 IJ |
1101 | if (WARN_ON(len > skb->len)) |
1102 | return -EINVAL; | |
6a438bbe | 1103 | |
1da177e4 LT |
1104 | nsize = skb_headlen(skb) - len; |
1105 | if (nsize < 0) | |
1106 | nsize = 0; | |
1107 | ||
6cc55e09 | 1108 | if (skb_unclone(skb, gfp)) |
1da177e4 LT |
1109 | return -ENOMEM; |
1110 | ||
1111 | /* Get a new skb... force flag on. */ | |
6cc55e09 | 1112 | buff = sk_stream_alloc_skb(sk, nsize, gfp); |
1da177e4 LT |
1113 | if (buff == NULL) |
1114 | return -ENOMEM; /* We'll just try again later. */ | |
ef5cb973 | 1115 | |
3ab224be HA |
1116 | sk->sk_wmem_queued += buff->truesize; |
1117 | sk_mem_charge(sk, buff->truesize); | |
b60b49ea HX |
1118 | nlen = skb->len - len - nsize; |
1119 | buff->truesize += nlen; | |
1120 | skb->truesize -= nlen; | |
1da177e4 LT |
1121 | |
1122 | /* Correct the sequence numbers. */ | |
1123 | TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len; | |
1124 | TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq; | |
1125 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq; | |
1126 | ||
1127 | /* PSH and FIN should only be set in the second packet. */ | |
4de075e0 ED |
1128 | flags = TCP_SKB_CB(skb)->tcp_flags; |
1129 | TCP_SKB_CB(skb)->tcp_flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH); | |
1130 | TCP_SKB_CB(buff)->tcp_flags = flags; | |
e14c3caf | 1131 | TCP_SKB_CB(buff)->sacked = TCP_SKB_CB(skb)->sacked; |
1da177e4 | 1132 | |
84fa7933 | 1133 | if (!skb_shinfo(skb)->nr_frags && skb->ip_summed != CHECKSUM_PARTIAL) { |
1da177e4 | 1134 | /* Copy and checksum data tail into the new buffer. */ |
056834d9 IJ |
1135 | buff->csum = csum_partial_copy_nocheck(skb->data + len, |
1136 | skb_put(buff, nsize), | |
1da177e4 LT |
1137 | nsize, 0); |
1138 | ||
1139 | skb_trim(skb, len); | |
1140 | ||
1141 | skb->csum = csum_block_sub(skb->csum, buff->csum, len); | |
1142 | } else { | |
84fa7933 | 1143 | skb->ip_summed = CHECKSUM_PARTIAL; |
1da177e4 LT |
1144 | skb_split(skb, buff, len); |
1145 | } | |
1146 | ||
1147 | buff->ip_summed = skb->ip_summed; | |
1148 | ||
a61bbcf2 | 1149 | buff->tstamp = skb->tstamp; |
490cc7d0 | 1150 | tcp_fragment_tstamp(skb, buff); |
1da177e4 | 1151 | |
6475be16 DM |
1152 | old_factor = tcp_skb_pcount(skb); |
1153 | ||
1da177e4 | 1154 | /* Fix up tso_factor for both original and new SKB. */ |
846998ae DM |
1155 | tcp_set_skb_tso_segs(sk, skb, mss_now); |
1156 | tcp_set_skb_tso_segs(sk, buff, mss_now); | |
1da177e4 | 1157 | |
6475be16 DM |
1158 | /* If this packet has been sent out already, we must |
1159 | * adjust the various packet counters. | |
1160 | */ | |
cf0b450c | 1161 | if (!before(tp->snd_nxt, TCP_SKB_CB(buff)->end_seq)) { |
6475be16 DM |
1162 | int diff = old_factor - tcp_skb_pcount(skb) - |
1163 | tcp_skb_pcount(buff); | |
1da177e4 | 1164 | |
797108d1 IJ |
1165 | if (diff) |
1166 | tcp_adjust_pcount(sk, skb, diff); | |
1da177e4 LT |
1167 | } |
1168 | ||
1169 | /* Link BUFF into the send queue. */ | |
f44b5271 | 1170 | skb_header_release(buff); |
fe067e8a | 1171 | tcp_insert_write_queue_after(skb, buff, sk); |
1da177e4 LT |
1172 | |
1173 | return 0; | |
1174 | } | |
1175 | ||
1176 | /* This is similar to __pskb_pull_head() (it will go to core/skbuff.c | |
1177 | * eventually). The difference is that pulled data not copied, but | |
1178 | * immediately discarded. | |
1179 | */ | |
f2911969 | 1180 | static void __pskb_trim_head(struct sk_buff *skb, int len) |
1da177e4 | 1181 | { |
7b7fc97a | 1182 | struct skb_shared_info *shinfo; |
1da177e4 LT |
1183 | int i, k, eat; |
1184 | ||
4fa48bf3 ED |
1185 | eat = min_t(int, len, skb_headlen(skb)); |
1186 | if (eat) { | |
1187 | __skb_pull(skb, eat); | |
1188 | len -= eat; | |
1189 | if (!len) | |
1190 | return; | |
1191 | } | |
1da177e4 LT |
1192 | eat = len; |
1193 | k = 0; | |
7b7fc97a ED |
1194 | shinfo = skb_shinfo(skb); |
1195 | for (i = 0; i < shinfo->nr_frags; i++) { | |
1196 | int size = skb_frag_size(&shinfo->frags[i]); | |
9e903e08 ED |
1197 | |
1198 | if (size <= eat) { | |
aff65da0 | 1199 | skb_frag_unref(skb, i); |
9e903e08 | 1200 | eat -= size; |
1da177e4 | 1201 | } else { |
7b7fc97a | 1202 | shinfo->frags[k] = shinfo->frags[i]; |
1da177e4 | 1203 | if (eat) { |
7b7fc97a ED |
1204 | shinfo->frags[k].page_offset += eat; |
1205 | skb_frag_size_sub(&shinfo->frags[k], eat); | |
1da177e4 LT |
1206 | eat = 0; |
1207 | } | |
1208 | k++; | |
1209 | } | |
1210 | } | |
7b7fc97a | 1211 | shinfo->nr_frags = k; |
1da177e4 | 1212 | |
27a884dc | 1213 | skb_reset_tail_pointer(skb); |
1da177e4 LT |
1214 | skb->data_len -= len; |
1215 | skb->len = skb->data_len; | |
1da177e4 LT |
1216 | } |
1217 | ||
67edfef7 | 1218 | /* Remove acked data from a packet in the transmit queue. */ |
1da177e4 LT |
1219 | int tcp_trim_head(struct sock *sk, struct sk_buff *skb, u32 len) |
1220 | { | |
14bbd6a5 | 1221 | if (skb_unclone(skb, GFP_ATOMIC)) |
1da177e4 LT |
1222 | return -ENOMEM; |
1223 | ||
4fa48bf3 | 1224 | __pskb_trim_head(skb, len); |
1da177e4 LT |
1225 | |
1226 | TCP_SKB_CB(skb)->seq += len; | |
84fa7933 | 1227 | skb->ip_summed = CHECKSUM_PARTIAL; |
1da177e4 LT |
1228 | |
1229 | skb->truesize -= len; | |
1230 | sk->sk_wmem_queued -= len; | |
3ab224be | 1231 | sk_mem_uncharge(sk, len); |
1da177e4 LT |
1232 | sock_set_flag(sk, SOCK_QUEUE_SHRUNK); |
1233 | ||
5b35e1e6 | 1234 | /* Any change of skb->len requires recalculation of tso factor. */ |
1da177e4 | 1235 | if (tcp_skb_pcount(skb) > 1) |
5b35e1e6 | 1236 | tcp_set_skb_tso_segs(sk, skb, tcp_skb_mss(skb)); |
1da177e4 LT |
1237 | |
1238 | return 0; | |
1239 | } | |
1240 | ||
1b63edd6 YC |
1241 | /* Calculate MSS not accounting any TCP options. */ |
1242 | static inline int __tcp_mtu_to_mss(struct sock *sk, int pmtu) | |
5d424d5a | 1243 | { |
cf533ea5 ED |
1244 | const struct tcp_sock *tp = tcp_sk(sk); |
1245 | const struct inet_connection_sock *icsk = inet_csk(sk); | |
5d424d5a JH |
1246 | int mss_now; |
1247 | ||
1248 | /* Calculate base mss without TCP options: | |
1249 | It is MMS_S - sizeof(tcphdr) of rfc1122 | |
1250 | */ | |
1251 | mss_now = pmtu - icsk->icsk_af_ops->net_header_len - sizeof(struct tcphdr); | |
1252 | ||
67469601 ED |
1253 | /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */ |
1254 | if (icsk->icsk_af_ops->net_frag_header_len) { | |
1255 | const struct dst_entry *dst = __sk_dst_get(sk); | |
1256 | ||
1257 | if (dst && dst_allfrag(dst)) | |
1258 | mss_now -= icsk->icsk_af_ops->net_frag_header_len; | |
1259 | } | |
1260 | ||
5d424d5a JH |
1261 | /* Clamp it (mss_clamp does not include tcp options) */ |
1262 | if (mss_now > tp->rx_opt.mss_clamp) | |
1263 | mss_now = tp->rx_opt.mss_clamp; | |
1264 | ||
1265 | /* Now subtract optional transport overhead */ | |
1266 | mss_now -= icsk->icsk_ext_hdr_len; | |
1267 | ||
1268 | /* Then reserve room for full set of TCP options and 8 bytes of data */ | |
1269 | if (mss_now < 48) | |
1270 | mss_now = 48; | |
5d424d5a JH |
1271 | return mss_now; |
1272 | } | |
1273 | ||
1b63edd6 YC |
1274 | /* Calculate MSS. Not accounting for SACKs here. */ |
1275 | int tcp_mtu_to_mss(struct sock *sk, int pmtu) | |
1276 | { | |
1277 | /* Subtract TCP options size, not including SACKs */ | |
1278 | return __tcp_mtu_to_mss(sk, pmtu) - | |
1279 | (tcp_sk(sk)->tcp_header_len - sizeof(struct tcphdr)); | |
1280 | } | |
1281 | ||
5d424d5a | 1282 | /* Inverse of above */ |
67469601 | 1283 | int tcp_mss_to_mtu(struct sock *sk, int mss) |
5d424d5a | 1284 | { |
cf533ea5 ED |
1285 | const struct tcp_sock *tp = tcp_sk(sk); |
1286 | const struct inet_connection_sock *icsk = inet_csk(sk); | |
5d424d5a JH |
1287 | int mtu; |
1288 | ||
1289 | mtu = mss + | |
1290 | tp->tcp_header_len + | |
1291 | icsk->icsk_ext_hdr_len + | |
1292 | icsk->icsk_af_ops->net_header_len; | |
1293 | ||
67469601 ED |
1294 | /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */ |
1295 | if (icsk->icsk_af_ops->net_frag_header_len) { | |
1296 | const struct dst_entry *dst = __sk_dst_get(sk); | |
1297 | ||
1298 | if (dst && dst_allfrag(dst)) | |
1299 | mtu += icsk->icsk_af_ops->net_frag_header_len; | |
1300 | } | |
5d424d5a JH |
1301 | return mtu; |
1302 | } | |
1303 | ||
67edfef7 | 1304 | /* MTU probing init per socket */ |
5d424d5a JH |
1305 | void tcp_mtup_init(struct sock *sk) |
1306 | { | |
1307 | struct tcp_sock *tp = tcp_sk(sk); | |
1308 | struct inet_connection_sock *icsk = inet_csk(sk); | |
1309 | ||
1310 | icsk->icsk_mtup.enabled = sysctl_tcp_mtu_probing > 1; | |
1311 | icsk->icsk_mtup.search_high = tp->rx_opt.mss_clamp + sizeof(struct tcphdr) + | |
e905a9ed | 1312 | icsk->icsk_af_ops->net_header_len; |
5d424d5a JH |
1313 | icsk->icsk_mtup.search_low = tcp_mss_to_mtu(sk, sysctl_tcp_base_mss); |
1314 | icsk->icsk_mtup.probe_size = 0; | |
1315 | } | |
4bc2f18b | 1316 | EXPORT_SYMBOL(tcp_mtup_init); |
5d424d5a | 1317 | |
1da177e4 LT |
1318 | /* This function synchronize snd mss to current pmtu/exthdr set. |
1319 | ||
1320 | tp->rx_opt.user_mss is mss set by user by TCP_MAXSEG. It does NOT counts | |
1321 | for TCP options, but includes only bare TCP header. | |
1322 | ||
1323 | tp->rx_opt.mss_clamp is mss negotiated at connection setup. | |
caa20d9a | 1324 | It is minimum of user_mss and mss received with SYN. |
1da177e4 LT |
1325 | It also does not include TCP options. |
1326 | ||
d83d8461 | 1327 | inet_csk(sk)->icsk_pmtu_cookie is last pmtu, seen by this function. |
1da177e4 LT |
1328 | |
1329 | tp->mss_cache is current effective sending mss, including | |
1330 | all tcp options except for SACKs. It is evaluated, | |
1331 | taking into account current pmtu, but never exceeds | |
1332 | tp->rx_opt.mss_clamp. | |
1333 | ||
1334 | NOTE1. rfc1122 clearly states that advertised MSS | |
1335 | DOES NOT include either tcp or ip options. | |
1336 | ||
d83d8461 ACM |
1337 | NOTE2. inet_csk(sk)->icsk_pmtu_cookie and tp->mss_cache |
1338 | are READ ONLY outside this function. --ANK (980731) | |
1da177e4 | 1339 | */ |
1da177e4 LT |
1340 | unsigned int tcp_sync_mss(struct sock *sk, u32 pmtu) |
1341 | { | |
1342 | struct tcp_sock *tp = tcp_sk(sk); | |
d83d8461 | 1343 | struct inet_connection_sock *icsk = inet_csk(sk); |
5d424d5a | 1344 | int mss_now; |
1da177e4 | 1345 | |
5d424d5a JH |
1346 | if (icsk->icsk_mtup.search_high > pmtu) |
1347 | icsk->icsk_mtup.search_high = pmtu; | |
1da177e4 | 1348 | |
5d424d5a | 1349 | mss_now = tcp_mtu_to_mss(sk, pmtu); |
409d22b4 | 1350 | mss_now = tcp_bound_to_half_wnd(tp, mss_now); |
1da177e4 LT |
1351 | |
1352 | /* And store cached results */ | |
d83d8461 | 1353 | icsk->icsk_pmtu_cookie = pmtu; |
5d424d5a JH |
1354 | if (icsk->icsk_mtup.enabled) |
1355 | mss_now = min(mss_now, tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_low)); | |
c1b4a7e6 | 1356 | tp->mss_cache = mss_now; |
1da177e4 LT |
1357 | |
1358 | return mss_now; | |
1359 | } | |
4bc2f18b | 1360 | EXPORT_SYMBOL(tcp_sync_mss); |
1da177e4 LT |
1361 | |
1362 | /* Compute the current effective MSS, taking SACKs and IP options, | |
1363 | * and even PMTU discovery events into account. | |
1da177e4 | 1364 | */ |
0c54b85f | 1365 | unsigned int tcp_current_mss(struct sock *sk) |
1da177e4 | 1366 | { |
cf533ea5 ED |
1367 | const struct tcp_sock *tp = tcp_sk(sk); |
1368 | const struct dst_entry *dst = __sk_dst_get(sk); | |
c1b4a7e6 | 1369 | u32 mss_now; |
95c96174 | 1370 | unsigned int header_len; |
33ad798c AL |
1371 | struct tcp_out_options opts; |
1372 | struct tcp_md5sig_key *md5; | |
c1b4a7e6 DM |
1373 | |
1374 | mss_now = tp->mss_cache; | |
1375 | ||
1da177e4 LT |
1376 | if (dst) { |
1377 | u32 mtu = dst_mtu(dst); | |
d83d8461 | 1378 | if (mtu != inet_csk(sk)->icsk_pmtu_cookie) |
1da177e4 LT |
1379 | mss_now = tcp_sync_mss(sk, mtu); |
1380 | } | |
1381 | ||
33ad798c AL |
1382 | header_len = tcp_established_options(sk, NULL, &opts, &md5) + |
1383 | sizeof(struct tcphdr); | |
1384 | /* The mss_cache is sized based on tp->tcp_header_len, which assumes | |
1385 | * some common options. If this is an odd packet (because we have SACK | |
1386 | * blocks etc) then our calculated header_len will be different, and | |
1387 | * we have to adjust mss_now correspondingly */ | |
1388 | if (header_len != tp->tcp_header_len) { | |
1389 | int delta = (int) header_len - tp->tcp_header_len; | |
1390 | mss_now -= delta; | |
1391 | } | |
cfb6eeb4 | 1392 | |
1da177e4 LT |
1393 | return mss_now; |
1394 | } | |
1395 | ||
86fd14ad WP |
1396 | /* RFC2861, slow part. Adjust cwnd, after it was not full during one rto. |
1397 | * As additional protections, we do not touch cwnd in retransmission phases, | |
1398 | * and if application hit its sndbuf limit recently. | |
1399 | */ | |
1400 | static void tcp_cwnd_application_limited(struct sock *sk) | |
1401 | { | |
1402 | struct tcp_sock *tp = tcp_sk(sk); | |
1403 | ||
1404 | if (inet_csk(sk)->icsk_ca_state == TCP_CA_Open && | |
1405 | sk->sk_socket && !test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) { | |
1406 | /* Limited by application or receiver window. */ | |
1407 | u32 init_win = tcp_init_cwnd(tp, __sk_dst_get(sk)); | |
1408 | u32 win_used = max(tp->snd_cwnd_used, init_win); | |
1409 | if (win_used < tp->snd_cwnd) { | |
1410 | tp->snd_ssthresh = tcp_current_ssthresh(sk); | |
1411 | tp->snd_cwnd = (tp->snd_cwnd + win_used) >> 1; | |
1412 | } | |
1413 | tp->snd_cwnd_used = 0; | |
1414 | } | |
1415 | tp->snd_cwnd_stamp = tcp_time_stamp; | |
1416 | } | |
1417 | ||
ca8a2263 | 1418 | static void tcp_cwnd_validate(struct sock *sk, bool is_cwnd_limited) |
a762a980 | 1419 | { |
9e412ba7 | 1420 | struct tcp_sock *tp = tcp_sk(sk); |
a762a980 | 1421 | |
ca8a2263 NC |
1422 | /* Track the maximum number of outstanding packets in each |
1423 | * window, and remember whether we were cwnd-limited then. | |
1424 | */ | |
1425 | if (!before(tp->snd_una, tp->max_packets_seq) || | |
1426 | tp->packets_out > tp->max_packets_out) { | |
1427 | tp->max_packets_out = tp->packets_out; | |
1428 | tp->max_packets_seq = tp->snd_nxt; | |
1429 | tp->is_cwnd_limited = is_cwnd_limited; | |
1430 | } | |
e114a710 | 1431 | |
24901551 | 1432 | if (tcp_is_cwnd_limited(sk)) { |
a762a980 DM |
1433 | /* Network is feed fully. */ |
1434 | tp->snd_cwnd_used = 0; | |
1435 | tp->snd_cwnd_stamp = tcp_time_stamp; | |
1436 | } else { | |
1437 | /* Network starves. */ | |
1438 | if (tp->packets_out > tp->snd_cwnd_used) | |
1439 | tp->snd_cwnd_used = tp->packets_out; | |
1440 | ||
15d33c07 DM |
1441 | if (sysctl_tcp_slow_start_after_idle && |
1442 | (s32)(tcp_time_stamp - tp->snd_cwnd_stamp) >= inet_csk(sk)->icsk_rto) | |
a762a980 DM |
1443 | tcp_cwnd_application_limited(sk); |
1444 | } | |
1445 | } | |
1446 | ||
d4589926 ED |
1447 | /* Minshall's variant of the Nagle send check. */ |
1448 | static bool tcp_minshall_check(const struct tcp_sock *tp) | |
1449 | { | |
1450 | return after(tp->snd_sml, tp->snd_una) && | |
1451 | !after(tp->snd_sml, tp->snd_nxt); | |
1452 | } | |
1453 | ||
1454 | /* Update snd_sml if this skb is under mss | |
1455 | * Note that a TSO packet might end with a sub-mss segment | |
1456 | * The test is really : | |
1457 | * if ((skb->len % mss) != 0) | |
1458 | * tp->snd_sml = TCP_SKB_CB(skb)->end_seq; | |
1459 | * But we can avoid doing the divide again given we already have | |
1460 | * skb_pcount = skb->len / mss_now | |
0e3a4803 | 1461 | */ |
d4589926 ED |
1462 | static void tcp_minshall_update(struct tcp_sock *tp, unsigned int mss_now, |
1463 | const struct sk_buff *skb) | |
1464 | { | |
1465 | if (skb->len < tcp_skb_pcount(skb) * mss_now) | |
1466 | tp->snd_sml = TCP_SKB_CB(skb)->end_seq; | |
1467 | } | |
1468 | ||
1469 | /* Return false, if packet can be sent now without violation Nagle's rules: | |
1470 | * 1. It is full sized. (provided by caller in %partial bool) | |
1471 | * 2. Or it contains FIN. (already checked by caller) | |
1472 | * 3. Or TCP_CORK is not set, and TCP_NODELAY is set. | |
1473 | * 4. Or TCP_CORK is not set, and all sent packets are ACKed. | |
1474 | * With Minshall's modification: all sent small packets are ACKed. | |
1475 | */ | |
1476 | static bool tcp_nagle_check(bool partial, const struct tcp_sock *tp, | |
cc93fc51 | 1477 | int nonagle) |
d4589926 ED |
1478 | { |
1479 | return partial && | |
1480 | ((nonagle & TCP_NAGLE_CORK) || | |
1481 | (!nonagle && tp->packets_out && tcp_minshall_check(tp))); | |
1482 | } | |
1483 | /* Returns the portion of skb which can be sent right away */ | |
1484 | static unsigned int tcp_mss_split_point(const struct sock *sk, | |
1485 | const struct sk_buff *skb, | |
1486 | unsigned int mss_now, | |
1487 | unsigned int max_segs, | |
1488 | int nonagle) | |
c1b4a7e6 | 1489 | { |
cf533ea5 | 1490 | const struct tcp_sock *tp = tcp_sk(sk); |
d4589926 | 1491 | u32 partial, needed, window, max_len; |
c1b4a7e6 | 1492 | |
90840def | 1493 | window = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq; |
1485348d | 1494 | max_len = mss_now * max_segs; |
0e3a4803 | 1495 | |
1485348d BH |
1496 | if (likely(max_len <= window && skb != tcp_write_queue_tail(sk))) |
1497 | return max_len; | |
0e3a4803 | 1498 | |
5ea3a748 IJ |
1499 | needed = min(skb->len, window); |
1500 | ||
1485348d BH |
1501 | if (max_len <= needed) |
1502 | return max_len; | |
0e3a4803 | 1503 | |
d4589926 ED |
1504 | partial = needed % mss_now; |
1505 | /* If last segment is not a full MSS, check if Nagle rules allow us | |
1506 | * to include this last segment in this skb. | |
1507 | * Otherwise, we'll split the skb at last MSS boundary | |
1508 | */ | |
cc93fc51 | 1509 | if (tcp_nagle_check(partial != 0, tp, nonagle)) |
d4589926 ED |
1510 | return needed - partial; |
1511 | ||
1512 | return needed; | |
c1b4a7e6 DM |
1513 | } |
1514 | ||
1515 | /* Can at least one segment of SKB be sent right now, according to the | |
1516 | * congestion window rules? If so, return how many segments are allowed. | |
1517 | */ | |
cf533ea5 ED |
1518 | static inline unsigned int tcp_cwnd_test(const struct tcp_sock *tp, |
1519 | const struct sk_buff *skb) | |
c1b4a7e6 DM |
1520 | { |
1521 | u32 in_flight, cwnd; | |
1522 | ||
1523 | /* Don't be strict about the congestion window for the final FIN. */ | |
4de075e0 ED |
1524 | if ((TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN) && |
1525 | tcp_skb_pcount(skb) == 1) | |
c1b4a7e6 DM |
1526 | return 1; |
1527 | ||
1528 | in_flight = tcp_packets_in_flight(tp); | |
1529 | cwnd = tp->snd_cwnd; | |
1530 | if (in_flight < cwnd) | |
1531 | return (cwnd - in_flight); | |
1532 | ||
1533 | return 0; | |
1534 | } | |
1535 | ||
b595076a | 1536 | /* Initialize TSO state of a skb. |
67edfef7 | 1537 | * This must be invoked the first time we consider transmitting |
c1b4a7e6 DM |
1538 | * SKB onto the wire. |
1539 | */ | |
cf533ea5 | 1540 | static int tcp_init_tso_segs(const struct sock *sk, struct sk_buff *skb, |
056834d9 | 1541 | unsigned int mss_now) |
c1b4a7e6 DM |
1542 | { |
1543 | int tso_segs = tcp_skb_pcount(skb); | |
1544 | ||
f8269a49 | 1545 | if (!tso_segs || (tso_segs > 1 && tcp_skb_mss(skb) != mss_now)) { |
846998ae | 1546 | tcp_set_skb_tso_segs(sk, skb, mss_now); |
c1b4a7e6 DM |
1547 | tso_segs = tcp_skb_pcount(skb); |
1548 | } | |
1549 | return tso_segs; | |
1550 | } | |
1551 | ||
c1b4a7e6 | 1552 | |
a2a385d6 | 1553 | /* Return true if the Nagle test allows this packet to be |
c1b4a7e6 DM |
1554 | * sent now. |
1555 | */ | |
a2a385d6 ED |
1556 | static inline bool tcp_nagle_test(const struct tcp_sock *tp, const struct sk_buff *skb, |
1557 | unsigned int cur_mss, int nonagle) | |
c1b4a7e6 DM |
1558 | { |
1559 | /* Nagle rule does not apply to frames, which sit in the middle of the | |
1560 | * write_queue (they have no chances to get new data). | |
1561 | * | |
1562 | * This is implemented in the callers, where they modify the 'nonagle' | |
1563 | * argument based upon the location of SKB in the send queue. | |
1564 | */ | |
1565 | if (nonagle & TCP_NAGLE_PUSH) | |
a2a385d6 | 1566 | return true; |
c1b4a7e6 | 1567 | |
9b44190d YC |
1568 | /* Don't use the nagle rule for urgent data (or for the final FIN). */ |
1569 | if (tcp_urg_mode(tp) || (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)) | |
a2a385d6 | 1570 | return true; |
c1b4a7e6 | 1571 | |
cc93fc51 | 1572 | if (!tcp_nagle_check(skb->len < cur_mss, tp, nonagle)) |
a2a385d6 | 1573 | return true; |
c1b4a7e6 | 1574 | |
a2a385d6 | 1575 | return false; |
c1b4a7e6 DM |
1576 | } |
1577 | ||
1578 | /* Does at least the first segment of SKB fit into the send window? */ | |
a2a385d6 ED |
1579 | static bool tcp_snd_wnd_test(const struct tcp_sock *tp, |
1580 | const struct sk_buff *skb, | |
1581 | unsigned int cur_mss) | |
c1b4a7e6 DM |
1582 | { |
1583 | u32 end_seq = TCP_SKB_CB(skb)->end_seq; | |
1584 | ||
1585 | if (skb->len > cur_mss) | |
1586 | end_seq = TCP_SKB_CB(skb)->seq + cur_mss; | |
1587 | ||
90840def | 1588 | return !after(end_seq, tcp_wnd_end(tp)); |
c1b4a7e6 DM |
1589 | } |
1590 | ||
fe067e8a | 1591 | /* This checks if the data bearing packet SKB (usually tcp_send_head(sk)) |
c1b4a7e6 DM |
1592 | * should be put on the wire right now. If so, it returns the number of |
1593 | * packets allowed by the congestion window. | |
1594 | */ | |
cf533ea5 | 1595 | static unsigned int tcp_snd_test(const struct sock *sk, struct sk_buff *skb, |
c1b4a7e6 DM |
1596 | unsigned int cur_mss, int nonagle) |
1597 | { | |
cf533ea5 | 1598 | const struct tcp_sock *tp = tcp_sk(sk); |
c1b4a7e6 DM |
1599 | unsigned int cwnd_quota; |
1600 | ||
846998ae | 1601 | tcp_init_tso_segs(sk, skb, cur_mss); |
c1b4a7e6 DM |
1602 | |
1603 | if (!tcp_nagle_test(tp, skb, cur_mss, nonagle)) | |
1604 | return 0; | |
1605 | ||
1606 | cwnd_quota = tcp_cwnd_test(tp, skb); | |
056834d9 | 1607 | if (cwnd_quota && !tcp_snd_wnd_test(tp, skb, cur_mss)) |
c1b4a7e6 DM |
1608 | cwnd_quota = 0; |
1609 | ||
1610 | return cwnd_quota; | |
1611 | } | |
1612 | ||
67edfef7 | 1613 | /* Test if sending is allowed right now. */ |
a2a385d6 | 1614 | bool tcp_may_send_now(struct sock *sk) |
c1b4a7e6 | 1615 | { |
cf533ea5 | 1616 | const struct tcp_sock *tp = tcp_sk(sk); |
fe067e8a | 1617 | struct sk_buff *skb = tcp_send_head(sk); |
c1b4a7e6 | 1618 | |
a02cec21 | 1619 | return skb && |
0c54b85f | 1620 | tcp_snd_test(sk, skb, tcp_current_mss(sk), |
c1b4a7e6 | 1621 | (tcp_skb_is_last(sk, skb) ? |
a02cec21 | 1622 | tp->nonagle : TCP_NAGLE_PUSH)); |
c1b4a7e6 DM |
1623 | } |
1624 | ||
1625 | /* Trim TSO SKB to LEN bytes, put the remaining data into a new packet | |
1626 | * which is put after SKB on the list. It is very much like | |
1627 | * tcp_fragment() except that it may make several kinds of assumptions | |
1628 | * in order to speed up the splitting operation. In particular, we | |
1629 | * know that all the data is in scatter-gather pages, and that the | |
1630 | * packet has never been sent out before (and thus is not cloned). | |
1631 | */ | |
056834d9 | 1632 | static int tso_fragment(struct sock *sk, struct sk_buff *skb, unsigned int len, |
c4ead4c5 | 1633 | unsigned int mss_now, gfp_t gfp) |
c1b4a7e6 DM |
1634 | { |
1635 | struct sk_buff *buff; | |
1636 | int nlen = skb->len - len; | |
9ce01461 | 1637 | u8 flags; |
c1b4a7e6 DM |
1638 | |
1639 | /* All of a TSO frame must be composed of paged data. */ | |
c8ac3774 | 1640 | if (skb->len != skb->data_len) |
6cc55e09 | 1641 | return tcp_fragment(sk, skb, len, mss_now, gfp); |
c1b4a7e6 | 1642 | |
c4ead4c5 | 1643 | buff = sk_stream_alloc_skb(sk, 0, gfp); |
c1b4a7e6 DM |
1644 | if (unlikely(buff == NULL)) |
1645 | return -ENOMEM; | |
1646 | ||
3ab224be HA |
1647 | sk->sk_wmem_queued += buff->truesize; |
1648 | sk_mem_charge(sk, buff->truesize); | |
b60b49ea | 1649 | buff->truesize += nlen; |
c1b4a7e6 DM |
1650 | skb->truesize -= nlen; |
1651 | ||
1652 | /* Correct the sequence numbers. */ | |
1653 | TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len; | |
1654 | TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq; | |
1655 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq; | |
1656 | ||
1657 | /* PSH and FIN should only be set in the second packet. */ | |
4de075e0 ED |
1658 | flags = TCP_SKB_CB(skb)->tcp_flags; |
1659 | TCP_SKB_CB(skb)->tcp_flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH); | |
1660 | TCP_SKB_CB(buff)->tcp_flags = flags; | |
c1b4a7e6 DM |
1661 | |
1662 | /* This packet was never sent out yet, so no SACK bits. */ | |
1663 | TCP_SKB_CB(buff)->sacked = 0; | |
1664 | ||
84fa7933 | 1665 | buff->ip_summed = skb->ip_summed = CHECKSUM_PARTIAL; |
c1b4a7e6 | 1666 | skb_split(skb, buff, len); |
490cc7d0 | 1667 | tcp_fragment_tstamp(skb, buff); |
c1b4a7e6 DM |
1668 | |
1669 | /* Fix up tso_factor for both original and new SKB. */ | |
846998ae DM |
1670 | tcp_set_skb_tso_segs(sk, skb, mss_now); |
1671 | tcp_set_skb_tso_segs(sk, buff, mss_now); | |
c1b4a7e6 DM |
1672 | |
1673 | /* Link BUFF into the send queue. */ | |
1674 | skb_header_release(buff); | |
fe067e8a | 1675 | tcp_insert_write_queue_after(skb, buff, sk); |
c1b4a7e6 DM |
1676 | |
1677 | return 0; | |
1678 | } | |
1679 | ||
1680 | /* Try to defer sending, if possible, in order to minimize the amount | |
1681 | * of TSO splitting we do. View it as a kind of TSO Nagle test. | |
1682 | * | |
1683 | * This algorithm is from John Heffner. | |
1684 | */ | |
ca8a2263 NC |
1685 | static bool tcp_tso_should_defer(struct sock *sk, struct sk_buff *skb, |
1686 | bool *is_cwnd_limited) | |
c1b4a7e6 | 1687 | { |
9e412ba7 | 1688 | struct tcp_sock *tp = tcp_sk(sk); |
6687e988 | 1689 | const struct inet_connection_sock *icsk = inet_csk(sk); |
c1b4a7e6 | 1690 | u32 send_win, cong_win, limit, in_flight; |
ad9f4f50 | 1691 | int win_divisor; |
c1b4a7e6 | 1692 | |
4de075e0 | 1693 | if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN) |
ae8064ac | 1694 | goto send_now; |
c1b4a7e6 | 1695 | |
6687e988 | 1696 | if (icsk->icsk_ca_state != TCP_CA_Open) |
ae8064ac JH |
1697 | goto send_now; |
1698 | ||
1699 | /* Defer for less than two clock ticks. */ | |
bd515c3e | 1700 | if (tp->tso_deferred && |
a2acde07 | 1701 | (((u32)jiffies << 1) >> 1) - (tp->tso_deferred >> 1) > 1) |
ae8064ac | 1702 | goto send_now; |
908a75c1 | 1703 | |
c1b4a7e6 DM |
1704 | in_flight = tcp_packets_in_flight(tp); |
1705 | ||
056834d9 | 1706 | BUG_ON(tcp_skb_pcount(skb) <= 1 || (tp->snd_cwnd <= in_flight)); |
c1b4a7e6 | 1707 | |
90840def | 1708 | send_win = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq; |
c1b4a7e6 DM |
1709 | |
1710 | /* From in_flight test above, we know that cwnd > in_flight. */ | |
1711 | cong_win = (tp->snd_cwnd - in_flight) * tp->mss_cache; | |
1712 | ||
1713 | limit = min(send_win, cong_win); | |
1714 | ||
ba244fe9 | 1715 | /* If a full-sized TSO skb can be sent, do it. */ |
1485348d | 1716 | if (limit >= min_t(unsigned int, sk->sk_gso_max_size, |
95bd09eb | 1717 | tp->xmit_size_goal_segs * tp->mss_cache)) |
ae8064ac | 1718 | goto send_now; |
ba244fe9 | 1719 | |
62ad2761 IJ |
1720 | /* Middle in queue won't get any more data, full sendable already? */ |
1721 | if ((skb != tcp_write_queue_tail(sk)) && (limit >= skb->len)) | |
1722 | goto send_now; | |
1723 | ||
ad9f4f50 ED |
1724 | win_divisor = ACCESS_ONCE(sysctl_tcp_tso_win_divisor); |
1725 | if (win_divisor) { | |
c1b4a7e6 DM |
1726 | u32 chunk = min(tp->snd_wnd, tp->snd_cwnd * tp->mss_cache); |
1727 | ||
1728 | /* If at least some fraction of a window is available, | |
1729 | * just use it. | |
1730 | */ | |
ad9f4f50 | 1731 | chunk /= win_divisor; |
c1b4a7e6 | 1732 | if (limit >= chunk) |
ae8064ac | 1733 | goto send_now; |
c1b4a7e6 DM |
1734 | } else { |
1735 | /* Different approach, try not to defer past a single | |
1736 | * ACK. Receiver should ACK every other full sized | |
1737 | * frame, so if we have space for more than 3 frames | |
1738 | * then send now. | |
1739 | */ | |
6b5a5c0d | 1740 | if (limit > tcp_max_tso_deferred_mss(tp) * tp->mss_cache) |
ae8064ac | 1741 | goto send_now; |
c1b4a7e6 DM |
1742 | } |
1743 | ||
f4541d60 ED |
1744 | /* Ok, it looks like it is advisable to defer. |
1745 | * Do not rearm the timer if already set to not break TCP ACK clocking. | |
1746 | */ | |
1747 | if (!tp->tso_deferred) | |
1748 | tp->tso_deferred = 1 | (jiffies << 1); | |
ae8064ac | 1749 | |
ca8a2263 NC |
1750 | if (cong_win < send_win && cong_win < skb->len) |
1751 | *is_cwnd_limited = true; | |
1752 | ||
a2a385d6 | 1753 | return true; |
ae8064ac JH |
1754 | |
1755 | send_now: | |
1756 | tp->tso_deferred = 0; | |
a2a385d6 | 1757 | return false; |
c1b4a7e6 DM |
1758 | } |
1759 | ||
5d424d5a | 1760 | /* Create a new MTU probe if we are ready. |
67edfef7 AK |
1761 | * MTU probe is regularly attempting to increase the path MTU by |
1762 | * deliberately sending larger packets. This discovers routing | |
1763 | * changes resulting in larger path MTUs. | |
1764 | * | |
5d424d5a JH |
1765 | * Returns 0 if we should wait to probe (no cwnd available), |
1766 | * 1 if a probe was sent, | |
056834d9 IJ |
1767 | * -1 otherwise |
1768 | */ | |
5d424d5a JH |
1769 | static int tcp_mtu_probe(struct sock *sk) |
1770 | { | |
1771 | struct tcp_sock *tp = tcp_sk(sk); | |
1772 | struct inet_connection_sock *icsk = inet_csk(sk); | |
1773 | struct sk_buff *skb, *nskb, *next; | |
1774 | int len; | |
1775 | int probe_size; | |
91cc17c0 | 1776 | int size_needed; |
5d424d5a JH |
1777 | int copy; |
1778 | int mss_now; | |
1779 | ||
1780 | /* Not currently probing/verifying, | |
1781 | * not in recovery, | |
1782 | * have enough cwnd, and | |
1783 | * not SACKing (the variable headers throw things off) */ | |
1784 | if (!icsk->icsk_mtup.enabled || | |
1785 | icsk->icsk_mtup.probe_size || | |
1786 | inet_csk(sk)->icsk_ca_state != TCP_CA_Open || | |
1787 | tp->snd_cwnd < 11 || | |
cabeccbd | 1788 | tp->rx_opt.num_sacks || tp->rx_opt.dsack) |
5d424d5a JH |
1789 | return -1; |
1790 | ||
1791 | /* Very simple search strategy: just double the MSS. */ | |
0c54b85f | 1792 | mss_now = tcp_current_mss(sk); |
056834d9 | 1793 | probe_size = 2 * tp->mss_cache; |
91cc17c0 | 1794 | size_needed = probe_size + (tp->reordering + 1) * tp->mss_cache; |
5d424d5a JH |
1795 | if (probe_size > tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_high)) { |
1796 | /* TODO: set timer for probe_converge_event */ | |
1797 | return -1; | |
1798 | } | |
1799 | ||
1800 | /* Have enough data in the send queue to probe? */ | |
7f9c33e5 | 1801 | if (tp->write_seq - tp->snd_nxt < size_needed) |
5d424d5a JH |
1802 | return -1; |
1803 | ||
91cc17c0 IJ |
1804 | if (tp->snd_wnd < size_needed) |
1805 | return -1; | |
90840def | 1806 | if (after(tp->snd_nxt + size_needed, tcp_wnd_end(tp))) |
91cc17c0 | 1807 | return 0; |
5d424d5a | 1808 | |
d67c58e9 IJ |
1809 | /* Do we need to wait to drain cwnd? With none in flight, don't stall */ |
1810 | if (tcp_packets_in_flight(tp) + 2 > tp->snd_cwnd) { | |
1811 | if (!tcp_packets_in_flight(tp)) | |
5d424d5a JH |
1812 | return -1; |
1813 | else | |
1814 | return 0; | |
1815 | } | |
1816 | ||
1817 | /* We're allowed to probe. Build it now. */ | |
1818 | if ((nskb = sk_stream_alloc_skb(sk, probe_size, GFP_ATOMIC)) == NULL) | |
1819 | return -1; | |
3ab224be HA |
1820 | sk->sk_wmem_queued += nskb->truesize; |
1821 | sk_mem_charge(sk, nskb->truesize); | |
5d424d5a | 1822 | |
fe067e8a | 1823 | skb = tcp_send_head(sk); |
5d424d5a JH |
1824 | |
1825 | TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(skb)->seq; | |
1826 | TCP_SKB_CB(nskb)->end_seq = TCP_SKB_CB(skb)->seq + probe_size; | |
4de075e0 | 1827 | TCP_SKB_CB(nskb)->tcp_flags = TCPHDR_ACK; |
5d424d5a JH |
1828 | TCP_SKB_CB(nskb)->sacked = 0; |
1829 | nskb->csum = 0; | |
84fa7933 | 1830 | nskb->ip_summed = skb->ip_summed; |
5d424d5a | 1831 | |
50c4817e IJ |
1832 | tcp_insert_write_queue_before(nskb, skb, sk); |
1833 | ||
5d424d5a | 1834 | len = 0; |
234b6860 | 1835 | tcp_for_write_queue_from_safe(skb, next, sk) { |
5d424d5a JH |
1836 | copy = min_t(int, skb->len, probe_size - len); |
1837 | if (nskb->ip_summed) | |
1838 | skb_copy_bits(skb, 0, skb_put(nskb, copy), copy); | |
1839 | else | |
1840 | nskb->csum = skb_copy_and_csum_bits(skb, 0, | |
056834d9 IJ |
1841 | skb_put(nskb, copy), |
1842 | copy, nskb->csum); | |
5d424d5a JH |
1843 | |
1844 | if (skb->len <= copy) { | |
1845 | /* We've eaten all the data from this skb. | |
1846 | * Throw it away. */ | |
4de075e0 | 1847 | TCP_SKB_CB(nskb)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags; |
fe067e8a | 1848 | tcp_unlink_write_queue(skb, sk); |
3ab224be | 1849 | sk_wmem_free_skb(sk, skb); |
5d424d5a | 1850 | } else { |
4de075e0 | 1851 | TCP_SKB_CB(nskb)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags & |
a3433f35 | 1852 | ~(TCPHDR_FIN|TCPHDR_PSH); |
5d424d5a JH |
1853 | if (!skb_shinfo(skb)->nr_frags) { |
1854 | skb_pull(skb, copy); | |
84fa7933 | 1855 | if (skb->ip_summed != CHECKSUM_PARTIAL) |
056834d9 IJ |
1856 | skb->csum = csum_partial(skb->data, |
1857 | skb->len, 0); | |
5d424d5a JH |
1858 | } else { |
1859 | __pskb_trim_head(skb, copy); | |
1860 | tcp_set_skb_tso_segs(sk, skb, mss_now); | |
1861 | } | |
1862 | TCP_SKB_CB(skb)->seq += copy; | |
1863 | } | |
1864 | ||
1865 | len += copy; | |
234b6860 IJ |
1866 | |
1867 | if (len >= probe_size) | |
1868 | break; | |
5d424d5a JH |
1869 | } |
1870 | tcp_init_tso_segs(sk, nskb, nskb->len); | |
1871 | ||
1872 | /* We're ready to send. If this fails, the probe will | |
7faee5c0 ED |
1873 | * be resegmented into mss-sized pieces by tcp_write_xmit(). |
1874 | */ | |
5d424d5a JH |
1875 | if (!tcp_transmit_skb(sk, nskb, 1, GFP_ATOMIC)) { |
1876 | /* Decrement cwnd here because we are sending | |
056834d9 | 1877 | * effectively two packets. */ |
5d424d5a | 1878 | tp->snd_cwnd--; |
66f5fe62 | 1879 | tcp_event_new_data_sent(sk, nskb); |
5d424d5a JH |
1880 | |
1881 | icsk->icsk_mtup.probe_size = tcp_mss_to_mtu(sk, nskb->len); | |
0e7b1368 JH |
1882 | tp->mtu_probe.probe_seq_start = TCP_SKB_CB(nskb)->seq; |
1883 | tp->mtu_probe.probe_seq_end = TCP_SKB_CB(nskb)->end_seq; | |
5d424d5a JH |
1884 | |
1885 | return 1; | |
1886 | } | |
1887 | ||
1888 | return -1; | |
1889 | } | |
1890 | ||
1da177e4 LT |
1891 | /* This routine writes packets to the network. It advances the |
1892 | * send_head. This happens as incoming acks open up the remote | |
1893 | * window for us. | |
1894 | * | |
f8269a49 IJ |
1895 | * LARGESEND note: !tcp_urg_mode is overkill, only frames between |
1896 | * snd_up-64k-mss .. snd_up cannot be large. However, taking into | |
1897 | * account rare use of URG, this is not a big flaw. | |
1898 | * | |
6ba8a3b1 ND |
1899 | * Send at most one packet when push_one > 0. Temporarily ignore |
1900 | * cwnd limit to force at most one packet out when push_one == 2. | |
1901 | ||
a2a385d6 ED |
1902 | * Returns true, if no segments are in flight and we have queued segments, |
1903 | * but cannot send anything now because of SWS or another problem. | |
1da177e4 | 1904 | */ |
a2a385d6 ED |
1905 | static bool tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle, |
1906 | int push_one, gfp_t gfp) | |
1da177e4 LT |
1907 | { |
1908 | struct tcp_sock *tp = tcp_sk(sk); | |
92df7b51 | 1909 | struct sk_buff *skb; |
c1b4a7e6 DM |
1910 | unsigned int tso_segs, sent_pkts; |
1911 | int cwnd_quota; | |
5d424d5a | 1912 | int result; |
ca8a2263 | 1913 | bool is_cwnd_limited = false; |
1da177e4 | 1914 | |
92df7b51 | 1915 | sent_pkts = 0; |
5d424d5a | 1916 | |
d5dd9175 IJ |
1917 | if (!push_one) { |
1918 | /* Do MTU probing. */ | |
1919 | result = tcp_mtu_probe(sk); | |
1920 | if (!result) { | |
a2a385d6 | 1921 | return false; |
d5dd9175 IJ |
1922 | } else if (result > 0) { |
1923 | sent_pkts = 1; | |
1924 | } | |
5d424d5a JH |
1925 | } |
1926 | ||
fe067e8a | 1927 | while ((skb = tcp_send_head(sk))) { |
c8ac3774 HX |
1928 | unsigned int limit; |
1929 | ||
b68e9f85 | 1930 | tso_segs = tcp_init_tso_segs(sk, skb, mss_now); |
c1b4a7e6 | 1931 | BUG_ON(!tso_segs); |
aa93466b | 1932 | |
9d186cac | 1933 | if (unlikely(tp->repair) && tp->repair_queue == TCP_SEND_QUEUE) { |
7faee5c0 ED |
1934 | /* "skb_mstamp" is used as a start point for the retransmit timer */ |
1935 | skb_mstamp_get(&skb->skb_mstamp); | |
ec342325 | 1936 | goto repair; /* Skip network transmission */ |
9d186cac | 1937 | } |
ec342325 | 1938 | |
b68e9f85 | 1939 | cwnd_quota = tcp_cwnd_test(tp, skb); |
6ba8a3b1 | 1940 | if (!cwnd_quota) { |
ca8a2263 | 1941 | is_cwnd_limited = true; |
6ba8a3b1 ND |
1942 | if (push_one == 2) |
1943 | /* Force out a loss probe pkt. */ | |
1944 | cwnd_quota = 1; | |
1945 | else | |
1946 | break; | |
1947 | } | |
b68e9f85 HX |
1948 | |
1949 | if (unlikely(!tcp_snd_wnd_test(tp, skb, mss_now))) | |
1950 | break; | |
1951 | ||
c1b4a7e6 DM |
1952 | if (tso_segs == 1) { |
1953 | if (unlikely(!tcp_nagle_test(tp, skb, mss_now, | |
1954 | (tcp_skb_is_last(sk, skb) ? | |
1955 | nonagle : TCP_NAGLE_PUSH)))) | |
1956 | break; | |
1957 | } else { | |
ca8a2263 NC |
1958 | if (!push_one && |
1959 | tcp_tso_should_defer(sk, skb, &is_cwnd_limited)) | |
c1b4a7e6 DM |
1960 | break; |
1961 | } | |
aa93466b | 1962 | |
c9eeec26 ED |
1963 | /* TCP Small Queues : |
1964 | * Control number of packets in qdisc/devices to two packets / or ~1 ms. | |
1965 | * This allows for : | |
1966 | * - better RTT estimation and ACK scheduling | |
1967 | * - faster recovery | |
1968 | * - high rates | |
98e09386 ED |
1969 | * Alas, some drivers / subsystems require a fair amount |
1970 | * of queued bytes to ensure line rate. | |
1971 | * One example is wifi aggregation (802.11 AMPDU) | |
46d3ceab | 1972 | */ |
98e09386 ED |
1973 | limit = max_t(unsigned int, sysctl_tcp_limit_output_bytes, |
1974 | sk->sk_pacing_rate >> 10); | |
c9eeec26 ED |
1975 | |
1976 | if (atomic_read(&sk->sk_wmem_alloc) > limit) { | |
46d3ceab | 1977 | set_bit(TSQ_THROTTLED, &tp->tsq_flags); |
bf06200e JO |
1978 | /* It is possible TX completion already happened |
1979 | * before we set TSQ_THROTTLED, so we must | |
1980 | * test again the condition. | |
bf06200e | 1981 | */ |
4e857c58 | 1982 | smp_mb__after_atomic(); |
bf06200e JO |
1983 | if (atomic_read(&sk->sk_wmem_alloc) > limit) |
1984 | break; | |
46d3ceab | 1985 | } |
c9eeec26 | 1986 | |
c8ac3774 | 1987 | limit = mss_now; |
f8269a49 | 1988 | if (tso_segs > 1 && !tcp_urg_mode(tp)) |
0e3a4803 | 1989 | limit = tcp_mss_split_point(sk, skb, mss_now, |
1485348d BH |
1990 | min_t(unsigned int, |
1991 | cwnd_quota, | |
d4589926 ED |
1992 | sk->sk_gso_max_segs), |
1993 | nonagle); | |
1da177e4 | 1994 | |
c8ac3774 | 1995 | if (skb->len > limit && |
c4ead4c5 | 1996 | unlikely(tso_fragment(sk, skb, limit, mss_now, gfp))) |
c8ac3774 HX |
1997 | break; |
1998 | ||
d5dd9175 | 1999 | if (unlikely(tcp_transmit_skb(sk, skb, 1, gfp))) |
92df7b51 | 2000 | break; |
1da177e4 | 2001 | |
ec342325 | 2002 | repair: |
92df7b51 DM |
2003 | /* Advance the send_head. This one is sent out. |
2004 | * This call will increment packets_out. | |
2005 | */ | |
66f5fe62 | 2006 | tcp_event_new_data_sent(sk, skb); |
1da177e4 | 2007 | |
92df7b51 | 2008 | tcp_minshall_update(tp, mss_now, skb); |
a262f0cd | 2009 | sent_pkts += tcp_skb_pcount(skb); |
d5dd9175 IJ |
2010 | |
2011 | if (push_one) | |
2012 | break; | |
92df7b51 | 2013 | } |
1da177e4 | 2014 | |
aa93466b | 2015 | if (likely(sent_pkts)) { |
684bad11 YC |
2016 | if (tcp_in_cwnd_reduction(sk)) |
2017 | tp->prr_out += sent_pkts; | |
6ba8a3b1 ND |
2018 | |
2019 | /* Send one loss probe per tail loss episode. */ | |
2020 | if (push_one != 2) | |
2021 | tcp_schedule_loss_probe(sk); | |
ca8a2263 | 2022 | tcp_cwnd_validate(sk, is_cwnd_limited); |
a2a385d6 | 2023 | return false; |
1da177e4 | 2024 | } |
6ba8a3b1 ND |
2025 | return (push_one == 2) || (!tp->packets_out && tcp_send_head(sk)); |
2026 | } | |
2027 | ||
2028 | bool tcp_schedule_loss_probe(struct sock *sk) | |
2029 | { | |
2030 | struct inet_connection_sock *icsk = inet_csk(sk); | |
2031 | struct tcp_sock *tp = tcp_sk(sk); | |
2032 | u32 timeout, tlp_time_stamp, rto_time_stamp; | |
740b0f18 | 2033 | u32 rtt = usecs_to_jiffies(tp->srtt_us >> 3); |
6ba8a3b1 ND |
2034 | |
2035 | if (WARN_ON(icsk->icsk_pending == ICSK_TIME_EARLY_RETRANS)) | |
2036 | return false; | |
2037 | /* No consecutive loss probes. */ | |
2038 | if (WARN_ON(icsk->icsk_pending == ICSK_TIME_LOSS_PROBE)) { | |
2039 | tcp_rearm_rto(sk); | |
2040 | return false; | |
2041 | } | |
2042 | /* Don't do any loss probe on a Fast Open connection before 3WHS | |
2043 | * finishes. | |
2044 | */ | |
2045 | if (sk->sk_state == TCP_SYN_RECV) | |
2046 | return false; | |
2047 | ||
2048 | /* TLP is only scheduled when next timer event is RTO. */ | |
2049 | if (icsk->icsk_pending != ICSK_TIME_RETRANS) | |
2050 | return false; | |
2051 | ||
2052 | /* Schedule a loss probe in 2*RTT for SACK capable connections | |
2053 | * in Open state, that are either limited by cwnd or application. | |
2054 | */ | |
740b0f18 | 2055 | if (sysctl_tcp_early_retrans < 3 || !tp->srtt_us || !tp->packets_out || |
6ba8a3b1 ND |
2056 | !tcp_is_sack(tp) || inet_csk(sk)->icsk_ca_state != TCP_CA_Open) |
2057 | return false; | |
2058 | ||
2059 | if ((tp->snd_cwnd > tcp_packets_in_flight(tp)) && | |
2060 | tcp_send_head(sk)) | |
2061 | return false; | |
2062 | ||
2063 | /* Probe timeout is at least 1.5*rtt + TCP_DELACK_MAX to account | |
2064 | * for delayed ack when there's one outstanding packet. | |
2065 | */ | |
2066 | timeout = rtt << 1; | |
2067 | if (tp->packets_out == 1) | |
2068 | timeout = max_t(u32, timeout, | |
2069 | (rtt + (rtt >> 1) + TCP_DELACK_MAX)); | |
2070 | timeout = max_t(u32, timeout, msecs_to_jiffies(10)); | |
2071 | ||
2072 | /* If RTO is shorter, just schedule TLP in its place. */ | |
2073 | tlp_time_stamp = tcp_time_stamp + timeout; | |
2074 | rto_time_stamp = (u32)inet_csk(sk)->icsk_timeout; | |
2075 | if ((s32)(tlp_time_stamp - rto_time_stamp) > 0) { | |
2076 | s32 delta = rto_time_stamp - tcp_time_stamp; | |
2077 | if (delta > 0) | |
2078 | timeout = delta; | |
2079 | } | |
2080 | ||
2081 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_LOSS_PROBE, timeout, | |
2082 | TCP_RTO_MAX); | |
2083 | return true; | |
2084 | } | |
2085 | ||
1f3279ae ED |
2086 | /* Thanks to skb fast clones, we can detect if a prior transmit of |
2087 | * a packet is still in a qdisc or driver queue. | |
2088 | * In this case, there is very little point doing a retransmit ! | |
2089 | * Note: This is called from BH context only. | |
2090 | */ | |
2091 | static bool skb_still_in_host_queue(const struct sock *sk, | |
2092 | const struct sk_buff *skb) | |
2093 | { | |
2094 | const struct sk_buff *fclone = skb + 1; | |
2095 | ||
2096 | if (unlikely(skb->fclone == SKB_FCLONE_ORIG && | |
2097 | fclone->fclone == SKB_FCLONE_CLONE)) { | |
2098 | NET_INC_STATS_BH(sock_net(sk), | |
2099 | LINUX_MIB_TCPSPURIOUS_RTX_HOSTQUEUES); | |
2100 | return true; | |
2101 | } | |
2102 | return false; | |
2103 | } | |
2104 | ||
6ba8a3b1 ND |
2105 | /* When probe timeout (PTO) fires, send a new segment if one exists, else |
2106 | * retransmit the last segment. | |
2107 | */ | |
2108 | void tcp_send_loss_probe(struct sock *sk) | |
2109 | { | |
9b717a8d | 2110 | struct tcp_sock *tp = tcp_sk(sk); |
6ba8a3b1 ND |
2111 | struct sk_buff *skb; |
2112 | int pcount; | |
2113 | int mss = tcp_current_mss(sk); | |
2114 | int err = -1; | |
2115 | ||
2116 | if (tcp_send_head(sk) != NULL) { | |
2117 | err = tcp_write_xmit(sk, mss, TCP_NAGLE_OFF, 2, GFP_ATOMIC); | |
2118 | goto rearm_timer; | |
2119 | } | |
2120 | ||
9b717a8d ND |
2121 | /* At most one outstanding TLP retransmission. */ |
2122 | if (tp->tlp_high_seq) | |
2123 | goto rearm_timer; | |
2124 | ||
6ba8a3b1 ND |
2125 | /* Retransmit last segment. */ |
2126 | skb = tcp_write_queue_tail(sk); | |
2127 | if (WARN_ON(!skb)) | |
2128 | goto rearm_timer; | |
2129 | ||
1f3279ae ED |
2130 | if (skb_still_in_host_queue(sk, skb)) |
2131 | goto rearm_timer; | |
2132 | ||
6ba8a3b1 ND |
2133 | pcount = tcp_skb_pcount(skb); |
2134 | if (WARN_ON(!pcount)) | |
2135 | goto rearm_timer; | |
2136 | ||
2137 | if ((pcount > 1) && (skb->len > (pcount - 1) * mss)) { | |
6cc55e09 OP |
2138 | if (unlikely(tcp_fragment(sk, skb, (pcount - 1) * mss, mss, |
2139 | GFP_ATOMIC))) | |
6ba8a3b1 ND |
2140 | goto rearm_timer; |
2141 | skb = tcp_write_queue_tail(sk); | |
2142 | } | |
2143 | ||
2144 | if (WARN_ON(!skb || !tcp_skb_pcount(skb))) | |
2145 | goto rearm_timer; | |
2146 | ||
bef1909e | 2147 | err = __tcp_retransmit_skb(sk, skb); |
6ba8a3b1 | 2148 | |
9b717a8d ND |
2149 | /* Record snd_nxt for loss detection. */ |
2150 | if (likely(!err)) | |
2151 | tp->tlp_high_seq = tp->snd_nxt; | |
2152 | ||
6ba8a3b1 ND |
2153 | rearm_timer: |
2154 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, | |
2155 | inet_csk(sk)->icsk_rto, | |
2156 | TCP_RTO_MAX); | |
2157 | ||
2158 | if (likely(!err)) | |
2159 | NET_INC_STATS_BH(sock_net(sk), | |
2160 | LINUX_MIB_TCPLOSSPROBES); | |
1da177e4 LT |
2161 | } |
2162 | ||
a762a980 DM |
2163 | /* Push out any pending frames which were held back due to |
2164 | * TCP_CORK or attempt at coalescing tiny packets. | |
2165 | * The socket must be locked by the caller. | |
2166 | */ | |
9e412ba7 IJ |
2167 | void __tcp_push_pending_frames(struct sock *sk, unsigned int cur_mss, |
2168 | int nonagle) | |
a762a980 | 2169 | { |
726e07a8 IJ |
2170 | /* If we are closed, the bytes will have to remain here. |
2171 | * In time closedown will finish, we empty the write queue and | |
2172 | * all will be happy. | |
2173 | */ | |
2174 | if (unlikely(sk->sk_state == TCP_CLOSE)) | |
2175 | return; | |
2176 | ||
99a1dec7 MG |
2177 | if (tcp_write_xmit(sk, cur_mss, nonagle, 0, |
2178 | sk_gfp_atomic(sk, GFP_ATOMIC))) | |
726e07a8 | 2179 | tcp_check_probe_timer(sk); |
a762a980 DM |
2180 | } |
2181 | ||
c1b4a7e6 DM |
2182 | /* Send _single_ skb sitting at the send head. This function requires |
2183 | * true push pending frames to setup probe timer etc. | |
2184 | */ | |
2185 | void tcp_push_one(struct sock *sk, unsigned int mss_now) | |
2186 | { | |
fe067e8a | 2187 | struct sk_buff *skb = tcp_send_head(sk); |
c1b4a7e6 DM |
2188 | |
2189 | BUG_ON(!skb || skb->len < mss_now); | |
2190 | ||
d5dd9175 | 2191 | tcp_write_xmit(sk, mss_now, TCP_NAGLE_PUSH, 1, sk->sk_allocation); |
c1b4a7e6 DM |
2192 | } |
2193 | ||
1da177e4 LT |
2194 | /* This function returns the amount that we can raise the |
2195 | * usable window based on the following constraints | |
e905a9ed | 2196 | * |
1da177e4 LT |
2197 | * 1. The window can never be shrunk once it is offered (RFC 793) |
2198 | * 2. We limit memory per socket | |
2199 | * | |
2200 | * RFC 1122: | |
2201 | * "the suggested [SWS] avoidance algorithm for the receiver is to keep | |
2202 | * RECV.NEXT + RCV.WIN fixed until: | |
2203 | * RCV.BUFF - RCV.USER - RCV.WINDOW >= min(1/2 RCV.BUFF, MSS)" | |
2204 | * | |
2205 | * i.e. don't raise the right edge of the window until you can raise | |
2206 | * it at least MSS bytes. | |
2207 | * | |
2208 | * Unfortunately, the recommended algorithm breaks header prediction, | |
2209 | * since header prediction assumes th->window stays fixed. | |
2210 | * | |
2211 | * Strictly speaking, keeping th->window fixed violates the receiver | |
2212 | * side SWS prevention criteria. The problem is that under this rule | |
2213 | * a stream of single byte packets will cause the right side of the | |
2214 | * window to always advance by a single byte. | |
e905a9ed | 2215 | * |
1da177e4 LT |
2216 | * Of course, if the sender implements sender side SWS prevention |
2217 | * then this will not be a problem. | |
e905a9ed | 2218 | * |
1da177e4 | 2219 | * BSD seems to make the following compromise: |
e905a9ed | 2220 | * |
1da177e4 LT |
2221 | * If the free space is less than the 1/4 of the maximum |
2222 | * space available and the free space is less than 1/2 mss, | |
2223 | * then set the window to 0. | |
2224 | * [ Actually, bsd uses MSS and 1/4 of maximal _window_ ] | |
2225 | * Otherwise, just prevent the window from shrinking | |
2226 | * and from being larger than the largest representable value. | |
2227 | * | |
2228 | * This prevents incremental opening of the window in the regime | |
2229 | * where TCP is limited by the speed of the reader side taking | |
2230 | * data out of the TCP receive queue. It does nothing about | |
2231 | * those cases where the window is constrained on the sender side | |
2232 | * because the pipeline is full. | |
2233 | * | |
2234 | * BSD also seems to "accidentally" limit itself to windows that are a | |
2235 | * multiple of MSS, at least until the free space gets quite small. | |
2236 | * This would appear to be a side effect of the mbuf implementation. | |
2237 | * Combining these two algorithms results in the observed behavior | |
2238 | * of having a fixed window size at almost all times. | |
2239 | * | |
2240 | * Below we obtain similar behavior by forcing the offered window to | |
2241 | * a multiple of the mss when it is feasible to do so. | |
2242 | * | |
2243 | * Note, we don't "adjust" for TIMESTAMP or SACK option bytes. | |
2244 | * Regular options like TIMESTAMP are taken into account. | |
2245 | */ | |
2246 | u32 __tcp_select_window(struct sock *sk) | |
2247 | { | |
463c84b9 | 2248 | struct inet_connection_sock *icsk = inet_csk(sk); |
1da177e4 | 2249 | struct tcp_sock *tp = tcp_sk(sk); |
caa20d9a | 2250 | /* MSS for the peer's data. Previous versions used mss_clamp |
1da177e4 LT |
2251 | * here. I don't know if the value based on our guesses |
2252 | * of peer's MSS is better for the performance. It's more correct | |
2253 | * but may be worse for the performance because of rcv_mss | |
2254 | * fluctuations. --SAW 1998/11/1 | |
2255 | */ | |
463c84b9 | 2256 | int mss = icsk->icsk_ack.rcv_mss; |
1da177e4 | 2257 | int free_space = tcp_space(sk); |
86c1a045 FW |
2258 | int allowed_space = tcp_full_space(sk); |
2259 | int full_space = min_t(int, tp->window_clamp, allowed_space); | |
1da177e4 LT |
2260 | int window; |
2261 | ||
2262 | if (mss > full_space) | |
e905a9ed | 2263 | mss = full_space; |
1da177e4 | 2264 | |
b92edbe0 | 2265 | if (free_space < (full_space >> 1)) { |
463c84b9 | 2266 | icsk->icsk_ack.quick = 0; |
1da177e4 | 2267 | |
180d8cd9 | 2268 | if (sk_under_memory_pressure(sk)) |
056834d9 IJ |
2269 | tp->rcv_ssthresh = min(tp->rcv_ssthresh, |
2270 | 4U * tp->advmss); | |
1da177e4 | 2271 | |
86c1a045 FW |
2272 | /* free_space might become our new window, make sure we don't |
2273 | * increase it due to wscale. | |
2274 | */ | |
2275 | free_space = round_down(free_space, 1 << tp->rx_opt.rcv_wscale); | |
2276 | ||
2277 | /* if free space is less than mss estimate, or is below 1/16th | |
2278 | * of the maximum allowed, try to move to zero-window, else | |
2279 | * tcp_clamp_window() will grow rcv buf up to tcp_rmem[2], and | |
2280 | * new incoming data is dropped due to memory limits. | |
2281 | * With large window, mss test triggers way too late in order | |
2282 | * to announce zero window in time before rmem limit kicks in. | |
2283 | */ | |
2284 | if (free_space < (allowed_space >> 4) || free_space < mss) | |
1da177e4 LT |
2285 | return 0; |
2286 | } | |
2287 | ||
2288 | if (free_space > tp->rcv_ssthresh) | |
2289 | free_space = tp->rcv_ssthresh; | |
2290 | ||
2291 | /* Don't do rounding if we are using window scaling, since the | |
2292 | * scaled window will not line up with the MSS boundary anyway. | |
2293 | */ | |
2294 | window = tp->rcv_wnd; | |
2295 | if (tp->rx_opt.rcv_wscale) { | |
2296 | window = free_space; | |
2297 | ||
2298 | /* Advertise enough space so that it won't get scaled away. | |
2299 | * Import case: prevent zero window announcement if | |
2300 | * 1<<rcv_wscale > mss. | |
2301 | */ | |
2302 | if (((window >> tp->rx_opt.rcv_wscale) << tp->rx_opt.rcv_wscale) != window) | |
2303 | window = (((window >> tp->rx_opt.rcv_wscale) + 1) | |
2304 | << tp->rx_opt.rcv_wscale); | |
2305 | } else { | |
2306 | /* Get the largest window that is a nice multiple of mss. | |
2307 | * Window clamp already applied above. | |
2308 | * If our current window offering is within 1 mss of the | |
2309 | * free space we just keep it. This prevents the divide | |
2310 | * and multiply from happening most of the time. | |
2311 | * We also don't do any window rounding when the free space | |
2312 | * is too small. | |
2313 | */ | |
2314 | if (window <= free_space - mss || window > free_space) | |
056834d9 | 2315 | window = (free_space / mss) * mss; |
84565070 | 2316 | else if (mss == full_space && |
b92edbe0 | 2317 | free_space > window + (full_space >> 1)) |
84565070 | 2318 | window = free_space; |
1da177e4 LT |
2319 | } |
2320 | ||
2321 | return window; | |
2322 | } | |
2323 | ||
4a17fc3a IJ |
2324 | /* Collapses two adjacent SKB's during retransmission. */ |
2325 | static void tcp_collapse_retrans(struct sock *sk, struct sk_buff *skb) | |
1da177e4 LT |
2326 | { |
2327 | struct tcp_sock *tp = tcp_sk(sk); | |
fe067e8a | 2328 | struct sk_buff *next_skb = tcp_write_queue_next(sk, skb); |
058dc334 | 2329 | int skb_size, next_skb_size; |
1da177e4 | 2330 | |
058dc334 IJ |
2331 | skb_size = skb->len; |
2332 | next_skb_size = next_skb->len; | |
1da177e4 | 2333 | |
058dc334 | 2334 | BUG_ON(tcp_skb_pcount(skb) != 1 || tcp_skb_pcount(next_skb) != 1); |
a6963a6b | 2335 | |
058dc334 | 2336 | tcp_highest_sack_combine(sk, next_skb, skb); |
1da177e4 | 2337 | |
058dc334 | 2338 | tcp_unlink_write_queue(next_skb, sk); |
1da177e4 | 2339 | |
058dc334 IJ |
2340 | skb_copy_from_linear_data(next_skb, skb_put(skb, next_skb_size), |
2341 | next_skb_size); | |
1da177e4 | 2342 | |
058dc334 IJ |
2343 | if (next_skb->ip_summed == CHECKSUM_PARTIAL) |
2344 | skb->ip_summed = CHECKSUM_PARTIAL; | |
1da177e4 | 2345 | |
058dc334 IJ |
2346 | if (skb->ip_summed != CHECKSUM_PARTIAL) |
2347 | skb->csum = csum_block_add(skb->csum, next_skb->csum, skb_size); | |
1da177e4 | 2348 | |
058dc334 IJ |
2349 | /* Update sequence range on original skb. */ |
2350 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(next_skb)->end_seq; | |
1da177e4 | 2351 | |
e6c7d085 | 2352 | /* Merge over control information. This moves PSH/FIN etc. over */ |
4de075e0 | 2353 | TCP_SKB_CB(skb)->tcp_flags |= TCP_SKB_CB(next_skb)->tcp_flags; |
058dc334 IJ |
2354 | |
2355 | /* All done, get rid of second SKB and account for it so | |
2356 | * packet counting does not break. | |
2357 | */ | |
2358 | TCP_SKB_CB(skb)->sacked |= TCP_SKB_CB(next_skb)->sacked & TCPCB_EVER_RETRANS; | |
058dc334 IJ |
2359 | |
2360 | /* changed transmit queue under us so clear hints */ | |
ef9da47c IJ |
2361 | tcp_clear_retrans_hints_partial(tp); |
2362 | if (next_skb == tp->retransmit_skb_hint) | |
2363 | tp->retransmit_skb_hint = skb; | |
058dc334 | 2364 | |
797108d1 IJ |
2365 | tcp_adjust_pcount(sk, next_skb, tcp_skb_pcount(next_skb)); |
2366 | ||
058dc334 | 2367 | sk_wmem_free_skb(sk, next_skb); |
1da177e4 LT |
2368 | } |
2369 | ||
67edfef7 | 2370 | /* Check if coalescing SKBs is legal. */ |
a2a385d6 | 2371 | static bool tcp_can_collapse(const struct sock *sk, const struct sk_buff *skb) |
4a17fc3a IJ |
2372 | { |
2373 | if (tcp_skb_pcount(skb) > 1) | |
a2a385d6 | 2374 | return false; |
4a17fc3a IJ |
2375 | /* TODO: SACK collapsing could be used to remove this condition */ |
2376 | if (skb_shinfo(skb)->nr_frags != 0) | |
a2a385d6 | 2377 | return false; |
4a17fc3a | 2378 | if (skb_cloned(skb)) |
a2a385d6 | 2379 | return false; |
4a17fc3a | 2380 | if (skb == tcp_send_head(sk)) |
a2a385d6 | 2381 | return false; |
4a17fc3a IJ |
2382 | /* Some heurestics for collapsing over SACK'd could be invented */ |
2383 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED) | |
a2a385d6 | 2384 | return false; |
4a17fc3a | 2385 | |
a2a385d6 | 2386 | return true; |
4a17fc3a IJ |
2387 | } |
2388 | ||
67edfef7 AK |
2389 | /* Collapse packets in the retransmit queue to make to create |
2390 | * less packets on the wire. This is only done on retransmission. | |
2391 | */ | |
4a17fc3a IJ |
2392 | static void tcp_retrans_try_collapse(struct sock *sk, struct sk_buff *to, |
2393 | int space) | |
2394 | { | |
2395 | struct tcp_sock *tp = tcp_sk(sk); | |
2396 | struct sk_buff *skb = to, *tmp; | |
a2a385d6 | 2397 | bool first = true; |
4a17fc3a IJ |
2398 | |
2399 | if (!sysctl_tcp_retrans_collapse) | |
2400 | return; | |
4de075e0 | 2401 | if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN) |
4a17fc3a IJ |
2402 | return; |
2403 | ||
2404 | tcp_for_write_queue_from_safe(skb, tmp, sk) { | |
2405 | if (!tcp_can_collapse(sk, skb)) | |
2406 | break; | |
2407 | ||
2408 | space -= skb->len; | |
2409 | ||
2410 | if (first) { | |
a2a385d6 | 2411 | first = false; |
4a17fc3a IJ |
2412 | continue; |
2413 | } | |
2414 | ||
2415 | if (space < 0) | |
2416 | break; | |
2417 | /* Punt if not enough space exists in the first SKB for | |
2418 | * the data in the second | |
2419 | */ | |
a21d4572 | 2420 | if (skb->len > skb_availroom(to)) |
4a17fc3a IJ |
2421 | break; |
2422 | ||
2423 | if (after(TCP_SKB_CB(skb)->end_seq, tcp_wnd_end(tp))) | |
2424 | break; | |
2425 | ||
2426 | tcp_collapse_retrans(sk, to); | |
2427 | } | |
2428 | } | |
2429 | ||
1da177e4 LT |
2430 | /* This retransmits one SKB. Policy decisions and retransmit queue |
2431 | * state updates are done by the caller. Returns non-zero if an | |
2432 | * error occurred which prevented the send. | |
2433 | */ | |
93b174ad | 2434 | int __tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb) |
1da177e4 LT |
2435 | { |
2436 | struct tcp_sock *tp = tcp_sk(sk); | |
5d424d5a | 2437 | struct inet_connection_sock *icsk = inet_csk(sk); |
7d227cd2 | 2438 | unsigned int cur_mss; |
c84a5711 | 2439 | int err; |
1da177e4 | 2440 | |
5d424d5a JH |
2441 | /* Inconslusive MTU probe */ |
2442 | if (icsk->icsk_mtup.probe_size) { | |
2443 | icsk->icsk_mtup.probe_size = 0; | |
2444 | } | |
2445 | ||
1da177e4 | 2446 | /* Do not sent more than we queued. 1/4 is reserved for possible |
caa20d9a | 2447 | * copying overhead: fragmentation, tunneling, mangling etc. |
1da177e4 LT |
2448 | */ |
2449 | if (atomic_read(&sk->sk_wmem_alloc) > | |
2450 | min(sk->sk_wmem_queued + (sk->sk_wmem_queued >> 2), sk->sk_sndbuf)) | |
2451 | return -EAGAIN; | |
2452 | ||
1f3279ae ED |
2453 | if (skb_still_in_host_queue(sk, skb)) |
2454 | return -EBUSY; | |
2455 | ||
1da177e4 LT |
2456 | if (before(TCP_SKB_CB(skb)->seq, tp->snd_una)) { |
2457 | if (before(TCP_SKB_CB(skb)->end_seq, tp->snd_una)) | |
2458 | BUG(); | |
1da177e4 LT |
2459 | if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq)) |
2460 | return -ENOMEM; | |
2461 | } | |
2462 | ||
7d227cd2 SS |
2463 | if (inet_csk(sk)->icsk_af_ops->rebuild_header(sk)) |
2464 | return -EHOSTUNREACH; /* Routing failure or similar. */ | |
2465 | ||
0c54b85f | 2466 | cur_mss = tcp_current_mss(sk); |
7d227cd2 | 2467 | |
1da177e4 LT |
2468 | /* If receiver has shrunk his window, and skb is out of |
2469 | * new window, do not retransmit it. The exception is the | |
2470 | * case, when window is shrunk to zero. In this case | |
2471 | * our retransmit serves as a zero window probe. | |
2472 | */ | |
9d4fb27d JP |
2473 | if (!before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp)) && |
2474 | TCP_SKB_CB(skb)->seq != tp->snd_una) | |
1da177e4 LT |
2475 | return -EAGAIN; |
2476 | ||
2477 | if (skb->len > cur_mss) { | |
6cc55e09 | 2478 | if (tcp_fragment(sk, skb, cur_mss, cur_mss, GFP_ATOMIC)) |
1da177e4 | 2479 | return -ENOMEM; /* We'll try again later. */ |
02276f3c | 2480 | } else { |
9eb9362e IJ |
2481 | int oldpcount = tcp_skb_pcount(skb); |
2482 | ||
2483 | if (unlikely(oldpcount > 1)) { | |
c52e2421 ED |
2484 | if (skb_unclone(skb, GFP_ATOMIC)) |
2485 | return -ENOMEM; | |
9eb9362e IJ |
2486 | tcp_init_tso_segs(sk, skb, cur_mss); |
2487 | tcp_adjust_pcount(sk, skb, oldpcount - tcp_skb_pcount(skb)); | |
2488 | } | |
1da177e4 LT |
2489 | } |
2490 | ||
4a17fc3a | 2491 | tcp_retrans_try_collapse(sk, skb, cur_mss); |
1da177e4 | 2492 | |
1da177e4 LT |
2493 | /* Make a copy, if the first transmission SKB clone we made |
2494 | * is still in somebody's hands, else make a clone. | |
2495 | */ | |
1da177e4 | 2496 | |
50bceae9 TG |
2497 | /* make sure skb->data is aligned on arches that require it |
2498 | * and check if ack-trimming & collapsing extended the headroom | |
2499 | * beyond what csum_start can cover. | |
2500 | */ | |
2501 | if (unlikely((NET_IP_ALIGN && ((unsigned long)skb->data & 3)) || | |
2502 | skb_headroom(skb) >= 0xFFFF)) { | |
117632e6 ED |
2503 | struct sk_buff *nskb = __pskb_copy(skb, MAX_TCP_HEADER, |
2504 | GFP_ATOMIC); | |
c84a5711 YC |
2505 | err = nskb ? tcp_transmit_skb(sk, nskb, 0, GFP_ATOMIC) : |
2506 | -ENOBUFS; | |
117632e6 | 2507 | } else { |
c84a5711 | 2508 | err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC); |
117632e6 | 2509 | } |
c84a5711 | 2510 | |
fc9f3501 | 2511 | if (likely(!err)) { |
c84a5711 | 2512 | TCP_SKB_CB(skb)->sacked |= TCPCB_EVER_RETRANS; |
fc9f3501 ED |
2513 | /* Update global TCP statistics. */ |
2514 | TCP_INC_STATS(sock_net(sk), TCP_MIB_RETRANSSEGS); | |
2515 | if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN) | |
2516 | NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPSYNRETRANS); | |
2517 | tp->total_retrans++; | |
2518 | } | |
c84a5711 | 2519 | return err; |
93b174ad YC |
2520 | } |
2521 | ||
2522 | int tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb) | |
2523 | { | |
2524 | struct tcp_sock *tp = tcp_sk(sk); | |
2525 | int err = __tcp_retransmit_skb(sk, skb); | |
1da177e4 LT |
2526 | |
2527 | if (err == 0) { | |
1da177e4 | 2528 | #if FASTRETRANS_DEBUG > 0 |
056834d9 | 2529 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) { |
e87cc472 | 2530 | net_dbg_ratelimited("retrans_out leaked\n"); |
1da177e4 LT |
2531 | } |
2532 | #endif | |
b08d6cb2 IJ |
2533 | if (!tp->retrans_out) |
2534 | tp->lost_retrans_low = tp->snd_nxt; | |
1da177e4 LT |
2535 | TCP_SKB_CB(skb)->sacked |= TCPCB_RETRANS; |
2536 | tp->retrans_out += tcp_skb_pcount(skb); | |
2537 | ||
2538 | /* Save stamp of the first retransmit. */ | |
2539 | if (!tp->retrans_stamp) | |
7faee5c0 | 2540 | tp->retrans_stamp = tcp_skb_timestamp(skb); |
1da177e4 | 2541 | |
1da177e4 LT |
2542 | /* snd_nxt is stored to detect loss of retransmitted segment, |
2543 | * see tcp_input.c tcp_sacktag_write_queue(). | |
2544 | */ | |
2545 | TCP_SKB_CB(skb)->ack_seq = tp->snd_nxt; | |
1f3279ae | 2546 | } else if (err != -EBUSY) { |
24ab6bec | 2547 | NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPRETRANSFAIL); |
1da177e4 | 2548 | } |
6e08d5e3 YC |
2549 | |
2550 | if (tp->undo_retrans < 0) | |
2551 | tp->undo_retrans = 0; | |
2552 | tp->undo_retrans += tcp_skb_pcount(skb); | |
1da177e4 LT |
2553 | return err; |
2554 | } | |
2555 | ||
67edfef7 AK |
2556 | /* Check if we forward retransmits are possible in the current |
2557 | * window/congestion state. | |
2558 | */ | |
a2a385d6 | 2559 | static bool tcp_can_forward_retransmit(struct sock *sk) |
b5afe7bc IJ |
2560 | { |
2561 | const struct inet_connection_sock *icsk = inet_csk(sk); | |
cf533ea5 | 2562 | const struct tcp_sock *tp = tcp_sk(sk); |
b5afe7bc IJ |
2563 | |
2564 | /* Forward retransmissions are possible only during Recovery. */ | |
2565 | if (icsk->icsk_ca_state != TCP_CA_Recovery) | |
a2a385d6 | 2566 | return false; |
b5afe7bc IJ |
2567 | |
2568 | /* No forward retransmissions in Reno are possible. */ | |
2569 | if (tcp_is_reno(tp)) | |
a2a385d6 | 2570 | return false; |
b5afe7bc IJ |
2571 | |
2572 | /* Yeah, we have to make difficult choice between forward transmission | |
2573 | * and retransmission... Both ways have their merits... | |
2574 | * | |
2575 | * For now we do not retransmit anything, while we have some new | |
2576 | * segments to send. In the other cases, follow rule 3 for | |
2577 | * NextSeg() specified in RFC3517. | |
2578 | */ | |
2579 | ||
2580 | if (tcp_may_send_now(sk)) | |
a2a385d6 | 2581 | return false; |
b5afe7bc | 2582 | |
a2a385d6 | 2583 | return true; |
b5afe7bc IJ |
2584 | } |
2585 | ||
1da177e4 LT |
2586 | /* This gets called after a retransmit timeout, and the initially |
2587 | * retransmitted data is acknowledged. It tries to continue | |
2588 | * resending the rest of the retransmit queue, until either | |
2589 | * we've sent it all or the congestion window limit is reached. | |
2590 | * If doing SACK, the first ACK which comes back for a timeout | |
2591 | * based retransmit packet might feed us FACK information again. | |
2592 | * If so, we use it to avoid unnecessarily retransmissions. | |
2593 | */ | |
2594 | void tcp_xmit_retransmit_queue(struct sock *sk) | |
2595 | { | |
6687e988 | 2596 | const struct inet_connection_sock *icsk = inet_csk(sk); |
1da177e4 LT |
2597 | struct tcp_sock *tp = tcp_sk(sk); |
2598 | struct sk_buff *skb; | |
0e1c54c2 | 2599 | struct sk_buff *hole = NULL; |
618d9f25 | 2600 | u32 last_lost; |
61eb55f4 | 2601 | int mib_idx; |
0e1c54c2 | 2602 | int fwd_rexmitting = 0; |
6a438bbe | 2603 | |
45e77d31 IJ |
2604 | if (!tp->packets_out) |
2605 | return; | |
2606 | ||
08ebd172 IJ |
2607 | if (!tp->lost_out) |
2608 | tp->retransmit_high = tp->snd_una; | |
2609 | ||
618d9f25 | 2610 | if (tp->retransmit_skb_hint) { |
6a438bbe | 2611 | skb = tp->retransmit_skb_hint; |
618d9f25 IJ |
2612 | last_lost = TCP_SKB_CB(skb)->end_seq; |
2613 | if (after(last_lost, tp->retransmit_high)) | |
2614 | last_lost = tp->retransmit_high; | |
2615 | } else { | |
fe067e8a | 2616 | skb = tcp_write_queue_head(sk); |
618d9f25 IJ |
2617 | last_lost = tp->snd_una; |
2618 | } | |
1da177e4 | 2619 | |
08ebd172 IJ |
2620 | tcp_for_write_queue_from(skb, sk) { |
2621 | __u8 sacked = TCP_SKB_CB(skb)->sacked; | |
1da177e4 | 2622 | |
08ebd172 IJ |
2623 | if (skb == tcp_send_head(sk)) |
2624 | break; | |
2625 | /* we could do better than to assign each time */ | |
0e1c54c2 IJ |
2626 | if (hole == NULL) |
2627 | tp->retransmit_skb_hint = skb; | |
08ebd172 IJ |
2628 | |
2629 | /* Assume this retransmit will generate | |
2630 | * only one packet for congestion window | |
2631 | * calculation purposes. This works because | |
2632 | * tcp_retransmit_skb() will chop up the | |
2633 | * packet to be MSS sized and all the | |
2634 | * packet counting works out. | |
2635 | */ | |
2636 | if (tcp_packets_in_flight(tp) >= tp->snd_cwnd) | |
2637 | return; | |
1da177e4 | 2638 | |
0e1c54c2 IJ |
2639 | if (fwd_rexmitting) { |
2640 | begin_fwd: | |
2641 | if (!before(TCP_SKB_CB(skb)->seq, tcp_highest_sack_seq(tp))) | |
2642 | break; | |
2643 | mib_idx = LINUX_MIB_TCPFORWARDRETRANS; | |
6a438bbe | 2644 | |
0e1c54c2 | 2645 | } else if (!before(TCP_SKB_CB(skb)->seq, tp->retransmit_high)) { |
618d9f25 | 2646 | tp->retransmit_high = last_lost; |
0e1c54c2 IJ |
2647 | if (!tcp_can_forward_retransmit(sk)) |
2648 | break; | |
2649 | /* Backtrack if necessary to non-L'ed skb */ | |
2650 | if (hole != NULL) { | |
2651 | skb = hole; | |
2652 | hole = NULL; | |
2653 | } | |
2654 | fwd_rexmitting = 1; | |
2655 | goto begin_fwd; | |
1da177e4 | 2656 | |
0e1c54c2 | 2657 | } else if (!(sacked & TCPCB_LOST)) { |
ac11ba75 | 2658 | if (hole == NULL && !(sacked & (TCPCB_SACKED_RETRANS|TCPCB_SACKED_ACKED))) |
0e1c54c2 IJ |
2659 | hole = skb; |
2660 | continue; | |
1da177e4 | 2661 | |
0e1c54c2 | 2662 | } else { |
618d9f25 | 2663 | last_lost = TCP_SKB_CB(skb)->end_seq; |
0e1c54c2 IJ |
2664 | if (icsk->icsk_ca_state != TCP_CA_Loss) |
2665 | mib_idx = LINUX_MIB_TCPFASTRETRANS; | |
2666 | else | |
2667 | mib_idx = LINUX_MIB_TCPSLOWSTARTRETRANS; | |
2668 | } | |
1da177e4 | 2669 | |
0e1c54c2 | 2670 | if (sacked & (TCPCB_SACKED_ACKED|TCPCB_SACKED_RETRANS)) |
1da177e4 LT |
2671 | continue; |
2672 | ||
24ab6bec | 2673 | if (tcp_retransmit_skb(sk, skb)) |
0e1c54c2 | 2674 | return; |
24ab6bec | 2675 | |
0e1c54c2 | 2676 | NET_INC_STATS_BH(sock_net(sk), mib_idx); |
1da177e4 | 2677 | |
684bad11 | 2678 | if (tcp_in_cwnd_reduction(sk)) |
a262f0cd ND |
2679 | tp->prr_out += tcp_skb_pcount(skb); |
2680 | ||
fe067e8a | 2681 | if (skb == tcp_write_queue_head(sk)) |
3f421baa ACM |
2682 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, |
2683 | inet_csk(sk)->icsk_rto, | |
2684 | TCP_RTO_MAX); | |
1da177e4 LT |
2685 | } |
2686 | } | |
2687 | ||
1da177e4 LT |
2688 | /* Send a fin. The caller locks the socket for us. This cannot be |
2689 | * allowed to fail queueing a FIN frame under any circumstances. | |
2690 | */ | |
2691 | void tcp_send_fin(struct sock *sk) | |
2692 | { | |
e905a9ed | 2693 | struct tcp_sock *tp = tcp_sk(sk); |
fe067e8a | 2694 | struct sk_buff *skb = tcp_write_queue_tail(sk); |
1da177e4 | 2695 | int mss_now; |
e905a9ed | 2696 | |
1da177e4 LT |
2697 | /* Optimization, tack on the FIN if we have a queue of |
2698 | * unsent frames. But be careful about outgoing SACKS | |
2699 | * and IP options. | |
2700 | */ | |
0c54b85f | 2701 | mss_now = tcp_current_mss(sk); |
1da177e4 | 2702 | |
fe067e8a | 2703 | if (tcp_send_head(sk) != NULL) { |
4de075e0 | 2704 | TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_FIN; |
1da177e4 LT |
2705 | TCP_SKB_CB(skb)->end_seq++; |
2706 | tp->write_seq++; | |
2707 | } else { | |
2708 | /* Socket is locked, keep trying until memory is available. */ | |
2709 | for (;;) { | |
aa133076 WF |
2710 | skb = alloc_skb_fclone(MAX_TCP_HEADER, |
2711 | sk->sk_allocation); | |
1da177e4 LT |
2712 | if (skb) |
2713 | break; | |
2714 | yield(); | |
2715 | } | |
2716 | ||
2717 | /* Reserve space for headers and prepare control bits. */ | |
2718 | skb_reserve(skb, MAX_TCP_HEADER); | |
1da177e4 | 2719 | /* FIN eats a sequence byte, write_seq advanced by tcp_queue_skb(). */ |
e870a8ef | 2720 | tcp_init_nondata_skb(skb, tp->write_seq, |
a3433f35 | 2721 | TCPHDR_ACK | TCPHDR_FIN); |
1da177e4 LT |
2722 | tcp_queue_skb(sk, skb); |
2723 | } | |
9e412ba7 | 2724 | __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_OFF); |
1da177e4 LT |
2725 | } |
2726 | ||
2727 | /* We get here when a process closes a file descriptor (either due to | |
2728 | * an explicit close() or as a byproduct of exit()'ing) and there | |
2729 | * was unread data in the receive queue. This behavior is recommended | |
65bb723c | 2730 | * by RFC 2525, section 2.17. -DaveM |
1da177e4 | 2731 | */ |
dd0fc66f | 2732 | void tcp_send_active_reset(struct sock *sk, gfp_t priority) |
1da177e4 | 2733 | { |
1da177e4 LT |
2734 | struct sk_buff *skb; |
2735 | ||
2736 | /* NOTE: No TCP options attached and we never retransmit this. */ | |
2737 | skb = alloc_skb(MAX_TCP_HEADER, priority); | |
2738 | if (!skb) { | |
4e673444 | 2739 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED); |
1da177e4 LT |
2740 | return; |
2741 | } | |
2742 | ||
2743 | /* Reserve space for headers and prepare control bits. */ | |
2744 | skb_reserve(skb, MAX_TCP_HEADER); | |
e870a8ef | 2745 | tcp_init_nondata_skb(skb, tcp_acceptable_seq(sk), |
a3433f35 | 2746 | TCPHDR_ACK | TCPHDR_RST); |
1da177e4 | 2747 | /* Send it off. */ |
dfb4b9dc | 2748 | if (tcp_transmit_skb(sk, skb, 0, priority)) |
4e673444 | 2749 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED); |
26af65cb | 2750 | |
81cc8a75 | 2751 | TCP_INC_STATS(sock_net(sk), TCP_MIB_OUTRSTS); |
1da177e4 LT |
2752 | } |
2753 | ||
67edfef7 AK |
2754 | /* Send a crossed SYN-ACK during socket establishment. |
2755 | * WARNING: This routine must only be called when we have already sent | |
1da177e4 LT |
2756 | * a SYN packet that crossed the incoming SYN that caused this routine |
2757 | * to get called. If this assumption fails then the initial rcv_wnd | |
2758 | * and rcv_wscale values will not be correct. | |
2759 | */ | |
2760 | int tcp_send_synack(struct sock *sk) | |
2761 | { | |
056834d9 | 2762 | struct sk_buff *skb; |
1da177e4 | 2763 | |
fe067e8a | 2764 | skb = tcp_write_queue_head(sk); |
4de075e0 | 2765 | if (skb == NULL || !(TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN)) { |
91df42be | 2766 | pr_debug("%s: wrong queue state\n", __func__); |
1da177e4 LT |
2767 | return -EFAULT; |
2768 | } | |
4de075e0 | 2769 | if (!(TCP_SKB_CB(skb)->tcp_flags & TCPHDR_ACK)) { |
1da177e4 LT |
2770 | if (skb_cloned(skb)) { |
2771 | struct sk_buff *nskb = skb_copy(skb, GFP_ATOMIC); | |
2772 | if (nskb == NULL) | |
2773 | return -ENOMEM; | |
fe067e8a | 2774 | tcp_unlink_write_queue(skb, sk); |
1da177e4 | 2775 | skb_header_release(nskb); |
fe067e8a | 2776 | __tcp_add_write_queue_head(sk, nskb); |
3ab224be HA |
2777 | sk_wmem_free_skb(sk, skb); |
2778 | sk->sk_wmem_queued += nskb->truesize; | |
2779 | sk_mem_charge(sk, nskb->truesize); | |
1da177e4 LT |
2780 | skb = nskb; |
2781 | } | |
2782 | ||
4de075e0 | 2783 | TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_ACK; |
1da177e4 LT |
2784 | TCP_ECN_send_synack(tcp_sk(sk), skb); |
2785 | } | |
dfb4b9dc | 2786 | return tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC); |
1da177e4 LT |
2787 | } |
2788 | ||
4aea39c1 ED |
2789 | /** |
2790 | * tcp_make_synack - Prepare a SYN-ACK. | |
2791 | * sk: listener socket | |
2792 | * dst: dst entry attached to the SYNACK | |
2793 | * req: request_sock pointer | |
4aea39c1 ED |
2794 | * |
2795 | * Allocate one skb and build a SYNACK packet. | |
2796 | * @dst is consumed : Caller should not use it again. | |
2797 | */ | |
056834d9 | 2798 | struct sk_buff *tcp_make_synack(struct sock *sk, struct dst_entry *dst, |
e6b4d113 | 2799 | struct request_sock *req, |
8336886f | 2800 | struct tcp_fastopen_cookie *foc) |
1da177e4 | 2801 | { |
bd0388ae | 2802 | struct tcp_out_options opts; |
2e6599cb | 2803 | struct inet_request_sock *ireq = inet_rsk(req); |
1da177e4 LT |
2804 | struct tcp_sock *tp = tcp_sk(sk); |
2805 | struct tcphdr *th; | |
1da177e4 | 2806 | struct sk_buff *skb; |
cfb6eeb4 | 2807 | struct tcp_md5sig_key *md5; |
bd0388ae | 2808 | int tcp_header_size; |
f5fff5dc | 2809 | int mss; |
1da177e4 | 2810 | |
a0b8486c | 2811 | skb = sock_wmalloc(sk, MAX_TCP_HEADER, 1, GFP_ATOMIC); |
4aea39c1 ED |
2812 | if (unlikely(!skb)) { |
2813 | dst_release(dst); | |
1da177e4 | 2814 | return NULL; |
4aea39c1 | 2815 | } |
1da177e4 LT |
2816 | /* Reserve space for headers. */ |
2817 | skb_reserve(skb, MAX_TCP_HEADER); | |
2818 | ||
4aea39c1 | 2819 | skb_dst_set(skb, dst); |
ca10b9e9 | 2820 | security_skb_owned_by(skb, sk); |
1da177e4 | 2821 | |
0dbaee3b | 2822 | mss = dst_metric_advmss(dst); |
f5fff5dc TQ |
2823 | if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < mss) |
2824 | mss = tp->rx_opt.user_mss; | |
2825 | ||
33ad798c | 2826 | memset(&opts, 0, sizeof(opts)); |
8b5f12d0 FW |
2827 | #ifdef CONFIG_SYN_COOKIES |
2828 | if (unlikely(req->cookie_ts)) | |
7faee5c0 | 2829 | skb->skb_mstamp.stamp_jiffies = cookie_init_timestamp(req); |
8b5f12d0 FW |
2830 | else |
2831 | #endif | |
7faee5c0 | 2832 | skb_mstamp_get(&skb->skb_mstamp); |
1a2c6181 CP |
2833 | tcp_header_size = tcp_synack_options(sk, req, mss, skb, &opts, &md5, |
2834 | foc) + sizeof(*th); | |
cfb6eeb4 | 2835 | |
aa8223c7 ACM |
2836 | skb_push(skb, tcp_header_size); |
2837 | skb_reset_transport_header(skb); | |
1da177e4 | 2838 | |
aa8223c7 | 2839 | th = tcp_hdr(skb); |
1da177e4 LT |
2840 | memset(th, 0, sizeof(struct tcphdr)); |
2841 | th->syn = 1; | |
2842 | th->ack = 1; | |
1da177e4 | 2843 | TCP_ECN_make_synack(req, th); |
b44084c2 | 2844 | th->source = htons(ireq->ir_num); |
634fb979 | 2845 | th->dest = ireq->ir_rmt_port; |
e870a8ef IJ |
2846 | /* Setting of flags are superfluous here for callers (and ECE is |
2847 | * not even correctly set) | |
2848 | */ | |
2849 | tcp_init_nondata_skb(skb, tcp_rsk(req)->snt_isn, | |
a3433f35 | 2850 | TCPHDR_SYN | TCPHDR_ACK); |
4957faad | 2851 | |
1da177e4 | 2852 | th->seq = htonl(TCP_SKB_CB(skb)->seq); |
8336886f JC |
2853 | /* XXX data is queued and acked as is. No buffer/window check */ |
2854 | th->ack_seq = htonl(tcp_rsk(req)->rcv_nxt); | |
1da177e4 LT |
2855 | |
2856 | /* RFC1323: The window in SYN & SYN/ACK segments is never scaled. */ | |
600ff0c2 | 2857 | th->window = htons(min(req->rcv_wnd, 65535U)); |
bd0388ae | 2858 | tcp_options_write((__be32 *)(th + 1), tp, &opts); |
1da177e4 | 2859 | th->doff = (tcp_header_size >> 2); |
a0b8486c | 2860 | TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_OUTSEGS); |
cfb6eeb4 YH |
2861 | |
2862 | #ifdef CONFIG_TCP_MD5SIG | |
2863 | /* Okay, we have all we need - do the md5 hash if needed */ | |
2864 | if (md5) { | |
bd0388ae | 2865 | tcp_rsk(req)->af_specific->calc_md5_hash(opts.hash_location, |
49a72dfb | 2866 | md5, NULL, req, skb); |
cfb6eeb4 YH |
2867 | } |
2868 | #endif | |
2869 | ||
1da177e4 LT |
2870 | return skb; |
2871 | } | |
4bc2f18b | 2872 | EXPORT_SYMBOL(tcp_make_synack); |
1da177e4 | 2873 | |
67edfef7 | 2874 | /* Do all connect socket setups that can be done AF independent. */ |
f7e56a76 | 2875 | static void tcp_connect_init(struct sock *sk) |
1da177e4 | 2876 | { |
cf533ea5 | 2877 | const struct dst_entry *dst = __sk_dst_get(sk); |
1da177e4 LT |
2878 | struct tcp_sock *tp = tcp_sk(sk); |
2879 | __u8 rcv_wscale; | |
2880 | ||
2881 | /* We'll fix this up when we get a response from the other end. | |
2882 | * See tcp_input.c:tcp_rcv_state_process case TCP_SYN_SENT. | |
2883 | */ | |
2884 | tp->tcp_header_len = sizeof(struct tcphdr) + | |
bb5b7c11 | 2885 | (sysctl_tcp_timestamps ? TCPOLEN_TSTAMP_ALIGNED : 0); |
1da177e4 | 2886 | |
cfb6eeb4 YH |
2887 | #ifdef CONFIG_TCP_MD5SIG |
2888 | if (tp->af_specific->md5_lookup(sk, sk) != NULL) | |
2889 | tp->tcp_header_len += TCPOLEN_MD5SIG_ALIGNED; | |
2890 | #endif | |
2891 | ||
1da177e4 LT |
2892 | /* If user gave his TCP_MAXSEG, record it to clamp */ |
2893 | if (tp->rx_opt.user_mss) | |
2894 | tp->rx_opt.mss_clamp = tp->rx_opt.user_mss; | |
2895 | tp->max_window = 0; | |
5d424d5a | 2896 | tcp_mtup_init(sk); |
1da177e4 LT |
2897 | tcp_sync_mss(sk, dst_mtu(dst)); |
2898 | ||
2899 | if (!tp->window_clamp) | |
2900 | tp->window_clamp = dst_metric(dst, RTAX_WINDOW); | |
0dbaee3b | 2901 | tp->advmss = dst_metric_advmss(dst); |
f5fff5dc TQ |
2902 | if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < tp->advmss) |
2903 | tp->advmss = tp->rx_opt.user_mss; | |
2904 | ||
1da177e4 | 2905 | tcp_initialize_rcv_mss(sk); |
1da177e4 | 2906 | |
e88c64f0 HPP |
2907 | /* limit the window selection if the user enforce a smaller rx buffer */ |
2908 | if (sk->sk_userlocks & SOCK_RCVBUF_LOCK && | |
2909 | (tp->window_clamp > tcp_full_space(sk) || tp->window_clamp == 0)) | |
2910 | tp->window_clamp = tcp_full_space(sk); | |
2911 | ||
1da177e4 LT |
2912 | tcp_select_initial_window(tcp_full_space(sk), |
2913 | tp->advmss - (tp->rx_opt.ts_recent_stamp ? tp->tcp_header_len - sizeof(struct tcphdr) : 0), | |
2914 | &tp->rcv_wnd, | |
2915 | &tp->window_clamp, | |
bb5b7c11 | 2916 | sysctl_tcp_window_scaling, |
31d12926 | 2917 | &rcv_wscale, |
2918 | dst_metric(dst, RTAX_INITRWND)); | |
1da177e4 LT |
2919 | |
2920 | tp->rx_opt.rcv_wscale = rcv_wscale; | |
2921 | tp->rcv_ssthresh = tp->rcv_wnd; | |
2922 | ||
2923 | sk->sk_err = 0; | |
2924 | sock_reset_flag(sk, SOCK_DONE); | |
2925 | tp->snd_wnd = 0; | |
ee7537b6 | 2926 | tcp_init_wl(tp, 0); |
1da177e4 LT |
2927 | tp->snd_una = tp->write_seq; |
2928 | tp->snd_sml = tp->write_seq; | |
33f5f57e | 2929 | tp->snd_up = tp->write_seq; |
370816ae | 2930 | tp->snd_nxt = tp->write_seq; |
ee995283 PE |
2931 | |
2932 | if (likely(!tp->repair)) | |
2933 | tp->rcv_nxt = 0; | |
c7781a6e AV |
2934 | else |
2935 | tp->rcv_tstamp = tcp_time_stamp; | |
ee995283 PE |
2936 | tp->rcv_wup = tp->rcv_nxt; |
2937 | tp->copied_seq = tp->rcv_nxt; | |
1da177e4 | 2938 | |
463c84b9 ACM |
2939 | inet_csk(sk)->icsk_rto = TCP_TIMEOUT_INIT; |
2940 | inet_csk(sk)->icsk_retransmits = 0; | |
1da177e4 LT |
2941 | tcp_clear_retrans(tp); |
2942 | } | |
2943 | ||
783237e8 YC |
2944 | static void tcp_connect_queue_skb(struct sock *sk, struct sk_buff *skb) |
2945 | { | |
2946 | struct tcp_sock *tp = tcp_sk(sk); | |
2947 | struct tcp_skb_cb *tcb = TCP_SKB_CB(skb); | |
2948 | ||
2949 | tcb->end_seq += skb->len; | |
2950 | skb_header_release(skb); | |
2951 | __tcp_add_write_queue_tail(sk, skb); | |
2952 | sk->sk_wmem_queued += skb->truesize; | |
2953 | sk_mem_charge(sk, skb->truesize); | |
2954 | tp->write_seq = tcb->end_seq; | |
2955 | tp->packets_out += tcp_skb_pcount(skb); | |
2956 | } | |
2957 | ||
2958 | /* Build and send a SYN with data and (cached) Fast Open cookie. However, | |
2959 | * queue a data-only packet after the regular SYN, such that regular SYNs | |
2960 | * are retransmitted on timeouts. Also if the remote SYN-ACK acknowledges | |
2961 | * only the SYN sequence, the data are retransmitted in the first ACK. | |
2962 | * If cookie is not cached or other error occurs, falls back to send a | |
2963 | * regular SYN with Fast Open cookie request option. | |
2964 | */ | |
2965 | static int tcp_send_syn_data(struct sock *sk, struct sk_buff *syn) | |
2966 | { | |
2967 | struct tcp_sock *tp = tcp_sk(sk); | |
2968 | struct tcp_fastopen_request *fo = tp->fastopen_req; | |
aab48743 | 2969 | int syn_loss = 0, space, i, err = 0, iovlen = fo->data->msg_iovlen; |
783237e8 | 2970 | struct sk_buff *syn_data = NULL, *data; |
aab48743 YC |
2971 | unsigned long last_syn_loss = 0; |
2972 | ||
67da22d2 | 2973 | tp->rx_opt.mss_clamp = tp->advmss; /* If MSS is not cached */ |
aab48743 YC |
2974 | tcp_fastopen_cache_get(sk, &tp->rx_opt.mss_clamp, &fo->cookie, |
2975 | &syn_loss, &last_syn_loss); | |
2976 | /* Recurring FO SYN losses: revert to regular handshake temporarily */ | |
2977 | if (syn_loss > 1 && | |
2978 | time_before(jiffies, last_syn_loss + (60*HZ << syn_loss))) { | |
2979 | fo->cookie.len = -1; | |
2980 | goto fallback; | |
2981 | } | |
783237e8 | 2982 | |
67da22d2 YC |
2983 | if (sysctl_tcp_fastopen & TFO_CLIENT_NO_COOKIE) |
2984 | fo->cookie.len = -1; | |
2985 | else if (fo->cookie.len <= 0) | |
783237e8 YC |
2986 | goto fallback; |
2987 | ||
2988 | /* MSS for SYN-data is based on cached MSS and bounded by PMTU and | |
2989 | * user-MSS. Reserve maximum option space for middleboxes that add | |
2990 | * private TCP options. The cost is reduced data space in SYN :( | |
2991 | */ | |
2992 | if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < tp->rx_opt.mss_clamp) | |
2993 | tp->rx_opt.mss_clamp = tp->rx_opt.user_mss; | |
1b63edd6 | 2994 | space = __tcp_mtu_to_mss(sk, inet_csk(sk)->icsk_pmtu_cookie) - |
783237e8 YC |
2995 | MAX_TCP_OPTION_SPACE; |
2996 | ||
f5ddcbbb ED |
2997 | space = min_t(size_t, space, fo->size); |
2998 | ||
2999 | /* limit to order-0 allocations */ | |
3000 | space = min_t(size_t, space, SKB_MAX_HEAD(MAX_TCP_HEADER)); | |
3001 | ||
3002 | syn_data = skb_copy_expand(syn, MAX_TCP_HEADER, space, | |
783237e8 YC |
3003 | sk->sk_allocation); |
3004 | if (syn_data == NULL) | |
3005 | goto fallback; | |
3006 | ||
3007 | for (i = 0; i < iovlen && syn_data->len < space; ++i) { | |
3008 | struct iovec *iov = &fo->data->msg_iov[i]; | |
3009 | unsigned char __user *from = iov->iov_base; | |
3010 | int len = iov->iov_len; | |
3011 | ||
3012 | if (syn_data->len + len > space) | |
3013 | len = space - syn_data->len; | |
3014 | else if (i + 1 == iovlen) | |
3015 | /* No more data pending in inet_wait_for_connect() */ | |
3016 | fo->data = NULL; | |
3017 | ||
3018 | if (skb_add_data(syn_data, from, len)) | |
3019 | goto fallback; | |
3020 | } | |
3021 | ||
3022 | /* Queue a data-only packet after the regular SYN for retransmission */ | |
3023 | data = pskb_copy(syn_data, sk->sk_allocation); | |
3024 | if (data == NULL) | |
3025 | goto fallback; | |
3026 | TCP_SKB_CB(data)->seq++; | |
3027 | TCP_SKB_CB(data)->tcp_flags &= ~TCPHDR_SYN; | |
3028 | TCP_SKB_CB(data)->tcp_flags = (TCPHDR_ACK|TCPHDR_PSH); | |
3029 | tcp_connect_queue_skb(sk, data); | |
3030 | fo->copied = data->len; | |
3031 | ||
431a9124 ED |
3032 | /* syn_data is about to be sent, we need to take current time stamps |
3033 | * for the packets that are in write queue : SYN packet and DATA | |
3034 | */ | |
3035 | skb_mstamp_get(&syn->skb_mstamp); | |
3036 | data->skb_mstamp = syn->skb_mstamp; | |
3037 | ||
783237e8 | 3038 | if (tcp_transmit_skb(sk, syn_data, 0, sk->sk_allocation) == 0) { |
67da22d2 | 3039 | tp->syn_data = (fo->copied > 0); |
f19c29e3 | 3040 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPORIGDATASENT); |
783237e8 YC |
3041 | goto done; |
3042 | } | |
3043 | syn_data = NULL; | |
3044 | ||
3045 | fallback: | |
3046 | /* Send a regular SYN with Fast Open cookie request option */ | |
3047 | if (fo->cookie.len > 0) | |
3048 | fo->cookie.len = 0; | |
3049 | err = tcp_transmit_skb(sk, syn, 1, sk->sk_allocation); | |
3050 | if (err) | |
3051 | tp->syn_fastopen = 0; | |
3052 | kfree_skb(syn_data); | |
3053 | done: | |
3054 | fo->cookie.len = -1; /* Exclude Fast Open option for SYN retries */ | |
3055 | return err; | |
3056 | } | |
3057 | ||
67edfef7 | 3058 | /* Build a SYN and send it off. */ |
1da177e4 LT |
3059 | int tcp_connect(struct sock *sk) |
3060 | { | |
3061 | struct tcp_sock *tp = tcp_sk(sk); | |
3062 | struct sk_buff *buff; | |
ee586811 | 3063 | int err; |
1da177e4 LT |
3064 | |
3065 | tcp_connect_init(sk); | |
3066 | ||
2b916477 AV |
3067 | if (unlikely(tp->repair)) { |
3068 | tcp_finish_connect(sk, NULL); | |
3069 | return 0; | |
3070 | } | |
3071 | ||
d179cd12 | 3072 | buff = alloc_skb_fclone(MAX_TCP_HEADER + 15, sk->sk_allocation); |
1da177e4 LT |
3073 | if (unlikely(buff == NULL)) |
3074 | return -ENOBUFS; | |
3075 | ||
3076 | /* Reserve space for headers. */ | |
3077 | skb_reserve(buff, MAX_TCP_HEADER); | |
3078 | ||
a3433f35 | 3079 | tcp_init_nondata_skb(buff, tp->write_seq++, TCPHDR_SYN); |
7faee5c0 | 3080 | tp->retrans_stamp = tcp_time_stamp; |
783237e8 | 3081 | tcp_connect_queue_skb(sk, buff); |
e870a8ef | 3082 | TCP_ECN_send_syn(sk, buff); |
1da177e4 | 3083 | |
783237e8 YC |
3084 | /* Send off SYN; include data in Fast Open. */ |
3085 | err = tp->fastopen_req ? tcp_send_syn_data(sk, buff) : | |
3086 | tcp_transmit_skb(sk, buff, 1, sk->sk_allocation); | |
ee586811 EP |
3087 | if (err == -ECONNREFUSED) |
3088 | return err; | |
bd37a088 WY |
3089 | |
3090 | /* We change tp->snd_nxt after the tcp_transmit_skb() call | |
3091 | * in order to make this packet get counted in tcpOutSegs. | |
3092 | */ | |
3093 | tp->snd_nxt = tp->write_seq; | |
3094 | tp->pushed_seq = tp->write_seq; | |
81cc8a75 | 3095 | TCP_INC_STATS(sock_net(sk), TCP_MIB_ACTIVEOPENS); |
1da177e4 LT |
3096 | |
3097 | /* Timer for repeating the SYN until an answer. */ | |
3f421baa ACM |
3098 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, |
3099 | inet_csk(sk)->icsk_rto, TCP_RTO_MAX); | |
1da177e4 LT |
3100 | return 0; |
3101 | } | |
4bc2f18b | 3102 | EXPORT_SYMBOL(tcp_connect); |
1da177e4 LT |
3103 | |
3104 | /* Send out a delayed ack, the caller does the policy checking | |
3105 | * to see if we should even be here. See tcp_input.c:tcp_ack_snd_check() | |
3106 | * for details. | |
3107 | */ | |
3108 | void tcp_send_delayed_ack(struct sock *sk) | |
3109 | { | |
463c84b9 ACM |
3110 | struct inet_connection_sock *icsk = inet_csk(sk); |
3111 | int ato = icsk->icsk_ack.ato; | |
1da177e4 LT |
3112 | unsigned long timeout; |
3113 | ||
3114 | if (ato > TCP_DELACK_MIN) { | |
463c84b9 | 3115 | const struct tcp_sock *tp = tcp_sk(sk); |
056834d9 | 3116 | int max_ato = HZ / 2; |
1da177e4 | 3117 | |
056834d9 IJ |
3118 | if (icsk->icsk_ack.pingpong || |
3119 | (icsk->icsk_ack.pending & ICSK_ACK_PUSHED)) | |
1da177e4 LT |
3120 | max_ato = TCP_DELACK_MAX; |
3121 | ||
3122 | /* Slow path, intersegment interval is "high". */ | |
3123 | ||
3124 | /* If some rtt estimate is known, use it to bound delayed ack. | |
463c84b9 | 3125 | * Do not use inet_csk(sk)->icsk_rto here, use results of rtt measurements |
1da177e4 LT |
3126 | * directly. |
3127 | */ | |
740b0f18 ED |
3128 | if (tp->srtt_us) { |
3129 | int rtt = max_t(int, usecs_to_jiffies(tp->srtt_us >> 3), | |
3130 | TCP_DELACK_MIN); | |
1da177e4 LT |
3131 | |
3132 | if (rtt < max_ato) | |
3133 | max_ato = rtt; | |
3134 | } | |
3135 | ||
3136 | ato = min(ato, max_ato); | |
3137 | } | |
3138 | ||
3139 | /* Stay within the limit we were given */ | |
3140 | timeout = jiffies + ato; | |
3141 | ||
3142 | /* Use new timeout only if there wasn't a older one earlier. */ | |
463c84b9 | 3143 | if (icsk->icsk_ack.pending & ICSK_ACK_TIMER) { |
1da177e4 LT |
3144 | /* If delack timer was blocked or is about to expire, |
3145 | * send ACK now. | |
3146 | */ | |
463c84b9 ACM |
3147 | if (icsk->icsk_ack.blocked || |
3148 | time_before_eq(icsk->icsk_ack.timeout, jiffies + (ato >> 2))) { | |
1da177e4 LT |
3149 | tcp_send_ack(sk); |
3150 | return; | |
3151 | } | |
3152 | ||
463c84b9 ACM |
3153 | if (!time_before(timeout, icsk->icsk_ack.timeout)) |
3154 | timeout = icsk->icsk_ack.timeout; | |
1da177e4 | 3155 | } |
463c84b9 ACM |
3156 | icsk->icsk_ack.pending |= ICSK_ACK_SCHED | ICSK_ACK_TIMER; |
3157 | icsk->icsk_ack.timeout = timeout; | |
3158 | sk_reset_timer(sk, &icsk->icsk_delack_timer, timeout); | |
1da177e4 LT |
3159 | } |
3160 | ||
3161 | /* This routine sends an ack and also updates the window. */ | |
3162 | void tcp_send_ack(struct sock *sk) | |
3163 | { | |
058dc334 | 3164 | struct sk_buff *buff; |
1da177e4 | 3165 | |
058dc334 IJ |
3166 | /* If we have been reset, we may not send again. */ |
3167 | if (sk->sk_state == TCP_CLOSE) | |
3168 | return; | |
1da177e4 | 3169 | |
058dc334 IJ |
3170 | /* We are not putting this on the write queue, so |
3171 | * tcp_transmit_skb() will set the ownership to this | |
3172 | * sock. | |
3173 | */ | |
99a1dec7 | 3174 | buff = alloc_skb(MAX_TCP_HEADER, sk_gfp_atomic(sk, GFP_ATOMIC)); |
058dc334 IJ |
3175 | if (buff == NULL) { |
3176 | inet_csk_schedule_ack(sk); | |
3177 | inet_csk(sk)->icsk_ack.ato = TCP_ATO_MIN; | |
3178 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK, | |
3179 | TCP_DELACK_MAX, TCP_RTO_MAX); | |
3180 | return; | |
1da177e4 | 3181 | } |
058dc334 IJ |
3182 | |
3183 | /* Reserve space for headers and prepare control bits. */ | |
3184 | skb_reserve(buff, MAX_TCP_HEADER); | |
a3433f35 | 3185 | tcp_init_nondata_skb(buff, tcp_acceptable_seq(sk), TCPHDR_ACK); |
058dc334 IJ |
3186 | |
3187 | /* Send it off, this clears delayed acks for us. */ | |
7faee5c0 | 3188 | skb_mstamp_get(&buff->skb_mstamp); |
99a1dec7 | 3189 | tcp_transmit_skb(sk, buff, 0, sk_gfp_atomic(sk, GFP_ATOMIC)); |
1da177e4 LT |
3190 | } |
3191 | ||
3192 | /* This routine sends a packet with an out of date sequence | |
3193 | * number. It assumes the other end will try to ack it. | |
3194 | * | |
3195 | * Question: what should we make while urgent mode? | |
3196 | * 4.4BSD forces sending single byte of data. We cannot send | |
3197 | * out of window data, because we have SND.NXT==SND.MAX... | |
3198 | * | |
3199 | * Current solution: to send TWO zero-length segments in urgent mode: | |
3200 | * one is with SEG.SEQ=SND.UNA to deliver urgent pointer, another is | |
3201 | * out-of-date with SND.UNA-1 to probe window. | |
3202 | */ | |
3203 | static int tcp_xmit_probe_skb(struct sock *sk, int urgent) | |
3204 | { | |
3205 | struct tcp_sock *tp = tcp_sk(sk); | |
3206 | struct sk_buff *skb; | |
3207 | ||
3208 | /* We don't queue it, tcp_transmit_skb() sets ownership. */ | |
99a1dec7 | 3209 | skb = alloc_skb(MAX_TCP_HEADER, sk_gfp_atomic(sk, GFP_ATOMIC)); |
e905a9ed | 3210 | if (skb == NULL) |
1da177e4 LT |
3211 | return -1; |
3212 | ||
3213 | /* Reserve space for headers and set control bits. */ | |
3214 | skb_reserve(skb, MAX_TCP_HEADER); | |
1da177e4 LT |
3215 | /* Use a previous sequence. This should cause the other |
3216 | * end to send an ack. Don't queue or clone SKB, just | |
3217 | * send it. | |
3218 | */ | |
a3433f35 | 3219 | tcp_init_nondata_skb(skb, tp->snd_una - !urgent, TCPHDR_ACK); |
7faee5c0 | 3220 | skb_mstamp_get(&skb->skb_mstamp); |
dfb4b9dc | 3221 | return tcp_transmit_skb(sk, skb, 0, GFP_ATOMIC); |
1da177e4 LT |
3222 | } |
3223 | ||
ee995283 PE |
3224 | void tcp_send_window_probe(struct sock *sk) |
3225 | { | |
3226 | if (sk->sk_state == TCP_ESTABLISHED) { | |
3227 | tcp_sk(sk)->snd_wl1 = tcp_sk(sk)->rcv_nxt - 1; | |
3228 | tcp_xmit_probe_skb(sk, 0); | |
3229 | } | |
3230 | } | |
3231 | ||
67edfef7 | 3232 | /* Initiate keepalive or window probe from timer. */ |
1da177e4 LT |
3233 | int tcp_write_wakeup(struct sock *sk) |
3234 | { | |
058dc334 IJ |
3235 | struct tcp_sock *tp = tcp_sk(sk); |
3236 | struct sk_buff *skb; | |
1da177e4 | 3237 | |
058dc334 IJ |
3238 | if (sk->sk_state == TCP_CLOSE) |
3239 | return -1; | |
3240 | ||
3241 | if ((skb = tcp_send_head(sk)) != NULL && | |
3242 | before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp))) { | |
3243 | int err; | |
0c54b85f | 3244 | unsigned int mss = tcp_current_mss(sk); |
058dc334 IJ |
3245 | unsigned int seg_size = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq; |
3246 | ||
3247 | if (before(tp->pushed_seq, TCP_SKB_CB(skb)->end_seq)) | |
3248 | tp->pushed_seq = TCP_SKB_CB(skb)->end_seq; | |
3249 | ||
3250 | /* We are probing the opening of a window | |
3251 | * but the window size is != 0 | |
3252 | * must have been a result SWS avoidance ( sender ) | |
3253 | */ | |
3254 | if (seg_size < TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq || | |
3255 | skb->len > mss) { | |
3256 | seg_size = min(seg_size, mss); | |
4de075e0 | 3257 | TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_PSH; |
6cc55e09 | 3258 | if (tcp_fragment(sk, skb, seg_size, mss, GFP_ATOMIC)) |
058dc334 IJ |
3259 | return -1; |
3260 | } else if (!tcp_skb_pcount(skb)) | |
3261 | tcp_set_skb_tso_segs(sk, skb, mss); | |
3262 | ||
4de075e0 | 3263 | TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_PSH; |
058dc334 IJ |
3264 | err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC); |
3265 | if (!err) | |
3266 | tcp_event_new_data_sent(sk, skb); | |
3267 | return err; | |
3268 | } else { | |
33f5f57e | 3269 | if (between(tp->snd_up, tp->snd_una + 1, tp->snd_una + 0xFFFF)) |
058dc334 IJ |
3270 | tcp_xmit_probe_skb(sk, 1); |
3271 | return tcp_xmit_probe_skb(sk, 0); | |
1da177e4 | 3272 | } |
1da177e4 LT |
3273 | } |
3274 | ||
3275 | /* A window probe timeout has occurred. If window is not closed send | |
3276 | * a partial packet else a zero probe. | |
3277 | */ | |
3278 | void tcp_send_probe0(struct sock *sk) | |
3279 | { | |
463c84b9 | 3280 | struct inet_connection_sock *icsk = inet_csk(sk); |
1da177e4 | 3281 | struct tcp_sock *tp = tcp_sk(sk); |
fcdd1cf4 | 3282 | unsigned long probe_max; |
1da177e4 LT |
3283 | int err; |
3284 | ||
3285 | err = tcp_write_wakeup(sk); | |
3286 | ||
fe067e8a | 3287 | if (tp->packets_out || !tcp_send_head(sk)) { |
1da177e4 | 3288 | /* Cancel probe timer, if it is not required. */ |
6687e988 | 3289 | icsk->icsk_probes_out = 0; |
463c84b9 | 3290 | icsk->icsk_backoff = 0; |
1da177e4 LT |
3291 | return; |
3292 | } | |
3293 | ||
3294 | if (err <= 0) { | |
463c84b9 ACM |
3295 | if (icsk->icsk_backoff < sysctl_tcp_retries2) |
3296 | icsk->icsk_backoff++; | |
6687e988 | 3297 | icsk->icsk_probes_out++; |
fcdd1cf4 | 3298 | probe_max = TCP_RTO_MAX; |
1da177e4 LT |
3299 | } else { |
3300 | /* If packet was not sent due to local congestion, | |
6687e988 | 3301 | * do not backoff and do not remember icsk_probes_out. |
1da177e4 LT |
3302 | * Let local senders to fight for local resources. |
3303 | * | |
3304 | * Use accumulated backoff yet. | |
3305 | */ | |
6687e988 ACM |
3306 | if (!icsk->icsk_probes_out) |
3307 | icsk->icsk_probes_out = 1; | |
fcdd1cf4 | 3308 | probe_max = TCP_RESOURCE_PROBE_INTERVAL; |
1da177e4 | 3309 | } |
fcdd1cf4 ED |
3310 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0, |
3311 | inet_csk_rto_backoff(icsk, probe_max), | |
3312 | TCP_RTO_MAX); | |
1da177e4 | 3313 | } |
5db92c99 OP |
3314 | |
3315 | int tcp_rtx_synack(struct sock *sk, struct request_sock *req) | |
3316 | { | |
3317 | const struct tcp_request_sock_ops *af_ops = tcp_rsk(req)->af_specific; | |
3318 | struct flowi fl; | |
3319 | int res; | |
3320 | ||
3321 | res = af_ops->send_synack(sk, NULL, &fl, req, 0, NULL); | |
3322 | if (!res) { | |
3323 | TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_RETRANSSEGS); | |
3324 | NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPSYNRETRANS); | |
3325 | } | |
3326 | return res; | |
3327 | } | |
3328 | EXPORT_SYMBOL(tcp_rtx_synack); |