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