]>
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> |
60e2a778 | 44 | #include <linux/static_key.h> |
1da177e4 | 45 | |
e086101b CW |
46 | #include <trace/events/tcp.h> |
47 | ||
1da177e4 | 48 | /* People can turn this off for buggy TCP's found in printers etc. */ |
ab32ea5d | 49 | int sysctl_tcp_retrans_collapse __read_mostly = 1; |
1da177e4 | 50 | |
09cb105e | 51 | /* People can turn this on to work with those rare, broken TCPs that |
15d99e02 RJ |
52 | * interpret the window field as a signed quantity. |
53 | */ | |
ab32ea5d | 54 | int sysctl_tcp_workaround_signed_windows __read_mostly = 0; |
15d99e02 | 55 | |
c39c4c6a WL |
56 | /* Default TSQ limit of four TSO segments */ |
57 | int sysctl_tcp_limit_output_bytes __read_mostly = 262144; | |
46d3ceab | 58 | |
1da177e4 LT |
59 | /* This limits the percentage of the congestion window which we |
60 | * will allow a single TSO frame to consume. Building TSO frames | |
61 | * which are too large can cause TCP streams to be bursty. | |
62 | */ | |
ab32ea5d | 63 | int sysctl_tcp_tso_win_divisor __read_mostly = 3; |
1da177e4 | 64 | |
35089bb2 | 65 | /* By default, RFC2861 behavior. */ |
ab32ea5d | 66 | int sysctl_tcp_slow_start_after_idle __read_mostly = 1; |
35089bb2 | 67 | |
46d3ceab ED |
68 | static bool tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle, |
69 | int push_one, gfp_t gfp); | |
519855c5 | 70 | |
67edfef7 | 71 | /* Account for new data that has been sent to the network. */ |
75c119af | 72 | static void tcp_event_new_data_sent(struct sock *sk, struct sk_buff *skb) |
1da177e4 | 73 | { |
6ba8a3b1 | 74 | struct inet_connection_sock *icsk = inet_csk(sk); |
9e412ba7 | 75 | struct tcp_sock *tp = tcp_sk(sk); |
66f5fe62 | 76 | unsigned int prior_packets = tp->packets_out; |
9e412ba7 | 77 | |
1da177e4 | 78 | tp->snd_nxt = TCP_SKB_CB(skb)->end_seq; |
8512430e | 79 | |
75c119af ED |
80 | __skb_unlink(skb, &sk->sk_write_queue); |
81 | tcp_rbtree_insert(&sk->tcp_rtx_queue, skb); | |
82 | ||
66f5fe62 | 83 | tp->packets_out += tcp_skb_pcount(skb); |
bec41a11 | 84 | if (!prior_packets || icsk->icsk_pending == ICSK_TIME_LOSS_PROBE) |
750ea2ba | 85 | tcp_rearm_rto(sk); |
f19c29e3 | 86 | |
f7324acd DM |
87 | NET_ADD_STATS(sock_net(sk), LINUX_MIB_TCPORIGDATASENT, |
88 | tcp_skb_pcount(skb)); | |
1da177e4 LT |
89 | } |
90 | ||
a4ecb15a CC |
91 | /* SND.NXT, if window was not shrunk or the amount of shrunk was less than one |
92 | * window scaling factor due to loss of precision. | |
1da177e4 LT |
93 | * If window has been shrunk, what should we make? It is not clear at all. |
94 | * Using SND.UNA we will fail to open window, SND.NXT is out of window. :-( | |
95 | * Anything in between SND.UNA...SND.UNA+SND.WND also can be already | |
96 | * invalid. OK, let's make this for now: | |
97 | */ | |
cf533ea5 | 98 | static inline __u32 tcp_acceptable_seq(const struct sock *sk) |
1da177e4 | 99 | { |
cf533ea5 | 100 | const struct tcp_sock *tp = tcp_sk(sk); |
9e412ba7 | 101 | |
a4ecb15a CC |
102 | if (!before(tcp_wnd_end(tp), tp->snd_nxt) || |
103 | (tp->rx_opt.wscale_ok && | |
104 | ((tp->snd_nxt - tcp_wnd_end(tp)) < (1 << tp->rx_opt.rcv_wscale)))) | |
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". | |
6f021c62 ED |
143 | * This is the first part of cwnd validation mechanism. |
144 | */ | |
145 | void tcp_cwnd_restart(struct sock *sk, s32 delta) | |
1da177e4 | 146 | { |
463c84b9 | 147 | struct tcp_sock *tp = tcp_sk(sk); |
6f021c62 | 148 | u32 restart_cwnd = tcp_init_cwnd(tp, __sk_dst_get(sk)); |
1da177e4 LT |
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); | |
c2203cf7 | 159 | tp->snd_cwnd_stamp = tcp_jiffies32; |
1da177e4 LT |
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 | 167 | struct inet_connection_sock *icsk = inet_csk(sk); |
d635fbe2 | 168 | const u32 now = tcp_jiffies32; |
1da177e4 | 169 | |
05c5a46d NC |
170 | if (tcp_packets_in_flight(tp) == 0) |
171 | tcp_ca_event(sk, CA_EVENT_TX_START); | |
172 | ||
1da177e4 LT |
173 | tp->lsndtime = now; |
174 | ||
175 | /* If it is a reply for ato after last received | |
176 | * packet, enter pingpong mode. | |
177 | */ | |
2251ae46 JM |
178 | if ((u32)(now - icsk->icsk_ack.lrcvtime) < icsk->icsk_ack.ato) |
179 | icsk->icsk_ack.pingpong = 1; | |
1da177e4 LT |
180 | } |
181 | ||
67edfef7 | 182 | /* Account for an ACK we sent. */ |
40efc6fa | 183 | static inline void tcp_event_ack_sent(struct sock *sk, unsigned int pkts) |
1da177e4 | 184 | { |
463c84b9 ACM |
185 | tcp_dec_quickack_mode(sk, pkts); |
186 | inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK); | |
1da177e4 LT |
187 | } |
188 | ||
85f16525 YC |
189 | |
190 | u32 tcp_default_init_rwnd(u32 mss) | |
191 | { | |
192 | /* Initial receive window should be twice of TCP_INIT_CWND to | |
9ef71e0c | 193 | * enable proper sending of new unsent data during fast recovery |
85f16525 YC |
194 | * (RFC 3517, Section 4, NextSeg() rule (2)). Further place a |
195 | * limit when mss is larger than 1460. | |
196 | */ | |
197 | u32 init_rwnd = TCP_INIT_CWND * 2; | |
198 | ||
199 | if (mss > 1460) | |
200 | init_rwnd = max((1460 * init_rwnd) / mss, 2U); | |
201 | return init_rwnd; | |
202 | } | |
203 | ||
1da177e4 LT |
204 | /* Determine a window scaling and initial window to offer. |
205 | * Based on the assumption that the given amount of space | |
206 | * will be offered. Store the results in the tp structure. | |
207 | * NOTE: for smooth operation initial space offering should | |
208 | * be a multiple of mss if possible. We assume here that mss >= 1. | |
209 | * This MUST be enforced by all callers. | |
210 | */ | |
211 | void tcp_select_initial_window(int __space, __u32 mss, | |
212 | __u32 *rcv_wnd, __u32 *window_clamp, | |
31d12926 | 213 | int wscale_ok, __u8 *rcv_wscale, |
214 | __u32 init_rcv_wnd) | |
1da177e4 LT |
215 | { |
216 | unsigned int space = (__space < 0 ? 0 : __space); | |
217 | ||
218 | /* If no clamp set the clamp to the max possible scaled window */ | |
219 | if (*window_clamp == 0) | |
589c49cb | 220 | (*window_clamp) = (U16_MAX << TCP_MAX_WSCALE); |
1da177e4 LT |
221 | space = min(*window_clamp, space); |
222 | ||
223 | /* Quantize space offering to a multiple of mss if possible. */ | |
224 | if (space > mss) | |
589c49cb | 225 | space = rounddown(space, mss); |
1da177e4 LT |
226 | |
227 | /* NOTE: offering an initial window larger than 32767 | |
15d99e02 RJ |
228 | * will break some buggy TCP stacks. If the admin tells us |
229 | * it is likely we could be speaking with such a buggy stack | |
230 | * we will truncate our initial window offering to 32K-1 | |
231 | * unless the remote has sent us a window scaling option, | |
232 | * which we interpret as a sign the remote TCP is not | |
233 | * misinterpreting the window field as a signed quantity. | |
1da177e4 | 234 | */ |
15d99e02 RJ |
235 | if (sysctl_tcp_workaround_signed_windows) |
236 | (*rcv_wnd) = min(space, MAX_TCP_WINDOW); | |
237 | else | |
238 | (*rcv_wnd) = space; | |
239 | ||
1da177e4 LT |
240 | (*rcv_wscale) = 0; |
241 | if (wscale_ok) { | |
589c49cb | 242 | /* Set window scaling on max possible window */ |
f626300a SHY |
243 | space = max_t(u32, space, sysctl_tcp_rmem[2]); |
244 | space = max_t(u32, space, sysctl_rmem_max); | |
316c1592 | 245 | space = min_t(u32, space, *window_clamp); |
589c49cb | 246 | while (space > U16_MAX && (*rcv_wscale) < TCP_MAX_WSCALE) { |
1da177e4 LT |
247 | space >>= 1; |
248 | (*rcv_wscale)++; | |
249 | } | |
250 | } | |
251 | ||
056834d9 | 252 | if (mss > (1 << *rcv_wscale)) { |
85f16525 YC |
253 | if (!init_rcv_wnd) /* Use default unless specified otherwise */ |
254 | init_rcv_wnd = tcp_default_init_rwnd(mss); | |
255 | *rcv_wnd = min(*rcv_wnd, init_rcv_wnd * mss); | |
1da177e4 LT |
256 | } |
257 | ||
258 | /* Set the clamp no higher than max representable value */ | |
589c49cb | 259 | (*window_clamp) = min_t(__u32, U16_MAX << (*rcv_wscale), *window_clamp); |
1da177e4 | 260 | } |
4bc2f18b | 261 | EXPORT_SYMBOL(tcp_select_initial_window); |
1da177e4 LT |
262 | |
263 | /* Chose a new window to advertise, update state in tcp_sock for the | |
264 | * socket, and return result with RFC1323 scaling applied. The return | |
265 | * value can be stuffed directly into th->window for an outgoing | |
266 | * frame. | |
267 | */ | |
40efc6fa | 268 | static u16 tcp_select_window(struct sock *sk) |
1da177e4 LT |
269 | { |
270 | struct tcp_sock *tp = tcp_sk(sk); | |
8e165e20 | 271 | u32 old_win = tp->rcv_wnd; |
1da177e4 LT |
272 | u32 cur_win = tcp_receive_window(tp); |
273 | u32 new_win = __tcp_select_window(sk); | |
274 | ||
275 | /* Never shrink the offered window */ | |
2de979bd | 276 | if (new_win < cur_win) { |
1da177e4 LT |
277 | /* Danger Will Robinson! |
278 | * Don't update rcv_wup/rcv_wnd here or else | |
279 | * we will not be able to advertise a zero | |
280 | * window in time. --DaveM | |
281 | * | |
282 | * Relax Will Robinson. | |
283 | */ | |
8e165e20 FW |
284 | if (new_win == 0) |
285 | NET_INC_STATS(sock_net(sk), | |
286 | LINUX_MIB_TCPWANTZEROWINDOWADV); | |
607bfbf2 | 287 | new_win = ALIGN(cur_win, 1 << tp->rx_opt.rcv_wscale); |
1da177e4 LT |
288 | } |
289 | tp->rcv_wnd = new_win; | |
290 | tp->rcv_wup = tp->rcv_nxt; | |
291 | ||
292 | /* Make sure we do not exceed the maximum possible | |
293 | * scaled window. | |
294 | */ | |
15d99e02 | 295 | if (!tp->rx_opt.rcv_wscale && sysctl_tcp_workaround_signed_windows) |
1da177e4 LT |
296 | new_win = min(new_win, MAX_TCP_WINDOW); |
297 | else | |
298 | new_win = min(new_win, (65535U << tp->rx_opt.rcv_wscale)); | |
299 | ||
300 | /* RFC1323 scaling applied */ | |
301 | new_win >>= tp->rx_opt.rcv_wscale; | |
302 | ||
31770e34 | 303 | /* If we advertise zero window, disable fast path. */ |
8e165e20 | 304 | if (new_win == 0) { |
31770e34 | 305 | tp->pred_flags = 0; |
8e165e20 FW |
306 | if (old_win) |
307 | NET_INC_STATS(sock_net(sk), | |
308 | LINUX_MIB_TCPTOZEROWINDOWADV); | |
309 | } else if (old_win == 0) { | |
310 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPFROMZEROWINDOWADV); | |
311 | } | |
1da177e4 LT |
312 | |
313 | return new_win; | |
314 | } | |
315 | ||
67edfef7 | 316 | /* Packet ECN state for a SYN-ACK */ |
735d3831 | 317 | static void tcp_ecn_send_synack(struct sock *sk, struct sk_buff *skb) |
bdf1ee5d | 318 | { |
30e502a3 DB |
319 | const struct tcp_sock *tp = tcp_sk(sk); |
320 | ||
4de075e0 | 321 | TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_CWR; |
056834d9 | 322 | if (!(tp->ecn_flags & TCP_ECN_OK)) |
4de075e0 | 323 | TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_ECE; |
91b5b21c LB |
324 | else if (tcp_ca_needs_ecn(sk) || |
325 | tcp_bpf_ca_needs_ecn(sk)) | |
30e502a3 | 326 | INET_ECN_xmit(sk); |
bdf1ee5d IJ |
327 | } |
328 | ||
67edfef7 | 329 | /* Packet ECN state for a SYN. */ |
735d3831 | 330 | static void tcp_ecn_send_syn(struct sock *sk, struct sk_buff *skb) |
bdf1ee5d IJ |
331 | { |
332 | struct tcp_sock *tp = tcp_sk(sk); | |
91b5b21c | 333 | bool bpf_needs_ecn = tcp_bpf_ca_needs_ecn(sk); |
f7b3bec6 | 334 | bool use_ecn = sock_net(sk)->ipv4.sysctl_tcp_ecn == 1 || |
91b5b21c | 335 | tcp_ca_needs_ecn(sk) || bpf_needs_ecn; |
f7b3bec6 FW |
336 | |
337 | if (!use_ecn) { | |
338 | const struct dst_entry *dst = __sk_dst_get(sk); | |
339 | ||
340 | if (dst && dst_feature(dst, RTAX_FEATURE_ECN)) | |
341 | use_ecn = true; | |
342 | } | |
bdf1ee5d IJ |
343 | |
344 | tp->ecn_flags = 0; | |
f7b3bec6 FW |
345 | |
346 | if (use_ecn) { | |
4de075e0 | 347 | TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_ECE | TCPHDR_CWR; |
bdf1ee5d | 348 | tp->ecn_flags = TCP_ECN_OK; |
91b5b21c | 349 | if (tcp_ca_needs_ecn(sk) || bpf_needs_ecn) |
30e502a3 | 350 | INET_ECN_xmit(sk); |
bdf1ee5d IJ |
351 | } |
352 | } | |
353 | ||
49213555 DB |
354 | static void tcp_ecn_clear_syn(struct sock *sk, struct sk_buff *skb) |
355 | { | |
356 | if (sock_net(sk)->ipv4.sysctl_tcp_ecn_fallback) | |
357 | /* tp->ecn_flags are cleared at a later point in time when | |
358 | * SYN ACK is ultimatively being received. | |
359 | */ | |
360 | TCP_SKB_CB(skb)->tcp_flags &= ~(TCPHDR_ECE | TCPHDR_CWR); | |
361 | } | |
362 | ||
735d3831 | 363 | static void |
6ac705b1 | 364 | tcp_ecn_make_synack(const struct request_sock *req, struct tcphdr *th) |
bdf1ee5d | 365 | { |
6ac705b1 | 366 | if (inet_rsk(req)->ecn_ok) |
bdf1ee5d IJ |
367 | th->ece = 1; |
368 | } | |
369 | ||
67edfef7 AK |
370 | /* Set up ECN state for a packet on a ESTABLISHED socket that is about to |
371 | * be sent. | |
372 | */ | |
735d3831 | 373 | static void tcp_ecn_send(struct sock *sk, struct sk_buff *skb, |
ea1627c2 | 374 | struct tcphdr *th, int tcp_header_len) |
bdf1ee5d IJ |
375 | { |
376 | struct tcp_sock *tp = tcp_sk(sk); | |
377 | ||
378 | if (tp->ecn_flags & TCP_ECN_OK) { | |
379 | /* Not-retransmitted data segment: set ECT and inject CWR. */ | |
380 | if (skb->len != tcp_header_len && | |
381 | !before(TCP_SKB_CB(skb)->seq, tp->snd_nxt)) { | |
382 | INET_ECN_xmit(sk); | |
056834d9 | 383 | if (tp->ecn_flags & TCP_ECN_QUEUE_CWR) { |
bdf1ee5d | 384 | tp->ecn_flags &= ~TCP_ECN_QUEUE_CWR; |
ea1627c2 | 385 | th->cwr = 1; |
bdf1ee5d IJ |
386 | skb_shinfo(skb)->gso_type |= SKB_GSO_TCP_ECN; |
387 | } | |
30e502a3 | 388 | } else if (!tcp_ca_needs_ecn(sk)) { |
bdf1ee5d IJ |
389 | /* ACK or retransmitted segment: clear ECT|CE */ |
390 | INET_ECN_dontxmit(sk); | |
391 | } | |
392 | if (tp->ecn_flags & TCP_ECN_DEMAND_CWR) | |
ea1627c2 | 393 | th->ece = 1; |
bdf1ee5d IJ |
394 | } |
395 | } | |
396 | ||
e870a8ef IJ |
397 | /* Constructs common control bits of non-data skb. If SYN/FIN is present, |
398 | * auto increment end seqno. | |
399 | */ | |
400 | static void tcp_init_nondata_skb(struct sk_buff *skb, u32 seq, u8 flags) | |
401 | { | |
2e8e18ef | 402 | skb->ip_summed = CHECKSUM_PARTIAL; |
e870a8ef IJ |
403 | skb->csum = 0; |
404 | ||
4de075e0 | 405 | TCP_SKB_CB(skb)->tcp_flags = flags; |
e870a8ef IJ |
406 | TCP_SKB_CB(skb)->sacked = 0; |
407 | ||
cd7d8498 | 408 | tcp_skb_pcount_set(skb, 1); |
e870a8ef IJ |
409 | |
410 | TCP_SKB_CB(skb)->seq = seq; | |
a3433f35 | 411 | if (flags & (TCPHDR_SYN | TCPHDR_FIN)) |
e870a8ef IJ |
412 | seq++; |
413 | TCP_SKB_CB(skb)->end_seq = seq; | |
414 | } | |
415 | ||
a2a385d6 | 416 | static inline bool tcp_urg_mode(const struct tcp_sock *tp) |
33f5f57e IJ |
417 | { |
418 | return tp->snd_una != tp->snd_up; | |
419 | } | |
420 | ||
33ad798c AL |
421 | #define OPTION_SACK_ADVERTISE (1 << 0) |
422 | #define OPTION_TS (1 << 1) | |
423 | #define OPTION_MD5 (1 << 2) | |
89e95a61 | 424 | #define OPTION_WSCALE (1 << 3) |
2100c8d2 | 425 | #define OPTION_FAST_OPEN_COOKIE (1 << 8) |
60e2a778 UB |
426 | #define OPTION_SMC (1 << 9) |
427 | ||
428 | static void smc_options_write(__be32 *ptr, u16 *options) | |
429 | { | |
430 | #if IS_ENABLED(CONFIG_SMC) | |
431 | if (static_branch_unlikely(&tcp_have_smc)) { | |
432 | if (unlikely(OPTION_SMC & *options)) { | |
433 | *ptr++ = htonl((TCPOPT_NOP << 24) | | |
434 | (TCPOPT_NOP << 16) | | |
435 | (TCPOPT_EXP << 8) | | |
436 | (TCPOLEN_EXP_SMC_BASE)); | |
437 | *ptr++ = htonl(TCPOPT_SMC_MAGIC); | |
438 | } | |
439 | } | |
440 | #endif | |
441 | } | |
33ad798c AL |
442 | |
443 | struct tcp_out_options { | |
2100c8d2 YC |
444 | u16 options; /* bit field of OPTION_* */ |
445 | u16 mss; /* 0 to disable */ | |
33ad798c AL |
446 | u8 ws; /* window scale, 0 to disable */ |
447 | u8 num_sack_blocks; /* number of SACK blocks to include */ | |
bd0388ae | 448 | u8 hash_size; /* bytes in hash_location */ |
bd0388ae | 449 | __u8 *hash_location; /* temporary pointer, overloaded */ |
2100c8d2 YC |
450 | __u32 tsval, tsecr; /* need to include OPTION_TS */ |
451 | struct tcp_fastopen_cookie *fastopen_cookie; /* Fast open cookie */ | |
33ad798c AL |
452 | }; |
453 | ||
67edfef7 AK |
454 | /* Write previously computed TCP options to the packet. |
455 | * | |
456 | * Beware: Something in the Internet is very sensitive to the ordering of | |
fd6149d3 IJ |
457 | * TCP options, we learned this through the hard way, so be careful here. |
458 | * Luckily we can at least blame others for their non-compliance but from | |
8e3bff96 | 459 | * inter-operability perspective it seems that we're somewhat stuck with |
fd6149d3 IJ |
460 | * the ordering which we have been using if we want to keep working with |
461 | * those broken things (not that it currently hurts anybody as there isn't | |
462 | * particular reason why the ordering would need to be changed). | |
463 | * | |
464 | * At least SACK_PERM as the first option is known to lead to a disaster | |
465 | * (but it may well be that other scenarios fail similarly). | |
466 | */ | |
33ad798c | 467 | static void tcp_options_write(__be32 *ptr, struct tcp_sock *tp, |
bd0388ae WAS |
468 | struct tcp_out_options *opts) |
469 | { | |
2100c8d2 | 470 | u16 options = opts->options; /* mungable copy */ |
bd0388ae | 471 | |
bd0388ae | 472 | if (unlikely(OPTION_MD5 & options)) { |
1a2c6181 CP |
473 | *ptr++ = htonl((TCPOPT_NOP << 24) | (TCPOPT_NOP << 16) | |
474 | (TCPOPT_MD5SIG << 8) | TCPOLEN_MD5SIG); | |
bd0388ae WAS |
475 | /* overload cookie hash location */ |
476 | opts->hash_location = (__u8 *)ptr; | |
33ad798c | 477 | ptr += 4; |
40efc6fa | 478 | } |
33ad798c | 479 | |
fd6149d3 IJ |
480 | if (unlikely(opts->mss)) { |
481 | *ptr++ = htonl((TCPOPT_MSS << 24) | | |
482 | (TCPOLEN_MSS << 16) | | |
483 | opts->mss); | |
484 | } | |
485 | ||
bd0388ae WAS |
486 | if (likely(OPTION_TS & options)) { |
487 | if (unlikely(OPTION_SACK_ADVERTISE & options)) { | |
33ad798c AL |
488 | *ptr++ = htonl((TCPOPT_SACK_PERM << 24) | |
489 | (TCPOLEN_SACK_PERM << 16) | | |
490 | (TCPOPT_TIMESTAMP << 8) | | |
491 | TCPOLEN_TIMESTAMP); | |
bd0388ae | 492 | options &= ~OPTION_SACK_ADVERTISE; |
33ad798c AL |
493 | } else { |
494 | *ptr++ = htonl((TCPOPT_NOP << 24) | | |
495 | (TCPOPT_NOP << 16) | | |
496 | (TCPOPT_TIMESTAMP << 8) | | |
497 | TCPOLEN_TIMESTAMP); | |
498 | } | |
499 | *ptr++ = htonl(opts->tsval); | |
500 | *ptr++ = htonl(opts->tsecr); | |
501 | } | |
502 | ||
bd0388ae | 503 | if (unlikely(OPTION_SACK_ADVERTISE & options)) { |
33ad798c AL |
504 | *ptr++ = htonl((TCPOPT_NOP << 24) | |
505 | (TCPOPT_NOP << 16) | | |
506 | (TCPOPT_SACK_PERM << 8) | | |
507 | TCPOLEN_SACK_PERM); | |
508 | } | |
509 | ||
bd0388ae | 510 | if (unlikely(OPTION_WSCALE & options)) { |
33ad798c AL |
511 | *ptr++ = htonl((TCPOPT_NOP << 24) | |
512 | (TCPOPT_WINDOW << 16) | | |
513 | (TCPOLEN_WINDOW << 8) | | |
514 | opts->ws); | |
515 | } | |
516 | ||
517 | if (unlikely(opts->num_sack_blocks)) { | |
518 | struct tcp_sack_block *sp = tp->rx_opt.dsack ? | |
519 | tp->duplicate_sack : tp->selective_acks; | |
40efc6fa SH |
520 | int this_sack; |
521 | ||
522 | *ptr++ = htonl((TCPOPT_NOP << 24) | | |
523 | (TCPOPT_NOP << 16) | | |
524 | (TCPOPT_SACK << 8) | | |
33ad798c | 525 | (TCPOLEN_SACK_BASE + (opts->num_sack_blocks * |
40efc6fa | 526 | TCPOLEN_SACK_PERBLOCK))); |
2de979bd | 527 | |
33ad798c AL |
528 | for (this_sack = 0; this_sack < opts->num_sack_blocks; |
529 | ++this_sack) { | |
40efc6fa SH |
530 | *ptr++ = htonl(sp[this_sack].start_seq); |
531 | *ptr++ = htonl(sp[this_sack].end_seq); | |
532 | } | |
2de979bd | 533 | |
5861f8e5 | 534 | tp->rx_opt.dsack = 0; |
40efc6fa | 535 | } |
2100c8d2 YC |
536 | |
537 | if (unlikely(OPTION_FAST_OPEN_COOKIE & options)) { | |
538 | struct tcp_fastopen_cookie *foc = opts->fastopen_cookie; | |
7f9b838b DL |
539 | u8 *p = (u8 *)ptr; |
540 | u32 len; /* Fast Open option length */ | |
541 | ||
542 | if (foc->exp) { | |
543 | len = TCPOLEN_EXP_FASTOPEN_BASE + foc->len; | |
544 | *ptr = htonl((TCPOPT_EXP << 24) | (len << 16) | | |
545 | TCPOPT_FASTOPEN_MAGIC); | |
546 | p += TCPOLEN_EXP_FASTOPEN_BASE; | |
547 | } else { | |
548 | len = TCPOLEN_FASTOPEN_BASE + foc->len; | |
549 | *p++ = TCPOPT_FASTOPEN; | |
550 | *p++ = len; | |
551 | } | |
2100c8d2 | 552 | |
7f9b838b DL |
553 | memcpy(p, foc->val, foc->len); |
554 | if ((len & 3) == 2) { | |
555 | p[foc->len] = TCPOPT_NOP; | |
556 | p[foc->len + 1] = TCPOPT_NOP; | |
2100c8d2 | 557 | } |
7f9b838b | 558 | ptr += (len + 3) >> 2; |
2100c8d2 | 559 | } |
60e2a778 UB |
560 | |
561 | smc_options_write(ptr, &options); | |
562 | } | |
563 | ||
564 | static void smc_set_option(const struct tcp_sock *tp, | |
565 | struct tcp_out_options *opts, | |
566 | unsigned int *remaining) | |
567 | { | |
568 | #if IS_ENABLED(CONFIG_SMC) | |
569 | if (static_branch_unlikely(&tcp_have_smc)) { | |
570 | if (tp->syn_smc) { | |
571 | if (*remaining >= TCPOLEN_EXP_SMC_BASE_ALIGNED) { | |
572 | opts->options |= OPTION_SMC; | |
573 | *remaining -= TCPOLEN_EXP_SMC_BASE_ALIGNED; | |
574 | } | |
575 | } | |
576 | } | |
577 | #endif | |
578 | } | |
579 | ||
580 | static void smc_set_option_cond(const struct tcp_sock *tp, | |
581 | const struct inet_request_sock *ireq, | |
582 | struct tcp_out_options *opts, | |
583 | unsigned int *remaining) | |
584 | { | |
585 | #if IS_ENABLED(CONFIG_SMC) | |
586 | if (static_branch_unlikely(&tcp_have_smc)) { | |
587 | if (tp->syn_smc && ireq->smc_ok) { | |
588 | if (*remaining >= TCPOLEN_EXP_SMC_BASE_ALIGNED) { | |
589 | opts->options |= OPTION_SMC; | |
590 | *remaining -= TCPOLEN_EXP_SMC_BASE_ALIGNED; | |
591 | } | |
592 | } | |
593 | } | |
594 | #endif | |
33ad798c AL |
595 | } |
596 | ||
67edfef7 AK |
597 | /* Compute TCP options for SYN packets. This is not the final |
598 | * network wire format yet. | |
599 | */ | |
95c96174 | 600 | static unsigned int tcp_syn_options(struct sock *sk, struct sk_buff *skb, |
33ad798c | 601 | struct tcp_out_options *opts, |
cf533ea5 ED |
602 | struct tcp_md5sig_key **md5) |
603 | { | |
33ad798c | 604 | struct tcp_sock *tp = tcp_sk(sk); |
95c96174 | 605 | unsigned int remaining = MAX_TCP_OPTION_SPACE; |
783237e8 | 606 | struct tcp_fastopen_request *fastopen = tp->fastopen_req; |
33ad798c | 607 | |
cfb6eeb4 | 608 | #ifdef CONFIG_TCP_MD5SIG |
33ad798c AL |
609 | *md5 = tp->af_specific->md5_lookup(sk, sk); |
610 | if (*md5) { | |
611 | opts->options |= OPTION_MD5; | |
bd0388ae | 612 | remaining -= TCPOLEN_MD5SIG_ALIGNED; |
cfb6eeb4 | 613 | } |
33ad798c AL |
614 | #else |
615 | *md5 = NULL; | |
cfb6eeb4 | 616 | #endif |
33ad798c AL |
617 | |
618 | /* We always get an MSS option. The option bytes which will be seen in | |
619 | * normal data packets should timestamps be used, must be in the MSS | |
620 | * advertised. But we subtract them from tp->mss_cache so that | |
621 | * calculations in tcp_sendmsg are simpler etc. So account for this | |
622 | * fact here if necessary. If we don't do this correctly, as a | |
623 | * receiver we won't recognize data packets as being full sized when we | |
624 | * should, and thus we won't abide by the delayed ACK rules correctly. | |
625 | * SACKs don't matter, we never delay an ACK when we have any of those | |
626 | * going out. */ | |
627 | opts->mss = tcp_advertise_mss(sk); | |
bd0388ae | 628 | remaining -= TCPOLEN_MSS_ALIGNED; |
33ad798c | 629 | |
5d2ed052 | 630 | if (likely(sock_net(sk)->ipv4.sysctl_tcp_timestamps && !*md5)) { |
33ad798c | 631 | opts->options |= OPTION_TS; |
7faee5c0 | 632 | opts->tsval = tcp_skb_timestamp(skb) + tp->tsoffset; |
33ad798c | 633 | opts->tsecr = tp->rx_opt.ts_recent; |
bd0388ae | 634 | remaining -= TCPOLEN_TSTAMP_ALIGNED; |
33ad798c | 635 | } |
9bb37ef0 | 636 | if (likely(sock_net(sk)->ipv4.sysctl_tcp_window_scaling)) { |
33ad798c | 637 | opts->ws = tp->rx_opt.rcv_wscale; |
89e95a61 | 638 | opts->options |= OPTION_WSCALE; |
bd0388ae | 639 | remaining -= TCPOLEN_WSCALE_ALIGNED; |
33ad798c | 640 | } |
f9301034 | 641 | if (likely(sock_net(sk)->ipv4.sysctl_tcp_sack)) { |
33ad798c | 642 | opts->options |= OPTION_SACK_ADVERTISE; |
b32d1310 | 643 | if (unlikely(!(OPTION_TS & opts->options))) |
bd0388ae | 644 | remaining -= TCPOLEN_SACKPERM_ALIGNED; |
33ad798c AL |
645 | } |
646 | ||
783237e8 | 647 | if (fastopen && fastopen->cookie.len >= 0) { |
2646c831 DL |
648 | u32 need = fastopen->cookie.len; |
649 | ||
650 | need += fastopen->cookie.exp ? TCPOLEN_EXP_FASTOPEN_BASE : | |
651 | TCPOLEN_FASTOPEN_BASE; | |
783237e8 YC |
652 | need = (need + 3) & ~3U; /* Align to 32 bits */ |
653 | if (remaining >= need) { | |
654 | opts->options |= OPTION_FAST_OPEN_COOKIE; | |
655 | opts->fastopen_cookie = &fastopen->cookie; | |
656 | remaining -= need; | |
657 | tp->syn_fastopen = 1; | |
2646c831 | 658 | tp->syn_fastopen_exp = fastopen->cookie.exp ? 1 : 0; |
783237e8 YC |
659 | } |
660 | } | |
bd0388ae | 661 | |
60e2a778 UB |
662 | smc_set_option(tp, opts, &remaining); |
663 | ||
bd0388ae | 664 | return MAX_TCP_OPTION_SPACE - remaining; |
40efc6fa SH |
665 | } |
666 | ||
67edfef7 | 667 | /* Set up TCP options for SYN-ACKs. */ |
60e2a778 UB |
668 | static unsigned int tcp_synack_options(const struct sock *sk, |
669 | struct request_sock *req, | |
37bfbdda ED |
670 | unsigned int mss, struct sk_buff *skb, |
671 | struct tcp_out_options *opts, | |
672 | const struct tcp_md5sig_key *md5, | |
673 | struct tcp_fastopen_cookie *foc) | |
4957faad | 674 | { |
33ad798c | 675 | struct inet_request_sock *ireq = inet_rsk(req); |
95c96174 | 676 | unsigned int remaining = MAX_TCP_OPTION_SPACE; |
33ad798c | 677 | |
cfb6eeb4 | 678 | #ifdef CONFIG_TCP_MD5SIG |
80f03e27 | 679 | if (md5) { |
33ad798c | 680 | opts->options |= OPTION_MD5; |
4957faad WAS |
681 | remaining -= TCPOLEN_MD5SIG_ALIGNED; |
682 | ||
683 | /* We can't fit any SACK blocks in a packet with MD5 + TS | |
684 | * options. There was discussion about disabling SACK | |
685 | * rather than TS in order to fit in better with old, | |
686 | * buggy kernels, but that was deemed to be unnecessary. | |
687 | */ | |
de213e5e | 688 | ireq->tstamp_ok &= !ireq->sack_ok; |
cfb6eeb4 YH |
689 | } |
690 | #endif | |
33ad798c | 691 | |
4957faad | 692 | /* We always send an MSS option. */ |
33ad798c | 693 | opts->mss = mss; |
4957faad | 694 | remaining -= TCPOLEN_MSS_ALIGNED; |
33ad798c AL |
695 | |
696 | if (likely(ireq->wscale_ok)) { | |
697 | opts->ws = ireq->rcv_wscale; | |
89e95a61 | 698 | opts->options |= OPTION_WSCALE; |
4957faad | 699 | remaining -= TCPOLEN_WSCALE_ALIGNED; |
33ad798c | 700 | } |
de213e5e | 701 | if (likely(ireq->tstamp_ok)) { |
33ad798c | 702 | opts->options |= OPTION_TS; |
95a22cae | 703 | opts->tsval = tcp_skb_timestamp(skb) + tcp_rsk(req)->ts_off; |
33ad798c | 704 | opts->tsecr = req->ts_recent; |
4957faad | 705 | remaining -= TCPOLEN_TSTAMP_ALIGNED; |
33ad798c AL |
706 | } |
707 | if (likely(ireq->sack_ok)) { | |
708 | opts->options |= OPTION_SACK_ADVERTISE; | |
de213e5e | 709 | if (unlikely(!ireq->tstamp_ok)) |
4957faad | 710 | remaining -= TCPOLEN_SACKPERM_ALIGNED; |
33ad798c | 711 | } |
7f9b838b DL |
712 | if (foc != NULL && foc->len >= 0) { |
713 | u32 need = foc->len; | |
714 | ||
715 | need += foc->exp ? TCPOLEN_EXP_FASTOPEN_BASE : | |
716 | TCPOLEN_FASTOPEN_BASE; | |
8336886f JC |
717 | need = (need + 3) & ~3U; /* Align to 32 bits */ |
718 | if (remaining >= need) { | |
719 | opts->options |= OPTION_FAST_OPEN_COOKIE; | |
720 | opts->fastopen_cookie = foc; | |
721 | remaining -= need; | |
722 | } | |
723 | } | |
1a2c6181 | 724 | |
60e2a778 UB |
725 | smc_set_option_cond(tcp_sk(sk), ireq, opts, &remaining); |
726 | ||
4957faad | 727 | return MAX_TCP_OPTION_SPACE - remaining; |
33ad798c AL |
728 | } |
729 | ||
67edfef7 AK |
730 | /* Compute TCP options for ESTABLISHED sockets. This is not the |
731 | * final wire format yet. | |
732 | */ | |
95c96174 | 733 | static unsigned int tcp_established_options(struct sock *sk, struct sk_buff *skb, |
33ad798c | 734 | struct tcp_out_options *opts, |
cf533ea5 ED |
735 | struct tcp_md5sig_key **md5) |
736 | { | |
33ad798c | 737 | struct tcp_sock *tp = tcp_sk(sk); |
95c96174 | 738 | unsigned int size = 0; |
cabeccbd | 739 | unsigned int eff_sacks; |
33ad798c | 740 | |
5843ef42 AK |
741 | opts->options = 0; |
742 | ||
33ad798c AL |
743 | #ifdef CONFIG_TCP_MD5SIG |
744 | *md5 = tp->af_specific->md5_lookup(sk, sk); | |
745 | if (unlikely(*md5)) { | |
746 | opts->options |= OPTION_MD5; | |
747 | size += TCPOLEN_MD5SIG_ALIGNED; | |
748 | } | |
749 | #else | |
750 | *md5 = NULL; | |
751 | #endif | |
752 | ||
753 | if (likely(tp->rx_opt.tstamp_ok)) { | |
754 | opts->options |= OPTION_TS; | |
7faee5c0 | 755 | opts->tsval = skb ? tcp_skb_timestamp(skb) + tp->tsoffset : 0; |
33ad798c AL |
756 | opts->tsecr = tp->rx_opt.ts_recent; |
757 | size += TCPOLEN_TSTAMP_ALIGNED; | |
758 | } | |
759 | ||
cabeccbd IJ |
760 | eff_sacks = tp->rx_opt.num_sacks + tp->rx_opt.dsack; |
761 | if (unlikely(eff_sacks)) { | |
95c96174 | 762 | const unsigned int remaining = MAX_TCP_OPTION_SPACE - size; |
33ad798c | 763 | opts->num_sack_blocks = |
95c96174 | 764 | min_t(unsigned int, eff_sacks, |
33ad798c AL |
765 | (remaining - TCPOLEN_SACK_BASE_ALIGNED) / |
766 | TCPOLEN_SACK_PERBLOCK); | |
767 | size += TCPOLEN_SACK_BASE_ALIGNED + | |
768 | opts->num_sack_blocks * TCPOLEN_SACK_PERBLOCK; | |
769 | } | |
770 | ||
771 | return size; | |
40efc6fa | 772 | } |
1da177e4 | 773 | |
46d3ceab ED |
774 | |
775 | /* TCP SMALL QUEUES (TSQ) | |
776 | * | |
777 | * TSQ goal is to keep small amount of skbs per tcp flow in tx queues (qdisc+dev) | |
778 | * to reduce RTT and bufferbloat. | |
779 | * We do this using a special skb destructor (tcp_wfree). | |
780 | * | |
781 | * Its important tcp_wfree() can be replaced by sock_wfree() in the event skb | |
782 | * needs to be reallocated in a driver. | |
8e3bff96 | 783 | * The invariant being skb->truesize subtracted from sk->sk_wmem_alloc |
46d3ceab ED |
784 | * |
785 | * Since transmit from skb destructor is forbidden, we use a tasklet | |
786 | * to process all sockets that eventually need to send more skbs. | |
787 | * We use one tasklet per cpu, with its own queue of sockets. | |
788 | */ | |
789 | struct tsq_tasklet { | |
790 | struct tasklet_struct tasklet; | |
791 | struct list_head head; /* queue of tcp sockets */ | |
792 | }; | |
793 | static DEFINE_PER_CPU(struct tsq_tasklet, tsq_tasklet); | |
794 | ||
6f458dfb ED |
795 | static void tcp_tsq_handler(struct sock *sk) |
796 | { | |
797 | if ((1 << sk->sk_state) & | |
798 | (TCPF_ESTABLISHED | TCPF_FIN_WAIT1 | TCPF_CLOSING | | |
f9616c35 ED |
799 | TCPF_CLOSE_WAIT | TCPF_LAST_ACK)) { |
800 | struct tcp_sock *tp = tcp_sk(sk); | |
801 | ||
802 | if (tp->lost_out > tp->retrans_out && | |
803 | tp->snd_cwnd > tcp_packets_in_flight(tp)) | |
804 | tcp_xmit_retransmit_queue(sk); | |
805 | ||
806 | tcp_write_xmit(sk, tcp_current_mss(sk), tp->nonagle, | |
bf06200e | 807 | 0, GFP_ATOMIC); |
f9616c35 | 808 | } |
6f458dfb | 809 | } |
46d3ceab | 810 | /* |
8e3bff96 | 811 | * One tasklet per cpu tries to send more skbs. |
46d3ceab | 812 | * We run in tasklet context but need to disable irqs when |
8e3bff96 | 813 | * transferring tsq->head because tcp_wfree() might |
46d3ceab ED |
814 | * interrupt us (non NAPI drivers) |
815 | */ | |
816 | static void tcp_tasklet_func(unsigned long data) | |
817 | { | |
818 | struct tsq_tasklet *tsq = (struct tsq_tasklet *)data; | |
819 | LIST_HEAD(list); | |
820 | unsigned long flags; | |
821 | struct list_head *q, *n; | |
822 | struct tcp_sock *tp; | |
823 | struct sock *sk; | |
824 | ||
825 | local_irq_save(flags); | |
826 | list_splice_init(&tsq->head, &list); | |
827 | local_irq_restore(flags); | |
828 | ||
829 | list_for_each_safe(q, n, &list) { | |
830 | tp = list_entry(q, struct tcp_sock, tsq_node); | |
831 | list_del(&tp->tsq_node); | |
832 | ||
833 | sk = (struct sock *)tp; | |
0a9648f1 | 834 | smp_mb__before_atomic(); |
7aa5470c ED |
835 | clear_bit(TSQ_QUEUED, &sk->sk_tsq_flags); |
836 | ||
b223feb9 | 837 | if (!sk->sk_lock.owned && |
7aa5470c | 838 | test_bit(TCP_TSQ_DEFERRED, &sk->sk_tsq_flags)) { |
b223feb9 ED |
839 | bh_lock_sock(sk); |
840 | if (!sock_owned_by_user(sk)) { | |
7aa5470c | 841 | clear_bit(TCP_TSQ_DEFERRED, &sk->sk_tsq_flags); |
b223feb9 ED |
842 | tcp_tsq_handler(sk); |
843 | } | |
844 | bh_unlock_sock(sk); | |
46d3ceab | 845 | } |
46d3ceab | 846 | |
46d3ceab ED |
847 | sk_free(sk); |
848 | } | |
849 | } | |
850 | ||
40fc3423 ED |
851 | #define TCP_DEFERRED_ALL (TCPF_TSQ_DEFERRED | \ |
852 | TCPF_WRITE_TIMER_DEFERRED | \ | |
853 | TCPF_DELACK_TIMER_DEFERRED | \ | |
854 | TCPF_MTU_REDUCED_DEFERRED) | |
46d3ceab ED |
855 | /** |
856 | * tcp_release_cb - tcp release_sock() callback | |
857 | * @sk: socket | |
858 | * | |
859 | * called from release_sock() to perform protocol dependent | |
860 | * actions before socket release. | |
861 | */ | |
862 | void tcp_release_cb(struct sock *sk) | |
863 | { | |
6f458dfb | 864 | unsigned long flags, nflags; |
46d3ceab | 865 | |
6f458dfb ED |
866 | /* perform an atomic operation only if at least one flag is set */ |
867 | do { | |
7aa5470c | 868 | flags = sk->sk_tsq_flags; |
6f458dfb ED |
869 | if (!(flags & TCP_DEFERRED_ALL)) |
870 | return; | |
871 | nflags = flags & ~TCP_DEFERRED_ALL; | |
7aa5470c | 872 | } while (cmpxchg(&sk->sk_tsq_flags, flags, nflags) != flags); |
6f458dfb | 873 | |
40fc3423 | 874 | if (flags & TCPF_TSQ_DEFERRED) |
6f458dfb ED |
875 | tcp_tsq_handler(sk); |
876 | ||
c3f9b018 ED |
877 | /* Here begins the tricky part : |
878 | * We are called from release_sock() with : | |
879 | * 1) BH disabled | |
880 | * 2) sk_lock.slock spinlock held | |
881 | * 3) socket owned by us (sk->sk_lock.owned == 1) | |
882 | * | |
883 | * But following code is meant to be called from BH handlers, | |
884 | * so we should keep BH disabled, but early release socket ownership | |
885 | */ | |
886 | sock_release_ownership(sk); | |
887 | ||
40fc3423 | 888 | if (flags & TCPF_WRITE_TIMER_DEFERRED) { |
6f458dfb | 889 | tcp_write_timer_handler(sk); |
144d56e9 ED |
890 | __sock_put(sk); |
891 | } | |
40fc3423 | 892 | if (flags & TCPF_DELACK_TIMER_DEFERRED) { |
6f458dfb | 893 | tcp_delack_timer_handler(sk); |
144d56e9 ED |
894 | __sock_put(sk); |
895 | } | |
40fc3423 | 896 | if (flags & TCPF_MTU_REDUCED_DEFERRED) { |
4fab9071 | 897 | inet_csk(sk)->icsk_af_ops->mtu_reduced(sk); |
144d56e9 ED |
898 | __sock_put(sk); |
899 | } | |
46d3ceab ED |
900 | } |
901 | EXPORT_SYMBOL(tcp_release_cb); | |
902 | ||
903 | void __init tcp_tasklet_init(void) | |
904 | { | |
905 | int i; | |
906 | ||
907 | for_each_possible_cpu(i) { | |
908 | struct tsq_tasklet *tsq = &per_cpu(tsq_tasklet, i); | |
909 | ||
910 | INIT_LIST_HEAD(&tsq->head); | |
911 | tasklet_init(&tsq->tasklet, | |
912 | tcp_tasklet_func, | |
913 | (unsigned long)tsq); | |
914 | } | |
915 | } | |
916 | ||
917 | /* | |
918 | * Write buffer destructor automatically called from kfree_skb. | |
8e3bff96 | 919 | * We can't xmit new skbs from this context, as we might already |
46d3ceab ED |
920 | * hold qdisc lock. |
921 | */ | |
d6a4a104 | 922 | void tcp_wfree(struct sk_buff *skb) |
46d3ceab ED |
923 | { |
924 | struct sock *sk = skb->sk; | |
925 | struct tcp_sock *tp = tcp_sk(sk); | |
408f0a6c | 926 | unsigned long flags, nval, oval; |
9b462d02 ED |
927 | |
928 | /* Keep one reference on sk_wmem_alloc. | |
929 | * Will be released by sk_free() from here or tcp_tasklet_func() | |
930 | */ | |
14afee4b | 931 | WARN_ON(refcount_sub_and_test(skb->truesize - 1, &sk->sk_wmem_alloc)); |
9b462d02 ED |
932 | |
933 | /* If this softirq is serviced by ksoftirqd, we are likely under stress. | |
934 | * Wait until our queues (qdisc + devices) are drained. | |
935 | * This gives : | |
936 | * - less callbacks to tcp_write_xmit(), reducing stress (batches) | |
937 | * - chance for incoming ACK (processed by another cpu maybe) | |
938 | * to migrate this flow (skb->ooo_okay will be eventually set) | |
939 | */ | |
14afee4b | 940 | if (refcount_read(&sk->sk_wmem_alloc) >= SKB_TRUESIZE(1) && this_cpu_ksoftirqd() == current) |
9b462d02 | 941 | goto out; |
46d3ceab | 942 | |
7aa5470c | 943 | for (oval = READ_ONCE(sk->sk_tsq_flags);; oval = nval) { |
46d3ceab | 944 | struct tsq_tasklet *tsq; |
a9b204d1 | 945 | bool empty; |
46d3ceab | 946 | |
408f0a6c ED |
947 | if (!(oval & TSQF_THROTTLED) || (oval & TSQF_QUEUED)) |
948 | goto out; | |
949 | ||
b223feb9 | 950 | nval = (oval & ~TSQF_THROTTLED) | TSQF_QUEUED | TCPF_TSQ_DEFERRED; |
7aa5470c | 951 | nval = cmpxchg(&sk->sk_tsq_flags, oval, nval); |
408f0a6c ED |
952 | if (nval != oval) |
953 | continue; | |
954 | ||
46d3ceab ED |
955 | /* queue this socket to tasklet queue */ |
956 | local_irq_save(flags); | |
903ceff7 | 957 | tsq = this_cpu_ptr(&tsq_tasklet); |
a9b204d1 | 958 | empty = list_empty(&tsq->head); |
46d3ceab | 959 | list_add(&tp->tsq_node, &tsq->head); |
a9b204d1 ED |
960 | if (empty) |
961 | tasklet_schedule(&tsq->tasklet); | |
46d3ceab | 962 | local_irq_restore(flags); |
9b462d02 | 963 | return; |
46d3ceab | 964 | } |
9b462d02 ED |
965 | out: |
966 | sk_free(sk); | |
46d3ceab ED |
967 | } |
968 | ||
218af599 ED |
969 | /* Note: Called under hard irq. |
970 | * We can not call TCP stack right away. | |
971 | */ | |
972 | enum hrtimer_restart tcp_pace_kick(struct hrtimer *timer) | |
973 | { | |
974 | struct tcp_sock *tp = container_of(timer, struct tcp_sock, pacing_timer); | |
975 | struct sock *sk = (struct sock *)tp; | |
976 | unsigned long nval, oval; | |
977 | ||
978 | for (oval = READ_ONCE(sk->sk_tsq_flags);; oval = nval) { | |
979 | struct tsq_tasklet *tsq; | |
980 | bool empty; | |
981 | ||
982 | if (oval & TSQF_QUEUED) | |
983 | break; | |
984 | ||
985 | nval = (oval & ~TSQF_THROTTLED) | TSQF_QUEUED | TCPF_TSQ_DEFERRED; | |
986 | nval = cmpxchg(&sk->sk_tsq_flags, oval, nval); | |
987 | if (nval != oval) | |
988 | continue; | |
989 | ||
14afee4b | 990 | if (!refcount_inc_not_zero(&sk->sk_wmem_alloc)) |
218af599 ED |
991 | break; |
992 | /* queue this socket to tasklet queue */ | |
993 | tsq = this_cpu_ptr(&tsq_tasklet); | |
994 | empty = list_empty(&tsq->head); | |
995 | list_add(&tp->tsq_node, &tsq->head); | |
996 | if (empty) | |
997 | tasklet_schedule(&tsq->tasklet); | |
998 | break; | |
999 | } | |
1000 | return HRTIMER_NORESTART; | |
1001 | } | |
1002 | ||
1003 | /* BBR congestion control needs pacing. | |
1004 | * Same remark for SO_MAX_PACING_RATE. | |
1005 | * sch_fq packet scheduler is efficiently handling pacing, | |
1006 | * but is not always installed/used. | |
1007 | * Return true if TCP stack should pace packets itself. | |
1008 | */ | |
1009 | static bool tcp_needs_internal_pacing(const struct sock *sk) | |
1010 | { | |
1011 | return smp_load_acquire(&sk->sk_pacing_status) == SK_PACING_NEEDED; | |
1012 | } | |
1013 | ||
1014 | static void tcp_internal_pacing(struct sock *sk, const struct sk_buff *skb) | |
1015 | { | |
1016 | u64 len_ns; | |
1017 | u32 rate; | |
1018 | ||
1019 | if (!tcp_needs_internal_pacing(sk)) | |
1020 | return; | |
1021 | rate = sk->sk_pacing_rate; | |
1022 | if (!rate || rate == ~0U) | |
1023 | return; | |
1024 | ||
1025 | /* Should account for header sizes as sch_fq does, | |
1026 | * but lets make things simple. | |
1027 | */ | |
1028 | len_ns = (u64)skb->len * NSEC_PER_SEC; | |
1029 | do_div(len_ns, rate); | |
1030 | hrtimer_start(&tcp_sk(sk)->pacing_timer, | |
1031 | ktime_add_ns(ktime_get(), len_ns), | |
1032 | HRTIMER_MODE_ABS_PINNED); | |
1033 | } | |
1034 | ||
e2080072 ED |
1035 | static void tcp_update_skb_after_send(struct tcp_sock *tp, struct sk_buff *skb) |
1036 | { | |
1037 | skb->skb_mstamp = tp->tcp_mstamp; | |
1038 | list_move_tail(&skb->tcp_tsorted_anchor, &tp->tsorted_sent_queue); | |
1039 | } | |
1040 | ||
1da177e4 LT |
1041 | /* This routine actually transmits TCP packets queued in by |
1042 | * tcp_do_sendmsg(). This is used by both the initial | |
1043 | * transmission and possible later retransmissions. | |
1044 | * All SKB's seen here are completely headerless. It is our | |
1045 | * job to build the TCP header, and pass the packet down to | |
1046 | * IP so it can do the same plus pass the packet off to the | |
1047 | * device. | |
1048 | * | |
1049 | * We are working here with either a clone of the original | |
1050 | * SKB, or a fresh unique copy made by the retransmit engine. | |
1051 | */ | |
056834d9 IJ |
1052 | static int tcp_transmit_skb(struct sock *sk, struct sk_buff *skb, int clone_it, |
1053 | gfp_t gfp_mask) | |
1da177e4 | 1054 | { |
dfb4b9dc DM |
1055 | const struct inet_connection_sock *icsk = inet_csk(sk); |
1056 | struct inet_sock *inet; | |
1057 | struct tcp_sock *tp; | |
1058 | struct tcp_skb_cb *tcb; | |
33ad798c | 1059 | struct tcp_out_options opts; |
95c96174 | 1060 | unsigned int tcp_options_size, tcp_header_size; |
8c72c65b | 1061 | struct sk_buff *oskb = NULL; |
cfb6eeb4 | 1062 | struct tcp_md5sig_key *md5; |
dfb4b9dc | 1063 | struct tcphdr *th; |
dfb4b9dc DM |
1064 | int err; |
1065 | ||
1066 | BUG_ON(!skb || !tcp_skb_pcount(skb)); | |
6f094b9e | 1067 | tp = tcp_sk(sk); |
dfb4b9dc | 1068 | |
ccdbb6e9 | 1069 | if (clone_it) { |
6f094b9e LB |
1070 | TCP_SKB_CB(skb)->tx.in_flight = TCP_SKB_CB(skb)->end_seq |
1071 | - tp->snd_una; | |
8c72c65b | 1072 | oskb = skb; |
e2080072 ED |
1073 | |
1074 | tcp_skb_tsorted_save(oskb) { | |
1075 | if (unlikely(skb_cloned(oskb))) | |
1076 | skb = pskb_copy(oskb, gfp_mask); | |
1077 | else | |
1078 | skb = skb_clone(oskb, gfp_mask); | |
1079 | } tcp_skb_tsorted_restore(oskb); | |
1080 | ||
dfb4b9dc DM |
1081 | if (unlikely(!skb)) |
1082 | return -ENOBUFS; | |
1083 | } | |
8c72c65b | 1084 | skb->skb_mstamp = tp->tcp_mstamp; |
1da177e4 | 1085 | |
dfb4b9dc | 1086 | inet = inet_sk(sk); |
dfb4b9dc | 1087 | tcb = TCP_SKB_CB(skb); |
33ad798c | 1088 | memset(&opts, 0, sizeof(opts)); |
1da177e4 | 1089 | |
4de075e0 | 1090 | if (unlikely(tcb->tcp_flags & TCPHDR_SYN)) |
33ad798c AL |
1091 | tcp_options_size = tcp_syn_options(sk, skb, &opts, &md5); |
1092 | else | |
1093 | tcp_options_size = tcp_established_options(sk, skb, &opts, | |
1094 | &md5); | |
1095 | tcp_header_size = tcp_options_size + sizeof(struct tcphdr); | |
e905a9ed | 1096 | |
547669d4 | 1097 | /* if no packet is in qdisc/device queue, then allow XPS to select |
b2532eb9 ED |
1098 | * another queue. We can be called from tcp_tsq_handler() |
1099 | * which holds one reference to sk_wmem_alloc. | |
1100 | * | |
1101 | * TODO: Ideally, in-flight pure ACK packets should not matter here. | |
1102 | * One way to get this would be to set skb->truesize = 2 on them. | |
547669d4 | 1103 | */ |
b2532eb9 | 1104 | skb->ooo_okay = sk_wmem_alloc_get(sk) < SKB_TRUESIZE(1); |
dfb4b9dc | 1105 | |
38ab52e8 ED |
1106 | /* If we had to use memory reserve to allocate this skb, |
1107 | * this might cause drops if packet is looped back : | |
1108 | * Other socket might not have SOCK_MEMALLOC. | |
1109 | * Packets not looped back do not care about pfmemalloc. | |
1110 | */ | |
1111 | skb->pfmemalloc = 0; | |
1112 | ||
aa8223c7 ACM |
1113 | skb_push(skb, tcp_header_size); |
1114 | skb_reset_transport_header(skb); | |
46d3ceab ED |
1115 | |
1116 | skb_orphan(skb); | |
1117 | skb->sk = sk; | |
1d2077ac | 1118 | skb->destructor = skb_is_tcp_pure_ack(skb) ? __sock_wfree : tcp_wfree; |
b73c3d0e | 1119 | skb_set_hash_from_sk(skb, sk); |
14afee4b | 1120 | refcount_add(skb->truesize, &sk->sk_wmem_alloc); |
dfb4b9dc | 1121 | |
c3a2e837 JA |
1122 | skb_set_dst_pending_confirm(skb, sk->sk_dst_pending_confirm); |
1123 | ||
dfb4b9dc | 1124 | /* Build TCP header and checksum it. */ |
ea1627c2 | 1125 | th = (struct tcphdr *)skb->data; |
c720c7e8 ED |
1126 | th->source = inet->inet_sport; |
1127 | th->dest = inet->inet_dport; | |
dfb4b9dc DM |
1128 | th->seq = htonl(tcb->seq); |
1129 | th->ack_seq = htonl(tp->rcv_nxt); | |
df7a3b07 | 1130 | *(((__be16 *)th) + 6) = htons(((tcp_header_size >> 2) << 12) | |
4de075e0 | 1131 | tcb->tcp_flags); |
dfb4b9dc | 1132 | |
dfb4b9dc DM |
1133 | th->check = 0; |
1134 | th->urg_ptr = 0; | |
1da177e4 | 1135 | |
33f5f57e | 1136 | /* The urg_mode check is necessary during a below snd_una win probe */ |
7691367d HX |
1137 | if (unlikely(tcp_urg_mode(tp) && before(tcb->seq, tp->snd_up))) { |
1138 | if (before(tp->snd_up, tcb->seq + 0x10000)) { | |
1139 | th->urg_ptr = htons(tp->snd_up - tcb->seq); | |
1140 | th->urg = 1; | |
1141 | } else if (after(tcb->seq + 0xFFFF, tp->snd_nxt)) { | |
0eae88f3 | 1142 | th->urg_ptr = htons(0xFFFF); |
7691367d HX |
1143 | th->urg = 1; |
1144 | } | |
dfb4b9dc | 1145 | } |
1da177e4 | 1146 | |
bd0388ae | 1147 | tcp_options_write((__be32 *)(th + 1), tp, &opts); |
51466a75 | 1148 | skb_shinfo(skb)->gso_type = sk->sk_gso_type; |
ea1627c2 ED |
1149 | if (likely(!(tcb->tcp_flags & TCPHDR_SYN))) { |
1150 | th->window = htons(tcp_select_window(sk)); | |
1151 | tcp_ecn_send(sk, skb, th, tcp_header_size); | |
1152 | } else { | |
1153 | /* RFC1323: The window in SYN & SYN/ACK segments | |
1154 | * is never scaled. | |
1155 | */ | |
1156 | th->window = htons(min(tp->rcv_wnd, 65535U)); | |
1157 | } | |
cfb6eeb4 YH |
1158 | #ifdef CONFIG_TCP_MD5SIG |
1159 | /* Calculate the MD5 hash, as we have all we need now */ | |
1160 | if (md5) { | |
a465419b | 1161 | sk_nocaps_add(sk, NETIF_F_GSO_MASK); |
bd0388ae | 1162 | tp->af_specific->calc_md5_hash(opts.hash_location, |
39f8e58e | 1163 | md5, sk, skb); |
cfb6eeb4 YH |
1164 | } |
1165 | #endif | |
1166 | ||
bb296246 | 1167 | icsk->icsk_af_ops->send_check(sk, skb); |
1da177e4 | 1168 | |
4de075e0 | 1169 | if (likely(tcb->tcp_flags & TCPHDR_ACK)) |
dfb4b9dc | 1170 | tcp_event_ack_sent(sk, tcp_skb_pcount(skb)); |
1da177e4 | 1171 | |
a44d6eac | 1172 | if (skb->len != tcp_header_size) { |
cf533ea5 | 1173 | tcp_event_data_sent(tp, sk); |
a44d6eac | 1174 | tp->data_segs_out += tcp_skb_pcount(skb); |
218af599 | 1175 | tcp_internal_pacing(sk, skb); |
a44d6eac | 1176 | } |
1da177e4 | 1177 | |
bd37a088 | 1178 | if (after(tcb->end_seq, tp->snd_nxt) || tcb->seq == tcb->end_seq) |
aa2ea058 TH |
1179 | TCP_ADD_STATS(sock_net(sk), TCP_MIB_OUTSEGS, |
1180 | tcp_skb_pcount(skb)); | |
1da177e4 | 1181 | |
2efd055c | 1182 | tp->segs_out += tcp_skb_pcount(skb); |
f69ad292 | 1183 | /* OK, its time to fill skb_shinfo(skb)->gso_{segs|size} */ |
cd7d8498 | 1184 | skb_shinfo(skb)->gso_segs = tcp_skb_pcount(skb); |
f69ad292 | 1185 | skb_shinfo(skb)->gso_size = tcp_skb_mss(skb); |
cd7d8498 | 1186 | |
7faee5c0 | 1187 | /* Our usage of tstamp should remain private */ |
2456e855 | 1188 | skb->tstamp = 0; |
971f10ec ED |
1189 | |
1190 | /* Cleanup our debris for IP stacks */ | |
1191 | memset(skb->cb, 0, max(sizeof(struct inet_skb_parm), | |
1192 | sizeof(struct inet6_skb_parm))); | |
1193 | ||
b0270e91 | 1194 | err = icsk->icsk_af_ops->queue_xmit(sk, skb, &inet->cork.fl); |
7faee5c0 | 1195 | |
8c72c65b ED |
1196 | if (unlikely(err > 0)) { |
1197 | tcp_enter_cwr(sk); | |
1198 | err = net_xmit_eval(err); | |
1199 | } | |
fc225799 | 1200 | if (!err && oskb) { |
e2080072 | 1201 | tcp_update_skb_after_send(tp, oskb); |
fc225799 ED |
1202 | tcp_rate_skb_sent(sk, oskb); |
1203 | } | |
8c72c65b | 1204 | return err; |
1da177e4 LT |
1205 | } |
1206 | ||
67edfef7 | 1207 | /* This routine just queues the buffer for sending. |
1da177e4 LT |
1208 | * |
1209 | * NOTE: probe0 timer is not checked, do not forget tcp_push_pending_frames, | |
1210 | * otherwise socket can stall. | |
1211 | */ | |
1212 | static void tcp_queue_skb(struct sock *sk, struct sk_buff *skb) | |
1213 | { | |
1214 | struct tcp_sock *tp = tcp_sk(sk); | |
1215 | ||
1216 | /* Advance write_seq and place onto the write_queue. */ | |
1217 | tp->write_seq = TCP_SKB_CB(skb)->end_seq; | |
f4a775d1 | 1218 | __skb_header_release(skb); |
fe067e8a | 1219 | tcp_add_write_queue_tail(sk, skb); |
3ab224be HA |
1220 | sk->sk_wmem_queued += skb->truesize; |
1221 | sk_mem_charge(sk, skb->truesize); | |
1da177e4 LT |
1222 | } |
1223 | ||
67edfef7 | 1224 | /* Initialize TSO segments for a packet. */ |
5bbb432c | 1225 | static void tcp_set_skb_tso_segs(struct sk_buff *skb, unsigned int mss_now) |
f6302d1d | 1226 | { |
8f26fb1c | 1227 | if (skb->len <= mss_now || skb->ip_summed == CHECKSUM_NONE) { |
f6302d1d DM |
1228 | /* Avoid the costly divide in the normal |
1229 | * non-TSO case. | |
1230 | */ | |
cd7d8498 | 1231 | tcp_skb_pcount_set(skb, 1); |
f69ad292 | 1232 | TCP_SKB_CB(skb)->tcp_gso_size = 0; |
f6302d1d | 1233 | } else { |
cd7d8498 | 1234 | tcp_skb_pcount_set(skb, DIV_ROUND_UP(skb->len, mss_now)); |
f69ad292 | 1235 | TCP_SKB_CB(skb)->tcp_gso_size = mss_now; |
1da177e4 LT |
1236 | } |
1237 | } | |
1238 | ||
91fed7a1 | 1239 | /* When a modification to fackets out becomes necessary, we need to check |
68f8353b | 1240 | * skb is counted to fackets_out or not. |
91fed7a1 | 1241 | */ |
cf533ea5 | 1242 | static void tcp_adjust_fackets_out(struct sock *sk, const struct sk_buff *skb, |
91fed7a1 IJ |
1243 | int decr) |
1244 | { | |
a47e5a98 IJ |
1245 | struct tcp_sock *tp = tcp_sk(sk); |
1246 | ||
dc86967b | 1247 | if (!tp->sacked_out || tcp_is_reno(tp)) |
91fed7a1 IJ |
1248 | return; |
1249 | ||
6859d494 | 1250 | if (after(tcp_highest_sack_seq(tp), TCP_SKB_CB(skb)->seq)) |
91fed7a1 | 1251 | tp->fackets_out -= decr; |
91fed7a1 IJ |
1252 | } |
1253 | ||
797108d1 IJ |
1254 | /* Pcount in the middle of the write queue got changed, we need to do various |
1255 | * tweaks to fix counters | |
1256 | */ | |
cf533ea5 | 1257 | static void tcp_adjust_pcount(struct sock *sk, const struct sk_buff *skb, int decr) |
797108d1 IJ |
1258 | { |
1259 | struct tcp_sock *tp = tcp_sk(sk); | |
1260 | ||
1261 | tp->packets_out -= decr; | |
1262 | ||
1263 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED) | |
1264 | tp->sacked_out -= decr; | |
1265 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) | |
1266 | tp->retrans_out -= decr; | |
1267 | if (TCP_SKB_CB(skb)->sacked & TCPCB_LOST) | |
1268 | tp->lost_out -= decr; | |
1269 | ||
1270 | /* Reno case is special. Sigh... */ | |
1271 | if (tcp_is_reno(tp) && decr > 0) | |
1272 | tp->sacked_out -= min_t(u32, tp->sacked_out, decr); | |
1273 | ||
1274 | tcp_adjust_fackets_out(sk, skb, decr); | |
1275 | ||
1276 | if (tp->lost_skb_hint && | |
1277 | before(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(tp->lost_skb_hint)->seq) && | |
52cf3cc8 | 1278 | (tcp_is_fack(tp) || (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED))) |
797108d1 IJ |
1279 | tp->lost_cnt_hint -= decr; |
1280 | ||
1281 | tcp_verify_left_out(tp); | |
1282 | } | |
1283 | ||
0a2cf20c SHY |
1284 | static bool tcp_has_tx_tstamp(const struct sk_buff *skb) |
1285 | { | |
1286 | return TCP_SKB_CB(skb)->txstamp_ack || | |
1287 | (skb_shinfo(skb)->tx_flags & SKBTX_ANY_TSTAMP); | |
1288 | } | |
1289 | ||
490cc7d0 WB |
1290 | static void tcp_fragment_tstamp(struct sk_buff *skb, struct sk_buff *skb2) |
1291 | { | |
1292 | struct skb_shared_info *shinfo = skb_shinfo(skb); | |
1293 | ||
0a2cf20c | 1294 | if (unlikely(tcp_has_tx_tstamp(skb)) && |
490cc7d0 WB |
1295 | !before(shinfo->tskey, TCP_SKB_CB(skb2)->seq)) { |
1296 | struct skb_shared_info *shinfo2 = skb_shinfo(skb2); | |
1297 | u8 tsflags = shinfo->tx_flags & SKBTX_ANY_TSTAMP; | |
1298 | ||
1299 | shinfo->tx_flags &= ~tsflags; | |
1300 | shinfo2->tx_flags |= tsflags; | |
1301 | swap(shinfo->tskey, shinfo2->tskey); | |
b51e13fa MKL |
1302 | TCP_SKB_CB(skb2)->txstamp_ack = TCP_SKB_CB(skb)->txstamp_ack; |
1303 | TCP_SKB_CB(skb)->txstamp_ack = 0; | |
490cc7d0 WB |
1304 | } |
1305 | } | |
1306 | ||
a166140e MKL |
1307 | static void tcp_skb_fragment_eor(struct sk_buff *skb, struct sk_buff *skb2) |
1308 | { | |
1309 | TCP_SKB_CB(skb2)->eor = TCP_SKB_CB(skb)->eor; | |
1310 | TCP_SKB_CB(skb)->eor = 0; | |
1311 | } | |
1312 | ||
75c119af ED |
1313 | /* Insert buff after skb on the write or rtx queue of sk. */ |
1314 | static void tcp_insert_write_queue_after(struct sk_buff *skb, | |
1315 | struct sk_buff *buff, | |
1316 | struct sock *sk, | |
1317 | enum tcp_queue tcp_queue) | |
1318 | { | |
1319 | if (tcp_queue == TCP_FRAG_IN_WRITE_QUEUE) | |
1320 | __skb_queue_after(&sk->sk_write_queue, skb, buff); | |
1321 | else | |
1322 | tcp_rbtree_insert(&sk->tcp_rtx_queue, buff); | |
1323 | } | |
1324 | ||
1da177e4 LT |
1325 | /* Function to create two new TCP segments. Shrinks the given segment |
1326 | * to the specified size and appends a new segment with the rest of the | |
e905a9ed | 1327 | * packet to the list. This won't be called frequently, I hope. |
1da177e4 LT |
1328 | * Remember, these are still headerless SKBs at this point. |
1329 | */ | |
75c119af ED |
1330 | int tcp_fragment(struct sock *sk, enum tcp_queue tcp_queue, |
1331 | struct sk_buff *skb, u32 len, | |
6cc55e09 | 1332 | unsigned int mss_now, gfp_t gfp) |
1da177e4 LT |
1333 | { |
1334 | struct tcp_sock *tp = tcp_sk(sk); | |
1335 | struct sk_buff *buff; | |
6475be16 | 1336 | int nsize, old_factor; |
b60b49ea | 1337 | int nlen; |
9ce01461 | 1338 | u8 flags; |
1da177e4 | 1339 | |
2fceec13 IJ |
1340 | if (WARN_ON(len > skb->len)) |
1341 | return -EINVAL; | |
6a438bbe | 1342 | |
1da177e4 LT |
1343 | nsize = skb_headlen(skb) - len; |
1344 | if (nsize < 0) | |
1345 | nsize = 0; | |
1346 | ||
6cc55e09 | 1347 | if (skb_unclone(skb, gfp)) |
1da177e4 LT |
1348 | return -ENOMEM; |
1349 | ||
1350 | /* Get a new skb... force flag on. */ | |
eb934478 | 1351 | buff = sk_stream_alloc_skb(sk, nsize, gfp, true); |
51456b29 | 1352 | if (!buff) |
1da177e4 | 1353 | return -ENOMEM; /* We'll just try again later. */ |
ef5cb973 | 1354 | |
3ab224be HA |
1355 | sk->sk_wmem_queued += buff->truesize; |
1356 | sk_mem_charge(sk, buff->truesize); | |
b60b49ea HX |
1357 | nlen = skb->len - len - nsize; |
1358 | buff->truesize += nlen; | |
1359 | skb->truesize -= nlen; | |
1da177e4 LT |
1360 | |
1361 | /* Correct the sequence numbers. */ | |
1362 | TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len; | |
1363 | TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq; | |
1364 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq; | |
1365 | ||
1366 | /* PSH and FIN should only be set in the second packet. */ | |
4de075e0 ED |
1367 | flags = TCP_SKB_CB(skb)->tcp_flags; |
1368 | TCP_SKB_CB(skb)->tcp_flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH); | |
1369 | TCP_SKB_CB(buff)->tcp_flags = flags; | |
e14c3caf | 1370 | TCP_SKB_CB(buff)->sacked = TCP_SKB_CB(skb)->sacked; |
a166140e | 1371 | tcp_skb_fragment_eor(skb, buff); |
1da177e4 | 1372 | |
84fa7933 | 1373 | if (!skb_shinfo(skb)->nr_frags && skb->ip_summed != CHECKSUM_PARTIAL) { |
1da177e4 | 1374 | /* Copy and checksum data tail into the new buffer. */ |
056834d9 IJ |
1375 | buff->csum = csum_partial_copy_nocheck(skb->data + len, |
1376 | skb_put(buff, nsize), | |
1da177e4 LT |
1377 | nsize, 0); |
1378 | ||
1379 | skb_trim(skb, len); | |
1380 | ||
1381 | skb->csum = csum_block_sub(skb->csum, buff->csum, len); | |
1382 | } else { | |
84fa7933 | 1383 | skb->ip_summed = CHECKSUM_PARTIAL; |
1da177e4 LT |
1384 | skb_split(skb, buff, len); |
1385 | } | |
1386 | ||
1387 | buff->ip_summed = skb->ip_summed; | |
1388 | ||
a61bbcf2 | 1389 | buff->tstamp = skb->tstamp; |
490cc7d0 | 1390 | tcp_fragment_tstamp(skb, buff); |
1da177e4 | 1391 | |
6475be16 DM |
1392 | old_factor = tcp_skb_pcount(skb); |
1393 | ||
1da177e4 | 1394 | /* Fix up tso_factor for both original and new SKB. */ |
5bbb432c ED |
1395 | tcp_set_skb_tso_segs(skb, mss_now); |
1396 | tcp_set_skb_tso_segs(buff, mss_now); | |
1da177e4 | 1397 | |
b9f64820 YC |
1398 | /* Update delivered info for the new segment */ |
1399 | TCP_SKB_CB(buff)->tx = TCP_SKB_CB(skb)->tx; | |
1400 | ||
6475be16 DM |
1401 | /* If this packet has been sent out already, we must |
1402 | * adjust the various packet counters. | |
1403 | */ | |
cf0b450c | 1404 | if (!before(tp->snd_nxt, TCP_SKB_CB(buff)->end_seq)) { |
6475be16 DM |
1405 | int diff = old_factor - tcp_skb_pcount(skb) - |
1406 | tcp_skb_pcount(buff); | |
1da177e4 | 1407 | |
797108d1 IJ |
1408 | if (diff) |
1409 | tcp_adjust_pcount(sk, skb, diff); | |
1da177e4 LT |
1410 | } |
1411 | ||
1412 | /* Link BUFF into the send queue. */ | |
f4a775d1 | 1413 | __skb_header_release(buff); |
75c119af | 1414 | tcp_insert_write_queue_after(skb, buff, sk, tcp_queue); |
e2080072 | 1415 | list_add(&buff->tcp_tsorted_anchor, &skb->tcp_tsorted_anchor); |
1da177e4 LT |
1416 | |
1417 | return 0; | |
1418 | } | |
1419 | ||
f4d01666 ED |
1420 | /* This is similar to __pskb_pull_tail(). The difference is that pulled |
1421 | * data is not copied, but immediately discarded. | |
1da177e4 | 1422 | */ |
7162fb24 | 1423 | static int __pskb_trim_head(struct sk_buff *skb, int len) |
1da177e4 | 1424 | { |
7b7fc97a | 1425 | struct skb_shared_info *shinfo; |
1da177e4 LT |
1426 | int i, k, eat; |
1427 | ||
4fa48bf3 ED |
1428 | eat = min_t(int, len, skb_headlen(skb)); |
1429 | if (eat) { | |
1430 | __skb_pull(skb, eat); | |
1431 | len -= eat; | |
1432 | if (!len) | |
7162fb24 | 1433 | return 0; |
4fa48bf3 | 1434 | } |
1da177e4 LT |
1435 | eat = len; |
1436 | k = 0; | |
7b7fc97a ED |
1437 | shinfo = skb_shinfo(skb); |
1438 | for (i = 0; i < shinfo->nr_frags; i++) { | |
1439 | int size = skb_frag_size(&shinfo->frags[i]); | |
9e903e08 ED |
1440 | |
1441 | if (size <= eat) { | |
aff65da0 | 1442 | skb_frag_unref(skb, i); |
9e903e08 | 1443 | eat -= size; |
1da177e4 | 1444 | } else { |
7b7fc97a | 1445 | shinfo->frags[k] = shinfo->frags[i]; |
1da177e4 | 1446 | if (eat) { |
7b7fc97a ED |
1447 | shinfo->frags[k].page_offset += eat; |
1448 | skb_frag_size_sub(&shinfo->frags[k], eat); | |
1da177e4 LT |
1449 | eat = 0; |
1450 | } | |
1451 | k++; | |
1452 | } | |
1453 | } | |
7b7fc97a | 1454 | shinfo->nr_frags = k; |
1da177e4 | 1455 | |
1da177e4 LT |
1456 | skb->data_len -= len; |
1457 | skb->len = skb->data_len; | |
7162fb24 | 1458 | return len; |
1da177e4 LT |
1459 | } |
1460 | ||
67edfef7 | 1461 | /* Remove acked data from a packet in the transmit queue. */ |
1da177e4 LT |
1462 | int tcp_trim_head(struct sock *sk, struct sk_buff *skb, u32 len) |
1463 | { | |
7162fb24 ED |
1464 | u32 delta_truesize; |
1465 | ||
14bbd6a5 | 1466 | if (skb_unclone(skb, GFP_ATOMIC)) |
1da177e4 LT |
1467 | return -ENOMEM; |
1468 | ||
7162fb24 | 1469 | delta_truesize = __pskb_trim_head(skb, len); |
1da177e4 LT |
1470 | |
1471 | TCP_SKB_CB(skb)->seq += len; | |
84fa7933 | 1472 | skb->ip_summed = CHECKSUM_PARTIAL; |
1da177e4 | 1473 | |
7162fb24 ED |
1474 | if (delta_truesize) { |
1475 | skb->truesize -= delta_truesize; | |
1476 | sk->sk_wmem_queued -= delta_truesize; | |
1477 | sk_mem_uncharge(sk, delta_truesize); | |
1478 | sock_set_flag(sk, SOCK_QUEUE_SHRUNK); | |
1479 | } | |
1da177e4 | 1480 | |
5b35e1e6 | 1481 | /* Any change of skb->len requires recalculation of tso factor. */ |
1da177e4 | 1482 | if (tcp_skb_pcount(skb) > 1) |
5bbb432c | 1483 | tcp_set_skb_tso_segs(skb, tcp_skb_mss(skb)); |
1da177e4 LT |
1484 | |
1485 | return 0; | |
1486 | } | |
1487 | ||
1b63edd6 YC |
1488 | /* Calculate MSS not accounting any TCP options. */ |
1489 | static inline int __tcp_mtu_to_mss(struct sock *sk, int pmtu) | |
5d424d5a | 1490 | { |
cf533ea5 ED |
1491 | const struct tcp_sock *tp = tcp_sk(sk); |
1492 | const struct inet_connection_sock *icsk = inet_csk(sk); | |
5d424d5a JH |
1493 | int mss_now; |
1494 | ||
1495 | /* Calculate base mss without TCP options: | |
1496 | It is MMS_S - sizeof(tcphdr) of rfc1122 | |
1497 | */ | |
1498 | mss_now = pmtu - icsk->icsk_af_ops->net_header_len - sizeof(struct tcphdr); | |
1499 | ||
67469601 ED |
1500 | /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */ |
1501 | if (icsk->icsk_af_ops->net_frag_header_len) { | |
1502 | const struct dst_entry *dst = __sk_dst_get(sk); | |
1503 | ||
1504 | if (dst && dst_allfrag(dst)) | |
1505 | mss_now -= icsk->icsk_af_ops->net_frag_header_len; | |
1506 | } | |
1507 | ||
5d424d5a JH |
1508 | /* Clamp it (mss_clamp does not include tcp options) */ |
1509 | if (mss_now > tp->rx_opt.mss_clamp) | |
1510 | mss_now = tp->rx_opt.mss_clamp; | |
1511 | ||
1512 | /* Now subtract optional transport overhead */ | |
1513 | mss_now -= icsk->icsk_ext_hdr_len; | |
1514 | ||
1515 | /* Then reserve room for full set of TCP options and 8 bytes of data */ | |
1516 | if (mss_now < 48) | |
1517 | mss_now = 48; | |
5d424d5a JH |
1518 | return mss_now; |
1519 | } | |
1520 | ||
1b63edd6 YC |
1521 | /* Calculate MSS. Not accounting for SACKs here. */ |
1522 | int tcp_mtu_to_mss(struct sock *sk, int pmtu) | |
1523 | { | |
1524 | /* Subtract TCP options size, not including SACKs */ | |
1525 | return __tcp_mtu_to_mss(sk, pmtu) - | |
1526 | (tcp_sk(sk)->tcp_header_len - sizeof(struct tcphdr)); | |
1527 | } | |
1528 | ||
5d424d5a | 1529 | /* Inverse of above */ |
67469601 | 1530 | int tcp_mss_to_mtu(struct sock *sk, int mss) |
5d424d5a | 1531 | { |
cf533ea5 ED |
1532 | const struct tcp_sock *tp = tcp_sk(sk); |
1533 | const struct inet_connection_sock *icsk = inet_csk(sk); | |
5d424d5a JH |
1534 | int mtu; |
1535 | ||
1536 | mtu = mss + | |
1537 | tp->tcp_header_len + | |
1538 | icsk->icsk_ext_hdr_len + | |
1539 | icsk->icsk_af_ops->net_header_len; | |
1540 | ||
67469601 ED |
1541 | /* IPv6 adds a frag_hdr in case RTAX_FEATURE_ALLFRAG is set */ |
1542 | if (icsk->icsk_af_ops->net_frag_header_len) { | |
1543 | const struct dst_entry *dst = __sk_dst_get(sk); | |
1544 | ||
1545 | if (dst && dst_allfrag(dst)) | |
1546 | mtu += icsk->icsk_af_ops->net_frag_header_len; | |
1547 | } | |
5d424d5a JH |
1548 | return mtu; |
1549 | } | |
556c6b46 | 1550 | EXPORT_SYMBOL(tcp_mss_to_mtu); |
5d424d5a | 1551 | |
67edfef7 | 1552 | /* MTU probing init per socket */ |
5d424d5a JH |
1553 | void tcp_mtup_init(struct sock *sk) |
1554 | { | |
1555 | struct tcp_sock *tp = tcp_sk(sk); | |
1556 | struct inet_connection_sock *icsk = inet_csk(sk); | |
b0f9ca53 | 1557 | struct net *net = sock_net(sk); |
5d424d5a | 1558 | |
b0f9ca53 | 1559 | icsk->icsk_mtup.enabled = net->ipv4.sysctl_tcp_mtu_probing > 1; |
5d424d5a | 1560 | icsk->icsk_mtup.search_high = tp->rx_opt.mss_clamp + sizeof(struct tcphdr) + |
e905a9ed | 1561 | icsk->icsk_af_ops->net_header_len; |
b0f9ca53 | 1562 | icsk->icsk_mtup.search_low = tcp_mss_to_mtu(sk, net->ipv4.sysctl_tcp_base_mss); |
5d424d5a | 1563 | icsk->icsk_mtup.probe_size = 0; |
05cbc0db | 1564 | if (icsk->icsk_mtup.enabled) |
c74df29a | 1565 | icsk->icsk_mtup.probe_timestamp = tcp_jiffies32; |
5d424d5a | 1566 | } |
4bc2f18b | 1567 | EXPORT_SYMBOL(tcp_mtup_init); |
5d424d5a | 1568 | |
1da177e4 LT |
1569 | /* This function synchronize snd mss to current pmtu/exthdr set. |
1570 | ||
1571 | tp->rx_opt.user_mss is mss set by user by TCP_MAXSEG. It does NOT counts | |
1572 | for TCP options, but includes only bare TCP header. | |
1573 | ||
1574 | tp->rx_opt.mss_clamp is mss negotiated at connection setup. | |
caa20d9a | 1575 | It is minimum of user_mss and mss received with SYN. |
1da177e4 LT |
1576 | It also does not include TCP options. |
1577 | ||
d83d8461 | 1578 | inet_csk(sk)->icsk_pmtu_cookie is last pmtu, seen by this function. |
1da177e4 LT |
1579 | |
1580 | tp->mss_cache is current effective sending mss, including | |
1581 | all tcp options except for SACKs. It is evaluated, | |
1582 | taking into account current pmtu, but never exceeds | |
1583 | tp->rx_opt.mss_clamp. | |
1584 | ||
1585 | NOTE1. rfc1122 clearly states that advertised MSS | |
1586 | DOES NOT include either tcp or ip options. | |
1587 | ||
d83d8461 ACM |
1588 | NOTE2. inet_csk(sk)->icsk_pmtu_cookie and tp->mss_cache |
1589 | are READ ONLY outside this function. --ANK (980731) | |
1da177e4 | 1590 | */ |
1da177e4 LT |
1591 | unsigned int tcp_sync_mss(struct sock *sk, u32 pmtu) |
1592 | { | |
1593 | struct tcp_sock *tp = tcp_sk(sk); | |
d83d8461 | 1594 | struct inet_connection_sock *icsk = inet_csk(sk); |
5d424d5a | 1595 | int mss_now; |
1da177e4 | 1596 | |
5d424d5a JH |
1597 | if (icsk->icsk_mtup.search_high > pmtu) |
1598 | icsk->icsk_mtup.search_high = pmtu; | |
1da177e4 | 1599 | |
5d424d5a | 1600 | mss_now = tcp_mtu_to_mss(sk, pmtu); |
409d22b4 | 1601 | mss_now = tcp_bound_to_half_wnd(tp, mss_now); |
1da177e4 LT |
1602 | |
1603 | /* And store cached results */ | |
d83d8461 | 1604 | icsk->icsk_pmtu_cookie = pmtu; |
5d424d5a JH |
1605 | if (icsk->icsk_mtup.enabled) |
1606 | mss_now = min(mss_now, tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_low)); | |
c1b4a7e6 | 1607 | tp->mss_cache = mss_now; |
1da177e4 LT |
1608 | |
1609 | return mss_now; | |
1610 | } | |
4bc2f18b | 1611 | EXPORT_SYMBOL(tcp_sync_mss); |
1da177e4 LT |
1612 | |
1613 | /* Compute the current effective MSS, taking SACKs and IP options, | |
1614 | * and even PMTU discovery events into account. | |
1da177e4 | 1615 | */ |
0c54b85f | 1616 | unsigned int tcp_current_mss(struct sock *sk) |
1da177e4 | 1617 | { |
cf533ea5 ED |
1618 | const struct tcp_sock *tp = tcp_sk(sk); |
1619 | const struct dst_entry *dst = __sk_dst_get(sk); | |
c1b4a7e6 | 1620 | u32 mss_now; |
95c96174 | 1621 | unsigned int header_len; |
33ad798c AL |
1622 | struct tcp_out_options opts; |
1623 | struct tcp_md5sig_key *md5; | |
c1b4a7e6 DM |
1624 | |
1625 | mss_now = tp->mss_cache; | |
1626 | ||
1da177e4 LT |
1627 | if (dst) { |
1628 | u32 mtu = dst_mtu(dst); | |
d83d8461 | 1629 | if (mtu != inet_csk(sk)->icsk_pmtu_cookie) |
1da177e4 LT |
1630 | mss_now = tcp_sync_mss(sk, mtu); |
1631 | } | |
1632 | ||
33ad798c AL |
1633 | header_len = tcp_established_options(sk, NULL, &opts, &md5) + |
1634 | sizeof(struct tcphdr); | |
1635 | /* The mss_cache is sized based on tp->tcp_header_len, which assumes | |
1636 | * some common options. If this is an odd packet (because we have SACK | |
1637 | * blocks etc) then our calculated header_len will be different, and | |
1638 | * we have to adjust mss_now correspondingly */ | |
1639 | if (header_len != tp->tcp_header_len) { | |
1640 | int delta = (int) header_len - tp->tcp_header_len; | |
1641 | mss_now -= delta; | |
1642 | } | |
cfb6eeb4 | 1643 | |
1da177e4 LT |
1644 | return mss_now; |
1645 | } | |
1646 | ||
86fd14ad WP |
1647 | /* RFC2861, slow part. Adjust cwnd, after it was not full during one rto. |
1648 | * As additional protections, we do not touch cwnd in retransmission phases, | |
1649 | * and if application hit its sndbuf limit recently. | |
1650 | */ | |
1651 | static void tcp_cwnd_application_limited(struct sock *sk) | |
1652 | { | |
1653 | struct tcp_sock *tp = tcp_sk(sk); | |
1654 | ||
1655 | if (inet_csk(sk)->icsk_ca_state == TCP_CA_Open && | |
1656 | sk->sk_socket && !test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) { | |
1657 | /* Limited by application or receiver window. */ | |
1658 | u32 init_win = tcp_init_cwnd(tp, __sk_dst_get(sk)); | |
1659 | u32 win_used = max(tp->snd_cwnd_used, init_win); | |
1660 | if (win_used < tp->snd_cwnd) { | |
1661 | tp->snd_ssthresh = tcp_current_ssthresh(sk); | |
1662 | tp->snd_cwnd = (tp->snd_cwnd + win_used) >> 1; | |
1663 | } | |
1664 | tp->snd_cwnd_used = 0; | |
1665 | } | |
c2203cf7 | 1666 | tp->snd_cwnd_stamp = tcp_jiffies32; |
86fd14ad WP |
1667 | } |
1668 | ||
ca8a2263 | 1669 | static void tcp_cwnd_validate(struct sock *sk, bool is_cwnd_limited) |
a762a980 | 1670 | { |
1b1fc3fd | 1671 | const struct tcp_congestion_ops *ca_ops = inet_csk(sk)->icsk_ca_ops; |
9e412ba7 | 1672 | struct tcp_sock *tp = tcp_sk(sk); |
a762a980 | 1673 | |
ca8a2263 NC |
1674 | /* Track the maximum number of outstanding packets in each |
1675 | * window, and remember whether we were cwnd-limited then. | |
1676 | */ | |
1677 | if (!before(tp->snd_una, tp->max_packets_seq) || | |
1678 | tp->packets_out > tp->max_packets_out) { | |
1679 | tp->max_packets_out = tp->packets_out; | |
1680 | tp->max_packets_seq = tp->snd_nxt; | |
1681 | tp->is_cwnd_limited = is_cwnd_limited; | |
1682 | } | |
e114a710 | 1683 | |
24901551 | 1684 | if (tcp_is_cwnd_limited(sk)) { |
a762a980 DM |
1685 | /* Network is feed fully. */ |
1686 | tp->snd_cwnd_used = 0; | |
c2203cf7 | 1687 | tp->snd_cwnd_stamp = tcp_jiffies32; |
a762a980 DM |
1688 | } else { |
1689 | /* Network starves. */ | |
1690 | if (tp->packets_out > tp->snd_cwnd_used) | |
1691 | tp->snd_cwnd_used = tp->packets_out; | |
1692 | ||
15d33c07 | 1693 | if (sysctl_tcp_slow_start_after_idle && |
c2203cf7 | 1694 | (s32)(tcp_jiffies32 - tp->snd_cwnd_stamp) >= inet_csk(sk)->icsk_rto && |
1b1fc3fd | 1695 | !ca_ops->cong_control) |
a762a980 | 1696 | tcp_cwnd_application_limited(sk); |
b0f71bd3 FY |
1697 | |
1698 | /* The following conditions together indicate the starvation | |
1699 | * is caused by insufficient sender buffer: | |
1700 | * 1) just sent some data (see tcp_write_xmit) | |
1701 | * 2) not cwnd limited (this else condition) | |
75c119af | 1702 | * 3) no more data to send (tcp_write_queue_empty()) |
b0f71bd3 FY |
1703 | * 4) application is hitting buffer limit (SOCK_NOSPACE) |
1704 | */ | |
75c119af | 1705 | if (tcp_write_queue_empty(sk) && sk->sk_socket && |
b0f71bd3 FY |
1706 | test_bit(SOCK_NOSPACE, &sk->sk_socket->flags) && |
1707 | (1 << sk->sk_state) & (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT)) | |
1708 | tcp_chrono_start(sk, TCP_CHRONO_SNDBUF_LIMITED); | |
a762a980 DM |
1709 | } |
1710 | } | |
1711 | ||
d4589926 ED |
1712 | /* Minshall's variant of the Nagle send check. */ |
1713 | static bool tcp_minshall_check(const struct tcp_sock *tp) | |
1714 | { | |
1715 | return after(tp->snd_sml, tp->snd_una) && | |
1716 | !after(tp->snd_sml, tp->snd_nxt); | |
1717 | } | |
1718 | ||
1719 | /* Update snd_sml if this skb is under mss | |
1720 | * Note that a TSO packet might end with a sub-mss segment | |
1721 | * The test is really : | |
1722 | * if ((skb->len % mss) != 0) | |
1723 | * tp->snd_sml = TCP_SKB_CB(skb)->end_seq; | |
1724 | * But we can avoid doing the divide again given we already have | |
1725 | * skb_pcount = skb->len / mss_now | |
0e3a4803 | 1726 | */ |
d4589926 ED |
1727 | static void tcp_minshall_update(struct tcp_sock *tp, unsigned int mss_now, |
1728 | const struct sk_buff *skb) | |
1729 | { | |
1730 | if (skb->len < tcp_skb_pcount(skb) * mss_now) | |
1731 | tp->snd_sml = TCP_SKB_CB(skb)->end_seq; | |
1732 | } | |
1733 | ||
1734 | /* Return false, if packet can be sent now without violation Nagle's rules: | |
1735 | * 1. It is full sized. (provided by caller in %partial bool) | |
1736 | * 2. Or it contains FIN. (already checked by caller) | |
1737 | * 3. Or TCP_CORK is not set, and TCP_NODELAY is set. | |
1738 | * 4. Or TCP_CORK is not set, and all sent packets are ACKed. | |
1739 | * With Minshall's modification: all sent small packets are ACKed. | |
1740 | */ | |
1741 | static bool tcp_nagle_check(bool partial, const struct tcp_sock *tp, | |
cc93fc51 | 1742 | int nonagle) |
d4589926 ED |
1743 | { |
1744 | return partial && | |
1745 | ((nonagle & TCP_NAGLE_CORK) || | |
1746 | (!nonagle && tp->packets_out && tcp_minshall_check(tp))); | |
1747 | } | |
605ad7f1 ED |
1748 | |
1749 | /* Return how many segs we'd like on a TSO packet, | |
1750 | * to send one TSO packet per ms | |
1751 | */ | |
1b3878ca NC |
1752 | u32 tcp_tso_autosize(const struct sock *sk, unsigned int mss_now, |
1753 | int min_tso_segs) | |
605ad7f1 ED |
1754 | { |
1755 | u32 bytes, segs; | |
1756 | ||
1757 | bytes = min(sk->sk_pacing_rate >> 10, | |
1758 | sk->sk_gso_max_size - 1 - MAX_TCP_HEADER); | |
1759 | ||
1760 | /* Goal is to send at least one packet per ms, | |
1761 | * not one big TSO packet every 100 ms. | |
1762 | * This preserves ACK clocking and is consistent | |
1763 | * with tcp_tso_should_defer() heuristic. | |
1764 | */ | |
1b3878ca | 1765 | segs = max_t(u32, bytes / mss_now, min_tso_segs); |
605ad7f1 ED |
1766 | |
1767 | return min_t(u32, segs, sk->sk_gso_max_segs); | |
1768 | } | |
1b3878ca | 1769 | EXPORT_SYMBOL(tcp_tso_autosize); |
605ad7f1 | 1770 | |
ed6e7268 NC |
1771 | /* Return the number of segments we want in the skb we are transmitting. |
1772 | * See if congestion control module wants to decide; otherwise, autosize. | |
1773 | */ | |
1774 | static u32 tcp_tso_segs(struct sock *sk, unsigned int mss_now) | |
1775 | { | |
1776 | const struct tcp_congestion_ops *ca_ops = inet_csk(sk)->icsk_ca_ops; | |
1777 | u32 tso_segs = ca_ops->tso_segs_goal ? ca_ops->tso_segs_goal(sk) : 0; | |
1778 | ||
1b3878ca NC |
1779 | return tso_segs ? : |
1780 | tcp_tso_autosize(sk, mss_now, sysctl_tcp_min_tso_segs); | |
ed6e7268 NC |
1781 | } |
1782 | ||
d4589926 ED |
1783 | /* Returns the portion of skb which can be sent right away */ |
1784 | static unsigned int tcp_mss_split_point(const struct sock *sk, | |
1785 | const struct sk_buff *skb, | |
1786 | unsigned int mss_now, | |
1787 | unsigned int max_segs, | |
1788 | int nonagle) | |
c1b4a7e6 | 1789 | { |
cf533ea5 | 1790 | const struct tcp_sock *tp = tcp_sk(sk); |
d4589926 | 1791 | u32 partial, needed, window, max_len; |
c1b4a7e6 | 1792 | |
90840def | 1793 | window = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq; |
1485348d | 1794 | max_len = mss_now * max_segs; |
0e3a4803 | 1795 | |
1485348d BH |
1796 | if (likely(max_len <= window && skb != tcp_write_queue_tail(sk))) |
1797 | return max_len; | |
0e3a4803 | 1798 | |
5ea3a748 IJ |
1799 | needed = min(skb->len, window); |
1800 | ||
1485348d BH |
1801 | if (max_len <= needed) |
1802 | return max_len; | |
0e3a4803 | 1803 | |
d4589926 ED |
1804 | partial = needed % mss_now; |
1805 | /* If last segment is not a full MSS, check if Nagle rules allow us | |
1806 | * to include this last segment in this skb. | |
1807 | * Otherwise, we'll split the skb at last MSS boundary | |
1808 | */ | |
cc93fc51 | 1809 | if (tcp_nagle_check(partial != 0, tp, nonagle)) |
d4589926 ED |
1810 | return needed - partial; |
1811 | ||
1812 | return needed; | |
c1b4a7e6 DM |
1813 | } |
1814 | ||
1815 | /* Can at least one segment of SKB be sent right now, according to the | |
1816 | * congestion window rules? If so, return how many segments are allowed. | |
1817 | */ | |
cf533ea5 ED |
1818 | static inline unsigned int tcp_cwnd_test(const struct tcp_sock *tp, |
1819 | const struct sk_buff *skb) | |
c1b4a7e6 | 1820 | { |
d649a7a8 | 1821 | u32 in_flight, cwnd, halfcwnd; |
c1b4a7e6 DM |
1822 | |
1823 | /* Don't be strict about the congestion window for the final FIN. */ | |
4de075e0 ED |
1824 | if ((TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN) && |
1825 | tcp_skb_pcount(skb) == 1) | |
c1b4a7e6 DM |
1826 | return 1; |
1827 | ||
1828 | in_flight = tcp_packets_in_flight(tp); | |
1829 | cwnd = tp->snd_cwnd; | |
d649a7a8 ED |
1830 | if (in_flight >= cwnd) |
1831 | return 0; | |
c1b4a7e6 | 1832 | |
d649a7a8 ED |
1833 | /* For better scheduling, ensure we have at least |
1834 | * 2 GSO packets in flight. | |
1835 | */ | |
1836 | halfcwnd = max(cwnd >> 1, 1U); | |
1837 | return min(halfcwnd, cwnd - in_flight); | |
c1b4a7e6 DM |
1838 | } |
1839 | ||
b595076a | 1840 | /* Initialize TSO state of a skb. |
67edfef7 | 1841 | * This must be invoked the first time we consider transmitting |
c1b4a7e6 DM |
1842 | * SKB onto the wire. |
1843 | */ | |
5bbb432c | 1844 | static int tcp_init_tso_segs(struct sk_buff *skb, unsigned int mss_now) |
c1b4a7e6 DM |
1845 | { |
1846 | int tso_segs = tcp_skb_pcount(skb); | |
1847 | ||
f8269a49 | 1848 | if (!tso_segs || (tso_segs > 1 && tcp_skb_mss(skb) != mss_now)) { |
5bbb432c | 1849 | tcp_set_skb_tso_segs(skb, mss_now); |
c1b4a7e6 DM |
1850 | tso_segs = tcp_skb_pcount(skb); |
1851 | } | |
1852 | return tso_segs; | |
1853 | } | |
1854 | ||
c1b4a7e6 | 1855 | |
a2a385d6 | 1856 | /* Return true if the Nagle test allows this packet to be |
c1b4a7e6 DM |
1857 | * sent now. |
1858 | */ | |
a2a385d6 ED |
1859 | static inline bool tcp_nagle_test(const struct tcp_sock *tp, const struct sk_buff *skb, |
1860 | unsigned int cur_mss, int nonagle) | |
c1b4a7e6 DM |
1861 | { |
1862 | /* Nagle rule does not apply to frames, which sit in the middle of the | |
1863 | * write_queue (they have no chances to get new data). | |
1864 | * | |
1865 | * This is implemented in the callers, where they modify the 'nonagle' | |
1866 | * argument based upon the location of SKB in the send queue. | |
1867 | */ | |
1868 | if (nonagle & TCP_NAGLE_PUSH) | |
a2a385d6 | 1869 | return true; |
c1b4a7e6 | 1870 | |
9b44190d YC |
1871 | /* Don't use the nagle rule for urgent data (or for the final FIN). */ |
1872 | if (tcp_urg_mode(tp) || (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN)) | |
a2a385d6 | 1873 | return true; |
c1b4a7e6 | 1874 | |
cc93fc51 | 1875 | if (!tcp_nagle_check(skb->len < cur_mss, tp, nonagle)) |
a2a385d6 | 1876 | return true; |
c1b4a7e6 | 1877 | |
a2a385d6 | 1878 | return false; |
c1b4a7e6 DM |
1879 | } |
1880 | ||
1881 | /* Does at least the first segment of SKB fit into the send window? */ | |
a2a385d6 ED |
1882 | static bool tcp_snd_wnd_test(const struct tcp_sock *tp, |
1883 | const struct sk_buff *skb, | |
1884 | unsigned int cur_mss) | |
c1b4a7e6 DM |
1885 | { |
1886 | u32 end_seq = TCP_SKB_CB(skb)->end_seq; | |
1887 | ||
1888 | if (skb->len > cur_mss) | |
1889 | end_seq = TCP_SKB_CB(skb)->seq + cur_mss; | |
1890 | ||
90840def | 1891 | return !after(end_seq, tcp_wnd_end(tp)); |
c1b4a7e6 DM |
1892 | } |
1893 | ||
c1b4a7e6 DM |
1894 | /* Trim TSO SKB to LEN bytes, put the remaining data into a new packet |
1895 | * which is put after SKB on the list. It is very much like | |
1896 | * tcp_fragment() except that it may make several kinds of assumptions | |
1897 | * in order to speed up the splitting operation. In particular, we | |
1898 | * know that all the data is in scatter-gather pages, and that the | |
1899 | * packet has never been sent out before (and thus is not cloned). | |
1900 | */ | |
75c119af ED |
1901 | static int tso_fragment(struct sock *sk, enum tcp_queue tcp_queue, |
1902 | struct sk_buff *skb, unsigned int len, | |
c4ead4c5 | 1903 | unsigned int mss_now, gfp_t gfp) |
c1b4a7e6 DM |
1904 | { |
1905 | struct sk_buff *buff; | |
1906 | int nlen = skb->len - len; | |
9ce01461 | 1907 | u8 flags; |
c1b4a7e6 DM |
1908 | |
1909 | /* All of a TSO frame must be composed of paged data. */ | |
c8ac3774 | 1910 | if (skb->len != skb->data_len) |
75c119af | 1911 | return tcp_fragment(sk, tcp_queue, skb, len, mss_now, gfp); |
c1b4a7e6 | 1912 | |
eb934478 | 1913 | buff = sk_stream_alloc_skb(sk, 0, gfp, true); |
51456b29 | 1914 | if (unlikely(!buff)) |
c1b4a7e6 DM |
1915 | return -ENOMEM; |
1916 | ||
3ab224be HA |
1917 | sk->sk_wmem_queued += buff->truesize; |
1918 | sk_mem_charge(sk, buff->truesize); | |
b60b49ea | 1919 | buff->truesize += nlen; |
c1b4a7e6 DM |
1920 | skb->truesize -= nlen; |
1921 | ||
1922 | /* Correct the sequence numbers. */ | |
1923 | TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len; | |
1924 | TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq; | |
1925 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq; | |
1926 | ||
1927 | /* PSH and FIN should only be set in the second packet. */ | |
4de075e0 ED |
1928 | flags = TCP_SKB_CB(skb)->tcp_flags; |
1929 | TCP_SKB_CB(skb)->tcp_flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH); | |
1930 | TCP_SKB_CB(buff)->tcp_flags = flags; | |
c1b4a7e6 DM |
1931 | |
1932 | /* This packet was never sent out yet, so no SACK bits. */ | |
1933 | TCP_SKB_CB(buff)->sacked = 0; | |
1934 | ||
a166140e MKL |
1935 | tcp_skb_fragment_eor(skb, buff); |
1936 | ||
84fa7933 | 1937 | buff->ip_summed = skb->ip_summed = CHECKSUM_PARTIAL; |
c1b4a7e6 | 1938 | skb_split(skb, buff, len); |
490cc7d0 | 1939 | tcp_fragment_tstamp(skb, buff); |
c1b4a7e6 DM |
1940 | |
1941 | /* Fix up tso_factor for both original and new SKB. */ | |
5bbb432c ED |
1942 | tcp_set_skb_tso_segs(skb, mss_now); |
1943 | tcp_set_skb_tso_segs(buff, mss_now); | |
c1b4a7e6 DM |
1944 | |
1945 | /* Link BUFF into the send queue. */ | |
f4a775d1 | 1946 | __skb_header_release(buff); |
75c119af | 1947 | tcp_insert_write_queue_after(skb, buff, sk, tcp_queue); |
c1b4a7e6 DM |
1948 | |
1949 | return 0; | |
1950 | } | |
1951 | ||
1952 | /* Try to defer sending, if possible, in order to minimize the amount | |
1953 | * of TSO splitting we do. View it as a kind of TSO Nagle test. | |
1954 | * | |
1955 | * This algorithm is from John Heffner. | |
1956 | */ | |
ca8a2263 | 1957 | static bool tcp_tso_should_defer(struct sock *sk, struct sk_buff *skb, |
605ad7f1 | 1958 | bool *is_cwnd_limited, u32 max_segs) |
c1b4a7e6 | 1959 | { |
6687e988 | 1960 | const struct inet_connection_sock *icsk = inet_csk(sk); |
50c8339e ED |
1961 | u32 age, send_win, cong_win, limit, in_flight; |
1962 | struct tcp_sock *tp = tcp_sk(sk); | |
50c8339e | 1963 | struct sk_buff *head; |
ad9f4f50 | 1964 | int win_divisor; |
c1b4a7e6 | 1965 | |
4de075e0 | 1966 | if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_FIN) |
ae8064ac | 1967 | goto send_now; |
c1b4a7e6 | 1968 | |
99d7662a | 1969 | if (icsk->icsk_ca_state >= TCP_CA_Recovery) |
ae8064ac JH |
1970 | goto send_now; |
1971 | ||
5f852eb5 ED |
1972 | /* Avoid bursty behavior by allowing defer |
1973 | * only if the last write was recent. | |
1974 | */ | |
d635fbe2 | 1975 | if ((s32)(tcp_jiffies32 - tp->lsndtime) > 0) |
ae8064ac | 1976 | goto send_now; |
908a75c1 | 1977 | |
c1b4a7e6 DM |
1978 | in_flight = tcp_packets_in_flight(tp); |
1979 | ||
056834d9 | 1980 | BUG_ON(tcp_skb_pcount(skb) <= 1 || (tp->snd_cwnd <= in_flight)); |
c1b4a7e6 | 1981 | |
90840def | 1982 | send_win = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq; |
c1b4a7e6 DM |
1983 | |
1984 | /* From in_flight test above, we know that cwnd > in_flight. */ | |
1985 | cong_win = (tp->snd_cwnd - in_flight) * tp->mss_cache; | |
1986 | ||
1987 | limit = min(send_win, cong_win); | |
1988 | ||
ba244fe9 | 1989 | /* If a full-sized TSO skb can be sent, do it. */ |
605ad7f1 | 1990 | if (limit >= max_segs * tp->mss_cache) |
ae8064ac | 1991 | goto send_now; |
ba244fe9 | 1992 | |
62ad2761 IJ |
1993 | /* Middle in queue won't get any more data, full sendable already? */ |
1994 | if ((skb != tcp_write_queue_tail(sk)) && (limit >= skb->len)) | |
1995 | goto send_now; | |
1996 | ||
ad9f4f50 ED |
1997 | win_divisor = ACCESS_ONCE(sysctl_tcp_tso_win_divisor); |
1998 | if (win_divisor) { | |
c1b4a7e6 DM |
1999 | u32 chunk = min(tp->snd_wnd, tp->snd_cwnd * tp->mss_cache); |
2000 | ||
2001 | /* If at least some fraction of a window is available, | |
2002 | * just use it. | |
2003 | */ | |
ad9f4f50 | 2004 | chunk /= win_divisor; |
c1b4a7e6 | 2005 | if (limit >= chunk) |
ae8064ac | 2006 | goto send_now; |
c1b4a7e6 DM |
2007 | } else { |
2008 | /* Different approach, try not to defer past a single | |
2009 | * ACK. Receiver should ACK every other full sized | |
2010 | * frame, so if we have space for more than 3 frames | |
2011 | * then send now. | |
2012 | */ | |
6b5a5c0d | 2013 | if (limit > tcp_max_tso_deferred_mss(tp) * tp->mss_cache) |
ae8064ac | 2014 | goto send_now; |
c1b4a7e6 DM |
2015 | } |
2016 | ||
75c119af ED |
2017 | /* TODO : use tsorted_sent_queue ? */ |
2018 | head = tcp_rtx_queue_head(sk); | |
2019 | if (!head) | |
2020 | goto send_now; | |
9a568de4 | 2021 | age = tcp_stamp_us_delta(tp->tcp_mstamp, head->skb_mstamp); |
50c8339e ED |
2022 | /* If next ACK is likely to come too late (half srtt), do not defer */ |
2023 | if (age < (tp->srtt_us >> 4)) | |
2024 | goto send_now; | |
2025 | ||
5f852eb5 | 2026 | /* Ok, it looks like it is advisable to defer. */ |
ae8064ac | 2027 | |
d2e1339f | 2028 | if (cong_win < send_win && cong_win <= skb->len) |
ca8a2263 NC |
2029 | *is_cwnd_limited = true; |
2030 | ||
a2a385d6 | 2031 | return true; |
ae8064ac JH |
2032 | |
2033 | send_now: | |
a2a385d6 | 2034 | return false; |
c1b4a7e6 DM |
2035 | } |
2036 | ||
05cbc0db FD |
2037 | static inline void tcp_mtu_check_reprobe(struct sock *sk) |
2038 | { | |
2039 | struct inet_connection_sock *icsk = inet_csk(sk); | |
2040 | struct tcp_sock *tp = tcp_sk(sk); | |
2041 | struct net *net = sock_net(sk); | |
2042 | u32 interval; | |
2043 | s32 delta; | |
2044 | ||
2045 | interval = net->ipv4.sysctl_tcp_probe_interval; | |
c74df29a | 2046 | delta = tcp_jiffies32 - icsk->icsk_mtup.probe_timestamp; |
05cbc0db FD |
2047 | if (unlikely(delta >= interval * HZ)) { |
2048 | int mss = tcp_current_mss(sk); | |
2049 | ||
2050 | /* Update current search range */ | |
2051 | icsk->icsk_mtup.probe_size = 0; | |
2052 | icsk->icsk_mtup.search_high = tp->rx_opt.mss_clamp + | |
2053 | sizeof(struct tcphdr) + | |
2054 | icsk->icsk_af_ops->net_header_len; | |
2055 | icsk->icsk_mtup.search_low = tcp_mss_to_mtu(sk, mss); | |
2056 | ||
2057 | /* Update probe time stamp */ | |
c74df29a | 2058 | icsk->icsk_mtup.probe_timestamp = tcp_jiffies32; |
05cbc0db FD |
2059 | } |
2060 | } | |
2061 | ||
5d424d5a | 2062 | /* Create a new MTU probe if we are ready. |
67edfef7 AK |
2063 | * MTU probe is regularly attempting to increase the path MTU by |
2064 | * deliberately sending larger packets. This discovers routing | |
2065 | * changes resulting in larger path MTUs. | |
2066 | * | |
5d424d5a JH |
2067 | * Returns 0 if we should wait to probe (no cwnd available), |
2068 | * 1 if a probe was sent, | |
056834d9 IJ |
2069 | * -1 otherwise |
2070 | */ | |
5d424d5a JH |
2071 | static int tcp_mtu_probe(struct sock *sk) |
2072 | { | |
5d424d5a | 2073 | struct inet_connection_sock *icsk = inet_csk(sk); |
12a59abc | 2074 | struct tcp_sock *tp = tcp_sk(sk); |
5d424d5a | 2075 | struct sk_buff *skb, *nskb, *next; |
6b58e0a5 | 2076 | struct net *net = sock_net(sk); |
5d424d5a | 2077 | int probe_size; |
91cc17c0 | 2078 | int size_needed; |
12a59abc | 2079 | int copy, len; |
5d424d5a | 2080 | int mss_now; |
6b58e0a5 | 2081 | int interval; |
5d424d5a JH |
2082 | |
2083 | /* Not currently probing/verifying, | |
2084 | * not in recovery, | |
2085 | * have enough cwnd, and | |
12a59abc ED |
2086 | * not SACKing (the variable headers throw things off) |
2087 | */ | |
2088 | if (likely(!icsk->icsk_mtup.enabled || | |
2089 | icsk->icsk_mtup.probe_size || | |
2090 | inet_csk(sk)->icsk_ca_state != TCP_CA_Open || | |
2091 | tp->snd_cwnd < 11 || | |
2092 | tp->rx_opt.num_sacks || tp->rx_opt.dsack)) | |
5d424d5a JH |
2093 | return -1; |
2094 | ||
6b58e0a5 FD |
2095 | /* Use binary search for probe_size between tcp_mss_base, |
2096 | * and current mss_clamp. if (search_high - search_low) | |
2097 | * smaller than a threshold, backoff from probing. | |
2098 | */ | |
0c54b85f | 2099 | mss_now = tcp_current_mss(sk); |
6b58e0a5 FD |
2100 | probe_size = tcp_mtu_to_mss(sk, (icsk->icsk_mtup.search_high + |
2101 | icsk->icsk_mtup.search_low) >> 1); | |
91cc17c0 | 2102 | size_needed = probe_size + (tp->reordering + 1) * tp->mss_cache; |
6b58e0a5 | 2103 | interval = icsk->icsk_mtup.search_high - icsk->icsk_mtup.search_low; |
05cbc0db FD |
2104 | /* When misfortune happens, we are reprobing actively, |
2105 | * and then reprobe timer has expired. We stick with current | |
2106 | * probing process by not resetting search range to its orignal. | |
2107 | */ | |
6b58e0a5 | 2108 | if (probe_size > tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_high) || |
05cbc0db FD |
2109 | interval < net->ipv4.sysctl_tcp_probe_threshold) { |
2110 | /* Check whether enough time has elaplased for | |
2111 | * another round of probing. | |
2112 | */ | |
2113 | tcp_mtu_check_reprobe(sk); | |
5d424d5a JH |
2114 | return -1; |
2115 | } | |
2116 | ||
2117 | /* Have enough data in the send queue to probe? */ | |
7f9c33e5 | 2118 | if (tp->write_seq - tp->snd_nxt < size_needed) |
5d424d5a JH |
2119 | return -1; |
2120 | ||
91cc17c0 IJ |
2121 | if (tp->snd_wnd < size_needed) |
2122 | return -1; | |
90840def | 2123 | if (after(tp->snd_nxt + size_needed, tcp_wnd_end(tp))) |
91cc17c0 | 2124 | return 0; |
5d424d5a | 2125 | |
d67c58e9 IJ |
2126 | /* Do we need to wait to drain cwnd? With none in flight, don't stall */ |
2127 | if (tcp_packets_in_flight(tp) + 2 > tp->snd_cwnd) { | |
2128 | if (!tcp_packets_in_flight(tp)) | |
5d424d5a JH |
2129 | return -1; |
2130 | else | |
2131 | return 0; | |
2132 | } | |
2133 | ||
2134 | /* We're allowed to probe. Build it now. */ | |
eb934478 | 2135 | nskb = sk_stream_alloc_skb(sk, probe_size, GFP_ATOMIC, false); |
51456b29 | 2136 | if (!nskb) |
5d424d5a | 2137 | return -1; |
3ab224be HA |
2138 | sk->sk_wmem_queued += nskb->truesize; |
2139 | sk_mem_charge(sk, nskb->truesize); | |
5d424d5a | 2140 | |
fe067e8a | 2141 | skb = tcp_send_head(sk); |
5d424d5a JH |
2142 | |
2143 | TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(skb)->seq; | |
2144 | TCP_SKB_CB(nskb)->end_seq = TCP_SKB_CB(skb)->seq + probe_size; | |
4de075e0 | 2145 | TCP_SKB_CB(nskb)->tcp_flags = TCPHDR_ACK; |
5d424d5a JH |
2146 | TCP_SKB_CB(nskb)->sacked = 0; |
2147 | nskb->csum = 0; | |
84fa7933 | 2148 | nskb->ip_summed = skb->ip_summed; |
5d424d5a | 2149 | |
50c4817e IJ |
2150 | tcp_insert_write_queue_before(nskb, skb, sk); |
2151 | ||
5d424d5a | 2152 | len = 0; |
234b6860 | 2153 | tcp_for_write_queue_from_safe(skb, next, sk) { |
5d424d5a | 2154 | copy = min_t(int, skb->len, probe_size - len); |
2fe664f1 | 2155 | if (nskb->ip_summed) { |
5d424d5a | 2156 | skb_copy_bits(skb, 0, skb_put(nskb, copy), copy); |
2fe664f1 DCS |
2157 | } else { |
2158 | __wsum csum = skb_copy_and_csum_bits(skb, 0, | |
2159 | skb_put(nskb, copy), | |
2160 | copy, 0); | |
2161 | nskb->csum = csum_block_add(nskb->csum, csum, len); | |
2162 | } | |
5d424d5a JH |
2163 | |
2164 | if (skb->len <= copy) { | |
2165 | /* We've eaten all the data from this skb. | |
2166 | * Throw it away. */ | |
4de075e0 | 2167 | TCP_SKB_CB(nskb)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags; |
fe067e8a | 2168 | tcp_unlink_write_queue(skb, sk); |
3ab224be | 2169 | sk_wmem_free_skb(sk, skb); |
5d424d5a | 2170 | } else { |
4de075e0 | 2171 | TCP_SKB_CB(nskb)->tcp_flags |= TCP_SKB_CB(skb)->tcp_flags & |
a3433f35 | 2172 | ~(TCPHDR_FIN|TCPHDR_PSH); |
5d424d5a JH |
2173 | if (!skb_shinfo(skb)->nr_frags) { |
2174 | skb_pull(skb, copy); | |
84fa7933 | 2175 | if (skb->ip_summed != CHECKSUM_PARTIAL) |
056834d9 IJ |
2176 | skb->csum = csum_partial(skb->data, |
2177 | skb->len, 0); | |
5d424d5a JH |
2178 | } else { |
2179 | __pskb_trim_head(skb, copy); | |
5bbb432c | 2180 | tcp_set_skb_tso_segs(skb, mss_now); |
5d424d5a JH |
2181 | } |
2182 | TCP_SKB_CB(skb)->seq += copy; | |
2183 | } | |
2184 | ||
2185 | len += copy; | |
234b6860 IJ |
2186 | |
2187 | if (len >= probe_size) | |
2188 | break; | |
5d424d5a | 2189 | } |
5bbb432c | 2190 | tcp_init_tso_segs(nskb, nskb->len); |
5d424d5a JH |
2191 | |
2192 | /* We're ready to send. If this fails, the probe will | |
7faee5c0 ED |
2193 | * be resegmented into mss-sized pieces by tcp_write_xmit(). |
2194 | */ | |
5d424d5a JH |
2195 | if (!tcp_transmit_skb(sk, nskb, 1, GFP_ATOMIC)) { |
2196 | /* Decrement cwnd here because we are sending | |
056834d9 | 2197 | * effectively two packets. */ |
5d424d5a | 2198 | tp->snd_cwnd--; |
66f5fe62 | 2199 | tcp_event_new_data_sent(sk, nskb); |
5d424d5a JH |
2200 | |
2201 | icsk->icsk_mtup.probe_size = tcp_mss_to_mtu(sk, nskb->len); | |
0e7b1368 JH |
2202 | tp->mtu_probe.probe_seq_start = TCP_SKB_CB(nskb)->seq; |
2203 | tp->mtu_probe.probe_seq_end = TCP_SKB_CB(nskb)->end_seq; | |
5d424d5a JH |
2204 | |
2205 | return 1; | |
2206 | } | |
2207 | ||
2208 | return -1; | |
2209 | } | |
2210 | ||
218af599 ED |
2211 | static bool tcp_pacing_check(const struct sock *sk) |
2212 | { | |
2213 | return tcp_needs_internal_pacing(sk) && | |
2214 | hrtimer_active(&tcp_sk(sk)->pacing_timer); | |
2215 | } | |
2216 | ||
f9616c35 ED |
2217 | /* TCP Small Queues : |
2218 | * Control number of packets in qdisc/devices to two packets / or ~1 ms. | |
2219 | * (These limits are doubled for retransmits) | |
2220 | * This allows for : | |
2221 | * - better RTT estimation and ACK scheduling | |
2222 | * - faster recovery | |
2223 | * - high rates | |
2224 | * Alas, some drivers / subsystems require a fair amount | |
2225 | * of queued bytes to ensure line rate. | |
2226 | * One example is wifi aggregation (802.11 AMPDU) | |
2227 | */ | |
2228 | static bool tcp_small_queue_check(struct sock *sk, const struct sk_buff *skb, | |
2229 | unsigned int factor) | |
2230 | { | |
2231 | unsigned int limit; | |
2232 | ||
2233 | limit = max(2 * skb->truesize, sk->sk_pacing_rate >> 10); | |
2234 | limit = min_t(u32, limit, sysctl_tcp_limit_output_bytes); | |
2235 | limit <<= factor; | |
2236 | ||
14afee4b | 2237 | if (refcount_read(&sk->sk_wmem_alloc) > limit) { |
75c119af | 2238 | /* Always send skb if rtx queue is empty. |
75eefc6c ED |
2239 | * No need to wait for TX completion to call us back, |
2240 | * after softirq/tasklet schedule. | |
2241 | * This helps when TX completions are delayed too much. | |
2242 | */ | |
75c119af | 2243 | if (tcp_rtx_queue_empty(sk)) |
75eefc6c ED |
2244 | return false; |
2245 | ||
7aa5470c | 2246 | set_bit(TSQ_THROTTLED, &sk->sk_tsq_flags); |
f9616c35 ED |
2247 | /* It is possible TX completion already happened |
2248 | * before we set TSQ_THROTTLED, so we must | |
2249 | * test again the condition. | |
2250 | */ | |
2251 | smp_mb__after_atomic(); | |
14afee4b | 2252 | if (refcount_read(&sk->sk_wmem_alloc) > limit) |
f9616c35 ED |
2253 | return true; |
2254 | } | |
2255 | return false; | |
2256 | } | |
2257 | ||
05b055e8 FY |
2258 | static void tcp_chrono_set(struct tcp_sock *tp, const enum tcp_chrono new) |
2259 | { | |
628174cc | 2260 | const u32 now = tcp_jiffies32; |
efe967cd | 2261 | enum tcp_chrono old = tp->chrono_type; |
05b055e8 | 2262 | |
efe967cd AB |
2263 | if (old > TCP_CHRONO_UNSPEC) |
2264 | tp->chrono_stat[old - 1] += now - tp->chrono_start; | |
05b055e8 FY |
2265 | tp->chrono_start = now; |
2266 | tp->chrono_type = new; | |
2267 | } | |
2268 | ||
2269 | void tcp_chrono_start(struct sock *sk, const enum tcp_chrono type) | |
2270 | { | |
2271 | struct tcp_sock *tp = tcp_sk(sk); | |
2272 | ||
2273 | /* If there are multiple conditions worthy of tracking in a | |
0f87230d FY |
2274 | * chronograph then the highest priority enum takes precedence |
2275 | * over the other conditions. So that if something "more interesting" | |
05b055e8 FY |
2276 | * starts happening, stop the previous chrono and start a new one. |
2277 | */ | |
2278 | if (type > tp->chrono_type) | |
2279 | tcp_chrono_set(tp, type); | |
2280 | } | |
2281 | ||
2282 | void tcp_chrono_stop(struct sock *sk, const enum tcp_chrono type) | |
2283 | { | |
2284 | struct tcp_sock *tp = tcp_sk(sk); | |
2285 | ||
0f87230d FY |
2286 | |
2287 | /* There are multiple conditions worthy of tracking in a | |
2288 | * chronograph, so that the highest priority enum takes | |
2289 | * precedence over the other conditions (see tcp_chrono_start). | |
2290 | * If a condition stops, we only stop chrono tracking if | |
2291 | * it's the "most interesting" or current chrono we are | |
2292 | * tracking and starts busy chrono if we have pending data. | |
2293 | */ | |
75c119af | 2294 | if (tcp_rtx_and_write_queues_empty(sk)) |
0f87230d FY |
2295 | tcp_chrono_set(tp, TCP_CHRONO_UNSPEC); |
2296 | else if (type == tp->chrono_type) | |
2297 | tcp_chrono_set(tp, TCP_CHRONO_BUSY); | |
05b055e8 FY |
2298 | } |
2299 | ||
1da177e4 LT |
2300 | /* This routine writes packets to the network. It advances the |
2301 | * send_head. This happens as incoming acks open up the remote | |
2302 | * window for us. | |
2303 | * | |
f8269a49 IJ |
2304 | * LARGESEND note: !tcp_urg_mode is overkill, only frames between |
2305 | * snd_up-64k-mss .. snd_up cannot be large. However, taking into | |
2306 | * account rare use of URG, this is not a big flaw. | |
2307 | * | |
6ba8a3b1 ND |
2308 | * Send at most one packet when push_one > 0. Temporarily ignore |
2309 | * cwnd limit to force at most one packet out when push_one == 2. | |
2310 | ||
a2a385d6 ED |
2311 | * Returns true, if no segments are in flight and we have queued segments, |
2312 | * but cannot send anything now because of SWS or another problem. | |
1da177e4 | 2313 | */ |
a2a385d6 ED |
2314 | static bool tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle, |
2315 | int push_one, gfp_t gfp) | |
1da177e4 LT |
2316 | { |
2317 | struct tcp_sock *tp = tcp_sk(sk); | |
92df7b51 | 2318 | struct sk_buff *skb; |
c1b4a7e6 DM |
2319 | unsigned int tso_segs, sent_pkts; |
2320 | int cwnd_quota; | |
5d424d5a | 2321 | int result; |
5615f886 | 2322 | bool is_cwnd_limited = false, is_rwnd_limited = false; |
605ad7f1 | 2323 | u32 max_segs; |
1da177e4 | 2324 | |
92df7b51 | 2325 | sent_pkts = 0; |
5d424d5a | 2326 | |
d5dd9175 IJ |
2327 | if (!push_one) { |
2328 | /* Do MTU probing. */ | |
2329 | result = tcp_mtu_probe(sk); | |
2330 | if (!result) { | |
a2a385d6 | 2331 | return false; |
d5dd9175 IJ |
2332 | } else if (result > 0) { |
2333 | sent_pkts = 1; | |
2334 | } | |
5d424d5a JH |
2335 | } |
2336 | ||
ed6e7268 | 2337 | max_segs = tcp_tso_segs(sk, mss_now); |
9a568de4 | 2338 | tcp_mstamp_refresh(tp); |
fe067e8a | 2339 | while ((skb = tcp_send_head(sk))) { |
c8ac3774 HX |
2340 | unsigned int limit; |
2341 | ||
218af599 ED |
2342 | if (tcp_pacing_check(sk)) |
2343 | break; | |
2344 | ||
5bbb432c | 2345 | tso_segs = tcp_init_tso_segs(skb, mss_now); |
c1b4a7e6 | 2346 | BUG_ON(!tso_segs); |
aa93466b | 2347 | |
9d186cac | 2348 | if (unlikely(tp->repair) && tp->repair_queue == TCP_SEND_QUEUE) { |
7faee5c0 | 2349 | /* "skb_mstamp" is used as a start point for the retransmit timer */ |
e2080072 | 2350 | tcp_update_skb_after_send(tp, skb); |
ec342325 | 2351 | goto repair; /* Skip network transmission */ |
9d186cac | 2352 | } |
ec342325 | 2353 | |
b68e9f85 | 2354 | cwnd_quota = tcp_cwnd_test(tp, skb); |
6ba8a3b1 ND |
2355 | if (!cwnd_quota) { |
2356 | if (push_one == 2) | |
2357 | /* Force out a loss probe pkt. */ | |
2358 | cwnd_quota = 1; | |
2359 | else | |
2360 | break; | |
2361 | } | |
b68e9f85 | 2362 | |
5615f886 FY |
2363 | if (unlikely(!tcp_snd_wnd_test(tp, skb, mss_now))) { |
2364 | is_rwnd_limited = true; | |
b68e9f85 | 2365 | break; |
5615f886 | 2366 | } |
b68e9f85 | 2367 | |
d6a4e26a | 2368 | if (tso_segs == 1) { |
c1b4a7e6 DM |
2369 | if (unlikely(!tcp_nagle_test(tp, skb, mss_now, |
2370 | (tcp_skb_is_last(sk, skb) ? | |
2371 | nonagle : TCP_NAGLE_PUSH)))) | |
2372 | break; | |
2373 | } else { | |
ca8a2263 | 2374 | if (!push_one && |
605ad7f1 ED |
2375 | tcp_tso_should_defer(sk, skb, &is_cwnd_limited, |
2376 | max_segs)) | |
c1b4a7e6 DM |
2377 | break; |
2378 | } | |
aa93466b | 2379 | |
605ad7f1 | 2380 | limit = mss_now; |
d6a4e26a | 2381 | if (tso_segs > 1 && !tcp_urg_mode(tp)) |
605ad7f1 ED |
2382 | limit = tcp_mss_split_point(sk, skb, mss_now, |
2383 | min_t(unsigned int, | |
2384 | cwnd_quota, | |
2385 | max_segs), | |
2386 | nonagle); | |
2387 | ||
2388 | if (skb->len > limit && | |
75c119af ED |
2389 | unlikely(tso_fragment(sk, TCP_FRAG_IN_WRITE_QUEUE, |
2390 | skb, limit, mss_now, gfp))) | |
605ad7f1 ED |
2391 | break; |
2392 | ||
7aa5470c ED |
2393 | if (test_bit(TCP_TSQ_DEFERRED, &sk->sk_tsq_flags)) |
2394 | clear_bit(TCP_TSQ_DEFERRED, &sk->sk_tsq_flags); | |
f9616c35 ED |
2395 | if (tcp_small_queue_check(sk, skb, 0)) |
2396 | break; | |
c9eeec26 | 2397 | |
d5dd9175 | 2398 | if (unlikely(tcp_transmit_skb(sk, skb, 1, gfp))) |
92df7b51 | 2399 | break; |
1da177e4 | 2400 | |
ec342325 | 2401 | repair: |
92df7b51 DM |
2402 | /* Advance the send_head. This one is sent out. |
2403 | * This call will increment packets_out. | |
2404 | */ | |
66f5fe62 | 2405 | tcp_event_new_data_sent(sk, skb); |
1da177e4 | 2406 | |
92df7b51 | 2407 | tcp_minshall_update(tp, mss_now, skb); |
a262f0cd | 2408 | sent_pkts += tcp_skb_pcount(skb); |
d5dd9175 IJ |
2409 | |
2410 | if (push_one) | |
2411 | break; | |
92df7b51 | 2412 | } |
1da177e4 | 2413 | |
5615f886 FY |
2414 | if (is_rwnd_limited) |
2415 | tcp_chrono_start(sk, TCP_CHRONO_RWND_LIMITED); | |
2416 | else | |
2417 | tcp_chrono_stop(sk, TCP_CHRONO_RWND_LIMITED); | |
2418 | ||
aa93466b | 2419 | if (likely(sent_pkts)) { |
684bad11 YC |
2420 | if (tcp_in_cwnd_reduction(sk)) |
2421 | tp->prr_out += sent_pkts; | |
6ba8a3b1 ND |
2422 | |
2423 | /* Send one loss probe per tail loss episode. */ | |
2424 | if (push_one != 2) | |
2425 | tcp_schedule_loss_probe(sk); | |
d2e1339f | 2426 | is_cwnd_limited |= (tcp_packets_in_flight(tp) >= tp->snd_cwnd); |
ca8a2263 | 2427 | tcp_cwnd_validate(sk, is_cwnd_limited); |
a2a385d6 | 2428 | return false; |
1da177e4 | 2429 | } |
75c119af | 2430 | return !tp->packets_out && !tcp_write_queue_empty(sk); |
6ba8a3b1 ND |
2431 | } |
2432 | ||
2433 | bool tcp_schedule_loss_probe(struct sock *sk) | |
2434 | { | |
2435 | struct inet_connection_sock *icsk = inet_csk(sk); | |
2436 | struct tcp_sock *tp = tcp_sk(sk); | |
a2815817 | 2437 | u32 timeout, rto_delta_us; |
2ae21cf5 | 2438 | int early_retrans; |
6ba8a3b1 | 2439 | |
6ba8a3b1 ND |
2440 | /* Don't do any loss probe on a Fast Open connection before 3WHS |
2441 | * finishes. | |
2442 | */ | |
f9b99582 | 2443 | if (tp->fastopen_rsk) |
6ba8a3b1 ND |
2444 | return false; |
2445 | ||
2ae21cf5 | 2446 | early_retrans = sock_net(sk)->ipv4.sysctl_tcp_early_retrans; |
6ba8a3b1 ND |
2447 | /* Schedule a loss probe in 2*RTT for SACK capable connections |
2448 | * in Open state, that are either limited by cwnd or application. | |
2449 | */ | |
2ae21cf5 | 2450 | if ((early_retrans != 3 && early_retrans != 4) || |
bec41a11 YC |
2451 | !tp->packets_out || !tcp_is_sack(tp) || |
2452 | icsk->icsk_ca_state != TCP_CA_Open) | |
6ba8a3b1 ND |
2453 | return false; |
2454 | ||
2455 | if ((tp->snd_cwnd > tcp_packets_in_flight(tp)) && | |
75c119af | 2456 | !tcp_write_queue_empty(sk)) |
6ba8a3b1 ND |
2457 | return false; |
2458 | ||
bb4d991a | 2459 | /* Probe timeout is 2*rtt. Add minimum RTO to account |
f9b99582 YC |
2460 | * for delayed ack when there's one outstanding packet. If no RTT |
2461 | * sample is available then probe after TCP_TIMEOUT_INIT. | |
6ba8a3b1 | 2462 | */ |
bb4d991a YC |
2463 | if (tp->srtt_us) { |
2464 | timeout = usecs_to_jiffies(tp->srtt_us >> 2); | |
2465 | if (tp->packets_out == 1) | |
2466 | timeout += TCP_RTO_MIN; | |
2467 | else | |
2468 | timeout += TCP_TIMEOUT_MIN; | |
2469 | } else { | |
2470 | timeout = TCP_TIMEOUT_INIT; | |
2471 | } | |
6ba8a3b1 | 2472 | |
a2815817 NC |
2473 | /* If the RTO formula yields an earlier time, then use that time. */ |
2474 | rto_delta_us = tcp_rto_delta_us(sk); /* How far in future is RTO? */ | |
2475 | if (rto_delta_us > 0) | |
2476 | timeout = min_t(u32, timeout, usecs_to_jiffies(rto_delta_us)); | |
6ba8a3b1 ND |
2477 | |
2478 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_LOSS_PROBE, timeout, | |
2479 | TCP_RTO_MAX); | |
2480 | return true; | |
2481 | } | |
2482 | ||
1f3279ae ED |
2483 | /* Thanks to skb fast clones, we can detect if a prior transmit of |
2484 | * a packet is still in a qdisc or driver queue. | |
2485 | * In this case, there is very little point doing a retransmit ! | |
1f3279ae ED |
2486 | */ |
2487 | static bool skb_still_in_host_queue(const struct sock *sk, | |
2488 | const struct sk_buff *skb) | |
2489 | { | |
39bb5e62 | 2490 | if (unlikely(skb_fclone_busy(sk, skb))) { |
c10d9310 ED |
2491 | NET_INC_STATS(sock_net(sk), |
2492 | LINUX_MIB_TCPSPURIOUS_RTX_HOSTQUEUES); | |
1f3279ae ED |
2493 | return true; |
2494 | } | |
2495 | return false; | |
2496 | } | |
2497 | ||
b340b264 | 2498 | /* When probe timeout (PTO) fires, try send a new segment if possible, else |
6ba8a3b1 ND |
2499 | * retransmit the last segment. |
2500 | */ | |
2501 | void tcp_send_loss_probe(struct sock *sk) | |
2502 | { | |
9b717a8d | 2503 | struct tcp_sock *tp = tcp_sk(sk); |
6ba8a3b1 ND |
2504 | struct sk_buff *skb; |
2505 | int pcount; | |
2506 | int mss = tcp_current_mss(sk); | |
6ba8a3b1 | 2507 | |
b340b264 | 2508 | skb = tcp_send_head(sk); |
75c119af ED |
2509 | if (skb && tcp_snd_wnd_test(tp, skb, mss)) { |
2510 | pcount = tp->packets_out; | |
2511 | tcp_write_xmit(sk, mss, TCP_NAGLE_OFF, 2, GFP_ATOMIC); | |
2512 | if (tp->packets_out > pcount) | |
2513 | goto probe_sent; | |
2514 | goto rearm_timer; | |
6ba8a3b1 | 2515 | } |
75c119af | 2516 | skb = skb_rb_last(&sk->tcp_rtx_queue); |
6ba8a3b1 | 2517 | |
9b717a8d ND |
2518 | /* At most one outstanding TLP retransmission. */ |
2519 | if (tp->tlp_high_seq) | |
2520 | goto rearm_timer; | |
2521 | ||
6ba8a3b1 | 2522 | /* Retransmit last segment. */ |
6ba8a3b1 ND |
2523 | if (WARN_ON(!skb)) |
2524 | goto rearm_timer; | |
2525 | ||
1f3279ae ED |
2526 | if (skb_still_in_host_queue(sk, skb)) |
2527 | goto rearm_timer; | |
2528 | ||
6ba8a3b1 ND |
2529 | pcount = tcp_skb_pcount(skb); |
2530 | if (WARN_ON(!pcount)) | |
2531 | goto rearm_timer; | |
2532 | ||
2533 | if ((pcount > 1) && (skb->len > (pcount - 1) * mss)) { | |
75c119af ED |
2534 | if (unlikely(tcp_fragment(sk, TCP_FRAG_IN_RTX_QUEUE, skb, |
2535 | (pcount - 1) * mss, mss, | |
6cc55e09 | 2536 | GFP_ATOMIC))) |
6ba8a3b1 | 2537 | goto rearm_timer; |
75c119af | 2538 | skb = skb_rb_next(skb); |
6ba8a3b1 ND |
2539 | } |
2540 | ||
2541 | if (WARN_ON(!skb || !tcp_skb_pcount(skb))) | |
2542 | goto rearm_timer; | |
2543 | ||
10d3be56 | 2544 | if (__tcp_retransmit_skb(sk, skb, 1)) |
b340b264 | 2545 | goto rearm_timer; |
6ba8a3b1 | 2546 | |
9b717a8d | 2547 | /* Record snd_nxt for loss detection. */ |
b340b264 | 2548 | tp->tlp_high_seq = tp->snd_nxt; |
9b717a8d | 2549 | |
b340b264 | 2550 | probe_sent: |
c10d9310 | 2551 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPLOSSPROBES); |
b340b264 YC |
2552 | /* Reset s.t. tcp_rearm_rto will restart timer from now */ |
2553 | inet_csk(sk)->icsk_pending = 0; | |
6ba8a3b1 | 2554 | rearm_timer: |
fcd16c0a | 2555 | tcp_rearm_rto(sk); |
1da177e4 LT |
2556 | } |
2557 | ||
a762a980 DM |
2558 | /* Push out any pending frames which were held back due to |
2559 | * TCP_CORK or attempt at coalescing tiny packets. | |
2560 | * The socket must be locked by the caller. | |
2561 | */ | |
9e412ba7 IJ |
2562 | void __tcp_push_pending_frames(struct sock *sk, unsigned int cur_mss, |
2563 | int nonagle) | |
a762a980 | 2564 | { |
726e07a8 IJ |
2565 | /* If we are closed, the bytes will have to remain here. |
2566 | * In time closedown will finish, we empty the write queue and | |
2567 | * all will be happy. | |
2568 | */ | |
2569 | if (unlikely(sk->sk_state == TCP_CLOSE)) | |
2570 | return; | |
2571 | ||
99a1dec7 | 2572 | if (tcp_write_xmit(sk, cur_mss, nonagle, 0, |
7450aaf6 | 2573 | sk_gfp_mask(sk, GFP_ATOMIC))) |
726e07a8 | 2574 | tcp_check_probe_timer(sk); |
a762a980 DM |
2575 | } |
2576 | ||
c1b4a7e6 DM |
2577 | /* Send _single_ skb sitting at the send head. This function requires |
2578 | * true push pending frames to setup probe timer etc. | |
2579 | */ | |
2580 | void tcp_push_one(struct sock *sk, unsigned int mss_now) | |
2581 | { | |
fe067e8a | 2582 | struct sk_buff *skb = tcp_send_head(sk); |
c1b4a7e6 DM |
2583 | |
2584 | BUG_ON(!skb || skb->len < mss_now); | |
2585 | ||
d5dd9175 | 2586 | tcp_write_xmit(sk, mss_now, TCP_NAGLE_PUSH, 1, sk->sk_allocation); |
c1b4a7e6 DM |
2587 | } |
2588 | ||
1da177e4 LT |
2589 | /* This function returns the amount that we can raise the |
2590 | * usable window based on the following constraints | |
e905a9ed | 2591 | * |
1da177e4 LT |
2592 | * 1. The window can never be shrunk once it is offered (RFC 793) |
2593 | * 2. We limit memory per socket | |
2594 | * | |
2595 | * RFC 1122: | |
2596 | * "the suggested [SWS] avoidance algorithm for the receiver is to keep | |
2597 | * RECV.NEXT + RCV.WIN fixed until: | |
2598 | * RCV.BUFF - RCV.USER - RCV.WINDOW >= min(1/2 RCV.BUFF, MSS)" | |
2599 | * | |
2600 | * i.e. don't raise the right edge of the window until you can raise | |
2601 | * it at least MSS bytes. | |
2602 | * | |
2603 | * Unfortunately, the recommended algorithm breaks header prediction, | |
2604 | * since header prediction assumes th->window stays fixed. | |
2605 | * | |
2606 | * Strictly speaking, keeping th->window fixed violates the receiver | |
2607 | * side SWS prevention criteria. The problem is that under this rule | |
2608 | * a stream of single byte packets will cause the right side of the | |
2609 | * window to always advance by a single byte. | |
e905a9ed | 2610 | * |
1da177e4 LT |
2611 | * Of course, if the sender implements sender side SWS prevention |
2612 | * then this will not be a problem. | |
e905a9ed | 2613 | * |
1da177e4 | 2614 | * BSD seems to make the following compromise: |
e905a9ed | 2615 | * |
1da177e4 LT |
2616 | * If the free space is less than the 1/4 of the maximum |
2617 | * space available and the free space is less than 1/2 mss, | |
2618 | * then set the window to 0. | |
2619 | * [ Actually, bsd uses MSS and 1/4 of maximal _window_ ] | |
2620 | * Otherwise, just prevent the window from shrinking | |
2621 | * and from being larger than the largest representable value. | |
2622 | * | |
2623 | * This prevents incremental opening of the window in the regime | |
2624 | * where TCP is limited by the speed of the reader side taking | |
2625 | * data out of the TCP receive queue. It does nothing about | |
2626 | * those cases where the window is constrained on the sender side | |
2627 | * because the pipeline is full. | |
2628 | * | |
2629 | * BSD also seems to "accidentally" limit itself to windows that are a | |
2630 | * multiple of MSS, at least until the free space gets quite small. | |
2631 | * This would appear to be a side effect of the mbuf implementation. | |
2632 | * Combining these two algorithms results in the observed behavior | |
2633 | * of having a fixed window size at almost all times. | |
2634 | * | |
2635 | * Below we obtain similar behavior by forcing the offered window to | |
2636 | * a multiple of the mss when it is feasible to do so. | |
2637 | * | |
2638 | * Note, we don't "adjust" for TIMESTAMP or SACK option bytes. | |
2639 | * Regular options like TIMESTAMP are taken into account. | |
2640 | */ | |
2641 | u32 __tcp_select_window(struct sock *sk) | |
2642 | { | |
463c84b9 | 2643 | struct inet_connection_sock *icsk = inet_csk(sk); |
1da177e4 | 2644 | struct tcp_sock *tp = tcp_sk(sk); |
caa20d9a | 2645 | /* MSS for the peer's data. Previous versions used mss_clamp |
1da177e4 LT |
2646 | * here. I don't know if the value based on our guesses |
2647 | * of peer's MSS is better for the performance. It's more correct | |
2648 | * but may be worse for the performance because of rcv_mss | |
2649 | * fluctuations. --SAW 1998/11/1 | |
2650 | */ | |
463c84b9 | 2651 | int mss = icsk->icsk_ack.rcv_mss; |
1da177e4 | 2652 | int free_space = tcp_space(sk); |
86c1a045 FW |
2653 | int allowed_space = tcp_full_space(sk); |
2654 | int full_space = min_t(int, tp->window_clamp, allowed_space); | |
1da177e4 LT |
2655 | int window; |
2656 | ||
06425c30 | 2657 | if (unlikely(mss > full_space)) { |
e905a9ed | 2658 | mss = full_space; |
06425c30 ED |
2659 | if (mss <= 0) |
2660 | return 0; | |
2661 | } | |
b92edbe0 | 2662 | if (free_space < (full_space >> 1)) { |
463c84b9 | 2663 | icsk->icsk_ack.quick = 0; |
1da177e4 | 2664 | |
b8da51eb | 2665 | if (tcp_under_memory_pressure(sk)) |
056834d9 IJ |
2666 | tp->rcv_ssthresh = min(tp->rcv_ssthresh, |
2667 | 4U * tp->advmss); | |
1da177e4 | 2668 | |
86c1a045 FW |
2669 | /* free_space might become our new window, make sure we don't |
2670 | * increase it due to wscale. | |
2671 | */ | |
2672 | free_space = round_down(free_space, 1 << tp->rx_opt.rcv_wscale); | |
2673 | ||
2674 | /* if free space is less than mss estimate, or is below 1/16th | |
2675 | * of the maximum allowed, try to move to zero-window, else | |
2676 | * tcp_clamp_window() will grow rcv buf up to tcp_rmem[2], and | |
2677 | * new incoming data is dropped due to memory limits. | |
2678 | * With large window, mss test triggers way too late in order | |
2679 | * to announce zero window in time before rmem limit kicks in. | |
2680 | */ | |
2681 | if (free_space < (allowed_space >> 4) || free_space < mss) | |
1da177e4 LT |
2682 | return 0; |
2683 | } | |
2684 | ||
2685 | if (free_space > tp->rcv_ssthresh) | |
2686 | free_space = tp->rcv_ssthresh; | |
2687 | ||
2688 | /* Don't do rounding if we are using window scaling, since the | |
2689 | * scaled window will not line up with the MSS boundary anyway. | |
2690 | */ | |
1da177e4 LT |
2691 | if (tp->rx_opt.rcv_wscale) { |
2692 | window = free_space; | |
2693 | ||
2694 | /* Advertise enough space so that it won't get scaled away. | |
2695 | * Import case: prevent zero window announcement if | |
2696 | * 1<<rcv_wscale > mss. | |
2697 | */ | |
1935299d | 2698 | window = ALIGN(window, (1 << tp->rx_opt.rcv_wscale)); |
1da177e4 | 2699 | } else { |
1935299d | 2700 | window = tp->rcv_wnd; |
1da177e4 LT |
2701 | /* Get the largest window that is a nice multiple of mss. |
2702 | * Window clamp already applied above. | |
2703 | * If our current window offering is within 1 mss of the | |
2704 | * free space we just keep it. This prevents the divide | |
2705 | * and multiply from happening most of the time. | |
2706 | * We also don't do any window rounding when the free space | |
2707 | * is too small. | |
2708 | */ | |
2709 | if (window <= free_space - mss || window > free_space) | |
1935299d | 2710 | window = rounddown(free_space, mss); |
84565070 | 2711 | else if (mss == full_space && |
b92edbe0 | 2712 | free_space > window + (full_space >> 1)) |
84565070 | 2713 | window = free_space; |
1da177e4 LT |
2714 | } |
2715 | ||
2716 | return window; | |
2717 | } | |
2718 | ||
cfea5a68 MKL |
2719 | void tcp_skb_collapse_tstamp(struct sk_buff *skb, |
2720 | const struct sk_buff *next_skb) | |
082ac2d5 | 2721 | { |
0a2cf20c SHY |
2722 | if (unlikely(tcp_has_tx_tstamp(next_skb))) { |
2723 | const struct skb_shared_info *next_shinfo = | |
2724 | skb_shinfo(next_skb); | |
082ac2d5 MKL |
2725 | struct skb_shared_info *shinfo = skb_shinfo(skb); |
2726 | ||
0a2cf20c | 2727 | shinfo->tx_flags |= next_shinfo->tx_flags & SKBTX_ANY_TSTAMP; |
082ac2d5 | 2728 | shinfo->tskey = next_shinfo->tskey; |
2de8023e MKL |
2729 | TCP_SKB_CB(skb)->txstamp_ack |= |
2730 | TCP_SKB_CB(next_skb)->txstamp_ack; | |
082ac2d5 MKL |
2731 | } |
2732 | } | |
2733 | ||
4a17fc3a | 2734 | /* Collapses two adjacent SKB's during retransmission. */ |
f8071cde | 2735 | static bool tcp_collapse_retrans(struct sock *sk, struct sk_buff *skb) |
1da177e4 LT |
2736 | { |
2737 | struct tcp_sock *tp = tcp_sk(sk); | |
75c119af | 2738 | struct sk_buff *next_skb = skb_rb_next(skb); |
058dc334 | 2739 | int skb_size, next_skb_size; |
1da177e4 | 2740 | |
058dc334 IJ |
2741 | skb_size = skb->len; |
2742 | next_skb_size = next_skb->len; | |
1da177e4 | 2743 | |
058dc334 | 2744 | BUG_ON(tcp_skb_pcount(skb) != 1 || tcp_skb_pcount(next_skb) != 1); |
a6963a6b | 2745 | |
f8071cde ED |
2746 | if (next_skb_size) { |
2747 | if (next_skb_size <= skb_availroom(skb)) | |
2748 | skb_copy_bits(next_skb, 0, skb_put(skb, next_skb_size), | |
2749 | next_skb_size); | |
2750 | else if (!skb_shift(skb, next_skb, next_skb_size)) | |
2751 | return false; | |
2752 | } | |
058dc334 | 2753 | tcp_highest_sack_combine(sk, next_skb, skb); |
1da177e4 | 2754 | |
058dc334 IJ |
2755 | if (next_skb->ip_summed == CHECKSUM_PARTIAL) |
2756 | skb->ip_summed = CHECKSUM_PARTIAL; | |
1da177e4 | 2757 | |
058dc334 IJ |
2758 | if (skb->ip_summed != CHECKSUM_PARTIAL) |
2759 | skb->csum = csum_block_add(skb->csum, next_skb->csum, skb_size); | |
1da177e4 | 2760 | |
058dc334 IJ |
2761 | /* Update sequence range on original skb. */ |
2762 | TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(next_skb)->end_seq; | |
1da177e4 | 2763 | |
e6c7d085 | 2764 | /* Merge over control information. This moves PSH/FIN etc. over */ |
4de075e0 | 2765 | TCP_SKB_CB(skb)->tcp_flags |= TCP_SKB_CB(next_skb)->tcp_flags; |
058dc334 IJ |
2766 | |
2767 | /* All done, get rid of second SKB and account for it so | |
2768 | * packet counting does not break. | |
2769 | */ | |
2770 | TCP_SKB_CB(skb)->sacked |= TCP_SKB_CB(next_skb)->sacked & TCPCB_EVER_RETRANS; | |
a643b5d4 | 2771 | TCP_SKB_CB(skb)->eor = TCP_SKB_CB(next_skb)->eor; |
058dc334 IJ |
2772 | |
2773 | /* changed transmit queue under us so clear hints */ | |
ef9da47c IJ |
2774 | tcp_clear_retrans_hints_partial(tp); |
2775 | if (next_skb == tp->retransmit_skb_hint) | |
2776 | tp->retransmit_skb_hint = skb; | |
058dc334 | 2777 | |
797108d1 IJ |
2778 | tcp_adjust_pcount(sk, next_skb, tcp_skb_pcount(next_skb)); |
2779 | ||
082ac2d5 MKL |
2780 | tcp_skb_collapse_tstamp(skb, next_skb); |
2781 | ||
75c119af | 2782 | tcp_rtx_queue_unlink_and_free(next_skb, sk); |
f8071cde | 2783 | return true; |
1da177e4 LT |
2784 | } |
2785 | ||
67edfef7 | 2786 | /* Check if coalescing SKBs is legal. */ |
a2a385d6 | 2787 | static bool tcp_can_collapse(const struct sock *sk, const struct sk_buff *skb) |
4a17fc3a IJ |
2788 | { |
2789 | if (tcp_skb_pcount(skb) > 1) | |
a2a385d6 | 2790 | return false; |
4a17fc3a | 2791 | if (skb_cloned(skb)) |
a2a385d6 | 2792 | return false; |
2331ccc5 | 2793 | /* Some heuristics for collapsing over SACK'd could be invented */ |
4a17fc3a | 2794 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED) |
a2a385d6 | 2795 | return false; |
4a17fc3a | 2796 | |
a2a385d6 | 2797 | return true; |
4a17fc3a IJ |
2798 | } |
2799 | ||
67edfef7 AK |
2800 | /* Collapse packets in the retransmit queue to make to create |
2801 | * less packets on the wire. This is only done on retransmission. | |
2802 | */ | |
4a17fc3a IJ |
2803 | static void tcp_retrans_try_collapse(struct sock *sk, struct sk_buff *to, |
2804 | int space) | |
2805 | { | |
2806 | struct tcp_sock *tp = tcp_sk(sk); | |
2807 | struct sk_buff *skb = to, *tmp; | |
a2a385d6 | 2808 | bool first = true; |
4a17fc3a IJ |
2809 | |
2810 | if (!sysctl_tcp_retrans_collapse) | |
2811 | return; | |
4de075e0 | 2812 | if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN) |
4a17fc3a IJ |
2813 | return; |
2814 | ||
75c119af | 2815 | skb_rbtree_walk_from_safe(skb, tmp) { |
4a17fc3a IJ |
2816 | if (!tcp_can_collapse(sk, skb)) |
2817 | break; | |
2818 | ||
a643b5d4 MKL |
2819 | if (!tcp_skb_can_collapse_to(to)) |
2820 | break; | |
2821 | ||
4a17fc3a IJ |
2822 | space -= skb->len; |
2823 | ||
2824 | if (first) { | |
a2a385d6 | 2825 | first = false; |
4a17fc3a IJ |
2826 | continue; |
2827 | } | |
2828 | ||
2829 | if (space < 0) | |
2830 | break; | |
4a17fc3a IJ |
2831 | |
2832 | if (after(TCP_SKB_CB(skb)->end_seq, tcp_wnd_end(tp))) | |
2833 | break; | |
2834 | ||
f8071cde ED |
2835 | if (!tcp_collapse_retrans(sk, to)) |
2836 | break; | |
4a17fc3a IJ |
2837 | } |
2838 | } | |
2839 | ||
1da177e4 LT |
2840 | /* This retransmits one SKB. Policy decisions and retransmit queue |
2841 | * state updates are done by the caller. Returns non-zero if an | |
2842 | * error occurred which prevented the send. | |
2843 | */ | |
10d3be56 | 2844 | int __tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb, int segs) |
1da177e4 | 2845 | { |
5d424d5a | 2846 | struct inet_connection_sock *icsk = inet_csk(sk); |
10d3be56 | 2847 | struct tcp_sock *tp = tcp_sk(sk); |
7d227cd2 | 2848 | unsigned int cur_mss; |
10d3be56 ED |
2849 | int diff, len, err; |
2850 | ||
1da177e4 | 2851 | |
10d3be56 ED |
2852 | /* Inconclusive MTU probe */ |
2853 | if (icsk->icsk_mtup.probe_size) | |
5d424d5a | 2854 | icsk->icsk_mtup.probe_size = 0; |
5d424d5a | 2855 | |
1da177e4 | 2856 | /* Do not sent more than we queued. 1/4 is reserved for possible |
caa20d9a | 2857 | * copying overhead: fragmentation, tunneling, mangling etc. |
1da177e4 | 2858 | */ |
14afee4b | 2859 | if (refcount_read(&sk->sk_wmem_alloc) > |
ffb4d6c8 ED |
2860 | min_t(u32, sk->sk_wmem_queued + (sk->sk_wmem_queued >> 2), |
2861 | sk->sk_sndbuf)) | |
1da177e4 LT |
2862 | return -EAGAIN; |
2863 | ||
1f3279ae ED |
2864 | if (skb_still_in_host_queue(sk, skb)) |
2865 | return -EBUSY; | |
2866 | ||
1da177e4 LT |
2867 | if (before(TCP_SKB_CB(skb)->seq, tp->snd_una)) { |
2868 | if (before(TCP_SKB_CB(skb)->end_seq, tp->snd_una)) | |
2869 | BUG(); | |
1da177e4 LT |
2870 | if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq)) |
2871 | return -ENOMEM; | |
2872 | } | |
2873 | ||
7d227cd2 SS |
2874 | if (inet_csk(sk)->icsk_af_ops->rebuild_header(sk)) |
2875 | return -EHOSTUNREACH; /* Routing failure or similar. */ | |
2876 | ||
0c54b85f | 2877 | cur_mss = tcp_current_mss(sk); |
7d227cd2 | 2878 | |
1da177e4 LT |
2879 | /* If receiver has shrunk his window, and skb is out of |
2880 | * new window, do not retransmit it. The exception is the | |
2881 | * case, when window is shrunk to zero. In this case | |
2882 | * our retransmit serves as a zero window probe. | |
2883 | */ | |
9d4fb27d JP |
2884 | if (!before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp)) && |
2885 | TCP_SKB_CB(skb)->seq != tp->snd_una) | |
1da177e4 LT |
2886 | return -EAGAIN; |
2887 | ||
10d3be56 ED |
2888 | len = cur_mss * segs; |
2889 | if (skb->len > len) { | |
75c119af ED |
2890 | if (tcp_fragment(sk, TCP_FRAG_IN_RTX_QUEUE, skb, len, |
2891 | cur_mss, GFP_ATOMIC)) | |
1da177e4 | 2892 | return -ENOMEM; /* We'll try again later. */ |
02276f3c | 2893 | } else { |
10d3be56 ED |
2894 | if (skb_unclone(skb, GFP_ATOMIC)) |
2895 | return -ENOMEM; | |
9eb9362e | 2896 | |
10d3be56 ED |
2897 | diff = tcp_skb_pcount(skb); |
2898 | tcp_set_skb_tso_segs(skb, cur_mss); | |
2899 | diff -= tcp_skb_pcount(skb); | |
2900 | if (diff) | |
2901 | tcp_adjust_pcount(sk, skb, diff); | |
2902 | if (skb->len < cur_mss) | |
2903 | tcp_retrans_try_collapse(sk, skb, cur_mss); | |
1da177e4 LT |
2904 | } |
2905 | ||
49213555 DB |
2906 | /* RFC3168, section 6.1.1.1. ECN fallback */ |
2907 | if ((TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN_ECN) == TCPHDR_SYN_ECN) | |
2908 | tcp_ecn_clear_syn(sk, skb); | |
2909 | ||
678550c6 YC |
2910 | /* Update global and local TCP statistics. */ |
2911 | segs = tcp_skb_pcount(skb); | |
2912 | TCP_ADD_STATS(sock_net(sk), TCP_MIB_RETRANSSEGS, segs); | |
2913 | if (TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN) | |
2914 | __NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPSYNRETRANS); | |
2915 | tp->total_retrans += segs; | |
2916 | ||
50bceae9 TG |
2917 | /* make sure skb->data is aligned on arches that require it |
2918 | * and check if ack-trimming & collapsing extended the headroom | |
2919 | * beyond what csum_start can cover. | |
2920 | */ | |
2921 | if (unlikely((NET_IP_ALIGN && ((unsigned long)skb->data & 3)) || | |
2922 | skb_headroom(skb) >= 0xFFFF)) { | |
10a81980 ED |
2923 | struct sk_buff *nskb; |
2924 | ||
e2080072 ED |
2925 | tcp_skb_tsorted_save(skb) { |
2926 | nskb = __pskb_copy(skb, MAX_TCP_HEADER, GFP_ATOMIC); | |
2927 | err = nskb ? tcp_transmit_skb(sk, nskb, 0, GFP_ATOMIC) : | |
2928 | -ENOBUFS; | |
2929 | } tcp_skb_tsorted_restore(skb); | |
2930 | ||
8c72c65b | 2931 | if (!err) |
e2080072 | 2932 | tcp_update_skb_after_send(tp, skb); |
117632e6 | 2933 | } else { |
c84a5711 | 2934 | err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC); |
117632e6 | 2935 | } |
c84a5711 | 2936 | |
fc9f3501 | 2937 | if (likely(!err)) { |
c84a5711 | 2938 | TCP_SKB_CB(skb)->sacked |= TCPCB_EVER_RETRANS; |
e086101b | 2939 | trace_tcp_retransmit_skb(sk, skb); |
678550c6 YC |
2940 | } else if (err != -EBUSY) { |
2941 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPRETRANSFAIL); | |
fc9f3501 | 2942 | } |
c84a5711 | 2943 | return err; |
93b174ad YC |
2944 | } |
2945 | ||
10d3be56 | 2946 | int tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb, int segs) |
93b174ad YC |
2947 | { |
2948 | struct tcp_sock *tp = tcp_sk(sk); | |
10d3be56 | 2949 | int err = __tcp_retransmit_skb(sk, skb, segs); |
1da177e4 LT |
2950 | |
2951 | if (err == 0) { | |
1da177e4 | 2952 | #if FASTRETRANS_DEBUG > 0 |
056834d9 | 2953 | if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) { |
e87cc472 | 2954 | net_dbg_ratelimited("retrans_out leaked\n"); |
1da177e4 LT |
2955 | } |
2956 | #endif | |
2957 | TCP_SKB_CB(skb)->sacked |= TCPCB_RETRANS; | |
2958 | tp->retrans_out += tcp_skb_pcount(skb); | |
2959 | ||
2960 | /* Save stamp of the first retransmit. */ | |
2961 | if (!tp->retrans_stamp) | |
7faee5c0 | 2962 | tp->retrans_stamp = tcp_skb_timestamp(skb); |
1da177e4 | 2963 | |
1da177e4 | 2964 | } |
6e08d5e3 YC |
2965 | |
2966 | if (tp->undo_retrans < 0) | |
2967 | tp->undo_retrans = 0; | |
2968 | tp->undo_retrans += tcp_skb_pcount(skb); | |
1da177e4 LT |
2969 | return err; |
2970 | } | |
2971 | ||
2972 | /* This gets called after a retransmit timeout, and the initially | |
2973 | * retransmitted data is acknowledged. It tries to continue | |
2974 | * resending the rest of the retransmit queue, until either | |
2975 | * we've sent it all or the congestion window limit is reached. | |
2976 | * If doing SACK, the first ACK which comes back for a timeout | |
2977 | * based retransmit packet might feed us FACK information again. | |
2978 | * If so, we use it to avoid unnecessarily retransmissions. | |
2979 | */ | |
2980 | void tcp_xmit_retransmit_queue(struct sock *sk) | |
2981 | { | |
6687e988 | 2982 | const struct inet_connection_sock *icsk = inet_csk(sk); |
b9f1f1ce | 2983 | struct sk_buff *skb, *rtx_head, *hole = NULL; |
1da177e4 | 2984 | struct tcp_sock *tp = tcp_sk(sk); |
840a3cbe | 2985 | u32 max_segs; |
61eb55f4 | 2986 | int mib_idx; |
6a438bbe | 2987 | |
45e77d31 IJ |
2988 | if (!tp->packets_out) |
2989 | return; | |
2990 | ||
b9f1f1ce ED |
2991 | rtx_head = tcp_rtx_queue_head(sk); |
2992 | skb = tp->retransmit_skb_hint ?: rtx_head; | |
ed6e7268 | 2993 | max_segs = tcp_tso_segs(sk, tcp_current_mss(sk)); |
75c119af | 2994 | skb_rbtree_walk_from(skb) { |
dca0aaf8 | 2995 | __u8 sacked; |
10d3be56 | 2996 | int segs; |
1da177e4 | 2997 | |
218af599 ED |
2998 | if (tcp_pacing_check(sk)) |
2999 | break; | |
3000 | ||
08ebd172 | 3001 | /* we could do better than to assign each time */ |
51456b29 | 3002 | if (!hole) |
0e1c54c2 | 3003 | tp->retransmit_skb_hint = skb; |
08ebd172 | 3004 | |
10d3be56 ED |
3005 | segs = tp->snd_cwnd - tcp_packets_in_flight(tp); |
3006 | if (segs <= 0) | |
08ebd172 | 3007 | return; |
dca0aaf8 | 3008 | sacked = TCP_SKB_CB(skb)->sacked; |
a3d2e9f8 ED |
3009 | /* In case tcp_shift_skb_data() have aggregated large skbs, |
3010 | * we need to make sure not sending too bigs TSO packets | |
3011 | */ | |
3012 | segs = min_t(int, segs, max_segs); | |
1da177e4 | 3013 | |
840a3cbe YC |
3014 | if (tp->retrans_out >= tp->lost_out) { |
3015 | break; | |
0e1c54c2 | 3016 | } else if (!(sacked & TCPCB_LOST)) { |
51456b29 | 3017 | if (!hole && !(sacked & (TCPCB_SACKED_RETRANS|TCPCB_SACKED_ACKED))) |
0e1c54c2 IJ |
3018 | hole = skb; |
3019 | continue; | |
1da177e4 | 3020 | |
0e1c54c2 IJ |
3021 | } else { |
3022 | if (icsk->icsk_ca_state != TCP_CA_Loss) | |
3023 | mib_idx = LINUX_MIB_TCPFASTRETRANS; | |
3024 | else | |
3025 | mib_idx = LINUX_MIB_TCPSLOWSTARTRETRANS; | |
3026 | } | |
1da177e4 | 3027 | |
0e1c54c2 | 3028 | if (sacked & (TCPCB_SACKED_ACKED|TCPCB_SACKED_RETRANS)) |
1da177e4 LT |
3029 | continue; |
3030 | ||
f9616c35 ED |
3031 | if (tcp_small_queue_check(sk, skb, 1)) |
3032 | return; | |
3033 | ||
10d3be56 | 3034 | if (tcp_retransmit_skb(sk, skb, segs)) |
0e1c54c2 | 3035 | return; |
24ab6bec | 3036 | |
de1d6578 | 3037 | NET_ADD_STATS(sock_net(sk), mib_idx, tcp_skb_pcount(skb)); |
1da177e4 | 3038 | |
684bad11 | 3039 | if (tcp_in_cwnd_reduction(sk)) |
a262f0cd ND |
3040 | tp->prr_out += tcp_skb_pcount(skb); |
3041 | ||
75c119af | 3042 | if (skb == rtx_head && |
57dde7f7 | 3043 | icsk->icsk_pending != ICSK_TIME_REO_TIMEOUT) |
3f421baa ACM |
3044 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, |
3045 | inet_csk(sk)->icsk_rto, | |
3046 | TCP_RTO_MAX); | |
1da177e4 LT |
3047 | } |
3048 | } | |
3049 | ||
d83769a5 ED |
3050 | /* We allow to exceed memory limits for FIN packets to expedite |
3051 | * connection tear down and (memory) recovery. | |
845704a5 ED |
3052 | * Otherwise tcp_send_fin() could be tempted to either delay FIN |
3053 | * or even be forced to close flow without any FIN. | |
a6c5ea4c ED |
3054 | * In general, we want to allow one skb per socket to avoid hangs |
3055 | * with edge trigger epoll() | |
d83769a5 | 3056 | */ |
a6c5ea4c | 3057 | void sk_forced_mem_schedule(struct sock *sk, int size) |
d83769a5 | 3058 | { |
e805605c | 3059 | int amt; |
d83769a5 ED |
3060 | |
3061 | if (size <= sk->sk_forward_alloc) | |
3062 | return; | |
3063 | amt = sk_mem_pages(size); | |
3064 | sk->sk_forward_alloc += amt * SK_MEM_QUANTUM; | |
e805605c JW |
3065 | sk_memory_allocated_add(sk, amt); |
3066 | ||
baac50bb JW |
3067 | if (mem_cgroup_sockets_enabled && sk->sk_memcg) |
3068 | mem_cgroup_charge_skmem(sk->sk_memcg, amt); | |
d83769a5 ED |
3069 | } |
3070 | ||
845704a5 ED |
3071 | /* Send a FIN. The caller locks the socket for us. |
3072 | * We should try to send a FIN packet really hard, but eventually give up. | |
1da177e4 LT |
3073 | */ |
3074 | void tcp_send_fin(struct sock *sk) | |
3075 | { | |
845704a5 | 3076 | struct sk_buff *skb, *tskb = tcp_write_queue_tail(sk); |
e905a9ed | 3077 | struct tcp_sock *tp = tcp_sk(sk); |
e905a9ed | 3078 | |
845704a5 ED |
3079 | /* Optimization, tack on the FIN if we have one skb in write queue and |
3080 | * this skb was not yet sent, or we are under memory pressure. | |
3081 | * Note: in the latter case, FIN packet will be sent after a timeout, | |
3082 | * as TCP stack thinks it has already been transmitted. | |
1da177e4 | 3083 | */ |
75c119af ED |
3084 | if (!tskb && tcp_under_memory_pressure(sk)) |
3085 | tskb = skb_rb_last(&sk->tcp_rtx_queue); | |
3086 | ||
3087 | if (tskb) { | |
845704a5 ED |
3088 | coalesce: |
3089 | TCP_SKB_CB(tskb)->tcp_flags |= TCPHDR_FIN; | |
3090 | TCP_SKB_CB(tskb)->end_seq++; | |
1da177e4 | 3091 | tp->write_seq++; |
75c119af | 3092 | if (tcp_write_queue_empty(sk)) { |
845704a5 ED |
3093 | /* This means tskb was already sent. |
3094 | * Pretend we included the FIN on previous transmit. | |
3095 | * We need to set tp->snd_nxt to the value it would have | |
3096 | * if FIN had been sent. This is because retransmit path | |
3097 | * does not change tp->snd_nxt. | |
3098 | */ | |
3099 | tp->snd_nxt++; | |
3100 | return; | |
3101 | } | |
1da177e4 | 3102 | } else { |
845704a5 ED |
3103 | skb = alloc_skb_fclone(MAX_TCP_HEADER, sk->sk_allocation); |
3104 | if (unlikely(!skb)) { | |
3105 | if (tskb) | |
3106 | goto coalesce; | |
3107 | return; | |
1da177e4 | 3108 | } |
e2080072 | 3109 | INIT_LIST_HEAD(&skb->tcp_tsorted_anchor); |
d83769a5 | 3110 | skb_reserve(skb, MAX_TCP_HEADER); |
a6c5ea4c | 3111 | sk_forced_mem_schedule(sk, skb->truesize); |
1da177e4 | 3112 | /* FIN eats a sequence byte, write_seq advanced by tcp_queue_skb(). */ |
e870a8ef | 3113 | tcp_init_nondata_skb(skb, tp->write_seq, |
a3433f35 | 3114 | TCPHDR_ACK | TCPHDR_FIN); |
1da177e4 LT |
3115 | tcp_queue_skb(sk, skb); |
3116 | } | |
845704a5 | 3117 | __tcp_push_pending_frames(sk, tcp_current_mss(sk), TCP_NAGLE_OFF); |
1da177e4 LT |
3118 | } |
3119 | ||
3120 | /* We get here when a process closes a file descriptor (either due to | |
3121 | * an explicit close() or as a byproduct of exit()'ing) and there | |
3122 | * was unread data in the receive queue. This behavior is recommended | |
65bb723c | 3123 | * by RFC 2525, section 2.17. -DaveM |
1da177e4 | 3124 | */ |
dd0fc66f | 3125 | void tcp_send_active_reset(struct sock *sk, gfp_t priority) |
1da177e4 | 3126 | { |
1da177e4 LT |
3127 | struct sk_buff *skb; |
3128 | ||
7cc2b043 GF |
3129 | TCP_INC_STATS(sock_net(sk), TCP_MIB_OUTRSTS); |
3130 | ||
1da177e4 LT |
3131 | /* NOTE: No TCP options attached and we never retransmit this. */ |
3132 | skb = alloc_skb(MAX_TCP_HEADER, priority); | |
3133 | if (!skb) { | |
4e673444 | 3134 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED); |
1da177e4 LT |
3135 | return; |
3136 | } | |
3137 | ||
3138 | /* Reserve space for headers and prepare control bits. */ | |
3139 | skb_reserve(skb, MAX_TCP_HEADER); | |
e870a8ef | 3140 | tcp_init_nondata_skb(skb, tcp_acceptable_seq(sk), |
a3433f35 | 3141 | TCPHDR_ACK | TCPHDR_RST); |
9a568de4 | 3142 | tcp_mstamp_refresh(tcp_sk(sk)); |
1da177e4 | 3143 | /* Send it off. */ |
dfb4b9dc | 3144 | if (tcp_transmit_skb(sk, skb, 0, priority)) |
4e673444 | 3145 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED); |
c24b14c4 SL |
3146 | |
3147 | /* skb of trace_tcp_send_reset() keeps the skb that caused RST, | |
3148 | * skb here is different to the troublesome skb, so use NULL | |
3149 | */ | |
3150 | trace_tcp_send_reset(sk, NULL); | |
1da177e4 LT |
3151 | } |
3152 | ||
67edfef7 AK |
3153 | /* Send a crossed SYN-ACK during socket establishment. |
3154 | * WARNING: This routine must only be called when we have already sent | |
1da177e4 LT |
3155 | * a SYN packet that crossed the incoming SYN that caused this routine |
3156 | * to get called. If this assumption fails then the initial rcv_wnd | |
3157 | * and rcv_wscale values will not be correct. | |
3158 | */ | |
3159 | int tcp_send_synack(struct sock *sk) | |
3160 | { | |
056834d9 | 3161 | struct sk_buff *skb; |
1da177e4 | 3162 | |
75c119af | 3163 | skb = tcp_rtx_queue_head(sk); |
51456b29 | 3164 | if (!skb || !(TCP_SKB_CB(skb)->tcp_flags & TCPHDR_SYN)) { |
75c119af | 3165 | pr_err("%s: wrong queue state\n", __func__); |
1da177e4 LT |
3166 | return -EFAULT; |
3167 | } | |
4de075e0 | 3168 | if (!(TCP_SKB_CB(skb)->tcp_flags & TCPHDR_ACK)) { |
1da177e4 | 3169 | if (skb_cloned(skb)) { |
e2080072 ED |
3170 | struct sk_buff *nskb; |
3171 | ||
3172 | tcp_skb_tsorted_save(skb) { | |
3173 | nskb = skb_copy(skb, GFP_ATOMIC); | |
3174 | } tcp_skb_tsorted_restore(skb); | |
51456b29 | 3175 | if (!nskb) |
1da177e4 | 3176 | return -ENOMEM; |
e2080072 | 3177 | INIT_LIST_HEAD(&nskb->tcp_tsorted_anchor); |
75c119af | 3178 | tcp_rtx_queue_unlink_and_free(skb, sk); |
f4a775d1 | 3179 | __skb_header_release(nskb); |
75c119af | 3180 | tcp_rbtree_insert(&sk->tcp_rtx_queue, nskb); |
3ab224be HA |
3181 | sk->sk_wmem_queued += nskb->truesize; |
3182 | sk_mem_charge(sk, nskb->truesize); | |
1da177e4 LT |
3183 | skb = nskb; |
3184 | } | |
3185 | ||
4de075e0 | 3186 | TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_ACK; |
735d3831 | 3187 | tcp_ecn_send_synack(sk, skb); |
1da177e4 | 3188 | } |
dfb4b9dc | 3189 | return tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC); |
1da177e4 LT |
3190 | } |
3191 | ||
4aea39c1 ED |
3192 | /** |
3193 | * tcp_make_synack - Prepare a SYN-ACK. | |
3194 | * sk: listener socket | |
3195 | * dst: dst entry attached to the SYNACK | |
3196 | * req: request_sock pointer | |
4aea39c1 ED |
3197 | * |
3198 | * Allocate one skb and build a SYNACK packet. | |
3199 | * @dst is consumed : Caller should not use it again. | |
3200 | */ | |
5d062de7 | 3201 | struct sk_buff *tcp_make_synack(const struct sock *sk, struct dst_entry *dst, |
e6b4d113 | 3202 | struct request_sock *req, |
ca6fb065 | 3203 | struct tcp_fastopen_cookie *foc, |
b3d05147 | 3204 | enum tcp_synack_type synack_type) |
1da177e4 | 3205 | { |
2e6599cb | 3206 | struct inet_request_sock *ireq = inet_rsk(req); |
5d062de7 | 3207 | const struct tcp_sock *tp = tcp_sk(sk); |
80f03e27 | 3208 | struct tcp_md5sig_key *md5 = NULL; |
5d062de7 ED |
3209 | struct tcp_out_options opts; |
3210 | struct sk_buff *skb; | |
bd0388ae | 3211 | int tcp_header_size; |
5d062de7 | 3212 | struct tcphdr *th; |
f5fff5dc | 3213 | int mss; |
1da177e4 | 3214 | |
ca6fb065 | 3215 | skb = alloc_skb(MAX_TCP_HEADER, GFP_ATOMIC); |
4aea39c1 ED |
3216 | if (unlikely(!skb)) { |
3217 | dst_release(dst); | |
1da177e4 | 3218 | return NULL; |
4aea39c1 | 3219 | } |
1da177e4 LT |
3220 | /* Reserve space for headers. */ |
3221 | skb_reserve(skb, MAX_TCP_HEADER); | |
3222 | ||
b3d05147 ED |
3223 | switch (synack_type) { |
3224 | case TCP_SYNACK_NORMAL: | |
9e17f8a4 | 3225 | skb_set_owner_w(skb, req_to_sk(req)); |
b3d05147 ED |
3226 | break; |
3227 | case TCP_SYNACK_COOKIE: | |
3228 | /* Under synflood, we do not attach skb to a socket, | |
3229 | * to avoid false sharing. | |
3230 | */ | |
3231 | break; | |
3232 | case TCP_SYNACK_FASTOPEN: | |
ca6fb065 ED |
3233 | /* sk is a const pointer, because we want to express multiple |
3234 | * cpu might call us concurrently. | |
3235 | * sk->sk_wmem_alloc in an atomic, we can promote to rw. | |
3236 | */ | |
3237 | skb_set_owner_w(skb, (struct sock *)sk); | |
b3d05147 | 3238 | break; |
ca6fb065 | 3239 | } |
4aea39c1 | 3240 | skb_dst_set(skb, dst); |
1da177e4 | 3241 | |
3541f9e8 | 3242 | mss = tcp_mss_clamp(tp, dst_metric_advmss(dst)); |
f5fff5dc | 3243 | |
33ad798c | 3244 | memset(&opts, 0, sizeof(opts)); |
8b5f12d0 FW |
3245 | #ifdef CONFIG_SYN_COOKIES |
3246 | if (unlikely(req->cookie_ts)) | |
9a568de4 | 3247 | skb->skb_mstamp = cookie_init_timestamp(req); |
8b5f12d0 FW |
3248 | else |
3249 | #endif | |
9a568de4 | 3250 | skb->skb_mstamp = tcp_clock_us(); |
80f03e27 ED |
3251 | |
3252 | #ifdef CONFIG_TCP_MD5SIG | |
3253 | rcu_read_lock(); | |
fd3a154a | 3254 | md5 = tcp_rsk(req)->af_specific->req_md5_lookup(sk, req_to_sk(req)); |
80f03e27 | 3255 | #endif |
58d607d3 | 3256 | skb_set_hash(skb, tcp_rsk(req)->txhash, PKT_HASH_TYPE_L4); |
60e2a778 UB |
3257 | tcp_header_size = tcp_synack_options(sk, req, mss, skb, &opts, md5, |
3258 | foc) + sizeof(*th); | |
cfb6eeb4 | 3259 | |
aa8223c7 ACM |
3260 | skb_push(skb, tcp_header_size); |
3261 | skb_reset_transport_header(skb); | |
1da177e4 | 3262 | |
ea1627c2 | 3263 | th = (struct tcphdr *)skb->data; |
1da177e4 LT |
3264 | memset(th, 0, sizeof(struct tcphdr)); |
3265 | th->syn = 1; | |
3266 | th->ack = 1; | |
6ac705b1 | 3267 | tcp_ecn_make_synack(req, th); |
b44084c2 | 3268 | th->source = htons(ireq->ir_num); |
634fb979 | 3269 | th->dest = ireq->ir_rmt_port; |
e05a90ec | 3270 | skb->mark = ireq->ir_mark; |
e870a8ef IJ |
3271 | /* Setting of flags are superfluous here for callers (and ECE is |
3272 | * not even correctly set) | |
3273 | */ | |
3274 | tcp_init_nondata_skb(skb, tcp_rsk(req)->snt_isn, | |
a3433f35 | 3275 | TCPHDR_SYN | TCPHDR_ACK); |
4957faad | 3276 | |
1da177e4 | 3277 | th->seq = htonl(TCP_SKB_CB(skb)->seq); |
8336886f JC |
3278 | /* XXX data is queued and acked as is. No buffer/window check */ |
3279 | th->ack_seq = htonl(tcp_rsk(req)->rcv_nxt); | |
1da177e4 LT |
3280 | |
3281 | /* RFC1323: The window in SYN & SYN/ACK segments is never scaled. */ | |
ed53d0ab | 3282 | th->window = htons(min(req->rsk_rcv_wnd, 65535U)); |
5d062de7 | 3283 | tcp_options_write((__be32 *)(th + 1), NULL, &opts); |
1da177e4 | 3284 | th->doff = (tcp_header_size >> 2); |
90bbcc60 | 3285 | __TCP_INC_STATS(sock_net(sk), TCP_MIB_OUTSEGS); |
cfb6eeb4 YH |
3286 | |
3287 | #ifdef CONFIG_TCP_MD5SIG | |
3288 | /* Okay, we have all we need - do the md5 hash if needed */ | |
80f03e27 | 3289 | if (md5) |
bd0388ae | 3290 | tcp_rsk(req)->af_specific->calc_md5_hash(opts.hash_location, |
39f8e58e | 3291 | md5, req_to_sk(req), skb); |
80f03e27 | 3292 | rcu_read_unlock(); |
cfb6eeb4 YH |
3293 | #endif |
3294 | ||
b50edd78 | 3295 | /* Do not fool tcpdump (if any), clean our debris */ |
2456e855 | 3296 | skb->tstamp = 0; |
1da177e4 LT |
3297 | return skb; |
3298 | } | |
4bc2f18b | 3299 | EXPORT_SYMBOL(tcp_make_synack); |
1da177e4 | 3300 | |
81164413 DB |
3301 | static void tcp_ca_dst_init(struct sock *sk, const struct dst_entry *dst) |
3302 | { | |
3303 | struct inet_connection_sock *icsk = inet_csk(sk); | |
3304 | const struct tcp_congestion_ops *ca; | |
3305 | u32 ca_key = dst_metric(dst, RTAX_CC_ALGO); | |
3306 | ||
3307 | if (ca_key == TCP_CA_UNSPEC) | |
3308 | return; | |
3309 | ||
3310 | rcu_read_lock(); | |
3311 | ca = tcp_ca_find_key(ca_key); | |
3312 | if (likely(ca && try_module_get(ca->owner))) { | |
3313 | module_put(icsk->icsk_ca_ops->owner); | |
3314 | icsk->icsk_ca_dst_locked = tcp_ca_dst_locked(dst); | |
3315 | icsk->icsk_ca_ops = ca; | |
3316 | } | |
3317 | rcu_read_unlock(); | |
3318 | } | |
3319 | ||
67edfef7 | 3320 | /* Do all connect socket setups that can be done AF independent. */ |
f7e56a76 | 3321 | static void tcp_connect_init(struct sock *sk) |
1da177e4 | 3322 | { |
cf533ea5 | 3323 | const struct dst_entry *dst = __sk_dst_get(sk); |
1da177e4 LT |
3324 | struct tcp_sock *tp = tcp_sk(sk); |
3325 | __u8 rcv_wscale; | |
13d3b1eb | 3326 | u32 rcv_wnd; |
1da177e4 LT |
3327 | |
3328 | /* We'll fix this up when we get a response from the other end. | |
3329 | * See tcp_input.c:tcp_rcv_state_process case TCP_SYN_SENT. | |
3330 | */ | |
5d2ed052 ED |
3331 | tp->tcp_header_len = sizeof(struct tcphdr); |
3332 | if (sock_net(sk)->ipv4.sysctl_tcp_timestamps) | |
3333 | tp->tcp_header_len += TCPOLEN_TSTAMP_ALIGNED; | |
1da177e4 | 3334 | |
cfb6eeb4 | 3335 | #ifdef CONFIG_TCP_MD5SIG |
00db4124 | 3336 | if (tp->af_specific->md5_lookup(sk, sk)) |
cfb6eeb4 YH |
3337 | tp->tcp_header_len += TCPOLEN_MD5SIG_ALIGNED; |
3338 | #endif | |
3339 | ||
1da177e4 LT |
3340 | /* If user gave his TCP_MAXSEG, record it to clamp */ |
3341 | if (tp->rx_opt.user_mss) | |
3342 | tp->rx_opt.mss_clamp = tp->rx_opt.user_mss; | |
3343 | tp->max_window = 0; | |
5d424d5a | 3344 | tcp_mtup_init(sk); |
1da177e4 LT |
3345 | tcp_sync_mss(sk, dst_mtu(dst)); |
3346 | ||
81164413 DB |
3347 | tcp_ca_dst_init(sk, dst); |
3348 | ||
1da177e4 LT |
3349 | if (!tp->window_clamp) |
3350 | tp->window_clamp = dst_metric(dst, RTAX_WINDOW); | |
3541f9e8 | 3351 | tp->advmss = tcp_mss_clamp(tp, dst_metric_advmss(dst)); |
f5fff5dc | 3352 | |
1da177e4 | 3353 | tcp_initialize_rcv_mss(sk); |
1da177e4 | 3354 | |
e88c64f0 HPP |
3355 | /* limit the window selection if the user enforce a smaller rx buffer */ |
3356 | if (sk->sk_userlocks & SOCK_RCVBUF_LOCK && | |
3357 | (tp->window_clamp > tcp_full_space(sk) || tp->window_clamp == 0)) | |
3358 | tp->window_clamp = tcp_full_space(sk); | |
3359 | ||
13d3b1eb LB |
3360 | rcv_wnd = tcp_rwnd_init_bpf(sk); |
3361 | if (rcv_wnd == 0) | |
3362 | rcv_wnd = dst_metric(dst, RTAX_INITRWND); | |
3363 | ||
1da177e4 LT |
3364 | tcp_select_initial_window(tcp_full_space(sk), |
3365 | tp->advmss - (tp->rx_opt.ts_recent_stamp ? tp->tcp_header_len - sizeof(struct tcphdr) : 0), | |
3366 | &tp->rcv_wnd, | |
3367 | &tp->window_clamp, | |
9bb37ef0 | 3368 | sock_net(sk)->ipv4.sysctl_tcp_window_scaling, |
31d12926 | 3369 | &rcv_wscale, |
13d3b1eb | 3370 | rcv_wnd); |
1da177e4 LT |
3371 | |
3372 | tp->rx_opt.rcv_wscale = rcv_wscale; | |
3373 | tp->rcv_ssthresh = tp->rcv_wnd; | |
3374 | ||
3375 | sk->sk_err = 0; | |
3376 | sock_reset_flag(sk, SOCK_DONE); | |
3377 | tp->snd_wnd = 0; | |
ee7537b6 | 3378 | tcp_init_wl(tp, 0); |
1da177e4 LT |
3379 | tp->snd_una = tp->write_seq; |
3380 | tp->snd_sml = tp->write_seq; | |
33f5f57e | 3381 | tp->snd_up = tp->write_seq; |
370816ae | 3382 | tp->snd_nxt = tp->write_seq; |
ee995283 PE |
3383 | |
3384 | if (likely(!tp->repair)) | |
3385 | tp->rcv_nxt = 0; | |
c7781a6e | 3386 | else |
70eabf0e | 3387 | tp->rcv_tstamp = tcp_jiffies32; |
ee995283 PE |
3388 | tp->rcv_wup = tp->rcv_nxt; |
3389 | tp->copied_seq = tp->rcv_nxt; | |
1da177e4 | 3390 | |
8550f328 | 3391 | inet_csk(sk)->icsk_rto = tcp_timeout_init(sk); |
463c84b9 | 3392 | inet_csk(sk)->icsk_retransmits = 0; |
1da177e4 LT |
3393 | tcp_clear_retrans(tp); |
3394 | } | |
3395 | ||
783237e8 YC |
3396 | static void tcp_connect_queue_skb(struct sock *sk, struct sk_buff *skb) |
3397 | { | |
3398 | struct tcp_sock *tp = tcp_sk(sk); | |
3399 | struct tcp_skb_cb *tcb = TCP_SKB_CB(skb); | |
3400 | ||
3401 | tcb->end_seq += skb->len; | |
f4a775d1 | 3402 | __skb_header_release(skb); |
783237e8 YC |
3403 | sk->sk_wmem_queued += skb->truesize; |
3404 | sk_mem_charge(sk, skb->truesize); | |
3405 | tp->write_seq = tcb->end_seq; | |
3406 | tp->packets_out += tcp_skb_pcount(skb); | |
3407 | } | |
3408 | ||
3409 | /* Build and send a SYN with data and (cached) Fast Open cookie. However, | |
3410 | * queue a data-only packet after the regular SYN, such that regular SYNs | |
3411 | * are retransmitted on timeouts. Also if the remote SYN-ACK acknowledges | |
3412 | * only the SYN sequence, the data are retransmitted in the first ACK. | |
3413 | * If cookie is not cached or other error occurs, falls back to send a | |
3414 | * regular SYN with Fast Open cookie request option. | |
3415 | */ | |
3416 | static int tcp_send_syn_data(struct sock *sk, struct sk_buff *syn) | |
3417 | { | |
3418 | struct tcp_sock *tp = tcp_sk(sk); | |
3419 | struct tcp_fastopen_request *fo = tp->fastopen_req; | |
065263f4 | 3420 | int space, err = 0; |
355a901e | 3421 | struct sk_buff *syn_data; |
aab48743 | 3422 | |
67da22d2 | 3423 | tp->rx_opt.mss_clamp = tp->advmss; /* If MSS is not cached */ |
065263f4 | 3424 | if (!tcp_fastopen_cookie_check(sk, &tp->rx_opt.mss_clamp, &fo->cookie)) |
783237e8 YC |
3425 | goto fallback; |
3426 | ||
3427 | /* MSS for SYN-data is based on cached MSS and bounded by PMTU and | |
3428 | * user-MSS. Reserve maximum option space for middleboxes that add | |
3429 | * private TCP options. The cost is reduced data space in SYN :( | |
3430 | */ | |
3541f9e8 ED |
3431 | tp->rx_opt.mss_clamp = tcp_mss_clamp(tp, tp->rx_opt.mss_clamp); |
3432 | ||
1b63edd6 | 3433 | space = __tcp_mtu_to_mss(sk, inet_csk(sk)->icsk_pmtu_cookie) - |
783237e8 YC |
3434 | MAX_TCP_OPTION_SPACE; |
3435 | ||
f5ddcbbb ED |
3436 | space = min_t(size_t, space, fo->size); |
3437 | ||
3438 | /* limit to order-0 allocations */ | |
3439 | space = min_t(size_t, space, SKB_MAX_HEAD(MAX_TCP_HEADER)); | |
3440 | ||
eb934478 | 3441 | syn_data = sk_stream_alloc_skb(sk, space, sk->sk_allocation, false); |
355a901e | 3442 | if (!syn_data) |
783237e8 | 3443 | goto fallback; |
355a901e ED |
3444 | syn_data->ip_summed = CHECKSUM_PARTIAL; |
3445 | memcpy(syn_data->cb, syn->cb, sizeof(syn->cb)); | |
07e100f9 ED |
3446 | if (space) { |
3447 | int copied = copy_from_iter(skb_put(syn_data, space), space, | |
3448 | &fo->data->msg_iter); | |
3449 | if (unlikely(!copied)) { | |
ba233b34 | 3450 | tcp_skb_tsorted_anchor_cleanup(syn_data); |
07e100f9 ED |
3451 | kfree_skb(syn_data); |
3452 | goto fallback; | |
3453 | } | |
3454 | if (copied != space) { | |
3455 | skb_trim(syn_data, copied); | |
3456 | space = copied; | |
3457 | } | |
57be5bda | 3458 | } |
355a901e ED |
3459 | /* No more data pending in inet_wait_for_connect() */ |
3460 | if (space == fo->size) | |
3461 | fo->data = NULL; | |
3462 | fo->copied = space; | |
783237e8 | 3463 | |
355a901e | 3464 | tcp_connect_queue_skb(sk, syn_data); |
0f87230d FY |
3465 | if (syn_data->len) |
3466 | tcp_chrono_start(sk, TCP_CHRONO_BUSY); | |
783237e8 | 3467 | |
355a901e | 3468 | err = tcp_transmit_skb(sk, syn_data, 1, sk->sk_allocation); |
783237e8 | 3469 | |
355a901e | 3470 | syn->skb_mstamp = syn_data->skb_mstamp; |
431a9124 | 3471 | |
355a901e ED |
3472 | /* Now full SYN+DATA was cloned and sent (or not), |
3473 | * remove the SYN from the original skb (syn_data) | |
3474 | * we keep in write queue in case of a retransmit, as we | |
3475 | * also have the SYN packet (with no data) in the same queue. | |
3476 | */ | |
3477 | TCP_SKB_CB(syn_data)->seq++; | |
3478 | TCP_SKB_CB(syn_data)->tcp_flags = TCPHDR_ACK | TCPHDR_PSH; | |
3479 | if (!err) { | |
67da22d2 | 3480 | tp->syn_data = (fo->copied > 0); |
75c119af | 3481 | tcp_rbtree_insert(&sk->tcp_rtx_queue, syn_data); |
f19c29e3 | 3482 | NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPORIGDATASENT); |
783237e8 YC |
3483 | goto done; |
3484 | } | |
783237e8 | 3485 | |
75c119af ED |
3486 | /* data was not sent, put it in write_queue */ |
3487 | __skb_queue_tail(&sk->sk_write_queue, syn_data); | |
b5b7db8d ED |
3488 | tp->packets_out -= tcp_skb_pcount(syn_data); |
3489 | ||
783237e8 YC |
3490 | fallback: |
3491 | /* Send a regular SYN with Fast Open cookie request option */ | |
3492 | if (fo->cookie.len > 0) | |
3493 | fo->cookie.len = 0; | |
3494 | err = tcp_transmit_skb(sk, syn, 1, sk->sk_allocation); | |
3495 | if (err) | |
3496 | tp->syn_fastopen = 0; | |
783237e8 YC |
3497 | done: |
3498 | fo->cookie.len = -1; /* Exclude Fast Open option for SYN retries */ | |
3499 | return err; | |
3500 | } | |
3501 | ||
67edfef7 | 3502 | /* Build a SYN and send it off. */ |
1da177e4 LT |
3503 | int tcp_connect(struct sock *sk) |
3504 | { | |
3505 | struct tcp_sock *tp = tcp_sk(sk); | |
3506 | struct sk_buff *buff; | |
ee586811 | 3507 | int err; |
1da177e4 | 3508 | |
9872a4bd | 3509 | tcp_call_bpf(sk, BPF_SOCK_OPS_TCP_CONNECT_CB); |
8ba60924 ED |
3510 | |
3511 | if (inet_csk(sk)->icsk_af_ops->rebuild_header(sk)) | |
3512 | return -EHOSTUNREACH; /* Routing failure or similar. */ | |
3513 | ||
1da177e4 LT |
3514 | tcp_connect_init(sk); |
3515 | ||
2b916477 AV |
3516 | if (unlikely(tp->repair)) { |
3517 | tcp_finish_connect(sk, NULL); | |
3518 | return 0; | |
3519 | } | |
3520 | ||
eb934478 | 3521 | buff = sk_stream_alloc_skb(sk, 0, sk->sk_allocation, true); |
355a901e | 3522 | if (unlikely(!buff)) |
1da177e4 LT |
3523 | return -ENOBUFS; |
3524 | ||
a3433f35 | 3525 | tcp_init_nondata_skb(buff, tp->write_seq++, TCPHDR_SYN); |
9a568de4 ED |
3526 | tcp_mstamp_refresh(tp); |
3527 | tp->retrans_stamp = tcp_time_stamp(tp); | |
783237e8 | 3528 | tcp_connect_queue_skb(sk, buff); |
735d3831 | 3529 | tcp_ecn_send_syn(sk, buff); |
75c119af | 3530 | tcp_rbtree_insert(&sk->tcp_rtx_queue, buff); |
1da177e4 | 3531 | |
783237e8 YC |
3532 | /* Send off SYN; include data in Fast Open. */ |
3533 | err = tp->fastopen_req ? tcp_send_syn_data(sk, buff) : | |
3534 | tcp_transmit_skb(sk, buff, 1, sk->sk_allocation); | |
ee586811 EP |
3535 | if (err == -ECONNREFUSED) |
3536 | return err; | |
bd37a088 WY |
3537 | |
3538 | /* We change tp->snd_nxt after the tcp_transmit_skb() call | |
3539 | * in order to make this packet get counted in tcpOutSegs. | |
3540 | */ | |
3541 | tp->snd_nxt = tp->write_seq; | |
3542 | tp->pushed_seq = tp->write_seq; | |
b5b7db8d ED |
3543 | buff = tcp_send_head(sk); |
3544 | if (unlikely(buff)) { | |
3545 | tp->snd_nxt = TCP_SKB_CB(buff)->seq; | |
3546 | tp->pushed_seq = TCP_SKB_CB(buff)->seq; | |
3547 | } | |
81cc8a75 | 3548 | TCP_INC_STATS(sock_net(sk), TCP_MIB_ACTIVEOPENS); |
1da177e4 LT |
3549 | |
3550 | /* Timer for repeating the SYN until an answer. */ | |
3f421baa ACM |
3551 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS, |
3552 | inet_csk(sk)->icsk_rto, TCP_RTO_MAX); | |
1da177e4 LT |
3553 | return 0; |
3554 | } | |
4bc2f18b | 3555 | EXPORT_SYMBOL(tcp_connect); |
1da177e4 LT |
3556 | |
3557 | /* Send out a delayed ack, the caller does the policy checking | |
3558 | * to see if we should even be here. See tcp_input.c:tcp_ack_snd_check() | |
3559 | * for details. | |
3560 | */ | |
3561 | void tcp_send_delayed_ack(struct sock *sk) | |
3562 | { | |
463c84b9 ACM |
3563 | struct inet_connection_sock *icsk = inet_csk(sk); |
3564 | int ato = icsk->icsk_ack.ato; | |
1da177e4 LT |
3565 | unsigned long timeout; |
3566 | ||
9890092e FW |
3567 | tcp_ca_event(sk, CA_EVENT_DELAYED_ACK); |
3568 | ||
1da177e4 | 3569 | if (ato > TCP_DELACK_MIN) { |
463c84b9 | 3570 | const struct tcp_sock *tp = tcp_sk(sk); |
056834d9 | 3571 | int max_ato = HZ / 2; |
1da177e4 | 3572 | |
056834d9 IJ |
3573 | if (icsk->icsk_ack.pingpong || |
3574 | (icsk->icsk_ack.pending & ICSK_ACK_PUSHED)) | |
1da177e4 LT |
3575 | max_ato = TCP_DELACK_MAX; |
3576 | ||
3577 | /* Slow path, intersegment interval is "high". */ | |
3578 | ||
3579 | /* If some rtt estimate is known, use it to bound delayed ack. | |
463c84b9 | 3580 | * Do not use inet_csk(sk)->icsk_rto here, use results of rtt measurements |
1da177e4 LT |
3581 | * directly. |
3582 | */ | |
740b0f18 ED |
3583 | if (tp->srtt_us) { |
3584 | int rtt = max_t(int, usecs_to_jiffies(tp->srtt_us >> 3), | |
3585 | TCP_DELACK_MIN); | |
1da177e4 LT |
3586 | |
3587 | if (rtt < max_ato) | |
3588 | max_ato = rtt; | |
3589 | } | |
3590 | ||
3591 | ato = min(ato, max_ato); | |
3592 | } | |
3593 | ||
3594 | /* Stay within the limit we were given */ | |
3595 | timeout = jiffies + ato; | |
3596 | ||
3597 | /* Use new timeout only if there wasn't a older one earlier. */ | |
463c84b9 | 3598 | if (icsk->icsk_ack.pending & ICSK_ACK_TIMER) { |
1da177e4 LT |
3599 | /* If delack timer was blocked or is about to expire, |
3600 | * send ACK now. | |
3601 | */ | |
463c84b9 ACM |
3602 | if (icsk->icsk_ack.blocked || |
3603 | time_before_eq(icsk->icsk_ack.timeout, jiffies + (ato >> 2))) { | |
1da177e4 LT |
3604 | tcp_send_ack(sk); |
3605 | return; | |
3606 | } | |
3607 | ||
463c84b9 ACM |
3608 | if (!time_before(timeout, icsk->icsk_ack.timeout)) |
3609 | timeout = icsk->icsk_ack.timeout; | |
1da177e4 | 3610 | } |
463c84b9 ACM |
3611 | icsk->icsk_ack.pending |= ICSK_ACK_SCHED | ICSK_ACK_TIMER; |
3612 | icsk->icsk_ack.timeout = timeout; | |
3613 | sk_reset_timer(sk, &icsk->icsk_delack_timer, timeout); | |
1da177e4 LT |
3614 | } |
3615 | ||
3616 | /* This routine sends an ack and also updates the window. */ | |
3617 | void tcp_send_ack(struct sock *sk) | |
3618 | { | |
058dc334 | 3619 | struct sk_buff *buff; |
1da177e4 | 3620 | |
058dc334 IJ |
3621 | /* If we have been reset, we may not send again. */ |
3622 | if (sk->sk_state == TCP_CLOSE) | |
3623 | return; | |
1da177e4 | 3624 | |
9890092e FW |
3625 | tcp_ca_event(sk, CA_EVENT_NON_DELAYED_ACK); |
3626 | ||
058dc334 IJ |
3627 | /* We are not putting this on the write queue, so |
3628 | * tcp_transmit_skb() will set the ownership to this | |
3629 | * sock. | |
3630 | */ | |
7450aaf6 ED |
3631 | buff = alloc_skb(MAX_TCP_HEADER, |
3632 | sk_gfp_mask(sk, GFP_ATOMIC | __GFP_NOWARN)); | |
3633 | if (unlikely(!buff)) { | |
058dc334 IJ |
3634 | inet_csk_schedule_ack(sk); |
3635 | inet_csk(sk)->icsk_ack.ato = TCP_ATO_MIN; | |
3636 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK, | |
3637 | TCP_DELACK_MAX, TCP_RTO_MAX); | |
3638 | return; | |
1da177e4 | 3639 | } |
058dc334 IJ |
3640 | |
3641 | /* Reserve space for headers and prepare control bits. */ | |
3642 | skb_reserve(buff, MAX_TCP_HEADER); | |
a3433f35 | 3643 | tcp_init_nondata_skb(buff, tcp_acceptable_seq(sk), TCPHDR_ACK); |
058dc334 | 3644 | |
98781965 ED |
3645 | /* We do not want pure acks influencing TCP Small Queues or fq/pacing |
3646 | * too much. | |
3647 | * SKB_TRUESIZE(max(1 .. 66, MAX_TCP_HEADER)) is unfortunately ~784 | |
98781965 ED |
3648 | */ |
3649 | skb_set_tcp_pure_ack(buff); | |
3650 | ||
058dc334 | 3651 | /* Send it off, this clears delayed acks for us. */ |
7450aaf6 | 3652 | tcp_transmit_skb(sk, buff, 0, (__force gfp_t)0); |
1da177e4 | 3653 | } |
e3118e83 | 3654 | EXPORT_SYMBOL_GPL(tcp_send_ack); |
1da177e4 LT |
3655 | |
3656 | /* This routine sends a packet with an out of date sequence | |
3657 | * number. It assumes the other end will try to ack it. | |
3658 | * | |
3659 | * Question: what should we make while urgent mode? | |
3660 | * 4.4BSD forces sending single byte of data. We cannot send | |
3661 | * out of window data, because we have SND.NXT==SND.MAX... | |
3662 | * | |
3663 | * Current solution: to send TWO zero-length segments in urgent mode: | |
3664 | * one is with SEG.SEQ=SND.UNA to deliver urgent pointer, another is | |
3665 | * out-of-date with SND.UNA-1 to probe window. | |
3666 | */ | |
e520af48 | 3667 | static int tcp_xmit_probe_skb(struct sock *sk, int urgent, int mib) |
1da177e4 LT |
3668 | { |
3669 | struct tcp_sock *tp = tcp_sk(sk); | |
3670 | struct sk_buff *skb; | |
3671 | ||
3672 | /* We don't queue it, tcp_transmit_skb() sets ownership. */ | |
7450aaf6 ED |
3673 | skb = alloc_skb(MAX_TCP_HEADER, |
3674 | sk_gfp_mask(sk, GFP_ATOMIC | __GFP_NOWARN)); | |
51456b29 | 3675 | if (!skb) |
1da177e4 LT |
3676 | return -1; |
3677 | ||
3678 | /* Reserve space for headers and set control bits. */ | |
3679 | skb_reserve(skb, MAX_TCP_HEADER); | |
1da177e4 LT |
3680 | /* Use a previous sequence. This should cause the other |
3681 | * end to send an ack. Don't queue or clone SKB, just | |
3682 | * send it. | |
3683 | */ | |
a3433f35 | 3684 | tcp_init_nondata_skb(skb, tp->snd_una - !urgent, TCPHDR_ACK); |
e2e8009f | 3685 | NET_INC_STATS(sock_net(sk), mib); |
7450aaf6 | 3686 | return tcp_transmit_skb(sk, skb, 0, (__force gfp_t)0); |
1da177e4 LT |
3687 | } |
3688 | ||
385e2070 | 3689 | /* Called from setsockopt( ... TCP_REPAIR ) */ |
ee995283 PE |
3690 | void tcp_send_window_probe(struct sock *sk) |
3691 | { | |
3692 | if (sk->sk_state == TCP_ESTABLISHED) { | |
3693 | tcp_sk(sk)->snd_wl1 = tcp_sk(sk)->rcv_nxt - 1; | |
9a568de4 | 3694 | tcp_mstamp_refresh(tcp_sk(sk)); |
e520af48 | 3695 | tcp_xmit_probe_skb(sk, 0, LINUX_MIB_TCPWINPROBE); |
ee995283 PE |
3696 | } |
3697 | } | |
3698 | ||
67edfef7 | 3699 | /* Initiate keepalive or window probe from timer. */ |
e520af48 | 3700 | int tcp_write_wakeup(struct sock *sk, int mib) |
1da177e4 | 3701 | { |
058dc334 IJ |
3702 | struct tcp_sock *tp = tcp_sk(sk); |
3703 | struct sk_buff *skb; | |
1da177e4 | 3704 | |
058dc334 IJ |
3705 | if (sk->sk_state == TCP_CLOSE) |
3706 | return -1; | |
3707 | ||
00db4124 IM |
3708 | skb = tcp_send_head(sk); |
3709 | if (skb && before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp))) { | |
058dc334 | 3710 | int err; |
0c54b85f | 3711 | unsigned int mss = tcp_current_mss(sk); |
058dc334 IJ |
3712 | unsigned int seg_size = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq; |
3713 | ||
3714 | if (before(tp->pushed_seq, TCP_SKB_CB(skb)->end_seq)) | |
3715 | tp->pushed_seq = TCP_SKB_CB(skb)->end_seq; | |
3716 | ||
3717 | /* We are probing the opening of a window | |
3718 | * but the window size is != 0 | |
3719 | * must have been a result SWS avoidance ( sender ) | |
3720 | */ | |
3721 | if (seg_size < TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq || | |
3722 | skb->len > mss) { | |
3723 | seg_size = min(seg_size, mss); | |
4de075e0 | 3724 | TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_PSH; |
75c119af ED |
3725 | if (tcp_fragment(sk, TCP_FRAG_IN_WRITE_QUEUE, |
3726 | skb, seg_size, mss, GFP_ATOMIC)) | |
058dc334 IJ |
3727 | return -1; |
3728 | } else if (!tcp_skb_pcount(skb)) | |
5bbb432c | 3729 | tcp_set_skb_tso_segs(skb, mss); |
058dc334 | 3730 | |
4de075e0 | 3731 | TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_PSH; |
058dc334 IJ |
3732 | err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC); |
3733 | if (!err) | |
3734 | tcp_event_new_data_sent(sk, skb); | |
3735 | return err; | |
3736 | } else { | |
33f5f57e | 3737 | if (between(tp->snd_up, tp->snd_una + 1, tp->snd_una + 0xFFFF)) |
e520af48 ED |
3738 | tcp_xmit_probe_skb(sk, 1, mib); |
3739 | return tcp_xmit_probe_skb(sk, 0, mib); | |
1da177e4 | 3740 | } |
1da177e4 LT |
3741 | } |
3742 | ||
3743 | /* A window probe timeout has occurred. If window is not closed send | |
3744 | * a partial packet else a zero probe. | |
3745 | */ | |
3746 | void tcp_send_probe0(struct sock *sk) | |
3747 | { | |
463c84b9 | 3748 | struct inet_connection_sock *icsk = inet_csk(sk); |
1da177e4 | 3749 | struct tcp_sock *tp = tcp_sk(sk); |
c6214a97 | 3750 | struct net *net = sock_net(sk); |
fcdd1cf4 | 3751 | unsigned long probe_max; |
1da177e4 LT |
3752 | int err; |
3753 | ||
e520af48 | 3754 | err = tcp_write_wakeup(sk, LINUX_MIB_TCPWINPROBE); |
1da177e4 | 3755 | |
75c119af | 3756 | if (tp->packets_out || tcp_write_queue_empty(sk)) { |
1da177e4 | 3757 | /* Cancel probe timer, if it is not required. */ |
6687e988 | 3758 | icsk->icsk_probes_out = 0; |
463c84b9 | 3759 | icsk->icsk_backoff = 0; |
1da177e4 LT |
3760 | return; |
3761 | } | |
3762 | ||
3763 | if (err <= 0) { | |
c6214a97 | 3764 | if (icsk->icsk_backoff < net->ipv4.sysctl_tcp_retries2) |
463c84b9 | 3765 | icsk->icsk_backoff++; |
6687e988 | 3766 | icsk->icsk_probes_out++; |
fcdd1cf4 | 3767 | probe_max = TCP_RTO_MAX; |
1da177e4 LT |
3768 | } else { |
3769 | /* If packet was not sent due to local congestion, | |
6687e988 | 3770 | * do not backoff and do not remember icsk_probes_out. |
1da177e4 LT |
3771 | * Let local senders to fight for local resources. |
3772 | * | |
3773 | * Use accumulated backoff yet. | |
3774 | */ | |
6687e988 ACM |
3775 | if (!icsk->icsk_probes_out) |
3776 | icsk->icsk_probes_out = 1; | |
fcdd1cf4 | 3777 | probe_max = TCP_RESOURCE_PROBE_INTERVAL; |
1da177e4 | 3778 | } |
fcdd1cf4 | 3779 | inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0, |
21c8fe99 | 3780 | tcp_probe0_when(sk, probe_max), |
fcdd1cf4 | 3781 | TCP_RTO_MAX); |
1da177e4 | 3782 | } |
5db92c99 | 3783 | |
ea3bea3a | 3784 | int tcp_rtx_synack(const struct sock *sk, struct request_sock *req) |
5db92c99 OP |
3785 | { |
3786 | const struct tcp_request_sock_ops *af_ops = tcp_rsk(req)->af_specific; | |
3787 | struct flowi fl; | |
3788 | int res; | |
3789 | ||
58d607d3 | 3790 | tcp_rsk(req)->txhash = net_tx_rndhash(); |
b3d05147 | 3791 | res = af_ops->send_synack(sk, NULL, &fl, req, NULL, TCP_SYNACK_NORMAL); |
5db92c99 | 3792 | if (!res) { |
90bbcc60 | 3793 | __TCP_INC_STATS(sock_net(sk), TCP_MIB_RETRANSSEGS); |
02a1d6e7 | 3794 | __NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPSYNRETRANS); |
7e32b443 YC |
3795 | if (unlikely(tcp_passive_fastopen(sk))) |
3796 | tcp_sk(sk)->total_retrans++; | |
5db92c99 OP |
3797 | } |
3798 | return res; | |
3799 | } | |
3800 | EXPORT_SYMBOL(tcp_rtx_synack); |