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